• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.6
• /
• pp.81-91
• /
• 2008

In this study, data collection delay time generated in bus information system is analysed and improvement on system reliability by minimizing the delay time is suggested. To minimize the data collection delay time (call setup time), factors on data collection phase are analyzed. Each connecting time that it occurs from wireless communication during data collection phase, is selected as a main effective variable and a model for selecting an optimum communication point to minimize the effect of data delay time by each connecting time is suggested. In this model, minimization of the point between the time carrying out wireless communication and vehicle moving time, is calculated and the difference between the bus arrival time and information delivered time to the passenger is reduced. The test results for the proposed model in BIS using a CDMA (Code Division Multiple Access) communication show that delay time in real system operation has been improved. The minimum data collection delay time based on optimal communication position leads to the better reliability for Bus Information System. This study can be applied to the selection of optimal communication position and detection position instead of empirical methods.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.11
• /
• pp.81-90
• /
• 2014

For necessary information sharing or operation control via wire-wireless/mobile network connecting of devices at disaster area in greatest need of attention, an emergency network efficient construction method quickly connecting nodes within specific range using Delaunay triangulation is proposed. The emergency network constructed by proposed method shows the same aggregate network length, but does more excellent performance in term of network construction time the more long max length connectable to adjacent node as compared with the network by naive method. In experiment of 1000 input terminal nodes, 5 max length connectable to adjacent node, our proposed method enhances 89.1% in execution time without network length increase compared to naive method. So our method can go well to many useful applications as shift construction of communication network of adjacent devices, internet of things and efficient routing in the sensor network in continuous improvement of communication capability.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10a
• /
• pp.882-885
• /
• 1987

The path of an industrial manipulator in a crowded workspace generally consists of 8 set of Cartesian straight line path connecting a set of two adjacent points. To achieve the Cartesian straight line path is, however, a nontrivial task and an alternative approach is to place enough intermediate points along a desired path and linearly interpolate between these points in the joint space. A method is developed that determines the subtravelling- and the transition-time such that the total travelling time for this path is minimized subject to the maximum joint velocities and accelerations constraint. The method is based on the application of nonlinear programming technique, i.e., FTM (Flexible Tolerance Method). These results are simulated on a digital computer using a six-joint revolute manipulator to show their applications.

• Journal of information and communication convergence engineering
• /
• v.8 no.1
• /
• pp.59-63
• /
• 2010

The shortest path between two points inside a simple polygon P is a minimum-length path among all paths connecting them which don't pass by the exterior of P. A linear time algorithm for computing the shortest path in a general simple polygon requires triangulating a given polygon as preprocessing. The linear time triangulating is known to very complex to understand and implement it. It is also inefficient in case that the input without very large size is given because its time complexity has a big constant factor. Two points of a polygon P are said to be L-visible from each other if they can be joined by a simple chain of at most two rectilinear line segments contained in P completely. An L-visible polygon P is a polygon such that there is a point from which every point of P is L-visible. We present the customized optimal shortest path algorithm for an L-visible polygon. Our algorithm doesn't require triangulating as preprocessing and consists of simple procedures such as construction of convex hulls and operations for convex polygons, so it is easy to implement and runs very fast in linear time.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2015.05a
• /
• pp.334-334
• /
• 2015

The results of flow feature around two circular cylinders in various arrangements are carried out using two-dimensional simulation at Reynolds number of 200. In this work, time-averaged fluid force acting on the upstream and downstream cylinders were calculated for staggered angle ${\alpha}=0{\sim}90^{\circ}$ in the range of L/D = 1.1~5, where ${\alpha}$ is the angle between the free-stream flow and the line connecting the centers of the cylinders, L is centre-to-centre distance and D is cylinder diameter. The dependence of magnitudes and trends of fluid force coefficient on the spacing ratio L/D and ${\alpha}$ are discussed. In all arrangements of two cylinders, tandem arrangement (${\alpha}=0^{\circ}$) is the case produced a minimum drag coefficient for downstream cylinder. Moreover, the locations of separation and stagnation points or pressure coefficient on surface of the cylinder were examined. Acknowledgement: "This research was a part of the project titled 'Development of integrated estuarine management system', funded by the Ministry of Oceans and Fisheries, Korea."

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.11
• /
• pp.159-165
• /
• 2013

