• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.7
• /
• pp.799-803
• /
• 2010

The KDB-tree is a traditional indexing scheme for retrieving multidimensional data. Much research for KDB-tree family frequently addresses the low storage utilization and insufficient retrieval performance as their two bottlenecks. The bottlenecks occur due to a number of unnecessary splits caused by data insertion orders and data skewness. In this paper, we propose a novel index structure, called as $KDB_{CS}^+$-tree, to process skewed data efficiently and improve the retrieval performance. The $KDB_{CS}^+$-tree increases the number of fan-outs by exploiting bit-vectors for representing splitting information and pointer elimination. It also improves the storage utilization by representing entries as a hierarchical structure in each internal node.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.250-257
• /
• 2003

As the memory access time becomes slower relative to the fast processor speed, most systems use cache memory to reduce the gap. The cache performance has an increasingly large impact on the performance of algorithms. Blocking is the well known method to utilize cache and has shown good results in multiplying matrices and search trees like d-heap. But if we use blocking in the data structures which require rotation during insertion or deletion, the execution time increases as the data movements between blocks are necessary. In this paper, we have proposed the extended pairing heap algorithms using block node and shown by experiments that our structure is superior Also in case of using block node, we use less memory space as the number of pointers decreases.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.49 no.1
• /
• pp.69-72
• /
• 2004

Somaclonal variation, defined as phenotypic and genetic variations among regenerated plants from a parental plant, could be caused by changes in chromosome structure, single gene mutation, cytoplasm genetic mutation, insertion of transposable elements, and DNA methylation during plant regeneration. The objective of this study was to evaluate DNA variations among somaclonal variants from the cotyledonary node culture in soybean. A total of 61 soybean somaclones including seven $\textrm{R}_1$ lines and seven $\textrm{R}_2$ lines from Iksannamulkong as well as 27 $\textrm{R}_1$ lines and 20 $\textrm{R}_2$ lines from Jinju 1 were regenerated by organogenesis from the soybean cotyledonary node culture system. Field evaluation revealed no phenotypic difference in major agronomic traits between somaclonal variants and their wild types. AFLP and SSR analyses were performed to detect variations at the DNA level among somaclonal variants of two varieties. Based on AFLP analysis using 36 primer sets, 17 of 892 bands were polymorphic between Iksannamulkong and its somaclonal variants and 11 of 887 bands were polymorphic between Jinju 1 and its somaclonal variants, indicating the presence of DNA sequence change during plant regeneration. Using 36 SSR markers, two polymorphic SSR markers were detected between Iksannamulkong and its somaclonal variants. Sequence comparison amplified with the primers flanking Satt545 showed four additional stretches of ATT repeat in the variant. This suggests that variation at the DNA level between somaclonal variants and their wild types could provide basis for inducing mutation via plant regeneration and broadening crop genetic diversity.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.477-490
• /
• 2006

Existing index structures need very much update cost because they repeat delete and insert operations in order to update continuously moving objects. In this paper, we propose a new index structure which reduces the update cost of continuously moving objects. The proposed index structure consists of a space partitioning index structure that stores the location of the moving objects and an auxiliary index structure that directly accesses to their current positions. In order to increase the fanout of the node, it stores not the real partitioning area but kd-tree as the information about the child node of the node. In addition, we don't traverse a whole index structure, but access the leaf nodes directly and accomplish a bottom-up update strategy for efficiently updating the positions of moving objects. We show through the various experiments that our index structure outperforms the existing index structures in terms of insertion, update and retrieval.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.7
• /
• pp.89-95
• /
• 2009

This paper proposes a tag indexing scheme for RFID tag using spatial index. The tag being used for the inventory management and the tag's location is determined by the position of readers. Therefore, the reader recognizes the tag, which is attached products and thereby their positions can be traced down. In this paper, we propose hTag-tree( Hybrid Tag index) which manages RFID tag attached products. hTag-tree is a new index, which is based on tag's attributes with fast searching, and this tag index manages RFID tags using reader's location. This tag index accesses rapidly to tags for insertion, deletion and updating in dynamic environment. This can minimize the number of node accesses in tag searching comparing to previous techniques. Also, by the extension of MER in present tag index, it is helpful to stop the lowering of capacity which can be caused by parent node approach. The proposed index experiment deals with the comparison of tag index. Fixed Interval R-tree, and present spatial index, R-tree comparison. As a result, the amount of searching time is significantly shortened through hTag-tree node access in data search. This shows that the use of proposed index improves the capacity of effective management of a large amount of RFID tag.

• Journal of Gastric Cancer
• /
• v.16 no.3
• /
• pp.167-176
• /
• 2016

