A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge lengths. We show that the radical solvability of a generic framework depends only on its underlying graph and characterise which planar graphs give rise to ...

In this paper we present a generic algorithm for drawing sequences of graphs. This algorithm works for different layout algorithms and related metrics and adjustment strategies. It differs from previous work on dynamic graph drawing in that it considers all graphs in the sequence (offline) instead of just the previous ones (online) when computing the layout for each graph of the sequence. We in...

In this paper we present image data representation, similarity image retrieval, the architecture of a generic content-based image retrieval system, and different content-based image retrieval systems.

Several algorithms for the minimum spanning tree are known. The Blue-red algorithm is a generic algorithm in this field. A new proof for this algorithm is presented, based upon the duality of circuits and cuts in a graph. The Blue-red algorithm is genetic, because the other algorithms can be regarded as special instances. This is shown using the same duality.

Given an arrangement of hyperplanes in P, possibly with non-normal crossings, we give a vanishing lemma for the cohomology of the sheaf of q-forms with logarithmic poles along our arrangement. We give a basis for the ideal J of relations for the Orlik-Solomon’s algebra. Under certain genericity conditions it was shown by H. Esnault, V. Schechtman and E. Viehweg that the cohomology of a local sy...

This paper proposes a standardized representation of function for use by the research community, industry, and eventually commercial software vendors. This includes schemata (information models) for representation of function and associated flows, as well as an initial attempt at developing taxonomies of functions and flows. The objective of the latter effort is to generate taxonomies that are ...

of eukaryotic genomes centered on the relations between genomic sequences and their chromosomal localization [8]. In their early stages of development, ColiGene and MultiMap integrated a few sequence analysis methods. But, little by little, we found useful to provide access to the methods associated with a peculiar knowledge base to the other. Moreover, it was obvious that the methods integrate...

Introduction Among a number of generic tools that have been developed in the last decade to measure, explore, analyze, model and visualize plant architecture in 3-dimensions, this paper focuses on methods dedicated to the comparison between plant architectures. After a first step that has been reached with the comparison of branching sequences along axes (Guédon et al., 2003), Ferraro and Godin...

We prove that generic elements of braid groups are pseudo-Anosov, in the following sense: in the Cayley graph of the braid group with n > 3 strands, with respect to Garside’s generating set, we prove that the proportion of pseudo-Anosov braids in the ball of radius l tends to 1 exponentially quickly as l tends to infinity. Moreover, with a similar notion of genericity, we prove that for generic...

We generalize results of Hattori on the topology of complements of hyperplane arrangements, from the class of generic arrangements, to the much broader class of hypersolvable arrangements. We show that the higher homotopy groups of the complement vanish in a certain combinatorially determined range, and we give an explicit Zπ1-module presentation of πp, the first non-vanishing higher homotopy g...