This paper proposes a O(E) polynomial-time algorithm that has been devised to simultaneously solve edge-coloring problem and graph classification problem both of which remain NP-complete. The proposed algorithm selects an edge connecting maximum and minimum degree vertices so as to determine the number of edge coloring ${\chi}^{\prime}(G)$. Determined ${\chi}^{\prime}(G)$ is in turn either ${\Delta}(G)$ or ${\Delta}(G)+1$. Eventually, the result could be classified as class 1 if ${\chi}^{\prime}(G)={\Delta}(G)$ and as category 2 if ${\chi}^{\prime}(G)={\Delta}(G)+1$. This paper also proves Vizing's planar graph conjecture, which states that 'all simple, planar graphs with maximum degree six or seven are of class one, closing the remaining possible case', which has known to be NP-complete.

• Journal of Korean Society of Transportation
• /
• v.27 no.1
• /
• pp.35-42
• /
• 2009

One of the problems we face up at the time of planning or improving a transportation transfer facility is which modes and how close we have to put together. The goal here is to keep the connecting transportation mode as close as possible to the prime transit mode, so people travel a minimum transfer path, a distance from one mode to another. Too much a physical separation between modes will limit, even with an intensive improvement of the component links, the level of service of a transfer path as a whole. This study defined a transfer path as the whole stretch of the distance from an arrival point of one mode to the departure point of the connecting mode. The transfer path was divided into three typical segments as side walk, stairways, and indoor corridors. Preference surveys were made for each of these segments, resulting in relative resistance. The sum of individual segments weighted with the relative resistance will make a transfer resistance of the path, which in turn constitutes a transfer utility function together with the overall satisfaction score obtained by the interview survey. The transfer utility function has been utilized to evaluate the transfer distance between modes.

• The KIPS Transactions:PartA
• /
• v.16A no.5
• /
• pp.339-346
• /
• 2009

In order to connect web services, clients generally should use heavy frameworks such as .Net framework and Java run-time environment, which require high performance hardware resources like a personal computer. Therefore, it is impossible for sensor nodes to handle web services due to their limited resources. In this paper, a client agent framework is proposed for dynamically connecting web services in the client node with limited resources. A client agent, which is managed by the framework in other server, has full capability for connecting web services, while a real client has a simple connection module with the client agent. In this framework, a client agent is dynamically generated using the WSDL in the web service server. By using the framework, sensor nodes or mobile devices can enhance their functionalities and services by accessing web services with minimum resources.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.29 no.4
• /
• pp.389-394
• /
• 2023

In recent years, use of machine automation is rising in the industry. Ships also obtain machine condition information from sensor as digital information. However, on ships, crew members regularly surveil the engine room to check the condition of equipment and their information through analog gauges. This is a time-consuming and tedious process and poses safety risks to the crew while on surveillance. To address this, engine room surveillance using an autonomous mobile robot is being actively explored as a solution because it can reduce time, costs, and the safety risks for crew. Analog gauge reading using an autonomous mobile robot requires digitization for the robot to recognize the gauge value. In this study, image processing techniques were applied to achieve this. Analog gauge images were subjected to image preprocessing to remove noise and highlight their features. The center point, indicator point, minimum value and maximum value of the analog gauge were detected through image processing. Through the straight line connecting these points, the angle from the minimum value to the maximum value and the angle from the minimum value to indicator point were obtained. The obtained angle is digitized as the value currently indicated by the analog gauge through a formula. It was confirmed from the experiments that the digitization of the analog gauge using image processing was successful, indicating the equivalent current value shown by the gauge. When applied to surveillance robots, this algorithm can minimize safety risks and time and opportunity costs of crew members for engine room surveillance.

• Journal of the Korean Society of Laryngology, Phoniatrics and Logopedics
• /
• v.9 no.1
• /
• pp.59-65
• /
• 1998

Instead of brilliant advancement of the organ transplantation in the medical fields, laryngeal transplantation still has couple of problems to be solved before trial on human. Among them functional restoration of the implanted larynx is the most important point. Recent advancement in animal model studies showed possibility of solving the main problem. Eighteen cases of canine laryngeal transplantation in mongrel dogs were done in this department. One cranial artery and two external jugular veins were connected. External and internal branches of the superior layngeal nerve and anterior and posterior branches of the recurrent laryngeal nerve were connected individually. Only two dogs have lived longer than 4 weeks(4weeks, and 10 1/2weeks) and they died unfortunately due to asphixia caused by obstruction of the cannula. Thirteen dogs only lived five days through 15 days. The main causes of the failure were obstruction of the connecting vein, pharyngocutaneous fistula and the wound infection. Although the result was not good enough to evaluate the functional restoration of the implanted larynx, the implanted larynges from the two dogs lived longer than minimum criteria of long term survival(4 weeks) were relatively good in shape at the time of autopsy. This program will be continued after renovation of the animal lab. facilities.