February 20, 2015 Type Package Title Lasso method for RCON(V,E) models Version 1.1-0 Date 2014-09-04 Author Luigi Augugliaro Maintainer Luigi Augugliaro Depends Matrix Encoding latin1 Description RCON(V, E) models (Højsgaard, et al.,2008) are a kind of restriction of the Gaussian Graphical Models defined by a set of equality constraints on the entries of the concentr...

7 We propose a novel, efficient approach for obtaining high-quality experimental designs for 8 event-related functional magnetic resonance imaging (ER-fMRI). Our approach combines a 9 greedy hillclimbing algorithm and a cyclic permutation method. When searching for optimal 10 ER-fMRI designs, the proposed approach focuses only on a promising restricted class of 11 designs with equal frequency o...

The analysis of frequent behaviors regarding temporal issues begins to achieve some interest, in particular in the area of health care. However, existing approaches tend to ignore the temporal information and only make use of the order among events occurrence. In this paper, we introduce the notion of temporal constraint, and propose three instantiations of it: complete cyclic temporal constrai...

We intraduce the n-dimensional key equation, which exhibitsthe error-locator polynomial of an n-dimensional cyclic code as a productof n univariate polynomials and the error-evaluator polynomial as an n-variable polynomial. We then reinterpret these polynomials in the contextof linear recurring sequences. In particular, we reduce the decodingproblem to successive application...

A cyclic order in the vertex set of a digraph is said to be coherent if any arc is contained in a directed cycle whose winding number is one. This notion plays a key role in the proof by Bessy and Thomassé (2004) of a conjecture of Gallai (1964) on covering the vertex set by directed cycles. This paper presents an efficient algorithm for finding a coherent cyclic order in a strongly connected d...

Interval narrowing techniques are a key issue for handling constraints over real numbers in the logic programming framework. However, the standard xpoint algorithm used for computing an approximation of arc consistency may give rise to cyclic phenomena and hence to problems of slow convergence. Analysis of these cyclic phenomena shows: 1) that a large number of operations carried out during a c...

Given a collection of seasonal time-series, how can we find regular (cyclic) patterns and outliers (i.e. rare events)? These two types of patterns are hidden and mixed in the time-varying activities. How can we robustly separate regular patterns and outliers, without requiring any prior information? We present CycloneM, a unifying model to capture both cyclic patterns and outliers, and CycloneF...

Expectation propagation (EP), a family of methods for iterative approximate statistical inference closely related to belief propagation, is linked to a hybrid between Dykstra’s algorithm with cyclic Bregman projections and the method of alternating Bregman projections from convex analysis via the use of the information geometry of exponential families. Doing so justifies extrinsic information e...

We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one of P. Brinkmann that one can determine whether two cyclic words in a free group are mapped to each other by some power of a given automorphism. The algorithm ...

This paper reviews a cyclic scheduling model of repetitive manufacturing environments consisting of exible machines and multi-stage jobs. We explicitly model two system performance measures, throughput and ow time, while incorporating variability arising from uncertainty in operation processing times. We present an iterative approximation scheme to estimate the two moment behavior of our perfor...