What are We Developing? A Case Study of a College Mathematics Program

Over one‐third of all college mathematics enrollments are in courses considered to be developmental. While such courses have been the subject of a large body of research, one question that seems not to have been studied empirically is the alignment of the content of developmental and college level mathematics courses. This paper gives the results of such a study, conducted at a medium sized public liberal arts university. While the content of the developmental mathematics courses was used subsequently in the Precalculus course, most of the content of the Intermediate Algebra course was not used in other college level mathematics courses. It is hoped that the results of this paper will serve as a catalyst for other institutions to examine carefully and define the mission of both their developmental and college level mathematics courses.     

Emergence of self-replicating structures in a cellular automata space

Past cellular automata models of self-replication have always been initialized with an original copy of the structure that will replicate, and have been based on a transition function that only works for a single, specific structure. This article demonstrates for the first time that it is possible to create cellular automata models in which a self-replicating structure emerges from an initial state having a random density and distribution of individual components. These emergent self-replicating structures employ a fairly general rule set that can support the replication of structures of different sizes and their growth from smaller to larger ones. This rule set also allows “random” interactions of self-replicating structures with each other and with other structures within the cellular automata space. Systematic simulations show that emergence and growth of replicants occurs often and is essentially independent of the cellular space size, initial random pattern of components, and initial density of components, over a broad range of these parameters. The number of replicants and the total number of components they incorporate generally approach quasi-stable values with time.     

Translation planes of large dimension admitting nonsolvable groups

In this article, the question is considered whether there exist finite translation planes with arbitrarily small kernels admitting nonsolvable collineation groups. For any integerN, it is shown that there exist translation planes of dimension >N and orderq ³ admittingGL(2,q) as a collineation group.     

Quantitative Impact of a Cognitive Modeling Intelligent Tutoring System on Student Performance in Balancing Chemical Equations

The need for improved interactive tutoring capabilities in educational software for chemistry problem solving is an important one clearly articulated by teachers and students. To deliver the next generation of individualized interactive capabilities users demand, it is necessary to go beyond the conventional computer-assisted instruction methodology. The focus of this paper is the assessment with first-semester general chemistry students of a recently developed artificial intelligence (AI) tutor for balancing chemical equations. This is the first such assessment of an AI-based learning tool in chemistry. Students in CHEM 121 in the Fall 2001 semester at Duquesne University (N = 273) participated in the study. Students were divided into a test group that used the AI tutor as part of their study activities and a control group that did not use the tutor. It was found that the tutor improved the performance of the test group students to a statistically significant degree, helping the weakest students the most. This study establishes the feasibility of an AI-based approach to creating advanced new tutoring software for chemistry problem solving. Access to a Web-based demonstration of the equation-balancing tutor may be obtained by emailing the corresponding author.     

A graph-theoretic approach to modeling metabolic pathways

Summary The metabolic pathways of medazepam, oxazepam, and diazepam were modeled using graph-theoretic transforms which are incorporable into computer-assisted metabolic analysis programs. The information, represented in the form of a graph-theoretic transform kit, which was obtained from these pathways was then used to predict the metabolites of other benzodiazepine compounds. The transform kits gave statistically significant predictions with respect to a statistical method for evaluating the performance of the transform kits.     

Fairness in Scheduling

On-line machine scheduling has been studied extensively, but the fundamental issue of fairness in scheduling is still mostly open. In this paper we explore the issue in settings where there are long-lived processes which should be repeatedly scheduled for various tasks throughout the lifetime of a system. For any such instance we develop a notion ofdesiredload of a process, which is a function of the tasks it participates in. Theunfairnessof a system is the maximum, taken over all processes, of the difference between the desired load and the actual load.An example of such a setting is thecarpool problemsuggested by Fagin and Williams [IBM Journal of Research and Development27(2) (1983), 133–139]. In this problem, a set ofnpeople form a carpool. On each day a subset of the people arrive and one of them is designated as the driver. A scheduling rule is required so that the driver will be determined in a “fair” way.We investigate this problem under various assumptions on the input distribution. We also show that the carpool problems can capture several other problems of fairness in scheduling.