一种新的基于四面体的体细分方法%A New Volumetric Subdivision Scheme of Tetrahedral Meshes
Institute of Scientific and Technical Information of China (English)
张华; 潘日晶
2012-01-01
A new subdivision scheme for tetrahedral meshes is proposed. Previous tetra-hedral subdivision schemes encoded directional preferences, or subdivided a tetrahedron into tetrahedrons and octahedrons, which result increased complexity in representation and operation to the meshes. The proposed method solves the problems to a certain extent. For the volumetric meshes of tetrahedron, the inners of the meshes are subdivided by using the volumetric subdivision, and the surfaces of the meshes are subdivided by using a quasi-Loop surface subdivision with a parameter to control the shapes of the solids.%提出了一种新的四面体网格细分方法,之前的体细分方法存在着对角线选择或者四面体细分成四面体和八面体的问题,增加了表示和处理的复杂性.新方法较好地解决了上述问题,对一个由四面体单元组成的网格实体,体内进行体细分,细分后的体网格全部由四面体单元组成,而实体的表面,采用一种带参数的类Loop曲面细分,用于控制实体的形状.
A SUBDIVISION SCHEME FOR VOLUMETRIC MODELS
Institute of Scientific and Technical Information of China (English)
GhulamMustafa; LiuXuefeng
2005-01-01
In this paper, a subdivision scheme which generalizes a surface scheme in previous papers to volume meshes is designed. The scheme exhibits significant control over shrink-age/size of volumetric models. It also has the ability to conveniently incorporate boundaries and creases into a smooth limit shape of models. The method presented here is much simpler and easier as compared to MacCracken and Joy's. This method makes no restrictions on the local topology of meshes. Particularly, it can be applied without any change to meshes of nonmanifold topology.
Improved Butterfly Subdivision Scheme for Meshes with Arbitrary Topology
Institute of Scientific and Technical Information of China (English)
ZHANG Hui; MA Yong-you; ZHANG Cheng; JIANG Shou-wei
2005-01-01
Based on the butterfly subdivision scheme and the modified butterfly subdivision scheme, an improved butterfly subdivision scheme is proposed. The scheme uses a small stencil of six points to calculate new inserting vertex, 2n new vertices are inserted in the 2n triangle faces in each recursion, and the n old vertices are kept, special treatment is given to the boundary, achieving higher smoothness while using small stencils is realized. With the proposed scheme, the number of triangle faces increases only by a factor of 3 in each refinement step. Compared with the butterfly subdivision scheme and the modified butterfly subdivision scheme, the size of triangle faces changes more gradually, which allows one to have greater control over the resolution of a refined mesh.
A SUBDIVISION SCHEME FOR VOLUMETRIC MODELS%体模型的一种细分格式
Institute of Scientific and Technical Information of China (English)
Ghulam Mustafa; 刘雪峰
2005-01-01
In this paper, a subdivision scheme which generalizes a surface scheme in previous papers to volume meshes is designed.The scheme exhibits significant control over shrink-age/size of volumetric models.It also has the ability to conveniently incorporate boundaries and creases into a smooth limit shape of models.The method presented here is much simpler and easier as compared to MacCracken and Joys.This method makes no restrictions on the local topology of meshes.Particularly,it can be applied without any change to meshes of non-manifold topology.
Open Volumetric Mesh-An Efficient Data Structure for Tetrahedral and Hexa-hedral Meshes
Institute of Scientific and Technical Information of China (English)
XIAN Chu-hua; LI Gui-qing; GAO Shu-ming
2013-01-01
This work introduces a scalable and efficient topological structure for tetrahedral and hexahedral meshes. The design of the data structure aims at maximal flexibility and high performance. It provides a high scalability by using hierarchical representa-tions of topological elements. The proposed data structure is array-based, and it is a compact representation of the half-edge data structure for volume elements and half-face data structure for volumetric meshes. This guarantees constant access time to the neighbors of the topological elements. In addition, an open-source implementation named Open Volumetric Mesh (OVM) of the pro-posed data structure is written in C++using generic programming concepts.
Slow-Growing Subdivisions in any Dimension: Towards Removing the Curse of Dimensionality
Energy Technology Data Exchange (ETDEWEB)
Pascucci,V
2001-06-25
The efficient representation of volumetric meshes is a central problem in scientific visualization. The difference in performance between most visualization algorithm for rectilinear grids and for unstructured mesh is mostly due to fundamental difference in efficiency of their representations. In Computer Graphics the gap in performance between 2D rectilinear grids and unstructured mesh has been overcome with the development of representation schemes based on the concept of subdivision surfaces. This gap has not been bridged in the volumetric cases which is fundamental interest for Scientific Visualization. In this paper we introduce a slow-growing volumetric subdivision scheme for meshes of any topology, any intrinsic dimension d and composed of a general type of polyhedral cells (topological balls). The main feature of this approach is the ability to split in different stages cells of different dimensions. This allows to increase the resolution of the mesh slowly using small stencils for the smoothing rules. ''Sharp features'' of dimension lower than d are embedded naturally in the subdivision procedure. Automatic adaptation is provided for variable resolution. In the uniform case the slow subdivision doubles the number of vertices in the mesh at each refinement independent of its dimension d. The bisection of all the edges in a d-dimensional simplicial mesh requires d subdivision steps. Hence the slow subdivision is a d{radical}2 subdivision scheme. This algorithm generalizes a recently developed {radical}2 subdivision scheme to 3D and higher dimensional meshes where the vertex proliferation becomes increasingly problematic as d grows (the curse of dimensionality). We introduce a smoothing rule for both the domain mesh and for functions defined on it. Empirical evidence demonstrates the smoothness of the scheme directly on the mesh and indirectly on the isosurfaces of the functions.
Real-time GPU surface curvature estimation on deforming meshes and volumetric data sets.
Griffin, Wesley; Wang, Yu; Berrios, David; Olano, Marc
2012-10-01
Surface curvature is used in a number of areas in computer graphics, including texture synthesis and shape representation, mesh simplification, surface modeling, and nonphotorealistic line drawing. Most real-time applications must estimate curvature on a triangular mesh. This estimation has been limited to CPU algorithms, forcing object geometry to reside in main memory. However, as more computational work is done directly on the GPU, it is increasingly common for object geometry to exist only in GPU memory. Examples include vertex skinned animations and isosurfaces from GPU-based surface reconstruction algorithms. For static models, curvature can be precomputed and CPU algorithms are a reasonable choice. For deforming models where the geometry only resides on the GPU, transferring the deformed mesh back to the CPU limits performance. We introduce a GPU algorithm for estimating curvature in real time on arbitrary triangular meshes. We demonstrate our algorithm with curvature-based NPR feature lines and a curvature-based approximation for an ambient occlusion. We show curvature computation on volumetric data sets with a GPU isosurface extraction algorithm and vertex-skinned animations. We present a graphics pipeline and CUDA implementation. Our curvature estimation is up to ~18x faster than a multithreaded CPU benchmark.
DEFF Research Database (Denmark)
2015-01-01
Mesh generation and visualization software based on the CGAL library. Folder content: drawmesh Visualize slices of the mesh (surface/volumetric) as wireframe on top of an image (3D). drawsurf Visualize surfaces of the mesh (surface/volumetric). img2mesh Convert isosurface in image to volumetric...
Gonizzi Barsanti, S.; Guidi, G.
2017-02-01
Conservation of Cultural Heritage is a key issue and structural changes and damages can influence the mechanical behaviour of artefacts and buildings. The use of Finite Elements Methods (FEM) for mechanical analysis is largely used in modelling stress behaviour. The typical workflow involves the use of CAD 3D models made by Non-Uniform Rational B-splines (NURBS) surfaces, representing the ideal shape of the object to be simulated. Nowadays, 3D documentation of CH has been widely developed through reality-based approaches, but the models are not suitable for a direct use in FEA: the mesh has in fact to be converted to volumetric, and the density has to be reduced since the computational complexity of a FEA grows exponentially with the number of nodes. The focus of this paper is to present a new method aiming at generate the most accurate 3D representation of a real artefact from highly accurate 3D digital models derived from reality-based techniques, maintaining the accuracy of the high-resolution polygonal models in the solid ones. The approach proposed is based on a wise use of retopology procedures and a transformation of this model to a mathematical one made by NURBS surfaces suitable for being processed by volumetric meshers typically embedded in standard FEM packages. The strong simplification with little loss of consistency possible with the retopology step is used for maintaining as much coherence as possible between the original acquired mesh and the simplified model, creating in the meantime a topology that is more favourable for the automatic NURBS conversion.
Loop Subdivision Surface Based Progressive Interpolation
Institute of Scientific and Technical Information of China (English)
Fu-Hua (Frank) Cheng; Feng-Tao Fan; Shu-Hua Lai; Cong-Lin Huang; Jia-Xi Wang; Jun-Hai Yong
2009-01-01
A new method for constructing interpolating Loop subdivision surfaces is presented. The new method is an extension of the progressive interpolation technique for B-splines. Given a triangular mesh M, the idea is to iteratively upgrade the vertices of M to generate a new control mesh M such that limit surface of M would interpolate M. It can be shown that the iterative process is convergent for Loop subdivision surfaces. Hence, the method is well-defined. The new method has the advantages of both a local method and a global method, i.e., it can handle meshes of any size and any topology while generating smooth interpolating subdivision surfaces that faithfully resemble the shape of the given meshes. The meshes considered here can be open or closed.
Reverse Loop subdivision with sharp features
Institute of Scientific and Technical Information of China (English)
Zhao Mingxi; Ma Lizhuang; Mao Zhihong; Wu Xiaomao
2006-01-01
In this paper we introduce a new reverse Loop subdivision method. In contrast to current wavelets based Loop subdivision scheme, our method applies the same rules to both regular and extraordinary vertices and reconstructs the sharp features easily. Furthermore, our method runs faster because it does not need analysis and synthesis procedural. Our main goal is the design of a reverse subdivision method that can reconstruct the coarser mesh from a finer subdivision surface with sharp features for multiresolution representation. The proposed method only needs a little memory storage and brings little error, and it is easy to implement.
ESTIMATING ERROR BOUNDS FOR TERNARY SUBDIVISION CURVES/SURFACES
Institute of Scientific and Technical Information of China (English)
Ghulam Mustafa; Jiansong Deng
2007-01-01
We estimate error bounds between ternary subdivision curves/surfaces and their control polygons after k-fold subdivision in terms of the maximal differences of the initial control point sequences and constants that depend on the subdivision mask. The bound is independent of the process of subdivision and can be evaluated without recursive subdivision.Our technique is independent of parametrization therefore it can be easily and efficiently implemented. This is useful and important for pre-computing the error bounds of subdivision curves/surfaces in advance in many engineering applications such as surface/surface intersection, mesh generation, NC machining, surface rendering and so on.
Estimating Subdivision Depth of Catmull-Clark Surfaces
Institute of Scientific and Technical Information of China (English)
Hua-Wei Wang; Kai-Huai Qin
2004-01-01
In this paper, both general and exponential bounds of the distance between a uniform Catmull-Clark surface and its control polyhedron are derived. The exponential bound is independent of the process of subdivision and can be evaluated without recursive subdivision. Based on the exponential bound, we can predict the depth of subdivision within a user-specified error tolerance. This is quite useful and important for pre-computing the subdivision depth of subdivision surfaces in many engineering applications such as surface/surface intersection,mesh generation, numerical control machining and surface rendering.
Adaptive mesh generation for image registration and segmentation
DEFF Research Database (Denmark)
Fogtmann, Mads; Larsen, Rasmus
2013-01-01
This paper deals with the problem of generating quality tetrahedral meshes for image registration. From an initial coarse mesh the approach matches the mesh to the image volume by combining red-green subdivision and mesh evolution through mesh-to-image matching regularized with a mesh quality...
A New Solid Subdivision Scheme%一种新的体细分格式
Institute of Scientific and Technical Information of China (English)
Ghulam Mustafa; 刘雪峰
2005-01-01
近二十年来,对曲线和曲面的细分方法(Subdivision)的研究和应用在计算机图形学和造型领域中相当流行,然而对于实体的细分方法却研究得较少.在本文中,我们设计了一种基于六面体的逼近细分格式:在张量积网格上表现为张量积格式,在体网格上生成光滑的极限实体,并能在实体上引入边界和折痕.根据已有的在简单六面体网格上的基于六面体的逼近格式,如果不采用一些特殊规则,设计者很难得到实体模型.我们设计了一套针对实体模型的细分规则来简化细分过程.大体上,我们的细分过程结合了简单线性细分和二层平均,对网格的局部拓扑结构没有严格要求.特别地,我们的格式可以不加修改地应用到非流形拓扑网格上.同时,我们引入了用于控制模型形状的自由参数,使模型设计更具弹性.%Subdivision for curves and surfaces has gained popularity in computer graphics and shape modeling during the past two decades, yet solid/volumetric subdivision has received much less attention. In this paper, we design a subdivision scheme that reproduces the tensor product rule on tensor product meshes and yields smooth limit volumes for arbitrary volume meshes. It also has the ability to conveniently incorporate boundaries and creases into a smooth limit shape of model. It is a hexahedral-based, approximation scheme. According to the existing hexahedralbased,approximation scheme over simple or rough hexahedral meshes it is difficult to get the solid models which designers want to model without using some special rules. We devise a set of solid subdivision rules to facilitate a simple subdivision procedure. In principle, our solid subdivision process is a combination of simple linear subdivision and two rounds of averaging. This process makes no restrictions on the local topology of the meshes. Particularly, it can be applied without any change to meshes with non-manifold topology
Blending Parametric Patches with Subdivision Surfaces
Institute of Scientific and Technical Information of China (English)
李桂清; 李华
2002-01-01
In this paper the problem of blending parametric surfaces using subdivision patches is discussed. A new approach, named removing-boundary, is presented to generate piecewise-smooth subdivision surfaces through discarding the outmost quadrilaterals of the open meshes derived by each subdivision step. Then the approach is employed both to blend parametric bicubic B-spline surfaces and to fill n-sided holes. It is easy to produce piecewisesmooth subdivision surfaces with both convex and concave corners on the boundary, and limit surfaces are guaranteed to be C2 continuous on the boundaries except for a few singular points by the removing-boundary approach. Thus the blending method is very efficient and the blending surface generated is of good effect.
Curve interpolation based on Catmull-Clark subdivision scheme
Institute of Scientific and Technical Information of China (English)
无
2003-01-01
An efficient algorithm for curve interpolation is proposed. The algorithm can produce a subdivision surface that can interpolate the predefined cubic B-spline curves by applying the Catmull-Clark scheme to a polygonal mesh containing "symmetric zonal meshes", which possesses some special properties. Many kinds of curve interpolation problems can be dealt with by this algorithm, such as interpolating single open curve or closed curve, a mesh of nonintersecting or intersecting curve. The interpolating surface is C2 everywhere excepting at a finite number of points. At the same time, sharp creases can also be modeled on the limit subdivision surface by duplicating the vertices of the tagged edges of initial mesh, i.e. the surface is only C0 along the cubic B-spline curve that is defined by the tagged edges. Because of being simple and easy to implement, this method can be used for product shape design and graphic software development.
Subdivision for Generating Quadrics
Institute of Scientific and Technical Information of China (English)
Wei Guofu; Feng Yuyu; Chen Falai
2002-01-01
Quadrics are of basic importance in Computer Graphics and Computer Aided Design. In this paper,we design a subdivision scheme based on the method suggested by G. Morin and J. Warren to generate conics and quadrics conveniently. Given the control polygon(poly-hedron),the corresponding ellipse (ellipsoid)can be generated. The hyperbolas and hyperboloids are generated based on the generation of ellipses and ellipsoids by a simple transformation. The method in this paper is much simpler and easier to apply than those given by Eugenia Montiel et al.
Local Routing in Convex Subdivisions
DEFF Research Database (Denmark)
Bose, Prosenjit; Durocher, Stephane; Mondal, Debajyoti;
2015-01-01
In various wireless networking settings, node locations determine a network’s topology, allowing the network to be modelled by a geometric graph drawn in the plane. Without any additional information, local geometric routing algorithms can guarantee delivery to the target node only in restricted...... classes of geometric graphs, such as triangulations. In order to guarantee delivery on more general classes of geometric graphs (e.g., convex subdivisions or planar subdivisions), previous local geometric routing algorithms required Θ(logn) state bits to be stored and passed with the message. We present...... the first local geometric routing algorithm using only one state bit to guarantee delivery on convex subdivisions and the first local geometric memoryless routing algorithm that guarantees delivery on edge-augmented monotone subdivisions (including all convex subdivisions) when the algorithm has knowledge...
Improved Ternary Subdivision Interpolation Scheme
Institute of Scientific and Technical Information of China (English)
WANG Huawei; QIN Kaihuai
2005-01-01
An improved ternary subdivision interpolation scheme was developed for computer graphics applications that can manipulate open control polygons unlike the previous ternary scheme, with the resulting curve proved to be still C2-continuous. Parameterizations of the limit curve near the two endpoints are given with expressions for the boundary derivatives. The split joint problem is handled with the interpolating ternary subdivision scheme. The improved scheme can be used for modeling interpolation curves in computer aided geometric design systems, and provides a method for joining two limit curves of interpolating ternary subdivisions.
Hybrid Surface Mesh Adaptation for Climate Modeling
Institute of Scientific and Technical Information of China (English)
Ahmed Khamayseh; Valmor de Almeida; Glen Hansen
2008-01-01
Solution-driven mesh adaptation is becoming quite popular for spatial error control in the numerical simulation of complex computational physics applications, such as climate modeling. Typically, spatial adaptation is achieved by element subdivision (h adaptation) with a primary goal of resolving the local length scales of interest. A second, lesspopular method of spatial adaptivity is called "mesh motion" (r adaptation); the smooth repositioning of mesh node points aimed at resizing existing elements to capture the local length scales. This paper proposes an adaptation method based on a combination of both element subdivision and node point repositioning (rh adaptation). By combining these two methods using the notion of a mobility function, the proposed approach seeks to increase the flexibility and extensibility of mesh motion algorithms while providing a somewhat smoother transition between refined regions than is pro-duced by element subdivision alone. Further, in an attempt to support the requirements of a very general class of climate simulation applications, the proposed method is de-signed to accommodate unstructured, polygonal mesh topologies in addition to the most popular mesh types.
Procedure for the automatic mesh generation of innovative gear teeth
Directory of Open Access Journals (Sweden)
Radicella Andrea Chiaramonte
2016-01-01
Full Text Available After having described gear wheels with teeth having the two sides constituted by different involutes and their importance in engineering applications, we stress the need for an efficient procedure for the automatic mesh generation of innovative gear teeth. First, we describe the procedure for the subdivision of the tooth profile in the various possible cases, then we show the method for creating the subdivision mesh, defined by two series of curves called meridians and parallels. Finally, we describe how the above procedure for automatic mesh generation is able to solve specific cases that may arise when dealing with teeth having the two sides constituted by different involutes.
Rigidity Constraints for Large Mesh Deformation
Institute of Scientific and Technical Information of China (English)
Yong Zhao; Xin-Guo Liu; Qun-Sheng Peng; Hu-Jun Bao
2009-01-01
It is a challenging problem of surface-based deformation to avoid apparent volumetric distortions around largely deformed areas. In this paper, we propose a new rigidity constraint for gradient domain mesh deformation to address this problem. Intuitively the proposed constraint can be regarded as several small cubes defined by the mesh vertices through mean value coordinates. The user interactively specifies the cubes in the regions which are prone to volumetric distortions, and the rigidity constraints could make the mesh behave like a solid object during deformation. The experimental results demonstrate that our constraint is intuitive, easy to use and very effective.
Surface meshing with curvature convergence
Li, Huibin
2014-06-01
Surface meshing plays a fundamental role in graphics and visualization. Many geometric processing tasks involve solving geometric PDEs on meshes. The numerical stability, convergence rates and approximation errors are largely determined by the mesh qualities. In practice, Delaunay refinement algorithms offer satisfactory solutions to high quality mesh generations. The theoretical proofs for volume based and surface based Delaunay refinement algorithms have been established, but those for conformal parameterization based ones remain wide open. This work focuses on the curvature measure convergence for the conformal parameterization based Delaunay refinement algorithms. Given a metric surface, the proposed approach triangulates its conformal uniformization domain by the planar Delaunay refinement algorithms, and produces a high quality mesh. We give explicit estimates for the Hausdorff distance, the normal deviation, and the differences in curvature measures between the surface and the mesh. In contrast to the conventional results based on volumetric Delaunay refinement, our stronger estimates are independent of the mesh structure and directly guarantee the convergence of curvature measures. Meanwhile, our result on Gaussian curvature measure is intrinsic to the Riemannian metric and independent of the embedding. In practice, our meshing algorithm is much easier to implement and much more efficient. The experimental results verified our theoretical results and demonstrated the efficiency of the meshing algorithm. © 2014 IEEE.
Recursively-regular subdivisions and applications
Directory of Open Access Journals (Sweden)
Rafel Jaume
2016-05-01
Full Text Available We generalize regular subdivisions (polyhedral complexes resulting from the projection of the lower faces of a polyhedron introducing the class of recursively-regular subdivisions. Informally speaking, a recursively-regular subdivision is a subdivision that can be obtained by splitting some faces of a regular subdivision by other regular subdivisions (and continue recursively. We also define the finest regular coarsening and the regularity tree of a polyhedral complex. We prove that recursively-regular subdivisions are not necessarily connected by flips and that they are acyclic with respect to the in-front relation. We show that the finest regular coarsening of a subdivision can be efficiently computed, and that whether a subdivision is recursively regular can be efficiently decided. As an application, we also extend a theorem known since 1981 on illuminating space by cones and present connections of recursive regularity to tensegrity theory and graph-embedding problems.
Generalized B-spline subdivision-surface wavelets for geometry compression.
Bertram, Martin; Duchaineau, Mark A; Hamann, Bernd; Joy, Kenneth I
2004-01-01
We present a new construction of lifted biorthogonal wavelets on surfaces of arbitrary two-manifold topology for compression and multiresolution representation. Our method combines three approaches: subdivision surfaces of arbitrary topology, B-spline wavelets, and the lifting scheme for biorthogonal wavelet construction. The simple building blocks of our wavelet transform are local lifting operations performed on polygonal meshes with subdivision hierarchy. Starting with a coarse, irregular polyhedral base mesh, our transform creates a subdivision hierarchy of meshes converging to a smooth limit surface. At every subdivision level, geometric detail can be expanded from wavelet coefficients and added to the surface. We present wavelet constructions for bilinear, bicubic, and biquintic B-Spline subdivision. While the bilinear and bicubic constructions perform well in numerical experiments, the biquintic construction turns out to be unstable. For lossless compression, our transform can be computed in integer arithmetic, mapping integer coordinates of control points to integer wavelet coefficients. Our approach provides a highly efficient and progressive representation for complex geometries of arbitrary topology.
Performance of a streaming mesh refinement algorithm.
Energy Technology Data Exchange (ETDEWEB)
Thompson, David C.; Pebay, Philippe Pierre
2004-08-01
In SAND report 2004-1617, we outline a method for edge-based tetrahedral subdivision that does not rely on saving state or communication to produce compatible tetrahedralizations. This report analyzes the performance of the technique by characterizing (a) mesh quality, (b) execution time, and (c) traits of the algorithm that could affect quality or execution time differently for different meshes. It also details the method used to debug the several hundred subdivision templates that the algorithm relies upon. Mesh quality is on par with other similar refinement schemes and throughput on modern hardware can exceed 600,000 output tetrahedra per second. But if you want to understand the traits of the algorithm, you have to read the report!
Space subdivision for indoor applications
Zlatanova, S.; Liu, L.; Sithole, G.; Zhao, J.; Mortari, F.
2014-01-01
This report makes an overview of 2D, 2,5D and 3D approaches for indoor space subdivision for the purpose of indoor navigation. The report starts with a conceptual framework for indoor space utilisation. We introduce and elaborate on the concepts of indoor space (navigable and non-navigable), agent,
Space subdivision for indoor applications
Zlatanova, S.; Liu, L.; Sithole, G.; Zhao, J.; Mortari, F.
2014-01-01
This report makes an overview of 2D, 2,5D and 3D approaches for indoor space subdivision for the purpose of indoor navigation. The report starts with a conceptual framework for indoor space utilisation. We introduce and elaborate on the concepts of indoor space (navigable and non-navigable), agent,
Wavelet subdivision methods gems for rendering curves and surfaces
Chui, Charles
2010-01-01
OVERVIEW Curve representation and drawing Free-form parametric curves From subdivision to basis functions Wavelet subdivision and editing Surface subdivision BASIS FUNCTIONS FOR CURVE REPRESENTATION Refinability and scaling functions Generation of smooth basis functions Cardinal B-splines Stable bases for integer-shift spaces Splines and polynomial reproduction CURVE SUBDIVISION SCHEMES Subdivision matrices and stencils B-spline subdivision schemes Closed curve rendering Open curve rendering BASIS FUNCTIONS GENERATED BY SUBDIVISION MATRICES Subdivision operators The up-sampling convolution ope
Isogeometric finite element approximation of minimal surfaces based on extended loop subdivision
Pan, Qing; Chen, Chong; Xu, Guoliang
2017-08-01
In this paper, we investigate the formulation of isogeometric analysis for minimal surface models on planar bounded domains by extended Loop surface subdivision approach. The exactness of the physical domain of interest is fixed on the coarsest level of the triangular discretization with any topological structure, which is thought of as the initial control mesh of Loop subdivision. By performing extended Loop subdivision, the control mesh can be repeatedly refined, and the geometry is described as an infinite set of quartic box-spline while maintaining its original exactness. The limit function representation of extended Loop subdivision forms our finite element space, which possesses C1 smoothness and the flexibility of mesh topology. We establish its inverse inequalities which resemble the ones of general finite element spaces. We develop the approximation estimate with the aid of H1 convergence property of the corresponding linear models. It enables us to overcome the difficulty of proving the boundedness of the gradient of finite element solutions appearing in the coefficient of minimal surface models. Numerical examples are given with the comparison to the classical linear finite element method which is consistent with our theoretical results.
A LAGUERRE VORONOI BASED SCHEME FOR MESHING PARTICLE SYSTEMS.
Bajaj, Chandrajit
2005-06-01
We present Laguerre Voronoi based subdivision algorithms for the quadrilateral and hexahedral meshing of particle systems within a bounded region in two and three dimensions, respectively. Particles are smooth functions over circular or spherical domains. The algorithm first breaks the bounded region containing the particles into Voronoi cells that are then subsequently decomposed into an initial quadrilateral or an initial hexahedral scaffold conforming to individual particles. The scaffolds are subsequently refined via applications of recursive subdivision (splitting and averaging rules). Our choice of averaging rules yield a particle conforming quadrilateral/hexahedral mesh, of good quality, along with being smooth and differentiable in the limit. Extensions of the basic scheme to dynamic re-meshing in the case of addition, deletion, and moving particles are also discussed. Motivating applications of the use of these static and dynamic meshes for particle systems include the mechanics of epoxy/glass composite materials, bio-molecular force field calculations, and gas hydrodynamics simulations in cosmology.
Nanothermodynamics: a subdivision potential approach
Directory of Open Access Journals (Sweden)
R. Moussavi
2005-12-01
Full Text Available Classical thermodynamic laws and relations have been developed for macroscopic systems that satisfy the thermodynamic limit. These relations are challenged as the system size decreases to the scale of nano-systems, in which thermodynamic properties are overshadowed by system size, and the usual classical concepts of extensivity and intensivity are no longer valid. The challenges to the classical thermodynamics in relation to small systems are demonstrated, and via the approach introduced by Hill, the concept of sub-division potential is clarified in details. The fundamental thermodynamic relations are obtained using a rational-based method.
Symmetry properties of subdivision graphs
Daneshkhah, Ashraf; Devillers, Alice; Praeger, Cheryl E.
2010-01-01
The subdivision graph $S(\\Sigma)$ of a graph $\\Sigma$ is obtained from $\\Sigma$ by `adding a vertex' in the middle of every edge of $\\Si$. Various symmetry properties of $\\S(\\Sigma)$ are studied. We prove that, for a connected graph $\\Sigma$, $S(\\Sigma)$ is locally $s$-arc transitive if and only if $\\Sigma$ is $\\lceil\\frac{s+1}{2}\\rceil$-arc transitive. The diameter of $S(\\Sigma)$ is $2d+\\delta$, where $\\Sigma$ has diameter $d$ and $0\\leqslant \\delta\\leqslant 2$, and local $s$-distance transi...
Generation of Triangular Meshes for Complex Domains on the Plane
Barbara Glut; Tomasz Jurczyk
2001-01-01
Many physical phenomena can be modeled by partial differential equations. The development of numerical methods based on the spatial subdivision of a domain into finite elements immediately extended interests to the tasks of generating a mesh. With the availability of versatile field solvers and powerful computers, the simulations of ever incrcasing geometrical and physical complexity are attempted. At some point the main bottleneck becomes the mesh generation itself. The paper presents a deta...
Volumetric Virtual Environments
Institute of Scientific and Technical Information of China (English)
HE Taosong
2000-01-01
Driven by fast development of both virtual reality and volume visualization, we discuss some critical techniques towards building a volumetric VR system, specifically the modeling, rendering, and manipulations of a volumetric scene.Techniques such as voxel-based object simplification, accelerated volume rendering,fast stereo volume rendering, and volumetric "collision detection" are introduced and improved, with the idea of demonstrating the possibilities and potential benefits of incorporating volumetric models into VR systems.
Lattice Cleaving: Conforming Tetrahedral Meshes of Multimaterial Domains with Bounded Quality.
Bronson, Jonathan R; Levine, Joshua A; Whitaker, Ross T
2013-01-01
We introduce a new algorithm for generating tetrahedral meshes that conform to physical boundaries in volumetric domains consisting of multiple materials. The proposed method allows for an arbitrary number of materials, produces high-quality tetrahedral meshes with upper and lower bounds on dihedral angles, and guarantees geometric fidelity. Moreover, the method is combinatoric so its implementation enables rapid mesh construction. These meshes are structured in a way that also allows grading, in order to reduce element counts in regions of homogeneity.
Large Scale Isosurface Bicubic Subdivision-Surface Wavelets for Representation and Visualization
Energy Technology Data Exchange (ETDEWEB)
Bertram, M.; Duchaineau, M.A.; Hamann, B.; Joy, K.I.
2000-01-05
We introduce a new subdivision-surface wavelet transform for arbitrary two-manifolds with boundary that is the first to use simple lifting-style filtering operations with bicubic precision. We also describe a conversion process for re-mapping large-scale isosurfaces to have subdivision connectivity and fair parameterizations so that the new wavelet transform can be used for compression and visualization. The main idea enabling our wavelet transform is the circular symmetrization of the filters in irregular neighborhoods, which replaces the traditional separation of filters into two 1-D passes. Our wavelet transform uses polygonal base meshes to represent surface topology, from which a Catmull-Clark-style subdivision hierarchy is generated. The details between these levels of resolution are quickly computed and compactly stored as wavelet coefficients. The isosurface conversion process begins with a contour triangulation computed using conventional techniques, which we subsequently simplify with a variant edge-collapse procedure, followed by an edge-removal process. This provides a coarse initial base mesh, which is subsequently refined, relaxed and attracted in phases to converge to the contour. The conversion is designed to produce smooth, untangled and minimally-skewed parameterizations, which improves the subsequent compression after applying the transform. We have demonstrated our conversion and transform for an isosurface obtained from a high-resolution turbulent-mixing hydrodynamics simulation, showing the potential for compression and level-of-detail visualization.
Feature-Adaptive Rendering of Loop Subdivision Surfaces on Modern GPUs
Institute of Scientific and Technical Information of China (English)
黄韵岑; 冯结青; 崔元敏; 杨宝光
2014-01-01
We present a novel approach for real-time rendering Loop subdivision surfaces on modern graphics hardware. Our algorithm evaluates both positions and normals accurately, thus providing the true Loop subdivision surface. The core idea is to recursively refine irregular patches using a GPU compute kernel. All generated regular patches are then directly evaluated and rendered using the hardware tessellation unit. Our approach handles triangular control meshes of arbitrary topologies and incorporates common subdivision surface features such as semi-sharp creases and hierarchical edits. While surface rendering is accurate up to machine precision, we also enforce a consistent bitwise evaluation of positions and normals at patch boundaries. This is particularly useful in the context of displacement mapping which strictly requires matching surface normals. Furthermore, we incorporate eﬃcient level-of-detail rendering where subdivision depth and tessellation density can be adjusted on-the-fly. Overall, our algorithm provides high-quality results at real-time frame rates, thus being ideally suited to interactive rendering applications such as video games or authoring tools.
Energy Technology Data Exchange (ETDEWEB)
Mitchell, J.S.B. [State Univ. of New York, Stony Brook, NY (United States)
1996-12-31
We show that any rectilinear polygonal subdivision in the plane can be converted into a {open_quotes}guillotine{close_quote} subdivision whose length is at most twice that of the original subdivision. {open_quote}Guillotine{close_quotes} subdivisions have a simple recursive structure that allows one to search for {open_quotes}optimal{close_quotes} such subdivisions in polynomial time, using dynamic programming. In particular, a consequence of our main theorem is a very simple proof that the k-MST problem in the plane has a constant factor polynomial-time approximation algorithm, and the constant factor that we obtain is a substantial improvement over all previous bounds: We obtain a factor of 2 for the L{sub 1} metric, and a factor of 2{radical}2 for the L{sub 2} (Euclidean) metric.
... Prosthetics Hernia Surgical Mesh Implants Hernia Surgical Mesh Implants Share Tweet Linkedin Pin it More sharing options ... majority of tissue used to produce these mesh implants are from a pig (porcine) or cow (bovine) ...
Urogynecologic Surgical Mesh Implants
... Prosthetics Urogynecologic Surgical Mesh Implants Urogynecologic Surgical Mesh Implants Share Tweet Linkedin Pin it More sharing options ... majority of tissue used to produce these mesh implants are from a pig (porcine) or cow (bovine). ...
Spherical geodesic mesh generation
Energy Technology Data Exchange (ETDEWEB)
Fung, Jimmy [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Kenamond, Mark Andrew [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Burton, Donald E. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Shashkov, Mikhail Jurievich [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2015-02-27
In ALE simulations with moving meshes, mesh topology has a direct influence on feature representation and code robustness. In three-dimensional simulations, modeling spherical volumes and features is particularly challenging for a hydrodynamics code. Calculations on traditional spherical meshes (such as spin meshes) often lead to errors and symmetry breaking. Although the underlying differencing scheme may be modified to rectify this, the differencing scheme may not be accessible. This work documents the use of spherical geodesic meshes to mitigate solution-mesh coupling. These meshes are generated notionally by connecting geodesic surface meshes to produce triangular-prismatic volume meshes. This mesh topology is fundamentally different from traditional mesh topologies and displays superior qualities such as topological symmetry. This work describes the geodesic mesh topology as well as motivating demonstrations with the FLAG hydrocode.
Point Location in Disconnected Planar Subdivisions
Bose, Prosenjit; Douieb, Karim; Dujmovic, Vida; King, James; Morin, Pat
2010-01-01
Let $G$ be a (possibly disconnected) planar subdivision and let $D$ be a probability measure over $\\R^2$. The current paper shows how to preprocess $(G,D)$ into an O(n) size data structure that can answer planar point location queries over $G$. The expected query time of this data structure, for a query point drawn according to $D$, is $O(H+1)$, where $H$ is a lower bound on the expected query time of any linear decision tree for point location in $G$. This extends the results of Collette et al (2008, 2009) from connected planar subdivisions to disconnected planar subdivisions. A version of this structure, when combined with existing results on succinct point location, provides a succinct distribution-sensitive point location structure.
Deformable surface modeling based on dual subdivision
Institute of Scientific and Technical Information of China (English)
WANG Huawei; SUN Hanqiu; QIN Kaihuai
2005-01-01
Based on dual Doo-Sabin subdivision and the corresponding parameterization, a modeling technique of deformable surfaces is presented in this paper. In the proposed model, all the dynamic parameters are computed in a unified way for both non-defective and defective subdivision matrices, and central differences are used to discretize the Lagrangian dynamics equation instead of backward differences. Moreover, a local scheme is developed to solve the dynamics equation approximately, thus the order of the linear equation is reduced greatly. Therefore, the proposed model is more efficient and faster than the existing dynamic models. It can be used for deformable surface design, interactive surface editing, medical imaging and simulation.
Effect of Watertight Subdivision on Subdivision Index for Medium Size Ro–Ro Passenger Ferries
Directory of Open Access Journals (Sweden)
M. Pawlowski
2017-09-01
Full Text Available Ro-pax vessels should fulfil the requirements of the current harmonised SOLAS Convention. The study analyses the effect of various ro-pax vessel subdivision arrangements on the subdivision index. A Polish ferry was chosen as a generic ship to perform the study. For illustration of damage survivability, the attained subdivision index A was calculated for a number of modified configurations. The arrangements included single and double sides above and below the car deck, with and without a double buoyant car deck. The conclusions of the study can be used in the design of new ro-pax vessels.
Planet map generation by tetrahedral subdivision
DEFF Research Database (Denmark)
Mogensen, Torben Ægidius
2010-01-01
We present a method for generating pseudo-random, zoomable planet maps for games and art. The method is based on spatial subdivision using tetrahedrons. This ensures planet maps without discontinuities caused by mapping a flat map onto a sphere. We compare the method to other map...
Planet Map Generation by Tetrahedral Subdivision
DEFF Research Database (Denmark)
Mogensen, Torben Ægidius
2010-01-01
We present a method for generating pseudo-random, zoomable planet maps for games and art. The method is based on spatial subdivision using tetrahedrons. This ensures planet maps without discontinuities caused by mapping a flat map onto a sphere. We compare the method to other map...
29 CFR 1975.5 - States and political subdivisions thereof.
2010-07-01
... subdivisions of a State: (5) The term “employer” means a person engaged in a business affecting commerce who... “State or political subdivision of a State”, but unusual factors to the contrary in a particular case may... 29 Labor 9 2010-07-01 2010-07-01 false States and political subdivisions thereof. 1975.5...
Hash functions and triangular mesh reconstruction*1
Hrádek, Jan; Kuchař, Martin; Skala, Václav
2003-07-01
Some applications use data formats (e.g. STL file format), where a set of triangles is used to represent the surface of a 3D object and it is necessary to reconstruct the triangular mesh with adjacency information. It is a lengthy process for large data sets as the time complexity of this process is O( N log N), where N is number of triangles. Triangular mesh reconstruction is a general problem and relevant algorithms can be used in GIS and DTM systems as well as in CAD/CAM systems. Many algorithms rely on space subdivision techniques while hash functions offer a more effective solution to the reconstruction problem. Hash data structures are widely used throughout the field of computer science. The hash table can be used to speed up the process of triangular mesh reconstruction but the speed strongly depends on hash function properties. Nevertheless the design or selection of the hash function for data sets with unknown properties is a serious problem. This paper describes a new hash function, presents the properties obtained for large data sets, and discusses validity of the reconstructed surface. Experimental results proved theoretical considerations and advantages of hash function use for mesh reconstruction.
Pei Ping; YURY N. PETRENKO
2015-01-01
A Mesh network simulation framework which provides a powerful and concise modeling chain for a network structure will be introduce in this report. Mesh networks has a special topologic structure. The paper investigates a message transfer in wireless mesh network simulation and how does it works in cellular network simulation. Finally the experimental result gave us the information that mesh networks have different principle in transmission way with cellular networks in transmission, and multi...
Mesh generation in archipelagos
Terwisscha van Scheltinga, A.; Myers, P.G.; Pietrzak, J.D.
2012-01-01
A new mesh size field is presented that is specifically designed for efficient meshing of highly irregular oceanic domains: archipelagos. The new approach is based on the standard mesh size field that uses the proximity to the nearest coastline. Here, the proximities to the two nearest coastlines
Finite element mesh generation
Lo, Daniel SH
2014-01-01
Highlights the Progression of Meshing Technologies and Their ApplicationsFinite Element Mesh Generation provides a concise and comprehensive guide to the application of finite element mesh generation over 2D domains, curved surfaces, and 3D space. Organised according to the geometry and dimension of the problem domains, it develops from the basic meshing algorithms to the most advanced schemes to deal with problems with specific requirements such as boundary conformity, adaptive and anisotropic elements, shape qualities, and mesh optimization. It sets out the fundamentals of popular techniques
Volumetric composition of nanocomposites
DEFF Research Database (Denmark)
Madsen, Bo; Lilholt, Hans; Mannila, Juha
2015-01-01
Detailed characterisation of the properties of composite materials with nanoscale fibres is central for the further progress in optimization of their manufacturing and properties. In the present study, a methodology for the determination and analysis of the volumetric composition of nanocomposites...... is presented, using cellulose/epoxy and aluminosilicate/polylactate nanocomposites as case materials. The buoyancy method is used for the accurate measurements of materials density. The accuracy of the method is determined to be high, allowing the measured nanocomposite densities to be reported with 5...... significant figures. The plotting of the measured nanocomposite density as a function of the nanofibre weight content is shown to be a first good approach of assessing the porosity content of the materials. The known gravimetric composition of the nanocomposites is converted into a volumetric composition...
Mean size formula of wavelet subdivision tree on Heisenberg group
Institute of Scientific and Technical Information of China (English)
WANG Guo-mao
2008-01-01
The purpose of this paper is to investigate the mean size formula of wavelet packets (wavelet subdivision tree) on Heisenberg group. The formula is given in terms of the p-norm joint spectral radius. The vector refinement equations on Heisenberg group and the subdivision tree on the Heisenberg group are discussed. The mean size formula of wavelet packets can be used to describe the asymptotic behavior of norm of the subdivision tree.
Generation of Triangular Meshes for Complex Domains on the Plane
Directory of Open Access Journals (Sweden)
Barbara Glut
2001-01-01
Full Text Available Many physical phenomena can be modeled by partial differential equations. The development of numerical methods based on the spatial subdivision of a domain into finite elements immediately extended interests to the tasks of generating a mesh. With the availability of versatile field solvers and powerful computers, the simulations of ever incrcasing geometrical and physical complexity are attempted. At some point the main bottleneck becomes the mesh generation itself. The paper presents a detailed description of the triangular mesh generation scheme on the plane based upon the Delaunay triangulation. A mesh generator should be fully automatic and simplify input data as much as possible. It should offer rapid gradation from small to large sizes of elements. The generated mesh must be always valid and of good quality. All these requirements were taken into account during the selection and elaboration of utilized algorithms. Successive chapters describe procedures connected with the specification of a modeled domain, generation and triangulation of boundary vertices, introducing inner nodes, improving the quality of the created mesh, and renumbering of vertices.
2015-01-01
With the advances in mobile computing technologies and the growth of the Net, mobile mesh networks are going through a set of important evolutionary steps. In this paper, we survey architectural aspects of mobile mesh networks and their use cases and deployment models. Also, we survey challenging areas of mobile mesh networks and describe our vision of promising mobile services. This paper presents a basic introductory material for Masters of Open Information Technologies Lab, interested in m...
Cheng, Siu-Wing; Shewchuk, Jonathan
2013-01-01
Written by authors at the forefront of modern algorithms research, Delaunay Mesh Generation demonstrates the power and versatility of Delaunay meshers in tackling complex geometric domains ranging from polyhedra with internal boundaries to piecewise smooth surfaces. Covering both volume and surface meshes, the authors fully explain how and why these meshing algorithms work.The book is one of the first to integrate a vast amount of cutting-edge material on Delaunay triangulations. It begins with introducing the problem of mesh generation and describing algorithms for constructing Delaunay trian
Cagle, Christopher M. (Inventor); Schlecht, Robin W. (Inventor)
2014-01-01
A flexible volumetric structure has a first spring that defines a three-dimensional volume and includes a serpentine structure elongatable and compressible along a length thereof. A second spring is coupled to at least one outboard edge region of the first spring. The second spring is a sheet-like structure capable of elongation along an in-plane dimension thereof. The second spring is oriented such that its in-plane dimension is aligned with the length of the first spring's serpentine structure.
Orienting the Neighborhood: A Subdivision Energy Analysis Tool; Preprint
Energy Technology Data Exchange (ETDEWEB)
Christensen, C.; Horowitz, S.
2008-07-01
This paper describes a new computerized Subdivision Energy Analysis Tool being developed to allow users to interactively design subdivision street layouts while receiving feedback about energy impacts based on user-specified building design variants and availability of roof surfaces for photovoltaic and solar water heating systems.
The $\\gamma$-vector of a barycentric subdivision
Nevo, Eran; Tenner, Bridget Eileen
2010-01-01
We prove that the $\\gamma$-vector of the barycentric subdivision of a simplicial sphere is the $f$-vector of a balanced simplicial complex. The combinatorial basis for this work is the study of certain refinements of Eulerian numbers used by Brenti and Welker to describe the $h$-vector of the barycentric subdivision of a boolean complex.
14 CFR 93.55 - Subdivision of Terminal Area.
2010-01-01
... 14 Aeronautics and Space 2 2010-01-01 2010-01-01 false Subdivision of Terminal Area. 93.55 Section 93.55 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF TRANSPORTATION (CONTINUED... § 93.55 Subdivision of Terminal Area. The Anchorage, Alaska, Terminal Area is subdivided as follows: (a...
20 CFR 404.1219 - Dissolution of political subdivision.
2010-04-01
... 20 Employees' Benefits 2 2010-04-01 2010-04-01 false Dissolution of political subdivision. 404... Agreements Is Obtained and Continues § 404.1219 Dissolution of political subdivision. If a political... satisfactory evidence of its dissolution or nonexistence. The evidence must establish that the entity is not...
2011-11-01
triangles in two dimensions and tetrahedra ( tets ) in three dimensions. There are many other ways to discretize a region using unstructured meshes, but this...The boundary points associated with the airfoil surface were moved, but all of the interior points remained stationary , which resulted in a mesh
An Adaptive Mesh Algorithm: Mapping the Mesh Variables
Energy Technology Data Exchange (ETDEWEB)
Scannapieco, Anthony J. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2016-07-25
Both thermodynamic and kinematic variables must be mapped. The kinematic variables are defined on a separate kinematic mesh; it is the duel mesh to the thermodynamic mesh. The map of the kinematic variables is done by calculating the contributions of kinematic variables on the old thermodynamic mesh, mapping the kinematic variable contributions onto the new thermodynamic mesh and then synthesizing the mapped kinematic variables on the new kinematic mesh. In this document the map of the thermodynamic variables will be described.
Automated volumetric grid generation for finite element modeling of human hand joints
Energy Technology Data Exchange (ETDEWEB)
Hollerbach, K.; Underhill, K. [Lawrence Livermore National Lab., CA (United States); Rainsberger, R. [XYZ Scientific Applications, Inc., Livermore, CA (United States)
1995-02-01
We are developing techniques for finite element analysis of human joints. These techniques need to provide high quality results rapidly in order to be useful to a physician. The research presented here increases model quality and decreases user input time by automating the volumetric mesh generation step.
Held, Gilbert
2005-01-01
Wireless mesh networking is a new technology that has the potential to revolutionize how we access the Internet and communicate with co-workers and friends. Wireless Mesh Networks examines the concept and explores its advantages over existing technologies. This book explores existing and future applications, and examines how some of the networking protocols operate.The text offers a detailed analysis of the significant problems affecting wireless mesh networking, including network scale issues, security, and radio frequency interference, and suggests actual and potential solutions for each pro
Semi-stationary subdivision operators in geometric modeling
Institute of Scientific and Technical Information of China (English)
无
2002-01-01
Based on the view of operator, a novel uniform subdivision construction method is proposed for free form curve and surface design. This method can give an appropriate manner of parameter change in the subdivision iteration with fewer parameters and better shape control, such as building local revolving surfaces. The convergent property of order 2 subdivision surface is elegantly analyzed using computing techniques of matrix. This method is promised to be valuable in Computer Aided Design and computer graphics, due to the simplicity both in mathematical theory and practical implementation, the similarity to the B-spline curve and surface, G1 continuity, the affine invariability and local flexible control.
Mesh implants: An overview of crucial mesh parameters
Institute of Scientific and Technical Information of China (English)
Lei-Ming; Zhu; Philipp; Schuster; Uwe; Klinge
2015-01-01
Hernia repair is one of the most frequently performed surgical interventions that use mesh implants. This article evaluates crucial mesh parameters to facilitate selection of the most appropriate mesh implant, considering raw materials, mesh composition, structure parameters and mechanical parameters. A literature review was performed using the Pub Med database. The most important mesh parameters in the selection of a mesh implant are the raw material, structural parameters and mechanical parameters, which should match the physiological conditions. The structural parameters, especially the porosity, are the most important predictors of the biocompatibility performance of synthetic meshes. Meshes with large pores exhibit less inflammatory infiltrate, connective tissue and scar bridging, which allows increased soft tissue ingrowth. The raw material and combination of raw materials of the used mesh, including potential coatings and textile design, strongly impact the inflammatory reaction to the mesh. Synthetic meshes made from innovative polymers combined with surface coating have been demonstrated to exhibit advantageous behavior in specialized fields. Monofilament, largepore synthetic meshes exhibit advantages. The value of mesh classification based on mesh weight seems to be overestimated. Mechanical properties of meshes, such as anisotropy/isotropy, elasticity and tensile strength, are crucial parameters for predicting mesh performance after implantation.
Multiple sparse volumetric priors for distributed EEG source reconstruction.
Strobbe, Gregor; van Mierlo, Pieter; De Vos, Maarten; Mijović, Bogdan; Hallez, Hans; Van Huffel, Sabine; López, José David; Vandenberghe, Stefaan
2014-10-15
We revisit the multiple sparse priors (MSP) algorithm implemented in the statistical parametric mapping software (SPM) for distributed EEG source reconstruction (Friston et al., 2008). In the present implementation, multiple cortical patches are introduced as source priors based on a dipole source space restricted to a cortical surface mesh. In this note, we present a technique to construct volumetric cortical regions to introduce as source priors by restricting the dipole source space to a segmented gray matter layer and using a region growing approach. This extension allows to reconstruct brain structures besides the cortical surface and facilitates the use of more realistic volumetric head models including more layers, such as cerebrospinal fluid (CSF), compared to the standard 3-layered scalp-skull-brain head models. We illustrated the technique with ERP data and anatomical MR images in 12 subjects. Based on the segmented gray matter for each of the subjects, cortical regions were created and introduced as source priors for MSP-inversion assuming two types of head models. The standard 3-layered scalp-skull-brain head models and extended 4-layered head models including CSF. We compared these models with the current implementation by assessing the free energy corresponding with each of the reconstructions using Bayesian model selection for group studies. Strong evidence was found in favor of the volumetric MSP approach compared to the MSP approach based on cortical patches for both types of head models. Overall, the strongest evidence was found in favor of the volumetric MSP reconstructions based on the extended head models including CSF. These results were verified by comparing the reconstructed activity. The use of volumetric cortical regions as source priors is a useful complement to the present implementation as it allows to introduce more complex head models and volumetric source priors in future studies.
Botsch, Mario; Pauly, Mark; Alliez, Pierre; Levy, Bruno
2010-01-01
Geometry processing, or mesh processing, is a fast-growing area of research that uses concepts from applied mathematics, computer science, and engineering to design efficient algorithms for the acquisition, reconstruction, analysis, manipulation, simulation, and transmission of complex 3D models. Applications of geometry processing algorithms already cover a wide range of areas from multimedia, entertainment, and classical computer-aided design, to biomedical computing, reverse engineering, and scientific computing. Over the last several years, triangle meshes have become increasingly popular,
Geometrically Consistent Mesh Modification
Bonito, A.
2010-01-01
A new paradigm of adaptivity is to execute refinement, coarsening, and smoothing of meshes on manifolds with incomplete information about their geometry and yet preserve position and curvature accuracy. We refer to this collectively as geometrically consistent (GC) mesh modification. We discuss the concept of discrete GC, show the failure of naive approaches, and propose and analyze a simple algorithm that is GC and accuracy preserving. © 2010 Society for Industrial and Applied Mathematics.
A Feature-adaptive Subdivision Method for Real-time 3D Reconstruction of Repeated Topology Surfaces
Lin, Jinhua; Wang, Yanjie; Sun, Honghai
2017-03-01
It's well known that rendering for a large number of triangles with GPU hardware tessellation has made great progress. However, due to the fixed nature of GPU pipeline, many off-line methods that perform well can not meet the on-line requirements. In this paper, an optimized Feature-adaptive subdivision method is proposed, which is more suitable for reconstructing surfaces with repeated cusps or creases. An Octree primitive is established in irregular regions where there are the same sharp vertices or creases, this method can find the neighbor geometry information quickly. Because of having the same topology structure between Octree primitive and feature region, the Octree feature points can match the arbitrary vertices in feature region more precisely. In the meanwhile, the patches is re-encoded in the Octree primitive by using the breadth-first strategy, resulting in a meta-table which allows for real-time reconstruction by GPU hardware tessellation unit. There is only one feature region needed to be calculated under Octree primitive, other regions with the same repeated feature generate their own meta-table directly, the reconstruction time is saved greatly for this step. With regard to the meshes having a large number of repeated topology feature, our algorithm improves the subdivision time by 17.575% and increases the average frame drawing time by 0.2373 ms compared to the traditional FAS (Feature-adaptive Subdivision), at the same time the model can be reconstructed in a watertight manner.
The independence of initial vectors in the subdivision schemes
Institute of Scientific and Technical Information of China (English)
陈迪荣; 李落清
2002-01-01
Starting with an initial vector λ = (λ(κ))κ∈z ∈ ep(Z), the subdivision scheme generates asequence (Snaλ)∞n=1 of vectors by the subdivision operator Saλ(κ) = ∑λ(j)a(k - 2j), k ∈ Z. j∈zSubdivision schemes play an important role in computer graphics and wavelet analysis. It is very interesting tounderstand under what conditions the sequence (Snaλ)∞n=1 converges to an Lp-function in an appropriate sense.This problem has been studied extensively. In this paper we show that the subdivision scheme converges forany initial vector in ep(Z) provided that it does for one nonzero vector in that space. Moreover, if the integertranslates of the refinable function are stable, the smoothness of the limit function corresponding to the vectorλ is also independent of λ.
Cities, Towns and Villages, County subdivisions, Published in 2006, Freelance.
NSGIC GIS Inventory (aka Ramona) — This Cities, Towns and Villages dataset, was produced all or in part from Published Reports/Deeds information as of 2006. It is described as 'County subdivisions'....
Personalized heterogeneous deformable model for fast volumetric registration.
Si, Weixin; Liao, Xiangyun; Wang, Qiong; Heng, Pheng Ann
2017-02-20
Biomechanical deformable volumetric registration can help improve safety of surgical interventions by ensuring the operations are extremely precise. However, this technique has been limited by the accuracy and the computational efficiency of patient-specific modeling. This study presents a tissue-tissue coupling strategy based on penalty method to model the heterogeneous behavior of deformable body, and estimate the personalized tissue-tissue coupling parameters in a data-driven way. Moreover, considering that the computational efficiency of biomechanical model is highly dependent on the mechanical resolution, a practical coarse-to-fine scheme is proposed to increase runtime efficiency. Particularly, a detail enrichment database is established in an offline fashion to represent the mapping relationship between the deformation results of high-resolution hexahedral mesh extracted from the raw medical data and a newly constructed low-resolution hexahedral mesh. At runtime, the mechanical behavior of human organ under interactions is simulated with this low-resolution hexahedral mesh, then the microstructures are synthesized in virtue of the detail enrichment database. The proposed method is validated by volumetric registration in an abdominal phantom compression experiments. Our personalized heterogeneous deformable model can well describe the coupling effects between different tissues of the phantom. Compared with high-resolution heterogeneous deformable model, the low-resolution deformable model with our detail enrichment database can achieve 9.4× faster, and the average target registration error is 3.42 mm, which demonstrates that the proposed method shows better volumetric registration performance than state-of-the-art. Our framework can well balance the precision and efficiency, and has great potential to be adopted in the practical augmented reality image-guided robotic systems.
Orthodontic treatment alternative to a class III subdivision malocclusion
Directory of Open Access Journals (Sweden)
Guilherme Janson
2009-08-01
Full Text Available Class III malocclusions are considered one of the most complex and difficult orthodontic problems to diagnose and treat. Skeletal and/or dental asymmetries in patients presenting with Class III malocclusions can worsen the prognosis. Recognizing the dentoalveolar and skeletal characteristics of subdivision malocclusions and their treatment possibilities is essential for a favorable nonsurgical correction. Therefore, this article presents a nonsurgical asymmetric extraction approach to Class III subdivision malocclusion treatment which can significantly improve the occlusal and facial discrepancies.
46 CFR 42.09-10 - Stability, subdivision, and strength.
2010-10-01
... 46 Shipping 2 2010-10-01 2010-10-01 false Stability, subdivision, and strength. 42.09-10 Section..., subdivision, and strength. (a) All vessels. Where regulations in this part, or in part 46 of this subchapter... strength requirements are in §§ 42.09-1, 42.13-1, 42.13-5, and 42.15-1. The applicable flooded...
Performance Evaluation of Various STL File Mesh Refining Algorithms Applied for FDM-RP Process
Ledalla, Siva Rama Krishna; Tirupathi, Balaji; Sriram, Venkatesh
2016-06-01
Layered manufacturing machines use the stereolithography (STL) file to build parts. When a curved surface is converted from a computer aided design (CAD) file to STL, it results in a geometrical distortion and chordal error. Parts manufactured with this file, might not satisfy geometric dimensioning and tolerance requirements due to approximated geometry. Current algorithms built in CAD packages have export options to globally reduce this distortion, which leads to an increase in the file size and pre-processing time. In this work, different mesh subdivision algorithms are applied on STL file of a complex geometric features using MeshLab software. The mesh subdivision algorithms considered in this work are modified butterfly subdivision technique, loops sub division technique and general triangular midpoint sub division technique. A comparative study is made with respect to volume and the build time using the above techniques. It is found that triangular midpoint sub division algorithm is more suitable for the geometry under consideration. Only the wheel cap part is then manufactured on Stratasys MOJO FDM machine. The surface roughness of the part is measured on Talysurf surface roughness tester.
Documentation for MeshKit - Reactor Geometry (&mesh) Generator
Energy Technology Data Exchange (ETDEWEB)
Jain, Rajeev [Argonne National Lab. (ANL), Argonne, IL (United States); Mahadevan, Vijay [Argonne National Lab. (ANL), Argonne, IL (United States)
2015-09-30
This report gives documentation for using MeshKit’s Reactor Geometry (and mesh) Generator (RGG) GUI and also briefly documents other algorithms and tools available in MeshKit. RGG is a program designed to aid in modeling and meshing of complex/large hexagonal and rectilinear reactor cores. RGG uses Argonne’s SIGMA interfaces, Qt and VTK to produce an intuitive user interface. By integrating a 3D view of the reactor with the meshing tools and combining them into one user interface, RGG streamlines the task of preparing a simulation mesh and enables real-time feedback that reduces accidental scripting mistakes that could waste hours of meshing. RGG interfaces with MeshKit tools to consolidate the meshing process, meaning that going from model to mesh is as easy as a button click. This report is designed to explain RGG v 2.0 interface and provide users with the knowledge and skills to pilot RGG successfully. Brief documentation of MeshKit source code, tools and other algorithms available are also presented for developers to extend and add new algorithms to MeshKit. RGG tools work in serial and parallel and have been used to model complex reactor core models consisting of conical pins, load pads, several thousands of axially varying material properties of instrumentation pins and other interstices meshes.
Gill, S P D; Gibson, B K; Flynn, C; Ibata, R A; Lewis, G F; Gill, Stuart P.D.; Knebe, Alexander; Gibson, Brad K.; Flynn, Chris; Ibata, Rodrigo A.; Lewis, Geraint F.
2002-01-01
An adaptive multi grid approach to simulating the formation of structure from collisionless dark matter is described. MLAPM (Multi-Level Adaptive Particle Mesh) is one of the most efficient serial codes available on the cosmological 'market' today. As part of Swinburne University's role in the development of the Square Kilometer Array, we are implementing hydrodynamics, feedback, and radiative transfer within the MLAPM adaptive mesh, in order to simulate baryonic processes relevant to the interstellar and intergalactic media at high redshift. We will outline our progress to date in applying the existing MLAPM to a study of the decay of satellite galaxies within massive host potentials.
An Improved QTM Subdivision Model with Approximate Equal-area
Directory of Open Access Journals (Sweden)
ZHAO Xuesheng
2016-01-01
Full Text Available To overcome the defect of large area deformation in the traditional QTM subdivision model, an improved subdivision model is proposed which based on the “parallel method” and the thought of the equal area subdivision with changed-longitude-latitude. By adjusting the position of the parallel, this model ensures that the grid area between two adjacent parallels combined with no variation, so as to control area variation and variation accumulation of the QTM grid. The experimental results show that this improved model not only remains some advantages of the traditional QTM model(such as the simple calculation and the clear corresponding relationship with longitude/latitude grid, etc, but also has the following advantages: ①this improved model has a better convergence than the traditional one. The ratio of area_max/min finally converges to 1.38, far less than 1.73 of the “parallel method”; ②the grid units in middle and low latitude regions have small area variations and successive distributions; meanwhile, with the increase of subdivision level, the grid units with large variations gradually concentrate to the poles; ③the area variation of grid unit will not cumulate with the increasing of subdivision level.
Quantitative Techniques in Volumetric Analysis
Zimmerman, John; Jacobsen, Jerrold J.
1996-12-01
Quantitative Techniques in Volumetric Analysis is a visual library of techniques used in making volumetric measurements. This 40-minute VHS videotape is designed as a resource for introducing students to proper volumetric methods and procedures. The entire tape, or relevant segments of the tape, can also be used to review procedures used in subsequent experiments that rely on the traditional art of quantitative analysis laboratory practice. The techniques included are: Quantitative transfer of a solid with a weighing spoon Quantitative transfer of a solid with a finger held weighing bottle Quantitative transfer of a solid with a paper strap held bottle Quantitative transfer of a solid with a spatula Examples of common quantitative weighing errors Quantitative transfer of a solid from dish to beaker to volumetric flask Quantitative transfer of a solid from dish to volumetric flask Volumetric transfer pipet A complete acid-base titration Hand technique variations The conventional view of contemporary quantitative chemical measurement tends to focus on instrumental systems, computers, and robotics. In this view, the analyst is relegated to placing standards and samples on a tray. A robotic arm delivers a sample to the analysis center, while a computer controls the analysis conditions and records the results. In spite of this, it is rare to find an analysis process that does not rely on some aspect of more traditional quantitative analysis techniques, such as careful dilution to the mark of a volumetric flask. Figure 2. Transfer of a solid with a spatula. Clearly, errors in a classical step will affect the quality of the final analysis. Because of this, it is still important for students to master the key elements of the traditional art of quantitative chemical analysis laboratory practice. Some aspects of chemical analysis, like careful rinsing to insure quantitative transfer, are often an automated part of an instrumental process that must be understood by the
Isotopic Implicit Surface Meshing
Boissonnat, Jean-Daniel; Cohen-Steiner, David; Vegter, Gert
2004-01-01
This paper addresses the problem of piecewise linear approximation of implicit surfaces. We first give a criterion ensuring that the zero-set of a smooth function and the one of a piecewise linear approximation of it are isotopic. Then, we deduce from this criterion an implicit surface meshing algor
Gaussian curvature analysis allows for automatic block placement in multi-block hexahedral meshing.
Ramme, Austin J; Shivanna, Kiran H; Magnotta, Vincent A; Grosland, Nicole M
2011-10-01
Musculoskeletal finite element analysis (FEA) has been essential to research in orthopaedic biomechanics. The generation of a volumetric mesh is often the most challenging step in a FEA. Hexahedral meshing tools that are based on a multi-block approach rely on the manual placement of building blocks for their mesh generation scheme. We hypothesise that Gaussian curvature analysis could be used to automatically develop a building block structure for multi-block hexahedral mesh generation. The Automated Building Block Algorithm incorporates principles from differential geometry, combinatorics, statistical analysis and computer science to automatically generate a building block structure to represent a given surface without prior information. We have applied this algorithm to 29 bones of varying geometries and successfully generated a usable mesh in all cases. This work represents a significant advancement in automating the definition of building blocks.
Test Facility for Volumetric Absorber
Energy Technology Data Exchange (ETDEWEB)
Ebert, M.; Dibowski, G.; Pfander, M.; Sack, J. P.; Schwarzbozl, P.; Ulmer, S.
2006-07-01
Long-time testing of volumetric absorber modules is an inevitable measure to gain the experience and reliability required for the commercialization of the open volumetric receiver technology. While solar tower test facilities are necessary for performance measurements of complete volumetric receivers, the long-term stability of individual components can be tested in less expensive test setups. For the qualification of the aging effects of operating cycles on single elements of new absorber materials and designs, a test facility was developed and constructed in the framework of the KOSMOSOL project. In order to provide the concentrated solar radiation level, the absorber test facility is integrated into a parabolic dish system at the Plataforma Solar de Almeria (PSA) in Spain. Several new designs of ceramic absorbers were developed and tested during the last months. (Author)
Advanced Automatic Hexahedral Mesh Generation from Surface Quad Meshes
Kremer, Michael; Bommes, David; Lim, Isaak; Kobbelt, Leif
2013-01-01
International audience; A purely topological approach for the generation of hexahedral meshes from quadrilateral surface meshes of genus zero has been proposed by M. MÃ¼ller-Hannemann: in a first stage, the input surface mesh is reduced to a single hexahedron by successively eliminating loops from the dual graph of the quad mesh; in the second stage, the hexahedral mesh is constructed by extruding a layer of hexahedra for each dual loop from the first stage in reverse elimination order. In th...
Divided Spheres Geodesics and the Orderly Subdivision of the Sphere
Popko, Edward S
2012-01-01
This well-illustrated book-in color throughout-presents a thorough introduction to the mathematics of Buckminster Fuller's invention of the geodesic dome, which paved the way for a flood of practical applications as diverse as weather forecasting and fish farms. The author explains the principles of spherical design and the three main categories of subdivision based on geometric solids (polyhedra). He illustrates how basic and advanced CAD techniques apply to spherical subdivision and covers modern applications in product design, engineering, science, games, and sports balls.
Outline of The probabilistic Concept of Ship Subdivision
DEFF Research Database (Denmark)
Pawlowski, Maciej
1996-01-01
An outline of the whole probabilistic concept of ship subdivision is given, comprising the latest advances in determination of pi and s1 factors - the two probabilistic factors that form the basis of the new regulations.The method for calculating the pi factor for dry cargo ships is thoroughly...... presented and compared with the original method, developed by IMO inthe late 60's for passenger ships. After that, a review is presented of the past efforts to develop an estimate for the factor si - the most difficultand controversial part of the new subdivision regulations based on the probabilistic...... conditions, assuring a high accuracy of prediction for the si factor....
A Solution for Extremely Bended Surface in Classic Subdivision Scheme%细分方法中对显著扭曲面片的校正处理
Institute of Scientific and Technical Information of China (English)
孙林
2012-01-01
细分方法是一种从离散控制顶点集合生成曲线曲面的有效方法.经典细分方法如Doo-Sabin细分方法,Catmull细分方法,Loop细分方法等都具有便捷高效的优点而被广泛使用.这些方法对比较规则的初始网格能给出很好的细分结果,但在处理一些含有显著扭曲面片的不规则网格时得到的往往不是期望的结果.本文针对网格含有显著扭曲面片的情况,提出了一种保形性较好的面片扭曲校正方法,使得经典Doo-Sabin细分方法在处理网格中的显著扭曲面片时能够得到很好的结果.%Subdivision scheme is a powerful scheme to generate curves and surfaces from discrete sets of initial vertex. Classic subdivision scheme like Doo -Sabin scheme, Catmull scheme and LOOP scheme are convenient, efficient and widely used. Most of these classic subdivision schemes assume the initial meshes are regular without extreme surfaces. For example, classic subdivision scheme is unexpected when processes a strongly bended surface. This paper introduced a solution to keep the strongly bended surface＇s character. The solution can evolve the Doo -Sabin result on the mesh which has strongly bended surfaces.
Maric, Tomislav; Bothe, Dieter
2013-01-01
A new parallelized unsplit geometrical Volume of Fluid (VoF) algorithm with support for arbitrary unstructured meshes and dynamic local Adaptive Mesh Refinement (AMR), as well as for two and three dimensional computation is developed. The geometrical VoF algorithm supports arbitrary unstructured meshes in order to enable computations involving flow domains of arbitrary geometrical complexity. The implementation of the method is done within the framework of the OpenFOAM library for Computational Continuum Mechanics (CCM) using the C++ programming language with modern policy based design for high program code modularity. The development of the geometrical VoF algorithm significantly extends the method base of the OpenFOAM library by geometrical volumetric flux computation for two-phase flow simulations. For the volume fraction advection, a novel unsplit geometrical algorithm is developed, which inherently sustains volume conservation utilizing unique Lagrangian discrete trajectories located in the mesh points. ...
Efficient Packet Forwarding in Mesh Network
Soumen Kanrar
2012-01-01
Wireless Mesh Network (WMN) is a multi hop low cost, with easy maintenance robust network providing reliable service coverage. WMNs consist of mesh routers and mesh clients. In this architecture, while static mesh routers form the wireless backbone, mesh clients access the network through mesh routers as well as directly meshing with each other. Different from traditional wireless networks, WMN is dynamically self-organized and self-configured. In other words, the nodes in the mesh network au...
Tang, Zhao; Wei, Qingshan; Wei, Alexander
2011-12-01
Metal-mesh lithography (MML) is a practical hybrid of microcontact printing and capillary force lithography that can be applied over millimeter-sized areas with a high level of uniformity. MML can be achieved by blotting various inks onto substrates through thin copper grids, relying on preferential wetting and capillary interactions between template and substrate for pattern replication. The resulting mesh patterns, which are inverted relative to those produced by stenciling or serigraphy, can be reproduced with low micrometer resolution. MML can be combined with other surface chemistry and lift-off methods to create functional microarrays for diverse applications, such as periodic islands of gold nanorods and patterned corrals for fibroblast cell cultures.
Parallel Adaptive Mesh Refinement
Energy Technology Data Exchange (ETDEWEB)
Diachin, L; Hornung, R; Plassmann, P; WIssink, A
2005-03-04
As large-scale, parallel computers have become more widely available and numerical models and algorithms have advanced, the range of physical phenomena that can be simulated has expanded dramatically. Many important science and engineering problems exhibit solutions with localized behavior where highly-detailed salient features or large gradients appear in certain regions which are separated by much larger regions where the solution is smooth. Examples include chemically-reacting flows with radiative heat transfer, high Reynolds number flows interacting with solid objects, and combustion problems where the flame front is essentially a two-dimensional sheet occupying a small part of a three-dimensional domain. Modeling such problems numerically requires approximating the governing partial differential equations on a discrete domain, or grid. Grid spacing is an important factor in determining the accuracy and cost of a computation. A fine grid may be needed to resolve key local features while a much coarser grid may suffice elsewhere. Employing a fine grid everywhere may be inefficient at best and, at worst, may make an adequately resolved simulation impractical. Moreover, the location and resolution of fine grid required for an accurate solution is a dynamic property of a problem's transient features and may not be known a priori. Adaptive mesh refinement (AMR) is a technique that can be used with both structured and unstructured meshes to adjust local grid spacing dynamically to capture solution features with an appropriate degree of resolution. Thus, computational resources can be focused where and when they are needed most to efficiently achieve an accurate solution without incurring the cost of a globally-fine grid. Figure 1.1 shows two example computations using AMR; on the left is a structured mesh calculation of a impulsively-sheared contact surface and on the right is the fuselage and volume discretization of an RAH-66 Comanche helicopter [35]. Note the
MESH2D GRID GENERATOR DESIGN AND USE
Energy Technology Data Exchange (ETDEWEB)
Flach, G.; Smith, F.
2012-01-20
Mesh2d is a Fortran90 program designed to generate two-dimensional structured grids of the form [x(i),y(i,j)] where [x,y] are grid coordinates identified by indices (i,j). The x(i) coordinates alone can be used to specify a one-dimensional grid. Because the x-coordinates vary only with the i index, a two-dimensional grid is composed in part of straight vertical lines. However, the nominally horizontal y(i,j{sub 0}) coordinates along index i are permitted to undulate or otherwise vary. Mesh2d also assigns an integer material type to each grid cell, mtyp(i,j), in a user-specified manner. The complete grid is specified through three separate input files defining the x(i), y(i,j), and mtyp(i,j) variations. The overall mesh is constructed from grid zones that are typically then subdivided into a collection of smaller grid cells. The grid zones usually correspond to distinct materials or larger-scale geometric shapes. The structured grid zones are identified through uppercase indices (I,J). Subdivision of zonal regions into grid cells can be done uniformly, or nonuniformly using either a polynomial or geometric skewing algorithm. Grid cells may be concentrated backward, forward, or toward both ends. Figure 1 illustrates the above concepts in the context of a simple four zone grid.
24 CFR 1710.215 - Subdivision characteristics and climate.
2010-04-01
... developer's proposed plans which includes a description of the system of collecting surface waters; a... 24 Housing and Urban Development 5 2010-04-01 2010-04-01 false Subdivision characteristics and climate. 1710.215 Section 1710.215 Housing and Urban Development Regulations Relating to Housing and Urban...
Parity, cycle space, and K4-subdivisions in graphs
DEFF Research Database (Denmark)
Thomassen, Carsten
1999-01-01
. Zang). We prove the new result that every $4$-connected graph with at least three triangles contains a totally odd $K_4$-subdivision if and only if it does notcontain a vertex whose deletion results in a bipartite graph.In particular, every $4$-connected planar graph contains a totally odd $K_4...
Mesh Algorithms for PDE with Sieve I: Mesh Distribution
Directory of Open Access Journals (Sweden)
Matthew G. Knepley
2009-01-01
Full Text Available We have developed a new programming framework, called Sieve, to support parallel numerical partial differential equation(s (PDE algorithms operating over distributed meshes. We have also developed a reference implementation of Sieve in C++ as a library of generic algorithms operating on distributed containers conforming to the Sieve interface. Sieve makes instances of the incidence relation, or arrows, the conceptual first-class objects represented in the containers. Further, generic algorithms acting on this arrow container are systematically used to provide natural geometric operations on the topology and also, through duality, on the data. Finally, coverings and duality are used to encode not only individual meshes, but all types of hierarchies underlying PDE data structures, including multigrid and mesh partitions. In order to demonstrate the usefulness of the framework, we show how the mesh partition data can be represented and manipulated using the same fundamental mechanisms used to represent meshes. We present the complete description of an algorithm to encode a mesh partition and then distribute a mesh, which is independent of the mesh dimension, element shape, or embedding. Moreover, data associated with the mesh can be similarly distributed with exactly the same algorithm. The use of a high level of abstraction within the Sieve leads to several benefits in terms of code reuse, simplicity, and extensibility. We discuss these benefits and compare our approach to other existing mesh libraries.
Smooth Rotation Enhanced As-Rigid-As-Possible Mesh Animation.
Levi, Zohar; Gotsman, Craig
2015-02-01
In recent years, the As-Rigid-As-Possible (ARAP) shape deformation and shape interpolation techniques gained popularity, and the ARAP energy was successfully used in other applications as well. We improve the ARAP animation technique in two aspects. First, we introduce a new ARAP-type energy, named SR-ARAP, which has a consistent discretization for surfaces (triangle meshes). The quality of our new surface deformation scheme competes with the quality of the volumetric ARAP deformation (for tetrahedral meshes). Second, we propose a new ARAP shape interpolation method that is superior to prior art also based on the ARAP energy. This method is compatible with our new SR-ARAP energy, as well as with the ARAP volume energy.
toolkit computational mesh conceptual model.
Energy Technology Data Exchange (ETDEWEB)
Baur, David G.; Edwards, Harold Carter; Cochran, William K.; Williams, Alan B.; Sjaardema, Gregory D.
2010-03-01
The Sierra Toolkit computational mesh is a software library intended to support massively parallel multi-physics computations on dynamically changing unstructured meshes. This domain of intended use is inherently complex due to distributed memory parallelism, parallel scalability, heterogeneity of physics, heterogeneous discretization of an unstructured mesh, and runtime adaptation of the mesh. Management of this inherent complexity begins with a conceptual analysis and modeling of this domain of intended use; i.e., development of a domain model. The Sierra Toolkit computational mesh software library is designed and implemented based upon this domain model. Software developers using, maintaining, or extending the Sierra Toolkit computational mesh library must be familiar with the concepts/domain model presented in this report.
Sibeyn, J.; Rao, P; Juurlink, B.
1996-01-01
Algorithms for performing gossiping on one- and higher dimensional meshes are presented. As a routing model, we assume the practically important worm-hole routing. For one-dimensional arrays and rings, we give a novel lower bound and an asymptotically optimal gossiping algorithm for all choices of the parameters involved. For two-dimensional meshes and tori, several simple algorithms composed of one-dimensional phases are presented. For an important range of packet and mesh sizes it gives cle...
An Adaptive Mesh Algorithm: Mesh Structure and Generation
Energy Technology Data Exchange (ETDEWEB)
Scannapieco, Anthony J. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2016-06-21
The purpose of Adaptive Mesh Refinement is to minimize spatial errors over the computational space not to minimize the number of computational elements. The additional result of the technique is that it may reduce the number of computational elements needed to retain a given level of spatial accuracy. Adaptive mesh refinement is a computational technique used to dynamically select, over a region of space, a set of computational elements designed to minimize spatial error in the computational model of a physical process. The fundamental idea is to increase the mesh resolution in regions where the physical variables are represented by a broad spectrum of modes in k-space, hence increasing the effective global spectral coverage of those physical variables. In addition, the selection of the spatially distributed elements is done dynamically by cyclically adjusting the mesh to follow the spectral evolution of the system. Over the years three types of AMR schemes have evolved; block, patch and locally refined AMR. In block and patch AMR logical blocks of various grid sizes are overlaid to span the physical space of interest, whereas in locally refined AMR no logical blocks are employed but locally nested mesh levels are used to span the physical space. The distinction between block and patch AMR is that in block AMR the original blocks refine and coarsen entirely in time, whereas in patch AMR the patches change location and zone size with time. The type of AMR described herein is a locally refi ned AMR. In the algorithm described, at any point in physical space only one zone exists at whatever level of mesh that is appropriate for that physical location. The dynamic creation of a locally refi ned computational mesh is made practical by a judicious selection of mesh rules. With these rules the mesh is evolved via a mesh potential designed to concentrate the nest mesh in regions where the physics is modally dense, and coarsen zones in regions where the physics is modally
Synthesized Optimization of Triangular Mesh
Institute of Scientific and Technical Information of China (English)
HU Wenqiang; YANG Wenyu
2006-01-01
Triangular mesh is often used to describe geometric object as computed model in digital manufacture, thus the mesh model with both uniform triangular shape and excellent geometric shape is expected. But in fact, the optimization of triangular shape often is contrary with that of geometric shape. In this paper, one synthesized optimizing algorithm is presented through subdividing triangles to achieve the trade-off solution between the geometric and triangular shape optimization of mesh model. The result mesh with uniform triangular shape and excellent topology are obtained.
Vector subdivision schemes in (Lp(Rs))r(1
Institute of Scientific and Technical Information of China (English)
LI; Song(
2003-01-01
［1］Chen, D. R., Jia, R. Q., Riemenschneider, S. D., Convergence of vector subdivision schemes in Sobolev spaces,Applied and Computational Harmonic Analysis, 2002, 12: 128-149.［2］Jia, R. Q., Riemenschneider, S. D., Zhou, D. X., Vector subdivision schemes and multiple wavelets, Math.Comp., 1998, 67: 1533-1563.［3］Heil, C., Colella, D., Matrix refinement equations: existence and uniqueness, J. Fourier Anal. Appl., 1996, 2:363-377.［4］Jiang, Q. T., Multivariate matrix refinement functions with arbitrary matrix dilation, Tran. Amer. Math.Soc., 1999, 351: 2407-2438.［5］Cavaretta, A. S., Dahmen, W., Micchelli, C. A., Stationary subdivision, Memior Amer. Math. Soc., 1991, 93:1-186.［6］Goodman, T. N. T., Lee, S. L., Convergence of cascade algorithms, in Mathematical Methods for Curves and Surfaces Ⅱ (eds. Daehlen, M., Lyche, T., Schumaker, L. L.) Nashville: Vanderbilt University Press, 1998,191-212.［7］Strang, G., Nguyen, T., Wavelets and Filter Banks, Boston: Wellesley-Cambride Press, 1996.［8］Dyn, N., Gregory, J. A., Levin, D., Analysis of uniform binary subdivision schemes for cure design, Constr.Approx., 1991, 23: 127-147.［9］Jia, R. Q., Subdivision schemes in Lp spaces, Advances in Comp. Math., 1995, 3: 309-341.［10］Han, B., Jia, R. Q., Multivariate refinement equations and convergence of subdivision schemes, SIAM J. Math.Anal., 1998, 29: 1177-1199.［11］Strang, G., Eigenvalues of (↓ 2)H and convergence of cascade algorithm, IEEE. Trans. SP, 1996, 44: 233-238.［12］Lawton, W., Lee, S. L., Shen, Z. W., Convergence of multidimensional cascade algorithms, Numer. Math.,1998, 78: 427-438.［13］Long, R. L., Mo, Q., L2-convergence of vector cascade algorithm, Approx. Theory Appl., 1999, 15: 24-49.［14］Shen, Z. W., Refinable function vectors, SIAM J. Math. Anal., 1998, 29: 235-250.［15］Zhou, D. X., Norms concerning subdivision sequences and their applications in wavelets, Applied and Computationic Harmonic Analysis, 2001, 11: 329
Memoryless Routing in Convex Subdivisions: Random Walks are Optimal
Chen, Dan; Dujmovic, Vida; Morin, Pat
2009-01-01
A memoryless routing algorithm is one in which the decision about the next edge on the route to a vertex t for a packet currently located at vertex v is made based only on the coordinates of v, t, and the neighbourhood, N(v), of v. The current paper explores the limitations of such algorithms by showing that, for any (randomized) memoryless routing algorithm A, there exists a convex subdivision on which A takes Omega(n^2) expected time to route a message between some pair of vertices. Since this lower bound is matched by a random walk, this result implies that the geometric information available in convex subdivisions is not helpful for this class of routing algorithms. The current paper also shows the existence of triangulations for which the Random-Compass algorithm proposed by Bose etal (2002,2004) requires 2^{\\Omega(n)} time to route between some pair of vertices.
Stellar subdivisions and Stanley-Reisner rings of Gorenstein complexes
Boehm, Janko
2009-01-01
Unprojection theory aims to analyze and construct complicated commutative rings in terms of simpler ones. Our main result is that, on the algebraic level of Stanley-Reisner rings, stellar subdivisions of non-acyclic Gorenstein simplicial complexes correspond to unprojections of type Kustin-Miller. As an application, we inductively calculate the minimal graded free resolutions of Stanley-Reisner rings associated to stacked polytopes.
Mesh Algorithms for PDE with Sieve I: Mesh Distribution
Knepley, Matthew G
2009-01-01
We have developed a new programming framework, called Sieve, to support parallel numerical PDE algorithms operating over distributed meshes. We have also developed a reference implementation of Sieve in C++ as a library of generic algorithms operating on distributed containers conforming to the Sieve interface. Sieve makes instances of the incidence relation, or \\emph{arrows}, the conceptual first-class objects represented in the containers. Further, generic algorithms acting on this arrow container are systematically used to provide natural geometric operations on the topology and also, through duality, on the data. Finally, coverings and duality are used to encode not only individual meshes, but all types of hierarchies underlying PDE data structures, including multigrid and mesh partitions. In order to demonstrate the usefulness of the framework, we show how the mesh partition data can be represented and manipulated using the same fundamental mechanisms used to represent meshes. We present the complete des...
Prevention of Adhesion to Prosthetic Mesh
van ’t Riet, Martijne; de Vos van Steenwijk, Peggy J.; Bonthuis, Fred; Marquet, Richard L.; Steyerberg, Ewout W.; Jeekel, Johannes; Bonjer, H. Jaap
2003-01-01
Objective To assess whether use of antiadhesive liquids or coatings could prevent adhesion formation to prosthetic mesh. Summary Background Data Incisional hernia repair frequently involves the use of prosthetic mesh. However, concern exists about development of adhesions between viscera and the mesh, predisposing to intestinal obstruction or enterocutaneous fistulas. Methods In 91 rats, a defect in the muscular abdominal wall was created, and mesh was fixed intraperitoneally to cover the defect. Rats were divided in five groups: polypropylene mesh only (control group), addition of Sepracoat or Icodextrin solution to polypropylene mesh, Sepramesh (polypropylene mesh with Seprafilm coating), and Parietex composite mesh (polyester mesh with collagen coating). Seven and 30 days postoperatively, adhesions were assessed and wound healing was studied by microscopy. Results Intraperitoneal placement of polypropylene mesh was followed by bowel adhesions to the mesh in 50% of the cases. A mean of 74% of the mesh surface was covered by adhesions after 7 days, and 48% after 30 days. Administration of Sepracoat or Icodextrin solution had no influence on adhesion formation. Coated meshes (Sepramesh and Parietex composite mesh) had no bowel adhesions. Sepramesh was associated with a significant reduction of the mesh surface covered by adhesions after 7 and 30 days. Infection was more prevalent with Parietex composite mesh, with concurrent increased mesh surface covered by adhesions after 30 days (78%). Conclusions Sepramesh significantly reduced mesh surface covered by adhesions and prevented bowel adhesion to the mesh. Parietex composite mesh prevented bowel adhesions as well but increased infection rates in the current model. PMID:12496539
Continuity of non-uniform recursive subdivision surfaces
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
Since Doo-Sabin and Catmull-Clark surfaces were proposed in 1978, eigenstructure, convergence and continuity analyses of stationary subdivision have been performed very well, but it has been very difficult to prove the convergence and continuity of non-uniform recursive subdivision surfaces (NURSSes, for short) of arbitrary topology. In fact, so far a problem whether or not there exists the limit surface as well as G1 continuity of a non-uniform Catmull-Clark subdivision has not been solved yet. Here the concept of equivalent knot spacing is introduced. A new technique for eigenanalysis, convergence and continuity analyses of non-uniform Catmull-Clark surfaces is proposed such that the convergence and G1 continuity of NURSSes at extraordinary points are proved. In addition, slightly improved rules for NURSSes are developed. This offers us one more alternative for modeling free-form surfaces of arbitrary topologies with geometric features such as cusps, sharp edges, creases and darts, while elsewhere maintaining the same order of continuity as B-spline surfaces.
Continuity of non-uniform recursive subdivision surfaces
Institute of Scientific and Technical Information of China (English)
秦开怀; 王华维
2000-01-01
Since Doo-Sabin and Catmull-Clark surfaces were proposed in 1978, eigenstructure, convergence and continuity analyses of stationary subdivision have been performed very well, but it has been very difficult to prove the convergence and continuity of non-uniform recursive subdivision surfaces (NURSSes, for short) of arbitrary topology. In fact, so far a problem whether or not there exists the limit surface as well as G1 continuity of a non-uniform Catmull-Clark subdivision has not been solved yet. Here the concept of equivalent knot spacing is introduced. A new technique for eigenanaly-sis, convergence and continuity analyses of non-uniform Catmull-Clark surfaces is proposed such that the convergence and G1 continuity of NURSSes at extraordinary points are proved. In addition, slightly improved rules for NURSSes are developed. This offers us one more alternative for modeling free-form surfaces of arbitrary topologies with geometric features such as cusps, sharp edges, creases and darts, while elsewhere ma
Recursive subdivision of urban space and Zipf’s law
Chen, Yanguang; Wang, Jiejing
2014-02-01
Zipf’s law can be used to describe the rank-size distribution of cities in a region. It has seldom been employed to research urban internal structure. In this paper, we demonstrate that the space-filling process within a city follows Zipf’s law and can be characterized with the rank-size rule. A model of spatial disaggregation of urban space is presented to depict the spatial regularity of urban growth. By recursive subdivision of space, an urban region can be geometrically divided into two parts, four parts, eight parts, and so on, and form a hierarchy with cascade structure. If we rank these parts by size, the portions will conform to the Zipf distribution. By means of the GIS technique and remote sensing data, the model of recursive subdivision of urban space is applied to three cities in China. The results show that the intra-urban hierarchy complies with Zipf’s law, and the values of the rank-size scaling exponent are very close to 1. The significance of this study lies in three aspects. First, it shows that the strict subdivision of space is an efficient approach to revealing spatial order of urban form. Second, it discloses the relationships between the urban space-filling process and the rank-size rule. Third, it suggests a new way of understanding fractals, Zipf’s law, and spatial organization of urban evolution.
A subdivision algorithm for phase equilibrium calculations at high pressures
Directory of Open Access Journals (Sweden)
M. L. Corazza
2007-12-01
Full Text Available Phase equilibrium calculations at high pressures have been a continuous challenge for scientists and engineers. Traditionally, this task has been performed by solving a system of nonlinear algebraic equations originating from isofugacity equations. The reliability and accuracy of the solutions are strongly dependent on the initial guess, especially due to the fact that the phase equilibrium problems frequently have multiple roots. This work is focused on the application of a subdivision algorithm for thermodynamic calculations at high pressures. The subdivision algorithm consists in the application of successive subdivisions at a given initial interval (rectangle of variables and a systematic test to verify the existence of roots in each subinterval. If the interval checked passes in the test, then it is retained; otherwise it is discharged. The algorithm was applied for vapor-liquid, solid-fluid and solid-vapor-liquid equilibrium as well as for phase stability calculations for binary and multicomponent systems. The results show that the proposed algorithm was capable of finding all roots of all high-pressure thermodynamic problems investigated, independent of the initial guess used.
Risk Factors for Mesh Exposure after Transvaginal Mesh Surgery
Institute of Scientific and Technical Information of China (English)
Ke Niu; Yong-Xian Lu; Wen-Jie Shen; Ying-Hui Zhang; Wen-Ying Wang
2016-01-01
Background:Mesh exposure after surgery continues to be a clinical challenge for urogynecological surgeons.The purpose of this study was to explore the risk factors for polypropylene (PP) mesh exposure after transvaginal mesh (TVM) surgery.Methods:This study included 195 patients with advanced pelvic organ prolapse (POP),who underwent TVM from January 2004to December 2012 at the First Affiliated Hospital of Chinese PLA General Hospital.Clinical data were evaluated including patient's demography,TVM type,concomitant procedures,operation time,blood loss,postoperative morbidity,and mesh exposure.Mesh exposure was identified through postoperative vaginal examination.Statistical analysis was performed to identify risk factors for mesh exposure.Results:Two-hundred and nine transvaginal PP meshes were placed,including 194 in the anterior wall and 15 in the posterior wall.Concomitant tension-free vaginal tape was performed in 61 cases.The mean follow-up time was 35.1 ± 23.6 months.PP mesh exposure was identified in 32 cases (16.4％),with 31 in the anterior wall and 1 in the posterior wall.Significant difference was found in operating time and concomitant procedures between exposed and nonexposed groups (F =7.443,P =0.007;F =4.307,P =0.039,respectively).Binary logistic regression revealed that the number of concomitant procedures and operation time were risk factors for mesh exposure (P =0.001,P =0.043).Conclusion:Concomitant procedures and increased operating time increase the risk for postoperative mesh exposure in patients undergoing TVM surgery for POP.
Volumetric Three-Dimensional Display Systems
Blundell, Barry G.; Schwarz, Adam J.
2000-03-01
A comprehensive study of approaches to three-dimensional visualization by volumetric display systems This groundbreaking volume provides an unbiased and in-depth discussion on a broad range of volumetric three-dimensional display systems. It examines the history, development, design, and future of these displays, and considers their potential for application to key areas in which visualization plays a major role. Drawing substantially on material that was previously unpublished or available only in patent form, the authors establish the first comprehensive technical and mathematical formalization of the field, and examine a number of different volumetric architectures. System level design strategies are presented, from which proposals for the next generation of high-definition predictable volumetric systems are developed. To ensure that researchers will benefit from work already completed, they provide: * Descriptions of several recent volumetric display systems prepared from material supplied by the teams that created them * An abstract volumetric display system design paradigm * An historical summary of 90 years of development in volumetric display system technology * An assessment of the strengths and weaknesses of many of the systems proposed to date * A unified presentation of the underlying principles of volumetric display systems * A comprehensive bibliography Beautifully supplemented with 17 color plates that illustrate volumetric images and prototype displays, Volumetric Three-Dimensional Display Systems is an indispensable resource for professionals in imaging systems development, scientific visualization, medical imaging, computer graphics, aerospace, military planning, and CAD/CAE.
常平均曲率细分曲面的构造%Construction of Constant Mean Curvature Subdivision Surfaces
Institute of Scientific and Technical Information of China (English)
潘青; 徐国良
2011-01-01
Surfaces with constant mean curvature always arise as interfaces in many physical problems,and are the mathematical abstraction of physical soap films and soap bubbles. The flexibility and high quality of subdivision surfaces make them to be a powerful tool for designing surfaces. In this paper,we construct the constant mean curvature subdivision surfaces with given boundaries using a forthorder geometric partial differential equation deduced from a second-order energy functional and a second-order geometric partial differential equation. These equations are solved by a finite element method. We adopt the limit functions of the extended Loop's subdivision scheme as the finite element space because this scheme can treat surfaces with boundaries. The constant mean curvature subdivision surfaces can be approximately constructed with any topology of the control mesh and any shaped boundaries.%常平均曲率曲面经常作为界面出现在许多物理问题当中,是物理膜泡的一种数学抽象,而细分曲面的灵活性及其高质量的特性使得它成为一种强有力的曲面设计工具.通过给定边界,使用由一个二阶能量范函导出的四阶几何偏微分方程和一个二阶几何偏微分方程来构造常平均曲率细分曲面,这2个方程采用有限元方法求解;由于扩展的Loop细分规则能处理带边界的曲面问题,所以采用其极限形式作为有限元空间.实验结果显示,采用文中方法能够近似地构造出具有任意拓扑结构控制网格和任意形状边界的常平均曲率曲面.
Parameterization for fitting triangular mesh
Institute of Scientific and Technical Information of China (English)
LIN Hongwei; WANG Guojin; LIU Ligang; BAO Hujun
2006-01-01
In recent years, with the development of 3D data acquisition equipments, the study on reverse engineering has become more and more important. However, the existing methods for parameterization can hardly ensure that the parametric domain is rectangular, and the parametric curve grid is regular. In order to overcome these limitations, we present a novel method for parameterization of triangular meshes in this paper. The basic idea is twofold: first, because the isotherms in the steady temperature do not intersect with each other, and are distributed uniformly, no singularity (fold-over) exists in the parameterization; second, a 3D harmonic equation is solved by the finite element method to obtain the steady temperature field on a 2D triangular mesh surface with four boundaries. Therefore, our proposed method avoids the embarrassment that it is impossible to solve the 2D quasi-harmonic equation on the 2D triangular mesh without the parametric values at mesh vertices. Furthermore, the isotherms on the temperature field are taken as a set of iso-parametric curves on the triangular mesh surface. The other set of iso-parametric curves can be obtained by connecting the points with the same chord-length on the isotherms sequentially. The obtained parametric curve grid is regular, and distributed uniformly, and can map the triangular mesh surface to the unit square domain with boundaries of mesh surface to boundaries of parametric domain, which ensures that the triangular mesh surface or point cloud can be fitted with the NURBS surface.
Guaranteed-Quality Triangular Meshes
1989-04-01
Defense Ad, : ed Research P: jects Pgency or the U.S- Gower ment° iI Guaranteed-Quality Triangular Meshes DTIC ELECTE L. Paul Chew* JUL 1419891 TR 89-983 S... Wittchen , M. S. Shephard, K. R. Grice, and M. A. Yerry, Robust, geometrically based, automatic two-dimensional mesh generation, International Journal for
An Improved Moving Mesh Algorithm
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
we consider an iterative algorithm of mesh optimization for finite element solution, and give an improved moving mesh strategy that reduces rapidly the complexity and cost of solving variational problems.A numerical result is presented for a 2-dimensional problem by the improved algorithm.
Automated hexahedral mesh generation from biomedical image data: applications in limb prosthetics.
Zachariah, S G; Sanders, J E; Turkiyyah, G M
1996-06-01
A general method to generate hexahedral meshes for finite element analysis of residual limbs and similar biomedical geometries is presented. The method utilizes skeleton-based subdivision of cross-sectional domains to produce simple subdomains in which structured meshes are easily generated. Application to a below-knee residual limb and external prosthetic socket is described. The residual limb was modeled as consisting of bones, soft tissue, and skin. The prosthetic socket model comprised a socket wall with an inner liner. The geometries of these structures were defined using axial cross-sectional contour data from X-ray computed tomography, optical scanning, and mechanical surface digitization. A tubular surface representation, using B-splines to define the directrix and generator, is shown to be convenient for definition of the structure geometries. Conversion of cross-sectional data to the compact tubular surface representation is direct, and the analytical representation simplifies geometric querying and numerical optimization within the mesh generation algorithms. The element meshes remain geometrically accurate since boundary nodes are constrained to lie on the tubular surfaces. Several element meshes of increasing mesh density were generated for two residual limbs and prosthetic sockets. Convergence testing demonstrated that approximately 19 elements are required along a circumference of the residual limb surface for a simple linear elastic model. A model with the fibula absent compared with the same geometry with the fibula present showed differences suggesting higher distal stresses in the absence of the fibula. Automated hexahedral mesh generation algorithms for sliced data represent an advancement in prosthetic stress analysis since they allow rapid modeling of any given residual limb and optimization of mesh parameters.
Adaptive and Unstructured Mesh Cleaving
Bronson, Jonathan R.; Sastry, Shankar P.; Levine, Joshua A.; Whitaker, Ross T.
2015-01-01
We propose a new strategy for boundary conforming meshing that decouples the problem of building tetrahedra of proper size and shape from the problem of conforming to complex, non-manifold boundaries. This approach is motivated by the observation that while several methods exist for adaptive tetrahedral meshing, they typically have difficulty at geometric boundaries. The proposed strategy avoids this conflict by extracting the boundary conforming constraint into a secondary step. We first build a background mesh having a desired set of tetrahedral properties, and then use a generalized stenciling method to divide, or “cleave”, these elements to get a set of conforming tetrahedra, while limiting the impacts cleaving has on element quality. In developing this new framework, we make several technical contributions including a new method for building graded tetrahedral meshes as well as a generalization of the isosurface stuffing and lattice cleaving algorithms to unstructured background meshes. PMID:26137171
Mesh structure-independent modeling of patient-specific atrial fiber orientation
Directory of Open Access Journals (Sweden)
Wachter Andreas
2015-09-01
Full Text Available The fiber orientation in the atria has a significant contribution to the electrophysiologic behavior of the heart and to the genesis of arrhythmia. Atrial fiber orientation has a direct effect on excitation propagation, activation patterns and the P-wave. We present a rule-based algorithm that works robustly on different volumetric meshes composed of either isotropic hexahedra or arbitrary tetrahedra as well as on 3-dimensional triangular surface meshes in patient-specific geometric models. This method fosters the understanding of general proarrhythmic mechanisms and enhances patient-specific modeling approaches.
Directory of Open Access Journals (Sweden)
Dhia Eddine Zakaria Lacheheb
2015-06-01
Full Text Available Today, it is necessary to be thrifty for its planet, on one hand the space being a rare, non-renewable resource, and on the other hand the ecological, economic and social cost of the urban sprawl. It is commonly asserted that the promotion of a more compact and dense city has a positive effect in terms of public costs of investment, functioning and costs for the citizens and the users of the city. It is clear that the modes of urban development management have to evolve profoundly, in particular towards a densification favorable to the raising of the urban quality through an ideal urban density on the scale of the individual housing estate. The lot as an individual housing estate was adopted as an alternative development model to the collective housing, thought in an anthropocentric perspective to emerge as a quality model where the density plays an important role, by being included in operations of a global coherence, in an optimal organization without forgetting the main importance of the deadlines of construction and the finalization of the works. The image of eternal construction site inflicted to our cities explains the renewed interest for the application of the regulatory framework and the completion of these limited operations without global coherence, which are summed up in our case to a ground cut in plots of land, sold then built independently without being finished, and support the relevance of the essential question of the improvement of the outside aspect bound to the appearance which can be revealed as a so important factor for a better use and a better acceptance of its housing environment, that the ratio of a number of houses on a plot of land or the number of square meters by house. To demonstrate the impact of the completion degree of the subdivision dwellings, roads system and urban public utilities on the density or the densification and therefore on the urban quality, we studied two residential subdivisions, the private
Streaming Compression of Hexahedral Meshes
Energy Technology Data Exchange (ETDEWEB)
Isenburg, M; Courbet, C
2010-02-03
We describe a method for streaming compression of hexahedral meshes. Given an interleaved stream of vertices and hexahedral our coder incrementally compresses the mesh in the presented order. Our coder is extremely memory efficient when the input stream documents when vertices are referenced for the last time (i.e. when it contains topological finalization tags). Our coder then continuously releases and reuses data structures that no longer contribute to compressing the remainder of the stream. This means in practice that our coder has only a small fraction of the whole mesh in memory at any time. We can therefore compress very large meshes - even meshes that do not file in memory. Compared to traditional, non-streaming approaches that load the entire mesh and globally reorder it during compression, our algorithm trades a less compact compressed representation for significant gains in speed, memory, and I/O efficiency. For example, on the 456k hexahedra 'blade' mesh, our coder is twice as fast and uses 88 times less memory (only 3.1 MB) with the compressed file increasing about 3% in size. We also present the first scheme for predictive compression of properties associated with hexahedral cells.
Mesh Adaptation and Shape Optimization on Unstructured Meshes Project
National Aeronautics and Space Administration — In this SBIR CRM proposes to implement the entropy adjoint method for solution adaptive mesh refinement into the Loci/CHEM unstructured flow solver. The scheme will...
Nanowire mesh solar fuels generator
Energy Technology Data Exchange (ETDEWEB)
Yang, Peidong; Chan, Candace; Sun, Jianwei; Liu, Bin
2016-05-24
This disclosure provides systems, methods, and apparatus related to a nanowire mesh solar fuels generator. In one aspect, a nanowire mesh solar fuels generator includes (1) a photoanode configured to perform water oxidation and (2) a photocathode configured to perform water reduction. The photocathode is in electrical contact with the photoanode. The photoanode may include a high surface area network of photoanode nanowires. The photocathode may include a high surface area network of photocathode nanowires. In some embodiments, the nanowire mesh solar fuels generator may include an ion conductive polymer infiltrating the photoanode and the photocathode in the region where the photocathode is in electrical contact with the photoanode.
Recursive Subdivision of Urban Space and Zipf's law
Chen, Yanguang; Wang, Jiejing
2012-01-01
Zipf's law can be used to describe the rank-size distribution of cities in a region. It was seldom employed to research urban internal structure. In this paper, we demonstrate that the space-filling process within a city follows Zipf's law and can be characterized with the rank-size rule. A model of spatial disaggregation of urban space is presented to depict the spatial regularity of urban growth. By recursive subdivision of space, an urban region can be geometrically divided into two parts,...
Classification and treatment of Class II subdivision malocclusions.
Cassidy, Sara E; Jackson, Stona R; Turpin, David L; Ramsay, Douglas S; Spiekerman, Charles; Huang, Greg J
2014-04-01
Patients with Class II subdivision malocclusions are a challenge for clinicians because reestablishing symmetry in 1 arch or both arches is often a treatment goal. In patients with mandibular skeletal asymmetry, surgery is often a treatment option. However, patients may be unwilling to undergo surgery, and other options might have to be considered. The aim of this study was to evaluate the etiologies and outcomes of Class II subdivision patients treated at the University of Washington graduate orthodontic clinic in Seattle from 1995 through 2011. A search of patients treated between 1995 and 2011 resulted in the identification of 110 consecutively treated Class II subdivision subjects with complete records. Ninety-eight subjects could be classified into 1 of 3 groups, based on midline position and dental or skeletal etiology. Initial and final models were used to measure the peer assessment rating scores, midlines, overjet, overbite, and molar positions. Initial and final cephalograms were traced and measured. Charts were reviewed for information regarding treatment. Twenty-five percent of the 98 subjects had their maxillary and mandibular midlines coincident with the facial midline; their asymmetries were due to a maxillary posterior dental asymmetry. Another 15% had maxillary midlines deviated from their facial midlines, caused by maxillary anterior and posterior dental asymmetry. About 50% of the subjects had mandibular midlines that were not coincident with their facial midlines, and most of them exhibited some degree of mandibular skeletal asymmetry. Over the past 15 years, treatment strategies used at the University of Washington indicated trends toward less surgery, fewer extractions, less use of headgear, and more reliance on fixed functional appliances. Ideal correction of midlines was not always achieved, especially in patients with mandibular skeletal asymmetry, with undercorrection occurring more commonly than overcorrection. Final peer assessment
Areias, P.; Rabczuk, T.; de Sá, J. César
2016-12-01
We propose an alternative crack propagation algorithm which effectively circumvents the variable transfer procedure adopted with classical mesh adaptation algorithms. The present alternative consists of two stages: a mesh-creation stage where a local damage model is employed with the objective of defining a crack-conforming mesh and a subsequent analysis stage with a localization limiter in the form of a modified screened Poisson equation which is exempt of crack path calculations. In the second stage, the crack naturally occurs within the refined region. A staggered scheme for standard equilibrium and screened Poisson equations is used in this second stage. Element subdivision is based on edge split operations using a constitutive quantity (damage). To assess the robustness and accuracy of this algorithm, we use five quasi-brittle benchmarks, all successfully solved.
A new subdivision technique for grating based on CMOS microscopic imaging
Institute of Scientific and Technical Information of China (English)
Bo Yuan; Huimin Yan; Xiangqun Cao; Bin Lin
2007-01-01
We propose a new subdivision technique directly subdividing the grating stripe by using complementary metal-oxide semiconductor (CMOS) microscopic imaging system combined with image processing. The corresponding optical system, subdivision principle, and image processing methods are illuminated. The relations of systemic resolution to subdivision number, grating period, magnifying power and tilt angle are theoretically discussed and experimentally checked on the Abbe comparator. The measurement precision for displacement of the proposed subdivision system is tested in the range of 5 mm and the maximum displacement error is less than 0.4μm. The factors contributing to the systemic error are also discussed.
Mersiline mesh in premaxillary augmentation.
Foda, Hossam M T
2005-01-01
Premaxillary retrusion may distort the aesthetic appearance of the columella, lip, and nasal tip. This defect is characteristically seen in, but not limited to, patients with cleft lip nasal deformity. This study investigated 60 patients presenting with premaxillary deficiencies in which Mersiline mesh was used to augment the premaxilla. All the cases had surgery using the external rhinoplasty technique. Two methods of augmentation with Mersiline mesh were used: the Mersiline roll technique, for the cases with central symmetric deficiencies, and the Mersiline packing technique, for the cases with asymmetric deficiencies. Premaxillary augmentation with Mersiline mesh proved to be simple technically, easy to perform, and not associated with any complications. Periodic follow-up evaluation for a mean period of 32 months (range, 12-98 months) showed that an adequate degree of premaxillary augmentation was maintained with no clinically detectable resorption of the mesh implant.
A reduced volumetric expansion factor plot
Hendricks, R. C.
1979-01-01
A reduced volumetric expansion factor plot has been constructed for simple fluids which is suitable for engineering computations in heat transfer. Volumetric expansion factors have been found useful in correlating heat transfer data over a wide range of operating conditions including liquids, gases and the near critical region.
GENERATION OF IRREGULAR HEXAGONAL MESHES
Directory of Open Access Journals (Sweden)
Vlasov Aleksandr Nikolaevich
2012-07-01
Decomposition is performed in a constructive way and, as option, it involves meshless representation. Further, this mapping method is used to generate the calculation mesh. In this paper, the authors analyze different cases of mapping onto simply connected and bi-connected canonical domains. They represent forward and backward mapping techniques. Their potential application for generation of nonuniform meshes within the framework of the asymptotic homogenization theory is also performed to assess and project effective characteristics of heterogeneous materials (composites.
Study on subdivision index model for scene-based RS data%遥感分景数据的剖分索引模型
Institute of Scientific and Technical Information of China (English)
谭亚平; 程承旗; 耿晓晖
2012-01-01
With the rapid development of space technology and earth observation technology, modern remote sensing technology has been able to provide worldwide observed data collected in many means in a dynamic, fast and accurate manner. In this stage, remote sensing data increase rapidly accordingly, and how to manage and retrieve these data efficiently has become a major issue in both academic and application areas. Global Subdivision System opens up new avenues for solution to this problem. This peper studies the characteristics of scene-based remote sensing data and the features of the EMD Global Subdivision Model, and then in regard to the disadvantages of the existing index methods for remote sensing data, three index models are put forward based on the EMD Global Subdivision Model： an index model based on the mapping relationships of images and meshes, an index model based on EMD data model and an index model for global subdivision data identifiers. These three index models explore the solution to the issue in three aspects. And an application example is given to create the index of linear objects and planar objects by use of the scene-based RS data subdivision index model. This study mainly addresses the following aspects. （1） This research studies the characteristics of scene-based remote sensing data and the features of the EMD Global Subdivision Model, as well as the map- ping relationships and corresponding criteria between them. （2） In regard to the lack of space-time recording capabilities in the current storage and index methods for remote sens- ing data, an index model based on the mapping relationships of images and meshes is put forward. （3） In regard to the lack of support for multi-scale data of the current index models for remote sensing data, an index model based on EMD data model is established. （4） In regard to the lack of a unified index framework for multi-source remote sensing data, an index model for global subdivision data
Image-driven mesh optimization
Energy Technology Data Exchange (ETDEWEB)
Lindstrom, P; Turk, G
2001-01-05
We describe a method of improving the appearance of a low vertex count mesh in a manner that is guided by rendered images of the original, detailed mesh. This approach is motivated by the fact that greedy simplification methods often yield meshes that are poorer than what can be represented with a given number of vertices. Our approach relies on edge swaps and vertex teleports to alter the mesh connectivity, and uses the downhill simplex method to simultaneously improve vertex positions and surface attributes. Note that this is not a simplification method--the vertex count remains the same throughout the optimization. At all stages of the optimization the changes are guided by a metric that measures the differences between rendered versions of the original model and the low vertex count mesh. This method creates meshes that are geometrically faithful to the original model. Moreover, the method takes into account more subtle aspects of a model such as surface shading or whether cracks are visible between two interpenetrating parts of the model.
Method and system for mesh network embedded devices
Wang, Ray (Inventor)
2009-01-01
A method and system for managing mesh network devices. A mesh network device with integrated features creates an N-way mesh network with a full mesh network topology or a partial mesh network topology.
Recursive Subdivision of Urban Space and Zipf's law
Chen, Yanguang
2012-01-01
Zipf's law can be used to describe the rank-size distribution of cities in a region. It was seldom employed to research urban internal structure. In this paper, we demonstrate that the space-filling process within a city follows Zipf's law and can be characterized with the rank-size rule. A model of spatial disaggregation of urban space is presented to depict the spatial regularity of urban growth. By recursive subdivision of space, an urban region can be geometrically divided into two parts, four parts, eight parts, and so on, and form a hierarchy with cascade structure. If we rank these parts by size, the portions will conform to the Zipf distribution. By means of GIS technique and remote sensing data, the model of recursive subdivision of urban space is applied to three cities of China. The results show that the intra-urban hierarchy complies with Zipf's law, and the values of the rank-size scaling exponent are very close to 1. The significance of this study lies in three aspects. First, it shows that the ...
User Manual for the PROTEUS Mesh Tools
Energy Technology Data Exchange (ETDEWEB)
Smith, Micheal A. [Argonne National Lab. (ANL), Argonne, IL (United States); Shemon, Emily R. [Argonne National Lab. (ANL), Argonne, IL (United States)
2015-06-01
This report describes the various mesh tools that are provided with the PROTEUS code giving both descriptions of the input and output. In many cases the examples are provided with a regression test of the mesh tools. The most important mesh tools for any user to consider using are the MT_MeshToMesh.x and the MT_RadialLattice.x codes. The former allows the conversion between most mesh types handled by PROTEUS while the second allows the merging of multiple (assembly) meshes into a radial structured grid. Note that the mesh generation process is recursive in nature and that each input specific for a given mesh tool (such as .axial or .merge) can be used as “mesh” input for any of the mesh tools discussed in this manual.
3D-2D Deformable Image Registration Using Feature-Based Nonuniform Meshes.
Zhong, Zichun; Guo, Xiaohu; Cai, Yiqi; Yang, Yin; Wang, Jing; Jia, Xun; Mao, Weihua
2016-01-01
By using prior information of planning CT images and feature-based nonuniform meshes, this paper demonstrates that volumetric images can be efficiently registered with a very small portion of 2D projection images of a Cone-Beam Computed Tomography (CBCT) scan. After a density field is computed based on the extracted feature edges from planning CT images, nonuniform tetrahedral meshes will be automatically generated to better characterize the image features according to the density field; that is, finer meshes are generated for features. The displacement vector fields (DVFs) are specified at the mesh vertices to drive the deformation of original CT images. Digitally reconstructed radiographs (DRRs) of the deformed anatomy are generated and compared with corresponding 2D projections. DVFs are optimized to minimize the objective function including differences between DRRs and projections and the regularity. To further accelerate the above 3D-2D registration, a procedure to obtain good initial deformations by deforming the volume surface to match 2D body boundary on projections has been developed. This complete method is evaluated quantitatively by using several digital phantoms and data from head and neck cancer patients. The feature-based nonuniform meshing method leads to better results than either uniform orthogonal grid or uniform tetrahedral meshes.
3D-2D Deformable Image Registration Using Feature-Based Nonuniform Meshes
Directory of Open Access Journals (Sweden)
Zichun Zhong
2016-01-01
Full Text Available By using prior information of planning CT images and feature-based nonuniform meshes, this paper demonstrates that volumetric images can be efficiently registered with a very small portion of 2D projection images of a Cone-Beam Computed Tomography (CBCT scan. After a density field is computed based on the extracted feature edges from planning CT images, nonuniform tetrahedral meshes will be automatically generated to better characterize the image features according to the density field; that is, finer meshes are generated for features. The displacement vector fields (DVFs are specified at the mesh vertices to drive the deformation of original CT images. Digitally reconstructed radiographs (DRRs of the deformed anatomy are generated and compared with corresponding 2D projections. DVFs are optimized to minimize the objective function including differences between DRRs and projections and the regularity. To further accelerate the above 3D-2D registration, a procedure to obtain good initial deformations by deforming the volume surface to match 2D body boundary on projections has been developed. This complete method is evaluated quantitatively by using several digital phantoms and data from head and neck cancer patients. The feature-based nonuniform meshing method leads to better results than either uniform orthogonal grid or uniform tetrahedral meshes.
Mesh refinement strategy for optimal control problems
Paiva, Luis Tiago; Fontes, Fernando,
2013-01-01
International audience; Direct methods are becoming the most used technique to solve nonlinear optimal control problems. Regular time meshes having equidistant spacing are frequently used. However, in some cases these meshes cannot cope accurately with nonlinear behavior. One way to improve the solution is to select a new mesh with a greater number of nodes. Another way, involves adaptive mesh refinement. In this case, the mesh nodes have non equidistant spacing which allow a non uniform node...
NSGIC GIS Inventory (aka Ramona) — This Industrial Parks dataset, published at 1:2400 (1in=200ft) scale, was produced all or in part from Other information as of 2008. It is described as 'Subdivision...
NSGIC GIS Inventory (aka Ramona) — This Cities, Towns and Villages dataset, was produced all or in part from Field Survey/GPS information as of 1998. It is described as 'SubdivisionBndryAnno-The data...
Energy Technology Data Exchange (ETDEWEB)
Ha, H; Gregorski, B; Joy, K I
2004-06-24
In this paper we present an occlusion culling method that uses hardware-based depth queries on oriented bounding boxes to cull unseen geometric primitives efficiently. An out-of-core design enables this method to interactively display data sets that are too large to fit into main memory. During a preprocessing phase, a spatial subdivision (such as an octree or BSP tree) of a given data set is constructed where, for each node, an oriented bounding box containing mesh primitives is computed using principal component analysis (PCA). At runtime, the tree indicated by the spatial subdivision is traversed in front-to-back order, and only nodes that are determined to be visible, based on a hardware accelerated depth query, are rendered.
Upright, Paula A.
2009-01-01
The purpose of this study was to describe the reclassification process of Western Kentucky University's football program from the Football Championship Subdivision (FCS) to the Football Bowl Subdivision (FBS), the highest and most visible level of NCAA competition. Three research questions guided the study: (a) Why did Western Kentucky University…
Upright, Paula A.
2009-01-01
The purpose of this study was to describe the reclassification process of Western Kentucky University's football program from the Football Championship Subdivision (FCS) to the Football Bowl Subdivision (FBS), the highest and most visible level of NCAA competition. Three research questions guided the study: (a) Why did Western Kentucky University…
48 CFR 702.170-8 - Government, Federal, State, local and political subdivisions.
2010-10-01
... Government, Federal, State, local and political subdivisions. As used in the FAR and AIDAR, these terms do... 48 Federal Acquisition Regulations System 5 2010-10-01 2010-10-01 false Government, Federal, State, local and political subdivisions. 702.170-8 Section 702.170-8 Federal Acquisition Regulations...
41 CFR 105-50.001-2 - Political subdivision or local government.
2010-07-01
... local government. 105-50.001-2 Section 105-50.001-2 Public Contracts and Property Management Federal... OR TECHNICAL SERVICES TO STATE AND LOCAL UNITS OF GOVERNMENT § 105-50.001-2 Political subdivision or local government. Political subdivision or local government means a local unit of government,...
Livas, Christos; Pandis, Nikolaos; Booij, Johan Willem; Katsaros, Christos; Ren, Yijin
2015-01-01
Objective: To evaluate the long-term effects of asymmetrical maxillary first molar (M1) extraction in Class II subdivision treatment. Materials and Methods: Records of 20 Class II subdivision whites (7 boys, 13 girls; mean age, 13.0 years; SD, 1.7 years) consecutively treated with the Begg technique
40 CFR 35.6115 - Political subdivision-lead remedial Cooperative Agreements.
2010-07-01
... requirements. The political subdivision must comply with all terms and conditions in the Cooperative Agreement... 40 Protection of Environment 1 2010-07-01 2010-07-01 false Political subdivision-lead remedial... Contracts for Superfund Response Actions Remedial Response Cooperative Agreements § 35.6115...
The Functional Characteristics of the Common Subdivisions from the Dewey System
Directory of Open Access Journals (Sweden)
Zenovia Niculescu
2007-01-01
Full Text Available Within the normative architecture of the Dewey system, we meet the main determination of the common subdivisions which have specific forms of expressions. The referential values of the common subdivisions consist in the variety of reflection of different peculiar aspects of information.
Surfactant enhanced volumetric sweep efficiency
Energy Technology Data Exchange (ETDEWEB)
Harwell, J.H.; Scamehorn, J.F.
1989-10-01
Surfactant-enhanced waterflooding is a novel EOR method aimed to improve the volumetric sweep efficiencies in reservoirs. The technique depends upon the ability to induce phase changes in surfactant solutions by mixing with surfactants of opposite charge or with salts of appropriate type. One surfactant or salt solution is injected into the reservoir. It is followed later by injection of another surfactant or salt solution. The sequence of injections is arranged so that the two solutions do not mix until they are into the permeable regions well away from the well bore. When they mix at this point, by design they form a precipitate or gel-like coacervate phase, plugging this permeable region, forcing flow through less permeable regions of the reservoir, improving sweep efficiency. The selectivity of the plugging process is demonstrated by achieving permeability reductions in the high permeable regions of Berea sandstone cores. Strategies were set to obtain a better control over the plug placement and the stability of plugs. A numerical simulator has been developed to investigate the potential increases in oil production of model systems. Furthermore, the hardness tolerance of anionic surfactant solutions is shown to be enhanced by addition of monovalent electrolyte or nonionic surfactants. 34 refs., 32 figs., 8 tabs.
Connectivity editing for quadrilateral meshes
Peng, Chihan
2011-12-12
We propose new connectivity editing operations for quadrilateral meshes with the unique ability to explicitly control the location, orientation, type, and number of the irregular vertices (valence not equal to four) in the mesh while preserving sharp edges. We provide theoretical analysis on what editing operations are possible and impossible and introduce three fundamental operations to move and re-orient a pair of irregular vertices. We argue that our editing operations are fundamental, because they only change the quad mesh in the smallest possible region and involve the fewest irregular vertices (i.e., two). The irregular vertex movement operations are supplemented by operations for the splitting, merging, canceling, and aligning of irregular vertices. We explain how the proposed highlevel operations are realized through graph-level editing operations such as quad collapses, edge flips, and edge splits. The utility of these mesh editing operations are demonstrated by improving the connectivity of quad meshes generated from state-of-art quadrangulation techniques. © 2011 ACM.
Connectivity editing for quadrilateral meshes
Peng, Chihan
2011-12-01
We propose new connectivity editing operations for quadrilateral meshes with the unique ability to explicitly control the location, orientation, type, and number of the irregular vertices (valence not equal to four) in the mesh while preserving sharp edges. We provide theoretical analysis on what editing operations are possible and impossible and introduce three fundamental operations to move and re-orient a pair of irregular vertices. We argue that our editing operations are fundamental, because they only change the quad mesh in the smallest possible region and involve the fewest irregular vertices (i.e., two). The irregular vertex movement operations are supplemented by operations for the splitting, merging, canceling, and aligning of irregular vertices. We explain how the proposed high-level operations are realized through graph-level editing operations such as quad collapses, edge flips, and edge splits. The utility of these mesh editing operations are demonstrated by improving the connectivity of quad meshes generated from state-of-art quadrangulation techniques.
Mesh Router Nodes placement in Rural Wireless Mesh Networks
Ebongue, Jean Louis Fendji Kedieng; Thron, Christopher; Nlong, Jean Michel
2015-01-01
The problem of placement of mesh router nodes in Wireless Mesh Networks is known to be a NP hard problem. In this paper, the problem is addressed under a constraint of network model tied to rural regions where we usually observe low density and sparse population. We consider the area to cover as decomposed into a set of elementary areas which can be required or optional in terms of coverage and where a node can be placed or not. We propose an effective algorithm to ensure the coverage. This a...
Directory of Open Access Journals (Sweden)
Magda Dettlaff
2016-01-01
Full Text Available Given a graph \\(G=(V,E\\, the subdivision of an edge \\(e=uv\\in E(G\\ means the substitution of the edge \\(e\\ by a vertex \\(x\\ and the new edges \\(ux\\ and \\(xv\\. The domination subdivision number of a graph \\(G\\ is the minimum number of edges of \\(G\\ which must be subdivided (where each edge can be subdivided at most once in order to increase the domination number. Also, the domination multisubdivision number of \\(G\\ is the minimum number of subdivisions which must be done in one edge such that the domination number increases. Moreover, the concepts of paired domination and independent domination subdivision (respectively multisubdivision numbers are defined similarly. In this paper we study the domination, paired domination and independent domination (subdivision and multisubdivision numbers of the generalized corona graphs.
DEFF Research Database (Denmark)
Otten, Roald; Tol, Johannes L; Holmich, Per
2015-01-01
of the individual GM subdivisions. The second aim was to evaluate differences in sEMG activation levels between the tested and contralateral (stabilizing) leg. METHOD: Twenty healthy physically active male subjects participated in this study. Muscle activity using sEMG was recorded for the GM subdivisions in 8......STUDY DESIGN: Cross-sectional. CONTEXT: Gluteus medius (GM) muscle dysfunction is associated with overuse injury. The GM is functionally composed of 3 separate subdivisions: anterior, middle, and posterior. Clinical assessment of the GM subdivisions is relevant to detect strength and activation...... deficits and guide specific rehabilitation programs. However, the optimal positions for assessing the strength and activation of these subdivisions are unknown. OBJECTIVE: The first aim was to establish which strength-testing positions produce the highest surface electromyography (sEMG) activation levels...
Efficient Packet Forwarding in Mesh Network
Kanrar, Soumen
2012-01-01
Wireless Mesh Network (WMN) is a multi hop low cost, with easy maintenance robust network providing reliable service coverage. WMNs consist of mesh routers and mesh clients. In this architecture, while static mesh routers form the wireless backbone, mesh clients access the network through mesh routers as well as directly meshing with each other. Different from traditional wireless networks, WMN is dynamically self-organized and self-configured. In other words, the nodes in the mesh network automatically establish and maintain network connectivity. Over the years researchers have worked, to reduce the redundancy in broadcasting packet in the mesh network in the wireless domain for providing reliable service coverage, the source node deserves to broadcast or flood the control packets. The redundant control packet consumes the bandwidth of the wireless medium and significantly reduces the average throughput and consequently reduces the overall system performance. In this paper I study the optimization problem in...
On Linear Spaces of Polyhedral Meshes.
Poranne, Roi; Chen, Renjie; Gotsman, Craig
2015-05-01
Polyhedral meshes (PM)-meshes having planar faces-have enjoyed a rise in popularity in recent years due to their importance in architectural and industrial design. However, they are also notoriously difficult to generate and manipulate. Previous methods start with a smooth surface and then apply elaborate meshing schemes to create polyhedral meshes approximating the surface. In this paper, we describe a reverse approach: given the topology of a mesh, we explore the space of possible planar meshes having that topology. Our approach is based on a complete characterization of the maximal linear spaces of polyhedral meshes contained in the curved manifold of polyhedral meshes with a given topology. We show that these linear spaces can be described as nullspaces of differential operators, much like harmonic functions are nullspaces of the Laplacian operator. An analysis of this operator provides tools for global and local design of a polyhedral mesh, which fully expose the geometric possibilities and limitations of the given topology.
Interactive Display of Surfaces Using Subdivision Surfaces and Wavelets
Energy Technology Data Exchange (ETDEWEB)
Duchaineau, M A; Bertram, M; Porumbescu, S; Hamann, B; Joy, K I
2001-10-03
Complex surfaces and solids are produced by large-scale modeling and simulation activities in a variety of disciplines. Productive interaction with these simulations requires that these surfaces or solids be viewable at interactive rates--yet many of these surfaced solids can contain hundreds of millions of polygondpolyhedra. Interactive display of these objects requires compression techniques to minimize storage, and fast view-dependent triangulation techniques to drive the graphics hardware. In this paper, we review recent advances in subdivision-surface wavelet compression and optimization that can be used to provide a framework for both compression and triangulation. These techniques can be used to produce suitable approximations of complex surfaces of arbitrary topology, and can be used to determine suitable triangulations for display. The techniques can be used in a variety of applications in computer graphics, computer animation and visualization.
Processes and subdivisions in diogenites, a multivariate statistical analysis
Harriott, T. A.; Hewins, R. H.
1984-01-01
Multivariate statistical techniques used on diogenite orthopyroxene analyses show the relationships that occur within diogenites and the two orthopyroxenite components (class I and II) in the polymict diogenite Garland. Cluster analysis shows that only Peckelsheim is similar to Garland class I (Fe-rich) and the other diogenites resemble Garland class II. The unique diogenite Y 75032 may be related to type I by fractionation. Factor analysis confirms the subdivision and shows that Fe does not correlate with the weakly incompatible elements across the entire pyroxene composition range, indicating that igneous fractionation is not the process controlling total diogenite composition variation. The occurrence of two groups of diogenites is interpreted as the result of sampling or mixing of two main sequences of orthopyroxene cumulates with slightly different compositions.
Laser Based 3D Volumetric Display System
1993-03-01
Literature, Costa Mesa, CA July 1983. 3. "A Real Time Autostereoscopic Multiplanar 3D Display System", Rodney Don Williams, Felix Garcia, Jr., Texas...8217 .- NUMBERS LASER BASED 3D VOLUMETRIC DISPLAY SYSTEM PR: CD13 0. AUTHOR(S) PE: N/AWIU: DN303151 P. Soltan, J. Trias, W. Robinson, W. Dahlke 7...laser generated 3D volumetric images on a rotating double helix, (where the 3D displays are computer controlled for group viewing with the naked eye
Optimization-based Fluid Simulation on Unstructured Meshes
DEFF Research Database (Denmark)
Misztal, Marek Krzysztof; Bridson, Robert; Erleben, Kenny;
We present a novel approach to fluid simulation, allowing us to take into account the surface energy in a pre- cise manner. This new approach combines a novel, topology-adaptive approach to deformable interface track- ing, called the deformable simplicial complexes method (DSC) with an optimization......-based, linear finite element method for solving the incompressible Euler equations. The deformable simplicial complexes track the surface of the fluid: the fluid-air interface is represented explicitly as a piecewise linear surface which is a subset of tetra- hedralization of the space, such that the interface...... can be also represented implicitly as a set of faces separating tetrahedra marked as inside from the ones marked as outside. This representation introduces insignificant and con- trollable numerical diffusion, allows robust topological adaptivity and provides both a volumetric finite element mesh...
A technical assistance on data collection on subdivision of wet-system apparatuses.
Energy Technology Data Exchange (ETDEWEB)
NONE
2001-09-01
In the Ningyo-Toge Environmental Engineering Center, development on subdivision engineering system for abolition of nuclear fuel facilities has been promoted. However, data on subdivision of instruments and apparatuses to be carried out as a part of the abolition was insufficient. Therefore, here was intended to investigate data collections so as to use subdivision of a wet-system apparatuses of the smelting conversion facility begun on June, 2000, as a field of data collection as effectively as possible, on construction of the system rationally supporting abolition of nuclear fuel facility promoted at the Ningyo-Toge Environmental Engineering Center. This subdivision of the wet-system apparatuses of the facility is programmed to carry out the subdivision for two years of 2000 and 2001 fiscal years. Its working procedure is begun from non-polluted matters (electrics, instruments, and utility pipings) at every rooms to carry out appliances using uranium. Here were reported on present states survey of the subdivision, kinds and frequencies of data at the subdivision, data collection manual, and rationalization of data recording method. (G.K.)
Inching toward 'push-button' meshing
National Research Council Canada - National Science Library
James Masters
2015-01-01
While "push-button" meshing remains an elusive goal, advances in 2015 have brought the technology to the point where meshes can be constructed with relative ease when appropriate surfaces are available...
Particle Collection Efficiency for Nylon Mesh Screens
Cena, Lorenzo G.; Ku, Bon-Ki; Peters, Thomas M.
2011-01-01
Mesh screens composed of nylon fibers leave minimal residual ash and produce no significant spectral interference when ashed for spectrometric examination. These characteristics make nylon mesh screens attractive as a collection substrate for nanoparticles. A theoretical single-fiber efficiency expression developed for wire-mesh screens was evaluated for estimating the collection efficiency of submicrometer particles for nylon mesh screens. Pressure drop across the screens, the effect of part...
6th International Meshing Roundtable '97
Energy Technology Data Exchange (ETDEWEB)
White, D.
1997-09-01
The goal of the 6th International Meshing Roundtable is to bring together researchers and developers from industry, academia, and government labs in a stimulating, open environment for the exchange of technical information related to the meshing process. In the pas~ the Roundtable has enjoyed significant participation born each of these groups from a wide variety of countries. The Roundtable will consist of technical presentations from contributed papers and abstracts, two invited speakers, and two invited panels of experts discussing topics related to the development and use of automatic mesh generation tools. In addition, this year we will feature a "Bring Your Best Mesh" competition and poster session to encourage discussion and participation from a wide variety of mesh generation tool users. The schedule and evening social events are designed to provide numerous opportunities for informal dialog. A proceedings will be published by Sandia National Laboratories and distributed at the Roundtable. In addition, papers of exceptionally high quaIity will be submitted to a special issue of the International Journal of Computational Geometry and Applications. Papers and one page abstracts were sought that present original results on the meshing process. Potential topics include but are got limited to: Unstructured triangular and tetrahedral mesh generation Unstructured quadrilateral and hexahedral mesh generation Automated blocking and structured mesh generation Mixed element meshing Surface mesh generation Geometry decomposition and clean-up techniques Geometry modification techniques related to meshing Adaptive mesh refinement and mesh quality control Mesh visualization Special purpose meshing algorithms for particular applications Theoretical or novel ideas with practical potential Technical presentations from industrial researchers.
2010-10-01
... 50 Wildlife and Fisheries 7 2010-10-01 2010-10-01 false Mesh size. 300.110 Section 300.110... Antarctic Marine Living Resources § 300.110 Mesh size. (a) The use of pelagic and bottom trawls having the mesh size in any part of a trawl less than indicated is prohibited for any directed fishing for the...
Markov Random Fields on Triangle Meshes
DEFF Research Database (Denmark)
Andersen, Vedrana; Aanæs, Henrik; Bærentzen, Jakob Andreas
2010-01-01
mesh edges according to a feature detecting prior. Since we should not smooth across a sharp feature, we use edge labels to control the vertex process. In a Bayesian framework, MRF priors are combined with the likelihood function related to the mesh formation method. The output of our algorithm...... is a piecewise smooth mesh with explicit labelling of edges belonging to the sharp features....
Mesh network achieve its fuction on Linux
Pei Ping; PETRENKO Y.N.
2015-01-01
In this paper, we introduce a Mesh network protocol evaluation and development. It has a special protocol. We could easily understand the Linux operation principles which are in use in mesh network. In addition to our comprehension, we describe the graph which shows package routing way. At last according to testing we prove that Mesh protocol AODV satisfy Linux platform performance requirements.
The mesh network protocol evaluation and development
Pei Ping; PETRENKO Y.N.
2015-01-01
In this paper, we introduce a Mesh network protocol evaluation and development. It has a special protocol. We could easily to understand that how different protocols are used in mesh network. In addition to our comprehension, Multi – hop routing protocol could provide robustness and load balancing to communication in wireless mesh networks.
User Manual for the PROTEUS Mesh Tools
Energy Technology Data Exchange (ETDEWEB)
Smith, Micheal A. [Argonne National Lab. (ANL), Argonne, IL (United States); Shemon, Emily R [Argonne National Lab. (ANL), Argonne, IL (United States)
2016-09-19
PROTEUS is built around a finite element representation of the geometry for visualization. In addition, the PROTEUS-SN solver was built to solve the even-parity transport equation on a finite element mesh provided as input. Similarly, PROTEUS-MOC and PROTEUS-NEMO were built to apply the method of characteristics on unstructured finite element meshes. Given the complexity of real world problems, experience has shown that using commercial mesh generator to create rather simple input geometries is overly complex and slow. As a consequence, significant effort has been put into place to create multiple codes that help assist in the mesh generation and manipulation. There are three input means to create a mesh in PROTEUS: UFMESH, GRID, and NEMESH. At present, the UFMESH is a simple way to generate two-dimensional Cartesian and hexagonal fuel assembly geometries. The UFmesh input allows for simple assembly mesh generation while the GRID input allows the generation of Cartesian, hexagonal, and regular triangular structured grid geometry options. The NEMESH is a way for the user to create their own mesh or convert another mesh file format into a PROTEUS input format. Given that one has an input mesh format acceptable for PROTEUS, we have constructed several tools which allow further mesh and geometry construction (i.e. mesh extrusion and merging). This report describes the various mesh tools that are provided with the PROTEUS code giving both descriptions of the input and output. In many cases the examples are provided with a regression test of the mesh tools. The most important mesh tools for any user to consider using are the MT_MeshToMesh.x and the MT_RadialLattice.x codes. The former allows the conversion between most mesh types handled by PROTEUS while the second allows the merging of multiple (assembly) meshes into a radial structured grid. Note that the mesh generation process is recursive in nature and that each input specific for a given mesh tool (such as .axial
Laser Subdivision of the Genesis Concentrator Target Sample 60000
Lauer, Howard V., Jr.; Burkett, P. J.; Rodriquez, M. C.; Nakamura-Messenger, K.; Clemett, S. J.; Gonzales, C. P.; Allton, J. H.; McNamara, K. M.; See, T. H.
2013-01-01
The Genesis Allocation Committee received a request for 1 square centimeter of the diamond-like-carbon (DLC) concentrator target for the analysis of solar wind nitrogen isotopes. The target consists of a single crystal float zone (FZ) silicon substrate having a thickness on the order of 550 micrometers with a 1.5-3.0 micrometer-thick coating of DLC on the exposed surface. The solar wind is implanted shallowly in the front side DLC. The original target was a circular quadrant with a radius of 3.1 cm; however, the piece did not survive intact when the spacecraft suffered an anomalous landing upon returning to Earth on September 8, 2004. An estimated 75% of the DLC target was recovered in at least 18 fragments. The largest fragment, Genesis sample 60000, has been designated for this allocation and is the first sample to be subdivided using our laser scribing system Laser subdivision has associated risks including thermal diffusion of the implant if heating occurs and unintended breakage during cleavage. A careful detailed study and considerable subdividing practice using non-flight FZ diamond on silicon, DOS, wafers has considerably reduced the risk of unplanned breakage during the cleaving process. In addition, backside scribing reduces the risk of possible thermal excursions affecting the implanted solar wind, implanted shallowly in the front side DLC.
Mamy, Laurent; Letouzey, Vincent; Lavigne, Jean-Philippe; Garric, Xavier; Gondry, Jean; Mares, Pierre; De Tayrac, Renaud
2010-01-01
International audience; INTRODUCTION AND HYPOTHESIS: The aim of this study was to evaluate a link between mesh infection and shrinkage. METHODS: Twenty-eight Wistar rats were implanted with synthetic meshes that were either non-absorbable (polypropylene (PP), n = 14) or absorbable (poly (D: ,L: -lactic acid) (PLA94), n = 14). A validated animal incisionnal abdominal hernia model of mesh infection was used. Fourteen meshes (n = 7 PLA94 and n = 7 PP meshes) were infected intraoperatively with 1...
Confined helium on Lagrange meshes
Baye, Daniel
2015-01-01
The Lagrange-mesh method has the simplicity of a calculation on a mesh and can have the accuracy of a variational method. It is applied to the study of a confined helium atom. Two types of confinement are considered. Soft confinements by potentials are studied in perimetric coordinates. Hard confinement in impenetrable spherical cavities is studied in a system of rescaled perimetric coordinates varying in [0,1] intervals. Energies and mean values of the distances between electrons and between an electron and the helium nucleus are calculated. A high accuracy of 11 to 15 significant figures is obtained with small computing times. Pressures acting on the confined atom are also computed. For sphere radii smaller than 1, their relative accuracies are better than $10^{-10}$. For larger radii up to 10, they progressively decrease to $10^{-3}$, still improving the best literature results.
21st International Meshing Roundtable
Weill, Jean-Christophe
2013-01-01
This volume contains the articles presented at the 21st International Meshing Roundtable (IMR) organized, in part, by Sandia National Laboratories and was held on October 7–10, 2012 in San Jose, CA, USA. The first IMR was held in 1992, and the conference series has been held annually since. Each year the IMR brings together researchers, developers, and application experts in a variety of disciplines, from all over the world, to present and discuss ideas on mesh generation and related topics. The technical papers in this volume present theoretical and novel ideas and algorithms with practical potential, as well as technical applications in science and engineering, geometric modeling, computer graphics, and visualization.
The moving mesh code Shadowfax
Vandenbroucke, Bert
2016-01-01
We introduce the moving mesh code Shadowfax, which can be used to evolve a mixture of gas, subject to the laws of hydrodynamics and gravity, and any collisionless fluid only subject to gravity, such as cold dark matter or stars. The code is written in C++ and its source code is made available to the scientific community under the GNU Affero General Public License. We outline the algorithm and the design of our implementation, and demonstrate its validity through the results of a set of basic test problems, which are also part of the public version. We also compare Shadowfax with a number of other publicly available codes using different hydrodynamical integration schemes, illustrating the advantages and disadvantages of the moving mesh technique.
The moving mesh code SHADOWFAX
Vandenbroucke, B.; De Rijcke, S.
2016-07-01
We introduce the moving mesh code SHADOWFAX, which can be used to evolve a mixture of gas, subject to the laws of hydrodynamics and gravity, and any collisionless fluid only subject to gravity, such as cold dark matter or stars. The code is written in C++ and its source code is made available to the scientific community under the GNU Affero General Public Licence. We outline the algorithm and the design of our implementation, and demonstrate its validity through the results of a set of basic test problems, which are also part of the public version. We also compare SHADOWFAX with a number of other publicly available codes using different hydrodynamical integration schemes, illustrating the advantages and disadvantages of the moving mesh technique.
On the flexibility of Kokotsakis meshes
Karpenkov, Oleg
2008-01-01
In this paper we study geometric, algebraic, and computational aspects of flexibility and infinitesimal flexibility of Kokotsakis meshes. A Kokotsakis mesh is a mesh that consists of a face in the middle and a certain band of faces attached to the middle face by its perimeter. In particular any 3x3-mesh made of quadrangles is a Kokotsakis mesh. We express the infinitesimal flexibility condition in terms of Ceva and Menelaus theorems. Further we study semi-algebraic properties of the set of fl...
Research of subdivision driving technology for brushless DC motors in optical fiber positioning
Kan, Yi; Gu, Yonggang; Zhu, Ye; Zhai, Chao
2016-07-01
In fiber spectroscopic telescopes, optical fiber positioning units are used to position thousands of fibers on the focal plane quickly and precisely. Stepper motors are used in existing units, however, it has some inherent deficiencies, such as serious heating and low efficiency. In this work, the universally adopted subdivision driving technology for stepper motors is transplanted to brushless DC motors. It keeps the advantages of stepper motors such as high positioning accuracy and resolution, while overcomes the disadvantages mentioned above. Thus, this research mainly focuses on develop a novel subdivision driving technology for brushless DC motor. By the proving of experiments of online debug and subdivision speed and position, the proposed brushless DC motor subdivision technology can achieve the expected functions.
2010-10-01
... board (c) An existing sailing school vessel which is required to meet a one compartment subdivision..., be fitted with a collision bulkhead and sufficient air tankage or other internal buoyancy to...
Image meshing via hierarchical optimization
Institute of Scientific and Technical Information of China (English)
Hao XIE; Ruo-feng TONG‡
2016-01-01
Vector graphic, as a kind of geometric representation of raster images, has many advantages, e.g., defi nition independence and editing facility. A popular way to convert raster images into vector graphics is image meshing, the aim of which is to fi nd a mesh to represent an image as faithfully as possible. For traditional meshing algorithms, the crux of the problem resides mainly in the high non-linearity and non-smoothness of the objective, which makes it diﬃcult to fi nd a desirable optimal solution. To ameliorate this situation, we present a hierarchical optimization algorithm solving the problem from coarser levels to fi ner ones, providing initialization for each level with its coarser ascent. To further simplify the problem, the original non-convex problem is converted to a linear least squares one, and thus becomes convex, which makes the problem much easier to solve. A dictionary learning framework is used to combine geometry and topology elegantly. Then an alternating scheme is employed to solve both parts. Experiments show that our algorithm runs fast and achieves better results than existing ones for most images.
Image meshing via hierarchical optimization＊
Institute of Scientific and Technical Information of China (English)
Hao XIE; Ruo-feng TONGS
2016-01-01
Vector graphic, as a kind of geometric representation of raster images, has many advantages, e.g., definition independence and editing facility. A popular way to convert raster images into vector graphics is image meshing, the aim of which is to find a mesh to represent an image as faithfully as possible. For traditional meshing algorithms, the crux of the problem resides mainly in the high non-linearity and non-smoothness of the objective, which makes it difficult to find a desirable optimal solution. To ameliorate this situation, we present a hierarchical optimization algorithm solving the problem from coarser levels to finer ones, providing initialization for each level with its coarser ascent. To further simplify the problem, the original non-convex problem is converted to a linear least squares one, and thus becomes convex, which makes the problem much easier to solve. A dictionary learning framework is used to combine geometry and topology elegantly. Then an alternating scheme is employed to solve both parts. Experiments show that our algorithm runs fast and achieves better results than existing ones for most images.
Soto, Dan; Le Helloco, Antoine; Clanet, Cristophe; Quere, David; Varanasi, Kripa
2016-11-01
A drop thrown against a mesh can pass through its holes if impacting with enough inertia. As a result, although part of the droplet may remain on one side of the sieve, the rest will end up grated through the other side. This inexpensive method to break up millimetric droplets into micrometric ones may be of particular interest in a wide variety of applications: enhancing evaporation of droplets launched from the top of an evaporative cooling tower or preventing drift of pesticides sprayed above crops by increasing their initial size and atomizing them at the very last moment with a mesh. In order to understand how much liquid will be grated we propose in this presentation to start first by studying a simpler situation: a drop impacting a plate pierced with a single off centered hole. The study of the role of natural parameters such as the radius drop and speed or the hole position, size and thickness allows us to discuss then the more general situation of a plate pierced with multiple holes: the mesh.
Nonequilibrium volumetric response of shocked polymers
Energy Technology Data Exchange (ETDEWEB)
Clements, B E [Los Alamos National Laboratory
2009-01-01
Polymers are well known for their non-equilibrium deviatoric behavior. However, investigations involving both high rate shock experiments and equilibrium measured thermodynamic quantities remind us that the volumetric behavior also exhibits a non-equilibrium response. Experiments supporting the notion of a non-equilibrium volumetric behavior will be summarized. Following that discussion, a continuum-level theory is proposed that will account for both the equilibrium and non-equilibrium response. Upon finding agreement with experiment, the theory is used to study the relaxation of a shocked polymer back towards its shocked equilibrium state.
Dynamic mesh for TCAD modeling with ECORCE
Michez, A.; Boch, J.; Touboul, A.; Saigné, F.
2016-08-01
Mesh generation for TCAD modeling is challenging. Because densities of carriers can change by several orders of magnitude in thin areas, a significant change of the solution can be observed for two very similar meshes. The mesh must be defined at best to minimize this change. To address this issue, a criterion based on polynomial interpolation on adjacent nodes is proposed that adjusts accurately the mesh to the gradients of Degrees of Freedom. Furthermore, a dynamic mesh that follows changes of DF in DC and transient mode is a powerful tool for TCAD users. But, in transient modeling, adding nodes to a mesh induces oscillations in the solution that appears as spikes at the current collected at the contacts. This paper proposes two schemes that solve this problem. Examples show that using these techniques, the dynamic mesh generator of the TCAD tool ECORCE handle semiconductors devices in DC and transient mode.
SHARP/PRONGHORN Interoperability: Mesh Generation
Energy Technology Data Exchange (ETDEWEB)
Avery Bingham; Javier Ortensi
2012-09-01
Progress toward collaboration between the SHARP and MOOSE computational frameworks has been demonstrated through sharing of mesh generation and ensuring mesh compatibility of both tools with MeshKit. MeshKit was used to build a three-dimensional, full-core very high temperature reactor (VHTR) reactor geometry with 120-degree symmetry, which was used to solve a neutron diffusion critical eigenvalue problem in PRONGHORN. PRONGHORN is an application of MOOSE that is capable of solving coupled neutron diffusion, heat conduction, and homogenized flow problems. The results were compared to a solution found on a 120-degree, reflected, three-dimensional VHTR mesh geometry generated by PRONGHORN. The ability to exchange compatible mesh geometries between the two codes is instrumental for future collaboration and interoperability. The results were found to be in good agreement between the two meshes, thus demonstrating the compatibility of the SHARP and MOOSE frameworks. This outcome makes future collaboration possible.
Cluster parallel rendering based on encoded mesh
Institute of Scientific and Technical Information of China (English)
QIN Ai-hong; XIONG Hua; PENG Hao-yu; LIU Zhen; SHI Jiao-ying
2006-01-01
Use of compressed mesh in parallel rendering architecture is still an unexplored area, the main challenge of which is to partition and sort the encoded mesh in compression-domain. This paper presents a mesh compression scheme PRMC (Parallel Rendering based Mesh Compression) supplying encoded meshes that can be partitioned and sorted in parallel rendering system even in encoded-domain. First, we segment the mesh into submeshes and clip the submeshes' boundary into Runs, and then piecewise compress the submeshes and Runs respectively. With the help of several auxiliary index tables, compressed submeshes and Runs can serve as rendering primitives in parallel rendering system. Based on PRMC, we design and implement a parallel rendering architecture. Compared with uncompressed representation, experimental results showed that PRMC meshes applied in cluster parallel rendering system can dramatically reduce the communication requirement.
Stability of class II subdivision malocclusion treatment with 3 and 4 premolar extractions
2014-01-01
Background The purpose of this study was to compare the occlusal stability of class II subdivision malocclusion treatment with 3 and 4 first premolar extractions. A sample of 156 dental casts from 52 patients with class II subdivision malocclusion was divided into two groups according to the extraction protocol. Group 1 comprised 24 patients treated with 3 premolar extractions and group 2 included 28 patients treated with 4 premolar extractions. Methods Peer assessment rating (PAR) indexes we...
Stability Verification for Energy-Aware Hydraulic Pressure Control via Simplicial Subdivision
DEFF Research Database (Denmark)
Sloth, Christoffer; Wisniewski, Rafael
2015-01-01
This paper presents a linear programming-based method for finding Lyapunov functions of dynamical systems with polynomial vector fields. We propose to utilize a certificate of positivity in the Bernstein basis based on subdivisioning to find a Lyapunov function. The subdivision-based method...... is proposed since it has better degree bounds than similar methods based on degree elevation. The proposed method is successfully applied to find a Lyapunov function for a pressure controlled water distribution system....
Directory of Open Access Journals (Sweden)
O'Sullivan Kieran
2010-07-01
Full Text Available Abstract Background Gluteus medius (GM dysfunction is associated with many musculoskeletal disorders. Rehabilitation exercises aimed at strengthening GM appear to improve lower limb kinematics and reduce pain. However, there is a lack of evidence to identify which exercises best activate GM. In particular, as GM consists of three distinct subdivisions, it is unclear if GM activation is consistent across these subdivisions during exercise. The aim of this study was to determine the activation of the anterior, middle and posterior subdivisions of GM during weight-bearing exercises. Methods A single session, repeated-measures design. The activity of each GM subdivision was measured in 15 pain-free subjects using surface electromyography (sEMG during three weight-bearing exercises; wall squat (WS, pelvic drop (PD and wall press (WP. Muscle activity was expressed relative to maximum voluntary isometric contraction (MVIC. Differences in muscle activation were determined using one-way repeated measures ANOVA with post-hoc Bonferroni analysis. Results The activation of each GM subdivision during the exercises was significantly different (interaction effect; p Discussion Posterior GM displayed higher activation across all three exercises than both anterior and middle GM. The WP produced the highest %MVIC activation for all GM subdivisions, and this was most pronounced for posterior GM. Clinicians may use these results to effectively progress strengthening exercises for GM in the rehabilitation of lower extremity injuries.
Balla, Andrea; Quaresima, Silvia; Smolarek, Sebastian; Shalaby, Mostafa; Missori, Giulia; Sileri, Pierpaolo
2017-04-01
This review reports the incidence of mesh-related erosion after ventral mesh rectopexy to determine whether any difference exists in the erosion rate between synthetic and biological mesh. A systematic search of the MEDLINE and the Ovid databases was conducted to identify suitable articles published between 2004 and 2015. The search strategy capture terms were laparoscopic ventral mesh rectopexy, laparoscopic anterior rectopexy, robotic ventral rectopexy, and robotic anterior rectopexy. Eight studies (3,956 patients) were included in this review. Of those patients, 3,517 patients underwent laparoscopic ventral rectopexy (LVR) using synthetic mesh and 439 using biological mesh. Sixty-six erosions were observed with synthetic mesh (26 rectal, 32 vaginal, 8 recto-vaginal fistulae) and one (perineal erosion) with biological mesh. The synthetic and the biological mesh-related erosion rates were 1.87% and 0.22%, respectively. The time between rectopexy and diagnosis of mesh erosion ranged from 1.7 to 124 months. No mesh-related mortalities were reported. The incidence of mesh-related erosion after LVR is low and is more common after the placement of synthetic mesh. The use of biological mesh for LVR seems to be a safer option; however, large, multicenter, randomized, control trials with long follow-ups are required if a definitive answer is to be obtained.
Process conditions and volumetric composition in composites
DEFF Research Database (Denmark)
Madsen, Bo
2013-01-01
The obtainable volumetric composition in composites is linked to the gravimetric composition, and it is influenced by the conditions of the manufacturing process. A model for the volumetric composition is presented, where the volume fractions of fibers, matrix and porosity are calculated as a fun...... is increased. Altogether, the model is demonstrated to be a valuable tool for a quantitative analysis of the effect of process conditions. Based on the presented findings and considerations, examples of future work are mentioned for the further improvement of the model.......The obtainable volumetric composition in composites is linked to the gravimetric composition, and it is influenced by the conditions of the manufacturing process. A model for the volumetric composition is presented, where the volume fractions of fibers, matrix and porosity are calculated...... as a function of the fiber weight fraction, and where parameters are included for the composite microstructure, and the fiber assembly compaction behavior. Based on experimental data of composites manufactured with different process conditions, together with model predictions, different types of process related...
Indexing Volumetric Shapes with Matching and Packing.
Koes, David Ryan; Camacho, Carlos J
2015-04-01
We describe a novel algorithm for bulk-loading an index with high-dimensional data and apply it to the problem of volumetric shape matching. Our matching and packing algorithm is a general approach for packing data according to a similarity metric. First an approximate k-nearest neighbor graph is constructed using vantage-point initialization, an improvement to previous work that decreases construction time while improving the quality of approximation. Then graph matching is iteratively performed to pack related items closely together. The end result is a dense index with good performance. We define a new query specification for shape matching that uses minimum and maximum shape constraints to explicitly specify the spatial requirements of the desired shape. This specification provides a natural language for performing volumetric shape matching and is readily supported by the geometry-based similarity search (GSS) tree, an indexing structure that maintains explicit representations of volumetric shape. We describe our implementation of a GSS tree for volumetric shape matching and provide a comprehensive evaluation of parameter sensitivity, performance, and scalability. Compared to previous bulk-loading algorithms, we find that matching and packing can construct a GSS-tree index in the same amount of time that is denser, flatter, and better performing, with an observed average performance improvement of 2X.
Directory of Open Access Journals (Sweden)
Jennings Jason
2010-01-01
Full Text Available Laparoscopic inguinal herniorraphy via a transabdominal preperitoneal (TAPP approach using Polypropylene Mesh (Mesh and staples is an accepted technique. Mesh induces a localised inflammatory response that may extend to, and involve, adjacent abdominal and pelvic viscera such as the appendix. We present an interesting case of suspected Mesh-induced appendicitis treated successfully with laparoscopic appendicectomy, without Mesh removal, in an elderly gentleman who presented with symptoms and signs of acute appendicitis 18 months after laparoscopic inguinal hernia repair. Possible mechanisms for Mesh-induced appendicitis are briefly discussed.
Bucki, M; Bucki, Marek; Payan, Yohan
2005-01-01
In this paper, we address the problem of automatic mesh generation for finite elements modeling of anatomical organs for which a volumetric data set is available. In the first step a set of characteristic outlines of the organ is defined manually or automatically within the volume. The outlines define the "key frames" that will guide the procedure of surface reconstruction. Then, based on this information, and along with organ surface curvature information extracted from the volume data, a 3D scalar field is generated. This field allows a 3D reconstruction of the organ: as an iso-surface model, using a marching cubes algorithm; or as a 3D mesh, using a grid "immersion" technique, the field value being used as the outside/inside test. The final reconstruction respects the various topological changes that occur within the organ, such as holes and branching elements.
An effective quadrilateral mesh adaptation
Institute of Scientific and Technical Information of China (English)
KHATTRI Sanjay Kumar
2006-01-01
Accuracy of a simulation strongly depends on the grid quality. Here, quality means orthogonality at the boundaries and quasi-orthogonality within the critical regions, smoothness, bounded aspect ratios and solution adaptive behaviour. It is not recommended to refine the parts of the domain where the solution shows little variation. It is desired to concentrate grid points and cells in the part of the domain where the solution shows strong gradients or variations. We present a simple, effective and computationally efficient approach for quadrilateral mesh adaptation. Several numerical examples are presented for supporting our claim.
Bluetooth Low Energy Mesh Networks: A Survey.
Darroudi, Seyed Mahdi; Gomez, Carles
2017-06-22
Bluetooth Low Energy (BLE) has gained significant momentum. However, the original design of BLE focused on star topology networking, which limits network coverage range and precludes end-to-end path diversity. In contrast, other competing technologies overcome such constraints by supporting the mesh network topology. For these reasons, academia, industry, and standards development organizations have been designing solutions to enable BLE mesh networks. Nevertheless, the literature lacks a consolidated view on this emerging area. This paper comprehensively surveys state of the art BLE mesh networking. We first provide a taxonomy of BLE mesh network solutions. We then review the solutions, describing the variety of approaches that leverage existing BLE functionality to enable BLE mesh networks. We identify crucial aspects of BLE mesh network solutions and discuss their advantages and drawbacks. Finally, we highlight currently open issues.
Mesh networking optimized for robotic teleoperation
Hart, Abraham; Pezeshkian, Narek; Nguyen, Hoa
2012-06-01
Mesh networks for robot teleoperation pose different challenges than those associated with traditional mesh networks. Unmanned ground vehicles (UGVs) are mobile and operate in constantly changing and uncontrollable environments. Building a mesh network to work well under these harsh conditions presents a unique challenge. The Manually Deployed Communication Relay (MDCR) mesh networking system extends the range of and provides non-line-of-sight (NLOS) communications for tactical and explosive ordnance disposal (EOD) robots currently in theater. It supports multiple mesh nodes, robots acting as nodes, and works with all Internet Protocol (IP)-based robotic systems. Under MDCR, the performance of different routing protocols and route selection metrics were compared resulting in a modified version of the Babel mesh networking protocol. This paper discusses this and other topics encountered during development and testing of the MDCR system.
MPDATA error estimator for mesh adaptivity
Szmelter, Joanna; Smolarkiewicz, Piotr K.
2006-04-01
In multidimensional positive definite advection transport algorithm (MPDATA) the leading error as well as the first- and second-order solutions are known explicitly by design. This property is employed to construct refinement indicators for mesh adaptivity. Recent progress with the edge-based formulation of MPDATA facilitates the use of the method in an unstructured-mesh environment. In particular, the edge-based data structure allows for flow solvers to operate on arbitrary hybrid meshes, thereby lending itself to implementations of various mesh adaptivity techniques. A novel unstructured-mesh nonoscillatory forward-in-time (NFT) solver for compressible Euler equations is used to illustrate the benefits of adaptive remeshing as well as mesh movement and enrichment for the efficacy of MPDATA-based flow solvers. Validation against benchmark test cases demonstrates robustness and accuracy of the approach.
Bluetooth Low Energy Mesh Networks: A Survey
Darroudi, Seyed Mahdi; Gomez, Carles
2017-01-01
Bluetooth Low Energy (BLE) has gained significant momentum. However, the original design of BLE focused on star topology networking, which limits network coverage range and precludes end-to-end path diversity. In contrast, other competing technologies overcome such constraints by supporting the mesh network topology. For these reasons, academia, industry, and standards development organizations have been designing solutions to enable BLE mesh networks. Nevertheless, the literature lacks a consolidated view on this emerging area. This paper comprehensively surveys state of the art BLE mesh networking. We first provide a taxonomy of BLE mesh network solutions. We then review the solutions, describing the variety of approaches that leverage existing BLE functionality to enable BLE mesh networks. We identify crucial aspects of BLE mesh network solutions and discuss their advantages and drawbacks. Finally, we highlight currently open issues. PMID:28640183
Unstructured Polyhedral Mesh Thermal Radiation Diffusion
Energy Technology Data Exchange (ETDEWEB)
Palmer, T.S.; Zika, M.R.; Madsen, N.K.
2000-07-27
Unstructured mesh particle transport and diffusion methods are gaining wider acceptance as mesh generation, scientific visualization and linear solvers improve. This paper describes an algorithm that is currently being used in the KULL code at Lawrence Livermore National Laboratory to solve the radiative transfer equations. The algorithm employs a point-centered diffusion discretization on arbitrary polyhedral meshes in 3D. We present the results of a few test problems to illustrate the capabilities of the radiation diffusion module.
Delaunay triangulation and computational fluid dynamics meshes
Posenau, Mary-Anne K.; Mount, David M.
1992-01-01
In aerospace computational fluid dynamics (CFD) calculations, the Delaunay triangulation of suitable quadrilateral meshes can lead to unsuitable triangulated meshes. Here, we present case studies which illustrate the limitations of using structured grid generation methods which produce points in a curvilinear coordinate system for subsequent triangulations for CFD applications. We discuss conditions under which meshes of quadrilateral elements may not produce a Delaunay triangulation suitable for CFD calculations, particularly with regard to high aspect ratio, skewed quadrilateral elements.
Design of electrospinning mesh devices
Russo, Giuseppina; Peters, Gerrit W. M.; Solberg, Ramon H. M.; Vittoria, Vittoria
2012-07-01
This paper describes the features of new membranes that can act as local biomedical devices owing to their peculiar shape in the form of mesh structure. These materials are designed to provide significant effects to reduce local inflammations and improve the tissue regeneration. Lamellar Hydrotalcite loaded with Diclofenac Sodium (HTLc-DIK) was homogenously dispersed inside a polymeric matrix of Poly-caprolactone (PCL) to manufacture membranes by electrospinning technique. The experimental procedure and the criteria employed have shown to be extremely effective at increasing potentiality and related applications. The employed technique has proved to be very useful to manufacture polymeric fibers with diameters in the range of nano-micro scale. In this work a dedicated collector based on a proprietary technology of IME Technologies and Eindhoven University of Technology (TU/e) was used. It allowed to obtain devices with a macro shape of a 3D-mesh. Atomic Force Microscopy (AFM) highlights a very interesting texture of the electrospun fibers. They show a lamellar morphology that is only slightly modified by the inclusion of the interclay embedded in the devices to control the drug release phenomena.
Conformal refinement of unstructured quadrilateral meshes
Energy Technology Data Exchange (ETDEWEB)
Garmella, Rao [Los Alamos National Laboratory
2009-01-01
We present a multilevel adaptive refinement technique for unstructured quadrilateral meshes in which the mesh is kept conformal at all times. This means that the refined mesh, like the original, is formed of only quadrilateral elements that intersect strictly along edges or at vertices, i.e., vertices of one quadrilateral element do not lie in an edge of another quadrilateral. Elements are refined using templates based on 1:3 refinement of edges. We demonstrate that by careful design of the refinement and coarsening strategy, we can maintain high quality elements in the refined mesh. We demonstrate the method on a number of examples with dynamically changing refinement regions.
MOAB : a mesh-oriented database.
Energy Technology Data Exchange (ETDEWEB)
Tautges, Timothy James; Ernst, Corey; Stimpson, Clint; Meyers, Ray J.; Merkley, Karl
2004-04-01
A finite element mesh is used to decompose a continuous domain into a discretized representation. The finite element method solves PDEs on this mesh by modeling complex functions as a set of simple basis functions with coefficients at mesh vertices and prescribed continuity between elements. The mesh is one of the fundamental types of data linking the various tools in the FEA process (mesh generation, analysis, visualization, etc.). Thus, the representation of mesh data and operations on those data play a very important role in FEA-based simulations. MOAB is a component for representing and evaluating mesh data. MOAB can store structured and unstructured mesh, consisting of elements in the finite element 'zoo'. The functional interface to MOAB is simple yet powerful, allowing the representation of many types of metadata commonly found on the mesh. MOAB is optimized for efficiency in space and time, based on access to mesh in chunks rather than through individual entities, while also versatile enough to support individual entity access. The MOAB data model consists of a mesh interface instance, mesh entities (vertices and elements), sets, and tags. Entities are addressed through handles rather than pointers, to allow the underlying representation of an entity to change without changing the handle to that entity. Sets are arbitrary groupings of mesh entities and other sets. Sets also support parent/child relationships as a relation distinct from sets containing other sets. The directed-graph provided by set parent/child relationships is useful for modeling topological relations from a geometric model or other metadata. Tags are named data which can be assigned to the mesh as a whole, individual entities, or sets. Tags are a mechanism for attaching data to individual entities and sets are a mechanism for describing relations between entities; the combination of these two mechanisms is a powerful yet simple interface for representing metadata or application
Lin, Chao-Yuan; Fu, Kuei-Lin; Lin, Cheng-Yu
2016-11-01
Recent extreme rainfall events led to many landslides due to climate changes in Taiwan. How to effectively promote post-disaster treatment and/or management works in a watershed/drainage basin is a crucial issue. Regarding the processes of watershed treatment and/or management works, disaster hotspot scanning and treatment priority setup should be carried out in advance. A scanning method using landslide ratio to determine the appropriate outlet of an interested watershed, and an optimal subdivision system with better homogeneity and accuracy in landslide ratio estimation were developed to help efficient executions of treatment and/or management works. Topography is a key factor affecting watershed landslide ratio. Considering the complexity and uncertainty of the natural phenomenon, multivariate analysis was applied to understand the relationship between topographic factors and landslide ratio in the interested watershed. The concept of species-area curve, which is usually adopted at on-site vegetation investigation to determinate the suitable quadrate size, was used to derive the optimal threshold in subdivisions. Results show that three main component axes including factors of scale, network and shape extracted from Digital Terrain Model coupled with areas of landslide can effectively explain the characteristics of landslide ratio in the interested watershed, and a relation curve obtained from the accuracy of landslide ratio classification and number of subdivisions could be established to derive optimal subdivision of the watershed. The subdivision method promoted in this study could be further used for priority rank and benefit assessment of landslide treatment in a watershed.
Improved Implementation of Point Location in General Two-Dimensional Subdivisions
Hemmer, Michael; Halperin, Dan
2012-01-01
We present a major revamp of the point-location data structure for general two-dimensional subdivisions via randomized incremental construction, implemented in CGAL, the Computational Geometry Algorithms Library. We can now guarantee that the constructed directed acyclic graph G is of linear size and provides logarithmic query time. Via the construction of the Voronoi diagram for a given point set S of size n, this also enables nearest-neighbor queries in guaranteed O(log n) time. Another major innovation is the support of general unbounded subdivisions as well as subdivisions of two-dimensional parametric surfaces such as spheres, tori, cylinders. The implementation is exact, complete, and general; i.e., it can also handle non-linear subdivisions. Like the previous version, the data structure supports modifications of the subdivision, such as insertions and deletions of edges, after the initial preprocessing. A major challenge is to retain the expected O(n log n) preprocessing time while providing the above ...
Lyon, David C; Jain, Neeraj; Kaas, Jon H
2003-12-22
Tree shrews are highly visual mammals closely related to primates. They have a large visual pulvinar complex, but its organization and relation to visual cortex is only partly known. We processed brain sections through the pulvinar with seven different procedures in an effort to reveal histologically distinct compartments. The results revealed three major subdivisions. A dorsal subdivision, Pd, stains darkly for acetylcholinesterase (AChE) and occupies the dorsoposterior one-third of the pulvinar complex. A ventral subdivision, Pv, stains darkly when processed with the Cat-301 antibody and occupies the ventroanterior fifth of the pulvinar complex along the brachium of the superior colliculus. Unexpectedly, part of Pv is ventral to the brachium. A large central subdivision, Pc, stains moderately dark for AChE and cytochrome oxidase (CO), and very light for Cat-301. Pc includes about half of the pulvinar complex, with parts on both sides of the brachium of the superior colliculus. These architectonic results demonstrate that the pulvinar complex of tree shrews is larger and has more subdivisions than previously described. The complex resembles the pulvinar of primates by having a portion ventral to the brachium and by having histochemically distinct nuclei; the number of nuclei is less than in primates, however.
Mesh Exposure and Associated Risk Factors in Women Undergoing Transvaginal Prolapse Repair with Mesh
Directory of Open Access Journals (Sweden)
Elizabeth A. Frankman
2013-01-01
Full Text Available Objective. To determine frequency, rate, and risk factors associated with mesh exposure in women undergoing transvaginal prolapse repair with polypropylene mesh. Methods. Retrospective chart review was performed for all women who underwent Prolift Pelvic Floor Repair System (Gynecare, Somerville, NJ between September 2005 and September 2008. Multivariable logistic regression was performed to identify risk factors for mesh exposure. Results. 201 women underwent Prolift. Mesh exposure occurred in 12% (24/201. Median time to mesh exposure was 62 days (range: 10–372. When mesh was placed in the anterior compartment, the frequency of mesh exposure was higher than that when mesh was placed in the posterior compartment (8.7% versus 2.9%, P=0.04. Independent risk factors for mesh exposure were diabetes (AOR = 7.7, 95% CI 1.6–37.6; P=0.01 and surgeon (AOR = 7.3, 95% CI 1.9–28.6; P=0.004. Conclusion. Women with diabetes have a 7-fold increased risk for mesh exposure after transvaginal prolapse repair using Prolift. The variable rate of mesh exposure amongst surgeons may be related to technique. The anterior vaginal wall may be at higher risk of mesh exposure as compared to the posterior vaginal wall.
Tensile Behaviour of Welded Wire Mesh and Hexagonal Metal Mesh for Ferrocement Application
Tanawade, A. G.; Modhera, C. D.
2017-08-01
Tension tests were conducted on welded mesh and hexagonal Metal mesh. Welded Mesh is available in the market in different sizes. The two types are analysed viz. Ø 2.3 mm and Ø 2.7 mm welded mesh, having opening size 31.75 mm × 31.75 mm and 25.4 mm × 25.4 mm respectively. Tensile strength test was performed on samples of welded mesh in three different orientations namely 0°, 30° and 45° degrees with the loading axis and hexagonal Metal mesh of Ø 0.7 mm, having opening 19.05 × 19.05 mm. Experimental tests were conducted on samples of these meshes. The objective of this study was to investigate the behaviour of the welded mesh and hexagonal Metal mesh. The result shows that the tension load carrying capacity of welded mesh of Ø 2.7 mm of 0° orientation is good as compared to Ø2.3 mm mesh and ductility of hexagonal Metal mesh is good in behaviour.
Combined surface and volumetric occlusion shading
Schott, Matthias O.
2012-02-01
In this paper, a method for interactive direct volume rendering is proposed that computes ambient occlusion effects for visualizations that combine both volumetric and geometric primitives, specifically tube shaped geometric objects representing streamlines, magnetic field lines or DTI fiber tracts. The proposed algorithm extends the recently proposed Directional Occlusion Shading model to allow the rendering of those geometric shapes in combination with a context providing 3D volume, considering mutual occlusion between structures represented by a volume or geometry. © 2012 IEEE.
MR volumetric assessment of endolymphatic hydrops
Energy Technology Data Exchange (ETDEWEB)
Guerkov, R.; Berman, A.; Jerin, C.; Krause, E. [University of Munich, Department of Otorhinolaryngology Head and Neck Surgery, Grosshadern Medical Centre, Munich (Germany); University of Munich, German Centre for Vertigo and Balance Disorders, Grosshadern Medical Centre, Marchioninistr. 15, 81377, Munich (Germany); Dietrich, O.; Flatz, W.; Ertl-Wagner, B. [University of Munich, Institute of Clinical Radiology, Grosshadern Medical Centre, Munich (Germany); Keeser, D. [University of Munich, Institute of Clinical Radiology, Grosshadern Medical Centre, Munich (Germany); University of Munich, German Centre for Vertigo and Balance Disorders, Grosshadern Medical Centre, Marchioninistr. 15, 81377, Munich (Germany); University of Munich, Department of Psychiatry and Psychotherapy, Innenstadtkliniken Medical Centre, Munich (Germany)
2014-10-16
We aimed to volumetrically quantify endolymph and perilymph spaces of the inner ear in order to establish a methodological basis for further investigations into the pathophysiology and therapeutic monitoring of Meniere's disease. Sixteen patients (eight females, aged 38-71 years) with definite unilateral Meniere's disease were included in this study. Magnetic resonance (MR) cisternography with a T2-SPACE sequence was combined with a Real reconstruction inversion recovery (Real-IR) sequence for delineation of inner ear fluid spaces. Machine learning and automated local thresholding segmentation algorithms were applied for three-dimensional (3D) reconstruction and volumetric quantification of endolymphatic hydrops. Test-retest reliability was assessed by the intra-class coefficient; correlation of cochlear endolymph volume ratio with hearing function was assessed by the Pearson correlation coefficient. Endolymph volume ratios could be reliably measured in all patients, with a mean (range) value of 15 % (2-25) for the cochlea and 28 % (12-40) for the vestibulum. Test-retest reliability was excellent, with an intra-class coefficient of 0.99. Cochlear endolymphatic hydrops was significantly correlated with hearing loss (r = 0.747, p = 0.001). MR imaging after local contrast application and image processing, including machine learning and automated local thresholding, enable the volumetric quantification of endolymphatic hydrops. This allows for a quantitative assessment of the effect of therapeutic interventions on endolymphatic hydrops. (orig.)
Adaptive mesh refinement in titanium
Energy Technology Data Exchange (ETDEWEB)
Colella, Phillip; Wen, Tong
2005-01-21
In this paper, we evaluate Titanium's usability as a high-level parallel programming language through a case study, where we implement a subset of Chombo's functionality in Titanium. Chombo is a software package applying the Adaptive Mesh Refinement methodology to numerical Partial Differential Equations at the production level. In Chombo, the library approach is used to parallel programming (C++ and Fortran, with MPI), whereas Titanium is a Java dialect designed for high-performance scientific computing. The performance of our implementation is studied and compared with that of Chombo in solving Poisson's equation based on two grid configurations from a real application. Also provided are the counts of lines of code from both sides.
Mesh refinement strategy for optimal control problems
Paiva, L. T.; Fontes, F. A. C. C.
2013-10-01
Direct methods are becoming the most used technique to solve nonlinear optimal control problems. Regular time meshes having equidistant spacing are frequently used. However, in some cases these meshes cannot cope accurately with nonlinear behavior. One way to improve the solution is to select a new mesh with a greater number of nodes. Another way, involves adaptive mesh refinement. In this case, the mesh nodes have non equidistant spacing which allow a non uniform nodes collocation. In the method presented in this paper, a time mesh refinement strategy based on the local error is developed. After computing a solution in a coarse mesh, the local error is evaluated, which gives information about the subintervals of time domain where refinement is needed. This procedure is repeated until the local error reaches a user-specified threshold. The technique is applied to solve the car-like vehicle problem aiming minimum consumption. The approach developed in this paper leads to results with greater accuracy and yet with lower overall computational time as compared to using a time meshes having equidistant spacing.
7th International Meshing Roundtable '98
Energy Technology Data Exchange (ETDEWEB)
Eldred, T.J.
1998-10-01
The goal of the 7th International Meshing Roundtable is to bring together researchers and developers from industry, academia, and government labs in a stimulating, open environment for the exchange of technical information related to the meshing process. In the past, the Roundtable has enjoyed significant participation from each of these groups from a wide variety of countries.
Laparoscopic Pelvic Floor Repair Using Polypropylene Mesh
Directory of Open Access Journals (Sweden)
Shih-Shien Weng
2008-09-01
Conclusion: Laparoscopic pelvic floor repair using a single piece of polypropylene mesh combined with uterosacral ligament suspension appears to be a feasible procedure for the treatment of advanced vaginal vault prolapse and enterocele. Fewer mesh erosions and postoperative pain syndromes were seen in patients who had no previous pelvic floor reconstructive surgery.
Bubble reconstruction method for wire-mesh sensors measurements
Mukin, Roman V.
2016-08-01
A new algorithm is presented for post-processing of void fraction measurements with wire-mesh sensors, particularly for identifying and reconstructing bubble surfaces in a two-phase flow. This method is a combination of the bubble recognition algorithm presented in Prasser (Nuclear Eng Des 237(15):1608, 2007) and Poisson surface reconstruction algorithm developed in Kazhdan et al. (Poisson surface reconstruction. In: Proceedings of the fourth eurographics symposium on geometry processing 7, 2006). To verify the proposed technique, a comparison was done of the reconstructed individual bubble shapes with those obtained numerically in Sato and Ničeno (Int J Numer Methods Fluids 70(4):441, 2012). Using the difference between reconstructed and referenced bubble shapes, the accuracy of the proposed algorithm was estimated. At the next step, the algorithm was applied to void fraction measurements performed in Ylönen (High-resolution flow structure measurements in a rod bundle (Diss., Eidgenössische Technische Hochschule ETH Zürich, Nr. 20961, 2013) by means of wire-mesh sensors in a rod bundle geometry. The reconstructed bubble shape yields bubble surface area and volume, hence its Sauter diameter d_{32} as well. Sauter diameter is proved to be more suitable for bubbles size characterization compared to volumetric diameter d_{30}, proved capable to capture the bi-disperse bubble size distribution in the flow. The effect of a spacer grid was studied as well: For the given spacer grid and considered flow rates, bubble size frequency distribution is obtained almost at the same position for all cases, approximately at d_{32} = 3.5 mm. This finding can be related to the specific geometry of the spacer grid or the air injection device applied in the experiments, or even to more fundamental properties of the bubble breakup and coagulation processes. In addition, an application of the new algorithm for reconstruction of a large air-water interface in a tube bundle is
Quantifying the role of population subdivision in evolution on rugged fitness landscapes.
Bitbol, Anne-Florence; Schwab, David J
2014-08-01
Natural selection drives populations towards higher fitness, but crossing fitness valleys or plateaus may facilitate progress up a rugged fitness landscape involving epistasis. We investigate quantitatively the effect of subdividing an asexual population on the time it takes to cross a fitness valley or plateau. We focus on a generic and minimal model that includes only population subdivision into equivalent demes connected by global migration, and does not require significant size changes of the demes, environmental heterogeneity or specific geographic structure. We determine the optimal speedup of valley or plateau crossing that can be gained by subdivision, if the process is driven by the deme that crosses fastest. We show that isolated demes have to be in the sequential fixation regime for subdivision to significantly accelerate crossing. Using Markov chain theory, we obtain analytical expressions for the conditions under which optimal speedup is achieved: valley or plateau crossing by the subdivided population is then as fast as that of its fastest deme. We verify our analytical predictions through stochastic simulations. We demonstrate that subdivision can substantially accelerate the crossing of fitness valleys and plateaus in a wide range of parameters extending beyond the optimal window. We study the effect of varying the degree of subdivision of a population, and investigate the trade-off between the magnitude of the optimal speedup and the width of the parameter range over which it occurs. Our results, obtained for fitness valleys and plateaus, also hold for weakly beneficial intermediate mutations. Finally, we extend our work to the case of a population connected by migration to one or several smaller islands. Our results demonstrate that subdivision with migration alone can significantly accelerate the crossing of fitness valleys and plateaus, and shed light onto the quantitative conditions necessary for this to occur.
Subdivisions of the adult zebrafish pallium based on molecular marker analysis
Ganz, Julia; Kroehne, Volker; Freudenreich, Dorian; Machate, Anja; Geffarth, Michaela; Braasch, Ingo; Kaslin, Jan; Brand, Michael
2015-01-01
Background: The telencephalon shows a remarkable structural diversity among vertebrates. In particular, the everted telencephalon of ray-finned fishes has a markedly different morphology compared to the evaginated telencephalon of all other vertebrates. This difference in development has hampered the comparison between different areas of the pallium of ray-finned fishes and the pallial nuclei of all other vertebrates. Various models of homology between pallial subdivisions in ray-finned fishes and the pallial nuclei in tetrapods have been proposed based on connectional, neurochemical, gene expression and functional data. However, no consensus has been reached so far. In recent years, the analysis of conserved developmental marker genes has assisted the identification of homologies for different parts of the telencephalon among several tetrapod species. Results: We have investigated the gene expression pattern of conserved marker genes in the adult zebrafish ( Danio rerio) pallium to identify pallial subdivisions and their homology to pallial nuclei in tetrapods. Combinatorial expression analysis of ascl1a, eomesa, emx1, emx2, emx3, and Prox1 identifies four main divisions in the adult zebrafish pallium. Within these subdivisions, we propose that Dm is homologous to the pallial amygdala in tetrapods and that the dorsal subdivision of Dl is homologous to part of the hippocampal formation in mouse. We have complemented this analysis be examining the gene expression of emx1, emx2 and emx3 in the zebrafish larval brain. Conclusions: Based on our gene expression data, we propose a new model of subdivisions in the adult zebrafish pallium and their putative homologies to pallial nuclei in tetrapods. Pallial nuclei control sensory, motor, and cognitive functions, like memory, learning and emotion. The identification of pallial subdivisions in the adult zebrafish and their homologies to pallial nuclei in tetrapods will contribute to the use of the zebrafish system as a model
A comparison of tetrahedral mesh improvement techniques
Energy Technology Data Exchange (ETDEWEB)
Freitag, L.A.; Ollivier-Gooch, C. [Argonne National Lab., IL (United States). Mathematics and Computer Science Div.
1996-12-01
Automatic mesh generation and adaptive refinement methods for complex three-dimensional domains have proven to be very successful tools for the efficient solution of complex applications problems. These methods can, however, produce poorly shaped elements that cause the numerical solution to be less accurate and more difficult to compute. Fortunately, the shape of the elements can be improved through several mechanisms, including face-swapping techniques that change local connectivity and optimization-based mesh smoothing methods that adjust grid point location. The authors consider several criteria for each of these two methods and compare the quality of several meshes obtained by using different combinations of swapping and smoothing. Computational experiments show that swapping is critical to the improvement of general mesh quality and that optimization-based smoothing is highly effective in eliminating very small and very large angles. The highest quality meshes are obtained by using a combination of swapping and smoothing techniques.
Institute of Scientific and Technical Information of China (English)
秦开怀; 范刚; 等
1994-01-01
The new algorithms for finding B-Spline or Bezier curves and surfaces intersections using recursive subdivision techniques are presented,which use extrapolating acceleration technique,and have convergent precision of order 2.Matrix method is used to subdivide the curves or surfaces which makes the subdivision more concise and intuitive.Dividing depths of Bezier curves and surfaces are used to subdivide the curves or surfaces adaptively.Therefore the convergent precision and the computing efficiency of finding the intersections of curves and surfaces have been improved by the methods proposed in the paper.
X-ray microbeam quantification of grain subdivision accompanying large deformations of copper
Energy Technology Data Exchange (ETDEWEB)
Butler, G.C.; Guvenilir, A.; McDowell, D.L.; Stock, S.R. [Georgia Inst. of Tech., Atlanta, GA (United States)
1998-12-31
Polychromatic synchrotron x-ray microbeams offer a very efficient alternative to electron beam methods for quantifying the amount and character of grain subdivision accompanying large deformations. With a 0.01 mm diameter collimator, bending magnet radiation from a 3.0 GeV source and image storage plates, samples of copper with thicknesses greater than 0.1 mm have been studied. Results from an as-received sample and a sample deformed to 100% torsion are compared and illustrate how efficiently grain subdivision can be quantified with polychromatic microbeam diffraction.
Characteristics of Mesh Wave Impedance in FDTD Non-Uniform Mesh
Institute of Scientific and Technical Information of China (English)
REN Wu; LIU Bo; GAO Ben-qing
2005-01-01
In order to increase the evaluating precision of mesh reflection wave, the mesh wave impedance(MWI) is extended to the non-uniform mesh in 1-D and 2-D cases for the first time on the basis of the Yee's positional relation for electromagnetic field components. Lots of characteristics are obtained for different mesh sizes and frequencies. Then the reflection coefficient caused by the non-uniform mesh can be calculated according to the theory of equivalent transmission line. By comparing it with that calculated by MWI in the uniform mesh, it is found that the evaluating error can be largely reduced and is in good agreement with that directly computed by FDTD method. And this extension of MWI can be used in the error analysis of complex mesh.
Update on Development of Mesh Generation Algorithms in MeshKit
Energy Technology Data Exchange (ETDEWEB)
Jain, Rajeev [Argonne National Lab. (ANL), Argonne, IL (United States); Vanderzee, Evan [Argonne National Lab. (ANL), Argonne, IL (United States); Mahadevan, Vijay [Argonne National Lab. (ANL), Argonne, IL (United States)
2015-09-30
MeshKit uses a graph-based design for coding all its meshing algorithms, which includes the Reactor Geometry (and mesh) Generation (RGG) algorithms. This report highlights the developmental updates of all the algorithms, results and future work. Parallel versions of algorithms, documentation and performance results are reported. RGG GUI design was updated to incorporate new features requested by the users; boundary layer generation and parallel RGG support were added to the GUI. Key contributions to the release, upgrade and maintenance of other SIGMA1 libraries (CGM and MOAB) were made. Several fundamental meshing algorithms for creating a robust parallel meshing pipeline in MeshKit are under development. Results and current status of automated, open-source and high quality nuclear reactor assembly mesh generation algorithms such as trimesher, quadmesher, interval matching and multi-sweeper are reported.
Automatic Mesh Generation of Hybrid Mesh on Valves in Multiple Positions in Feedline Systems
Ross, Douglass H.; Ito, Yasushi; Dorothy, Fredric W.; Shih, Alan M.; Peugeot, John
2010-01-01
Fluid flow simulations through a valve often require evaluation of the valve in multiple opening positions. A mesh has to be generated for the valve for each position and compounding. The problem is the fact that the valve is typically part of a larger feedline system. In this paper, we propose to develop a system to create meshes for feedline systems with parametrically controlled valve openings. Herein we outline two approaches to generate the meshes for a valve in a feedline system at multiple positions. There are two issues that must be addressed. The first is the creation of the mesh on the valve for multiple positions. The second is the generation of the mesh for the total feedline system including the valve. For generation of the mesh on the valve, we will describe the use of topology matching and mesh generation parameter transfer. For generation of the total feedline system, we will describe two solutions that we have implemented. In both cases the valve is treated as a component in the feedline system. In the first method the geometry of the valve in the feedline system is replaced with a valve at a different opening position. Geometry is created to connect the valve to the feedline system. Then topology for the valve is created and the portion of the topology for the valve is topology matched to the standard valve in a different position. The mesh generation parameters are transferred and then the volume mesh for the whole feedline system is generated. The second method enables the user to generate the volume mesh on the valve in multiple open positions external to the feedline system, to insert it into the volume mesh of the feedline system, and to reduce the amount of computer time required for mesh generation because only two small volume meshes connecting the valve to the feedline mesh need to be updated.
Exploring Parallel Algorithms for Volumetric Mass-Spring-Damper Models in CUDA
DEFF Research Database (Denmark)
Rasmusson, Allan; Mosegaard, Jesper; Sørensen, Thomas Sangild
2008-01-01
Since the advent of programmable graphics processors (GPUs) their computational powers have been utilized for general purpose computation. Initially by “exploiting” graphics APIs and recently through dedicated parallel computation frameworks such as the Compute Unified Device Architecture (CUDA......) from Nvidia. This paper investigates multiple implementations of volumetric Mass-Spring-Damper systems in CUDA. The obtained performance is compared to previous implementations utilizing the GPU through the OpenGL graphics API. We find that both performance and optimization strategies differ widely...... between the OpenGL and CUDA implementations. Specifically, the previous recommendation of using implicitly connected particles is replaced by a recommendation that supports unstructured meshes and run-time topological changes with an insignificant performance reduction....
Constructing Measure by Repeated Infinite Subdivision%通过反复无限细分定义测度
Institute of Scientific and Technical Information of China (English)
严质彬
2005-01-01
This paper generalizes the method of constructing measure by repeated finite subdivision in fTactal geometry to that by infinite subdivision. Two conditions for the existing method are removed. A measure on the interval [0, 1] is constructed using this generalized method.
Livas, Christos; Pandis, Nikolaos; Booij, Johan Willem; Halazonetis, Demetrios J.; Katsaros, Christos; Ren, Yijin
2016-01-01
Objective: To assess the maxillary second molar (M2) and third molar (M3) inclination following orthodontic treatment of Class II subdivision malocclusion with unilateral maxillary first molar (M1) extraction. Materials and Methods: Panoramic radiographs of 21 Class II subdivision adolescents (eight
The use and optimization of stainless steel mesh cathodes in microbial electrolysis cells
Zhang, Yimin
2010-11-01
Microbial electrolysis cells (MECs) provide a high-yield method for producing hydrogen from renewable biomass. One challenge for commercialization of the technology is a low-cost and highly efficient cathode. Stainless steel (SS) is very inexpensive, and cathodes made of this material with high specific surface areas can achieve performance similar to carbon cathodes containing a platinum catalyst in MECs. SS mesh cathodes were examined here as a method to provide a higher surface area material than flat plate electrodes. Cyclic voltammetry tests showed that the electrochemically active surface area of certain sized mesh could be three times larger than a flat sheet. The relative performance of SS mesh in linear sweep voltammetry at low bubble coverages (low current densities) was also consistent with performance on this basis in MEC tests. The best SS mesh size (#60) in MEC tests had a relatively thick wire size (0.02 cm), a medium pore size (0.02 cm), and a specific surface area of 66 m2/m3. An applied voltage of 0.9 V produced a high hydrogen recovery (98 ± 4%) and overall energy efficiency (74 ± 4%), with a hydrogen production rate of 2.1 ± 0.3 m3H 2/m3d (current density of 8.08 A/m2, volumetric current density of 188 ± 19 A/m3). These studies show that SS in mesh format shows great promise for the development of lower cost MEC systems for hydrogen production. © 2010 Professor T. Nejat Veziroglu. Published by Elsevier Ltd. All rights reserved.
NUMERICAL SIMULATION FOR SHALLOW FLOW AND POLLUTANT DISPERSION BASED ON QUAD-TREE MESHES
Institute of Scientific and Technical Information of China (English)
LIU Xiao-dong; HUA Zu-lin
2006-01-01
A 2D depth-averaged flow-pollutant coupled model based on quad-tree meshes was established to accurately simulate flows in water areas with irregular natural boundaries in this paper. The grids were generated by recursive subdivision about seeding points. A new neighbor-finding algorithm was presented. The governing equations were discretized in collocated conservative variables by using the finite volume method, and the normal flux of mass, momentum and pollutants across the interface between cells were computed by a Godunov-type Flux Difference Splitting (FDS) scheme. The model was applied to simulate flow fields around a groin. The computed values are in agreement with observed data. The results indicate that quad-tree meshes have fine local resolution, high efficiency and easy local refinement. It is clear that the quad-tree grid model can offer gains in efficiency when applied to complex flow domains or strong shear flows. Finally, the model is applied to flow fields and concentration fields simulation in Jiangsu Haizhou Bay. The simulated polluted area is matched well with observations. Therefore, this model can be used to predict flow and concentration fields of actual water area with irregular natural land boundaries.
Quadratically consistent projection from particles to mesh
Duque, Daniel
2016-01-01
The advantage of particle Lagrangian methods in computational fluid dynamics is that advection is accurately modeled. However, this complicates the calculation of space derivatives. If a mesh is employed, it must be updated at each time step. On the other hand, fixed mesh, Eulerian, formulations benefit from the mesh being defined at the beginning of the simulation, but feature non-linear advection terms. It therefore seems natural to combine the two approaches, using a fixed mesh to perform calculations related to space derivatives, and using the particles to advect the information with time. The idea of combining Lagrangian particles and a fixed mesh goes back to Particle-in-Cell methods, and is here considered within the context of the finite element method (FEM) for the fixed mesh, and the particle FEM (pFEM) for the particles. Our results, in agreement with recent works, show that interpolation ("projection") errors, especially from particles to mesh, are the culprits of slow convergence of the method if...
Volumetric polymerization shrinkage of contemporary composite resins
Directory of Open Access Journals (Sweden)
Halim Nagem Filho
2007-10-01
Full Text Available The polymerization shrinkage of composite resins may affect negatively the clinical outcome of the restoration. Extensive research has been carried out to develop new formulations of composite resins in order to provide good handling characteristics and some dimensional stability during polymerization. The purpose of this study was to analyze, in vitro, the magnitude of the volumetric polymerization shrinkage of 7 contemporary composite resins (Definite, Suprafill, SureFil, Filtek Z250, Fill Magic, Alert, and Solitaire to determine whether there are differences among these materials. The tests were conducted with precision of 0.1 mg. The volumetric shrinkage was measured by hydrostatic weighing before and after polymerization and calculated by known mathematical equations. One-way ANOVA (a or = 0.05 was used to determine statistically significant differences in volumetric shrinkage among the tested composite resins. Suprafill (1.87±0.01 and Definite (1.89±0.01 shrank significantly less than the other composite resins. SureFil (2.01±0.06, Filtek Z250 (1.99±0.03, and Fill Magic (2.02±0.02 presented intermediate levels of polymerization shrinkage. Alert and Solitaire presented the highest degree of polymerization shrinkage. Knowing the polymerization shrinkage rates of the commercially available composite resins, the dentist would be able to choose between using composite resins with lower polymerization shrinkage rates or adopting technical or operational procedures to minimize the adverse effects deriving from resin contraction during light-activation.
Volumetric composition in composites and historical data
DEFF Research Database (Denmark)
Lilholt, Hans; Madsen, Bo
2013-01-01
guidance to the optimal combination of fibre content, matrix content and porosity content, in order to achieve the best obtainable properties. Several composite materials systems have been shown to be handleable with this model. An extensive series of experimental data for the system of cellulose fibres...... and polymer (resin) was produced in 1942 – 1944, and these data have been (re-)analysed by the volumetric composition model, and the property values for density, stiffness and strength have been evaluated. Good agreement has been obtained and some further observations have been extracted from the analysis....
IMITATION OF STANDARD VOLUMETRIC ACTIVITY METAL SAMPLES
Directory of Open Access Journals (Sweden)
A. I. Zhukouski
2016-01-01
Full Text Available Due to the specific character of problems in the field of ionizing radiation spectroscopy, the R&D and making process of standard volumetric activity metal samples (standard samples for calibration and verification of spectrometric equipment is not only expensive, but also requires the use of highly qualified experts and a unique specific equipment. Theoretical and experimental studies performed have shown the possibility to use imitators as a set of alternating point sources of gamma radiation and metal plates and their use along with standard volumetric activity metal samples for calibration of scintillation-based detectors used in radiation control in metallurgy. Response functions or instrumental spectra of such spectrometer to radionuclides like 137Cs, 134Cs, 152Eu, 154Eu, 60Co, 54Mn, 232Th, 226Ra, 65Zn, 125Sb+125mTe, 106Ru+106Rh, 94Nb, 110mAg, 233U, 234U, 235U and 238U are required for calibration in a given measurement geometry. Standard samples in the form of a probe made of melt metal of a certain diameter and height are used in such measurements. However, the production of reference materials is costly and even problematic for such radionuclides as 94Nb, 125Sb+125mTe, 234U, 235U etc. A recognized solution to solve this problem is to use the Monte-Carlo simulation method. Instrumental experimental and theoretical spectra obtained by using standard samples and their imitators show a high compliance between experimental spectra of real samples and the theoretical ones of their Monte-Carlo models, between spectra of real samples and the ones of their imitators and finally, between experimental spectra of real sample imitators and the theoretical ones of their Monte-Carlo models. They also have shown the adequacy and consistency of the approach in using a combination of metal scattering layers and reference point gamma-ray sources instead of standard volumetric activity metal samples. As for using several reference point gamma-ray sources
Magnetic volumetric hologram memory with magnetic garnet.
Nakamura, Yuichi; Takagi, Hiroyuki; Lim, Pang Boey; Inoue, Mitsuteru
2014-06-30
Holographic memory is a promising next-generation optical memory that has a higher recording density and a higher transfer rate than other types of memory. In holographic memory, magnetic garnet films can serve as rewritable holographic memory media by use of magneto-optical effect. We have now demonstrated that a magnetic hologram can be recorded volumetrically in a ferromagnetic garnet film and that the signal image can be reconstructed from it for the first time. In addition, multiplicity of the magnetic hologram was also confirmed; the image could be reconstructed from a spot overlapped by other spots.
Zhang, Fang
2011-02-01
Mesh current collectors made of stainless steel (SS) can be integrated into microbial fuel cell (MFC) cathodes constructed of a reactive carbon black and Pt catalyst mixture and a poly(dimethylsiloxane) (PDMS) diffusion layer. It is shown here that the mesh properties of these cathodes can significantly affect performance. Cathodes made from the coarsest mesh (30-mesh) achieved the highest maximum power of 1616 ± 25 mW m-2 (normalized to cathode projected surface area; 47.1 ± 0.7 W m-3 based on liquid volume), while the finest mesh (120-mesh) had the lowest power density (599 ± 57 mW m-2). Electrochemical impedance spectroscopy showed that charge transfer and diffusion resistances decreased with increasing mesh opening size. In MFC tests, the cathode performance was primarily limited by reaction kinetics, and not mass transfer. Oxygen permeability increased with mesh opening size, accounting for the decreased diffusion resistance. At higher current densities, diffusion became a limiting factor, especially for fine mesh with low oxygen transfer coefficients. These results demonstrate the critical nature of the mesh size used for constructing MFC cathodes. © 2010 Elsevier B.V. All rights reserved.
H(curl) Auxiliary Mesh Preconditioning
Energy Technology Data Exchange (ETDEWEB)
Kolev, T V; Pasciak, J E; Vassilevski, P S
2006-08-31
This paper analyzes a two-level preconditioning scheme for H(curl) bilinear forms. The scheme utilizes an auxiliary problem on a related mesh that is more amenable for constructing optimal order multigrid methods. More specifically, we analyze the case when the auxiliary mesh only approximately covers the original domain. The latter assumption is important since it allows for easy construction of nested multilevel spaces on regular auxiliary meshes. Numerical experiments in both two and three space dimensions illustrate the optimal performance of the method.
Engagement of Metal Debris into Gear Mesh
handschuh, Robert F.; Krantz, Timothy L.
2010-01-01
A series of bench-top experiments was conducted to determine the effects of metallic debris being dragged through meshing gear teeth. A test rig that is typically used to conduct contact fatigue experiments was used for these tests. Several sizes of drill material, shim stock and pieces of gear teeth were introduced and then driven through the meshing region. The level of torque required to drive the "chip" through the gear mesh was measured. From the data gathered, chip size sufficient to jam the mechanism can be determined.
Application of mesh network radios to UGS
Calcutt, Wade; Jones, Barry; Roeder, Brent
2008-04-01
During the past five years McQ has been actively pursuing integrating and applying wireless mesh network radios as a communications solution for unattended ground sensor (UGS) systems. This effort has been rewarded with limited levels of success and has ultimately resulted in a corporate position regarding the use of mesh network radios for UGS systems. A discussion into the background of the effort, the challenges of implementing commercial off-the-shelf (COTS) mesh radios with UGSs, the tradeoffs involved, and an overview of the future direction is presented.
Mesh Optimization for Ground Vehicle Aerodynamics
Adrian Gaylard; Essam F Abo-Serie; Nor Elyana Ahmad
2010-01-01
Mesh optimization strategy for estimating accurate drag of a ground vehicle is proposed based on examining the effect of different mesh parameters. The optimized mesh parameters were selected using design of experiment (DOE) method to be able to work in a...
SURFACE MESH PARAMETERIZATION WITH NATURAL BOUNDARY
Institute of Scientific and Technical Information of China (English)
Ye Ming; Zhu Xiaofeng; Wang Chengtao
2003-01-01
Using the projected curve of surface mesh boundary as parameter domain border, linear mapping parameterization with natural boundary is realized. A fast algorithm for least squares fitting plane of vertices in the mesh boundary is proposed. After the mesh boundary is projected onto the fitting plane, low-pass filtering is adopted to eliminate crossovers, sharp corners and cavities in the projected curve and convert it into an eligible convex parameter domain boundary. In order to facilitate quantitative evaluations of parameterization schemes, three distortion-measuring formulae are presented.
Robustness of the Probabilistic damage Stability Concept to the Degree of Details in the Subdivision
DEFF Research Database (Denmark)
Ravn, Erik Sonne; Jensen, Jørgen Juncher; Baatrup, Jan
2002-01-01
The paper addresses the sensitivity of the Attained Index A to the degree of details in the modeling of the internal subdivision and for differences in software. The calculations are performed within the framework of the SOLAS, Part B.1 for cargo ships. The different software gives fairly equal...... simplifications can be taken without changing the Attained Index A significantly....
Jones, Willis A.
2014-01-01
In recent years, a number of colleges and universities have made the decision to pursue membership in the NCAA's Football Bowl Subdivision (FBS) with the idea that participating in higher profile intercollegiate football can help attract students to their institution. This belief, however, has not been empirically examined. Using…
Jones, Willis A.
2014-01-01
In recent years, a number of colleges and universities have made the decision to pursue membership in the NCAA's Football Bowl Subdivision (FBS) with the idea that participating in higher profile intercollegiate football can help attract students to their institution. This belief, however, has not been empirically examined. Using…
Robustness of the Probabilistic damage Stability Concept to the Degree of Details in the Subdivision
DEFF Research Database (Denmark)
Ravn, Erik Sonne; Jensen, Jørgen Juncher; Baatrup, Jan
2002-01-01
The paper addresses the sensitivity of the Attained Index A to the degree of details in the modeling of the internal subdivision and for differences in software. The calculations are performed within the framework of the SOLAS, Part B.1 for cargo ships. The different software gives fairly equal...
46 CFR 170.135 - Operating information for a vessel with Type III subdivision.
2010-10-01
... 46 Shipping 7 2010-10-01 2010-10-01 false Operating information for a vessel with Type III... Operating Personnel § 170.135 Operating information for a vessel with Type III subdivision. (a) In addition to the information required in 46 CFR 170.110, the stability booklet of a passenger vessel with...
Jones, Willis A.
2014-01-01
In recent years, a number of colleges and universities have made the decision to pursue membership in the NCAA's Football Bowl Subdivision (FBS) with the idea that participating in higher profile intercollegiate football can help attract students to their institution. This belief, however, has not been empirically examined. Using…
Wavelet-based multiresolution with n-th-root-of-2 Subdivision
Energy Technology Data Exchange (ETDEWEB)
Linsen, L; Pascucci, V; Duchaineau, M A; Hamann, B; Joy, K I
2004-12-16
Multiresolution methods are a common technique used for dealing with large-scale data and representing it at multiple levels of detail. The authors present a multiresolution hierarchy construction based on n{radical}2 subdivision, which has all the advantages of a regular data organization scheme while reducing the drawback of coarse granularity. The n{radical}2-subdivision scheme only doubles the number of vertices in each subdivision step regardless of dimension n. They describe the construction of 2D, 3D, and 4D hierarchies representing surfaces, volume data, and time-varying volume data, respectively. The 4D approach supports spatial and temporal scalability. For high-quality data approximation on each level of detail, they use downsampling filters based on n-variate B-spline wavelets. They present a B-spline wavelet lifting scheme for n{radical}2-subdivision steps to obtain small or narrow filters. Narrow filters support adaptive refinement and out-of-core data exploration techniques.
45 CFR 302.55 - Incentive payments to States and political subdivisions.
2010-10-01
... 45 Public Welfare 2 2010-10-01 2010-10-01 false Incentive payments to States and political subdivisions. 302.55 Section 302.55 Public Welfare Regulations Relating to Public Welfare OFFICE OF CHILD..., DEPARTMENT OF HEALTH AND HUMAN SERVICES STATE PLAN REQUIREMENTS § 302.55 Incentive payments to States and...
45 CFR 303.52 - Pass-through of incentives to political subdivisions.
2010-10-01
... 45 Public Welfare 2 2010-10-01 2010-10-01 false Pass-through of incentives to political..., DEPARTMENT OF HEALTH AND HUMAN SERVICES STANDARDS FOR PROGRAM OPERATIONS § 303.52 Pass-through of incentives... subdivisions as follows: (a) The State IV-D agency must develop a standard methodology for passing through...
24 CFR 1715.50 - Advertising disclaimers; subdivisions registered and effective with HUD.
2010-04-01
... 24 Housing and Urban Development 5 2010-04-01 2010-04-01 false Advertising disclaimers... REGISTRATION PROGRAM) PURCHASERS' REVOCATION RIGHTS, SALES PRACTICES AND STANDARDS Advertising Disclaimers § 1715.50 Advertising disclaimers; subdivisions registered and effective with HUD. (a) The following...
da Rocha, Ulisses Nunes; van Elsas, Jan Dirk; van Overbeek, Leonard Simon
2011-01-01
Strains CHC12 and CHC8, belonging to, respectively, Luteolibacter and Candidatus genus Rhizospheria (Verrucomicrobia subdivision 1), were recently isolated from the leek rhizosphere. The key question addressed in this study was: does attraction to and colonization of the rhizosphere occur in the sam
46 CFR 171.073 - Treatment of stepped and recessed bulkheads in Type II subdivision.
2010-10-01
... 46 Shipping 7 2010-10-01 2010-10-01 false Treatment of stepped and recessed bulkheads in Type II... Treatment of stepped and recessed bulkheads in Type II subdivision. (a) A main transverse watertight bulkhead may not be stepped unless additional watertight bulkheads are located as shown in Figure...
46 CFR 171.067 - Treatment of stepped and recessed bulkheads in Type I subdivision.
2010-10-01
... 46 Shipping 7 2010-10-01 2010-10-01 false Treatment of stepped and recessed bulkheads in Type I... Treatment of stepped and recessed bulkheads in Type I subdivision. (a) For the purpose of this section— (1) The main transverse watertight bulkhead immediately forward of a stepped bulkhead is referred to...
Simple Derivation of the Lifetime and the Distribution of Faces for a Binary Subdivision Model
Hayashi, Yukio
2015-01-01
The iterative random subdivision of rectangles is used as a generation model of networks in physics, computer science, and urban planning. However, these researches were independent. We consider some relations in them, and derive fundamental properties for the average lifetime depending on birth-time and the balanced distribution of rectangle faces.
Jung, Jaewoon; Kobayashi, Chigusa; Imamura, Toshiyuki; Sugita, Yuji
2016-03-01
Three-dimensional Fast Fourier Transform (3D FFT) plays an important role in a wide variety of computer simulations and data analyses, including molecular dynamics (MD) simulations. In this study, we develop hybrid (MPI+OpenMP) parallelization schemes of 3D FFT based on two new volumetric decompositions, mainly for the particle mesh Ewald (PME) calculation in MD simulations. In one scheme, (1d_Alltoall), five all-to-all communications in one dimension are carried out, and in the other, (2d_Alltoall), one two-dimensional all-to-all communication is combined with two all-to-all communications in one dimension. 2d_Alltoall is similar to the conventional volumetric decomposition scheme. We performed benchmark tests of 3D FFT for the systems with different grid sizes using a large number of processors on the K computer in RIKEN AICS. The two schemes show comparable performances, and are better than existing 3D FFTs. The performances of 1d_Alltoall and 2d_Alltoall depend on the supercomputer network system and number of processors in each dimension. There is enough leeway for users to optimize performance for their conditions. In the PME method, short-range real-space interactions as well as long-range reciprocal-space interactions are calculated. Our volumetric decomposition schemes are particularly useful when used in conjunction with the recently developed midpoint cell method for short-range interactions, due to the same decompositions of real and reciprocal spaces. The 1d_Alltoall scheme of 3D FFT takes 4.7 ms to simulate one MD cycle for a virus system containing more than 1 million atoms using 32,768 cores on the K computer.
Assignment of fields from particles to mesh
Duque, Daniel
2016-01-01
In Computational Fluid Dynamics there have been many attempts to combine the power of a fixed mesh on which to carry out spatial calculations with that of a set of particles that moves following the velocity field. These ideas indeed go back to Particle-in-Cell methods, proposed about 60 years ago. Of course, some procedure is needed to transfer field information between particles and mesh. There are many possible choices for this "assignment", or "projection". Several requirements may guide this choice. Two well-known ones are conservativity and stability, which apply to volume integrals of the fields. An additional one is here considered: preservation of information. This means that mesh interpolation, followed by mesh assignment, should leave the field values invariant. The resulting methods are termed "mass" assignments due to their strong similarities with the Finite Element Method. We test several procedures, including the well-known FLIP, on three scenarios: simple 1D convection, 2D convection of Zales...
Shape space exploration of constrained meshes
Yang, Yongliang
2011-01-01
We present a general computational framework to locally characterize any shape space of meshes implicitly prescribed by a collection of non-linear constraints. We computationally access such manifolds, typically of high dimension and co-dimension, through first and second order approximants, namely tangent spaces and quadratically parameterized osculant surfaces. Exploration and navigation of desirable subspaces of the shape space with regard to application specific quality measures are enabled using approximants that are intrinsic to the underlying manifold and directly computable in the parameter space of the osculant surface. We demonstrate our framework on shape spaces of planar quad (PQ) meshes, where each mesh face is constrained to be (nearly) planar, and circular meshes, where each face has a circumcircle. We evaluate our framework for navigation and design exploration on a variety of inputs, while keeping context specific properties such as fairness, proximity to a reference surface, etc.
LR: Compact connectivity representation for triangle meshes
Energy Technology Data Exchange (ETDEWEB)
Gurung, T; Luffel, M; Lindstrom, P; Rossignac, J
2011-01-28
We propose LR (Laced Ring) - a simple data structure for representing the connectivity of manifold triangle meshes. LR provides the option to store on average either 1.08 references per triangle or 26.2 bits per triangle. Its construction, from an input mesh that supports constant-time adjacency queries, has linear space and time complexity, and involves ordering most vertices along a nearly-Hamiltonian cycle. LR is best suited for applications that process meshes with fixed connectivity, as any changes to the connectivity require the data structure to be rebuilt. We provide an implementation of the set of standard random-access, constant-time operators for traversing a mesh, and show that LR often saves both space and traversal time over competing representations.
Shape space exploration of constrained meshes
Yang, Yongliang
2011-12-12
We present a general computational framework to locally characterize any shape space of meshes implicitly prescribed by a collection of non-linear constraints. We computationally access such manifolds, typically of high dimension and co-dimension, through first and second order approximants, namely tangent spaces and quadratically parameterized osculant surfaces. Exploration and navigation of desirable subspaces of the shape space with regard to application specific quality measures are enabled using approximants that are intrinsic to the underlying manifold and directly computable in the parameter space of the osculant surface. We demonstrate our framework on shape spaces of planar quad (PQ) meshes, where each mesh face is constrained to be (nearly) planar, and circular meshes, where each face has a circumcircle. We evaluate our framework for navigation and design exploration on a variety of inputs, while keeping context specific properties such as fairness, proximity to a reference surface, etc. © 2011 ACM.
Spacetime Meshing for Discontinuous Galerkin Methods
Thite, Shripad Vidyadhar
2008-01-01
Spacetime discontinuous Galerkin (SDG) finite element methods are used to solve such PDEs involving space and time variables arising from wave propagation phenomena in important applications in science and engineering. To support an accurate and efficient solution procedure using SDG methods and to exploit the flexibility of these methods, we give a meshing algorithm to construct an unstructured simplicial spacetime mesh over an arbitrary simplicial space domain. Our algorithm is the first spacetime meshing algorithm suitable for efficient solution of nonlinear phenomena in anisotropic media using novel discontinuous Galerkin finite element methods for implicit solutions directly in spacetime. Given a triangulated d-dimensional Euclidean space domain M (a simplicial complex) and initial conditions of the underlying hyperbolic spacetime PDE, we construct an unstructured simplicial mesh of the (d+1)-dimensional spacetime domain M x [0,infinity). Our algorithm uses a near-optimal number of spacetime elements, ea...
Metal Mesh Filters for Terahertz Receivers Project
National Aeronautics and Space Administration — The technical objective of this SBIR program is to develop and demonstrate metal mesh filters for use in NASA's low noise receivers for terahertz astronomy and...
Adaptive sampling for mesh spectrum editing
Institute of Scientific and Technical Information of China (English)
ZHAO Xiang-jun; ZHANG Hong-xin; BAO Hu-jun
2006-01-01
A mesh editing framework is presented in this paper, which integrates Free-Form Deformation (FFD) and geometry signal processing. By using simplified model from original mesh, the editing task can be accomplished with a few operations. We take the deformation of the proxy and the position coordinates of the mesh models as geometry signal. Wavelet analysis is employed to separate local detail information gracefully. The crucial innovation of this paper is a new adaptive regular sampling approach for our signal analysis based editing framework. In our approach, an original mesh is resampled and then refined iteratively which reflects optimization of our proposed spectrum preserving energy. As an extension of our spectrum editing scheme,the editing principle is applied to geometry details transferring, which brings satisfying results.
Mesh Processing in Medical Image Analysis
DEFF Research Database (Denmark)
The following topics are dealt with: mesh processing; medical image analysis; interactive freeform modeling; statistical shape analysis; clinical CT images; statistical surface recovery; automated segmentation; cerebral aneurysms; and real-time particle-based representation....
Obtuse triangle suppression in anisotropic meshes
Sun, Feng
2011-12-01
Anisotropic triangle meshes are used for efficient approximation of surfaces and flow data in finite element analysis, and in these applications it is desirable to have as few obtuse triangles as possible to reduce the discretization error. We present a variational approach to suppressing obtuse triangles in anisotropic meshes. Specifically, we introduce a hexagonal Minkowski metric, which is sensitive to triangle orientation, to give a new formulation of the centroidal Voronoi tessellation (CVT) method. Furthermore, we prove several relevant properties of the CVT method with the newly introduced metric. Experiments show that our algorithm produces anisotropic meshes with much fewer obtuse triangles than using existing methods while maintaining mesh anisotropy. © 2011 Elsevier B.V. All rights reserved.
Removal of line artifacts on mesh boundary in computer generated hologram by mesh phase matching.
Park, Jae-Hyeung; Yeom, Han-Ju; Kim, Hee-Jae; Zhang, HuiJun; Li, BoNi; Ji, Yeong-Min; Kim, Sang-Hoo
2015-03-23
Mesh-based computer generated hologram enables realistic and efficient representation of three-dimensional scene. However, the dark line artifacts on the boundary between neighboring meshes are frequently observed, degrading the quality of the reconstruction. In this paper, we propose a simple technique to remove the dark line artifacts by matching the phase on the boundary of neighboring meshes. The feasibility of the proposed method is confirmed by the numerical and optical reconstruction of the generated hologram.
MHD simulations on an unstructured mesh
Energy Technology Data Exchange (ETDEWEB)
Strauss, H.R. [New York Univ., NY (United States); Park, W.; Belova, E.; Fu, G.Y. [Princeton Univ., NJ (United States). Plasma Physics Lab.; Longcope, D.W. [Univ. of Montana, Missoula, MT (United States); Sugiyama, L.E. [Massachusetts Inst. of Tech., Cambridge, MA (United States)
1998-12-31
Two reasons for using an unstructured computational mesh are adaptivity, and alignment with arbitrarily shaped boundaries. Two codes which use finite element discretization on an unstructured mesh are described. FEM3D solves 2D and 3D RMHD using an adaptive grid. MH3D++, which incorporates methods of FEM3D into the MH3D generalized MHD code, can be used with shaped boundaries, which might be 3D.
Mesh Processing in Medical Image Analysis
DEFF Research Database (Denmark)
The following topics are dealt with: mesh processing; medical image analysis; interactive freeform modeling; statistical shape analysis; clinical CT images; statistical surface recovery; automated segmentation; cerebral aneurysms; and real-time particle-based representation.......The following topics are dealt with: mesh processing; medical image analysis; interactive freeform modeling; statistical shape analysis; clinical CT images; statistical surface recovery; automated segmentation; cerebral aneurysms; and real-time particle-based representation....
Vector field processing on triangle meshes
De Goes, Fernando; Desbrun, Mathieu; Tong, Yiying
2015-01-01
While scalar fields on surfaces have been staples of geometry processing, the use of tangent vector fields has steadily grown in geometry processing over the last two decades: they are crucial to encoding directions and sizing on surfaces as commonly required in tasks such as texture synthesis, non-photorealistic rendering, digital grooming, and meshing. There are, however, a variety of discrete representations of tangent vector fields on triangle meshes, and each approach offers different tr...
Unstructured Mesh Movement and Viscous Mesh Generation for CFD-Based Design Optimization Project
National Aeronautics and Space Administration — The innovations proposed are twofold: 1) a robust unstructured mesh movement method able to handle isotropic (Euler), anisotropic (viscous), mixed element (hybrid)...
Mesh geometry impact on Micromegas performance with an Exchangeable Mesh prototype
Energy Technology Data Exchange (ETDEWEB)
Kuger, F., E-mail: fabian.kuger@cern.ch [CERN, Geneva (Switzerland); Julius-Maximilians-Universität, Würzburg (Germany); Bianco, M.; Iengo, P. [CERN, Geneva (Switzerland); Sekhniaidze, G. [CERN, Geneva (Switzerland); Universita e INFN, Napoli (Italy); Veenhof, R. [Uludağ University, Bursa (Turkey); Wotschack, J. [CERN, Geneva (Switzerland)
2016-07-11
The reconstruction precision of gaseous detectors is limited by losses of primary electrons during signal formation. In addition to common gas related losses, like attachment, Micromegas suffer from electron absorption during its transition through the micro mesh. This study aims for a deepened understanding of electron losses and their dependency on the mesh geometry. It combines experimental results obtained with a novel designed Exchangeable Mesh Micromegas (ExMe) and advanced microscopic-tracking simulations (ANSYS and Garfield++) of electron drift and mesh transition.
Robust moving mesh algorithms for hybrid stretched meshes: Application to moving boundaries problems
Landry, Jonathan; Soulaïmani, Azzeddine; Luke, Edward; Ben Haj Ali, Amine
2016-12-01
A robust Mesh-Mover Algorithm (MMA) approach is designed to adapt meshes of moving boundaries problems. A new methodology is developed from the best combination of well-known algorithms in order to preserve the quality of initial meshes. In most situations, MMAs distribute mesh deformation while preserving a good mesh quality. However, invalid meshes are generated when the motion is complex and/or involves multiple bodies. After studying a few MMA limitations, we propose the following approach: use the Inverse Distance Weighting (IDW) function to produce the displacement field, then apply the Geometric Element Transformation Method (GETMe) smoothing algorithms to improve the resulting mesh quality, and use an untangler to revert negative elements. The proposed approach has been proven efficient to adapt meshes for various realistic aerodynamic motions: a symmetric wing that has suffered large tip bending and twisting and the high-lift components of a swept wing that has moved to different flight stages. Finally, the fluid flow problem has been solved on meshes that have moved and they have produced results close to experimental ones. However, for situations where moving boundaries are too close to each other, more improvements need to be made or other approaches should be taken, such as an overset grid method.
Denner, Fabian; van Wachem, Berend G. M.
2015-10-01
Total variation diminishing (TVD) schemes are a widely applied group of monotonicity-preserving advection differencing schemes for partial differential equations in numerical heat transfer and computational fluid dynamics. These schemes are typically designed for one-dimensional problems or multidimensional problems on structured equidistant quadrilateral meshes. Practical applications, however, often involve complex geometries that cannot be represented by Cartesian meshes and, therefore, necessitate the application of unstructured meshes, which require a more sophisticated discretisation to account for their additional topological complexity. In principle, TVD schemes are applicable to unstructured meshes, however, not all the data required for TVD differencing is readily available on unstructured meshes, and the solution suffers from considerable numerical diffusion as a result of mesh skewness. In this article we analyse TVD differencing on unstructured three-dimensional meshes, focusing on the non-linearity of TVD differencing and the extrapolation of the virtual upwind node. Furthermore, we propose a novel monotonicity-preserving correction method for TVD schemes that significantly reduces numerical diffusion caused by mesh skewness. The presented numerical experiments demonstrate the importance of accounting for the non-linearity introduced by TVD differencing and of imposing carefully chosen limits on the extrapolated virtual upwind node, as well as the efficacy of the proposed method to correct mesh skewness.
Discrete differential geometry: the nonplanar quadrilateral mesh.
Twining, Carole J; Marsland, Stephen
2012-06-01
We consider the problem of constructing a discrete differential geometry defined on nonplanar quadrilateral meshes. Physical models on discrete nonflat spaces are of inherent interest, as well as being used in applications such as computation for electromagnetism, fluid mechanics, and image analysis. However, the majority of analysis has focused on triangulated meshes. We consider two approaches: discretizing the tensor calculus, and a discrete mesh version of differential forms. While these two approaches are equivalent in the continuum, we show that this is not true in the discrete case. Nevertheless, we show that it is possible to construct mesh versions of the Levi-Civita connection (and hence the tensorial covariant derivative and the associated covariant exterior derivative), the torsion, and the curvature. We show how discrete analogs of the usual vector integral theorems are constructed in such a way that the appropriate conservation laws hold exactly on the mesh, rather than only as approximations to the continuum limit. We demonstrate the success of our method by constructing a mesh version of classical electromagnetism and discuss how our formalism could be used to deal with other physical models, such as fluids.
Automatic Scheme Selection for Toolkit Hex Meshing
Energy Technology Data Exchange (ETDEWEB)
TAUTGES,TIMOTHY J.; WHITE,DAVID R.
1999-09-27
Current hexahedral mesh generation techniques rely on a set of meshing tools, which when combined with geometry decomposition leads to an adequate mesh generation process. Of these tools, sweeping tends to be the workhorse algorithm, accounting for at least 50% of most meshing applications. Constraints which must be met for a volume to be sweepable are derived, and it is proven that these constraints are necessary but not sufficient conditions for sweepability. This paper also describes a new algorithm for detecting extruded or sweepable geometries. This algorithm, based on these constraints, uses topological and local geometric information, and is more robust than feature recognition-based algorithms. A method for computing sweep dependencies in volume assemblies is also given. The auto sweep detect and sweep grouping algorithms have been used to reduce interactive user time required to generate all-hexahedral meshes by filtering out non-sweepable volumes needing further decomposition and by allowing concurrent meshing of independent sweep groups. Parts of the auto sweep detect algorithm have also been used to identify independent sweep paths, for use in volume-based interval assignment.
Hydrodynamic simulations on a moving Voronoi mesh
Springel, Volker
2011-01-01
At the heart of any method for computational fluid dynamics lies the question of how the simulated fluid should be discretized. Traditionally, a fixed Eulerian mesh is often employed for this purpose, which in modern schemes may also be adaptively refined during a calculation. Particle-based methods on the other hand discretize the mass instead of the volume, yielding an approximately Lagrangian approach. It is also possible to achieve Lagrangian behavior in mesh-based methods if the mesh is allowed to move with the flow. However, such approaches have often been fraught with substantial problems related to the development of irregularity in the mesh topology. Here we describe a novel scheme that eliminates these weaknesses. It is based on a moving unstructured mesh defined by the Voronoi tessellation of a set of discrete points. The mesh is used to solve the hyperbolic conservation laws of ideal hydrodynamics with a finite volume approach, based on a second-order Godunov scheme with an exact Riemann solver. A...
Fire performance of basalt FRP mesh reinforced HPC thin plates
DEFF Research Database (Denmark)
Hulin, Thomas; Hodicky, Kamil; Schmidt, Jacob Wittrup;
2013-01-01
An experimental program was carried out to investigate the influence of basalt FRP (BFRP) reinforcing mesh on the fire behaviour of thin high performance concrete (HPC) plates applied to sandwich elements. Samples with BFRP mesh were compared to samples with no mesh, samples with steel mesh...
Energy Technology Data Exchange (ETDEWEB)
Martinez Barrios, M.; Garcia Gonzalez, M.; Perez Martin, F. J.
2013-07-01
The main goal of the UNESA MAAP5-SFP project is to analyze the capabilities of MAAP5 code and, particularly, the Spent Fuel Pool (SFP) module in order to tackle its modeling and facilitate the development of specific SFP models of Spanish NPPs. Within the project, Empresarios Agrupados (EEAA) is the responsible for the development of the Guide for the subdivision of the Spent Fuel Pool (SFP). This Guide includes a theoretical description of the model that is used by the code and a sequence of practical cases with the aim to evaluate the influence of specific parameters.
Disentangling volumetric and hydrational properties of proteins.
Voloshin, Vladimir P; Medvedev, Nikolai N; Smolin, Nikolai; Geiger, Alfons; Winter, Roland
2015-02-05
We used molecular dynamics simulations of a typical monomeric protein, SNase, in combination with Voronoi-Delaunay tessellation to study and analyze the temperature dependence of the apparent volume, Vapp, of the solute. We show that the void volume, VB, created in the boundary region between solute and solvent, determines the temperature dependence of Vapp to a major extent. The less pronounced but still significant temperature dependence of the molecular volume of the solute, VM, is essentially the result of the expansivity of its internal voids, as the van der Waals contribution to VM is practically independent of temperature. Results for polypeptides of different chemical nature feature a similar temperature behavior, suggesting that the boundary/hydration contribution seems to be a universal part of the temperature dependence of Vapp. The results presented here shine new light on the discussion surrounding the physical basis for understanding and decomposing the volumetric properties of proteins and biomolecules in general.
All Photons Imaging Through Volumetric Scattering
Satat, Guy; Heshmat, Barmak; Raviv, Dan; Raskar, Ramesh
2016-01-01
Imaging through thick highly scattering media (sample thickness ≫ mean free path) can realize broad applications in biomedical and industrial imaging as well as remote sensing. Here we propose a computational “All Photons Imaging” (API) framework that utilizes time-resolved measurement for imaging through thick volumetric scattering by using both early arrived (non-scattered) and diffused photons. As opposed to other methods which aim to lock on specific photons (coherent, ballistic, acoustically modulated, etc.), this framework aims to use all of the optical signal. Compared to conventional early photon measurements for imaging through a 15 mm tissue phantom, our method shows a two fold improvement in spatial resolution (4db increase in Peak SNR). This all optical, calibration-free framework enables widefield imaging through thick turbid media, and opens new avenues in non-invasive testing, analysis, and diagnosis. PMID:27683065
A Technique for Volumetric CSG Based on Morphology
DEFF Research Database (Denmark)
Bærentzen, Jakob Andreas; Christensen, Niels Jørgen
2001-01-01
In this paper, a new technique for volumetric CSG is presented. The technique requires the input volumes to correspond to solids which fulfill a voxelization suitability criterion. Assume the CSG operation is union. The volumetric union of two such volumes is defined in terms of the voxelization...
Yu, Huidan; Chen, Xi; Wang, Zhiqiang; Deep, Debanjan; Lima, Everton; Zhao, Ye; Teague, Shawn D
2014-06-01
In this paper, we develop a mass-conserved volumetric lattice Boltzmann method (MCVLBM) for numerically solving fluid dynamics with willfully moving arbitrary boundaries. In MCVLBM, fluid particles are uniformly distributed in lattice cells and the lattice Boltzmann equations deal with the time evolution of the particle distribution function. By introducing a volumetric parameter P(x,y,z,t) defined as the occupation of solid volume in the cell, we distinguish three types of lattice cells in the simulation domain: solid cell (pure solid occupation, P=1), fluid cell (pure fluid occupation, P=0), and boundary cell (partial solid and partial fluid, 0Boltzmann equations are self-regularized through P and consist of three parts: (1) collision taking into account the momentum exchange between the willfully moving boundary and the flow; (2) streaming accompanying a volumetric bounce-back procedure in boundary cells; and (3) boundary-induced volumetric fluid migration moving the residual fluid particles into the flow domain when the boundary swipes over a boundary cell toward a solid cell. The MCVLBM strictly satisfies mass conservation and can handle irregular boundary orientation and motion with respect to the mesh. Validation studies are carried out in four cases. The first is to simulate fluid dynamics in syringes focusing on how MCVLBM captures the underlying physics of flow driven by a willfully moving piston. The second and third cases are two-dimensional (2D) peristaltic flow and three-dimensional (3D) pipe flow, respectively. In each case, we compare the MCVLBM simulation result with the analytical solution and achieve quantitatively good agreements. The fourth case is to simulate blood flow in human aortic arteries with a very complicated irregular boundary. We study steady flow in two dimensions and unsteady flow via the pulsation of the cardiac cycle in three dimensions. In the 2D case, both vector (velocity) and scalar (pressure) fields are compared to
Multiple Staggered Mesh Ewald: Boosting the Accuracy of the Smooth Particle Mesh Ewald Method
Wang, Han; Fang, Jun
2016-01-01
The smooth particle mesh Ewald (SPME) method is the standard method for computing the electrostatic interactions in the molecular simulations. In this work, the multiple staggered mesh Ewald (MSME) method is proposed to boost the accuracy of the SPME method. Unlike the SPME that achieves higher accuracy by refining the mesh, the MSME improves the accuracy by averaging the standard SPME forces computed on, e.g. $M$, staggered meshes. We prove, from theoretical perspective, that the MSME is as accurate as the SPME, but uses $M^2$ times less mesh points in a certain parameter range. In the complementary parameter range, the MSME is as accurate as the SPME with twice of the interpolation order. The theoretical conclusions are numerically validated both by a uniform and uncorrelated charge system, and by a three-point-charge water system that is widely used as solvent for the bio-macromolecules.
MR-DTI and PET multimodal imaging of dopamine release within subdivisions of basal ganglia
Tziortzi, A.; Searle, G.; Tsoumpas, C.; Long, C.; Shotbolt, P.; Rabiner, E.; Jenkinson, M.; Gunn, R. N.
2011-09-01
The basal ganglia is a group of anatomical nuclei, functionally organised into limbic, associative and sensorimotor regions, which plays a central role in dopamine related neurological and psychiatric disorders. In this study, we combine two imaging modalities to enable the measurement of dopamine release in functionally related subdivisions of the basal ganglia. [11C]-(+)-PHNO Positron Emission Tomography (PET) measurements in the living human brain pre- and post-administration of amphetamine allow for the estimation of regional dopamine release. Combined Magnetic Resonance Diffusion Tensor Imaging (MR-DTI) data allows for the definition of functional territories of the basal ganglia from connectivity information. The results suggest that there is a difference in dopamine release among the connectivity derived functional subdivisions. Dopamine release is highest in the limbic area followed by the sensorimotor and then the associative area with this pattern reflected in both striatum and pallidum.
Korshikov, I I; Gorlova, E M
2006-06-01
In order to analyze the genetic structure, subdivision and differentiation within and between two small isolated populations of the Crimea relict endemic, Pinus stankewiczii (Sukacz.) Fomin, electrophoretic analysis of the isozyme variation at nine enzymatic systems was carried out using 183 oldest trees. It was demonstrated that in populations of P. stankewiczii, 80% of the genes were in polymorphic state. Each tree was heterozygous at 19.1% loci, and at 21.6% loci in artificial 50-year-old plantation. The genetic structure of two populations was less differentiated (DN = 0.006), compared to their individual localities (DN = 0.008-0.009). Within-population subdivision of the diffusely dispersed populations was higher (FST-GST = 1.8-2.0%) than that of the populations themselves (0.8%).
DEFF Research Database (Denmark)
Clausen, Jens; Zilinskas, A,
2002-01-01
two schemes for sampling points of the function: midpoint sampling and vertex sampling. The convergence of the algorithm is proved, and numerical results are presented for the two dimensional case, for which also a special initial covering is presented. (C) 2002 Elsevier Science Ltd. All rights......We consider the problem of optimizing a Lipshitzian function. The branch and bound technique is a well-known solution method, and the key components for this are the subdivision scheme, the bound calculation scheme, and the initialization. For Lipschitzian optimization, the bound calculations...... are based on the sampling of function values. We propose a branch and bound algorithm based on regular simplexes. Initially, the domain in question is covered with regular simplexes, and our subdivision scheme maintains this property. The bound calculation becomes both simple and efficient, and we describe...
Conservative interpolation between general spherical meshes
Directory of Open Access Journals (Sweden)
E. Kritsikis
2015-06-01
Full Text Available An efficient, local, explicit, second-order, conservative interpolation algorithm between spherical meshes is presented. The cells composing the source and target meshes may be either spherical polygons or longitude–latitude quadrilaterals. Second-order accuracy is obtained by piecewise-linear finite volume reconstruction over the source mesh. Global conservation is achieved through the introduction of a supermesh, whose cells are all possible intersections of source and target cells. Areas and intersections are computed exactly to yield a geometrically exact method. The main efficiency bottleneck caused by the construction of the supermesh is overcome by adopting tree-based data structures and algorithms, from which the mesh connectivity can also be deduced efficiently. The theoretical second-order accuracy is verified using a smooth test function and pairs of meshes commonly used for atmospheric modelling. Experiments confirm that the most expensive operations, especially the supermesh construction, have O(NlogN computational cost. The method presented is meant to be incorporated in pre- or post-processing atmospheric modelling pipelines, or directly into models for flexible input/output. It could also serve as a basis for conservative coupling between model components, e.g. atmosphere and ocean.
Conservative interpolation between general spherical meshes
Kritsikis, Evaggelos; Aechtner, Matthias; Meurdesoif, Yann; Dubos, Thomas
2017-01-01
An efficient, local, explicit, second-order, conservative interpolation algorithm between spherical meshes is presented. The cells composing the source and target meshes may be either spherical polygons or latitude-longitude quadrilaterals. Second-order accuracy is obtained by piece-wise linear finite-volume reconstruction over the source mesh. Global conservation is achieved through the introduction of a supermesh, whose cells are all possible intersections of source and target cells. Areas and intersections are computed exactly to yield a geometrically exact method. The main efficiency bottleneck caused by the construction of the supermesh is overcome by adopting tree-based data structures and algorithms, from which the mesh connectivity can also be deduced efficiently.The theoretical second-order accuracy is verified using a smooth test function and pairs of meshes commonly used for atmospheric modelling. Experiments confirm that the most expensive operations, especially the supermesh construction, have O(NlogN) computational cost. The method presented is meant to be incorporated in pre- or post-processing atmospheric modelling pipelines, or directly into models for flexible input/output. It could also serve as a basis for conservative coupling between model components, e.g., atmosphere and ocean.
Castro-Mateos, Isaac; Pozo, Jose M.; Lazary, Aron; Frangi, Alejandro F.
2016-03-01
Computational medicine aims at developing patient-specific models to help physicians in the diagnosis and treatment selection for patients. The spine, and other skeletal structures, is an articulated object, composed of rigid bones (vertebrae) and non-rigid parts (intervertebral discs (IVD), ligaments and muscles). These components are usually extracted from different image modalities, involving patient repositioning. In the case of the spine, these models require the segmentation of IVDs from MR and vertebrae from CT. In the literature, there exists a vast selection of segmentations methods, but there is a lack of approaches to align the vertebrae and IVDs. This paper presents a method to create patient-specific finite element meshes for biomechanical simulations, integrating rigid and non-rigid parts of articulated objects. First, the different parts are aligned in a complete surface model. Vertebrae extracted from CT are rigidly repositioned in between the IVDs, initially using the IVDs location and then refining the alignment using the MR image with a rigid active shape model algorithm. Finally, a mesh morphing algorithm, based on B-splines, is employed to map a template finite-element (volumetric) mesh to the patient-specific surface mesh. This morphing reduces possible misalignments and guarantees the convexity of the model elements. Results show that the accuracy of the method to align vertebrae into MR, together with IVDs, is similar to that of the human observers. Thus, this method is a step forward towards the automation of patient-specific finite element models for biomechanical simulations.
Karipineni, Farah; Joshi, Priya; Parsikia, Afshin; Dhir, Teena; Joshi, Amit R T
2016-03-01
Laparoscopic-assisted ventral hernia repair (LAVHR) with mesh is well established as the preferred technique for hernia repair. We sought to determine whether primary fascial closure and/or overlap of the mesh reduced recurrence and/or complications. We conducted a retrospective review on 57 LAVHR patients using polyester composite mesh between August 2010 and July 2013. They were divided into mesh-only (nonclosure) and primary fascial closure with mesh (closure) groups. Patient demographics, prior surgical history, mesh overlap, complications, and recurrence rates were compared. Thirty-nine (68%) of 57 patients were in the closure group and 18 (32%) in the nonclosure group. Mean defect sizes were 15.5 and 22.5 cm(2), respectively. Participants were followed for a mean of 1.3 years [standard deviation (SD) = 0.7]. Recurrence rates were 2/39 (5.1%) in the closure group and 1/18 (5.6%) in the nonclosure group (P = 0.947). There were no major postoperative complications in the nonclosure group. The closure group experienced four (10.3%) complications. This was not a statistically significant difference (P = 0.159). The median mesh-to-hernia ratio for all repairs was 15.2 (surface area) and 3.9 (diameter). Median length of stay was 14.5 hours (1.7-99.3) for patients with nonclosure and 11.9 hours (6.9-90.3 hours) for patients with closure (P = 0.625). In conclusion, this is one of the largest series of LAVHR exclusively using polyester dual-sided mesh. Our recurrence rate was about 5 per cent. Significant mesh overlap is needed to achieve such low recurrence rates. Primary closure of hernias seems less important than adequate mesh overlap in preventing recurrence after LAVHR.
A new high-order finite volume method for 3D elastic wave simulation on unstructured meshes
Zhang, Wensheng; Zhuang, Yuan; Zhang, Lina
2017-07-01
In this paper, we proposed a new efficient high-order finite volume method for 3D elastic wave simulation on unstructured tetrahedral meshes. With the relative coarse tetrahedral meshes, we make subdivision in each tetrahedron to generate a stencil for the high-order polynomial reconstruction. The subdivision algorithm guarantees the number of subelements is greater than the degrees of freedom of a complete polynomial. We perform the reconstruction on this stencil by using cell-averaged quantities based on the hierarchical orthonormal basis functions. Unlike the traditional high-order finite volume method, our new method has a very local property like DG and can be written as an inner-split computational scheme which is beneficial to reducing computational amount. Moreover, the stencil in our method is easy to generate for all tetrahedrons especially in the three-dimensional case. The resulting reconstruction matrix is invertible and remains unchanged for all tetrahedrons and thus it can be pre-computed and stored before time evolution. These special advantages facilitate the parallelization and high-order computations. We show convergence results obtained with the proposed method up to fifth order accuracy in space. The high-order accuracy in time is obtained by the Runge-Kutta method. Comparisons between numerical and analytic solutions show the proposed method can provide accurate wavefield information. Numerical simulation for a realistic model with complex topography demonstrates the effectiveness and potential applications of our method. Though the method is proposed based on the 3D elastic wave equation, it can be extended to other linear hyperbolic system.
An Optimization Model for Urban Readjustment and Subdivision Regulations in Turkey
Kucukmehmetoglu, Mehmet; Geymen, Abdurrahman
2014-01-01
Rapid urbanization in Turkey has resulted in various problems in urban spaces such as squatter houses, substandard subdivisions, and low-quality urban environment. In order to facilitate self-motivated developments, government has enacted various laws and bylaws and made amendments in current legal frameworks. The 18th Article (Dough Rule) of the Land and Building Development Law (İmar Kanunu) has various and extensive applications in regulating and restructuring cadastral properties. One of ...
J. W. Booij; Christos Livas
2016-01-01
The asymmetrical intra-arch relationship in Class II subdivision malocclusion poses challenges in the treatment planning and mechanotherapy of such cases. This case report demonstrates a treatment technique engaging unilateral extraction of a maxillary first molar and Begg fixed appliances. The outcome stability and the enhancing effect on the eruption of the third molar in the extraction segment were confirmed by a 4-year follow-up examination.
Directory of Open Access Journals (Sweden)
J. W. Booij
2016-01-01
Full Text Available The asymmetrical intra-arch relationship in Class II subdivision malocclusion poses challenges in the treatment planning and mechanotherapy of such cases. This case report demonstrates a treatment technique engaging unilateral extraction of a maxillary first molar and Begg fixed appliances. The outcome stability and the enhancing effect on the eruption of the third molar in the extraction segment were confirmed by a 4-year follow-up examination.
The Tools of Financial Policy in the Dairy Products Subdivision of the Agroindustrial Complex
Bielosviet Oleksandr. V.
2017-01-01
The article is aimed at definition and classification of tools of the State financial policy in the dairy products subdivision of the agroindustrial complex (DPS of AIC). The article considers the financial policy tools used in terms of targeted programs of the State support for the DPS of AIC: the State target program for development of Ukrainian villages, sectoral program for dairy breeding and the project of the conception of the State target program for development of dairy breeding in Uk...
NSGIC GIS Inventory (aka Ramona) — , was produced all or in part from Hardcopy Maps information as of Not Provided. It is described as 'Centerlines based on newly platted subdivisions'. Data by this...
A Subdivision Method to Unify the Existing Latitude and Longitude Grids
Directory of Open Access Journals (Sweden)
Chengqi Cheng
2016-09-01
Full Text Available As research on large regions of earth progresses, many geographical subdivision grids have been established for various spatial applications by different industries and disciplines. However, there is no clear relationship between the different grids and no consistent spatial reference grid that allows for information exchange and comprehensive application. Sharing and exchange of data across departments and applications are still at a bottleneck. It would represent a significant step forward to build a new grid model that is inclusive of or compatible with most of the existing geodesic grids and that could support consolidation and exchange within existing data services. This study designs a new geographical coordinate global subdividing grid with one dimension integer coding on a 2n tree (GeoSOT that has 2n coordinate subdivision characteristics (global longitude and latitude subdivision and can form integer hierarchies at degree, minute, and second levels. This grid has the multi-dimensional quadtree hierarchical characteristics of a digital earth grid, but also provides good consistency with applied grids, such as those used in mapping, meteorology, oceanography and national geographical, and three-dimensional digital earth grids. No other existing grid codes possess these characteristics.
Göçmen, Z Aslıgül
2014-11-01
Insight into land developers' perspectives on alternative residential developments and the barriers they experience in trying to develop them can be crucial in efforts to change environmentally damaging low-density, large-lot, and automobile-dependent residential patterns. Using a semi-structured interview instrument followed by short surveys, I examined the views of 16 developers in Waukesha County, WI, USA, a county that has experienced significant development pressures and widespread implementation of conservation subdivision design. The land developer investigation focused on conservation subdivision design familiarity and implementation, and identified a number of barriers that developers experienced in implementing the design. While the majority of the developers appeared familiar with the design and had experience developing conservation subdivisions, their motivations for developing them varied, as did their on-site conservation practices. The barriers included the lack of land use regulations supporting the design, economic factors, community opposition, and a lack of knowledge about sustainable residential development practices. Strategies to promote more environmentally sustainable residential land development patterns include providing a more supportive institutional environment, enacting different regulations and guidelines for natural resources protection, and offering education on ecologically sound development and planning practices.
Integration and management of massive remote-sensing data based on GeoSOT subdivision model
Li, Shuang; Cheng, Chengqi; Chen, Bo; Meng, Li
2016-07-01
Owing to the rapid development of earth observation technology, the volume of spatial information is growing rapidly; therefore, improving query retrieval speed from large, rich data sources for remote-sensing data management systems is quite urgent. A global subdivision model, geographic coordinate subdivision grid with one-dimension integer coding on 2n-tree, which we propose as a solution, has been used in data management organizations. However, because a spatial object may cover several grids, ample data redundancy will occur when data are stored in relational databases. To solve this redundancy problem, we first combined the subdivision model with the spatial array database containing the inverted index. We proposed an improved approach for integrating and managing massive remote-sensing data. By adding a spatial code column in an array format in a database, spatial information in remote-sensing metadata can be stored and logically subdivided. We implemented our method in a Kingbase Enterprise Server database system and compared the results with the Oracle platform by simulating worldwide image data. Experimental results showed that our approach performed better than Oracle in terms of data integration and time and space efficiency. Our approach also offers an efficient storage management system for existing storage centers and management systems.
Connectivity editing for quad-dominant meshes
Peng, Chihan
2013-08-01
We propose a connectivity editing framework for quad-dominant meshes. In our framework, the user can edit the mesh connectivity to control the location, type, and number of irregular vertices (with more or fewer than four neighbors) and irregular faces (non-quads). We provide a theoretical analysis of the problem, discuss what edits are possible and impossible, and describe how to implement an editing framework that realizes all possible editing operations. In the results, we show example edits and illustrate the advantages and disadvantages of different strategies for quad-dominant mesh design. © 2013 The Author(s) Computer Graphics Forum © 2013 The Eurographics Association and John Wiley & Sons Ltd.
GRChombo: Numerical relativity with adaptive mesh refinement
Clough, Katy; Figueras, Pau; Finkel, Hal; Kunesch, Markus; Lim, Eugene A.; Tunyasuvunakool, Saran
2015-12-01
In this work, we introduce {\\mathtt{GRChombo}}: a new numerical relativity code which incorporates full adaptive mesh refinement (AMR) using block structured Berger-Rigoutsos grid generation. The code supports non-trivial ‘many-boxes-in-many-boxes’ mesh hierarchies and massive parallelism through the message passing interface. {\\mathtt{GRChombo}} evolves the Einstein equation using the standard BSSN formalism, with an option to turn on CCZ4 constraint damping if required. The AMR capability permits the study of a range of new physics which has previously been computationally infeasible in a full 3 + 1 setting, while also significantly simplifying the process of setting up the mesh for these problems. We show that {\\mathtt{GRChombo}} can stably and accurately evolve standard spacetimes such as binary black hole mergers and scalar collapses into black holes, demonstrate the performance characteristics of our code, and discuss various physics problems which stand to benefit from the AMR technique.
Retrofitting Masonry Walls with Carbon Mesh
Directory of Open Access Journals (Sweden)
Patrick Bischof
2014-01-01
Full Text Available Static-cyclic shear load tests and tensile tests on retrofitted masonry walls were conducted at UAS Fribourg for an evaluation of the newly developed retrofitting system, the S&P ARMO-System. This retrofitting system consists of a composite of carbon mesh embedded in a specially adapted high quality spray mortar. It can be applied with established construction techniques using traditional construction materials. The experimental study has shown that masonry walls reinforced by this retrofitting system reach a similar strength and a higher ductility than retrofits by means of bonded carbon fiber reinforced polymer sheets. Hence, the retrofitting system using carbon fiber meshes embedded in a high quality mortar constitutes a good option for static or seismic retrofits or reinforcements for masonry walls. However, the experimental studies also revealed that the mechanical anchorage of carbon mesh may be delicate depending on its design.
NASA Lewis Meshed VSAT Workshop meeting summary
Ivancic, William
1993-11-01
NASA Lewis Research Center's Space Electronics Division (SED) hosted a workshop to address specific topics related to future meshed very small-aperture terminal (VSAT) satellite communications networks. The ideas generated by this workshop will help to identify potential markets and focus technology development within the commercial satellite communications industry and NASA. The workshop resulted in recommendations concerning these principal points of interest: the window of opportunity for a meshed VSAT system; system availability; ground terminal antenna sizes; recommended multifrequency for time division multiple access (TDMA) uplink; a packet switch design concept for narrowband; and fault tolerance design concepts. This report presents a summary of group presentations and discussion associated with the technological, economic, and operational issues of meshed VSAT architectures that utilize processing satellites.
Mesh saliency with adaptive local patches
Nouri, Anass; Charrier, Christophe; Lézoray, Olivier
2015-03-01
3D object shapes (represented by meshes) include both areas that attract the visual attention of human observers and others less or not attractive at all. This visual attention depends on the degree of saliency exposed by these areas. In this paper, we propose a technique for detecting salient regions in meshes. To do so, we define a local surface descriptor based on local patches of adaptive size and filled with a local height field. The saliency of mesh vertices is then defined as its degree measure with edges weights computed from adaptive patch similarities. Our approach is compared to the state-of-the-art and presents competitive results. A study evaluating the influence of the parameters establishing this approach is also carried out. The strength and the stability of our approach with respect to noise and simplification are also studied.
The generation of hexahedral meshes for assembly geometries: A survey
Energy Technology Data Exchange (ETDEWEB)
TAUTGES,TIMOTHY J.
2000-02-14
The finite element method is being used today to model component assemblies in a wide variety of application areas, including structural mechanics, fluid simulations, and others. Generating hexahedral meshes for these assemblies usually requires the use of geometry decomposition, with different meshing algorithms applied to different regions. While the primary motivation for this approach remains the lack of an automatic, reliable all-hexahedral meshing algorithm, requirements in mesh quality and mesh configuration for typical analyses are also factors. For these reasons, this approach is also sometimes required when producing other types of unstructured meshes. This paper will review progress to date in automating many parts of the hex meshing process, which has halved the time to produce all-hex meshes for large assemblies. Particular issues which have been exposed due to this progress will also be discussed, along with their applicability to the general unstructured meshing problem.
Open preperitoneal groin hernia repair with mesh
DEFF Research Database (Denmark)
Andresen, Kristoffer; Rosenberg, Jacob
2017-01-01
A systematic review was conducted and reported according to the PRISMA statement. PubMed, Cochrane library and Embase were searched systematically. Studies were included if they provided clinical data with more than 30 days follow up following repair of an inguinal hernia with an open preperitoneal mesh......Background For the repair of inguinal hernias, several surgical methods have been presented where the purpose is to place a mesh in the preperitoneal plane through an open access. The aim of this systematic review was to describe preperitoneal repairs with emphasis on the technique. Data sources...
Adaptive mesh refinement for storm surge
Mandli, Kyle T.
2014-03-01
An approach to utilizing adaptive mesh refinement algorithms for storm surge modeling is proposed. Currently numerical models exist that can resolve the details of coastal regions but are often too costly to be run in an ensemble forecasting framework without significant computing resources. The application of adaptive mesh refinement algorithms substantially lowers the computational cost of a storm surge model run while retaining much of the desired coastal resolution. The approach presented is implemented in the GeoClaw framework and compared to ADCIRC for Hurricane Ike along with observed tide gauge data and the computational cost of each model run. © 2014 Elsevier Ltd.
Relativistic MHD with Adaptive Mesh Refinement
Anderson, M; Liebling, S L; Neilsen, D; Anderson, Matthew; Hirschmann, Eric; Liebling, Steven L.; Neilsen, David
2006-01-01
We solve the relativistic magnetohydrodynamics (MHD) equations using a finite difference Convex ENO method (CENO) in 3+1 dimensions within a distributed parallel adaptive mesh refinement (AMR) infrastructure. In flat space we examine a Balsara blast wave problem along with a spherical blast wave and a relativistic rotor test both with unigrid and AMR simulations. The AMR simulations substantially improve performance while reproducing the resolution equivalent unigrid simulation results. We also investigate the impact of hyperbolic divergence cleaning for the spherical blast wave and relativistic rotor. We include unigrid and mesh refinement parallel performance measurements for the spherical blast wave.
Laparoscopic rectocele repair using polyglactin mesh.
Lyons, T L; Winer, W K
1997-05-01
We assessed the efficacy of laparoscopic treatment of rectocele defect using a polyglactin mesh graft. From May 1, 1995, through September 30, 1995, we prospectively evaluated 20 women (age 38-74 yrs) undergoing pelvic floor reconstruction for symptomatic pelvic floor prolapse, with or without hysterectomy. Morbidity of the procedure was extremely low compared with standard transvaginal and transrectal approaches. Patients were followed at 3-month intervals for 1 year. Sixteen had resolution of symptoms. Laparoscopic application of polyglactin mesh for the repair of the rectocele defect is a viable option, although long-term follow-up is necessary.
Adaptive Mesh Refinement for Storm Surge
Mandli, Kyle T
2014-01-01
An approach to utilizing adaptive mesh refinement algorithms for storm surge modeling is proposed. Currently numerical models exist that can resolve the details of coastal regions but are often too costly to be run in an ensemble forecasting framework without significant computing resources. The application of adaptive mesh refinement algorithms substantially lowers the computational cost of a storm surge model run while retaining much of the desired coastal resolution. The approach presented is implemented in the \\geoclaw framework and compared to \\adcirc for Hurricane Ike along with observed tide gauge data and the computational cost of each model run.
Soil volumetric water content measurements using TDR technique
Directory of Open Access Journals (Sweden)
S. Vincenzi
1996-06-01
Full Text Available A physical model to measure some hydrological and thermal parameters in soils will to be set up. The vertical profiles of: volumetric water content, matric potential and temperature will be monitored in different soils. The volumetric soil water content is measured by means of the Time Domain Reflectometry (TDR technique. The result of a test to determine experimentally the reproducibility of the volumetric water content measurements is reported together with the methodology and the results of the analysis of the TDR wave forms. The analysis is based on the calculation of the travel time of the TDR signal in the wave guide embedded in the soil.
Iterative reconstruction of volumetric particle distribution
Wieneke, Bernhard
2013-02-01
For tracking the motion of illuminated particles in space and time several volumetric flow measurement techniques are available like 3D-particle tracking velocimetry (3D-PTV) recording images from typically three to four viewing directions. For higher seeding densities and the same experimental setup, tomographic PIV (Tomo-PIV) reconstructs voxel intensities using an iterative tomographic reconstruction algorithm (e.g. multiplicative algebraic reconstruction technique, MART) followed by cross-correlation of sub-volumes computing instantaneous 3D flow fields on a regular grid. A novel hybrid algorithm is proposed here that similar to MART iteratively reconstructs 3D-particle locations by comparing the recorded images with the projections calculated from the particle distribution in the volume. But like 3D-PTV, particles are represented by 3D-positions instead of voxel-based intensity blobs as in MART. Detailed knowledge of the optical transfer function and the particle image shape is mandatory, which may differ for different positions in the volume and for each camera. Using synthetic data it is shown that this method is capable of reconstructing densely seeded flows up to about 0.05 ppp with similar accuracy as Tomo-PIV. Finally the method is validated with experimental data.
RINGMesh: A programming library for developing mesh-based geomodeling applications
Pellerin, Jeanne; Botella, Arnaud; Bonneau, François; Mazuyer, Antoine; Chauvin, Benjamin; Lévy, Bruno; Caumon, Guillaume
2017-07-01
RINGMesh is a C++ open-source programming library for manipulating discretized geological models. It is designed to ease the development of applications and workflows that use discretized 3D models. It is neither a geomodeler, nor a meshing software. RINGMesh implements functionalities to read discretized surface-based or volumetric structural models and to check their validity. The models can be then exported in various file formats. RINGMesh provides data structures to represent geological structural models, either defined by their discretized boundary surfaces, and/or by discretized volumes. A programming interface allows to develop of new geomodeling methods, and to plug in external software. The goal of RINGMesh is to help researchers to focus on the implementation of their specific method rather than on tedious tasks common to many applications. The documented code is open-source and distributed under the modified BSD license. It is available at https://www.ring-team.org/index.php/software/ringmesh.
MeshEZW: an image coder using mesh and finite elements
Landais, Thomas; Bonnaud, Laurent; Chassery, Jean-Marc
2003-08-01
In this paper, we present a new method to compress the information in an image, called MeshEZW. The proposed approach is based on the finite elements method, a mesh construction and a zerotree method. The zerotree method is an adaptive of the EZW algorithm with two new symbols for increasing the performance. These steps allow a progressive representation of the image by the automatic construction of a bitstream. The mesh structure is adapted to the image compression domain and is defined to allow video comrpession. The coder is described and some preliminary results are discussed.
Constrained and joint inversion on unstructured meshes
Doetsch, J.; Jordi, C.; Rieckh, V.; Guenther, T.; Schmelzbach, C.
2015-12-01
Unstructured meshes allow for inclusion of arbitrary surface topography, complex acquisition geometry and undulating geological interfaces in the inversion of geophysical data. This flexibility opens new opportunities for coupling different geophysical and hydrological data sets in constrained and joint inversions. For example, incorporating geological interfaces that have been derived from high-resolution geophysical data (e.g., ground penetrating radar) can add geological constraints to inversions of electrical resistivity data. These constraints can be critical for a hydrogeological interpretation of the inversion results. For time-lapse inversions of geophysical data, constraints can be derived from hydrological point measurements in boreholes, but it is difficult to include these hard constraints in the inversion of electrical resistivity monitoring data. Especially mesh density and the regularization footprint around the hydrological point measurements are important for an improved inversion compared to the unconstrained case. With the help of synthetic and field examples, we analyze how regularization and coupling operators should be chosen for time-lapse inversions constrained by point measurements and for joint inversions of geophysical data in order to take full advantage of the flexibility of unstructured meshes. For the case of constraining to point measurements, it is important to choose a regularization operator that extends beyond the neighboring cells and the uncertainty in the point measurements needs to be accounted for. For joint inversion, the choice of the regularization depends on the expected subsurface heterogeneity and the cell size of the parameter mesh.
Particle Collection Efficiency for Nylon Mesh Screens.
Cena, Lorenzo G; Ku, Bon-Ki; Peters, Thomas M
Mesh screens composed of nylon fibers leave minimal residual ash and produce no significant spectral interference when ashed for spectrometric examination. These characteristics make nylon mesh screens attractive as a collection substrate for nanoparticles. A theoretical single-fiber efficiency expression developed for wire-mesh screens was evaluated for estimating the collection efficiency of submicrometer particles for nylon mesh screens. Pressure drop across the screens, the effect of particle morphology (spherical and highly fractal) on collection efficiency and single-fiber efficiency were evaluated experimentally for three pore sizes (60, 100 and 180 μm) at three flow rates (2.5, 4 and 6 Lpm). The pressure drop across the screens was found to increase linearly with superficial velocity. The collection efficiency of the screens was found to vary by less than 4% regardless of particle morphology. Single-fiber efficiency calculated from experimental data was in good agreement with that estimated from theory for particles between 40 and 150 nm but deviated from theory for particles outside this size range. New coefficients for the single-fiber efficiency model were identified that minimized the sum of square error (SSE) between the values estimated with the model and those determined experimentally. Compared to the original theory, the SSE calculated using the modified theory was at least one order of magnitude lower for all screens and flow rates with the exception of the 60-μm pore screens at 2.5 Lpm, where the decrease was threefold.
Functionalized Nanofiber Meshes Enhance Immunosorbent Assays.
Hersey, Joseph S; Meller, Amit; Grinstaff, Mark W
2015-12-01
Three-dimensional substrates with high surface-to-volume ratios and subsequently large protein binding capacities are of interest for advanced immunosorbent assays utilizing integrated microfluidics and nanosensing elements. A library of bioactive and antifouling electrospun nanofiber substrates, which are composed of high-molecular-weight poly(oxanorbornene) derivatives, is described. Specifically, a set of copolymers are synthesized from three 7-oxanorbornene monomers to create a set of water insoluble copolymers with both biotin (bioactive) and triethylene glycol (TEG) (antifouling) functionality. Porous three-dimensional nanofiber meshes are electrospun from these copolymers with the ability to specifically bind streptavidin while minimizing the nonspecific binding of other proteins. Fluorescently labeled streptavidin is used to quantify the streptavidin binding capacity of each mesh type through confocal microscopy. A simplified enzyme-linked immunosorbent assay (ELISA) is presented to assess the protein binding capabilities and detection limits of these nanofiber meshes under both static conditions (26 h) and flow conditions (1 h) for a model target protein (i.e., mouse IgG) using a horseradish peroxidase (HRP) colorimetric assay. Bioactive and antifouling nanofiber meshes outperform traditional streptavidin-coated polystyrene plates under flow, validating their use in future advanced immunosorbent assays and their compatibility with microfluidic-based biosensors.
Mesh Optimization for Ground Vehicle Aerodynamics
Directory of Open Access Journals (Sweden)
Adrian Gaylard
2010-04-01
Full Text Available
Mesh optimization strategy for estimating accurate drag of a ground vehicle is proposed based on examining the effect of different mesh parameters. The optimized mesh parameters were selected using design of experiment (DOE method to be able to work in a limited memory environment and in a reasonable amount of time but without compromising the accuracy of results. The study was further extended to take into account the car model size effect. Three car model sizes have been investigated and compared with MIRA scale wind tunnel results. Parameters that lead to drag value closer to experiment with less memory and computational time have been identified. Scaling the optimized mesh size with the length of car model was successfully used to predict the drag of the other car sizes with reasonable accuracy. This investigation was carried out using STARCCM+ commercial software package, however the findings can be applied to any other CFD package.
Details of tetrahedral anisotropic mesh adaptation
Jensen, Kristian Ejlebjerg; Gorman, Gerard
2016-04-01
We have implemented tetrahedral anisotropic mesh adaptation using the local operations of coarsening, swapping, refinement and smoothing in MATLAB without the use of any for- N loops, i.e. the script is fully vectorised. In the process of doing so, we have made three observations related to details of the implementation: 1. restricting refinement to a single edge split per element not only simplifies the code, it also improves mesh quality, 2. face to edge swapping is unnecessary, and 3. optimising for the Vassilevski functional tends to give a little higher value for the mean condition number functional than optimising for the condition number functional directly. These observations have been made for a uniform and a radial shock metric field, both starting from a structured mesh in a cube. Finally, we compare two coarsening techniques and demonstrate the importance of applying smoothing in the mesh adaptation loop. The results pertain to a unit cube geometry, but we also show the effect of corners and edges by applying the implementation in a spherical geometry.
Drag reduction properties of superhydrophobic mesh pipes
Geraldi, Nicasio R.; Dodd, Linzi E.; Xu, Ben B.; Wells, Gary G.; Wood, David; Newton, Michael I.; McHale, Glen
2017-09-01
Even with the recent extensive study into superhydrophobic surfaces, the fabrication of such surfaces on the inside walls of a pipe remains challenging. In this work we report a convenient bi-layered pipe design using a thin superhydrophobic metallic mesh formed into a tube, supported inside another pipe. A flow system was constructed to test the fabricated bi-layer pipeline, which allowed for different constant flow rates of water to be passed through the pipe, whilst the differential pressure was measured, from which the drag coefficient (ƒ) and Reynolds numbers (Re) were calculated. Expected values of ƒ were found for smooth glass pipes for the Reynolds number (Re) range 750-10 000, in both the laminar and part of the turbulent regimes. Flow through plain meshes without the superhydrophobic coating were also measured over a similar range (750 superhydrophobic coating, ƒ was found for 4000 superhydrophobic mesh can support a plastron and provide a drag reduction compared to a plain mesh, however, the plastron is progressively destroyed with use and in particular at higher flow rates.
Performance Evaluation of Coded Meshed Networks
DEFF Research Database (Denmark)
Krigslund, Jeppe; Hansen, Jonas; Pedersen, Morten Videbæk;
2013-01-01
of the former to enhance the gains of the latter. We first motivate our work through measurements in WiFi mesh networks. Later, we compare state-of-the-art approaches, e.g., COPE, RLNC, to CORE. Our measurements show the higher reliability and throughput of CORE over other schemes, especially, for asymmetric...
Mesh Currents and Josephson Junction Arrays
1995-01-01
A simple but accurate mesh current analysis is performed on a XY model and on a SIMF model to derive the equations for a Josephson junction array. The equations obtained here turn out to be different from other equations already existing in the literature. Moreover, it is shown that the two models come from an unique hidden structure
New method to interpolate images using Doo Sabin subdivision%基于Doo Sabin细分的图像插值
Institute of Scientific and Technical Information of China (English)
梁云; 王栋
2011-01-01
图像插值是放大低分辨率图像以适应目标显示屏幕的一种重要方法.保持图像的几何特征是保证放大图像质量的一个有效途径.基于Doo Sabin细分,提出了一种新的图像插值方法.该方法首先通过一次映射关系获取高分辨图像的部分数据;然后根据高分辨率图像中未知像素点的几何特征将它们分类;再根据Doo Sabin细分方法由已知像素点插值出所有未知像素点.未知像素点的值是与最相关的邻近像素点的加权均值,加权策略根据像素点间的相对位置由Doo Sabin细分推演获得.实验证明,与现有插值方法相比,基于Doo Sabin细分的图像插值能够更好地保持上采样图像的边缘的尖锐特性,减少锯齿现象,获取高质量的高分辨率图像.%Image interpolation is an important method to magnify images with low resolution to adapt to the target screens.To preserve the geometry feature of the original image is an effective way to improve the quality of magnified images. This paper proposed a new method to interpolate images based on Doo Sabin subdivision. The method adopted the essential idea of subdividing the quadrilateral mesh to enhance the sampling images of low resolution. Firstly, part of the data of high resolution images was obtained by mapping low resolution images. Secondly we classified the unknown pixels of high resolution images according to their geometric features. Then we interpolated all the unknown pixels by the assigned pixels. Values of the unknown pixels were the weighted average of their neighboring pixels. The weighted strategy was deduced by Doo Sabin subdivision. Experiments show that our method can preserve the sharp feature of image edges, decrease zigzags and achieve better results than the previous methods.
Characterizing volumetric deformation behavior of naturally occuring bituminous sand materials
CSIR Research Space (South Africa)
Anochie-Boateng, Joseph
2009-05-01
Full Text Available newly proposed hydrostatic compression test procedure. The test procedure applies field loading conditions of off-road construction and mining equipment to closely simulate the volumetric deformation and stiffness behaviour of oil sand materials. Based...
Hyperspectral image classification based on volumetric texture and dimensionality reduction
Su, Hongjun; Sheng, Yehua; Du, Peijun; Chen, Chen; Liu, Kui
2015-06-01
A novel approach using volumetric texture and reduced-spectral features is presented for hyperspectral image classification. Using this approach, the volumetric textural features were extracted by volumetric gray-level co-occurrence matrices (VGLCM). The spectral features were extracted by minimum estimated abundance covariance (MEAC) and linear prediction (LP)-based band selection, and a semi-supervised k-means (SKM) clustering method with deleting the worst cluster (SKMd) bandclustering algorithms. Moreover, four feature combination schemes were designed for hyperspectral image classification by using spectral and textural features. It has been proven that the proposed method using VGLCM outperforms the gray-level co-occurrence matrices (GLCM) method, and the experimental results indicate that the combination of spectral information with volumetric textural features leads to an improved classification performance in hyperspectral imagery.
Designing remote web-based mechanical-volumetric flow meter ...
African Journals Online (AJOL)
... remote web-based mechanical-volumetric flow meter reading systems based on ... damage and also provides the ability to control and manage consumption. ... existing infrastructure of the telecommunications is used in data transmission.
Oxidation and degradation of polypropylene transvaginal mesh.
Talley, Anne D; Rogers, Bridget R; Iakovlev, Vladimir; Dunn, Russell F; Guelcher, Scott A
2017-04-01
Polypropylene (PP) transvaginal mesh (TVM) repair for stress urinary incontinence (SUI) has shown promising short-term objective cure rates. However, life-altering complications have been associated with the placement of PP mesh for SUI repair. PP degradation as a result of the foreign body reaction (FBR) has been proposed as a contributing factor to mesh complications. We hypothesized that PP oxidizes under in vitro conditions simulating the FBR, resulting in degradation of the PP. Three PP mid-urethral slings from two commercial manufacturers were evaluated. Test specimens (n = 6) were incubated in oxidative medium for up to 5 weeks. Oxidation was assessed by Fourier Transform Infrared Spectroscopy (FTIR), and degradation was evaluated by scanning electron microscopy (SEM). FTIR spectra of the slings revealed evidence of carbonyl and hydroxyl peaks after 5 weeks of incubation time, providing evidence of oxidation of PP. SEM images at 5 weeks showed evidence of surface degradation, including pitting and flaking. Thus, oxidation and degradation of PP pelvic mesh were evidenced by chemical and physical changes under simulated in vivo conditions. To assess changes in PP surface chemistry in vivo, fibers were recovered from PP mesh explanted from a single patient without formalin fixation, untreated (n = 5) or scraped (n = 5) to remove tissue, and analyzed by X-ray photoelectron spectroscopy. Mechanical scraping removed adherent tissue, revealing an underlying layer of oxidized PP. These findings underscore the need for further research into the relative contribution of oxidative degradation to complications associated with PP-based TVM devices in larger cohorts of patients.
Wireless Mesh Network Routing Under Uncertain Demands
Wellons, Jonathan; Dai, Liang; Chang, Bin; Xue, Yuan
Traffic routing plays a critical role in determining the performance of a wireless mesh network. Recent research results usually fall into two ends of the spectrum. On one end are the heuristic routing algorithms, which are highly adaptive to the dynamic environments of wireless networks yet lack the analytical properties of how well the network performs globally. On the other end are the optimal routing algorithms that are derived from the optimization problem formulation of mesh network routing. They can usually claim analytical properties such as resource use optimality and throughput fairness. However, traffic demand is usually implicitly assumed as static and known a priori in these problem formulations. In contrast, recent studies of wireless network traces show that the traffic demand, even being aggregated at access points, is highly dynamic and hard to estimate. Thus, to apply the optimization-based routing solution in practice, one must take into account the dynamic and uncertain nature of wireless traffic demand. There are two basic approaches to address the traffic uncertainty in optimal mesh network routing (1) predictive routing that infers the traffic demand with maximum possibility based in its history and optimizes the routing strategy based on the predicted traffic demand and (2) oblivious routing that considers all the possible traffic demands and selects the routing strategy where the worst-case network performance could be optimized. This chapter provides an overview of the optimal routing strategies for wireless mesh networks with a focus on the above two strategies that explicitly consider the traffic uncertainty. It also identifies the key factors that affect the performance of each routing strategy and provides guidelines towards the strategy selection in mesh network routing under uncertain traffic demands.
The mesh-matching algorithm: an automatic 3D mesh generator for Finite element structures
Couteau, B; Lavallee, S; Payan, Yohan; Lavallee, St\\'{e}phane
2000-01-01
Several authors have employed Finite Element Analysis (FEA) for stress and strain analysis in orthopaedic biomechanics. Unfortunately, the use of three-dimensional models is time consuming and consequently the number of analysis to be performed is limited. The authors have investigated a new method allowing automatically 3D mesh generation for structures as complex as bone for example. This method called Mesh-Matching (M-M) algorithm generated automatically customized 3D meshes of bones from an already existing model. The M-M algorithm has been used to generate FE models of ten proximal human femora from an initial one which had been experimentally validated. The new meshes seemed to demonstrate satisfying results.
Randomized clinical trial of self-gripping mesh versus sutured mesh for Lichtenstein hernia repair
DEFF Research Database (Denmark)
Jorgensen, L N; Sommer, T; Assaadzadeh, S;
2012-01-01
between the groups in postoperative complications (33·7 versus 40·4 per cent; P = 0·215), rate of recurrent hernia within 1 year (1·2 per cent in both groups) or quality of life. CONCLUSION: The avoidance of suture fixation using a self-gripping mesh was not accompanied by a reduction in chronic symptoms......BACKGROUND: Many patients develop discomfort after open repair of a groin hernia. It was hypothesized that suture fixation of the mesh is a cause of these symptoms. METHODS: This patient- and assessor-blinded randomized multicentre clinical trial compared a self-gripping mesh (Parietene Progrip......(®) ) and sutured mesh for open primary repair of uncomplicated inguinal hernia by the Lichtenstein technique. Patients were assessed before surgery, on the day of operation, and at 1 and 12 months after surgery. The primary endpoint was moderate or severe symptoms after 12 months, including a combination...
Moving mesh generation with a sequential approach for solving PDEs
DEFF Research Database (Denmark)
of physical and mesh equations suffers typically from long computation time due to highly nonlinear coupling between the two equations. Moreover, the extended system (physical and mesh equations) may be sensitive to the tuning parameters such as a temporal relaxation factor. It is therefore useful to design...... adaptive grid method (local refinement by adding/deleting the meshes at a discrete time level) as well as of efficiency for the dynamic adaptive grid method (or moving mesh method) where the number of meshes is not changed. For illustration, a phase change problem is solved with the decomposition algorithm.......In moving mesh methods, physical PDEs and a mesh equation derived from equidistribution of an error metrics (so-called the monitor function) are simultaneously solved and meshes are dynamically concentrated on steep regions (Lim et al., 2001). However, the simultaneous solution procedure...
CUBIT mesh generation environment. Volume 1: Users manual
Energy Technology Data Exchange (ETDEWEB)
Blacker, T.D.; Bohnhoff, W.J.; Edwards, T.L. [and others
1994-05-01
The CUBIT mesh generation environment is a two- and three-dimensional finite element mesh generation tool which is being developed to pursue the goal of robust and unattended mesh generation--effectively automating the generation of quadrilateral and hexahedral elements. It is a solid-modeler based preprocessor that meshes volume and surface solid models for finite element analysis. A combination of techniques including paving, mapping, sweeping, and various other algorithms being developed are available for discretizing the geometry into a finite element mesh. CUBIT also features boundary layer meshing specifically designed for fluid flow problems. Boundary conditions can be applied to the mesh through the geometry and appropriate files for analysis generated. CUBIT is specifically designed to reduce the time required to create all-quadrilateral and all-hexahedral meshes. This manual is designed to serve as a reference and guide to creating finite element models in the CUBIT environment.
On combining Laplacian and optimization-based mesh smoothing techniques
Energy Technology Data Exchange (ETDEWEB)
Freitag, L.A.
1997-07-01
Local mesh smoothing algorithms have been shown to be effective in repairing distorted elements in automatically generated meshes. The simplest such algorithm is Laplacian smoothing, which moves grid points to the geometric center of incident vertices. Unfortunately, this method operates heuristically and can create invalid meshes or elements of worse quality than those contained in the original mesh. In contrast, optimization-based methods are designed to maximize some measure of mesh quality and are very effective at eliminating extremal angles in the mesh. These improvements come at a higher computational cost, however. In this article the author proposes three smoothing techniques that combine a smart variant of Laplacian smoothing with an optimization-based approach. Several numerical experiments are performed that compare the mesh quality and computational cost for each of the methods in two and three dimensions. The author finds that the combined approaches are very cost effective and yield high-quality meshes.
Increasing the volumetric efficiency of Diesel engines by intake pipes
List, Hans
1933-01-01
Development of a method for calculating the volumetric efficiency of piston engines with intake pipes. Application of this method to the scavenging pumps of two-stroke-cycle engines with crankcase scavenging and to four-stroke-cycle engines. The utility of the method is demonstrated by volumetric-efficiency tests of the two-stroke-cycle engines with crankcase scavenging. Its practical application to the calculation of intake pipes is illustrated by example.
Serial volumetric registration of pulmonary CT studies
Silva, José Silvestre; Silva, Augusto; Sousa Santos, Beatriz
2008-03-01
Detailed morphological analysis of pulmonary structures and tissue, provided by modern CT scanners, is of utmost importance as in the case of oncological applications both for diagnosis, treatment, and follow-up. In this case, a patient may go through several tomographic studies throughout a period of time originating volumetric sets of image data that must be appropriately registered in order to track suspicious radiological findings. The structures or regions of interest may change their position or shape in CT exams acquired at different moments, due to postural, physiologic or pathologic changes, so, the exams should be registered before any follow-up information can be extracted. Postural mismatching throughout time is practically impossible to avoid being particularly evident when imaging is performed at the limiting spatial resolution. In this paper, we propose a method for intra-patient registration of pulmonary CT studies, to assist in the management of the oncological pathology. Our method takes advantage of prior segmentation work. In the first step, the pulmonary segmentation is performed where trachea and main bronchi are identified. Then, the registration method proceeds with a longitudinal alignment based on morphological features of the lungs, such as the position of the carina, the pulmonary areas, the centers of mass and the pulmonary trans-axial principal axis. The final step corresponds to the trans-axial registration of the corresponding pulmonary masked regions. This is accomplished by a pairwise sectional registration process driven by an iterative search of the affine transformation parameters leading to optimal similarity metrics. Results with several cases of intra-patient, intra-modality registration, up to 7 time points, show that this method provides accurate registration which is needed for quantitative tracking of lesions and the development of image fusion strategies that may effectively assist the follow-up process.
Volumetric optoacoustic monitoring of endovenous laser treatments
Fehm, Thomas F.; Deán-Ben, Xosé L.; Schaur, Peter; Sroka, Ronald; Razansky, Daniel
2016-03-01
Chronic venous insufficiency (CVI) is one of the most common medical conditions with reported prevalence estimates as high as 30% in the adult population. Although conservative management with compression therapy may improve the symptoms associated with CVI, healing often demands invasive procedures. Besides established surgical methods like vein stripping or bypassing, endovenous laser therapy (ELT) emerged as a promising novel treatment option during the last 15 years offering multiple advantages such as less pain and faster recovery. Much of the treatment success hereby depends on monitoring of the treatment progression using clinical imaging modalities such as Doppler ultrasound. The latter however do not provide sufficient contrast, spatial resolution and three-dimensional imaging capacity which is necessary for accurate online lesion assessment during treatment. As a consequence, incidence of recanalization, lack of vessel occlusion and collateral damage remains highly variable among patients. In this study, we examined the capacity of volumetric optoacoustic tomography (VOT) for real-time monitoring of ELT using an ex-vivo ox foot model. ELT was performed on subcutaneous veins while optoacoustic signals were acquired and reconstructed in real-time and at a spatial resolution in the order of 200μm. VOT images showed spatio-temporal maps of the lesion progression, characteristics of the vessel wall, and position of the ablation fiber's tip during the pull back. It was also possible to correlate the images with the temperature elevation measured in the area adjacent to the ablation spot. We conclude that VOT is a promising tool for providing online feedback during endovenous laser therapy.
Treatment planning for volumetric modulated arc therapy
Energy Technology Data Exchange (ETDEWEB)
Bedford, James L. [Joint Department of Physics, Institute of Cancer Research and The Royal Marsden NHS Foundation Trust, Downs Road, Sutton, Surrey SM2 5PT (United Kingdom)
2009-11-15
Purpose: Volumetric modulated arc therapy (VMAT) is a specific type of intensity-modulated radiation therapy (IMRT) in which the gantry speed, multileaf collimator (MLC) leaf position, and dose rate vary continuously during delivery. A treatment planning system for VMAT is presented. Methods: Arc control points are created uniformly throughout one or more arcs. An iterative least-squares algorithm is used to generate a fluence profile at every control point. The control points are then grouped and all of the control points in a given group are used to approximate the fluence profiles. A direct-aperture optimization is then used to improve the solution, taking into account the allowed range of leaf motion of the MLC. Dose is calculated using a fast convolution algorithm and the motion between control points is approximated by 100 interpolated dose calculation points. The method has been applied to five cases, consisting of lung, rectum, prostate and seminal vesicles, prostate and pelvic lymph nodes, and head and neck. The resulting plans have been compared with segmental (step-and-shoot) IMRT and delivered and verified on an Elekta Synergy to ensure practicality. Results: For the lung, prostate and seminal vesicles, and rectum cases, VMAT provides a plan of similar quality to segmental IMRT but with faster delivery by up to a factor of 4. For the prostate and pelvic nodes and head-and-neck cases, the critical structure doses are reduced with VMAT, both of these cases having a longer delivery time than IMRT. The plans in general verify successfully, although the agreement between planned and measured doses is not very close for the more complex cases, particularly the head-and-neck case. Conclusions: Depending upon the emphasis in the treatment planning, VMAT provides treatment plans which are higher in quality and/or faster to deliver than IMRT. The scheme described has been successfully introduced into clinical use.
Visualization and volumetric structures from MR images of the brain
Energy Technology Data Exchange (ETDEWEB)
Parvin, B.; Johnston, W.; Robertson, D.
1994-03-01
Pinta is a system for segmentation and visualization of anatomical structures obtained from serial sections reconstructed from magnetic resonance imaging. The system approaches the segmentation problem by assigning each volumetric region to an anatomical structure. This is accomplished by satisfying constraints at the pixel level, slice level, and volumetric level. Each slice is represented by an attributed graph, where nodes correspond to regions and links correspond to the relations between regions. These regions are obtained by grouping pixels based on similarity and proximity. The slice level attributed graphs are then coerced to form a volumetric attributed graph, where volumetric consistency can be verified. The main novelty of our approach is in the use of the volumetric graph to ensure consistency from symbolic representations obtained from individual slices. In this fashion, the system allows errors to be made at the slice level, yet removes them when the volumetric consistency cannot be verified. Once the segmentation is complete, the 3D surfaces of the brain can be constructed and visualized.
Soft bilateral filtering volumetric shadows using cube shadow maps
Ali, Hatam H.; Sunar, Mohd Shahrizal; Kolivand, Hoshang
2017-01-01
Volumetric shadows often increase the realism of rendered scenes in computer graphics. Typical volumetric shadows techniques do not provide a smooth transition effect in real-time with conservation on crispness of boundaries. This research presents a new technique for generating high quality volumetric shadows by sampling and interpolation. Contrary to conventional ray marching method, which requires extensive time, this proposed technique adopts downsampling in calculating ray marching. Furthermore, light scattering is computed in High Dynamic Range buffer to generate tone mapping. The bilateral interpolation is used along a view rays to smooth transition of volumetric shadows with respect to preserving-edges. In addition, this technique applied a cube shadow map to create multiple shadows. The contribution of this technique isreducing the number of sample points in evaluating light scattering and then introducing bilateral interpolation to improve volumetric shadows. This contribution is done by removing the inherent deficiencies significantly in shadow maps. This technique allows obtaining soft marvelous volumetric shadows, having a good performance and high quality, which show its potential for interactive applications. PMID:28632740
INCISIONAL HERNIA - ONLAY VS SUBLAY MESH HERNIOPLAS T Y
Ravi Kamal Kumar; Chandrakumar; Vijayalaxmi,; Thokala; Venkat Ramana
2015-01-01
BACKGROUND : Incisional hernia is a common surgical problem. Anatomical repair of hernia is now out of vogue. Polypropylene mesh repair has now become accepted. In open mesh repair of incisional hernia cases the site of placement of mesh is still debated. Some surgeo ns favour the onlay repair and others use sublay or retro - rectus plane for deployment of the mesh. AIM: The aim of the study is to examine the pros and cons of both the techniques and find the bett...
Explicit inverse distance weighting mesh motion for coupled problems
Witteveen, J.A.S.; Bijl, H.
2009-01-01
An explicit mesh motion algorithm based on inverse distance weighting interpolation is presented. The explicit formulation leads to a fast mesh motion algorithm and an easy implementation. In addition, the proposed point-by-point method is robust and flexible in case of large deformations, hanging nodes, and parallelization. Mesh quality results and CPU time comparisons are presented for triangular and hexahedral unstructured meshes in an airfoil flutter fluid-structure interaction problem.
On Reducing Delay in Mesh-Based P2P Streaming: A Mesh-Push Approach
Liu, Zheng; Xue, Kaiping; Hong, Peilin
The peer-assisted streaming paradigm has been widely employed to distribute live video data on the internet recently. In general, the mesh-based pull approach is more robust and efficient than the tree-based push approach. However, pull protocol brings about longer streaming delay, which is caused by the handshaking process of advertising buffer map message, sending request message and scheduling of the data block. In this paper, we propose a new approach, mesh-push, to address this issue. Different from the traditional pull approach, mesh-push implements block scheduling algorithm at sender side, where the block transmission is initiated by the sender rather than by the receiver. We first formulate the optimal upload bandwidth utilization problem, then present the mesh-push approach, in which a token protocol is designed to avoid block redundancy; a min-cost flow model is employed to derive the optimal scheduling for the push peer; and a push peer selection algorithm is introduced to reduce control overhead. Finally, we evaluate mesh-push through simulation, the results of which show mesh-push outperforms the pull scheduling in streaming delay, and achieves comparable delivery ratio at the same time.
A testing preocedure for the evaluation of directional mesh bias
Slobbe, A.T.; Hendriks, M.A.N.; Rots, J.G.
2013-01-01
This paper presents a dedicated numerical test that enables to assess the directional mesh bias of constitutive models in a systematic way. The test makes use of periodic boundary conditions, by which strain localization can be analyzed for different mesh alignments with preservation of mesh uniform
Multiphase flow of immiscible fluids on unstructured moving meshes
DEFF Research Database (Denmark)
Misztal, Marek Krzysztof; Erleben, Kenny; Bargteil, Adam
2012-01-01
In this paper, we present a method for animating multiphase flow of immiscible fluids using unstructured moving meshes. Our underlying discretization is an unstructured tetrahedral mesh, the deformable simplicial complex (DSC), that moves with the flow in a Lagrangian manner. Mesh optimization op...
21 CFR 870.3650 - Pacemaker polymeric mesh bag.
2010-04-01
... 21 Food and Drugs 8 2010-04-01 2010-04-01 false Pacemaker polymeric mesh bag. 870.3650 Section 870...) MEDICAL DEVICES CARDIOVASCULAR DEVICES Cardiovascular Prosthetic Devices § 870.3650 Pacemaker polymeric mesh bag. (a) Identification. A pacemaker polymeric mesh bag is an implanted device used to hold a...
Gonzales, Matthew J; Sturgeon, Gregory; Krishnamurthy, Adarsh; Hake, Johan; Jonas, René; Stark, Paul; Rappel, Wouter-Jan; Narayan, Sanjiv M; Zhang, Yongjie; Segars, W Paul; McCulloch, Andrew D
2013-07-01
High-order cubic Hermite finite elements have been valuable in modeling cardiac geometry, fiber orientations, biomechanics, and electrophysiology, but their use in solving three-dimensional problems has been limited to ventricular models with simple topologies. Here, we utilized a subdivision surface scheme and derived a generalization of the "local-to-global" derivative mapping scheme of cubic Hermite finite elements to construct bicubic and tricubic Hermite models of the human atria with extraordinary vertices from computed tomography images of a patient with atrial fibrillation. To an accuracy of 0.6 mm, we were able to capture the left atrial geometry with only 142 bicubic Hermite finite elements, and the right atrial geometry with only 90. The left and right atrial bicubic Hermite meshes were G1 continuous everywhere except in the one-neighborhood of extraordinary vertices, where the mean dot products of normals at adjacent elements were 0.928 and 0.925. We also constructed two biatrial tricubic Hermite models and defined fiber orientation fields in agreement with diagrammatic data from the literature using only 42 angle parameters. The meshes all have good quality metrics, uniform element sizes, and elements with aspect ratios near unity, and are shared with the public. These new methods will allow for more compact and efficient patient-specific models of human atrial and whole heart physiology. Copyright © 2013 Elsevier B.V. All rights reserved.
A volumetric study of parietal lobe subregions in Turner syndrome
Brown, Wendy E.; Shelli R Kesler; Eliez, Stephan; Warsofsky, Ilana S.; Haberecht, Michael; Reiss, Allan L.
2004-01-01
Turner syndrome, a genetic disorder that results from the complete or partial absence of an X chromosome in females, has been associated with specific impairment in visuospatial cognition. Previous studies have demonstrated a relationship between parietal lobe abnormalities and visuospatial deficits in Turner syndrome. We used high-resolution magnetic resonance imaging to measure parietal lobe subdivisions in 14 participants with Turner syndrome (mean age 13 years 5 months, SD 5 years) and 14...
Resources calculation of cobalt-rich crusts with the grid subdivision and integral method
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
On the basis of three geological models and several orebody boundaries, a method of grid subdivision and integral has been proposed to calculate and evaluate the resources of cobalt-rich crusts on the seamounts in the central Pacific Ocean. The formulas of this method are deduced and the interface of program module is designed. The method is carried out in the software "Auto mapping system of submarine topography and geomorphology MBChart". This method and program will possibly become a potential tool to calculate the resources of seamounts and determine the target diggings for China's next Five-year Plan.
Subdivisions in digraphs of large out-degree or large dichromatic number
2016-01-01
In 1985, Mader conjectured the existence of a function $f$ such that every digraph with minimum out-degree at least $f(k)$ contains a subdivision of the transitive tournament of order $k$. This conjecture is still completely open, as the existence of $f(5)$ remains unknown. In this paper, we show that if $D$ is an oriented path, or an in-arborescence (i.e., a tree with all edges oriented towards the root) or the union of two directed paths from $x$ to $y$ and a directed path from $y$ to $x$, ...
Triangulations, Subdivisions, and Covers for Control of Affine Hypersurface Systems on Polytopes
Lin, Zhiyun
2009-01-01
This paper studies the problem for an affine hypersurface system to reach a polytopic target set starting from inside a polytope in the state space. We present an exhaustive solution which begins with a characterization of states which can reach the target by open-loop control and concludes with a systematic procedure to synthesize a feedback control. Our emphasis is on methods of subdivision, triangulation, and covers which explicitly account for the capabilities of the control system. In contrast with previous literature, the partition methods are guaranteed to yield a correct feedback synthesis, assuming the problem is solvable by open-loop control.
Subdivision design and stewardship affect bird and mammal use of conservation developments.
Farr, Cooper M; Pejchar, Liba; Reed, Sarah E
2017-06-01
Developing effective tools for conservation on private lands is increasingly important for global biodiversity conservation; private lands are located in more productive and biologically diverse areas, and they face accelerated rates of land conversion. One strategy is conservation development (CD) subdivisions, which cluster houses in a small portion of a property and preserve the remaining land as protected open space. Despite widespread use, the characteristics that make CD more or less effective at achieving biodiversity conservation are not well understood. We investigated CD's ability to successfully protect animal populations by examining bird and mammal occurrences in 14 CD subdivisions and four undeveloped areas (range: 14-432 ha) in northern Colorado, USA. Using point count and camera trap data in an occupancy modeling framework, we evaluated the relative importance of nine subdivision design factors (e.g., housing density, proportion of CD protected) and 14 stewardship factors (e.g., presence of livestock, percent native vegetation cover) in influencing the overall community composition and the probability of use by 16 birds and six mammals. We found that habitat use by 75% of birds and 83% of mammals was associated with design characteristics that maximized the natural or undisturbed land area both within and near the development (e.g., proportion of CD protected, total area of protected open space, proportion of natural land cover in the surrounding landscape). These factors were also associated with an increasing dominance of human-sensitive bird species, larger-bodied mammals, and mammals with larger home ranges. Habitat use by birds was also influenced by local land use composition and quality, and use by several bird and mammal species decreased with increased localized disturbances. We found few differences in habitat use between sampling sites in undeveloped areas and in CD subdivisions. These similarities indicate that, if CDs are large enough
To mesh or not to mesh: a review of pelvic organ reconstructive surgery
Directory of Open Access Journals (Sweden)
Dällenbach P
2015-04-01
Full Text Available Patrick Dällenbach Department of Gynecology and Obstetrics, Division of Gynecology, Urogynecology Unit, Geneva University Hospitals, Geneva, Switzerland Abstract: Pelvic organ prolapse (POP is a major health issue with a lifetime risk of undergoing at least one surgical intervention estimated at close to 10%. In the 1990s, the risk of reoperation after primary standard vaginal procedure was estimated to be as high as 30% to 50%. In order to reduce the risk of relapse, gynecological surgeons started to use mesh implants in pelvic organ reconstructive surgery with the emergence of new complications. Recent studies have nevertheless shown that the risk of POP recurrence requiring reoperation is lower than previously estimated, being closer to 10% rather than 30%. The development of mesh surgery – actively promoted by the marketing industry – was tremendous during the past decade, and preceded any studies supporting its benefit for our patients. Randomized trials comparing the use of mesh to native tissue repair in POP surgery have now shown better anatomical but similar functional outcomes, and meshes are associated with more complications, in particular for transvaginal mesh implants. POP is not a life-threatening condition, but a functional problem that impairs quality of life for women. The old adage “primum non nocere” is particularly appropriate when dealing with this condition which requires no treatment when asymptomatic. It is currently admitted that a certain degree of POP is physiological with aging when situated above the landmark of the hymen. Treatment should be individualized and the use of mesh needs to be selective and appropriate. Mesh implants are probably an important tool in pelvic reconstructive surgery, but the ideal implant has yet to be found. The indications for its use still require caution and discernment. This review explores the reasons behind the introduction of mesh augmentation in POP surgery, and aims to
Shih, Chihhsiong; Yang, Yuanfan
2012-02-01
A novel three-dimensional (3-D) photorealistic texturing process is presented that applies a view-planning and view-sequencing algorithm to the 3-D coarse model to determine a set of best viewing angles for capturing the individual real-world objects/building's images. The best sequence of views will generate sets of visible edges in each view to serve as a guide for camera field shots by either manual adjustment or equipment alignment. The best view tries to cover as many objects/building surfaces as possible in one shot. This will lead to a smaller total number of shots taken for a complete model reconstruction requiring texturing with photo-realistic effects. The direct linear transformation method (DLT) is used for reprojection of 3-D model vertices onto a two-dimensional (2-D) images plane for actual texture mapping. Given this method, the actual camera orientations do not have to be unique and can be set arbitrarily without heavy and expensive positioning equipment. We also present results of a study on the texture-mapping precision as a function of the level of visible mesh subdivision. In addition, the control points selection for the DLT method used for reprojection of 3-D model vertices onto 2-D textured images is also investigated for its effects on mapping precision. By using DLT and perspective projection theories on a coarse model feature points, this technique will allow accurate 3-D texture mapping of refined model meshes of real-world buildings. The novel integration flow of this research not only greatly reduces the human labor and intensive equipment requirements of traditional methods, but also generates a more appealing photo-realistic appearance of reconstructed models, which is useful in many multimedia applications. The roles of view planning (VP) are multifold. VP can (1) reduce the repetitive texture-mapping computation load, (2) can present a set of visible model wireframe edges that can serve as a guide for images with sharp edges and
Aliyazicioglu, Tolga; Yalti, Tunc; Kabaoglu, Burcak
2017-08-01
Approximately one fifth of patients suffer from inguinal pain after laparoscopic total extraperitoneal (TEP) inguinal hernia repair. There is existing literature suggesting that the staples used to fix the mesh can cause postoperative inguinal pain. In this study, we describe our experience with laparoscopic TEP inguinal hernia surgery using 3-dimensional mesh without mesh fixation, in our institution. A total of 300 patients who had undergone laparoscopic TEP inguinal hernia repair with 3-dimensional mesh in VKV American Hospital, Istanbul from November 2006 to November 2015 were studied retrospectively. Using the hospital's electronic archive, we studied patients' selected parameters, which are demographic features (age, sex), body mass index, hernia locations and types, duration of operations, preoperative and postoperative complications, duration of hospital stays, cost of surgery, need for analgesics, time elapsed until returning to daily activities and work. A total of 300 patients underwent laparoscopic TEP hernia repair of 437 inguinal hernias from November 2006 to November 2015. Of the 185 patients, 140 were symptomatic. Mean duration of follow-up was 48 months (range, 6 to 104 mo). The mean duration of surgery was 55 minutes for bilateral hernia repair, and 38 minutes for unilateral hernia repair. The mean duration of hospital stay was 0.9 day. There was no conversion to open surgery. In none of the cases the mesh was fixated with either staples or fibrin glue. Six patients (2%) developed seroma that were treated conservatively. One patient had inguinal hernia recurrence. One patient had preperitoneal hematoma. One patient operated due to indirect right-sided hernia developed right-sided hydrocele. One patient had wound dehiscence at the umbilical port entry site. Chronic pain developed postoperatively in 1 patient. Ileus developed in 1 patient. Laparoscopic TEP inguinal repair with 3-dimensional mesh without mesh fixation can be performed as safe as
Meshed split skin graft for extensive vitiligo
Directory of Open Access Journals (Sweden)
Srinivas C
2004-05-01
Full Text Available A 30 year old female presented with generalized stable vitiligo involving large areas of the body. Since large areas were to be treated it was decided to do meshed split skin graft. A phototoxic blister over recipient site was induced by applying 8 MOP solution followed by exposure to UVA. The split skin graft was harvested from donor area by Padgett dermatome which was meshed by an ampligreffe to increase the size of the graft by 4 times. Significant pigmentation of the depigmented skin was seen after 5 months. This procedure helps to cover large recipient areas, when pigmented donor skin is limited with minimal risk of scarring. Phototoxic blister enables easy separation of epidermis thus saving time required for dermabrasion from recipient site.
Variational mesh segmentation via quadric surface fitting
Yan, Dongming
2012-11-01
We present a new variational method for mesh segmentation by fitting quadric surfaces. Each component of the resulting segmentation is represented by a general quadric surface (including plane as a special case). A novel energy function is defined to evaluate the quality of the segmentation, which combines both L2 and L2 ,1 metrics from a triangle to a quadric surface. The Lloyd iteration is used to minimize the energy function, which repeatedly interleaves between mesh partition and quadric surface fitting. We also integrate feature-based and simplification-based techniques in the segmentation framework, which greatly improve the performance. The advantages of our algorithm are demonstrated by comparing with the state-of-the-art methods. © 2012 Elsevier Ltd. All rights reserved.
Capacity estimation of wireless mesh networks
2005-01-01
Resumo: Este trabalho apresenta uma estimação da capacidade das redes sem fio tipo Mesh. As redes deste tipo têm topologias e padrões de tráfego únicos que as diferenciam das redes sem fio convencionais. Nas redes sem fio tipo mesh os nós atuam como clientes e como servidores e o tráfego e encaminhado para uma ou várias gateways em um modo multi-salto. A estimação da capacidade é baseada em estudos da Camada Física e MAC. Efeitos da propagação do canal são avaliados Abstract: This work add...
Nondispersive optical activity of meshed helical metamaterials.
Park, Hyun Sung; Kim, Teun-Teun; Kim, Hyeon-Don; Kim, Kyungjin; Min, Bumki
2014-11-17
Extreme optical properties can be realized by the strong resonant response of metamaterials consisting of subwavelength-scale metallic resonators. However, highly dispersive optical properties resulting from strong resonances have impeded the broadband operation required for frequency-independent optical components or devices. Here we demonstrate that strong, flat broadband optical activity with high transparency can be obtained with meshed helical metamaterials in which metallic helical structures are networked and arranged to have fourfold rotational symmetry around the propagation axis. This nondispersive optical activity originates from the Drude-like response as well as the fourfold rotational symmetry of the meshed helical metamaterials. The theoretical concept is validated in a microwave experiment in which flat broadband optical activity with a designed magnitude of 45° per layer of metamaterial is measured. The broadband capabilities of chiral metamaterials may provide opportunities in the design of various broadband optical systems and applications.
Energy-efficient wireless mesh networks
CSIR Research Space (South Africa)
Ntlatlapa, N
2007-06-01
Full Text Available deficient areas such as rural areas in Africa. Index Terms—Energy efficient design, Wireless Mesh networks, Network Protocols I. INTRODUCTION The objectives of this research group are the application and adaptation of existing wireless local area... networks, especially those based on 802.11 standard, for the energyefficient wireless mesh network (EEWMN) architectures, protocols and controls. In addition to the WMN regular features of self...
Adaptive upscaling with the dual mesh method
Energy Technology Data Exchange (ETDEWEB)
Guerillot, D.; Verdiere, S.
1997-08-01
The objective of this paper is to demonstrate that upscaling should be calculated during the flow simulation instead of trying to enhance the a priori upscaling methods. Hence, counter-examples are given to motivate our approach, the so-called Dual Mesh Method. The main steps of this numerical algorithm are recalled. Applications illustrate the necessity to consider different average relative permeability values depending on the direction in space. Moreover, these values could be different for the same average saturation. This proves that an a priori upscaling cannot be the answer even in homogeneous cases because of the {open_quotes}dynamical heterogeneity{close_quotes} created by the saturation profile. Other examples show the efficiency of the Dual Mesh Method applied to heterogeneous medium and to an actual field case in South America.
Gamra: Simple Meshes for Complex Earthquakes
Landry, Walter
2016-01-01
The static offsets caused by earthquakes are well described by elastostatic models with a discontinuity in the displacement along the fault. A traditional approach to model this discontinuity is to align the numerical mesh with the fault and solve the equations using finite elements. However, this distorted mesh can be difficult to generate and update. We present a new numerical method, inspired by the Immersed Interface Method, for solving the elastostatic equations with embedded discontinuities. This method has been carefully designed so that it can be used on parallel machines on an adapted finite difference grid. We have implemented this method in Gamra, a new code for earth modelling. We demonstrate the correctness of the method with analytic tests, and we demonstrate its practical performance by solving a realistic earthquake model to extremely high precision.
Electrostatic PIC with adaptive Cartesian mesh
Kolobov, Vladimir I
2016-01-01
We describe an initial implementation of an electrostatic Particle-in-Cell (ES-PIC) module with adaptive Cartesian mesh in our Unified Flow Solver framework. Challenges of PIC method with cell-based adaptive mesh refinement (AMR) are related to a decrease of the particle-per-cell number in the refined cells with a corresponding increase of the numerical noise. The developed ES-PIC solver is validated for capacitively coupled plasma, its AMR capabilities are demonstrated for simulations of streamer development during high-pressure gas breakdown. It is shown that cell-based AMR provides a convenient particle management algorithm for exponential multiplications of electrons and ions in the ionization events.
Mesh convergence study for hydraulic turbine draft-tube
Devals, C.; Vu, T. C.; Zhang, Y.; Dompierre, J.; Guibault, F.
2016-11-01
Computational flow analysis is an essential tool for hydraulic turbine designers. Grid generation is the first step in the flow analysis process. Grid quality and solution accuracy are strongly linked. Even though many studies have addressed the issue of mesh independence, there is still no definitive consensus on mesh best practices, and research on that topic is still needed. This paper presents a mesh convergence study for turbulence flow in hydraulic turbine draft- tubes which represents the most challenging turbine component for CFD predictions. The findings from this parametric study will be incorporated as mesh control rules in an in-house automatic mesh generator for turbine components.
Overlay Share Mesh for Interactive Group Communication with High Dynamic
Institute of Scientific and Technical Information of China (English)
WU Yan-hua; CAI Yun-ze; XU Xiao-ming
2007-01-01
An overlay share mesh infrastructure is presented for high dynamic group communication systems, such as distributed interactive simulation (DIS) and distributed virtual environments (DVE). Overlay share mesh infrastructure can own better adapting ability for high dynamic group than tradition multi-tree multicast infrastructure by sharing links among different groups. The mechanism of overlay share mesh based on area of interest (AOI) was discussed in detail in this paper. A large number of simulation experiments were done and the permance of mesh infrastructure was studied. Experiments results proved that overlay mesh infrastructure owns better adaptability than traditional multi-tree infrastructure for high dynamic group communication systems.
Diffusive mesh relaxation in ALE finite element numerical simulations
Energy Technology Data Exchange (ETDEWEB)
Dube, E.I.
1996-06-01
The theory for a diffusive mesh relaxation algorithm is developed for use in three-dimensional Arbitary Lagrange/Eulerian (ALE) finite element simulation techniques. This mesh relaxer is derived by a variational principle for an unstructured 3D grid using finite elements, and incorporates hourglass controls in the numerical implementation. The diffusive coefficients are based on the geometric properties of the existing mesh, and are chosen so as to allow for a smooth grid that retains the general shape of the original mesh. The diffusive mesh relaxation algorithm is then applied to an ALE code system, and results from several test cases are discussed.
Effects of mesh resolution on hypersonic heating prediction
Institute of Scientific and Technical Information of China (English)
无
2011-01-01
Aeroheating prediction is a challenging and critical problem for the design and optimization of hypersonic vehicles.One challenge is that the solution of the Navier-Stokes equations strongly depends on the computational mesh.In this letter,the effect of mesh resolution on heat flux prediction is studied.It is found that mesh-independent solutions can be obtained using fine mesh,whose accuracy is confirmed by results from kinetic particle simulation.It is analyzed that mesh-induced numerical error comes m...
Wireless experiments on a Motorola mesh testbed.
Energy Technology Data Exchange (ETDEWEB)
Riblett, Loren E., Jr.; Wiseman, James M.; Witzke, Edward L.
2010-06-01
Motomesh is a Motorola product that performs mesh networking at both the client and access point levels and allows broadband mobile data connections with or between clients moving at vehicular speeds. Sandia National aboratories has extensive experience with this product and its predecessors in infrastructure-less mobile environments. This report documents experiments, which characterize certain aspects of how the Motomesh network performs when obile units are added to a fixed network infrastructure.
Airbag Mapped Mesh Auto-Flattening Method
Institute of Scientific and Technical Information of China (English)
ZHANG Jinhuan; MA Chunsheng; BAI Yuanli; HUANG Shilin
2005-01-01
Current software cannot easily model an airbag to be flattened without wrinkles. This paper improves the modeling efficiency using the initial metric method to design a mapped mesh auto-flattening algorithm. The element geometric transformation matrix was obtained using the theory of computer graphics. The algorithm proved to be practical for modeling a passenger-side airbag model. The efficiency and precision of modeling airbags are greatly improved by this method.
Gradient Domain Mesh Deformation - A Survey
Institute of Scientific and Technical Information of China (English)
Wei-Wei Xu; Kun Zhou
2009-01-01
This survey reviews the recent development of gradient domain mesh deformation method. Different to other deformation methods, the gradient domain deformation method is a surface-based, variational optimization method. It directly encodes the geometric details in differential coordinates, which are also called Laplacian coordinates in literature. By preserving the Laplacian coordinates, the mesh details can be well preserved during deformation. Due to the locality of the Laplacian coordinates, the variational optimization problem can be casted into a sparse linear system. Fast sparse linear solver can be adopted to generate deformation result interactively, or even in real-time. The nonlinear nature of gradient domain mesh deformation leads to the development of two categories of deformation methods: linearization methods and nonlinear optimization methods. Basically, the linearization methods only need to solve the linear least-squares system once. They are fast, easy to understand and control, while the deformation result might be suboptimal. Nonlinear optimization methods can reach optimal solution of deformation energy function by iterative updating. Since the computation of nonlinear methods is expensive, reduced deformable models should be adopted to achieve interactive performance. The nonlinear optimization methods avoid the user burden to input transformation at deformation handles, and they can be extended to incorporate various nonlinear constraints, like volume constraint, skeleton constraint, and so on. We review representative methods and related approaches of each category comparatively and hope to help the user understand the motivation behind the algorithms. Finally, we discuss the relation between physical simulation and gradient domain mesh deformation to reveal why it can achieve physically plausible deformation result.
Solid Mesh Registration for Radiotherapy Treatment Planning
DEFF Research Database (Denmark)
Noe, Karsten Østergaard; Sørensen, Thomas Sangild
2010-01-01
We present an algorithm for solid organ registration of pre-segmented data represented as tetrahedral meshes. Registration of the organ surface is driven by force terms based on a distance field representation of the source and reference shapes. Registration of internal morphology is achieved usi...... to complete. The proposed method has many potential uses in image guided radiotherapy (IGRT) which relies on registration to account for organ deformation between treatment sessions....
Performance Evaluation of Coded Meshed Networks
DEFF Research Database (Denmark)
Krigslund, Jeppe; Hansen, Jonas; Pedersen, Morten Videbæk
2013-01-01
of the former to enhance the gains of the latter. We first motivate our work through measurements in WiFi mesh networks. Later, we compare state-of-the-art approaches, e.g., COPE, RLNC, to CORE. Our measurements show the higher reliability and throughput of CORE over other schemes, especially, for asymmetric...... and/or high loss probabilities. We show that a store and forward scheme outperforms COPE under some channel conditions, while CORE yields 3dB gains....
Particle Mesh Hydrodynamics for Astrophysics Simulations
Chatelain, Philippe; Cottet, Georges-Henri; Koumoutsakos, Petros
We present a particle method for the simulation of three dimensional compressible hydrodynamics based on a hybrid Particle-Mesh discretization of the governing equations. The method is rooted on the regularization of particle locations as in remeshed Smoothed Particle Hydrodynamics (rSPH). The rSPH method was recently introduced to remedy problems associated with the distortion of computational elements in SPH, by periodically re-initializing the particle positions and by using high order interpolation kernels. In the PMH formulation, the particles solely handle the convective part of the compressible Euler equations. The particle quantities are then interpolated onto a mesh, where the pressure terms are computed. PMH, like SPH, is free of the convection CFL condition while at the same time it is more efficient as derivatives are computed on a mesh rather than particle-particle interactions. PMH does not detract from the adaptive character of SPH and allows for control of its accuracy. We present simulations of a benchmark astrophysics problem demonstrating the capabilities of this approach.
Mesh Learning for Classifying Cognitive Processes
Ozay, Mete; Öztekin, Uygar; Vural, Fatos T Yarman
2012-01-01
The major goal of this study is to model the encoding and retrieval operations of the brain during memory processing, using statistical learning tools. The suggested method assumes that the memory encoding and retrieval processes can be represented by a supervised learning system, which is trained by the brain data collected from the functional Magnetic Resonance (fMRI) measurements, during the encoding stage. Then, the system outputs the same class labels as that of the fMRI data collected during the retrieval stage. The most challenging problem of modeling such a learning system is the design of the interactions among the voxels to extract the information about the underlying patterns of brain activity. In this study, we suggest a new method called Mesh Learning, which represents each voxel by a mesh of voxels in a neighborhood system. The nodes of the mesh are a set of neighboring voxels, whereas the arc weights are estimated by a linear regression model. The estimated arc weights are used to form Local Re...
Parallel object-oriented adaptive mesh refinement
Energy Technology Data Exchange (ETDEWEB)
Balsara, D.; Quinlan, D.J.
1997-04-01
In this paper we study adaptive mesh refinement (AMR) for elliptic and hyperbolic systems. We use the Asynchronous Fast Adaptive Composite Grid Method (AFACX), a parallel algorithm based upon the of Fast Adaptive Composite Grid Method (FAC) as a test case of an adaptive elliptic solver. For our hyperbolic system example we use TVD and ENO schemes for solving the Euler and MHD equations. We use the structured grid load balancer MLB as a tool for obtaining a load balanced distribution in a parallel environment. Parallel adaptive mesh refinement poses difficulties in expressing both the basic single grid solver, whether elliptic or hyperbolic, in a fashion that parallelizes seamlessly. It also requires that these basic solvers work together within the adaptive mesh refinement algorithm which uses the single grid solvers as one part of its adaptive solution process. We show that use of AMR++, an object-oriented library within the OVERTURE Framework, simplifies the development of AMR applications. Parallel support is provided and abstracted through the use of the P++ parallel array class.
Mesh deployable antenna mechanics testing method
Jiang, Li
Rapid development in spatial technologies and continuous expansion of astronautics applications require stricter and stricter standards in spatial structure. Deployable space structure as a newly invented structural form is being extensively adopted because of its characteristic (i.e. deployability). Deployable mesh reflector antenna is a kind of common deployable antennas. Its reflector consists in a kind of metal mesh. Its electrical properties are highly dependent on its mechanics parameters (including surface accuracy, angle, and position). Therefore, these mechanics parameters have to be calibrated. This paper presents a mesh antenna mechanics testing method that employs both an electronic theodolite and a laser tracker. The laser tracker is firstly used to measure the shape of radial rib deployable antenna. The measurement data are then fitted to a paraboloid by means of error compensation. Accordingly, the focus and the focal axis of the paraboloid are obtained. The following step is to synchronize the coordinate systems of the electronic theodolite and the measured antenna. Finally, in a microwave anechoic chamber environment, the electromechanical axis is calibrated. Testing results verify the effectiveness of the presented method.
MeSH Now: automatic MeSH indexing at PubMed scale via learning to rank.
Mao, Yuqing; Lu, Zhiyong
2017-04-17
MeSH indexing is the task of assigning relevant MeSH terms based on a manual reading of scholarly publications by human indexers. The task is highly important for improving literature retrieval and many other scientific investigations in biomedical research. Unfortunately, given its manual nature, the process of MeSH indexing is both time-consuming (new articles are not immediately indexed until 2 or 3 months later) and costly (approximately ten dollars per article). In response, automatic indexing by computers has been previously proposed and attempted but remains challenging. In order to advance the state of the art in automatic MeSH indexing, a community-wide shared task called BioASQ was recently organized. We propose MeSH Now, an integrated approach that first uses multiple strategies to generate a combined list of candidate MeSH terms for a target article. Through a novel learning-to-rank framework, MeSH Now then ranks the list of candidate terms based on their relevance to the target article. Finally, MeSH Now selects the highest-ranked MeSH terms via a post-processing module. We assessed MeSH Now on two separate benchmarking datasets using traditional precision, recall and F1-score metrics. In both evaluations, MeSH Now consistently achieved over 0.60 in F-score, ranging from 0.610 to 0.612. Furthermore, additional experiments show that MeSH Now can be optimized by parallel computing in order to process MEDLINE documents on a large scale. We conclude that MeSH Now is a robust approach with state-of-the-art performance for automatic MeSH indexing and that MeSH Now is capable of processing PubMed scale documents within a reasonable time frame. http://www.ncbi.nlm.nih.gov/CBBresearch/Lu/Demo/MeSHNow/ .
Data-Parallel Mesh Connected Components Labeling and Analysis
Energy Technology Data Exchange (ETDEWEB)
Harrison, Cyrus; Childs, Hank; Gaither, Kelly
2011-04-10
We present a data-parallel algorithm for identifying and labeling the connected sub-meshes within a domain-decomposed 3D mesh. The identification task is challenging in a distributed-memory parallel setting because connectivity is transitive and the cells composing each sub-mesh may span many or all processors. Our algorithm employs a multi-stage application of the Union-find algorithm and a spatial partitioning scheme to efficiently merge information across processors and produce a global labeling of connected sub-meshes. Marking each vertex with its corresponding sub-mesh label allows us to isolate mesh features based on topology, enabling new analysis capabilities. We briefly discuss two specific applications of the algorithm and present results from a weak scaling study. We demonstrate the algorithm at concurrency levels up to 2197 cores and analyze meshes containing up to 68 billion cells.
Data-Parallel Mesh Connected Components Labeling and Analysis
Energy Technology Data Exchange (ETDEWEB)
Harrison, Cyrus; Childs, Hank; Gaither, Kelly
2011-04-10
We present a data-parallel algorithm for identifying and labeling the connected sub-meshes within a domain-decomposed 3D mesh. The identification task is challenging in a distributed-memory parallel setting because connectivity is transitive and the cells composing each sub-mesh may span many or all processors. Our algorithm employs a multi-stage application of the Union-find algorithm and a spatial partitioning scheme to efficiently merge information across processors and produce a global labeling of connected sub-meshes. Marking each vertex with its corresponding sub-mesh label allows us to isolate mesh features based on topology, enabling new analysis capabilities. We briefly discuss two specific applications of the algorithm and present results from a weak scaling study. We demonstrate the algorithm at concurrency levels up to 2197 cores and analyze meshes containing up to 68 billion cells.
Functional subdivision of group-ICA results of fMRI data collected during cinema viewing.
Directory of Open Access Journals (Sweden)
Siina Pamilo
Full Text Available Independent component analysis (ICA can unravel functional brain networks from functional magnetic resonance imaging (fMRI data. The number of the estimated components affects both the spatial pattern of the identified networks and their time-course estimates. Here group-ICA was applied at four dimensionalities (10, 20, 40, and 58 components to fMRI data collected from 15 subjects who viewed a 15-min silent film ("At land" by Maya Deren. We focused on the dorsal attention network, the default-mode network, and the sensorimotor network. The lowest dimensionalities demonstrated most prominent activity within the dorsal attention network, combined with the visual areas, and in the default-mode network; the sensorimotor network only appeared with ICA comprising at least 20 components. The results suggest that even very low-dimensional ICA can unravel the most prominent functionally-connected brain networks. However, increasing the number of components gives a more detailed picture and functionally feasible subdivision of the major networks. These results improve our understanding of the hierarchical subdivision of brain networks during viewing of a movie that provides continuous stimulation embedded in an attention-directing narrative.
Dahiya, Ginu; Masoud, Ahmed I; Viana, Grace; Obrez, Ales; Kusnoto, Budi; Evans, Carla A
2017-08-01
A retrospective study evaluating posttreatment symmetry in dental arch form and midlines was carried out in Class II subdivision patients treated with unilateral and bilateral maxillary premolar extractions. Using Geomagic (version 14; Geomagic, Research Triangle Park, NC) and MATLAB (version 8.4; MathWorks, Natick, Mass) software, best-fit curves expressed as quartic polynomials were generated for 13 Class II subdivisions treated with unilateral extractions and 20 treated with bilateral maxillary premolar extractions. Transverse and sagittal measurements were recorded to assess symmetry. Dental models were superimposed on constructed reference planes to generate average posttreatment arches. Statistical comparisons were performed with the significance level set at P ≤0.05. The unilateral extraction group showed significant differences in transverse arch forms between the right and left sides in the anterior, anterior-middle, and middle segments of the arch, and all regions other than the posterior segment in the sagittal dimension. Significant differences were found between groups in the anterior and anterior-middle segments of the arch transversely, the middle and middle-posterior segments sagittally, and the midline deviation relative to the midsagittal plane. Superimposed average arches showed similar results. Unilateral maxillary extraction treatment generally results in a narrower and more posteriorly displaced arch form on the extraction side, with a deviated maxillary midline toward the extraction side of the arch. Copyright © 2017 American Association of Orthodontists. Published by Elsevier Inc. All rights reserved.
Subdivision of the occipital lobes: an anatomical and functional MRI connectivity study.
Thiebaut de Schotten, Michel; Urbanski, Marika; Valabregue, Romain; Bayle, Dimitri J; Volle, Emmanuelle
2014-07-01
Exploring brain connectivity is fundamental to understanding the functional architecture of the cortex. In our study we employed tractography-based parcellation, combined with the principal component analysis statistical framework, to divide the occipital lobes into seven areas in a group of eighteen healthy participants. Tractography-based parcellation is a method based on diffusion imaging tractography, which segregates the living human brain into distinctive areas showing sharp differences in their anatomical connectivity. The results were compared to covarying functional networks involving distinct areas within the occipital lobes, that we obtained using resting state functional magnetic resonance imaging (fMRI), as well as to other existing subdivisions of the occipital lobes. Our results showed similarities with functional imaging data in healthy controls and cognitive profiles in brain-damaged patients, although several differences with cytoarchitectonic, myelogenetic, myeloarchitectonic and functional maps were reported. While the similarities are encouraging, the potential validity and limitations of the differences observed are discussed. Taken together these results suggest that tractography-based parcellation may provide a new promising anatomical subdivision of the living human brain based on its anatomical connectivity, which may benefit the understanding of clinical-neuroanatomical dissociations and functional neuroimaging results.
An Indoor Navigation Approach Considering Obstacles and Space Subdivision of 2d Plan
Xu, Man; Wei, Shuangfeng; Zlatanova, Sisi
2016-06-01
The demand for indoor navigation is increasingly urgent in many applications such as safe management of underground spaces or location services in complex indoor environment, e.g. shopping centres, airports, museums, underground parking lot and hospitals. Indoor navigation is still a challenging research field, as currently applied indoor navigation algorithms commonly ignore important environmental and human factors and therefore do not provide precise navigation. Flexible and detailed networks representing the connectivity of spaces and considering indoor objects such as furniture are very important to a precise navigation. In this paper we concentrate on indoor navigation considering obstacles represented as polygons. We introduce a specific space subdivision based on a simplified floor plan to build the indoor navigation network. The experiments demonstrate that we are able to navigate around the obstacles using the proposed network. Considering to well-known path-finding approaches based on Medial Axis Transform (MAT) or Visibility Graph (VG), the approach in this paper provides a quick subdivision of space and routes, which are compatible with the results of VG.
Directory of Open Access Journals (Sweden)
Aparecida Fernanda Meloti
2014-08-01
Full Text Available INTRODUCTION: Lateral cephalometric radiographs are traditionally required for orthodontic treatment, yet rarely used to assess asymmetries. OBJECTIVE: The objective of the present study was to use lateral cephalometric radiographs to identify existing skeletal and dentoalveolar morphological alterations in Class II subdivision and to compare them with the existing morphology in Class I and II relationship. MATERIAL AND METHODS: Ninety initial lateral cephalometric radiographs of male and female Brazilian children aged between 12 to 15 years old were randomly and proportionally divided into three groups: Group 1 (Class I, Group 2 (Class II and Group 3 (Class II subdivision. Analysis of lateral cephalometric radiographs included angular measurements, horizontal linear measurements and two indexes of asymmetry that were prepared for this study. RESULTS: In accordance with an Index of Dental Asymmetry (IDA, greater mandibular dental asymmetry was identified in Group 3. An Index of Mandibular Asymmetry (IMA revealed less skeletal and dental mandibular asymmetry in Group 2, greater skeletal mandibular asymmetry in Group 1, and greater mandibular dental asymmetry in Group 3. CONCLUSION: Both IDA and IMA revealed greater mandibular dental asymmetry for Group 3 in comparison to Groups 1 and 2. These results are in accordance with those found by other diagnostic methods, showing that lateral cephalometric radiography is an acceptable method to identify existing skeletal and dentoalveolar morphological alterations in malocclusions.
Improved volumetric imaging in tomosynthesis using combined multiaxial sweeps.
Gersh, Jacob A; Wiant, David B; Best, Ryan C M; Bennett, Marcus C; Munley, Michael T; King, June D; McKee, Mahta M; Baydush, Alan H
2010-09-03
This study explores the volumetric reconstruction fidelity attainable using tomosynthesis with a kV imaging system which has a unique ability to rotate isocentrically and with multiple degrees of mechanical freedom. More specifically, we seek to investigate volumetric reconstructions by combining multiple limited-angle rotational image acquisition sweeps. By comparing these reconstructed images with those of a CBCT reconstruction, we can gauge the volumetric fidelity of the reconstructions. In surgical situations, the described tomosynthesis-based system could provide high-quality volumetric imaging without requiring patient motion, even with rotational limitations present. Projections were acquired using the Digital Integrated Brachytherapy Unit, or IBU-D. A phantom was used which contained several spherical objects of varying contrast. Using image projections acquired during isocentric sweeps around the phantom, reconstructions were performed by filtered backprojection. For each image acquisition sweep configuration, a contrasting sphere is analyzed using two metrics and compared to a gold standard CBCT reconstruction. Since the intersection of a reconstructed sphere and an imaging plane is ideally a circle with an eccentricity of zero, the first metric presented compares the effective eccentricity of intersections of reconstructed volumes and imaging planes. As another metric of volumetric reconstruction fidelity, the volume of one of the contrasting spheres was determined using manual contouring. By comparing these manually delineated volumes with a CBCT reconstruction, we can gauge the volumetric fidelity of reconstructions. The configuration which yielded the highest overall volumetric reconstruction fidelity, as determined by effective eccentricities and volumetric contouring, consisted of two orthogonally-offset 60° L-arm sweeps and a single C-arm sweep which shared a pivot point with one the L-arm sweeps. When compared to a similar configuration that
Oral, intestinal, and skin bacteria in ventral hernia mesh implants
Directory of Open Access Journals (Sweden)
Odd Langbach
2016-07-01
Full Text Available Background: In ventral hernia surgery, mesh implants are used to reduce recurrence. Infection after mesh implantation can be a problem and rates around 6–10% have been reported. Bacterial colonization of mesh implants in patients without clinical signs of infection has not been thoroughly investigated. Molecular techniques have proven effective in demonstrating bacterial diversity in various environments and are able to identify bacteria on a gene-specific level. Objective: The purpose of this study was to detect bacterial biofilm in mesh implants, analyze its bacterial diversity, and look for possible resemblance with bacterial biofilm from the periodontal pocket. Methods: Thirty patients referred to our hospital for recurrence after former ventral hernia mesh repair, were examined for periodontitis in advance of new surgical hernia repair. Oral examination included periapical radiographs, periodontal probing, and subgingival plaque collection. A piece of mesh (1×1 cm from the abdominal wall was harvested during the new surgical hernia repair and analyzed for bacteria by PCR and 16S rRNA gene sequencing. From patients with positive PCR mesh samples, subgingival plaque samples were analyzed with the same techniques. Results: A great variety of taxa were detected in 20 (66.7% mesh samples, including typical oral commensals and periodontopathogens, enterics, and skin bacteria. Mesh and periodontal bacteria were further analyzed for similarity in 16S rRNA gene sequences. In 17 sequences, the level of resemblance between mesh and subgingival bacterial colonization was 98–100% suggesting, but not proving, a transfer of oral bacteria to the mesh. Conclusion: The results show great bacterial diversity on mesh implants from the anterior abdominal wall including oral commensals and periodontopathogens. Mesh can be reached by bacteria in several ways including hematogenous spread from an oral site. However, other sites such as gut and skin may also
Aspects of volumetric efficiency measurement for reciprocating engines
Directory of Open Access Journals (Sweden)
Pešić Radivoje B.
2013-01-01
Full Text Available The volumetric efficiency significantly influences engine output. Both design and dimensions of an intake and exhaust system have large impact on volumetric efficiency. Experimental equipment for measuring of airflow through the engine, which is placed in the intake system, may affect the results of measurements and distort the real picture of the impact of individual structural factors. This paper deals with the problems of experimental determination of intake airflow using orifice plates and the influence of orifice plate diameter on the results of the measurements. The problems of airflow measurements through a multi-process Otto/Diesel engine were analyzed. An original method for determining volumetric efficiency was developed based on in-cylinder pressure measurement during motored operation, and appropriate calibration of the experimental procedure was performed. Good correlation between the results of application of the original method for determination of volumetric efficiency and the results of theoretical model used in research of influence of the intake pipe length on volumetric efficiency was determined. [Acknowledgments. The paper is the result of the research within the project TR 35041 financed by the Ministry of Science and Technological Development of the Republic of Serbia
Tate, David F; Wade, Benjamin S C; Velez, Carmen S; Drennon, Ann Marie; Bolzenius, Jacob; Gutman, Boris A; Thompson, Paul M; Lewis, Jeffrey D; Wilde, Elisabeth A; Bigler, Erin D; Shenton, Martha E; Ritter, John L; York, Gerald E
2016-10-01
Mild traumatic brain injury (mTBI) is a significant health concern. The majority who sustain mTBI recover, although ~20 % continue to experience symptoms that can interfere with quality of life. Accordingly, there is a critical need to improve diagnosis, prognostic accuracy, and monitoring (recovery trajectory over time) of mTBI. Volumetric magnetic resonance imaging (MRI) has been successfully utilized to examine TBI. One promising improvement over standard volumetric approaches is to analyze high-dimensional shape characteristics of brain structures. In this study, subcortical shape and volume in 76 Service Members with mTBI was compared to 59 Service Members with orthopedic injury (OI) and 17 with post-traumatic stress disorder (PTSD) only. FreeSurfer was used to quantify structures from T1-weighted 3 T MRI data. Radial distance (RD) and Jacobian determinant (JD) were defined vertex-wise on parametric mesh-representations of subcortical structures. Linear regression was used to model associations between morphometry (volume and shape), TBI status, and time since injury (TSI) correcting for age, sex, intracranial volume, and level of education. Volumetric data was not significantly different between the groups. JD was significantly increased in the accumbens and caudate and significantly reduced in the thalamus of mTBI participants. Additional significant associations were noted between RD of the amygdala and TSI. Positive trend-level associations between TSI and the amygdala and accumbens were observed, while a negative association was observed for third ventricle. Our findings may aid in the initial diagnosis of mTBI, provide biological targets for functional examination, and elucidate regions that may continue remodeling after injury.
Directory of Open Access Journals (Sweden)
Julia Ganz
2015-11-01
Full Text Available Background: The telencephalon shows a remarkable structural diversity among vertebrates. In particular, the everted telencephalon of ray-finned fishes has a markedly different morphology compared to the evaginated telencephalon of all other vertebrates. This difference in development has hampered the comparison between different areas of the pallium of ray-finned fishes and the pallial nuclei of all other vertebrates. Various models of homology between pallial subdivisions in ray-finned fishes and the pallial nuclei in tetrapods have been proposed based on connectional, neurochemical, gene expression and functional data. However, no consensus has been reached so far. In recent years, the analysis of conserved developmental marker genes has assisted the identification of homologies for different parts of the telencephalon among several tetrapod species. Results: We have investigated the gene expression pattern of conserved marker genes in the adult zebrafish (Danio rerio pallium to identify pallial subdivisions and their homology to pallial nuclei in tetrapods. Combinatorial expression analysis of ascl1a, eomesa, emx1, emx2, emx3, and Prox1 identifies four main divisions in the adult zebrafish pallium. Within these subdivisions, we propose that Dm is homologous to the pallial amygdala in tetrapods and that the dorsal subdivision of Dl is homologous to part of the hippocampal formation in mouse. We have complemented this analysis be examining the gene expression of emx1, emx2 and emx3 in the zebrafish larval brain. Conclusions: Based on our gene expression data, we propose a new model of subdivisions in the adult zebrafish pallium and their putative homologies to pallial nuclei in tetrapods. Pallial nuclei control sensory, motor, and cognitive functions, like memory, learning and emotion. The identification of pallial subdivisions in the adult zebrafish and their homologies to pallial nuclei in tetrapods will contribute to the use of the zebrafish
星的细分图的IC-着色%IC-coloring of the Subdivision of Stars
Institute of Scientific and Technical Information of China (English)
陈剑峰
2012-01-01
研究了星的细分图的IC-着色问题,改进了星的细分图的IC-指数的下界,并且得到了两类图的IC-指数的一个下界。%This thesis researches the IC-coloring of the star subdivision graph,improved the lower IC-index of the star subdivision graph,and concluded two class graphs of the one lower IC-index.
A high volume, high throughput volumetric sorption analyzer
Soo, Y. C.; Beckner, M.; Romanos, J.; Wexler, C.; Pfeifer, P.; Buckley, P.; Clement, J.
2011-03-01
In this talk we will present an overview of our new Hydrogen Test Fixture (HTF) constructed by the Midwest Research Institute for The Alliance for Collaborative Research in Alternative Fuel Technology to test activated carbon monoliths for hydrogen gas storage. The HTF is an automated, computer-controlled volumetric instrument for rapid screening and manipulation of monoliths under an inert atmosphere (to exclude degradation of carbon from exposure to oxygen). The HTF allows us to measure large quantity (up to 500 g) of sample in a 0.5 l test tank, making our results less sensitive to sample inhomogeneity. The HTF can measure isotherms at pressures ranging from 1 to 300 bar at room temperature. For comparison, other volumetric instruments such as Hiden Isochema's HTP-1 Volumetric Analyser can only measure carbon samples up to 150 mg at pressures up to 200 bar. Work supported by the US DOD Contract # N00164-08-C-GS37.
Volumetric (3D) compressive sensing spectral domain optical coherence tomography.
Xu, Daguang; Huang, Yong; Kang, Jin U
2014-11-01
In this work, we proposed a novel three-dimensional compressive sensing (CS) approach for spectral domain optical coherence tomography (SD OCT) volumetric image acquisition and reconstruction. Instead of taking a spectral volume whose size is the same as that of the volumetric image, our method uses a sub set of the original spectral volume that is under-sampled in all three dimensions, which reduces the amount of spectral measurements to less than 20% of that required by the Shan-non/Nyquist theory. The 3D image is recovered from the under-sampled spectral data dimension-by-dimension using the proposed three-step CS reconstruction strategy. Experimental results show that our method can significantly reduce the sampling rate required for a volumetric SD OCT image while preserving the image quality.
Schoenmaeckers, Ernst J P; van der Valk, Steef B A; van den Hout, Huib W; Raymakers, Johan F T J; Rakic, Srdjan
2009-07-01
The potential for shrinkage of intraperitoneally implanted meshes for laparoscopic repair of ventral and incisional hernia (LRVIH) remains a concern. Numerous experimental studies on this issue reported very inconsistent results. Expanded polytetrafluoroethylene (ePTFE) mesh has the unique property of being revealed by computed tomography (CT). We therefore conducted an analysis of CT findings in patients who had previously undergone LRVIH with an ePTFE mesh (DualMesh, WL Gore, Flagstaff, AZ, USA) in order to evaluate the shrinkage of implanted meshes. Of 656 LRVIH patients with DualMesh, all patients who subsequently underwent CT scanning were identified and only those with precisely known transverse diameter of implanted mesh and with CT scans made more than 3 months postoperatively were selected (n = 40). Two radiologists who were blinded to the size of the implanted mesh measured in consensus the maximal transverse diameter of the meshes by using the AquariusNET program (TeraRecon Inc., San Mateo, CA, USA). Mesh shrinkage was defined as the relative loss of transverse diameter as compared with the original transverse diameter of the mesh. The mean time from LRVIH to CT scan was 17.9 months (range 3-59 months). The mean shrinkage of the mesh was 7.5% (range 0-23.7%). For 11 patients (28%) there was no shrinkage at all. Shrinkage of 1-10% was found in 16 patients (40%), of 10-20% in 10 patients (25%), and of 20-24% in 3 patients (7.5%). No correlation was found regarding the elapsed time between LRVIH and CT, and shrinkage. There were two recurrences, one possibly related to shrinkage. Our observations indicate that shrinkage of DualMesh is remarkably lower than has been reported in experimental studies (8-51%). This study is the first to address the problem of shrinkage after intraperitoneal implantation of synthetic mesh in a clinical material.
Directory of Open Access Journals (Sweden)
Gugri Mukthinath
2016-06-01
Full Text Available Background: Inguinal hernia repair is the most frequently performed operation in any general surgical unit. The complications of using the mesh has been the rationale to examine the role of mesh in hernia repair in detail and to begin investigating the biocompatibility of different mesh modifications and to challenge old mesh concepts. Therefore the present study is undertaken to compare the lightweight mesh (Ultrapro with conventional prolene mesh in lichtenstein hernia repair. Methods: Thirty one patients with primary unilateral inguinal hernia was subjected either to lightweight mesh Lichtenstein's hernioplasty or standard prolene mesh Lichtenstein's hernioplasty. The patients were followed in the surgical OPD at 1 month, 6 months and 1 year for time taken to return to normal activities, chronic groin pain, foreign body sensation, seroma formation and recurrence. Results: Chronic pain among patients in standard prolene mesh group at 1 month, 6 month, and 1 year follow up was seen in 45.2%, 16% and 3.2% of the patients respectively, in light weight mesh group patients at 1 month, 6 month and 1 year follow up was 32.2%, 6.4% and none at one year respectively. Foreign body sensation in the light weight mesh group is significantly less compared to patients in standard prolene mesh group. Time taken to return to work was relatively shorter among patients in Light weight mesh group. There was no recurrence in both groups. Conclusion: Light weight mesh is an ideal choice in Lichenstein's hernioplasty whenever feasible. [Int J Res Med Sci 2016; 4(6.000: 2130-2134
Generalized b-spline subdivision-surface wavelets and lossless compression
Energy Technology Data Exchange (ETDEWEB)
Bertram, M; Duchaineau, M A; Hamann, B; Joy, K I
1999-11-24
We present a new construction of wavelets on arbitrary two-manifold topology for geometry compression. The constructed wavelets generalize symmetric tensor product wavelets with associated B-spline scaling functions to irregular polygonal base mesh domains. The wavelets and scaling functions are tensor products almost everywhere, except in the neighborhoods of some extraordinary points (points of valence unequal four) in the base mesh that defines the topology. The compression of arbitrary polygonal meshes representing isosurfaces of scalar-valued trivariate functions is a primary application. The main contribution of this paper is the generalization of lifted symmetric tensor product B-spline wavelets to two-manifold geometries. Surfaces composed of B-spline patches can easily be converted to this scheme. We present a lossless compression method for geometries with or without associated functions like color, texture, or normals. The new wavelet transform is highly efficient and can represent surfaces at any level of resolution with high degrees of continuity, except at a finite number of extraordinary points in the base mesh. In the neighborhoods of these points detail can be added to the surface to approximate any degree of continuity.
Volumetric measurements of a spatially growing dust acoustic wave
Williams, Jeremiah D.
2012-11-01
In this study, tomographic particle image velocimetry (tomo-PIV) techniques are used to make volumetric measurements of the dust acoustic wave (DAW) in a weakly coupled dusty plasma system in an argon, dc glow discharge plasma. These tomo-PIV measurements provide the first instantaneous volumetric measurement of a naturally occurring propagating DAW. These measurements reveal over the measured volume that the measured wave mode propagates in all three spatial dimensional and exhibits the same spatial growth rate and wavelength in each spatial direction.
Volumetric measurements of a spatially growing dust acoustic wave
Energy Technology Data Exchange (ETDEWEB)
Williams, Jeremiah D. [Physics Department, Wittenberg University, Springfield, Ohio 45504 (United States)
2012-11-15
In this study, tomographic particle image velocimetry (tomo-PIV) techniques are used to make volumetric measurements of the dust acoustic wave (DAW) in a weakly coupled dusty plasma system in an argon, dc glow discharge plasma. These tomo-PIV measurements provide the first instantaneous volumetric measurement of a naturally occurring propagating DAW. These measurements reveal over the measured volume that the measured wave mode propagates in all three spatial dimensional and exhibits the same spatial growth rate and wavelength in each spatial direction.
Volumetric Pricing of Agricultural Water Supplies: A Case Study
Griffin, Ronald C.; Perry, Gregory M.
1985-07-01
Models of water consumption by rice producers are conceptualized and then estimated using cross-sectional time series data obtained from 16 Texas canal operators for the years 1977-1982. Two alternative econometric models demonstrate that both volumetric and flat rate water charges are strongly and inversely related to agricultural water consumption. Nonprice conservation incentives accompanying flat rates are hypothesized to explain the negative correlation of flat rate charges and water consumption. Application of these results suggests that water supply organizations in the sample population converting to volumetric pricing will generally reduce water consumption.
[Meta-Mesh: metagenomic data analysis system].
Su, Xiaoquan; Song, Baoxing; Wang, Xuetao; Ma, Xinle; Xu, Jian; Ning, Kang
2014-01-01
With the current accumulation of metagenome data, it is possible to build an integrated platform for processing of rigorously selected metagenomic samples (also referred as "metagenomic communities" here) of interests. Any metagenomic samples could then be searched against this database to find the most similar sample(s). However, on one hand, current databases with a large number of metagenomic samples mostly serve as data repositories but not well annotated database, and only offer few functions for analysis. On the other hand, the few available methods to measure the similarity of metagenomic data could only compare a few pre-defined set of metagenome. It has long been intriguing scientists to effectively calculate similarities between microbial communities in a large repository, to examine how similar these samples are and to find the correlation of the meta-information of these samples. In this work we propose a novel system, Meta-Mesh, which includes a metagenomic database and its companion analysis platform that could systematically and efficiently analyze, compare and search similar metagenomic samples. In the database part, we have collected more than 7 000 high quality and well annotated metagenomic samples from the public domain and in-house facilities. The analysis platform supplies a list of online tools which could accept metagenomic samples, build taxonomical annotations, compare sample in multiple angle, and then search for similar samples against its database by a fast indexing strategy and scoring function. We also used case studies of "database search for identification" and "samples clustering based on similarity matrix" using human-associated habitat samples to demonstrate the performance of Meta-Mesh in metagenomic analysis. Therefore, Meta-Mesh would serve as a database and data analysis system to quickly parse and identify similar
Unbiased sampling and meshing of isosurfaces
Yan, Dongming
2014-11-01
In this paper, we present a new technique to generate unbiased samples on isosurfaces. An isosurface, F(x,y,z) = c , of a function, F , is implicitly defined by trilinear interpolation of background grid points. The key idea of our approach is that of treating the isosurface within a grid cell as a graph (height) function in one of the three coordinate axis directions, restricted to where the slope is not too high, and integrating / sampling from each of these three. We use this unbiased sampling algorithm for applications in Monte Carlo integration, Poisson-disk sampling, and isosurface meshing.
Perspective on the Lagrange-Jacobi mesh
Rampho, Gaotsiwe J.
2016-07-01
This paper presents a unified treatment of the kinetic energy matrix elements related to a number of Lagrange functions associated with the Lagrange-Jacobi mesh. The matrix elements can be readily modified for application to problems requiring eigenfunction expansion with Lagrange-Legendre, Lagrange-Chebyshev, Lagrange-Gegenbauer, as well as the Lagrange-Jacobi functions. The applicability of and the accuracy attainable with the matrix elements is demonstrated with the solution to the Schrödinger equation for confining trigonometric Pöschl-Teller potentials. The results obtained are within machine accuracy when appropriate choices of the basis functions are used.
Performance of FACTS equipment in Meshed systems
Energy Technology Data Exchange (ETDEWEB)
Lerch, E.; Povh, D. [Siemens AG, Berlin (Germany)
1994-12-31
Modern power electronic devices such as thyristors and GTOs have made it possible to design controllable network elements, which will play a considerable role in ensuring reliable economic operation of transmission systems as a result of their capability to rapidly change active and reactive power. A number of FACTS elements for high-speed active and reactive power control will be described. Control of power system fluctuations in meshed systems by modulation of active and reactive power will be demonstrated using a number of examples. (author) 7 refs., 11 figs.
Corset neophallic musculoplasty with a mesh endoprosthesis
Directory of Open Access Journals (Sweden)
V. V. Mikhailichenko
2014-12-01
Full Text Available During thoracodorsal flap phalloplasty, recovered contractility of the muscular base of the neophallus may lead to its shortening that impedes introjection.To eliminate deformity and shortening of the neophallus, the authors propose the procedure of corset plasty of its muscle, which differs in that the alloplastic material – esfil mesh endoprosthesis, is used as a corset instead of fascia latum of the hip. The proposed procedure reduces surgical trauma, improves the functional characteristics of the neophallus, and accelerates sexual rehabilitation.
Corset neophallic musculoplasty with a mesh endoprosthesis
Directory of Open Access Journals (Sweden)
V. V. Mikhailichenko
2014-01-01
Full Text Available During thoracodorsal flap phalloplasty, recovered contractility of the muscular base of the neophallus may lead to its shortening that impedes introjection.To eliminate deformity and shortening of the neophallus, the authors propose the procedure of corset plasty of its muscle, which differs in that the alloplastic material – esfil mesh endoprosthesis, is used as a corset instead of fascia latum of the hip. The proposed procedure reduces surgical trauma, improves the functional characteristics of the neophallus, and accelerates sexual rehabilitation.
Relativistic MHD with adaptive mesh refinement
Energy Technology Data Exchange (ETDEWEB)
Anderson, Matthew [Department of Physics and Astronomy, Louisiana State University, Baton Rouge, LA 70803-4001 (United States); Hirschmann, Eric W [Department of Physics and Astronomy, Brigham Young University, Provo, UT 84602 (United States); Liebling, Steven L [Department of Physics, Long Island University-C W Post Campus, Brookville, NY 11548 (United States); Neilsen, David [Department of Physics and Astronomy, Brigham Young University, Provo, UT 84602 (United States)
2006-11-22
This paper presents a new computer code to solve the general relativistic magnetohydrodynamics (GRMHD) equations using distributed parallel adaptive mesh refinement (AMR). The fluid equations are solved using a finite difference convex ENO method (CENO) in 3 + 1 dimensions, and the AMR is Berger-Oliger. Hyperbolic divergence cleaning is used to control the {nabla} . B = 0 constraint. We present results from three flat space tests, and examine the accretion of a fluid onto a Schwarzschild black hole, reproducing the Michel solution. The AMR simulations substantially improve performance while reproducing the resolution equivalent unigrid simulation results. Finally, we discuss strong scaling results for parallel unigrid and AMR runs.
Split Bregman's algorithm for three-dimensional mesh segmentation
Habiba, Nabi; Ali, Douik
2016-05-01
Variational methods have attracted a lot of attention in the literature, especially for image and mesh segmentation. The methods aim at minimizing the energy to optimize both edge and region detections. We propose a spectral mesh decomposition algorithm to obtain disjoint but meaningful regions of an input mesh. The related optimization problem is nonconvex, and it is very difficult to find a good approximation or global optimum, which represents a challenge in computer vision. We propose an alternating split Bregman algorithm for mesh segmentation, where we extended the image-dedicated model to a three-dimensional (3-D) mesh one. By applying our scheme to 3-D mesh segmentation, we obtain fast solvers that can outperform various conventional ones, such as graph-cut and primal dual methods. A consistent evaluation of the proposed method on various public domain 3-D databases for different metrics is elaborated, and a comparison with the state-of-the-art is performed.
Embedding meshes in Boolean cubes by graph decomposition
Energy Technology Data Exchange (ETDEWEB)
Ho, C.T. (IBM Almaden Research Center, San Jose, CA (US)); Johnsson, S.L. (Dept. of Computer Science and Electrical Engineering, Yale Univ., New Haven, CT (US))
1990-04-01
This paper explores the embeddings of multidimensional meshes into minimal Boolean cubes by graph decomposition. The graph decomposition technique can be used to improve the average dilation and average congestion. The graph decomposition technique combined with some particular two-dimensional embeddings allows for minimal-expansion, dilation-two, congestion-two embeddings of about 87% of all two-dimensional meshes, with a significantly lower average dilation and congestion than by modified line compression. For three-dimensional meshes the authors show that the graph decomposition technique, together with two three-dimensional mesh embeddings presented in this paper and modified line compression, yields dilation-two embeddings of more than 96% of all three dimensional meshes contained in a 512 {times} 512 {times} 512 mesh.
Image-Based Geometric Modeling and Mesh Generation
2013-01-01
As a new interdisciplinary research area, “image-based geometric modeling and mesh generation” integrates image processing, geometric modeling and mesh generation with finite element method (FEM) to solve problems in computational biomedicine, materials sciences and engineering. It is well known that FEM is currently well-developed and efficient, but mesh generation for complex geometries (e.g., the human body) still takes about 80% of the total analysis time and is the major obstacle to reduce the total computation time. It is mainly because none of the traditional approaches is sufficient to effectively construct finite element meshes for arbitrarily complicated domains, and generally a great deal of manual interaction is involved in mesh generation. This contributed volume, the first for such an interdisciplinary topic, collects the latest research by experts in this area. These papers cover a broad range of topics, including medical imaging, image alignment and segmentation, image-to-mesh conversion,...
HypGrid2D. A 2-d mesh generator
Energy Technology Data Exchange (ETDEWEB)
Soerensen, N.N.
1998-03-01
The implementation of a hyperbolic mesh generation procedure, based on an equation for orthogonality and an equation for the cell face area is described. The method is fast, robust and gives meshes with good smoothness and orthogonality. The procedure is implemented in a program called HypGrid2D. The HypGrid2D program is capable of generating C-, O- and `H`-meshes for use in connection with the EllipSys2D Navier-Stokes solver. To illustrate the capabilities of the program, some test examples are shown. First a series of C-meshes are generated around a NACA-0012 airfoil. Secondly a series of O-meshes are generated around a NACA-65-418 airfoil. Finally `H`-meshes are generated over a Gaussian hill and a linear escarpment. (au)
Investigation of Mesh Choosing Parameters in Screen Printing System
Directory of Open Access Journals (Sweden)
Ahmet AKGÜL
2012-05-01
Full Text Available The mesh, which is made by weaving of natural silk, plastic, or metal fibers, is basic material for screen-printing. Image is created on stretched on a frame in screen-printing. Mesh should be selected correctly for a high quality printing. Therefore, substrates, types of print job and mesh parameters have importance. Need to know more about to mesh, yarn type, yarn thickness, frequency of weaving, stretching tension, the kind of weaving, etc. In this study, for a high quality screen-printing, mesh variables examined in detail and optimum conditions indicated, with the aim of increase productivity, minimize to losses time, material and labor. As a result, this information’s for obtaining a high quality printing with screen-printing system have importance as a guide. Also resolution of the image, amount of print run and viscosity of the printing ink, factors affecting the selection of mesh.
Directory of Open Access Journals (Sweden)
Medikondu Kishore
2010-01-01
Full Text Available A systematic study has been carried out to explore the physicochemical characteristics of drinking water sources of Tipparthy revenue sub-division, Nalgonda (District, Andhra Pradesh, India. Totally 49 water samples were collected from the different locations (22 villages of the study area including bore well, open well and hand pump water and analyzed for pH, EC, TDS, turbidity, total hardness, fluoride, chloride, nitrate, nitrite, sulphate, phosphates, calcium, magnesium, sodium, potassium, Iron and dissolved oxygen. On an average, in almost all the samples, one or the other chemical constituent was beyond the permissible limits it was also concluded that water sources in the study area not fit for potability. Sodium absorption ratio (SAR and water quality (WQI studies indicate water available from all sources not fit for irrigation also. The study indicates the need for periodic monitoring of ground water in the study area.
Simultaneous Task Subdivision and Allocation using Negotiations in Multi-Robot Systems
Directory of Open Access Journals (Sweden)
Claudio Rossi
2015-03-01
Full Text Available This paper presents a negotiations based approach for simultaneous task subdivision and assignment in hetero-geneous multi-robot systems. We first propose an abstraction of the concept of a task that allows for the generalizing of a variety of different problems. Based on such an abstraction, we have developed a negotiation protocol based on Rubinstein’s alternate offers protocol. This is extended to the multi-dimensional space and employs a heuristic search step for evaluating and generating offers. Furthermore, the issue of how to extend a bilateral negotiations protocol to more than two parties is taken into consideration. The protocol was first tested in numerical simulations with different scenarios and then applied to three real world missions.
Energy Technology Data Exchange (ETDEWEB)
Greene, Patrick T. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Schofield, Samuel P. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Nourgaliev, Robert [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2016-06-21
A new mesh smoothing method designed to cluster mesh cells near a dynamically evolving interface is presented. The method is based on weighted condition number mesh relaxation with the weight function being computed from a level set representation of the interface. The weight function is expressed as a Taylor series based discontinuous Galerkin projection, which makes the computation of the derivatives of the weight function needed during the condition number optimization process a trivial matter. For cases when a level set is not available, a fast method for generating a low-order level set from discrete cell-centered elds, such as a volume fraction or index function, is provided. Results show that the low-order level set works equally well for the weight function as the actual level set. Meshes generated for a number of interface geometries are presented, including cases with multiple level sets. Dynamic cases for moving interfaces are presented to demonstrate the method's potential usefulness to arbitrary Lagrangian Eulerian (ALE) methods.
MeSH Up: effective MeSH text classification for improved document retrieval
Trieschnigg, Dolf; Pezik, Piotr; Lee, Vivian; Jong, de Franciska; Kraaij, Wessel; Rebholz-Schuhmann, Dietrich
2009-01-01
Motivation: Controlled vocabularies such as the Medical Subject Headings (MeSH) thesaurus and the Gene Ontology (GO) provide an efficient way of accessing and organizing biomedical information by reducing the ambiguity inherent to free-text data. Different methods of automating the assignment of MeS
MeSH Up: Effective MeSH text classification for improved document retrieval
Trieschnigg, D.; Pezik, P.; Lee, V.; Jong, F.de; Kraaij, W.; Rebholz-Schuhmann, D.
2009-01-01
Motivation: Controlled vocabularies such as the Medical Subject Headings (MeSH) thesaurus and the Gene Ontology (GO) provide an efficient way of accessing and organizing biomedical information by reducing the ambiguity inherent to free-text data. Different methods of automating the assignment of MeS
Molen, A.S. van der; Wong, Th.E.
2007-01-01
In the Netherlands North Sea area, the Chalk Group has thus far been subdivided into the Cenomanian Texel Formation, the Turonian to Maastrichtian Ommelanden Formation and the Danian Ekofisk Formation. This paper describes the attempt to arrive at a more detailed lithostratigraphic subdivision for t
2010-12-07
... On-Site Leased Workers of Turner Industries and Go Johnson, La Porte, TX; Amended Certification... Corporation, a subdivision of Zach System SPA, La Porte, Texas, including on-site leased workers from Turner Industries and Go Johnson, La Porte, Texas. The Department's notice of determination was published in...
2010-04-01
...), the District of Columbia, the Commonwealth of Puerto Rico, and United States territories, considered... States (and their political subdivisions), the District of Columbia, the Commonwealth of Puerto Rico, and.... The District of Columbia, the Commonwealth of Puerto Rico, Guam, the Virgin Islands, and territories...
DEFF Research Database (Denmark)
Cutanda Henríquez, Vicente; Juhl, Peter Møller
2008-01-01
of the integrand or the whole method. On the other hand, it is also possible to refine or improve the numerical integration, and maintain the standard BEM formulation. In this paper a numerical technique based on element subdivision, previously proposed by the authors, is made more general to cover most cases...
Nunes da Rocha, U.; Elsas, van J.D.; Overbeek, van L.S.
2011-01-01
Strains CHC12 and CHC8, belonging to, respectively, Luteolibacter and Candidatus genus Rhizospheria (Verrucomicrobia subdivision 1), were recently isolated from the leek rhizosphere. The key question addressed in this study was: does attraction to and colonization of the rhizosphere occur in the sam
In vivo evidence of functional and anatomical stripe-based subdivisions in human V2 and V3.
Dumoulin, Serge O; Harvey, Ben M; Fracasso, Alessio; Zuiderbaan, Wietske; Luijten, Peter R; Wandell, Brian A; Petridou, Natalia
2017-04-07
Visual cortex contains a hierarchy of visual areas. The earliest cortical area (V1) contains neurons responding to colour, form and motion. Later areas specialize on processing of specific features. The second visual area (V2) in non-human primates contains a stripe-based anatomical organization, initially defined using cytochrome-oxidase staining of post-mortem tissue. Neurons in these stripes have been proposed to serve distinct functional specializations, e.g. processing of color, form and motion. These stripes represent an intermediate stage in visual hierarchy and serve a key role in the increasing functional specialization of visual areas. Using sub-millimeter high-field functional and anatomical MRI (7T), we provide in vivo evidence for stripe-based subdivisions in humans. Using functional MRI, we contrasted responses elicited by stimuli alternating at slow and fast temporal frequencies. We revealed stripe-based subdivisions in V2 ending at the V1/V2 border. The human stripes reach into V3. Using anatomical MRI optimized for myelin contrast within gray matter, we also observe a stripe pattern. Stripe subdivisions preferentially responding to fast temporal frequencies are more myelinated. As such, functional and anatomical measures provide independent and converging evidence for functional organization into striped-based subdivisions in human V2 and V3.
Kielak, Anna M; van Veen, Johannes A; Kowalchuk, George A
2010-10-01
The bacterial phylum Acidobacteria has a widespread distribution and is one of the most common and diverse phyla in soil habitats. However, members of this phylum have often been recalcitrant to cultivation methods, hampering the study of this presumably important bacterial group. In this study, we used a cultivation-independent metagenomic approach to recover genomic information from soilborne members of this phylum. A soil metagenomic fosmid library was screened by PCR targeting acidobacterial 16S rRNA genes, facilitating the recovery of 17 positive clones. Recovered inserts appeared to originate from a range of Acidobacteria subdivisions, with dominance of subdivision 6 (10 clones). Upon full-length insert sequencing, gene annotation identified a total of 350 open reading frames (ORFs), representing a broad range of functions. Remarkably, six inserts from subdivision 6 contained a region of gene synteny, containing genes involved in purine de novo biosynthesis and encoding tRNA synthetase and conserved hypothetical proteins. Similar genomic regions had previously been observed in several environmental clones recovered from soil and marine sediments, facilitating comparisons with respect to gene organization and evolution. Comparative analyses revealed a general dichotomy between marine and terrestrial genes in both phylogeny and G+C content. Although the significance of this homologous gene cluster across subdivision 6 members is not known, it appears to be a common feature within a large percentage of all acidobacterial genomic fragments recovered from both of these environments.
Ether- and ester-bound iso-diabolic acid and other lipids in members of Acidobacteria subdivision 4
Sinninghe Damsté, Jaap S.; Rijpstra, W. Irene C; Hopmans, Ellen C.; Foesel, Bärbel U.; Wüst, Pia K.; Overmann, Jörg; Tank, Marcus; Bryant, Donald A.; Dunfield, Peter F.; Houghton, Karen; Stott, Matthew B.
2014-01-01
Recently, iso-diabolic acid (13,16-dimethyl octacosanedioic acid) has been identified as a major membrane-spanning lipid of subdivisions 1 and 3 of the Acidobacteria, a highly diverse phylum within the Bacteria. This finding pointed to the Acidobacteria as a potential source for the bacterial glycer
Luttikhuizen, PC; Drent, J; Baker, AJ
2003-01-01
Mitochondrial DNA sequence data for 295 individuals of the marine bivalve Macoma balthica (L.) were collected from 10 sites across the European distribution, and from Alaska. The data were used to infer population subdivision history and estimate current levels of gene flow. Inferred historical biog
Skala, Vaclav
2016-06-01
There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees, octrees, kd-trees, bounding volume hierarchies etc. However in some applications a non-orthogonal space subdivision can offer new ways for actual speed up. In the case of convex polygon in E2 a simple Point-in-Polygon test is of the O(N) complexity and the optimal algorithm is of O(log N) computational complexity. In the E3 case, the complexity is O(N) even for the convex polyhedron as no ordering is defined. New Point-in-Convex Polygon and Point-in-Convex Polyhedron algorithms are presented based on space subdivision in the preprocessing stage resulting to O(1) run-time complexity. The presented approach is simple to implement. Due to the principle of duality, dual problems, e.g. line-convex polygon, line clipping, can be solved in a similarly.
The Jurassic of Denmark and Greenland: The Upper Jurassic of Europe: its subdivision and correlation
Directory of Open Access Journals (Sweden)
Zeiss, Arnold
2003-10-01
Full Text Available In the last 40 years, the stratigraphy of the Upper Jurassic of Europe has received much attention and considerable revision; much of the impetus behind this endeavour has stemmed from the work of the International Subcommission on Jurassic Stratigraphy. The Upper Jurassic Series consists of three stages, the Oxfordian, Kimmeridgian and Tithonian which are further subdivided into substages, zones and subzones, primarily on the basis of ammonites. Regional variations between the Mediterranean, Submediterranean and Subboreal provinces are discussed and correlation possibilities indicated. The durations of the Oxfordian, Kimmeridgian and Tithonian Stages are reported to have been 5.3, 3.4 and 6.5 Ma, respectively. This review of the present status of Upper Jurassic stratigraphy aids identification of a number of problems of subdivision and definition of Upper Jurassic stages; in particular these include correlation of the base of the Kimmeridgian and the top of the Tithonian between Submediterranean and Subboreal Europe. Although still primarily based on ammonite stratigraphy, subdivision of the Upper Jurassic is increasingly being refined by the incorporation of other fossil groups; these include both megafossils, such as aptychi, belemnites, bivalves, gastropods, brachiopods, echinoderms, corals, sponges and vertebrates, and microfossils such as foraminifera, radiolaria, ciliata, ostracodes, dinoflagellates, calcareous nannofossils, charophyaceae, dasycladaceae, spores and pollen. Important future developments will depend on the detailed integration of these disparate biostratigraphic data and their precise combination with the abundant new data from sequence stratigraphy, utilising the high degree of stratigraphic resolution offered by certain groups of fossils. This article also contains some notes on the recent results of magnetostratigraphy and sequence chronostratigraphy.
Santos-Durán, Gabriel N; Ferreiro-Galve, Susana; Menuet, Arnaud; Quintana-Urzainqui, Idoia; Mazan, Sylvie; Rodríguez-Moldes, Isabel; Candal, Eva
2016-01-01
The hypothalamus is an important physiologic center of the vertebrate brain involved in the elaboration of individual and species survival responses. To better understand the ancestral organization of the alar hypothalamus we revisit previous data on ScOtp, ScDlx2/5, ScTbr1, ScNkx2.1 expression and Pax6 immunoreactivity jointly with new data on ScNeurog2, ScLhx9, ScLhx5, and ScNkx2.8 expression, in addition to immunoreactivity to serotonin (5-HT) and doublecortin (DCX) in the catshark Scyliorhinus canicula, a key species for this purpose since cartilaginous fishes are basal representatives of gnathostomes (jawed vertebrates). Our study revealed a complex genoarchitecture for the chondrichthyan alar hypothalamus. We identified terminal (rostral) and peduncular (caudal) subdivisions in the prosomeric paraventricular and subparaventricular areas (TPa/PPa and TSPa/PSPa, respectively) evidenced by the expression pattern of developmental genes like ScLhx5 (TPa) and immunoreactivity against Pax6 (PSPa) and 5-HT (PPa and PSPa). Dorso-ventral subdivisions were only evidenced in the SPa (SPaD, SPaV; respectively) by means of Pax6 and ScNkx2.8 (respectively). Interestingly, ScNkx2.8 expression overlaps over the alar-basal boundary, as Nkx2.2 does in other vertebrates. Our results reveal evidences for the existence of different groups of tangentially migrated cells expressing ScOtp, Pax6, and ScDlx2. The genoarchitectonic comparative analysis suggests alternative interpretations of the rostral-most alar plate in prosomeric terms and reveals a conserved molecular background for the vertebrate alar hypothalamus likely acquired before/during the agnathan-gnathostome transition, on which Otp, Pax6, Lhx5, and Neurog2 are expressed in the Pa while Dlx and Nkx2.2/Nkx2.8 are expressed in the SPa.
Santos-Durán, Gabriel N.; Ferreiro-Galve, Susana; Menuet, Arnaud; Quintana-Urzainqui, Idoia; Mazan, Sylvie; Rodríguez-Moldes, Isabel; Candal, Eva
2016-01-01
The hypothalamus is an important physiologic center of the vertebrate brain involved in the elaboration of individual and species survival responses. To better understand the ancestral organization of the alar hypothalamus we revisit previous data on ScOtp, ScDlx2/5, ScTbr1, ScNkx2.1 expression and Pax6 immunoreactivity jointly with new data on ScNeurog2, ScLhx9, ScLhx5, and ScNkx2.8 expression, in addition to immunoreactivity to serotonin (5-HT) and doublecortin (DCX) in the catshark Scyliorhinus canicula, a key species for this purpose since cartilaginous fishes are basal representatives of gnathostomes (jawed vertebrates). Our study revealed a complex genoarchitecture for the chondrichthyan alar hypothalamus. We identified terminal (rostral) and peduncular (caudal) subdivisions in the prosomeric paraventricular and subparaventricular areas (TPa/PPa and TSPa/PSPa, respectively) evidenced by the expression pattern of developmental genes like ScLhx5 (TPa) and immunoreactivity against Pax6 (PSPa) and 5-HT (PPa and PSPa). Dorso-ventral subdivisions were only evidenced in the SPa (SPaD, SPaV; respectively) by means of Pax6 and ScNkx2.8 (respectively). Interestingly, ScNkx2.8 expression overlaps over the alar-basal boundary, as Nkx2.2 does in other vertebrates. Our results reveal evidences for the existence of different groups of tangentially migrated cells expressing ScOtp, Pax6, and ScDlx2. The genoarchitectonic comparative analysis suggests alternative interpretations of the rostral-most alar plate in prosomeric terms and reveals a conserved molecular background for the vertebrate alar hypothalamus likely acquired before/during the agnathan-gnathostome transition, on which Otp, Pax6, Lhx5, and Neurog2 are expressed in the Pa while Dlx and Nkx2.2/Nkx2.8 are expressed in the SPa. PMID:27932958
Caspers, Julian; Mathys, Christian; Hoffstaedter, Felix; Südmeyer, Martin; Cieslik, Edna C.; Rubbert, Christian; Hartmann, Christian J.; Eickhoff, Claudia R.; Reetz, Kathrin; Grefkes, Christian; Michely, Jochen; Turowski, Bernd; Schnitzler, Alfons; Eickhoff, Simon B.
2017-01-01
Patients suffering from Parkinson's disease (PD) often show impairments in executive function (EF) like decision-making and action control. The right dorsolateral prefrontal cortex (dlPFC) has been strongly implicated in EF in healthy subjects and has repeatedly been reported to show alterations related to EF impairment in PD. Recently, two key regions for cognitive action control have been identified within the right dlPFC by co-activation based parcellation. While the posterior region is engaged in rather basal EF like stimulus integration and working memory, the anterior region has a more abstract, supervisory function. To investigate whether these functionally distinct subdivisions of right dlPFC are differentially affected in PD, we analyzed resting-state functional connectivity (FC) in 39 PD patients and 44 age- and gender-matched healthy controls. Patients were examined both after at least 12 h withdrawal of dopaminergic drugs (OFF) and under their regular dopaminergic medication (ON). We found that only the posterior right dlPFC subdivision shows FC alterations in PD, while the anterior part remains unaffected. PD-related decreased FC with posterior right dlPFC was found in the bilateral medial posterior parietal cortex (mPPC) and left dorsal premotor region (PMd) in the OFF state. In the medical ON, FC with left PMd normalized, while decoupling with bilateral mPPC remained. Furthermore, we observed increased FC between posterior right dlPFC and the bilateral dorsomedial prefrontal cortex (dmPFC) in PD in the ON state. Our findings point to differential disturbances of right dlPFC connectivity in PD, which relate to its hierarchical organization of EF processing by stronger affecting the functionally basal posterior aspect than the hierarchically higher anterior part. PMID:28611616
Differential reward coding in the subdivisions of the primate caudate during an oculomotor task.
Nakamura, Kae; Santos, Gustavo S; Matsuzaki, Ryuichi; Nakahara, Hiroyuki
2012-11-07
The basal ganglia play a pivotal role in reward-oriented behavior. The striatum, an input channel of the basal ganglia, is composed of subdivisions that are topographically connected with different cortical and subcortical areas. To test whether reward information is differentially processed in the different parts of the striatum, we compared reward-related neuronal activity along the dorsolateral-ventromedial axis in the caudate nucleus of monkeys performing an asymmetrically rewarded oculomotor task. In a given block, a target in one position was associated with a large reward, whereas the other target was associated with a small reward. The target position-reward value contingency was switched between blocks. We found the following: (1) activity that reflected the block-wise reward contingency emerged before the appearance of a visual target, and it was more prevalent in the dorsal, rather than central and ventral, caudate; (2) activity that was positively related to the reward size of the current trial was evident, especially after reward delivery, and it was more prevalent in the ventral and central, rather than dorsal, caudate; and (3) activity that was modulated by the memory of the outcomes of the previous trials was evident in the dorsal and central caudate. This multiple reward information, together with the target-direction information, was represented primarily by individual caudate neurons, and the different reward information was represented in caudate subpopulations with distinct electrophysiological properties, e.g., baseline firing and spike width. These results suggest parallel processing of different reward information by the basal ganglia subdivisions defined by extrinsic connections and intrinsic properties.
AUTOMATIC MESH GENERATION OF 3-D GEOMETRIC MODELS
Institute of Scientific and Technical Information of China (English)
刘剑飞
2003-01-01
In this paper the presentation of the ball-packing method is reviewed,and a scheme to generate mesh for complex 3-D geometric models is given,which consists of 4 steps:(1)create nodes in 3-D models by ball-packing method,(2)connect nodes to generate mesh by 3-D Delaunay triangulation,(3)retrieve the boundary of the model after Delaunay triangulation,(4)improve the mesh.
Vertex-based diffusion for 3-D mesh denoising.
Zhang, Ying; Ben Hamza, A
2007-04-01
We present a vertex-based diffusion for 3-D mesh denoising by solving a nonlinear discrete partial differential equation. The core idea behind our proposed technique is to use geometric insight in helping construct an efficient and fast 3-D mesh smoothing strategy to fully preserve the geometric structure of the data. Illustrating experimental results demonstrate a much improved performance of the proposed approach in comparison with existing methods currently used in 3-D mesh smoothing.
Multiphase Flow of Immiscible Fluids on Unstructured Moving Meshes
DEFF Research Database (Denmark)
Misztal, Marek Krzysztof; Erleben, Kenny; Bargteil, Adam;
2013-01-01
In this paper, we present a method for animating multiphase flow of immiscible fluids using unstructured moving meshes. Our underlying discretization is an unstructured tetrahedral mesh, the deformable simplicial complex (DSC), that moves with the flow in a Lagrangian manner. Mesh optimization op...... complement and solve our optimization on the GPU. We provide the results of parameter studies as well as a performance analysis of our method, together with suggestions for performance optimization....
Automated quadrilateral mesh generation for digital image structures
Institute of Scientific and Technical Information of China (English)
无
2011-01-01
With the development of advanced imaging technology, digital images are widely used. This paper proposes an automatic quadrilateral mesh generation algorithm for multi-colour imaged structures. It takes an original arbitrary digital image as an input for automatic quadrilateral mesh generation, this includes removing the noise, extracting and smoothing the boundary geometries between different colours, and automatic all-quad mesh generation with the above boundaries as constraints. An application example is...
Hexahedral mesh generation via the dual arrangement of surfaces
Energy Technology Data Exchange (ETDEWEB)
Mitchell, S.A.; Tautges, T.J. [Sandia National Labs., Albuquerque, NM (United States)
1997-12-31
Given a general three-dimensional geometry with a prescribed quadrilateral surface mesh, the authors consider the problem of constructing a hexahedral mesh of the geometry whose boundary is exactly the prescribed surface mesh. Due to the specialized topology of hexahedra, this problem is more difficult than the analogous one for tetrahedra. Folklore has maintained that a surface mesh must have a constrained structure in order for there to exist a compatible hexahedral mesh. However, they have proof that a surface mesh need only satisfy mild parity conditions, depending on the topology of the three-dimensional geometry, for there to exist a compatible hexahedral mesh. The proof is based on the realization that a hexahedral mesh is dual to an arrangement of surfaces, and the quadrilateral surface mesh is dual to the arrangement of curves bounding these surfaces. The proof is constructive and they are currently developing an algorithm called Whisker Weaving (WW) that mirrors the proof steps. Given the bounding curves, WW builds the topological structure of an arrangement of surfaces having those curves as its boundary. WW progresses in an advancing front manner. Certain local rules are applied to avoid structures that lead to poor mesh quality. Also, after the arrangement is constructed, additional surfaces are inserted to separate features, so e.g., no two hexahedra share more than one quadrilateral face. The algorithm has generated meshes for certain non-trivial problems, but is currently unreliable. The authors are exploring strategies for consistently selecting which portion of the surface arrangement to advance based on the existence proof. This should lead us to a robust algorithm for arbitrary geometries and surface meshes.
Space-Time Transfinite Interpolation of Volumetric Material Properties.
Sanchez, Mathieu; Fryazinov, Oleg; Adzhiev, Valery; Comninos, Peter; Pasko, Alexander
2015-02-01
The paper presents a novel technique based on extension of a general mathematical method of transfinite interpolation to solve an actual problem in the context of a heterogeneous volume modelling area. It deals with time-dependent changes to the volumetric material properties (material density, colour, and others) as a transformation of the volumetric material distributions in space-time accompanying geometric shape transformations such as metamorphosis. The main idea is to represent the geometry of both objects by scalar fields with distance properties, to establish in a higher-dimensional space a time gap during which the geometric transformation takes place, and to use these scalar fields to apply the new space-time transfinite interpolation to volumetric material attributes within this time gap. The proposed solution is analytical in its nature, does not require heavy numerical computations and can be used in real-time applications. Applications of this technique also include texturing and displacement mapping of time-variant surfaces, and parametric design of volumetric microstructures.
In Vivo Real Time Volumetric Synthetic Aperture Ultrasound Imaging
DEFF Research Database (Denmark)
Bouzari, Hamed; Rasmussen, Morten Fischer; Brandt, Andreas Hjelm;
2015-01-01
Synthetic aperture (SA) imaging can be used to achieve real-time volumetric ultrasound imaging using 2-D array transducers. The sensitivity of SA imaging is improved by maximizing the acoustic output, but one must consider the limitations of an ultrasound system, both technical and biological...
Automatic segmentation of pulmonary segments from volumetric chest CT scans.
Rikxoort, E.M. van; Hoop, B. de; Vorst, S. van de; Prokop, M.; Ginneken, B. van
2009-01-01
Automated extraction of pulmonary anatomy provides a foundation for computerized analysis of computed tomography (CT) scans of the chest. A completely automatic method is presented to segment the lungs, lobes and pulmonary segments from volumetric CT chest scans. The method starts with lung segmenta
Volumetric T-spline Construction Using Boolean Operations
2013-07-01
15213, USA 2 Institute for Computational Engineering and Sciences, The University of Texas at Austin, Austin, TX 78712, USA 3 Department of Civil and...and S. Yau. Volumetric harmonic map. Communications in Information and Systems, 3(3):191–202, 2003. 12. C.A.R. Guerra . Simultaneous untangling and
Volumetric motion quantification by 3D tissue phase mapped CMR
Directory of Open Access Journals (Sweden)
Lutz Anja
2012-10-01
Full Text Available Abstract Background The objective of this study was the quantification of myocardial motion from 3D tissue phase mapped (TPM CMR. Recent work on myocardial motion quantification by TPM has been focussed on multi-slice 2D acquisitions thus excluding motion information from large regions of the left ventricle. Volumetric motion assessment appears an important next step towards the understanding of the volumetric myocardial motion and hence may further improve diagnosis and treatments in patients with myocardial motion abnormalities. Methods Volumetric motion quantification of the complete left ventricle was performed in 12 healthy volunteers and two patients applying a black-blood 3D TPM sequence. The resulting motion field was analysed regarding motion pattern differences between apical and basal locations as well as for asynchronous motion pattern between different myocardial segments in one or more slices. Motion quantification included velocity, torsion, rotation angle and strain derived parameters. Results All investigated motion quantification parameters could be calculated from the 3D-TPM data. Parameters quantifying hypokinetic or asynchronous motion demonstrated differences between motion impaired and healthy myocardium. Conclusions 3D-TPM enables the gapless volumetric quantification of motion abnormalities of the left ventricle, which can be applied in future application as additional information to provide a more detailed analysis of the left ventricular function.
Video-rate volumetric optical coherence tomography-based microangiography
Baran, Utku; Wei, Wei; Xu, Jingjiang; Qi, Xiaoli; Davis, Wyatt O.; Wang, Ruikang K.
2016-04-01
Video-rate volumetric optical coherence tomography (vOCT) is relatively young in the field of OCT imaging but has great potential in biomedical applications. Due to the recent development of the MHz range swept laser sources, vOCT has started to gain attention in the community. Here, we report the first in vivo video-rate volumetric OCT-based microangiography (vOMAG) system by integrating an 18-kHz resonant microelectromechanical system (MEMS) mirror with a 1.6-MHz FDML swept source operating at ˜1.3 μm wavelength. Because the MEMS scanner can offer an effective B-frame rate of 36 kHz, we are able to engineer vOMAG with a video rate up to 25 Hz. This system was utilized for real-time volumetric in vivo visualization of cerebral microvasculature in mice. Moreover, we monitored the blood perfusion dynamics during stimulation within mouse ear in vivo. We also discussed this system's limitations. Prospective MEMS-enabled OCT probes with a real-time volumetric functional imaging capability can have a significant impact on endoscopic imaging and image-guided surgery applications.
Finding Regions of Interest on Toroidal Meshes
Energy Technology Data Exchange (ETDEWEB)
Wu, Kesheng; Sinha, Rishi R; Jones, Chad; Ethier, Stephane; Klasky, Scott; Ma, Kwan-Liu; Shoshani, Arie; Winslett, Marianne
2011-02-09
Fusion promises to provide clean and safe energy, and a considerable amount of research effort is underway to turn this aspiration intoreality. This work focuses on a building block for analyzing data produced from the simulation of microturbulence in magnetic confinementfusion devices: the task of efficiently extracting regions of interest. Like many other simulations where a large amount of data are produced,the careful study of ``interesting'' parts of the data is critical to gain understanding. In this paper, we present an efficient approach forfinding these regions of interest. Our approach takes full advantage of the underlying mesh structure in magnetic coordinates to produce acompact representation of the mesh points inside the regions and an efficient connected component labeling algorithm for constructingregions from points. This approach scales linearly with the surface area of the regions of interest instead of the volume as shown with bothcomputational complexity analysis and experimental measurements. Furthermore, this new approach is 100s of times faster than a recentlypublished method based on Cartesian coordinates.
GRChombo : Numerical Relativity with Adaptive Mesh Refinement
Clough, Katy; Finkel, Hal; Kunesch, Markus; Lim, Eugene A; Tunyasuvunakool, Saran
2015-01-01
Numerical relativity has undergone a revolution in the past decade. With a well-understood mathematical formalism, and full control over the gauge modes, it is now entering an era in which the science can be properly explored. In this work, we introduce GRChombo, a new numerical relativity code written to take full advantage of modern parallel computing techniques. GRChombo's features include full adaptive mesh refinement with block structured Berger-Rigoutsos grid generation which supports non-trivial "many-boxes-in-many-boxes" meshing hierarchies, and massive parallelism through the Message Passing Interface (MPI). GRChombo evolves the Einstein equation with the standard BSSN formalism, with an option to turn on CCZ4 constraint damping if required. We show that GRChombo passes all the standard "Apples-to-Apples" code comparison tests. We also show that it can stably and accurately evolve vacuum black hole spacetimes such as binary black hole mergers, and non-vacuum spacetimes such as scalar collapses into b...
The Tera Multithreaded Architecture and Unstructured Meshes
Bokhari, Shahid H.; Mavriplis, Dimitri J.
1998-01-01
The Tera Multithreaded Architecture (MTA) is a new parallel supercomputer currently being installed at San Diego Supercomputing Center (SDSC). This machine has an architecture quite different from contemporary parallel machines. The computational processor is a custom design and the machine uses hardware to support very fine grained multithreading. The main memory is shared, hardware randomized and flat. These features make the machine highly suited to the execution of unstructured mesh problems, which are difficult to parallelize on other architectures. We report the results of a study carried out during July-August 1998 to evaluate the execution of EUL3D, a code that solves the Euler equations on an unstructured mesh, on the 2 processor Tera MTA at SDSC. Our investigation shows that parallelization of an unstructured code is extremely easy on the Tera. We were able to get an existing parallel code (designed for a shared memory machine), running on the Tera by changing only the compiler directives. Furthermore, a serial version of this code was compiled to run in parallel on the Tera by judicious use of directives to invoke the "full/empty" tag bits of the machine to obtain synchronization. This version achieves 212 and 406 Mflop/s on one and two processors respectively, and requires no attention to partitioning or placement of data issues that would be of paramount importance in other parallel architectures.
Mesh-based parallel code coupling interface
Energy Technology Data Exchange (ETDEWEB)
Wolf, K.; Steckel, B. (eds.) [GMD - Forschungszentrum Informationstechnik GmbH, St. Augustin (DE). Inst. fuer Algorithmen und Wissenschaftliches Rechnen (SCAI)
2001-04-01
MpCCI (mesh-based parallel code coupling interface) is an interface for multidisciplinary simulations. It provides industrial end-users as well as commercial code-owners with the facility to combine different simulation tools in one environment. Thereby new solutions for multidisciplinary problems will be created. This opens new application dimensions for existent simulation tools. This Book of Abstracts gives a short overview about ongoing activities in industry and research - all presented at the 2{sup nd} MpCCI User Forum in February 2001 at GMD Sankt Augustin. (orig.) [German] MpCCI (mesh-based parallel code coupling interface) definiert eine Schnittstelle fuer multidisziplinaere Simulationsanwendungen. Sowohl industriellen Anwender als auch kommerziellen Softwarehersteller wird mit MpCCI die Moeglichkeit gegeben, Simulationswerkzeuge unterschiedlicher Disziplinen miteinander zu koppeln. Dadurch entstehen neue Loesungen fuer multidisziplinaere Problemstellungen und fuer etablierte Simulationswerkzeuge ergeben sich neue Anwendungsfelder. Dieses Book of Abstracts bietet einen Ueberblick ueber zur Zeit laufende Arbeiten in der Industrie und in der Forschung, praesentiert auf dem 2{sup nd} MpCCI User Forum im Februar 2001 an der GMD Sankt Augustin. (orig.)
Feature detection of triangular meshes vianeighbor supporting
Institute of Scientific and Technical Information of China (English)
Xiao-chao WANG; Jun-jie CAO; Xiu-ping LIU; Bao-jun LI; Xi-quan SHI; Yi-zhen SUN
2012-01-01
We propose a robust method for detecting features on triangular meshes by combining normal tensor voting with neighbor supporting.Our method contains two stages:feature detection and feature refinement.First,the normal tensor voting method is modified to detect the initial features,which may include some pseudo features.Then,at the feature refinement stage,a novel salient measure deriving from the idea of neighbor supporting is developed. Benefiting from the integrated reliable salient measure feature,pseudo features can be effectively discriminated from the initially detected features and removed. Compared to previous methods based on the differential geometric property,the main advantage of our method is that it can detect both sharp and weak features.Numerical experiments show that our algorithm is robust,effective,and can produce more accurate results.We also discuss how detected features are incorporated into applications,such as feature-preserving mesh denoising and hole-filling,and present visually appealing results by integrating feature information.
An Evaluation Method for Distortion Energy Parameterization of Triangular Meshes
Institute of Scientific and Technical Information of China (English)
SHI Jing; ZHAO Xiu-yang; ZHANG Cai-ming; YANG Bo
2013-01-01
Parameterization of triangle meshes is a fundamental problem for texture mapping, surface fitting, surface reconstruction, and mesh editing. The deformation of triangular meshes caused by the parameterized process is the measurement of parameterization. Traditional standard method has its limitation when evaluating mixture distortion energy parameterizations. Thus an evaluation method bases on distortion energy parameterization of triangular meshes is introduced for the limitation. The novel method employs an adaptive expression form to the mixture energy, and uses a weight factor to represent distortion energy distribution. By using this method, we can evaluate all kinds of parameterization in a uniform measurement and acquire a more intuitive and clear evaluation.
The mesh controversy [version 1; referees: 2 approved
Directory of Open Access Journals (Sweden)
Joshua A. Cohn
2016-09-01
Full Text Available Pelvic organ prolapse and stress urinary incontinence are common conditions for which approximately 11% of women will undergo surgical intervention in their lifetime. The use of vaginal mesh for pelvic organ prolapse and stress urinary incontinence rose rapidly in the early 2000s as over 100 mesh products were introduced into the clinical armamentarium with little regulatory oversight for their use. US Food and Drug Administration Public Health Notifications in 2008 and 2011, as well as reclassification of transvaginal mesh for prolapse to class III in early 2016, were a response to debilitating complications associated with transvaginal mesh placement in many women. The midurethral sling has not been subject to the same reclassification and continues to be endorsed as the “gold standard” for surgical management of stress urinary incontinence by subspecialty societies. However, litigators have not differentiated between mesh for prolapse and mesh for incontinence. As such, all mesh, including that placed for stress urinary incontinence, faces continued controversy amidst an uncertain future. In this article, we review the background of the mesh controversy, recent developments, and the anticipated role of mesh in surgery for prolapse and stress urinary incontinence going forward.
Numerical modeling of seismic waves using frequency-adaptive meshes
Hu, Jinyin; Jia, Xiaofeng
2016-08-01
An improved modeling algorithm using frequency-adaptive meshes is applied to meet the computational requirements of all seismic frequency components. It automatically adopts coarse meshes for low-frequency computations and fine meshes for high-frequency computations. The grid intervals are adaptively calculated based on a smooth inversely proportional function of grid size with respect to the frequency. In regular grid-based methods, the uniform mesh or non-uniform mesh is used for frequency-domain wave propagators and it is fixed for all frequencies. A too coarse mesh results in inaccurate high-frequency wavefields and unacceptable numerical dispersion; on the other hand, an overly fine mesh may cause storage and computational overburdens as well as invalid propagation angles of low-frequency wavefields. Experiments on the Padé generalized screen propagator indicate that the Adaptive mesh effectively solves these drawbacks of regular fixed-mesh methods, thus accurately computing the wavefield and its propagation angle in a wide frequency band. Several synthetic examples also demonstrate its feasibility for seismic modeling and migration.
Dimensionality Reduction of Laplacian Embedding for 3D Mesh Reconstruction
Mardhiyah, I.; Madenda, S.; Salim, R. A.; Wiryana, I. M.
2016-06-01
Laplacian eigenbases are the important thing that we have to process from 3D mesh information. The information of geometric 3D mesh are include vertices locations and the connectivity of graph. Due to spectral analysis, geometric 3D mesh for large and sparse graphs with thousands of vertices is not practical to compute all the eigenvalues and eigenvector. Because of that, in this paper we discuss how to build 3D mesh reconstruction by reducing dimensionality on null eigenvalue but retain the corresponding eigenvector of Laplacian Embedding to simplify mesh processing. The result of reducing information should have to retained the connectivity of graph. The advantages of dimensionality reduction is for computational eficiency and problem simplification. Laplacian eigenbases is the point of dimensionality reduction for 3D mesh reconstruction. In this paper, we show how to reconstruct geometric 3D mesh after approximation step of 3D mesh by dimensionality reduction. Dimensionality reduction shown by Laplacian Embedding matrix. Furthermore, the effectiveness of 3D mesh reconstruction method will evaluated by geometric error, differential error, and final error. Numerical approximation error of our result are small and low complexity of computational.
A New Approach to Fully Automatic Mesh Generation
Institute of Scientific and Technical Information of China (English)
闵卫东; 张征明; 等
1995-01-01
Automatic mesh generation is one of the most important parts in CIMS (Computer Integrated Manufacturing System).A method based on mesh grading propagation which automatically produces a triangular mesh in a multiply connected planar region is presented in this paper.The method decomposes the planar region into convex subregions,using algorithms which run in linear time.For every subregion,an algorithm is used to generate shrinking polygons according to boundary gradings and form delaunay triangulation between two adjacent shrinking polygons,both in linear time.It automatically propagates boundary gradings into the interior of the region and produces satisfactory quasi-uniform mesh.
Biology of biological meshes used in hernia repair.
Novitsky, Yuri W
2013-10-01
Successful repair of most hernias requires the use of a prosthetic implant for reinforcement of the defect. Because of the need for prosthetic implants to resist infections as well to support repairs in contaminated or potentially contaminated fields, biological meshes have been developed to take the place of nondegradable synthetic meshes in cases where mesh infection is of high concern. The ideal is a biological matrix that resists infection while providing durable reinforcement of a hernia repair. This article reviews the validity of assumptions that support the purported notion of the biological behavior of biological meshes.
Triangulated manifold meshing method preserving molecular surface topology.
Chen, Minxin; Tu, Bin; Lu, Benzhuo
2012-09-01
Generation of manifold mesh is an urgent issue in mathematical simulations of biomolecule using boundary element methods (BEM) or finite element method (FEM). Defects, such as not closed mesh, intersection of elements and missing of small structures, exist in surface meshes generated by most of the current meshing method. Usually the molecular surface meshes produced by existing methods need to be revised carefully by third party software to ensure the surface represents a continuous manifold before being used in a BEM and FEM calculations. Based on the trace technique proposed in our previous work, in this paper, we present an improved meshing method to avoid intersections and preserve the topology of the molecular Gaussian surface. The new method divides the whole Gaussian surface into single valued pieces along each of x, y, z directions by tracing the extreme points along the fold curves on the surface. Numerical test results show that the surface meshes produced by the new method are manifolds and preserve surface topologies. The result surface mesh can also be directly used in surface conforming volume mesh generation for FEM type simulation. Copyright © 2012 Elsevier Inc. All rights reserved.
Ether- and Ester-Bound iso-Diabolic Acid and Other Lipids in Members of Acidobacteria Subdivision 4
Rijpstra, W. Irene C.; Hopmans, Ellen C.; Foesel, Bärbel U.; Wüst, Pia K.; Overmann, Jörg; Tank, Marcus; Bryant, Donald A.; Dunfield, Peter F.; Houghton, Karen; Stott, Matthew B.
2014-01-01
Recently, iso-diabolic acid (13,16-dimethyl octacosanedioic acid) has been identified as a major membrane-spanning lipid of subdivisions 1 and 3 of the Acidobacteria, a highly diverse phylum within the Bacteria. This finding pointed to the Acidobacteria as a potential source for the bacterial glycerol dialkyl glycerol tetraethers that occur ubiquitously in peat, soil, lakes, and hot springs. Here, we examined the lipid composition of seven phylogenetically divergent strains of subdivision 4 of the Acidobacteria, a bacterial group that is commonly encountered in soil. Acid hydrolysis of total cell material released iso-diabolic acid derivatives in substantial quantities (11 to 48% of all fatty acids). In contrast to subdivisions 1 and 3 of the Acidobacteria, 6 out of the 7 species of subdivision 4 (excepting “Candidatus Chloracidobacterium thermophilum”) contained iso-diabolic acid ether bound to a glycerol in larger fractional abundance than iso-diabolic acid itself. This is in agreement with the analysis of intact polar lipids (IPLs) by high-performance liquid chromatography-mass spectrometry (HPLC-MS), which showed the dominance of mixed ether-ester glycerides. iso-Diabolic acid-containing IPLs were not identified, because these IPLs are not released with a Bligh-Dyer extraction, as observed before when studying lipid compositions of subdivisions 1 and 3 of the Acidobacteria. The presence of ether bonds in the membrane lipids does not seem to be an adaptation to temperature, because the five mesophilic isolates contained a larger amount of ether lipids than the thermophile “Ca. Chloracidobacterium thermophilum.” Furthermore, experiments with Pyrinomonas methylaliphatogenes did not reveal a major influence of growth temperature over the 50 to 69°C range. PMID:24928878
Directory of Open Access Journals (Sweden)
Rege Sugárka Papp
2014-05-01
Full Text Available The projections from the dorsolateral hypothalamic area (DLH to the lower brainstem have been investigated by using biotinylated dextran amine (BDA, an anterograde tracer in rats. The DLH can be divided into 3 areas (dorsomedial hypothalamus, perifornical area, lateral hypothalamic area, and further subdivided into 8 subdivisions. After unilateral stereotaxic injections of BDA into individual DLH subdivisions, the correct sites of injections were controlled histologically, and the distribution patterns of BDA-positive fibers were mapped on serial sections between the hypothalamus and spinal cord in 22 rats. BDA-labeled fibers were observable over 100 different brainstem areas, nuclei or subdivisions. Injections into the 8 DLH subdivisions established distinct topographical patterns. In general, the density of labeled fibers was low in the lower brainstem. High density of fibers was seen only 4 of the 116 areas: in the lateral and ventrolateral parts of the periaqueductal gray, the Barrington’s and the pedunculopontine tegmental nuclei. All of the biogenic amine cell groups in the lower brainstem (9 noradrenaline, 3 adrenaline and 9 serotonin cell groups received labeled fibers, some of them from all, or at least 7 DLH subdivisions, mainly from perifornical and ventral lateral hypothalamic neurons. Some of the tegmental nuclei and nuclei of the reticular formation were widely innervated, although the density of the BDA-labeled fibers was generally low. No definitive descending BDA-positive pathway, but long-run solitaire BDA-labeled fibers were seen in the lower brainstem. These descending fibers joined some of the large tracts or fasciculi in the brainstem. The distribution pattern of BDA-positive fibers of DLH origin throughout the lower brainstem was comparable to patterns of previously published orexin- or melanin-concentrating hormone-immunoreactive fibers with somewhat differences.
Analysis of Changing Swarm Rate using Volumetric Strain
Kumazawa, T.; Ogata, Y.; Kimura, K.; Maeda, K.; Kobayashi, A.
2015-12-01
Near the eastern coast of Izu peninsula is an active submarine volcanic region in Japan, where magma intrusions have been observed many times. The forecast of earthquake swarm activities and eruptions are serious concern particularly in nearby hot spring resort areas. It is well known that temporal durations of the swarm activities have been correlated with early volumetric strain changes at a certain observation station of about 20 km distance apart. Therefore the Earthquake Research Committee (2010) investigated some empirical statistical relations to predict sizes of the swarm activity. Here we looked at the background seismicity rate changes during these swarm periods using the non-stationary ETAS model (Kumazawa and Ogata, 2013, 2014), and have found the followings. The modified volumetric strain data, by removing the effect of earth tides, precipitation and coseismic jumps, have significantly higher cross-correlations to the estimated background rates of the ETAS model than to the swarm rate-changes. Specifically, the background seismicity rate synchronizes clearer to the strain change by the lags around a half day. These relations suggest an enhanced prediction of earthquakes in this region using volumetric strain measurements. Hence we propose an extended ETAS model where the background rate is modulated by the volumetric strain data. We have also found that the response function to the strain data can be well approximated by an exponential functions with the same decay rate, but that their intersects are inversely proportional to the distances between the volumetric strain-meter and the onset location of the swarm. Our numerical results by the same proposed model show consistent outcomes for the various major swarms in this region.
MeshVoro: A Three-Dimensional Voronoi Mesh Building Tool for the TOUGH Family of Codes
Energy Technology Data Exchange (ETDEWEB)
Freeman, C. M.; Boyle, K. L.; Reagan, M.; Johnson, J.; Rycroft, C.; Moridis, G. J.
2013-09-30
Few tools exist for creating and visualizing complex three-dimensional simulation meshes, and these have limitations that restrict their application to particular geometries and circumstances. Mesh generation needs to trend toward ever more general applications. To that end, we have developed MeshVoro, a tool that is based on the Voro (Rycroft 2009) library and is capable of generating complex threedimensional Voronoi tessellation-based (unstructured) meshes for the solution of problems of flow and transport in subsurface geologic media that are addressed by the TOUGH (Pruess et al. 1999) family of codes. MeshVoro, which includes built-in data visualization routines, is a particularly useful tool because it extends the applicability of the TOUGH family of codes by enabling the scientifically robust and relatively easy discretization of systems with challenging 3D geometries. We describe several applications of MeshVoro. We illustrate the ability of the tool to straightforwardly transform a complex geological grid into a simulation mesh that conforms to the specifications of the TOUGH family of codes. We demonstrate how MeshVoro can describe complex system geometries with a relatively small number of grid blocks, and we construct meshes for geometries that would have been practically intractable with a standard Cartesian grid approach. We also discuss the limitations and appropriate applications of this new technology.
Mulder, Irene M; Deerenberg, Eva B; Bemelman, Willem A; Jeekel, Johannes; Lange, Johan F
2015-07-01
This experimental study investigates infectious complications and functional outcome of biological meshes in a contaminated environment. In 90 rats peritonitis was induced, and after 24 hours, a biological mesh was implanted intraperitoneally including 2 non-crosslinked mesh groups (Strattice and Surgisis) and 2 crosslinked mesh groups (CollaMendFM and Permacol). Sacrifice was after 90 and 180 days. More mesh infections occurred in crosslinked meshes compared with non-crosslinked meshes (70% vs 4%; P contaminated field was the highest in crosslinked meshes. All biological meshes showed poor incorporation, which makes long-term abdominal wall repair questionable. Copyright © 2015 Elsevier Inc. All rights reserved.
Adaptive Mesh Refinement for Characteristic Grids
Thornburg, Jonathan
2009-01-01
I consider techniques for Berger-Oliger adaptive mesh refinement (AMR) when numerically solving partial differential equations with wave-like solutions, using characteristic (double-null) grids. Such AMR algorithms are naturally recursive, and the best-known past Berger-Oliger characteristic AMR algorithm, that of Pretorius & Lehner (J. Comp. Phys. 198 (2004), 10), recurses on individual "diamond" characteristic grid cells. This leads to the use of fine-grained memory management, with individual grid cells kept in 2-dimensional linked lists at each refinement level. This complicates the implementation and adds overhead in both space and time. Here I describe a Berger-Oliger characteristic AMR algorithm which instead recurses on null \\emph{slices}. This algorithm is very similar to the usual Cauchy Berger-Oliger algorithm, and uses relatively coarse-grained memory management, allowing entire null slices to be stored stored in contiguous arrays in memory. The algorithm is very efficient in both space and ti...
Finite element differential forms on cubical meshes
Arnold, Douglas N
2012-01-01
We develop a family of finite element spaces of differential forms defined on cubical meshes in any number of dimensions. The family contains elements of all polynomial degrees and all form degrees. In two dimensions, these include the serendipity finite elements and the rectangular BDM elements. In three dimensions they include a recent generalization of the serendipity spaces, and new H(curl) and H(div) finite element spaces. Spaces in the family can be combined to give finite element subcomplexes of the de Rham complex which satisfy the basic hypotheses of the finite element exterior calculus, and hence can be used for stable discretization of a variety of problems. The construction and properties of the spaces are established in a uniform manner using finite element exterior calculus.
Parallel-In-Time For Moving Meshes
Energy Technology Data Exchange (ETDEWEB)
Falgout, R. D. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Manteuffel, T. A. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Southworth, B. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Schroder, J. B. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2016-02-04
With steadily growing computational resources available, scientists must develop e ective ways to utilize the increased resources. High performance, highly parallel software has be- come a standard. However until recent years parallelism has focused primarily on the spatial domain. When solving a space-time partial di erential equation (PDE), this leads to a sequential bottleneck in the temporal dimension, particularly when taking a large number of time steps. The XBraid parallel-in-time library was developed as a practical way to add temporal parallelism to existing se- quential codes with only minor modi cations. In this work, a rezoning-type moving mesh is applied to a di usion problem and formulated in a parallel-in-time framework. Tests and scaling studies are run using XBraid and demonstrate excellent results for the simple model problem considered herein.
Implicit compressible flow solvers on unstructured meshes
Nagaoka, Makoto; Horinouchi, Nariaki
1993-09-01
An implicit solver for compressible flows using Bi-CGSTAB method is proposed. The Euler equations are discretized with the delta-form by the finite volume method on the cell-centered triangular unstructured meshes. The numerical flux is calculated by Roe's upwind scheme. The linearized simultaneous equations with the irregular nonsymmetric sparse matrix are solved by the Bi-CGSTAB method with the preconditioner of incomplete LU factorization. This method is also vectorized by the multi-colored ordering. Although the solver requires more computational memory, it shows faster and more robust convergence than the other conventional methods: three-stage Runge-Kutta method, point Gauss-Seidel method, and Jacobi method for two-dimensional inviscid steady flows.
Moving Mesh Cosmology: Properties of Gas Disks
Torrey, Paul; Sijacki, Debora; Springel, Volker; Hernquist, Lars
2011-01-01
We compare the structural properties of galaxies formed in cosmological simulations using the smoothed particle hydrodynamics (SPH) code GADGET with those using the moving-mesh code AREPO. Both codes employ identical gravity solvers and the same sub-resolution physics but use very different methods to track the hydrodynamic evolution of gas. This permits us to isolate the effects of the hydro solver on the formation and evolution of galactic disks. In a matching sample of GADGET and AREPO haloes we fit simulated gas disks with exponential profiles. We find that the cold gas disks formed using AREPO have systematically larger disk scale lengths and higher specific angular momenta than their GADGET counterparts. The reason for these differences is rooted in the inaccuracies of the SPH solver and calls for a reassessment of commonly adopted feedback prescriptions in cosmological simulations.
Laparoscopic sacrocolpopexy versus transvaginal mesh for recurrent pelvic organ prolapse.
Iglesia, Cheryl B; Hale, Douglass S; Lucente, Vincent R
2013-03-01
Both expert surgeons agree with the following: (1) Surgical mesh, whether placed laparoscopically or transvaginally, is indicated for pelvic floor reconstruction in cases involving recurrent advanced pelvic organ prolapse. (2) Procedural expertise and experience gained from performing a high volume of cases is fundamentally necessary. Knowledge of outcomes and complications from an individual surgeon's audit of cases is also needed when discussing the risks and benefits of procedures and alternatives. Yet controversy still exists on how best to teach new surgical techniques and optimal ways to efficiently track outcomes, including subjective and objective cure of prolapse as well as perioperative complications. A mesh registry will be useful in providing data needed for surgeons. Cost factors are also a consideration since laparoscopic and especially robotic surgical mesh procedures are generally more costly than transvaginal mesh kits when operative time, extra instrumentation and length of stay are included. Long-term outcomes, particularly for transvaginal mesh procedures, are lacking. In conclusion, all surgery poses risks; however, patients should be made aware of the pros and cons of various routes of surgery as well as the potential risks and benefits of using mesh. Surgeons should provide patients with honest information about their own experience implanting mesh and also their experience dealing with mesh-related complications.
Concomitant sublay mesh repair of umbilical hernia and abdominoplasty
2012-01-01
Concomitant mesh repair of large umbilical hernias and abdominoplasty pose a serious risk of devascularizing the umbilical stalk. A technique of placing mesh in a sublay manner, deep to the fascial defect, for an umbilical herniorrhaphy to avoid damage to the deep umbilical perforators during an abdominoplasty is described.
Scalable Video Streaming in Wireless Mesh Networks for Education
Liu, Yan; Wang, Xinheng; Zhao, Liqiang
2011-01-01
In this paper, a video streaming system for education based on a wireless mesh network is proposed. A wireless mesh network is a self-organizing, self-managing and reliable intelligent network, which allows educators to deploy a network quickly. Video streaming plays an important role in this system for multimedia data transmission. This new…
Water Penetration through a Superhydrophobic Mesh During a Drop Impact.
Ryu, Seunggeol; Sen, Prosenjit; Nam, Youngsuk; Lee, Choongyeop
2017-01-06
When a water drop impacts a mesh having submillimeter pores, a part of the drop penetrates through the mesh if the impact velocity is sufficiently large. Here we show that different surface wettability, i.e., hydrophobicity and superhydrophobicity, leads to different water penetration dynamics on a mesh during drop impact. We show, despite the water repellence of a superhydrophobic surface, that water can penetrate a superhydrophobic mesh more easily (i.e., at a lower impact velocity) over a hydrophobic mesh via a penetration mechanism unique to a superhydrophobic mesh. On a superhydrophobic mesh, the water penetration can occur during the drop recoil stage, which appears at a lower impact velocity than the critical impact velocity for water penetration right upon impact. We propose that this unique water penetration on a superhydrophobic mesh can be attributed to the combination of the hydrodynamic focusing and the momentum transfer from the water drop when it is about to bounce off the surface, at which point the water drop retrieves most of its kinetic energy due to the negligible friction on superhydrophobic surfaces.
Micro-mesh fabric pollination bags for switchgrass
Pollination bags for making controlled crosses between switchgrass plants were made from a polyester micro-mesh fabric with a mesh size of 41 µm which is smaller than the mean reported 43 µm diameter of switchgrass pollen. When used in paired plant crosses between switchgrass plants, the mean amoun...
Mesh Processing in Medical-Image Analysis-a Tutorial
DEFF Research Database (Denmark)
Levine, Joshua A.; Paulsen, Rasmus Reinhold; Zhang, Yongjie
2012-01-01
Medical-image analysis requires an understanding of sophisticated scanning modalities, constructing geometric models, building meshes to represent domains, and downstream biological applications. These four steps form an image-to-mesh pipeline. For research in this field to progress, the imaging...
SUPERCONVERGENCE ANALYSIS OF A NONCONFORMING TRIANGULAR ELEMENT ON ANISOTROPIC MESHES
Institute of Scientific and Technical Information of China (English)
Dongyang SHI; Hui LIANG; Caixia WANG
2007-01-01
The class of anisotropic meshes we conceived abandons the regular assumption. Some distinct properties of Carey's element are used to deal with the superconvergence for a class of twodimensional second-order elliptic boundary value problems on anisotropic meshes. The optimal results are obtained and numerical examples are given to confirm our theoretical analysis.
Sen migration af mesh til colon efter laparoskopisk hernieoperation
DEFF Research Database (Denmark)
Rasmussen, Martin; Bisgaard, Thue
2014-01-01
Long-term complications after laparoscopic ventral hernia repair with mesh reinforcement are not well documented in the literature. We describe a case of a 63-year-old woman with repeated hernia operations due to a ventral hernia, which ultimately was complicated with mesh migration...
Late mesh migration into the colon after laparoscopic herniotomy
DEFF Research Database (Denmark)
Rasmussen, Martin; Bisgaard, Thue
2014-01-01
Long-term complications after laparoscopic ventral hernia repair with mesh reinforcement are not well documented in the literature. We describe a case of a 63-year-old woman with repeated hernia operations due to a ventral hernia, which ultimately was complicated with mesh migration...
Explicit inverse distance weighting mesh motion for coupled problems
Witteveen, J.A.S.; Bijl, H.
2009-01-01
An explicit mesh motion algorithm based on inverse distance weighting interpolation is presented. The explicit formulation leads to a fast mesh motion algorithm and an easy implementation. In addition, the proposed point-by-point method is robust and flexible in case of large deformations, hanging n
Conformal mesh deformations with Möbius transformations
Vaxman, Amir; Müller, Christian; Weber, Ofir
2015-01-01
We establish a framework to design triangular and circular polygonal meshes by using face-based compatible Möbius transformations. Embracing the viewpoint of surfaces from circles, we characterize discrete conformality for such meshes, in which the invariants are circles, cross-ratios, and mutual in
Sending policies in dynamic wireless mesh using network coding
DEFF Research Database (Denmark)
Pandi, Sreekrishna; Fitzek, Frank; Pihl, Jeppe
2015-01-01
This paper demonstrates the quick prototyping capabilities of the Python-Kodo library for network coding based performance evaluation and investigates the problem of data redundancy in a network coded wireless mesh with opportunistic overhearing. By means of several wireless meshed architectures ...
Tangle-Free Finite Element Mesh Motion for Ablation Problems
Droba, Justin
2016-01-01
In numerical simulations involving boundaries that evolve in time, the primary challenge is updating the computational mesh to reflect the physical changes in the domain. In particular, the fundamental objective for any such \\mesh motion" scheme is to maintain mesh quality and suppress unphysical geometric anamolies and artifacts. External to a physical process of interest, mesh motion is an added component that determines the specifics of how to move the mesh given certain limited information from the main system. This paper develops a set of boundary conditions designed to eliminate tangling and internal collision within the context of PDE-based mesh motion (linear elasticity). These boundary conditions are developed for two- and three-dimensional meshes. The paper presents detailed algorithms for commonly occuring topological scenarios and explains how to apply them appropriately. Notably, the techniques discussed herein make use of none of the specifics of any particular formulation of mesh motion and thus are more broadly applicable. The two-dimensional algorithms are validated by an extensive verification procedure. Finally, many examples of diverse geometries in both two- and three-dimensions are shown to showcase the capabilities of the tangle-free boundary conditions.
Communication performance of the Intel Touchstone DELTA mesh
Energy Technology Data Exchange (ETDEWEB)
Dunigan, T.H.
1992-01-01
The communication performance of the i860-based Intel DELTA mesh supercomputer is compared with the Intel iPSC/860 hypercube and the Ncube 6400 hypercube. Single and multiple hop communication bandwidth and latencies are measured. Concurrent communication speeds and speed under network load are also measured. File I/O performance of the mesh-attached Concurrent File System is measured.
On Fault Tolerance of 3-Dimensional Mesh Networks
Institute of Scientific and Technical Information of China (English)
Gao-Cai Wang; Jian-Er Chen; Guo-Jun Wang
2004-01-01
In this paper, the concept of k-submesh and k-submesh connectivity fault tolerance model is proposed. And the fault tolerance of 3-D mesh networks is studied under a more realistic model in which each network node has an independent failure probability. It is first observed that if the node failure probability is fixed, then the connectivity probability of 3-D mesh networks can be arbitrarily small when the network size is sufficiently large. Thus, it is practically important for multicomputer system manufacturer to determine the upper bound for node failure probability when the probability of network connectivity and the network size are given.A novel technique is developed to formally derive lower bounds on the connectivity probability for 3-D mesh networks. The study shows that 3-D mesh networks of practical size can tolerate a large number of faulty nodes thus are reliable enough for multicomputer systems. A number of advantages of 3-D mesh networks over other popular network topologies are given. Compared to 2-D mesh networks, 3-D mesh networks are much stronger in tolerating faulty nodes, while for practical network size, the fault tolerance of 3-D mesh networks is comparable with that of hypercube networks but enjoys much lower node degree.
Scalable Video Streaming in Wireless Mesh Networks for Education
Liu, Yan; Wang, Xinheng; Zhao, Liqiang
2011-01-01
In this paper, a video streaming system for education based on a wireless mesh network is proposed. A wireless mesh network is a self-organizing, self-managing and reliable intelligent network, which allows educators to deploy a network quickly. Video streaming plays an important role in this system for multimedia data transmission. This new…
Carpet: Adaptive Mesh Refinement for the Cactus Framework
Schnetter, Erik; Hawley, Scott; Hawke, Ian
2016-11-01
Carpet is an adaptive mesh refinement and multi-patch driver for the Cactus Framework (ascl:1102.013). Cactus is a software framework for solving time-dependent partial differential equations on block-structured grids, and Carpet acts as driver layer providing adaptive mesh refinement, multi-patch capability, as well as parallelization and efficient I/O.
Real-time acquisition of compact volumetric maps
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
Buildingcompact 3D maps of the environment models has become an important research topic. This paper presented an efficient stream decimation algorithm of massive meshes. The algorithm adapted the pre-processing step leading to lower in-core memory consumption. This algorithm is applied to reconstructing compact terrain with mobile robot, achieving satisfying results.
3D level set methods for evolving fronts on tetrahedral meshes with adaptive mesh refinement
Morgan, Nathaniel R.; Waltz, Jacob I.
2017-05-01
The level set method is commonly used to model dynamically evolving fronts and interfaces. In this work, we present new methods for evolving fronts with a specified velocity field or in the surface normal direction on 3D unstructured tetrahedral meshes with adaptive mesh refinement (AMR). The level set field is located at the nodes of the tetrahedral cells and is evolved using new upwind discretizations of Hamilton-Jacobi equations combined with a Runge-Kutta method for temporal integration. The level set field is periodically reinitialized to a signed distance function using an iterative approach with a new upwind gradient. The details of these level set and reinitialization methods are discussed. Results from a range of numerical test problems are presented.
An unstructured-mesh atmospheric model for nonhydrostatic dynamics: Towards optimal mesh resolution
Szmelter, Joanna; Zhang, Zhao; Smolarkiewicz, Piotr K.
2015-08-01
The paper advances the limited-area anelastic model (Smolarkiewicz et al. (2013) [45]) for investigation of nonhydrostatic dynamics in mesoscale atmospheric flows. New developments include the extension to a tetrahedral-based median-dual option for unstructured meshes and a static mesh adaptivity technique using an error indicator based on inherent properties of the Multidimensional Positive Definite Advection Transport Algorithm (MPDATA). The model employs semi-implicit nonoscillatory forward-in-time integrators for soundproof PDEs, built on MPDATA and a robust non-symmetric Krylov-subspace elliptic solver. Finite-volume spatial discretisation adopts an edge-based data structure. Simulations of stratified orographic flows and the associated gravity-wave phenomena in media with uniform and variable dispersive properties verify the advancement and demonstrate the potential of heterogeneous anisotropic discretisation with large variation in spatial resolution for study of complex stratified flows that can be computationally unattainable with regular grids.
Experimental studies of micromegas detectors with different micro-meshes
Institute of Scientific and Technical Information of China (English)
YANG He-Run; HU Bi-Tao; ZHANG Xiao-Dang; ZOU Chun-Yan
2011-01-01
The structure of micromegas (micro-mesh gaseous structure) detectors with different micro-meshes of stainless steel wire woven netting and Ni foil has been presented. The counting rates, energy resolution, gain, discharge probability and time resolution have been measured. Wider counter plateaus and gain for the developed detector were obtained. Excellent energy resolution of the micromegas detector, 17% (FWHM) based on Ni foil micro-mesh and 25% (FWHM) based on stainless steel wire woven netting micro-mesh, has been obtained for the 5.9 keV photon peak of the 55Fe X-ray source in an Ar/CO2(10%) gas mixture. The best time resolution at -620 V micro-mesh voltage and -870 V drift voltage is 14.8 ns for cosmic rays in an Ar/CO2 (10%) gas mixture. These results satisfy the basic demand of the micromegas detector preliminary design.
Migrated Mesh Plug Masquerading as a Bladder Tumor
Dajani, Daoud; Aron, Monish
2017-01-01
Abstract Background: The purpose of this case presentation is to demonstrate how erosion of mesh into the bladder can initially present with the same symptoms as bladder malignancy. Case Presentation: A 62-year-old Hispanic male presented with 2 years of hematuria along with imaging concerning for a bladder tumor. The patient underwent cystoscopy with biopsy of a lesion at the anterior bladder. It was ultimately determined that a mesh plug from a prior hernia repair had migrated into the bladder. The mesh plug was excised using the Da Vinci Si robot, which allowed for efficient mobilization of the bladder and other anatomic structures, as well as rapid recovery. Conclusion: Our case demonstrates the need to consider mesh erosion as a cause of hematuria and, furthermore, shows how the robotic approach can help facilitate excision of migrated mesh into the bladder. PMID:28164159
Adaptive-mesh algorithms for computational fluid dynamics
Powell, Kenneth G.; Roe, Philip L.; Quirk, James
1993-01-01
The basic goal of adaptive-mesh algorithms is to distribute computational resources wisely by increasing the resolution of 'important' regions of the flow and decreasing the resolution of regions that are less important. While this goal is one that is worthwhile, implementing schemes that have this degree of sophistication remains more of an art than a science. In this paper, the basic pieces of adaptive-mesh algorithms are described and some of the possible ways to implement them are discussed and compared. These basic pieces are the data structure to be used, the generation of an initial mesh, the criterion to be used to adapt the mesh to the solution, and the flow-solver algorithm on the resulting mesh. Each of these is discussed, with particular emphasis on methods suitable for the computation of compressible flows.
Feature-preserving surface mesh smoothing via suboptimal Delaunay triangulation.
Gao, Zhanheng; Yu, Zeyun; Holst, Michael
2013-01-01
A method of triangular surface mesh smoothing is presented to improve angle quality by extending the original optimal Delaunay triangulation (ODT) to surface meshes. The mesh quality is improved by solving a quadratic optimization problem that minimizes the approximated interpolation error between a parabolic function and its piecewise linear interpolation defined on the mesh. A suboptimal problem is derived to guarantee a unique, analytic solution that is significantly faster with little loss in accuracy as compared to the optimal one. In addition to the quality-improving capability, the proposed method has been adapted to remove noise while faithfully preserving sharp features such as edges and corners of a mesh. Numerous experiments are included to demonstrate the performance of the method.
Challenges in Second-Generation Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
Pescapé Antonio
2008-01-01
Full Text Available Wireless mesh networks have the potential to provide ubiquitous high-speed Internet access at low costs. The good news is that initial deployments of WiFi meshes show the feasibility of providing ubiquitous Internet connectivity. However, their performance is far below the necessary and achievable limit. Moreover, users' subscription in the existing meshes is dismal even though the technical challenges to get connectivity are low. This paper provides an overview of the current status of mesh networks' deployment, and highlights the technical, economical, and social challenges that need to be addressed in the next years. As a proof-of-principle study, we discuss the above-mentioned challenges with reference to three real networks: (i MagNets, an operator-driven planned two-tier mesh network; (ii Berlin Freifunk network as a pure community-driven single-tier network; (iii Weimar Freifunk network, also a community-driven but two-tier network.
Challenges in Second-Generation Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
Thomas Huehn
2008-10-01
Full Text Available Wireless mesh networks have the potential to provide ubiquitous high-speed Internet access at low costs. The good news is that initial deployments of WiFi meshes show the feasibility of providing ubiquitous Internet connectivity. However, their performance is far below the necessary and achievable limit. Moreover, users' subscription in the existing meshes is dismal even though the technical challenges to get connectivity are low. This paper provides an overview of the current status of mesh networks' deployment, and highlights the technical, economical, and social challenges that need to be addressed in the next years. As a proof-of-principle study, we discuss the above-mentioned challenges with reference to three real networks: (i MagNets, an operator-driven planned two-tier mesh network; (ii Berlin Freifunk network as a pure community-driven single-tier network; (iii Weimar Freifunk network, also a community-driven but two-tier network.
Use of mesh in laparoscopic paraesophageal hernia repair
DEFF Research Database (Denmark)
Müller-Stich, Beat P.; Kenngott, Hannes G.; Gondan, Matthias;
2015-01-01
Introduction. Mesh augmentation seems to reduce recurrences following laparoscopic paraesophageal hernia repair (LPHR). However, there is an uncertain risk of mesh-associated complications. Risk-benefit analysis might solve the dilemma. Materials and Methods. A systematic literature search...... was performed to identify randomized controlled trials (RCTs) and observational clinical studies (OCSs) comparing laparoscopic mesh-augmented hiatoplasty (LMAH) with laparoscopic mesh-free hiatoplasty (LH) with regard to recurrences and complications. Random effects meta-analyses were performed to determine...... potential benefits of LMAH. All data regarding LMAH were used to estimate risk of mesh-associated complications. Risk-benefit analysis was performed using a Markov Monte Carlo decision-analytic model. Results. Meta-analysis of 3 RCTs and 9 OCSs including 915 patients revealed a significantly lower...
Comparison and combination of several MeSH indexing approaches.
Yepes, Antonio Jose Jimeno; Mork, James G; Demner-Fushman, Dina; Aronson, Alan R
2013-01-01
MeSH indexing of MEDLINE is becoming a more difficult task for the group of highly qualified indexing staff at the US National Library of Medicine, due to the large yearly growth of MEDLINE and the increasing size of MeSH. Since 2002, this task has been assisted by the Medical Text Indexer or MTI program. We extend previous machine learning analysis by adding a more diverse set of MeSH headings targeting examples where MTI has been shown to perform poorly. Machine learning algorithms exceed MTI's performance on MeSH headings that are used very frequently and headings for which the indexing frequency is very low. We find that when we combine the MTI suggestions and the prediction of the learning algorithms, the performance improves compared to any single method for most of the evaluated MeSH headings.
Finite Element Meshes Auto-Generation for the Welted Bifurcation
Institute of Scientific and Technical Information of China (English)
YUANMei; LIYa-ping
2004-01-01
In this paper, firstly, a mathematical model for a specific kind of welted bifurcation is established, the parametric equation for the intersecting curve is resulted in. Secondly, a method for partitioning finite element meshes of the welted bifurcation is put forward, its main idea is that developing the main pipe surface and the branch pipe surface respectively, dividing meshes on each developing plane and obtaining meshes points, then transforming their plane coordinates into space coordinates. Finally, an applied program for finite element meshes auto-generation is simply introduced, which adopt ObjectARX technique and its running result can be shown in AutoCAD. The meshes generated in AutoCAD can be exported conveniently to most of finite element analysis soft wares, and the finite element computing result can satisfy the engineering precision requirement.
Kinetic Solvers with Adaptive Mesh in Phase Space
Arslanbekov, Robert R; Frolova, Anna A
2013-01-01
An Adaptive Mesh in Phase Space (AMPS) methodology has been developed for solving multi-dimensional kinetic equations by the discrete velocity method. A Cartesian mesh for both configuration (r) and velocity (v) spaces is produced using a tree of trees data structure. The mesh in r-space is automatically generated around embedded boundaries and dynamically adapted to local solution properties. The mesh in v-space is created on-the-fly for each cell in r-space. Mappings between neighboring v-space trees implemented for the advection operator in configuration space. We have developed new algorithms for solving the full Boltzmann and linear Boltzmann equations with AMPS. Several recent innovations were used to calculate the full Boltzmann collision integral with dynamically adaptive mesh in velocity space: importance sampling, multi-point projection method, and the variance reduction method. We have developed an efficient algorithm for calculating the linear Boltzmann collision integral for elastic and inelastic...
A Metropolis Approach for Mesh Router Nodes placement in Rural Wireless Mesh Networks
Fendji, Jean Louis Ebongue Kedieng; Thron, Christopher; Nlong, Jean Michel
2015-01-01
Wireless mesh networks appear as an appealing solution to reduce the digital divide between rural and urban regions. However the placement of router nodes is still a critical issue when planning this type of network, especially in rural regions where we usually observe low density and sparse population. In this paper, we firstly provide a network model tied to rural regions by considering the area to cover as decomposed into a set of elementary areas which can be required or optional in terms...
A coarse-mesh nodal method-diffusive-mesh finite difference method
Energy Technology Data Exchange (ETDEWEB)
Joo, H.; Nichols, W.R.
1994-05-01
Modern nodal methods have been successfully used for conventional light water reactor core analyses where the homogenized, node average cross sections (XSs) and the flux discontinuity factors (DFs) based on equivalence theory can reliably predict core behavior. For other types of cores and other geometries characterized by tightly-coupled, heterogeneous core configurations, the intranodal flux shapes obtained from a homogenized nodal problem may not accurately portray steep flux gradients near fuel assembly interfaces or various reactivity control elements. This may require extreme values of DFs (either very large, very small, or even negative) to achieve a desired solution accuracy. Extreme values of DFs, however, can disrupt the convergence of the iterative methods used to solve for the node average fluxes, and can lead to a difficulty in interpolating adjacent DF values. Several attempts to remedy the problem have been made, but nothing has been satisfactory. A new coarse-mesh nodal scheme called the Diffusive-Mesh Finite Difference (DMFD) technique, as contrasted with the coarse-mesh finite difference (CMFD) technique, has been developed to resolve this problem. This new technique and the development of a few-group, multidimensional kinetics computer program are described in this paper.
MS, Suzie Aparicio; Welch Bacon, Cailee E.; Parsons, John T.; Bay, R. Curtis; Cohen, Randy P.; DeZeeuw, Terry; McLeod, Tamara C. Valovich
2015-01-01
Context The “Appropriate Medical Coverage for Intercollegiate Athletics” (AMCIA) document was created to support assessment and calculation of athletic training personnel requirements. However, little is known regarding disparities between current and recommended staffing practices. Objective To identify the staffing and employment characteristics of athletic health care services at Football Bowl Subdivision-level institutions. Design Cross-sectional study. Setting Web-based survey. Patients or Other Participants Head athletic trainers and athletic training staff members who were knowledgeable about budget and staff. Main Outcome Measure(s) The survey, Assessment of Staffing Levels at National Collegiate Athletic Association Football Bowl Subdivision-Level Institutions, was used to evaluate personal, university, and staff demographics; staffing and employment topics; and AMCIA variables and use. Results The survey was accessed and partially completed by 104 individuals (response rate = 84.6%). A total of 79 athletic trainers (response rate = 76%) completed the entire survey. One-third of the respondents (34.2%, n = 26) met the recommended number of full-time equivalents (FTEs) for football, two-thirds of the respondents (65.7%, n = 50) failed to meet the recommendation, and 26.2% (n = 27) were missing data needed for FTE calculation. Among those who did not meet the recommended FTEs (n = 50), 38.0% (n = 19) were within 1 FTE of being compliant, 26.0% (n = 13) were within 2 FTEs, and 24.0% (n = 12) were within 3 FTEs. About one-third of respondents (35.9%, n = 37) reported not using the AMCIA, citing lack of funding (29.7%, n = 11), lack of administrative support (21.6%, n = 8), and other reasons (37.8%, n = 14). Conclusions The majority of institutions that used the AMCIA were able to provide justification for staffing. For most of the institutions that failed to meet their recommendation, adding 1–3 FTE athletic trainers for football would change their
Szeberényi, Jozsef; Bradak-Hayashi, Balázs; Kiss, Klaudia; Kovács, József; Varga, György; Balázs, Réka; Szalai, Zoltán; Viczián, István
2016-04-01
The different varieties of loess (and intercalated paleosol layers) together constitute one of the most widespread terrestrial sediments, which was deposited, altered, and redeposited in the course of the changing climatic conditions of the Pleistocene. To reveal more information about Pleistocene climate cycles and/or environments the detailed lithostratigraphical subdivision and classification of the loess variations and paleosols are necessary. Beside the numerous method such as various field measurements, semi-quantitative tests and laboratory investigations, diffuse reflectance spectroscopy (DRS) is one of the well applied method on loess/paleosol sequences. Generally, DRS has been used to separate the detrital and pedogenic mineral component of the loess sections by the hematite/goethite ratio. DRS also has been applied as a joint method of various environmental magnetic investigations such as magnetic susceptibility- and isothermal remanent magnetization measurements. In our study the so-called "combined reflectance stratigraphy method" were developed. At First, complex mathematical method was applied to compare the results of the spectral reflectance measurements. One of the most preferred multivariate methods is cluster analysis. Its scope is to group and compare the loess variations and paleosol based on the similarity and common properties of their reflectance curves. In the Second, beside the basic subdivision of the profiles by the different reflectance curves of the layers, the most characteristic wavelength section of the reflectance curve was determined. This sections played the most important role during the classification of the different materials of the section. The reflectance value of individual samples, belonged to the characteristic wavelength were depicted in the function of depth and well correlated with other proxies like grain size distribution and magnetic susceptibility data. The results of the correlation showed the significance of
Robust, multidimensional mesh motion based on Monge-Kantorovich equidistribution
Energy Technology Data Exchange (ETDEWEB)
Delzanno, G L [Los Alamos National Laboratory; Finn, J M [Los Alamos National Laboratory
2009-01-01
Mesh-motion (r-refinement) grid adaptivity schemes are attractive due to their potential to minimize the numerical error for a prescribed number of degrees of freedom. However, a key roadblock to a widespread deployment of the technique has been the formulation of robust, reliable mesh motion governing principles, which (1) guarantee a solution in multiple dimensions (2D and 3D), (2) avoid grid tangling (or folding of the mesh, whereby edges of a grid cell cross somewhere in the domain), and (3) can be solved effectively and efficiently. In this study, we formulate such a mesh-motion governing principle, based on volume equidistribution via Monge-Kantorovich optimization (MK). In earlier publications [1, 2], the advantages of this approach in regards to these points have been demonstrated for the time-independent case. In this study, demonstrate that Monge-Kantorovich equidistribution can in fact be used effectively in a time stepping context, and delivers an elegant solution to the otherwise pervasive problem of grid tangling in mesh motion approaches, without resorting to ad-hoc time-dependent terms (as in moving-mesh PDEs, or MMPDEs [3, 4]). We explore two distinct r-refinement implementations of MK: direct, where the current mesh relates to an initial, unchanging mesh, and sequential, where the current mesh is related to the previous one in time. We demonstrate that the direct approach is superior in regards to mesh distortion and robustness. The properties of the approach are illustrated with a paradigmatic hyperbolic PDE, the advection of a passive scalar. Imposed velocity flow fields or varying vorticity levels and flow shears are considered.
Resorbable biosynthetic mesh for crural reinforcement during hiatal hernia repair.
Alicuben, Evan T; Worrell, Stephanie G; DeMeester, Steven R
2014-10-01
The use of mesh to reinforce crural closure during hiatal hernia repair is controversial. Although some studies suggest that using synthetic mesh can reduce recurrence, synthetic mesh can erode into the esophagus and in our opinion should be avoided. Studies with absorbable or biologic mesh have not proven to be of benefit for recurrence. The aim of this study was to evaluate the outcome of hiatal hernia repair with modern resorbable biosynthetic mesh in combination with adjunct tension reduction techniques. We retrospectively analyzed all patients who had crural reinforcement during repair of a sliding or paraesophageal hiatal hernia with Gore BioA resorbable mesh. Objective follow-up was by videoesophagram and/or esophagogastroduodenoscopy. There were 114 patients. The majority of operations (72%) were laparoscopic primary repairs with all patients receiving a fundoplication. The crura were closed primarily in all patients and reinforced with a BioA mesh patch. Excessive tension prompted a crural relaxing incision in four per cent and a Collis gastroplasty in 39 per cent of patients. Perioperative morbidity was minor and unrelated to the mesh. Median objective follow-up was one year, but 18 patients have objective follow-up at two or more years. A recurrent hernia was found in one patient (0.9%) three years after repair. The use of crural relaxing incisions and Collis gastroplasty in combination with crural reinforcement with resorbable biosynthetic mesh is associated with a low early hernia recurrence rate and no mesh-related complications. Long-term follow-up will define the role of these techniques for hiatal hernia repair.
Pulse sequence for dynamic volumetric imaging of hyperpolarized metabolic products
Cunningham, Charles H.; Chen, Albert P.; Lustig, Michael; Hargreaves, Brian A.; Lupo, Janine; Xu, Duan; Kurhanewicz, John; Hurd, Ralph E.; Pauly, John M.; Nelson, Sarah J.; Vigneron, Daniel B.
2008-07-01
Dynamic nuclear polarization and dissolution of a 13C-labeled substrate enables the dynamic imaging of cellular metabolism. Spectroscopic information is typically acquired, making the acquisition of dynamic volumetric data a challenge. To enable rapid volumetric imaging, a spectral-spatial excitation pulse was designed to excite a single line of the carbon spectrum. With only a single resonance present in the signal, an echo-planar readout trajectory could be used to resolve spatial information, giving full volume coverage of 32 × 32 × 16 voxels every 3.5 s. This high frame rate was used to measure the different lactate dynamics in different tissues in a normal rat model and a mouse model of prostate cancer.
Nonrigid registration of volumetric images using ranked order statistics
DEFF Research Database (Denmark)
Tennakoon, Ruwan; Bab-Hadiashar, Alireza; Cao, Zhenwei
2014-01-01
Non-rigid image registration techniques using intensity based similarity measures are widely used in medical imaging applications. Due to high computational complexities of these techniques, particularly for volumetric images, finding appropriate registration methods to both reduce the computation...... burden and increase the registration accuracy has become an intensive area of research. In this paper we propose a fast and accurate non-rigid registration method for intra-modality volumetric images. Our approach exploits the information provided by an order statistics based segmentation method, to find...... the important regions for registration and use an appropriate sampling scheme to target those areas and reduce the registration computation time. A unique advantage of the proposed method is its ability to identify the point of diminishing returns and stop the registration process. Our experiments...