Standards for Library Services to People in Institutions

published or submitted for publicatio

Computational astrophysics

Astronomy is an area of applied physics in which unusually beautiful objects challenge the imagination to explain observed phenomena in terms of known laws of physics. It is a field that has stimulated the development of physical laws and of mathematical and computational methods. Current computational applications are discussed in terms of stellar and galactic evolution, galactic dynamics, and particle motions

Capitalism With Capital: A Suggested Remedy for the Absence of Investment Decision Making in Basic Microeconomics Teaching

'[U]nder competition, the rate of return on investment tends toward equality in all industries.' Introductory and intermediate microeconomics textbooks are sketchy in explaining how capital is allocated by financial markets. Capital budgeting techniques, primarily net present value, deserve a more prominent role. This article suggests ways in which financial economics can be integrated into undergraduate courses to illuminate entry into (and exit from) industries in response to profit opportunities, as an essential part of economists' narration of resource allocation in a capitalistic and dynamic market economy.

Insect Pests of Christmas Trees

PDF pages: 2

Clausen's series 3F2(1) with integral parameter differences and transformations of the hypergeometric function 2F2(x)

We obtain summation formulas for the hypergeometric series 3 F 2(1) with at least one pair of numeratorial and denominatorial parameters differing by a negative integer. The results derived for the latter are used to obtain Kummer-type transformations for the generalized hypergeometric function 2 F 2(x) and reduction formulas for certain Kampé de Fériet functions. Certain summations for the partial sums of the Gauss hypergeometric series 2 F 1(1) are also obtained

Certain transformations and summations for generalized hypergeometric series with integral parameter differences

Certain transformation and summation formulas for generalized hypergeometric series with integral parameter differences are derived

A nearly-mlogn time solver for SDD linear systems

We present an improved algorithm for solving symmetrically diagonally dominant linear systems. On input of an $n\times n$ symmetric diagonally dominant matrix $A$ with $m$ non-zero entries and a vector $b$ such that $A\bar{x} = b$ for some (unknown) vector $\bar{x}$, our algorithm computes a vector $x$ such that $||{x}-\bar{x}||_A < \epsilon ||\bar{x}||_A$ {$||\cdot||_A$ denotes the A-norm} in time $${\tilde O}(m\log n \log (1/\epsilon)).$$ The solver utilizes in a standard way a `preconditioning' chain of progressively sparser graphs. To claim the faster running time we make a two-fold improvement in the algorithm for constructing the chain. The new chain exploits previously unknown properties of the graph sparsification algorithm given in [Koutis,Miller,Peng, FOCS 2010], allowing for stronger preconditioning properties. We also present an algorithm of independent interest that constructs nearly-tight low-stretch spanning trees in time $\tilde{O}(m\log{n})$, a factor of $O(\log{n})$ faster than the algorithm in [Abraham,Bartal,Neiman, FOCS 2008]. This speedup directly reflects on the construction time of the preconditioning chain.Comment: to appear in FOCS1