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

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.13 no.5
• /
• pp.27-34
• /
• 2014

This paper presents a collision avoidance scheme for wireless sensor networks that use a GTS-based channel allocation scheme. Many sensor nodes can share a GTS channel for sending their data to the sink node. When a node tries to send a frame at a shared GTS channel, a collision can be occurred when there is a node that uses the same backoff number. For decreasing a wireless collision, the parent assigns a backoff number when a child node registers to it. Further, when a collision occurs during a data transfer, the parent node reassigns a new backoff number for the child node. Simulation results show that there is a decreased collision number with suggested parent-controlled collision avoidance scheme by effectively controlling the backoff number of the child.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.5
• /
• pp.123-128
• /
• 2019

The Internet Engineering Task Force (IETF) proposed IPv6 Routing Protocol for Low-power Lossy Network (RPL) as a routing protocol for Low Power and Lossy Networks (LLN). In RPL networks, only a few parent nodes are connected to many child nodes, which is called Thundering Herd Phenomenon. To solve this problem, it has been considered to limit the maximum number of child nodes connected per node using the CNC (Child Number Count) parameter. However, the problem remains that some parent nodes can be attached with as many as the maximum number of child nodes. How to determine the maximum CNC value is yet another problem. Therefore, in this paper, we propose an algorithm that evenly distributes the number of child nodes connected per node, to solve the Thundering Herd Phenomenon problem. The performance of the proposed algorithm is compared with that of the conventional RPL using CNC. As a result, we showed that the proposed algorithm performs better in terms of load balancing.

• Journal of Distribution Science
• /
• v.14 no.5
• /
• pp.107-114
• /
• 2016

Purpose - Loading can decrease the productivity due to the possibility of carrying out with the opposite order of storage in container terminal. When the container is to be taken out, it is needed to move the container stacked upon the container to be carried out to other place temporarily. It is called as rehandling. Remarshalling, with the loading plan, is the arranging the containers before the ship arrives in order to avoid the rehandling during the carrying out. The present study tried to find out the factors affecting the efficiency when building the remarshalling plan with the utilization of neighboring storage space as a outer slot, and analyzed the efficiency of several remarshalling algorithms with the combination of those factors. Research design, data and methodology - The present study used, when the remarshalling plan is prepared for utilizing the outer slot, the simulation methods in order to compare the efficiency of the remarshalling algorithms which made with the factors affecting the efficiency. The factors affecting the efficiency are the method of making the child node, method of arrangement, and possibility of application of FIX. In order to analyze the affecting factors on the efficiency, several algorithms are prepared with the combination of production of the child node and the arrangement method with the availability of FIX application. With this algorithm, the effect of the factors on the efficiency after building up of remarshalling plan with the target on the bay with 10 rows, 8 columns, and 10 indices. Results - The method of rearrangement and making of a child node as the factor affecting the efficiency of remarshalling utilization of the outer bay were studied. It is efficient to combine the method of making a child node with MCS in order to reduce the number of moving the containers. For reducing the time in carrying out, it was found that all arrangement methods should be combined with RCS for the efficiency. The result of experiment shows the application of FIX with good result in case of succession ratio. In addition, when FIX was not applied, all of the most combinations resulted in short time in remarshalling. As a result, it can be concluded that the algorithm with proper combination of making the child node and the arrangement can increase the job efficiency based on the importance. Conclusion - The present study suggested and analyzed the algorithms with the combination of the arrangement method, the making of child node, and FIX. It is needed to develop the algorithm to judge the possibility whether the best remarshalling plan can be built or not within the bay in order to find a better method between the two cases such as within the bay and outer the bay. As a method for extending the study on the factors affecting the efficiency, it is possible to find out the way to build the remarshalling plan within the permitted time under any storage situation.

• Journal of Information Processing Systems
• /
• v.5 no.4
• /
• pp.229-236
• /
• 2009

