• Spatial Information Research
• /
• v.17 no.3
• /
• pp.251-259
• /
• 2009

As a result of the current trend towards promoting conservation of the ecosystem, there have been various studies conducted to determine ways to establish an ecological network. The development of analytical methods and an environmental database of GIS has made the creation of this network more efficient. This study focuses on the development of an urban spatial decision support system based on 'Landscape Ecology Theory'. The spatial decision support system suggested in this study consists of four stages. First, landscape patch for the core areas, which are major structures of the ecological network, was determined using the GIS overlay method. Second, a forest habitat was investigated to determine connectivity assessment. Using the gravity model, connectivity assessment at the habitat forest was conducted to select the needed connecting area. Third, the most suitable corridor routes for the eco-network were presented using the least-cost path analysis. Finally, a brief investigation was conducted to determine the conflict areas between the study result and landuse. The results of this study can be applied to urban green network planning. Moreover, the method developed in this study can be utilized to control urban sprawl, promote biodiversity.

• Journal of KIISE:Information Networking
• /
• v.28 no.2
• /
• pp.183-195
• /
• 2001

무선 ad-hoc 네트워크는 중앙의 특별한 관리 체계 없이 기존의 유선 네트워크 또는 기지국을 사용하지 않는 이동 호스트들만으로 구성된 네트워크를 말한다. 이러한 무선 ad-hoc 네트워크는 잦은 망 구성의 변화 라우터의 수, 제한된 사용자원 등 기존 유선 네트워크와는 다른 특성들을 가지게 된다. 따라서 기존의 유선 네트워크에서 사용하던 라우팅 프로토콜들을 무선 ad-hoc 네트어크의 특성을 고려하여 네트워크 내의 이동 호스트를 멀티 흡을 갖는 클러스터로 묶고 클러스터 헤드로 하여금 자신의 멤버 호스트들과 이웃 클러스터들의 헤드 정보를 유지하게 하여 경로 설정에 대한 요구가 있을때에 적은 지연시간과 적은 패킷으로 목적지까지의 최단 경로를 설정할 수 있도록한다. 또한 이동 호스트로 구성된 클러스터를 무선 ad-hoc 네트워크의 변화에 따라서 적절한 크기로 변화시켜 네트워크에 발생되는 경로 검색 오버헤드를 줄일수 있게 하였고 경로 복구와 경로 유지에 드는 비용을 최소화하기 위한 알고리즘을 제시한다.

• Proceedings of the KOR-KST Conference
• /
• 1998.10b
• /
• pp.296-296
• /
• 1998

고속도로 교통축은 고속도로와 운전자가 대체도로로 이용할 수 있는 표면가로로 구성된 가로망을 말한다. 이러한 고속도로에서의 도로망의 효율을 극대화하기 위해서 시행되고 있는 제어기법으로는 고속도로 진입램프에서의 램프미터링과 표면가로에서의 신호시간조정 등을 들 수 있다. 그러나, 이를 통합한 제어전략은 아직 고려되고 있지 못하다. 고속도로에서 사고나 극심한 혼잡으로 인해 지체가 되었을 경우 단순히 진입램프에서 램프미터링만을 실행하는 것이 아니라 부체도로로의 경로전환을 통해 고속도로교통축의 효율을 극대화할 수 있다. 이는 지능형교통체계(ITS)에서 고려하고 있는 경로안내시스템과도 결부된다. 그러므로, 고속도로 교통축에서는 진입램프에서의 램프미터링전략과 진출램프에서의 경로전환전략, 표면가로에서의 신호최적화전략을 통한 제어를 실행할 수 있다. 따라서, 본 논문에서는 고속도로에서의 진입램프미터링과 진출램프를 통한 경로전환, 표면가로에서의 신호시간조정을 통합한 제어모형을 구축하고, 그에 따른 통합제어알고리즘을 개발하는 것을 본 논문의 목적으로 한다. 통합제어모형은 적정 제어변수의 값을 구하기 용이하게 하기 위해 선형계획법을 적용하였으며, 시뮬레이션을 통해 통합제어알고리즘을 우수성을 검증하였다.

• Journal of Korean Society of Transportation
• /
• v.21 no.3
• /
• pp.7-14
• /
• 2003

Statistics shows that 80% of freeway users travel less than 50km, and only 8% of them do over 100km. It means that the freeway is used for commuting. As a result, the freeway is not used efficiently and social cost is high. The current toll system aims for the efficient usage of the freeway by restraining short-distance trips and inducing long-distance ones. Thus, policies such as minimum toll system and discount for long-distance trips have been carried out. However. these two policies take no account of demand management between the freeway and alternative roads. They merely consider the compensation for charge on users, so the assessment of discount rate and distinction of distance are not reasonable. Consequently, not only the effective demand management but also the evaluation of those policies has been difficult to be achieved. The objective of this paper is to analyze those problematic policies and to establish a reasonable and improved toll system. In addition, this study presents the methodology to minimize social cost, which can be achieved by reducing short trips and encouraging long ones on the freeway. A new methodology of freeway toll system is applied and the results are presented.

• Journal of Digital Convergence
• /
• v.8 no.2
• /
• pp.131-145
• /
• 2010

