Results 1  10
of
1,993,386
The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm
, 1997
"... In this paper, we analyze a performance model for the TCP Congestion Avoidance algorithm. The model predicts the bandwidth of a sustained TCP connection subjected to light to moderate packet losses, such as loss caused by network congestion. It assumes that TCP avoids retransmission timeouts and alw ..."
Abstract

Cited by 648 (18 self)
 Add to MetaCart
In this paper, we analyze a performance model for the TCP Congestion Avoidance algorithm. The model predicts the bandwidth of a sustained TCP connection subjected to light to moderate packet losses, such as loss caused by network congestion. It assumes that TCP avoids retransmission timeouts
Macroscopic strings as heavy quarks in large N gauge theory and Antide Sitter supergravity
 PHYS. J. C22
"... Maldacena has put forward large N correspondence between superconformal field theories on the brane and antide Sitter supergravity in spacetime. We study some aspects of the correspondence between N = 4 superconformal gauge theory on D3brane and maximal supergravity on adS5 × S5 by introducing mac ..."
Abstract

Cited by 510 (1 self)
 Add to MetaCart
macroscopic strings as heavy (anti)quark probes. The macroscopic strings are semiinfinite Type IIB strings ending on D3brane worldvolume. We first study deformation and fluctuation of D3brane when a macroscopic BPS string is attached. We find that both dynamics and boundary conditions agree with those
Protecting respondents’ identities in microdata release
 In IEEE Transactions on Knowledge and Data Engineering (TKDE
, 2001
"... Today’s globally networked society places great demand on the dissemination and sharing of information. While in the past released information was mostly in tabular and statistical form, many situations call today for the release of specific data (microdata). In order to protect the anonymity of the ..."
Abstract

Cited by 503 (32 self)
 Add to MetaCart
) of the information released by using generalization and suppression techniques. We introduce the concept of minimal generalization that captures the property of the release process not to distort the data more than needed to achieve kanonymity, and present an algorithm for the computation of such a generalization
IdentityBased Encryption from the Weil Pairing
, 2001
"... We propose a fully functional identitybased encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational DiffieHellman problem. Our system is based on bilinear maps between groups. The Weil pairing on elliptic ..."
Abstract

Cited by 1699 (29 self)
 Add to MetaCart
We propose a fully functional identitybased encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational DiffieHellman problem. Our system is based on bilinear maps between groups. The Weil pairing
Relations and their basic properties
 Journal of Formalized Mathematics
, 1989
"... Summary. We define here: mode Relation as a set of pairs, the domain, the codomain, and the field of relation; the empty and the identity relations, the composition of relations, the image and the inverse image of a set under a relation. Two predicates, = and ⊆, and three functions, ∪, ∩ and \ are ..."
Abstract

Cited by 1069 (6 self)
 Add to MetaCart
Summary. We define here: mode Relation as a set of pairs, the domain, the codomain, and the field of relation; the empty and the identity relations, the composition of relations, the image and the inverse image of a set under a relation. Two predicates, = and ⊆, and three functions
Evaluating the Accuracy of SamplingBased Approaches to the Calculation of Posterior Moments
 IN BAYESIAN STATISTICS
, 1992
"... Data augmentation and Gibbs sampling are two closely related, samplingbased approaches to the calculation of posterior moments. The fact that each produces a sample whose constituents are neither independent nor identically distributed complicates the assessment of convergence and numerical accurac ..."
Abstract

Cited by 583 (14 self)
 Add to MetaCart
Data augmentation and Gibbs sampling are two closely related, samplingbased approaches to the calculation of posterior moments. The fact that each produces a sample whose constituents are neither independent nor identically distributed complicates the assessment of convergence and numerical
Logical foundations of objectoriented and framebased languages
 JOURNAL OF THE ACM
, 1995
"... We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, ..."
Abstract

Cited by 880 (64 self)
 Add to MetaCart
We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods
Multipoint quantitativetrait linkage analysis in general pedigrees
 Am. J. Hum. Genet
, 1998
"... Multipoint linkage analysis of quantitativetrait loci (QTLs) has previously been restricted to sibships and small pedigrees. In this article, we show how variancecomponent linkage methods can be used in pedigrees of arbitrary size and complexity, and we develop a general framework for multipoint i ..."
Abstract

Cited by 549 (56 self)
 Add to MetaCart
identitybydescent (IBD) probability calculations. We extend the sibpair multipoint mapping approach of Fulker et al. to general relative pairs. This multipoint IBD method uses the proportion of alleles shared identical by descent at genotyped loci to estimate IBD sharing at arbitrary points along a
Classical negation in logic programs and disjunctive databases
 New Generation Computing
, 1991
"... An important limitation of traditional logic programming as a knowledge representation tool, in comparison with classical logic, is that logic programming does not allow us to deal directly with incomplete information. In order to overcome this limitation, we extend the class of general logic progra ..."
Abstract

Cited by 1050 (76 self)
 Add to MetaCart
programs and disjunctive databases more easily when classical negation is available. Computationally, classical negation can be eliminated from extended programs by a simple preprocessor. Extended programs are identical to a special case of default theories in the sense of Reiter. 1
The LargeScale 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 599 (7 self)
 Add to MetaCart
, these metabolic networks display the same topologic scaling properties demonstrating striking similarities to the inherent organization of complex nonbiological systems. This suggests that the metabolic organization is not only identical for all living organisms, but complies with the design principles of robust
Results 1  10
of
1,993,386