A magnetic resonance imaging study of planum temporale asymmetry in men with developmental dyslexia

The influence of ionic strength and composition on the binding and inhibition of human leukocyte elastase by glycosaminoglycans with variable degree and position of sulfation was investigated. The kinetic mechanism of inhibition had a hyperbolic, mixed-type character with a competitive component that was promoted by low ionic strength, reduced by phosphate ions, and which also depended on the substrate and glycosaminoglycan structure. Enzyme binding was a cooperative phenomenon that varied with ionic strength and composition. The inhibition patterns correlated with the cationic character of elastase and with the distribution of arginines on its molecular surface, most notably with residues located in the vicinity of the substrate binding region. The order of affinity for elastase binding was chondroitin 4-sulfate < chondroitin 6-sulfate < dermatan sulfate, iduronate-containing derivatives being superior with respect to the glucuronate-containing counterparts. Additional sulfation at both the 4- and 6- positions or at the N- and 4-positions of the N-acetylgalactosamine moiety decidedly improved the inhibitory efficiency. The results highlight a fundamental physiological role of enzyme-glycosaminoglycan interactions. In the azurophil granule of the human polymorphonuclear neutrophil, elastase and other enzymes are bound to a matrix of chondroitin 4-sulfate because this is the only glycosaminoglycan that simultaneously offers good binding for enzyme compartmentalization together with prompt release from the bound state at the onset of phagocytosis.     

Differences in the yields of dicentrics and reciprocal translocations observed in the chromosomes of irradiated human skin fibroblasts and blood lymphocytes from the same healthy individuals

The modulatory role of locally produced cyclooxygenase products and endothelium-derived nitric oxide in controlling vascular tone was investigated in bovine intra-mammary artery. Vascular reactivity initiated by vasoactive compounds, endothelin-1 (ET-1), bradykinin (BK), and substance P (SP) was measured isometrically in an isolated tissue bath. The effects of a cyclooxygenase inhibitor, indomethacin (10(-5) M) and an inhibitor of nitric oxide production, N omega-Nitro L-Arginine (L-NNA: 3 x 10(-4) M) were determined during agonist-mediated responses. Indomethacin alone markedly enhanced vascular contraction produced by ET-1, while L-NNA did not. Inhibition of endothelium-derived nitric oxide synthesis by L-NNA, however, significantly attenuated BK- and SP-induced vascular relaxations, whereas indomethacin had slight influence. The potentiation between indomethacin and L-NNA in regulating vasomotor tone was not observed in this vascular bed. Thus, it appeared that both the cyclooxygenase and endothelium-derived nitric oxide pathways participated in modifying vascular reactivity. Domination of one pathway over the other depended upon the agonist used to stimulate vascular tissue.     

Site and query scheduling policies in multicomputer databasesystems

We study run-time issues, such as site allocation and query scheduling policies, in executing read-only queries in a hierarchical, distributed memory, multicomputer system. The particular architecture considered is based on the hypercube interconnection. The data are stored in a base cube, which is controlled by a control cube and host node hierarchy. Input query trees are transformed into operation sequence trees, and the operation sequences become the units of scheduling. These sequences are scheduled dynamically at run-time. Algorithms for dynamic site allocation are provided. Several query scheduling policies that support interquery concurrency are also studied. Average query completion times and initiation delays are obtained for the various policies using simulations     

Evaluation of a parallel branch-and-bound algorithm on a class ofmultiprocessors

We propose and evaluate a parallel “decomposite best-first” search branch-and-bound algorithm (dbs) for MIN-based multiprocessor systems. We start with a new probabilistic model to estimate the number of evaluated nodes for a serial best-first search branch-and-bound algorithm. This analysis is used in predicting the parallel algorithm speed-up. The proposed algorithm initially decomposes a problem into N subproblems, where N is the number of processors available in a multiprocessor. Afterwards, each processor executes the serial best-first search to find a local feasible solution. Local solutions are broadcasted through the network to compute the final solution. A conflict-free mapping scheme, known as the step-by-step spread, is used for subproblem distribution on the MIN. A speedup expression for the parallel algorithm is then derived using the serial best-first search node evaluation model. Our analysis considers both computation and communication overheads for providing realistic speed-up. Communication modeling is also extended for the parallel global best-first search technique. All the analytical results are validated via simulation. For large systems, when communication overhead is taken into consideration, it is observed that the parallel decomposite best-first search algorithm provides better speed-up compared to other reported schemes     

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     

Partitioned encoding schemes for algorithm-based fault tolerance inmassively parallel systems

Considers the applicability of algorithm based fault tolerance (ABET) to massively parallel scientific computation. Existing ABET schemes can provide effective fault tolerance at a low cost For computation on matrices of moderate size; however, the methods do not scale well to floating-point operations on large systems. This short note proposes the use of a partitioned linear encoding scheme to provide scalability. Matrix algorithms employing this scheme are presented and compared to current ABET schemes. It is shown that the partitioned scheme provides scalable linear codes with improved numerical properties with only a small increase in hardware and time overhead     

The performance of cache-based error recovery in multiprocessors

Several variations of cache-based checkpointing for rollback error recovery from transient errors in shared-memory multiprocessors have been recently developed. By modifying the cache replacement policy, these techniques use the inherent redundancy in the memory hierarchy to periodically checkpoint the computation state. Three schemes, different in the manner in which they avoid rollback propagation, are evaluated in this paper. By simulation with address traces from parallel applications running on an Encore Multimax shared-memory multiprocessor, we evaluate the performance effect of integrating the recovery schemes in the cache coherence protocol. Our results indicate that the cache-based schemes can provide checkpointing capability with low performance overhead, but with uncontrollable high variability in the checkpoint interval