• Title/Summary/Keyword: Bounding Space

Search Result 75, Processing Time 0.027 seconds

A New Flash TPR-tree for Indexing Moving Objects with Frequent Updates

  • Lim, Seong-Chae
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.14 no.1
    • /
    • pp.95-104
    • /
    • 2022
  • A TPR-tree is a well-known indexing structure that is developed to answer queries about the current or future time locations of moving objects. For the purpose of space efficiency, the TPR-tree employs the notion of VBR (velocity bounding rectangle)so that a regionalrectangle presents varying positions of a group of moving objects. Since the rectangle computed from a VBR always encloses the possible maximum range of an indexed object group, a search process only has to follow VBR-based rectangles overlapped with a given query range, while searching toward candidate leaf nodes. Although the TPR-tree index shows up its space efficiency, it easily suffers from the problem of dead space that results from fast and constant expansions of VBR-based rectangles. Against this, the TPR-tree index is enforced to update leaf nodes for reducing dead spaces within them. Such an update-prone feature of the TPR-tree becomes more problematic when the tree is saved in flash storage. This is because flash storage has very expensive update costs. To solve this problem, we propose a new Bloom filter based caching scheme that is useful for reducing updates in a flash TPR-tree. Since the proposed scheme can efficiently control the frequency of updates on a leaf node, it can offer good performance for indexing moving objects in modern flash storage.

Design and Implementation of Trajectory Riving Tree for Combined Queries in Moving Object Databases (이동체 데이타베이스에서 복합 질의를 위한 궤적 분할 트리의 설계 및 구현)

  • 임덕성;전봉기;홍봉희;조대수
    • Journal of KIISE:Databases
    • /
    • v.31 no.2
    • /
    • pp.150-162
    • /
    • 2004
  • Moving objects have characteristics that they change continuously their positions over time. The movement of moving objects should be stored on trajectories for processing past queries. Moving objects databases need to provide spatio-temporal index for handling moving objects queries like combined queries. Combined queries consist of a range query selecting trajectories within a specific range and a trajectory query extracting to parts of the whole trajectory. Access methods showing good performance in range queries have a shortcoming that the cost of processing trajectory Queries is high. On the other hand, trajectory-based index schemes like the TB-tree are not suitable for range queries because of high overlaps between index nodes. This paper proposes new TR(Trajectory Riving)-tree which is revised for efficiently processing the combined queries. This index scheme has several features like the trajectory preservation, the increase of the capacity of leaf nodes, and the logical trajectory riving in order to reduce dead space and high overlap between bounding boxes of nodes. In our Performance study, the number of node access for combined queries in TR-tree is about 25% less than the STR-tree and the TB-tree.

An Improved Split Algorithm for Indexing of Moving Object Trajectories (이동 객체 궤적의 색인을 위한 개선된 분할 알고리즘)

  • Jeon, Hyun-Jun;Park, Ju-Hyun;Park, Hee-Suk;Cho, Woo-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.16D no.2
    • /
    • pp.161-168
    • /
    • 2009
  • Recently, use of various position base servicesthat collect position information for moving object and utilize in real life is increasing by the development of wireless network technology. Accordingly, new index structures are required to efficiently retrieve the consecutive positions of moving objects. This paper addresses an improved trajectory split algorithm for the purpose of efficiently supporting spatio-temporal range queries using index structures that use Minimum Bounding Rectangles(MBR) as trajectory approximations. We consider volume of Extended Minimum Bounding Rectangles (EMBR) to be determined by average size of range queries. Also, Use a priority queue to speed up our process. This algorithm gives in general sub-optimal solutions with respect to search space. Our improved trajectory split algorithm is going to derive minimizing volume of EMBRs better than previously proposed split algorithm.

Performance Analysis of GNSS Residual Error Bounding for QZSS CLAS

  • Yebin Lee;Cheolsoon Lim;Yunho Cha;Byungwoon Park;Sul Gee Park;Sang Hyun Park
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.12 no.3
    • /
    • pp.215-228
    • /
    • 2023
  • The State Space Representation (SSR) method provides individual corrections for each Global Navigation Satellite System (GNSS) error components. This method can lead to less bandwidth for transmission and allows selective use of each correction. Precise Point Positioning (PPP) - Real-Time Kinematic (RTK) is one of the carrier-based precise positioning techniques using SSR correction. This technique enables high-precision positioning with a fast convergence time by providing atmospheric correction as well as satellite orbit and clock correction. Currently, the positioning service that supports PPP-RTK technology is the Quazi-Zenith Satellite System Centimeter Level Augmentation System (QZSS CLAS) in Japan. A system that provides correction for each GNSS error component, such as QZSS CLAS, requires monitoring of each error component to provide reliable correction and integrity information to the user. In this study, we conducted an analysis of the performance of residual error bounding for each error component. To assess this performance, we utilized the correction and quality indicators provided by QZSS CLAS. Performance analyses included the range domain, dispersive part, non-dispersive part, and satellite orbit/clock part. The residual root mean square (RMS) of CLAS correction for the range domain approximated 0.0369 m, and the residual RMS for both dispersive and non-dispersive components is around 0.0363 m. It has also been confirmed that the residual errors are properly bounded by the integrity parameters. However, the satellite orbit and clock part have a larger residual of about 0.6508 m, and it was confirmed that this residual was not bounded by the integrity parameters. Users who rely solely on satellite orbit and clock correction, particularly maritime users, thus should exercise caution when utilizing QZSS CLAS.

