• Journal of Internet Computing and Services
• /
• v.4 no.6
• /
• pp.75-86
• /
• 2003

In main-memory resident index structures, secondary cache misses considerably have an effect on the performance of index structures. Recently, several main-memory resident index structures that consider cache have been proposed to reduce the impact of secondary cache misses. However they still suffer from full secondary cache misses whenever visiting each level of a index tree, In this paper, we propose a new index structure that eliminates cache misses even when visiting each level of index tree. The proposed index structure prefetches the grandchildren of a current node. The basic structure of the proposed index structure is from CSB+-tree that uses the concepts of the node group to increase fan-out. However the insert algorithm of the proposed index structure reduces the cost of a split significantly, Also, we show the superiority of our algorithm through various performance evaluation.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.675-683
• /
• 2004

In main-memory resident index structures, secondary cache misses considerably have an effect on the performance of index structures. Recently, several main-memory resident index structures that consider cache have been proposed to reduce the impact of secondary cache misses. However they still suffer from full secondary cache misses whenever visiting each level of a index tree. In this paper, we propose a new index structure that eliminates cache misses even when visiting each level of index tree. The proposed index structure prefetches the grandchildren of a current node. The basic structure of the proposed index structure is from CSB+-tree that uses the concepts of the node group to increase fan-out. However the insert algorithm of the proposed index structure reduces the cost of a split significantly. Also, we show the superiority of our algorithm through various performance evaluation.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2011.04a
• /
• pp.36-39
• /
• 2011

In this paper, performance of EMI interface and multi-channel wireless impedance sensor node is evaluated for SHM on bolted connection. To achieve the objective, following approaches are implemented. Firstly, an interface washer is designed to monitor loosened bolt through the variation in EMI of interface washer due to change in preload in bolt. Secondly, a multi-channel wireless impedance sensor node based on Imote2 platform is designed for automated and cost-efficient impedance-based SHM on bolted connections. Finally, performance of the multi-channel wireless impedance sensor node and the interface washer are experimentally validated for a lab-scale bolted connection model. A damage monitoring method using RMSD index of EMI signatures is utilized to examine the strength of each individual bolted connection.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.12
• /
• pp.2262-2269
• /
• 2016

In IEEE 802.11 wireless LANs, when a source node with low data rate occupies the channel resource for a long time, network performance degrades. In order to improve performance, the cooperative communication has been proposed. In the previous cooperative communication protocols, relay nodes deliver data packets only for a source node. In this paper, we propose an additional transmission scheme in which relay nodes select an additional source node based on several information and deliver data packets for the original source node and the selected additional source node. The proposed scheme improves performance and provides fairness among source nodes. Performance of the proposed scheme is investigated by simulation. Our results show that the proposed scheme outperforms the previous protocol in terms of fairness index and throughput.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.80-94
• /
• 2003

In this paper. we propose an enhanced concurrency control algorithm that minimizes the query delay efficiently. The factors that delay search operations and deteriorate the concurrency of index structures are node splits and MBR updates in multi dimensional index structures. In our algorithm, to reduce the query delay by split operations, we optimize exclusive latching time on a split node. It holds exclusive latches not during whole split time but only during physical node split time that occupies small part of whole split time. Also to avoid the query delay by MBR updates we introduce partial lock coupling(PLC) technique. The PLC technique increases concurrency by using lock coupling only in case of MBR shrinking operations that are less frequent than MBR expansion operations. For performance evaluation, we implement the proposed algorithm and one of the existing link technique-based algorithms on MIDAS-III that is a storage system of a BADA-III DBMS. We show through various experiments that our proposed algorithm outperforms the existing algorithm In terms of throughput and response time.

• Journal of KIISE:Databases
• /
• v.37 no.2
• /
• pp.121-126
• /
• 2010

This paper proposes an efficient index scheduling technique for kNN query processing in multiple wireless broadcast channel environment. Previous works have to wait for the next cycle if the required child nodes of the same parent node are allocated in the same time slot on multiple channel. Our proposed method computes the access frequencies of each node of R tree at the server before the generation of the R-tree index broadcast schedule. If they have high frequencies, we allocate them serially on the single channel. If they have low frequencies, we allocate them in parallel on the multiple channels. As a result, we can reduce the index node access conflicts and the long broadcast cycle. The performance evaluation shows that our scheme gives the better performance than the existing schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5A
• /
• pp.466-473
• /
• 2010

Several protocols which are based on tree topology to guarantee the important metrics such as energy efficiency in sensor networks have been proposed. However, studies on the effect of topologies in sensor networks, where base node has a high mobility, are very few. In this paper, we propose a minimum Wiener index tree as a suitable topology to the wireless sensor networks with high mobile base node. The minimum Wiener index spanning tree problem which aims to find a tree with minimum Wiener index from a given weighted graph was proved to be NP-hard. We designed a branch and bound algorithm for this problem. To evaluate the performance of proposed tree, the comparisons with minimum spanning tree in terms of transmission distance, energy consumption during one round, and network lifetime was performed by simulations. Our proposed tree outperformed in transmission distance and energy efficiency but underperformed in lifetime.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2C
• /
• pp.100-109
• /
• 2003

A differential index assignment scheme is proposed for the image encoding system in which a variable-length tree-structured vector quantizer is adopted. Each source vector is quantized into a terminal node of VLTSVQ and each terminal node is represented as a unique binary vector. The proposed index assignment scheme utilizes the correlation between interblocks of the image to increase the compression ratio with the image quality maintained. Simulation results show that the proposed scheme achieves a much higher compression ratio than the conventional one does and that the amount of the bit rate reduction of the proposed scheme becomes large as the correlation of the image becomes large. The proposed encoding scheme can be effectively used to encode R images whose pixel values we, in general, highly correlated with those of the neighbor pixels.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.3
• /
• pp.24-30
• /
• 1998

Strength and displacement of jig body in index machine utilized for multiprocess machining such as drilling, boring and tapping, etc, at the same time were analyzed by the use of finite element analysis soft ware ANSYS 5.2A. The whole geometry was constructed by 4048 elements and 7016 nodes employing 8 node brick element. The analyses were carried out on five loading cases combining vertical and horizontal machining to simulate the case occurring large displacement and the one occurring small displacement one and provided following conclusions. (1) Jig body had sufficient strength because its safety factor was 6.95 even in the most severe loading case. (2) The largest displacement in Z direction was 549 m and that in radial direction was 43.7 m. (3) In order to reduce the displacement, vertical machining rather than horizontal or two or three processes should be adopted in the same station. (4) Alternate change of horizontal machining direction at consecutive stations can reduce the displace ment. (5) The dimension of the slider should be increased to reduce the displacement by the tolerance in the sliding part. (6) A bypass idle piston head needs to be installed to give a counterpart supporting load from opposite direction for a single horizontal machining case.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.3 s.15
• /
• pp.55-65
• /
• 2005

This paper presents a bulk insertion technique for efficiently inserting data items. Traditional moving object database focused on efficient query processing that happens mainly after index building. Traditional index structures rarely considered disk I/O overhead for index rebuilding by inserting data items. This paper, to solve this problem, describes a new bulk insertion technique which efficiently induces the current positions of moving objects and reduces update cost greatly. This technique uses buffering technique for bulk insertion in spatial index structures such as R-tree. To analyze split or merge node, we add a secondary index for information management on leaf node of primary index. And operations are classified to reduce unnecessary insertion and deletion. This technique decides processing order of moving objects, which minimize split and merge cost as a result of update operations. Experimental results show that this technique reduces insertion cost as compared with existing insertion techniques.