Search results for "Modeling and simulation"
showing 10 items of 1561 documents
A rule‐based method to model myocardial fiber orientation in cardiac biventricular geometries with outflow tracts
2019
Rule-based methods are often used for assigning fiber orientation to cardiac anatomical models. However, existing methods have been developed using data mostly from the left ventricle. As a consequence, fiber information obtained from rule-based methods often does not match histological data in other areas of the heart such as the right ventricle, having a negative impact in cardiac simulations beyond the left ventricle. In this work, we present a rule-based method where fiber orientation is separately modeled in each ventricle following observations from histology. This allows to create detailed fiber orientation in specific regions such as the endocardium of the right ventricle, the inter…
General framework for testing Poisson-Voronoi assumption for real microstructures
2020
Modeling microstructures is an interesting problem not just in Materials Science but also in Mathematics and Statistics. The most basic model for steel microstructure is the Poisson-Voronoi diagram. It has mathematically attractive properties and it has been used in the approximation of single phase steel microstructures. The aim of this paper is to develop methods that can be used to test whether a real steel microstructure can be approximated by such a model. Therefore, a general framework for testing the Poisson-Voronoi assumption based on images of 2D sections of real metals is set out. Following two different approaches, according to the use or not of periodic boundary conditions, thre…
Laplacian versus Adjacency Matrix in Quantum Walk Search
2015
A quantum particle evolving by Schr\"odinger's equation contains, from the kinetic energy of the particle, a term in its Hamiltonian proportional to Laplace's operator. In discrete space, this is replaced by the discrete or graph Laplacian, which gives rise to a continuous-time quantum walk. Besides this natural definition, some quantum walk algorithms instead use the adjacency matrix to effect the walk. While this is equivalent to the Laplacian for regular graphs, it is different for non-regular graphs, and is thus an inequivalent quantum walk. We algorithmically explore this distinction by analyzing search on the complete bipartite graph with multiple marked vertices, using both the Lapla…
Nonlocality threshold for entanglement under general dephasing evolutions: A case study
2015
Determining relationships between different types of quantum correlations in open composite quantum systems is important since it enables the exploitation of a type by knowing the amount of another type. We here review, by giving a formal demonstration, a closed formula of the Bell function, witnessing nonlocality, as a function of the concurrence, quantifying entanglement, valid for a system of two noninteracting qubits initially prepared in extended Werner-like states undergoing any local pure-dephasing evolution. This formula allows for finding nonlocality thresholds for the concurrence depending only on the purity of the initial state. We then utilize these thresholds in a paradigmatic …
Simple algorithms for calculation of the axial‐symmetric heat transport problem in a cylinder
2001
The approximation of axial‐symmetric heat transport problem in a cylinder is based on the finite volume method. In the classical formulation of the finite volume method it is assumed that the flux terms in the control volume are approximated with the finite difference expressions. Then in the 1‐D case the corresponding finite difference scheme for the given source function is not exact. There we propose the exact difference scheme. In 2‐D case the corresponding integrals are approximated using different quadrature formulae. This procedure allows one to reduce the heat transport problem described by a partial differential equation to an initial‐value problem for a system of two ordinary diff…
Diffusion front capturing schemes for a class of Fokker–Planck equations: Application to the relativistic heat equation
2010
In this research work we introduce and analyze an explicit conservative finite difference scheme to approximate the solution of initial-boundary value problems for a class of limited diffusion Fokker-Planck equations under homogeneous Neumann boundary conditions. We show stability and positivity preserving property under a Courant-Friedrichs-Lewy parabolic time step restriction. We focus on the relativistic heat equation as a model problem of the mentioned limited diffusion Fokker-Planck equations. We analyze its dynamics and observe the presence of a singular flux and an implicit combination of nonlinear effects that include anisotropic diffusion and hyperbolic transport. We present numeri…
Automatic landmark detection and 3D Face data extraction
2017
Abstract This paper contributes to 3D facial synthesis by presenting a novel method for parameterization using Landmark Point detection. The approach presented aims at improving facial recognition even in varying facial expressions, and missing data in 3D facial models. As such, the prime objective was to develop an automatically embedded process that can detect any frontal face in 3D face recognition systems, with face segmentation and surface curvature information. Using the hybrid interpolation method, experiments on facial landmarks were performed on 4950 images from Face Recognition Grand Challenge database (FRGC). Distinctive facial landmarks from the nose–tips, Limits mouth and two e…
The General Routing Problem polyhedron: Facets from the RPP and GTSP polyhedra
1998
[EN] In this paper we study the polyhedron associated with the General Routing Problem (GRP). This problem, first introduced by Orloff in 1974, is a generalization of both the Rural Postman Problem (RPP) and the Graphical Traveling Salesman Problem (GTSP) and, thus, is NP -hard. We describe a formulation of the problem such that from every non-trivial facet-inducing inequality for the RPP and GTSP polyhedra, we obtain facet-inducing inequalities for the GRP polyhedron, We describe a new family of facet-inducing inequalities for the GRP, the honeycomb constraints, which seem to be very useful for solving GRP and RPP instances. Finally, new classes of facets obtained by composition of facet-i…
Confidence-based Somatic Mutation Evaluation and Prioritization
2012
Next generation sequencing (NGS) has enabled high throughput discovery of somatic mutations. Detection depends on experimental design, lab platforms, parameters and analysis algorithms. However, NGS-based somatic mutation detection is prone to erroneous calls, with reported validation rates near 54% and congruence between algorithms less than 50%. Here, we developed an algorithm to assign a single statistic, a false discovery rate (FDR), to each somatic mutation identified by NGS. This FDR confidence value accurately discriminates true mutations from erroneous calls. Using sequencing data generated from triplicate exome profiling of C57BL/6 mice and B16-F10 melanoma cells, we used the exist…
Hierarchical fast BEM for anisotropic time-harmonic 3-D elastodynamics
2012
The paper presents a fast boundary element method for anisotropic time-harmonic 3-D elastodynamic problems. The approach uses the hierarchical matrices format and the ACA algorithm for the collocation matrix setup and a preconditioned GMRES solver for the solution. The development of this approach for the anisotropic case presents peculiar aspects which deserve investigation and are studied in the paper leading to the employed computational strategy and its effective tuning. Numerical experiments are presented to assess the method accuracy, performances and numerical complexity. The method ensures adequate accuracy allowing remarkable reductions in computation time and memory storage.