• Honam Mathematical Journal
• /
• v.1 no.1
• /
• pp.61-75
• /
• 1979

In this explanation. we shall describle how the de Rham's cohomology on a n-dimensional $C^{**}$-manifold is constructed. The Čech's cohomology defined by only topological structure of $C^{**}$-manifold has a crack that it is dependent on the covering of a $C^{**}$-manifold. At the end of explanation we shall prove that the de Rham's cohomology is isomorphic to Čech's cohomology which is made by simply covering.

• Journal of IKEEE
• /
• v.7 no.2 s.13
• /
• pp.156-165
• /
• 2003

This paper describes the design of a robust adaptive fuzzy observer for uncertain nonlinear dynamical system. We propose a new method in which no strictly positive real (SPR) condition is needed. No a priori knowledge of an upper bound on the lumped uncertainty is required. The Lyapunov synthesis approach is used to guarantee a semi-global uniform ultimate boundedness property of the state observation error, as well as of all other signals in the closed-loop system. The theoretical results are illustrated through a simulation example of a mass-spring-damper system.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.4
• /
• pp.132-137
• /
• 2007

A point-wise car-like robot moving in the plane changes its direction with a constraint on turning curvature. In this paper, we consider the problem of computing a shortest path of bounded curvature between a prescribed initial configuration (position and orientation) and a polygonal goal, and propose a new geometric proof showing that the shortest path is either of type CC or CS (or their substring), where C specifies a non-degenerate circular arc and S specifies a non-degenerate straight line segment. Based on the geometric property of the shortest path, the shortest path from a configuration to a polygonal goal can be computed in linear time.

• Proceedings of the KAIS Fall Conference
• /
• 2007.11a
• /
• pp.116-119
• /
• 2007

정확하고 신뢰성 높은 유량 자료는 수자원의 정량적인 계획과 관리에 필수적이다. 이를 위하여 Chiu는 기존의 결정론적인 흐름 방향 유속분포식의 한계를 극복할 수 있는 방법으로 확률통계에서 사용되는 엔트로피 개념을 이용한 3차원 유속분포 식을 제안하였고, 이를 실험실 테이터와 자연하천에 적용하여 신뢰성과 정확성을 지속적으로 증명하여, 마침내 이에 대한 활용성이 매우 크게 대두되어 Chiu의 유속공식을 적극적으로 사용하고 있는 실정이다. 그러나 지금까지 이론적인 유속 분포식을 검증하기위하여 단면 형상이 일정한 직사각형이나 사다리꼴 등의 실험수로에서부터 불규칙한 단면 형상을 갖는 자연 하천에 대한 적용을 거의 이루고 있는 실정이나, 하상경사가 변하는 경우에도 엔트로피 파라미터(M)가 이에 대응하여 평형상태에 도달하려고 하는지에 대한 연구는 전무하다. 본 연구에서는 하상경사를 임의로 변경 가능한 실험수로를 선택하여 정밀법에 의한 유속측정을 실시하였다. 같은 지점의 같은 단면에서 하상경사($\theta$)가 0.00069부터 0.019034까지 28번의 경사변화를 주고 각 경사마다 유량을 측정하여 28개의 유량측정 데이타를, Chiu의 엔트로피 유속공식에 적용하여, 평균유속과 최대유속 사이의 관계가 선형관계, 즉 하상경사가 변하는 경우에도 엔트로피 파라미터(M)가 이에 대응하여 평형상태에 도달함을 증명하였다.

• The Journal of the Korea Contents Association
• /
• v.20 no.9
• /
• pp.648-658
• /
• 2020

In essence, Musical theatre is a multimedia show, so when you listen to musical numbers, you will experience it through multiple senses. Therefore, in order to analyze musical numbers, emphasis should be placed on its interaction with various media such as lyrics, dance, and theatre, which have a direct association with the music. Through the Conceptual Blending Theory, which can comprehensively consider the combination of text and music, the combination of movement and music, and the combination of visual elements and music, this study analyzes the music of Musical . By exploring the result of interaction between lyrics and music, the interaction between choreography and music, and the interaction between stage and music, the artistry and intrinsic value of the work can be proved. In addition, we can discover the process and system of integrated interpretation through music analysis applying Conceptual Blending Theory. Therefore, Conceptual Blending Theory has sufficient utility as a methodology for music analysis of musical theatre.

