Lattices contained in planar orders are planar

The covering graph of a lattice which is contained in an ordered set with a planar covering graph is itself planar.Presented by R. W. Quackenbush.     

Whistler instability in an electron-magnetohydrodynamic spheromak

A three-dimensional magnetic vortex, propagating in the whistler mode, has been produced in a laboratory plasma. Its magnetic energy is converted into electron kinetic energy. Non-Maxwellian electron distributions are formed which give rise to kinetic whistler instabilities. The propagating vortex radiates whistler modes along the ambient magnetic field. A new instability mechanism is proposed.     

Fractal scattering of microwaves from soils

Using a combination of laboratory experiments and computer simulation we show that microwaves reflected from and transmitted through soil have a fractal dimension correlated to that of the soil's hierarchic permittivity network. The mathematical model relating the ground-penetrating radar record to the mass fractal dimension of soil structure is also developed. The fractal signature of the scattered microwaves correlates well with some physical and mechanical properties of soils.     

Calculation of the propagator for a time-dependent damped,forced harmonic oscillator using the Schwinger action principle

A calculation of the quantum mechanical propagator for a general time-dependent one-dimensional damped, forced harmonic oscillator based on a direct application of the Schwinger action principle is presented. Contact with an earlier general method of calculation is made and in particular two previously found results are recovered from our general expression. The apparent dependence of one of them upon some unphysical parameters is clarified. The method presented here can be applied to any system described by a quadratic Hamiltonian and is an immediate extension of the calculation for the propagator of a simple harmonic oscillator with constant frequency.     

Efficient Regular Polygon Dissections

We study the minimum number g(m,n) (respectively, p(m,n)) of pieces needed to dissect a regular m-gon into a regular n-gon of the same area using glass-cuts (respectively, polygonal cuts). First we study regular polygon-square dissections and show that n/2 -2 g(4,n) (n/2) + o(n) and n/4 g(n,4) (n/2) + o(n) hold for sufficiently large n. We also consider polygonal cuts, i.e., the minimum number p(4,n) of pieces needed to dissect a square into a regular n-gon of the same area using polygonal cuts and show that n/4 p(4,n) (n/2) + o(n) holds for sufficiently large n. We also consider regular polygon-polygon dissections and obtain similar bounds for g(m,n) and p(m,n).     

A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints

We address a multi-objective version of the car sequencing problem, which consists in sequencing a given set of cars to be produced in a single day, minimizing the number of violations of assembly constraints and the number of paint color changes in the production line. We propose a set of heuristics for approximately solving this problem, based on the paradigms of the VNS and ILS metaheuristics, to which further intensification and diversification strategies have been added. Computational results on real-life test instances are reported. The work presented in this paper obtained the second prize in the ROADEF challenge 2005 sponsored by Renault.     

Multiple-output parity bit signature for exhaustive testing

In this article we propose a multiple-output parity bit signature generation method for exhaustive testing of VLSI circuits. Given a multiple-output combinational circuit, a parity bit signature is generated by first EXORing all the outputs to produce a new output function and then feeding this resulting function to a single-output parity bit signature generator. The method preserves all the desirable properties of the conventional single-output circuits response analyzers and can be readily implemented using the current VLSI technology.     

Crooked diagrams with few slopes

A natural and practical criterion in the preparation of diagrams of ordered sets is to minimize the number of different slopes used for the edges. For any diagram this is at least the maximum number of upper covers and of lower covers of any element. While this maximum degree is not always enough we show that it is as long as any edge joining a covering pair may be bent, to produce a crooked diagram.     

Scheduling tasks with communication delays on parallel processors

LetP={v ₁,...,v _n } be a set ofn jobs to be executed on a set ofm identical machines. In many instances of scheduling problems, if a jobv _i has to be executed before the jobv _j and both jobs are to be executed on different machines, some sort of information exchange has to take place between the machines executing them. The time it takes for this exchange of information is called a communication delay.In this paper we give anO(n) algorithm to find an optimal scheduling with communication delays when the number of machines is not limited and the precedence constraints on the jobs form a tree.