• Communications of the Korean Mathematical Society
• /
• v.26 no.4
• /
• pp.611-622
• /
• 2011

The present paper deals with generalization of several families of bilinear and bilateral generating functions for the heat type polynomials suggested by Jacobi polynomials with different argument.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.227-230
• /
• 1996

The paper highlights the need for cautious least squares estimation when dealing with industrial applications of bilinear self-tuning control and indicates in qualitative terms the benefits of the approach over linear self-tuning control schemes. The cautious least squares algorithm is described and the use of cautious self-tuning in the context of both commissioning and implementation discussed.

• Journal of KSNVE
• /
• v.7 no.1
• /
• pp.135-142
• /
• 1997

This paper presents a digital modeling technique of the distributed system. The basic idea of the proposed technique is to discretize a continuous system with respect to the spatial coordinates using bilinear method. The response of the discretized system is analyzed by Laplace transform and z-transform. The computational results in torsional shaft and Timoshenko beam using the proposed technique are compared with the exact solutions and the results of finite element method.

• Proceedings of the KIEE Conference
• /
• 1999.11c
• /
• pp.591-593
• /
• 1999

The finite time optimum regulation problem of a discrete time bilinear system with a quadratic performance criterion is obtained in terms of a sequence discrete algebraic Lyapunov equations. Our new method is based on the successive approximations. This algorithm saves the computation time to solve the optimal problem, and the design procedure is illustrated for an example.

• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• pp.829-831
• /
• 1999

This paper considers the problem of identifying the time-varying parameters of Bilinear systems. The Parameters, in this paper, are identified by using the EBPOMs (Extended Block Pulse Operational Matrices) which can reduce the burden of operation and the volume of error caused by matrices multiplication

• Proceedings of the KIEE Conference
• /
• 1999.07b
• /
• pp.826-828
• /
• 1999

This paper considers the problem of identifying the time-varying parameters of Bilinear systems. The Parameters, in this paper, are identified by using the EBPOMs (Extended Block Pulse Operational Matrices) which can reduce the burden of operation and the volume of error caused by matrices multiplication

• Journal of the Chungcheong Mathematical Society
• /
• v.28 no.2
• /
• pp.307-310
• /
• 2015

Let H be a color Poisson bialgebra. Here we find a canonical nondegenerate bilinear form $\mathfrak{g}(H){\times}\mathfrak{m/m^2}$, where $\mathfrak{g}(H)$ and $\mathfrak{m/m^2}$ are certain color Lie algebras induced by H.

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.847-858
• /
• 2011

We make use of the simplified Hirota's bilinear method with computer symbolic computation to study a variety of coupled potential KdV (pKdV) equations. Each coupled equation is completely integrable and gives multiple soliton solutions and multiple singular soliton solutions. The phase shifts for all coupled pKdV equations are identical whereas the coefficients of the obtained solitons are not identical. The four coupled pKdV equations are resonance free.

• Journal of the Korean Statistical Society
• /
• v.21 no.1
• /
• pp.47-58
• /
• 1992

The autocorrelation function structures of bilinear time series model BL(p, q, r, s), $r \geq s$ are obtained and shown to be analogous to those of ARMA(p, l), l=max(q, s). Simulation studies are performed to investigate the adequacy of Akaike information criteria for identification between ARMA(p, l) and BL(p, q, r, s) models and for determination of orders of BL(p, q, r, s) models. It is suggested that the model of having minimum Akaike information criteria is selected for a suitable model.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.227-230
• /
• 2002

In this paper, we propose an algorithm to decode Data Matrix two dimensional barcode symbology. We employ hough transform and bilinear image warping to extract the barcode region from the image scanned using a CMOS digital camera. The location of barcode can be found by applying Hough transform. However, barcode image should be warped due to the nonlinearity of lens and the viewing angle of camera. In this paper, bilinear warping transform is adopted to wa게 and align the barcode region of the scanned image. Codeword can be detected from the aligned barcode region.