A subject-specific software solution for the modeling and the visualization of muscles deformations

Today, to create and to simulate a virtual anatomical version of a subject is useful in the decision process of surgical treatments. The muscular activity is one of the factors which can contribute to abnormal movements such as in spasticity or static contracture. In this paper, we propose a numerical solution, based on the Finite Element (FE) method, able to estimate muscles deformations during contraction. Organized around a finite element solver and a volumetric environment, this solution is made of all the modeling and simulation processes from the discretization of the studied domain to the visualization of the results. The choices of materials and properties of the FE model are also presented such as the hyperelasticity, the contention model based on inter-meshes neighboring nodes pairing, and the estimation of nodal forces based on the subject-specific muscular forces and action lines.

Visualization of myocardial perfusion derived from coronary anatomy

Visually assessing the effect of the coronary artery anatomy on the perfusion of the heart muscle in patients with coronary artery disease remains a challenging task. We explore the feasibility of visualizing this effect on perfusion using a numerical approach. We perform a computational simulation of the way blood is perfused throughout the myocardium purely based on information from a three-dimensional anatomical tomographic scan. The results are subsequently visualized using both three-dimensional visualizations and bull's eye plots, partially inspired by approaches currently common in medical practice. Our approach results in a comprehensive visualization of the coronary anatomy that compares well to visualizations commonly used for other scanning technologies. We demonstrate techniques giving detailed insight in blood supply, coronary territories and feeding coronary arteries of a selected region. We demonstrate the advantages of our approach through visualizations that show information which commonly cannot be directly observed in scanning data, such as a separate visualization of the supply from each coronary artery. We thus show that the results of a computational simulation can be effectively visualized and facilitate visually correlating these results to for example perfusion data.     

A polynomial time computable metric between point sets

Measuring the similarity or distance between sets of points in a metric space is an important problem in machine learning and has also applications in other disciplines e.g. in computational geometry, philosophy of science, methods for updating or changing theories, . Recently Eiter and Mannila have proposed a new measure which is computable in polynomial time. However, it is not a distance function in the mathematical sense because it does not satisfy the trian gle inequality. We introduce a new measure which is a metric while being computable in polynomial time. We also present a variant which computes a normalised metric and a variant which can associate different weights with the points in the set. Received: 18 October 1999 / 8 January 2001     

The influence of spin on second sound in superfluid3He-4He mixtures

The second-sound velocity of a superfluid mixture increases when a static and homogeneous magnetic field is applied. In particular, for dilute mixtures (molar ³ He concentration <0.1) and low temperatures, (0.1<T<0.6 K) the relative velocity increase is independent of concentration and is given by u ₂/u ₂5×10^–16 B _e ² T ^–2. It should be easily observed wheneverB _e T ^–1is larger than 10 ⁵ G K^–1 and can lead to a novel measurement of the magnetic susceptibility.     

Force Curve Measurements with the AFM: Application to the In Situ Determination of Grafted Silicon-Wafer Surface Energies

The atomic force microscope (AFM) can be used to perform surface force measurements in the quasi-static mode (cantilever is not oscillating) to investigate nanoscale surface properties. Nevertheless, there is still a lack of literature proposing a complete systematic and rigorous experimental procedure that enables one to obtain reproducible and significant quantitative data. This article focuses on the fundamental experimental difficulties arising when making force curve measurements with the AFM in air. On the basis of this AFM calibration procedure, quantitative assessment values were used to determine, in situ, SAM (or Self Assembled Monolayer)-tip thermodynamic work of adhesion at a local scale, which have been found to be in good agreement with quoted values. Finally, determination of surface energies of functionalised silicon wafers (as received, CH₃, OH functionalised silicon wafers) with the AFM (at a local scale) is also proposed and compared with the values obtained by wettability (at a macroscopic scale). In particular, the effect of the capillary forces is discussed.     

