Moment invariants are evaluated as a feature space for pattern recognition in terms of discrimination power and noise tolerance. The notion of complex moments is introduced as a simple and straightforward way to derive moment invariants. Through this relation, properties of complex moments are used to characterize moment invariants. Aspects of information loss, suppression, and redundancy encou...

the present paper is concerned with the generalization of the holditch theorem under oneparameterhomothetic motion on lorentzian planes. in this paper, for the homothetic lorentzian motion, weexpressed the steiner formula. furthermore, we present the holditch-type theorems.

Finite type invariants of knots or links can be defined combinatorially using only link projections in S. In this setting it can be seen that every Jones-type polynomial invariant (quantum invariants) is equivalent to a sequence of finite type invariants. See [B2, BN] and references therein. Although Vassiliev’s original approach to finite type knot invariants ([V]) rests on topological foundat...

It is shown that a trivial version of polarization is sufficient to produce separating systems of polynomial invariants: if two points in the direct sum of the G–modules W and m copies of V can be separated by polynomial invariants, then they can be separated by invariants depending only on ≤ 2 dim(V ) variables of type V ; when G is reductive, invariants depending only on ≤ dim(V ) + 1 variabl...

In this paper airflow, nano-and micro-particle motions in an aerodynamic particle beam focusing system consisting of several lenses, a nozzle and the downstream chamber, was studied. A three-dimensional numerical simulation for the system was presented and the compressible airflow and thermal conditions in the aerodynamic lens system were evaluated. Dilute particle concentration was assumed so ...

Verification techniques have become popular in software and hardware development. They increase confidence and potentially provide rich feedback. However, with increasing complexity verification techniques are more likely to contain errors themselves. Many verification tools use invariants of the considered systems for their analysis. These invariants are often generated by the verification too...