• 한국경영과학회지
• /
• 제40권4호
• /
• pp.35-48
• /
• 2015

We analyze the systemic risk based on the information flows using the variance decomposition, DebtRank methods, and the Industry Sector Indices during 2001. 01 to 2015. 08. Using the KOSPI stock market as our setting, we find that (i) the systemic risk calculated by information flows of variance decompositions method shows strong positive relations with the market volatility, (ii) the magnitude of systemic risk measured from the information flows network by DebtRank method increases after the subprime financial crisis.

• 전자공학회논문지B
• /
• 제33B권10호
• /
• pp.90-97
• /
• 1996

This paper presents an efficient parallel implementation and its performance evaluations of a SOFM neural netowrk on the multicomputer. We investigate the parallel performance as the size of a neural network N, the number of the patterns L, and the number of the processors p increase. We propose an analytica performance evaluation model for eac of the parallel implementations and verified the validity of the model through experiments. Analytical result show that the number of processors for a maximum speedup of the network decomposition nd the training-set decomposition increases in proportion to .root.N and .root.L, respectively. The performances of the both decompositions depend on the number of training patterns L and the size of the neural network N and, if L.geq.0.423N, the performance of trhe training-set decomposition is proved to be better than that of the network decomposition.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제49권4호
• /
• pp.191-200
• /
• 2000

In practical applications, we frequently encounter the actuator nonlinearity in control systems, and its representative nonlinearity is saturation. A controller designed without considering this saturation nonlinearity is often a source of degradation of performance. To treat the saturation nonlinearity more efficiently, we adopt the multiplicative decomposition and the additive decomposition. Based on these decompositions, we present two controller design methods in the LMI(Linear Matrix Inequality) form that guarantee the L2 gain, from the disturbance to the measured output, is less than or equal to a given value. Finally, we give two examples to show the applicability and usefulness of our results.

• 한국시뮬레이션학회논문지
• /
• 제13권1호
• /
• pp.11-23
• /
• 2004

The decomposition of a structuring element for a morphological operation reduces the amount of the computation required for executing the operation. In this paper, we present a new technique for the decomposition of convex structuring elements for morphological operations. We formulated the linear constraints for the decomposition of a convex polygon in discrete space, then the constraints are applied to the decomposition of a convex structuring element. Also, a cost function is introduced to represent the optimal criteria for decomposition. We use linear integer programming technique to find the combination of basis structuring elements which minimizes the amount of the computation required for executing the morphological operation. Formulating different cost functions for different implementation methods and computer architectures, we can determine the optimal decompositions which guarantee the minimal amounts of computation on different computing environment.

• Kyungpook Mathematical Journal
• /
• 제57권3호
• /
• pp.457-471
• /
• 2017

A necessary and sufficient condition for the product AB of a selfadjoint operator A and a bounded selfadjoint operator B to be normal is given. Various properties of the factors of the unitary polar decompositions of A and B are obtained in the case when the product AB is normal. A block operator model for pairs (A, B) of selfadjoint operators such that B is bounded and AB is normal is established. The case when both operators A and B are bounded is discussed. In addition, the example due to Rehder is reexamined from this point of view.

• 정보처리학회논문지B
• /
• 제10B권3호
• /
• pp.265-272
• /
• 2003

본 논문에서는 동적으로 변화하는 대용량의 데이터베이스로부터 보다 현실적인 데이터 마이닝의 수행을 가능케 하기 위하여 기존의 직사각형분해 알고리즘을 개선한 새로운 알고리즘을 제안한다. 새로운 알고리즘은 이진 행렬을 이분(bipartite) 그래프로 변환하고, 변환된 이분 그래프에서 이분클리크(biclique)를 찾음으로써 직사각형 분해를 수행한다 제안된 알고리즘은 새롭게 유도된 수학적 정리들을 바탕으로 출발하였으며, 복잡도 분석을 통하여 그 효율성을 보이고, 기존의 분류 방법론과의 비교를 통하여 제안된 방법론이 규칙의 수와 분류율면에서 우수함을 보인다.

• 전기학회논문지
• /
• 제57권8호
• /
• pp.1429-1433
• /
• 2008

In this paper, we consider the design method of robust guaranteed cost controller for discrete-time singular systems with norm-bounded time-varying parameter uncertainty. In order to get the optimum(minimum) value of guaranteed cost, an optimization problem is given by linear matrix inequality (LMI) approach. The sufficient condition for the existence of controller and the upper bound of guaranteed cost function are proposed in terms of strict LMIs without decompositions of system matrices. Numerical examples are provided to show the validity of the presented method.

• Kyungpook Mathematical Journal
• /
• 제60권1호
• /
• pp.1-20
• /
• 2020

A simple but elegant result of Rival states that every sublattice L of a finite distributive lattice 𝒫 can be constructed from 𝒫 by removing a particular family 𝒥_L of its irreducible intervals. Applying this in the case that 𝒫 is a product of a finite set 𝒞 of chains, we get a one-to-one correspondence L ↦ 𝒟_𝒫(L) between the sublattices of 𝒫 and the preorders spanned by a canonical sublattice 𝒞^⋄ of 𝒫. We then show that L is a tight sublattice of the product of chains 𝒫 if and only if 𝒟_𝒫(L) is asymmetric. This yields a one-to-one correspondence between the tight sublattices of 𝒫 and the posets spanned by its poset J(𝒫) of non-zero join-irreducible elements. With this we recover and extend, among other classical results, the correspondence derived from results of Birkhoff and Dilworth, between the tight embeddings of a finite distributive lattice L into products of chains, and the chain decompositions of its poset J(L) of non-zero join-irreducible elements.

• 대한수학회보
• /
• 제53권2호
• /
• pp.495-506
• /
• 2016

In this note we consider the monoid $\mathcal{PODI}_n$ of all monotone partial permutations on $\{1,{\ldots},n\}$ and its submonoids $\mathcal{DP}_n$, $\mathcal{POI}_n$ and $\mathcal{ODP}_n$ of all partial isometries, of all order-preserving partial permutations and of all order-preserving partial isometries, respectively. We prove that both the monoids $\mathcal{POI}_n$ and $\mathcal{ODP}_n$ are quotients of bilateral semidirect products of two of their remarkable submonoids, namely of extensive and of co-extensive transformations. Moreover, we show that $\mathcal{PODI}_n$ is a quotient of a semidirect product of $\mathcal{POI}_n$ and the group $\mathcal{C}_2$ of order two and, analogously, $\mathcal{DP}_n$ is a quotient of a semidirect product of $\mathcal{ODP}_n$ and $\mathcal{C}_2$.

• 대한수학회논문집
• /
• 제33권1호
• /
• pp.325-335
• /
• 2018

We prove every oriented compact cyclic 3-orbifold has a contact structure. There is another proof in the web by Daniel Herr in his uploaded thesis which depends on open book decompositions, ours is independent of that. We define overtwisted contact structures, tight contact structures and Lutz twist on oriented compact cyclic 3-orbifolds. We show that every contact structure in an oriented compact cyclic 3-orbifold contactified by our method is homotopic to an overtwisted structure with the overtwisted disc intersecting the singular locus of the orbifolds. In course of proving the above results we prove a classification result for compact oriented cyclic-3 orbifolds which has not been seen by us in literature before.