• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.8
• /
• pp.822-827
• /
• 2014

This paper presents a robust observer-based output feedback control for stabilization of linear time invariant systems with polytopic uncertainties. To this end, this paper not only finds a robust observer gain but also suggests how to determine the model used in the observer, which is not obvious due to model uncertainties in the conventional observer design method. The robust observer gain and the observer model are selected in a way that the whole closed-loop is stable by solving LMIs and BMIs (Linear Matrix Inequalities and Bilinear Matrix Inequalities). A simulation example shows that the proposed robust observer-based output feedback control successfully leads to closed-loop stability.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.658-662
• /
• 2004

This paper develops a stability analysis and controller synthesis methodology for a continuous-time affine Takagi-Sugeno (T-S) fuzzy systems with parametric uncertainties. Affine T-S fuzzy system can be an advantage because it may be able to approximate nonlinear functions to high accuracy with fewer rules than the homogeneous T-S fuzzy systems with linear consequents only. The analysis is based on Lyapunov functions that are continuous and piecewise quadratic. The search for a piecewise quadratic Lyapunov function can be represented in terms of bilinear matrix inequalities (BMIs). A simulation example is given to illustrate the application of the proposed method.

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

For linear descriptor systems, we consider the $H_{INFTY}$ controller design problem via output feedback. Both static output feedback and dynamic one are discussed. First, in the case of static output feedback, we reduce our control problem to solving a bilinear matrix inequality (BMI) with respect to the controller coefficient matrix, a Lyapunov matrix and a matrix related to the descriptor matrix. Under a matching condition between the descriptor matrix and the measured output matrix (or the control input matrix), we propose setting the Lyapunov matrix in the BMI as being block diagonal appropriately so that the BMI is reduced to LMIs. For fixed-order dynamic $H_{INFTY}$ output feedback, we formulate the control problem equivalently as the one of static output feedback design, and thus the same approach can be applied.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.765-770
• /
• 2005

This paper presents a new intelligent digital redesign (IDR) method via the compensated bilinear transformation to design the digital controller such that the digital fuzzy system is equivalent to the analog fuzzy system in the sense of the state-matching. This paper especially consider a multirate control scheme with a predictive feature, where the digital control input is held constant N times between the sampling points. More precisely, the multirate control scheme is proposed that utilizes a numerical integration scheme to approximately predict the current state from the state measured at the sampling points, the delayed measurements. For this system, the IDR conditions incorporated with stabilizability in the format of the linear matrix inequalities (LMIs) are derived. The superiority of the proposed technique is convincingly visualized through a numerical example.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.16 no.1
• /
• pp.85-91
• /
• 2002

Generally when the orthogonal functions are used in system analysis, the time consuming processes of high order matrix inversion for finding the Kronecker products and the truncation errors are occurred. In this paper, a method for the system analysis of bilinear systems via fast walsh transform is devised. This method requires neither the inversion of large matrices nor the cumbersome procedures for finding Kronecker products. Thus, both the computing time and required memory size can be significantly reduced.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.3A
• /
• pp.375-382
• /
• 2000

Equalization of satellite communication using Complex-Bilinear Recurrent Neural Network(C-BLRNN) is proposed in this pater. Since the BLRNN is based on the bilinear polynomial and it has been more effectively used in modeling highly nonlinear systems with time-series characteristics than multi-layer perception type neural networks(MLPNN) , it can be applied to satellite equalizer. the proposed C-BLRNN based equalizer for M-PSK with a channel model is compared with Volterra filter Equalizer, DFE, and conventional Complex MLPNN Equlizer. The results show that the proposed C-BLRNN based equalizer gives very favorable results in both of MSE and BER criteria over other equalizers.

• Earthquakes and Structures
• /
• v.8 no.5
• /
• pp.1055-1067
• /
• 2015

A theoretical procedure to estimate spectral displacement of a hysteretic oscillator with bilinear stiffness excited by band-limited excitation is presented. The stochastic method of ground-motion simulation is combined with the random vibration theory to compute linear and nonlinear structural response. The response is obtained by computing the root-mean-square oscillator response using dissipation energy balancing by integrating over all energy levels of system weighting with the stationary probability density of the energy. The results are presented in a convenient form, and the accuracy of the procedure is assessed by comparison with results obtained with the time-domain method using the recorded data. The model shows little or no bias at the structural period of engineering interest.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.2254-2275
• /
• 2017

In this paper, we present an IND-CCA2 secure certificateless proxy re-encryption scheme in the random oracle model. A certificateless public key cryptography simplifies the certificate management in a traditional public key infrastructure and the built-in key escrow feature in an identity-based public key cryptography. Our scheme shares the merits of certificateless public key encryption cryptosystems and proxy re-encryption cryptosystems. Our certificateless proxy re-encryption scheme has several practical and useful properties - namely, multi-use, unidirectionality, non-interactivity, non-transitivity and so on. The security of our scheme bases on the standard bilinear Diffie-Hellman and the decisional Bilinear Diffie-Hellman assumptions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.7
• /
• pp.2554-2571
• /
• 2014

Certificate-based cryptography is a new cryptographic paradigm that provides an interesting balance between identity-based cryptography and traditional public key cryptography. It not only simplifies the complicated certificate management problem in traditional public key cryptography, but also eliminates the key escrow problem in identity-based cryptography. As an extension of the signcryption in certificate-based cryptography, certificate-based signcryption provides the functionalities of certificate-based encryption and certificate-based signature simultaneously. However, to the best of our knowledge, all constructions of certificate-based signcryption in the literature so far have to be based on the costly bilinear pairings. In this paper, we propose a certificate-based signcryption scheme that does not depend on the bilinear pairings. The proposed scheme is provably secure in the random oracle model. Due to avoiding the computationally-heavy paring operations, the proposed scheme significantly reduces the cost of computation and outperforms the previous certificate-based signcryption schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5553-5571
• /
• 2016

In this paper, we introduce a new concept called generalized ring signcryption (GRSC), which can achieve ring signature and ring signcryption functions with only one key pair and one algorithm. It is very useful for a system which has a large number of users, or has limited storage space, or whose function requirements may be changed later. We give a formal definition and a security model of GRSC and propose a concrete scheme based on bilinear pairings. In the random oracle model, the scheme's confidentiality can be proved under the GBDH assumption, and its unforgeability can be proved under GDH' assumption, and what is more, this scheme also allows unconditional anonymity. Compared with other identity-based ring signcryption schemes that use bilinear pairings as well, our scheme is a highly efficient one.