A few pedagogical designs in linear algebra with Cabri and Maple

Since the 90’s, with the creation of new electronic environments for learning and teaching, several research groups in Mathematics Education have been emerging and developing. This article elaborates few pedagogical designs in Linear Algebra supported by both the geometrical micro-world Cabri and the computer algebra system Maple. Stumbling blocks in the learning of Linear Algebra are examined, more exactly linear transformations, eigenvectors, quadratic forms, conics with changes of bases and finally singular values. Encountering a special group of students very eager to explore the world of linear algebra, we initiated a classification of linear transformations of the Euclidean plane R² via ellipses.     

Justifying and Proving in the Cabri Environment

This paper describes a long term teaching experiment carried out with students from the 9th–10th grades. Geometrical constructions in the Cabri environment were selected as a specific field of experience, within which the sense of theory may emerge. The idea of construction constitutes the key to accessing the idea of theorem, moving from a generic idea of justification towards the idea of validating within a geometrical system. The study aims at clarifying the role of the Cabri environment in this teaching-learning processes: analysis of protocols shows the possible evolution of a justification into a proof but at the same time indicates that this evolution is not expected to be simple and spontaneous.This revised version was published online in September 2005 with corrections to the Cover Date.     

Archimedes with Cabri: Visualization and Experimental Verification of Mathematical Ideas

This column will publish short (from just a few paragraphs to ten or so pages), lively and intriguing computer-related mathematics vignettes. These vignettes or snapshots should illustrate ways in which computer environments have transformed the practice of mathematics or mathematics pedagogy. They could also include puzzles or brain-teasers involving the use of computers or computational theory. Snapshots are subject to peer review. This snapshot explores a classic geometry theorem of Archimedes. The author shows how the use of a dynamic geometry environment can deepen and guide the process of proof. The Cabri environment enabled exploration in a new way that connected steps in the proof to geometric properties and intuitions that served as a foundation for deductive reasoning. Computer Math Snapshots Editor: Uri Wilensky , Center for Connected Learning and Computer-Based Modeling Northwestern University, USA E-mail: uri@northwestern.edu     

Time-cost trade-off analysis of project networks in fuzzy environments

This paper proposes a novel approach for time-cost trade-off analysis of a project network in fuzzy environments. Different from the results of previous studies, in this paper the membership function of the fuzzy minimum total crash cost is constructed based on Zadeh’s extension principle and fuzzy solutions are provided. A pair of two-level mathematical programs parameterized by possibility level α is formulated to calculate the lower and upper bounds of the fuzzy minimum total crash cost at α. By enumerating different values of α, the membership function of the fuzzy minimum total crash cost is constructed, and the corresponding optimal activity time for each activity is also obtained at the same time. An example of time-cost trade-off problem with several fuzzy parameters is solved successfully to demonstrate the validity of the proposed approach. Since the minimum total crash cost is expressed by a membership function rather than by a crisp value, the fuzziness of parameters is conserved completely, and more information is provided for time-cost trade-off analysis in project management. The proposed approach also can be applied to time-cost trade-off problems with other characteristics.     

Steady-state skill levels of workers in learning and forgetting environments: A dynamical system analysis

This article presents a study on the long-term (i.e., steady-state, convergence) characteristics of workers’ skill levels under learning and forgetting in processing units in a manufacturing environment, in which products are produced in batches. Assuming that all workers already have the basic knowledge to execute the jobs, workers learn (accumulate their skill) while producing units within a batch, forget during interruptions in production, and relearn when production resumes. The convergence properties in the paper are examined under assumptions of an infinite time horizon, a constant demand rate, and a fixed lot size. Our work extends the steady-state results of Teyarachakul, Chand, and Ward (2008) to the learning and forgetting functions that belong to a large class of functions possessing some differentiability conditions. We also discuss circumstances of manufacturing environments where our results would provide useful managerial information and other potential applications.     

Multiscale analysis of exit distributions for random walks in random environments

We present a multiscale analysis for the exit measures from large balls in , of random walks in certain i.i.d. random environments which are small perturbations of the fixed environment corresponding to simple random walk. Our main assumption is an isotropy assumption on the law of the environment, introduced by Bricmont and Kupiainen. Under this assumption, we prove that the exit measure of the random walk in a random environment from a large ball, approaches the exit measure of a simple random walk from the same ball, in the sense that the variational distance between smoothed versions of these measures converges to zero. We also prove the transience of the random walk in random environment. The analysis is based on propagating estimates on the variational distance between the exit measure of the random walk in random environment and that of simple random walk, in addition to estimates on the variational distance between smoothed versions of these quantities. Partially supported by NSF grant DMS-0503775.     

