...... D. B. Arimistrong, A. D. Friedm70an, and P. R. Menon 129 On Maximum Inversion with Minimum Inverters S. B. Akers, Jr. 134 Fast Carry-Propagation Iterative Networks ......................................... D. Ferrari 136 A Row Assignment for Delay-Free Realizations of Flow Tables Without Essential Hazards .................. S. H. Unger 146 Structure and Function in Polyfunctional Nets R....

The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...

This paper discusses the development of a new GA for layout design. The GA was already designed and reported. However the implementation used in the earlier work was rudimentary and cumbersome, having no suitable Graphical User Interface, GUI. This paper discusses the intricacies of the algorithm and the GA operators used in previous work. It also reports on implementation of a new GA operator ...

This paper addresses the problem of neighborhood selection for Gaussian graphical models. We present two heuristic algorithms: a forward-backward greedy algorithm for general Gaussian graphical models based on mutual information test, and a threshold-based algorithm for walk summable Gaussian graphical models. Both algorithms are shown to be structurally consistent, and efficient. Numerical res...

the objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a fibonacci hypercube structure. most of the popular algorithms for parallel matrix multiplication can not run on fibonacci hypercube structure, therefore giving a method that can be run on all structures especially fibonacci hypercube structure is necessary for parallel matr...

One of the major successes in computational biology has been the unification, by using the graphical model formalism, of a multitude of algorithms for annotating and comparing biological sequences. Graphical models that have been applied to these problems include hidden Markov models for annotation, tree models for phylogenetics, and pair hidden Markov models for alignment. A single algorithm, ...

Colonization Before and After International Travel Dana M. Blyth, MD; Katrin Mende, PhD; Ashley M. Maranich, MD; Miriam L. Beckius, MPH; Kristie Harnisch; Crystal Rosemann; Wendy C. Zera BS; Clinton K. Murray, MD; Kevin S. Akers, MD; San Antonio Military Medical Center, JBSA Fort Sam Houston, TX; Infectious Disease Clinical Research Program, Uniformed Services University of the Health Sciences,...