Body composition data from the rat subjects of Cosmos 1129 experiment K-316

The effects of 18.5 days of weightlessness on the body composition of young, growing, male laboratory rats were examined. Three groups of 5 rats each were examined. It is indicated that exposure of young, growing, male rats to 18.5 days of weightlessness produces: (1) no effect on the quantity of fat stored by the body; (2) a slight reduction in the quantity of fat free tissue laid down by the body; (3) a small reduction in the fraction of water contained by the fat free body mass; (4) a similar reduction in the fraction of water contained by the fat free skin and fat free carcass; (5) a shift in relative distribution of the total body water from skin to viscera; (6) a diminution in the fraction of extracellular water contained by the fat free body; (7) no effect on the fraction of total skeletal musculature contained by the fat free body, as indicated by body creatine content; (8) a sizeable reduction in the fraction of bone mineral contained by the fat free body, as calculated from body calcium content. The nature of the physiological changes induced by unloading from Earth gravity in the mammalian organism are illustrated

Atmospheric transmission computer program CP

A computer program is described which allows for calculation of the effects of carbon dioxide, water vapor, methane, ozone, carbon monoxide, and nitrous oxide on earth resources remote sensing techniques. A flow chart of the program and operating instructions are provided. Comparisons are made between the atmospheric transmission obtained from laboratory and spacecraft spectrometer data and that obtained from a computer prediction using a model atmosphere and radiosonde data. Limitations of the model atmosphere are discussed. The computer program listings, input card formats, and sample runs for both radiosonde data and laboratory data are included

The Meaning of Memory Safety

We give a rigorous characterization of what it means for a programming language to be memory safe, capturing the intuition that memory safety supports local reasoning about state. We formalize this principle in two ways. First, we show how a small memory-safe language validates a noninterference property: a program can neither affect nor be affected by unreachable parts of the state. Second, we extend separation logic, a proof system for heap-manipulating programs, with a memory-safe variant of its frame rule. The new rule is stronger because it applies even when parts of the program are buggy or malicious, but also weaker because it demands a stricter form of separation between parts of the program state. We also consider a number of pragmatically motivated variations on memory safety and the reasoning principles they support. As an application of our characterization, we evaluate the security of a previously proposed dynamic monitor for memory safety of heap-allocated data.Comment: POST'18 final versio

The Demise of Officer Involvement in Soldiers Sport During the American Civil War

During the American Civil War a few officers in the Army of the Potomac became involved in organizing sport for soldiers. They had ulterior motives. In each instance officers intended to use sport to improve soldier morale, assuage despondency and doubt, and to overcome homesickness. Officers chose sport because they believed that sport entertainment had the capacity to create excitement, excitement that drew men\u27s minds off immediate problems and left a generalized good feeling among the men. Once officers had assigned a use value to sport, they began to consider ways to maximize sport\u27s usefulness as a morale booster. To this end officers attempted to organize sport to produce the greatest entertainment for the greatest number. Their experiment, begun in the fall of 1861, continued periodically during 1862, and reached major proportions during the winter camp at Falmouth, Virginia in 1863. Between January 1, 1863 and April 18, 1863 officers produced six major sport festivals. Each festival drew between ten and twenty thousand soldiers. After Falmouth the experiment ended abruptly

Partial purification of human colonic carcinoma cells by sedimentation.

We have purified epithelial cells from human colonic tumours by velocity sedimentation in an isokinetic density gradient of Ficoll in tissue culture medium. In frozen sections of colonic carcinoma, histochemically demonstrable N-acetyl-beta-D-glucosaminidase (HDAG) was observed primarily in epithelial cells. We used this enzyme as a histochemical marker of epithelial cells. Initial suspensions of cells from colonic tumours suspended with 0-25% trypsin contained an average of 24% of the nucleated cells with HDAG. In the purest fraction obtained from gradient centrifugations, an average of 74% of the nucleated cells contained HDAG. After centrifugation, the quarter of the density gradient which contained the most rapidly sedimenting cells was purified 2-4-fold over that in the initial suspension. Cells in this zone of the gradient also gave rise to colonies in soft agar. Cells from initial suspension resulted in 15-25% as many colonies of 7 or more cells in cultures inoculated with the same number of nucleated cells. For the most part, cells obtained from the other zones of the gradient did not give rise to colonies in soft agar

A principled approach to programming with nested types in Haskell

Initial algebra semantics is one of the cornerstones of the theory of modern functional programming languages. For each inductive data type, it provides a Church encoding for that type, a build combinator which constructs data of that type, a fold combinator which encapsulates structured recursion over data of that type, and a fold/build rule which optimises modular programs by eliminating from them data constructed using the buildcombinator, and immediately consumed using the foldcombinator, for that type. It has long been thought that initial algebra semantics is not expressive enough to provide a similar foundation for programming with nested types in Haskell. Specifically, the standard folds derived from initial algebra semantics have been considered too weak to capture commonly occurring patterns of recursion over data of nested types in Haskell, and no build combinators or fold/build rules have until now been defined for nested types. This paper shows that standard folds are, in fact, sufficiently expressive for programming with nested types in Haskell. It also defines buildcombinators and fold/build fusion rules for nested types. It thus shows how initial algebra semantics provides a principled, expressive, and elegant foundation for programming with nested types in Haskell