Khayyam with Cabri: experiences of pre-service mathematics teachers with Khayyam's solution of cubic equations in dynamic geometry environment

The study reported in this article deals with the observed actionsof Turkish pre-service mathematics teachers in dynamic geometryenvironment (DGE) as they were learning Khayyam's method forsolving cubic equations formed as x³ + ax = b. Having learnedthe method, modelled it in DGE and verified the correctnessof the solution, students generated their own methods for solvingdifferent types of cubic equations such as x³ + ax² = b andx³ + a = bx in the light of Khayyam's method. With the presentedteaching experiment, students realized that Khayyam's mathematicsis different from theirs. We consider that this gave them anopportunity to have an insight about the cultural and socialaspects of mathematics. In addition, the teaching experimentshowed that dynamic geometry software is an excellent tool fordoing mathematics because of their dynamic nature and accurateconstructions. And, it can be easily concluded that the historyof mathematics is useful resource for enriching mathematicslearning environment.     

A mathematical model for fungal development in heterogeneous environments

A mathematical model for the development of fungal mycelia in heterogeneous environmental conditions is presented. The validity of this model is tested by comparison of numerical simulations with experimental observations.     

Designing a duo of material and digital artifacts: the pascaline and Cabri Elem e-books in primary school mathematics

This paper focuses on a duo of artifacts, constituted by a physical artifact and its digital counterpart. It deals with the theoretically and empirically underpinned design process of the digital artifact, the e-pascaline developed with Cabri Elem technology, in reference to a physical artifact, the pascaline. The theoretical frameworks of the instrumental approach and the theory of semiotic mediation together with the analysis of teaching experiments with the pascaline support the design in terms of continuity and discontinuity between the two artifacts. The components of the digital artifact were chosen from among the components of the physical artifact that are the object of instrumental genesis by the students and that are analyzed as having a semiotic potential that contributes to didactical aims. Components instrumented by students which had inadequate semiotic potential were eliminated. With the resulting duo, each artifact adds value to the use of the other artifact for mathematical learning.     

A formal apparatus for modeling trust in computing environments

Recent research in computer systems security has evolved into trust issues, which are now becoming an important topic. The majority of approaches for trust modeling addressed trust by actually focusing on security, and some of them addressed also trust as such. This paper presents a formal apparatus that concentrates on trust as such. It is flexible enough to accommodate the driving factors behind trust and consequently different trust-focused methodologies and technologies. The basic goal of the work presented in this paper is the definition of qualitative trust modeling methodology for trust management in contemporary computing environments that efficiently complements existing quantitative methodologies. Further, an open conceptual model for trust management is presented that accommodates various qualitative and quantitative trust management methodologies. This model has also been implemented in the web services environment, and this is discussed in this paper as well.     

A cognitive model of spatial path-planning

Planning a path to a destination, given a number of options and obstacles, is a common task. We suggest a two-component cognitive model that combines retrieval of knowledge about the environment with search guided by visual perception. In the first component, subsymbolic information, acquired during navigation, aids in the retrieval of declarative information representing possible paths to take. In the second component, visual information directs the search, which in turn creates knowledge for the first component. The model is implemented using the ACT-R cognitive architecture and makes realistic assumptions about memory access and shifts in visual attention. We present simulation results for memory-based high-level navigation in grid and tree structures, and visual navigation in mazes, varying relevant cognitive (retrieval noise and visual finsts) and environmental (maze and path size) parameters. The visual component is evaluated with data from a multi-robot control experiment, where subjects planned paths for robots to explore a building. We describe a method to compare trajectories without referring to aligned points in the itinerary. The evaluation shows that the model provides a good fit, but also that planning strategies may vary with task loads.     

Stochastic chemo-physical-mechanical degradation analysis on hydrated cement under acidic environments

The accumulation of material degradation under contact with aggressive aqueous environments could lead to reduced structural reliability. In terms of hydrated cementitious materials, such interactions often result in the chemo-physical-mechanical (CPM) degradation, which represents a multiphysics process of high non-linearity and complexity. By further considering the inevitable uncertainties associated with both the materials and the serving conditions, solving such a process requires novel probabilistic approaches. This paper presents a stochastic chemo-physical-mechanical (SCPM) degradation analysis on the hydrated cement under acidic environment. The SCPM analysis consists of modelling the stochastic chemophysical degradation by finite element method, and assessing the mechanical deterioration through analytical micromechanics. The proposed modelling framework couples the conventional Monte Carlo Simulation with a novel support vector regression algorithm. The present method is able to not only address the detailed degradation mechanisms, but also ensure low computational costs for an accurate SCPM degradation assessment.     

