Irvin [Ernie] Clarke Chapman in California Christian College football uniform. Los Angeles, California, 1930

Irvin [Ernie] Clarke Chapman in football uniform on the campus of California Christian College, Los Angeles, California, 1930.

Captain Grant K. Chapman in uniform; served in W. W. II

Studio portrait of Captain Grant K. Chapman in uniform; served in W. W. II.

George Arthur Chapman in World War I uniform, 1918

Portrait of George Arthur Chapman in his World War I uniform, 1918.

Photograph - Unidentified Male in Uniform

A photograph of a male in uniform standing in front of a horse. In background are tents and trees.

Uniforms by Alkit - Military Uniform Catalogue

A catalogue by Alkit with uniform descriptions and purchasing information for Military men and women.

Photograph - Samuel DeVeaux Woodruff in Uniform

A photograph of Samuel DeVeaux Woodruff (1894-1918) in uniform in a garden with a dog. In 1916, he was a Lieutenant in the 176th unit of the Queen’s Battalion. Samuel was engaged to Gladyse Wanita Palling, but they never married. He was killed in action on the July 13, 1918 as a member of the 116th Battalion of the Canadian Infantry (Central Ontario Regiment).

Photograph - Samuel DeVeaux Woodruff in Uniform with others

A photograph of Samuel Deveaux Woodruff in uniform, standing in a garden with three women and a man.

Photograph - Samuel DeVeaux Woodruff in Uniform with his Mother

Black and white framed photograph of Samuel D. Woodruff in uniform and his mother Georgina at the Niagara Falls Railroad Station. The reverse of the photograph reads "Sam D. Woodruff with Mother, Georgina at Niagara Falls Railroad Station 1916".

Probabilistic Assignments of Identical Indivisible Objects and Uniform Probabilistic Rules.

We consider a probabilistic approach to the problem of assigning k indivisible identical objects to a set of agents with single-peaked preferences. Using the ordinal extension of preferences, we characterize the class of uniform probabilistic rules by Pareto efficiency, strategy-proofness, and no-envy. We also show that in this characterization no-envy cannot be replaced by anonymity. When agents are strictly risk averse von-Neumann-Morgenstern utility maximizers, then we reduce the problem of assigning k identical objects to a problem of allocating the amount k of an infinitely divisible commodity.

On Solutions of Holonomic Divided-Difference Equations on Non-Uniform Lattices

The main aim of this paper is the development of suitable bases (replacing the power basis x^n (n\in\IN_\le 0) which enable the direct series representation of orthogonal polynomial systems on non-uniform lattices (quadratic lattices of a discrete or a q-discrete variable). We present two bases of this type, the first of which allows to write solutions of arbitrary divided-difference equations in terms of series representations extending results given in [16] for the q-case. Furthermore it enables the representation of the Stieltjes function which can be used to prove the equivalence between the Pearson equation for a given linear functional and the Riccati equation for the formal Stieltjes function. If the Askey-Wilson polynomials are written in terms of this basis, however, the coefficients turn out to be not q-hypergeometric. Therefore, we present a second basis, which shares several relevant properties with the first one. This basis enables to generate the defining representation of the Askey-Wilson polynomials directly from their divided-difference equation. For this purpose the divided-difference equation must be rewritten in terms of suitable divided-difference operators developed in [5], see also [6].

Characterization theorem for classical orthogonal polynomials on non-uniform lattices: The functional approach

Using the functional approach, we state and prove a characterization theorem for classical orthogonal polynomials on non-uniform lattices (quadratic lattices of a discrete or a q-discrete variable) including the Askey-Wilson polynomials. This theorem proves the equivalence between seven characterization properties, namely the Pearson equation for the linear functional, the second-order divided-difference equation, the orthogonality of the derivatives, the Rodrigues formula, two types of structure relations,and the Riccati equation for the formal Stieltjes function.

ADAM: A Decentralized Parallel Computer Architecture Featuring Fast Thread and Data Migration and a Uniform Hardware Abstraction

The furious pace of Moore's Law is driving computer architecture into a realm where the the speed of light is the dominant factor in system latencies. The number of clock cycles to span a chip are increasing, while the number of bits that can be accessed within a clock cycle is decreasing. Hence, it is becoming more difficult to hide latency. One alternative solution is to reduce latency by migrating threads and data, but the overhead of existing implementations has previously made migration an unserviceable solution so far. I present an architecture, implementation, and mechanisms that reduces the overhead of migration to the point where migration is a viable supplement to other latency hiding mechanisms, such as multithreading. The architecture is abstract, and presents programmers with a simple, uniform fine-grained multithreaded parallel programming model with implicit memory management. In other words, the spatial nature and implementation details (such as the number of processors) of a parallel machine are entirely hidden from the programmer. Compiler writers are encouraged to devise programming languages for the machine that guide a programmer to express their ideas in terms of objects, since objects exhibit an inherent physical locality of data and code. The machine implementation can then leverage this locality to automatically distribute data and threads across the physical machine by using a set of high performance migration mechanisms. An implementation of this architecture could migrate a null thread in 66 cycles -- over a factor of 1000 improvement over previous work. Performance also scales well; the time required to move a typical thread is only 4 to 5 times that of a null thread. Data migration performance is similar, and scales linearly with data block size. Since the performance of the migration mechanism is on par with that of an L2 cache, the implementation simulated in my work has no data caches and relies instead on multithreading and the migration mechanism to hide and reduce access latencies.