In non-standard database applications, such as geographic information processing or CAD/CAM, methods of access are required that support efficient manipulation of multidimensional geometric objects on secondary storage. Spatial data consists of spatial objects made up of points, lines, regions, rectangles, surfaces, volumes, and even data of higher dimension. Being able to respond to spatial qu...

In this paper, we propose a new dynamic compressed index of O(w) space for a dynamic text T , where w = O(min(z logN log M,N)) is the size of the signature encoding of T , z is the size of the Lempel-Ziv77 (LZ77) factorization of T , N is the length of T , and M ≥ 3N is an integer that can be handled in constant time under word RAM model. Our index supports searching for a pattern P in T in O(|...

Ankle braces have been suggested to protect ankle joints from a sprain by restricting inversion and improving proprioception. However, the difference in effects between a semi-rigid brace and a soft brace regarding dynamic postural control after landing is not known. The aim of the present study was to compare the effect of soft (SB) and semi-rigid (SRB) ankle braces on static and dynamic postu...

BACKGROUND AND PURPOSE People with balance disorders often have difficulty walking. The purpose of this study was to develop and test the psychometric properties of a short form of the Dynamic Gait Index (DGI) for the clinical measurement of walking function in people with balance and vestibular disorders. SUBJECTS A total of 123 subjects with such disorders (test subjects) and 103 control su...

In this paper, we present an efficient index structure for NAND flash memory, called the Dynamic Forest (D-Forest). Since write operations incur high overhead on NAND flash memory, D-Forest is designed to minimize write operations for index updates. The experimental results show that D-Forest significantly reduces write operations compared to the conventional B+-tree. key words: NAND flash memo...

We consider dynamic selection problems, where a decision maker repeatedly selects a set of items from a larger collection of available items. A classic example is the dynamic assortment problem, where a retailer chooses items to offer for sale subject to a display space constraint. The retailer may adjust the chosen assortment over time in response to the observed demand. These dynamic selectio...

PURPOSE To determine the reliability and variability of the Dynamic Strength Index (DSI) calculated from squat-jump (SJ) vs countermovement-jump (CMJ) peak force (PF) and to compare DSI values between methods. METHODS Male youth soccer and rugby league players (N = 27; age 17.2 ± 0.7 y, height 173.9 ± 5.7 cm, body mass 71.1 ± 7.2 kg) performed 3 trials of the SJ, CMJ, and isometric midthigh p...

We consider the problem of dynamic range searching in tree structures that do not replicate data. We propose a new dynamic structure, called the O-tree, that achieves a query time complexity of O(n(d 1)=d) on n d-dimensional points and an amortized insertion/deletion time complexity of O(logn). We show that this structure is optimal when data is not replicated. In addition to optimal query and ...

Mobility in wireless networks causes a major issue from the IP-addressing perspective. When a Mobile Node (MN) moves to another subnet, it will probably get assigned a new IP address. This causes a routing problem since the MN will not be reachable with its previous IP address known to the other communication party. Real time applications might suffer from connection drops, which is recognized ...