Recursive Fuzzy Partition of Pattern Space for Automatic Generation of Decision Rules (결정규칙의 자동생성을 위한 패턴공간의 재귀적 퍼지분할)

  • 김봉근;최형일
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.5 no.2
    • /
    • pp.28-43
    • /
    • 1995
  • This paper concerns with automatic generation of fuzzy rules which can be used for pattern classification. Feature space is recursively subdivided into hyperspheres, and each hypersphere is represented by its centroid and bounding distance. Fuzzy rules are then generated based on the constructed hyperspheres. The resulting fuzzy rules have very simple premise parts, and they can be organized into a hierarchical structure so that classification process can be implemented very rapidly. The experimented results show that the suggested method works very well compared to other methods.

  • PDF

A Study on Improved Split Algorithms for Moving Object Trajectories in Limited Storage Space (한정된 저장 공간상에서 이동 객체 궤적들에 대한 개선된 분할 알고리즘에 관한 연구)

  • Park, Ju-Hyun;Cho, Woo-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.9
    • /
    • pp.2057-2064
    • /
    • 2010
  • With the development of wireless network technology, the location information of a spatiotemporal object which changes their location is used in various application. Each spatiotemporal object has many location information, hence it is inefficient to search all trajectory information of spatiotemporal objects for a range query. In this paper, we propose an efficient method which divides a trajectory and stores its division data on restricted storage space. Using suboptimal split algorithm, an extended split algorithm that minimizes the volume of EMBRs(Extended Minimum Bounding Box) is designed and simulated. Our experimental evaluation confirms the effectiveness and efficiency of our proposed splitting policy

A discussion on simple third-order theories and elasticity approaches for flexure of laminated plates

  • Singh, Gajbir;Rao, G. Venkateswara;Iyengar, N.G.R.
    • Structural Engineering and Mechanics
    • /
    • v.3 no.2
    • /
    • pp.121-133
    • /
    • 1995
  • It is well known that two-dimensional simplified third-order theories satisfy the layer interface continuity of transverse shear strains, thus these theories violate the continuity of transverse shear stresses when two consecutive layers differ either in fibre orientation or material. The third-order theories considered herein involve four/or five dependent unknowns in the displacement field and satisfy the condition of vanishing of transverse shear stresses at the bounding planes of the plate. The objective of this investigation is to examine (i) the flexural response prediction accuracy of these third-order theories compared to exact elasticity solution (ii) the effect of layer interface continuity conditions on the flexural response. To investigate the effect of layer interface continuity conditions, three-dimensional elasticity solutions are developed by enforcing the continuity of different combinations of transverse stresses and/or strains at the layer interfaces. Three dimensional twenty node solid finite element (having three translational displacements as degrees of freedom) without the imposition of any of the conditions on the transverse stresses and strains is also employed for the flexural analysis of the laminated plates for the purposes of comparison with the above theories. These shear deformation theories and elasticity approaches in terms of accuracy, adequacy and applicability are examined through extensive numerical examples.

Offsetting of Triangular Net using Distance Fields (거리장을 이용한 삼각망의 옵셋팅)

  • Yoo, Dong-Jin
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.24 no.9
    • /
    • pp.148-157
    • /
    • 2007
  • A new method which uses distance fields scheme and marching cube algorithm is proposed in order to get an accurate offset model of arbitrary shapes composed of triangular net. In the method, the space bounding the triangular net is divided into smaller cells. For the efficient calculation of distance fields, valid cells which will generate a portion of offset model are selected previously by the suggested detection algorithm. These valid cells are divided again into much smaller voxels which assure required accuracy. At each voxel distance fields are created by calculating the minimum distances between corner points of voxels and triangular net. After generating the whole distance fields, the offset surface were constructed by using the conventional marching cube algorithm together with mesh smoothing scheme. The effectiveness and validity of this new offset method was demonstrated by performing numerical experiments for the various types of triangular net.

The Crystal and Molecular Structure of Bromhexine$\cdot$HCl

  • Koo, Hung-Hoe;Jung, Yong-Je;Lee, Soon-Won
    • Archives of Pharmacal Research
    • /
    • v.7 no.2
    • /
    • pp.115-120
    • /
    • 1984
  • The crystals of bromhexine-HCl, $C_{14}$ H$_{21}$ N$_{2}$Br$_{2}$Cl, are orthohombic, space group Pca2 with a = 14.598(2)A, b=12.461(3)A, c =9 9.186(1) A and Z = 4. Intensity dat for 967 reflections (Fobs > 6.sigma.(F)) were collected on a Rigaku-Denki automatic four circle diffractometer. The structure was solved by the Patterson and Fourier methods. Refinements were carried out to the final R value of 0.082. The cyclohexane ring has a normal chair form and the benzene ring is planar. There are three independenet hydrogen bounds in the structure. One is an intermolecular hydrogen bond (N-H... Cl) and the others are intramolecular hydrogen bonds (N-H...Br, N$^{+}$-H...Cl$^{[-10]}$ ) Apart from the hydrogen bounding system the molecules are held together in the crystal by van der Waals force.e.

  • PDF