Use of a two-wire microwave line at the boundary of the investigated zone to measure the electron density in a low-temperature plasma

A new method based on a two-wire line has been developed for noncontact diagnostics of a low-temperature plasma and its fluxes in channels with complex profiles. This method provides good spatial and time resolution. Pis’ma Zh. Tekh. Fiz. 23, 1–7 (July 26, 1997)     

Triple check for antigen specificity of B cells during germinal centre reactions

Somatic hypermutation of the immunoglobulin variable genes during germinal reactions might permit the expansion of B-cell clones with unwanted (e.g. autoreactive) specificity. Here, Ernst Lindhout and colleagues propose three antigen-specific checkpoints that ensure the appropriate antigen specificity of activated B cells is maintained by regulating the activation, selection and further differentiation of B cells.     

In times of survival, the right of silence

The purpose of this study was to assess cortical and cancellous bone responses to unilateral limb immobilization and, subsequently, to remobilization with exercise, in a young adult canine model. Right forelimbs of 14 1-2-year old mongrel dogs were immobilized in a non-weight-bearing position by a bandage for 16 weeks. Six control dogs were untreated. At 16 weeks, seven immobilized and three control dogs were euthanized. The remaining seven immobilized dogs began a recovery protocol consisting of 16 weeks of kennel confinement (without the right forelimb bandaged) followed by 16 weeks of treadmill exercise conducted three times per week. These seven dogs and three control dogs were euthanized at 48 weeks. Bone mineral density of the proximal radii was determined with dual-energy X-ray absorptiometry and humeral middiaphyseal cross-sectional areas were determined with computed tomography. Humeri were tested in cranio-caudal three-point bending to failure. Cancellous bone cores from the lateral humeral condyles had wet apparent density determined and were tested to failure in compression. Mechanical properties, bone density, and cross-sectional areas were compared between immobilized (right forelimb), contralateral weight bearing (left forelimb), and control forelimbs with Kruskal-Wallis and post hoc tests. At 16 weeks, bone mineral density, cortical load, yield, and stiffness as well as cancellous bone failure stress, yield stress, and modulus were significantly lower (p < 0.02) for immobilized limbs than control limbs. Immobilized limb cancellous bone mechanical properties were 28%-74% of control values, and cortical bone mechanical properties were 71%-98% of control values. After 32 weeks of remobilization, cortical and cancellous bone mechanical properties were not different from control values except that cortical bone failure stress and modulus were significantly higher (p < 0.01) between remobilized and control limbs. In summary, 16 weeks of forelimb immobilization was associated with significantly lower mechanical properties, and with greater differences in cancellous than cortical bone properties. Mechanical properties were not different from control values after 32 weeks of recovery that included 16 weeks of treadmill exercise.     

Endogenous and copper-induced lipid peroxidation and antioxidant activity of serum in hypercholesterolemic subjects

In order to observe the transport ability of peritoneum to small molecular substances, peritoneal equilibration test (PET) was performed in 52 CAPD patients. By analysing the relationship between peritoneal transport function and dialysis adequacy, we found the average urea KT/V and Cr were significantly lower in high and low transport groups (n = 6 and n = 2) than in high average and low average groups (n = 35 and n = 9). According to the results of PET, we adjusted the dialysis program of 11 patients and the dialysis adequacy was markedly improved. We concluded that PET was helpful for selecting and adjusting CAPD program, and discussed some questions which should be payed more attention in PET operation.     

Low-truncation-error finite difference equations for photonicssimulation. II. Vertical-cavity surface-emitting lasers

For part I see, ibid., p. 134, 1998. The basic approach outlined in the previous article is applied to the difficult problem of computing the optical modes of a vertical-cavity surface-emitting laser. The formulation utilizes a finite difference equation based upon the lowest order term of an infinite series solution of the scalar Helmholtz equation in a local region. This difference equation becomes exact in the one-dimensional (1-D) limit, and is thus ideally suited for nearly 1-D devices such as vertical-cavity lasers. The performance of the resulting code is tested on both a simple cylindrical cavity with known solutions and an oxide-confined vertical-cavity laser structure, and the results compared against second-order-accurate code based upon Crank-Nicolson differencing     

Function materialization in object bases: design, realization, andevaluation

View materialization is a well-known optimization technique of relational database systems. We present a similar, yet more powerful, optimization concept for object-oriented data models: function materialization. Exploiting the object-oriented paradigm-namely, classification, object identity, and encapsulation-facilitates a rather easy incorporation of function materialization into (existing) object-oriented systems. Only those types (classes) whose instances are involved in some materialization are appropriately modified and recompiled, thus leaving the remainder of the object system invariant. Furthermore, the exploitation of encapsulation (information hiding) and object identity provides for additional performance tuning measures that drastically decrease the invalidation and rematerialization overhead incurred by updates in the object base. First, it allows us to cleanly separate the object instances that are irrelevant for the materialized functions from those that are involved in the materialization of some function result, and this to penalize only those involved objects upon update. Second, the principle of information hiding facilitates fine-grained control over the invalidation of precomputed results. Based on specifications given by the data type implementor, the system can exploit operational semantics to better distinguish between update operations that invalidate a materialized result and those that require no rematerialization. The paper concludes with a quantitative analysis of function materialization based on two sample performance benchmarks obtained from our experimental object base system GOM     

RAPS: a rule-based language for specifying resource allocation andtime-tabling problems

A general language for specifying resource allocation and time-tabling problems is presented. The language is based on an expert system paradigm that was developed previously by the authors and that enables the solution of resource allocation problems by using experts' knowledge and heuristics. The language enables the specification of a problem in terms of resources, activities, allocation rules, and constraints, and thus provides a convenient knowledge acquisition tool. The language syntax is powerful and allows the specification of rules and constraints that are very difficult to formulate with traditional approaches, and it also supports the specification of various control and backtracking strategies. We constructed a generalized inference engine that runs compiled resource allocation problem specification language (RAPS) programs and provides all necessary control structures. This engine acts as an expert system shell and is called expert system for resource allocation (ESRA). The performance of RAPS combined with ESRA is demonstrated by analyzing its solution of a typical resource allocation problem     

Sort vs. hash revisited

Efficient algorithms for processing large volumes of data are very important both for relational and new object-oriented database systems. Many query-processing operations can be implemented using sort- or hash-based algorithms, e.g. intersections, joins, and duplicate elimination. In the early relational database systems, only sort-based algorithms were employed. In the last decade, hash-based algorithms have gained acceptance and popularity, and are often considered generally superior to sort-based algorithms such as merge-join. In this article, we compare the concepts behind sort- and hash-based query-processing algorithms and conclude that (1) many dualities exist between the two types of algorithms, (2) their costs differ mostly by percentages rather than by factors, (3) several special cases exist that favor one or the other choice, and (4) there is a strong reason why both hash- and sort-based algorithms should be available in a query-processing system. Our conclusions are supported by experiments performed using the Volcano query execution engine