Inclusion of carbon nanotubes in a TiO2 sol-gel matrix

We report here the successful inclusion of carbon nanotubes (CNs) into a TiO₂ matrix prepared by a sol-gel method. The presence of CNs in the sol-gel matrix and the structure of the film were analyzed principally by transmission electron microscopy. Complementary information about the behavior of embedded carbon nanotubes versus heat treatment and ion irradiation were obtained by X-ray photoelectron spectroscopy. The elaboration of an inorganic matrix containing embedded carbon nanotubes leads to a new nanocomposite. The possible applications of this nanocomposite are discussed.     

Effect of trapping centers of luminescent properties of bismuth orthogermanate

Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 54, No. 6, pp. 970–975, June, 1991.     

Magnetic charge type equations from torsion

It is shown that torsion can be built from two independent vector fields, and that these vector fields obey, for the Lagrangian chosen, the equations of electromagnetism with magnetic charge from the two photon formalism. The equation of motion follows from the Bianchi identity ofU ₄ spacetime, and finally the interpretation of these fields is discussed.     

Randomized greedy matching

We consider a randomized version of the greedy algorithm for finding a large matching in a graph. We assume that the next edge is always randomly chosen from those remaining. We analyze the performance of this algorithm when the input graph is fixed. We show that there are graphs for which this Randomized Greedy Algorithm (RGA) usually only obtains a matching close in size to that guaranteed by worst-case analysis (i.e., half the size of the maximum). For some classes of sparse graphs (e.g., planar graphs and forests) we show that the RGA performs significantly better than the worst-case. Our main theorem concerns forests. We prove that the ratio to maximum here is at least 0.7690…, and that this bound is tight.     

Fluorescence spectra of different configurations of the diphenyl molecule in solid paraffin solutions

Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 51, No. 2, pp. 212–217, August, 1989.     

Positive definite functions on the Heisenberg group

Work supported in part by the NSF     

A Recursive Algorithm for Order Cycle-time that Minimizes Logistics Cost

A firm's logistics cost, including shipping and inventory-carrying, is a substantial percentage of its sales. Nevertheless, typical inventory-control methods ignore or insufficiently represent the shipping cost. This paper describes a recursive algorithm that determines the reorder cycle-time that minimizes total logistics cost. It allows for a realistic accounting of shipping cost, which is modelled here as a function of shipping distance and weight. The algorithm uses a relaxation procedure to identify a suitable initial approximation to the optimal order cycle-time and then, through a series of recursive steps, moves to the optimal result. We demonstrate the algorithm with a single item, with a group of items that share a common order cycle, and with multi-items when item demands are random variables. Experience with this algorithm indicates that it converges to the optimal result in a very few steps.     

A Language for Teaching Discrete-event Simulation

Courses which teach discrete-event simulation are based on many different simulation languages. The requirements for a language to support teaching simulation are discussed. In particular, it is recommended that such languages separate into distinct modules those aspects of simulation which are taught as separate topics. Implementation of the separation is discussed. The SEESIM language, developed as a teaching aid, is described, and examples of its use are given. Straightforward use of SEESIM can be learned quickly, yet the language provides facilities for a staged introduction to advanced concepts of simulation.     

Absence of shocks in an initially dilute collisionless plasma

The Cauchy Problem for the relativistic Vlasov-Maxwell equations is studied in three space dimensions. It is assumed that the initial data satisfy the required constraints and have compact support. If in addition the data have sufficiently smallC ² norm, then a uniqueC ¹ solution to this system is shown to exist on all of spacetime.Research supported in part by NSF DMS 85-20662 and NSF DMS 84-20957