• The KIPS Transactions:PartD
• /
• v.18D no.4
• /
• pp.225-236
• /
• 2011

Various applications of LBS (Location Based Services) are being developed to provide the customized service depending on user's location with progress of wireless communication technology and miniaturization of personalized device. To effectively process an amount of vehicles' location data, LBS requires the techniques such as vehicle observation, data communication, data insertion and search, and user query processing. In this paper, we propose the historical location index, GIP-FB (Group Insertion tree with Flexible Buffer Node) and the flexible buffer node technique to adjust the cost of data insertion and search. the designed GIP+ based index employs the buffer node and the projection storage to cut the cost of insertion and search. Besides, it adjusts the cost of insertion and search by changing the number of line segments of the buffer node with user defined time interval. In the experiment, the buffer node size influences the performance of GIP-FB by changing the number of non-leaf node of the index. the proposed flexible buffer node is used to adjust the performance of the historical location index depending on the applications of LBS.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.2
• /
• pp.121-125
• /
• 2008

It is essential to maintain hierarchical information properly for efficient XML query processing. Well known approach to represent hierarchical information of XML tree is assigning a specific node number to each node of XML tree. Insertion and deletion of XML node can occur at any position in a dynamic XML tree. A dynamic numbering scheme allows us to add nodes to or delete nodes from an XML tree without relabeling or with relabeling only a few existing nodes of XML tree while executing XML query efficiently. According to W3C XQuery update facility specifications a node can be added as first or last child of the existing node in XML tree. Generating new number for last child requires referencing the number of previous last child. Getting the number of last child is very costly with previous approaches. We have developed a new dynamic numbering scheme PSN which is very effective for insertion of a node as last child. Our approach reduces the time to find last child dramatically by removing sorting of children.

• Transactions on Control, Automation and Systems Engineering
• /
• v.3 no.4
• /
• pp.268-271
• /
• 2001

In this paper, we propose a simplified pollution adaptive mesh generation algorithm using singular elements. The algorithm based on the element pollution error indicator concentrate on boundary nodes. The automatic mesh generation method is followed by either a node-relocation or a node-insertion method. The boundary node relocation phase is introduced to reduce pollution error estimates without increasing the boundary nodes. The node insertion phase greatly improves the error and the factor with the cost of increasing the node numbers. It is shown that the suggested r-h version algorithm combined with singular elements converges more quickly than the conventional one.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.10
• /
• pp.841-849
• /
• 2012

This paper proposes an low-complexity soft-output multiple-input multiple-output (soft-MIMO) detection algorithm for achieving soft-output maximum-likelihood (soft-ML) performance under max-log approximation. The proposed algorithm is based on a parallel tree-search (PTS) applying a channel ordering by a sorted-QR decomposition (SQRD) with altered sort order. The empty-set problem that can occur in calculation of log-likelihood ratio (LLR) for each bit is solved by inserting additional nodes at each search level. Since only the closest node is inserted among nodes with opposite bit value to a selected node, the proposed node insertion scheme is very efficient in the perspective of computational complexity. The computational complexity of the proposed algorithm is approximately 37-74% of that of existing algorithms, and from simulation results for a $4{\times}4$ system, the proposed algorithm shows a performance degradation of less than 0.1dB.

• Proceedings of the IEEK Conference
• /
• 2004.06b
• /
• pp.577-580
• /
• 2004

Our paper focus on crosstalk noise problem, especially crosstalk glitch that occurs when victim is stable state and aggressor is transitive state. This generated glitch weigh with the functional reliability if the glitch is considerable. In this paper, we use buffer insertion, down sizing, buffer insertion with up-sizing methods concurrently. These methodologies use filtering effects which gates that have bigger noise margin than glitch width eliminates glitch. In addition, we do limited optimization in boundary of node's slack. Therefore, the operated node's changes are for nothing in other node's slack.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.63-68
• /
• 2022

Two wavelength reconfigurable optical nodes are designed. One for 20km or shorter link length, and the other for up to 60km link length. While the first one requires no dispersion compensation, the latter needs dispersion compensation fiber included in the node, which requires additional optical amplifier to compensate the insertion loss of DCF. We calculate all the optical path losses in both cases using the typical value of optical components in the market to see the feasibility of the designed optical node. The minimum received power in the node is calculated to be -21.5dBm without DCF and -12.5dBm with DCF, respectively. These received powers are above the receiver sensitivity both for OC-48 and OC-192 according to the previous work.

• Korean Management Science Review
• /
• v.7 no.2
• /
• pp.51-57
• /
• 1990

The purpose of this thesis is to find the shortest path between two nodes on an acyclic network where the arc costs are determined by the starting time at the starting node of the arc. A branch and bound method for optimal solutions and a heuristic method is developed. In heuristic method Dijkstra algorithm is modified to maintain the minimum arrival times of maximum informations in the each time period at each node and is updated by the result with the insertion technique. Expermetal results among two methods are presented with regard to run time and solution qualities.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.673-676
• /
• 2004

To manage and query moving objects efficiently in MMDBMS, a memory index structure should be used. The most popular index structure for storing trajectories of moving objects is 3DR-tree. The 3DR-tree also can be used for MMDBMS. However, the volume of data can exceed the capacity of physical memory since moving objects report their locations continuously. To accommodate new location reports, old trajectories should be migrated to disk or purged from memory. This paper focuses on migration policies of a main memory index structure. Migration policies consist of two steps: (i) node selection, (ii) node placement. The first step (node selection) selects nodes that should be migrated to disk. The criteria of selection are the performance of insertion or query. The second step (node placement) determines the order of nodes written to disk. This step can be thought as dynamic declustering policies.

• Journal of Digestive Cancer Research
• /
• v.2 no.1
• /
• pp.21-23
• /
• 2014

We report a bronchoesophageal fistula that treat with bronchial stent insertion and histoacryl injection. A 52-year-old man with esophagel cancer was transferred for dysphagia management. At the CT scan that underwent on admission, esophageal cancer with multiple lymph node metastasis was observed. At the gastroduodenoscopy and contrast study, bronchoesophageal fistula was observed. Recurrent stent insertion treatment was failed, and then, By the broncoscopy, covered stent was inserted to right bronchus, and By the endoscopy, fibrin glue and histoacryl was injected in the fistula opening. At the contrast study, contrast leakage was not observed, and the patient was discharged. But, at the 14 days after discharge, the patient was admitted to the emerency room because of cough symptom whenever he eat food. The patient was diagnosed with aspiration pneumonia, we were determined that it is unable to oral intake. The patient received a jejunostomy and antibiotic treatment for aspiration pneumonia. He was discharged after symptomatic improvement.