oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2020 ( 1 )

2019 ( 47 )

2018 ( 94 )

2017 ( 77 )

Custom range...

Search Results: 1 - 10 of 30460 matches for " Yves Robert "
All listed articles are free for downloading (OA Articles)
Page 1 /30460
Display every page Item
The family of ternary cyclotomic polynomials with one free prime
Yves Gallot,Pieter Moree,Robert Wilms
Mathematics , 2011,
Abstract: A cyclotomic polynomial \Phi_n(x) is said to be ternary if n=pqr with p,q and r distinct odd primes. Ternary cyclotomic polynomials are the simplest ones for which the behaviour of the coefficients is not completely understood. Here we establish some results and formulate some conjectures regarding the coefficients appearing in the polynomial family \Phi_{pqr}(x) with p
Checkpointing vs. Migration for Post-Petascale Machines
Franck Cappello,Henri Casanova,Yves Robert
Computer Science , 2009,
Abstract: We craft a few scenarios for the execution of sequential and parallel jobs on future generation machines. Checkpointing or migration, which technique to choose?
Strategies for Replica Placement in Tree Networks
Yves Robert,Anne Benoit,Veronika Rehn
Computer Science , 2006,
Abstract: In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and QoS constraints. The client requests are known beforehand, while the number and location of the servers are to be determined. The standard approach in the literature is to enforce that all requests of a client be served by the closest server in the tree. We introduce and study two new policies. In the first policy, all requests from a given client are still processed by the same server, but this server can be located anywhere in the path from the client to the root. In the second policy, the requests of a given client can be processed by multiple servers. One major contribution of this paper is to assess the impact of these new policies on the total replication cost. Another important goal is to assess the impact of server heterogeneity, both from a theoretical and a practical perspective. In this paper, we establish several new complexity results, and provide several efficient polynomial heuristics for NP-complete instances of the problem. These heuristics are compared to an absolute lower bound provided by the formulation of the problem in terms of the solution of an integer linear program.
Energy-aware scheduling under reliability and makespan constraints
Guillaume Aupy,Anne Benoit,Yves Robert
Computer Science , 2011,
Abstract: We consider a task graph mapped on a set of homogeneous processors. We aim at minimizing the energy consumption while enforcing two constraints: a prescribed bound on the execution time (or makespan), and a reliability threshold. Dynamic voltage and frequency scaling (DVFS) is an approach frequently used to reduce the energy consumption of a schedule, but slowing down the execution of a task to save energy is decreasing the reliability of the execution. In this work, to improve the reliability of a schedule while reducing the energy consumption, we allow for the re-execution of some tasks. We assess the complexity of the tri-criteria scheduling problem (makespan, reliability, energy) of deciding which task to re-execute, and at which speed each execution of a task should be done, with two different speed models: either processors can have arbitrary speeds (continuous model), or a processor can run at a finite number of different speeds and change its speed during a computation (VDD model). We propose several novel tri-criteria scheduling heuristics under the continuous speed model, and we evaluate them through a set of simulations. The two best heuristics turn out to be very efficient and complementary.
Bayesian computation for statistical models with intractable normalizing constants
Yves Atchade,Nicolas Lartillot,Christian P. Robert
Statistics , 2008,
Abstract: This paper deals with some computational aspects in the Bayesian analysis of statistical models with intractable normalizing constants. In the presence of intractable normalizing constants in the likelihood function, traditional MCMC methods cannot be applied. We propose an approach to sample from such posterior distributions. The method can be thought as a Bayesian version of the MCMC-MLE approach of Geyer and Thompson (1992). To the best of our knowledge, this is the first general and asymptotically consistent Monte Carlo method for such problems. We illustrate the method with examples from image segmentation and social network modeling. We study as well the asymptotic behavior of the algorithm and obtain a strong law of large numbers for empirical averages.
Extended Krein-Adler theorem for the translationally shape invariant potentials
David Gómez-Ullate,Yves Grandati,Robert Milson
Physics , 2013, DOI: 10.1063/1.4871443
Abstract: Considering successive extensions of primary translationally shape invariant potentials, we enlarge the Krein-Adler theorem to mixed chains of state adding and state-deleting Darboux-B\"acklund transformations. It allows us to establish novel bilinear Wronskian and determinantal identities for classical orthogonal polynomials.
Rational extensions of the quantum harmonic oscillator and exceptional Hermite polynomials
David Gomez-Ullate,Yves Grandati,Robert Milson
Physics , 2013, DOI: 10.1088/1751-8113/47/1/015203
Abstract: We prove that every rational extension of the quantum harmonic oscillator that is exactly solvable by polynomials is monodromy free, and therefore can be obtained by applying a finite number of state-deleting Darboux transformations on the harmonic oscillator. Equivalently, every exceptional orthogonal polynomial system of Hermite type can be obtained by applying a Darboux-Crum transformation to the classical Hermite polynomials. Exceptional Hermite polynomial systems only exist for even codimension 2m, and they are indexed by the partitions \lambda of m. We provide explicit expressions for their corresponding orthogonality weights and differential operators and a separate proof of their completeness. Exceptional Hermite polynomials satisfy a 2l+3 recurrence relation where l is the length of the partition \lambda. Explicit expressions for such recurrence relations are given.
Infinite presentability of groups and condensation
Robert Bieri,Yves de Cornulier,Luc Guyot,Ralph Strebel
Mathematics , 2010, DOI: 10.1017/S1474748013000327
Abstract: We describe various classes of infinitely presented groups that are condensation points in the space of marked groups. A well-known class of such groups consists of finitely generated groups admitting an infinite minimal presentation. We introduce here a larger class of condensation groups, called infinitely independently presentable groups, and establish criteria which allow one to infer that a group is infinitely independently presentable. In addition, we construct examples of finitely generated groups with no minimal presentation, among them infinitely presented groups with Cantor-Bendixson rank 1, and we prove that every infinitely presented metabelian group is a condensation group.
Scheduling and data redistribution strategies on star platforms
Loris Marchal,Veronika Rehn,Yves Robert,Frédéric Vivien
Computer Science , 2006,
Abstract: In this work we are interested in the problem of scheduling and redistributing data on master-slave platforms. We consider the case were the workers possess initial loads, some of which having to be redistributed in order to balance their completion times. We examine two different scenarios. The first model assumes that the data consists of independent and identical tasks. We prove the NP-completeness in the strong sense for the general case, and we present two optimal algorithms for special platform types. Furthermore we propose three heuristics for the general case. Simulations consolidate the theoretical results. The second data model is based on Divisible Load Theory. This problem can be solved in polynomial time by a combination of linear programming and simple analytical manipulations.
Comments on ``Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks''
Matthieu Gallet,Yves Robert,Frédéric Vivien
Computer Science , 2007,
Abstract: Min, Veeravalli, and Barlas proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one or more installments. We show on a very simple example that the proposed approach does not always produce a solution and that, when it does, the solution is often suboptimal. We also show how to find an optimal scheduling for any instance, once the number of installments per load is given. Finally, we formally prove that under a linear cost model, as in the original paper, an optimal schedule has an infinite number of installments. Such a cost model can therefore not be sed to design practical multi-installment strategies.
Page 1 /30460
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.