Theory and application of perceptual positions to data collection and analysis in military environments

We describe a novel approach to planning and interpretation of data collection activities in military environments, based on the notions of perceptual positions of self, other and detached observer when viewing the same event. We have reinterpreted the results of previous field experiments involving the introduction of advanced equipment as part of soldier modernisation and believe that we now have a better understanding of why some attempts at data collection were not as successful as others. We propose a protocol based on the Army Practitioner providing first position data (subjective), the Analyst Observer and instrumentation providing third position data (objective) and the Subject Matter Adviser giving second position data (speculative). Although there is often a focus on first and third position data during field trials, second position data enables extrapolation to other contexts. This is especially important for exploratory studies investigating future concepts. Taken together, the combination of the three positions leads to a better strategy to enhance data collection of complex military systems.     

A random walk with a branching system in random environments

We consider a branching random walk in random environments, where the particles are reproduced as a branching process with a random environment (in time), and move independently as a random walk on Z with a random environment (in locations). We obtain the asymptotic properties on the position of the rightmost particle at time n, revealing a phase transition phenomenon of the system.     

A mathematical model for personalized advertisement in virtual reality environments

We consider a personalized advertisement assignment problem faced by the manager of a virtual reality environment. In this online environment, users log in/out, and they spend time in different virtual locations while they are online. Every time a user visits a new virtual location, the site manager can show the ad of an advertiser. At the end of a fixed time horizon, the manager collects revenues from all of the advertisers, and the total revenue depends on the number of ads of different advertisers she displays to different users. In this setup, the objective of the manager is to find an optimal dynamic ad display policy in order to maximize her expected revenue. In the current paper, we formulate this problem as a continuous time stochastic optimization problem in which the actions of users are represented with two-state Markov processes and the manager makes display decisions at the transition times of these processes. To our best knowledge, no formal stochastic model and rigorous analysis has been given for this practical problem. Such a model and its analysis are the major contributions of this paper along with an optimal solution.     

Proactive data envelopment analysis: Effective production and capacity expansion in stochastic environments

Demand fluctuations that cause variations in output levels will affect a firm’s technical inefficiency. To assess this demand effect, a demand-truncated production function is developed and an “effectiveness” measure is proposed. Often a firm can adjust some input resources influencing the output level in an attempt to match demand. We propose a short-run capacity planning method, termed proactive data envelopment analysis, which quantifies the effectiveness of a firm’s production system under demand uncertainty. Using a stochastic programming DEA approach, we improve upon short-run capacity expansion planning models by accounting for the decreasing marginal benefit of inputs and estimating the expected value of effectiveness, given demand. The law of diminishing marginal returns is an important property of production function; however, constant marginal productivity is usually assumed for capacity expansion problems resulting in biased capacity estimates. Applying the proposed model in an empirical study of convenience stores in Japan demonstrates the actionable advice the model provides about the levels of variable inputs in uncertain demand environments. We conclude that the method is most suitable for characterizing production systems with perishable goods or service systems that cannot store inventories.     

Stability and bifurcation analysis of a delayed predator-prey model of prey dispersal in two-patch environments

In this paper, a class of delayed predator-prey model of prey dispersal in two-patch environments is considered. By analyzing the associated characteristic transcendental equation, its linear stability is investigated and Hopf bifurcation is demonstrated. Some explicit formulae determining the stability and the direction of the Hopf bifurcation periodic solutions bifurcating from Hopf bifurcations are obtained by using the normal form theory and center manifold theory. Some numerical simulation for justifying the theoretical analysis are also provided. Finally, biological explanations and main conclusions are given.     

A mathematical programming-based scheduling framework for multitasking environments

A new paradigm along with a mixed (binary) integer-linear programming model is developed for scheduling tasks in multitasking environments, for which the number of completed tasks is not a good measure. One special case falls into the realm of deteriorating jobs. Polynomial time optimal solution algorithms are presented for this and one other special case. As the complexity of the original problem is believed to be strongly NP-hard, an efficient solution algorithm, based on tabu search, is developed to solve the problem. Small, medium, and large size problems are solved, and the solution obtained from the algorithm is compared with that of the optimal solution or the upper bound found from using the Lagrangian relaxation. Where it was measurable, the search algorithm gave quantifiably good quality solutions, and in all cases it had a much better time efficiency than the branch-and-bound enumeration method. A detailed statistical experiment, based on the split-plot design, is developed to identify the characteristics of the tabu search algorithm, thus guaranteeing a solution that is significantly better in quality. A conjecturing technique is introduced for problems with very large planning horizons. This technique had remarkable time efficiency with no apparent loss of quality.