Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,895
The Large-Scale Organization of Metabolic Networks
, 2000
"... In a cell or microorganism the processes that generate mass, energy, information transfer, and cell fate specification are seamlessly integrated through a complex network of various cellular constituents and reactions. However, despite the key role these networks play in sustaining various cellular ..."
Abstract
-
Cited by 609 (7 self)
- Add to MetaCart
functions, their large-scale structure is essentially unknown. Here we present the first systematic comparative mathematical analysis of the metabolic networks of 43 organisms representing all three domains of life. We show that, despite significant variances in their individual constituents and pathways
Scheduler Activations: Effective Kernel Support for the User-Level Management of Parallelism
- ACM Transactions on Computer Systems
, 1992
"... Threads are the vehicle,for concurrency in many approaches to parallel programming. Threads separate the notion of a sequential execution stream from the other aspects of traditional UNIX-like processes, such as address spaces and I/O descriptors. The objective of this separation is to make the expr ..."
Abstract
-
Cited by 475 (21 self)
- Add to MetaCart
been fully satisfactory. This paper addresses this dilemma. First, we argue that the performance of kernel threads is inherently worse than that of user-level threads, rather than this being an artifact of existing implementations; we thus argue that managing par- allelism at the user level
An efficient algorithm for exploiting multiple arithmetic units
- IBM JOURNAL OF RESEARCH AND DEVELOPMENT
, 1967
"... This paper describes the methods employed in the floating-point area of the System/360 Model 91 to exploit the existence of multiple execution units. Basic to these techniques is a simple common data busing and register tagging scheme which permits simultaneous execution of independent instructions ..."
Abstract
-
Cited by 391 (1 self)
- Add to MetaCart
while preserving the essential precedences inherent in the instruction stream. The common data bus improves performance by efficiently utilizing the execution units without requiring specially optimized code. Instead, the hardware, by 'looking ahead' about eight instructions, automatically
Randomized Experiments from Non-random Selection in the U.S. House Elections
- Journal of Econometrics
, 2008
"... This paper establishes the relatively weak conditions under which causal inferences from a regression-discontinuity (RD) analysis can be as credible as those from a randomized experiment, and hence under which the validity of the RD design can be tested by examining whether or not there is a discont ..."
Abstract
-
Cited by 377 (17 self)
- Add to MetaCart
is as good as randomized in a local neighborhood of V = v0. These ideas are illustrated in an analysis of U.S. House elections, where the inherent uncertainty in the final vote count is plausible, which would imply that the party that wins is essentially randomized among elections decided by a narrow margin
Lockup-free instruction fetch/prefetch cache organization
- In Proceedings of the 8th Annual International Symposium on Computer Architecture
, 1981
"... ABSTRACT In the past decade. there has been much literature describing various cache organizatrons that exploit general programming idiosyncrasies to obtain maxrmum hit rate (the probability that a requested datum is now resident in the cache). Little. if any, has been presented to exploit: (1) the ..."
Abstract
-
Cited by 365 (0 self)
- Add to MetaCart
) the inherent dual input nature of the cache and (2) the many-datum reference type central processor instructions. No matter how high the cache hit rate is, a cache miss may impose a penalty on subsequent cache references. This penalty is the necessny of waiting until the missed requested datum is received from
Discovery of Inference Rules for Question Answering
- Natural Language Engineering
, 2001
"... One of the main challenges in question-answering is the potential mismatch between the expressions in questions and the expressions in texts. While humans appear to use inference rules such as “X writes Y ” implies “X is the author of Y ” in answering questions, such rules are generally unavailable ..."
Abstract
-
Cited by 309 (7 self)
- Add to MetaCart
to question-answering systems due to the inherent difficulty in constructing them. In this paper, we present an unsupervised algorithm for discovering inference rules from text. Our algorithm is based on an extended version of Harris ’ Distributional Hypothesis, which states that words that occurred
Social Vulnerability to Environmental Hazards
- Social Science Quarterly
"... For over 50 years, hazards researchers have focused on a series of fundamental ques-tions: 1) what is the human occupancy of hazard zones? 2) How do people and societies respond to environmental hazards and what factors influence their choice of adjust-ments? 3) How do you mitigate the risk and impa ..."
Abstract
-
Cited by 269 (4 self)
- Add to MetaCart
and impact of environmental hazards? Within the last decade or so, another question was added to our ongoing list of imponderables: are societies becoming more vulnerable to environmental hazards? Vulnerability, broadly defined as the potential for loss, is an essential concept in hazards research
Inherent Contradictions in Higgs Boson Theory
, 2015
"... Abstract: The analysis relies on several general principles such as the Variational Principle and the broader sense of Bohr's Correspondence Principle. These principles together with other elements of theoretical physics provide a set of restrictions by which every quantum theory must abide. Th ..."
Abstract
- Add to MetaCart
. The paper proves that the Higgs boson theory contains many contradictions that undermine its physical validity. It is also explained why the 125 GeV particle H 0 which was recently found at CERN cannot be a
Rates of convergence of the Hastings and Metropolis algorithms
- ANNALS OF STATISTICS
, 1996
"... We apply recent results in Markov chain theory to Hastings and Metropolis algorithms with either independent or symmetric candidate distributions, and provide necessary and sufficient conditions for the algorithms to converge at a geometric rate to a prescribed distribution ß. In the independence ca ..."
Abstract
-
Cited by 203 (17 self)
- Add to MetaCart
case (in IR k ) these indicate that geometric convergence essentially occurs if and only if the candidate density is bounded below by a multiple of ß; in the symmetric case (in IR only) we show geometric convergence essentially occurs if and only if ß has geometric tails. We also evaluate recently
An empirical study of code clone genealogies
, 2005
"... It has been broadly assumed that code clones are inherently bad and that eliminating clones by refactoring would solve the problems of code clones. To investigate the validity of this assumption, we developed a formal definition of clone evolution and built a clone genealogy tool that automatically ..."
Abstract
-
Cited by 191 (9 self)
- Add to MetaCart
It has been broadly assumed that code clones are inherently bad and that eliminating clones by refactoring would solve the problems of code clones. To investigate the validity of this assumption, we developed a formal definition of clone evolution and built a clone genealogy tool that automatically
Results 1 - 10
of
2,895
