• 전자공학회논문지B
• /
• 제31B권5호
• /
• pp.88-94
• /
• 1994

Inverse Chebyshev function can realize the same order of Chebyshev function nuder the same specification. In general, inverse Chebyshev function has the preferable characteristics in terms of the delay characteristics and the time-domain performances compare with Chebyshev function. However, for the even order n, inverse Chebyshev function does not realize in the doubly-terminated ladder network which has preferable sensitivity characteristics because of the finite value at ${\omega}={\infty}$. In this paper, the modified inverse Chebyshev function with $\mid$H($j^{\infty}$$\mid$=0 s proposed to realize the passive doubly-terminated ladder network for the n even or odd. The modified inverse Chebyshev function characteristics ars studied in the frequency and time domain, and then, realize the passive doubly-terminated ladder network.

• 대한수학회논문집
• /
• 제23권1호
• /
• pp.29-40
• /
• 2008

Here, some classes of regular order semigroups are discussed. We shall consider that the problems of the existences of (multiplicative) inverse $^{\delta}po$-transversals for such classes of po-semigroups and obtain the following main results: (1) Giving the equivalent conditions of the existence of inverse $^{\delta}po$-transversals for regular order semigroups (2) showing the order orthodox semigroups with biggest inverses have necessarily a weakly multiplicative inverse $^{\delta}po$-transversal. (3) If the Green's relation $\cal{R}$ and $\cal{L}$ are strongly regular (see. sec.1), then any principally ordered regular semigroup (resp. ordered regular semigroup with biggest inverses) has necessarily a multiplicative inverse $^{\delta}po$-transversal. (4) Giving the structure theorem of principally ordered semigroups (resp. ordered regular semigroups with biggest inverses) on which $\cal{R}$ and $\cal{L}$ are strongly regular.

• Journal of the Korean Data and Information Science Society
• /
• 제15권4호
• /
• pp.981-992
• /
• 2004

In this paper, we develop the noninformative priors for the common scale parameter in the inverse gaussian distributions. We developed the first and second order matching priors. Next we revealed that the second order matching prior satisfies a HPD matching criterion. Also we showed that the second order matching prior matches alternative coverage probabilities up to the second order. It turns out that the one-at-a-time reference prior satisfies a second order matching criterion. Some simulation study is performed.

• 대한수학회보
• /
• 제51권3호
• /
• pp.765-771
• /
• 2014

Necessary and sufficient conditions for the existence of the group inverse of an anti-triangular block matrix in Banach algebras are presented. Using these results, we give the formulae for the generalized Drazin inverse of a block matrix.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 A
• /
• pp.239-242
• /
• 2003

In this paper, we propose how to determine the optimal camera position using inverse kinematics of virtual link model and manipulability measure. We model the variable distance and viewing direction between a target object and a camera position as a virtual link. And, by using inverse kinematics of virtual link model, we find out regions that satisfy the direction and distance constraints for the observation of target object. The solution of inverse kinematics of virtual link model simultaneously satisfies camera accessibility as well as a direction and distance constraints. And we use a manipulability measure of active camera system in order to determine an optimal camera position among the multiple solutions of inverse kinematics. By using the inverse kinematics of virtual link model and manipulability measure, the optimal camera position in order to observe a target object can be determined easily and rapidly.

• 한국통신학회논문지
• /
• 제13권4호
• /
• pp.322-331
• /
• 1988

본 논문에서는 고차 inverse Chebyshev 함수를 이용하여 능동 RC필터로 설계할 때 최대 동적범위를 갖고, 감도가 낮은 종속연결법으로 실현하는 방법을 제시하였다. 이때, 최대 동적범위를 만족시키도록 평탄행렬에 의한 최적 극점-영점 결합과 종속 연결순서 및 이득 분배에 대한 알고리즘을 제시하였으며, 능동 RC 회로의 단점인 감도 문제를 향상시키기 위하여 부 궤환을 갖는 2차 블록과 1차 블록을 설계하였다. 제시된 설계 방법을 이용하여 규준화된 7차 inverse Chebyshev함수의 능동 RC저역통과 필터를 설계한 결과 주어진 설계 명세조건과 일치함을 보였다.

• 제어로봇시스템학회논문지
• /
• 제21권5호
• /
• pp.434-441
• /
• 2015

In this paper, we propose an inverse optimal distributed protocol for the formation and velocity consensus of nonholonomic mobile robots. The communication among mobile robots is described by a simple undirected graph, and the mobile robots' kinematics are considered. The group of mobile robots driven by the proposed protocols asymptotically achieves the desired formation and group velocity in an inverse optimal fashion. The design of the protocols is based on dynamic feedback linearization and the proposed linear quadratic (LQ) inverse optimal second-order consensus protocol. A numerical simulation is given to verify the effectiveness of the proposed scheme.

• 한국CDE학회논문집
• /
• 제13권2호
• /
• pp.153-161
• /
• 2008

This paper proposes an efficient algorithm for deriving inverse kinematics equation of 5-axis machine. Because the joint order and direction of 5-axis machine are different for each type of machine, each type of machine needs its own inverse kinematics equation for post-processing of NC data. Also derived inverse kinematics equation may cause problems of indeterminate and inconsistent solution. In order to resolve these problems, we have developed a generic method to derive direct kinematics equation by considering orthogonal joints of 5-axis machines. Using this method, we also have proposed a general algorithm for deriving inverse kinematics equation for various types of 5-axis machines.

• Journal of information and communication convergence engineering
• /
• 제8권3호
• /
• pp.317-322
• /
• 2010

This paper presents an algorithm generating inverse element over finite fields GF($3^m$), and constructing method of inverse element generator based on inverse element generating algorithm. An inverse computing method of an element over GF($3^m$) which corresponds to a polynomial over GF($3^m$) with order less than equal to m-1. Here, the computation is based on multiplication, square and cube method derived from the mathematics properties over finite fields.

• Journal of electromagnetic engineering and science
• /
• 제6권4호
• /
• pp.244-252
• /
• 2006

A block Jacket transform and. its block inverse Jacket transformn have recently been reported in the paper 'Fast block inverse Jacket transform'. But the multiplication of the block Jacket transform and the corresponding block inverse Jacket transform is not equal to the identity transform, which does not conform to the mathematical rule. In this paper, new binary block Jacket transforms and the corresponding binary block inverse Jacket transforms of orders $N=2^k,\;3^k\;and\;5^k$ for integer values k are proposed and the mathematical proofs are also presented. With the aid of the Kronecker product of the lower order Jacket matrix and the identity matrix, the fast algorithms for realizing these transforms are obtained. Due to the simple inverse, fast algorithm and prime based $P^k$ order of proposed binary block inverse Jacket transform, it can be applied in communications such as space time block code design, signal processing, LDPC coding and information theory. Application of circular permutation matrix(CPM) binary low density quasi block Jacket matrix is also introduced in this paper which is useful in coding theory.