Green River Ordinances : Where Does the Burden Belong?

Over the years, many communities have attempted to restrict door-to-door salespersons. Green River Ordinance is a term derived from an ordinance adopted in Green River, Wyoming, in November, 1931. The measure declared the practice of going in or upon private residences for the purpose of peddling, or soliciting orders for the sale of goods without prior consent of the owners or occupants of the residence a nuisance and subjected such activities to criminal penalties. The popularity of, and controversy over, these ordinances continue to this day

Green River Ordinances : Where Does the Burden Belong?

Over the years, many communities have attempted to restrict door-to-door salespersons. Green River Ordinance is a term derived from an ordinance adopted in Green River, Wyoming, in November, 1931. The measure declared the practice of going in or upon private residences for the purpose of peddling, or soliciting orders for the sale of goods without prior consent of the owners or occupants of the residence a nuisance and subjected such activities to criminal penalties. The popularity of, and controversy over, these ordinances continue to this day

Chemical application of diffusion quantum Monte Carlo

The diffusion quantum Monte Carlo (QMC) method gives a stochastic solution to the Schroedinger equation. This approach is receiving increasing attention in chemical applications as a result of its high accuracy. However, reducing statistical uncertainty remains a priority because chemical effects are often obtained as small differences of large numbers. As an example, the single-triplet splitting of the energy of the methylene molecule CH sub 2 is given. The QMC algorithm was implemented on the CYBER 205, first as a direct transcription of the algorithm running on the VAX 11/780, and second by explicitly writing vector code for all loops longer than a crossover length C. The speed of the codes relative to one another as a function of C, and relative to the VAX, are discussed. The computational time dependence obtained versus the number of basis functions is discussed and this is compared with that obtained from traditional quantum chemistry codes and that obtained from traditional computer architectures

Dynamic remapping decisions in multi-phase parallel computations

The effectiveness of any given mapping of workload to processors in a parallel system is dependent on the stochastic behavior of the workload. Program behavior is often characterized by a sequence of phases, with phase changes occurring unpredictably. During a phase, the behavior is fairly stable, but may become quite different during the next phase. Thus a workload assignment generated for one phase may hinder performance during the next phase. We consider the problem of deciding whether to remap a paralled computation in the face of uncertainty in remapping's utility. Fundamentally, it is necessary to balance the expected remapping performance gain against the delay cost of remapping. This paper treats this problem formally by constructing a probabilistic model of a computation with at most two phases. We use stochastic dynamic programming to show that the remapping decision policy which minimizes the expected running time of the computation has an extremely simple structure: the optimal decision at any step is followed by comparing the probability of remapping gain against a threshold. This theoretical result stresses the importance of detecting a phase change, and assessing the possibility of gain from remapping. We also empirically study the sensitivity of optimal performance to imprecise decision threshold. Under a wide range of model parameter values, we find nearly optimal performance if remapping is chosen simply when the gain probability is high. These results strongly suggest that except in extreme cases, the remapping decision problem is essentially that of dynamically determining whether gain can be achieved by remapping after a phase change; precise quantification of the decision model parameters is not necessary

Orbital debris research at NASA Johnson Space Center, 1986-1988

Research on orbital debris has intensified in recent years as the number of debris objects in orbit has grown. The population of small debris has now reached the level that orbital debris has become an important design factor for the Space Station. The most active center of research in this field has been the NASA Lyndon B. Johnson Space Center. Work is being done on the measurement of orbital debris, development of models of the debris population, and development of improved shielding against hypervelocity impacts. Significant advances have been made in these areas. The purpose of this document is to summarize these results and provide references for further study

Optimal dynamic remapping of parallel computations

A large class of computations are characterized by a sequence of phases, with phase changes occurring unpredictably. The decision problem was considered regarding the remapping of workload to processors in a parallel computation when the utility of remapping and the future behavior of the workload is uncertain, and phases exhibit stable execution requirements during a given phase, but requirements may change radically between phases. For these problems a workload assignment generated for one phase may hinder performance during the next phase. This problem is treated formally for a probabilistic model of computation with at most two phases. The fundamental problem of balancing the expected remapping performance gain against the delay cost was addressed. Stochastic dynamic programming is used to show that the remapping decision policy minimizing the expected running time of the computation has an extremely simple structure. Because the gain may not be predictable, the performance of a heuristic policy that does not require estimnation of the gain is examined. The heuristic method's feasibility is demonstrated by its use on an adaptive fluid dynamics code on a multiprocessor. The results suggest that except in extreme cases, the remapping decision problem is essentially that of dynamically determining whether gain can be achieved by remapping after a phase change. The results also suggest that this heuristic is applicable to computations with more than two phases

An optimal repartitioning decision policy

A central problem to parallel processing is the determination of an effective partitioning of workload to processors. The effectiveness of any given partition is dependent on the stochastic nature of the workload. The problem of determining when and if the stochastic behavior of the workload has changed enough to warrant the calculation of a new partition is treated. The problem is modeled as a Markov decision process, and an optimal decision policy is derived. Quantification of this policy is usually intractable. A heuristic policy which performs nearly optimally is investigated empirically. The results suggest that the detection of change is the predominant issue in this problem

Digital simulation and experimental evaluation of the CO2-H(plus) control of pulmonary ventilation

Previous models of the CO2-H(+) control of ventilation have been concerned either with the response to CO2 inhalation, or the response to perfusion of the surface of the medulla with mock cerebrospinal fluid having a high P sub CO2. Simulation of both responses with the same model has not been attempted. The purpose of the present study was two fold; first to develop such a model and, second, to obtain experimental data from human subjects for both developing this model and for evaluating this and future models