Results 1  10
of
6,720
The strongest gravitational lenses: II. Is the large Einstein radius of MACS J0717.5+3745 in conflict with ΛCDM?
, 2012
"... ar ..."
RangeFree Localization Schemes for Large Scale Sensor Networks
, 2003
"... Wireless Sensor Networks have been proposed for a multitude of locationdependent applications. For such systems, the cost and limitations of hardware on sensing nodes prevent the use of rangebased localization schemes that depend on absolute pointtopoint distance estimates. Because coarse accura ..."
Abstract

Cited by 525 (8 self)
 Add to MetaCart
, we study the effect of location error on routing and tracking performance. We show that routing performance and tracking accuracy are not significantly affected by localization error when the error is less than 0.4 times the communication radio radius.
A new routing protocol for reconfigurable wireless networks
 Proceedings of the IEEE International Conference on Universal Personal Communications (ICUPC
, 1997
"... ABSTRACT: In this paper, we propose a new routing protocol, the Zone Routing Protocol (ZRP), for the Reconfigurable Wireless Networks, a large scale, highly mobile adhoc networking environment. The novelty of the ZRP protocol is that it is applicable to large Platrouted networks. Furthermore, thr ..."
Abstract

Cited by 318 (5 self)
 Add to MetaCart
ABSTRACT: In this paper, we propose a new routing protocol, the Zone Routing Protocol (ZRP), for the Reconfigurable Wireless Networks, a large scale, highly mobile adhoc networking environment. The novelty of the ZRP protocol is that it is applicable to large Platrouted networks. Furthermore
What is the largest Einstein radius in the universe?
, 2009
"... The Einstein radius plays a central role in lens studies as it characterises the strength of gravitational lensing. In particular, the distribution of Einstein radii near the upper cutoff should probe the probability distribution of the largest mass concentrations in the universe. Adopting a triaxia ..."
Abstract
 Add to MetaCart
triaxial halo model, we compute expected distributions of large Einstein radii. To assess the cosmic variance, we generate a number of MonteCarlo realisations of allsky catalogues of massive clusters. We find that the expected largest Einstein radius in the universe is sensitive to parameters
Superstrings and topological strings at large
 N”, J. Math. Phys
"... We embed the large N ChernSimons/topological string duality in ordinary superstrings. This corresponds to a large N duality between generalized gauge systems with N = 1 supersymmetry in 4 dimensions and superstrings propagating on noncompact CalabiYau manifolds with certain fluxes turned on. We a ..."
Abstract

Cited by 254 (27 self)
 Add to MetaCart
dual radius. We also consider Dbrane/antiDbrane system wrapped over vanishing cycles of compact CalabiYau manifolds and argue that at large N they induce a shift in the background to a topologically distinct CalabiYau, which we identify as the ground state system of the Brane/antiBrane system. August
Split States, Entropy Enigmas, Holes and Halos
, 2007
"... We investigate degeneracies of BPS states of Dbranes on compact CalabiYau manifolds. We develop a factorization formula for BPS indices using attractor flow trees associated to multicentered black hole bound states. This enables us to study background dependence of the BPS spectrum, to compute e ..."
Abstract

Cited by 235 (22 self)
 Add to MetaCart
radius but do not form stable D6antiD6 bound states. We point out a likely breakdown of the OSV conjecture at small gtop (in the large background CY volume limit), due to the surprising phenomenon that for sufficiently large background Kähler moduli, a charge ΛΓ supporting single centered black holes
Adaptableradius, timeorbiting magnetic ring trap for BoseEinstein condensates
, 2003
"... Abstract. We theoretically investigate an adjustableradius magnetic storage ring for lasercooled and Bosecondensed atoms. Additionally, we discuss a novel timedependent variant of this and other ring traps. Timeorbiting ring traps provide a high optical access method for spinflip loss preventi ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. We theoretically investigate an adjustableradius magnetic storage ring for lasercooled and Bosecondensed atoms. Additionally, we discuss a novel timedependent variant of this and other ring traps. Timeorbiting ring traps provide a high optical access method for spinflip loss
Unreliable Sensor Grids: Coverage, Connectivity and Diameter
 In Proceedings of IEEE INFOCOM
, 2003
"... We consider an unreliable wireless sensor gridnetwork with n nodes placed in a square of unit area. We are interested in the coverage of the region and the connectivity of the network. We first show that the necessary and sufficient conditions for the random grid network to cover the unit square reg ..."
Abstract

Cited by 223 (9 self)
 Add to MetaCart
region as well as ensure that the active nodes are connected are of the form p(n)r ,wherer(n) is the transmission radius of each node and p(n) is the probability that a node is "active" (not failed). This result indicates that, when n is large, even if each node is highly unreliable
The Universal Einstein Radius Distribution from 10,000 SDSS Clusters
, 2013
"... We present results from stronglens modelling of 10,000 SDSS clusters, to establish the universal distribution of Einstein radii. Detailed lensing analyses have shown that the inner mass distribution of clusters can be accurately modelled by assuming light traces mass, successfully uncovering large ..."
Abstract
 Add to MetaCart
large numbers of multipleimages. Approximate critical curves and the effective Einstein radius of each cluster can therefore be readily calculated, from the distribution of member galaxies and scaled by their luminosities. We use a subsample of 10 wellstudied clusters covered by both SDSS and HST
PrimalDual InteriorPoint Methods for SelfScaled Cones
 SIAM Journal on Optimization
, 1995
"... In this paper we continue the development of a theoretical foundation for efficient primaldual interiorpoint algorithms for convex programming problems expressed in conic form, when the cone and its associated barrier are selfscaled (see [9]). The class of problems under consideration includes li ..."
Abstract

Cited by 206 (12 self)
 Add to MetaCart
as pathfollowing methods. Because of the special properties of these cones and barriers, two of our algorithms can take steps that go typically a large fraction of the way to the boundary of the feasible region, rather than being confined to a ball of unit radius in the local norm defined by the Hessian
Results 1  10
of
6,720