• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 Proceedings of the Korea Automatic Control Conference, 11th (KACC); Pohang, Korea; 24-26 Oct. 1996
• /
• pp.173-176
• /
• 1996

This paper deals with the problem of designing an adaptive regulator in order to improve transient performance in time-response when the linear state-space model of the plant contains unknown parameters which vary within prescribed bounds. The whole possible parameter space is divided into some subspaces and multiple models and controllers are established from the view point that each controller gives satisfactory transient behavior for systems corresponding to each parameter subspace. Based on time-response and an associated cost function, an appropriate controller is selected on-line out of multiple controllers.

• 제어로봇시스템학회논문지
• /
• 제2권2호
• /
• pp.67-72
• /
• 1996

This paper presents a parameter adaptive control law that stabilizes and asymptotically regulates any single-input, linear time-invariant, controllable and observable, discrete-time system when only the upper bounds on the order of the system is given. The algorithm presented in this paper comprises basically a nonlinear state feedback law which is represented by functions of the state vector in the controllable subspace of the model, an adaptive identifier of plant parameters which uses inputs and outputs of a certain length, and an adaptive law for feedback gain adjustment. A new psedu-inverse algorithm is used for the adaptive feedback gain adjustment rather than a least-square algorithm. The proposed feedback law results in not only uniform boundedness of the state vector to zero. The superiority of the proposed algorithm over other algorithms is shown through some examples.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.2566-2569
• /
• 2003

An alternative optimal control law formulation is introduced and compared with two different control law, a conventional linear quadratic regulator and the control law based on game theory. This formulation eliminates the undesired modes of the system by the projection of a controller onto the subspace orthogonal to that of the bad modes. In conventional LQR control law, the control performance can be improved only by using proper weighting matrices in performance index, normally, with high cost. The control law formulation by game theory may provide various ways to obtain the desired performance. The control law modified by the elimination of bad modes provides efficient ways to get rid of an undesired performance since it eliminates the exact modes which cause the bad control performance.

• 충청수학회지
• /
• 제31권3호
• /
• pp.281-285
• /
• 2018

Let $S_k(N)$ be the space of cusp forms of weight k for ${\Gamma}_0(N)$. We show that $S_k(N)$ is the direct sum of subspaces $S_k^+(N)$ and $S_k^-(N)$. Where $S_k^+(N)$ is the vector space of cusp forms of weight k for the group ${\Gamma}_0^+(N)$ generated by ${\Gamma}_0(N)$ and $W_N$ and $S_k^-(N)$ is the subspace consisting of elements f in $S_k(N)$ satisfying $f{\mid}_kW_N=-f$. We find generators spanning the space $S_k^-(N)$ from $Poincar{\acute{e}}$ series and give all linear relations among such generators.

• 호남수학학술지
• /
• 제36권1호
• /
• pp.29-32
• /
• 2014

Given operators X and Y acting on a separable Hilbert space $\mathcal{H}$, an interpolating operator is a bounded operator A such that AX = Y. In this article, we investigate self-adjoint interpolation problems for operators in a tridiagonal algebra : Let $\mathcal{L}$ be a subspace lattice acting on a separable complex Hilbert space $\mathcal{H}$ and let X = ($x_{ij}$) and Y = ($y_{ij}$) be operators acting on $\mathcal{H}$. Then the following are equivalent: (1) There exists a self-adjoint operator A = ($a_{ij}$) in $Alg{\mathcal{L}}$ such that AX = Y. (2) There is a bounded real sequence {${\alpha}_n$} such that $y_{ij}={\alpha}_ix_{ij}$ for $i,j{\in}\mathbb{N}$.

• Journal of Electrical Engineering and Technology
• /
• 제12권1호
• /
• pp.402-410
• /
• 2017

For many years, researchers in face description area have been representing and recognizing faces based on different methods that include subspace discriminant analysis, statistical learning and non-statistics based approach etc. But still automatic face recognition remains an interesting but challenging problem. This paper presents a novel and efficient face image representation method based on Optimized Local Ternary Pattern (OLTP) texture features. The face image is divided into several regions from which the OLTP texture feature distributions are extracted and concatenated into a feature vector that can act as face descriptor. The recognition is performed using nearest neighbor classification method with Chi-square distance as a similarity measure. Extensive experimental results on Yale B, ORL and AR face databases show that OLTP consistently performs much better than other well recognized texture models for face recognition.

• Journal of Information Processing Systems
• /
• 제11권2호
• /
• pp.165-172
• /
• 2015

The inactive student rate is becoming a major problem in most open universities worldwide. In Indonesia, roughly 36% of students were found to be inactive, in 2005. Data mining had been successfully employed to solve problems in many domains, such as for educational purposes. We are proposing a method for preventing inactive students by mining knowledge from student record systems with several state of the art ensemble methods, such as Bagging, AdaBoost, Random Subspace, Random Forest, and Rotation Forest. The most influential attributes, as well as demographic attributes (marital status and employment), were successfully obtained which were affecting student of being inactive. The complexity and accuracy of classification techniques were also compared and the experimental results show that Rotation Forest, with decision tree as the base-classifier, denotes the best performance compared to other classifiers.

• 전자공학회논문지B
• /
• 제33B권4호
• /
• pp.164-173
• /
• 1996

This paper presents an alternative technique for DOA (direction-of-arrival) estimation. For generating a weight vector orthogonal to the signal subspace, a modified version of MES (minimum eigenvalue searching ) method is introduced. The performance of the proposed technique is compared to that of the conventional ED (eigen decomposition) method in terms of angle resolution for a number of snapshots during agiven observation period as well as various SNR's. In addition, the superiority of the suggested technique is shown, by analyzing the required computational load of the proposed MES and conventional ED method. A novel procedure of simplifying the MES proposed in [1] is presented on that purpose. Another advnatage of the proposed technique is that it is performed independently of the detection of the number of signal components, which makes it possible to estimate the DOA's of clusters consisting of infinite number of inseparable signal components.

• 한국전산응용수학회:학술대회논문집
• /
• 한국전산응용수학회 2003년도 KSCAM 학술발표회 프로그램 및 초록집
• /
• pp.4.1-4
• /
• 2003

Given operators X and Y acting on a Hilbert space H, an interpolating operator is a bounded operator A such that AX= Y. An interpolating operator for n-operators satisfies the equation AXi= Yi, for i = 1,2,...,n, In this article, we showed the following : Let H be a Hilbert space and let L be a subspace lattice on H. Let X and Y be operators acting on H. Assume that rangeX is dense in H. Then the following statements are equivalent : (1) There exists an operator A in AlgL such that AX = Y, A$\^$*/=A and every E in L reduces A. (2) sup｛(equation omitted) : n $\in$ N f$\sub$I/ $\in$ H and E$\sub$I/ $\in$ L｝<$\infty$ and = for all E in L and all f, g in H.

• 한국산업융합학회 논문집
• /
• 제6권3호
• /
• pp.177-183
• /
• 2003

Recently, Ryu et al. proposed a multiple target DOA tracking algorithm, which has good features that it has no data association problem and simple structure. But its performance is seriously degraded in the low signal-to-noise ratio. In this paper, a measurement fusion method is presented based on ML(Maximum Likelihood), and the new DOA tracking algorithm is proposed by incorporating the presented fusion method into Ryu's algorithm. The proposed algorithm has a better tracking performance than that of Ryu's algorithm, and it sustains the good features of Ryu's algorithm.