• 대한교통학회지
• /
• 제22권2호
• /
• pp.19-26
• /
• 2004

사통팔달(AWS:AllWayS)은 교통계획의 중요성이 날로 부각되는 추세에서 네트워크 편집 및 데이터베이스 분석 기능을 갖춘 국내에서 최초로 개발된 종합적인 교통수요 예측모형이다. 과거에 일부 개별적인 모형의 수행을 위해 개별 기능의 수행을 위한 수요예측모형들이 국내에서 개발되어 사용되어온 바 있으나, 사통팔달 모형은 과거동안 축적된 교통계획 및 전산기술에 대한 이론적, 경험적 성과들을 바탕으로 국내 실정에 적합한 전통적인 4단계 수요예측과정에 대해 전체적으로 수행이 가능하도록 체계화함으로써 기존 외국의 교통계획모형들이 비판없이 사용되고 있는 국내 현실에서 본 모형의 유용성이 있다고 사료된다. 아울러 교통수요 예측을 위해 필요한 가로, 대중교통 등의 교통 네트워크 자료의 작성 기능을 모형의 내에서 갖추고 있으며 모형의 수행에 필요한 모든 자료들을 데이터베이스화함으로 대상 분석 시나리오에 대해 종합적이고 일관적인 수요예측 과정을 수행할 수 있도록 모형을 개발하였다.

• 대한교통학회지
• /
• 제12권3호
• /
• pp.49-64
• /
• 1994

The development of a mathematical modular framework based on Petri Network theory to model a traffic network is the subject of this paper. Traffic intersections are the primitive elements of a transportation network and are characterized as event driven and asynchronous systems. Petri network have been utilized to model these discrete event systems; further analysis of their structure can reveal information relevant to the concurrency, parallelism, synchronization, and deadlock avoidance issuse. The Petri-net based model of a generic traffic junction is presented. These modular networks are effective in synchronizing their components and can be used for modeling purposes of an asynchronous large scale transportation system. The derived model is suitable for simulations on a multiprocessor computer since its program execution safety is secured. The software pseudocode for simulating a transportation network model on a multiprocessor system is presented.

• 대한교통학회지
• /
• 제28권3호
• /
• pp.85-98
• /
• 2010

대중교통 네트워크가 점점 더 복합수단화됨에 따라 네트워크의 연계성이 중요한 개념으로 대두되고 있다. 본 연구에서는 복합수단 대중교통 네트워크의 연계성을 평가하는 계량모형을 제시하였다. 이를 위하여 우선 대중교통 노선의 평가지표로 노선연장, 수송용량, 통행속도를 선정하고 이들의 곱을 노선의 연계강도로 정의하였다. 또한 사회 네트워크 분석에서 사용되는 노드의 중심성 지표 중 하나인 degree centrality 개념을 대중교통 네트워크에 적합하게 수정하였다. 노선의 연계강도와 그 노선이 서비스하는 정류장의 degree centrality를 접목하여 정류장의 연계정도를 나타내는 지수를 개발하였다. 이를 토대로 복합수단 대중교통 네트워크 내의 노선 및 지역의 연계성 지수도 도출하였다. 또한 정류장의 연계성 지수와 이용자수용비율 함수를 이용하여 환승센터의 연계성을 평가하는 방법도 제시하였다. 사례연구 결과 본 연구에서 개발된 연계성 평가 모형은 복합수단 대중교통 네트워크의 특성을 제대로 반영하고 있으며, 대중교통 네트워크 내의 정류장, 노선, 지역의 연계성을 적절하게 평가할 수 있고, 또한 환승센터의 서비스수준 산정에 활용될 수 있음을 확인하였다.

• 대한교통학회지
• /
• 제24권3호
• /
• pp.167-176
• /
• 2006

출발시간제약이 존재하는 통합교통망의 최소시간경로탐색은 도착수단의 도착시간 수단간 환승시간, 대기시간 뿐만 아니라. 다음수단의 출발시간을 고려하는 것이 필요하다. 다수의 교통수단이 존재하는 통합교통망에서는 출발시간제약이 포함되는 경우가 매우 일반적인 현상이다. 이는 철도나 항공 등과 같은 대중교통노선들은 일정한 시간에 서비스를 제공하는 노선별 스케줄을 가지고 있기 때문이다. 본 연구에서는 이러한 출발시간제약조건이 존재하는 통합교통망을 통행시간이 시간대에 따라 동적으로 변화하는 상황에서 K개의 경로를 탐색하는 알고리즘을 개발하고자 한다. 그리고, 이러한 알고리즘개발을 위하여 유입링크기반의 전체경로삭제방식을 확대 적용하는 방안을 제안하며, 사례연구를 통하여 알고리즘의 활용성을 검토한다.

• 한국경영과학회지
• /
• 제34권4호
• /
• pp.123-138
• /
• 2009

