• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.11
• /
• pp.2634-2639
• /
• 2014

The idea of redundancy is used in order to improve the availability of networks and systems and there are various methods for implementing redundancy. To perform the availability analysis various stochastic models have been used. In this paper, 2N redundancy with one active service unit and one standby service unit is considered. To evaluate the expected availability, we model 2N redundancy using Stochastic Reward Nets. This model can be solved using the SPNP package.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.788-791
• /
• 2008

On this study, following works have been carried out : division of Han River Basin into 24 sub basins, use of rainfall data of 151 stations to make spatial distribution of rainfall, selection of control points such as Soyanggang Dam, Chungju Dam, Chungju Release Control Dam, Heongseong Dam, Hwachun Dam, Chuncheon Dam, Uiam Dam, Cheongpyung Dam and Paldang Dam, selection of SSARR (Streamflow Synthesis and Reservoir Regulation) model as a hydrologic model, preparation of input data of SSARR model, sensitivity analysis of parameter using hydrologic data of 2002. The sensitivity analysis showed that soil moisture index versus runoff percent (SMI-ROP), baseflow infiltration index versus baseflow percent (BII-BFP) and surface-subsurface separation (S-SS) parameters are higher sensitive parameters to the simulation result.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.172-174
• /
• 2004

무선 네트워크의 TCP 성능을 제고하기 위한 방법으로 ECN 방법이 심도 있게 연구되었다. 그러나, ECN 마킹을 위한 최적의 threshold에 대한 연구 결과는 찾아 보기 힘들다. 본 논문은 ECN 마킹을 위한 최적의 threshold를 찾는 식을 제시하고, ECN 전략을 적용하는 TCP의 페트리 넷 모형을 구축한 다음, 시뮬레이션을 통하여 제시된 식의 타당성을 검증한다. 또한 제시된 식의 실용화 방안도 제안한다.

• Proceedings of The Korean Society of Agricultural and Forest Meteorology Conference
• /
• 2005.09a
• /
• pp.61-61
• /
• 2005

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2008.06a
• /
• pp.11-16
• /
• 2008

본 논문은 온톨로지(ontology) 작성에 사용되는 RDF(Resource Description Framework) 모델을 CPN(Colored Petri Net) 모델로 변환하여 표현하는 방법을 제안하고, 페트리 넷 시뮬레이션으로 RDF의 의미를 해석하여 RDF 질의문에 답할 수 있음을 보인다. 또한, 어떠한 RDF 모델도 CPN 모델로의 변환이 가능하다는 제안 방법의 완전성과 무결성을 소개하고, 제안한 방법으로 구축된 CPN 모델에서 RDF 질의에 대해 정확하게 결과를 구하는 방법을 제시한다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.3
• /
• pp.191-197
• /
• 2011

The group Steiner tree problem is a generalization of the Steiner tree problem that is defined as follows. Given a weighted graph with a family of subsets of nodes, called groups, the problem is to find a minimum weighted tree that contains at least one node in each group. We present some existing and some new formulations for the problem and compare the relaxations of such formulations.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.83-88
• /
• 2000

본 논문은 mobile agent 시스템 설계의 예를 보인다. 본 시스템 설계에서 구축될 시스템의 사양은 자연어로 묘사되어 있다고 가정한다. 본 시스템 설계 과정은 다음과 같다. 첫째, 시스템 사양으로부터 필요한 사이트들을 분별하고, 둘째, 사이트간에 송수신 되는 정보들을 분별해, 이들 정보 개체들을 각각 한 개의 agent로 구현한다. 셋째, 각 Agent가 수행할 과업을 Petri net으로 정확히 표현한다. Agent가 정의되는 위치에 따라 필요한 통신량이 좌우됨으로 통신량을 최소화시키는 관점에서 Agent 정의의 위치를 결정한다.

• Proceedings of the Korean Society of Crop Science Conference
• /
• 2023.04a
• /
• pp.67-67
• /
• 2023

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.12
• /
• pp.2243-2251
• /
• 2016

In this paper, we propose a theoretical model for characterization and upper bounds of [1,2]-domination set of network which has tree structure. In detail, we propose a theoretic model for upper bounds on [1,2]-domination set of a tree network which has some typical constrains. To that purpose, we introduce a graph theory to model and analyze the characteristics of tree structure networks. We assume a node subset D of a graph G=(V,E). We define that D is a [1,2]-dominant set if for any node v in set V which is not an element of a set D is adjacent to a node or two nodes of an element in a set D (that is, $1{\leq}{\mid}N({\upsilon}){\bigcap}D{\mid}{\leq}2$ for every node $v{\in}V-D$). The minimum cardinality of a [1,2]-dominating set of G, which is denoted by ${\gamma}_{[1,2]}(G)$, is called the [1,2]-domination number of G. In this paper, we show new upper bounds and characteristics about the [1,2]-domination number of tree.

• The Journal of Korean Association of Computer Education
• /
• v.22 no.1
• /
• pp.87-98
• /
• 2019

It is easy to assume that contradictions are logically incorrect or empty sets that have no solvability. This dilemma, which can not be done, is difficult to solve because it has to solve the contradiction hidden in it. Paradoxically, therefore, contradiction resolution has been viewed as an innovative and creative problem-solving. TRIZ, which analyzes the solution of the problem from the perspective of resolving contradictions, has been used for people rather than computers. The Butterfly model, which analyzes the problem from the perspective of solving the contradiction like TRIZ, analyzed the type of contradiction problem using symbolic logic. In order to apply an appropriate concrete solution strategy for a given contradiction problems, we designed the Butterfly algorithm based on decision making tree. We also developed a visualization tool based on Python tkInter to find concrete solution strategies for given contradiction problems. In order to verify the developed tool, the third grade students of middle school learned the Butterfly algorithm, analyzed the contradiction of the wooden support, and won the grand prize at an invention contest in search of a new solution. The Butterfly algorithm developed in this paper systematically reduces the solution space of contradictory problems in the beginning of problem solving and can help solve contradiction problems without trial and errors.