نتایج جستجو برای: filtering theory

تعداد نتایج: 840623  

2004
Haiqing Wei

In this paper, a general model of wireless channels is established based on the physics of wave propagation. Then the problems of inverse scattering and channel prediction are formulated as nonlinear filtering problems. The solutions to the nonlinear filtering problems are given in the form of dynamic evolution equations of the estimated quantities. Finally, examples are provided to illustrate ...

Journal: :SIAM Journal on Optimization 2000
T. D. Choi C. T. Kelley

In this note we show how the implicit filtering algorithm can be coupled with the BFGS quasi-Newton update to obtain a superlinearly convergent iteration if the noise in the objective function decays sufficiently rapidly as the optimal point is approached. We show how known theory for the noise-free case can be extended and thereby provide a partial explanation for the good performance of quasi...

2008
Qinghua Li Hongjun Wang Jun Du Xuezhen Liu Fei Lin

Centralized nonlinear fusion filter design problem is to construct an asymptotically stable observer that leads to a stable estimation error process whose L2 gain with respect to disturbance signal is less than a prescribed level for state estimation of the multi-sensor fusion system. This paper tries to resolve the problem in using of H∞ filtering theory and LMI methods under certain condition...

2004
Ju H. Park O. Kwon S. Lee

This article deals with the robust H1 filtering problem for neutral delay differential systems with parametric uncertainties. A linear matrix inequality (LMI) approach is proposed to design the robust H1 filter such that the filtering system remains asymptotically stable and the bound ofH1 norm is minimized. The Lyapunov stability theory is used for analysis of the system. A numerical example i...

Journal: :Computer Science and Information Systems 2022

In the present work, we inquire use of game theoretic techniques for development recommender systems. Initially, interaction two aspects systems, query reformulation and relevance estimation, is modelled as a cooperative where players have common utility, to supply optimal recommendations, which they try maximize. Based on this modelling, three basic recommendation methods are developed, namely...

Journal: :Automatica 2016
Supratim Ghosh Justin Ruths

A bilinear dynamical system can be used to represent the model of a network in which the state obeys linear dynamics and the input is the edge weight of certain controlled edges in the network. We present algebraic and graph-theoretic conditions for the structural controllability of a class of bilinear systems with a single control where the input matrix is rank one. Subsequently, we use these ...

2009
Gabriele Ferretti Christoffer Petersson

In this note we study the N = 1 abelian gauge theory on the world volume of a single fractional D3-brane. In the limit where gravitational interactions are not completely decoupled we find that a superpotential and a fermionic bilinear condensate are generated by a D-brane instanton effect. A related situation arises for an isolated cycle invariant under an orientifold projection, even in the a...

2008
CIPRIAN DEMETER

We investigate the Bilinear Hilbert Transform in the plane and the pointwise convergence of bilinear averages in Ergodic theory, arising from Z actions. Our techniques combine novel one and a half dimensional phase-space analysis with more standard one dimensional theory.

Journal: :CoRR 2011
Lingfei Wu Chengjun Wang

Allometric growth is found in many tagging systems online. That is, the number of new tags (T ) is a power law function of the active population (P ), or T ∼ P γ (γ 6= 1). According to previous studies, it is the heterogeneity in individual tagging behavior that gives rise to allometric growth. These studies consider the power-law distribution model with an exponent β, regarding 1/β as an index...

Journal: :IJFSA 2015
Wei Fei

The bimatrix game theory is concerned with how two players make decisions when they are faced with known exact payoffs. The aim of this paper is to develop a simple and an effective bilinear programming method for solving bimatrix games in which the payoffs are represented by intervals. Because the payoffs of the bimatrix game are intervals, the values of the bimatrix game for both players are ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید