An introduction to mathematical models of coagulation-fragmentation processes: a discrete deterministic mean-field approach

We summarise the properties and the fundamental mathematical results associated with basic models which describe coagulation and fragmentation processes in a deterministic manner and in which cluster size is a discrete quantity (an integer multiple of some basic unit size). In particular, we discuss Smoluchowski's equation for aggregation, the Becker-Döring model of simultaneous aggregation and fragmentation, and more general models involving coagulation and fragmentation.

"The X in balance", a serious game to learn how to solve mathematical equations

(Prefácio) This dissertation is submitted for the degree of Masters (Engenharia Informática) at University of Évora. Under the supervision of Professor Francisco Manuel Gonçalves Coelho, i have selected to work on game design. With the specific period of time and resources, an attempt has been made to make a serious educational game. While writing this thesis, the objective was to describe a math game for solving mathematical equations. Injecting learning factor in a game, is a main concern of this project. The document is about the description of ‘X in Balance’ game. This game provides a platform for school aged students to solve the equations by playing game. It also gives a unique dimension of putting fun and math in a same platform. The document describes full detail on the project. The first chapter gives an introduction about the problem faced by students in doing maths and the learning behavior of a game. It also points out the opportunities that this game might brings and the motivation behind doing this work. It describes the game concept and its genre too. Besides, the second chapter tells state of an art of serous educational game. It defines the concept of serious game and its types. Furthermore, it justifies the flexibility of serious games to adapt all learning styles. The impact of serious games on learning is also mentioned. It also includes the related work of other researchers.

Mathematical analysis of maximum power generated by photovoltaic systems and fitting curves for standard test conditions

The rural electrification is characterized by geographical dispersion of the population, low consumption, high investment by consumers and high cost. Moreover, solar radiation constitutes an inexhaustible source of energy and in its conversion into electricity photovoltaic panels are used. In this study, equations were adjusted to field conditions presented by the manufacturer for current and power of small photovoltaic systems. The mathematical analysis was performed on the photovoltaic rural system I- 100 from ISOFOTON, with power 300 Wp, located at the Experimental Farm Lageado of FCA/UNESP. For the development of such equations, the circuitry of photovoltaic cells has been studied to apply iterative numerical methods for the determination of electrical parameters and possible errors in the appropriate equations in the literature to reality. Therefore, a simulation of a photovoltaic panel was proposed through mathematical equations that were adjusted according to the data of local radiation. The results have presented equations that provide real answers to the user and may assist in the design of these systems, once calculated that the maximum power limit ensures a supply of energy generated. This real sizing helps establishing the possible applications of solar energy to the rural producer and informing the real possibilities of generating electricity from the sun.

Mathematical Programming Models for Influence Maximization on Social Networks

In this dissertation, we apply mathematical programming techniques (i.e., integer programming and polyhedral combinatorics) to develop exact approaches for influence maximization on social networks. We study four combinatorial optimization problems that deal with maximizing influence at minimum cost over a social network. To our knowl- edge, all previous work to date involving influence maximization problems has focused on heuristics and approximation. We start with the following viral marketing problem that has attracted a significant amount of interest from the computer science literature. Given a social network, find a target set of customers to seed with a product. Then, a cascade will be caused by these initial adopters and other people start to adopt this product due to the influence they re- ceive from earlier adopters. The idea is to find the minimum cost that results in the entire network adopting the product. We first study a problem called the Weighted Target Set Selection (WTSS) Prob- lem. In the WTSS problem, the diffusion can take place over as many time periods as needed and a free product is given out to the individuals in the target set. Restricting the number of time periods that the diffusion takes place over to be one, we obtain a problem called the Positive Influence Dominating Set (PIDS) problem. Next, incorporating partial incentives, we consider a problem called the Least Cost Influence Problem (LCIP). The fourth problem studied is the One Time Period Least Cost Influence Problem (1TPLCIP) which is identical to the LCIP except that we restrict the number of time periods that the diffusion takes place over to be one. We apply a common research paradigm to each of these four problems. First, we work on special graphs: trees and cycles. Based on the insights we obtain from special graphs, we develop efficient methods for general graphs. On trees, first, we propose a polynomial time algorithm. More importantly, we present a tight and compact extended formulation. We also project the extended formulation onto the space of the natural vari- ables that gives the polytope on trees. Next, building upon the result for trees---we derive the polytope on cycles for the WTSS problem; as well as a polynomial time algorithm on cycles. This leads to our contribution on general graphs. For the WTSS problem and the LCIP, using the observation that the influence propagation network must be a directed acyclic graph (DAG), the strong formulation for trees can be embedded into a formulation on general graphs. We use this to design and implement a branch-and-cut approach for the WTSS problem and the LCIP. In our computational study, we are able to obtain high quality solutions for random graph instances with up to 10,000 nodes and 20,000 edges (40,000 arcs) within a reasonable amount of time.

Zig-zagging in geometrical reasoning in technological collaborative environments: a Mathematical Working Space-framed study concerning cognition and affect

This study highlights the importance of cognition-affect interaction pathways in the construction of mathematical knowledge. Scientific output demands further research on the conceptual structure underlying such interaction aimed at coping with the high complexity of its interpretation. The paper discusses the effectiveness of using a dynamic model such as that outlined in the Mathematical Working Spaces (MWS) framework, in order to describe the interplay between cognition and affect in the transitions from instrumental to discursive geneses in geometrical reasoning. The results based on empirical data from a teaching experiment at a middle school show that the use of dynamic geometry software favours students’ attitudinal and volitional dimensions and helps them to maintain productive affective pathways, affording greater intellectual independence in mathematical work and interaction with the context that impact learning opportunities in geometric proofs. The reflective and heuristic dimensions of teacher mediation in students’ learning is crucial in the transition from instrumental to discursive genesis and working stability in the Instrumental-Discursive plane of MWS.

