The complexity of cutting complexes

This paper investigates the combinatorial and computational aspects of certain extremal geometric problems in two and three dimensions. Specifically, we examine the problem of intersecting a convex subdivision with a line in order to maximize the number of intersections. A similar problem is to maximize the number of intersected facets in a cross-section of a three-dimensional convex polytope. Related problems concern maximum chains in certain families of posets defined over the regions of a convex subdivision. In most cases we are able to prove sharp bounds on the asymptotic behavior of the corresponding extremal functions. We also describe polynomial algorithms for all the problems discussed.Bernard Chazelle wishes to acknowledge the National Science Foundation for supporting this research in part under Grant No. MCS83-03925. Herbert Edelsbrunner is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862.     

Rotating Charge Coupled to the Maxwell Field: Scattering Theory and Adiabatic Limit

We consider a spinning charge coupled to the Maxwell field. Through the appropriate symmetry in the initial conditions the charge remains at rest. We establish that any time-dependent finite energy solution converges to a sum of a soliton wave and an outgoing free wave. The convergence holds in global energy norm. Under a small constant external magnetic field the soliton manifold is stable in local energy seminorms and the evolution of the angular velocity is guided by an effective finite-dimensional dynamics. The proof uses a non-autonomous integral inequality method.     

Corn stover fractions and bioenergy

Information is presented on structure, composition, and response to enzymes of corn stover related to barriers for bioconversion to ethanol. Aromatic compounds occurred in most tissue cell walls. Ferulic acid esterase treatment before cellulase treatment significantly improved dry weight loss and release of phenolic acids and sugars in most fractions over cellulase alone. Leaf fractions were considerably higher in dry weight loss and released sugars with esterase treatment, but stem pith cells gave up the most phenolic acids. Results help identify plant fractions more appropriate for coproducts and bioconversion and those more suitable as residues for soil erosion control.     

A Genetic Algorithm for Solving a Capacitated p-Median Problem

Facility-location problems have several applications, such as telecommunications, industrial transportation and distribution. One of the most well-known facility-location problems is the p-median problem. This work addresses an application of the capacitated p-median problem to a real-world problem. We propose a genetic algorithm (GA) to solve the capacitated p-median problem. The proposed GA uses not only conventional genetic operators, but also a new heuristic “hypermutation” operator suggested in this work. The proposed GA is compared with a tabu search algorithm.     

An eulerian trail traversing specified edges in given order

The following results are proved in this paper. Let G be a 2k-edge-connected eulerian graph. (i) For every set {e₁, e₂, ?, e_2k+1} ? E(G) there is an eulerian trail T of the form e₁, e₂, ?, e_2k+1, ?. (ii) For every set E* = {e₁, e₂, ?, e_k} ? E(G) there is an eulerian trail T = e₁, ?, e₂, ?, e_k, ? in which the elements of E* are traversed in accordance with a prescribed orientation. © 1995 John Wiley & Sons, Inc.