Sensors are deployed to gather physical, environmental data in sensor networks. Depending on scenarios, it is often assumed that it is difficult for batteries to be recharged or exchanged in sensors. Thus, sensors should be able to process users' queries in an energy-efficient manner. This paper proposes a spatial query processing scheme- Minimum Bounding Area Based Scheme. This scheme has a purpose to decrease the number of outgoing messages during query processing. To do that, each sensor has to maintain some partial information locally about the locations of descendent nodes. In the initial setup phase, the routing path is established. Each child node delivers to its parent node the location information including itself and all of its descendent nodes. A parent node has to maintain several minimum bounding boxes per child node. This scheme can reduce unnecessary message propagations for query processing. Finally, the experimental results show the effectiveness of the proposed scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.7
• /
• pp.1599-1607
• /
• 2015

Recently, researches have been developing efficient techniques for accessing, querying, and managing XML documents which are frequently used in the Internet. In this paper, we propose a parent-child matrix to cluster XML documents efficiently. A parent-child matrix analyzes both the content and structural features of an XML document. Each cell of a parent-child matrix has either the value of a node in an XML tree or the value of a child node, where a parent-child relationship exists in the XML tree. Then, the similarity between two XML documents can be measured by the similarity between two corresponding parent-child matrices. The experiment shows that our proposed method has good performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1475-1482
• /
• 2009

In ZigBee network, using energy efficiently is necessary because ZigBee node works by battery. To use energy efficiently, it is one of the way to reduce unnecessary network traffic. In this paper, it presents efficient shortcut routing algorithm using depth of destination node in ZigBee network. In traditional tree routing, each node transfers data only to its own parent or child node, which is inefficient way. Efficient shortcut routing algorithm is also based on tree routing. However, we suggests the algorithm with using neighbor table and depth of destination that is able to transfer data to other neighbor node, not only to parent or child node. It minimizes coordinator bottleneck state and unnecessary intermediate routing path which happens in traditional tree routing.

• Asian Pacific Journal of Cancer Prevention
• /
• v.13 no.11
• /
• pp.5517-5523
• /
• 2012

Purpose: To evaluate the diagnostic accuracy of ultrasonograph and fine-needle aspiration cytologic examination (USG-FNAC) in the staging of axillary lymph node metastasis in breast cancer patients.Methods: We conducted an electronic search of the literature addressing the performance of USG-FNAC in diagnosis of axillary lymph node metastasis in databases such as Pubmed, Medline, Embase, Ovid and Cochrane library. We introduced a series of diagnostic test indices to evaluate the performance of USG-FNAC by the random effect model (REM), including sensitivity, specificity, likelihood ratios, and diagnostic odds ratios and area under the curve (AUC). Results: A total of 20 studies including 1371 cases and 1289 controls were identified. The pooled sensitivity was determined to be 0.66 (95% CI 0.64-0.69), specificity 0.98 (95% CI 0.98-0.99), positive likelihood ratio 22.7 (95% CI 15.0-34.49), negative likelihood ratio 0.32 (95% CI 0.25-0.41), diagnostic OR 84.2 (95% CI 53.3-133.0). Due to the marginal threshold effect found in some indices of diagnostic validity, we used a summary SROC curve to aggregate data, and obtained a symmetrical curve with an AUC of 0.942. Conclusion: The results of this meta-analysis indicated that the USG-FNAC techniques have acceptable diagnostic validity indices and can be used for early staging of axillary lymph node in breast cancer patients.

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

• Journal of Korea Spatial Information System Society
• /
• v.6 no.1 s.11
• /
• pp.19-29
• /
• 2004

Recently, studies have been performed to improve the cache performance of the R-Tree in main memory. A general mothed to improve the cache performance of the R-Tree is to reduce size of an entry so that a node can store more entries and fanout of it can increase. However, this method generally requites additional process to reduce information of entries and do not support incremental updates. In addition, the cache miss always occurs on moving between a parent node and a child node. To solve these problems efficiently, this paper proposes and evaluates the PR-Tree that is an extended R-Tree indexing method using prefetching in main memory. The PR-Tree can produce a wider node to optimize prefetching without additional modifications on the R-Tree. Moreover, the PR-Tree reduces cache miss rates that occur in moving between a parent node and a child node. In our simulation, the search performance, the update performance, and the node split performance of the PR-Tree improve up to 38%. 30%, and 67% respectively, compared with the original R-Tree.