This study examined the first- and second-best pricing by stable dynamics in congested transportation networks. Stable dynamics, suggested by Nesterov and de Palma (2003), is a new model which describes and provides a stable state of congestion in urban transportation networks. The first-best pricing in user equilibrium models introduces user-equilibrium in the system-equilibrium by tolling the difference between the marginal social cost and the marginal private cost on each link. Nevertheless, the second-best pricing, which levies the toll on some, but not all, links, is relevant from the practical point of view. In comparison with the user equilibrium model, the stable dynamic model provides a solution equivalent to system-equilibrium if it is focused on link flows. Therefore the toll interval on each link, which keeps up the system-equilibrium, is more meaningful than the first-best pricing. In addition, the second-best pricing in stable dynamic models is the same as the first-best pricing since the toll interval is separately given by each link. As an effect of congestion pricing in stable dynamic models, we can remove the inefficiency of the network with inefficient Braess links by levying a toll on the Braess link. We present a numerical example applied to the network with 6 nodes and 9 links, including 2 Braess links.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권4호
• /
• pp.1931-1953
• /
• 2017

The reverse skyline query plays an important role in information searching applications. This paper deals with continuous reverse skyline queries in sensor networks, which retrieves reverse skylines as well as the set of nodes that reported them for continuous sampling epochs. Designing an energy-efficient approach to answer continuous reverse skyline queries is non-trivial because the reverse skyline query is not decomposable and a huge number of unqualified nodes need to report their sensor readings. In this paper, we develop a new algorithm that avoids transmission of updates from nodes that cannot influence the reverse skyline. We propose a data mapping scheme to estimate sensor readings and determine their dominance relationships without having to know the true values. We also theoretically analyze the properties for reverse skyline computation, and propose efficient pruning techniques while guaranteeing the correctness of the answer. An extensive experimental evaluation demonstrates the efficiency of our approach.

• 품질경영학회지
• /
• 제47권2호
• /
• pp.315-325
• /
• 2019

Purpose: The purpose of this study was to propose useful standards evaluation method using standards networks by analyzing the relationship between normative references citation information list. Methods: The collected data through the survey were analyzed using social network analysis. The measurement tools used for this study were divided into three dimensions such as certificate standard, normative reference and degree centrality. Results: The results of this study are as follows; regarding the influence of standard information, It is meaningful that the research using normative reference item among the bibliography information that the standard itself possesses. The analysis of social network analysis data of population standard, normative reference and the correlation analysis with sales, a variable representing actual utilization performance, suggested the importance of the standard and how to evaluate it. Conclusion: In prioritizing standard maintenance, more efficient management will be possible if centrality figures of standard network information are analyzed and used for standard maintenance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권11호
• /
• pp.4105-4121
• /
• 2021

Recently, malware classification based on Deep Neural Networks (DNN) has gained significant attention due to the rise in popularity of artificial intelligence (AI). DNN-based malware classifiers are a novel solution to combat never-before-seen malware families because this approach is able to classify malwares based on structural characteristics rather than requiring particular signatures like traditional malware classifiers. However, these DNN-based classifiers have been found to lack robustness against malwares that are carefully crafted to evade detection. These specially crafted pieces of malware are referred to as adversarial examples. We consider a clever adversary who has a thorough knowledge of DNN-based malware classifiers and will exploit it to generate a crafty malware to fool DNN-based classifiers. In this paper, we propose a DNN-based malware classifier that becomes resilient to these kinds of attacks by exploiting Generative Adversarial Network (GAN) based data augmentation. The experimental results show that the proposed scheme classifies malware, including AEs, with a false positive rate (FPR) of 3.0% and a balanced accuracy of 70.16%. These are respective 26.1% and 18.5% enhancements when compared to a traditional DNN-based classifier that does not exploit GAN.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.59-71
• /
• 2005

In this paper we address a design problem for hub and spoke transportation networks and then consider a capacitated hub locations problem with direct shipment (CHLPwD). We determine the location of hubs, the allocation of nodes to hubs, and direct shipment paths in the network, with the objective of minimizing the total cost in the network. An evolutionary algorithm is developed here to solve the CHLPwD. To do this, we propose the representation and the genetic operators suitable for the problem and adopt a heuristic method for the allocation of nodes to hubs. To enhance the search capability, problem-specific information is used in our evolutionary algorithm. The proposed algorithm is compared with the heuristic method in terms of solution quality and computation time. The experimental results show that our algorithm can provide better solutions than the heuristic.

• 대한교통학회지
• /
• 제5권1호
• /
• pp.3-23
• /
• 1987

Traffic signal control problems in urban street networks are formulated in two ways. In the formulations network flows are assumed to satisfy the user route choice criterion. the first formulation which is called implicit substiuation incorporates user route behavior implicitly in the objective function by recognizing the dependence of the link flows on the signal variables. On the other hands, the second one which is called 'penalty formulation' consists in expressing the route choice conditions in the form of a single nonlinear constraint. Approximate solution algorithm for each of the formulations was investigated in detail and computer codes were written to examine key aspects of each algorithm. A test was done on a network which is small in size but sufficiently complex in representing real-world traffic conditions and the test result shows that both algorithms produce converged solutions. It is recommended, however, that further studies should be done in order to compare the performance of each algorithm more in depth.