Risk management for mathematical optimization under uncertainty

We present a general multistage stochastic mixed 0-1 problem where the uncertainty appears everywhere in the objective function, constraints matrix and right-hand-side. The uncertainty is represented by a scenario tree that can be a symmetric or a nonsymmetric one. The stochastic model is converted in a mixed 0-1 Deterministic Equivalent Model in compact representation. Due to the difficulty of the problem, the solution offered by the stochastic model has been traditionally obtained by optimizing the objective function expected value (i.e., mean) over the scenarios, usually, along a time horizon. This approach (so named risk neutral) has the inconvenience of providing a solution that ignores the variance of the objective value of the scenarios and, so, the occurrence of scenarios with an objective value below the expected one. Alternatively, we present several approaches for risk averse management, namely, a scenario immunization strategy, the optimization of the well known Value-at-Risk (VaR) and several variants of the Conditional Value-at-Risk strategies, the optimization of the expected mean minus the weighted probability of having a "bad" scenario to occur for the given solution provided by the model, the optimization of the objective function expected value subject to stochastic dominance constraints (SDC) for a set of profiles given by the pairs of threshold objective values and either bounds on the probability of not reaching the thresholds or the expected shortfall over them, and the optimization of a mixture of the VaR and SDC strategies.

Chebanov law and Vakar formula in mathematical models of complex systems

Ecological models written in a mathematical language L(M) or model language, with a given style or methodology can be considered as a text. It is possible to apply statistical linguistic laws and the experimental results demonstrate that the behaviour of a mathematical model is the same of any literary text of any natural language. A text has the following characteristics: (a) the variables, its transformed functions and parameters are the lexic units or LUN of ecological models; (b) the syllables are constituted by a LUN, or a chain of them, separated by operating or ordering LUNs; (c) the flow equations are words; and (d) the distribution of words (LUM and CLUN) according to their lengths is based on a Poisson distribution, the Chebanov's law. It is founded on Vakar's formula, that is calculated likewise the linguistic entropy for L(M). We will apply these ideas over practical examples using MARIOLA model. In this paper it will be studied the problem of the lengths of the simple lexic units composed lexic units and words of text models, expressing these lengths in number of the primitive symbols, and syllables. The use of these linguistic laws renders it possible to indicate the degree of information given by an ecological model.

A logic-mathematical point of view of the truth: Reality, perception, and language

In this article, the authors propose a theory of the truth value of propositions from a logic-mathematical point of view. The work that the authors present is an attempt to address this question from an epistemological, linguistic, and logical-mathematical point of view. What is it to exist and how do we define existence? The main objective of this work is an approach to the first of these questions. We leave a more thorough treatment of the problem of existence for future works.

Ideological Complex Systems: Mathematical Theory

The goal of this article is to build an abstract mathematical theory rather than a computational one of the process of transmission of ideology. The basis of much of the argument is Patten's Environment Theory that characterizes a system with its double environment (input or stimulus and output or response) and the existing interactions among them. Ideological processes are semiotic processes, and if in Patten's theory, the two environments are physical, in this theory ideological processes are physical and semiotic, as are stimulus and response.

Mathematical-modelling simulation of red gum lerp psyllid Glycaspis brimblecombei population dynamics towards the strategy identification for biological control with its parasitoid Psyllaephagus bliteus.

2009

Developing primary pre-service teachers' mathematical content knowledge during practicum teaching

While it is recognised that a teachers' mathematical content knowledge (MCK) is crucial for teaching, less is known about when different categories of MCK develop during teacher education. This paper reports on two primary pre-service teachers, whose MCK was investigated during their practicum experiences in first, second and fourth years of a four-year Bachelor of Education program. The results identify when and under what conditions pre-service teachers' developed different categories of their MCK during practicum. Factors that assisted pre-service teachers to develop their MCK included program structure providing breadth and depth of experiences; sustained engagement for learning MCK; and quality of pre-service teachers' learning experiences.

Mapping variation in children’s mathematical reasoning: the case of ‘what else belongs?’

Explaining appears to dominate primary teachers’ understanding of mathematical reasoning when it is not confused with problem solving. Drawing on previous literature of mathematical reasoning, we generate a view of the critical aspects of reasoning that may assist primary teachers when designing and enacting tasks to elicit and develop mathematical reasoning. The task used in this study of children’s reasoning is a number commonality problem. We analysed written and verbal samples of reasoning gathered from children in grades 3 and 4 from three primary schools in Australia and one elementary school in Canada to map the variation in their reasoning. We found that comparing and contrasting was a critical aspect of forming conjectures when generalising in this context, an action not specified in frameworks for generalising in early algebra. The variance in children’s reasoning elicited through this task also illuminated the difference between explaining and justifying.

Mathematical modelling of linear motion error for Hexarot parallel manipulators

Hexarot is a robotic manipulator that belongs to the family of axis symmetric parallel mechanisms. The robot is able to move the robot platform or tool center point in six degrees of freedom (DOF). This paper presents the kinematics model of the robot including the inverse and forward kinematics, and its time derivatives. Then using the kinematics formulations, investigation of the nonlinear motion of the Hexarot robot for a desired linear motion path is performed. For this purpose, the concept of curvature of the robot path is used for measuring the nonlinearity of the actual motion of the robot. The nonlinear motion error of the robot is analyzed for the scenario where the platform moves on a linear path between two arbitrary points of the robot workspace. The effects of different parameters on the nonlinear motion error of the mechanism are demonstrated and strategies for motions with low error values are proposed.