• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.225-228
• /
• 1992

The purpose of this project is the presentation of new method for selection of a scalar control of linear time-periodic system. The approach has been proposed by Radziszewski and Zaleski [4] and utilizes the quadratic form of Lyapunov function. The system under consideration is assigned either in closed-loop state or in modal variables as in Calico, Wiesel [1]. The case of scalar control is considered, the gain matrix being assumed to be at worst periodic with the system period T, each element being represented by a Fourier series. As the optimal gain matrix we consider the matrix ensuring the minimum value of the larger real part of the two Poincare exponents of the system. The method, based on two-step optimization procedure, allows to find the approximate optimal gain matrix. At present state of art determination of the gain matrix for this case has been done by systematic numerical search procedure, at each step of which the Floquet solution must be found.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1999년도 제14차 학술회의논문집
• /
• pp.83-87
• /
• 1999

The purpose of this study is to provide the new method for selection of a close to optimal scalar control of linear time-periodic system. The case of scalar control is considered, the gain matrix being assumed to be at worst periodic with the system period T. The form of gain matrix may have various kinds but must have same period, for example, one of each element being represented by Fourier series. As the optimal gain matrix I consider the matrix ensuring the minimum value of the larger real part of the Poincare exponents of the system. Finally we present a pole placement algorithm to make the given system be stable. It is possible to determine the stability of the given periodic system without get the analytic solution. The application of the method does not require the construction of the Floquet solution. At present state of determination of the gain matrix for this case will be done only by systematic numerical search procedures.

• Journal of applied mathematics & informatics
• /
• 제27권5_6호
• /
• pp.1061-1071
• /
• 2009

For real generalized reflexive matrices R, S, i.e., $R^T$ = R, $R^2$ = I, $S^T$ = S, $S^2$ = I, we say that real matrix X is (R,S)-symmetric, if RXS = X. In this paper, an iterative algorithm is proposed to solve the least-squares problem of matrix equation AXB = C with (R,S)-symmetric X. Furthermore, the optimal approximation solution to given matrix $X_0$ is also derived by this iterative algorithm. Finally, given numerical example and its convergent curve show that this method is feasible and efficient.

• 전력전자학회:학술대회논문집
• /
• 전력전자학회 2010년도 하계학술대회 논문집
• /
• pp.21-22
• /
• 2010

Matrix converter is direct power conversion system. Matrix converter has many merits that possible bidirectional power flow, input power factor own control and system without DC-link. But matrix converter has some demerits that need many switching devices and switching loss. This paper suggest optimal matrix converter control scheme for improvement for switching loss part. Proposed control scheme verified that 10% improvement in efficiency, input current's harmonic loss and output voltage's EMI improvement.

• 한국통신학회논문지
• /
• 제19권6호
• /
• pp.1095-1106
• /
• 1994

본 논문에서는 최소자승오차법(LMSE, least mean square error)을 이용하여 function processing(FP) 형태학 필터를 최적화하는 알고리즘을 제안한다. Erosion이나 dilation 연산들은 원하는 신호와 실제 필터의 출력 신호 사이의 평균자승오차(MSE, mean square error)를 최소화하는 농담(農談) 구조요소(GSE. grayscale structuring element)를 결정함으로써 최적화 된다. 본 논문에서는 LMS 트레이닝 알고리즘을 형태학 필터의 최적화에 적용하기 위하여 스텝 사이즈 매개변수 n가 만족해야 하는 조건을 보이고, 이를 이용하여 erosion이나 dilation 형태학 필터들의 최적 GSE를 결정할 수 있음을 보였다. 또한, 본 논문에서는 행렬을 사용하여 복합 형상한 연산들을 소역 행열 연산자로 새롭게 정의하고, 이소역 연산들에 LMS 알고리즘과 back-propagation 알고리즘을 적용하여 복합 형태학 필터들을 최적화할 수 있음을 보였다. 실험 부분에서는 제안된 최적 형상학 필터들을 2-D 영상에 적용한 결과를 보였다.

• ETRI Journal
• /
• 제30권2호
• /
• pp.326-334
• /
• 2008

This paper proposes a method for generating a basis translation matrix between isomorphic extension fields. To generate a basis translation matrix, we need the equality correspondence of a basis between the isomorphic extension fields. Consider an extension field $F_{p^m}$ where p is characteristic. As a brute force method, when $p^m$ is small, we can check the equality correspondence by using the minimal polynomial of a basis element; however, when $p^m$ is large, it becomes too difficult. The proposed methods are based on the fact that Type I and Type II optimal normal bases (ONBs) can be easily identified in each isomorphic extension field. The proposed methods efficiently use Type I and Type II ONBs and can generate a pair of basis translation matrices within 15 ms on Pentium 4 (3.6 GHz) when $mlog_2p$ = 160.

• 한국멀티미디어학회논문지
• /
• 제20권2호
• /
• pp.363-370
• /
• 2017

Data assimilation is an initializing method for air quality forecasting such as PM10. It is very important to enhance the forecasting accuracy. Optimal interpolation is one of the data assimilation techniques. It is very effective and widely used in air quality forecasting fields. The technique, however, requires too much memory space and long execution time. It makes the PM10 air quality forecasting difficult in real time. We propose a fast optimal interpolation data assimilation method for PM10 air quality forecasting using a new kernel tridiagonal sparse matrix and CUDA massively parallel processing architecture. Experimental results show the proposed method is 5~56 times faster than conventional ones.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 C
• /
• pp.1195-1198
• /
• 1999

This paper presents optimal placement of minimal set of phasor measurement units(PMU's) and observability of measurement system with PMU. By using the incidence matrix symbolic method which directly assigns measurement and pseudo-measurement to incidence matrix, it is much simpler and easier to analyze observability. The optimal PMU set is found through the simulated-annealing(SA) and the direct combinational method. The cooling schedule parameter which is suitable to the property of problem to solve is specified and optimal placement is proven by presented direct combinational method. Search spaces are limited within reasonable feasible solution region to reduce a unnecessary one in the SA implementation based on global search. The proposed method presents to save CPU time and estimate state vectors based on optimal PMU set.

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

This paper presents a new algorithm for hierarchical optimal control of nonlinear systems. The proposed method is simple because the solutions are obtained by only exchanging informations of coefficient vector based on interaction prediction principle and FWT(fast Walsh transform) in upper and lower level. Since we solve two point boundary problem with Picard's iterative method and the backward integral operational matrix of Walsh function to obtain the optimal vector of each independent subsystem, the algorithm is simple and its operation is fast without inverse matrix and kronecker product operation. In simulation, the proposed algorithm's usefulness is proved by comparison with the global optimal control methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권9호
• /
• pp.4603-4624
• /
• 2016

In this paper, a new reversible watermarking algorithm with adaptive embedding threshold matrix is proposed. Firstly, to avoid the overflow and underflow, two flexible thresholds, TL and TR, are applied to preprocess the image histogram with least histogram shift cost. Secondly, for achieving an optimal or near optimal tradeoff between the embedding capacity and imperceptibility, the embedding threshold matrix, composed of the embedding thresholds of all blocks, is determined adaptively by the combination between the composite chaos and the average energy of Integer Wavelet Transform (IWT) block. As a non-liner system with good randomness, the composite chaos is suitable to search the optimal embedding thresholds. Meanwhile, the average energy of IWT block is calculated to adjust the block embedding capacity, and more data are embedded into those IWT blocks with larger average energy. The experimental results demonstrate that compared with the state-of-the-art reversible watermarking schemes, the proposed scheme has better performance for the tradeoff between the embedding capacity and imperceptibility.