Étude d'un système de deux miroirs sphériques
Propriétés d'une famille de fonctions à une infinité de branches
Survival maximization for a Laguerre population.
Paramétrisation et approximation d'un problème non convexe ; application à un problème de gestion de portefeuille
Numerical simulation of gluey particles
We propose here a model and a numerical scheme to compute the motion of rigid particles interacting through the lubrication force. In the case of a particle approaching a plane, we propose an algorithm and prove its convergence towards the solutions to the gluey particle model described in [B. Maury, ESAIM: Proceedings 18 (2007) 133–142]. We propose a multi-particle version of this gluey model which is based on the projection of the velocities onto a set of admissible velocities. Then, we describe...
Note rectificative
Sur certaines équivalences simplifiables d'un demi-groupe
Sur les demi-groupes admettant pour image homomorphe un groupe avec zéro
Demi-groupes admettant des complexes minimaux pour un résidu à droite ou bilatère donné
Sur la structure des demi-groupes idempotents
Sur la structure des demi-groupes, d'après les travaux de J. A. Green et W. D. Munn
Sur les demi-groupes admettant des complexes nets d'un côté minimaux
Demi-groupes et anneaux de fractions
Aspects génétiques des relations entre critères
Modeling and forecasting the peak flows of a river.
A filtered renewal process as a model for a river flow.
Numerical simulation of gluey particles
We propose here a model and a numerical scheme to compute the motion of rigid particles interacting through the lubrication force. In the case of a particle approaching a plane, we propose an algorithm and prove its convergence towards the solutions to the gluey particle model described in [B. Maury, (2007) 133–142]. We propose a multi-particle version of this gluey model which is based on the projection of the velocities onto a set of admissible velocities. Then, we describe a...
A primal-dual algorithm for a constrained Fermat-Weber problem involving mixed norms
First hitting place probabilities for a discrete version of the Ornstein-Uhlenbeck process.
Words over an ordered alphabet and suffix permutations
Given an ordered alphabet and a permutation, according to the lexicographic order, on the set of suffixes of a word , we present in this article a linear time and space method to determine whether a word has the same permutation on its suffixes. Using this method, we are then also able to build the class of all the words having the same permutation on their suffixes, first of all the smallest one. Finally, we note that this work can lead to a method for generating a Lyndon word randomly in linear...
Page 1 Next