On input/output stabilization of singular integrodifferential systems

In this paper we consider a class of systems described by singular integrodifferential equations. This type of systems appear, for example, in the modeling of certain aeroelastic control problems. We study these systems in frequency domain framework and show the existence of finite-dimensional stabilizing controllers. An algorithmic procedure is outlined for the construction of such controllers. In order to illustrate the numerical aspects of this algorithm, we present an example involving the classical Theodorsen model of an airfoil, which fits in the class of systems considered here.This work was supported in part by the National Science Foundation under Grants DMS-8907019 and MSS-9203418.     

Approximate minimum-cost multicommodity flows in\tilde O(ɛ −2 KNM) timetime

We show that an ε-approximate solution of the cost-constrainedK-commodity flow problem on anN-nodeM-arc network,G can be computed by sequentially solving O(K(? ^?2+logGK) logGM log (G? ^?1 GK)) single-commodity minimum-cost flow problems on the same network. In particular, an approximate minimum-cost multicommodity flow can be computed in $\tilde O$ (G? ^?2 GKNM) running time, where the notation Õ(·) means “up to logarithmic factors”. This result improves the time bound mentioned by Grigoriadis and Khachiyan [4] by a factor ofM/N and that developed more recently by Karger and Plotkin [8] by a factor of? ^?1. We also provide a simple $\tilde O$ (NM)-time algorithm for single-commodity budget-constrained minimum-cost flows which is $\tilde O$ (? ^?3) times faster than the algorithm developed in the latter paper.     

Numerical comparison of several variable-metric algorithms

The paper compares the numerical performances of the LDL decomposition of the BFGS variable-metric algorithm, the Dennis-Mei dogleg algorithm on the BFGS update, and Davidon's projections with the BFGS update with the straight BFGS update on a number of standard test problems. Numerical results indicate that the standard BFGS algorithm is superior to all of the more complex strategies.This research was supported by the National Science Foundation under Research Grant No. MCS77-07327.     

Optimization of an electrolytic conductivity detector for determination of toxic nitrogen-containing food contaminants separated by open tubular column gas chromatography

The combination of open tubular column gas chromatography with electrolytic conductivity detection has been evaluated for the determination of nitrogen-containing pesticide residues in food extracts. Optimization of the column position at the column-detector interface was crucial to the successful operation of the detector. The signal-to-noise ratio and response stability of the detector are greatly influenced by the composition of the electrolyte solvent. Large volume splitless injections using retention gaps and optimized detector operating conditions enabled pesticide residues in food extracts to be determined at sub parts-per-million levels. Although the electrolytic conductivity detector is less sensitive than the thermionic ionization detector, its greater nitrogen selectivity can he crucial to the determination of nitrogen-containing contaminants in food extracts, particularly in complex mixtures where phosphorus-containing contaminants or matrix compounds are also present.     

Retention behavior and solvent optimization of organochlorine pesticides in solid-phase extraction

Summary Plots of capacity factor and retention time vs. elution solvent composition were proved to be useful to interpret the retention behavior of Kepone and its metabolites in a reversed-phase solid-phase extraction and to optimize the elution solvent. The percent recovery of Kepone was largely improved when the solvent was optimized. The standard deviations of the results of extractions were also improved upon the optimization of the solvent.     

Existence of maximal points with respect to ordered bipreference relations

The maximality of a point with respect to an ordered pair of arbitrary preference relations is introduced. Necessary and sufficient conditions for the existence of maximal points are given.The authors are grateful for the referee's comments which led to an improved presentation of the paper.     

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.     

Spectroscopic and Quantum Mechanical Studies of Substituted Anilines and their Charge-Transfer Complexes with Iodine in Different Solvents

