• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2019.11a
• /
• pp.39-40
• /
• 2019

우리나라는 국제해사기구(IMO)에 "여객선 탈출지도체계의 기술개발에 관한 정보"라는 안건(IMO SSE4/INF2)을 2017년에 제출한 바 있다. 이 의제에 소개된 지능형 선박 및 인명대피 안내시스템(SEGA)은 한국해양과학기술원의 주관으로 한국해양수산부의 지원을 받아 2016년부터 2020년 3월까지 약 4년간의 프로젝트로 개발 중에 있다. SEGA는 데이터 수집과 분석, 정보 표시의 프로세스를 자동화하여 우리나라 연안에서 항해 중인 선박에 비상상황이 발생할 경우 항해자의 의사결정을 지원하는 시스템이다. SEGA 시스템을 지원하기 위해 구축된 SEGA 서버와 데이터베이스는 해양기상정보, 수심정보, 해상교통정보를 처리 한다. 또한 비상상황 시 2차 사고를 방지하기 위해 선박이 대피 할 수 있는 장소에 대한 정보를 사용자가 확인할 수 있도록 알고리즘이 설계되어 있다. 인명안전을 위해 SEGA는 비상상황 시 선박내부 구조정보와 화재 등 변수사항들을 고려하여 승객들에게 빠른 탈출을 위한 최적대피경로를 제공하며, 원격탐사기술을 이용하여 선박주변의 익수자를 탐지하도록 개발 중에 있다. 보다 상세한 내용은 항해항만학회 VTS 특별세션에서 발표할 예정이다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.9
• /
• pp.1145-1157
• /
• 1999

본 논문에서는 RFC 2022에서 제안한 MARS 모델을 기반으로 하여 단일 대규모 클러스터를 가지는 ATM 망에서 다중의 멀티캐스팅 서버(MCS)를 이용한 멀티캐스팅 방안을 제안하고 그 성능을 평가하였다. 클러스터 내의 한 ATM 호스트가 특정 IP 멀티캐스트 그룹에 가입할 경우 ATM 호스트의 위치와 이미 존재하는 멀티캐스팅 서버들 사이의 전송 지연을 고려하여 가능한 한 종단간 전송 지연을 최소화하는 멀티캐스팅 서버를 선택하는 방안을 기술하였다. 이 방안은 최단거리 경로 알고리즘(shortest path algorithm)에 기반하여 최적의 MCS를 선정하고 송수신자 사이의 최소 지연을 가지는 멀티캐스트 트리를 구성한다. 다양한 망 위상에서 MCS의 분포 패턴을 다르게 할 경우에도 이 방안은 멀티캐스트 트리의 평균 전달 지연을 줄이는 것을 시뮬레이션을 통하여 확인하였다.Abstract In this paper, we proposed a scheme to support multiple MCSs over a single and large cluster in ATM networks, evaluated its performance by simulation. When an ATM host requests joining into a specific multicast group, the MARS designate a proper MCS among the multiple MCSs for the group member to minimize the average path delay between the sender and the group members. This scheme constructs a multicast tree through 2-phase partial multicast tree construction based upon the shortest path algorithm.We reduced the average path delay in multicast tree using our scheme under various cluster topologies and MCS distribution scenarios.

• Proceeding of EDISON Challenge
• /
• 2015.03a
• /
• pp.543-546
• /
• 2015

There have been subway conflagrations such as Daegu subway conflagration at 2003, Washington D.C conflagration last month and so on. Compared to that, proper evacuation route is far from satisfactory. So this paper suggests optimized route when subway's passengers evacuate from passenger cars. For conducting our experiment, We made temporarily a model of subway station which is made up with 8 passengers cars and 3 exits. Using genetic algorithm, we found the optimized route that first and second passenger cars are optimized to first exit and third, fourth, fifth and sixth passengers cars are optimized to second exit and finally seventh, eighth passengers cars are optimized to third exit. It is expected that real subway station is applied to our experiment by developing passenger distribution algorithm.

• Journal of The Korean Association of Information Education
• /
• v.8 no.3
• /
• pp.307-317
• /
• 2004

