• 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 56,807
Next 10 →

Crystallography & NMR system: A new software suite for macromolecular structure determination.

by Axel T Brünger , Paul D Adams , G Marius Clore , Warren L Delano , Piet Gros , Ralf W Grosse-Kunstleve , Jian-Sheng Jiang , John Kuszewski , Michael Nilges , Navraj S Pannu , Randy J Read , Luke M Rice , Thomas Simonson , Gregory L Warren - Acta Crystallogr. D Biol. Crystallogr. , 1998
"... Abstract A new software suite, called Crystallography & NMR System (CNS), has been developed for macromolecular structure determination by X-ray crystallography or solution nuclear magnetic resonance (NMR) spectroscopy. In contrast to existing structure determination programs the architecture o ..."
Abstract - Cited by 1411 (6 self) - Add to MetaCart
Abstract A new software suite, called Crystallography & NMR System (CNS), has been developed for macromolecular structure determination by X-ray crystallography or solution nuclear magnetic resonance (NMR) spectroscopy. In contrast to existing structure determination programs the architecture

Guarded Commands, Nondeterminacy and Formal Derivation of Programs

by Edsger W. Dijkstra , 1975
"... So-called "guarded commands" are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniqilely determined by the initial state. ..."
Abstract - Cited by 527 (0 self) - Add to MetaCart
So-called "guarded commands" are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniqilely determined by the initial state

The Coordination of Arm Movements: An Experimentally Confirmed Mathematical Model

by Tamar Flash, Neville Hogans - Journal of neuroscience , 1985
"... This paper presents studies of the coordination of volun-tary human arm movements. A mathematical model is for-mulated which is shown to predict both the qualitative fea-tures and the quantitative details observed experimentally in planar, multijoint arm movements. Coordination is modeled mathematic ..."
Abstract - Cited by 688 (18 self) - Add to MetaCart
mathematically by defining an objective function, a measure of performance for any possi-ble movement. The unique trajectory which yields the best performance is determined using dynamic optimization the-ory. In the work presented here, the objective function is the square of the magnitude of jerk (rate

Fairness and Retaliation: The Economics of Reciprocity

by Ernst Fehr, Simon Gächter - JOURNAL OF ECONOMIC PERSPECTIVES , 2000
"... This paper shows that reciprocity has powerful implications for many economic domains. It is an important determinant in the enforcement of contracts and social norms and enhances the possibilities of collective action greatly. Reciprocity may render the provision of explicit incentive inefficient b ..."
Abstract - Cited by 583 (13 self) - Add to MetaCart
This paper shows that reciprocity has powerful implications for many economic domains. It is an important determinant in the enforcement of contracts and social norms and enhances the possibilities of collective action greatly. Reciprocity may render the provision of explicit incentive inefficient

Multiparty Communication Complexity

by Danny Dolev, Tomás Feder , 1989
"... A given Boolean function has its input distributed among many parties. The aim is to determine which parties to tMk to and what information to exchange with each of them in order to evaluate the function while minimizing the total communication. This paper shows that it is possible to obtain the Boo ..."
Abstract - Cited by 760 (22 self) - Add to MetaCart
A given Boolean function has its input distributed among many parties. The aim is to determine which parties to tMk to and what information to exchange with each of them in order to evaluate the function while minimizing the total communication. This paper shows that it is possible to obtain

Low-Power CMOS Digital Design

by Anantha P. Chandrakasan, Samuel Sheng, Robert W. Brodersen - JOURNAL OF SOLID-STATE CIRCUITS. VOL 27, NO 4. APRIL 1992 413 , 1992
"... Motivated by emerging battery-operated applications that demand intensive computation in portable environments, techniques are investigated which reduce power consumption in CMOS digital circuits while maintaining computational throughput. Techniques for low-power operation are shown which use the ..."
Abstract - Cited by 580 (20 self) - Add to MetaCart
the lowest possible supply voltage coupled with architectural, logic style, circuit, and technology optimizations. An architectural-based scaling strategy is presented which indicates that the optimum voltage is much lower than that determined by other scaling considerations. This optimum is achieved

Algebraic Graph Theory

by Chris Godsil, Mike Newman , 2011
"... Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area is the investiga ..."
Abstract - Cited by 892 (13 self) - Add to MetaCart
for determining just how large is actually possible; this theory rests on Delsarte’s thesis [4], which showed how to use schemes to translate the problem into a question that be solved by linear programming.

Proof-Carrying Code

by George C. Necula , 1997
"... This paper describes proof-carrying code (PCC), a mechanism by which a host system can determine with certainty that it is safe to execute a program supplied (possibly in binary form) by an untrusted source. For this to be possible, the untrusted code producer must supply with the code a safety proo ..."
Abstract - Cited by 1240 (27 self) - Add to MetaCart
This paper describes proof-carrying code (PCC), a mechanism by which a host system can determine with certainty that it is safe to execute a program supplied (possibly in binary form) by an untrusted source. For this to be possible, the untrusted code producer must supply with the code a safety

Detectability of Discrete Event Systems

by Shaolong Shu, Feng Lin, Hao Ying
"... In this paper, we investigate the detectability problem in discrete event systems. We assume that we do not know initially which state the system is in. The problem is to determine the current and subsequent states of the system based on a sequence of observation. The observation includes partial ev ..."
Abstract - Cited by 806 (14 self) - Add to MetaCart
In this paper, we investigate the detectability problem in discrete event systems. We assume that we do not know initially which state the system is in. The problem is to determine the current and subsequent states of the system based on a sequence of observation. The observation includes partial

Weighted Voting for Replicated Data

by David K. Gifford , 1979
"... In a new algorithm for maintaining replicated data, every copy of a replicated file is assigned some number of votes. Every transaction collects a read quorum of r votes to read a file, and a write quorum of w votes to write a file, such that r+w is greater than the total number number of votes assi ..."
Abstract - Cited by 598 (0 self) - Add to MetaCart
assigned to the file. This ensures that there is a non-null intersection between every read quorum and every write quorum. Version numbers make it possible to determine which copies are current. The reliability and performance characteristics of a replicated file can be controlled by appropriately choosing
Next 10 →
Results 1 - 10 of 56,807
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