Search results for "aid"
showing 10 items of 3031 documents
Strongly invertible links and divides
2008
Abstract To a proper generic immersion of a finite number of copies of the unit interval in a 2-disc, called a divide, A’Campo associates a link in S 3 . From the more general notion of ordered Morse signed divides, one obtains a braid presentation of links of divides. In this paper, we prove that every strongly invertible link is isotopic to the link of an ordered Morse signed divide. We give fundamental moves for ordered Morse signed divides and show that strongly invertible links are equivalent if and only if we can pass from one ordered Morse signed divide to the other by a sequence of such moves. Then we associate a polynomial to an ordered Morse signed divide, invariant for these move…
Computing the Probability for Data Loss in Two-Dimensional Parity RAIDs
2017
Parity RAIDs are used to protect storage systems against disk failures. The idea is to add redundancy to the system by storing the parity of subsets of disks on extra parity disks. A simple two-dimensional scheme is the one in which the data disks are arranged in a rectangular grid, and every row and column is extended by one disk which stores the parity of it.In this paper we describe several two-dimensional parity RAIDs and analyse, for each of them, the probability for dataloss given that f random disks fail. This probability can be used to determine the overall probability using the model of Hafner and Rao. We reduce subsets of the forest counting problem to the different cases and show…
Nondeterministic Unitary OBDDs
2017
We investigate the width complexity of nondeterministic unitary OBDDs (NUOBDDs). Firstly, we present a generic lower bound on their widths based on the size of strong 1-fooling sets. Then, we present classically “cheap” functions that are “expensive” for NUOBDDs and vice versa by improving the previous gap. We also present a function for which neither classical nor unitary nondeterminism does help. Moreover, based on our results, we present a width hierarchy for NUOBDDs. Lastly, we provide the bounds on the widths of NUOBDDs for the basic Boolean operations negation, union, and intersection.
Irreducible components of Hurwitz spaces parameterizing Galois coverings of curves of positive genus
2014
Let Y be a smooth, projective, irreducible complex curve. A G-covering p : C → Y is a Galois covering, where C is a smooth, projective, irreducible curve and an isomorphism G ∼ −→ Aut(C/Y ) is fixed. Two G-coverings are equivalent if there is a G-equivariant isomorphism between them. We are concerned with the Hurwitz spaces H n (Y ) and H G n (Y, y0). The first one parameterizes Gequivalence classes of G-coverings of Y branched in n points. The second one, given a point y0 ∈ Y , parameterizes G-equivalence classes of pairs [p : C → Y, z0], where p : C → Y is a G-covering unramified at y0 and z0 ∈ p (y0). When G = Sd one can equivalently consider coverings f : X → Y of degree d with full mon…
REPRESENTATIVE BRAIDS FOR LINKS ASSOCIATED TO PLANE IMMERSED CURVES
2000
In [ AC 2], A'Campo associates a link in S3 to any proper generic immersion of a disjoint union of arcs into a 2-disc. We give a sample algorithmic way to produce, from the immersion, a representative braid for such links. As a by-product we get a minimal representative braid for any algebraic link, from a divide associated to a real deformation of the polynomial defining the link.
Numerical approximation of mixed models for digital integrated circuits
1991
To analyse an electrical network many CAD (Computer Aided Design) circuit simulators are available today. The most well-known is probably SPICE -Nagel [1975]. Although this type of simulator is able to precisely compute the transient performances (as delay time), the usage of complete models of devices implies an extremely high time consumption. So, the circuit simulators are unappropriate for the initial stage of VLSI design where a high speed timing analyser (“timing simulator”) is required. To this goal, alternative approaches using either simpler device models or simpler numerical algorithms or easily computable formulae for delay time approximation, have been developed in the past deca…
Automorphism groups of some affine and finite type Artin groups
2004
We observe that, for fixed n ≥ 3, each of the Artin groups of finite type An, Bn = Cn, and affine type ˜ An−1 and ˜ Cn−1 is a central extension of a finite index subgroup of the mapping class group of the (n + 2)-punctured sphere. (The centre is trivial in the affine case and infinite cyclic in the finite type cases). Using results of Ivanov and Korkmaz on abstract commensurators of surface mapping class groups we are able to determine the automorphism groups of each member of these four infinite families of Artin groups. A rank n Coxeter matrix is a symmetric n × n matrix M with integer entries mij ∈ N ∪ {∞} where mij ≥ 2 for ij, and mii = 1 for all 1 ≤ i ≤ n. Given any rank n Coxeter matr…
Mary Blairin taiteen murros : Disneyn konseptitaiteilija vai modernisti?
2017
Mary Blairin taiteen murros naturalistisesta moderniin kolorismiin on ollut suurena vaikuttajana Walt Disney Companyn tyylin muutokseen ja hänen taiteensa vaikuttaa yhä nykyisiin konseptitaiteilijoihin. Tutkielma tarkastelee, miten yhteiskunta ja hänen henkilökohtainen elämänsä on vaikuttanut hänen taiteensa murrokseen. Mary Blairs shift from a naturalistic style to a modern coloristic one has been a huge impact on the style of Walt Disney Company and her work still impacts concept artist today. This study looks into how society and her personal life have affected the change in her art.
Accompagnement de l'évaluation d'un programme d'aide à la réussite étudiante par un comité scientifique et d'évaluation
2023
Cette contribution présente comment une instance d’évaluation d’un programme d’aide à la réussite étudiante s’est construite durant quatre ans. Il retrace le cas du comité scientifique et d’évaluation d’un projet pédagogique pluri-établissements démarré en 2018 dans le cadre du programme NCU-ANR-PIA d’une durée de 10 ans. Elle raconte les différents pas de la mise en place d’une évaluation instituée structurée par les statuts de ses membres, par l’adhésion à des principes sous-jacents inspirés de Thélot (2008) et inspirée par la recherche en évaluation et pas seulement par les demandes et évaluations spontanées. Elle précise les modalités de construction du jugement de l’évaluation par cett…