Long time behaviour of diffusing particles in constrained geometries; application to chromatin motion

Inspired by experiments that use single-particle tracking to measure the regions of confinement of selected chromosomal regions within cell nuclei, we have developed an analytical approach that takes into account various possible positions and shapes of the confinement regions. We show, in particular, that confinement of a particle into a subregion that is entirely enclosed within a spherical volume can lead to a higher limit of the mean radial square displacement value than the one associated with a particle that can explore the entire spherical volume. Finally, we apply the theory to analyse the motion of extrachromosomal chromatin rings within nuclei of living yeast.

8-8-19, Deauville [le front de mer] : [photographie de presse] / [Agence Rol]

Référence bibliographique : Rol, 55371

An axiomatic characterization of the strong constrained egalitarian solution

In this paper we axiomatize the strong constrained egalitarian solution (Dutta and Ray, 1991) over the class of weak superadditive games using constrained egalitarianism, order-consistency, and converse order-consistency. JEL classification: C71, C78. Keywords: Cooperative TU-game, strong constrained egalitarian solution, axiomatization.

Analytical expressions for the flame front speed in the downward combustion of thin solid fuels and comparison to experiments

We derive analytical expressions for the propagation speed of downward combustion fronts of thin solid fuels with a background flow initially at rest. The classical combustion model for thin solid fuels that consists of five coupled reaction-convection-diffusion equations is here reduced into a single equation with the gas temperature as the single variable. For doing so we apply a two-zone combustion model that divides the system into a preheating region and a pyrolyzing region. The speed of the combustion front is obtained after matching the temperature and its derivative at the location that separates both regions.We also derive a simplified version of this analytical expression expected to be valid for a wide range of cases. Flame front velocities predicted by our analyticalexpressions agree well with experimental data found in the literature for a large variety of cases and substantially improve the results obtained from a previous well-known analytical expression

Speed of wave-front solutions to hyperbolic reaction-diffusion equations

The asymptotic speed problem of front solutions to hyperbolic reaction-diffusion (HRD) equations is studied in detail. We perform linear and variational analyses to obtain bounds for the speed. In contrast to what has been done in previous work, here we derive upper bounds in addition to lower ones in such a way that we can obtain improved bounds. For some functions it is possible to determine the speed without any uncertainty. This is also achieved for some systems of HRD (i.e., time-delayed Lotka-Volterra) equations that take into account the interaction among different species. An analytical analysis is performed for several systems of biological interest, and we find good agreement with the results of numerical simulations as well as with available observations for a system discussed recently

Nice, coucher de soleil [sur le front de mer] : [photographie de presse] / [Agence Rol]

Référence bibliographique : Rol, 57745

Tree-based message diffusion for managing replicated data in unreliable and resource-constrained peer-to-peer environment

