On the support of midconvex operators

Summary LetX be a real vector space,D a convex subset ofX and (Y, K) an order complete ordered vector space. The following sandwich theorem holds: Iff: D Y is midconvex,g: D Y {– } is midconcave andg f onD, then there exists a Jensen mappingh: D Y {– } such thatg h f onD. Using this theorem we show that a mappingf: D Y is midconvex if and only if it has Jensen support at every point ofD. Moreover, ifX is a Baire topological vector space and (Y, K) is an ordered topological vector space satisfying some additional conditions, then a mappingf: D Y is continuous whenever it has continuous Jensen support at every point ofD. As an application of these results we obtain the equality of some set-classes connected with additive and midconvex operators.Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth     

Some regularity properties of algorithms and additive functions with respect to them

Summary The paper deals with the behaviour of the so-called algorithms with respect to interval filling sequences A connection is established between the uniquely representable points and the continuity points of the algorithms; also strong continuity properties on monotonic algorithms are proved. Finally the results are applied to additive functions. The theorems extend some former results by the authors, by I. Kátai and by A. Járai.Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth     

Convergence of Padé approximants for aq-hypergeometric series (Wynn's Power Series I)

We investigate the convergence of sequences of Padé approximants for power series

Repleteness and regular lattice measures

Let X be an abstract set and L a lattice of subsets of X. To each lattice regular measure µ, we associate two induced measures and on suitable lattices of the Wallman space IR(L) and another measure µ on the spaceIR(L). We will investigate the reflection of smoothness properties of p onto , and µ; and try to set some new criterion for repleteness and measure repleteness.     

Interface motion in a two-dimensional Ising model with a field

We determine by Monte Carlo simulations the width of an interface between the stable phase and the metastable phase in a two-dimensional Ising model with a magnetic field, in the case of nonconversed order parameter (Glauber dynamics). At zero temperature, the width increases ast with–1/3, as predicted by earlier theories. As temperature increases, the value of the effective exponent that we measure decreases toward the value 1/4, which is the value in the absence of magnetic field.     

On solving a D.C. programming problem by a sequence of linear programs

We are dealing with a numerical method for solving the problem of minimizing a difference of two convex functions (a d.c. function) over a closed convex set in ⁿ . This algorithm combines a new prismatic branch and bound technique with polyhedral outer approximation in such a way that only linear programming problems have to be solved.Parts of this research were accomplished while the third author was visiting the University of Trier, Germany, as a fellow of the Alexander von Humboldt foundation.     

Metastable systems driven by colored noise: The stationary state

The influence of the Bardeen-Herring back-jump correlations on the Fermi-Dirac statistics of the one-dimensional nonhomogeneous fermionic lattice gas is studied by the Monte Carlo simulation technique and semianalytically. The resulting distribution is obtained, exhibiting increased population of the lower levels in comparison to the Fermi-Dirac statistics.     

Monte Carlo simulation of phase separation and clustering in the ABV model

As a model for a binary alloy undergoing an unmixing phase transition, we consider a square lattice where each site can be either taken by an A atom, a B atom, or a vacancy (V), and there exists a repulsive interaction between AB nearest neighbor pairs. Starting from a random initial configuration, unmixing proceeds via random jumps of A atoms or B atoms to nearest neighbor vacant sites. In the absence of any interaction, these jumps occur at jump rates _A and _B, respectively. For a small concentration of vacancies (c _v=0.04) the dynamics of the structure factorS(k,t) and its first two momentsk ₁(t),k ₂ ² (t) is studied during the early stages of phase separation, for several choices of concentrationc _B of B atoms. Forc _B=0.18 also the time evolution of the cluster size distribution is studied. Apart from very early times, the mean cluster sizel(t) as well as the moments of the structure function depend on timet and the ratio of the jump rates (= _B/ _A) only via a scaled timet/(). Qualitatively, the behavior is very similar to the direct exchange model containing no vacancies. Consequences for phase separation of real alloys are briefly discussed.     

A spectrophotometric assay for solid phase primary amino groups

A rapid, sensitive, and convenient spectrophotometric assay was developed for the measurement of amino groups on solid supports. This method is based on the reaction of amino groups of solids with an excess ofo-phthaldialdehyde (OPA) and subsequent quantitative determination of unreacted OPA by reaction with glycine. Four solids possessing variable quantities of amino groups were examined. Results indicate that about 70% of the total surface amino concentration (determined by the microKjeldahl method) are available for ligand attachment. Unlike the spectrophotometric 2,4,6-trinitrobenzenesulfonic acid method, the OPA spectrophotometric assay is more rapid, sensitive, and convenient, and unlike the spectrofluorimetric OPA, it does not require sophisticated instrumentation.     

Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison

We consider the following global optimization problems for a Lipschitz functionf implicitly defined on an interval [a, b]. Problem P: find a globally-optimal value off and a corresponding point; Problem Q: find a set of disjoint subintervals of [a, b] containing only points with a globally-optimal value and the union of which contains all globally optimal points. A two-phase algorithm is proposed for Problem P. In phase I, this algorithm obtains rapidly a solution which is often globally-optimal. Moreover, a sufficient condition onf for this to be the case is given. In phase II, the algorithm proves the-optimality of the solution obtained in phase I or finds a sequence of points of increasing value containing one with a globally-optimal value. The new algorithm is empirically compared (on twenty problems from the literature) with a best possible algorithm (for which the optimal value is assumed to be known), with a passive algorithm and with the algorithms of Evtushenko, Galperin, Shen and Zhu, Piyavskii, Timonov and Schoen. For small, the new algorithm requires only a few percent more function evaluations than the best possible one. An extended version of Piyavskii's algorithm is proposed for problem Q. A sufficient condition onf is given for the globally optimal points to be in one-to-one correspondance with the obtained intervals. This result is achieved for all twenty test problems.The research of the authors has been supported by AFOSR grants 0271 and 0066 to Rutgers University. Research of the second author has been also supported by NSERC grant GP0036426, FCAR grant 89EQ4144 and partially by AFOSR grant 0066. We thank Nicole Paradis for her help in drawing the figures.