Recognizing nullhomotopic maps into the classifying space of a Kac-Moody group

This paper extends certain characterizations of nullhomotopic maps between p-compact groups to maps with target the p-completed classifying space of a connected Kac-Moody group and source the classifying space of either a p-compact group or a connected Kac-Moody group. A well known inductive principle for p-compact groups is applied to obtain general, mapping space level results. An arithmetic fiber square computation shows that a null map from the classifying space of a connected compact Lie group to the classifying space of a connected topological Kac-Moody group can be detected by restricting to the maximal torus. Null maps between the classifying spaces of connected topological Kac-Moody groups cannot, in general, be detected by restricting to the maximal torus due to the nonvanishing of an explicit abelian group of obstructions described here. Nevertheless, partial results are obtained via the application of algebraic discrete Morse theory to higher derived limit calculations which show that such detection is possible in many cases of interest.Comment: References added, minor corrections; 29 pages, 4 figures, one tabl

Raster graphics extensions to the core system

A conceptual model of raster graphics systems was developed. The model integrates core-like graphics package concepts with contemporary raster display architectures. The conceptual model of raster graphics introduces multiple pixel matrices with associated index tables

Large deviations of a modified Jackson network: stability and rough asymptotics

Consider a modified, stable, two node Jackson network where server 2 helps server 1 when server 2 is idle. The probability of a large deviation of the number of customers at node one can be calculated using the flat boundary theory of Schwartz and Weiss [Large Deviations Performance Analysis (1994), Chapman and Hall, New York]. Surprisingly, however, these calculations show that the proportion of time spent on the boundary, where server 2 is idle, may be zero. This is in sharp contrast to the unmodified Jackson network which spends a nonzero proportion of time on this boundary.Comment: Published at http://dx.doi.org/10.1214/105051604000000666 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

Research into fundamental phenomena associated with spacecraft electrochemical devices, calorimetry of nickel-cadmium cells Progress report, 1 Oct. - 31 Dec. 1967

Calorimetry of nickel cadmium cells for spacecraft electrochemical system

SSME structural dynamic model development

A mathematical model of the Space Shuttle Main Engine (SSME) as a complete assembly, with detailed emphasis on LOX and High Fuel Turbopumps is developed. The advantages of both complete engine dynamics, and high fidelity modeling are incorporated. Development of this model, some results, and projected applications are discussed

Research into fundamental phenomena associated with spacecraft electrochemical devices - Calorimetry of nickel-cadmium cells Progress report, 1 Jul. - 30 Sep. 1968

Training of electrochemist in battery research and collecting electrochemical and thermodynamic dat

ICL: The Image Composition Language

The Image Composition Language (ICL) provides a convenient way for programmers of interactive graphics application programs to define how the video look-up table of a raster display system is to be loaded. The ICL allows one or several images stored in the frame buffer to be combined in a variety of ways. The ICL treats these images as variables, and provides arithematic, relational, and conditional operators to combine the images, scalar variables, and constants in image composition expressions. The objective of ICL is to provide programmers with a simple way to compose images, to relieve the tedium usually associated with loading the video look-up table to obtain desired results