• Journal of the Korea Society of Computer and Information
• /
• v.15 no.5
• /
• pp.23-31
• /
• 2010

With the advances in the information technology and mobile communications, we now face increasing demands for various services based on both of position tracking of moving objects and their efficient index scheme. Accordingly, the $TPR^*$-tree, which were proposed for efficiently tracking moving objects and predicting their positions in the future time, has drawn much intention. As the $TPR^*$-tree came from the R-tree that is suitable for indexing static objects, it does not support cheap update costs. Therefore, it seems to be very costly to index moving objects if there are frequent occurrences of node updates caused by continuously changing velocities and positions. If some moving objects with high velocities have node updates, in particular, then the $TPR^*$-tree may suffer from many unnecessary updates in the wide range of tree regions. To avoid such a problem, we propose a method that can keep fast-moving objects in the child nodes of the root node, thereby saving node update costs in the $TPR^*$-tree. To show our performance advantages and retaining $TPR^*$-tree features, we performed some performance experiments using a simulation technique.

• Journal of Plant Biotechnology
• /
• v.3 no.2
• /
• pp.95-100
• /
• 2001

To select the section with shoot formation ability, the calli and shoot formation from three sections (first leaf including cotyledonary node, hypocotyl and cotyledon explants) of 5-days-seedlings of soybean were induced on MS medium supplemented with 1.0 mg/L BAP, 3% sucrose, and 0.3% gelrite for one month. The first leaf section exhibited the highest shoot formation rate (51%), followed the hypocotyl section (10%) and the cotyledon section (0%). The shoot formation rates and shoot number of the four excised sections (whole first leaf, a half of the first leaf, a third of the first leaf and only node) of the first leaf were also investigated on the same medium. A half of the first leaf explant and the third of the first leaf explant had higher shoot formation rates (76-80%) and numbers (3-4 / explants) than those in other two explants. Effects of six cytokinins (kinetin, zeatin, BAP, 2iP, PBA, and TDZ) on shoot formation were determined, using the half of the first leaf explants. Zeatin (1.0 mg/L) exhibited the highest in shoot formation rate (94%) and numbers (8 / explant). In addition, the combined effects of three cytokinins (zeatin, BAP, and TDZ; 0.5, 1.0, 2.0 mg/L, respectively) and an auxin (IAA; 0.0, 0.5, 1.0, 2.0 mg/L) were determined. The combination (1:1, v/v) of zeatin (1.0 mg/L) and IAA (1.0 mg/L) exhibited the highest in shoot formation rate (96%) and numbers (16 / explant), twice more than zeatin (1.0 mg/L) alone. The shoot cuttings were transferred and cultivated on the rooting media supplemented with only auxin, IBA at various concentrations. The highest root formation (8 / shoot) was achieved on the medium supplemented with 1.5 mg/L. After 4 weeks of cultivation, the plantlets with an extensive root system were transplanted in pots with a soil mixture of vermiculite and fine sand. Transferred to field, about 75% of the plantlets survived.

• Korean Journal of Medicinal Crop Science
• /
• v.10 no.3
• /
• pp.217-221
• /
• 2002

Callus induction and embryogenesis were studied in three different genotypes of Acanthopanax senticosus, to develop a protocol for somatic embryogenesis and acclimatization. Young leaf, stem, node, petiole, peduncle, flower and root explants were collected from 3-year old trees of A. senticosus accessions (Korea, Russia and Japan). Callus was obtained from all cultured explants but showed the higher rate of callus formation in flower cultured. For the three A. senticosus accessions, callus was well formd on MS media containing 2mg/ l of 2,4-D and 2mg/ l of TDZ, 4mg/ l of 2,4-D and 1mg/ l of TDZ than other treatments. For three A. senticosus accessions, when callus transferred to MS medium with 2,4-D, embryogenic cell formed. For A. senticosus accessions Korea, embryogenic cells were obtained on callus induced from petiole, stem, node and root explants, and induction rate was lower than 3%. 200mg of embryogenic callus was transferred to MS free liquid medium and somatic embryos of heart stage were obtained after 45days of culture. When somatic embryo of germination stage were transferred to solid medium, most of the embryos were regenerated into plantlets on 1/4 MS medium. Normal plants with both shoots and roots were transferred to greenhouse soil and were successfully acclimatized.

