Search results for "complex"
showing 10 items of 5889 documents
Probability and algorithmics: a focus on some recent developments
2017
Jean-François Coeurjolly, Adeline Leclercq-Samson Eds.; International audience; This article presents different recent theoretical results illustrating the interactions between probability and algorithmics. These contributions deal with various topics: cellular automata and calculability, variable length Markov chains and persistent random walks, perfect sampling via coupling from the past. All of them involve discrete dynamics on complex random structures.; Cet article présente différents résultats récents de nature théorique illustrant les interactions entre probabilités et algorithmique. Ces contributions traitent de sujets variés : automates cellulaires et calculabilité, chaînes de Mark…
Almost disjoint spanning trees
2016
International audience; In this extended abstract, we only consider connected graphs. Let k ≥ 2 be an integer and T 1 ,. .. , T k be spanning trees in a graph G. A vertex is said to be an inner vertex in a tree T if it has degree at least 2 in T. We denote by I(T) the set of inner vertices of tree T. The spanning trees T 1 ,. .. , T k are completely independent spanning trees if any vertex from G is an inner vertex in at most one tree among T 1 ,. .. , T k and the trees T 1 ,. .. , T k are pairwise edge-disjoint. Completely independent spanning trees were introduced by Hasunuma [4] and then have been studied on different classes of graphs, such as underlying graphs of line graphs [4], maxim…
Recherche d'arbres couvrants complètement indépendants dans des graphes réguliers
2014
International audience; Nous étudions l'existence de $r$ arbres couvrants complètement indépendants dans des graphes $2r$-réguliers et $2r$-connexes, et énonçons des conditions nécessaires à leur existence. Nous déterminons le nombre maximum d'arbres dans les produits cartésiens d'une clique et d'un cycle. Nous montrons que ce nombre n'est pas toujours $r$.
Scheduling stretched coupled-tasks with compatibilities constraints : model, complexity and approximation results for some class of graphs
2014
We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, {\it i.e.}coupled-tasks having the same sub-tasks execution time and idle time duration. We study severals problems in frame works of classic complexity and approximation for which the compatibility graph $G_c$ is bipartite (star, chain, $\ldots$) In such context, we design some efficient polynomial-time approximation algorithms according to difference parameters of the scheduling problem. When $G_c$ is a $k$-stage bipartite graph, we propose, among other, a $\frac{7}{6}$-approximation algorithm when $k=1$, and a $\frac{13}{9}$-approximation…
Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph
2012
International audience; This paper presents a generalization of the coupled-task sche-duling problem introduced by Shapiro \cite{Shapiro}, where considered tasks are subject to incompatibility constraints depicted by an undirected graph. The motivation of this problem comes from data acquisition and processing in a mono-processor torpedo used for underwater exploration. As we add the compatibility graph, we focus on complexity of the problem, and more precisely on the boundary between $\mathcal{P}$ and $\mathcal{NP}$-completeness when some other input parameters are restricted (e.g. the ratio between the durations of the two sub-tasks composing a task): we adapt the global visualization of …
On Topological Structure of Web Services Networks for Composition. In Int. Journal of Web Engineering and Technology
2013
In order to deal efficiently with the exponential growth of the Web services landscape in composition life cycle activities, it is necessary to have a clear view of its main features. As for many situations where there is a lot of interacting entities, the complex networks paradigm is an appropriate approach to analyze the interactions between the multitudes of Web services. In this paper, we present and investigate the main interactions between semantic Web services models from the complex network perspective. Results show that both parameter and operation networks exhibit the main characteristics of typical real-world complex networks such as the "small-world" property and an inhomogeneou…
Variétés complexes, feuilletages, uniformisation
2012
International audience
Moment-angle complexes and complexe manifolds
2010
The aim of this thesis is to extend the results of the article [B-M] on the relations between moment-angle complexes and complex manifolds. We will focus here on moment-angle complexes defined by a simplicial (not only polytopal) decomposition of the sphere. We will also seek to use the relationship between these two kinds of objects to be understand the topology of several complex manifolds. [B-M] F.Bosio, L.Meersseman, Real quadrics in Cn, complex manifolds and polytopes, Acta Mathematica, 197 (2006), n° 1, 53 -- 127.
Famille à un paramètre de coniques utilisant des courbes de Bézier à poids complexes
2019
The paper deals with conics in a rational Bézier representation based on mass points where the weights are complex numbers here. A special representation of conics using weighted points and vectors offers a calculus flexibility in the handle elementary geometrical transformations as rotations, homotheties and direct similarity transformations. Some examples are proposed to the reader.
On-Line Measurement of Gaseous Iodine Species During a PWR Severe Accident
2015
International audience; Iodine is a highly radio-toxic element, due to its affinity to the thyroid, and represents the major part of the radioactivity released during a nuclear accident. In the context of nuclear safety and radio-protection, we are interested in identifying the iodine gaseous species which are released, in the nuclear power plants, under molecular (I$_2$) and organic (CH$_3$I) forms. Therefore, we are working on providing a spectroscopic database for both species. While the infrared spectrum of the ν6 band of methyl iodide was previously studied, only 4000 lines were assigned. We present the rovibrational analysis of a high quality experimental spectrum, of this band, recor…