• 충청수학회지
• /
• 제25권4호
• /
• pp.609-615
• /
• 2012

In the current paper, we establish the relationship between the powers of an invertible matrix and the powers of its inverse. More precisely, we prove that if A is an invertible matrix and, if $A^n\;=\;(A_{i,j}(n))$ for all positive integer n, then $A^{-n}\;=\;(A_{i,j}{(-n))$.

• 충청수학회지
• /
• 제25권1호
• /
• pp.19-25
• /
• 2012

The purpose of this paper is to derive powers $A^{n}$ using a system of recursive sequences for a given $2{\times}2$ matrix A. Introducing a recursive sequence we have a quadratic equation. Solutions to this quadratic equation are related with eigenvalues of A. By solving this quadratic equation we can easily obtain an explicit form of $A^{n}$. Our method holds when A is defined not only on the real field but also on the complex field.

• Communications for Statistical Applications and Methods
• /
• 제7권1호
• /
• pp.285-290
• /
• 2000

We noted a property of a stationary distribution on the matrix C, which is the covariance matrix of order statistics of standard normal distribution That is the sup norm of th powers of C is ee' divided by its dimension. The matrix C can be taken as a transition probability matrix in an acyclic Markov chain.

• 한국전자파학회논문지
• /
• 제27권5호
• /
• pp.430-437
• /
• 2016

일반적으로 잡음 측정결과는 회로망분석기의 측정결과에 비해 상당히 큰 불규칙 리플을 보인다. 이에 대한 주 원인은 회로망분석기는 측정 시에 상대적인 전력의 비를 이용하고, 잡음 측정은 절대적인 잡음전력 측정에 의존하기 때문이다. 본 논문에서는 잡음측정의 불규칙 리플을 최소화하기 위해서 상대적인 잡음비를 이용한 새로운 잡음상관행렬 측정방법을 제안하였다. 제안된 방법은 5개의 입력에 대해 측정된 잡음전력들 중 하나를 기준으로 4개의 상대적인 잡음비를 통해 불규칙 리플을 최소화하고, 이를 이용하여 잡음상관행렬 및 잡음 파라미터를 측정하는 방법이다. 제안된 방법을 이용한 잡음파라미터 측정결과, 수동 DUT인 0.5 dB 감쇠기의 경우, S-파라미터를 이용하여 계산되어진 잡음 파라미터의 이론값과 거의 일치하는 결과를 보였다. 그리고 1 dB 이하의 잡음지수를 갖는 능동 DUT에 대해서도 신뢰할 수 있는 잡음파라미터 측정이 가능함을 보였다.

• 전력전자학회:학술대회논문집
• /
• 전력전자학회 1997년도 전력전자학술대회 논문집
• /
• pp.228-232
• /
• 1997

The relation between instantaneous active/reactive powers and currents is defined by voltage mapping matrix in three-phase four-wire systems. Control strategies for an active filter without energy storage components are proposed on the basis of mapping matrices. It can compensate for the zero-sequence current, irrespectively of whether or not a zero-sequence voltage exists in a three-phase four-wire system.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1991년도 하계학술대회 논문집
• /
• pp.329-332
• /
• 1991

This paper presents an algorithm to reduce the time to solve Power Equations using a Neural Net. The Neural Net is trained with samples obtained through the conventional AC Load Flow. With these samples, the Neural Net is constructed and has the function of a linear interpolation network. Given arbitrary load level, this Neural Net generates voltage magnitudes and angles which are linear interpolation of real and reactive powers. Obtained voltage magnitudes and angles are substituted to Power Equations, Real and reactive powers are found. Thus, a new sample is generated. This new experience modifies weight matrix. Continuing to modify the weight matrix, the correct solution is achieved. comparing this method with AC Load flow, this method is faster. If we consider parallel processing, this method is far faster than conventional ones.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권2호
• /
• pp.686-710
• /
• 2019

This work proposes a model to solve the problem of Network Coding over a one-session multicast network. The model is based on a system of restrictions that defines the packet flows received in the sink nodes as functions of the outgoing flows from the source node. A multicast network graph is used to derive a directed labeled line graph (DLLG). The successive powers of the DLLG adjacency matrix to the convergence in the null matrix permits the construction of the jump matrix Source-Sinks. In its reduced form, this shows the dependency of the incoming flows in the sink nodes as a function of the outgoing flows in the source node. The emerging packets for each outgoing link from the source node are marked with a tag that is a linear combination of variables that corresponds to powers of two. Restrictions are built based on the dependence of the outgoing and incoming flows and the packet tags as variables. The linear independence of the incoming flows to the sink nodes is mandatory. The method is novel because the solution is independent of the Galois field size where the packet contents are defined.

• Journal of Electrical Engineering and Technology
• /
• 제3권4호
• /
• pp.491-498
• /
• 2008

In this paper a decoupled control of a doubly-fed induction machine(DFIM) feed by a matrix converter is presented. It provides a robust regulation of the stator side active and reactive powers by the direct and quadratic components of the stator current vector, presented in a line-voltage-oriented reference frame. In this case, the stator windings are directly connected to the line grid, while the rotor windings are supplied by this later through a matrix converter controlled by a space vector modulation technique. The proposed solution is suitable for both energy generation and electrical drive applications with restricted speed variation range.

• 대한수학회보
• /
• 제54권6호
• /
• pp.2107-2117
• /
• 2017

We study the quasi-commutativity in relation with powers of coefficients of polynomials. In the procedure we introduce the concept of ${\pi}$-quasi-commutative ring as a generalization of quasi-commutative rings. We show first that every ${\pi}$-quasi-commutative ring is Abelian and that a locally finite Abelian ring is ${\pi}$-quasi-commutative. The role of these facts are essential to our study in this note. The structures of various sorts of ${\pi}$-quasi-commutative rings are investigated to answer the questions raised naturally in the process, in relation to the structure of Jacobson and nil radicals.

• 한국통신학회논문지
• /
• 제14권4호
• /
• pp.374-387
• /
• 1989

대칭행렬식계산에 의한 2원 BCH부호의 복호방법을 제안한다. 이 복호법은 오류위치번호와 미지주 X의 판별식인 대칭행렬식을 오류위치다항식으로 이용한 것으로 오류위치다항식 계수를 구하는 방법으로 기존의 어느 방법보다 간단하고 복호기 구성도 간단하다. 본 논문에서는 대칭행렬을 이용한 복호알고리즘을 설명하고 일반적인 복호기를 구성한 후 시뮬레이션을 통해 그 정당함을 입증하였으며 (63.45)BCH 부호에 적용하여 복호기를 구성하였다. 그리고 Peterson-Borenstein -Zierler 알고리즘과 유한체 연산의 횟수와 하드웨어의 복잡도를 비교하여 본 복호방법이 효율적임을 보였다.