• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.29 no.2
• /
• pp.35-56
• /
• 2018

This study examines the current state of library related data opened through public data portals, and analyzes how much data is being utilized according to the type of releasing organization, and open level. In addition, we analyzed the subject cluster of data and the centrality of data by performing PathFinder Network analysis using keywords assigned to data by dividing the releasing subject into local government and national/public institutions. Based on this, the subject area of library - related data disclosed by local governments and national/public organizations is understood. And identify the main open body that should be opened first by linking with data utilization analysis result and then suggest implications for future improvement in connection with library big data business.

• Journal of Korean Society of Transportation
• /
• v.27 no.5
• /
• pp.209-221
• /
• 2009

Travel time estimation under given traffic conditions is important for providing drivers with travel time prediction information. But the present expressway travel time estimation process cannot calculate a reliable travel time. The objective of this study is to estimate the path travel time spent in a through lane between origin tollgates and destination tollgates on an expressway as a prerequisite result to offer reliable prediction information. Useful and abundant toll collection system (TCS) data were used. When estimating the path travel time, the path travel time is estimated combining the link travel time obtained through a preprocessing process. In the case of a lack of TCS data, the TCS travel time for previous intervals is referenced using the linear interpolation method after analyzing the increase pattern for the travel time. When the TCS data are absent over a long-term period, the dynamic travel time using the VDS time space diagram is estimated. The travel time estimated by the model proposed can be validated statistically when compared to the travel time obtained from vehicles traveling the path directly. The results show that the proposed model can be utilized for estimating a reliable travel time for a long-distance path in which there are a variaty of travel times from the same departure time, the intervals are large and the change in the representative travel time is irregular for a short period.

• The KIPS Transactions:PartD
• /
• v.16D no.1
• /
• pp.113-122
• /
• 2009

Since the traditional pattern mining methods only probe unspecified moving patterns that seem to satisfy users' requests among diverse patterns within the limited scopes of time and space, they are not applicable to problems involving the mining of optimal moving patterns, which contain complex time and space constraints, such as 1) searching the optimal path between two specific points, and 2) scheduling a path within the specified time. Therefore, in this paper, we illustrate some problems on mining the optimal moving patterns with complex time and space constraints from a vast set of historical data of numerous moving objects, and suggest a new moving pattern mining method that can be used to search patterns of an optimal moving path as a location-based service. The proposed method, which determines the optimal path(most frequently used path) using pattern frequency retrieved from historical data of moving objects between two specific points, can efficiently carry out pattern mining tasks using by space generalization at the minimum level on the moving object's location attribute in consideration of topological relationship between the object's location and spatial scope. Testing the efficiency of this algorithm was done by comparing the operation processing time with Dijkstra algorithm and $A^*$ algorithm which are generally used for searching the optimal path. As a result, although there were some differences according to heuristic weight on $A^*$ algorithm, it showed that the proposed method is more efficient than the other methods mentioned.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5B
• /
• pp.260-267
• /
• 2008

As pervious the SAR(Security Aware Routing)[10] protocol is an secure Ad Hoc network protocol that finds a secure path, it is the security routing protocol that uses the security level of nodes as the routing information. However, the SAR protocol sometimes transfers data through inefficient transmission paths because it always tries to find secure nodes for a safe transmission. Since it is a protocol based on AODV[6], it will cause transmission delay as researching of security routing path. when a node is out of the data transmission range as its battery dying or movement. Although it is possible to connection of nodes because a characteristic of the SAR protocol, the connection is not easy to reconnect when the security level of intermediate node is lower than the level requested by a source node. In this paper, we suggest the MP-SAR based on the SAR to solve the SAR protocol's problem. The MP-SAR seeks multiple secure path for maintenance of data confidentiality using the expanded secure path detection techniques based on the SAR. It can transfer data quickly and reliably by using the shortest efficient path among multiple paths. In the research result, we proved a outstanding performance of MP-SAR than the previous SAR through comparison and analysis.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.25 no.3
• /
• pp.348-356
• /
• 2014

The existing effective path-length model of ITU-R has some drawbacks: The prediction error is quite large compared to domestic measurement data and it is an empirical model in which the physical characteristics of rain cells are not considered. In this paper, a theoretical model for effective path-length using the rain-cell concept was proposed and its validity was verified using the measurement data. To analyze the statistical characteristics of rain cell parameters, the weather-radar data(CAPPI) measured by Korea Meterological Administration were analyzed and the correction factor was properly introduced to fit the Chollian beacon measurement data of ETRI(Electronics and Telecommunications Research Institute). To verify the proposed effective path-length model, it was compared with the Mugunghwa No. 5 beacon data measured in Chungnam National University with the support of ADD(Agency for Defense Development). It was confirmed that the prediction results of the proposed model are in good agreement with the measurement data.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.261-277
• /
• 2005

We propose the PAD (Power Aware Data-centric Routing Protocol), which finds minimum energy routes and prolongs network life-time, for the data-centric sensor networks. Firstly, the PAD discovers the minimum energy Property graph by removing redundant communication links. The proposed a1gorithm to find the minimum energy property graph is faster, simpler and easier to implement than existing aIgorithms. Secondly, the PAD runs the DDBF (Distributed Data-centric Bellman-Ford Algorithm) to determine routing paths between a base node and all sensor nodes. The DDBF selves the drawbacks of the distributed bellman-ford algorithm, i.e. slow convergence and a possible cyclic routing path. Since the PAD is a fully distributed algorithm with low overhead, it can be used in various kinds of resource limited sensor network applications.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.7
• /
• pp.4482-4488
• /
• 2014

This paper proposes the creation scheme of a threat map for robot global path planning. The threat map was generated using neural network theory by analyzing the robot's armament state and the menace information of an enemy or obstacle. In addition, the performance of the suggested method was verified using the compared result of the damage amount and existing robot path data.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1601-1604
• /
• 1997

The most important topic in research of mobile robot is path planning in order to avoid with obstacle. In this study the path planning algorithm using a neural network model is proposed. The inputs of neural network are range data which are acquired form laser range finderm and weights are based on difference with goal direction. The thresholds are made by consdiering the marginal distance between mobile robot and obstacle. Consequently the outputs are obtained by multiplying input and weight. The obtained heading directiion enables the mobile robot to approach the goal, without any collision with obstacles around. The effectiveness of the this method of real-time navigation of a mobile robot is estimated by computer simulation in complex environment.

• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.2
• /
• pp.115-120
• /
• 2015

Recently, in automotive technology area, intelligent safety systems have been actively accomplished for drivers, passengers, and pedestrians. Also, many researches are focused on development of autonomous vehicles. This paper propose the application of LiDAR sensors, which takes major role in perceiving environment, terrain classification, obstacle data clustering method, and local map building for autonomous driving. Finally, based on these results, planning for lane change path that vehicle tracking possible were created and the reliability of path generation were experimented.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.1
• /
• pp.133-139
• /
• 2004

High speed machining (HSM) can reduce machining time with the high metal removal rate by high speed spindle and feedrate. This paper supports HSM technology using the small size tool with the optimal tool path generation and modification of tool change. The optimum tool path is generated to reduce cutting length of cavity pattern and change the cutting tool for preventing the tool breakage by wear. The tool path is modified with the experiment data of tool wear and breakage to support tool change on reasonable time. The result can contribute to HSM technology of high hardness materials using the small size end-mill.