A subdivision arrangement algorithm for semi-algebraic curves: an overview

The Fifth International Conference on Ecobalances (the 5th-ICEB), helcl November 6-8, 2002, in Tsukuba, Japan, featured individual ses- sions on life cycle assessment,

figure 16, two new commutators are shown. Each one is analogous to the commutator in figure la, but every second bar has been replaced by an insulating segment and two brushes Bl and

We give a complete proof of the equivalence between the unbiased and biased definitions of cyclic operads, through a λ-calculus-style formal language, called the µ-syntax, and a

This paper provides a numerical method combining Lyapunov theory with interval analysis which makes to find a set N which is included in the attraction domain of x ∗..

To get upper and lower bounding values in P-time instead of going to intractable computation straight, we propose Algorithm 1, which consists of two stages: The first one is to

For a great circle, we break the tie and call the cap of smallest area that induced by inner half-edges, that is: (i) if the great circle is bipolar, an half-edge is inner if it

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

Crucial ingredients are the fact that a Cauchy–Lipschitz theorem for differential systems holds over divided power rings (Proposition 3.4) and the fact that Newton iteration can be