The Mean Square Successive Difference

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Skolem Odd Difference Mean Graphs

In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} de...

متن کامل

Mean square convergence analysis for kernel least mean square algorithm

In this paper, we study the mean square convergence of the kernel least mean square (KLMS). The fundamental energy conservation relation has been established in feature space. Starting from the energy conservation relation, we carry out the mean square convergence analysis and obtain several important theoretical results, including an upper bound on step size that guarantees the mean square con...

متن کامل

Mean Square Estimation

The problem of parameter estimation in linear model is pervasive in signal processing and communication applications. It is often common to restrict attention to linear estimators, which simplifies the implementation as well as the mathematical derivations. The simplest design scenario is when the second order statistics of the parameters to be estimated are known and it is desirable to minimiz...

متن کامل

Least Mean Square Algorithm

The Least Mean Square (LMS) algorithm, introduced by Widrow and Hoff in 1959 [12] is an adaptive algorithm, which uses a gradient-based method of steepest decent [10]. LMS algorithm uses the estimates of the gradient vector from the available data. LMS incorporates an iterative procedure that makes successive corrections to the weight vector in the direction of the negative of the gradient vect...

متن کامل

Successive cardinals with no partial square

We construct a model in which for all 1 ≤ n < ω, there is no stationary subset of אn+1 ∩ cof(אn) which carries a partial square. Let κ be an uncountable cardinal and let μ ≤ κ be regular. A set A ⊆ κ∩cof(μ) is said to carry a partial square if there exists a sequence ⟨cα : α ∈ A⟩ such that each cα is club in α with order type μ, and for all γ which is a common limit point of cα and cβ , cα ∩ γ ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Mathematical Statistics

سال: 1941

ISSN: 0003-4851

DOI: 10.1214/aoms/1177731746