• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.358-360
• /
• 2001

In Integrated Services Internet the Resource Reservation Protocol (RSVP) provides a signaling mechanism for end to end QoS. In this paper, we propose a novel scheme using a Hierarchical Mobile Agents Tree (HMAT) based on the definition of new option called QoS Object Option (QOO) in order to improve the efficiency during handoff in Integrated Services Internet. Mobile agents are required to manage QOO, resource reservation and other mobility related basks un behalf of mobile hosts. This scheme is based on Mobile IPv6.

• Proceedings of The Korean Society of Agricultural and Forest Meteorology Conference
• /
• 2013.11a
• /
• pp.37-41
• /
• 2013

• Smart Media Journal
• /
• v.5 no.3
• /
• pp.9-16
• /
• 2016

Many countless services form using the Internet technology of things, in order to provide a variety of services in the current also many institutions, have created a new technology and protocols. In this paper, we design the resource service model for the efficient service provided by the system for controlling access to the Internet services of the things, to implement. The resources of the service that the user tries to access modeled using LCRS (Left Child-Right Sibling) tree, by utilizing the service token resource, it is possible to perform access control to services.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.3
• /
• pp.155-164
• /
• 2016

For frequency pattern analysis of large databases, the new tree-based frequency pattern analysis algorithm which can compensate for the disadvantages of the Apriori method has been variously studied. In frequency pattern tree, the number of nodes is associated with memory allocation, but also affects memory resource consumption and processing speed of the growth. Therefore, reducing the number of nodes in the tree is very important in the frequency pattern mining. However, the absolute criteria which need to order the transaction items for construction frequency pattern tree has lowered the compression ratio of the tree nodes. But most of the frequency based tree construction methods adapted the absolute criteria. FP-tree is typically frequency pattern tree structure which is an extended prefix-tree structure for storing compressed frequent crucial information about frequent patterns. For construction the tree, all the frequent items in different transactions are sorted according to the absolute criteria, frequency descending order. CanTree also need to absolute criteria, canonical order, to construct the tree. In this paper, we proposed a novel frequency pattern tree construction method that does not use the absolute criteria, IRFP-tree algorithm. IRFP-tree(Intersection Rule based FP-tree). IRFP-tree is constituted with the new paradigm of the intersection rule without the use of the absolute criteria. It increased the compression ratio of the tree nodes, and reduced the tree construction time. Our method has the additional advantage that it provides incremental mining. The reported test result demonstrate the applicability and effectiveness of the proposed approach.

• Journal of KIISE
• /
• v.43 no.7
• /
• pp.725-735
• /
• 2016

Smart TV uses Webkit as a web browser engine to provide contents such as web surfing, VOD watching, and games. Webkit uses web resources, such as HTML, CSS, JavaScript, and images, in order to run applications. At the start of an application, Webkit loads resources to the memory and creates DOM tree and render tree, which is a time consuming process. However, DOM tree and render tree created by the smart TV application do not change over time because the smart TV application uses web resources stored in a disk. If DOM tree and render tree can be stored and reused, it is possible to reduce loading time of an application. In this paper, we propose FastIO technique that selectively adds persistency to dynamically allocated memory. FastIO reduces overall application loading time by eliminating the process of loading resources from storage, parsing the HTML documents, and creating DOM tree and render tree. Comparison of the application resource loading times indicates that the web browser with FastIO is 7.9x, 44.8x, and 2.9x faster than the legacy web browser in an SSD, Ramdisk, and eMMC environment, respectively.

• Journal of Digital Convergence
• /
• v.19 no.12
• /
• pp.377-382
• /
• 2021

In order to advance forest resource management, it is necessary to solve problems such as the aging of forest-related industry workers and the field investigation system centered on manpower. Therefore, in this study, the trend of establishment and utilization of overseas forest geospatial information applied with the latest technology for scientific forest resource management was investigated to identify the domestic application plan. Overseas, photogrammetry and LiDAR technologies were being used to construct and utilize forest geospatial information. In the case of photogrammetry, it was used to measure the volume of vegetation, diameter, and tree height. And LiDAR technology has been applied to the measurement of diameter, and tree height. Through the analysis of overseas cases, it was identified how to construct forest geospatial information using photogrammetry and LiDAR, and it was found that LiDAR showed higher accuracy than photogrammetry. In the future, if the construction of forest geospatial information using various LiDAR sensors are performed and the accuracy and work efficiency are analyzed, it will be possible to present the possibility of using new technologies in the construction of forest geospatial information in Korea.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.2042-2060
• /
• 2013

