• Journal of Information Processing Systems
• /
• v.13 no.1
• /
• pp.104-113
• /
• 2017

In this paper, we present an approach to transmit data from the source to the destination through a minimal path (least-cost path) in a computer network of n nodes. The motivation behind our approach is to address the problem of finding a minimal path between the source and destination. From the work we have studied, we found that a Steiner tree with bounded Steiner vertices offers a good solution. A novel algorithm to construct a Steiner tree with vertices and bounded Steiner vertices is proposed in this paper. The algorithm finds a path from each source to each destination at a minimum cost and minimum number of Steiner vertices. We propose both the sequential and parallel versions. We also conducted a comparative study of sequential and parallel versions based on time complexity, which proved that parallel implementation is more efficient than sequential.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.7
• /
• pp.1311-1317
• /
• 2007

Recently, due to the popularity and explosive growth of the Internet, the information exchange is increasing so rapidly over the Internet. Also the XML is becoming a standard as well as a major tool of data exchange on the Internet and thus we propose the new indexing technique for evaluating a path-oriented query and design and implementation of Path-oriented Query Processing System to give useful for users. In proposed indexing technique, which combined a binary trio structure with a path signature file to improve performance of XML document retrieval.

• Journal of Information Processing Systems
• /
• v.14 no.6
• /
• pp.1457-1463
• /
• 2018

In recent times, Natural User Interface/Natural User Experience (NUI/NUX) technology has found widespread application across a diverse range of fields and is also utilized for controlling unmanned aerial vehicles (UAVs). Even if the user controls the UAV by utilizing the NUI/NUX technology, it is difficult for the user to easily control the UAV. The user needs an autopilot to easily control the UAV. The user needs a flight path to use the autopilot. The user sets the flight path based on the waypoints. UAVs normally fly straight from one waypoint to another. However, if flight between two waypoints is in a straight line, UAVs may collide with obstacles. In order to solve collision problems, flight records can be utilized to adjust the generated path taking the locations of the obstacles into consideration. This paper proposes a natural path generation method between waypoints based on flight records collected through UAVs flown by users. Bayesian probability is utilized to select paths most similar to the flight records to connect two waypoints. These paths are generated by selection of the center path corresponding to the highest Bayesian probability. While the K-means algorithm-based straight-line method generated paths that led to UAV collisions, the proposed method generates paths that allow UAVs to avoid obstacles.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.9
• /
• pp.663-670
• /
• 1988

Advances in VLSI technology have made it possible to have a larger number of processing elements to be included in highly parallel processor system. A system with a large number of processing elements and memory requires a complex data path. Multistage Interconnection networks(MINS) are useful in providing programmable data path between processing elements and memory modules in multiprocessor system. In this thesis, the performance of MINS for the star network has been analyzed and compared with other networks, such as generalized shuffle network, delta network, and referenced crossbar network.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.1E
• /
• pp.33-42
• /
• 2003

Kuo et al proposed an on-line method for an adaptive prediction error filter for improving secondary path modeling performance in the modeling method of the secondary path. This method have some disadvantages, namely having to use additive noise with the result that noise control performance is not good since it is focused on the estimated performance of the secondary path. In this paper, we proposes a modified Kuo model using gain control parameter and delay. It uses a reference signal for additive noise to improve the problems in the existing Kuo model.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.4
• /
• pp.286-293
• /
• 2004

Recently, hot processing using the heat source like laser machining and RFS was developed and spreaded gradually. In order to generate tool-path for the proper hot tool, a new tool-path linking algorithm is needed because tool-path linking algorithm for machining can't be applied. In this paper, zigzag tool-path liking algorithm was proposed to generate tool-path automatically for RFS. The algorithm is composed of three steps: 1) Generating valid tool-path element, 2) Storing tool-path elements and creating sub-groups, 3) linking sub-groups. Using the proposed algorithm, CAD/CAM software for the tool-path generation of hot tool was developed. The proposed algorithm was applied and verified for Venus's face and die of cellular phone case.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 1996.06c
• /
• pp.591-597
• /
• 1996