• Journal of The Korean Society of Grassland and Forage Science
• /
• v.12 no.3
• /
• pp.193-200
• /
• 1992

This study was carried out to determine the optimum fertilizer level of phosphate for maximum yield of soiling cowpea(Vigna sinensis Endlicher) in Cheju. The results obtained are summarized as follows:1. Plant length, fresh yield, stem and leaf weight per plant, node number of main stem, primary branch number per plant, pod number per plant and pod weight per plant increased with increasing of phosphate level regardless of growth stage.2. Plant length and node number of main stem did not increase after August 25, 40 days after planting. Leaf weight and fresh yield were greatest on August 25, and then reduced. 3. Stem weight the number of leaves and pods and pod weight per plant increased until September 13, 80 days after planting. 4. Increased level of phosphate delayed leaf weight decrease after August 25. 5. Root length and root weight per plant increased with increasing level of phosphate regardless of growth stage, and they did not increase after Augest 25. 6. Nodule number and nodule weight per plant also increased as phosphate rate increased regardlessof growth stage. Nodule number and nodule weight were greatest on August 5, and then rapidly decreased.

• Convergence Security Journal
• /
• v.22 no.4
• /
• pp.169-178
• /
• 2022

In general, organizations operating multi-domain networks find it difficult to represent and manage multiple domain net works on a single screen space. Instead, most of them are managed with multiple screens visualizing network topology by domain or partitioning one screen area into multiple domains. We propose an efficient method to visualize the topology using only minimal connection information between domain-agnostic nodes in this work. This method visualizes the topology by utilizing centrality indices representing the influence of nodes in the network. Furthermore, the method dynamically segments the entire node's display area using virtual Root nodes to auto-separate domains and weights of child nodes and placing nodes in 3D space. Thus, although it is a straightforward method, the multi-domain network topology can be visualized with only minimal connection information between nodes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.133-140
• /
• 2012

This paper suggests an algorithm that can shorten the complexity $O(n^2)$ of Dijkstra algorithm that is applied to the shortest path searching in real-time GPS Navigation System into an up-to-date O(n). Dijkstra algorithm manipulates the distance of the minimum length path by visiting all the nodes from the starting node. Hence, it has one disadvantage of not being able to provide the information on the shortest path every second, in a city that consists of sophisticated roads, since it has to execute number of node minus 1. The suggested algorithm, firstly, runs by means of organizing the set of out-neighbourhood nodes at each level of the tree, and root node for departure node. It also uses a method of manipulating the distance of the minimum path of all out-neighborhoods and interior of the out-neighborhoods. On applying the suggested algorithm to two sophisticated graphs consisted of bi-direction and uni-direction, we have succeeded to obtain the distance of the minimum length path, just as same as Dijkstra algorithm. In addition, it has an effect of shortening the time taken 4 times from number of node minus1 to number of level minus 1. The satisfaction of the drivers can be increased by providing the information on shortest path of detour, every second, when occurs any rush hour or any traffic congestion due to car accident, by applying this suggested algorithm to the real-time GPS system.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.2
• /
• pp.285-292
• /
• 2018

