• 대한교통학회지
• /
• 제22권4호
• /
• pp.85-96
• /
• 2004

합리적 통행경로는 "경로를 노드 또는 링크의 순서로 표현할 때, 경로를 구성하는 노드의 반복은 존재해도 링크의 반복은 존재하지 않는다"는 원리에 근거한다. 최적경로 탐색과정에서 합리적 통행현상을 포함하는 방법은 링크로 구성된 표지(Link-Based Label)를 적용하는 방안이 적용하기 용이하다. 링크표지를 활용하는 경우 링크의 중복 표현을 허용되지 않는 상황에서 노드의 중복표현이 가능하여 합리적인 통행을 원칙적으로 보장될 뿐만 아니라 목적지에서 출발지로 경로를 역 추적(Backward Trace)하는 과정에서 전 링크(Pvevious Link)의 단일정보만 이용하므로 Bellman의 최적원리(Optimality Condition)에 의한 최적해(Optimal Solution)가 보장된다. 본 연구는 다수의 경로를 선정함에 있어 합리적 통행행태를 고려하기 위한 링크표지고정방식(Link-Based Label Setting)을 제안한다. 기존에 표지고정(Label Setting)을 기반으로 제안되었던 노드기반 다수경로알고리즘을 기반으로 링크표지로 전환하는 방안을 개발한다. 또한 알고리즘의 대규모 교통망에 적용한 수행결과를 통해 대안경로정보제공을 위한 현실적용의 문제점을 도출하고, 도로의 연속주행을 보장하려는 운전자의 경로선택행태를 반영하는 방안에 대해 검토한다.

• 한국ITS학회 논문지
• /
• 제17권2호
• /
• pp.39-57
• /
• 2018

본 연구는 교통운영 개선에 필요한 빅데이터 및 인공지능 모델 개발의 일환으로서, 도시부의 링크통행시간 및 통과교통량 등 가용 데이터 등을 이용하여 교통변수로 활용도가 높은 차량대기길이와의 관계를 딥러닝(Deep Learning)을 통해 학습하고 추정하는 인공지능 모델을 구축하는 것을 목표로 하였다. 차량대기길이 추정모형은 데이터 분석결과를 토대로 하여 우선 차량대기길이의 링크 초과여부를 분류한 후 링크 초과 및 링크 미초과 상황에서의 차량대기길이 추정하는 3개의 모형으로 모델링하였다. 딥러닝 모형은 텐서플로우로 구현하였으며, 모든 모형은 DNN 구조로서 은닉층과 노드 개수를 다양화하여 학습 및 테스트 후 최소 오차를 나타내는 네트워크 구조를 선정하였다. 차량대기길이 링크 초과여부 분류 모형은 약 98%의 정확도를 나타냈으며, 미초과 모형은 15% 미만, 초과 모형은 5% 미만의 오차를 각각 나타내었다. 링크별 평균 오차는 12%로 도출되었다. 이를 기존 검지기 데이터 기반의 방식과 비교한 결과 오차가 약 39% 감소된 것으로 분석되었다.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2011년도 하계학술대회
• /
• pp.437-438
• /
• 2011

Spectral segmentation is a major trend in image segmentation. Specially, constrained spectral segmentation, inspired by the user-given inputs, remains its challenging task. Since it makes use of the spectrum of the affinity matrix of a given image, its overall quality depends mainly on how to design the graphical model. In this work, we propose a sparse, multi-layer graphical model, where the pixels and the over-segmented regions are the graph nodes. Here, the graph affinities are computed by using the must-link and cannot-link constraints as well as the likelihoods that each node has a specific label. They are then used to simultaneously cluster all pixels and regions into visually coherent groups across all layers in a single multi-layer framework of Normalized Cuts. Although we incorporate only the adjacent connections in the multi-layer graph, the foreground object can be efficiently extracted in the spectral framework. The experimental results demonstrate the relevance of our algorithm as compared to existing popular algorithms.

• Computers and Concrete
• /
• 제3권1호
• /
• pp.65-77
• /
• 2006

This study reports the details of the finite element analysis of eleven shear critical partially prestressed concrete T-beams having steel fibers over partial or full depth. Prestressed concrete T-beams having a shear span to depth ratio of 2.65 and 1.59 and failing in the shear have been analyzed using 'ANSYS'. The 'ANSYS' model accounts for the nonlinear phenomenon, such as, bond-slip of longitudinal reinforcements, post-cracking tensile stiffness of the concrete, stress transfer across the cracked blocks of the concrete and load sustenance through the bridging of steel fibers at crack interface. The concrete is modeled using 'SOLID65'-eight-node brick element, which is capable of simulating the cracking and crushing behavior of brittle materials. The reinforcements such as deformed bars, prestressing wires and steel fibers have been modeled discretely using 'LINK8' - 3D spar element. The slip between the reinforcement (rebar, fibers) and the concrete has been modeled using a 'COMBIN39'-non-linear spring element connecting the nodes of the 'LINK8' element representing the reinforcement and nodes of the 'SOLID65' elements representing the concrete. The 'ANSYS' model correctly predicted the diagonal tension failure and shear compression failure of prestressed concrete beams observed in the experiment. The capability of the model to capture the critical crack regions, loads and deflections for various types of shear failures in prestressed concrete beam has been illustrated.

• 대한교통학회:학술대회논문집
• /
• 대한교통학회 2003년도 제43회 학술발표회논문집
• /
• pp.127-150
• /
• 2003

