• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.172-178
• /
• 2005

순환탐색 알고리즘 및 스택기반 알고리즘 등은 유방향그래프에서 순환과 순환경로를 발견하는 특정 정점으로부터 출발하여 연결된 그래프에서 순환을 탐색하는 것이다. 기존 연구의 단점은 모든 순환을 다 찾아내지지 못하는 경우라든지, 동일한 순환을 중복해서 찾아내는 문제가 있었다. 본 연구에서 제시하는 정점제거 순환탐색 알고리즘은 특정 정점의 순환을 발견한 뒤 그 정점을 삭제하므로 중복된 순환을 발견하지 않고 모든 순환을 찾을 수 있다. 또한 순환을 발견했을 때, 순환경로를 출력하는데 있어서 스택의 인덱스를 이용해, 저장경로를 탐색하지 않고 출력하는 방법을 제안하였다. 실험에서는 임의의 정점과 간선을 생성하여 그래프로 만들고, 각 알고리즘에 따른 모든 정점을 찾을 수 있는지, 그래프 상황에 따라 어떠한 장단점이 있는지, 간선이 많아질수록 인덱스 순환탐색 알고리즘보다 탐색시간이 얼마나 차이를 보이는지를 확인하였다. 웹 구조처럼 일정한 크기의 웹페이지와 많은 수의 링크가 존재하는 그래프에서 정점제거 순환탐색 알고리즘이 순환을 찾는데 적합하다는 것을 입증했다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1989.10a
• /
• pp.9-22
• /
• 1989

본 연구에서는 수송 네트워크에서의 최대효용경로문제를 정의하였다. 그리고 비순환적인 수송 네트워크에서의 최대효용경로를 구하는 최적해법을 제시하였다. 일반적인 수송 네트워크에서 각 경로가 가지는 효용가치는, 그 경로를 설치함으로써 연결 가능하게 되는 모든 마디의 쌍이 얻는 효용의 합이다. 즉, 일정한 출발지로 부터 도착지에 이르는 운송노선이 중도에 경유하는 모든 지점들 사이에 요구되는 운송 서어비스를 충족시켜줌으로써 얻게되는 효용의 합이 최대가 되도록 경유지를 정하는 문제를 최대효용경로 문제로 모형화하였다. 그리고 주어진 수송 네트워크가 비순환적인 경우라 하더라도 정의된 최대효용 경로 문제가 NP-hard 임을 3-Satisfiability문제를 이용하여 보였다. 또한 Shortest Path와 K-th Shortest Path를 이용하여 최적해법을 개발하였다.

• Journal of Korean Society of Transportation
• /
• v.18 no.2
• /
• pp.63-71
• /
• 2000

One Problem of the choice Property in logit model is interpreted as the Problem of common links and common nodes in choice set. Common node Problem Plays important role in deciding the efficiency of network loading and common link problem is connected with choice Problem, both of which are to be solved to improve the logit choice model. Although much need has been pointed out for research on the topic, however, no Paper as yet considers these two factors at the same time. In the Paper we develop a new logit formulation, which is able to ease the logit Problem, widely known as the Problem of IIA(Independence of Irrelevant Alternatives). An example network is used to assess the Proposed model and compare it with other conventional models. From the results, we find out that the model is superior to others.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.5
• /
• pp.89-98
• /
• 2014

This paper suggests heuristic algorithm for single-model simple assembly line balancing problem that is a kind of NP-hard problem. This problem primarily can be solved metaheuristic method. This heuristic algorithm set the main-path that has a most number of operations from start to end-product. Then the clustering algorithm can be assigns operations to each workstation within cycle time follow main-path. This algorithm decides minimum number of workstations and can be reduces the cycle time. This algorithm can be better performance then metaheuristic methods.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.5
• /
• pp.39-47
• /
• 2018

The Dial Algorithm, based on single link based calculation, is unable to reflect cyclic paths arising in actual urban transportation networks. At the same time, redefining the paths more efficiently can, by strict standards, lead to irrational results stemming from reduction in the size of the network to be analyzed. To solve these two problems of the Dial algorithm, the research herein proposes a vine network method applied to a link based Dial Algorithm, in which the original three step alogrithm is modified into a vine network-based three step process. Also, an analysis of two case study networks show feasible replication of the predicted cyclic path, unrealistic flow, and unsteady transit, as well as alleviation of the problem of irrational path allocation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.9_10
• /
• pp.421-428
• /
• 2008

