Sparse square roots.

We show that it can be decided in polynomial time whether a graph of maximum degree 6 has a square root; if a square root exists, then our algorithm finds one with minimum number of edges. We also show that it is FPT to decide whether a connected n-vertex graph has a square root with at most n − 1 + k edges when this problem is parameterized by k. Finally, we give an exact exponential time algorithm for the problem of finding a square root with maximum number of edges

Stability of an oscillating tip in Non-Contact Atomic Force Microscopy: theoretical and numerical investigations

This paper is a theoretical and a numerical investigation of the stability of a tip-cantilever system used in Non-Contact Atomic Force Microscopy (NC-AFM) when it oscillates close to a surface. No additional dissipative force is considered. The theoretical approach is based on a variationnal method exploiting a coarse grained operation that gives the temporal dependence of the nonlinear coupled equations of motion in amplitude and phase of the oscillator. Stability criterions for the resonance peak are deduced and predict a stable behavior of the oscillator in the vicinity of the resonance. The numerical approach is based on results obtained with a virtual NC-AFM developped in our group. The effect of the size of the stable domain in phase is investigated. These results are in particularly good agreement with the theoretical predictions. Also they show the influence of the phase shifter in the feedback loop and the way it can affect the damping signal

Parallelization of direct algorithms using multisplitting methods in grid environments

The goal of this paper is to introduce a new approach to the building of efficient distributed linear system solvers. The starting point of the results of this paper lies in the fact that the parallelization of direct algorithms requires frequent synchronizations in order to obtain the solution for a linear problem. In a grid computing environment, communication times are significant and the bandwidth is variable, therefore frequent synchronizations slow down performances. Thus it is desirable to reduce the number of synchronizations in a parallel direct algorithm. Inspired from multisplitting techniques, the method we present consists in solving several linear problems obtained by splitting the original one. Each linear system is solved independently on a cluster by using the direct method. This paper uses the theoretical results of \cite{BMR97} in order to build coarse grained algorithms designed for solving linear systems in the grid computing context

Investigating the performance of medical students in anatomy examinations 2002-07

Medical students are examined four times in anatomy over two years. There is a progress test in January each year (formative) and a final summative examination in June. The purpose of this study was to examine the performance of undergraduate medical students of the University of Malta in anatomy over 4 semesters. We were specifically interested in the ways in which students’ results in the final anatomy exam could be predicted by their performance in the previous anatomy exams. We also investigated whether the strength of this correlation and the students’ actual performance were affected by their gender or nationality.peer-reviewe

Dynamic Load Balancing and Efficient Load Estimators for Asynchronous Iterative Algorithms

In a previous paper~\cite{HPCS2002}, we have shown the very high power of asynchronism for parallel iterative algorithms in a global context of grid computing. In this article, we study the interest of coupling load balancing with asynchronism in such algorithms. After proposing a non-centralized version of dynamic load balancing which is best suited to asynchronism, we verify its efficiency by some experiments on a general Partial Differential Equation (PDE) problem. Finally, we give some general conditions for the use of load balancing to obtain good results with this kind of algorithms and discuss the choice of the residual as an efficient load estimator

Performance comparison of parallel programming environments for implementing AIAC algorithms

International audienceAIAC algorithms (Asynchronous Iterations Asynchronous Communications) are a particular class of parallel iterative algorithms. Their asynchronous nature makes them more efficient than their synchronous counterparts in numerous cases as has already been shown in previous works. The first goal of this article is to compare several parallel programming environments in order to see if there is one of them which is best suited to efficiently implement AIAC algorithms. The main criterion for this comparison consists in the performances achieved in a global context of grid computing for two classical scientific problems. Nevertheless, we also take into account two secondary criteria which are the ease of programming and the ease of deployment. The second goal of this study is to extract from this comparison the important features that a parallel programming environment must have in order to be suited for the implementation of AIAC algorithms

