Free swimming organisms: Microgravity as an investigative tool

On earth, micro-organisms are in the grip of gravitational and viscous forces. These forces, in combination with sensory stimuli, determine the average orientation of the organisms' swimming trajectories relative to the fluid environment. Microgravity provides the opportunity to study the rules which govern the summation or orienting influences and to develop quantitative physical measurements of sensory responses, e.g. the measurement of phototactic orientation tendency in torque units. Also, by reducing or eliminating density anisotropy-driven buoyant convection, it will be possible to study illumination, temperature gradient and concentration gradient-mediated collective dynamics

Evaluating Effects of Tax Preferences on Health Care Spending and Federal Revenues

In this paper, we calculate the consequences for health spending and federal revenues of an above-the-line deduction for out-of-pocket health spending. We show how the response of spending to this expansion in the tax preference can be specified as a function of a small number of behavioral parameters that have been estimated in the existing literature. We compare our estimates to those from other researchers. And, we use our analysis to derive some implications for tax policy toward HSAs.

Earth Orbiter 1: Wideband Advanced Recorder and Processor (WARP)

An advanced on-board spacecraft data system component is presented. The component is computer-based and provides science data acquisition, processing, storage, and base-band transmission functions. Specifically, the component is a very high rate solid state recorder, serving as a pathfinder for achieving the data handling requirements of next-generation hyperspectral imaging missions

General Report of the Board of Directors, May 4, 1970

https://egrove.olemiss.edu/aicpa_assoc/2035/thumbnail.jp

Using utilization profiles in allocation and partitioning for multiprocessor systems

Journal ArticleThe problems of multiprocessor partitioning and program allocation are interdependent and critical to the performance of multiprocessor systems. Minimizing resource partitions for parallel programs on partitionable multiprocessors facilitates greater processor utilization and throughput. The processing resource requirements of parallel programs vary during program, execution and are allocation dependent. Optimal resource utilization requires that resource requirements be modeled as variable over time. This paper investigates the use of program profiles in allocating programs and partitioning multiprocessor systems. An allocation method is discussed. The goals of this method are to (1) minimize program execution time, (2) minimize t h e total number of processors used, (3) characterize variation in processor requirements over the lifetime of a program, (4) to accurately predict the impact on run time of the number of processors available at any point in time and (5) to minimize fluctuations in processor requirements to facilitate efficient sharing of processors between partitions on a partitionable multiprocessor. An application to program partitioning is discussed that improves partition run times compared to other methods

DPOS: A metalanguage and programming environment for parallel processors

Journal ArticleThe complexity and diversity of parallel programming languages and computer architectures hinders programmers in developing programs and greatly limits program portability. All MIMD parallel programming systems, however, address common requirements for process creation, process management, and interprocess communication. This paper describes and illustrates a structured programming system (DPOS) and graphical programming environment for generating and debugging high-level MIND parallel programs. DPOS is a metalanguage for defining parallel program networks based on the common requirements of distributed parallel computing that is portable across languages, modular, and highly flexible. The system uses the concept of stratification to separate process network creation and the control of parallelism form computational work. Individual processes are defined within the process object layer as traditional single threaded programs without parallel language constructs. Process networks and communication are defined graphically within the system layer at a high level of abstraction as recursive graphs. Communication is facilitated in DPOS by extending message passing semantics in several ways to implement highly flexible message passing constructs. DPOS processes exchange messages through bi-directional channel objects using guarded, buffered, synchronous and asynchronous communication semantics. The DPOS environment also generates source code and provides a simulation system for graphical debugging and animation of the programs in graph form

A communication-ordered task graph allocation algorithm

technical reportThe inherently asynchronous nature of the data flow computation model allows the exploitation of maximum parallelism in program execution. While this computational model holds great promise, several problems must be solved in order to achieve a high degree of program performance. The allocation and scheduling of programs on MIMD distributed memory parallel hardware, is necessary for the implementation of efficient parallel systems. Finding optimal solutions requires that maximum parallelism be achieved consistent with resource limits and minimizing communication costs, and has been proven to be in the class of NP-complete problems. This paper addresses the problem of static allocation of tasks to distributed memory MIMD systems where simultaneous computation and communication is a factor. This paper discusses similarities and differences between several recent heuristic allocation approaches and identifies common problems inherent in these approaches. This paper presents a new algorithm scheme and heuristics that resolves the identified problems and shows significant performance benefits

