A companion series to the journal Studies in Language. Volumes in this series are functionally and typologically oriented, covering specific topics in language by collecting together data from a wide variety of languages and languages typologies.

/Lt) strains in the form of 10 interval-directed recombinant congenic strains (RCS), with NON/Lt as the background strain, to dissect the genetic interactions involved. All 10 RCS gain significantly more weight than the NON parental strain, but none are as obese as the parental, diabetes-prone NZO. Diabetes

This article cites 269 articles, 74 of which can be accessed free at:

In this thesis, a method is proposed with which good modular artificial neural network structures can be found automatically using a computer program. A number of biological metaphors are incorporated in the method. It will be argued that modular artificial neural networks have a better performance than their non-modular counterparts. The human brain can also be seen as a modular neural network, and the proposed search method is based on the natural process that resulted in the brain: Genetic algorithms are used to imitate evolution, and L-systems are used to model the kind of recipes nature uses in biological growth. A small number of experiments have been done to investigate the possibilities of the method. Preliminary results show that the method does find modular networks, and that those networks outperform `standard' solutions. The method looks very promising, although the experiments done were too limited to draw any general conclusions. One drawback is the large amount of compu...

Interprocessor communication (PC) overheads have emerged as the major performance limitation in parallel processing systems, due to the transmission delays, synchronization overheads, and conflicts for shared communication resources created by data exchange. Accounting for these overheads is essential for attaining efficient hardware utilization. This thesis introduces two new compile-time heuristics for scheduling precedence graphs onto multiprocessor architectures, which account for interprocessor communication overheads and interconnection constraints in the architecture. These algorithms perform scheduling and routing simultaneously to account for irregular interprocessor interconnections, and schedule all communications as well as all computations to eliminate shared resource contention. The first technique, called dynamic-level scheduling, modifies the classical HLFET list scheduling strategy to account for IPC and synchronization overheads. By using dynamically changing priorities to match nodes and processors at each step, this technique attains an equitable tradeoff between load balancing and interprocessor communication cost. This method is fast, flexible, widely targetable, and displays promising perforrnance. The second technique, called declustering, establishes a parallelism hierarchy upon the precedence graph using graph-analysis techniques which explicitly address the tradeoff between exploiting parallelism and incurring communication cost. By systematically decomposing this hierarchy, the declustering process exposes parallelism instances in order of importance, assuring efficient use of the available processing resources. In contrast with traditional clustering schemes, this technique can adjust the level of cluster granularity to suit the characteristics of the specified architecture, leading to a more effective solution.

Investigating grape berry cell wall deconstruction by hydrolytic enzymes by

. The applicability ranges from simple 1D experiments to advanced multiple-pulse and multiple-dimensional experiments, series of simu-lations, parameter scans, complex data manipu-lation/visualization, and iterative fitting of simu-lated to experimental spectra. A major effort has been devoted to optimize

Abstract not found

Beta-Glucosidase from Aspergillus niger NII 08121-

j:FMATTER 29-5-2002 p:2 c:1 black–text