• Journal for History of Mathematics
• /
• v.25 no.3
• /
• pp.29-39
• /
• 2012

As a product of modern proof theory, linear logic is a new form of logic developed for the purpose of enhancing programming language by Professor Jean-Yves Girard of Marseille University (France) in 1987 by supplementing intuitionist logic in a sophisticated manner. Thus, linear logic' s connectives can be explained using information processing terms such as sequentiality and parallel computation. For instance, A${\otimes}$B shows two processes, A and B, carried out one after another. A&B is linked to an internal indeterminate, allowing an observer to select either A or B. A${\oplus}$B is an external indeterminate, and as such, an observer knows that either A or B holds true, but does not know which process will be true. A ${\wp}$ B signifies parallel computation of process A and process B; linear negative exhibits synchronization, that is, in order for the process A to be carried out, both A and $A^{\bot}$ have to be accomplished simultaneously. Since the field of linear logic is not very active in Korea at present, this paper deals only with syntax aspect of linear logic in order to arouse interest in the subject, leaving semantics and proof nets for future studies.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.1_2
• /
• pp.110-118
• /
• 2006

Cryptographic protocol design in a two-party setting has of tel ignored the possibility of simultaneous message transmission by each of the two parties (i.e., using a duplex channel). In particular, most protocols for two-party key exchange have been designed assuming that parties alternate sending their messages (i.e., assuming a bidirectional half-duplex channel). However, by taking advantage of the communication characteristics of the network it may be possible to design protocols with improved latency. This is the focus of the present work. We present three provably-secure protocols for two-party authenticated key exchange (AKE) which require only a single round. Our first, most efficient protocol provides key independence but not forward secrecy. Our second scheme additionally provides forward secrecy but requires some additional computation. Security of these two protocols is analyzed in the random oracle model. Our final protocol provides the same strong security guarantees as our second protocol, but is proven secure in the standard model. This scheme is only slightly less efficient (from a computational perspective) than the previous ones. Our work provides the first provably- secure one-round protocols for two-party AKE which achieve forward secrecy.

• Journal of Digital Convergence
• /
• v.19 no.10
• /
• pp.377-382
• /
• 2021

A fuzzy relation between X and Y as fuzzy subset of X × Y was proposed by Zadeh. Subsequently, several researchers have applied the notion of fuzzy subsets to various branches of mathematics and computer sciences. Murali an Nemitz have studied fuzzy relations connected with fuzzy equivalence relations and fuzzy functions. Ounalli and Jaoua defined a fuzzy difunctional relation on a set. difunctional relations are versatile mathematical tool, which can be used in software design and in database theory. Their work have revealed the usefulness of difunctional relations in program specification and in defining program correctness. The main goal of this paper is to define a fuzzy deterministic relation on a set, characterize the fuzzy deterministic relation as its level subsets and investigate some properties in connection with fuzzy deterministic relation. In particular we prove that a fuzzy relation R is fuzzy deterministic iff R is a fuzzy function.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1264-1274
• /
• 1999