Brief of Resondents

This Brief outlines the Respondents (State/Prosecution) side of legal support for why the Sheppard Case was conducted in a partial and Constitutional manner. The two questions they present include: DID THE PUBLICITY RELATING TO THE PETITIONER DEPRIVE HIM OF A FAIR TRIAL? and WAS THE PETITIONER DEPRIVED OF A PUBLIC TRIAL? Using precedent and examination of the Irvin v. Dowd, 366 U.S. 717, 723 (1961) case and the case of Rideau v. State of Louisiana, 373 U.S. 723, 83 S. Ct., 1417, 10 L. Ed. 2d, 663 (1963), (perhaps the two cases most favorable to petitioner\u27s position) reveal where the United States Supreme Court has drawn the boundaries for what constitutes a fair trial in the face of adverse publicity. These cases with such a pattern of facts reveals situations that caused the United States Supreme Court to reverse both convictions. Although slightly similar to Sheppard, various factors suggest that the deep-rooted prejudice that existed in the Rideau and Irvin cases did not exist in the Sheppard case–as noted by respondents. After an examination of the relevant factors surrounding the Sheppard jury and the publicity in the community, respondent finds that it can merely repeat the words of the United States District Court in United States v. Kahaner, 204 F. Supp. 921, 924 (1962): Publicity, in and of itself does not, foreclose a fair trial. The courts do not function in a vacuum and jurors are not required to be totally ignorant of what goes on about them. * * * In considering the mentioned complaints it is necessary to keep in mind the following legal principles: The mere fact of unfavorable publicity does not of itself raise a presumption of prejudice but prejudice must manifest itself so as to corrupt due process. Dennis v. U.S., 302 F 2d 5 (1962). Mere exposure to adverse publicity does not necessarily result in bias, prejudgment or other disqualification. U.S. v. Applegarth, 206 F. Supp. 686, 687 (1962). The mere fact that a juror has read newspaper accounts relative to a criminal charge is not in itself sufficient grounds for excusing a jury. Blumenfield v. U.S, 284 F. 2d 46, 51 (1960). Also, regarding the petitioner\u27s (Sheppard) assertion that the action of the trial court in setting aside the major portion of the courtroom for representatives of the news media was violative of his right to a public trial. Respondent contends that the trial court was justified in its actions. Equally, the respondent is aware that the petitioner is going to present statements to the effect that the trial judge expressed his belief in the guilt of the petitioner before the trial commenced. Accordingly, respondent invites the Court\u27s attention to the recent case of Hendrix v. Hand, 312 F. 2d (1962) wherein the Court of Appeals, in a habeas corpus proceeding held that the mere fact that a trial judge in a state criminal prosecution signed a statement in advance of trial relating to the judge\u27s belief that the defendant was guilty of the crime charged did not establish any infringement of defendant\u27s right to a fair trial

HeyL regulates the number of TrkC neurons in dorsal root ganglia

AbstractThe basic-helix-loop-helix transcription factor HeyL is expressed at high levels by neural crest progenitor cells (NCPs) that give rise to neurons and glia in dorsal root ganglia (DRG). Since HeyL expression was observed in these NCPs during the period of neurogenesis, we generated HeyL null mutants to help examine the factor's role in ganglion neuronal specification. Homozygous null mutation of HeyL reduced the number of TrkC+ neurons in DRG at birth including the subpopulation that expresses the ETS transcription factor ER81. Conversely, null mutation of the Hey paralog, Hey1, increased the number of TrkC+ neurons. Null mutation of HeyL increased expression of the Hey paralogs Hey1 and Hey2, suggesting that HeyL normally inhibits their expression. Double null mutation of both Hey1 and HeyL rescued TrkC+ neuron numbers to control levels. Thus, the balance between HeyL and Hey1 expression regulates the differentiation of a subpopulation of TrkC+ neurons in the DRG