In web-based education environment, it is necessary to provide individually adjusting feedback according to learner's characteristic. Despite this necessity, it is a current state that there are difficulties in deriving the variables of learners' characteristics and lack in developing the systematic strategies and practical tools for providing individually adjusting feedback. This study analyzed the learners' learning patterns, one of learner's characteristic variables regarded as important in web-based teaching and learning environment by employing Apriori algorithm, and also grouped the learners by learning pattern. Under this framework, the e-SRM feedback system was designed and developed to provide learning content, learning channel, and learning situation, etc. for individual learners. The proposed system in this study is expected to provide an optimal learning environment complying with learner's characteristic.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.4
• /
• pp.506-511
• /
• 2008

Recently, it is widely progressed that the research of the performance improvement of an intelligent vehicle. Among them, its parking problem has attracted a great deal of attention and have been examined in many papers in the literature. In this paper we design a fuzzy logic based parking system at the slant parking space which is a important part for designing an autonomous parking system. We first design a parking path for the slant space and propose a fuzzy logic based parking algorithm. We present its simulation results and show the effectiveness of the proposed method.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.237-242
• /
• 2003

Ant Colony System (ACS) Algorithm is new meta heuristic for hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem (TSP). In this paper, we introduce ACS of new method that adds reinforcement value for each edge that visit to Local/Global updating rule. and the performance results under various conditions are conducted, and the comparision between the original ACS and the proposed method is shown. It turns out that our proposed method can compete with tile original ACS in terms of solution quality and computation speed to these problem.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.784-787
• /
• 2006

In this paper, we propose a method for nonlinear grapheme segmentation in Korean printed character type classification. The characters are subdivided into six types based on character type information. The feature vector is consist of mesh features, vertical projection features and horizontal projection features which are extracted from gray-level images. We classify characters into 6 types using Back propagation. Character segmentation regions are determined based on character type information. Then, an optimal nonlinear grapheme segmentation path is found using multi-stage graph search algorithm. As the result, a proposed methodology is proper to classify character type and to find nonlinear char segmentation paths.

• Journal of the Korean Society for information Management
• /
• v.39 no.2
• /
• pp.233-254
• /
• 2022

Link reduction algorithms such as pathfinder network are the widely used methods to overcome problems with the visualization of weighted networks for knowledge domain analysis. This study proposed NetRSQ, an indicator to measure the goodness of fit of a link reduction algorithm for the network visualization. NetRSQ is developed to calculate the fitness of a network based on the rank correlation between the path length and the degree of association between entities. The validity of NetRSQ was investigated with data from previous research which qualitatively evaluated several network generation algorithms. As the primary test result, the higher degree of NetRSQ appeared in the network with better intellectual structures in the quality evaluation of networks built by various methods. The performance of 4 link reduction algorithms was tested in 40 datasets from various domains and compared with NetRSQ. The test shows that there is no specific link reduction algorithm that performs better over others in all cases. Therefore, the NetRSQ can be a useful tool as a basis of reliability to select the most fitting algorithm for the network visualization of intellectual structures.

• Journal of Intelligence and Information Systems
• /
• v.14 no.4
• /
• pp.147-160
• /
• 2008

BPMS(business process management system) facilitates defining new processes or updating existing processes. However, processing of exceptional or nonroutine task requires the intervention of domain experts or introduction of the situation specific resolution process. This paper assumes sufficient amount of business process exception handling cases are stored in the process repository. Since the retrieval of the best exception handling process requires a good understanding about the exceptional situation, context awareness is an important issue. To facilitate the understanding of exceptional situation and to enable the efficient selection of the best exception handling process, we adopted the 'situation variable' and 'decision variable' construct. A case example for exception handling in the e-commerce delivery process is provided to illustrate how the proposed construct works. Application of the C5.0 algorithm guarantees the construction of an optimum search tree. It also implies that an efficient search path has been identified for the context aware selection of the best exception handling process.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9A
• /
• pp.758-766
• /
• 2011

Cooperative communications are adopted as a promising solution to achieve high data rate over large areas in the future 40 wireless system and the relay station (RS) is the key concept in cooperative communications. However, most existing works in this area focus only on optimal RS selections. In addition, there are only few works consider another crucial issue: how many relay stations we need to place. Only when the number of relay stations is defined, the relay station selection can be performed well. In this paper we derive a formula which describes the impact of varying number of RS on end-to-end link throughput assuming a clustering scheme which is based on Voronoi tessellation. In addition to mathematical analysis on the feasibility of the formula, we also examine its performance through a set of simulations under the Erceg path loss model. Simulation results verify that the link throughput gain of our proposed scheme is promising.