• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1373-1381
• /
• 1999

이 논문에서는 통신망 설계 응용분야의 문제를 그래프 이론 문제로써 고려해 보았다. 개별 기업체가 서로 떨어진 두 곳을 연결하고자 할 때 공용통신망의 회선을 빌려 통신망을 구축하게 되는데 많은 경우 여러 종류의 회선들이 공급됨으로 어떤 회선을 선택하느냐의 문제가 생긴다. 일반적으로 빠른 회선(low delay)은 느린 회선(high delay)에 비해 비싸다. 그러나 서비스의 질(Quality of Service)이라는 요구사항이 종종 종단지연(end-to-end delay)시간에 의해 결정되므로, 무조건 낮은 가격의 회선만을 사용할 수는 없다. 결국 개별 기업체의 통신망을 위한 통로를 공용 통신망 위에 덮어씌워(overlaying) 구축하는 것의 여부는 두 개의 상반된 인자인 가격과 속도의 조절에 달려 있다. 따라서 일반적인 최소경로 찾기의 변형이라 할 수 있는 다음의 문제가 본 논문의 관심사이다. 두 개의 지점을 연결하는데 종단지연시간의 한계를 만족하면서 최소경비를 갖는 경로에 대한 해결을 위하여, 그래프 채색(coloring) 문제와 최단경로문제를 함께 포함하는 그래프 이론의 문제로 정형화시켜 살펴본다. 배낭문제로의 변환을 통해 이 문제는 {{{{NP-complete임을 증명하였고 {{{{O($\mid$E$\mid$D_0 )시간에 최적값을 주는 의사선형 알고리즘과O($\mid$E$\mid$)시간의 근사 알고리즘을 보였다. 특별한 경우에 대한 {{{{O($\mid$V$\mid$ + $\mid$E$\mid$)시간과 {{{{O($\mid$E$\mid$^2 + $\mid$E$\mid$$\mid$V$\mid$log$\mid$V$\mid$)시간 알고리즘을 보였으며 배낭 문제의 해결책과 유사한 그리디 휴리스틱(greedy heuristic) 알고리즘이 그물 구조(mesh) 그래프 상에서 좋은 결과를 보여주고 있음을 실험을 통해 확인해 보았다.Abstract This paper considers a graph-theoretic problem motivated by a telecommunication network optimization. When a private organization wishes to connect two sites by leasing physical lines from a public telecommunications network, it is often the cases that several categories of lines are available, at different costs. Typically a faster (low delay) lines costs more than a slower (high delay) line. However, low cost lines cannot be used exclusively because the Quality of Service (QoS) requirements often impose a bound on the end-to-end delay. Therefore, overlaying a path on the public network involves two diametrically opposing factors: cost and delay. The following variation of the standard shortest path problem is thus of interest: the shortest route between the two sites that meets a given bound on the end-to-end delay. For this problem we formulate a graph-theoretical problem that has both a shortest path component as well as coloring component. Interestingly, the problem could be formulated as a knapsack problem. We have shown that the general problem is NP-complete. The optimal polynomial-time algorithms for some special cases and one heuristic algorithm for the general problem are described.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.1
• /
• pp.6-11
• /
• 2003

Recently, the modular network was proposed in a way to keep the size of the neural network small. The modular network solves the problem by splitting it into sub-problems. In this aspect, fuzzy systems act in a similar way. However, in a fuzzy system, there must be an expert rule which separates the input space. To overcome this, fuzzy-neural network has been used. However, the number of fuzzy rules grows exponentially as the number of input variables grow. In this paper, we would like to solve the size problem of neural networks using modular network with the hierarchic structure. In the hierarchic structure, the output of precedent module affects only the THEN part of the rule. Finally, the rules become shorter being compared to the rule of fuzzy-neural system. Also, the relations between input and output could be understood more easily in the Proposed modular network and that makes design easier.

• Journal of KIISE
• /
• v.43 no.9
• /
• pp.1015-1025
• /
• 2016

Currently, software testing is becoming increasingly important in the industrial field and a large body of research supports the improvement of efficient software testing. Model-based testing is generally used to formalize user requirement data for test design. Complex system that includes loop and concurrency has a high probability of path explosion problem. Specially, as threads are added to concurrency, test scenarios have also increased exponentially. However, it is difficult to solve this problem using existing techniques. In this paper, we propose novel path-search technique that focuses on behavioral features of concurrency path in order to avoid path explosion problem. A system that contains concurrent paths is represented by activity diagram in case study section. Efficiency of our study is shown through comparison with several generated test scenarios of other studies. The result indicate that our approach is efficient for finding faults in loop and concurrency with fewer test scenario.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.846-854
• /
• 1996

In this paper, we propose a solution to the software maintenance problem that is a primary factor of software crisis. We surveyed and analyzed the current software maintenance problems through questionnaires and interviews. As a result, we defined the software maintenance management life cycle and established a fundamental strategies to solve the software maintenance problems efficiently. We also designed a software maintenance management support systems to construct an automated software maintenance management tool. Furthermore, tp improve the formalization and reliability of the software maintenance management procedure, we defined acost predictive model using a fixed-single parameter based on comprehensive program size for the source code and delivered effort(person/month). We elaborated the model by considering an experience level of maintainer, a skill- level defined by the manager, and a reliability level required by the model of maintenance management.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.11a
• /
• pp.11-14
• /
• 2009

기존의 반이중방식 단방향 중계 네트워크는 하나의 정보를 두 개의 시간 슬롯 동안에 보내므로 주파수 효율에서 감소가 생기게 된다. 이러한 주파수 효율의 감소를 막기 위해 제안된 양방향 중계 네트워크는 중계기에 중첩 부호화 또는 네트워크 부호화를 적용함으로써 단방향 중계 네트워크에 비해 향상된 주파수 효율을 제공한다. 한편, OFDMA 네트워크는 사용자에게 부반송파, 전력 등의 자원을 적응적으로 할당하여 네트워크의 성능 향상을 얻을 수 있다. 본 논문에서는 다중사용자 다중중계기 양방향 OFDMA 중계 네트워크를 위한 새로운 적응적 부반송파 할당 알고리듬을 제안한다. 먼저 모든 사용자 쌍에 대한 달성 합 전송속도(achievable sum-rate over all user pairs)를 최대화하기 위한 최적화 문제를 정형화한다. 시스템의 수명을 늘이고 각 사용자의 최소 전송속도를 보장하기 위해 공정성 제한을 고려한다. 그리고 이로부터 새로운 적응적 부반송파 할당 알고리듬을 제안한다. 모의실험을 통해 제안된 알고리듬이 정적 알고리듬과 그리디 알고리듬, 두 알고리듬 모두 보다 훨씬 낮은 불능확률을 얻음을 확인한다.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1087-1094
• /
• 2004

Normally, formalization and standardization are followed while doing any system analysis and design. But, in actual system development, products can't be written using the automated tool for all products due to their own characteristics. That results the inconsistency among development products and various kinds of problem can occur in the products. In this paper, we present a technique that supports consistency among products of analysis and design phase developed according to object oriented method. And, this paper also presents the implementation tool.

• The KIPS Transactions:PartD
• /
• v.8D no.6
• /
• pp.823-834
• /
• 2001

In the active databases, whenever an event occurs, active rules with the matching event specifications are triggered automatically, its action will be executed. Because these rules may in turn trigger other rules including themselves, the set of rules may be executing each other indefinitely. These problem can be solved by rule termination analysis, and it is efficient for the rule termination to execute in compile time of rule. In this paper we not only design rule compiler with rule termination analyzer, but also propose its execution model and algorithm. The completeness of proposed model is verified by algorithm formalization of rule termination analysis.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.265-272
• /
• 2003

As VLSI systems become integrated at large-scale, logic fault or delay fault may result from crosstalk noise originated from cross coupling capacitance which exists between two adjacent wires. Because designers in industry do not have means to prevent crosstalk problems, they should check and adjust unsatisfactory designs after all designs are completed, if necessary. In this paper, we analyze how spacing, slew rate, line width, and line length influence the crosstalk, and suggest some solutions for the various factors that nay cause crosstalk problems. we also propose how to optimize the designs by using standardization of noise tables.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2007.11a
• /
• pp.362-366
• /
• 2007

최근 기업 경영활동의 의사결정시 사용되는 비즈니스 룰(Business Rule)을 정형화하고 하나의 시스템으로 구축하여 효과적으로 기업의 경쟁력을 제고하기 위한 노력이 다양하게 시도되고 있다. 비즈니스 룰 시스템 구축 작업의 경우 기업 내부에 비정형적으로 존재하는 비즈니스 룰을 체계적으로 관리하기 위해 BRMS(Business Rule Management System)와 같은 전문 관리 도구를 도입하나, 대부분의 경우 비즈니스 룰 리포지토리(Repository)를 단순히 기능별 혹은 업무별로 구성함으로 인해 동일한 내용의 룰이 서로 다른 룰 리포지토리에 중복 존재하게 되는 등 구조상의 문제점을 발생시킨다. 이로 인해 각 어플리케이션 간의 룰 또는 룰 세트(Rule Set) 공유 관계가 수동 관리되거나 중복 룰의 수정으로 인한 룰 세트별 버전 관리 문제 등 비즈니스 룰 리포지토리 운영의 어려움에 봉착하게 된다. 본 연구에서는 금융보험사의 룰웨어하우스 구축 사례를 통해 다양한 어플리케이션에서 참조되는 전사 수준의 비즈니스 룰 관리 아키텍처 구성 방법 및 각 방법이 지닌 장단점에 대해 분석한다. 본 연구의 결과를 토대로 다양한 어플리케이션에서 참조되고 수시로 변경되는 전사 수준의 통합 비즈니스 룰 관리 시스템 구축 방안에 대한 연구가 활성화되기를 기대한다.

• Journal of Korea Water Resources Association
• /
• v.31 no.4
• /
• pp.503-512
• /
• 1998

When various elements of water balance are displayed at several points of a river network, the runoff amounts at an estuary especially tidal influenced are affected from the elements. This problem can be solved by a model that can generalize and formulate the elements and simulate daily runoff and water requirement. The WWASS model was built using DIROM for the simulation of daily runoff and water requirement, and the water balance elements were modeled to be balanced at the each control point of river network. The model was calibrated, verified and applied to the watershed for the Saemankeum tidal land reclamation development project. It showed that the results from the streamflow simulation at the Mankyung and Dongjin estuary were acceptable for the design of the Saemankeum estuary reservoir.