This research presents a novel application of static traffic assignment methods, but with a variable time value, for estimating the market share of a high-speed rail (HSR) in the NW-SE corridor of Korea which is currently served by the airline (AR), conventional rail (CR), and highway (HWY) modes. The proposed model employs the time-space network structure to capture the interrelations among all competing transportation modes, and to reflect their supply- and demand-sides constraints as well as interactions through properly formulated link-node structures. The embedded cost function for each network link offers the flexibility for incorporating all associated factors, such as travel time and fare, in the model computation, and enables the use of a distribution rather than a constant to represent the time-value variation among all transportation mode users. To realistically capture the tripmakers' value-of-time (VOT) along the target area, a novel method for VOT calibration has been developed with aggregate demand information and key system performance data from the target area. Under the assumption that intercity tripmakers often have nearly "perfect" travel information, one can solve the market share of each mode after operations of HSR for each O-D pair under the time-dependent demand with state-of-the-art traffic assignment. Aside from estimating new market share, this paper also investigated the impacts of HSR on other existing transportation modes.

• 한국멀티미디어학회논문지
• /
• 제14권12호
• /
• pp.1559-1571
• /
• 2011

In wireless ad hoc networks, nodes communicate with each other using multihop routed transmission in which hop-by-hop cooperative diversity can be effectively employed. This paper proposes (i) two cooperation models for per-link cooperation (PLC) and per-node cooperation (PNC) for exploiting cooperative diversity in wireless ad hoc networks and (ii) a cooperative routing algorithm for the above models in which best relays are selected for cooperative transmission. First, two cooperation models for PLC and PNC are introduced and represented as an edge-weighted graph with effective link quality. Then, the proposed models are transformed into a simplified graph and a cooperative routing algorithm with O(n2) time is developed, where n is the number of nodes in the network. The effectiveness of the algorithm is confirmed for the two cooperation models using simulation.

• 대한산업공학회지
• /
• 제24권4호
• /
• pp.571-578
• /
• 1998

In this paper, we deal with a node weighted Steiner Ring Problem (SRP) arising from the deployment of Synchronous Optical Networks (SONET), a standard of transmission using optical fiber technology. The problem is to find a minimum weight cycle (ring) covering a subset of nodes in the network considering node and link weights. We have developed two mathematical models, one of which is stronger than the other in terms of LP bounds, whereas the number of constraints of the weaker one is polynomially bounded. In order to solve the problem optimally, we have developed some preprocessing rules and valid inequalities. We have also prescribed an effective heuristic procedure for providing tight upper bounds. Computational results show that the stronger model is better in terms of computation time, and valid inequalities and preprocessing rules are effective for solving the problem optimally.

• 한국통신학회논문지
• /
• 제33권2B호
• /
• pp.69-75
• /
• 2008

We propose new routing scheme, Cooperative Diversity-based Routing (CDR)which utilize the cooperative space diversity for power saving and for performance enhancement of wireless ad-hoc networks. The end-to-end performance of the proposed routing, CDR, is analyzed based on the Haenggi's link model. The improved performance is compared with Multi-hop Relay Routing (MRR) by analytical methods. When the required outage probability is $1{\times}10^{-3}$ at the destination node in ad-hoc networks with 7 nodes, we noticed that each node can save power consumption by 21.5 dB in average, by using our proposed CDR compared to MRR.

• 대한산업공학회지
• /
• 제1권2호
• /
• pp.39-49
• /
• 1975

The problem treated is that of locating distribution centers(depot) in a network, so as to minimize the total cost which is the sum of transportation cost, (from factory to centers and from centers to demand points), construction cost, inventory cost and traffic increasing cost. This problem is mathematically an integer program and a non-linear model. This study avoids various inefficient aspects, which many studies have shown, by introducing a matrix notation, node and link function. An algorithm, for determining the optimal location of distribution center which has zone in which demand points are located at some node of a network, is presented. Finally this paper describes a numerical example and discusses its results.

• Spatial Information Research
• /
• 제18권4호
• /
• pp.89-98
• /
• 2010

최근들어 대표적인 위치기반 서비스인 내비게이션은 기존 차량 중심의 서비스에서 보행자 중심의 서비스로 그 대상이 확대되고 있다. 이에 따라 최근에 보행자 내비게이션 관련하여 다양한 연구가 진행되고 있다 하지만, 내비게이션에서 가장 중요한 경로 서비스에 있어 대부분의 경우 차량 내비게이션에서 널리 활용되고 있는 노드/링크 네트워크 모델을 그대로 활용함으로써 한계점을 드러내고 있다. 그 이유로는 보행자는 차량과 달리 이동 공간이 도로로 한정되어 있지 않으며, 회전 규제, 방향 등에 제약을 받지 않고 보행이 가능한 공간에서 자유롭게 이동하는 등 보행 관련 특성들을 제대로 반영하지 못하기 때문이다. 특히, 공원, 광장 등의 오픈 페이스(open space)는 보행자기 많이 활용하는 공간임에도 불구하고 이에 대한 대안을 제공하지 못하고 있다. 따라서 본 연구에서는 게임 및 로보틱스 분야에서 객체의 이동을 계획하는 모션 플래닝(motion-planning) 기법을 응용하여 보행자 내비게이션 서비스에 적합한 경로 생성 기법을 제시하고, 그 활용 가능성을 테스트하였다.