Results 1 - 10 of 12,752

Single-Pair FRET Characterization of

by Dna Tweezers, Barbara K. Mu Ller, Andreas Reuter, Friedrich C. Simmel, Don C. Lamb , 2006
"... The self-assembly properties of DNA make it an ideal choice for the construction of nanomachines such as DNA tweezers. Because nanomachines function as individual units, they need to be studied on the single-molecule level. From single-pair FRET investigations, we show that “open” tweezers exist in ..."
Abstract - Add to MetaCart
The self-assembly properties of DNA make it an ideal choice for the construction of nanomachines such as DNA tweezers. Because nanomachines function as individual units, they need to be studied on the single-molecule level. From single-pair FRET investigations, we show that “open” tweezers exist

Single-Pair Tunnelling Effect.

by R. G. Mints, I. B. Snapiro , 1994
"... Abstract.- We consider the Josephson-vortex motion in a long one-dimensional Josephson junction in a thin film. We show that this Josephson vortex is similar to a mesoscopic capacitor. We demonstrate that a single-Cooper-pair tunnelling results in non-linear Bloch-type oscillations of a Josephson vo ..."
Abstract - Add to MetaCart
Abstract.- We consider the Josephson-vortex motion in a long one-dimensional Josephson junction in a thin film. We show that this Josephson vortex is similar to a mesoscopic capacitor. We demonstrate that a single-Cooper-pair tunnelling results in non-linear Bloch-type oscillations of a Josephson

Fast single-pair simrank computation

by Pei Li, Hongyan Liu, Jeffrey Xu, Yu Jun, He Xiaoyong Du - In Proc. of the SIAM Intl. Conf. on Data Mining (SDM2010 , 2010
"... SimRank is an intuitive and effective measure for link-based similarity that scores similarity between two nodes as the first-meeting probability of two random surfers, based on the random surfer model. However, when a user queries the similarity of a given node-pair based on SimRank, the existing a ..."
Abstract - Cited by 11 (2 self) - Add to MetaCart
approaches need to compute the similarities of other node-pairs beforehand, which we call an all-pair style. In this paper, we propose a Single-Pair SimRank approach. Without accuracy loss, this approach performs an iterative computation to obtain the similarity of a single node-pair. The time cost of our

Multipoint quantitative-trait linkage analysis in general pedigrees

by Laura Almasy, John Blangero - Am. J. Hum. Genet , 1998
"... Multipoint linkage analysis of quantitative-trait loci (QTLs) has previously been restricted to sibships and small pedigrees. In this article, we show how variance-component linkage methods can be used in pedigrees of arbitrary size and complexity, and we develop a general framework for multipoint i ..."
Abstract - Cited by 567 (60 self) - Add to MetaCart
chromosome for each relative pair. We have derived correlations in IBD sharing as a function of chromosomal distance for relative pairs in general pedigrees and provide a simple framework whereby these correlations can be easily obtained for any relative pair related by a single line of descent

Spatio-temporal energy models for the Perception of Motion

by Edward H. Adelson, James R. Bergen - J. OPT. SOC. AM. A , 1985
"... A motion sequence may be represented as a single pattern in x-y-t space; a velocity of motion corresponds to a three-dimensional orientation in this space. Motion sinformation can be extracted by a system that responds to the oriented spatiotemporal energy. We discuss a class of models for human mot ..."
Abstract - Cited by 904 (9 self) - Add to MetaCart
A motion sequence may be represented as a single pattern in x-y-t space; a velocity of motion corresponds to a three-dimensional orientation in this space. Motion sinformation can be extracted by a system that responds to the oriented spatiotemporal energy. We discuss a class of models for human

A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks

by Shafi Goldwasser, Silvio Micali, Ronald L. Rivest , 1995
"... We present a digital signature scheme based on the computational diculty of integer factorization. The scheme possesses the novel property of being robust against an adaptive chosen-message attack: an adversary who receives signatures for messages of his choice (where each message may be chosen in a ..."
Abstract - Cited by 959 (40 self) - Add to MetaCart
in a way that depends on the signatures of previously chosen messages) can not later forge the signature of even a single additional message. This may be somewhat surprising, since the properties of having forgery being equivalent to factoring and being invulnerable to an adaptive chosen-message attack

An extensive empirical study of feature selection metrics for text classification

by George Forman, Isabelle Guyon, André Elisseeff - J. of Machine Learning Research , 2003
"... Machine learning for text classification is the cornerstone of document categorization, news filtering, document routing, and personalization. In text domains, effective feature selection is essential to make the learning task efficient and more accurate. This paper presents an empirical comparison ..."
Abstract - Cited by 496 (15 self) - Add to MetaCart
challenging for induction algorithms. A new evaluation methodology is offered that focuses on the needs of the data mining practitioner faced with a single dataset who seeks to choose one (or a pair of) metrics that are most likely to yield the best performance. From this perspective, BNS was the top single

Fibonacci Heaps and Their Uses in Improved Network optimization algorithms

by Michael L. Fredman, Robert Endre Tarjan , 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated F-heaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. F-heaps support arbitrary deletion from an n-item heap in qlogn) amortized tim ..."
Abstract - Cited by 739 (18 self) - Add to MetaCart
in the problem graph: ( 1) O(n log n + m) for the single-source shortest path problem with nonnegative edge lengths, improved from O(m logfmh+2)n); (2) O(n*log n + nm) for the all-pairs shortest path problem, improved from O(nm lo&,,,+2,n); (3) O(n*logn + nm) for the assignment problem (weighted bipartite

Single-pair vs. Multiple-pair Answers: Wh in-situ and Scope

by Veneeta Dayal Rutgers, Veneeta Dayal , 2002
"... this paper does not rest on the availability of single-pair answers in simple questions but on the fact that multiple-pair answers readily available in simple questions seem to be unavailable in contexts like (3a). As Pope points out, REF-Qs are intonationally distinct from echo questions. REF ..."
Abstract - Cited by 6 (3 self) - Add to MetaCart
this paper does not rest on the availability of single-pair answers in simple questions but on the fact that multiple-pair answers readily available in simple questions seem to be unavailable in contexts like (3a). As Pope points out, REF-Qs are intonationally distinct from echo questions

A Control-Theoretic Approach to Flow Control

by Srinivasan Keshav , 1991
"... This paper presents a control-theoretic approach to reactive flow control in networks that do not reserve bandwidth. We assume a round-robin-like queue service discipline in the output queues of the network’s switches, and propose deterministic and stochastic models for a single conversation in a ne ..."
Abstract - Cited by 454 (8 self) - Add to MetaCart
This paper presents a control-theoretic approach to reactive flow control in networks that do not reserve bandwidth. We assume a round-robin-like queue service discipline in the output queues of the network’s switches, and propose deterministic and stochastic models for a single conversation in a
Results 1 - 10 of 12,752