Phase Equilibria and Critical Curves of Binary Ammonia–Hydrocarbon Mixtures

Liquid or dense supercritical ammonia has been suggested as an extraction fluid. It is indeed good solvent for very different classes of compounds, as can be seen from phase diagrams. Such diagrams for binary systems of ammonia and hydrocarbons are presented and discussed on the basis of their critical curves. Apparatus and methods for the measurement of phase equilibria and equation of state data of fluid mixtures at high pressure are described.     

An inverse problem for infinitely divisible moving average random fields

Statistical Inference for Stochastic Processes - Given a low frequency sample of an infinitely divisible moving average random field $$\{\int _{\mathbb {R}^d} f(x-t)\varLambda (dx); \ t \in \mathbb...     

Lattice embeddings and array noncomputable degrees

We focus on a particular class of computably enumerable (c. e.) degrees, the array noncomputable degrees defined by Downey, Jockusch, and Stob, to answer questions related to lattice embeddings and definability in the partial ordering (??, ≤) of c. e. degrees under Turing reducibility. We demonstrate that the latticeM₅ cannot be embedded into the c. e. degrees below every array noncomputable degree, or even below every nonlow array noncomputable degree. As Downey and Shore have proved that M₅ can be embedded below every nonlow₂ degree, our result is the best possible in terms of array noncomputable degrees and jump classes. Further, this result shows that the array noncomputable degrees are definably different from the nonlow₂ degrees. We note also that there are embeddings of M₅ in which all five degrees are array noncomputable, and in which the bottom degree is the computable degree 0 but the other four are array noncomputable. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Randeigenschaften zufälliger Potenzreihen und eine damit zusammenhängende Verallgemeinerung des Satzes von Fatou und Nevanlinna

Ohne Zusammenfassung     

Some remarks on computer-aided design of optical lens systems

Computer-aided design of optical lens systems implies the solution of an optimization problem of large dimension. To apply a local algorithm, we want to know a starting point within a small neighborhood of the desired system. For a given task, the designer is not able to define a suitable starting point. In this paper, we describe a global optimization algorithm which uses the principles of biological evolution with the aim of locating an adequate starting point for a local correction routine.This work was supported by the Department of Mathematics, Friedrich Schiller University, Jena, GDR, in cooperation with the research center of VEB Kombinat Carl Zeiss, Jena, GDR. The authors are indebted to Dr. L. C. W. Dixon for discussions of the topic.     

Eine Mandelbrojtsche Formel zur Bestimmung von Punkten aus dem Spektrum eines beschränkten Operators

Ohne ZusammenfassungHerrnGottfried Köthe zum 60. Geburtstag am 25. 12. 1965 gewidmet     

Über Eigenwerte und Eigenlösungen symmetrisierbarer finiter Operatoren

Ohne Zusammenfassung