The study of bilinear operators associated to a class of non-smooth symbols can be reduced to the study of certain special bilinear cone operators to which a time frequency analysis using smooth wave-packets is performed. In this paper we prove that when smooth wave-packets are replaced by Walsh wave-packets the corresponding discrete Walsh model for the cone operators is not only Lp-bounded, a...

We consider model order reduction of bilinear descriptor systems using an interpolatory projection framework. Such nonlinear descriptor systems can be represented by a series of generalized linear descriptor systems (also called subsystems) by utilizing the Volterra-Wiener approach [22]. Standard projection techniques for bilinear systems utilize the generalized transfer function of these subsy...

Motivated by the sequence form formulation of Koller et al. [19], this paper defines bilinear games, and proposes efficient algorithms for its rank based subclasses. Bilinear games are two-player non-cooperative single-shot games with compact polytopal strategy sets and two payoff matrices (A, B) such that when (x, y) is the played strategy profile, the payoffs of the players are xTAy and xTBy ...

In this paper, we first prove some local estimates for bilinear operators (closely related to the bilinear Hilbert transform and similar singular operators) with truncated symbol. Such estimates, in accordance with the Heisenberg uncertainty principle correspond to a description of “off-diagonal” decay. In addition they allow us to prove global continuities in Lebesgue spaces for bilinear opera...

The geometry of Rn is controlled algebraically by the dot product. We will abstract the dot product on Rn to a bilinear form on a vector space and study algebraic and geometric notions related to bilinear forms (especially the concept of orthogonality in all its manifestations: orthogonal vectors, orthogonal subspaces, and orthogonal bases). Section 1 defines a bilinear form on a vector space a...

This paper describes a technique for generating disjointly constrained bilinear programming test problems with known solutions and properties. The proposed construction technique applies a simple random tranformation of variables to a separable bilinear programming problem that is constructed by combining disjoint low-dimensional bilinear programs.

In this paper, we study (3+1)-dimensional Soliton equation. We employ the Hirota’s bilinear method to obtain the bilinear form of (3+1)-dimensional Soliton equation. Then by the idea of extended three-wave method, some exact soliton solutions including breather type solutions are presented. Keywords—three-wave method; (3+1)-dimensional Soliton equation; Hirota’s bilinear form.

In this paper, we first prove some local estimates for bilinear operators (closely related to the bilinear Hilbert transform and similar singular operators) with truncated symbol. Such estimates, in accordance with the Heisenberg uncertainty principle correspond to a description of “off-diagonal” decay. In addition they allow us to prove global continuities in Lebesgue spaces for bilinear opera...

Predicate encryption is a new type of public key encryption that enables searches on encrypted data. By using predicate encryption, we can search keywords or attributes on encrypted data without decrypting ciphertexts. Hidden vector encryption (HVE) is a special kind of predicate encryption. HVE supports the evaluation of conjunctive equality, comparison, and subset operations between attribute...

We propose a new order preserving bilinear framework that exploits low-resolution video for person detection in a multi-modal setting using deep neural networks. In this setting cameras are strategically placed such that less robust sensors, e.g. geophones that monitor seismic activity, are located within the field of views (FOVs) of cameras. The primary challenge is being able to leverage suff...