Abstract This thesis proposes a set of adaptive broadcast solutions and an adaptive data replication solution to support the deployment of P2P applications. P2P applications are an emerging type of distributed applications that are running on top of P2P networks. Typical P2P applications are video streaming, file sharing, etc. While interesting because they are fully distributed, P2P applications suffer from several deployment problems, due to the nature of the environment on which they perform. Indeed, defining an application on top of a P2P network often means defining an application where peers contribute resources in exchange for their ability to use the P2P application. For example, in P2P file sharing application, while the user is downloading some file, the P2P application is in parallel serving that file to other users. Such peers could have limited hardware resources, e.g., CPU, bandwidth and memory or the end-user could decide to limit the resources it dedicates to the P2P application a priori. In addition, a P2P network is typically emerged into an unreliable environment, where communication links and processes are subject to message losses and crashes, respectively. To support P2P applications, this thesis proposes a set of services that address some underlying constraints related to the nature of P2P networks. The proposed services include a set of adaptive broadcast solutions and an adaptive data replication solution that can be used as the basis of several P2P applications. Our data replication solution permits to increase availability and to reduce the communication overhead. The broadcast solutions aim, at providing a communication substrate encapsulating one of the key communication paradigms used by P2P applications: broadcast. Our broadcast solutions typically aim at offering reliability and scalability to some upper layer, be it an end-to-end P2P application or another system-level layer, such as a data replication layer. Our contributions are organized in a protocol stack made of three layers. In each layer, we propose a set of adaptive protocols that address specific constraints imposed by the environment. Each protocol is evaluated through a set of simulations. The adaptiveness aspect of our solutions relies on the fact that they take into account the constraints of the underlying system in a proactive manner. To model these constraints, we define an environment approximation algorithm allowing us to obtain an approximated view about the system or part of it. This approximated view includes the topology and the components reliability expressed in probabilistic terms. To adapt to the underlying system constraints, the proposed broadcast solutions route messages through tree overlays permitting to maximize the broadcast reliability. Here, the broadcast reliability is expressed as a function of the selected paths reliability and of the use of available resources. These resources are modeled in terms of quotas of messages translating the receiving and sending capacities at each node. To allow a deployment in a large-scale system, we take into account the available memory at processes by limiting the view they have to maintain about the system. Using this partial view, we propose three scalable broadcast algorithms, which are based on a propagation overlay that tends to the global tree overlay and adapts to some constraints of the underlying system. At a higher level, this thesis also proposes a data replication solution that is adaptive both in terms of replica placement and in terms of request routing. At the routing level, this solution takes the unreliability of the environment into account, in order to maximize reliable delivery of requests. At the replica placement level, the dynamically changing origin and frequency of read/write requests are analyzed, in order to define a set of replica that minimizes communication cost.

Front anglo-belge (bureau information) [chien équipé d'un masque à gaz] : [photographie de presse] / [Agence Rol]

Référence bibliographique : Rol, 57482

As enfermeiras da força expedicionária brasileira no front italiano

Estudo histórico-social, analisa a proximidade das Enfermeiras do Exército na FEB junto às autoridades que detinham o poder dos comandos dos exércitos norte-americano e brasileiro durante a 2.ª Guerra. Fontes primárias: duas fotografias que se complementam e depoimentos de nove enfermeiras que estiveram no conflito. Fontes secundárias: acervo literário referente ao assunto. Alguns conceitos do sociólogo Pierre Bourdieu foram utilizados para apoiar a discussão. Resultados: as enfermeiras inseridas no meio militar tiveram tratamento diferenciado pelos Comandantes dos Exércitos Norte-Americano e Brasileiro, tendo maior visibilidade junto à tropa masculina e à mídia. As enfermeiras ganharam uma batalha, sendo respeitadas num mundo novo e desconhecido, no universo das Forças Armadas, historicamente dominado por homens. Integrando uma equipe, aquelas enfermeiras lutaram por auto-afirmação e respeito naquele momento histórico peculiar.

Structural development of the Tso Morari ultra-high pressure nappe of the Ladakh Himalaya

A continental subduction-related and multistage exhumation process for the Tso Morari ultra-high pressure nappe is proposed. The model is constrained by published thermo-barometry and age data, combined with new geological and tectonic maps. Additionally, observations on the structural and metamorphic evolution of the Tso Morari area and the North Himalayan nappes are presented. The northern margin of the Indian continental crust was subducted to a depth of >90 km below Asia after continental collision some 55 Ma ago. The underthrusting was accompanied by the detachment and accretion of Late Proterozoic to Early Eocene sediments, creating the North Himalayan accretionary wedge, in front of the active Asian margin and the 103-50 Ma Ladakh arc batholith. The basic dikes in the Ordovician Tso Morari granite were transformed to eclogites with crystallization of coesite, some 53 Ma ago at a depth of >90 kin (>27 kbar) and temperatures of 500 to 600 degrees C. The detachment and extrusion of the low density Tso Morari nappe, composed of 70% of the Tso Morari granite and 30% of graywackes with some eclogitic dikes, occurred by ductile pure and simple shear deformation. It was pushed by buoyancy forces and by squeezing between the underthrusted Indian lithosphere and the Asian mantle wedge. The extruding Tso Morari nappe reached a depth of 35 km at the base of the North Himalayan accretionary wedge some 48 Ma ago. There the whole nappe stack recrystallized under amphibolite facies conditions of a Barrovian regional metamorphism with a metamorphic field gradient of 20 degrees C/km. An intense schistosity with a W-E oriented stretching lineation L, and top-to-the E shear criteria and crystallization of oriented sillimanite needles after kyanite, testify to the Tso Morari nappe extrusion and pressure drop. The whole nappe stack, comprising from the base to top the Tso Morari, Tetraogal, Karzok and Mata-Nyimaling-Tsarap nappes, was overprinted by new schistosities with a first N-directed and a second NE-directed stretching lineation L-2 and L-3 reaching the base of the North Himalayan accretionary wedge. They are characterized by top-to-the S and SW shear criteria. This structural overprint was related to an early N- and a younger NE-directed underthrusting of the Indian plate below Asia that was accompanied by anticlockwise rotation of India. The warping of the Tso Morari dome started already some 48 Ma ago with the formation of an extruding nappe at depth. The Tso Morari dome reached a depth of 15 km about 40 Ma ago in the eastern Kiagar La region and 30 Ma ago in the western Nuruchan region. The extrusion rate was of about 3 cm/yr between 53 and 48 Ma, followed by an uplift rate of 1.2 mm/yr between 48 and 30 Ma and of only 0.5 mm/yr after 30 Ma. Geomorphology observations show that the Tso Morari dome is still affected by faults, open regional dome, and basin and pull-apart structures, in a zone of active dextral transpression parallel to the Indus Suture zone.

Fuzzy coding in constrained ordinations

Canonical correspondence analysis and redundancy analysis are two methods of constrained ordination regularly used in the analysis of ecological data when several response variables (for example, species abundances) are related linearly to several explanatory variables (for example, environmental variables, spatial positions of samples). In this report I demonstrate the advantages of the fuzzy coding of explanatory variables: first, nonlinear relationships can be diagnosed; second, more variance in the responses can be explained; and third, in the presence of categorical explanatory variables (for example, years, regions) the interpretation of the resulting triplot ordination is unified because all explanatory variables are measured at a categorical level.

Front-Crawl propulsive phase detection using inertial sensors

Front crawl is an alternating swimming stroke technique in which different phases of arm movement induce changes in acceleration of limbs and body. This study proposes a new approach to use inertial body worn sensors to estimate main temporal phases of front crawl. Distinctive features in kinematic signals are used to detect the temporal phases. These temporal phases are key information sources of qualitative and quantitative evaluation of swimming coordination, which have been assessed previously by video analysis. The present method has been evaluated upon a wide range of coordination and showed a difference of 4.9% with video based system. The results are in line with video analysis inter-operator variability yet offering an easy-to-use system for trainers.

Probabilistic maximal covering location-allocation models with constrained waiting time or queue length for congested systems

When dealing with the design of service networks, such as healthand EMS services, banking or distributed ticket selling services, thelocation of service centers has a strong influence on the congestion ateach of them, and consequently, on the quality of service. In this paper,several models are presented to consider service congestion. The firstmodel addresses the issue of the location of the least number of single--servercenters such that all the population is served within a standard distance,and nobody stands in line for a time longer than a given time--limit, or withmore than a predetermined number of other clients. We then formulateseveral maximal coverage models, with one or more servers per service center.A new heuristic is developed to solve the models and tested in a 30--nodesnetwork.

A new chance-constrained maximum capture location problem

The paper presents a new model based on the basic Maximum Capture model,MAXCAP. The New Chance Constrained Maximum Capture modelintroduces astochastic threshold constraint, which recognises the fact that a facilitycan be open only if a minimum level of demand is captured. A metaheuristicbased on MAX MIN ANT system and TABU search procedure is presented tosolve the model. This is the first time that the MAX MIN ANT system isadapted to solve a location problem. Computational experience and anapplication to 55 node network are also presented.