In this paper, we propose a distributed search of a cluster robot using tree structure in an unknown environment. In the proposed method, the cluster robot divides the unknown environment into 4 regions by using the LRF (Laser Range Finder) sensor information and divides the maximum detection distance into 4 regions, and detects feature points of the obstacle. Also, we define the detected feature points as Voronoi Generators of the Voronoi Diagram and apply the Voronoi diagram. The Voronoi Space, the Voronoi Partition, and the Voronoi Vertex, components of Voronoi, are created. The generated Voronoi partition is the path of the robot. Voronoi vertices are defined as each node and consist of the proposed tree structure. The root of the tree is the starting point, and the node with the least significant bit and no children is the target point. Finally, we demonstrate the superiority of the proposed method through several simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.5888-5903
• /
• 2019

The Relational ranking method applies authority-based ranking in relational dataset that can be modeled as graphs considering also their tuples' values. Authority directions from tuples that contain the given keywords and transfer to their corresponding neighboring nodes in accordance with their values and semantic connections. From our previous work, ObjectRank extends to ValueRank that also takes into account the value of tuples in authority transfer flows. In a maked difference from ObjectRank, which only considers authority flows through relationships, it is only valid in the bibliographic databases e.g. DBLP dataset, ValueRank facilitates the estimation of importance for any databases, e.g. trading databases, etc. A relational keyword search paradigm Object Summary (denote as OS) is proposed recently, given a set of keywords, a group of Object Summaries as its query result. An OS is a multilevel-tree data structure, in which node (namely the tuple with keywords) is OS's root node, and the surrounding nodes are the summary of all data on the graph. But, some of these trees have a very large in total number of tuples, size-l OSs are the OS snippets, have also been investigated using ValueRank.We evaluated the real bibliographical dataset and Microsoft business databases to verify of our proposed approach.

• IE interfaces
• /
• v.11 no.2
• /
• pp.39-48
• /
• 1998

It is strongly believed that Video on Demand(VOD) will become one of the most promising services for Broadband Integrated Services Digital Network(B-ISDN). VOD service can be classified into two types of services: Near VOD(NVOD) and Interactive VOD(IVOD). Although VOD network requires many kinds of resources, we only consider video servers, programs. and storages. In the network. some video servers should be installed at some nodes(especially, at the root node for NVOD service). so that each node with video server stores video programs and distributes stored programs to customers. We take into account three kinds of costs related with the above resources: a program transmission cost, a program storage cost, and a video server installation cost. There exists a trade-off relationship among those three costs according to the locations of video servers and the kinds of programs stored at each video server. Given a multi-level VOD network and the total number of programs being served in the network. the resource. optimization problem for providing both IVOD and NVOD services is to determine where to install video servers, and which and how many programs should be stored at each video server, in order to minimize the total cost. In this paper we develop an efficient dynamic programming algorithm to solve the problem. We also implement the algorithm based on two different service policies assumed in this paper.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.4
• /
• pp.9-17
• /
• 2007

Network Mobility basic support protocol (NEMO Basic) extends the operation of Mobile IPv6 to provide uninterrupted Internet connectivity to the communicating nodes of mobile networks. The protocol uses a mobile router (MR) in the mobile network to perform prefix scope binding updates with its home agent (HA) to establish a bi-directional tunnel between the HA and MR. This solution reduces location-update signaling by making network movements transparent to the mobile nodes (MNs) behind the MR. However, delays in data delivery and higher overheads are likely to occur because of sub-optimal routing and multiple encapsulation of data packets. To manage the mobility of the mobile network, it is important to minimize packet overhead, to optimize routing, and to reduce the volume of handoff signals over the nested mobile network. This paper proposes en aggregate router-assisted route optimization (ARARO) scheme for nested mobile networks support which introduces a local anchor router in order to localize handoff and to optimize routing. With ARARO, a mobile network node (MNN) behind a MR performs route optimization with a correspondent node (CN) as the MR sends a binding update message (BU) to aggregate router (AGR) via root-MR on behalf of all active MNNs when the mobile network moves. This paper describes the new architecture and mechanisms and provides simulation results which indicate that our proposal reduces transmission delay, handoff latency and signaling overhead. To evaluate the scheme, we present the results of simulation.