• 제목/요약/키워드: equivalence problem

검색결과 115건 처리시간 0.024초

EQUIVALENCE PROBLEM AND COMPLETE SYSTEM OF FINITE ORDER

  • Han, Chong-Kyu
    • 대한수학회지
    • /
    • 제37권2호
    • /
    • pp.225-243
    • /
    • 2000
  • We explain the notion of complete system and how it naturally arises from the equivalence problem of G-structures. Then we construct a complete system of 3rd order for the infinitesimal CR automorphisms of CR manifold of nondegenerate Levi form.

  • PDF

A Boolean Equivalence Testing Algorithm based on a Derivational Method

  • Moon, Gyo-Sik
    • Journal of Electrical Engineering and information Science
    • /
    • 제2권5호
    • /
    • pp.1-8
    • /
    • 1997
  • The main purpose of the Boolean equivalence problem is to verify that two Boolean expressions have the same functionality. Simulation has been extensively used as the standard method for the equivalence problem. Obviously, the number of tests required to perform a satisfactory coverage grows exponentially with the number of input variables. However, formal methods as opposed to simulation are getting more attention from the community. We propose a new algorithm called the Cover-Merge Algorithm based on a derivational method using the concept of cover and merge for the equivalence problem and investigate its theoretical aspects. Because of the difficulty of the problem, we emphasize simplification techniques in order to reduce the search space or problem size. Heuristics based on types of merges are developed to speed up the derivation process by allowing simplifications. In comparison with widely used technique called Binary Decision Diagram or BDD, the algorithm proposed outperforms BDD in nearly all cases of input including standard benchmark problems.

  • PDF

EQUIVALENCE BETWEEN SYMMETRIC DUAL PROGRAM AND MATRIX GAME

  • Kim, Moon-Hee
    • Journal of applied mathematics & informatics
    • /
    • 제25권1_2호
    • /
    • pp.505-511
    • /
    • 2007
  • Recently, the equivalent relations between a symmetric dual problem and a matrix game B(x, y) were given in [6: D.S. Kim and K. Noh, J. Math. Anal. Appl. 298(2004), 1-13]. Using more simpler form of B(x, y) than one in [6], we establish the equivalence relations between a symmetric dual problem and a matrix game, and then give a numerical example illustrating our equivalence results.

ONE REMARK FOR CR EQUIVALENCE PROBLEM

  • Hayashimoto, Atusushi
    • 대한수학회지
    • /
    • 제37권2호
    • /
    • pp.245-251
    • /
    • 2000
  • Assume that two boundaries of worm domains, which are parpametrizd by harmonic functions, are CR equivalent. Then we determine the Taylor expansion of CR equivalence mapping and get a relation of harmonic functions.

  • PDF

Equivalent classes of decouplable and controllable linear systems

  • Ha, In-Joong;Lee, Sung-Joon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 19-21 Oct. 1992
    • /
    • pp.405-412
    • /
    • 1992
  • The problem we consider in this paper is more demanding than the problem of input-output linearization with state equivalence recently solved by Cheng, Isidori, Respondek, and Tarn. We request that the MIMO nonlinear system, for which the problem of input-output linearization with state-equivalence is solvable, can be decoupled. In exchange for further requirement like this, our problem produces more usable and informative results than the problem of input-output linearization with state-equivalence. We present the necessary and sufficient conditions for our problem to be solvable. We characterize each of the nonlinear systems satisfying these conditions by a set of parameters which are invariant under the group action of state feedback and transformation. Using this set of parameters, we can determine directly the unique one, among the canonical forms of decouplable and controllable linear systems, to which a nonlinear system can be transformed via appropriate state feedback and transformation. Finally, we present the necessary and sufficient conditions for our problem to be solvable with internal stability, that is, for stable decoupling.

  • PDF

Note on the Codimension Two Splitting Problem

  • Matsumoto, Yukio
    • Kyungpook Mathematical Journal
    • /
    • 제59권3호
    • /
    • pp.563-589
    • /
    • 2019
  • Let W and V be manifolds of dimension m + 2, M a locally flat submanifold of V whose dimension is m. Let $f:W{\rightarrow}V$ be a homotopy equivalence. The problem we study in this paper is the following: When is f homotopic to another homotopy equivalence $g:W{\rightarrow}V$ such that g is transverse regular along M and such that $g{\mid}g^{-1}(M):g^{-1}(M){\rightarrow}M$ is a simple homotopy equivalence? $L{\acute{o}}pez$ de Medrano (1970) called this problem the weak h-regularity problem. We solve this problem applying the codimension two surgery theory developed by the author (1973). We will work in higher dimensions, assuming that $$m{\geq_-}5$$.

