• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.10
• /
• pp.1326-1337
• /
• 1995

In this paper, we transformed the bilinear filter into an equivalent linear multichannel filter and derived QR decomposition based recursive least squares algorithms for bilinear lattice filters. We also defined order update relation of the forward and the backward input vectors by using the channel decomposition. The forward and the backward data matrices were defined by using the forward and the backward input vectors and orthogonalized with the QR decomposition. we can obtain the lattice equations of the bilinear filters by using the channel decomposition. we can be derived the lattice equations of the bilinear filters using this decomposition process which are the same as the lattice equations derived by Baik, we can use the coefficient transformation algorithm proposed by Baik. We derived the equation error and the output error algorithm of the QRD based RLS bilinear lattice algorithm. Also, we evaluated the performance of the proposed algorithms through the system identification of the bilinear system.

• Journal of Power System Engineering
• /
• v.15 no.4
• /
• pp.65-74
• /
• 2011

이 논문은 비선형 시스템에 대해 bilinear 강인제어기를 설계하는 새로운 방법을 제시한다. 이 설계방법은 골칫거리인 비선형 영향을 나타내는 무거운 질량을 가지고 진동하는 시스템을 제어하기 위한 새로운 대안이고 진전된 방법이다. 이 설계 과정에, hydrostatic 구동기로 구동되는 킬(용골)이 주어진다. 첫 단계로 킬은 물리적으로 여러 한정된 질량으로 모델화된다. 물리적 모델에 근거한 수학적인 모델을 유도하는 방법은 해밀턴 원리를 적용한 유한요소법을 사용하였다. 즉, 수학적 모델은 여러 서브시스템으로 구성된다. 이것은 주어진 물리적인 시스템에 대해 기준이 되는 시스템이다. 회전하는 구동기에 대한 물리적 모델에 근거하여, 과도 거동은 구동기의 베어링에서 측정되는 운동 현상으로부터 유도된다. 물리적인 시스템은 bilinear 시스템으로 구성하였다. 이 시스템에 근거하여, 요트 킬의 거동을 제어하도록 bilinear 관측기를 설계한다. 구동기의 속도, 토크, 밸브에서의 유량 등이 관측기를 구성하는데 필요한 데이터들이다. 시뮬레이션 결과에 의하면 비선형성에 대한 추정과 보상을 통하여 무거운 질량을 갖는 회전축에 대한 위치와 힘을 제어하는 설계에 유용한 접근법임이 증명되었다.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.2
• /
• pp.171-177
• /
• 2003

In this paper, we investigate a robust $H_{\infty}$ state feedback control technique for continuous time bilinear systems with an additive disturbance input. The nonlinear robust $H_{\infty}$control for bilinear systems requires a solution to the state dependent algebraic Riccati equation (SDARE). We present a new robust $H_{\infty}$control technique based on the successive approximation method for solving the SDARE by converting bilinear systems into time-varying linear systems. The proposed control method guarantees robust stability for closed loop bilinear systems. The proposed algorithm is verified by numerical examples.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.3
• /
• pp.10-21
• /
• 1993

Bilinear models are attractive for adaptive filtering applications because they can approximate a large class of nonlinear systems adequately, and usually with considerable parsimony in the number of coefficients compared with Volterra models. But bilinear filters have stability problem because they involve nonlinear feedback. Adaptive algorithms for bilinear filters may be diverge and have poor convergence characteristics when input signal is large In this paper, necessary and sufficient condition for mean square stability of bilinear filters for given input signal statistics is briefly described, and the method obtaining the input bound to guarantee the stability of bilinear filters is presented. New RPEM algorithm, which does not diverge and has the superior convergence characteristics compared with the conventional RPEM algorithm when input signal is large, is derived by applying the time-varying Kalman filtering concept to the conventional RPEM algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3648-3663
• /
• 2017

With the development of cloud computing and widespread availability of mobile devices, outsourcing computation has gotten more and more attention in cloud computing services. The computation of bilinear pairing is the most expensive operation in pair-based cryptographic schemes. Currently, most of the algorithms for outsourcing bilinear pairing have small checkability or the outsourcers need to operate expensive computations. In this paper, we propose an efficient algorithm for outsourcing bilinear pairing with two servers, where the outsourcers can detect the errors with a probability of 1 if the cloud servers are dishonest, and the outsourcers are not involved in any complex computations. Finally, the performance evaluation demonstrates that the proposed algorithm is most efficient in all of fully verifiable outsourcing algorithms for bilinear pairing.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.344-349
• /
• 1990

Under the assumption that process input/output data are sufficiently rich to allow reasonable plant identification, a long-range predictive control method for SISO bilinear plant is derived. In order to ensure offset-free behaviour of the control method, a new bilinear CARIMA model with variable dead-time is introduced. Furthermore, to extend the maximum output prediction horizon, the future predicted outputs in the bilinear term are assumed to be equal to the known future set-points. With a classical recursive adaptation algorithm, the proposed control scheme is capable of stable control of bilinear plants with variable parameters, with variable dead-time, and with a model order which changes instantaneously. Several simulation results demonstrate the characteristics of the proposed bilinear model predictive control method.

• Journal of the Korean Mathematical Society
• /
• v.43 no.2
• /
• pp.283-296
• /
• 2006

In this paper we weaken the kernel conditions of bilinear Calderon-Zygmund operators and prove boundedness on Besov spaces.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.968-988
• /
• 2010

Anonymous hierarchical identity based encryption (HIBE) is an extension of identity based encryption (IBE) that can use an arbitrary string like an e-mail address for a public key, and it additionally provide the anonymity of identity in ciphertexts. Using the anonymous HIBE schemes, it is possible to construct anonymous communication systems and public key encryption with keyword search. This paper presents an anonymous HIBE scheme with constant size ciphertexts under prime order symmetric bilinear groups, and shows that it is secure under the selective security model. Previous anonymous HIBE schemes were constructed to have linear size ciphertexts, to use composite order bilinear groups, or to use asymmetric bilinear groups that is a special type of bilinear groups. Our construction is the first efficient anonymous HIBE scheme that has constant size ciphertexts and that uses prime order symmetric bilinear groups. Compared to the previous scheme of composite order bilinear groups, ours is ten times faster. To achieve our construction, we first devise a novel cancelable random blinding technique. The random blinding property of our technique provides the anonymity of our construction, and the cancellation property of our technique enables decryption.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.449-451
• /
• 2003

In this paper, the stability problem for singular bilinear system is investigated. We present state feedback control laws for two classes of singular bilinear plants. Asymptotic stability of the closed-loop systems is derived by employing singular Lyapunov's direct method. The primary advantage of our approach lies in its simplicity. In order to verify effectiveness of the results, two numerical examples are given.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.10
• /
• pp.32-43
• /
• 1994

This paper presents new QRD-based recursive least squares algorithms for bilinear lattice filter. Bilinear recursive least square lattice algorithms are derived by using the QR decomposition for minimization covariance matrix of predication error by applying Givens rotation to the bilinear recursive least squares lattics algorithms. The proposed algorithms are applied to the bilinear system identification to evaluate the performance of algoithms. Computer simulations show that the convergence properties of the proposed algorithms are superior to that of the algorithms proposed by Baik when signal includes the measurement noise.