Recent Advances in Worst-Case Efficient Range Search Indexing

2009 ◽  
pp. 3-4
Author(s):  
Lars Arge
Keyword(s):  
Worst Case ◽  
Range Search ◽  
Recent Advances

TWO-DIMENSIONAL RANGE SEARCH BASED ON THE VORONOI DIAGRAM

2005 ◽  
Vol 15 (02) ◽  
pp. 151-166
Author(s):  
TAKESHI KANDA ◽  
KOKICHI SUGIHARA
Keyword(s):  
Voronoi Diagram ◽  
Dimensional Space ◽  
Search Problem ◽  
Two Dimensional ◽  
Worst Case ◽  
Average Case ◽  
Range Search ◽  
Almost All ◽  
Set Of Points ◽  
Dimensional Range

This paper studies the two-dimensional range search problem, and constructs a simple and efficient algorithm based on the Voronoi diagram. In this problem, a set of points and a query range are given, and we want to enumerate all the points which are inside the query range as quickly as possible. In most of the previous researches on this problem, the shape of the query range is restricted to particular ones such as circles, rectangles and triangles, and the improvement on the worst-case performance has been pursued. On the other hand, the algorithm proposed in this paper is designed for a general shape of the query range in the two-dimensional space, and is intended to accomplish a good average-case performance. This performance is actually observed by numerical experiments. In these experiments, we compare the execution time of the proposed algorithm with those of other representative algorithms such as those based on the bucketing technique and the k-d tree. We can observe that our algorithm shows the better performance in almost all the cases.

scholarly journals AN EXPERIMENTAL ANALYSIS OF SPATIAL INDEXING ALGORITHMS FOR REAL TIME SAFETY CRITICAL MAP APPLICATION

2021 ◽  
Vol V-4-2021 ◽  
pp. 41-48
Author(s):  
F. Çetin ◽  
M. O. Kulekci
Keyword(s):  
Data Structure ◽  
Real Time ◽  
Data Structures ◽  
Spatial Indexing ◽  
Space Partitioning ◽  
Worst Case ◽  
Real Time System ◽  
Safety Critical ◽  
Range Search ◽  
Partitioning Technique

Abstract. This paper presents a study that compares the three space partitioning and spatial indexing techniques, KD Tree, Quad KD Tree, and PR Tree. KD Tree is a data structure proposed by Bentley (Bentley and Friedman, 1979) that aims to cluster objects according to their spatial location. Quad KD Tree is a data structure proposed by Berezcky (Bereczky et al., 2014) that aims to partition objects using heuristic methods. Unlike Bereczky’s partitioning technique, a new partitioning technique is presented based on dividing objects according to space-driven, in the context of this study. PR Tree is a data structure proposed by Arge (Arge et al., 2008) that is an asymptotically optimal R-Tree variant, enables data-driven segmentation. This study mainly aimed to search and render big spatial data in real-time safety-critical avionics navigation map application. Such a real-time system needs to efficiently reach the required records inside a specific boundary. Performing range query during the runtime (such as finding the closest neighbors) is extremely important in performance. The most crucial purpose of these data structures is to reduce the number of comparisons to solve the range searching problem. With this study, the algorithms’ data structures are created and indexed, and worst-case analyses are made to cover the whole area to measure the range search performance. Also, these techniques’ performance is benchmarked according to elapsed time and memory usage. As a result of these experimental studies, Quad KD Tree outperformed in range search analysis over the other techniques, especially when the data set is massive and consists of different geometry types.

scholarly journals Kriging based robust optimisation algorithm for minimax problems in electromagnetics

2016 ◽  
Vol 65 (4) ◽  
pp. 843-854 ◽  
Author(s):  
Yinjiang Li ◽  
Mihai Rotaru ◽  
Jan K. Sykulski
Keyword(s):  
Minimax Problems ◽  
Robust Optimisation ◽  
Validation Process ◽  
Two Stage ◽  
Design Optimisation ◽  
Worst Case ◽  
Optimisation Algorithm ◽  
Recent Advances ◽  
Case Design

Abstract The paper discusses some of the recent advances in kriging based worst-case design optimisation and proposes a new two-stage approach to solve practical problems. The efficiency of the infill points allocation is improved significantly by adding an extra layer of optimisation enhanced by a validation process.

Recent Advances in High Dispersion Spectroscopy of Globular Cluster Stars

