Search results for "combinatoric"
showing 10 items of 1776 documents
Fast equivariant JADE
2013
Independent component analysis (ICA) is a widely used signal processing tool having applications in various fields of science. In this paper we focus on affine equivariant ICA methods. Two such well-established estimation methods, FOBI and JADE, diagonalize certain fourth order cumulant matrices to extract the independent components. FOBI uses one cumulant matrix only, and is therefore computationally very fast. However, it is not able to separate identically distributed components which is a major drawback. JADE overcomes this restriction. Unfortunately, JADE uses a huge number of cumulant matrices and is computationally very heavy in high-dimensional cases. In this paper, we hybridize the…
Inverted and mirror repeats in model nucleotide sequences.
2007
We analytically and numerically study the probabilistic properties of inverted and mirror repeats in model sequences of nucleic acids. We consider both perfect and non-perfect repeats, i.e. repeats with mismatches and gaps. The considered sequence models are independent identically distributed (i.i.d.) sequences, Markov processes and long range sequences. We show that the number of repeats in correlated sequences is significantly larger than in i.i.d. sequences and that this discrepancy increases exponentially with the repeat length for long range sequences.
A common extension of Arhangel'skii's Theorem and the Hajnal-Juhasz inequality
2019
AbstractWe present a result about $G_{\unicode[STIX]{x1D6FF}}$ covers of a Hausdorff space that implies various known cardinal inequalities, including the following two fundamental results in the theory of cardinal invariants in topology: $|X|\leqslant 2^{L(X)\unicode[STIX]{x1D712}(X)}$ (Arhangel’skiĭ) and $|X|\leqslant 2^{c(X)\unicode[STIX]{x1D712}(X)}$ (Hajnal–Juhász). This solves a question that goes back to Bell, Ginsburg and Woods’s 1978 paper (M. Bell, J.N. Ginsburg and R.G. Woods, Cardinal inequalities for topological spaces involving the weak Lindelöf number, Pacific J. Math. 79(1978), 37–45) and is mentioned in Hodel’s survey on Arhangel’skiĭ’s Theorem (R. Hodel, Arhangel’skii’s so…
A branch and bound algorithm for the matrix bandwidth minimization
2008
In this article, we first review previous exact approaches as well as theoretical contributions for the problem of reducing the bandwidth of a matrix. This problem consists of finding a permutation of the rows and columns of a given matrix which keeps the non-zero elements in a band that is as close as possible to the main diagonal. This NP-complete problem can also be formulated as a labeling of vertices on a graph, where edges are the non-zero elements of the corresponding symmetrical matrix. We propose a new branch and bound algorithm and new expressions for known lower bounds for this problem. Empirical results with a collection of previously reported instances indicate that the propose…
A GRASP heuristic for the mixed Chinese postman problem
2002
Abstract Arc routing problems (ARPs) consist of finding a traversal on a graph satisfying some conditions related to the links of the graph. In the Chinese postman problem (CPP) the aim is to find a minimum cost tour (closed walk) traversing all the links of the graph at least once. Both the Undirected CPP, where all the links are edges that can be traversed in both ways, and the Directed CPP, where all the links are arcs that must be traversed in a specified way, are known to be polynomially solvable. However, if we deal with a mixed graph (having edges and arcs), the problem turns out to be NP -hard. In this paper, we present a heuristic algorithm for this problem, the so-called Mixed CPP…
A note on symmetry reduction for circular traveling tournament problems
2011
Abstract The traveling tournament problem (TTP) consists of finding a distance-minimal double round-robin tournament where the number of consecutive breaks is bounded. Easton et al. (2001) introduced the so-called circular TTP instances, where venues of teams are located on a circle. The distance between neighboring venues is one, so that the distance between any pair of teams is the distance on the circle. It is empirically proved that these instances are very hard to solve due to the inherent symmetry. This note presents new ideas to cut off essentially identical parts of the solution space. Enumerative solution approaches, e.g. relying on branch-and-bound, benefit from this reduction. We…
The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm
2017
[EN] The Hierarchical Mixed Rural Postman Problem is defined on a mixed graph where arcs and edges that require a service are divided into clusters' that have to be serviced in a hierarchical order. The problem generalizes the Mixed Rural Postman Problem and thus is NP-hard. In this paper, we provide a polyhedral analysis of the problem and propose a branch-and-cut algorithm for its solution based on the introduced classes of valid inequalities. Extensive computational experiments are reported on benchmark instances. The exact approach allows to find the optimal solutions in less than 1 hour for instances with up to 999 vertices, 2678 links, and five clusters.
Empirical modeling of material composition and size in MOFs prepared with ligand mixtures
2019
Systematic analyses of the composition and size of metal-organic frameworks built with Zn4O and terephthalic/amino-terephthalic acid mixtures, together with a kinetic assay, reveal how these ligands behave differently, which reveals the complexity of crystal growth in these frameworks and the ability to tune it on purpose.
La téléréalité pourrait-elle contaminer la relation commerciale sur Internet?
2012
International audience; Participer à une émission de téléréalité est une activité rémunérée. Et pourtant, il s'agit d'un jeu... Alors que penser des activités sur l'Internet ? Au départ, tout y était gratuit, ou presque. Maintenant, c'est une toute autre histoire, puisque les entreprises cherchent à y tarifer tous leurs services. Mais, à l'inverse, allons-nous voir des internautes demander à leur tour à être rémunérés pour leur participation en ligne à la création de nouveaux produits, ou au montage de nouvelles campagnes, ou toute autre activité innovatrice ? Les entreprises qui en profitent feraient bien de se le demander, car les pratiques de la téléréalité pourraient bien faire des émul…
Minimal star-varieties of polynomial growth and bounded colength
2018
Abstract Let V be a variety of associative algebras with involution ⁎ over a field F of characteristic zero. Giambruno and Mishchenko proved in [6] that the ⁎-codimension sequence of V is polynomially bounded if and only if V does not contain the commutative algebra D = F ⊕ F , endowed with the exchange involution, and M , a suitable 4-dimensional subalgebra of the algebra of 4 × 4 upper triangular matrices , endowed with the reflection involution. As a consequence the algebras D and M generate the only varieties of almost polynomial growth. In [20] the authors completely classify all subvarieties and all minimal subvarieties of the varieties var ⁎ ( D ) and var ⁎ ( M ) . In this paper we e…