Approximation algorithms for scheduling unrelated parallel machines

We consider the following scheduling problem. There arem parallel machines andn independent jobs. Each job is to be assigned to one of the machines. The processing of jobj on machinei requires timep _ij . The objective is to find a schedule that minimizes the makespan.Our main result is a polynomial algorithm which constructs a schedule that is guaranteed to be no longer than twice the optimum. We also present a polynomial approximation scheme for the case that the number of machines is fixed. Both approximation results are corollaries of a theorem about the relationship of a class of integer programming problems and their linear programming relaxations. In particular, we give a polynomial method to round the fractional extreme points of the linear program to integral points that nearly satisfy the constraints.In contrast to our main result, we prove that no polynomial algorithm can achieve a worst-case ratio less than 3/2 unlessP = NP. We finally obtain a complexity classification for all special cases with a fixed number of processing times.A preliminary version of this paper appeared in theProceedings of the 28th Annual IEEE Symposium on the Foundations of Computer Science (Computer Society Press of the IEEE, Washington, D.C., 1987) pp. 217–224.     

Generalized solutions to free boundary problems for hyperbolic systems of functional partial differential equations

Summary Local a.e. solutions to a free boundary (Stefan) problem for a quasilinear hyperbolic system of functional PDE's of first order in two independent variables and diagonal form are investigated. The formulation includes retarded arguments and hereditary Volterra terms.     

A continuous parametric shape model

In this paper we propose a flexible continuous parametric shape model for star-shaped planar objects. The model is based on a polar Fourier expansion of the normalized radius-vector function. The expected phase amplitudes are modelled by a simple regression with parameters having nice geometric interpretations. The suggestedgeneralized p-order model is an extension of first- and second-order Gaussian shape models, and in particular the Gaussian assumption is relaxed. The statistical analysis is straightforward, as demonstrated by an application concerning shape discrimination of two cell nuclei populations.     

Effects of uncertainties in the domain on the solution of Dirichlet boundary value problems

Summary. A domain with possibly non-Lipschitz boundary is defined as a limit of monotonically expanding or shrinking domains with Lipschitz boundary. A uniquely solvable Dirichlet boundary value problem (DBVP) is defined on each of the Lipschitz domains and the limit of these solutions is investigated. The limit function also solves a DBVP on the limit domain but the problem can depend on the sequences of domains if the limit domain is unstable with respect to the DBVP. The core of the paper consists in estimates of the difference between the respective solutions of the DBVP on two close domains, one of which is Lipschitz and the other can be unstable. Estimates for starshaped as well as rather general domains are derived. Their numerical evaluation is possible and can be done in different ways. Received October 16, 2001 / Revised version received January 16, 2002 / Published online: April 17, 2002 RID="*" ID="*" The research was funded partially by the National Science Foundation under the grants NSF–Czech Rep. INT-9724783 and NSF DMS-9802367 RID="**" ID="**" Support for Jan Chleboun coming from the Grant Agency of the Czech Republic through grant 201/98/0528 is appreciated     

On the structure ofn-point sets

Letn be an integer greater than one. Our main result, called the “Structure Theorem” is that a set that containsn−1 disjoint continua that are cut by a single line cannot be ann-point set, that is, a set that meets every line in preciselyn points. This theorem unifies and significantly improves upon a number of known theorems. The second part of the paper is devoted to several theorems that address the question when a set that meets every line in at mostn points can be extended to ann-point set. These theorems also highlight the sharpness of the Structure Theorem.     

Theory of electronic transport in two-dimensional systems in the presence of magnetic fields

Three parts of the paper [Czech. J. Phys.41 (1991) 620,7 are focused on the Landauer-Büttiker approach to the study of transport in two-dimensional electron systems, with particular attention to the influence of an external magnetic field. In the previous parts the Landauer formalism was generalized for two-dimensional systems in quantizing magnetic fields. In the present part we applied the formalism to an analysis of magnetoresistance measurements. The two-dimensional electron gas preserved in the non-dissipative quantum Hall regime acts as the ideal leads necessary in the Landauer-Büttiker approach. The voltage, applied to the gate, forms a scattering region in the gated part of the sample, in between of its undisturbed parts (ideal leads). The dependence of the resistance on the gate voltage and the number of available channels within the ideal leads are discussed.The author wishes to thank to Professor P. Steda for cooperation and to Professor L. Smrka for his encouragement and support. Dr. R. J. Haug should be acknowledged for providing his experimental results.     

Graphs that are not complete pluripolar

Let be domains in . Under very mild conditions on we show that there exist holomorphic functions , defined on with the property that is nowhere extendible across , while the graph of over is not complete pluripolar in . This refutes a conjecture of Levenberg, Martin and Poletsky (1992).

     

Polyèdre de Newton et distributionf + s . II

Sans résumé

---

     

States on Operator Algebras and Axiomatic System of Quantum Theory

Recent development brings new results on the interplay of states on operator algebras and axiomatics of quantum mechanics. Neither hidden space in the sense of Kochen and Specker nor approximate hidden variables exist on von Neumann algebras. Tracial properties of states are connected with dispersions. The axioms on composite systems simplify to state extension properties.     

Solvent Relaxation in Phospholipid Bilayers: Principles and Recent Applications

Although there exist a number of methods, such as NMR, X-ray, e.g., which explore the hydration of phospholipid bilayers, the solvent relaxation (SR) method has the advantage of simple instrumentation, easy data treatment and possibility of measuring fully hydrated samples. The main information gained from SR by the analysis of recorded “time-resolved emission spectra” (TRES) is micro-viscosity and micro-polarity of the dye microenvironment. Based on these parameters, one can draw conclusions about water structure in the bilayer. In this review, we focus on physical background of this method, on all the procedures that are needed in order to obtain relevant parameters, and on the requirements on the fluorescence dyes. Furthermore, a few recent applications (the effect of curvature, binding of antibacterial peptides and phase transition) illustrating the versatility of this method are mentioned. Moreover, limitations and potential problems are discussed.