The perception of cyclic structures is a crucial step in the analysis of graphs. To describe the cycle vector space of a graph, a minimum cycle basis can be computed in polynomial time using an algorithm of Horton, 1987]. But the set of cycles corresponding to a minimum basis is not always relevant for analyzing the cyclic structure of a graph. This restriction is due to the fact that a minimum...

Real cyclic motions tend not to be perfectly even, i.e., the period varies slightly from one cycle to the next, because of physically important changes in the scene. A generalization of period is de ned for cyclic motions that makes periodic variation explicit. This representation, called the period trace, is compact and purely temporal, describing the evolution of an object or scene without re...

In this paper we consider a random mapping, T̂n, of the finite set {1, 2, ..., n} into itself for which the digraph representation Ĝn is constructed by: (1) selecting a random number, L̂n, of cyclic vertices, (2) constructing a uniform random forest of size n with the selected cyclic vertices as roots, and (3) forming ‘cycles’ of trees by applying a random permutation to the selected cyclic verti...

The prediction quality of discrete element method (DEM) models for railway ballast can be expected to depend on three points: the geometry representation of the single particles, the used contact models and the parametrisation using principal experiments. This works aims at a balanced approach, where none of the points is addressed with excessive depth. In a first step, a simple geometry repres...

Abstract : Blind channel identi cation and equalization based on second-order statistics by subspace tting and linear prediction have received a lot of attention lately. On the other hand, the use of cyclic statistics in fractionally sampled channels has also raised considerable interest. We propose to use these statistics in subspace tting and linear prediction for (possibly multiuser and mult...

As a particular one parameter deformation of the quantum determinant, we introduce a quantum αdeterminant det (α) q and study the Uq(gln)-cyclic module generated by it: We show that the multiplicity of each irreducible representation in this cyclic module is determined by a certain polynomial called the q-content discriminant. A part of the present result is a quantum counterpart for the result...

The idea of cyclic scheduling is commonly utilized to address short-term scheduling problems for multiproduct batch plants under the assumption of relatively stable operations and product demands. It requires the determination of optimal cyclic schedule, thus greatly reducing the size of the overall scheduling problems with large time horizon. In this paper a new cyclic scheduling approach is p...

In this paper, we present results of the existence a linear continuous right inverse operator for representation analytic functions in bounded convex domain complex plane by series quasi-polynomials and exponentials. We also closely related on A. F. Leontiev interpolating function and, more generally, functional corresponding Pommiez operator. examine cyclic vectors closed invariant subspaces w...

We study the principal series representations of central extensions of a split reductive algebraic group by a cyclic group of order n. We compute the Plancherel measure of the representation using Eisenstein series and a comparison method. In addition, we construct genuine central characters of the metaplectic torus in the simply-laced case.

The reduced Burau representation Vn of the braid group Bn is obtained from the action of Bn on the homology of an infinite cyclic cover of the n-punctured disc. In this paper, we calculate H∗(Bn;Vn) as a module over the Laurent polynomial ring Q[t, t−1].