The catalytic core of RNase P

A deletion mutant of the catalytic RNA component of Escherichia coli RNase P missing residues 87-241 retains the ability to interact with the protein component to form a functional catalyst. The deletion of this phylogenetically conserved region significantly increases the Km, indicating that the deleted structures may be important for binding to the precursor tRNA substrate but not for the cleavage reaction. Under some reaction conditions, this RNase P deletion mutant can become a relatively non-specific nuclease, indicating that this RNA's catalytic center may be more exposed. The catalytic core of the RNase P is formed by less than one third of the 377 residues of the RNase P RNA.     

What is driving health system change?

Socially amoral economic forces now drive health system change. The authors, assisted by a panel of experts on employers, health plans, providers, and consumers, discuss current drivers such as (1) employers' price-focused purchasing, without good quality/value measures; (2) health plans' growing successes and market clout; (3) providers declining prospects and fears about their future; and (4) consumers' worries about less choice. Future influences will include Medicare reforms, better information, and pro-consumer regulation of managed care, as well as rising social distress. The health system's future is now open for resolution in an evolving, imperfect market.     

Distribution of abnormal karyotypes among malformed fetuses detected by ultrasound throughout gestation

The participation of sarcoplasmic reticulum Ca2+ release channels in the activation of Ca(2+)-sensitive K+ currents (IK(Ca)) by cyclic dibutyryl GMP was investigated in smooth muscle cells from the circular layer of guinea-pig gastric fundus. All experiments were performed in the presence of 3 microM nicardipine into the bath and low Ca2+ buffering capacity of the pipette-filling solution (pCa 7.4). Ruthenium red (10 microM) as well as its combination with 10 microM heparin abolished the cyclic GMP-induced activation of IK(Ca), while 10 microM heparin remained ineffective. Ryanodine (10 microM) and the subsequently added 1 microM thapsigargin induced a relatively small increase in IK(Ca) amplitudes. The addition of 10 microM ryanodine to 1 microM thapsigargin-containing bath solution caused a vast increase in IK(Ca). It is hypothesyzed that protein kinase G-induced vectorial Ca2+ flux from the cell bulk and sarcoplasmic reticulum Ca2+ stores toward the plasma membrane is realized by a spontaneous Ca(2+)-induced Ca2+ release from a superficially situated Ca2+ store.     

Neurocontrol for lateral vehicle guidance

A solution to autonomous lateral vehicle guidance using a neurocontroller that can learn from measured human-driving data without knowledge of the physical car parameters is discussed. Simulations and practical tests confirm that a small-size feedforward autonomous neural network (21 neurons) can learn to steer a vehicle at high speeds only from looking at human-driving examples. In this way, the network learns the total closed-loop behavior, including the nonlinear dynamics of the vehicle and the driver's individual driving style. The main result of practical investigations is that the neutral controller trained on human-driving examples exhibits an aperiodic behavior that does not vanish at higher speeds (tests performed up to 130 km/h) and produces fewer lateral deviations than the linear state controller     

Prediction and effective yield of a 100 kW grid-connected pv-installation

Following two years operation of the 100 kW grid-connected installation N13 near Domat/Ems, Switzerland, considerable data are available. The yield of the installation was calculated on the basis of long-term meteorological data and of the Meteonorm model. The findings show a close correlation between the forecast and the measured yields. With 100% availability of the inverter in 1991, the performance of the installation rose from 59% in 1990 to 79% in 1991. With standardized analysis of the data, the performance of the grid-connected installation N13 can be compared with other grid-connected installations irrespective of size and location.     

Introduction to geothermal exploration on ascension island, South Atlantic Ocean

The exploration for a geothermal resource on Ascension Island utilized a strategy that initially employed geologic mapping. On the basis of this, subsurface faults were mapped using an aeromagnetic survey. The faults were then explored using electrical resistivity surveys to define areas of potential hydrothermal fluid up-welling. The results of all of these techniques were used to site temperature gradient holes. A deep geothermal exploration well was then drilled in the area with highest heat flow adjacent to a rhyolite-to-trachyte volcanic complex.     

Experimental investigation of systems for synchronizing time scales by means of the Quasar satellite communication system network

Experiments conducted at ground stations of the Quasar satellite communication network using both a null base as well as a base of around 2000 km is described. In experiments with a null base, the time scale transmission error was 1 nsec. Comparison of the results of collocation with data cbtained by the GLONASS system in the course of experiments using a 2100-km base demonstrated a divergence of the results of from 5 to 25 nsec. Translated from Izmeritel'naya Tekhnika, No. 4, pp. 35–38, April, 1996.     

Executing algorithms with hypercube topology on torusmulticomputers

Many parallel algorithms use hypercubes as the communication topology among their processes. When such algorithms are executed on hypercube multicomputers the communication cost is kept minimum since processes can be allocated to processors in such a way that only communication between neighbor processors is required. However, the scalability of hypercube multicomputers is constrained by the fact that the interconnection cost-per-node increases with the total number of nodes. From scalability point of view, meshes and toruses are more interesting classes of interconnection topologies. This paper focuses on the execution of algorithms with hypercube communication topology on multicomputers with mesh or torus interconnection topologies. The proposed approach is based on looking at different embeddings of hypercube graphs onto mesh or torus graphs. The paper concentrates on toruses since an already known embedding, which is called standard embedding, is optimal for meshes. In this paper, an embedding of hypercubes onto toruses of any given dimension is proposed. This novel embedding is called xor embedding. The paper presents a set of performance figures for both the standard and the xor embeddings and shows that the latter outperforms the former for any torus. In addition, it is proven that for a one-dimensional torus (a ring) the xor embedding is optimal in the sense that it minimizes the execution time of a class of parallel algorithms with hypercube topology. This class of algorithms is frequently found in real applications, such as FFT and some class of sorting algorithms     

Compile-time copy elimination

Single-assignment and functional languages have value semantics that do not permit side-effects. This lack of side-effects makes automatic detection of parallelism and optimization for data locality in programs much easier. However, the same property poses a challenge in implementing these languages efficiently. This paper describes an optimizing compiler system that solves the key problem of aggregate copy elimination. The methods developed rely exclusively on compile-time algorithms, including interprocedural analysis, that are applied to an intermediate data flow representation. By dividing the problem into update-in-place and build-in-place analysis, a small set of relatively simple techniques—edge substitution, graph pattern matching, substructure sharing and substructure targeting—was found to be very powerful. If combined properly and implemented carefully, the algorithms eliminate unnecessary copy operations to a very high degree. No run-time overhead is imposed on the compiled programs.