Nonlinear analysis of laser droplet generation by means of 0–1 test for chaos

We apply the recently improved version of the 0–1 test for chaos to real experimental time series of laser droplet generation process. In particular two marginal regimes of dripping are considered: spontaneous and forced dripping. The outcomes of the test reveal that both spontaneous and forced dripping time series can be characterized as chaotic, which coincides with the previous analysis based on nonlinear time series analysis.     

Scheduling Parts in a Combined Production-transportation Work Cell

This paper is concerned with a combined production-transportation scheduling problem. The problem comprises a simple, two-machine, automated manufacturing cell, which either stands alone or is a subunit of a complete flexible manufacturing system. The cell consists of two machines in series with a dedicated part-handling device such as a crane or robotic arm for transferring parts from the first machine to the second. The loading of a new piece on the first machine and the ejection of a finished piece from the second machine are performed by dedicated automated mechanisms. The introduction of parts into the system is done n at a time, whereby the parts are reshuffled into a sequence that minimizes completion time. All processing and transfer times are considered deterministic—a reasonable assumption for a cell comprising a robotic transfer device and two CNC machining units. What complicates the problem is the assumption of a non-negligible time for the transfer device to return (empty) from the second machine to the first. The operation is a generalization of a two-machine flowshop problem, and is formulated as a specially structured, asymmetric travelling salesman problem. An approximate polynomial time 0(n log n) algorithm is proffered. The procedure incorporates a lower bound using the Gilmore–Gomory algorithm for the no-wait, two-machine flowshop problem.     

Lower Bounds for the Height and Size of the Ideal Class Group in CM-Fields

 We prove that, under the assumption of the Generalized Riemann Hypothesis, the exponent of the ideal class group of a CM-field goes to infinity with its absolute discriminant. This gives a positive answer to a question raised by Louboutin and Okazaki [4]. Received September 10, 2001; in revised form April 5, 2002     

OSCILLATORY SINGULAR INTEGRALS WITH VARIABLE ROUGH KERNEL,Ⅱ

Let n≥2. In this paper, the author establishes the L^2 (R^n)-boundedness of some oscillatory singular integrals with variable rough kernels by means of some estimates on hypergeometric functions and congqucnt hypergeometric funtions.     

Gomory integer programs

 The set of all group relaxations of an integer program contains certain special members called Gomory relaxations. A family of integer programs with a fixed coefficient matrix and cost vector but varying right hand sides is a Gomory family if every program in the family can be solved by one of its Gomory relaxations. In this paper, we characterize Gomory families. Every TDI system gives a Gomory family, and we construct Gomory families from matrices whose columns form a Hilbert basis for the cone they generate. The existence of Gomory families is related to the Hilbert covering problems that arose from the conjectures of Seb?. Connections to commutative algebra are outlined at the end. Received: May 17, 2001 / Accepted: February 7, 2002 Published online: April 24, 2003 RID="⋆" ID="⋆" Research partially supported by NSF grant DMS-0100141.     

On Hadamard Inequality for Log-Concave Functions

Some improvements and generalizations of Finks results about Hadamards inequality for log-concave functions are given.AMS Subject Classification: 26D07, 26D15, 26A51.     

On the Metrical Theory of Continued Fraction Mixing Fibred Systems and Its Application to Jacobi-Perron Algorithm

 We study the metrical theory of fibred systems, in particular, in the case of continued fraction mixing systems. We get the limit distribution of the largest value of a continued fraction mixing stationary stochastic process with infinite expectation and some related results. These are analogous to J. Galambos, W. Philipp, and H. G. Diamond–J. D. Vaaler theorems for the regular continued fractions. As an application, we see that these theorems hold for Jacobi-Perron algorithm. Received September 30, 2001; in revised form January 8, 2002