Summary. Equilibrium constants and molar extinction coefficients for 1:1 charge-transfer complexes between 2-hydroxyaniline (HA), 5-chloro-2-hydroxyaniline (CHA), and 4-bromo-2,6-dimethylaniline (BMA) as donors and iodine, as a typical σ-acceptor were determined spectrophotometrically in chloroform, dichloromethane, and carbontetrachloride solutions. Spectral characteristics and formation constants are discussed in terms of donor molecular structure and solvent polarity. The stoichiometry of the complexes was established to be 1:1. For this purpose, optical data were subjected to the form of the Rose-Drago equation for 1:1 equilibria. Electronic absorption spectra of the studied anilines were measured in different solvents. Spectral data were reported and band maxima were assigned to the appropriate molecular orbital transitions (π–π^* and n–π^* electronic transition). Solvent effects on the electronic transitions were discussed. Optimized geometry of the studied anilines was obtained at B3LYP/6-31 + G(d). The effect of the electronic factors of the substituents on the geometrical parameters of the ring has been explored. Geometrical values of the ring deviate from the regular hexagonal ring. Intramolecular H-bonds in HA and CHA have been computed at B3LYP/6-31 + G(d) and MP2/6-31 + G(d) levels. The H-bonding distance was calculated to be 2.105 ? in HA and 2.127 ? in CHA. Abstracted from her M.Sc. thesis     

Properties of the random search in global optimization

From theorems which we prove about the behavior of gaps in a set ofN uniformly random points on the interval [0, 1], we determine properties of the random search procedure in one-dimensional global optimization. In particular, we show that the uniform grid search is better than the random search when the optimum is chosen using the deterministic strategy, that a significant proportion of large gaps are contained in the uniformly random search, and that the error in the determination of the point at which the optimum occurs, assuming that it is unique, will on the average be twice as large using the uniformly random search compared with the uniform grid. In addition, some of the properties of the largest gap are verified numerically, and some extensions to higher dimensions are discussed. The latter show that not all of the conclusions derived concerning the inadequacies of the one-dimensional random search extend to higher dimensions, and thaton average the random search is better than the uniform grid for dimensions greater than 6.This paper is based on work started in the Statistics Department of Princeton University when the first author was visiting as a Research Associate. Part of this research was supported by the Office of Naval Research, Contract No. 0014-67-A-0151-0017, and by the US Army Research Office—Durham, Contract No. DA-31-124-ARO-D-215.2 The authors wish to thank B. Omodei for his careful work in preparing the programs for the results of Figs. 1–2 and Table 1. The computations were performed on the IBM 360/50 of the Australian National University's Computer Centre. Thanks are also due to R. Miles for suggestions regarding the extension of the results to multidimensional regions, and to P. A. P. Moran and R. Brent for suggestions regarding the evaluation of the integral ₀ ¹ ... ^0/1 (x ₁ ² + ... +x _n ^/2 )^1/2 dx ₁ ...dx _n.     

原子荧光光谱法测定砷过程中还原反应条件的优化

自然界中砷和砷的化合物一般可通过水、大气和食物等途径进入人体,危害人体健康,原子荧光光谱法测定砷含量被广泛应用。为准确测定样品中砷的含量,以原子荧光光谱法(AFS)测定土壤中总砷含量为例,重点研究高价态砷(Ⅴ)还原为低价态砷(Ⅲ)的实验条件,采用正交实验进行条件优化,建立适合的实验方法。通过设计L9(34)正交实验,高价态砷的还原反应与四个因素有关,即与反应温度、反应时间、盐酸加入量和硫脲的用量呈一定的正相关,结果表明,四个因素中硫脲用量的影响最为显著,其次是盐酸加入量、反应时间和反应温度。通过对四个因素的多水平检验,优化后的实验条件为：硫脲用量2.0 mL、盐酸加入量10%、反应时间20 min、温度20～35 ℃(即普通室温)。采用土壤标准物质验证优化后条件的可行性,得出砷的测定值在标准值范围内,RSD在2.2%～4.2%,精密度和准确性均满足质控要求。优化后的实验条件使得操作简便易行,提高了工作效率。