Purpose: The purpose of this study was to determine the effect of a prior gastrectomy on the difficulty of subsequent colonoscopy, and to identify the surgical factors related to difficult colonoscopies. Materials and Methods: Patients with a prior gastrectomy who had undergone a colonoscopy between 2011 and 2014 (n=482) were matched (1:6) to patients with no history of gastrectomy (n=2,892). Cecal insertion time, intubation failure, and bowel clearance score were compared between the gastrectomy and control groups, as was a newly generated comprehensive parameter for a difficult/incomplete colonoscopy (cecal intubation failure, cecal insertion time >12.9 minutes, or very poor bowel preparation scale). Surgical factors including surgical approach, extent of gastrectomy, extent of lymph node dissection, and reconstruction type, were analyzed to identify risk factors for colonoscopy performance. Results: A history of gastrectomy was associated with prolonged cecal insertion time ($8.7{\pm}6.4$ vs. $9.7{\pm}6.5$ minutes; P=0.002), an increased intubation failure rate (0.1% vs. 1.9%; P<0.001), and a poor bowel preparation rate (24.7 vs. 29.0; P=0.047). Age and total gastrectomy (vs. partial gastrectomy) were found to be independent risk factors for increased insertion time, which slowly increased throughout the postoperative duration (0.35 min/yr). Total gastrectomy was the only independent risk factor for the comprehensive parameter of difficult/incomplete colonoscopy. Conclusions: History of gastrectomy is related to difficult/incomplete colonoscopy performance, especially in cases of total gastrectomy. In any case, it may be that a pre-operative colonoscopy is desirable in selected patients scheduled for gastrectomy; however, it should be performed by an expert endoscopist each time.

• Journal of the Korean Institute of Telematics and Electronics D
• /
• v.34D no.8
• /
• pp.1-7
• /
• 1997

In ahigh power amplifier design, power combiner/divider is used to connect low power amplifiers in parallel. The raidal structure of the powe combiner/divider has not only a good characteristics of port-to-port isolation but also an advantage of giving a redundancy to the structure itself by using RF switches. The parastics of a power resistor, that would be a problem in design process, are removed by both slot lines and cavity resonators, and the comon node in the circuit is rdesigned as a planar topology, and thus a new type of 4-way radial power combiner/divider is accomplished at 1840 ~ 1870 MH PCS frequency band. The insertion loss, reflection, and isolation characteristics of 40way radial power combiner/divider which can be adaptable to PCS system in this thesis are -0.3dB, -24dB,a dn -27dB respectively.

• Journal of Information Technology Applications and Management
• /
• v.11 no.2
• /
• pp.205-214
• /
• 2004

Internet evolves into the huge network with new nodes inserted or deleted depending on specific situations. A new model of network topology is needed in order to analyze time-varying Internet more realistically and effectively. In this study the non-monotony models are proposed which can describe topological changes of Internet such as node insertion and deletion, and can be used for predicting its future topology. Simulation is performed to analyze the topology generated by our model. Simulation results show that our proposed model conform the power law of realistic Internet better than conventional ones. The non-monotony model can be utilized for designing Internet protocols and networks with better security.

• Transactions of Materials Processing
• /
• v.13 no.4
• /
• pp.334-341
• /
• 2004

In this study, a remeshing algorithm adapted to the mesh density map using the Delaunay mesh generation method is developed. In the finite element simulation of forging process, the numerical error increases as the process goes on because of discrete property of the finite elements and distortion of elements. Especially, in the region where stresses and strains are concentrated, the numerical error will be highly increased. However, it is not desirable to use a uniformly fine mesh in the whole domain. Therefore, it is necessary to reduce the analysis error by constructing locally refined mesh at the region where the error is concentrated such as at the die corner. In this paper, the point insertion algorithm is used and the mesh size is controlled by using a mesh density map constructed with a posteriori error estimation. An optimized smoothing technique is adopted to have smooth distribution of the mesh and improve the mesh element quality.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.8
• /
• pp.1057-1063
• /
• 1995

This paper describes an approach for constucting a Rectilinear Steiner Tree (RST) derivable from a Minimum Spanning Tree (MST), using Associative Processor (AP). We propose a fast parallel algorithm using AP's basic algorithms which can be realized by the processing capability of rudimentary logic and the selective matching capability of Content- Addressable Memory (CAM). The main idea behind the proposed algorithm is to maximize the overlaps between the consecutive edges in MST, thus minimizing the cost of a RST. An efficient parallel linear algorithm with O(n) complexity to construct a RST is proposed using an algorithm to find a MST, where n is the number of nodes. A node insertion method is introduced to allow the Z-type layout. The routing process which only depends on the neighbor edges and the no-rerouting strategy both help to speed up finding a RST.