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.
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. 相似文献
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 second-sound velocity of a superfluid mixture increases when a static and homogeneous magnetic field is applied. In particular, for dilute mixtures (molar3He concentration <0.1) and low temperatures, (0.1<T<0.6 K) the relative velocity increase is independent of concentration and is given by u2/u25×10–16Be2T–2. It should be easily observed wheneverBeT–1is larger than 105 G K–1 and can lead to a novel measurement of the magnetic susceptibility. 相似文献
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, CH3, 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. 相似文献
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. 相似文献
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. 相似文献
Recently, there has been an increasing interest in directed probabilistic logical models and a variety of formalisms for describing
such models has been proposed. Although many authors provide high-level arguments to show that in principle models in their
formalism can be learned from data, most of the proposed learning algorithms have not yet been studied in detail. We introduce
an algorithm, generalized ordering-search, to learn both structure and conditional probability distributions (CPDs) of directed
probabilistic logical models. The algorithm is based on the ordering-search algorithm for Bayesian networks. We use relational
probability trees as a representation for the CPDs. We present experiments on a genetics domain, blocks world domains and
the Cora dataset.
Editors: Stephen Muggleton, Ramon Otero, Simon Colton. 相似文献
Software agents that play a role in E-commerce and E-government applications involving the Internet often contain information about the identity of their human user such as credit cards and bank accounts. This paper discusses whether this is necessary: whether human users and software agents are allowed to be anonymous under the relevant legal regimes and whether an adequate interaction and balance between law and anonymity can be realised from both the perspective of Computer Systems and the perspective of Law.This paper is an extended and fully revised version of Brazier, Kubbe, Oskamp and Wijngaards (2002) and Brazier, Oskamp, Prins, Schellekens and Wijngaards (2003). 相似文献