Results 1  10
of
1,968
Surface reconstruction from unorganized points
 COMPUTER GRAPHICS (SIGGRAPH ’92 PROCEEDINGS)
, 1992
"... We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1�:::�xng IR 3 on or near an unknown manifold M, and produces as output a simplicial surface that approximates M. Neither the topology, the presence of boundaries, nor the geometry of M are assumed to be know ..."
Abstract

Cited by 811 (8 self)
 Add to MetaCart
We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1�:::�xng IR 3 on or near an unknown manifold M, and produces as output a simplicial surface that approximates M. Neither the topology, the presence of boundaries, nor the geometry of M are assumed to be known in advance — all are inferred automatically from the data. This problem naturally arises in a variety of practical situations such as range scanning an object from multiple view points, recovery of biological shapes from twodimensional slices, and interactive surface sketching.
Analysis, Modeling and Generation of SelfSimilar VBR Video Traffic
, 1994
"... We present a detailed statistical analysis of a 2hour long empirical sample of VBR video. The sample was obtained by applying a simple intraframe video compression code to an action movie. The main findings of our analysis are (1) the tail behavior of the marginal bandwidth distribution can be accu ..."
Abstract

Cited by 546 (6 self)
 Add to MetaCart
We present a detailed statistical analysis of a 2hour long empirical sample of VBR video. The sample was obtained by applying a simple intraframe video compression code to an action movie. The main findings of our analysis are (1) the tail behavior of the marginal bandwidth distribution can be accurately described using "heavytailed" distributions (e.g., Pareto); (2) the autocorrelation of the VBR video sequence decays hyperbolically (equivalent to longrange dependence) and can be modeled using selfsimilar processes. We combine our findings in a new (nonMarkovian) source model for VBR video and present an algorithm for generating synthetic traffic. Tracedriven simulations show that statistical multiplexing results in significant bandwidth efficiency even when longrange dependence is present. Simulations of our source model show longrange dependence and heavytailed marginals to be important components which are not accounted for in currently used VBR video traffic models. 1 I...
Mobile ad hoc networking: imperatives and challenges
, 2003
"... Mobile ad hoc networks (MANETs) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically selforganize into arbitrary and temporary, "adhoc" network topologies, allowing people and devices to seamlessly internetwork in areas with no preexi ..."
Abstract

Cited by 297 (7 self)
 Add to MetaCart
Mobile ad hoc networks (MANETs) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically selforganize into arbitrary and temporary, "adhoc" network topologies, allowing people and devices to seamlessly internetwork in areas with no preexisting communication infrastructure, e.g., disaster recovery environments. Ad hoc networking concept is not a new one, having been around in various forms for over 20 years. Traditionally, tactical networks have been the only communication networking application that followed the ad hoc paradigm. Recently, the introduction of new technologies such as the Bluetooth, IEEE 802.11 and Hyperlan are helping enable eventual commercial MANET deployments outside the military domain. These recent evolutions have been generating a renewed and growing interest in the research and development of MANET. This paper attempts to provide a comprehensive overview of this dynamic field. It first explains the important role that mobile ad hoc networks play in the evolution of future wireless technologies. Then, it reviews the latest research activities in these areas, including a summary of MANET's characteristics, capabilities, applications, and design constraints. The paper concludes by presenting a set of challenges and problems requiring further research in the future.
User mobility modeling and characterization of mobility patterns
 IEEE Journal on Selected Areas in Communications
, 1997
"... Abstract—A mathematical formulation is developed for systematic tracking of the random movement of a mobile station in a cellular environment. It incorporates mobility parameters under the most generalized conditions, so that the model can be tailored to be applicable in most cellular environments. ..."
Abstract

Cited by 199 (0 self)
 Add to MetaCart
(Show Context)
Abstract—A mathematical formulation is developed for systematic tracking of the random movement of a mobile station in a cellular environment. It incorporates mobility parameters under the most generalized conditions, so that the model can be tailored to be applicable in most cellular environments. This mobility model is used to characterize different mobilityrelated traffic parameters in cellular systems. These include the distribution of the cell residence time of both new and handover calls, channel holding time, and the average number of handovers. It is shown that the cell resistance time can be described by the generalized gamma distribution. It is also shown that the negative exponential distribution is a good approximation for describing the channel holding time. Index Terms—Mobile communication. I.
PIE: A dynamic failurebased technique
 IEEE Transactions on Software Engineering
, 1992
"... This paper presents a dynamic technique for statistically estimating three program characteristics that affect a program's computational behavior: (1) the probability that a particular section of a program is executed, (2) the probability that the particular section affects the data state, and ..."
Abstract

Cited by 163 (22 self)
 Add to MetaCart
(Show Context)
This paper presents a dynamic technique for statistically estimating three program characteristics that affect a program's computational behavior: (1) the probability that a particular section of a program is executed, (2) the probability that the particular section affects the data state, and (3) the probability that a data state produced by that section has an effect on program output. These three characteristics can be used to predict whether faults are likely to be uncovered by software testing.
Manet simulation studies: The incredibles
 ACM SIGMOBILE Mobile Computing and Communications Review
, 2005
"... Simulation is the research tool of choice for a majority of the mobile ad hoc network (MANET) community. However, while the use of simulation has increased, the credibility of the simulation results has decreased. To determine the state of MANET simulation studies, we surveyed the 20002005 proceedi ..."
Abstract

Cited by 156 (0 self)
 Add to MetaCart
(Show Context)
Simulation is the research tool of choice for a majority of the mobile ad hoc network (MANET) community. However, while the use of simulation has increased, the credibility of the simulation results has decreased. To determine the state of MANET simulation studies, we surveyed the 20002005 proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). From our survey, we found significant shortfalls. We present the results of our survey in this paper. We then summarize common simulation study pitfalls found in our survey. Finally, we discuss the tools available that aid the development of rigorous simulation studies. We offer these results to the community with the hope of improving the credibility of MANET simulationbased studies. I.
The Workload on Parallel Supercomputers: Modeling the Characteristics of Rigid Jobs
 Journal of Parallel and Distributed Computing
, 2001
"... The analysis of workloads is important for understanding how systems are used. In addition, workload models are needed as input for the evaluation of new system designs, and for the comparison of system designs. This is especially important in costly largescale parallel systems. Luckily, workloa ..."
Abstract

Cited by 143 (12 self)
 Add to MetaCart
(Show Context)
The analysis of workloads is important for understanding how systems are used. In addition, workload models are needed as input for the evaluation of new system designs, and for the comparison of system designs. This is especially important in costly largescale parallel systems. Luckily, workload data is available in the form of accounting logs. Using such logs from three dierent sites, we analyze and model the joblevel workloads with an emphasis on those aspects that are universal to all sites. As many distributions turn out to span a large range, we typically rst apply a logarithmic transformation to the data, and then t it to a novel hyperGamma distribution or one of its special cases. This is a generalization of distributions proposed previously, and leads to good goodnessoft scores. The parameters for the distribution are found using the iterative EM algorithm. The results of the analysis have been codied in a modeling program that creates a synthetic workload based on the results of the analysis. 1
DeadlockFree Multicast Wormhole Routing in 2D Mesh Multicomputers
, 1992
"... Multicast communication services, in which the same message is delivered from a source node to an arbitrary number of destination nodes, are being provided in new generation multicomputers. Broadcast is a special case of multicast in which a message is delivered to all nodes in the network. The n ..."
Abstract

Cited by 141 (24 self)
 Add to MetaCart
Multicast communication services, in which the same message is delivered from a source node to an arbitrary number of destination nodes, are being provided in new generation multicomputers. Broadcast is a special case of multicast in which a message is delivered to all nodes in the network. The nCUBE2, a wormholerouted hypercube multicomputer, provides hardware support for broadcast and a restricted form of multicast in which the destinations form a subcube. However, the broadcast routing algorithm adopted in the nCUBE2 is not deadlockfree. In this paper, four multicast wormhole routing strategies for twodimensional (2D) mesh multicomputers are proposed and studied. All of the algorithms are shown to be deadlockfree. These are the first deadlockfree multicast wormhole routing algorithms ever proposed. A simulation study has been conducted that compares the performance of these multicast algorithms under dynamic network traffic conditions in a 2D mesh. The results ind...