A general algorithm for minimizing a quadratic function with bounds on the variables is presented. The new algorithm can use diierent un-constrained minimization techniques on diierent faces. At every face, the minimization technique can be chosen according to he structure of the Hessian and the dimension of the face. The strategy for leaving the face is based on a simple scheme that exploits t...

Introduction 150 Organization 152 Acknowledgments 152 1. Symmetric spectra 153 1.1. Simplicial sets 153 1.2. Symmetric spectra 154 1.3. Simplicial structure on Sp 156 1.4. Symmetric Ω-spectra 158 2. The smash product of symmetric spectra 159 2.1. Symmetric sequences 159 2.2. Symmetric spectra 162 2.3. The ordinary category of spectra 165 3. Stable homotopy theory of symmetric spectra 165 3.1. S...

Let G be a connected reductive group defined over an algebraically closed field k of characteristic p > 0. The purpose of this paper is two-fold. First, when p is a good prime, we give a new proof of the “order formula” of D. Testerman for unipotent elements in G; moreover, we show that the same formula determines the p-nilpotence degree of the corresponding nilpotent elements in the Lie algebr...

We also discuss the relation of our work to the earlier work on the decomposition of the ζ-determinant by Burghelea, Friedlander and Kappeler (from this point on referred to as BFK). The present work is companion to the paper [10] and in several places we refer to [10] for the proof of a given statement and a more detailed discussion. Let D : C(M ;S) → C(M ;S) be a compatible Dirac operator act...

Universal eigenvalue inequalities are a classical topic in the spectral theory of differential operators. Most relevant to our work here are comparison theorems between the Dirichlet and Neumann eigenvalues λj(−∆Ω ) and λj(−∆Ω ), j ∈ N, of the Laplacian in a smooth, bounded domain Ω ⊂ R. Note that λj(−∆Ω ) ≤ λj(−∆Ω ) for all j ∈ N by the variational characterization of eigenvalues. This trivial...

Date of Final Report: March 30, 2005 EPA Agreement Number: CR-82805901 Title: Southern California Supersite Principal Investigators: Constantinos Sioutas, Sc.D., Professor, Viterbi School of Engineering, University of Southern California; and John R. Froines, Ph.D., Professor, Environmental Health Sciences, UCLA; Other Investigators:-University of Southern California: Philip M. Fine, PhD., Mich...

Hunt (1982) and Friedlander (1960a, b) used dimensional analysis to derive expressions for the steady-state particle-size distribution in aerosols and hydrosols. Their results were supported by the Monte Carlo simulation of a non -interacting coagulating population of suspended spherical particles developed by Pearson, V alioulis & List (1984). Here the realism of the Monte Carlo simulation is ...

1. Basic gradient estimate; different variations of the gradient estimates; 2. The theorem of Brascamp-Lieb, Barkey-Émery Riemannian geometry, relation of eigenvalue gap with respect to the first Neumann eigenvalue; the Friedlander-Solomayak theorem, 3. The definition of the Laplacian on L space, theorem of Sturm, 4. Theorem of Wang and its possible generalizations. 1 Gradient estimate of the f...

BETA-ADRENERGIC blocking agents have been used with success in angina pectoris (Alleyne et al, 1963; Hamer et al, 1964; Keelan, 1965); and in various cardiac arrthymias (Besterman and Friedlander, 1965). Snow (1965) administered 10-20 mg. of propranolol (Inderal-I.C.I.) eight-hourly to 45 patients with myocardial infarction and found that the mortality in the treated cases was 16 per cent. comp...

Abstract. In this paper, we analyze several variants of a simple method for generating prime numbers with fewer random bits. To generate a prime p less than x, the basic idea is to fix a constant q ∝ x, pick a uniformly random a < q coprime to q, and choose p of the form a+ t · q, where only t is updated if the primality test fails. We prove that variants of this approach provide prime generati...