In this paper we provide sufficient conditions for the solvability of the standard H∞suboptimal control problem for linear, time invariant, infinite-dimensional systems with finite-dimensional input and output spaces. The sufficient conditions are formulated in terms of the existence of two J-lossless factorizations. For the Wiener algebra class of the transfer functions an algorithm for solvin...

The goal of this paper is to clarify when a closed convex cone is invariant for a stochastic partial differential equation (SPDE) driven by a Wiener process and a Poisson random measure, and to provide conditions on the parameters of the SPDE, which are necessary and sufficient.

The paper presents speech enhancement scheme for suppression of different background noises. The objective of speech enhancement is to improve the quality of the processed speech. This paper also investigate the use of two different transforms for speech enhancement. Speech enhancement using wiener filtering approach is presented using transforms DFT and DCT. The type of transform shows differe...

The classical Fourier transform Fcl is an isomorphism of the Schwartz space S(Rk) onto itself. The space C∞ c (Rk) of smooth functions with compact support is dense in S(Rk), and the classical Paley-Wiener theorem characterises the image of C∞ c (R k) under Fcl as rapidly decreasing functions having an holomorphic extension to Ck of exponential type. Since Rk is self-dual, the same theorem also...

The transmission matrix, introduced by Friedland in 1957, can be used to characterize a linear, time invariant system having an emprically-determined impulse response. The Wiener-Kalman filter can be determined by Cholesky factorization of a covariance matrix formed from the transmission matrix. An analogous result is given for linear, quadratic control. The method is illustrated by several exa...

We deene a family of random dilations of the Wiener and Poisson measures, and show that they can be represented as generalised Fourier-Mehler transforms. These (not quasi invariant) transformations include transforms given e.g. by time changes on Brownian motion. The generators of one-parameter families of such transformations are computed, and the Poisson case is also considered.

Let G be a simple graph with vertex set and edge set . The function which assigns to each pair of vertices in , the length of minimal path from to , is called the distance function between two vertices. The distance function between and edge and a vertex is where for and. , . The Wiener index of a graph is denoted by and is defined by .In general this kind of index is called a topological index...