The effects of betamethasone derivatives on endotoxin-induced uveitis in guinea pigs

OBJECTIVE AND DESIGN: We reported previously that the betamethasone derivative betamethasone dipropionate behaves as an anti-glucocorticoid in rat endotoxin-induced uveitis (EIU). In the present study, we produced EIU in guinea pigs and investigated the effects of betamethasone dipropionate on the EIU. MATERIAL: Male Hartley guinea pigs were used. TREATMENT: Glucocorticoids were instilled into the eye. METHOD: To elicit EIU, lipopolysaccharide (LPS) was injected into the anterior chamber of the eye. Cell numbers in the aqueous humor after LPS injection were determined by flow cytometry. Prostaglandin E2 (PGE2) production after LPS injection into the anterior chamber was also examined. RESULTS: Intracameral injection of LPS (1 microgram/eye) induced cell infiltration into the anterior chamber and PGE2 production. Betamethasone dipropionate inhibited cell infiltration and PGE2 production more strongly than betamethasone. These results suggest that betamethasone dipropionate is a potent glucocorticoid in guinea pigs. CONCLUSIONS: Structure-activity relationships of glucocorticoids in the guinea pig EIL model may differ from those in the rat EIU model.     

Calcitonin versus etidronate for the treatment of postmenopausal osteoporosis: a meta-analysis of published clinical trials

DNA double-strand breaks are very genotoxic lesions that can result in chromosome aberrations. The current view is that DNA double-strand breaks are repaired most efficiently through homologous recombination in yeast and simple end-joining in mammalian cells. However, recent experiments reveal that both repair pathways are conserved from yeast to mammals, including humans. The challenge ahead is to put the different pieces of the jigsaw together into coherent mechanisms for both pathways and to determine their relative contributions to ionizing-radiation resistance and to the prevention of genetic instability and carcinogenesis.     

Soft commutation in capacitive idling converters

The capacitive idling converters derived from the Cuk, SEPIC, Zeta, and flyback topologies allow soft commutation of power switches without the need for additional circuitry, making it possible to increase the switching frequency while maintaining high efficiency     

Scientific and artistic investigation of multi-dimensional fractals on the AT & T pixel machine

The pipelined architecture and parallel organization of the AT&T Pixel Machine image computer are described and demonstrated with applications for the visualization of multidimensional fractals, particularly linear fractals and quaternion/ stacked Julia sets. Techniques for pushing the Pixel Machine to its peak abilities are described and apply to more recent parallel image computers as well.     

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     

Processor membership in asynchronous distributed systems

Presents protocols for determining processor membership in asynchronous distributed systems that are subject to processor and communication faults. These protocols depend on the placement of a total order on broadcast messages. The types of systems for which each of these protocols is applicable are characterized by the properties of the communication mechanisms and by the availability of stable storage. In the absence of stable storage or of a mechanism for distinguishing promptly delivered messages, the authors show that no membership protocol can exist. They also discuss their experience in implementing these membership protocols