The speed of change on information technology is very fast, so it demands a continuous competency development in IT human resource management. If the competency development for IT personnel can not keep up with the change of Technology, IT personnel cannot accomplish their IT job under new IT environment. For this reason, many companies have tried to manage IT organization separately and IT job system on the technology basis. Although the training of IT is different from that of other field in feature, few studies about IT human resources system have been conduced. Therefore this study focuses on the training system of IT personnel and suggests the framework for institutionalizing the operation policy and the individual process through a case study methodology. This paper chose one company as a case study which implemented the training system of IT personnel recently, and the proposed framework based on the literature review from this study applied to a company. The study shows that IT job system needs to be reasonably established, job descriptions should be appropriate to IT job, and there exist two training paths according to two career path - Specialist and Generalist. For the purpose of high performance in IT division, the training manager should understand IT job system, the people who need training, and keep an eye on the IT trends and new IT skills.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.4 no.3 s.8
• /
• pp.9-22
• /
• 2005

Route travel cost in transportation networks consists of actual route travel cost and route perception cost. Since the route perception cost is differently perceived according to each origin and each destination, route search has limitation to reflect the note perception cost due to route enumeration problem. Thus, currently employed advanced traveller information systems (ATIS) have considered only actual route travel cost for providing route information. This study proposes an optimal and a K-route searching algorithm which are able to reflect the route perception cost but encompass route enumeration problem. For this purpose, this research defines the minimum nit of route as a link by adopting the link label technique in route searching, therefore the comparison of two adjacent links which can be finally expanded the comparison of two routes. In order to reflect the characteristics of route perception in real situation, an optimal shortest cost path algorithm that both the forward search from the origin and the backward search from the destination can be simultaneously processed is proposed. The proposed algorithm is applied for finding K number of shortest routes with an entire-path-deletion-type of K shortest route algorithm.

• Journal of the Korea Society for Simulation
• /
• v.27 no.4
• /
• pp.47-60
• /
• 2018

Today's unmanned technology, which is being used in various industries, is expected to be able to make autonomous judgements as autonomous technology matures, in the long run aspects. In order to improve the usability of unmanned system in the military field, it is necessary to develop a technique for systematically and quantitatively analyzing the efficiency and effectiveness of the unmanned system by means of a substitute for the tasks performed by humans. In this paper, we propose the method of representing rule-based tactical behavior and modeling manned and unmanned reconnaissance agents that can effectively analyze the path alternatives which is required for the future armored cavalry to establish a reconnaissance mission plan. First, we model the unmanned ground vehicle, small tactical vehicle, and combatant as an agent concept. Next, we implement the proposed agent behavior rules, e.g., maneuver, detection, route determination, and combatant's dismount point selection, by NetLogo. Considering the conditions of maneuver, enemy threat elements, reconnaissance assets, appropriate routes are automatically selected on the operation area. It is expected that it will be useful in analyzing unmanned ground system effects by calculating reconnaissance conducted area, time, and combat contribution ratio on the route.

• Journal of the Korean School Mathematics Society
• /
• v.13 no.2
• /
• pp.289-301
• /
• 2010

This study discovered that instructional objectives of graphs which are dealt with in Math I of the revised curriculum are not matched with those of Discrete Mathematics in the 7th Curriculum. Based on the findings, this study analysed didactic transposition method of trail in graph and matrix of Math I and students' understanding about trail. Then this study discovered that though the concept definition of trail in Math I of the revised curriculum, some textbooks and students tend to consider it as the path. The concept definition of trail is significant in systems that deal with Euler Circuits(Euler Closed trail) and Hamilton Cycle. Then it is not easy to find the value of trail in Math I of the revised curriculum.

• Computational Structural Engineering
• /
• v.11 no.4
• /
• pp.351-360
• /
• 1998

본 논문에서는 실용적 체계신뢰성에 기초한 강사장교의 안전도평가를 위한 체계적인 모형을 제안하였다. 공용중인 강사장교의 시스템 안전도평가를 위하여 요소신뢰성해석을 위한 케이블, 주형 그리고 주탑의 한계 상태모형과 각 요소들간의 조합파괴를 포함하는 주파괴경로를 정의할 수 있는 체계신뢰성해석 모형을 제안하였다. 요소신뢰성해석을 위한 수치해석기법으로는 AFOSM(Advanced First Order Second Moment) 방법을 사용하였고, 체계신뢰성해석을 위해서는 부분 ETA(partial Event Tree Analysis) 모형을 사용하였다. 제안된 방법의 타당성을 고찰하기 위하여 진도대교의 안전도 평가에 적용하였다. 부분 ETA 모혀을 사용한 체계신뢰성 평가 방법은 기존의 요소신뢰성 방법에 비해 구조물의 여용성을 충분히 반영하는 상당히 합리적이며 실제적인 결과를 보여주는 실용적인 방법으로 판단된다.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.21 no.6
• /
• pp.1-20
• /
• 2022

The basic way to charge vehicles for using road and public transport networks is the entry-exit toll system. This system works by reading Hi-Pass and public transportation cards of the vehicles using card readers. However, the problems of navigating a route in consideration of entry-exit toll systems include the non-additive costs of enumerating routes. This problem is known as an NP-complete task that enumerates all paths and derives the optimal path. So far, the solution to the entry-exit toll system charging has been proposed in the form of transforming the road network. However, unlike in the public transport network where the cards are generalized, this solution has not been found in situations where network expansion is required with a transfer, multi-modes and multiple card readers. Hence, this study introduced the Link Label for a public transportation network composed of card readers in which network expansion is bypassed in selecting the optimal path by enumerating the paths through a one-to-one k-path search. Since the method proposed in this study constructs a relatively small set of paths, finding the optimal path is not burdensome in terms of computing power. In addition, the ease of comparison of sensitivity between paths indicates the possibility of using this method as a generalized means of deriving an optimal path.