An optimization approach for planning daily drayage operations

Daily drayage operations involve moving loaded or empty equipment between customer locations and rail ramps. Our goal is to minimize the cost of daily drayage operations in a region on a given day. Drayage orders are generally pickup and delivery requests with time windows. The repositioning of empty equipment may also be required in order to facilitate loaded movements. The drayage orders are satisfied by a heterogeneous fleet of drivers. Driver routes must satisfy various operational constraints. We present an optimization methodology for finding cost-effective schedules for regional daily drayage operations. The core of the formulation is a set partitioning model whose columns represent routes. Routes are added to the formulation by column generation. We present numerical results for real-world data which demonstrate that our methodology produces low cost solutions in a reasonably short time.     

Uniqueness of the group topology of some homeomorphism groups

In this paper, we generalize a theorem of Kallman [2, Theorem 1.1] and we resolve the unsettled case there.     

Preservice Elementary Teachers' Use of Mathematics in a Project‐Based Science Approach

The use of a project‐based science (PBS) approach to teaching encourages students to integrate mathematics and science in meaningful ways as they create projects. As a beginning study of how students use mathematics in such an approach, an analysis of 23 projects developed by preservice elementary teachers enrolled in an elementary science course was conducted. Findings showed that students made a number of different types of mathematical errors and underutilized data representation and summary forms. Implications included the importance of developing methods for supporting the use of mathematical tools in utilizing a project‐based approach and considering ways that such tools mediate scientific thinking.     

Chelate polymers: II. Some novel transition metals complexes with azomethine‐containing siloxanes and their polyesters

New Schiff bases of 2,4‐dihydroxybenzaldehyde with siloxane‐α,ω‐diamines having different numbers of siloxane units in the chain have been synthesized and characterized by spectroscopy, elemental and thermal analyses. These azomethines were found to form complexes readily with copper(II), nickel(II), cobalt(II), cadmium(II) and zinc(II). From IR and UV–Vis studies, the phenolic oxygen and imine nitrogen of the ligand were found to be the coordination sites. Thermogravimetric analysis (TGA) data indicate the chelates to be more stable than the corresponding ligands. The melting points increase with shortening of the siloxane segment from azomethine, as well as the result of complexation. The chelates obtained were covalently inserted in polymeric linear structures by polycondensation through the OH‐difunctionalized ligand with 1,3‐bis(carboxypropyl)tetramethyldisiloxane. Direct polycondensation, assisted either by acetic anhydride or N,N′‐dicyclohexylcarbodiimide as dehydrating agent and the complex 4‐(dimethylamino)pyridinium 4‐toluenesulfonate as catalyst, was used for the synthesis of these compound types. The structures of the polymers obtained were confirmed by IR, UV and ¹H NMR. Characterization was undertaken by TGA, solubility tests and viscosity measurements. Copyright © 2003 John Wiley & Sons, Ltd.     

Evolution of the high power THz source program at Jefferson Lab

We report the evolution of the high power THz source program at Jefferson Lab. The source is based on coherent synchrotron radiation in which short bunches of relativistic electrons radiate when traversing a dipolar magnetic field. In our first accelerator we produced 20 W of broadband THz light. Our upgraded accelerator with higher current and improved THz extraction optics will considerably enhance the output power to >100 W. In this paper we describe the source in some detail and present theoretical calculations for the upgrade.     

Stationary Distributions of GI/M/c Queue with PH Type Vacations

We study a GI/M/c type queueing system with vacations in which all servers take vacations together when the system becomes empty. These servers keep taking synchronous vacations until they find waiting customers in the system at a vacation completion instant.The vacation time is a phase-type (PH) distributed random variable. Using embedded Markov chain modeling and the matrix geometric solution methods, we obtain explicit expressions for the stationary probability distributions of the queue length at arrivals and the waiting time. To compare the vacation model with the classical GI/M/c queue without vacations, we prove conditional stochastic decomposition properties for the queue length and the waiting time when all servers are busy. Our model is a generalization of several previous studies.     

Limits of tangents and minimality of complex links

We show that the complex link of a large class of space germs (X,x₀) is characterized by its “simplicity”, among the Milnor fibres of functions with isolated singularity on X. This amounts to the minimality of the Milnor number, whenever this number is defined. Such a phenomenon has been first pointed out in case (X,x₀) is an isolated hypersurface singularity, by Teissier (Cycles évanescents, sections planes et conditions de Whitney, in: Singularités à Cargèse 1972, Asterisque, Nos. 7 et 8, Soc. Math. France, Paris, 1973, pp. 285-362).