In wireless sensor networks (WSNs), energy efficiency is one of the most essential design considerations, since sensor nodes are resource constrained. Group communication can reduce WSNs communication overhead by sending a message to multiple nodes in one packet. In this paper, in order to simultaneously resolve the transmission security and scalability in WSNs group communications, we propose a hierarchical cluster-based secure and scalable group key management scheme, called HRKT, based on logic key tree and route key tree structure. The HRKT scheme divides the group key into cluster head key and cluster key. The cluster head generates a route key tree according to the route topology of the cluster. This hierarchical key structure facilitates local secure communications taking advantage of the fact that the nodes at a contiguous place usually communicate with each other more frequently. In HRKT scheme, the key updates are confined in a cluster, so the cost of the key updates is reduced efficiently, especially in the case of massive membership changes. The security analysis shows that the HRKT scheme meets the requirements of group communication. In addition, performance simulation results also demonstrate its efficiency in terms of low storage and flexibility when membership changes massively.

• Korean Journal of Agricultural Science
• /
• v.50 no.4
• /
• pp.883-902
• /
• 2023

Water is critical to the health and productivity of fruit trees. Efficient monitoring of water stress is essential for optimizing irrigation practices and ensuring sustainable fruit production. Short-range sensing can be reliable, rapid, inexpensive, and used for applications based on well-developed and validated algorithms. This paper reviews the recent advancement in fruit tree water stress detection via short-range sensing, which can be used for irrigation scheduling in orchards. Thermal imagery, near-infrared, and shortwave infrared methods are widely used for crop water stress detection. This review also presents research demonstrating the efficacy of short-range sensing in detecting water stress indicators in different fruit tree species. These indicators include changes in leaf temperature, stomatal conductance, chlorophyll content, and canopy reflectance. Short-range sensing enables precision irrigation strategies by utilizing real-time data to customize water applications for individual fruit trees or specific orchard areas. This approach leads to benefits, such as water conservation, optimized resource utilization, and improved fruit quality and yield. Short-range sensing shows great promise for potentially changing water stress monitoring in fruit trees. It could become a useful tool for effective fruit tree water stress management through continued research and development.

• ETRI Journal
• /
• v.28 no.4
• /
• pp.517-520
• /
• 2006

In this letter, a new sharing mechanism, SRLG sharing, is proposed, which allows the links of the same shared risk link group (SRLG) in a primary light tree to share protections in WDM optical networks. In previous studies, how to share spare resources with SRLG constraints has not been studied in multicast optical networks. In this letter, considering SRLG sharing, we propose a novel algorithm -multicast with SRLG sharing (MSS)- to establish a protection light tree. Finally, the algorithm MSS and the algorithm multicast with no SRLG sharing (MNSS) are compared through a simulation to show that our new sharing scheme of SRLG sharing is more efficient than that of no SRLG sharing in terms of spare resource utilization and blocking probability.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.402-408
• /
• 2002

Multicast technology allows the transmission of data from one source node to a selected group of destination nodes. Multicast routes typically use trees, called multicast routing trees, to minimize resource usage such as cost and bandwidth by sharing links. Moreover, the quality of service (QoS) is satisfied by distributing data along a path haying no more than a given number of arcs between the root node of a session and a terminal node of it in the routing tree. Thus, a multicast routing tree for a session can be represented as a hop constrained Steiner tree. In this paper, we consider the hop-constrained multicast route packing problem with bandwidth reservation. Given a set of multicast sessions, each of which has a hop limit constraint and a required bandwidth, the problem is to determine a set of multicast routing trees in an arc-capacitated network to minimize cost. We propose an integer programming formulation of the problem and an algorithm to solve it. An efficient column generation technique to solve the linear programming relaxation is proposed, and a modified cover inequality is used to strengthen the integer programming formulation.