• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7B
• /
• pp.417-426
• /
• 2005

Routing and wavelength assignment problem is one of the most important issues in optical transport networks based on wavelength division multiplexing(WDM) technique. In this paper, we propose a novel approach using path conflict graphs and an algorithm for finding all edge disjoint paths. And then we compare the performance of the proposed algorithm with that of bounded greedy approach for EDP(BGAforEDP). The proposed one outperforms up to about 20$\%$ in the fixed traditional topology(NSFNET) and about 32$\%$ in random topologies over the BGA for EDP algorithm.

• Journal of Internet Computing and Services
• /
• v.7 no.5
• /
• pp.109-121
• /
• 2006

In this paper, we suggest lattice based role graph security management model which changes security level in mandatory access control model as well as constraint and role hierarchy systematically in role base access control model. In this model, we solved privilege abuse of senior role that is role graph model's problem, and when produce conflict between privileges, we can keep integrity of information by reseting grade of subject through constraint. Also, we offer strong security function by doing to be controlled by subject's security level as well as privilege inheritance by role hierarchy, Finally, we present the role graph algorithms with logic to disallow roles that contain conflicting privileges.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06c
• /
• pp.1-3
• /
• 2012

RIF(Rule Interchange Format)는 시맨틱 웹의 구조중 규칙 계층을 담당하며 기존에 사용되고 있는 여러 상이한 규칙 언어들 간의 호환을 위한 표준 규칙 언어라고 할 수 있다. RIF는 W3C에서 승인되었다. 시맨틱웹을 위한 표준 온톨로지 언어로는 RDF와 OWL이 있으며, 최근 RDF 데이터에 대한 접근제어 (Access Control) 메커니즘과 관련하여 일부 학술적 연구가 수행되었다. 본 논문에서는 RDF 데이터와 결합될 수 있는 RIF 추론 규칙에 대해 이미 제안한 RDF 접근제어 메커니즘을 확장하고자 한다. RDF 데이터에 대해 명세된 접근 권한은 RIF 추론에 의하여 권한 충돌이 발생할 수 있고, 그로 인해 접근 권한은 허용되지 않을 수 있다. 본 논문에서는 어떤 조건에서 이러한 RIF 추론에 의한 권한 충돌이 발생하는 지를 분석하며, 이미 제안한 그래프 레이블링을 사용하는 충돌 발견 방법이 RIF 추론과 관련하여서도 효율적임을 보인다. 실험에서는 제안된 방법이, 비록 포함관계 추론에 특화 되었지만, Chase 알고리즘에 기반한 다른 연구에서의 방법보다 발견 시간을 크게 감소시킴을 보인다.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3055-3063
• /
• 2000

In this paper, a task duplication based heuristic scheduling algorithm is proposed to solve the problem of task scheduling on Shared Memory Multiporcessors (SMM). The proposed algorithm pre-allocates network resources so as to avoid potential communication conlhct, and the algorithm uses heuristies to select duplication tasks so as to recuce of a multiprocessors, and generates scheduling accorting to the available number of processors ina system. The proposed algorithm has been applied to some practical task graphs in the simulation, and the results show that the proposed algorithm achieves considerable performance improvement, in respect of schedule length.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1632-1634
• /
• 2010

고성능 재구성형 어레이 아키텍처는 애플리케이션에 내재된 병렬성을 충분히 활용하도록 풍부한 하드웨어 리소스로 구성되어 있다. 이러한 하드웨어 리소스는 소프트웨어 파이프라이닝 기반 코드할당 기법을 통하여 사용된다. 이러한 코드할당 기법은 기존의 소프트웨어 파이프라이닝 기법에 FPGA 에서의 라우팅 & 위치선정기법이 연결된 형식으로 구성된다. 이러한 기존의 연구들은 데이터 흐름 (data flow)을 단순한 형태로 가정하여 개발되었다. 따라서 루프 코드 펼침 (loop unrolling)에 따라서 발생되는 데이터 복사에 의한 흐름 (copy flow)은 코드 매핑할 때 고려하지 않기 때문에 소프트웨어 파이프라이닝 적용시 네트웍 리소스의 중복사용으로 인한 데이터 충돌문제(data congestion)로 Minimum Initiation Interval (MII)증가에 따르는 성능 저하가 발생할 수 있다. 본 연구에서는 다양한 데이터 복사 흐름까지 고려하도록 데이터 의존도 그래프 (Data Dependence Graph, DDG)를 확장하여 스케쥴링 단계에서 데이터 충돌 지연에 의한 MII 증가를 방지하여 최적의 시스템 성능을 얻도록 코드 할당 기법을 개발하였다.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2023.05a
• /
• pp.141-141
• /
• 2023