본 논문에서는 분산된 클록들을 주기적으로 동기화 시키는 분산 실시간 시스템에서 시간적 제약을 만족시키기 위한 정적/동적 시간 제약(timing constraint) 변환 기법을 제안한다. 전형적인 이산클록동기화(discrete clock synchronization) 알고리즘은 클록의 값을 순간적으로 조정하여 클록의 시간이 불연속적으로 진행한다. 이러한 시간상의 불연속성은 시간적 이벤트를 잃어버리거나 다시 발생시키는 오류를 범하게 한다.클록 시간의 불연속성을 피하기 위해 일반적으로 연속클록동기화(continuous clock synchronization) 기법이 제안되고 있지만 소프트웨어적으로 구현되면 많은 오버헤드를 유발시키는 문제점이 있다. 본 논문에서는 시간적 제약을 동적으로 변환시키는 DCT (Dynamic Constraint Transformation) 기법을 제안하였으며, 이를 통해 기존의 이산클록동기화 알고리즘을 수정하지 않고서도 클록 시간의 불연속성에 의한 문제점들을 해결할 수 있도록 하였다. 아울러 DCT에 의해 이산클록동기화 하에서 생성된 태스크 스케쥴이 연속클록동기화에 의해 생성된 스케쥴과 동일함을 증명하여 DCT의 동작이 이론적으로 정확함을 증명하였다.또한 분산 실시간 시스템에서 지역 클록(local clock)이 기준 클록과 완벽하게 일치하지 않아서 발생하는 스케쥴링상의 문제점을 다루었다. 이를 위해 먼저 두 가지의 스케쥴링 가능성, 지역적 스케쥴링 가능성(local schedulability)과 전역적 스케쥴링 가능성(global schedulability)을 정의하고, 이를 위해 시간적 제약을 정적으로 변환시키는 SCT (Static Constraint Transformation) 기법을 제안하였다. SCT를 통해 지역적으로 스케쥴링 가능한 태스크는 전역적으로 스케쥴링이 가능하므로, 단지 지역적 스케쥴링 가능성만을 검사하면 스케쥴링 문제를 해결할 수 있도록 하였고 이를 수학적으로 증명하였다.Abstract In this paper, we present static and dynamic constraint transformation techniques for ensuring timing requirements in a distributed real-time system possessing periodically synchronized distributed local clocks. Traditional discrete clock synchronization algorithms that adjust local clocks instantaneously yield time discontinuities. Such time discontinuities lead to the loss or the gain of events, thus raising serious run-time faults.While continuous clock synchronization is generally suggested to avoid the time discontinuity problem, it incurs too much run-time overhead to be implemented in software. We propose a dynamic constraint transformation (DCT) technique which can solve the problem without modifying discrete clock synchronization algorithms. We formally prove the correctness of the DCT by showing that the DCT with discrete clock synchronization generates the same task schedule as the continuous clock synchronization.We also investigate schedulability problems that arise when imperfect local clocks are used in distributed real-time systems. We first define two notions of schedulability, global schedulability and local schedulability, and then present a static constraint transformation (SCT) technique. The SCT ensures that it is sufficient to check the schedulability of a task locally in a node with a local clock, since the global schedulability of the task is derived from its local schedulability through SCT. We formally prove the correctness of SCT.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.3
• /
• pp.253-261
• /
• 2004

Game theory is mathematical analysis developed to study involved in making decisions. In 1928, Von Neumann proved that every two-person, zero-sum game with finitely many pure strategies for each player is deterministic. As well, in the early 50's, Nash presented another concept as the basis for a generalization of Von Neumann's theorem. Another central achievement of game theory is the introduction of evolutionary game theory, by which agents can play optimal strategies in the absence of rationality. Not the rationality but through the process of Darwinian selection, a population of agents can evolve to an Evolutionary Stable Strategy (ESS) introduced by Maynard Smith. Keeping pace with these game theoretical studies, the first computer simulation of co-evolution was tried out by Hillis in 1991. Moreover, Kauffman proposed NK model to analyze co-evolutionary dynamics between different species. He showed how co-evolutionary phenomenon reaches static states and that these states are Nash equilibrium or ESS introduced in game theory. Since the studies about co-evolutionary phenomenon were started, however many other researchers have developed co-evolutionary algorithms, in this paper we propose Game theory based Co-Evolutionary Algorithm (GCEA) and confirm that this algorithm can be a solution of evolutionary problems by searching the ESS.To evaluate newly designed GCEA approach, we solve several test Multi-objective Optimization Problems (MOPs). From the results of these evaluations, we confirm that evolutionary game can be embodied by co-evolutionary algorithm and analyze optimization performance of GCEA by comparing experimental results using GCEA with the results using other evolutionary optimization algorithms.