Results 1  10
of
595,224
Link length of rectilinear Hamiltonian tours
 in grids, Ars Combinatoria
, 1994
"... The link length of a walk in a multidimensional grid is the number of straight line segments constituting the walk. Alternatively, it is the number of turns that a mobile unit needs to perform in traversing the walk. A rectilinear walk consists of straight line segments which are parallel to the mai ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
The link length of a walk in a multidimensional grid is the number of straight line segments constituting the walk. Alternatively, it is the number of turns that a mobile unit needs to perform in traversing the walk. A rectilinear walk consists of straight line segments which are parallel
Capacity of a Mobile MultipleAntenna Communication Link in Rayleigh Flat Fading
"... We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flatfading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence int ..."
Abstract

Cited by 495 (22 self)
 Add to MetaCart
We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flatfading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence
Construction of genetic linkage map in man using restriction fragment length polymorphisom
 Am. J. Hum Genet
"... We describe a new basis for the construction of a genetic linkage map of the human genome. The basic principle of the mapping scheme is to develop, by recombinant DNA techniques, random singlecopy DNA probes capable of detecting DNA sequence polymorphisms, when hybridized to restriction digests of ..."
Abstract

Cited by 456 (1 self)
 Add to MetaCart
requiring direct access to a specified gene's DNA. For inherited diseases mapped in this way, linked DNA marker loci can be used predictively for genetic counseling.
A HighThroughput Path Metric for MultiHop Wireless Routing
, 2003
"... This paper presents the expected transmission count metric (ETX), which finds highthroughput paths on multihop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The E ..."
Abstract

Cited by 1108 (5 self)
 Add to MetaCart
. The ETX metric incorporates the effects of link loss ratios, asymmetry in the loss ratios between the two directions of each link, and interference among the successive links of a path. In contrast, the minimum hopcount metric chooses arbitrarily among the different paths of the same minimum length
DataParallel Halo Finding with Variable Linking Lengths
"... of this article, the publisher recognizes that the U.S. Government retains a nonexclusive, royaltyfree license to publish or reproduce the ..."
Abstract
 Add to MetaCart
of this article, the publisher recognizes that the U.S. Government retains a nonexclusive, royaltyfree license to publish or reproduce the
Improved Lower Bounds for the Link Length of Rectilinear Spanning Paths in Grids
 Inform. Process. Lett
, 1997
"... We give improved lower bounds on the link length of spanning paths in a ddimensional grid of size n. Kranakis et al. conjectured that the optimal link length is (1 + 1 d\Gamma1 )n d\Gamma1 , but gave lower bounds not substantially larger than n d\Gamma1 ; we give a lower bound of (1 + 1 2d ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We give improved lower bounds on the link length of spanning paths in a ddimensional grid of size n. Kranakis et al. conjectured that the optimal link length is (1 + 1 d\Gamma1 )n d\Gamma1 , but gave lower bounds not substantially larger than n d\Gamma1 ; we give a lower bound of (1 + 1 2
Autonomous Decentralized Flow Control Allowing Control Timing Independent of Link Length
"... We have proposed diffusion flow control (DFC) as a technique for controlling a network, using an analogy of the diffusion phenomenon. In DFC, although each node in a network handles its local traffic flow only on the basis of the information it is aware of, the diffusion effect of DFC distribute ..."
Abstract
 Add to MetaCart
tributes the packet density in a network, so avoiding packet loss. In our previous work, we have assumed that each node knows the lengths of the links adjacent to it and we used control timing depending on the link length. In this paper, we describe an extension of the DFC in which the control timing is independent
Observations on the dynamics of a congestion control algorithm: The effects of twoway traffic
 In Proceedings of ACM SIGCOMM
, 1991
"... We use simulation to study the dynamics of the congestion cent rol algorithm embedded in the BSD 4.3Tahoe TCP implementation. We investigate the simple case of a few TCP connections, originating and terminating at the same pair of hosts, using a single bottleneck link. This work is an extension of ..."
Abstract

Cited by 383 (6 self)
 Add to MetaCart
and gives rise to rapid fluctuations in queue length, and (2) an outofphase queuesynchronization mode, which keeps link utilization less than optimal even in the limit of very large buffers. These phenomena are helpful in understanding results from an earlier study of network oscillations ([19]). 1
Integrated Computational Materials EngineeringOverview Linking Length Scales via Materials
"... Materials design is a process to determine optimal combinations of material chemistry, processing routes, and processing parameters to robustly ..."
Abstract
 Add to MetaCart
Materials design is a process to determine optimal combinations of material chemistry, processing routes, and processing parameters to robustly
Results 1  10
of
595,224