• Journal of Korean Society for Geospatial Information Science
• /
• v.18 no.3
• /
• pp.67-74
• /
• 2010

The aim of this paper is to come up with a methodology of migration for current transportation digital map in order to construct NDRM, which is the most essential map data for car navigation system. The model suggested through our study is able to efficiently produce navigable service map for route finding and guidance as well as to make the best of general road network developed by KOTI.

• Journal of Korean Society of Transportation
• /
• v.13 no.3
• /
• pp.35-52
• /
• 1995

This paper reviews both network representation schemes of transportation network and algorithms for findings the shortest path between two points in the network. Two types of network representation schmes for considering U-Turn have been proposed along with some modifications of the vine-based Dijkstra shoretest path algorithm. The traditional Sioux-Fall network has been chosen and modified with the introduction of left-turn prohibitions and U-Turns for the purpose of evaluating the peroformance of two modified algorithms and network representation schemes(NA1 an d NA2 ). This type of modification in both network representation scheme (including network data) and algorithms is not only supposed to be needed for route guidance but supposed to contribute to finding more realistic path and estimating more accurate traffic voulume thorughout the entire network.

• Archives of design research
• /
• v.6 no.1
• /
• pp.1-10
• /
• 1993

This paper described design as a purposeful human activity for solving its problems. This means, problem solving is finding a way to get from some initial situation to a desired goal.In order to do this, like a voyage, there should be a compass, and a route map to guide the designer through the design process. Evaluation gives information about the way a design is proceeding and suggests the direction in which change should be made in order that the complex of design concepts should be fulfilled in a satisfactory manner.I think Pugh's total design model discussing in this paper takes a layered approach through a series of sequential actions, part of which is to find the product status. Each layer has the $$\mu$ti-dimensional elements, Product Design Specification (PDS) around the design core. I made a comparative study of several evaluation tools wi th Pugh's model and examined the criteria for evaluation and the rating / weighing methods.It needs, however, more study in order that PDSs may have its values and be fixed from the dynamic design concepts.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2008.11a
• /
• pp.19-19
• /
• 2008

We investigated the programmable memory characteristics of nanoparticle-based memory devices based on the elementary metal nanoparticles (Co and Au) and their binary mixture synthesized by a micellar route to ordered arrays of metal nanoparticles as charge trapping layers. According to the metal nanoparticle species quite different programming/erasing efficiencies were observed, resulting in the tunable memory characteristics at the same programming/erasing bias conditions. This finding will be a good implication for further device scaling and novel device applications since most processes are based on the conventional semiconductor processes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3100-3116
• /
• 2016

With the rapid development of urban traffic system and fast increasing of vehicle numbers, the traditional centralized ways to generate the source-destination shortest path in terms of travel time(the optimal path) encounter several problems, such as high server pressure, low query efficiency, roads state without in-time updating. With the widespread use of smart cameras in the urban traffic and surveillance system, this paper maps the optimal path finding problem in the dynamic road network to the shortest routing problem in the smart camera networks. The proposed distributed optimal path generation algorithm employs the delay routing and caching mechanism. Real-time route update is also presented to adapt to the dynamic road network. The test result shows that this algorithm has advantages in both query time and query packet numbers.

• Journal of the military operations research society of Korea
• /
• v.23 no.1
• /
• pp.100-114
• /
• 1997

The network for proving information exchange function in distributed system is interconnected among other networks which are in the state of independent construction and operation. However, due to various network protocols and distributed applications, Problems occurred in the area of network interconnectivity and interoperability of distributed applications in internetworking which should provide a good interoperability. This paper proposed an improved method for finding route which has the highest interworkability between end-systems using the interrelationship of network protocol. An algorithm and method of constructing a virtual network which is suitable for required distributed application are also proposed in this research.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.1389-1391
• /
• 1996

In this paper, we applies two methods - Genetic Algorithm(GA) and $A^*$ Algorithm - to find the optimal path in route guidance system. Under the assumption that the traveling costs of each link are given, the task to find the optimal path becomes very complicated problem if the number of nodes or links increase. Two well-known algorithms are modified to resolve the problem and the preliminary demonstration show both optimistic result and needs to improvement.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.28 no.3D
• /
• pp.317-323
• /
• 2008

Mass transit information can contribute many benefits to users. Especially, transportation information technology is developing highly with information technology in Korea recently. Hereafter, it is expected to give customized transportation information to users individually with the advent of ubiquitous age in earnest. This public transportation information service can be realized by path finding algorithm in public transportation networks including travel and transfer attributes. In this research, constraints are constructed with the primary facts influencing users. Moreover, the method reducing user's path finding condition arbitrarily is proposed by making the maximum value as variables. In this study, transfer frequency, total travel time, seat confirmation, transfer time and travel time become constraint condition based on k path finding algorithm considering service time constraint condition. Moreover, case study about user customized transfer information is performed in Seoul and metropolitan subway networks.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.24 no.7
• /
• pp.26-40
• /
• 2010

We propose a new routing protocol, MCQosR, that is based on bandwidth estimation, admission control, and a routing metric, MCCR - suitable for wireless ad-hoc networks with multiple radios and channels. To use the full capacity of a wireless link, we assume a node with multiple radios for full duplex operation, and a radio using multiple channels to exclude route-intra interference. This makes it possible to use the capacity of a wireless link. Then, to provide bandwidth and delay guarantee, we have a radio with a fixed channel for layer-3 data reception at each node, used to estimate the available bandwidth and expected delay of a wireless link. Based on the estimate of available bandwidth and delay, we apply the call admission control to a new call requiring bandwidth and delay guarantee. New calls with traffic that will overflow link or network capacity are rejected so the accepted calls can use the required bandwidth and delay. Finally, we propose a routing metric, MCCR, which considers the channel contentions and collisions of a wireless link operating in CSMA/CA. MCCR is useful for finding a route with less traffic and distributing traffic over the network to prevent network congestion as much as possible. The simulation of the MCQosR protocol and the MCCR metric shows traffic is distributed and guaranteed service is provided for accepted calls.

• Spatial Information Research
• /
• v.11 no.3
• /
• pp.275-289
• /
• 2003

This study focused on offering a helpful information for the touring. To develop a tour route guidance tool, it is needed to use a GIS function, which can suggest a possible shortest path based on time and distance. A Traveling salesman problem algorithm, which was developed to solve multi destination problem in network analysis, was used to implement a tour guidance system. This system was developed using ArcObjects programming components within ArcGIS 8.3. Jeju city was selected for the case study to apply the tool and to test the effectiveness of it. This study demonstrated that this tool was considerably effective for finding a probable optimum tour path in the following aspects. First, it can help tourists to select several attractions from numerous tour sites in an area given limited time. Second, tourist can manage time efficiently by organizing their tour courses on the basis of the tool. Third, tourists can reduce the uncertainties that may happen under unexpected situations in unfamiliar places by obtaining specific spatial information using the tool. Fourth, the Graphic User Interface of the tool can be easily used to obtain visual information of spatial data.