• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 7,441
Next 10 →

Construction of Escherichia coli K-12 in-frame, single-gene knockout mutants: the Keio collection. Mol. Syst. Biol 2:2006.0008

by Tomoya Baba, Takeshi Ara, Miki Hasegawa, Yuki Takai, Yoshiko Okumura, Miki Baba, Kirill A Datsenko, Masaru Tomita, Barry L Wanner, Hirotada Mori , 2006
"... We have systematically made a set of precisely defined, single-gene deletions of all nonessential genes in Escherichia coli K-12. Open-reading frame coding regions were replaced with a kanamycin cassette flanked by FLP recognition target sites by using a one-step method for inactivation of chromosom ..."
Abstract - Cited by 714 (7 self) - Add to MetaCart
We have systematically made a set of precisely defined, single-gene deletions of all nonessential genes in Escherichia coli K-12. Open-reading frame coding regions were replaced with a kanamycin cassette flanked by FLP recognition target sites by using a one-step method for inactivation

Loopy belief propagation for approximate inference: An empirical study. In:

by Kevin P Murphy , Yair Weiss , Michael I Jordan - Proceedings of Uncertainty in AI, , 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon-limit performanc ..."
Abstract - Cited by 676 (15 self) - Add to MetaCart
with loops (undirected cycles). The algorithm is an exact inference algorithm for singly connected networks -the beliefs converge to the cor rect marginals in a number of iterations equal to the diameter of the graph.1 However, as Pearl noted, the same algorithm will not give the correct beliefs for mul

Fusion, Propagation, and Structuring in Belief Networks

by Judea Pearl - ARTIFICIAL INTELLIGENCE , 1986
"... Belief networks are directed acyclic graphs in which the nodes represent propositions (or variables), the arcs signify direct dependencies between the linked propositions, and the strengths of these dependencies are quantified by conditional probabilities. A network of this sort can be used to repre ..."
Abstract - Cited by 484 (8 self) - Add to MetaCart
with the task of fusing and propagating the impacts of new information through the networks in such a way that, when equilibrium is reached, each proposition will be assigned a measure of belief consistent with the axioms of probability theory. It is shown that if the network is singly connected (e.g. tree

2007 . Phaser crystallographic software

by Airlie J. Mccoy, A Ralf W. Grosse-kunstleve, B Paul D. Adams, B Martyn D. Winn, Laurent C. Storoni A, Y J. Read A - 658 – 674
"... Phaser is a program for phasing macromolecular crystal structures by both molecular replacement and experimental phasing methods. The novel phasing algorithms implemented in Phaser have been developed using maximum likelihood and multivariate statistics. For molecular replacement, the new algorithms ..."
Abstract - Cited by 408 (1 self) - Add to MetaCart
Phaser is a program for phasing macromolecular crystal structures by both molecular replacement and experimental phasing methods. The novel phasing algorithms implemented in Phaser have been developed using maximum likelihood and multivariate statistics. For molecular replacement, the new

Transactional Locking II

by Dave Dice, Ori Shalev, Nir Shavit - In Proc. of the 20th Intl. Symp. on Distributed Computing , 2006
"... Abstract. The transactional memory programming paradigm is gaining momentum as the approach of choice for replacing locks in concurrent programming. This paper introduces the transactional locking II (TL2) algorithm, a software transactional memory (STM) algorithm based on a combination of commit-ti ..."
Abstract - Cited by 359 (17 self) - Add to MetaCart
Abstract. The transactional memory programming paradigm is gaining momentum as the approach of choice for replacing locks in concurrent programming. This paper introduces the transactional locking II (TL2) algorithm, a software transactional memory (STM) algorithm based on a combination of commit

Questionnaire on the perceptions of patients about total hip replacement. J Bone Joint Surg [Br

by J. Dawson, R. Fitzpatrick, Jill Dawson, Ray Fitzpatrick, Andrew Carr
"... We developed a 12-item questionnaire forcompletion by patients having shoulder operations other than stabilisation. A prospective study of 111 patients was undertaken before operation and at follow-up six months later. Each patient completed the new questionnaire and the SF36 form. Some filled in th ..."
Abstract - Cited by 229 (19 self) - Add to MetaCart
in the Stanford Health Assessment Questionnaire (HAQ). An orthopaedic surgeon assessed the Constant shoulder score. The single score derived from the questionnaire had a high internal consistency. Reproducibility, examined by test-retest reliability, was found to be satisfactory. The validity of the questionnaire

Evaluating Stream Buffers as a Secondary Cache Replacement

by Subbarao Palacharla - In Proceedings of the 21st Annual International Symposium on Computer Architecture , 1994
"... Today’s commodity microprocessors require a low latency memory system to achieve high sustained performance. The conventional high-performance memory system provides fast data access via a large secondary cache. But large secondary caches can be expensive, particularly in large-scale parallel system ..."
Abstract - Cited by 204 (0 self) - Add to MetaCart
systems with many processors (and thus many caches). We evaluate a memory system design that can be both cost-effective as well as provide better performance, particularly for scientific workloads: a single level of (on-chip) cache backed up only by Jouppi’s stream buffers [10] and a main memory

Disk failures in the real world: What does an MTTF of 1,000,000 hours mean to you?

by Bianca Schroeder, Garth A. Gibson , 2007
"... Component failure in large-scale IT installations is becoming an ever larger problem as the number of components in a single cluster approaches a million. In this paper, we present and analyze field-gathered disk replacement data from a number of large production systems, including high-performance ..."
Abstract - Cited by 245 (9 self) - Add to MetaCart
Component failure in large-scale IT installations is becoming an ever larger problem as the number of components in a single cluster approaches a million. In this paper, we present and analyze field-gathered disk replacement data from a number of large production systems, including high

Wherefore Art Thou R3579X? Anonymized Social Networks, Hidden Patterns, and Structural Steganography

by Lars Backstrom, Cynthia Dwork, Jon Kleinberg , 2007
"... In a social network, nodes correspond to people or other social entities, and edges correspond to social links between them. In an effort to preserve privacy, the practice of anonymization replaces names with meaningless unique identifiers. We describe a family of attacks such that even from a singl ..."
Abstract - Cited by 220 (2 self) - Add to MetaCart
In a social network, nodes correspond to people or other social entities, and edges correspond to social links between them. In an effort to preserve privacy, the practice of anonymization replaces names with meaningless unique identifiers. We describe a family of attacks such that even from a

An Application of the Molecular Replacement Technique in Direct Space to a Known Protein Structure

by Patrick Argos, Geoffrey C. Ford, Michael G. Rossmann , 1975
"... The molecular replacement technique in real space (successive cycles of electron density calculations, averaging among non-crystallographically equivalent subunits, and structure factor calculations based upon the improved averaged density) was applied to glyceraldehyde-3-phosphate dehydrogenase. It ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
. It was shown possible (i) to extend the phases from a known 6.0/ ~ single isomorphous replacement set to at least 4.9. ~ resolution; (ii) to determine a reasonable structure at low resolution given the molecular envelope and non-crystallographic symmetry; and (iii) to use the resulting low-resolution phases
Next 10 →
Results 1 - 10 of 7,441
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University