To straighten the path that farm machinery follows in paddy fields, it is necessary to measure and evaluate the tracks that these machines leave behind. However, there are no known methods for making such measurements and evaluations since it is difficult to accurately trace the paths that the machine make in paddy fields. Therefore, a measuring system has been developed which can accurately recored the path of a farm machinery in a field by measuring the horizontal straight-line distance from the side of the field to the machine. This system consists of a track subsystem on the machine and a range finder system. A measuring appraratus is installed on a flatcar which runs on rails over 50 m long at the side of the filed. The track subsystem uses a CCD camera to track the movement of the machine in the field which is following a lengthwise path. The range finder subsystem measures the distance that the measuring apparatus has traveled on the rails and the distance from the app ratus to the machine in the field. This system makes it possible to record the path that the machine travels. Even though differences in traveling distance arise between the measuring apparatus and the farm machine, these differences are detected by image processing , which allows the machine in the field to be located accurately. The short(0.05 second) time required for image processing is enough to follow an object . In the present study, this system was able to measure the path that a moving tractor makes. Even though a lag of up to 0.4 meters occurred, this system did not miss its target during operation of the track subsystem. Thus the path measuring system developed here is able to record vehicle paths automatically by following the movement of vehicles in the field and measuring the distance to them. It is expected to come into use in such applications as unmanned moving vehicle tests.

• Journal of the Institute of Convergence Signal Processing
• /
• v.6 no.4
• /
• pp.182-190
• /
• 2005

In the paper, we propose an intelligent automatic parking assist system. To realize an automatic parking, first, the prospective parking position and the location of a vehicle should be recognized. Second, the system should compute a path which introduces the parking position precisely with avoiding any obstacles. Third, the handle should be controlled so that the vehicle moves through the path. To calculate the location of the vehicle and its surroundings, the system applies the camera image method to transforming input images to the plane map. It also uses the inertial navigation method which recognizes the position and the direction of a moving vehicle by using a kinematic model of the vehicle. To generate a path of the vehicle, the simple path method and the Bezier spline method are tested. The divided arc method which generates multiple paths is also tested. We apply a method which makes the system choose the best path with multiple objective functions. We introduce the virtual road method, as a solution for the problem of mechanical time delay, to have the vehicle followed the designated path.

• Journal of KIISE:Databases
• /
• v.30 no.6
• /
• pp.641-650
• /
• 2003

The eXtensible Markup Language(XML) is emerging as a standard format of data representation and exchange on the Internet. There have been researches about storing and retrieving XML documents using the relational database which has techniques in full growth about large data processing, recovery, concurrency control and so on. Since in previous systems same structure information and fundamental operation are used for processing of various kinds of XML queries, only some specific query can be efficiently processed not all types of query. In this paper, we propose a flexible query processing system. To process query efficiently, the proposed system analyzes regular path expression queries, and uses $\theta$-join operation using region numbering values to check ancestor-descendent relationship and equi-join operation using parent's region start value to check parent-child relationship. Thus, the proposed system processes efficiently XML regular path expressions. From the experimental results, we show that proposed XML query processing system is more efficient than previous systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.9
• /
• pp.2385-2401
• /
• 1996

In this paper, a management model and a path trace algorithm are proposed for the end-to-end path tracing management in ATM network. Proposedmodel is based on the TINA(Telecommunication Information Networking Architecture) and computational object(CO) of ODP(Open Distributed Processing).We related computational object for the path trace to another computational object which covers the ATM routing and established operational procedure according to this relationship. This procedure identifies the end-to-end by way of tracing the ATM connections then collect identification information on the that path. End-to-end trace is performed on the network management level. Broadcasting-with-synchronized-control and GTM(Global Ticket Method) are proposed as path trace algorithm considering the real time properties and data ingetrity. Computer simulations are also performed to evaluate the performance of the proposed algorithm and its resuls are shown in this paper.