본 연구에서는 음향센싱 기법을 활용하여 소류사량 계측이 가능한 센서인 파이프 하이드로폰을 2가지 형태로 개발하여 설치 형태에 따른 소류사량 계측 성능을 비교·분석하였다. 파이프 하이드로폰은 수리구조물 끝단에 설치하는 부착식 하이드로폰과 하천 하상에 설치 가능한 형태로 제작하였으며, 파이프 하이드로폰의 실내 실험을 위한 수리실험장치를 구축하였다. 소류사 음향 데이터를 수집 및 저장하기 위해 National Instrument사에서 개발된 LabVIEW 언어를 이용하여 데이터 분석 프로그램을 개발하였으며, 데이터를 시계열 그래프로 표출하여 센서를 통해 계측되는 소류사의 특성을 분석하였다. 분석 결과 하천 하상 설치 형태의 파이프 하이드로폰은 후류가 발생하여 센서 후면으로 소류사가 재충돌되는 현상이 발생하였으며, 이에 6~9% 정도의 과다 산출되는 것을 확인할 수 있었다. 또한 소류사가 센서에 퇴적되어 지속적인 데이터를 취득하기에는 적합하지 못할 것으로 판단되었다. 동일한 조건으로 실험한 부착식 하이드로폰은 후류로 인한 재충돌 현상 및 퇴적현상 또한 발생하지 않았으며, 소류사량 추정 결과 90.9%로 양호한 수준의 성능이 확인되었다.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.71-71
• /
• 2004

• Journal of Korean Society of Environmental Engineers
• /
• v.31 no.9
• /
• pp.825-830
• /
• 2009

Pharmaceutical compounds enter the water environment through the diverse pathways. Because their concentration in the water environment was frequently detected in the level of ppt to ppb, the monitoring system should be optimized as much as possible for finding appropriate management policies and technical solutions. One Factor At a Time (OFAT) approach approximating the response with a single variable has been preferred for the optimization of LC-MS/MS operational conditions. However, it is common that variables in analytical instruments are interdependent. Therefore, the best condition could be found by using the statistical optimization method changing multiple variables at a time. In this research, response surface analysis (RSA) was applied to the LC-MS/MS analysis of emerging antibiotic compound, sulfamethoxazole, for the best sensitivity. In the screening test, fragmentation energy and collision voltage were selected as independent variables. They were changed simultaneously for the statistical optimization and a polynomial equation was fit to the data set. The correlation coefficient, $R^2$ valuerepresented 0.9947 and the error between the predicted and observed value showed only 3.41% at the random condition, fragmentation energy of 60 and collision voltage of 17 eV. Therefore, it was concluded that the model derived by RSA successfully predict the response. The optimal conditions identified by the model were fragmentation energy of 116.6 and collision voltage of 10.9 eV. This RSA can be extensively utilized for optimizing conditions of solid-phase extraction and liquid chromatography.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.8
• /
• pp.907-914
• /
• 2014

A heuristic search algorithm is proposed to plan a collision free path for robots in an indoor environment. The proposed algorithm is to find a collision free path in the gridded configuration space by proposed heuristic graph search algorithm. The proposed algorithm largely consists of two parts : tunnel searching and path searching in the tunnel. The tunnel searching algorithm finds a thicker path from start grid to goal grid in grid configuration space. The tunnel is constructed with large grid defined as a connected several minimum size grids in grid-based configuration space. The path searching algorithm then searches a path in the tunnel with minimum grids. The computational time of the proposed algorithm is less than the other graph search algorithm and we analysis the time complexity. To show the validity of the proposed algorithm, some numerical examples are illustrated for robot.

• Journal of the Korea Society for Simulation
• /
• v.16 no.1
• /
• pp.31-37
• /
• 2007

The importance of NPC's role in computer games is increasing. An NPC must perform its tasks by perceiving obstacles and other characters and by moving through them. It has been proposed to plan a natural-looking path against fixed obstacles by using a generalized visibility graph. In this paper we develop the execution module for an NPC to move efficiently along the path planned on the generalized visibility graph. The planned path consists of line segments and arc segments, so we define steering behaviors such as linear behaviors, circular behaviors, and an arriving behavior for NPC's movements to be realistic and utilize them during execution. The execution module also includes the collision detection capability to be able to detect dynamic obstacles and uses a decision tree to react differently according to the detected obstacles. The execution module is tested through the simulation based on the example scenario in which an NPC interferes the other moving NPC.