A. Ghafoor proposed Even networks as a class of fault-tolerant multiprocessor networks in [1] and analyzed so many useful properties include node disjoint paths. By introducing node disjoint paths in [1], fault diameter of Even networks is d+2(d=odd) and d+3(d=even). But the lengths of node disjoint paths proved in [1] are not the shortest. In this paper, we show that Even network Ed is node symmetric. We also propose the shortest lengths of node disjoint paths using cyclic permutation, and fault diameter of Even networks is d+1.

• Proceedings of the CALSEC Conference
• /
• 2001.08a
• /
• pp.457-465
• /
• 2001

■ 필요성 1. 교통 혼잡으로 인한 물류비 상승으로 국가 경쟁력 약화 2. 기존 최단경로 알고리즘(Dijkstra, Floyd-Warshall 등)의 한계 3. 대규모 네트워크(NP-hard문제)→정보 사용자가 제시하는 시간 내에 정보를 제공 필요 4. 교통 제약(회전금지, U턴, U턴 금지, P-턴) → 실제 교통 상황과 순환 노드 고려가 필요 ■목적 1. 교통제약을 포함한 대규모 교통네트워크에서 실시간 교통정보를 바탕으로 제한된 시간 내에 차별화 된 다수 최적경로 산출 함 2. 유전자알고리즘(GA)을 적용한 동적경로안내시스템 개발(중략)

• Journal of The Korean Association For Science Education
• /
• v.27 no.5
• /
• pp.379-393
• /
• 2007

The purpose of this article is to analyze the conceptual change of nine 11th graders after implementing the model-based instruction of blood circulation by multidimensional framework, and to find some implications about teaching strategies for improving conceptual understanding. The model-based instruction consisted of 4 periods: (1) introduction for inducing students' interests using an episode in the science history of blood circulation, (2) vivisectional experiment on rats, (3) visual-linguistic model instruction using the videotape of heartbeat, and (4) modeling activity on the path of blood flow. Based on the data from pre-test, post-test and interviews, we classified students' models on the path of blood flow, and investigated their ontological features and the conceptual status of blood circulation. Most students could describe the path of blood flow and the changes of substances in blood precisely after the instructions. However, the modeling activity were not sufficient to improve students' understanding of the mechanisms of the blood distribution throughout various organs and the material exchanges between blood and tissues. From the interview of 9 students, we acquired informative results about conceptual status elements that were helpful to, preventing from, or not used for students' understanding. It was also found that conceptual status of students depended on the ontological categories into which students' conceptions of blood circulation fell. The results of this study can help design the effective teaching strategy for the understanding of concept of the equilibrium category.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.8
• /
• pp.1759-1766
• /
• 2010

The performance of noise attenuation of the adaptive active noise control algorithm is improved using the recurrent neural network. The FXLMS that has been frequently used in the active noise control is simple and has low computational load, but this method is weak to nonlinearity of the main or secondary path since it is based on the FIR linear filter method. In this paper, the recurrent neural network filter has been developed and applied to improvement of the active noise attenuation by simulation.

• 대한공업교육학회지
• /
• v.34 no.1
• /
• pp.19-43
• /
• 2009

An ideology what a modern society seeks is lifelong employment through lifelong learning. The single word which draws the attainment is lifelong vocational competency development. This study is designed for exploring its possibility and limit of a redesign of it, and tries to propose efficiently a redesign idea of a vocational educational path. To this end, it was analyzed by a subject for a national human resource foundation plan and a lifelong bocational competency development foundation plan. In addition to that, it was covered a structure and content analysis of main laws and regulations which are a base of policy making. An educational path could be divided into an area of formal education system, an area of workplace for labors, and an area of lifelong vocational competency development. And the insights were drawn by pulling apart an operational situation of main organizations and a recurrent process of the educational path. The redesign plan of a vocational education path we did analyze to activate lifelong vocational competency development system is deduced as following. Firstly, it should be re-organized with a direction towards an effective manpower training to be linked with skills and demands required by an industry. Secondly, it should be generalized for a model of recurrence between work and learning and its alternation for lifelong vocational competency development. Thirdly, it should create a cluster in the region for lifelong vocational competency development so that it is to form an efficient network to have a division of labor and its liaison with cooperative relationship.