In this paper we review two recently suggested projection techniques for model order reduction of bilinear systems. The first one is computationally more attractive, but so far it was assumed that this method does not yield a moment-matching approximation. Here we show that the reduced-order models computed by both of the two projection techniques match multimoments of the bilinear system. This...

In this paper, we propose a new model-order reduction technique for linear dynamic systems. The idea behind this technique is to transform the dynamic system function from the s-domain into the z-domain via the bilinear transformation, then use Prony’s [1, 2] or Shank’s [3] least-squares approximation methods instead of the commonly employed Padé approximation method, and finally transform the ...

A Krylov subspace based projection method is presented for model reduction of large scale bilinear systems. A reduced bilinear system is constructed in such a way that it matches a desired number of moments of multivariable transfer functions corresponding to the kernels of Volterra series representation of the original system. Applications to the simulation of dynamical responses of a nonlinea...

Bilinear groups are often used to create Attribute-Based Encryption (ABE) algorithms. In our proposal, a Multiple-Authorities Key-Policy Attribute-Based Encryption scheme is constructed in which the authorities collaborate to achieve shorter keys and parameters, enhancing the efficiency of encryption and decryption. We prove our system secure under an original variation of the bilinear DiffieHe...

We present a system for haptically rendering large height field datasets. Inasmuch as, height fields are naturally mapped to piecewise bilinear patches. We develop algorithms for intersection, penetration depth, and closest point tracking using bilinear patches. In contrast to many common haptic rendering schemes for polygonal models, this approach does not require preprocessing or additional s...

The problem of identifying a linear time invariant system with bilinear dependence on two unknown parameters is considered. An algorithm which , uses measurements of the input and output and knowledge of the polynomial coefficients of the bilinear combinations of the unknown parameters is described. Persistence of excitation conditions an the input for computability of the algorithm are derived...

The general solution is found to a bilinear reduction of the higher order nonlinear Schrödinger equation. Except for the previously known special cases having multisoliton solutions, the solution has the form of a single envelope solitary wave or wave train for all other values of the parameters. We conjecture that the generic solution is limited to such a narrow class of functions because the ...

where umm, wmax are given real numbers. Such a control is further denoted as an admissible one. Finally, x e R" is the vector of state variables and x0 e R" is the given initial state of the system. More general forms of bilinear systems are described in [3]. Examples of practical application of bilinear systems are presented in [3], [4], [5]. In this paper special representation for trajectori...

In this paper, we introduce a general paradigm called identity-based extractable hash proof system (IB-EHPS), which is an extension of extractable hash proof system (EHPS) proposed by Wee (CRYPTO ’10). We show how to construct identity-based key encapsulation mechanism (IB-KEM) from IB-EHPS in a simple and modular fashion. Our construction provides a generic method of building and interpreting ...

In this paper we construct infinite families of non-linear maximum rank distance codes by using the setting of bilinear forms of a finite vector space. We also give a geometric description of such codes by using the cyclic model for the field reduction of finite geometries and we show that these families contain the non-linear maximum rank distance codes recently provided by Cossidente, Marino ...