1988 ◽  
Vol 132 ◽  
pp. 525-530
Author(s):  
Raffaele G. Gratton
Keyword(s):  
Globular Cluster ◽  
Globular Clusters ◽  
High Dispersion ◽  
Photographic Material ◽  
Recent Advances ◽  
Metal Abundances ◽  
Ccd Detectors ◽  
Major Progress

The use CCD detectors has allowed a major progress in abundance derivations for globular cluster stars in the last years. Abundances deduced from high dispersion spectra now correlates well with other abundance indicators. I discuss some problems concerning the derivation of accurate metal abundances for globular clusters using high dispersion spectra from both the old photographic and the most recent CCD data. The discrepant low abundances found by Cohen (1980), from photographic material for M71 giants, are found to be due to the use of too high microturbulences.

Mosaic Mapping: A Means of Tiling Images to Shorten Acquisition Speed for Lower - Magnification SEM Images and Wavelength Dispersive Spectrometers (WDS) X-Ray Maps

1996 ◽  
Vol 54 ◽  
pp. 438-439
Author(s):  
J.D. Geller ◽  
C.R. Herrington
Keyword(s):  
Limiting Factors ◽  
X Rays ◽  
Angular Range ◽  
Acceptance Angle ◽  
Sem Images ◽  
Worst Case ◽  
X Ray ◽  
Focusing Distance ◽  
Layered Crystals ◽  
Working Distance

The minimum magnification for which an image can be acquired is determined by the design and implementation of the electron optical column and the scanning and display electronics. It is also a function of the working distance and, possibly, the accelerating voltage. For secondary and backscattered electron images there are usually no other limiting factors. However, for x-ray maps there are further considerations. The energy-dispersive x-ray spectrometers (EDS) have a much larger solid angle of detection that for WDS. They also do not suffer from Bragg’s Law focusing effects which limit the angular range and focusing distance from the diffracting crystal. In practical terms EDS maps can be acquired at the lowest magnification of the SEM, assuming the collimator does not cutoff the x-ray signal. For WDS the focusing properties of the crystal limits the angular range of acceptance of the incident x-radiation. The range is dependent upon the 2d spacing of the crystal, with the acceptance angle increasing with 2d spacing. The natural line width of the x-ray also plays a role. For the metal layered crystals used to diffract soft x-rays, such as Be - O, the minimum magnification is approximately 100X. In the worst case, for the LEF crystal which diffracts Ti - Zn, ˜1000X is the minimum.

Chelation-assisted transition metal-catalysed C–H chalcogenylations

2020 ◽  
Vol 7 (8) ◽  
pp. 1022-1060 ◽  
Author(s):  
Wenbo Ma ◽  
Nikolaos Kaplaneris ◽  
Xinyue Fang ◽  
Linghui Gu ◽  
Ruhuai Mei ◽  
...  
Keyword(s):  
Transition Metal ◽  
Recent Advances ◽  
Site Selectivity ◽  
Transition Metal Catalyzed ◽  
Metal Catalyzed

This review summarizes recent advances in C–S and C–Se formations via transition metal-catalyzed C–H functionalization utilizing directing groups to control the site-selectivity.

Nucleosome dynamics

2006 ◽  
Vol 73 ◽  
pp. 109-119 ◽  
Author(s):  
Chris Stockdale ◽  
Michael Bruno ◽  
Helder Ferreira ◽  
Elisa Garcia-Wilson ◽  
Nicola Wiechens ◽  
...  
Keyword(s):  
High Resolution ◽  
Chromatin Structure ◽  
Current Knowledge ◽  
Dynamic Properties ◽  
Structure And Dynamics ◽  
Nucleosome Dynamics ◽  
Sharp Focus ◽  
Recent Advances ◽  
Insight Into ◽  
Chromatin Structure And Dynamics

In the 30 years since the discovery of the nucleosome, our picture of it has come into sharp focus. The recent high-resolution structures have provided a wealth of insight into the function of the nucleosome, but they are inherently static. Our current knowledge of how nucleosomes can be reconfigured dynamically is at a much earlier stage. Here, recent advances in the understanding of chromatin structure and dynamics are highlighted. The ways in which different modes of nucleosome reconfiguration are likely to influence each other are discussed, and some of the factors likely to regulate the dynamic properties of nucleosomes are considered.

Recent Advances in the Treatment of Pulmonary Tuberculosis

1950 ◽  
Vol 34 (5) ◽  
pp. 1363-1380
Author(s):  
Theodore L. Badger ◽  
William E. Patton
Keyword(s):  
Pulmonary Tuberculosis ◽  
Recent Advances
Sign in / Sign up

Export Citation Format

Share Document