نتایج جستجو برای: space curve

تعداد نتایج: 613956  

Journal: :J. Inf. Sci. Eng. 2003
Shen-Yi Lin Chih-Shen Chen Li Liu Chua-Huang Huang

We present a tensor product formulation for Hilbert space-filling curves. Both recursive and iterative formulas are expressed in the paper. We view a Hilbert space-filling curve as a permutation which maps twodimensional n n data elements stored in the row major or column major order to the order of traversing a Hilbert space-filling curve. The tensor product formula of Hilbert space-filling cu...

2016
Guisong Yang Shuai Liu Xingyu He Naixue Xiong Chunxue Wu

The design of movement trajectories for mobile sink plays an important role in data gathering for Wireless Sensor Networks (WSNs), as it affects the network coverage, and packet delivery ratio, as well as the network lifetime. In some scenarios, the whole network can be divided into subareas where the nodes are randomly deployed. The node densities of these subareas are quite different, which m...

2010
Joan Lind Steffen Rohde

Similar to the well-known phases of SLE, the Loewner differential equation with Lip(1/2) driving terms is known to have a phase transition at norm 4, when traces change from simple to non-simple curves. We establish the deterministic analog of the second phase transition of SLE, where traces change to space-filling curves: There is a constant C > 4 such that a Loewner driving term whose trace i...

2008
Maznah Kamat Abdul Samad Ismail Stephan Olariu Mohd Aizaini Maarof

Mobility strategies for a sink node in WSNs serve to move the sink in traversing a monitoring area to collect data from the sensor field and reduce communication relay and thus maximize network lifetime. For periodic data collection, in-order traversal is required. This paper discusses the various in-order mobility strategies in covering an area of interest. Simulation result shows that linear ...

Journal: :Monte Carlo Meth. and Appl. 2013
Colas Schretter Harald Niederreiter

The inversion method is an effective approach for transforming uniform random points according to a given probability density function. In two dimensions, horizontal and vertical displacements are computed successively using a marginal and then all conditional density functions. When quasi-random low-discrepancy points are provided as input, spurious artifacts might appear if the density functi...

Journal: :Data Science Journal 2007
Frank Dehne Todd Eavis Boyong Liang

This paper proposes an efficient algorithm to compress the cubes in the progress of the parallel data cube generation. This low overhead compression mechanism provides block-by-block and record-by-record compression by using tuple difference coding techniques, thereby maximizing the compression ratio and minimizing the decompression penalty at run-time. The experimental results demonstrate that...

Journal: :Wireless Networks 2015
Javad Rezazadeh Marjan Moradi Abdul Samad Ismail Eryk Dutkiewicz

A Wireless Sensor Network (WSN) consists of many sensors that communicate wirelessly to monitor a physical region. Location information is critical essential and indispensable for many applications of WSNs. A promising solution for localizing statically deployed sensors is to benefit from mobile location-aware nodes called beacons. However, the essential problem is to find the optimum path that...

1999
Victor Ostromoukhov Roger D. Hersch

A new technique for building stochastic clustered-dot screens is being proposed. A large dither matrix comprising thousands of stochastically laid out screen dots is constructed by first laying out the screen dot centers. Screen dot centers are obtained by placing discrete disks of a chosen radius at free cell locations when traversing the dither array cells according to either a discretely rot...

1998
Shannon V. Spires Steven Y. Goldsmith

Swarms of mobile robots can be tasked with searching a geographic region for targets of interest, such as buried land mines. We assume that the individual robots are equipped with sensors tuned to the targets of interest, that these sensors have limited range, and that the robots can communicate with one another to enable cooperation. How can a swarm of cooperating sensate robots efficiently se...

2009
Saim Ghafoor Sunghyun Cho Sung Han Park

This paper proposes an algorithm to determine a mobile sink trajectory to cover the entire target area in a timely manner and dissemination of data with lesser delay. The proposed algorithm is based on Hilbert Space Filling Curve algorithm with dynamic control of graph order according to network density. The simulation results show that by overlaying smaller order curve on greater order curve i...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید