• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.4
• /
• pp.370-379
• /
• 2014

Recently, the interest in optical network with multifiber link is continuing to rise since the network traffic has been growing exponentially. However, growing traffic in network leads to increasing the energy consumption of the network equipment. In this paper, we propose a dynamic routing and wavelength assignment (RWA) algorithm based on V-like cost function and layered graph to improve energy efficiency in IP over WDM network with multifiber link. The V-like cost function is used to decide the fiber cost according to the number of used wavelengths. The layered graph with multifiber link is used to select the energy efficient route and wavelength. The proposed RWA algorithm is compared and analyzed with conventional algorithm in view of average power consumption and blocking probability through OPNET modeler.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.2
• /
• pp.41-50
• /
• 2004

Since the MPEG-4 visual standard enables content-based functionalities, it is necessary to extract video objects from video sequences. Segmentation algorithms can largely be classified into two different categories: automatic segmentation and user-assisted segmentation. In this paper, we propose a new user-assisted image segmentation method based on the active contour. If we define a shape space as a set of all possible variations from the initial curve and we assume that the shape space is linear, it can be decomposed into the column space and the left null space of the shape matrix. In the proposed method, the shape space vector in the column space describes changes from the initial curve to the imaginary feature curve, and a dynamic graph search algorithm describes the detailed shape of the object in the left null space. Since we employ the shape matrix and the SUSAN operator to outline object boundaries, the proposed algorithm can ignore unwanted feature points generated by low-level image processing operations and is, therefore, applicable to images of complex background. We can also compensate for limitations of the shape matrix with a dynamic graph search algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.199-202
• /
• 2009

The optimal path on real road network has been changed by traffic flow of roads frequently. Therefore a path finding system to find the optimal path on real network should consider traffic flow of roads that is changed on real time. The most of existing path finding methods do not consider traffic flow of roads and do not also perform efficiently if they use traffic information. In this paper, we propose an abstraction method of real road network based on the Terminal Based Navigation System (TBNS) with technique such as TPEG. TBNS can be able to provides quality of path better than before as using traffic information that is transferred by TPEG. The proposed method is to abstract real network as simple graph in order to use traffic information. It is composed boundary nodes based on real nodes, all boundary nodes that have the same of connection are merged together. The result of path finding on an abstract graph diminishes the search space.

• Journal of the Korea Society for Simulation
• /
• v.20 no.1
• /
• pp.9-18
• /
• 2011

Recently, in the era of low carbon and green growth, the importance of railway transportation is being emphasized However, there is a lack of research on simulation for railway depot. This paper presents the development of the dynamic simulator for LRT(Light Rail Transit) depot. This study presents explanations of requirement analysis, architecture, database design, simulation algorithm, and design and development of the simulation tool. The dynamic LRT depot simulation tool consists of four modules; a Network Editor to create and modify information regarding railroad, train, signal, turnout, job and station, a Simulator to calculate train movement algorithm, a Reporter to show simulation results in table and graphs, and an Animator to animate simulation results dynamically. It is hoped that this study on general details of structure, design and development of LRT depot dynamic simulator will perform as a good reference to future development of new simulation tools.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.316-318
• /
• 2005

무선 ad-hoc 네트워크는 중앙 집중화된 관리 시스템이나 지원 서비스 없이 동적으로 임시 네트워크를 구성하는 이동 호스트(MH)들의 집합이다. 이러한 네트워크는 백본 호스트나 다른 MH로의 연결을 제공하기 위한 고정된 제어장치를 갖지 않으며, 각 MH가 라우터로 동작하며 전달받은 패킷을 다른 MH로 전달한다. 이러한 무선 ad-hoc 네트워크에서 단순히 최선의 서비스만을 제공하던 기존의 방법과 달리, 많은 사용자가 요구하는 QoS 서비스를 지원하기 위하여 기존 네트워크를 효율적으로 최대 활용하는 방안에 대한 연구가 활발히 진행되고 있다. 본 논문에서는 무선 ad-hoc 네트워크 내에서 QoS 서비스를 제공하기 위한 기법으로 각각의 이동 호스트들은 QoS DAG 그래프를 유지하며 이러한 그래프를 바탕으로 만들어진 QoS 정보 패킷을 이웃 이동 호스트들에게 지역 브로드캐스트 함으로써 전역적인 QoS 정보의 검색과 운용없이, 유용한 QoS 정보를 전역적으로 각 이동 호스트가 유지할 수 있고 이를 바탕으로 효율적인 QoS 라우팅이 수행되어지는 기법이다.

• Journal of Digital Contents Society
• /
• v.19 no.3
• /
• pp.471-477
• /
• 2018

As time changes, users change their interest. In this paper, we propose a method to provide suitable service for users by dynamically weighting service interests in the context of age, timing, and seasonal changes in ubiquitous environment. Based on the service history data presented to users according to the age or season, we also offer useful services by continuously adding the most recent service rules to reflect the changing of service interest. To do this, a set of services is considered as a transaction and each service is considered as an item in a transaction. And also we represent the association of services in a graph and extract frequent service items that refer to the latest information services for users.

• Proceedings of the KSME Conference
• /
• 2001.11a
• /
• pp.679-685
• /
• 2001

In this paper, the dynamic response of the pantograph system that supplies electrical power to a high-speed rail vehicle were investigated. The analysis of the catenary based on the Finite Element Method (FEM) is executed to develop a pantograph fits well in high-speed focused on the dynamic characteristic analysis of the pantograph system. By simulation of the pantograph-catenary system, the static deflection of the catenary, the stiffness variation in contact lines, the dynamic response of the catenary undergoing constant moving load and the contact force analysis were executed. In order to consider the design variables that effects on the dynamic characteristic of the pantograph system performed the dynamic sensitivity analysis. From the pantograph-catenary analysis, the design parameters of a pantograph could be improved. From the results of the sensitivity analysis, a pantograph with improved parameters is suitable for a high-speed rail vehicle from the design-parameter analysis.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.11
• /
• pp.73-82
• /
• 2003

In this paper, a simultaneous buffer insertion and routing method is proposed under the constraints of wire and buffer locations by macro or IP blocks. A new grid graph is proposed to describe the regions in which buffers(or both wires and buffers) are not available. Under this grid we describe a method of constructing a buffeted tree that minimize the maximum source to sink delay. The method is based on the dynamic programming with pruning unnecessary partial solutions. The proposed method improved the slack time of the delay by 19% on the average while using less buffers and similar wire length.

• Journal of Digital Contents Society
• /
• v.8 no.4
• /
• pp.521-529
• /
• 2007

In this paper, we introduce a music recommendation system that automatically recommends music according to users' musical tastes. The recommendation system uses a graph-based collaborating filtering in which similarities between musics are saved as a graph, and so it can perform fast recommendation based on the implicit preference information. It also has capability of recommending music according to users' dynamically changing preferences as well as users' static preferences. The recommendation server is implemented as an independent server using Java, and communicates with clients according to a specified protocol. A demo web site has been built by using the server and music download data from actual users, and the accuracy of recommendation has been measured through experiments.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2023.07a
• /
• pp.217-218
• /
• 2023

내부자 위협이란, 조직의 보안 및 데이터, 시스템에 대한 내부 정보에 접근하는 현 임직원 및 전 임직원, 계약자와 같이, 동일한 조직 내부의 사람들로부터 발생하는 위협을 의미한다. 일반적으로 내부자들은 업무를 위하여, 시스템에 대한 합법적인 접근 권한을 가지며, 만약 이러한 권한이 오남용되는 경우에는 조직에 매우 심각한 피해를 입힐 수 있다. 이러한 내부자 위협은 외부로부터의 위협보다 방어 및 탐지가 훨씬 어려운 한계점이 있으며, 그 피해 규모가 매우 방대하다는 문제점도 존재한다. 이에 따라, 본 논문에서는 내부자 위협을 탐지하기 위하여, 이메일을 통한 기밀정보를 유출하는 유형의 위협에 대응하는 방안을 제안한다. 제안하는 방안은 조직 내에서 이메일을 발신하는 경우를 대상으로, 파일이 포함된 이메일에 발신자를 식별하기 위하여, 파일에 키 값 및 서명을 삽입하며, 발신되는 이메일을 모니터링하여 첨부된 파일의 유형을 파악함으로써, 동적 그래프를 통하여 시각화한다. 내부 시스템 및 네트워크에서의 보안관제 담당자 및 관리자는 시각화된 그래프를 확인함으로써, 직관적으로 정보 유출을 파악하고 대응할 수 있을 것으로 판단된다. 본 논문에서 제안하는 방안을 통하여, 조직 내의 내부자 위협을 탐지할 수 있으며, 데이터 유출 사고가 발생하는 경우, 유출자를 빠르게 식별하고 초기에 대응할 수 있을 것으로 판단된다.