• The Journal of the Korea Contents Association
• /
• v.5 no.2
• /
• pp.187-197
• /
• 2005

In this paper, we propose an extended TB-tree, called ETB-tree, which can improve the performance of an existing TB-tree proposed for indexing the trajectories of moving objects in Location-Based Service(LBS). The proposed ETB-tree directly accesses the preceding node by maintaining a direct table, called D-Table which contains the page number in disk and memory pointers pointing the leaf node with the first and last lines segment of moving objects. It can improve the insertion performance by quick searching the preceding node of a moving object and retrieval performance owing to accessing directly the corresponding trajectories In disk for the trajectory-based query. In addition, the ETB-tree provides consistency of a tree by reflecting a newly inserted line segment to the tree both in memory and disk. The experimental results show that the proposed indexing technique gains better performance than other traditional ones with respect to the insertion and retrieval of a trajectory query.

• Management Science and Financial Engineering
• /
• v.12 no.2
• /
• pp.63-69
• /
• 2006

To generate a multicast routing tree guaranteeing the quality of service (QoS), we consider the hop constrained Steiner tree problem and propose a new mathematical formulation for it, which contains fewer constraints than a known formulation. An efficient procedure is also proposed to solve the problem. Preliminary tests show that the procedure reduces the computing time significantly.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.9
• /
• pp.107-114
• /
• 2011

Because of boost of communications devices furnishing diverse services and rapid expansion of mobile business, good use and management of the existing network system become very important. Also, offering service corresponding with user communication requirement grades which vary widely in each person, is vital for communication service provider. In this paper, SGOSST, a mechanism of efficient network construction with minimum cost for network QoS is proposed. In experiments, though spending 252.97% more execution times, our SGOSST QoS network consumed 5.11% less connecting costs than the network constructed by weighted minimum spanning tree method. Therefore our mechanism can work well for efficient operation and service providing in the network formed with users and communication devices of various service requirement grade as smart/mobile equipment.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.22 no.9
• /
• pp.82-87
• /
• 2008

Faster, safer and cheaper mailing of the postal matter is essential for surviving in the competitive market of home-delivery service. In the past, the domestic delivery business has been nu by only a few number of companies. But more and more number of companies including medium size ones are participating in the business, and the competition is getting severe. This paper proposes a method to select the optimal location of mail distribution centers that minimally connect the local mail centers of some major cities in Korea using the Steiner Tree theory, which is about connecting a finite number of points with a minimal length of paths and has been used in the distribution system optimization and optimal routing of the transmission lines of the electric power system. By using Steiner Tree theory in finding the best location of the postal delivery hub, we may expect the reduction of transportation cost and the increase of profit, resulting in acquiring the superior position in the competitive delivery business. It is expected that we may use the Steiner Tree theory in finding the best location of the electric power substation for the nott higher EHV(extreme high voltage) transmission network.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.187-189
• /
• 2000

Nowadays, efforts are in progress for the standardization of CORBAbased telecommunication network management framework. To implement a network management system based on the framework completely, CORBA ORB and some of CORBA service should be installed in the element. And then, there must be the naming tree, which correspond to the containment relationships between components in the network element. If we use conventional OMG naming service to form the naming tree, all MOs, a software fragmenthat corresponds to each component in a system, should be instantiated. However, the network element is usually a kind of limited resource system, which cannot provide sufficient resources for applications run on it. Hence, instantiatingall MOs can cause problems for that kind of system, This paper presents Smart Naming Service architecture as a solution to the problem.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.10a
• /
• pp.473-474
• /
• 2019

Recently, data security and convenience are critical requirements to the interaction and collaboration of tourism service systems for the tourism industry. However, there are still many challenges for current tourism service systems to fulfill these requirements since they have inconsistent structures with different access control models and security policies. Blockchain has the potential to evolve the conventional tourism industry benefiting by its unique features such as data privacy and transparency. This paper mainly aims the interworking mechanism of heterogenous blockchain platforms for secure tourism service. We propose interworking scheme to connect multi-blockchain platforms for enhancing data integrity in the tourism industry. A proof of concept design and implement based on Hyperledger Fabric and Winding Tree.

• Journal of Broadcast Engineering
• /
• v.21 no.4
• /
• pp.569-577
• /
• 2016

Place recognition for LBS (Location Based Service) has been one of the important techniques for user-oriented service. FLANN (Fast Library for performing Approximate Nearest Neighbor) of place recognition with image features is fast, but it is affected much by environmental condition such as occlusions. This paper presents a place recognition method using quad vocabulary tree with SURF (Speeded Up Robust Features). In learning stage, an image is represented with spatial pyramid of three levels and vocabulary trees of their sub-regions are constructed. Query image is matched with the learned vocabulary trees in each level. The proposed method measures homography error of the matched features. By considering the number of inliers in sub-region, we can improve place recognition performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1037-1043
• /
• 2006

This work presents an effective overlay multicast tree construction algorithm for synchronized real-time media multicast service over the Internet. The proposed algorithm is designed to minimize delay variance among group members to provide the synchronized service as well as average delay of group members in order to support the service in real-time. Basically, of orthogonal genetic algorithm is employed to obtain the near optimal tree with a low computational complexity since the given problem is NP-complete. Finally, experimental results are provided to show the superior performance of the proposed algorithm.

• The KIPS Transactions:PartC
• /
• v.18C no.6
• /
• pp.441-444
• /
• 2011

In this study, we present a method for efficiently aggregating network state information. It is especially useful for aggregating links that have both delay and bandwidth in an asymmetric network. Proposed method reduces the information distortion of logical link by integration process after similar measure and grouping of logical links in multi-level topology transformation to reduce the space complexity. It is applied to transform the full mesh topology whose Service Boundary Line (SBL) serves as its logical link into a spanning tree topology. Simulation results show that aggregated information accuracy and query response accuracy are higher than that of other known method.

• Journal of Digital Contents Society
• /
• v.15 no.5
• /
• pp.569-577
• /
• 2014

The various services are required to user in time and space. It is important to provide suitable service to user according to user's circumstance. Therefore it is need to provide services to user through mining by latest information of user activity and service history. In this paper we propose a mining method to search association rule using service history based on spatiotemporal information and service ontology. In this method, we find the associative service pattern using level-cross tree on service ontology. The proposed method is to be a basic research to find the service pattern to provide high quality service to user according to season, location and age under the same context.