The detection of motion from image sequences is usually performed using a time differential method or calculating the difference from a background reference image. These algorithms often perform poorly in the presence of temporal clutter. This paper describes a technique that measures the irregularity of an intensity sequence to detect motion. We demonstrate that static background, interesting ...

We investigate the higher-dimensional amenability of tensor products A ⊗̂ B of Banach algebras A and B. We prove that the weak bidimension dbw of the tensor product A⊗̂B of Banach algebras A and B with bounded approximate identities satisfies dbwA ⊗̂ B = dbwA+ dbwB. We show that it cannot be extended to arbitrary Banach algebras. For example, for a biflat Banach algebra A which has a left or right...

Let Ax = b be a large, sparse, nonsymmetric system of linear equations. A new sparse approximate inverse preconditioning technique for such a class of systems is proposed. We show how the matrix A−1 0 −A−1, where A0 is a nonsingular matrix whose inverse is known or easy to compute, can be factorized in the form UΩV T using the Sherman–Morrison formula. When this factorization process is done in...

In this paper, we study approximate identity properties, some propositions from Baker, Dales, Lau in general situations and establish relationships between the topological centers of module actions factorization properties with results group algebras. We consider under which sufficient necessary conditions Banach algebra $A\widehat{\otimes}B$ is Arens regular.

in this paper we get some results and applications for duals and approximate duals of g-frames in hilbert spaces. in particular, we consider the stability of duals and approximate duals under bounded operators and we study duals and approximate duals of g-frames in the direct sum of hilbert spaces. we also obtain some results for perturbations of approximate duals.

Approximate computing is a research area where we investigate a wide spectrum of techniques to trade off computation accuracy for better performance or energy consumption. In this work, we provide a general introduction to approximate computing. Also, we propose a taxonomy to make it easier to discuss the merits of different approximation techniques. Our taxonomy emphasizes the expected cost of...

I calculate the top quark forward-backward asymmetry at the Tevatron in both the laboratory frame and the tt̄ rest frame. I show that soft-gluon corrections are the dominant contribution to the asymmetry and closely approximate exact results through next-tonext-to-leading order (NNLO). I present a calculation of the asymmetry including approximate next-to-next-to-next-to-leading-order (N3LO) sof...

This paper presents an application of Approximate Entropy (ApEn) and Sample Entropy (SampEn) in the analysis of heart rhythm, blood pressure and stroke volume for the diagnosis of vasovagal syndrome. The analyzed biosignals were recorded during positive passive tilt tests—HUTT(+). Signal changes and their entropy were compared in three main phases of the test: supine position, tilt, and pre-syn...

The performance of a type of fuzzy sliding mode control is researched by considering the nonlinear characteristic of a missile-target interception problem to obtain a robust interception process. The variable boundary layer by using fuzzy logic is proposed to reduce the chattering around the switching surface then is applied to the interception model which was derived. The performances of the s...