Influence of noncontact dissipation in the tapping mode: Attempt to extract quantitative information on the surface properties with the local force probe method

In the Tapping mode, a variation of the oscillation amplitude and phase as a function of the tip sample distance is the necessary measurement to access quantitatively to the properties of the surface. In the present work, we give a systematic comparison between experimental data recorded on two surfaces, phase and amplitude, and theoretical curves. With an interaction between the tip and the surface taking into account an attractive and a repulsive term, the analytical approach is unable to properly describe the relationship between the phase variation and the oscillation amplitude variation. When an additional dissipation term is involved, due to the attractive interaction between the tip and the surface, the model gives a good agreement with the recorded data. Particularly, the trends in the phase variations related to the noncontact situations have been found to be amenable to an analysis based upon a simple viscoelastic behavior of the surface

Relative contribution of decreased productivity and survival to recent changes in the demographic trend of the Rivière George Caribou Herd

The Rivière George caribou herd (RGCH) was numerically low during the middle part of the century but apparently erupted in the sixties and the seventies. Puberty was early and pregnancy rate was high among RGCH females from 1973 until the mid-eighties when fecundity decreased significantly, in particular among sub-adults; productivity remained low in 1992. Autumn calf:female ratios reflected this trend in pregnancy, exceeding 50 calves: 100 cows between 1973 and 1983, but dropping thereafter progressively to a low of 24 in 1992. In 1993, this ratio rebounded back to 42. Annual adult survival rate of radio-collared females was high (0.95) at the beginning of the monitoring in 1984, but exhibited a variable but declining trend until 1992. Simulations were conducted to estimate the demographic trend of the RGCH between 1984 and 1992, using annual survival rates of radio-collared animals and annual autumn calffemale ratios to estimate calf production. Age structure played a minor role in estimating the finite rate of increase (Lamda). According to the simulations, the RGCH increased in size until 1987, and showed a slight decrease thereafter. The herd should have decreased by 12-15% between 1988 and 1993, according to the simulations. Productivity first caused a decline in Lamda, but in recent years decreased survival contributed slightly more than productivity to the reduction in Lamda. Estimation of the herd size by means of aerial censuses in 1976, 1984, 1988 and 1993 suggested a similar pattern in demographic trend, differences being statistically meaningless. We speculated on the future of the RGCH, that could have erupted after many decades of unfavourable weather. The herd will exhibit a rapid descent to low numbers if wolves show a numerical response to current caribou abundance, or if lichen availability on the winter range decreases due to competition with the adjacent and increasing Rivière aux Feuilles herd; otherwise it will exhibit dampened oscillations, whose amplitude will depend on the time-lag of vegetation reaction to decrease grazing pressure on the summer range

Dynamics of co-orbital exoplanets in a first order resonance chain with tidal dissipation

Co-orbital planets (in a $1:1$ mean motion resonance) can be formed within a Laplace resonance chain. Here, we develop a secular model to study the dynamics of the resonance chain $p:p:p+1$, where the co-orbital pair is in a first-order mean motion resonance with the outermost third planet. Our model takes into account tidal dissipation through the use of a Hamiltonian version of the constant time-lag model, which extends the Hamiltonian formalism of the point-mass case. We show the existence of several families of equilibria, and how these equilibria extend to the complete system. In one family, which we call the main branch, a secular resonance between the libration frequency of the co-orbitals and the precession frequency of the pericentres has unexpected dynamical consequences when tidal dissipation is added. We report the existence of two distinct mechanisms that make co-orbital planets much more stable within the $p:p:p+1$ resonance chain rather than outside it. The first one is due to negative real parts of the eigenvalues of the linearised system with tides, in the region of the secular resonance mentioned above. The second one comes from non-linear contributions of the vector field and it is due to eccentricity damping. These two stabilising mechanisms increase the chances of a still-to-come detection of exoplanets in the co-orbital configuration