Reconstructing (h,v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections

The problem of reconstructing a pattern of an object from its approximate discrete orthogonal projections in a 2-dimensional grid, may have no solution because the inaccuracy in the measurements of the projections may generate an inconsistent problem. To attempt to overcome this difficulty, one seeks to reconstruct a pattern with projection values having possibly some bounded differences with the given projection values and minimizing the sum of the absolute differences.

This paper addresses the problem of reconstructing a pattern with a difference at most equal to +1 or −1 between each of its projection values and the corresponding given projection value. We deal with the case of patterns which have to be horizontally and vertically convex and the case of patterns which have to be moreover connected, the so-called convex polyominoes. We show that in both cases, the problem of reconstructing a pattern can be transformed into a Satisfiability (SAT) Problem. This is done in order to take advantage of the recent advances in the design of solvers for the SAT Problem. We show, experimentally, that by adding two important features to CSAT (an efficient SAT solver), optimal patterns can be found if there exist feasible ones. These two features are: first, a method that extracts in linear time an optimal pattern from a set of feasible patterns grouped in a generic pattern (obtaining a generic pattern may be exponential in the worst case) and second, a method that computes actively a lower bound of the sum of absolute differences that can be obtained from a partially defined pattern. This allows to prune the search tree if this lower bound exceeds the best sum of absolute differences found so far.     

A Cost-Optimal Pipeline Algorithm for Permutation Generation in Lexicographic Order

In this paper we solve the open problem of designing a cost-optimal parallel algorithm for generating permutations ofMelements out of the set {0, 1, …,N− 1}, in lexicographic order. Our algorithm runs on the simplest model of parallel computation, i.e., a linear array of sizeM, where each processor PE(i) needs only a constant number of words of length logN, and is responsible for producing with constant delay, theith components in the successive permutations. This algorithm runs in timeO(N!/(N−M)!) on an array of sizeMand is therefore cost-optimal when the time needed to output the permutations is taken into account. Moreover, by doubling the number of cells, it is possible to implement this algorithm on a unidirectional linear array.     

Toward green dialysis: Focus on water savings

Hemodialysis is one of the most water and energy‐hungry medical procedures, and thus represents a clear opportunity where improvements should be made concerning the consumption and wastage of water. Three levels were investigated on which there are potential savings: the precise adjustment of water production according to specific needs, the reuse of reverse osmosis rejected water, and finally the huge volumes of post‐patient dialysate effluent. The “AURAL” (Association pour l′Utilisation du Rein Artificiel à Lyon), main unit in Lyon, was the site of investigation for this study, which cares for 173 chronic hemodialysis patients. Evaluation of the 3 levels described earlier was undertaken on this particular building, and on the water treatment currently used. Volumes of produced water can be improved by different hydraulic systems or by adjusting the pure water conductivity used for dialysis. Concerning the reject water, reuse for building sanitation became the focus of further attention. The technical feasibility, volume of saved water, and applicable work costs were considered. The results suggest that out of a possible 2834 m³/year of reject water, 1200 m³/year may be reused and return on investment recovered within 5.8 years. Finally, the reprocessing and feasibility of reuse of dialysate effluent were investigated. Initial calculations show that although technical solutions are available, such processing of the wastewater production is not profitable in the short term. Regarding the significant prior authorization and risk management analysis necessary for such a project, this avenue was pursued no further. From the perspective of a “green dialysis,” the reuse of reject water into sanitation is both viable and profitable in our unit, and must be the next step of our project. More widely, improvements can be made by defining a more precise range of pure water conductivity for dialysis and by applying reuse water project to new or to be renovated units.     

On the improvement of network resource utilization efficiency for the establishment of static dependable connections in SRLG-constrained WDM translucent networks

In this paper, we investigate the problem of establishing static connections with fault-tolerant requirements, also known as dependable connections, taking into account quality of transmission constraints. To the best of our knowledge, this is the first study that tackles the aforementioned problem under shared risk link group (SRLG) constraints in translucent WDM optical mesh networks where typically a set of strategically localized network nodes are equipped with regeneration capability to overcome physical-layer impairment effects. A novel cross-layer heuristic approach is introduced to solve the problem for an heterogeneous networked scenario relying on a cost-effective two-stage protection procedure which combines the well-known path protection and partial path protection schemes in order to ensure instantaneous recovery from any SRLG-failure event. The proposed heuristic integrates a generic auxiliary graph model that incorporates various network heterogeneity factors such as the number of transceivers at each network node, the number of wavelengths on each fiber link, and the regeneration capability of each node, represented by different edges in the constructed graph. Moreover, the integrated auxiliary graph can be applied efficiently to model either single- or mixed-line-rate translucent WDM optical networks wherein different modulation formats are employed in order to support the transmission at different line rates. Our solution approach aims at maximizing the total number of accommodated requests by reducing network resource consumption through the simultaneous use of the backup–backup and primary–backup multiplexing techniques. We, here, present extended versions of these two techniques that generalize the sharing concept to some other important node resources—specifically, regeneration equipments which constitute the major cost factor in optical transport networks—in addition to link resources (i.e., wavelength channels). As far as we know, this is the first attempt to deploy simultaneously generalized versions of the backup–backup and primary–backup multiplexing techniques when considering static traffic patterns without compromising the 100 % fault-recoverability guarantee. The performances of the proposed heuristic are evaluated and discussed through extensive numerical experiments carried out on different network topologies. Significant improvements are demonstrated, either in terms of network blocking performance or in terms of resource utilization efficiency, in comparison with previously proposed approaches.