Characteristic classes and obstruction theory for infinite loop spaces

The classical extension problem is to determine whether or not a given mapg:AY, defined on a given subspaceA of a spaceX, has an extensionXY. The present paper examines this question in the special case where thek-invariants ofY are cohomology classes of finite order (for instance ifY is an infinite loop space).     

A projective algorithm for preemptive open shop scheduling with two multiprocessor groups

We study a multiprocessor extension of the preemptive open shop scheduling problem, where the set of processors is partitioned into processor groups. We show that the makespan minimization problem is polynomially solvable for two multiprocessor groups even if preemptions are restricted to integral times.     

Modeling of rod-structures in nonlinear elasticity

This Note deals with the modeling of a structure made of straight elastic rods whose thickness tends to 0. We show that, upon an adequate scaling, the infimum of the total elastic energy tends to the minimum of a functional which depends on fields defined on the centerlines of the rods.     

Evolutionary Pareto distributions

We consider here i.i.d. variables which are distributed according to a Pareto up to some point x₁ and a Pareto (with a different parameter) after this point. This model constitutes an approximation for estimating extreme tail probabilities, especially for financial or insurance data. We estimate the parameters by maximizing the likelihood of the sample, and investigate the rates of convergence and the asymptotic laws. We find here a problem which is very close to the change point question from the point of view of limits of experiments. Especially, the rates of convergence and the limiting law obtained here are the same as in a change point framework. Simulations are giving an illustration of the quality of the procedure.     

Simulation du drapé des tissus par maillages adaptatifsAdaptive meshing for cloth draping

Numerical simulation methods regarding fabric and cloth draping are generally based on mechanical models. These models are usually applied to uniform grids representing the true geometry of the fabric. Fabrics being a very flexible material, wrinkles appear on its surface when submitted to free or constrained motion. The main problem of the simulation is to represent realistically cloth surface motion. This is strongly dependent on the surface discretization. We present a new cloth animation scheme based on adaptive surface discretization. It can be seen as a multi-grid method which allows us to obtain realistic simulations. We propose also a new mechanical model well suited to our adaptive meshing strategy. A numerical example is given to show the efficiency of the method. To cite this article: J. Villard et al., C. R. Acad. Sci. Paris, Ser. I 335 (2002) 561–566.     

New mathematical modelling and simulation of an industrial accumulator for elastic webs

This paper concerns the modelling of an accumulator used in industrial elastic web processing plant such as paper mills, fabric, rolling mills etc. Accumulators are used to allow rewind or unwind core changes while the process continues at a constant web velocity. A new nonlinear model of a pneumatic actuated industrial accumulator including pneumatic jack model, static friction representation and web weight is first detailed which enables to deduce a linear model. These models are derived from physical laws that describe web tension and velocity dynamics in each web span. In a second part, the effects of time-varying mechanical parameters, such as web Young modulus, web length and rollers inertia on accumulator dynamics are presented. The performances of the modeled accumulator are illustrated by simulations in Matlab/Simulink software environment.     

Attractive force search algorithm for piecewise convex maximization problems

We consider mathematical programming problems with the so-called piecewise convex objective functions. A solution method for this interesting and important class of nonconvex problems is presented. This method is based on Newton??s law of universal gravitation, multicriteria optimization and Helly??s theorem on convex bodies. Numerical experiments using well known classes of test problems on piecewise convex maximization, convex maximization as well as the maximum clique problem show the efficiency of the approach.     

Game-perfect digraphs

In the A-coloring game, two players, Alice and Bob, color uncolored vertices of a given uncolored digraph D with colors from a given color set C, so that, at any time a vertex is colored, its color has to be different from the colors of its previously colored in-neighbors. Alice begins. The players move alternately, where a move of Bob consists in coloring a vertex, and a move of Alice in coloring a vertex or missing the turn. The game ends when Bob is unable to move. Alice wins if every vertex is colored at the end, otherwise Bob wins. This game is a variant of a graph coloring game proposed by Bodlaender (Int J Found Comput Sci 2:133?C147, 1991). The A-game chromatic number of D is the smallest cardinality of a color set C, so that Alice has a winning strategy for the game played on D with C. A digraph is A-perfect if, for any induced subdigraph H of D, the A-game chromatic number of H equals the size of the largest symmetric clique of H. We characterize some basic classes of A-perfect digraphs, in particular all A-perfect semiorientations of paths and cycles. This gives us, as corollaries, similar results for other games, in particular concerning the digraph version of the usual game chromatic number.