SPLITTING, AMALGAMATION, AND STRONG SHIFT EQUIVALENCE OF NONNEGATIVE INTEGRAL MATRICES

  • Ko, Young-Hee
    • 대한수학회지
    • /
    • 제36권4호
    • /
    • pp.773-785
    • /
    • 1999
  • Shifts of finite type are represented by nonnegative integral square matrics, and conjugacy between two shifts of finite type is determined by strong shift equivalence between the representing nonnegative intergral square matrices. But determining strong shift equivalence is usually a very difficult problem. we develop splittings and amalgamations of nonnegative integral matrices, which are analogues of those of directed graphs, and show that two nonnegative integral square matrices are strong shift equivalent if and only if one is obtained from a higher matrix of the other matrix by a series of amalgamations.

  • PDF

분수의 하위개념 이해가 문제해결에 미치는 영향 (The Impact of Children's Understanding of Fractions on Problem Solving)

  • 김경미;황우형
    • 한국수학교육학회지시리즈A:수학교육
    • /
    • 제48권3호
    • /
    • pp.235-263
    • /
    • 2009
  • The purpose of the study was to investigate the influence of children's understanding of fractions in mathematics problem solving. Kieren has claimed that the concept of fractions is not a single construct, but consists of several interrelated subconstructs(i.e., part-whole, ratio, operator, quotient and measure). Later on, in the early 1980s, Behr et al. built on Kieren's conceptualization and suggested a theoretical model linking the five subconstructs of fractions to the operations of fractions, fraction equivalence and problem solving. In the present study we utilized this theoretical model as a reference to investigate children's understanding of fractions. The case study has been conducted with 6 children consisted of 4th to 5th graders to detect how they understand factions, and how their understanding influence problem solving of subconstructs, operations of fractions and equivalence. Children's understanding of fractions was categorized into "part-whole", "ratio", "operator", "quotient", "measure" and "result of operations". Most children solved the problems based on their conceptual structure of fractions. However, we could not find the particular relationships between children's understanding of fractions and fraction operations or fraction equivalence, while children's understanding of fractions significantly influences their solutions to the problems of five subconstructs of fractions. We suggested that the focus of teaching should be on the concept of fractions and the meaning of each operations of fractions rather than computational algorithm of fractions.

  • PDF

SMV를 이용한 유한 상태 기계의 동치 검사 (Equivalence Checking of Finite State Machines with SMV)

  • 권기현;엄태호
    • 한국정보과학회논문지:소프트웨어및응용
    • /
    • 제30권7_8호
    • /
    • pp.642-648
    • /
    • 2003
  • 본 연구에서는 유한 상태 기계들 간의 동치 여부를 검증하고자 한다. 즉 모든 입력에 대하여 유한 상태 기계의 반응이 항상 동일한지를 판정하고자 한다. 만약 두 개의 유한 상태 기계가 동치라고 판정된다면, 복잡한 유한 상태 기계는 단순한 기계로 대치될 수 있다. 또한 명세와 구현이 모두 유한 상태 기계로 표현된 경우, 동치 검사를 이용해서 구현이 명세를 만족하는지 결정할 수 있다. 본 논문에서는 이와 같은 유한 상태 기계의 동치 검사를 모델 검사 기법으로 다음과 같이 해결한다. 주어진 유한 상태 기계${M_A}와 {M_R}$를 조합하여 모델 $M = {M_A} {\times} {M_\beta}$을 구축하고, 검사할 동치 조건을 시제 논리식 ${\Phi}$로 기술한다. 만일 모델이 시제 논리식을 만족한다면$(M={\Phi})$ 두 기계는 동치이다. 그렇지 않다면 두 기계는 비동치이며 그 이유를 설명하는 반례를 제공한다. 전 과정이 자동화되었으며, 여러 개의 사례 연구에 적용한 결과 만족할 만한 결과를 얻었다.