Motion organization has 2 aspects: the extraction of a (moving) frame of reference and the hierarchical organization of moving elements within the reference frame. Using a discrimination of relative motions task, the authors found large differences between different types of motion (translation, divergence, and rotation) in the degree to which each can serve as a moving frame of reference. Tran...

Reference 1] Tomm a s Pajdla and Luc Van Gool. Matching of 3-D curves using semi-diierential invariants. Abstract A method for matching 3-D curves under Euclidean motions is presented. Our approach uses a semi-diierential invariant description requiring only rst derivatives and one reference point, thus avoiding the computation of high order derivatives. A novel curve similarity measure buildin...

We consider the problem of aligning and calibrating a binocular pan-tilt device using visual information from controlled motions, while viewing a degenerate (planar) scene. By considering the invariants to controlled motions about pan and elevation axes while viewing the plane, we show how to construct the images of points at infinity in various visual directions. First, we determine an ideal p...

In this paper, we introduce the class of ideals with $(d_1,ldots,d_m)$-linear quotients generalizing the class of ideals with linear quotients. Under suitable conditions we control the numerical invariants of a minimal free resolution of ideals with $(d_1,ldots,d_m)$-linear quotients. In particular we show that their first module of syzygies is a componentwise linear module.

Let G be a finite group and H,K be two subgroups of G. We introduce the relative non-normal graph of K with respect to H , denoted by NH,K, which is a bipartite graph with vertex sets HHK and KNK(H) and two vertices x ∈ H HK and y ∈ K NK(H) are adjacent if xy / ∈ H, where HK =Tk∈K Hk and NK(H) = {k ∈ K : Hk = H}. We determined some numerical invariants and state that when this graph is planar or...

let g_1 and g_2 be simple connected graphs with disjoint vertex sets v(g_1) and v(g_2), respectively. for given vertices a_1in v(g_1) and a_2in v(g_2), a splice of g_1 and g_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the :union: of g_1 and g_2. in this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.

We show that the n-th derivative of a quantum group invariant, evaluated at 1, is a Vassiliev invariant while the derivative of the Jones polynomial, evaluated at a real number 6 = 1, is not a Vassiliev in variant. The coeecients of the classical Conway polynomial are known to be Vassiliev invariants. We show that the coeecients of the Jones polynomial are not vassiliev invariants.

in the present article, a numerical method is proposed for the numerical solution of thekdv equation by using a new approach by combining cubic b-spline functions. in this paper we convert the kdv equation to system of two equations. the method is shown to be unconditionally stable using von-neumann technique. to test accuracy the error norms2l, ∞l are computed. three invariants of motion are p...