Energy Technology Data Exchange (ETDEWEB)
Lober, R.R.; Tautges, T.J.; Vaughan, C.T.
1997-03-01
Paving is an automated mesh generation algorithm which produces all-quadrilateral elements. It can additionally generate these elements in varying sizes such that the resulting mesh adapts to a function distribution, such as an error function. While powerful, conventional paving is a very serial algorithm in its operation. Parallel paving is the extension of serial paving into parallel environments to perform the same meshing functions as conventional paving only on distributed, discretized models. This extension allows large, adaptive, parallel finite element simulations to take advantage of paving`s meshing capabilities for h-remap remeshing. A significantly modified version of the CUBIT mesh generation code has been developed to host the parallel paving algorithm and demonstrate its capabilities on both two dimensional and three dimensional surface geometries and compare the resulting parallel produced meshes to conventionally paved meshes for mesh quality and algorithm performance. Sandia`s {open_quotes}tiling{close_quotes} dynamic load balancing code has also been extended to work with the paving algorithm to retain parallel efficiency as subdomains undergo iterative mesh refinement.
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.
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.
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...
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
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!
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.
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.
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.
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.
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.
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.
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.
An Implementation and Parallelization of the Scale Space Meshing Algorithm
Directory of Open Access Journals (Sweden)
Julie Digne
2015-11-01
Full Text Available Creating an interpolating mesh from an unorganized set of oriented points is a difficult problemwhich is often overlooked. Most methods focus indeed on building a watertight smoothed meshby defining some function whose zero level set is the surface of the object. However in some casesit is crucial to build a mesh that interpolates the points and does not fill the acquisition holes:either because the data are sparse and trying to fill the holes would create spurious artifactsor because the goal is to explore visually the data exactly as they were acquired without anysmoothing process. In this paper we detail a parallel implementation of the Scale-Space Meshingalgorithm, which builds on the scale-space framework for reconstructing a high precision meshfrom an input oriented point set. This algorithm first smoothes the point set, producing asingularity free shape. It then uses a standard mesh reconstruction technique, the Ball PivotingAlgorithm, to build a mesh from the smoothed point set. The final step consists in back-projecting the mesh built on the smoothed positions onto the original point set. The result ofthis process is an interpolating, hole-preserving surface mesh reconstruction.
Efficient Minimum Spanning Tree Algorithms on the Reconfigurable Mesh
Institute of Scientific and Technical Information of China (English)
万颖瑜; 许胤龙; 顾晓东; 陈国良
2000-01-01
he reconfigurable mesh consists of an array of processors interconnected by a reconfigurable bus system. The bus system can be used to dynamically obtain various interconnection patterns among the processors. Recently, this model has attracted a lot of attention. In this paper, two efficient algorithms are proposed for computing the minimum spanning tree of an n-vertex undirected graph. One runs on an n×n reconfigurable mesh with time complexity of O(log2 n). The other runs with time complexity of O(log n) on an n1+ε×n reconfigurable mesh, where 0 < e < I is a constant. All these improve the previously known results on the reconfigurable mesh.
Quadratic Error Metric Mesh Simplification Algorithm Based on Discrete Curvature
Directory of Open Access Journals (Sweden)
Li Yao
2015-01-01
Full Text Available Complex and highly detailed polygon meshes have been adopted for model representation in many areas of computer graphics. Existing works mainly focused on the quadric error metric based complex models approximation, which has not taken the retention of important model details into account. This may lead to visual degeneration. In this paper, we improve Garland and Heckberts’ quadric error metric based algorithm by using the discrete curvature to reserve more features for mesh simplification. Our experiments on various models show that the geometry and topology structure as well as the features of the original models are precisely retained by employing discrete curvature.
Block-Structured Adaptive Mesh Refinement Algorithms for Vlasov Simulation
Hittinger, J A F
2012-01-01
Direct discretization of continuum kinetic equations, like the Vlasov equation, are under-utilized because the distribution function generally exists in a high-dimensional (>3D) space and computational cost increases geometrically with dimension. We propose to use high-order finite-volume techniques with block-structured adaptive mesh refinement (AMR) to reduce the computational cost. The primary complication comes from a solution state comprised of variables of different dimensions. We develop the algorithms required to extend standard single-dimension block structured AMR to the multi-dimension case. Specifically, algorithms for reduction and injection operations that transfer data between mesh hierarchies of different dimensions are explained in detail. In addition, modifications to the basic AMR algorithm that enable the use of high-order spatial and temporal discretizations are discussed. Preliminary results for a standard 1D+1V Vlasov-Poisson test problem are presented. Results indicate that there is po...
Secure Multicast Routing Algorithm for Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
Rakesh Matam
2016-01-01
Full Text Available Multicast is an indispensable communication technique in wireless mesh network (WMN. Many applications in WMN including multicast TV, audio and video conferencing, and multiplayer social gaming use multicast transmission. On the other hand, security in multicast transmissions is crucial, without which the network services are significantly disrupted. Existing secure routing protocols that address different active attacks are still vulnerable due to subtle nature of flaws in protocol design. Moreover, existing secure routing protocols assume that adversarial nodes cannot share an out-of-band communication channel which rules out the possibility of wormhole attack. In this paper, we propose SEMRAW (SEcure Multicast Routing Algorithm for Wireless mesh network that is resistant against all known active threats including wormhole attack. SEMRAW employs digital signatures to prevent a malicious node from gaining illegitimate access to the message contents. Security of SEMRAW is evaluated using the simulation paradigm approach.
Fully implicit adaptive mesh refinement algorithm for reduced MHD
Philip, Bobby; Pernice, Michael; Chacon, Luis
2006-10-01
In the macroscopic simulation of plasmas, the numerical modeler is faced with the challenge of dealing with multiple time and length scales. Traditional approaches based on explicit time integration techniques and fixed meshes are not suitable for this challenge, as such approaches prevent the modeler from using realistic plasma parameters to keep the computation feasible. We propose here a novel approach, based on implicit methods and structured adaptive mesh refinement (SAMR). Our emphasis is on both accuracy and scalability with the number of degrees of freedom. As a proof-of-principle, we focus on the reduced resistive MHD model as a basic MHD model paradigm, which is truly multiscale. The approach taken here is to adapt mature physics-based technology to AMR grids, and employ AMR-aware multilevel techniques (such as fast adaptive composite grid --FAC-- algorithms) for scalability. We demonstrate that the concept is indeed feasible, featuring near-optimal scalability under grid refinement. Results of fully-implicit, dynamically-adaptive AMR simulations in challenging dissipation regimes will be presented on a variety of problems that benefit from this capability, including tearing modes, the island coalescence instability, and the tilt mode instability. L. Chac'on et al., J. Comput. Phys. 178 (1), 15- 36 (2002) B. Philip, M. Pernice, and L. Chac'on, Lecture Notes in Computational Science and Engineering, accepted (2006)
PHYSICAL VALUE MAPPING ALGORITHM OF MESH IN FINE CAE ANALYSIS OF AUTOMOBILE BODY STRUCTURE
Institute of Scientific and Technical Information of China (English)
Hu Ping; Gong Kejia; Bao Yidong
2005-01-01
A physical value mapping (PVM) algorithm based on finite element mesh from the stamped part in stamping process to the product is presented. In order to improve the efficiency of the PVM algorithm, a search way from the mesh of the product to the mesh of the stamped part will be adopted. At the same time, the search process is divided into two steps: entire search (ES) and local search (LS), which improve the searching efficiency. The searching area is enlarged to avoid missing projection elements in ES process. An arc-length method is introduced in LS process. The validity is confirmed by the results of the complex industry-forming product.
Deformable mesh registration for the validation of automatic target localization algorithms
Robertson, Scott; Weiss, Elisabeth; Hugo, Geoffrey D.
2013-01-01
Purpose: To evaluate deformable mesh registration (DMR) as a tool for validating automatic target registration algorithms used during image-guided radiation therapy. Methods: DMR was implemented in a hierarchical model, with rigid, affine, and B-spline transforms optimized in succession to register a pair of surface meshes. The gross tumor volumes (primary tumor and involved lymph nodes) were contoured by a physician on weekly CT scans in a cohort of lung cancer patients and converted to surface meshes. The meshes from weekly CT images were registered to the mesh from the planning CT, and the resulting registered meshes were compared with the delineated surfaces. Known deformations were also applied to the meshes, followed by mesh registration to recover the known deformation. Mesh registration accuracy was assessed at the mesh surface by computing the symmetric surface distance (SSD) between vertices of each registered mesh pair. Mesh registration quality in regions within 5 mm of the mesh surface was evaluated with respect to a high quality deformable image registration. Results: For 18 patients presenting with a total of 19 primary lung tumors and 24 lymph node targets, the SSD averaged 1.3 ± 0.5 and 0.8 ± 0.2 mm, respectively. Vertex registration errors (VRE) relative to the applied known deformation were 0.8 ± 0.7 and 0.2 ± 0.3 mm for the primary tumor and lymph nodes, respectively. Inside the mesh surface, corresponding average VRE ranged from 0.6 to 0.9 and 0.2 to 0.9 mm, respectively. Outside the mesh surface, average VRE ranged from 0.7 to 1.8 and 0.2 to 1.4 mm. The magnitude of errors generally increased with increasing distance away from the mesh. Conclusions: Provided that delineated surfaces are available, deformable mesh registration is an accurate and reliable method for obtaining a reference registration to validate automatic target registration algorithms for image-guided radiation therapy, specifically in regions on or near the target surfaces
A Parallel Algorithm for Adaptive Local Refinement of Tetrahedral Meshes Using Bisection
Institute of Scientific and Technical Information of China (English)
LinBo Zhang
2009-01-01
Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. This algorithm is used in PHG, Parallel Hierarchical Grid (http: //lsec. cc. ac. cn/phg/J, a toolbox under active development for parallel adaptive finite element solutions of partial differential equations. The algorithm proposed is characterized by allowing simultaneous refinement of submeshes to arbitrary levels before synchronization between submeshes and without the need of a central coordinator process for managing new vertices. Using the concept of canonical refinement, a simple proof of the independence of the resulting mesh on the mesh partitioning is given, which is useful in better understanding the behaviour of the bisectioning refinement procedure.AMS subject classifications: 65Y05, 65N50
Directory of Open Access Journals (Sweden)
K. Kumaravel
2015-05-01
Full Text Available Wireless Mesh Network (WMN uses the latest technology which helps in providing end users a high quality service referred to as the Internet’s “last mile”. Also considering WMN one of the most important technologies that are employed is multicast communication. Among the several issues routing which is significantly an important issue is addressed by every WMN technologies and this is done during the process of data transmission. The IEEE 802.11s Standard entails and sets procedures which need to be followed to facilitate interconnection and thus be able to devise an appropriate WMN. There has been introduction of several protocols by many authors which are mainly devised on the basis of machine learning and artificial intelligence. Multi-path routing may be considered as one such routing method which facilitates transmission of data over several paths, proving its capabilities as a useful strategy for achieving reliability in WMN. Though, multi-path routing in any manner cannot really guarantee deterministic transmission. As here there are multiple paths available for enabling data transmission from source to destination node. The algorithm that had been employed before in the studies conducted did not take in to consideration routing metrics which include energy aware metrics that are used for path selection during transferring of data. The following study proposes use of the hybrid multipath routing algorithm while taking in to consideration routing metrics which include energy, minimal loss for efficient path selection and transferring of data. Proposed algorithm here has two phases. In the first phase prim’s algorithm has been proposed so that in networks route discovery may be possible. For the second one the Hybrid firefly algorithm which is based on harmony search has been employed for selection of the most suitable and best through proper analysis of metrics which include energy awareness and minimal loss for every path that has
Optimization of the Compensation of a Meshed MV Network by a Modified Genetic Algorithm
DEFF Research Database (Denmark)
Nielsen, Hans; Paar, M.; Toman, P.
2007-01-01
The article discusses the utilization of a modified genetic algorithm (GA) for the optimization of the shunt compensation in meshed and radial MV distribution networks. The algorithm looks for minimum costs of the network power losses and minimum capital and operating costs of applied capacitors...
Optimization of the Compensation of a Meshed MV Network by a Modified Genetic Algorithm
DEFF Research Database (Denmark)
Nielsen, Hans; Paar, M.; Toman, P.
2007-01-01
The article discusses the utilization of a modified genetic algorithm (GA) for the optimization of the shunt compensation in meshed and radial MV distribution networks. The algorithm looks for minimum costs of the network power losses and minimum capital and operating costs of applied capacitors...
Criteria as a route to the routing algorithm in mesh networks with reduced interference
Directory of Open Access Journals (Sweden)
V. I. Pravda
2012-02-01
Full Text Available The paper presents the development assessment system tracks peredichi information in the mesh network and routing algorithm that uses data evaluation. Using this algorithm reduces the interference in the network and power consumption. Provides resistance to changes in the network.
Algorithm of Detecting and Filling Small Holes in Triangular Mesh Surface
Institute of Scientific and Technical Information of China (English)
ZHOU Dong-sheng; JIANG Chao; DONG Jing; LIU Rui
2014-01-01
In some scattered point cloud triangular mesh restoration algorithm, small triangular mesh holes problem will often affect the quality of the model. For small holes at the details, this paper propose a method for identifying and extracting hollow edge,and use a triangle growth way based on boundary edge angle to fill the empty void. First, according the relationship of the point, side and face of the triangle mesh model to identify the hole, then extracting the holes boundary edge and classifying it. Finally, using a triangle growth method based on holes boundary edge angle to fill each small holes separated from the boundary. Compared with other algorithm of filling holes, this method is high efficiency for small holes of smooth surface,and itimprovesthe quality of the triangular mesh model.
Smoothing Algorithm for Planar and Surface Mesh Based on Element Geometric Deformation
Directory of Open Access Journals (Sweden)
Shuli Sun
2015-01-01
Full Text Available Smoothing is one of the basic procedures for improvement of mesh quality. In this paper, a novel and efficient smoothing approach for planar and surface mesh based on element geometric deformation is developed. The presented approach involves two main stages. The first stage is geometric deformation of all the individual elements through a specially designed two-step stretching-shrinking operation (SSO, which is performed by moving the vertices of each element according to a certain rule in order to get better shape of the element. The second stage is to determine the position of each node of the mesh by a weighted average strategy according to quality changes of its adjacent elements. The suggested SSO-based smoothing algorithm works efficiently for triangular mesh and can be naturally expanded to quadrilateral mesh, arbitrary polygonal mesh, and mixed mesh. Combined with quadratic error metric (QEM, this approach may be also applied to improve the quality of surface mesh. The proposed method is simple to program and inherently very suitable for parallelization, especially on graphic processing unit (GPU. Results of numerical experiments demonstrate the effectiveness and potential of this method.
Novel algorithm of finding good candidate pre-configuration cycles in survivable WDM mesh network
Institute of Scientific and Technical Information of China (English)
ZHAO Tai-fei; YU Hong-fang; LI Le-min
2006-01-01
We present a novel algorithm of finding cycles, called the Fast Cycles Mining Algorithm (FCMA),for effi cient p-cycle network design in WDM networks. The algorithm is also flexible in that the number and the length of cycles generated are controlled by several input parameters. The problem of wavelength assign ment on p-cycle is considered in the algorithm. This algorithm is scalable and especially suitable for surviv able WDM mesh networks. Finally, the performance of the algorithm is gauged by running on some real world network topologies.
A Routing Algorithm in WDM Mesh Networks with Grooming Capacities
Institute of Scientific and Technical Information of China (English)
WANG Qiang-min; RONG Meng-tian; ZHU Hong-wen
2005-01-01
Most of the work in traffic grooming has been in the area of providing efficient network designs in Wavelength division multiplexing (WDM). The objective of these traffic grooming algorithms is to reduce the cost of overall networks.In this paper, a routing algorithm based on transiently chaotic neural network is proposed to solve the problem in WDM logical topology. The objectives of the routing algorithm are accommodating all traffic requirements and using less network resource. The simulation shows that the proposed algorithm is efficient in the routing selection, meanwhile the algorithm can use less network resource.
A Fast and Scalable Algorithm for Calculating the Achievable Capacity of a Wireless Mesh Network
2016-05-09
Garg and J. Koenemann, “Faster and simpler algorithms for multi- commodity flow and other fractional packing problems,” SIAM Journal on Computing, vol...A Fast and Scalable Algorithm for Calculating the Achievable Capacity of a Wireless Mesh Network Greg Kuperman, Jun Sun, Nathaniel M. Jones, and... algorithm to rapidly determine the maximum concurrent flow for an arbitrary number of unicast and multicast connections subject to arbitrary binary
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. ...
Channel Assignment Algorithms for MRMC Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
Mohammad A Hoque
2011-11-01
Full Text Available The wireless mesh networksare considered as one of the vital elements in today’s converged networks,providing high bandwidth and connectivity over large geographical areas. Mesh routers equipped with multiple radios can significantly overcome the capacity problem and increase the aggregate throughput of the network where single radio nodessuffer from performancedegradation. Moreover, the market availability of cheap radios or network interfaces also makes multi-radio solutions more feasible.A key issue in such networks is how to efficiently design a channel assignmentscheme that utilizes the available channels as well as increases overall performance of the network. This paper provides an overall review on the issues pertaining to the channel assignment in WMNs and the most relevant approaches and solutions developed in the area. They include design challenges, goals and criteria; routing considerations, graph based solutions and challenges of partially overlapped channels. We conclude that the assignment of channels to the radio interfaces continuously poses significant challenges. Many research issues remain open for further investigation.
Improved AFEM algorithm for bioluminescence tomography based on dual-mesh alternation strategy
Institute of Scientific and Technical Information of China (English)
Wei Li; Heng Zhao; Xiaochao Qu; Yanbin Hou; Xueli Chen; Duofang Chen; Xiaowei He; Qitan Zhang; Jimin Liang
2012-01-01
Adaptive finite element method (AFEM) is broadly adopted to recover the internal source in biological tissues.In this letter,a novel dual-mesh alternation strategy (dual-mesh AFEM) is developed for bioluminescence tomography.By comprehensively considering the error estimation of the finite element method solution on each mesh,two different adaptive strategies based on the error indicator of the reconstructed source and the photon flux density are used alternately in the process.Combined with the constantly adjusted permissible region in the adaptive process,the new algorithm can achieve a more accurate source location compared with the AFEM in the previous experiments.%Adaptive finite element method (AFEM) is broadly adopted to recover the internal source in biological tissues. In this letter, a novel dual-mesh alternation strategy (dual-mesh AFEM) is developed for biolumi-nescence tomography. By comprehensively considering the error estimation of the finite element method solution on each mesh, two different adaptive strategies based on the error indicator of the reconstructed source and the photon flux density are used alternately in the process. Combined with the constantly adjusted permissible region in the adaptive process, the new algorithm can achieve a more accurate source location compared with the AFEM in the previous experiments.
Institute of Scientific and Technical Information of China (English)
ZHOU Guoxiang; CHEN Yinchao; SHEN Guoqiang
2001-01-01
The paper presents an efficient andfast non-uniform, orthogonal mesh generation algo-rithm for the analysis and design of cylindrical mi-crowave devices and integrated circuits using thecylindrical finite-difference time-domain (CFDTD)methods. By using this algorithm, we can easily gen-erate a suitable CFDTD grid fitting for the devel-oped CFDTD Maxwell's solver. In the paper, wewill introduce in detail the algorithm and the graph-ical functions of the corresponding software package,CylinMesh. In addition, we will illustrate the algo-rithm by demonstrating various one, two, and three-dimensional grid patterns for a double-layered cylin-drical microstrip stepped-impedance low pass filter.
Multiobjective Genetic Algorithm for QoS Routing in Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
Wilson Soto
2013-11-01
Full Text Available The wireless mesh network is the type of network more used currently, the same as show interesting challenges in the topic of investigation. One of the challenges is as improve the capability of a network to provide better service to selected network traffic over various technologies. This requires keep in mind variables such as delay, jitter, packet loss and band width. This type of challenge where is necessary to optimize several variables becomes a combinatorial and computational complex problem. A method for solve this type of problems are the genetic algorithms. In this work we show a multiobjective genetic algorithm for quality of service in routing in wireless mesh networks. The proposed genetic algorithm besides has the advantage of use the Pareto frontier algorithm with the divide and conquer technique and the knee algorithm for to select an only solution of the problem. The paths found for the proposed algorithm demonstrate that achieve the purpose to improve the quality of service in routing in wireless mesh networks.
Mesh Partitioning Algorithm Based on Parallel Finite Element Analysis and Its Actualization
Directory of Open Access Journals (Sweden)
Lei Zhang
2013-01-01
Full Text Available In parallel computing based on finite element analysis, domain decomposition is a key technique for its preprocessing. Generally, a domain decomposition of a mesh can be realized through partitioning of a graph which is converted from a finite element mesh. This paper discusses the method for graph partitioning and the way to actualize mesh partitioning. Relevant softwares are introduced, and the data structure and key functions of Metis and ParMetis are introduced. The writing, compiling, and testing of the mesh partitioning interface program based on these key functions are performed. The results indicate some objective law and characteristics to guide the users who use the graph partitioning algorithm and software to write PFEM program, and ideal partitioning effects can be achieved by actualizing mesh partitioning through the program. The interface program can also be used directly by the engineering researchers as a module of the PFEM software. So that it can reduce the application of the threshold of graph partitioning algorithm, improve the calculation efficiency, and promote the application of graph theory and parallel computing.
Analysis and Algorithms for Partial Protection in Mesh Networks
2011-03-29
and leads to as much as 82% savings as compared to traditional full protection schemes. In Section II, the partial protection model is described. In...algorithms difficult. VI. CONCLUSION AN D FUTUR E DIR ECTIONS In this paper we have developed a mathematical model to provide deterministic partial...partial protection problem. REFERENCES [I] B. Mukherjee, "WDM Optical Communication Networks: Progress and challenges," IEEE Journal on Se/ ecred
Wang, Tianyang; Chu, Fulei; Han, Qinkai
2017-03-01
Identifying the differences between the spectra or envelope spectra of a faulty signal and a healthy baseline signal is an efficient planetary gearbox local fault detection strategy. However, causes other than local faults can also generate the characteristic frequency of a ring gear fault; this may further affect the detection of a local fault. To address this issue, a new filtering algorithm based on the meshing resonance phenomenon is proposed. In detail, the raw signal is first decomposed into different frequency bands and levels. Then, a new meshing index and an MRgram are constructed to determine which bands belong to the meshing resonance frequency band. Furthermore, an optimal filter band is selected from this MRgram. Finally, the ring gear fault can be detected according to the envelope spectrum of the band-pass filtering result.
Institute of Scientific and Technical Information of China (English)
KE Xi-zheng; HE Hua; WU Chang-li
2011-01-01
Aiming at the unidirectional links coming from nodes with different transmitting power and the obstacle blocking in UV mesh wireless communication network and the traditional ant colony algorithm only supporting bidirectional links, a new ant colony based routing algorithm with unidirectional link in UV mesh communication wireless network is proposed. The simulation results show that the proposed algorithm can improve the overall network connectivity and the survivability by supporting the combination of unidirectional link and bidirectional link.
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.
Incremental approach for radial basis functions mesh deformation with greedy algorithm
Selim, Mohamed M.; Koomullil, Roy P.; Shehata, Ahmed S.
2017-07-01
Mesh Deformation is an important element of any fluid-structure interaction simulation. In this article, a new methodology is presented for the deformation of volume meshes using incremental radial basis function (RBF) based interpolation. A greedy algorithm is used to select a small subset of the surface nodes iteratively. Two incremental approaches are introduced to solve the RBF system of equations: 1) block matrix inversion based approach and 2) modified LU decomposition approach. The use of incremental approach decreased the computational complexity of solving the system of equations within each greedy algorithm's iteration from O (n3) to O (n2). Results are presented from an accuracy study using specified deformations on a 2D surface. Mesh deformations for bending and twisting of a 3D rectangular supercritical wing have been demonstrated. Outcomes showed the incremental approaches reduce the CPU time up to 67% as compared to a traditional RBF matrix solver. Finally, the proposed mesh deformation approach was integrated within a fluid-structure interaction solver for investigating a flow induced cantilever beam vibration.
Wang, Tianyang; Wüchner, Roland; Sicklinger, Stefan; Bletzinger, Kai-Uwe
2016-05-01
This paper investigates data mapping between non-matching meshes and geometries in fluid-structure interaction. Mapping algorithms for surface meshes including nearest element interpolation, the standard mortar method and the dual mortar method are studied and comparatively assessed. The inconsistency problem of mortar methods at curved edges of fluid-structure-interfaces is solved by a newly developed enforcing consistency approach, which is robust enough to handle even the case that fluid boundary facets are totally not in contact with structure boundary elements due to high fluid refinement. Besides, tests with representative geometries show that the mortar methods are suitable for conservative mapping but it is better to use the nearest element interpolation in a direct way, and moreover, the dual mortar method can give slight oscillations. This work also develops a co-rotating mapping algorithm for 1D beam elements. Its novelty lies in the ability of handling large displacements and rotations.
Directory of Open Access Journals (Sweden)
Mauro Massayoshi Sakamoto
2008-01-01
Full Text Available In this work, a software package based on the Delaunay´s algorithm is described. The main feature of this package is the capability in applying discretization in geometric domains of teeth taking into account their complex inner structures and the materials with different hardness. Usually, the mesh generators reported in literature treat molars and other teeth by using simplified geometric models, or even considering the teeth as homogeneous structures.
Mi Jeong Kim; Sung Joon Maeng; Yong Soo Cho
2015-01-01
In this paper, a distributed synchronization technique based on a bio-inspired algorithm is proposed for an orthogonal frequency division multiple access (OFDMA)-based wireless mesh network (WMN) with a time difference of arrival. The proposed time- and frequency-synchronization technique uses only the signals received from the neighbor nodes, by considering the effect of the propagation delay between the nodes. It achieves a fast synchronization with a relatively low computational complexity...
A blind watermarking algorithm for 3D mesh models based on vertex curvature
Institute of Scientific and Technical Information of China (English)
Yong-zhao ZHAN; Yan-ting LI; Xin-yu WANG; Yi QIAN
2014-01-01
We propose a robust blind watermarking algorithm for three-dimensional (3D) mesh models based on vertex cur-vature to maintain good robustness and improve visual masking in 3D mesh models. In the embedding process, by using the local window of vertex, the root mean square curvature is calculated for every vertex of the 3D mesh model and an ordered set of fluctuation values is obtained. According to the ordered fluctuation values, the vertices are separated into bins. In each bin the fluctuation values are normalized. Finally, the mean of the root mean square curvature fluctuation values of the vertices in each bin is modulated to embed watermark information. In watermark detection, the algorithm uses a blind watermark extraction technique to extract the watermark information. The experimental results show that the algorithm has a very good performance for visual masking of the embedded model and that it can resist a variety of common attacks such as vertex rearrangement, rotation, trans-lating, uniform scaling, noise, smoothing, quantization, and simplification.
An Efficient Optimization Procedure for Tetrahedral Meshes by Chaos Search Algorithm
Institute of Scientific and Technical Information of China (English)
SUN ShuLi (孙树立); LIU JianFei (刘剑飞)
2003-01-01
A simple and efficient local optimization-based procedure for node repositioning/smoothing of three-dimensional tetrahedral meshes is presented. The initial tetrahedral mesh is optimized with respect to a specified element shape measure by chaos search algorithm, which is very effective for the optimization problems with only a few design variables. Examples show that the presented smoothing procedure can provide favorable conditions for local transformation approach and the quality of mesh can be significantly improved by the combination of these two procedures with respect to a specified element shape measure. Meanwhile, several commonly used shape measures for tetrahedral element, which are considered to be equivalent in some weak sense over a long period of time, are briefly re-examined in this paper. Preliminary study indicates that using different measures to evaluate the change of element shape will probably lead to inconsistent result for both well shaped and poorly shaped elements. The proposed smoothing approach can be utilized as an appropriate and effective tool for evaluating element shape measures and their influence on mesh optimization process and optimal solution.
Performance Evaluation of Multipath Discovery Algorithms for VoD Streaming in Wireless Mesh Network
Directory of Open Access Journals (Sweden)
Praful C. Ramteke
2014-07-01
Full Text Available Transmission and routing of video data over wireless network is a challenging task because of wireless interferences. To improve the performance of video on demand transmission over wireless networks multipath algorithms are used. IPD/S (Iterative path discovery/ selection PPD/S (Parallel Path discovery/selection are two algorithms which is used for discovering maximum number of edge disjoint paths from source to destination, for each VoD request by considering the effects of wireless interferences. In this paper performance evaluation of these multipath discovery algorithms for VoD (Video on demand streaming in wireless mesh network is presented. These algorithms are evaluated on the bases of Number of Path discovers, Packet drop ratio. Simulation result shows that PPD/S works batter as compared to IPD/S because it’s able to discover more paths than IPD/S under same circumstances
Double-link failure protection algorithm for shared sub-path in survivable WDM mesh networks
Institute of Scientific and Technical Information of China (English)
Lei Guo(郭磊); Hongfang Yu(虞红芳); Lemin Li(李乐民)
2004-01-01
We propose a novel shared sub-path protection (SSPP) algorithm to protect the double-link failures in wavelength division multiplexing (WDM) mesh networks. SSPP segments the primary path into several equal-length sub-paths and searches two link-disjoint backup paths for each sub-path. When computing the paths, SSPP considers the load balance and the resource sharing degree, so that the blocking ratio can be effectively reduced. The simulation results show that SSPP not only can completely protect the double-link failures but also can make the tradeoffs between the resource utilization ratio (or blocking ratio) and the protection-switching time.
An Efficient Algorithm for Detection of Selfish Packet Dropping Nodes in Wireless Mesh Networks
Sen, Jaydip
2011-01-01
In a wireless mesh network (WMN), high speed routers equipped with advanced antennas, communicate with each other in a multi-hop fashion over wireless channels and form a broadband backhaul. WMNs provide reliable connectivity and fault-tolerance, as each node is connected to several other nodes. If a node fails due to hardware problems, its neighbors can find another route. Extra capacity can be achieved by introducing additional nodes in the network. However, the throughput of a WMN may be severely degraded due to presence of some selfish routers that avoid forwarding packets for other nodes even as they send their own traffic through the network. This paper presents an algorithm for detection of selfish nodes in a WMN that uses statistical theory of inference for reliable clustering of the nodes. Simulation results show that the algorithm has a high detection rate and a low rate of false positives.
An Algorithm for Detection of Selfish Nodes in Wireless Mesh Networks
Sen, Jaydip
2010-01-01
Wireless mesh networks (WMNs) are evolving as a key technology for next-generation wireless networks showing raid progress and numerous applications. These networks have the potential to provide robust and high-throughput data delivery to wireless users. In a WMN, high speed routers equipped with advanced antennas, communicate with each other in a multi-hop fashion over wireless channels and form a broadband backhaul. However, the throughput of a WMN may be severely degraded due to presence of some selfish routers that avoid forwarding packets for other nodes even as they send their own traffic through the network. This paper presents an algorithm for detection of selfish nodes in a WMN. It uses statistical theory of inference for reliable clustering of the nodes and is based on local observations by the nodes. Simulation results show that the algorithm has a high detection rate while having a low rate of false positives.
Time integration algorithms for the two-dimensional Euler equations on unstructured meshes
Slack, David C.; Whitaker, D. L.; Walters, Robert W.
1994-06-01
Explicit and implicit time integration algorithms for the two-dimensional Euler equations on unstructured grids are presented. Both cell-centered and cell-vertex finite volume upwind schemes utilizing Roe's approximate Riemann solver are developed. For the cell-vertex scheme, a four-stage Runge-Kutta time integration, a fourstage Runge-Kutta time integration with implicit residual averaging, a point Jacobi method, a symmetric point Gauss-Seidel method and two methods utilizing preconditioned sparse matrix solvers are presented. For the cell-centered scheme, a Runge-Kutta scheme, an implicit tridiagonal relaxation scheme modeled after line Gauss-Seidel, a fully implicit lower-upper (LU) decomposition, and a hybrid scheme utilizing both Runge-Kutta and LU methods are presented. A reverse Cuthill-McKee renumbering scheme is employed for the direct solver to decrease CPU time by reducing the fill of the Jacobian matrix. A comparison of the various time integration schemes is made for both first-order and higher order accurate solutions using several mesh sizes, higher order accuracy is achieved by using multidimensional monotone linear reconstruction procedures. The results obtained for a transonic flow over a circular arc suggest that the preconditioned sparse matrix solvers perform better than the other methods as the number of elements in the mesh increases.
Dynamic Protection-at-Lightpath Algorithms in Traffic-Grooming WDM Mesh Networks
Institute of Scientific and Technical Information of China (English)
HERongxi; WENHaibo; LILemin
2005-01-01
Under the constraints of the number of transceivers per node and wavelength continuity, we investigate the problem of provisioning Protection-at-lightpath (PAL) level for connections with different bandwidth granularities in traffic-grooming WDM mesh networks. We first develop a new Protection graph model (PGM) to represent current state of the network, i.e., the information about transceivers, wavelengths, protected lightpath, bandwidth, etc. We then present two grooming policies for PAL, which are called Minimal wavelength-link policy (MWP) and Minimal transceiver policy (MTP). Based on the PGM, we propose two dynamic PAL algorithms with MWP and MTP respectively, which are called Minimal wavelength-link method (MWM) and Minimal transceiver method (MTM). At last we compare the performance of MWM and MTM with other methods utilizing different grooming policies presented in previous literatures via simulations. Our results show that MWM and MTM outperform other methods significantly and MWM has a better performance than MTM.
MPIFA: A Modified Protocol Independent Fairness Algorithm for Community Wireless Mesh Networks
Widanapathirana, C H; Lim, Sim Moh
2012-01-01
Community Wireless Mesh Networks (WMN) is a paradigm in wireless communication of 21st centuary as means of providing high speed braodband access. Un-cooperative nodes, both selfish and malicious proves to be a significant threat in Community WMN that require a solution independent of routing protocols being used. We propose to implement Modified PIFA (MPIFA), an Improved version of Protocol Independent Fairness Algorithm (PIFA) proposed by Younghwan Yoo, Sanghyun and P. Agrawal [6] with ability to cater specific requirements in Community WMN. MPIFA has malicious nodes detection rate improvement of 50% when nodes demonstrate low probabilistic malicious behavior of 10% to circumvent the security measures in place. Improvements were also made to reduce false malicious node detections to 4% when node-to-node link failures occur in Community WMN.
Kim, Mi Jeong; Maeng, Sung Joon; Cho, Yong Soo
2015-07-28
In this paper, a distributed synchronization technique based on a bio-inspired algorithm is proposed for an orthogonal frequency division multiple access (OFDMA)-based wireless mesh network (WMN) with a time difference of arrival. The proposed time- and frequency-synchronization technique uses only the signals received from the neighbor nodes, by considering the effect of the propagation delay between the nodes. It achieves a fast synchronization with a relatively low computational complexity because it is operated in a distributed manner, not requiring any feedback channel for the compensation of the propagation delays. In addition, a self-organization scheme that can be effectively used to construct 1-hop neighbor nodes is proposed for an OFDMA-based WMN with a large number of nodes. The performance of the proposed technique is evaluated with regard to the convergence property and synchronization success probability using a computer simulation.
Directory of Open Access Journals (Sweden)
Mi Jeong Kim
2015-07-01
Full Text Available In this paper, a distributed synchronization technique based on a bio-inspired algorithm is proposed for an orthogonal frequency division multiple access (OFDMA-based wireless mesh network (WMN with a time difference of arrival. The proposed time- and frequency-synchronization technique uses only the signals received from the neighbor nodes, by considering the effect of the propagation delay between the nodes. It achieves a fast synchronization with a relatively low computational complexity because it is operated in a distributed manner, not requiring any feedback channel for the compensation of the propagation delays. In addition, a self-organization scheme that can be effectively used to construct 1-hop neighbor nodes is proposed for an OFDMA-based WMN with a large number of nodes. The performance of the proposed technique is evaluated with regard to the convergence property and synchronization success probability using a computer simulation.
Minimum Interference Channel Assignment Algorithm for Multicast in a Wireless Mesh Network.
Choi, Sangil; Park, Jong Hyuk
2016-12-02
Wireless mesh networks (WMNs) have been considered as one of the key technologies for the configuration of wireless machines since they emerged. In a WMN, wireless routers provide multi-hop wireless connectivity between hosts in the network and also allow them to access the Internet via gateway devices. Wireless routers are typically equipped with multiple radios operating on different channels to increase network throughput. Multicast is a form of communication that delivers data from a source to a set of destinations simultaneously. It is used in a number of applications, such as distributed games, distance education, and video conferencing. In this study, we address a channel assignment problem for multicast in multi-radio multi-channel WMNs. In a multi-radio multi-channel WMN, two nearby nodes will interfere with each other and cause a throughput decrease when they transmit on the same channel. Thus, an important goal for multicast channel assignment is to reduce the interference among networked devices. We have developed a minimum interference channel assignment (MICA) algorithm for multicast that accurately models the interference relationship between pairs of multicast tree nodes using the concept of the interference factor and assigns channels to tree nodes to minimize interference within the multicast tree. Simulation results show that MICA achieves higher throughput and lower end-to-end packet delay compared with an existing channel assignment algorithm named multi-channel multicast (MCM). In addition, MICA achieves much lower throughput variation among the destination nodes than MCM.
Energy Technology Data Exchange (ETDEWEB)
Alexander S. Rattner; Donna Post Guillen; Alark Joshi
2012-12-01
Photo- and physically-realistic techniques are often insufficient for visualization of simulation results, especially for 3D and time-varying datasets. Substantial research efforts have been dedicated to the development of non-photorealistic and illustration-inspired visualization techniques for compact and intuitive presentation of such complex datasets. While these efforts have yielded valuable visualization results, a great deal of work has been reproduced in studies as individual research groups often develop purpose-built platforms. Additionally, interoperability between illustrative visualization software is limited due to specialized processing and rendering architectures employed in different studies. In this investigation, a generalized framework for illustrative visualization is proposed, and implemented in marmotViz, a ParaView plugin, enabling its use on variety of computing platforms with various data file formats and mesh geometries. Detailed descriptions of the region-of-interest identification and feature-tracking algorithms incorporated into this tool are provided. Additionally, implementations of multiple illustrative effect algorithms are presented to demonstrate the use and flexibility of this framework. By providing a framework and useful underlying functionality, the marmotViz tool can act as a springboard for future research in the field of illustrative visualization.
A Stackelberg-Game-Based Power Control Algorithm for Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
Yanbing Liu
2013-01-01
Full Text Available Wireless mesh networks (WMNs are a promising networking paradigm for next generation wireless networking system. Power control plays a vital role in WMNs and is realized to be a crucial step toward large-scale WMNs deployment. In this paper, we address the problem of how to allocate the power for both optimizing quality of service (QoS and saving the power consumption in WMNs based on the game theory. We first formulate the problem as a noncooperative game, in which the QoS attributes and the power of each node are defined as a utility function, and all the nodes attempt to maximize their own utility. In such game, we correlate all the interfering nodes to be an interfering object and the receiving node to be the interfering object's virtual destination node. We then present an equilibrium solution for the noncooperative game using Stackelberg model, and we propose an iterative, distributed power control algorithm for WMNs. Also, we conduct numeric experiments to evaluate the system performance, our results show that the proposed algorithm can balance nodes to share the limited network resources and maximize total utility, and thus it is efficient and effective for solving the power control problem in WMNs.
Saintillan, David; Darve, Eric; Shaqfeh, Eric S. G.
2005-03-01
Large-scale simulations of non-Brownian rigid fibers sedimenting under gravity at zero Reynolds number have been performed using a fast algorithm. The mathematical formulation follows the previous simulations by Butler and Shaqfeh ["Dynamic simulations of the inhomogeneous sedimentation of rigid fibres," J. Fluid Mech. 468, 205 (2002)]. The motion of the fibers is described using slender-body theory, and the line distribution of point forces along their lengths is approximated by a Legendre polynomial in which only the total force, torque, and particle stresslet are retained. Periodic boundary conditions are used to simulate an infinite suspension, and both far-field hydrodynamic interactions and short-range lubrication forces are considered in all simulations. The calculation of the hydrodynamic interactions, which is typically the bottleneck for large systems with periodic boundary conditions, is accelerated using a smooth particle-mesh Ewald (SPME) algorithm previously used in molecular dynamics simulations. In SPME the slowly decaying Green's function is split into two fast-converging sums: the first involves the distribution of point forces and accounts for the singular short-range part of the interactions, while the second is expressed in terms of the Fourier transform of the force distribution and accounts for the smooth and long-range part. Because of its smoothness, the second sum can be computed efficiently on an underlying grid using the fast Fourier transform algorithm, resulting in a significant speed-up of the calculations. Systems of up to 512 fibers were simulated on a single-processor workstation, providing a different insight into the formation, structure, and dynamics of the inhomogeneities that occur in sedimenting fiber suspensions.
Cui, Laizhong; Jiang, Yong; Wu, Jianping; Xia, Shutao
Most large-scale Peer-to-Peer (P2P) live streaming systems are constructed as a mesh structure, which can provide robustness in the dynamic P2P environment. The pull scheduling algorithm is widely used in this mesh structure, which degrades the performance of the entire system. Recently, network coding was introduced in mesh P2P streaming systems to improve the performance, which makes the push strategy feasible. One of the most famous scheduling algorithms based on network coding is R2, with a random push strategy. Although R2 has achieved some success, the push scheduling strategy still lacks a theoretical model and optimal solution. In this paper, we propose a novel optimal pull-push scheduling algorithm based on network coding, which consists of two stages: the initial pull stage and the push stage. The main contributions of this paper are: 1) we put forward a theoretical analysis model that considers the scarcity and timeliness of segments; 2) we formulate the push scheduling problem to be a global optimization problem and decompose it into local optimization problems on individual peers; 3) we introduce some rules to transform the local optimization problem into a classical min-cost optimization problem for solving it; 4) We combine the pull strategy with the push strategy and systematically realize our scheduling algorithm. Simulation results demonstrate that decode delay, decode ratio and redundant fraction of the P2P streaming system with our algorithm can be significantly improved, without losing throughput and increasing overhead.
Bogdanov, P. B.; Gorobets, A. V.; Sukov, S. A.
2013-08-01
The design of efficient algorithms for large-scale gas dynamics computations with hybrid (heterogeneous) computing systems whose high performance relies on massively parallel accelerators is addressed. A high-order accurate finite volume algorithm with polynomial reconstruction on unstructured hybrid meshes is used to compute compressible gas flows in domains of complex geometry. The basic operations of the algorithm are implemented in detail for massively parallel accelerators, including AMD and NVIDIA graphics processing units (GPUs). Major optimization approaches and a computation transfer technique are covered. The underlying programming tool is the Open Computing Language (OpenCL) standard, which performs on accelerators of various architectures, both existing and emerging.
Zhou, Lu; Yazici, Birsen
2011-04-01
Quantitatively accurate fluorescence diffuse optical tomographic (FDOT) image reconstruction is a computationally demanding problem that requires repeated numerical solutions of two coupled partial differential equations and an associated inverse problem. Recently, adaptive finite element methods have been explored to reduce the computation requirements of the FDOT image reconstruction. However, existing approaches ignore the ubiquitous presence of noise in boundary measurements. In this paper, we analyze the effect of finite element discretization on the FDOT forward and inverse problems in the presence of measurement noise and develop novel adaptive meshing algorithms for FDOT that take into account noise statistics. We formulate the FDOT inverse problem as an optimization problem in the maximum a posteriori framework to estimate the fluorophore concentration in a bounded domain. We use the mean-square-error (MSE) between the exact solution and the discretized solution as a figure of merit to evaluate the image reconstruction accuracy, and derive an upper bound on the MSE which depends upon the forward and inverse problem discretization parameters, noise statistics, a priori information of fluorophore concentration, source and detector geometry, as well as background optical properties. Next, we use this error bound to develop adaptive meshing algorithms for the FDOT forward and inverse problems to reduce the MSE due to discretization in the reconstructed images. Finally, we present a set of numerical simulations to illustrate the practical advantages of our adaptive meshing algorithms for FDOT image reconstruction.
Energy Technology Data Exchange (ETDEWEB)
Wienke, B.R.; O' Dell, R.D.
1976-12-01
ESECT and EMAP are subroutines which provide a computer algorithm for mapping arbitrary meshes onto rectangular meshes in cylindrical (r,z) geometry. Input consists of the lines defining the rectangular mesh and the coordinates of the arbitrary mesh, which are assumed to be joined by straight lines. Output consists of the intersection volumes with designation of common mesh zones. The ESECT and EMAP routines do not comprise a ''free-standing'' code but, instead, are intended for inclusion in existing codes for which one mesh structure (typically Lagrangian) needs to be mapped onto an Eulerian mesh. Such mappings are of interest in coupled hydrodynamic and neutronic calculations. Exact expressions for the volumes of rotation (about z-axis) generated by the planar mesh intersection areas are used. Intersection points of the two meshes are computed and mapped onto corresponding regions on the rectangular mesh. Intersection points with the same regional indices are recorded into multilaterals, and the multilaterals are triangulated to facilitate computation of the intersection volumes. Dimension statements within ESECT/EMAP presently allow for rectangular and arbitrary meshes of 10k and 3.6k grid points. Scaling of all arrays to suit individual applications is easily effected. Computations of intersection volumes generated by overlapping 10k rectangular and 2.2k radial meshes require an average of 18 s computer time, while computation times for the same meshes scaled by a factor of /sup 1///sub 4/ in number of grid points average 3 s on the CDC 7600. Generally, cases of small cell rectangular meshes overlaid on large cell arbitrary meshes require the longer running times. 10 figures, 2 tables.
Distributed topology control algorithm to conserve energy in heterogeneous wireless mesh networks
CSIR Research Space (South Africa)
Aron, FO
2008-07-01
Full Text Available A considerable amount of energy is consumed during transmission and reception of messages in a wireless mesh network (WMN). Reducing per-node transmission power would greatly increase the network lifetime via power conservation in addition...
Sen, Jaydip
2010-01-01
Wireless mesh networks (WMNs) are evolving as a key technology for next-generation wireless networks showing raid progress and numerous applications. These networks have the potential to provide robust and high-throughput data delivery to wireless users. In a WMN, high speed routers equipped with advanced antennas, communicate with each other in a multi-hop fashion over wireless channels and form a broadband backhaul. However, the throughput of a WMN may be severely degraded due to presence of some selfish routers that avoid forwarding packets for other nodes even as they send their own traffic through the network. This paper presents an algorithm for detection of selfish nodes in a WMN that uses statistical theory of inference for reliable clustering of the nodes based on local observations. Simulation results show that the algorithm has a high detection rate and a low false positive rate.
TRIM: A finite-volume MHD algorithm for an unstructured adaptive mesh
Energy Technology Data Exchange (ETDEWEB)
Schnack, D.D.; Lottati, I.; Mikic, Z. [Science Applications International Corp., San Diego, CA (United States)] [and others
1995-07-01
The authors describe TRIM, a MHD code which uses finite volume discretization of the MHD equations on an unstructured adaptive grid of triangles in the poloidal plane. They apply it to problems related to modeling tokamak toroidal plasmas. The toroidal direction is treated by a pseudospectral method. Care was taken to center variables appropriately on the mesh and to construct a self adjoint diffusion operator for cell centered variables.
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
Directory of Open Access Journals (Sweden)
Faosan Mapa
2014-01-01
Full Text Available Normal 0 false false false IN X-NONE X-NONE MicrosoftInternetExplorer4 /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:11.0pt; font-family:"Calibri","sans-serif"; mso-ascii-font-family:Calibri; mso-ascii-theme-font:minor-latin; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:Calibri; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi;} Wireless Mesh Network (WMN adalah suatu konektivitas jaringan yang self-organized, self-configured dan multi-hop. Tujuan dari WMN adalah menawarkan pengguna suatu bentuk jaringan nirkabel yang dapat dengan mudah berkomunikasi dengan jaringan konvensional dengan kecepatan tinggi dan dengan cakupan yang lebih luas serta biaya awal yang minimal. Diperlukan suatu desain protokol routing yang efisien untuk WMN yang secara adaptif dapat mendukung mesh routers dan mesh clients. Dalam tulisan ini, diusulkan untuk mengoptimalkan protokol OLSR, yang merupakan protokol routing proaktif. Digunakan heuristik yang meningkatkan protokol OLSR melalui adaptive refreshing time interval dan memperbaiki metode MPR selecting algorithm. Suatu analisa dalam meningkatkan protokol OLSR melalui adaptive refreshing time interval dan memperbaiki algoritma pemilihan MPR menunjukkan kinerja yang signifikan dalam hal throughput jika dibandingkan dengan protokol OLSR yang asli. Akan tetapi, terdapat kenaikan dalam hal delay. Pada simulasi yang dilakukan dapat disimpulkan bahwa OLSR dapat dioptimalkan dengan memodifikasi pemilihan node MPR berdasarkan cost effective dan penyesuaian waktu interval refreshing hello message sesuai dengan keadaan
Cunningham, Andrew J.; Frank, Adam; Varnière, Peggy; Mitran, Sorin; Jones, Thomas W.
2009-06-01
A description is given of the algorithms implemented in the AstroBEAR adaptive mesh-refinement code for ideal magnetohydrodynamics. The code provides several high-resolution shock-capturing schemes which are constructed to maintain conserved quantities of the flow in a finite-volume sense. Divergence-free magnetic field topologies are maintained to machine precision by collating the components of the magnetic field on a cell-interface staggered grid and utilizing the constrained transport approach for integrating the induction equations. The maintenance of magnetic field topologies on adaptive grids is achieved using prolongation and restriction operators which preserve the divergence and curl of the magnetic field across collocated grids of different resolutions. The robustness and correctness of the code is demonstrated by comparing the numerical solution of various tests with analytical solutions or previously published numerical solutions obtained by other codes.
A Novel Improved DSR Algorithm Based on Cross-Layer Mechanism in Wireless Mesh Network
Directory of Open Access Journals (Sweden)
Yue Lu
2010-07-01
Full Text Available Routing in Wireless Networks is challenging because of the unpredictable behavior of the medium and the random variations in channel condition. All of these factors lead to poor performance in multi-hop wireless mesh networks specially with the conventional routing. In order to exploit all the advantages that the wireless medium offers, new routing metrics must be explored. These metrics should come from across-layer approach in order to make the routing layer aware of the local issues of the underling layers.In this paper we investigate a new cross-layer routing metric that takes into account available bandwidth as well as the number of retransmissions, thus aiming to minimize end-to-end delay. The experimental results show that the proposed cross-layer metric improves the performance of routing in terms of end-to-end delay and network throughput by selecting paths with high available bandwidth while also avoiding areas of MAC congestion.
A Relatively Optimal Cross-layer Routing Algorithm in Wireless Mesh Network
Directory of Open Access Journals (Sweden)
Yue Lu
2011-10-01
Full Text Available Routing in Wireless Network is challenging because of the unpredictable behavior of the medium and the proactive effect of interference. All of these factors lead to poor performance in multi-hop wireless mesh networks specially with the conventional routing. In order to exploit all the advantages that the wireless medium offers, new routing metrics must be explored. These metrics should come from across-layer approach in order to make the routing layer aware of the local issues of the underling layers and even change some parameters of the PHY layer. In the paper, we explore three primitive physical layer parameters: bite error rate(BER, interference, and transmission power. We define the metric so that the network layer can correctly find paths that offer: low levels of bite error rate ,reliability in terms of packet success rate, and relatively low power.
A multiple channel assignment algorithm and routing protocol base on wireless mesh networks
Shi, Xiaochuan; Li, Nan
2011-10-01
In this paper, a hybrid routing protocol TOIRP and a distributed channel assignment algorithm CLBCA of WMN in the multi-channel environment are proposed. The tree base protocol and the traditional AODV routing protocol are integrated together to reduce delay in the routing protocol, which is proposed by HWMP. A new routing metric CETTI is used in this routing protocol, which uses a new method to quantify the interference of communication. It divided interference into two parts: inter-flow interference and intra- flow interference, and it integrate the considerations of hop- count and delay. This improves the throughput of WMN. The channel assignment algorithm is divided into two parts: radio- neighbor binding and channel-radio binding. This algorithm is based on the channel load and avoids the channel-dependency problem which is common in the multi-channel environment. In the same time, it increases the utilization of each channel.
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
Energy optimization based path selection algorithm for IEEE 802.11s wireless mesh networks
CSIR Research Space (South Africa)
Mhlanga, MM
2011-09-01
Full Text Available when the network is deployed in rural areas where electricity is a scarce resource. This research therefore presents an energy optimization based path selection algorithm for IEEE 802.11s WMNs which is aimed at addressing the above mentioned constrains...
2014-02-01
Techniques and Algorithms Dr. Georg May RWTH Aachen University Aachen Institute for Advanced Study in Computational Engineering Science...Templergraben 55 Aachen 52074 Germany EOARD Grant 08-3060 Report Date: February 2014 Final Report from 15 October 2008 to 30 August 2013...Dr. Georg May 5d. PROJECT NUMBER 5d. TASK NUMBER 5e. WORK UNIT NUMBER 7. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) RWTH Aachen
Trobec, Roman
2015-01-01
This book is concentrated on the synergy between computer science and numerical analysis. It is written to provide a firm understanding of the described approaches to computer scientists, engineers or other experts who have to solve real problems. The meshless solution approach is described in more detail, with a description of the required algorithms and the methods that are needed for the design of an efficient computer program. Most of the details are demonstrated on solutions of practical problems, from basic to more complicated ones. This book will be a useful tool for any reader interes
Network preservation through a topology control algorithm for wireless mesh networks
CSIR Research Space (South Africa)
Aron, FO
2008-09-01
Full Text Available (SMECN). In this algorithm, each node u initially broadcasts “hello” message with some initial power and after reception of ACKs from the receiving nodes, checks if the current range covers the region of maximal transmission range less the union...-SPT). In this phase, each node gathers neighbour information and constructs an LM-SPT (as depicted in Figure 2). The phase involves three stages: i. Information collection and exchange: - Each node in this step periodically broadcasts a beacon ‘Hello’ messages...
An Automatic Networking and Routing Algorithm for Mesh Network in PLC System
Liu, Xiaosheng; Liu, Hao; Liu, Jiasheng; Xu, Dianguo
2017-05-01
Power line communication (PLC) is considered to be one of the best communication technologies in smart grid. However, the topology of low voltage distribution network is complex, meanwhile power line channel has characteristics of time varying and attenuation, which lead to the unreliability of power line communication. In this paper, an automatic networking and routing algorithm is introduced which can be adapted to the "blind state" topology. The results of simulation and test show that the scheme is feasible, the routing overhead is small, and the load balance performance is good, which can achieve the establishment and maintenance of network quickly and effectively. The scheme is of great significance to improve the reliability of PLC.
对无线Mesh网络区域路由算法实现探讨%Discussion on Realization of Wireless Mesh Network Area Routing Algorithm
Institute of Scientific and Technical Information of China (English)
周征
2014-01-01
Today on the Ad Hoc network routing protocol has been widely used in wireless Mesh network, its application and the wireless Mesh network environment, because of the difference between the Ad Hoc and wireless Mesh applications directly, the inevitable will appear many problems, this paper deeply analyzes the conventional routing protocol for many problems the emergence of wireless MESH network, and proposed the corresponding solution for wireless Mesh network routing algorithm to realize regional.%当今关于Ad Hoc网络中的路由协议在无线Mesh网络中受到了广泛的使用，将其应用与无线Mesh网络环境中，由于Ad Hoc与无线Mesh的区别，这种直接的应用不可避免的会出现许多的问题，该文深入分析了将常规路由协议用于无线MESH网络时出现的诸多问题，从而对无线Mesh网络区域路由算法实现提出了相应的解决方法。
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...
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.
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,
无线Mesh网络中的自适应队列调度算法研究%Research on Adaptive Queue Scheduling Algorithm in Wireless Mesh Networks
Institute of Scientific and Technical Information of China (English)
夏汉铸; 王志刚
2014-01-01
针对无线mesh网络的网络特性，分析了无线网络中的队列调度算法，提出了一种自适应的队列调度算法AQSM，详细讨论了该算法的具体实现过程及参数变化规则，通过仿真验证了该算法在提高网络性能的同时还可以实现对不同业务流的业务区分。%Wireless Mesh networks (WMNs) have emerged as a key technology for next-generation wireless networking. Queue scheduling algorithm is an important research area in wireless mesh network. In order to improve the performance of WMN and realize DiffServ between different traffic flows, an adaptive queue scheduling algorithm(AQSM)is presented, and the specific implementation process and parameter variation rules are discussed in detail. The analysis and simulation results show that the AQSM algorithm can increase the performance of the wireless Mesh networks and realize the service division of different service flows.
Argudo, Núria; Iskra, M Pilar; Pera, Miguel; Sancho, Juan J; Grande, Luis; López-Cano, Manuel; Pereira, José Antonio
2017-04-01
Incisional hernia (IH) after colorectal surgery is highly prevalent. The objective of this study is to assess the utility of an algorithm to decide on mesh augmentation after a midline laparotomy for colorectal resection to prevent IH in high-risk patients. A prospective study was conducted including all patients undergoing a midline laparotomy for colorectal resection between January 2011 and June 2014, after the implementation of a decision algorithm for prophylactic mesh augmentation in selected high-risk patients. Intention-to-treat analyses were conducted between patients in which the algorithm was correctly applied and those in which it was not. From the 235 patients analysed, the algorithm was followed in 166 patients, the resting 69 cases were used as a control group. From an initial adherence to the algorithm of 40% in the first semester, a 90.3% adherence was achieved in the seventh semester. The incidence of IH decreased as the adherence to the algorithm increased (from 28 to 0%) with a time-related correlation (R(2)=0.781). A statistically significant reduction in IH incidence was demonstrated in high-risk groups in which the algorithm was correctly applied (10,2 vs. 46,3%; p=0,0001; OR: 7,58;95%; CI: 3,8-15). Survival analysis showed that the differences remained constant during follow-up. The implementation of the algorithm reduces the incidence of IH in high-risk patients. The adherence to the algorithm also correlates with a decrease in the incidence of IH. Copyright © 2017 AEC. Publicado por Elsevier España, S.L.U. All rights reserved.
Institute of Scientific and Technical Information of China (English)
王高才; 陈建二; 王国军; 陈松乔
2003-01-01
One-to-all or broadcast communication is one of the most important communication patterns and occurs in many important applications in parallel computing. This paper proposes a fault tolerant, local-irdormation-based, and distributed broadcast routing algorithm based on the concept of k-submesh-cormectivity in all-port mesh networks.The paper analyzes the fault tolerance of the algorithm in terms of node failure probability. Suppose that every nodehas independent failure probability, and deduce the success probability of the broadcast routing, which successfully routes a message from a source node to all non-faulty nodes in the networks. The paper strictly proves that the broadcast routing algorithm with the success probability of 99％ to route among all non-faulty nodes on mesh networks with forty thousand nodes, in case that the node failure probability is controlled within 0.12％ Simulation results show that the algorithm is practically efficient and effective, and the time steps of the algorithm are very closeto the optimum.
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...
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.
Directory of Open Access Journals (Sweden)
Mohsen Shakibafakhr
2013-11-01
Full Text Available Wireless mesh networks (WMNs are new emerging networks which are anticipated to resolve many limitations of ad-hoc networks, sensor networks and wireless local area networks and improve their performance. But still there are many unresolved research challenge in this area. In this paper we have proposed source-specific multicast protocol for wireless mesh network, which has many application in, multimedia, radio and TV multicasting and distance learning. We have used core-based approach to construct minimum cost tree (MCT among member nodes and optimized this tree for multiple metrics by applying ant colony optimization metaphor.
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.
Generating Algorithm of Progressive Mesh Model Based on Edge Collapse%基于边收缩的渐进网格模型生成算法
Institute of Scientific and Technical Information of China (English)
侯宝明; 鄂旭; 毕嘉娜
2013-01-01
为了实现3D模型的渐进式网格模型表示,改进基于边收缩方式模型简化的收缩代价计算方法.本算法首先从SMF数据文件中读取模型数据信息,然后在内存中快速建立起3D模型,重新设计Garland算法中QEM的权值计算方法.以顶点相邻三角平面法向量最大偏差的平方作为顶点的重要程度并将其加入到误差测度公式中,通过简化最终生成渐进式网格模型.实验结果表明,本算法简练,网格模型生成速度快,模型轮廓信息保持完整.%In order to implement progressive mesh representation of 3D model,the calculation method of collapse cost of model simplification based on edge collapse mode is improved.Firstly,model data from SMF data file is obtained,and the 3D model in the memory is established rapidly,and the weight calculation method of Garland's EM algorithm is redesigned.The square of the largest deviation of triangular plane normal adjacent to the vertex is used as the importance degree of vertex,and bring it into error metric formula,by simplifying progressive mesh is generated.The following experiment shows that the algorithm is succinct,and the generating speed of mesh and the contour information of model are completely preserved.
Institute of Scientific and Technical Information of China (English)
王霄; 吴开军
2011-01-01
目前,无线Mesh网络正成为无线网络研究中的一个热点.Quality of service (QoS)是无线Mesh网络中的一个非常重要问题,而QoS路由技术是解决这一问题的关键技术之一.本文就蚁群算法进行研究和改进,并将改进后的算法应用于无线Mesh网络QoS路由问题,进而提出了无线Mesh网络QoS路由算法,通过实验证明该算法能够对QoS提供较好的支持.%Currently, the wireless Mesh network is a hot spot of wireless network research. In wireless Mesh network,QoS is an important issue, and QoS routing is the key technology to solve this problem. In this paper, we proposed a wireless Mesh network QoS routing algorithm on Improved ant colony algorithm, and our experimental results shows that it can provide better QoS support.
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.
Simmonett, Andrew C.; Pickard, Frank C.; Schaefer, Henry F.; Brooks, Bernard R.
2014-05-01
Next-generation molecular force fields deliver accurate descriptions of non-covalent interactions by employing more elaborate functional forms than their predecessors. Much work has been dedicated to improving the description of the electrostatic potential (ESP) generated by these force fields. A common approach to improving the ESP is by augmenting the point charges on each center with higher-order multipole moments. The resulting anisotropy greatly improves the directionality of the non-covalent bonding, with a concomitant increase in computational cost. In this work, we develop an efficient strategy for enumerating multipole interactions, by casting an efficient spherical harmonic based approach within a particle mesh Ewald (PME) framework. Although the derivation involves lengthy algebra, the final expressions are relatively compact, yielding an approach that can efficiently handle both finite and periodic systems without imposing any approximations beyond PME. Forces and torques are readily obtained, making our method well suited to modern molecular dynamics simulations.
无线Mesh网络中基于公平的EDCA算法研究%Research on fairness-based EDCA algorithm in wireless Mesh networks
Institute of Scientific and Technical Information of China (English)
夏汉铸; 刘辉元
2014-01-01
针对无线Mesh网络的网络特性，分析无线Mesh网络中的EDCA算法，提出了一种基于公平的EDCA算法，详细讨论了该算法的具体实现过程及参数变化规则，通过仿真验证了该算法提高网络的公平性同时改善网络性能，还可以达到对不同业务流的业务区分。%Aiming at the network characteristic of wireless Mesh networks(WMN),the EDCA algorithm in WMN is ana-lyzed,and a fairness-based EDCA algorithm is provided. The implementation process and the rule of parameter variation are dis-cussed. Through simulation,the algorithm is proved to have the characteristic of improving the fairness of the network while per-fecting the network performance. What′s more,it can also realize the differentiation of different service.
2013-03-01
applications [3, 21, 22], including antenna, microwave circuits , geophysics, optics, etc. The Ground Penetrating Radar (GPR) is a popular and...Räisänen. An efficient FDTD algorithm for the analysis of microstrip patch antennas printed on a general anisotropic dielectric substrate. IEEE...45, 1995. [17] S. Gedney, F. Lansing, and D. Rascoe. Full wave analysis of microwave monolithic circuit devices using a generalized Yee-algorithm
Masterlark, Timothy; Lu, Zhong; Rykhus, Russell P.
2006-01-01
Interferometric synthetic aperture radar (InSAR) imagery documents the consistent subsidence, during the interval 1992–1999, of a pyroclastic flow deposit (PFD) emplaced during the 1986 eruption of Augustine Volcano, Alaska. We construct finite element models (FEMs) that simulate thermoelastic contraction of the PFD to account for the observed subsidence. Three-dimensional problem domains of the FEMs include a thermoelastic PFD embedded in an elastic substrate. The thickness of the PFD is initially determined from the difference between post- and pre-eruption digital elevation models (DEMs). The initial excess temperature of the PFD at the time of deposition, 640 °C, is estimated from FEM predictions and an InSAR image via standard least-squares inverse methods. Although the FEM predicts the major features of the observed transient deformation, systematic prediction errors (RMSE = 2.2 cm) are most likely associated with errors in the a priori PFD thickness distribution estimated from the DEM differences. We combine an InSAR image, FEMs, and an adaptive mesh algorithm to iteratively optimize the geometry of the PFD with respect to a minimized misfit between the predicted thermoelastic deformation and observed deformation. Prediction errors from an FEM, which includes an optimized PFD geometry and the initial excess PFD temperature estimated from the least-squares analysis, are sub-millimeter (RMSE = 0.3 mm). The average thickness (9.3 m), maximum thickness (126 m), and volume (2.1 × 107m3) of the PFD, estimated using the adaptive mesh algorithm, are about twice as large as the respective estimations for the a priori PFD geometry. Sensitivity analyses suggest unrealistic PFD thickness distributions are required for initial excess PFD temperatures outside of the range 500–800 °C.
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....
Improved algorithm based on hybrid wireless mesh protocol%基于混合无线网状网协议的改进算法研究
Institute of Scientific and Technical Information of China (English)
何凌; 黄俊
2011-01-01
HWMP provides two routing modes, proactive mode of tree-based routing protocol and on-demand mode of AODV routing protocol. There are a lot of problems in this protocol, such as low expansibility, efficiency and the root is the weak point.When the traffic is heavy, the collision and loss of data packets will increase. This paper proposed an improved algorithm based on hybrid wireless Mesh protocol to solve above problems. In the Mesh network, the source mode could calculate the bestmetric mute to any destination quickly when used the proposed algorithm. The improved protocol combined proactive mode with on-demand mode to apply to all transmission environment. The simulation results reveal that the improved protocol gets better performance on packet delivery rate, average end-to-end delay and throughput.%HWMP提供了两种路由模式,分别是以树状路由(TBR)为基础的先应路由模式和以AODV为基础的按需路由模式.然而这个协议存在着许多问题,如可扩展性较差、效率较低、根是网络故障点,当网络业务繁重时,数据包的碰撞和丢失增加.提出一种混合无线网状网协议的改进算法来解决以上问题.在Mesh网络内部.改进后的协议能够使源节点快速地计算出到任意目的节点的最优路径,同时也将先应路由模式和按需路由模式相结合以适用于所有传输环境.从仿真结果可看出,改进后的协议能在数据包到达率、平均端到端时延和吞吐量指标达到更好的性能.
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.
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
S, Kyriacou; E, Kontoleontos; S, Weissenberger; L, Mangani; E, Casartelli; I, Skouteropoulou; M, Gattringer; A, Gehrer; M, Buchmayr
2014-03-01
An efficient hydraulic optimization procedure, suitable for industrial use, requires an advanced optimization tool (EASY software), a fast solver (block coupled CFD) and a flexible geometry generation tool. EASY optimization software is a PCA-driven metamodel-assisted Evolutionary Algorithm (MAEA (PCA)) that can be used in both single- (SOO) and multiobjective optimization (MOO) problems. In MAEAs, low cost surrogate evaluation models are used to screen out non-promising individuals during the evolution and exclude them from the expensive, problem specific evaluation, here the solution of Navier-Stokes equations. For additional reduction of the optimization CPU cost, the PCA technique is used to identify dependences among the design variables and to exploit them in order to efficiently drive the application of the evolution operators. To further enhance the hydraulic optimization procedure, a very robust and fast Navier-Stokes solver has been developed. This incompressible CFD solver employs a pressure-based block-coupled approach, solving the governing equations simultaneously. This method, apart from being robust and fast, also provides a big gain in terms of computational cost. In order to optimize the geometry of hydraulic machines, an automatic geometry and mesh generation tool is necessary. The geometry generation tool used in this work is entirely based on b-spline curves and surfaces. In what follows, the components of the tool chain are outlined in some detail and the optimization results of hydraulic machine components are shown in order to demonstrate the performance of the presented optimization procedure.
Maglevanny, I. I.; Smolar, V. A.
2016-01-01
We introduce a new technique of interpolation of the energy-loss function (ELF) in solids sampled by empirical optical spectra. Finding appropriate interpolation methods for ELFs poses several challenges. The sampled ELFs are usually very heterogeneous, can originate from various sources thus so called "data gaps" can appear, and significant discontinuities and multiple high outliers can be present. As a result an interpolation based on those data may not perform well at predicting reasonable physical results. Reliable interpolation tools, suitable for ELF applications, should therefore satisfy several important demands: accuracy and predictive power, robustness and computational efficiency, and ease of use. We examined the effect on the fitting quality due to different interpolation schemes with emphasis on ELF mesh optimization procedures and we argue that the optimal fitting should be based on preliminary log-log scaling data transforms by which the non-uniformity of sampled data distribution may be considerably reduced. The transformed data are then interpolated by local monotonicity preserving Steffen spline. The result is a piece-wise smooth fitting curve with continuous first-order derivatives that passes through all data points without spurious oscillations. Local extrema can occur only at grid points where they are given by the data, but not in between two adjacent grid points. It is found that proposed technique gives the most accurate results and also that its computational time is short. Thus, it is feasible using this simple method to address practical problems associated with interaction between a bulk material and a moving electron. A compact C++ implementation of our algorithm is also presented.
Welch, J. A.; Kópházi, J.; Owens, A. R.; Eaton, M. D.
2017-10-01
In this paper a method is presented for the application of energy-dependent spatial meshes applied to the multigroup, second-order, even-parity form of the neutron transport equation using Isogeometric Analysis (IGA). The computation of the inter-group regenerative source terms is based on conservative interpolation by Galerkin projection. The use of Non-Uniform Rational B-splines (NURBS) from the original computer-aided design (CAD) model allows for efficient implementation and calculation of the spatial projection operations while avoiding the complications of matching different geometric approximations faced by traditional finite element methods (FEM). The rate-of-convergence was verified using the method of manufactured solutions (MMS) and found to preserve the theoretical rates when interpolating between spatial meshes of different refinements. The scheme's numerical efficiency was then studied using a series of two-energy group pincell test cases where a significant saving in the number of degrees-of-freedom can be found if the energy group with a complex variation in the solution is refined more than an energy group with a simpler solution function. Finally, the method was applied to a heterogeneous, seven-group reactor pincell where the spatial meshes for each energy group were adaptively selected for refinement. It was observed that by refining selected energy groups a reduction in the total number of degrees-of-freedom for the same total L2 error can be obtained.
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.
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.
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.
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.
Institute of Scientific and Technical Information of China (English)
夏汉铸; 王志刚
2014-01-01
Aiming at the network characteristics of wireless Mesh network, the EDCA algorithm in wireless Mesh network is analyzed, and a congestion-probability based CPEDCA algorithm is proposed, the specific implementation process and the parameter dynamic adjustment method are discussed in detail. The contribution of the algorithm to improvement of the network performance is verified by simulation. The algorithm can also realize the service differentiation of different service flows.%针对无线Mesh网络的网络特性，分析了无线Mesh网络中的EDCA算法，提出了一种基于拥塞概率的CPEDCA算法，详细讨论了该算法的具体实现过程及参数的动态调整方法，通过仿真验证了该算法对网络性能的提高，同时可以实现不同业务流间的业务区分。
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.
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
... 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.
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...
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...
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.
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.
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.
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.
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
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.
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...
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.
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
Directory of Open Access Journals (Sweden)
R. K. Mohanty
2014-01-01
Full Text Available We discuss a new single sweep alternating group explicit iteration method, along with a third-order numerical method based on off-step discretization on a variable mesh to solve the nonlinear ordinary differential equation y′′=f(x,y,y′ subject to given natural boundary conditions. Using the proposed method, we have solved Burgers’ equation both in singular and nonsingular cases, which is the main attraction of our work. The convergence of the proposed method is discussed in detail. We compared the results of the proposed iteration method with the results of the corresponding double sweep alternating group explicit iteration methods to demonstrate computationally the efficiency of the proposed method.
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.
Iterative Mesh Transformation for 3D Segmentation of Livers with Cancers in CT Images
Lu, Difei; Wu, Yin; Harris, Gordon; Cai, Wenli
2015-01-01
Segmentation of diseased liver remains a challenging task in clinical applications due to the high inter-patient variability in liver shapes, sizes and pathologies caused by cancers or other liver diseases. In this paper, we present a multi-resolution mesh segmentation algorithm for 3D segmentation of livers, called iterative mesh transformation that deforms the mesh of a region-of-interest (ROI) in a progressive manner by iterations between mesh transformation and contour optimization. Mesh ...
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.
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.
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.
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.
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...
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...
Watermarking on 3D mesh based on spherical wavelet transform
Institute of Scientific and Technical Information of China (English)
金剑秋; 戴敏雅; 鲍虎军; 彭群生
2004-01-01
In this paper we propose a robust watermarking algorithm for 3D mesh. The algorithm is based on spherical wavelet transform. Our basic idea is to decompose the original mesh into a series of details at different scales by using spherical wavelet transform; the watermark is then embedded into the different levels of details. The embedding process includes: global sphere parameterization, spherical uniform sampling, spherical wavelet forward transform, embedding watermark, spherical wavelet inverse transform, and at last resampling the mesh watermarked to recover the topological connectivity of the original model. Experiments showed that our algorithm can improve the capacity of the watermark and the robustness of watermarking against attacks.
Institute of Scientific and Technical Information of China (English)
熊小峰; 尹飞; 乐光学; 刘建生
2012-01-01
According to the existence of restrict and mutually dependent of channel and interfaces of node, the "ripple effect" leading to the link invalid and the relation of presence of temporal between the main business node in network.This paper proposes an spatial-temporal multi-channel algorithm for wireless mesh network based on greedy algorithm by taking the influence of the allocated channel of previous subset timing on the next subset timing channel allocation into account.According to the principle of the greedy algorithm, this algorithm makes the channel work in parallel to increase overall network throughput by allocating unallocated channel and trying not to change the allocated channel to reduce the time of switching channel.According to experimental simulation, it compares static multi-interface multi-channel allocation algorithm which can inhibit the "ripple effect" and the invalid link and spatial-temporal multi-interface multi-channel allocation algorithm.The results show that the throughput of entire mesh network is improved obviously and increased with the decrease of the number of network service node and the increase number of available channels.%无线mesh网络多接口多信道分配算法中,信道分配与接口数目之间存在相互制约、相互依赖、“涟漪效应”,导致链路无效以及承载网络拓扑的主要业务节点存在时序关系,本文在基于多信道空间和时间联合信道分配算法的基础之上,考虑前一个子时序已分配信道对下一个子时序信道分配的影响,提出了基于贪心算法的无线mesh时空域多信道分配算法.根据贪心算法原理,尽量不改变已分配信道,减少信道切换时间,将剩余的未分配信道分配给要分配的接口,使信道能并行工作以提高整个网络的吞吐量.通过实验仿真,对比了能够抑制“涟漪效应”和链路无效的静态多接口多信道分配算法、空间与时间相结合的多接口多信道分配算法.
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.
WDM光网络中多播业务量疏导方法分析%Analysis of multicast traffic grooming algorithms in WDM mesh networks
Institute of Scientific and Technical Information of China (English)
刘焕淋; 方强; 雷芳
2012-01-01
在光层多播树路由中疏导低速业务实现阻塞率降低和吞吐量提高是光网络比较复杂的联合优化问题.分析了WDM(wave-length division multiplex)网络中多播业务量疏导问题的研究方法和成果,分析比较了静态多播业务和动态多播业务的疏导方法,并讨论了各种多播业务疏导方法性能、特点及存在的问题,最后总结了关于动态多播疏导的未来研究思路.%Grooming the low-speed traffic to reduce the blocking probability and improve throughput in optical layer multicast routing tree is a more complex joint optimization problem. The paper analyzes the methods and results of the optical multicast traffic grooming problem in WDM networks. Also,the multicast static traffic and dynamic traffic grooming algorithms are analyzed and compared in the paper respectively. Furthermore,the authors discuss the performance,characteristics and the existing problems of those algorithms for optical multicast traffic grooming. Finally,we summarize the future research ideas about the methods of dynamic multicast traffic grooming.
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
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.
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.
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.
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.
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
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.
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.
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...
Improving the Quality of Conforming Triangular Meshes by Topological Clean up and DSI
Institute of Scientific and Technical Information of China (English)
MENGXian-hai; YANGQin; LIJl-gang; CHENQi-ming
2004-01-01
A new method as a post-processing step is presented to improve the shape quality of triangular meshes, which uses a topological clean up procedure and discrete smoothing interpolate (DSI) algorithm together. This method can improve the angle distribution of mesh element, while keeping the resulting meshes conform to the predefined constraints which are inputted as a PSLG.
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.
Development of an Immersive Environment to Aid in Automatic Mesh Generation LDRD Final Report
Energy Technology Data Exchange (ETDEWEB)
Pavlakos, Constantine J.
1998-10-01
The purpose of this work was to explore the use of immersive technologies, such as those used in synthetic environments (commordy referred to as virtual realily, or VR), in enhancing the mesh- generation process for 3-dimensional (3D) engineering models. This work was motivated by the fact that automatic mesh generation systems are still imperfect - meshing algorithms, particularly in 3D, are sometimes unable to construct a mesh to completion, or they may produce anomalies or undesirable complexities in the resulting mesh. It is important that analysts and meshing code developers be able to study their meshes effectively in order to understand the topology and qualily of their meshes. We have implemented prototype capabilities that enable such exploration of meshes in a highly visual and intuitive manner. Since many applications are making use of increasingly large meshes, we have also investigated approaches to handle large meshes while maintaining interactive response. Ideally, it would also be possible to interact with the meshing process, allowing interactive feedback which corrects problems and/or somehow enables proper completion of the meshing process. We have implemented some functionality towards this end -- in doing so, we have explored software architectures that support such an interactive meshing process. This work has incorporated existing technologies developed at SandiaNational Laboratories, including the CUBIT mesh generation system, and the EIGEN/VR (previously known as MUSE) and FLIGHT systems, which allow applications to make use of immersive technologies and advanced human computer interfaces. 1
Development of an Immersive Environment to Aid in Automatic Mesh Generation LDRD Final Report
Energy Technology Data Exchange (ETDEWEB)
Pavlakos, Constantine J.
1998-10-01
The purpose of this work was to explore the use of immersive technologies, such as those used in synthetic environments (commordy referred to as virtual realily, or VR), in enhancing the mesh- generation process for 3-dimensional (3D) engineering models. This work was motivated by the fact that automatic mesh generation systems are still imperfect - meshing algorithms, particularly in 3D, are sometimes unable to construct a mesh to completion, or they may produce anomalies or undesirable complexities in the resulting mesh. It is important that analysts and meshing code developers be able to study their meshes effectively in order to understand the topology and qualily of their meshes. We have implemented prototype capabilities that enable such exploration of meshes in a highly visual and intuitive manner. Since many applications are making use of increasingly large meshes, we have also investigated approaches to handle large meshes while maintaining interactive response. Ideally, it would also be possible to interact with the meshing process, allowing interactive feedback which corrects problems and/or somehow enables proper completion of the meshing process. We have implemented some functionality towards this end -- in doing so, we have explored software architectures that support such an interactive meshing process. This work has incorporated existing technologies developed at SandiaNational Laboratories, including the CUBIT mesh generation system, and the EIGEN/VR (previously known as MUSE) and FLIGHT systems, which allow applications to make use of immersive technologies and advanced human computer interfaces. 1
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.
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...
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.
Multiresolution mesh segmentation based on surface roughness and wavelet analysis
Roudet, Céline; Dupont, Florent; Baskurt, Atilla
2007-01-01
During the last decades, the three-dimensional objects have begun to compete with traditional multimedia (images, sounds and videos) and have been used by more and more applications. The common model used to represent them is a surfacic mesh due to its intrinsic simplicity and efficacity. In this paper, we present a new algorithm for the segmentation of semi-regular triangle meshes, via multiresolution analysis. Our method uses several measures which reflect the roughness of the surface for all meshes resulting from the decomposition of the initial model into different fine-to-coarse multiresolution meshes. The geometric data decomposition is based on the lifting scheme. Using that formulation, we have compared various interpolant prediction operators, associated or not with an update step. For each resolution level, the resulting approximation mesh is then partitioned into classes having almost constant roughness thanks to a clustering algorithm. Resulting classes gather regions having the same visual appearance in term of roughness. The last step consists in decomposing the mesh into connex groups of triangles using region growing ang merging algorithms. These connex surface patches are of particular interest for adaptive mesh compression, visualisation, indexation or watermarking.
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.
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.
Assessment of mesh simplification algorithm quality
Roy, Michael; Nicolier, Frederic; Foufou, S.; Truchetet, Frederic; Koschan, Andreas; Abidi, Mongi A.
2002-03-01
Traditionally, medical geneticists have employed visual inspection (anthroposcopy) to clinically evaluate dysmorphology. In the last 20 years, there has been an increasing trend towards quantitative assessment to render diagnosis of anomalies more objective and reliable. These methods have focused on direct anthropometry, using a combination of classical physical anthropology tools and new instruments tailor-made to describe craniofacial morphometry. These methods are painstaking and require that the patient remain still for extended periods of time. Most recently, semiautomated techniques (e.g., structured light scanning) have been developed to capture the geometry of the face in a matter of seconds. In this paper, we establish that direct anthropometry and structured light scanning yield reliable measurements, with remarkably high levels of inter-rater and intra-rater reliability, as well as validity (contrasting the two methods).
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.
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....
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
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.
On the Support of Multimedia Applications over Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
Chemseddine BEMMOUSSAT
2013-05-01
Full Text Available For next generation wireless networks, supporting quality of service (QoS in multimedia application likevideo, streaming and voice over IP is a necessary and critical requirement. Wireless Mesh Networking isenvisioned as a solution for next networks generation and a promising technology for supportingmultimedia application.With decreasing the numbers of mesh clients, QoS will increase automatically. Several research arefocused to improve QoS in Wireless Mesh networks (WMNs, they try to improve a basics algorithm, likerouting protocols or one of example of canal access, but in moments it no sufficient to ensure a robustsolution to transport multimedia application over WMNs.In this paper we propose an efficient routing algorithm for multimedia transmission in the mesh networkand an approach of QoS in the MAC layer for facilitated transport video over the network studied.
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.
Fast Dynamic Meshing Method Based on Delaunay Graph and Inverse Distance Weighting Interpolation
Wang, Yibin; Qin, Ning; Zhao, Ning
2016-06-01
A novel mesh deformation technique is developed based on the Delaunay graph mapping method and the inverse distance weighting (IDW) interpolation. The algorithm maintains the advantages of the efficiency of Delaunay-graph-mapping mesh deformation while possess the ability for better controlling the near surface mesh quality. The Delaunay graph is used to divide the mesh domain into a number of sub-domains. On each of the sub-domains, the inverse distance weighting interpolation is applied to build a much smaller sized translation matrix between the original mesh and the deformed mesh, resulting a similar efficiency for the mesh deformation as compared to the fast Delaunay graph mapping method. The paper will show how the near-wall mesh quality is controlled and improved by the new method while the computational time is compared with the original Delaunay graph mapping method.
A general boundary capability embedded in an orthogonal mesh
Energy Technology Data Exchange (ETDEWEB)
Hewett, D.W.; Yu-Jiuan Chen [Lawrence Livermore National Lab., CA (United States)
1995-07-01
The authors describe how they hold onto orthogonal mesh discretization when dealing with curved boundaries. Special difference operators were constructed to approximate numerical zones split by the domain boundary; the operators are particularly simple for this rectangular mesh. The authors demonstrated that this simple numerical approach, termed Dynamic Alternating Direction Implicit, turned out to be considerably more efficient than more complex grid-adaptive algorithms that were tried previously.
Viscous flow modelling using unstructured meshes for aeronautical applications
Szmelter, J.; Pagano, A.
The novel application of viscous coupling to unstructured meshes has been proposed and developed. The method allows fro viscous flows modelling and avoids the difficulty of generating highly stretched tetrahedral in 3D or triangular in 2D elements required for Navier-Stokes solvers. The time step allowed by the explicit euler solver is limited by the size of the "Euler" mesh, resulting in faster algorithms than standard explicit Navier-Stokes solvers.
Isotropic 2D quadrangle meshing with size and orientation control
Pellenard, Bertrand
2011-12-01
We propose an approach for automatically generating isotropic 2D quadrangle meshes from arbitrary domains with a fine control over sizing and orientation of the elements. At the heart of our algorithm is an optimization procedure that, from a coarse initial tiling of the 2D domain, enforces each of the desirable mesh quality criteria (size, shape, orientation, degree, regularity) one at a time, in an order designed not to undo previous enhancements. Our experiments demonstrate how well our resulting quadrangle meshes conform to a wide range of input sizing and orientation fields.
Adaptive mesh refinement for stochastic reaction-diffusion processes
Bayati, Basil; Chatelain, Philippe; Koumoutsakos, Petros
2011-01-01
We present an algorithm for adaptive mesh refinement applied to mesoscopic stochastic simulations of spatially evolving reaction-diffusion processes. The transition rates for the diffusion process are derived on adaptive, locally refined structured meshes. Convergence of the diffusion process is presented and the fluctuations of the stochastic process are verified. Furthermore, a refinement criterion is proposed for the evolution of the adaptive mesh. The method is validated in simulations of reaction-diffusion processes as described by the Fisher-Kolmogorov and Gray-Scott equations.
Hex-dominant mesh generation using 3D constrained triangulation
Energy Technology Data Exchange (ETDEWEB)
OWEN,STEVEN J.
2000-05-30
A method for decomposing a volume with a prescribed quadrilateral surface mesh, into a hexahedral-dominated mesh is proposed. With this method, known as Hex-Morphing (H-Morph), an initial tetrahedral mesh is provided. Tetrahedral are transformed and combined starting from the boundary and working towards the interior of the volume. The quadrilateral faces of the hexahedra are treated as internal surfaces, which can be recovered using constrained triangulation techniques. Implementation details of the edge and face recovery process are included. Examples and performance of the H-Morph algorithm are also presented.
Expected Transmission Energy Route Metric for Wireless Mesh Senor Networks
Directory of Open Access Journals (Sweden)
YanLiang Jin
2011-01-01
Full Text Available Mesh is a network topology that achieves high throughput and stable intercommunication. With great potential, it is expected to be the key architecture of future networks. Wireless sensor networks are an active research area with numerous workshops and conferences arranged each year. The overall performance of a WSN highly depends on the energy consumption of the network. This paper designs a new routing metric for wireless mesh sensor networks. Results from simulation experiments reveal that the new metric algorithm improves the energy balance of the whole network and extends the lifetime of wireless mesh sensor networks (WMSNs.
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...
The Tree-Particle-Mesh N-body Gravity Solver
Bode, P; Xu, G; Bode, Paul; Ostriker, Jeremiah P.; Xu, Guohong
2000-01-01
The Tree-Particle-Mesh (TPM) N-body algorithm couples the tree algorithm for directly computing forces on particles in an hierarchical grouping scheme with the extremely efficient mesh based PM structured approach. The combined TPM algorithm takes advantage of the fact that gravitational forces are linear functions of the density field. Thus one can use domain decomposition to break down the density field into many separate high density regions containing a significant fraction of the mass but residing in a very small fraction of the total volume. In each of these high density regions the gravitational potential is computed via the tree algorithm supplemented by tidal forces from the external density distribution. For the bulk of the volume, forces are computed via the PM algorithm; timesteps in this PM component are large compared to individually determined timesteps in the tree regions. Since each tree region can be treated independently, the algorithm lends itself to very efficient parallelization using me...
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.
A REGIONAL REFINEMENT FOR FINITE ELEMENT MESH DESIGN USING COLLAPSIBLE ELEMENT
Directory of Open Access Journals (Sweden)
Priyo Suprobo
2000-01-01
Full Text Available A practical algorithm for automated mesh design in finite element analysis is developed. A regional mixed mesh improvement procedure is introduced. The error control%2C algorithm implementation%2C code development%2C and the solution accuracy are discussed. Numerical example includes automated mesh designs for plane elastic media with singularities. The efficiency of the procedure is demonstrated. Abstract in Bahasa Indonesia : regional+refinement%2C+mesh+generation%2C+isoparametric+element%2C+collapsible+element
Study on boundary search method for DFM mesh generation
Directory of Open Access Journals (Sweden)
Li Ri
2012-08-01
Full Text Available The boundary mesh of the casting model was determined by direct calculation on the triangular facets extracted from the STL file of the 3D model. Then the inner and outer grids of the model were identified by the algorithm in which we named Inner Seed Grid Method. Finally, a program to automatically generate a 3D FDM mesh was compiled. In the paper, a method named Triangle Contraction Search Method (TCSM was put forward to ensure not losing the boundary grids; while an algorithm to search inner seed grids to identify inner/outer grids of the casting model was also brought forward. Our algorithm was simple, clear and easy to construct program. Three examples for the casting mesh generation testified the validity of the program.
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.
One-to-one embedding between honeycomb mesh and Petersen-Torus networks.
Seo, Jung-Hyun; Sim, Hyun; Park, Dae-Heon; Park, Jang-Woo; Lee, Yang-Sun
2011-01-01
As wireless mobile telecommunication bases organize their structure using a honeycomb-mesh algorithm, there are many studies about parallel processing algorithms like the honeycomb mesh in Wireless Sensor Networks. This paper aims to study the Peterson-Torus graph algorithm in regard to the continuity with honeycomb-mesh algorithm in order to apply the algorithm to sensor networks. Once a new interconnection network is designed, parallel algorithms are developed with huge research costs to use such networks. If the old network is embedded in a newly designed network, a developed algorithm in the old network is reusable in a newly designed network. Petersen-Torus has been designed recently, and the honeycomb mesh has already been designed as a well-known interconnection network. In this paper, we propose a one-to-one embedding algorithm for the honeycomb mesh (HMn) in the Petersen-Torus PT(n,n), and prove that dilation of the algorithm is 5, congestion is 2, and expansion is 5/3. The proposed one-to-one embedding is applied so that processor throughput can be minimized when the honeycomb mesh algorithm runs in the Petersen-Torus.
Institute of Scientific and Technical Information of China (English)
孙文彬; 赵学胜
2008-01-01
The characteristic of Quaternary codes is analyzed. The rule of distinguishing triangle direction is given out. An algorithm of neighbor finding by decomposing the Quaternary code from back to front is presented in this paper. The contrastive analysis of time complexity between this algorithm and Bartholdi's algorithm is approached. The result illustrates that the average consumed time of this algorithm is about 23.66% of Bartholdi's algorithm.
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.
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.
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.
Interactive Shape Modeling using a Skeleton-Mesh Co-Representation
DEFF Research Database (Denmark)
Bærentzen, Jacob Andreas; Abdrashitov, Rinat; Singh, Karan
2014-01-01
We introduce the Polar-Annular Mesh representation (PAM). A PAM is a mesh-skeleton co-representation designed for the modeling of 3D organic, articulated shapes. A PAM represents a manifold mesh as a partition of polar (triangle fans) and annular (rings of quads) regions. The skeletal topology...... of a shape is uniquely embedded in the mesh connectivity of a PAM, enabling both surface and skeletal modeling operations, interchangeably and directly on the mesh itself. We develop an algorithm to convert arbitrary triangle meshes into PAMs as well as techniques to simplify PAMs and a method to convert...... a PAM to a quad-only mesh. We further present a PAM-based multi-touch sculpting application in order to demonstrate its utility as a shape representation for the interactive modeling of organic, articulated figures as well as for editing and posing of pre-existing models....
Finite element meshing approached as a global minimization process
Energy Technology Data Exchange (ETDEWEB)
WITKOWSKI,WALTER R.; JUNG,JOSEPH; DOHRMANN,CLARK R.; LEUNG,VITUS J.
2000-03-01
The ability to generate a suitable finite element mesh in an automatic fashion is becoming the key to being able to automate the entire engineering analysis process. However, placing an all-hexahedron mesh in a general three-dimensional body continues to be an elusive goal. The approach investigated in this research is fundamentally different from any other that is known of by the authors. A physical analogy viewpoint is used to formulate the actual meshing problem which constructs a global mathematical description of the problem. The analogy used was that of minimizing the electrical potential of a system charged particles within a charged domain. The particles in the presented analogy represent duals to mesh elements (i.e., quads or hexes). Particle movement is governed by a mathematical functional which accounts for inter-particles repulsive, attractive and alignment forces. This functional is minimized to find the optimal location and orientation of each particle. After the particles are connected a mesh can be easily resolved. The mathematical description for this problem is as easy to formulate in three-dimensions as it is in two- or one-dimensions. The meshing algorithm was developed within CoMeT. It can solve the two-dimensional meshing problem for convex and concave geometries in a purely automated fashion. Investigation of the robustness of the technique has shown a success rate of approximately 99% for the two-dimensional geometries tested. Run times to mesh a 100 element complex geometry were typically in the 10 minute range. Efficiency of the technique is still an issue that needs to be addressed. Performance is an issue that is critical for most engineers generating meshes. It was not for this project. The primary focus of this work was to investigate and evaluate a meshing algorithm/philosophy with efficiency issues being secondary. The algorithm was also extended to mesh three-dimensional geometries. Unfortunately, only simple geometries were tested
Quality Tetrahedral Mesh Smoothing via Boundary-Optimized Delaunay Triangulation.
Gao, Zhanheng; Yu, Zeyun; Holst, Michael
2012-12-01
Despite its great success in improving the quality of a tetrahedral mesh, the original optimal Delaunay triangulation (ODT) is designed to move only inner vertices and thus cannot handle input meshes containing "bad" triangles on boundaries. In the current work, we present an integrated approach called boundary-optimized Delaunay triangulation (B-ODT) to smooth (improve) a tetrahedral mesh. In our method, both inner and boundary vertices are repositioned by analytically minimizing the error between a paraboloid function and its piecewise linear interpolation over the neighborhood of each vertex. In addition to the guaranteed volume-preserving property, the proposed algorithm can be readily adapted to preserve sharp features in the original mesh. A number of experiments are included to demonstrate the performance of our method.
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.
VIDEO OBJECT SEGMENTATION BY 2-D MESH-BASED MOTION ANALYSIS
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
Video object extraction is a key technology in content-based video coding. A novel video object extracting algorithm by two Dimensional (2-D) mesh-based motion analysis is proposed in this paper. Firstly, a 2-D mesh fitting the original frame image is obtained via feature detection algorithm.Then, higher order statistics motion analysis is applied on the 2-D mesh representation to get an initial motion detection mask. After post-processing, the final segmenting mask is quickly obtained. And hence the video object is effectively extracted. Experimental results show that the proposed algorithm combines the merits of mesh-based segmenting algorithms and pixel-based segmenting algorithms, and hereby achieves satisfactory subjective and objective performance while dramatically increasing the segmenting speed.
Tangle-Free Mesh Motion for Ablation Simulations
Droba, Justin
2016-01-01
Problems involving mesh motion-which should not be mistakenly associated with moving mesh methods, a class of adaptive mesh redistribution techniques-are of critical importance in numerical simulations of the thermal response of melting and ablative materials. Ablation is the process by which material vaporizes or otherwise erodes due to strong heating. Accurate modeling of such materials is of the utmost importance in design of passive thermal protection systems ("heatshields") for spacecraft, the layer of the vehicle that ensures survival of crew and craft during re-entry. In an explicit mesh motion approach, a complete thermal solve is first performed. Afterwards, the thermal response is used to determine surface recession rates. These values are then used to generate boundary conditions for an a posteriori correction designed to update the location of the mesh nodes. Most often, linear elastic or biharmonic equations are used to model this material response, traditionally in a finite element framework so that complex geometries can be simulated. A simple scheme for moving the boundary nodes involves receding along the surface normals. However, for all but the simplest problem geometries, evolution in time following such a scheme will eventually bring the mesh to intersect and "tangle" with itself, inducing failure. This presentation demonstrates a comprehensive and sophisticated scheme that analyzes the local geometry of each node with help from user-provided clues to eliminate the tangle and enable simulations on a wide-class of difficult problem geometries. The method developed is demonstrated for linear elastic equations but is general enough that it may be adapted to other modeling equations. The presentation will explicate the inner workings of the tangle-free mesh motion algorithm for both two and three-dimensional meshes. It will show abstract examples of the method's success, including a verification problem that demonstrates its accuracy and
Toward a Consistent Framework for High Order Mesh Refinement Schemes in Numerical Relativity
Mongwane, Bishop
2015-01-01
It has now become customary in the field of numerical relativity to couple high order finite difference schemes to mesh refinement algorithms. To this end, different modifications to the standard Berger-Oliger adaptive mesh refinement algorithm have been proposed. In this work we present a fourth order stable mesh refinement scheme with sub-cycling in time for numerical relativity. We do not use buffer zones to deal with refinement boundaries but explicitly specify boundary data for refined grids. We argue that the incompatibility of the standard mesh refinement algorithm with higher order Runge Kutta methods is a manifestation of order reduction phenomena, caused by inconsistent application of boundary data in the refined grids. Our scheme also addresses the problem of spurious reflections that are generated when propagating waves cross mesh refinement boundaries. We introduce a transition zone on refined levels within which the phase velocity of propagating modes is allowed to decelerate in order to smoothl...
h-Refinement for simple corner balance scheme of SN transport equation on distorted meshes
Yang, Rong; Yuan, Guangwei
2016-11-01
The transport sweep algorithm is a common method for solving discrete ordinate transport equation, but it breaks down once a concave cell appears in spatial meshes. To deal with this issue a local h-refinement for simple corner balance (SCB) scheme of SN transport equation on arbitrary quadrilateral meshes is presented in this paper by using a new subcell partition. It follows that a hybrid mesh with both triangle and quadrilateral cells is generated, and the geometric quality of these cells improves, especially it is ensured that all cells become convex. Combining with the original SCB scheme, an adaptive transfer algorithm based on the hybrid mesh is constructed. Numerical experiments are presented to verify the utility and accuracy of the new algorithm, especially for some application problems such as radiation transport coupled with Lagrangian hydrodynamic flow. The results show that it performs well on extremely distorted meshes with concave cells, on which the original SCB scheme does not work.
GOTPM: A Parallel Hybrid Particle-Mesh Treecode
Dubinski, J; Park, C; Humble, R J; Dubinski, John; Kim, Juhan; Park, Changbom; Humble, Robin
2004-01-01
We describe a parallel, cosmological N-body code based on a hybrid scheme using the particle-mesh (PM) and Barnes-Hut (BH) oct-tree algorithm. We call the algorithm GOTPM for Grid-of-Oct-Trees-Particle-Mesh. The code is parallelized using the Message Passing Interface (MPI) library and is optimized to run on Beowulf clusters as well as symmetric multi-processors. The gravitational potential is determined on a mesh using a standard PM method with particle forces determined through interpolation. The softened PM force is corrected for short range interactions using a grid of localized BH trees throughout the entire simulation volume in a completely analogous way to P$^3$M methods. This method makes no assumptions about the local density for short range force corrections and so is consistent with the results of the P$^3$M method in the limit that the treecode opening angle parameter, $\\theta \\to 0$. (abridged)
Connectivity-Based Segmentation for GPU-Accelerated Mesh Decompression
Institute of Scientific and Technical Information of China (English)
Jie-Yi Zhao; Min Tang; Ruo-Feng Tong
2012-01-01
We present a novel algorithm to partition large 3D meshes for GPU-accelerated decompression.Our formulation focuses on minimizing the replicated vertices between patches,and balancing the numbers of faces of patches for efficient parallel computing.First we generate a topology model of the original mesh and remove vertex positions.Then we assign the centers of patches using geodesic farthest point sampling and cluster the faces according to the geodesic distance to the centers.After the segmentation we swap boundary faces to fix jagged boundaries and store the boundary vertices for whole-mesh preservation.The decompression of each patch runs on a thread of GPU,and we evaluate its performance on various large benchmarks.In practice,the GPU-based decompression algorithm runs more than 48x faster on NVIDIA GeForce GTX 580 GPU compared with that on the CPU using single core.
Generation of Delaunay meshes in implicit domains with edge sharpening
Belokrys-Fedotov, A. I.; Garanzha, V. A.; Kudryavtseva, L. N.
2016-11-01
A variational algorithm for the construction of 3D Delaunay meshes in implicit domains with a nonsmooth boundary is proposed. The algorithm is based on the self-organization of an elastic network in which each Delaunay edge is interpreted as an elastic strut. The elastic potential is constructed as a combination of the repulsion potential and the sharpening potential. The sharpening potential is applied only on the boundary and is used to minimize the deviation of the outward normals to the boundary faces from the direction of the gradient of the implicit function. Numerical experiments showed that in the case when the implicit function specifying the domain is considerably different from the signed distance function, the use of the sharpening potential proposed by Belyaev and Ohtake in 2002 leads to the mesh instability. A stable version of the sharpening potential is proposed. The numerical experiments showed that acceptable Delaunay meshes for complex shaped domains with sharp curved boundary edges can be constructed.
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.
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
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.
Finite element based electrostatic-structural coupled analysis with automated mesh morphing
Energy Technology Data Exchange (ETDEWEB)
OWEN,STEVEN J.; ZHULIN,V.I.; OSTERGAARD,D.F.
2000-02-29
A co-simulation tool based on finite element principles has been developed to solve coupled electrostatic-structural problems. An automated mesh morphing algorithm has been employed to update the field mesh after structural deformation. The co-simulation tool has been successfully applied to the hysteric behavior of a MEMS switch.
Method and apparatus to enhance routing protocols in wireless mesh networks
DEFF Research Database (Denmark)
2014-01-01
A protocol for use in wireless mesh networks (PlayNCool) uses helper nodes to improve data flow in the network. The protocol is compatible with traditional mesh network routing algorithms. Techniques, systems, devices, and circuits for implementing the protocol are described....
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
Iterative mesh transformation for 3D segmentation of livers with cancers in CT images.
Lu, Difei; Wu, Yin; Harris, Gordon; Cai, Wenli
2015-07-01
Segmentation of diseased liver remains a challenging task in clinical applications due to the high inter-patient variability in liver shapes, sizes and pathologies caused by cancers or other liver diseases. In this paper, we present a multi-resolution mesh segmentation algorithm for 3D segmentation of livers, called iterative mesh transformation that deforms the mesh of a region-of-interest (ROI) in a progressive manner by iterations between mesh transformation and contour optimization. Mesh transformation deforms the 3D mesh based on the deformation transfer model that searches the optimal mesh based on the affine transformation subjected to a set of constraints of targeting vertices. Besides, contour optimization searches the optimal transversal contours of the ROI by applying the dynamic-programming algorithm to the intersection polylines of the 3D mesh on 2D transversal image planes. The initial constraint set for mesh transformation can be defined by a very small number of targeting vertices, namely landmarks, and progressively updated by adding the targeting vertices selected from the optimal transversal contours calculated in contour optimization. This iterative 3D mesh transformation constrained by 2D optimal transversal contours provides an efficient solution to a progressive approximation of the mesh of the targeting ROI. Based on this iterative mesh transformation algorithm, we developed a semi-automated scheme for segmentation of diseased livers with cancers using as little as five user-identified landmarks. The evaluation study demonstrates that this semi-automated liver segmentation scheme can achieve accurate and reliable segmentation results with significant reduction of interaction time and efforts when dealing with diseased liver cases.
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.
An Efficient Approach for Solving Mesh Optimization Problems Using Newton’s Method
Directory of Open Access Journals (Sweden)
Jibum Kim
2014-01-01
Full Text Available We present an efficient approach for solving various mesh optimization problems. Our approach is based on Newton’s method, which uses both first-order (gradient and second-order (Hessian derivatives of the nonlinear objective function. The volume and surface mesh optimization algorithms are developed such that mesh validity and surface constraints are satisfied. We also propose several Hessian modification methods when the Hessian matrix is not positive definite. We demonstrate our approach by comparing our method with nonlinear conjugate gradient and steepest descent methods in terms of both efficiency and mesh quality.
On the Meshing Efficiency of 2K-2H Type Planetary Gear Reducer
Long-Chang Hsieh; Hsiu-Chen Tang
2013-01-01
This paper proposes 2K-2H type planetary gear reducer and analyzes its meshing efficiency. First, according to the concept of train value equation, the kinematic design of 2K-2H type planetary gear reducers is carried out. Three 2K-2H type planetary gear reducers are designed to illustrate the design algorithm. Then, based on the latent power theorem, the meshing efficiency equation of 2K-2H type planetary gear reducer is derived. According to the meshing efficiency equation, the meshing effi...
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.
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.
Duchateau, Julien; Maquignon, Nicolas; Roussel, Gilles; Renaud, Christophe
2015-01-01
In this paper, a new progressive mesh algorithm is introduced in order to perform fast physical simulations by the use of a lattice Boltzmann method (LBM) on a single-node multi-GPU architecture. This algorithm is able to mesh automatically the simulation domain according to the propagation of fluids. This method can also be useful in order to perform various types of simulations on complex geometries. The use of this algorithm combined with the massive parallelism of GPUs allows to obtain very good performance in comparison with the static mesh method used in literature. Several simulations are shown in order to evaluate the algorithm.
Automatic mesh adaptivity for CADIS and FW-CADIS neutronics modeling of difficult shielding problems
Energy Technology Data Exchange (ETDEWEB)
Ibrahim, A. M.; Peplow, D. E.; Mosher, S. W.; Wagner, J. C.; Evans, T. M. [Oak Ridge National Laboratory, P.O. Box 2008, Oak Ridge, TN 37831 (United States); Wilson, P. P.; Sawan, M. E. [University of Wisconsin-Madison, 1500 Engineering Dr., Madison, WI 53706 (United States)
2013-07-01
The CADIS and FW-CADIS hybrid Monte Carlo/deterministic techniques dramatically increase the efficiency of neutronics modeling, but their use in the accurate design analysis of very large and geometrically complex nuclear systems has been limited by the large number of processors and memory requirements for their preliminary deterministic calculations and final Monte Carlo calculation. Three mesh adaptivity algorithms were developed to reduce the memory requirements of CADIS and FW-CADIS without sacrificing their efficiency improvement. First, a macro-material approach enhances the fidelity of the deterministic models without changing the mesh. Second, a deterministic mesh refinement algorithm generates meshes that capture as much geometric detail as possible without exceeding a specified maximum number of mesh elements. Finally, a weight window coarsening algorithm de-couples the weight window mesh and energy bins from the mesh and energy group structure of the deterministic calculations in order to remove the memory constraint of the weight window map from the deterministic mesh resolution. The three algorithms were used to enhance an FW-CADIS calculation of the prompt dose rate throughout the ITER experimental facility. Using these algorithms resulted in a 23.3% increase in the number of mesh tally elements in which the dose rates were calculated in a 10-day Monte Carlo calculation and, additionally, increased the efficiency of the Monte Carlo simulation by a factor of at least 3.4. The three algorithms enabled this difficult calculation to be accurately solved using an FW-CADIS simulation on a regular computer cluster, obviating the need for a world-class super computer. (authors)
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.
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.
Delaunay Refinement Mesh Generation
1997-05-18
determinant evaluation that considers floating- point operands, except for one limited example: Ottmann , Thiemt, and Ullrich [74] advocate the use of an...Sandia National Labo- ratories, October 1996. [74] Thomas Ottmann , Gerald Thiemt, and Christian Ullrich. Numerical Stability of Geometric Algorithms
802.11s Wireless Mesh Network Visualization Application
Mauldin, James Alexander
2014-01-01
Results of past experimentation at NASA Johnson Space Center showed that the IEEE 802.11s standard has better performance than the widely implemented alternative protocol B.A.T.M.A.N (Better Approach to Mobile Ad hoc Networking). 802.11s is now formally incorporated into the Wi- Fi 802.11-2012 standard, which specifies a hybrid wireless mesh networking protocol (HWMP). In order to quickly analyze changes to the routing algorithm and to support optimizing the mesh network behavior for our intended application a visualization tool was developed by modifying and integrating open source tools.
Fastest Distributed Consensus on Star-Mesh Hybrid Sensor Networks
Jafarizadeh, Saber
2010-01-01
Solving Fastest Distributed Consensus (FDC) averaging problem over sensor networks with different topologies has received some attention recently and one of the well known topologies in this issue is star-mesh hybrid topology. Here in this work we present analytical solution for the problem of FDC algorithm by means of stratification and semidefinite programming, for the Star-Mesh Hybrid network with K-partite core (SMHK) which has rich symmetric properties. Also the variations of asymptotic and per step convergence rate of SMHK network versus its topological parameters have been studied numerically.
Development and Verification of Unstructured Adaptive Mesh Technique with Edge Compatibility
Ito, Kei; Kunugi, Tomoaki; Ohshima, Hiroyuki
In the design study of the large-sized sodium-cooled fast reactor (JSFR), one key issue is suppression of gas entrainment (GE) phenomena at a gas-liquid interface. Therefore, the authors have been developed a high-precision CFD algorithm to evaluate the GE phenomena accurately. The CFD algorithm has been developed on unstructured meshes to establish an accurate modeling of JSFR system. For two-phase interfacial flow simulations, a high-precision volume-of-fluid algorithm is employed. It was confirmed that the developed CFD algorithm could reproduce the GE phenomena in a simple GE experiment. Recently, the authors have been developed an important technique for the simulation of the GE phenomena in JSFR. That is an unstructured adaptive mesh technique which can apply fine cells dynamically to the region where the GE occurs in JSFR. In this paper, as a part of the development, a two-dimensional unstructured adaptive mesh technique is discussed. In the two-dimensional adaptive mesh technique, each cell is refined isotropically to reduce distortions of the mesh. In addition, connection cells are formed to eliminate the edge incompatibility between refined and non-refined cells. The two-dimensional unstructured adaptive mesh technique is verified by solving well-known lid-driven cavity flow problem. As a result, the two-dimensional unstructured adaptive mesh technique succeeds in providing a high-precision solution, even though poor-quality distorted initial mesh is employed. In addition, the simulation error on the two-dimensional unstructured adaptive mesh is much less than the error on the structured mesh with a larger number of cells.
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.
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.
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.
Dynamic Resource Management in 802.11 Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
George Athanasiou
2012-01-01
Full Text Available The association/handoff procedures are important components in a balanced operation of 802.11-based wireless mesh networks. In this paper, we introduce the concept of cooperative association where the stations (STA can share useful information in order to improve the performance of the association/reassociation procedures. Furthermore, in this work we introduce a load balancing mechanism that can be applied in mesh networks. This mechanism operates in a cross-layer manner taking into account uplink and downlink channel information, routing information, and congestion-based information. Our load balancing mechanism is based on a fairness index that is measured at each access point (AP neighborhood. This index reflects the way the communication load is shared in the neighboring APs. The iterative heuristic algorithms that we propose controls the communication load of each mesh AP in a distributed manner. We evaluate the performance of our mechanisms through OPNET simulations.
Institute of Scientific and Technical Information of China (English)
覃德泽
2011-01-01
提出一种基于模拟退火的优化算法来解决路由问题.模拟退火算法以加权累积期望传输时间为代价函数来寻找最佳路由方式.系统仿真基于802.11无线网络,分别比较使用基于模拟退火的路由算法和最短路由算法情况下的网络吞吐量和丢包率.仿真结果显示,基于模拟退火的路由算法比最短路由算法具有更好的性能.%An optimization algorithm based on simulated annealing was proposed to solve the routing problem. The simulated annealing (SA) algorithm looked for the best routing strategy by taking the weighted cumulative expectations transmission time as the cost function. The simulation that operated based on 802. 11 wireless networks compared the network throughput and the packet loss ratio by using SA-based routing algorithm and the shortest path routing strategy respectively. The results show that SA-based routing algorithm had a better performance than that of the shortest path routing algorithm.
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.
Akl, Selim G
1985-01-01
Parallel Sorting Algorithms explains how to use parallel algorithms to sort a sequence of items on a variety of parallel computers. The book reviews the sorting problem, the parallel models of computation, parallel algorithms, and the lower bounds on the parallel sorting problems. The text also presents twenty different algorithms, such as linear arrays, mesh-connected computers, cube-connected computers. Another example where algorithm can be applied is on the shared-memory SIMD (single instruction stream multiple data stream) computers in which the whole sequence to be sorted can fit in the
An Efficient Method For Multichannel Wireless Mesh Networks With Pulse Coupled Neural Network
Sobana, S
2012-01-01
Multi cast communication is a key technology for wireless mesh networks. Multicast provides efficient data distribution among a group of nodes, Generally sensor networks and MANETs uses multicast algorithms which are designed to be energy efficient and to achieve optimal route discovery among mobile nodes whereas wireless mesh networks needs to maximize throughput. Here we propose two multicast algorithms: The Level Channel Assignment (LCA) algorithm and the Multi-Channel Multicast (MCM) algorithm to improve the throughput for multichannel sand multi interface mesh networks. The algorithm builds efficient multicast trees by minimizing the number of relay nodes and total hop count distance of the trees. Shortest path computation is a classical combinatorial optimization problem. Neural networks have been used for processing path optimization problem. Pulse Coupled Neural Networks (PCNNS) suffer from high computational cast for very long paths we propose a new PCNN modal called dual source PCNN (DSPCNN) which c...
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...
Agent-based Algorithm for Spatial Distribution of Objects
Collier, Nathan
2012-06-02
In this paper we present an agent-based algorithm for the spatial distribution of objects. The algorithm is a generalization of the bubble mesh algorithm, initially created for the point insertion stage of the meshing process of the finite element method. The bubble mesh algorithm treats objects in space as bubbles, which repel and attract each other. The dynamics of each bubble are approximated by solving a series of ordinary differential equations. We present numerical results for a meshing application as well as a graph visualization application.
An arbitrary boundary triangle mesh generation method for multi-modality imaging
Zhang, Xuanxuan; Deng, Yong; Gong, Hui; Meng, Yuanzheng; Yang, Xiaoquan; Luo, Qingming
2012-03-01
Low-resolution and ill-posedness are the major challenges in diffuse optical tomography(DOT)/fluorescence molecular tomography(FMT). Recently, the multi-modality imaging technology that combines micro-computed tomography (micro-CT) with DOT/FMT is developed to improve resolution and ill-posedness. To take advantage of the fine priori anatomical maps obtained from micro-CT, we present an arbitrary boundary triangle mesh generation method for FMT/DOT/micro-CT multi-modality imaging. A planar straight line graph (PSLG) based on the image of micro-CT is obtained by an adaptive boundary sampling algorithm. The subregions of mesh are accurately matched with anatomical structures by a two-step solution, firstly, the triangles and nodes during mesh refinement are labeled respectively, and then a revising algorithm is used to modifying meshes of each subregion. The triangle meshes based on a regular model and a micro-CT image are generated respectively. The results show that the subregions of triangle meshes can match with anatomical structures accurately and triangle meshes have good quality. This provides an arbitrary boundaries triangle mesh generation method with the ability to incorporate the fine priori anatomical information into DOT/FMT reconstructions.
Mesh Resolution Effect on 3D RANS Turbomachinery Flow Simulations
Yershov, Sergiy
2016-01-01
The paper presents the study of the effect of a mesh refinement on numerical results of 3D RANS computations of turbomachinery flows. The CFD solver F, which based on the second-order accurate ENO scheme, is used in this study. The simplified multigrid algorithm and local time stepping permit decreasing computational time. The flow computations are performed for a number of turbine and compressor cascades and stages. In all flow cases, the successively refined meshes of H-type with an approximate orthogonalization near the solid walls were generated. The results obtained are compared in order to estimate their both mesh convergence and ability to resolve the transonic flow pattern. It is concluded that for thorough studying the fine phenomena of the 3D turbomachinery flows, it makes sense to use the computational meshes with the number of cells from several millions up to several hundred millions per a single turbomachinery blade channel, while for industrial computations, a mesh of about or less than one mil...
RBFs-MSA Hybrid Method for Mesh Deformation
Institute of Scientific and Technical Information of China (English)
LIU Yu; GUO Zheng; LIU Jun
2012-01-01
Simulating unsteady flow phenomena involving moving boundaries is a challenging task,one key requirement of which is a reliable and fast algorithm to deform the computational mesh.Radial basis functions (RBFs) interpolation is a very simple and robust method to deform the mesh.However,the number of operations and the requirement of memory storage will be increased rapidly as the number of grid nodes increases,which limits the application of RBFs to three-dimensional (3D) moving mesh.Moving submesh approach (MSA) is an efficient method,but its robustness depends on the method used to deform the background mesh.A hybrid method which combines the benefits of MSA and RBFs interpolation,which is called RBFs-MSA,has been presented.This hybrid method is proved to be robust and efficient via several numerical examples.From the aspect of the quality of deforming meshes,this hybrid method is comparable with the RBFs interpolation; from the aspect of computing efficiency,one test case shows that RBFs-MSA is about two orders of magnitude faster than RBFs interpolation.For these benefits of RBFs-MSA,the new method is suitable for unsteady flow simulation which refers to boundaries movement.
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.
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.
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.
Final Report for LDRD Project on Rapid Problem Setup for Mesh-Based Simulation (Rapsodi)
Energy Technology Data Exchange (ETDEWEB)
Brown, D L; Henshaw, W; Petersson, N A; Fast, P; Chand, K
2003-02-07
Under LLNL Exploratory Research LDRD funding, the Rapsodi project developed rapid setup technology for computational physics and engineering problems that require computational representations of complex geometry. Many simulation projects at LLNL involve the solution of partial differential equations in complex 3-D geometries. A significant bottleneck in carrying out these simulations arises in converting some specification of a geometry, such as a computer-aided design (CAD) drawing to a computationally appropriate 3-D mesh that can be used for simulation and analysis. Even using state-of-the-art mesh generation software, this problem setup step typically has required weeks or months, which is often much longer than required to carry out the computational simulation itself. The Rapsodi project built computational tools and designed algorithms that help to significantly reduce this setup time to less than a day for many realistic problems. The project targeted rapid setup technology for computational physics and engineering problems that use mixed-element unstructured meshes, overset meshes or Cartesian-embedded boundary (EB) meshes to represent complex geometry. It also built tools that aid in constructing computational representations of geometry for problems that do not require a mesh. While completely automatic mesh generation is extremely difficult, the amount of manual labor required can be significantly reduced. By developing novel, automated, component-based mesh construction procedures and automated CAD geometry repair and cleanup tools, Rapsodi has significantly reduced the amount of hand crafting required to generate geometry and meshes for scientific simulation codes.
Implementation of tetrahedral-mesh geometry in Monte Carlo radiation transport code PHITS
Furuta, Takuya; Sato, Tatsuhiko; Han, Min Cheol; Yeom, Yeon Soo; Kim, Chan Hyeong; Brown, Justin L.; Bolch, Wesley E.
2017-06-01
A new function to treat tetrahedral-mesh geometry was implemented in the particle and heavy ion transport code systems. To accelerate the computational speed in the transport process, an original algorithm was introduced to initially prepare decomposition maps for the container box of the tetrahedral-mesh geometry. The computational performance was tested by conducting radiation transport simulations of 100 MeV protons and 1 MeV photons in a water phantom represented by tetrahedral mesh. The simulation was repeated with varying number of meshes and the required computational times were then compared with those of the conventional voxel representation. Our results show that the computational costs for each boundary crossing of the region mesh are essentially equivalent for both representations. This study suggests that the tetrahedral-mesh representation offers not only a flexible description of the transport geometry but also improvement of computational efficiency for the radiation transport. Due to the adaptability of tetrahedrons in both size and shape, dosimetrically equivalent objects can be represented by tetrahedrons with a much fewer number of meshes as compared its voxelized representation. Our study additionally included dosimetric calculations using a computational human phantom. A significant acceleration of the computational speed, about 4 times, was confirmed by the adoption of a tetrahedral mesh over the traditional voxel mesh geometry.
Resource optimization scheme for multimedia-enabled wireless mesh networks.
Ali, Amjad; Ahmed, Muhammad Ejaz; Piran, Md Jalil; Suh, Doug Young
2014-08-08
Wireless mesh networking is a promising technology that can support numerous multimedia applications. Multimedia applications have stringent quality of service (QoS) requirements, i.e., bandwidth, delay, jitter, and packet loss ratio. Enabling such QoS-demanding applications over wireless mesh networks (WMNs) require QoS provisioning routing protocols that lead to the network resource underutilization problem. Moreover, random topology deployment leads to have some unused network resources. Therefore, resource optimization is one of the most critical design issues in multi-hop, multi-radio WMNs enabled with multimedia applications. Resource optimization has been studied extensively in the literature for wireless Ad Hoc and sensor networks, but existing studies have not considered resource underutilization issues caused by QoS provisioning routing and random topology deployment. Finding a QoS-provisioned path in wireless mesh networks is an NP complete problem. In this paper, we propose a novel Integer Linear Programming (ILP) optimization model to reconstruct the optimal connected mesh backbone topology with a minimum number of links and relay nodes which satisfies the given end-to-end QoS demands for multimedia traffic and identification of extra resources, while maintaining redundancy. We further propose a polynomial time heuristic algorithm called Link and Node Removal Considering Residual Capacity and Traffic Demands (LNR-RCTD). Simulation studies prove that our heuristic algorithm provides near-optimal results and saves about 20% of resources from being wasted by QoS provisioning routing and random topology deployment.
Moh. Zikky
2016-01-01
Shortest pathfinding problem has become a populer issue in Game’s Artificial Intelligent (AI). This paper discussed the effective way to optimize the shortest pathfinding problem, namely Navigation Mesh (NavMesh). This method is very interesting because it has a large area of implementation, especially in games world. In this paper, NavMesh was implemented by using A* (A star) algorithm and examined in Unity 3D game engine. A* was an effective algorithm in shortest pathfinding problem because...
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.
Energy Technology Data Exchange (ETDEWEB)
Ibrahim, Ahmad M., E-mail: ibrahimam@ornl.gov [Oak Ridge National Laboratory, P.O. Box 2008, Oak Ridge, TN 37831 (United States); Wilson, Paul P. [University of Wisconsin-Madison, 1500 Engineering Dr., Madison, WI 53706 (United States); Sawan, Mohamed E., E-mail: sawan@engr.wisc.edu [University of Wisconsin-Madison, 1500 Engineering Dr., Madison, WI 53706 (United States); Mosher, Scott W.; Peplow, Douglas E.; Grove, Robert E. [Oak Ridge National Laboratory, P.O. Box 2008, Oak Ridge, TN 37831 (United States)
2014-10-15
Highlights: •Calculate the prompt dose rate everywhere throughout the entire fusion energy facility. •Utilize FW-CADIS to accurately perform difficult neutronics calculations for fusion energy systems. •Develop three mesh adaptivity algorithms to enhance FW-CADIS efficiency in fusion-neutronics calculations. -- Abstract: Three mesh adaptivity algorithms were developed to facilitate and expedite the use of the CADIS and FW-CADIS hybrid Monte Carlo/deterministic techniques in accurate full-scale neutronics simulations of fusion energy systems with immense sizes and complicated geometries. First, a macromaterial approach enhances the fidelity of the deterministic models without changing the mesh. Second, a deterministic mesh refinement algorithm generates meshes that capture as much geometric detail as possible without exceeding a specified maximum number of mesh elements. Finally, a weight window coarsening algorithm decouples the weight window mesh and energy bins from the mesh and energy group structure of the deterministic calculations in order to remove the memory constraint of the weight window map from the deterministic mesh resolution. The three algorithms were used to enhance an FW-CADIS calculation of the prompt dose rate throughout the ITER experimental facility and resulted in a 23.3% increase in the number of mesh tally elements in which the dose rates were calculated in a 10-day Monte Carlo calculation. Additionally, because of the significant increase in the efficiency of FW-CADIS simulations, the three algorithms enabled this difficult calculation to be accurately solved on a regular computer cluster, eliminating the need for a world-class super computer.
Directory of Open Access Journals (Sweden)
K.Senthamil Selvan
2013-04-01
Full Text Available Wireless mesh networking has transpired as a gifted technology for potential broadband wireless access.In a communication network, wireless mesh network plays a vital role in transmission and are structured ina mesh topology. The coordination of mesh routers and mesh clients forms the wireless mesh networkswhich are routed through the gateways. Wireless mesh networks uses IEEE 802.11 standards and has itswide applications broadband home networking and enterprise networking deployment such as Microsoftwireless mesh and MIT etc. A professional Qos provisioning in intra cluster packet level resourceallocation for WMN approach takes power allocation, sub carrier allocation and packet scheduling. Thisapproach combines the merits of a Karush-Kuhn-Tucker (KKT algorithm and a genetic algorithm (GAbased approach. The KKT algorithm uses uniform power allocation over all the subcarriers, based on theoptimal allocation criterion. The genetic algorithm is used to generate useful solutions to optimization andsearch problems and it is also used for search problems. By combining the intrinsic worth of both theapproaches, it facilitates effective QOS provisioning at the packet level. It is concluded that, this approachachieves a preferred stability between system implementation and computational convolution.
Fitting polynomial surfaces to triangular meshes with Voronoi squared distance minimization
Nivoliers, Vincent
2012-11-06
This paper introduces Voronoi squared distance minimization (VSDM), an algorithm that fits a surface to an input mesh. VSDM minimizes an objective function that corresponds to a Voronoi-based approximation of the overall squared distance function between the surface and the input mesh (SDM). This objective function is a generalization of the one minimized by centroidal Voronoi tessellation, and can be minimized by a quasi-Newton solver. VSDM naturally adapts the orientation of the mesh elements to best approximate the input, without estimating any differential quantities. Therefore, it can be applied to triangle soups or surfaces with degenerate triangles, topological noise and sharp features. Applications of fitting quad meshes and polynomial surfaces to input triangular meshes are demonstrated. © 2012 Springer-Verlag London.
Fitting polynomial surfaces to triangular meshes with Voronoi Squared Distance Minimization
Nivoliers, Vincent
2011-12-01
This paper introduces Voronoi Squared Distance Minimization (VSDM), an algorithm that fits a surface to an input mesh. VSDM minimizes an objective function that corresponds to a Voronoi-based approximation of the overall squared distance function between the surface and the input mesh (SDM). This objective function is a generalization of Centroidal Voronoi Tesselation (CVT), and can be minimized by a quasi-Newton solver. VSDM naturally adapts the orientation of the mesh to best approximate the input, without estimating any differential quantities. Therefore it can be applied to triangle soups or surfaces with degenerate triangles, topological noise and sharp features. Applications of fitting quad meshes and polynomial surfaces to input triangular meshes are demonstrated.
Estimation Normal Vector of Triangular Mesh Vertex by Angle and Centroid Weights and its Application
Directory of Open Access Journals (Sweden)
Yueping Chen
2013-04-01
Full Text Available To compute vertex normal of triangular meshes more accurately, this paper presents an improved algorithm based on angle and centroid weights. Firstly, four representational algorithms are analyzed by comparing their weighting characteristics such as angles, areas and centroids. The drawbacks of each algorithm are discussed. Following that, an improved algorithm is put forward based on angle and centroid weights. Finally, by taking the deviation angle between the nominal normal vector and the estimated one as the error evaluation standard factor, the triangular mesh models of spheres, ellipsoids, paraboloids and cylinders are used to analyze the performance of all these estimation algorithms. The machining and inspection operations of one mould part are conducted to verify the improved algorithm. Experimental results demonstrate that the algorithm is effective.
Grouper: A Compact, Streamable Triangle Mesh Data Structure
Energy Technology Data Exchange (ETDEWEB)
Luffel, Mark [Georgia Inst. of Technology, Atlanta, GA (United States). Visualization and Usability Center (GVU); Gurung, Topraj [Georgia Inst. of Technology, Atlanta, GA (United States). Visualization and Usability Center (GVU); Lindstrom, Peter [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Rossignac, Jarek [Georgia Inst. of Technology, Atlanta, GA (United States). Visualization and Usability Center (GVU)
2014-01-01
Here, we present Grouper: an all-in-one compact file format, random-access data structure, and streamable representation for large triangle meshes. Similarly to the recently published SQuad representation, Grouper represents the geometry and connectivity of a mesh by grouping vertices and triangles into fixed-size records, most of which store two adjacent triangles and a shared vertex. Unlike SQuad, however, Grouper interleaves geometry with connectivity and uses a new connectivity representation to ensure that vertices and triangles can be stored in a coherent order that enables memory-efficient sequential stream processing. We also present a linear-time construction algorithm that allows streaming out Grouper meshes using a small memory footprint while preserving the initial ordering of vertices. In this construction, we show how the problem of assigning vertices and triangles to groups reduces to a well-known NP-hard optimization problem, and present a simple yet effective heuristic solution that performs well in practice. Our array-based Grouper representation also doubles as a triangle mesh data structure that allows direct access to vertices and triangles. Storing only about two integer references per triangle-i.e., less than the three vertex references stored with each triangle in a conventional indexed mesh format-Grouper answers both incidence and adjacency queries in amortized constant time. Our compact representation enables data-parallel processing on multicore computers, instant partitioning and fast transmission for distributed processing, as well as efficient out-of-core access. We demonstrate the versatility and performance benefits of Grouper using a suite of example meshes and processing kernels.
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...
A Novel Coarsening Method for Scalable and Efficient Mesh Generation
Energy Technology Data Exchange (ETDEWEB)
Yoo, A; Hysom, D; Gunney, B
2010-12-02
matrix-vector multiplication can be performed locally on each processor and hence to minimize communication. Furthermore, a good graph partitioning scheme ensures the equal amount of computation performed on each processor. Graph partitioning is a well known NP-complete problem, and thus the most commonly used graph partitioning algorithms employ some forms of heuristics. These algorithms vary in terms of their complexity, partition generation time, and the quality of partitions, and they tend to trade off these factors. A significant challenge we are currently facing at the Lawrence Livermore National Laboratory is how to partition very large meshes on massive-size distributed memory machines like IBM BlueGene/P, where scalability becomes a big issue. For example, we have found that the ParMetis, a very popular graph partitioning tool, can only scale to 16K processors. An ideal graph partitioning method on such an environment should be fast and scale to very large meshes, while producing high quality partitions. This is an extremely challenging task, as to scale to that level, the partitioning algorithm should be simple and be able to produce partitions that minimize inter-processor communications and balance the load imposed on the processors. Our goals in this work are two-fold: (1) To develop a new scalable graph partitioning method with good load balancing and communication reduction capability. (2) To study the performance of the proposed partitioning method on very large parallel machines using actual data sets and compare the performance to that of existing methods. The proposed method achieves the desired scalability by reducing the mesh size. For this, it coarsens an input mesh into a smaller size mesh by coalescing the vertices and edges of the original mesh into a set of mega-vertices and mega-edges. A new coarsening method called brick algorithm is developed in this research. In the brick algorithm, the zones in a given mesh are first grouped into fixed size
Shepherd, Jason; Mitchell, Scott A.; Jankovich, Steven R.; Benzley, Steven E.
2007-05-15
The present invention provides a meshing method, called grafting, that lifts the prior art constraint on abutting surfaces, including surfaces that are linking, source/target, or other types of surfaces of the trunk volume. The grafting method locally modifies the structured mesh of the linking surfaces allowing the mesh to conform to additional surface features. Thus, the grafting method can provide a transition between multiple sweep directions extending sweeping algorithms to 23/4-D solids. The method is also suitable for use with non-sweepable volumes; the method provides a transition between meshes generated by methods other than sweeping as well.
Assigning categorical information to Japanese medical terms using MeSH and MEDLINE.
Onogi, Yuzo
2007-01-01
This paper reports on the assigning of MeSH (Medical Subject Headings) categories to Japanese terms in an English-Japanese dictionary using the titles and abstracts of articles indexed in MEDLINE. In a previous study, 30,000 of 80,000 terms in the dictionary were mapped to MeSH terms by normalized comparison. It was reasoned that if the remaining dictionary terms appeared in MEDLINE-indexed articles that are indexed using MeSH terms, then relevancies between the dictionary terms and MeSH terms could be calculated, and thus MeSH categories assigned. This study compares two approaches for calculating the weight matrix. One is the TF*IDF method and the other uses the inner product of two weight matrices. About 20,000 additional dictionary terms were identified in MEDLINE-indexed articles published between 2000 and 2004. The precision and recall of these algorithms were evaluated separately for MeSH terms and non-MeSH terms. Unfortunately, the precision and recall of the algorithms was not good, but this method will help with manual assignment of MeSH categories to dictionary terms.
Design of computer-generated beam-shaping holograms by iterative finite-element mesh adaption.
Dresel, T; Beyerlein, M; Schwider, J
1996-12-10
Computer-generated phase-only holograms can be used for laser beam shaping, i.e., for focusing a given aperture with intensity and phase distributions into a pregiven intensity pattern in their focal planes. A numerical approach based on iterative finite-element mesh adaption permits the design of appropriate phase functions for the task of focusing into two-dimensional reconstruction patterns. Both the hologram aperture and the reconstruction pattern are covered by mesh mappings. An iterative procedure delivers meshes with intensities equally distributed over the constituting elements. This design algorithm adds new elementary focuser functions to what we call object-oriented hologram design. Some design examples are discussed.
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...
Institute of Scientific and Technical Information of China (English)
向兵; 虞红芳; 王晟; 李乐民
2005-01-01
该文综合考虑WDM网状网生存性及业务量疏导,采用部分光路共享保护机制为低速业务提供满足其可靠性和带宽需求的连接,提出了一种基于波长分层图的支持业务量疏导的区分共享保护算法-部分共享保护业务量疏导算法PSPTG(Partial Shared-path Protection algorithm supporting Traffic Grooming).仿真结果表明:该算法可以较好地利用资源.
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...
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.
A priori mesh grading for the numerical calculation of the head-related transfer functions.
Ziegelwanger, Harald; Kreuzer, Wolfgang; Majdak, Piotr
2016-12-15
Head-related transfer functions (HRTFs) describe the directional filtering of the incoming sound caused by the morphology of a listener's head and pinnae. When an accurate model of a listener's morphology exists, HRTFs can be calculated numerically with the boundary element method (BEM). However, the general recommendation to model the head and pinnae with at least six elements per wavelength renders the BEM as a time-consuming procedure when calculating HRTFs for the full audible frequency range. In this study, a mesh preprocessing algorithm is proposed, viz., a priori mesh grading, which reduces the computational costs in the HRTF calculation process significantly. The mesh grading algorithm deliberately violates the recommendation of at least six elements per wavelength in certain regions of the head and pinnae and varies the size of elements gradually according to an a priori defined grading function. The evaluation of the algorithm involved HRTFs calculated for various geometric objects including meshes of three human listeners and various grading functions. The numerical accuracy and the predicted sound-localization performance of calculated HRTFs were analyzed. A-priori mesh grading appeared to be suitable for the numerical calculation of HRTFs in the full audible frequency range and outperformed uniform meshes in terms of numerical errors, perception based predictions of sound-localization performance, and computational costs.
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
An efficient approach for feature-preserving mesh denoising
Lu, Xuequan; Liu, Xiaohong; Deng, Zhigang; Chen, Wenzhi
2017-03-01
With the growing availability of various optical and laser scanners, it is easy to capture different kinds of mesh models which are inevitably corrupted with noise. Although many mesh denoising methods proposed in recent years can produce encouraging results, most of them still suffer from their computational efficiencies. In this paper, we propose a highly efficient approach for mesh denoising while preserving geometric features. Specifically, our method consists of three steps: initial vertex filtering, normal estimation, and vertex update. At the initial vertex filtering step, we introduce a fast iterative vertex filter to substantially reduce noise interference. With the initially filtered mesh from the above step, we then estimate face and vertex normals: an unstandardized bilateral filter to efficiently smooth face normals, and an efficient scheme to estimate vertex normals with the filtered face normals. Finally, at the vertex update step, by utilizing both the filtered face normals and estimated vertex normals obtained from the previous step, we propose a novel iterative vertex update algorithm to efficiently update vertex positions. The qualitative and quantitative comparisons show that our method can outperform the selected state of the art methods, in particular, its computational efficiency (up to about 32 times faster).
ROAMing terrain (Real-time Optimally Adapting Meshes)
Energy Technology Data Exchange (ETDEWEB)
Duchaineau, M.; Wolinsky, M.; Sigeti, D.E.; Miller, M.C.; Aldrich, C.; Mineev, M.
1997-07-01
Terrain visualization is a difficult problem for applications requiring accurate images of large datasets at high frame rates, such as flight simulation and ground-based aircraft testing using synthetic sensor stimulation. On current graphics hardware, the problem is to maintain dynamic, view-dependent triangle meshes and texture maps that produce good images at the required frame rate. We present an algorithm for constructing triangle meshes that optimizes flexible view-dependent error metrics, produces guaranteed error bounds, achieves specified triangle counts directly, and uses frame-to-frame coherence to operate at high frame rates for thousands of triangles per frame. Our method, dubbed Real-time Optimally Adapting Meshes (ROAM), uses two priority queues to drive split and merge operations that maintain continuous triangulations built from pre-processed bintree triangles. We introduce two additional performance optimizations: incremental triangle stripping and priority-computation deferral lists. ROAM execution time is proportionate to the number of triangle changes per frame, which is typically a few percent of the output mesh size, hence ROAM performance is insensitive to the resolution and extent of the input terrain. Dynamic terrain and simple vertex morphing are supported.
Practical implementation of tetrahedral mesh reconstruction in emission tomography
Boutchko, R.; Sitek, A.; Gullberg, G. T.
2013-05-01
This paper presents a practical implementation of image reconstruction on tetrahedral meshes optimized for emission computed tomography with parallel beam geometry. Tetrahedral mesh built on a point cloud is a convenient image representation method, intrinsically three-dimensional and with a multi-level resolution property. Image intensities are defined at the mesh nodes and linearly interpolated inside each tetrahedron. For the given mesh geometry, the intensities can be computed directly from tomographic projections using iterative reconstruction algorithms with a system matrix calculated using an exact analytical formula. The mesh geometry is optimized for a specific patient using a two stage process. First, a noisy image is reconstructed on a finely-spaced uniform cloud. Then, the geometry of the representation is adaptively transformed through boundary-preserving node motion and elimination. Nodes are removed in constant intensity regions, merged along the boundaries, and moved in the direction of the mean local intensity gradient in order to provide higher node density in the boundary regions. Attenuation correction and detector geometric response are included in the system matrix. Once the mesh geometry is optimized, it is used to generate the final system matrix for ML-EM reconstruction of node intensities and for visualization of the reconstructed images. In dynamic PET or SPECT imaging, the system matrix generation procedure is performed using a quasi-static sinogram, generated by summing projection data from multiple time frames. This system matrix is then used to reconstruct the individual time frame projections. Performance of the new method is evaluated by reconstructing simulated projections of the NCAT phantom and the method is then applied to dynamic SPECT phantom and patient studies and to a dynamic microPET rat study. Tetrahedral mesh-based images are compared to the standard voxel-based reconstruction for both high and low signal-to-noise ratio
A Simple Quality Triangulation Algorithm for Complex Geometries
This paper presents a new and simple algorithm for quality triangulation in complex geometries. The proposed algorithm is based on an initial equilateral triangle mesh covering the whole domain. The mesh nodes close to the boundary edges satisfy the so-called non-encroaching criterion: the distance ...
A Novel Approach to Fair Routing in Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
Määttä Juho
2009-01-01
Full Text Available Multiradio wireless mesh network (WMN is a feasible choice for several applications, as routers with multiple network interface cards have become cheaper. Routing in any network has a great impact on the overall network performance, thus a routing protocol or algorithm for WMN should be carefully designed taking into account the specific characteristics of the network. In addition, in wireless networks, serious unfairness can occur between users if the issue is not addressed in the network protocols or algorithms. In this paper, we are proposing a novel centralized routing algorithm, called Subscriber Aware Fair Routing in WMN (SAFARI, for multiradio WMN that assures fairness, leads to a feasible scheduling, and does not collapse the aggregate network throughput with a strict fairness criterion. We show that our protocol is feasible and practical, and exhaustive simulations show that the performance is improved compared to traditional routing algorithms.
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...
A Traffic Grooming Algorithm Based on Shared Protection in WDM Mesh Networks%一种WDM网状网中基于共享保护的业务量疏导算法
Institute of Scientific and Technical Information of China (English)
向兵; 王晟; 李乐民
2004-01-01
在WDM网络中业务的带宽需求远低于一个波长所提供的带宽,业务量疏导可以聚集低速业务到大容量的光路中从而有效地利用波长带宽资源.目前大多数业务量疏导的研究限于环形网,考虑对WDM网状网中低速业务可靠疏导的文献更少.该文综合考虑WDM网状网生存性及业务量疏导,提出了基于波长分层图的共享保护业务量疏导算法(SPTG-LG,Shared Protection Traffic Grooming algorithm ba,sed on wavelength Layered-Graph),并对算法进行了仿真和分析.
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.
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...
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.
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...
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.
Euclidean Distance Distortion Based Robust and Blind Mesh Watermarking
Directory of Open Access Journals (Sweden)
Yesmine Ben Amar
2016-12-01
Full Text Available The three-dimensional (3D polygonal meshes are recently widely used in several domains, which necessitate the realistic visualization of the objects. Moreover, there is an urgent need to protect the 3D data properties for preventing unauthorized reproduction. The 3D digital watermarking technology is one of the best solutions to protect data from piracy during transmission through the internet. The current work proposed a novel robust watermarking scheme of polygonal meshes for copyright protection purposes. The proposed algorithm is based on the characteristics of the mesh geometry to embed a sequence of data bits into the object by slightly adjusting the vertex positions. Furthermore, the proposed method used a blind detection scheme. The watermarked model is perceptually indistinguishable from the original one and the embedded watermark is invariant to affine transformation. Through simulations, the quality of the watermarked object as well as the inserted watermark robustness against various types of attacks were tested and evaluated to prove the validity and the efficiency of our algorithm.
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.
An efficient 3D traveltime calculation using coarse-grid mesh for shallow-depth source
Son, Woohyun; Pyun, Sukjoon; Lee, Ho-Young; Koo, Nam-Hyung; Shin, Changsoo
2016-10-01
3D Kirchhoff pre-stack depth migration requires an efficient algorithm to compute first-arrival traveltimes. In this paper, we exploited a wave-equation-based traveltime calculation algorithm, which is called the suppressed wave equation estimation of traveltime (SWEET), and the equivalent source distribution (ESD) algorithm. The motivation of using the SWEET algorithm is to solve the Laplace-domain wave equation using coarse grid spacing to calculate first-arrival traveltimes. However, if a real source is located at shallow-depth close to free surface, we cannot accurately calculate the wavefield using coarse grid spacing. So, we need an additional algorithm to correctly simulate the shallow source even for the coarse grid mesh. The ESD algorithm is a method to define a set of distributed nodal sources that approximate a point source at the inter-nodal location in a velocity model with large grid spacing. Thanks to the ESD algorithm, we can efficiently calculate the first-arrival traveltimes of waves emitted from shallow source point even when we solve the Laplace-domain wave equation using a coarse-grid mesh. The proposed algorithm is applied to the SEG/EAGE 3D salt model. From the result, we note that the combination of SWEET and ESD algorithms can be successfully used for the traveltime calculation under the condition of a shallow-depth source. We also confirmed that our algorithm using coarse-grid mesh requires less computational time than the conventional SWEET algorithm using relatively fine-grid mesh.
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.
Mesh-free Hamiltonian implementation of two dimensional Darwin model
Siddi, Lorenzo; Lapenta, Giovanni; Gibbon, Paul
2017-08-01
A new approach to Darwin or magnetoinductive plasma simulation is presented, which combines a mesh-free field solver with a robust time-integration scheme avoiding numerical divergence errors in the solenoidal field components. The mesh-free formulation employs an efficient parallel Barnes-Hut tree algorithm to speed up the computation of fields summed directly from the particles, avoiding the necessity of divergence cleaning procedures typically required by particle-in-cell methods. The time-integration scheme employs a Hamiltonian formulation of the Lorentz force, circumventing the development of violent numerical instabilities associated with time differentiation of the vector potential. It is shown that a semi-implicit scheme converges rapidly and is robust to further numerical instabilities which can develop from a dominant contribution of the vector potential to the canonical momenta. The model is validated by various static and dynamic benchmark tests, including a simulation of the Weibel-like filamentation instability in beam-plasma interactions.
Wireless Mesh Network Performance for Urban Search and Rescue Missions
Directory of Open Access Journals (Sweden)
Cristina Ribeiro
2010-03-01
Full Text Available In this paper we demonstrate that the Canine Pose Estimation (CPE system can provide a reliable estimate for some poses and when coupled with effective wireless transmission over a mesh network. Poseestimates are time sensitive, thus it is important that pose data arrives at its destination quickly. Propagation delay and packet delivery ratio measuring algorithms were developed and used to appraise Wireless Mesh Network (WMN performance as a means of carriage for this time-critical data. The experiments were conducted in the rooms of a building where the radio characteristics closely resembled those of a partially collapsed building—a typical US&R environment. This paper presents the results of the experiments, which demonstrate that it is possible to receive the canine pose estimation data in realtime although accuracy of the results depend on the network size and the deployment environment.
A moving mesh unstaggered constrained transport scheme for magnetohydrodynamics
Mocz, Philip; Springel, Volker; Vogelsberger, Mark; Marinacci, Federico; Hernquist, Lars
2016-01-01
We present a constrained transport (CT) algorithm for solving the 3D ideal magnetohydrodynamic (MHD) equations on a moving mesh, which maintains the divergence-free condition on the magnetic field to machine-precision. Our CT scheme uses an unstructured representation of the magnetic vector potential, making the numerical method simple and computationally efficient. The scheme is implemented in the moving mesh code Arepo. We demonstrate the performance of the approach with simulations of driven MHD turbulence, a magnetized disc galaxy, and a cosmological volume with primordial magnetic field. We compare the outcomes of these experiments to those obtained with a previously implemented Powell divergence-cleaning scheme. While CT and the Powell technique yield similar results in idealized test problems, some differences are seen in situations more representative of astrophysical flows. In the turbulence simulations, the Powell cleaning scheme artificially grows the mean magnetic field, while CT maintains this co...
Fault-Tolerant Tree-Based Multicasting in Mesh Multicomputers
Institute of Scientific and Technical Information of China (English)
WU Jie; CHEN Xiao
2001-01-01
We propose a fault-tolerant tree-based multicast algorithm for 2-dimensional (2-D) meshes based on the concept of the extended safety level which is a vector associated with each node to capture fault information in the neighborhood. In this approach each destination is reached through a minimum number of hops. In order to minimize the total number of traffic steps, three heuristic strategies are proposed. This approach can be easily implemented by pipelined circuit switching (PCS). A simulation study is conducted to measure the total number of traffic steps under different strategies. Our approach is the first attempt to address the faulttolerant tree-based multicast problem in 2-D meshes based on limited global information with a simple model and succinct information.
Joint Graph Layouts for Visualizing Collections of Segmented Meshes
Ren, Jing
2017-09-12
We present a novel and efficient approach for computing joint graph layouts and then use it to visualize collections of segmented meshes. Our joint graph layout algorithm takes as input the adjacency matrices for a set of graphs along with partial, possibly soft, correspondences between nodes of different graphs. We then use a two stage procedure, where in the first step, we extend spectral graph drawing to include a consistency term so that a collection of graphs can be handled jointly. Our second step extends metric multi-dimensional scaling with stress majorization to the joint layout setting, while using the output of the spectral approach as initialization. Further, we discuss a user interface for exploring a collection of graphs. Finally, we show multiple example visualizations of graphs stemming from collections of segmented meshes and we present qualitative and quantitative comparisons with previous work.
Wireless Mesh Network Performance for Urban Search and Rescue Missions
Ribeiro, Cristina; Tran, Jimmy; 10.5121/ijcnc.2010.2203
2010-01-01
In this paper we demonstrate that the Canine Pose Estimation (CPE) system can provide a reliable estimate for some poses and when coupled with effective wireless transmission over a mesh network. Pose estimates are time sensitive, thus it is important that pose data arrives at its destination quickly. Propagation delay and packet delivery ratio measuring algorithms were developed and used to appraise Wireless Mesh Network (WMN) performance as a means of carriage for this time-critical data. The experiments were conducted in the rooms of a building where the radio characteristics closely resembled those of a partially collapsed building-a typical US&R environment. This paper presents the results of the experiments, which demonstrate that it is possible to receive the canine pose estimation data in realtime although accuracy of the results depend on the network size and the deployment environment.
Fracture and Fragmentation of Simplicial Finite Elements Meshes using Graphs
Energy Technology Data Exchange (ETDEWEB)
Mota, A; Knap, J; Ortiz, M
2006-10-18
An approach for the topological representation of simplicial finite element meshes as graphs is presented. It is shown that by using a graph, the topological changes induced by fracture reduce to a few, local kernel operations. The performance of the graph representation is demonstrated and analyzed, using as reference the 3D fracture algorithm by Pandolfi and Ortiz [22]. It is shown that the graph representation initializes in O(N{sub E}{sup 1.1}) time and fractures in O(N{sub I}{sup 1.0}) time, while the reference implementation requires O(N{sub E}{sup 2.1}) time to initialize and O(N{sub I}{sup 1.9}) time to fracture, where NE is the number of elements in the mesh and N{sub I} is the number of interfaces to fracture.
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.
An Efficient Mesh Generation Method for Fractured Network System Based on Dynamic Grid Deformation
Directory of Open Access Journals (Sweden)
Shuli Sun
2013-01-01
Full Text Available Meshing quality of the discrete model influences the accuracy, convergence, and efficiency of the solution for fractured network system in geological problem. However, modeling and meshing of such a fractured network system are usually tedious and difficult due to geometric complexity of the computational domain induced by existence and extension of fractures. The traditional meshing method to deal with fractures usually involves boundary recovery operation based on topological transformation, which relies on many complicated techniques and skills. This paper presents an alternative and efficient approach for meshing fractured network system. The method firstly presets points on fractures and then performs Delaunay triangulation to obtain preliminary mesh by point-by-point centroid insertion algorithm. Then the fractures are exactly recovered by local correction with revised dynamic grid deformation approach. Smoothing algorithm is finally applied to improve the quality of mesh. The proposed approach is efficient, easy to implement, and applicable to the cases of initial existing fractures and extension of fractures. The method is successfully applied to modeling of two- and three-dimensional discrete fractured network (DFN system in geological problems to demonstrate its effectiveness and high efficiency.
On the Meshing Efficiency of 2K-2H Type Planetary Gear Reducer
Directory of Open Access Journals (Sweden)
Long-Chang Hsieh
2013-01-01
Full Text Available This paper proposes 2K–2H type planetary gear reducer and analyzes its meshing efficiency. First, according to the concept of train value equation, the kinematic design of 2K–2H type planetary gear reducers is carried out. Three 2K–2H type planetary gear reducers are designed to illustrate the design algorithm. Then, based on the latent power theorem, the meshing efficiency equation of 2K–2H type planetary gear reducer is derived. According to the meshing efficiency equation, the meshing efficiencies of 2K–2H type planetary gear reducers are analyzed. The 2K–2H type planetary gear reducer has the following characteristics. (1 There is a power circulation in 2K–2H type planetary gear reducer. (2 Larger reduction ratio makes less meshing efficiency. (3 For the same reduction ratio, larger value ξ42 (ξα will get better meshing efficiency. (4 For 2K–2H type planetary gear reducer, the quality of gears is an important factor. (5 The efficiency of gears manufactured by grinding is only improved by 1.5%; however, meshing efficiency of 2K–2H type planetary gear reducer is improved by 28%~44.8%.
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.
Quadrilateral mesh fitting that preserves sharp features based on multi-normals for Laplacian energy
Directory of Open Access Journals (Sweden)
Yusuke Imai
2014-04-01
Full Text Available Because the cost of performance testing using actual products is expensive, manufacturers use lower-cost computer-aided design simulations for this function. In this paper, we propose using hexahedral meshes, which are more accurate than tetrahedral meshes, for finite element analysis. We propose automatic hexahedral mesh generation with sharp features to precisely represent the corresponding features of a target shape. Our hexahedral mesh is generated using a voxel-based algorithm. In our previous works, we fit the surface of the voxels to the target surface using Laplacian energy minimization. We used normal vectors in the fitting to preserve sharp features. However, this method could not represent concave sharp features precisely. In this proposal, we improve our previous Laplacian energy minimization by adding a term that depends on multi-normal vectors instead of using normal vectors. Furthermore, we accentuate a convex/concave surface subset to represent concave sharp features.
Evaluation for Small Visual Difference Between Conforming Meshes on Strain Field
Institute of Scientific and Technical Information of China (English)
Zhe Bian; Shi-Min Hu; Ralph R. Martin
2009-01-01
This paper gives a method of quantifying small visual differences between 3D mesh models with conforming topology, based on the theory of strain fields. Strain field is a geometric quantity in elasticity which is used to describe the deformation of elastomer. In this paper we consider the 3D models as objects with elasticity. The further demonstrations are provided: the first is intended to give the reader a visual impression of how our measure works in practice; and the second is to give readers a visual impression of how our measure works in evaluating filter algorithms. Our experiments show that our difference estimates are well correlated with human perception of differences. This work has applications in the evaluation of 3D mesh watermarking, 3D mesh compression reconstruction, and 3D mesh filtering.
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.
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
Optimal tetrahedral mesh generation for three-dimensional point set
Institute of Scientific and Technical Information of China (English)
秦开怀; 吴边; 关右江; 葛振州
1997-01-01
Three-dimensional (3D) tnangulation is a basic topic in computer graphics. It is considered very difficult to obtain the global optimal 3D triangulatlon, such as the triangulation which satisfies the max-min solid angle criterion A new method called genetic tetrahedral mesh generation algorithm (GTMGA for short) is presented. GT-MGA is based on the principle of genetic algorithm and aims at the global optimal triangulation. With a multi-objective fitness function, GTMGA is able to perform optimizations for different requirements. New crossover operator and mutation operator, polyhedron crossover and polyhedron mutation, are used in GTMGA. It is shown by the experimental results that GTMGA works better than both the 3D Delaunay triangulation and the algorithm based on local transformations.
Energy Technology Data Exchange (ETDEWEB)
Wilson, B G; Sonnad, V
2011-02-14
Precise electronic structure calculations of ions in plasmas benefit from optimized numerical radial meshes. A new closed form expression for obtaining non-linear parameters for the efficient generation of analytic log-linear radial meshes is presented. In conjunction with the (very simple) algorithm for the rapid high precision evaluation of Lambert's W-function, the above identity allows the precise construction of generalized log-linear radial meshes adapted to various constraints.
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.
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
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.
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
Streaming Compression of Tetrahedral Volume Meshes
Energy Technology Data Exchange (ETDEWEB)
Isenburg, M; Lindstrom, P; Gumhold, S; Shewchuk, J
2005-11-21
Geometry processing algorithms have traditionally assumed that the input data is entirely in main memory and available for random access. This assumption does not scale to large data sets, as exhausting the physical memory typically leads to IO-inefficient thrashing. Recent works advocate processing geometry in a 'streaming' manner, where computation and output begin as soon as possible. Streaming is suitable for tasks that require only local neighbor information and batch process an entire data set. We describe a streaming compression scheme for tetrahedral volume meshes that encodes vertices and tetrahedra in the order they are written. To keep the memory footprint low, the compressor is informed when vertices are referenced for the last time (i.e. are finalized). The compression achieved depends on how coherent the input order is and how many tetrahedra are buffered for local reordering. For reasonably coherent orderings and a buffer of 10,000 tetrahedra, we achieve compression rates that are only 25 to 40 percent above the state-of-the-art, while requiring drastically less memory resources and less than half the processing time.
Elliptic Solvers for Adaptive Mesh Refinement Grids
Energy Technology Data Exchange (ETDEWEB)
Quinlan, D.J.; Dendy, J.E., Jr.; Shapira, Y.
1999-06-03
We are developing multigrid methods that will efficiently solve elliptic problems with anisotropic and discontinuous coefficients on adaptive grids. The final product will be a library that provides for the simplified solution of such problems. This library will directly benefit the efforts of other Laboratory groups. The focus of this work is research on serial and parallel elliptic algorithms and the inclusion of our black-box multigrid techniques into this new setting. The approach applies the Los Alamos object-oriented class libraries that greatly simplify the development of serial and parallel adaptive mesh refinement applications. In the final year of this LDRD, we focused on putting the software together; in particular we completed the final AMR++ library, we wrote tutorials and manuals, and we built example applications. We implemented the Fast Adaptive Composite Grid method as the principal elliptic solver. We presented results at the Overset Grid Conference and other more AMR specific conferences. We worked on optimization of serial and parallel performance and published several papers on the details of this work. Performance remains an important issue and is the subject of continuing research work.
Hirt, G.; Schäfer, D.
2010-06-01
For the process design of incremental forming processes like ring rolling or stretch forging there is need for fast and accurate simulation techniques. For many applications it would be necessary to predict the microstructural evolution during the process. For this reason the FEM-software Larstran/Shape which is used for the plastomechanical simulation can be coupled with the microstructure simulation module Strucsim. This software uses phenomenological equations for the calculation of recrystallization (dynamic and static) and grain size evolution [7]. To accelerate the simulation a multi mesh method has been developed. This method uses an adapted simulation mesh with fine elements only in the locally limited contact and forming zone to achieve a reduction of the number of elements. Due to the relative movement of the tool and workpiece the adapted FE-mesh has to be remeshed regularly according to the position of the tool. To avoid loss of information caused by the use of coarse elements the multi mesh method uses a second storage mesh which represents the entire workpiece and which is discretized using only fine elements. For the update of the storage mesh the displacement vectors and changes of scalar values like temperature can be interpolated. For the application of the multi mesh method to the microstructure simulation the update algorithm for the microstructure values has to be modified. The microstructure and plastomechanical simulation have to be uncoupled and the static recrystallization and grain growth outside the forming zone have to be calculated separately. Using the multi mesh method the simulation of incremental bulk metal forming processes including a microstructural simulation can be accelerated. The acceleration factor of the simulation compared to a simulation without adaptive meshing is dependent on the reduction of elements and nodes.
Xin, Qin; Yao, Xiaolan; Engelstad, Paal E.
2010-09-01
Wireless Mesh Networking is an emerging communication paradigm to enable resilient, cost-efficient and reliable services for the future-generation wireless networks. We study here the minimum-latency communication primitive of gossiping (all-to-all communication) in multi-hop ad-hoc Wireless Mesh Networks (WMNs). Each mesh node in the WMN is initially given a message and the objective is to design a minimum-latency schedule such that each mesh node distributes its message to all other mesh nodes. Minimum-latency gossiping problem is well known to be NP-hard even for the scenario in which the topology of the WMN is known to all mesh nodes in advance. In this paper, we propose a new latency-efficient approximation scheme that can accomplish gossiping task in polynomial time units in any ad-hoc WMN under consideration of Large Interference Range (LIR), e.g., the interference range is much larger than the transmission range. To the best of our knowledge, it is first time to investigate such a scenario in ad-hoc WMNs under LIR, our algorithm allows the labels (e.g., identifiers) of the mesh nodes to be polynomially large in terms of the size of the WMN, which is the first time that the scenario of large labels has been considered in ad-hoc WMNs under LIR. Furthermore, our gossiping scheme can be considered as a framework which can be easily implied to the scenario under consideration of mobility-related issues since we assume that the mesh nodes have no knowledge on the network topology even for its neighboring mesh nodes.
RICH: Open-source Hydrodynamic Simulation on a Moving Voronoi Mesh
Yalinewich, Almog; Steinberg, Elad; Sari, Re'em
2015-02-01
We present here RICH, a state-of-the-art two-dimensional hydrodynamic code based on Godunov’s method, on an unstructured moving mesh (the acronym stands for Racah Institute Computational Hydrodynamics). This code is largely based on the code AREPO. It differs from AREPO in the interpolation and time-advancement schemeS as well as a novel parallelization scheme based on Voronoi tessellation. Using our code, we study the pros and cons of a moving mesh (in comparison to a static mesh). We also compare its accuracy to other codes. Specifically, we show that our implementation of external sources and time-advancement scheme is more accurate and robust than is AREPO when the mesh is allowed to move. We performed a parameter study of the cell rounding mechanism (Lloyd iterations) and its effects. We find that in most cases a moving mesh gives better results than a static mesh, but it is not universally true. In the case where matter moves in one way and a sound wave is traveling in the other way (such that relative to the grid the wave is not moving) a static mesh gives better results than a moving mesh. We perform an analytic analysis for finite difference schemes that reveals that a Lagrangian simulation is better than a Eulerian simulation in the case of a highly supersonic flow. Moreover, we show that Voronoi-based moving mesh schemes suffer from an error, which is resolution independent, due to inconsistencies between the flux calculation and the change in the area of a cell. Our code is publicly available as open source and designed in an object-oriented, user-friendly way that facilitates incorporation of new algorithms and physical processes.
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.
Jansen, Gunnar; Sohrabi, Reza; Miller, Stephen A.
2017-02-01
Short for Hexahedra from Unique Location in (K)convex Polyhedra - HULK is a simple and efficient algorithm to generate hexahedral meshes from generic STL files describing a geological model to be used in simulation tools based on the finite element, finite volume or finite difference methods. Using binary space partitioning of the input geometry and octree refinement on the grid, a successive increase in accuracy of the mesh is achieved. We present the theoretical basis as well as the implementation procedure with three geological models with varying complexity, providing the basis on which the algorithm is evaluated. HULK generates high accuracy discretizations with cell counts suitable for state-of-the-art subsurface simulators and provides a new method for hexahedral mesh generation in geological settings.
A shock-fitting technique for cell-centered finite volume methods on unstructured dynamic meshes
Zou, Dongyang; Xu, Chunguang; Dong, Haibo; Liu, Jun
2017-09-01
In this work, the shock-fitting technique is further developed on unstructured dynamic meshes. The shock wave is fitted and regarded as a special boundary, whose boundary conditions and boundary speed (shock speed) are determined by solving Rankine-Hugoniot relations. The fitted shock splits the entire computational region into subregions, in which the flows are free from shocks and flow states are solved by a shock-capturing code based on arbitrary Lagrangian-Eulerian algorithm. Along with the motion of the fitted shock, an unstructured dynamic meshes algorithm is used to update the internal node's position to maintain the high quality of computational meshes. The successful applications prove the present shock-fitting to be a valid technique.
GPU accelerated spectral finite elements on all-hex meshes
Remacle, J.-F.; Gandham, R.; Warburton, T.
2016-11-01
This paper presents a spectral element finite element scheme that efficiently solves elliptic problems on unstructured hexahedral meshes. The discrete equations are solved using a matrix-free preconditioned conjugate gradient algorithm. An additive Schwartz two-scale preconditioner is employed that allows h-independence convergence. An extensible multi-threading programming API is used as a common kernel language that allows runtime selection of different computing devices (GPU and CPU) and different threading interfaces (CUDA, OpenCL and OpenMP). Performance tests demonstrate that problems with over 50 million degrees of freedom can be solved in a few seconds on an off-the-shelf GPU.
Simple pragmatic approach to mesh routing using BATMAN
CSIR Research Space (South Africa)
Johnson, D
2008-10-01
Full Text Available realisation that a routing algorithm for a large static mesh needs to be developed from first principles and as a result the BATMAN project was started. In BATMAN all nodes periodically broadcasts hello packets, also known as originator messages, to its... not have. OLSR was used with the following settings • HELLO interval = 1 second. • Topology Control (TC) interval = 1 second. • HELLO validity interval = 200 seconds. • TC validity interval = 100 seconds. • Fisheye = ON (TC messages are sent with 3...
A novel partitioning method for block-structured adaptive meshes
Fu, Lin; Litvinov, Sergej; Hu, Xiangyu Y.; Adams, Nikolaus A.
2017-07-01
We propose a novel partitioning method for block-structured adaptive meshes utilizing the meshless Lagrangian particle concept. With the observation that an optimum partitioning has high analogy to the relaxation of a multi-phase fluid to steady state, physically motivated model equations are developed to characterize the background mesh topology and are solved by multi-phase smoothed-particle hydrodynamics. In contrast to well established partitioning approaches, all optimization objectives are implicitly incorporated and achieved during the particle relaxation to stationary state. Distinct partitioning sub-domains are represented by colored particles and separated by a sharp interface with a surface tension model. In order to obtain the particle relaxation, special viscous and skin friction models, coupled with a tailored time integration algorithm are proposed. Numerical experiments show that the present method has several important properties: generation of approximately equal-sized partitions without dependence on the mesh-element type, optimized interface communication between distinct partitioning sub-domains, continuous domain decomposition which is physically localized and implicitly incremental. Therefore it is particularly suitable for load-balancing of high-performance CFD simulations.
Generation of high order geometry representations in Octree meshes
Directory of Open Access Journals (Sweden)
Harald G. Klimach
2015-11-01
Full Text Available We propose a robust method to convert triangulated surface data into polynomial volume data. Such polynomial representations are required for high-order partial differential solvers, as low-order surface representations would diminish the accuracy of their solution. Our proposed method deploys a first order spatial bisection algorithm to find robustly an approximation of given geometries. The resulting voxelization is then used to generate Legendre polynomials of arbitrary degree. By embedding the locally defined polynomials in cubical elements of a coarser mesh, this method can reliably approximate even complex structures, like porous media. It thereby is possible to provide appropriate material definitions for high order discontinuous Galerkin schemes. We describe the method to construct the polynomial and how it fits into the overall mesh generation. Our discussion includes numerical properties of the method and we show some results from applying it to various geometries. We have implemented the described method in our mesh generator Seeder, which is publically available under a permissive open-source license.
A novel partitioning method for block-structured adaptive meshes
Energy Technology Data Exchange (ETDEWEB)
Fu, Lin, E-mail: lin.fu@tum.de; Litvinov, Sergej, E-mail: sergej.litvinov@aer.mw.tum.de; Hu, Xiangyu Y., E-mail: xiangyu.hu@tum.de; Adams, Nikolaus A., E-mail: nikolaus.adams@tum.de
2017-07-15
We propose a novel partitioning method for block-structured adaptive meshes utilizing the meshless Lagrangian particle concept. With the observation that an optimum partitioning has high analogy to the relaxation of a multi-phase fluid to steady state, physically motivated model equations are developed to characterize the background mesh topology and are solved by multi-phase smoothed-particle hydrodynamics. In contrast to well established partitioning approaches, all optimization objectives are implicitly incorporated and achieved during the particle relaxation to stationary state. Distinct partitioning sub-domains are represented by colored particles and separated by a sharp interface with a surface tension model. In order to obtain the particle relaxation, special viscous and skin friction models, coupled with a tailored time integration algorithm are proposed. Numerical experiments show that the present method has several important properties: generation of approximately equal-sized partitions without dependence on the mesh-element type, optimized interface communication between distinct partitioning sub-domains, continuous domain decomposition which is physically localized and implicitly incremental. Therefore it is particularly suitable for load-balancing of high-performance CFD simulations.
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.
Energy efficient topology control algorithm for wireless mesh networks
CSIR Research Space (South Africa)
Aron, FO
2008-08-01
Full Text Available initially broadcasts “hello” message with some initial power and after reception of ACKs from the receiving nodes, checks if the current range covers the region of maximal transmission range less the union of the compliment of the relay regions of all...-SPT). In this phase, each node gathers neighbour information and constructs an LM-SPT (as depicted in Figure 2). The phase involves three stages: a) Information collection and exchange:- Each node in this step periodically broadcasts a beacon ‘Hello’ messages...
Barral, N.; Olivier, G.; Alauzet, F.
2017-02-01
Anisotropic metric-based mesh adaptation has proved its efficiency to reduce the CPU time of steady and unsteady simulations while improving their accuracy. However, its extension to time-dependent problems with body-fitted moving geometries is far from straightforward. This paper establishes a well-founded framework for multiscale mesh adaptation of unsteady problems with moving boundaries. This framework is based on a novel space-time analysis of the interpolation error, within the continuous mesh theory. An optimal metric field, called ALE metric field, is derived, which takes into account the movement of the mesh during the adaptation. Based on this analysis, the global fixed-point adaptation algorithm for time-dependent simulations is extended to moving boundary problems, within the range of body-fitted moving meshes and ALE simulations. Finally, three dimensional adaptive simulations with moving boundaries are presented to validate the proposed approach.
Institute of Scientific and Technical Information of China (English)
Huizhi Xu; Shuming Zhou
2004-01-01
All-to-all personalized communication ,or complete exchange ,is at the heart of numerous applications in parallel computing. It is one of the most dense communication patterns. In this paper,we consider this problem in a 2D/ 3D mesh and a multidimensional interconnection network with the wormhole-routing capability. We propose complete exchange algorithms for them respectively. We propose O(mn2)phase algorithm for 2D mesh Pm×Pn and O(mn2l2)phase algorithm for 3D mesh Pm×Pn×Pl,where m,n,l are any positive integers. Also O(ph(G1)n2)phase algorithm is proposed for a multidimensional interconnection network G1×G2,where ph(G1)stands for complete exchange phases of G1 and |G2|=n.
Valiant load-balanced robust routing under hose model for WDM mesh networks
Zhang, Xiaoning; Li, Lemin; Wang, Sheng
2006-09-01
In this paper, we propose Valiant Load-Balanced robust routing scheme for WDM mesh networks under the model of polyhedral uncertainty (i.e., hose model), and the proposed routing scheme is implemented with traffic grooming approach. Our Objective is to maximize the hose model throughput. A mathematic formulation of Valiant Load-Balanced robust routing is presented and three fast heuristic algorithms are also proposed. When implementing Valiant Load-Balanced robust routing scheme to WDM mesh networks, a novel traffic-grooming algorithm called MHF (minimizing hop first) is proposed. We compare the three heuristic algorithms with the VPN tree under the hose model. Finally we demonstrate in the simulation results that MHF with Valiant Load-Balanced robust routing scheme outperforms the traditional traffic-grooming algorithm in terms of the throughput for the uniform/non-uniform traffic matrix under the hose model.
Three-Dimensional Multi-mesh Material Point Method for Solving Collision Problems
Institute of Scientific and Technical Information of China (English)
YANG Zhan-Ying; PAN Xiao-Fei; XUE Pan-Pan; XU Ai-Guo; ZHAO Liu; ZHANG Guang-Cai; SHI Kang-Jie; ZHANG Ping; ZHU Jian-Shi; MA Shang; ZHANG Xiong
2008-01-01
A new multi-mesh contact algorithm for three-dimensional material point method is presented. The contact algorithm faithfully recovers the opposite acting forces between colliding bodies. Collision procedures between regular bodies and/or rigid bodies are treated within the same framework. Multi-value of momentum and mass are defined on every node to describe the contact/sliding/separation procedure. Both normal and tangential velocities of each particle at the contact surface are calculated in respective individual mesh. A Coulomb friction is applied to describe the sliding or slipping between the contacting bodies. The efficiency of the contact algorithm is linearly related to the number of the contacting bodies because the overlapped nodes are labeled by sweeping the material particles of a11 bodies when the nodal momentum and mass are formed at every time step. Numerical simulation shows that our contact algorithm possesses high accuracy and low numerical energy dissipation, which is very important for solving collision problems.
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.
Adaptive radial basis function mesh deformation using data reduction
Gillebaart, T.; Blom, D. S.; van Zuijlen, A. H.; Bijl, H.
2016-09-01
bandwidth available between CPU and memory. In terms of parallel efficiency/scaling the different studied methods perform similarly, with the greedy algorithm being the bottleneck. In terms of absolute computational work the adaptive methods are better for the cases studied due to their more efficient selection of the control points. By automating most of the RBF mesh deformation, a robust, efficient and almost user-independent mesh deformation method is presented.
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.
Novel P-Cycle protection strategy for asymmetric traffic in mesh optical networks
Institute of Scientific and Technical Information of China (English)
Bin LI; Yunhua ZANG; Yu DENG; Shanguo HUANG; Wanyi GU
2008-01-01
A novel prefigured-cycle(P-Cycle)algorithm was proposed to improve the protection success ratio for asymmetric traffic in mesh optical networks.The proposed algorithm was simulated in a Pan-European COST239 network environment under an asymmetric dynamic traffic model.The experimental results show that the proposed algorithm has lower capacity redundancy and higher utilization rate of configured resources than traditional P-Cycle methods.Network performance can be improved when implementing this algorithm under single-link failure circumstances.The system behavior is analyzed under different traffic volumes and the configuration strategy is also investigated for the heavyload and light-load networks respectively.
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.
A moving mesh unstaggered constrained transport scheme for magnetohydrodynamics
Mocz, Philip; Pakmor, Rüdiger; Springel, Volker; Vogelsberger, Mark; Marinacci, Federico; Hernquist, Lars
2016-11-01
We present a constrained transport (CT) algorithm for solving the 3D ideal magnetohydrodynamic (MHD) equations on a moving mesh, which maintains the divergence-free condition on the magnetic field to machine-precision. Our CT scheme uses an unstructured representation of the magnetic vector potential, making the numerical method simple and computationally efficient. The scheme is implemented in the moving mesh code AREPO. We demonstrate the performance of the approach with simulations of driven MHD turbulence, a magnetized disc galaxy, and a cosmological volume with primordial magnetic field. We compare the outcomes of these experiments to those obtained with a previously implemented Powell divergence-cleaning scheme. While CT and the Powell technique yield similar results in idealized test problems, some differences are seen in situations more representative of astrophysical flows. In the turbulence simulations, the Powell cleaning scheme artificially grows the mean magnetic field, while CT maintains this conserved quantity of ideal MHD. In the disc simulation, CT gives slower magnetic field growth rate and saturates to equipartition between the turbulent kinetic energy and magnetic energy, whereas Powell cleaning produces a dynamically dominant magnetic field. Such difference has been observed in adaptive-mesh refinement codes with CT and smoothed-particle hydrodynamics codes with divergence-cleaning. In the cosmological simulation, both approaches give similar magnetic amplification, but Powell exhibits more cell-level noise. CT methods in general are more accurate than divergence-cleaning techniques, and, when coupled to a moving mesh can exploit the advantages of automatic spatial/temporal adaptivity and reduced advection errors, allowing for improved astrophysical MHD simulations.
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.
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.
Danaila, Ionut; Hecht, Frédéric
2010-01-01
Numerical computations of stationary states of fast-rotating Bose-Einstein condensates re- quire high spatial resolution due to the presence of a large number of quantized vortices. In this paper we propose a low-order finite element method with mesh adaptivity by metric con- trol, as an alternative approach to the commonly used high order (finite difference or spectral) approximation methods. The mesh adaptivity is used with two different numerical algorithms to compute stationary vortex sta...
A unified multigrid solver for the Navier-Stokes equations on mixed element meshes
Mavriplis, D. J.; Venkatakrishnan, V.
1995-01-01
A unified multigrid solution technique is presented for solving the Euler and Reynolds-averaged Navier-Stokes equations on unstructured meshes using mixed elements consisting of triangles and quadrilaterals in two dimensions, and of hexahedra, pyramids, prisms, and tetrahedra in three dimensions. While the use of mixed elements is by no means a novel idea, the contribution of the paper lies in the formulation of a complete solution technique which can handle structured grids, block structured grids, and unstructured grids of tetrahedra or mixed elements without any modification. This is achieved by discretizing the full Navier-Stokes equations on tetrahedral elements, and the thin layer version of these equations on other types of elements, while using a single edge-based data-structure to construct the discretization over all element types. An agglomeration multigrid algorithm, which naturally handles meshes of any types of elements, is employed to accelerate convergence. An automatic algorithm which reduces the complexity of a given triangular or tetrahedral mesh by merging candidate triangular or tetrahedral elements into quadrilateral or prismatic elements is also described. The gains in computational efficiency afforded by the use of non-simplicial meshes over fully tetrahedral meshes are demonstrated through several examples.
Meshing Highly Regular Structures: The Case of Super Carbon Nanotubes of Arbitrary Order
Directory of Open Access Journals (Sweden)
Christian Schröppel
2015-01-01
Full Text Available Mesh generation is an important step in many numerical methods. We present the “Hierarchical Graph Meshing” (HGM method as a novel approach to mesh generation, based on algebraic graph theory. The HGM method can be used to systematically construct configurations exhibiting multiple hierarchies and complex symmetry characteristics. The hierarchical description of structures provided by the HGM method can be exploited to increase the efficiency of multiscale and multigrid methods. In this paper, the HGM method is employed for the systematic construction of super carbon nanotubes of arbitrary order, which present a pertinent example of structurally and geometrically complex, yet highly regular, structures. The HGM algorithm is computationally efficient and exhibits good scaling characteristics. In particular, it scales linearly for super carbon nanotube structures and is working much faster than geometry-based methods employing neighborhood search algorithms. Its modular character makes it conducive to automatization. For the generation of a mesh, the information about the geometry of the structure in a given configuration is added in a way that relates geometric symmetries to structural symmetries. The intrinsically hierarchic description of the resulting mesh greatly reduces the effort of determining mesh hierarchies for multigrid and multiscale applications and helps to exploit symmetry-related methods in the mechanical analysis of complex structures.
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...
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.
Terrain-driven unstructured mesh development through semi-automatic vertical feature extraction
Bilskie, Matthew V.; Coggin, David; Hagen, Scott C.; Medeiros, Stephen C.
2015-12-01
A semi-automated vertical feature terrain extraction algorithm is described and applied to a two-dimensional, depth-integrated, shallow water equation inundation model. The extracted features describe what are commonly sub-mesh scale elevation details (ridge and valleys), which may be ignored in standard practice because adequate mesh resolution cannot be afforded. The extraction algorithm is semi-automated, requires minimal human intervention, and is reproducible. A lidar-derived digital elevation model (DEM) of coastal Mississippi and Alabama serves as the source data for the vertical feature extraction. Unstructured mesh nodes and element edges are aligned to the vertical features and an interpolation algorithm aimed at minimizing topographic elevation error assigns elevations to mesh nodes via the DEM. The end result is a mesh that accurately represents the bare earth surface as derived from lidar with element resolution in the floodplain ranging from 15 m to 200 m. To examine the influence of the inclusion of vertical features on overland flooding, two additional meshes were developed, one without crest elevations of the features and another with vertical features withheld. All three meshes were incorporated into a SWAN+ADCIRC model simulation of Hurricane Katrina. Each of the three models resulted in similar validation statistics when compared to observed time-series water levels at gages and post-storm collected high water marks. Simulated water level peaks yielded an R2 of 0.97 and upper and lower 95% confidence interval of ∼ ± 0.60 m. From the validation at the gages and HWM locations, it was not clear which of the three model experiments performed best in terms of accuracy. Examination of inundation extent among the three model results were compared to debris lines derived from NOAA post-event aerial imagery, and the mesh including vertical features showed higher accuracy. The comparison of model results to debris lines demonstrates that additional
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...
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.
MEDLINE MeSH Indexing: Lessons Learned from Machine Learning and Future Directions
DEFF Research Database (Denmark)
Jimeno-Yepes, Antonio; Mork, James G.; Wilkowski, Bartlomiej
2012-01-01
Map and a k-NN approach called PubMed Related Citations (PRC). Our motivation is to improve the quality of MTI based on machine learning. Typical machine learning approaches fit this indexing task into text categorization. In this work, we have studied some Medical Subject Headings (MeSH) recommended by MTI...... and analyzed the issues when using standard machine learning algorithms. We show that in some cases machine learning can improve the annotations already recommended by MTI, that machine learning based on low variance methods achieves better performance and that each MeSH heading presents a different behavior...
Szmelter, J.; Marchant, M. J.; Evans, A.; Weatherill, N. P.
A cell vertex finite volume Jameson scheme is used to solve the 2D compressible, laminar, viscous fluid flow equations on locally embedded multiblock meshes. The proposed algorithm is applicable to both the Euler and Navier-Stokes equations. It is concluded that the adaptivity method is very successful in efficiently improving the accuracy of the solution. Both the mesh generator and the flow equation solver which are based on a quadtree data structure offer good flexibility in the treatment of interfaces. It is concluded that methods under consideration lead to accurate flow solutions.
Institute of Scientific and Technical Information of China (English)
Weitao LIU; Changchuan XIE; Michel Bellet; Hervé Combeau
2009-01-01
In order to improve the prediction accuracy of macrosegregation channel, an algorithm for dynamic remeshing is proposed. The basic idea is to generate fine elements near the liquidus isotherm. The norm of the gradient of solid fraction is used for piloting the remeshing in the mushy zone; whereas, the objective mesh size in the liquid is considered as a function of the distance to the liquidus isotherm. The efficiency of mesh adaptation is demonstrated by prediction of macrosegregation channel in a case of unidirectional solidification.
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.
Fast methods for the Eikonal and related Hamilton- Jacobi equations on unstructured meshes.
Sethian, J A; Vladimirsky, A
2000-05-23
The Fast Marching Method is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O(M log M) steps, where M is the total number of grid points. The scheme relies on an upwind finite difference approximation to the gradient and a resulting causality relationship that lends itself to a Dijkstra-like programming approach. In this paper, we discuss several extensions to this technique, including higher order versions on unstructured meshes in Rn and on manifolds and connections to more general static Hamilton-Jacobi equations.
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.
High throughput route selection in multi-rate wireless mesh networks
Institute of Scientific and Technical Information of China (English)
WEI Yi-fei; GUO Xiang-li; SONG Mei; SONG Jun-de
2008-01-01
Most existing Ad-hoc routing protocols use the shortest path algorithm with a hop count metric to select paths. It is appropriate in single-rate wireless networks, but has a tendency to select paths containing long-distance links that have low data rates and reduced reliability in multi-rate networks. This article introduces a high throughput routing algorithm utilizing the multi-rate capability and some mesh characteristics in wireless fidelity (WiFi) mesh networks. It uses the medium access control (MAC) transmission time as the routing metric, which is estimated by the information passed up from the physical layer. When the proposed algorithm is adopted, the Ad-hoc on-demand distance vector (AODV) routing can be improved as high throughput AODV (HT-AODV). Simulation results show that HT-AODV is capable of establishing a route that has high data-rate, short end-to-end delay and great network throughput.
An Efficient Method For Multichannel Wireless Mesh Networks With Pulse Coupled Neural Network
Directory of Open Access Journals (Sweden)
S.Sobana
2012-01-01
Full Text Available Multi cast communication is a key technology for wireless mesh networks. Multicast provides efficient data distribution among a group of nodes, Generally sensor networks and MANETs uses multicast algorithms which are designed to be energy efficient and to achieve optimal route discovery among mobile nodes whereas wireless mesh networks needs to maximize throughput. Here we propose two multicast algorithms: The Level Channel Assignment (LCA algorithm and the Multi-Channel Multicast (MCM algorithm to improve the throughput for multichannel sand multi interface mesh networks. The algorithm builds efficient multicast trees by minimizing the number of relay nodes and total hop count distance of the trees. Shortest path computation is a classical combinatorial optimization problem. Neural networks have been used for processing path optimization problem. Pulse Coupled Neural Networks (PCNNS suffer from high computational cast for very long paths we propose a new PCNN modal called dual source PCNN (DSPCNN which can improve the computational efficiency two auto waves are produced by DSPCNN one comes from source neuron and other from goal neuron when the auto waves from these two sources meet the DSPCNN stops and then the shortest path is found by backtracking the two auto waves.
Scan-directed load balancing for highly-parallel mesh-connected computers. Technical report
Energy Technology Data Exchange (ETDEWEB)
Biagioni, E.S.; Prins, J.F.
1991-07-01
Scan Directed Load Balancing is a new, locality-preserving, dynamic load balancing algorithm for grid based computations on mesh connected parallel computers. Scans are used to efficiently determine what areas of the machine are heavily loaded and what areas are lightly loaded, and to organize the movement of data. Data is shifted along the mesh in a regular fashion to balance the load. The Locality Property of the algorithm guarantees that all the neighbors of a data point on the grid are stored either on the same processor, or on a processor that is directly connected to it. Scan Directed Load Balancing is applicable to both SIMD and MIMD mesh-connected parallel computers, and has been implemented on the MasPar MP-1. The authors present some theoretical bounds achieved by the algorithm as well as the algorithm's performance on a particular image processing problem, edge-directed diffusion. Their experiments show that the algorithm is effective in improving the load distribution for real problems, while the efficiency of the original grid-based computation is preserved by the locality property.
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.
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....
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.
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.
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...
Paardekooper, S.-J.
2017-08-01
We present a new method for numerical hydrodynamics which uses a multidimensional generalization of the Roe solver and operates on an unstructured triangular mesh. The main advantage over traditional methods based on Riemann solvers, which commonly use one-dimensional flux estimates as building blocks for a multidimensional integration, is its inherently multidimensional nature, and as a consequence its ability to recognize multidimensional stationary states that are not hydrostatic. A second novelty is the focus on graphics processing units (GPUs). By tailoring the algorithms specifically to GPUs, we are able to get speedups of 100-250 compared to a desktop machine. We compare the multidimensional upwind scheme to a traditional, dimensionally split implementation of the Roe solver on several test problems, and we find that the new method significantly outperforms the Roe solver in almost all cases. This comes with increased computational costs per time-step, which makes the new method approximately a factor of 2 slower than a dimensionally split scheme acting on a structured grid.
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...
Geometric Design Rule Check of VLSI Layouts in Mesh Connected Processors
Directory of Open Access Journals (Sweden)
S. K. Nandy
1994-01-01
Full Text Available Design Rule Checking is a compute-intensive VLSI CAD tool. In this paper we propose a parallel algorithm to perform Design Rule Check (DRC of Layout geometries in a VLSI layout. The algorithm assumes the parallel architecture to be a two-dimensional mesh of processors. The algorithm is based on a linear quadtree representation of the layout. Through a complexity analysis it is shown that it is possible to achieve a linear speedup in DRC with respect to the number of processors.
Relativistic Vlasov-Maxwell modelling using finite volumes and adaptive mesh refinement
Wettervik, Benjamin Svedung; Siminos, Evangelos; Fülöp, Tünde
2016-01-01
The dynamics of collisionless plasmas can be modelled by the Vlasov-Maxwell system of equations. An Eulerian approach is needed to accurately describe processes that are governed by high energy tails in the distribution function, but is of limited efficiency for high dimensional problems. The use of an adaptive mesh can reduce the scaling of the computational cost with the dimension of the problem. Here, we present a relativistic Eulerian Vlasov-Maxwell solver with block-structured adaptive mesh refinement in one spatial and one momentum dimension. The discretization of the Vlasov equation is based on a high-order finite volume method. A flux corrected transport algorithm is applied to limit spurious oscillations and ensure the physical character of the distribution function. We demonstrate a speed-up by a factor of five, because of the use of an adaptive mesh, in a typical scenario involving laser-plasma interaction in the self-induced transparency regime.
Automatic off-body overset adaptive Cartesian mesh method based on an octree approach
Energy Technology Data Exchange (ETDEWEB)
Peron, Stephanie, E-mail: stephanie.peron@onera.fr [ONERA - The French Aerospace Lab, F-92322 Chatillon (France); Benoit, Christophe, E-mail: christophe.benoit@onera.fr [ONERA - The French Aerospace Lab, F-92322 Chatillon (France)
2013-01-01
This paper describes a method for generating adaptive structured Cartesian grids within a near-body/off-body mesh partitioning framework for the flow simulation around complex geometries. The off-body Cartesian mesh generation derives from an octree structure, assuming each octree leaf node defines a structured Cartesian block. This enables one to take into account the large scale discrepancies in terms of resolution between the different bodies involved in the simulation, with minimum memory requirements. Two different conversions from the octree to Cartesian grids are proposed: the first one generates Adaptive Mesh Refinement (AMR) type grid systems, and the second one generates abutting or minimally overlapping Cartesian grid set. We also introduce an algorithm to control the number of points at each adaptation, that automatically determines relevant values of the refinement indicator driving the grid refinement and coarsening. An application to a wing tip vortex computation assesses the capability of the method to capture accurately the flow features.
Radial Basis Function Based Implicit Surface Reconstruction Interpolating Arbitrary Triangular Mesh
Institute of Scientific and Technical Information of China (English)
PANG Mingyong
2006-01-01
In this paper, we present an approach for smooth surface reconstructions interpolating triangular meshes with arbitrary topology and geometry. The approach is based on the well-known radial basis functions (RBFs) and the constructed surfaces are generalized thin-plate spline surfaces. Our algorithm first defines a pair of offset points for each vertex of a given mesh to enhance the controllability of local geometry and to assure stability of the construction. A linear system is then solved by LU decomposition and the implicit governing equation of interpolating surface is obtained. The constructed surfaces finally are visualized by a Marching Cubes based polygonizer. The approach provides a robust and efficient solution for smooth surface reconstruction from various 3D meshes.
Soghrati, Soheil; Xiao, Fei; Nagarajan, Anand
2016-12-01
A Conforming to Interface Structured Adaptive Mesh Refinement (CISAMR) technique is introduced for the automated transformation of a structured grid into a conforming mesh with appropriate element aspect ratios. The CISAMR algorithm is composed of three main phases: (i) Structured Adaptive Mesh Refinement (SAMR) of the background grid; (ii) r-adaptivity of the nodes of elements cut by the crack; (iii) sub-triangulation of the elements deformed during the r-adaptivity process and those with hanging nodes generated during the SAMR process. The required considerations for the treatment of crack tips and branching cracks are also discussed in this manuscript. Regardless of the complexity of the problem geometry and without using iterative smoothing or optimization techniques, CISAMR ensures that aspect ratios of conforming elements are lower than three. Multiple numerical examples are presented to demonstrate the application of CISAMR for modeling linear elastic fracture problems with intricate morphologies.
Energy Technology Data Exchange (ETDEWEB)
Hornung, R.D. [Duke Univ., Durham, NC (United States)
1996-12-31
An adaptive local mesh refinement (AMR) algorithm originally developed for unsteady gas dynamics is extended to multi-phase flow in porous media. Within the AMR framework, we combine specialized numerical methods to treat the different aspects of the partial differential equations. Multi-level iteration and domain decomposition techniques are incorporated to accommodate elliptic/parabolic behavior. High-resolution shock capturing schemes are used in the time integration of the hyperbolic mass conservation equations. When combined with AMR, these numerical schemes provide high resolution locally in a more efficient manner than if they were applied on a uniformly fine computational mesh. We will discuss the interplay of physical, mathematical, and numerical concerns in the application of adaptive mesh refinement to flow in porous media problems of practical interest.
Bajc, Iztok; Hecht, Frédéric; Žumer, Slobodan
2016-09-01
This paper presents a 3D mesh adaptivity strategy on unstructured tetrahedral meshes by a posteriori error estimates based on metrics derived from the Hessian of a solution. The study is made on the case of a nonlinear finite element minimization scheme for the Landau-de Gennes free energy functional of nematic liquid crystals. Newton's iteration for tensor fields is employed with steepest descent method possibly stepping in. Aspects relating the driving of mesh adaptivity within the nonlinear scheme are considered. The algorithmic performance is found to depend on at least two factors: when to trigger each single mesh adaptation, and the precision of the correlated remeshing. Each factor is represented by a parameter, with its values possibly varying for every new mesh adaptation. We empirically show that the time of the overall algorithm convergence can vary considerably when different sequences of parameters are used, thus posing a question about optimality. The extensive testings and debugging done within this work on the simulation of systems of nematic colloids substantially contributed to the upgrade of an open source finite element-oriented programming language to its 3D meshing possibilities, as also to an outer 3D remeshing module.
Bessel smoothing filter for spectral-element mesh
Trinh, P. T.; Brossier, R.; Métivier, L.; Virieux, J.; Wellington, P.
2017-06-01
Smoothing filters are extremely important tools in seismic imaging and inversion, such as for traveltime tomography, migration and waveform inversion. For efficiency, and as they can be used a number of times during inversion, it is important that these filters can easily incorporate prior information on the geological structure of the investigated medium, through variable coherent lengths and orientation. In this study, we promote the use of the Bessel filter to achieve these purposes. Instead of considering the direct application of the filter, we demonstrate that we can rely on the equation associated with its inverse filter, which amounts to the solution of an elliptic partial differential equation. This enhances the efficiency of the filter application, and also its flexibility. We apply this strategy within a spectral-element-based elastic full waveform inversion framework. Taking advantage of this formulation, we apply the Bessel filter by solving the associated partial differential equation directly on the spectral-element mesh through the standard weak formulation. This avoids cumbersome projection operators between the spectral-element mesh and a regular Cartesian grid, or expensive explicit windowed convolution on the finite-element mesh, which is often used for applying smoothing operators. The associated linear system is solved efficiently through a parallel conjugate gradient algorithm, in which the matrix vector product is factorized and highly optimized with vectorized computation. Significant scaling behaviour is obtained when comparing this strategy with the explicit convolution method. The theoretical numerical complexity of this approach increases linearly with the coherent length, whereas a sublinear relationship is observed practically. Numerical illustrations are provided here for schematic examples, and for a more realistic elastic full waveform inversion gradient smoothing on the SEAM II benchmark model. These examples illustrate well the
Wavelet-Based Geometry Coding for Three Dimensional Mesh Using Space Frequency Quantization
Directory of Open Access Journals (Sweden)
Shymaa T. El-Leithy
2009-01-01
Full Text Available Problem statement: Recently, 3D objects have been used in several applications like internet games, virtual reality and scientific visualization. These applications require real time rendering and fast transmission of large objects through internet. However, due to limitation of bandwidth, the compression and streaming of 3D object is still an open research problem. Approach: Novel procedure for compression and coding of 3-Dimensional (3-D semi-regular meshes using wavelet transform had been introduced. This procedure was based on Space Frequency Quantization (SFQ which was used to minimize distortion error of reconstructed mesh for a different bit-rate constraint. Results: Experimental results had been carried out over five datasets with different mesh intense and irregularity. Results were evaluated by using the peak signal to noise ratio as an error measurement. Experiments showed that 3D SFQ code over performs Progressive Geometry Coder (PGC in terms of quality of compressed meshes. Conclusion: A pure 3D geometry coding algorithm based on wavelet had been introduced. Proposed procedure showed its superiority over the state of art coding techniques. Moreover, bit-stream can be truncated at any point and still decode reasonable visual quality meshes.
METHOD FOR ADAPTIVE MESH GENERATION BASED ON GEOMETRICAL FEATURES OF 3D SOLID
Institute of Scientific and Technical Information of China (English)
HUANG Xiaodong; DU Qungui; YE Bangyan
2006-01-01
In order to provide a guidance to specify the element size dynamically during adaptive finite element mesh generation, adaptive criteria are firstly defined according to the relationships between the geometrical features and the elements of 3D solid. Various modes based on different datum geometrical elements, such as vertex, curve, surface, and so on, are then designed for generating local refmed mesh. With the guidance of the defined criteria, different modes are automatically selected to apply on the appropriate datum objects to program the element size in the local special areas. As a result, the control information of element size is successfully programmed coveting the entire domain based on the geometrical features of 3D solid. A new algorithm based on Delaunay triangulation is then developed for generating 3D adaptive fmite element mesh, in which the element size is dynamically specified to catch the geometrical features and suitable tetrahedron facets are selected to locate interior nodes continuously. As a result, adaptive mesh with good-quality elements is generated. Examples show that the proposed method can be successfully applied to adaptive finite element mesh automatic generation based on the geometrical features of 3D solid.
Parallel progressive multiple sequence alignment on reconfigurable meshes
Directory of Open Access Journals (Sweden)
Nguyen Ken D
2011-12-01
Full Text Available Abstract Background One of the most fundamental and challenging tasks in bio-informatics is to identify related sequences and their hidden biological significance. The most popular and proven best practice method to accomplish this task is aligning multiple sequences together. However, multiple sequence alignment is a computing extensive task. In addition, the advancement in DNA/RNA and Protein sequencing techniques has created a vast amount of sequences to be analyzed that exceeding the capability of traditional computing models. Therefore, an effective parallel multiple sequence alignment model capable of resolving these issues is in a great demand. Results We design O(1 run-time solutions for both local and global dynamic programming pair-wise alignment algorithms on reconfigurable mesh computing model. To align m sequences with max length n, we combining the parallel pair-wise dynamic programming solutions with newly designed parallel components. We successfully reduce the progressive multiple sequence alignment algorithm's run-time complexity from O(m × n4 to O(m using O(m × n3 processing units for scoring schemes that use three distinct values for match/mismatch/gap-extension. The general solution to multiple sequence alignment algorithm takes O(m × n4 processing units and completes in O(m time. Conclusions To our knowledge, this is the first time the progressive multiple sequence alignment algorithm is completely parallelized with O(m run-time. We also provide a new parallel algorithm for the Longest Common Subsequence (LCS with O(1 run-time using O(n3 processing units. This is a big improvement over the current best constant-time algorithm that uses O(n4 processing units.
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.
Foks, Nathan Leon
The interpretation of geophysical data plays an important role in the analysis of potential field data in resource exploration industries. Two categories of interpretation techniques are discussed in this thesis; boundary detection and geophysical inversion. Fault or boundary detection is a method to interpret the locations of subsurface boundaries from measured data, while inversion is a computationally intensive method that provides 3D information about subsurface structure. My research focuses on these two aspects of interpretation techniques. First, I develop a method to aid in the interpretation of faults and boundaries from magnetic data. These processes are traditionally carried out using raster grid and image processing techniques. Instead, I use unstructured meshes of triangular facets that can extract inferred boundaries using mesh edges. Next, to address the computational issues of geophysical inversion, I develop an approach to reduce the number of data in a data set. The approach selects the data points according to a user specified proxy for its signal content. The approach is performed in the data domain and requires no modification to existing inversion codes. This technique adds to the existing suite of compressive inversion algorithms. Finally, I develop an algorithm to invert gravity data for an interfacing surface using an unstructured mesh of triangular facets. A pertinent property of unstructured meshes is their flexibility at representing oblique, or arbitrarily oriented structures. This flexibility makes unstructured meshes an ideal candidate for geometry based interface inversions. The approaches I have developed provide a suite of algorithms geared towards large-scale interpretation of potential field data, by using an unstructured representation of both the data and model parameters.
DNA rendering of polyhedral meshes at the nanoscale
Benson, Erik; Mohammed, Abdulmelik; Gardell, Johan; Masich, Sergej; Czeizler, Eugen; Orponen, Pekka; Högberg, Björn
2015-07-01
It was suggested more than thirty years ago that Watson-Crick base pairing might be used for the rational design of nanometre-scale structures from nucleic acids. Since then, and especially since the introduction of the origami technique, DNA nanotechnology has enabled increasingly more complex structures. But although general approaches for creating DNA origami polygonal meshes and design software are available, there are still important constraints arising from DNA geometry and sense/antisense pairing, necessitating some manual adjustment during the design process. Here we present a general method of folding arbitrary polygonal digital meshes in DNA that readily produces structures that would be very difficult to realize using previous approaches. The design process is highly automated, using a routeing algorithm based on graph theory and a relaxation simulation that traces scaffold strands through the target structures. Moreover, unlike conventional origami designs built from close-packed helices, our structures have a more open conformation with one helix per edge and are therefore stable under the ionic conditions usually used in biological assays.
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.
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.
ENZO: AN ADAPTIVE MESH REFINEMENT CODE FOR ASTROPHYSICS
Energy Technology Data Exchange (ETDEWEB)
Bryan, Greg L.; Turk, Matthew J. [Columbia University, Department of Astronomy, New York, NY 10025 (United States); Norman, Michael L.; Bordner, James; Xu, Hao; Kritsuk, Alexei G. [CASS, University of California, San Diego, 9500 Gilman Drive La Jolla, CA 92093-0424 (United States); O' Shea, Brian W.; Smith, Britton [Department of Physics and Astronomy, Michigan State University, East Lansing, MI 48824 (United States); Abel, Tom; Wang, Peng; Skillman, Samuel W. [Kavli Institute for Particle Astrophysics and Cosmology, Stanford University, Menlo Park, CA 94025 (United States); Wise, John H. [Center for Relativistic Astrophysics, School of Physics, Georgia Institute of Technology, 837 State Street, Atlanta, GA (United States); Reynolds, Daniel R. [Department of Mathematics, Southern Methodist University, Box 750156, Dallas, TX 75205-0156 (United States); Collins, David C. [Department of Physics, Florida State University, Tallahassee, FL 32306 (United States); Harkness, Robert P. [NICS, Oak Ridge National Laboratory, 1 Bethel Valley Rd, Oak Ridge, TN 37831 (United States); Kim, Ji-hoon [Department of Astronomy and Astrophysics, University of California, 1156 High Street, Santa Cruz, CA 95064 (United States); Kuhlen, Michael [Theoretical Astrophysics Center, University of California Berkeley, Hearst Field Annex, Berkeley, CA 94720 (United States); Goldbaum, Nathan [Institute for Astronomy, University of Edinburgh, Edinburgh EH9 3HJ (United Kingdom); Hummels, Cameron [Department of Astronomy/Steward Observatory, University of Arizona, 933 N. Cherry Ave., Tucson, AZ 85721 (United States); Tasker, Elizabeth [Physics Department, Faculty of Science, Hokkaido University, Kita-10 Nishi 8, Kita-ku, Sapporo 060-0810 (Japan); Collaboration: Enzo Collaboration; and others
2014-04-01
This paper describes the open-source code Enzo, which uses block-structured adaptive mesh refinement to provide high spatial and temporal resolution for modeling astrophysical fluid flows. The code is Cartesian, can be run in one, two, and three dimensions, and supports a wide variety of physics including hydrodynamics, ideal and non-ideal magnetohydrodynamics, N-body dynamics (and, more broadly, self-gravity of fluids and particles), primordial gas chemistry, optically thin radiative cooling of primordial and metal-enriched plasmas (as well as some optically-thick cooling models), radiation transport, cosmological expansion, and models for star formation and feedback in a cosmological context. In addition to explaining the algorithms implemented, we present solutions for a wide range of test problems, demonstrate the code's parallel performance, and discuss the Enzo collaboration's code development methodology.
Block-structured Adaptive Mesh Refinement - Theory, Implementation and Application
Directory of Open Access Journals (Sweden)
Deiterding Ralf
2011-12-01
Full Text Available Structured adaptive mesh refinement (SAMR techniques can enable cutting-edge simulations of problems governed by conservation laws. Focusing on the strictly hyperbolic case, these notes explain all algorithmic and mathematical details of a technically relevant implementation tailored for distributed memory computers. An overview of the background of commonly used finite volume discretizations for gas dynamics is included and typical benchmarks to quantify accuracy and performance of the dynamically adaptive code are discussed. Large-scale simulations of shock-induced realistic combustion in non-Cartesian geometry and shock-driven fluid-structure interaction with fully coupled dynamic boundary motion demonstrate the applicability of the discussed techniques for complex scenarios.
Error resilient concurrent video streaming over wireless mesh networks
Institute of Scientific and Technical Information of China (English)
LI Dan-jue; ZHANG Qian; CHUAH Chen-nee; YOO Ben S.J.
2006-01-01
In this paper, we propose a multi-source multi-path video streaming system for supporting high quality concurrent video-on-demand (VoD) services over wireless mesh networks (WMNs), and leverage forward error correction to enhance the error resilience of the system. By taking wireless interference into consideration, we present a more realistic networking model to capture the characteristics of WMNs and then design a route selection scheme using a joint rate/interference-distortion optimization framework to help the system optimally select concurrent streaming paths. We mathematically formulate such a route selection problem, and solve it heuristically using genetic algorithm. Simulation results demonstrate the effectiveness of our proposed scheme.
Enzo: An Adaptive Mesh Refinement Code for Astrophysics
Bryan, Greg L; O'Shea, Brian W; Abel, Tom; Wise, John H; Turk, Matthew J; Reynolds, Daniel R; Collins, David C; Wang, Peng; Skillman, Samuel W; Smith, Britton; Harkness, Robert P; Bordner, James; Kim, Ji-hoon; Kuhlen, Michael; Xu, Hao; Goldbaum, Nathan; Hummels, Cameron; Kritsuk, Alexei G; Tasker, Elizabeth; Skory, Stephen; Simpson, Christine M; Hahn, Oliver; Oishi, Jeffrey S; So, Geoffrey C; Zhao, Fen; Cen, Renyue; Li, Yuan
2013-01-01
This paper describes the open-source code Enzo, which uses block-structured adaptive mesh refinement to provide high spatial and temporal resolution for modeling astrophysical fluid flows. The code is Cartesian, can be run in 1, 2, and 3 dimensions, and supports a wide variety of physics including hydrodynamics, ideal and non-ideal magnetohydrodynamics, N-body dynamics (and, more broadly, self-gravity of fluids and particles), primordial gas chemistry, optically-thin radiative cooling of primordial and metal-enriched plasmas (as well as some optically-thick cooling models), radiation transport, cosmological expansion, and models for star formation and feedback in a cosmological context. In addition to explaining the algorithms implemented, we present solutions for a wide range of test problems, demonstrate the code's parallel performance, and discuss the Enzo collaboration's code development methodology.
Power Efficient Sub-Array in Reconfigurable VLSI Meshes
Institute of Scientific and Technical Information of China (English)
Ji-Gang Wu; Thambipillai Srikanthan
2005-01-01
Given an m × n mesh-connected VLSI array with some faulty elements, the reconfiguration problem is to find a maximum-sized fault-free sub-array under the row and column rerouting scheme. This problem has already been shown to be NP-complete. In this paper, new techniques are proposed, based on heuristic strategy, to minimize the number of switches required for the power efficient sub-array. Our algorithm shows that notable improvements in the reduction of the number of long interconnects could be realized in linear time and without sacrificing on the size of the sub-array. Simulations based on several random and clustered fault scenarios clearly reveal the superiority of the proposed techniques.
LOAD AWARE ADAPTIVE BACKBONE SYNTHESIS IN WIRELESS MESH NETWORKS
Institute of Scientific and Technical Information of China (English)
Yuan Yuan; Zheng Baoyu
2009-01-01
Wireless Mesh Networks (WMNs) are envisioned to support the wired backbone with a wireless Backbone Networks (BNet) for providing internet connectivity to large-scale areas.With a wide range of internet-oriented applications with different Quality of Service (QoS) requirement,the large-scale WMNs should have good scalability and large bandwidth.In this paper,a Load Aware Adaptive Backbone Synthesis (LAABS) algorithm is proposed to automatically balance the traffic flow in the WMNs.The BNet will dynamically split into smaller size or merge into bigger one according to statistic load information of Backbone Nodes (BNs).Simulation results show LAABS generates moderate BNet size and converges quickly,thus providing scalable and stable BNet to facilitate traffic flow.
Elliptic Solvers with Adaptive Mesh Refinement on Complex Geometries
Energy Technology Data Exchange (ETDEWEB)
Phillip, B.
2000-07-24
Adaptive Mesh Refinement (AMR) is a numerical technique for locally tailoring the resolution computational grids. Multilevel algorithms for solving elliptic problems on adaptive grids include the Fast Adaptive Composite grid method (FAC) and its parallel variants (AFAC and AFACx). Theory that confirms the independence of the convergence rates of FAC and AFAC on the number of refinement levels exists under certain ellipticity and approximation property conditions. Similar theory needs to be developed for AFACx. The effectiveness of multigrid-based elliptic solvers such as FAC, AFAC, and AFACx on adaptively refined overlapping grids is not clearly understood. Finally, a non-trivial eye model problem will be solved by combining the power of using overlapping grids for complex moving geometries, AMR, and multilevel elliptic solvers.
Efficient computation of clipped Voronoi diagram for mesh generation
Yan, Dongming
2013-04-01
The Voronoi diagram is a fundamental geometric structure widely used in various fields, especially in computer graphics and geometry computing. For a set of points in a compact domain (i.e. a bounded and closed 2D region or a 3D volume), some Voronoi cells of their Voronoi diagram are infinite or partially outside of the domain, but in practice only the parts of the cells inside the domain are needed, as when computing the centroidal Voronoi tessellation. Such a Voronoi diagram confined to a compact domain is called a clipped Voronoi diagram. We present an efficient algorithm to compute the clipped Voronoi diagram for a set of sites with respect to a compact 2D region or a 3D volume. We also apply the proposed method to optimal mesh generation based on the centroidal Voronoi tessellation. Crown Copyright © 2011 Published by Elsevier Ltd. All rights reserved.
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...
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.
Energy Technology Data Exchange (ETDEWEB)
Niski, K; Purnomo, B; Cohen, J
2006-11-06
Previous algorithms for view-dependent level of detail provide local mesh refinements either at the finest granularity or at a fixed, coarse granularity. The former provides triangle-level adaptation, often at the expense of heavy CPU usage and low triangle rendering throughput; the latter improves CPU usage and rendering throughput by operating on groups of triangles. We present a new multiresolution hierarchy and associated algorithms that provide adaptive granularity. This multi-grained hierarchy allows independent control of the number of hierarchy nodes processed on the CPU and the number of triangles to be rendered on the GPU. We employ a seamless texture atlas style of geometry image as a GPU-friendly data organization, enabling efficient rendering and GPU-based stitching of patch borders. We demonstrate our approach on both large triangle meshes and terrains with up to billions of vertices.
Three-dimensional multi-mesh material point method for solving collision problems
Pan, Xiaofei; Zhang, Guangcai; Zhu, Jianshi; Ma, Shang; Zhang, Xiong
2007-01-01
Contact algorithm between different bodies plays an important role in solving collision problems. Usually it is not easy to be treated very well. Several ones for material point method were proposed by Bardenhangen, Brackbill, and Sulsky\\cite{Bardenhagen2000,Bardenhagen2001}, Hu and Chen\\cite{Hu_Chen2003}. An improved one for three-dimensional material point method is presented in this paper. The improved algorithm emphasizes the energy conservation of the system and faithfully recovers opposite acting forces between contacting bodies. Contrasted to the one by Bardenhagen, both the normal and tangential contacting forces are more appropriately applied to the contacting bodies via the contacting nodes of the background mesh; Contrasted to the one by Hu and Chen, not only the tangential velocities but also the normal ones are handled separately in respective individual mesh. This treatment ensures not only the contact/sliding/separation procedure but also the friction between contacting bodies are recovered. Th...
A New MHD Code with Adaptive Mesh Refinement and Parallelization for Astrophysics
Jiang, R L; Chen, P F
2012-01-01
A new code, named MAP, is written in Fortran language for magnetohydrodynamics (MHD) calculation with the adaptive mesh refinement (AMR) and Message Passing Interface (MPI) parallelization. There are several optional numerical schemes for computing the MHD part, namely, modified Mac Cormack Scheme (MMC), Lax-Friedrichs scheme (LF) and weighted essentially non-oscillatory (WENO) scheme. All of them are second order, two-step, component-wise schemes for hyperbolic conservative equations. The total variation diminishing (TVD) limiters and approximate Riemann solvers are also equipped. A high resolution can be achieved by the hierarchical block-structured AMR mesh. We use the extended generalized Lagrange multiplier (EGLM) MHD equations to reduce the non-divergence free error produced by the scheme in the magnetic induction equation. The numerical algorithms for the non-ideal terms, e.g., the resistivity and the thermal conduction, are also equipped in the MAP code. The details of the AMR and MPI algorithms are d...
A local level set method based on a finite element method for unstructured meshes
Energy Technology Data Exchange (ETDEWEB)
Ngo, Long Cu; Choi, Hyoung Gwon [School of Mechanical Engineering, Seoul National University of Science and Technology, Seoul (Korea, Republic of)
2016-12-15
A local level set method for unstructured meshes has been implemented by using a finite element method. A least-square weighted residual method was employed for implicit discretization to solve the level set advection equation. By contrast, a direct re-initialization method, which is directly applicable to the local level set method for unstructured meshes, was adopted to re-correct the level set function to become a signed distance function after advection. The proposed algorithm was constructed such that the advection and direct reinitialization steps were conducted only for nodes inside the narrow band around the interface. Therefore, in the advection step, the Gauss–Seidel method was used to update the level set function using a node-by-node solution method. Some benchmark problems were solved by using the present local level set method. Numerical results have shown that the proposed algorithm is accurate and efficient in terms of computational time.
Computer generated holograms from three dimensional meshes using an analytic light transport model
Ahrenberg, Lukas; Benzie, Philip; Magnor, Marcus; Watson, John
2008-04-01
We present a method to analytically compute the light distribution of triangles directly in frequency space. This allows for fast evaluation, shading, and propagation of light from 3D mesh objects using angular spectrum methods. The algorithm complexity is only dependent on the hologram resolution and the polygon count of the 3D model. In contrast to other polygon based computer generated holography methods we do not need to perform a Fourier transform per surface. The theory behind the approach is derived, and a suitable algorithm to compute a digital hologram from a general triangle mesh is presented. We review some first results rendered on a spatial-light-modulator-based display by our proof-of-concept software.
Directory of Open Access Journals (Sweden)
Omar M. Zakaria
2016-01-01
Full Text Available Multiradio wireless mesh network is a promising architecture that improves the network capacity by exploiting multiple radio channels concurrently. Channel assignment and routing are underlying challenges in multiradio architectures since both determine the traffic distribution over links and channels. The interdependency between channel assignments and routing promotes toward the joint solutions for efficient configurations. This paper presents an in-depth review of the joint approaches of channel assignment and routing in multiradio wireless mesh networks. First, the key design issues, modeling, and approaches are identified and discussed. Second, existing algorithms for joint channel assignment and routing are presented and classified based on the channel assignment types. Furthermore, the set of reconfiguration algorithms to adapt the network traffic dynamics is also discussed. Finally, the paper presents some multiradio practical implementations and test-beds and points out the future research directions.
A Multi-Stage Optimization Model With Minimum Energy Consumption-Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
S. Krishnakumar
2012-09-01
Full Text Available Optimization models related with routing, bandwidth utilization and power consumption are developed in the wireless mesh computing environment using the operations research techniques such as maximal flow model, transshipment model and minimax optimizing algorithm. The Path creation algorithm is used to find the multiple paths from source to destination.A multi-stage optimization model is developed by combining the multi-path optimization model, optimization model in capacity utilization and energy optimization model and minimax optimizing algorithm. The input to the multi-stage optimization model is a network with many source and destination. The optimal solution obtained from this model is a minimum energy consuming path from source to destination along with the maximum data rate over each link. The performance is evaluated by comparing the data rate values of superimposed algorithm and minimax optimizing algorithm. The main advantage of this model is the reduction of traffic congestion in the network.
Alam, Muhammad Mahbub; Hamid, Md. Abdul; Razzaque, Md. Abdur; Hong, Choong Seon
Broadband wireless access networks are promising technology for providing better end user services. For such networks, designing a scheduling algorithm that fairly allocates the available bandwidth to the end users and maximizes the overall network throughput is a challenging task. In this paper, we develop a centralized fair scheduling algorithm for IEEE 802.16 mesh networks that exploits the spatio-temporal bandwidth reuse to further enhance the network throughput. The proposed mechanism reduces the length of a transmission round by increasing the number of non-contending links that can be scheduled simultaneously. We also propose a greedy algorithm that runs in polynomial time. Performance of the proposed algorithms is evaluated by extensive simulations. Results show that our algorithms achieve higher throughput than that of the existing ones and reduce the computational complexity.
Yao, Li
2006-01-01
This thesis concerns the modified and improved, time-stepping, dynamic reluctance mesh (DRM) modelling technique for machines and its application to multiple machine systems with their control algorithms. Improvements are suggested which enable the stable solution of the resulting complex non-linear equations. The concept of finite element (FE) derived, overlap-curves has been introduced to facilitate the evaluation of the air-gap reluctances linking the teeth on the rotor to those on the sta...
A Probabilistic Approach to Analysis of Reliability in n-D Meshes with Interconnect Router Failures
Farshad Safaei; Majed ValadBeigi
2013-01-01
The routing algorithms for parallel computers, on-chip networks, multi-core processors, and multiprocessors system-on-chip (MP-SoCs) exhibit router failures must be able to handle interconnect router failures that render a symmetrical mesh non-symmetrically. When developing a routing methodology, the time complexity of calculation should be minimal, and thus complicated routing strategies to introduce profitable paths may not be appropriate. Several reports have been released in the literatur...
A mesh re-zoning technique for finite element simulations of metal forming processes
Cheng, J.-C.; Kikuchi, N.
1986-01-01
Based on some fundamental properties of finite element approximations, a mesh re-zoning scheme is proposed for finite element simulations of metal forming problems. It is demonstrated that this technique is indispensable in analyzing many difficult forming processes, especially when there exist corners or very irregular shapes on the boundaries. The algorithm is tested by a backward extrusion process and direct extrusion through a square die.
Xia, Yan; Zeng, Yingzhi
2016-02-01
This paper proposed a broadcast Channel Assignment Mechanism on base of optimized Broadcast Tree for wireless Mesh network (WMN), which is created by Branch and Bound Method. The simulations show that our algorithm not only reduces the broadcast redundancy but also avoids the potential channel interferences produced by unnecessary relay nodes.
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
Combining 3d Volume and Mesh Models for Representing Complicated Heritage Buildings
Tsai, F.; Chang, H.; Lin, Y.-W.
2017-08-01
This study developed a simple but effective strategy to combine 3D volume and mesh models for representing complicated heritage buildings and structures. The idea is to seamlessly integrate 3D parametric or polyhedral models and mesh-based digital surfaces to generate a hybrid 3D model that can take advantages of both modeling methods. The proposed hybrid model generation framework is separated into three phases. Firstly, after acquiring or generating 3D point clouds of the target, these 3D points are partitioned into different groups. Secondly, a parametric or polyhedral model of each group is generated based on plane and surface fitting algorithms to represent the basic structure of that region. A "bare-bones" model of the target can subsequently be constructed by connecting all 3D volume element models. In the third phase, the constructed bare-bones model is used as a mask to remove points enclosed by the bare-bones model from the original point clouds. The remaining points are then connected to form 3D surface mesh patches. The boundary points of each surface patch are identified and these boundary points are projected onto the surfaces of the bare-bones model. Finally, new meshes are created to connect the projected points and original mesh boundaries to integrate the mesh surfaces with the 3D volume model. The proposed method was applied to an open-source point cloud data set and point clouds of a local historical structure. Preliminary results indicated that the reconstructed hybrid models using the proposed method can retain both fundamental 3D volume characteristics and accurate geometric appearance with fine details. The reconstructed hybrid models can also be used to represent targets in different levels of detail according to user and system requirements in different applications.
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.
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...
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...
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...
Fault-Tolerant Wormhole Routing with 2 Virtual Channels in Meshes
Institute of Scientific and Technical Information of China (English)
Ji-Peng Zhou
2005-01-01
In wormhole meshes, a reliable routing is supposed to be deadlock-free and fault-tolerant. Many routing algorithms are able to tolerate a large number of faults enclosed by rectangular blocks or special convex, none of them,however, is capable of handling two convex fault regions with distance two by using only two virtual networks. In this paper, a fault-tolerant wormhole routing algorithm is presented to tolerate the disjointed convex faulty regions with distance two or no less, which do not contain any nonfaulty nodes and do not prohibit any routing as long as nodes outside faulty regions are connected in the mesh network. The processors' overlapping along the boundaries of different fault regions is allowed. The proposed algorithm, which routes the messages by X-Y routing algorithm in fault-free region, can tolerate convex fault-connected regions with only two virtual channels per physical channel, and is deadlock- and livelock-free. The proposed algorithm can be easily extended to adaptive routing.
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
Parallel octree-based hexahedral mesh generation for eulerian to lagrangian conversion.
Energy Technology Data Exchange (ETDEWEB)
Staten, Matthew L.; Owen, Steven James
2010-09-01
Computational simulation must often be performed on domains where materials are represented as scalar quantities or volume fractions at cell centers of an octree-based grid. Common examples include bio-medical, geotechnical or shock physics calculations where interface boundaries are represented only as discrete statistical approximations. In this work, we introduce new methods for generating Lagrangian computational meshes from Eulerian-based data. We focus specifically on shock physics problems that are relevant to ASC codes such as CTH and Alegra. New procedures for generating all-hexahedral finite element meshes from volume fraction data are introduced. A new primal-contouring approach is introduced for defining a geometric domain. New methods for refinement, node smoothing, resolving non-manifold conditions and defining geometry are also introduced as well as an extension of the algorithm to handle tetrahedral meshes. We also describe new scalable MPI-based implementations of these procedures. We describe a new software module, Sculptor, which has been developed for use as an embedded component of CTH. We also describe its interface and its use within the mesh generation code, CUBIT. Several examples are shown to illustrate the capabilities of Sculptor.
Mesh-free free-form lensing - I. Methodology and application to mass reconstruction
Merten, Julian
2016-09-01
Many applications and algorithms in the field of gravitational lensing make use of meshes with a finite number of nodes to analyse and manipulate data. Specific examples in lensing are astronomical CCD images in general, the reconstruction of density distributions from lensing data, lens-source plane mapping or the characterization and interpolation of a point spread function. We present a numerical framework to interpolate and differentiate in the mesh-free domain, defined by nodes with coordinates that follow no regular pattern. The framework is based on radial basis functions (RBFs) to smoothly represent data around the nodes. We demonstrate the performance of Gaussian RBF-based, mesh-free interpolation and differentiation, which reaches the sub-percent level in both cases. We use our newly developed framework to translate ideas of free-form mass reconstruction from lensing on to the mesh-free domain. By reconstructing a simulated mock lens we find that strong-lensing only reconstructions achieve Frenk-White profile (NFW) parameters, Einstein radius and magnification map recovery, encouraging the application of this method to real data.
Extending a CAD-Based Cartesian Mesh Generator for the Lattice Boltzmann Method
Energy Technology Data Exchange (ETDEWEB)
Cantrell, J Nathan [ORNL; Inclan, Eric J [ORNL; Joshi, Abhijit S [ORNL; Popov, Emilian L [ORNL; Jain, Prashant K [ORNL
2012-01-01
This paper describes the development of a custom preprocessor for the PaRAllel Thermal Hydraulics simulations using Advanced Mesoscopic methods (PRATHAM) code based on an open-source mesh generator, CartGen [1]. PRATHAM is a three-dimensional (3D) lattice Boltzmann method (LBM) based parallel flow simulation software currently under development at the Oak Ridge National Laboratory. The LBM algorithm in PRATHAM requires a uniform, coordinate system-aligned, non-body-fitted structured mesh for its computational domain. CartGen [1], which is a GNU-licensed open source code, already comes with some of the above needed functionalities. However, it needs to be further extended to fully support the LBM specific preprocessing requirements. Therefore, CartGen is being modified to (i) be compiler independent while converting a neutral-format STL (Stereolithography) CAD geometry to a uniform structured Cartesian mesh, (ii) provide a mechanism for PRATHAM to import the mesh and identify the fluid/solid domains, and (iii) provide a mechanism to visually identify and tag the domain boundaries on which to apply different boundary conditions.
Increasing the Fisher Information Content through Moving-Mesh Reconstruction
Pan, Qiaoyin; Inman, Derek; Yu, Hao-Ran
2016-01-01
Reconstruction techniques are commonly used in cosmology to reduce complicated nonlinear behaviour to a more tractable linearized system. We study the Moving-Mesh algorithm which is expected to perform better than many alternatives as it is based in Lagrangian space. To quantify the algorithm's ability to reconstruct linear modes, we study the Fisher information presented in 136 N-body simulations before and after reconstruction. We find that the linear scale is pushed to $k\\simeq$ 0.3 $h/\\mathrm{Mpc}$ after reconstruction. We furthermore find that the translinear plateau of the cumulative Fisher information is increased by a factor of $\\sim 40$ after reconstruction, from $I \\simeq 2.5 \\times 10^{-5} /(\\mathrm{Mpc}^3/h^3)$ to $I \\simeq 10^{-3}/(\\mathrm{Mpc}^3/h^3)$ at $k \\simeq$ 1 $h/\\mathrm{Mpc}$. This includes the decorrelation between initial and final fields, which has been neglected in many previous studies, and we find that the log-normal transform in this metric only gains a factor of 4 in information....
Electrical impedance tomography using adaptive mesh refinement%利用自适应网格细分法的电阻抗成像
Institute of Scientific and Technical Information of China (English)
严佩敏; 王朔中
2006-01-01
In electrical impedance tomography ( EIT), distribution of the internal resistivity or conductivity of an unknown object is estimated using measured boundary voltage data induced by different current patterns with various reconstruction algorithms.The reconstruction algorithms usually employ the Newton-Raphson iteration scheme to visualize the resistivity distribution inside the object.Accuracy of the imaging process depends not only on the algorithm used, but also on the scheme of finite element discretization.In this paper an adaptive mesh refinement is used in a modified reconstruction algorithm for the regularized EIT.The method has a major impact on efficient solution of the forward problem as well as on achieving improved image resolution.Computer simulations indicate that the Newton-Raphson reconstruction algorithm for EIT using adaptive mesh refinement performs better than the classical Newton-Raphson algorithm in terms of reconstructed image resolution.
Gateway Placement for Wireless Mesh Networks in Smart Grid Network Planning
DEFF Research Database (Denmark)
Kemal, Mohammed Seifu; Ceocea, Alexandru; Olsen, Rasmus Løvenstein
2016-01-01
, substations, transformers and alternative energy sources. This paper deals with the placement of gateways for data aggregators in a Smart Grid, mainly for proposing a placement algorithm which increases the overall throughput of the network. The problem is treated from a networking point of view, by using...... wireless mesh networks as the communications environment and implementing a Maximum Traffic Flow Weight algorithm (MTFW) for defining an optimal position of gateways to data aggregators used in Automatic Metering Infrastructure (AMI). MTFW algorithm is tested by comparing it to other placement algorithms....... It is further used for network planning implementation by using GIS data from a real life scenario. The resulting network plan is visualized with standard tool MapInfo Professional....
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.
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...
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.
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.
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.
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...
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/ .
Directory of Open Access Journals (Sweden)
BO AN LEE
2014-02-01
Full Text Available An electrical resistance tomography (ERT technique combining the particle swarm optimization (PSO algorithm with the Gauss-Newton method is applied to the visualization of two-phase flows. In the ERT, the electrical conductivity distribution, namely the conductivity values of pixels (numerical meshes comprising the domain in the context of a numerical image reconstruction algorithm, is estimated with the known injected currents through the electrodes attached on the domain boundary and the measured potentials on those electrodes. In spite of many favorable characteristics of ERT such as no radiation, low cost, and high temporal resolution compared to other tomography techniques, one of the major drawbacks of ERT is low spatial resolution due to the inherent ill-posedness of conventional image reconstruction algorithms. In fact, the number of known data is much less than that of the unknowns (meshes. Recalling that binary mixtures like two-phase flows consist of only two substances with distinct electrical conductivities, this work adopts the PSO algorithm for mesh grouping to reduce the number of unknowns. In order to verify the enhanced performance of the proposed method, several numerical tests are performed. The comparison between the proposed algorithm and conventional Gauss-Newton method shows significant improvements in the quality of reconstructed images.
Directory of Open Access Journals (Sweden)
Fangfang Qin
2016-01-01
Full Text Available This paper proposes a two-level additive Schwarz preconditioning algorithm for the weak Galerkin approximation of the second-order elliptic equation. In the algorithm, a P1 conforming finite element space is defined on the coarse mesh, and a stable intergrid transfer operator is proposed to exchange the information between the spaces on the coarse mesh and the fine mesh. With the framework of the Schwarz method, it is proved that the condition number of the preconditioned system only depends on the rate of the coarse mesh size and the overlapping size. Some numerical experiments are carried out to verify the theoretical results.
Fairness resource allocation and scheduling for IEEE 802.16 Mesh networks
Directory of Open Access Journals (Sweden)
Limin Peng
2010-06-01
Full Text Available The IEEE 802.16 standard provides a scheme for creating multi-hop relay networks, which can be deployed as a high speed wide area wireless network at low cost. Although the standard defines signaling mechanisms in mesh mode, however, it doesn’t specify wireless resource management in the protocol. In this paper, we address the problem of resource allocation with the goal of providing fairness access to wireless channel for all the nodes as well as high network throughput in IEEE 802.16 mesh networks. We first define node’s unsatisfactory index and throughput function. Then, a multi-objective programming formulation is proposed for optimizing network performance. Accordingly, a dynamic programming based resource allocation and scheduling algorithm is presented to provide an optimal resource allocation to achieve fairness among different nodes as well as high network throughput in IEEE 802.16 mesh networks. Simulation results show that our proposed algorithm significantly provides both fairness of channel access and optimal network throughput.
ADER-WENO finite volume schemes with space-time adaptive mesh refinement
Dumbser, Michael; Zanotti, Olindo; Hidalgo, Arturo; Balsara, Dinshaw S.
2013-09-01
We present the first high order one-step ADER-WENO finite volume scheme with adaptive mesh refinement (AMR) in multiple space dimensions. High order spatial accuracy is obtained through a WENO reconstruction, while a high order one-step time discretization is achieved using a local space-time discontinuous Galerkin predictor method. Due to the one-step nature of the underlying scheme, the resulting algorithm is particularly well suited for an AMR strategy on space-time adaptive meshes, i.e. with time-accurate local time stepping. The AMR property has been implemented 'cell-by-cell', with a standard tree-type algorithm, while the scheme has been parallelized via the message passing interface (MPI) paradigm. The new scheme has been tested over a wide range of examples for nonlinear systems of hyperbolic conservation laws, including the classical Euler equations of compressible gas dynamics and the equations of magnetohydrodynamics (MHD). High order in space and time have been confirmed via a numerical convergence study and a detailed analysis of the computational speed-up with respect to highly refined uniform meshes is also presented. We also show test problems where the presented high order AMR scheme behaves clearly better than traditional second order AMR methods. The proposed scheme that combines for the first time high order ADER methods with space-time adaptive grids in two and three space dimensions is likely to become a useful tool in several fields of computational physics, applied mathematics and mechanics.
A Predictive Model of Fragmentation using Adaptive Mesh Refinement and a Hierarchical Material Model
Energy Technology Data Exchange (ETDEWEB)
Koniges, A E; Masters, N D; Fisher, A C; Anderson, R W; Eder, D C; Benson, D; Kaiser, T B; Gunney, B T; Wang, P; Maddox, B R; Hansen, J F; Kalantar, D H; Dixit, P; Jarmakani, H; Meyers, M A
2009-03-03
Fragmentation is a fundamental material process that naturally spans spatial scales from microscopic to macroscopic. We developed a mathematical framework using an innovative combination of hierarchical material modeling (HMM) and adaptive mesh refinement (AMR) to connect the continuum to microstructural regimes. This framework has been implemented in a new multi-physics, multi-scale, 3D simulation code, NIF ALE-AMR. New multi-material volume fraction and interface reconstruction algorithms were developed for this new code, which is leading the world effort in hydrodynamic simulations that combine AMR with ALE (Arbitrary Lagrangian-Eulerian) techniques. The interface reconstruction algorithm is also used to produce fragments following material failure. In general, the material strength and failure models have history vector components that must be advected along with other properties of the mesh during remap stage of the ALE hydrodynamics. The fragmentation models are validated against an electromagnetically driven expanding ring experiment and dedicated laser-based fragmentation experiments conducted at the Jupiter Laser Facility. As part of the exit plan, the NIF ALE-AMR code was applied to a number of fragmentation problems of interest to the National Ignition Facility (NIF). One example shows the added benefit of multi-material ALE-AMR that relaxes the requirement that material boundaries must be along mesh boundaries.
A Source-Based Multicast Scheme in IEEE 802.16 Mesh Mode
Directory of Open Access Journals (Sweden)
Ali Azarpeyvand
2012-12-01
Full Text Available WiMAX based on IEEE 802.16 is known as one of effective technologies for transmission of multimedia to groups of receivers. There are two operational modes in WiMAX: point to multi point (PMP for single hop transmission and a mesh node for multi-hop transmission. The current standard only defines unicast transmission under mesh mode thus the performance is deteriorated for multimedia applications with multicast nature. In this paper, we first propose a mechanism for source-based tree topology construction aiming at facilitating multicast transmission in WiMAX mesh network. In the proposed approach, the multicast tree is constructed considering available link’s bandwidth and multicast group members. After constructing the multicast tree we propose a novel scheduling algorithm to improve the transmission throughout. In the proposed scheduling algorithm a parent node uses broadcasting when the number of its children belonging to a multicast group excesses a threshold. Extensive simulation results show that the proposed multicast mechanism improves multicast transmission efficiency and reduces scheduling time slots noticeably in comparison to the approach mandated by the IEEE 802.16 standard.
Design and Implementation of a Single-Frequency Mesh Network Using OpenAirInterface
Directory of Open Access Journals (Sweden)
Kaltenberger Florian
2010-01-01
Full Text Available OpenAirInterface is an experimental open-source real-time hardware and software platform for experimentation in wireless communications and signal processing. With the help of OpenAirInterface, researchers can demonstrate novel ideas quickly and verify them in a realistic environment. Its current implementation provides a full open-source software modem comprising physical and link layer functionalities for cellular and mesh network topologies. The physical (PHY layer of the platform targets fourth generation wireless networks and thus uses orthogonal frequency division multiple access (OFDMA together with multiple-input multiple-output (MIMO techniques. The current hardware supports 5 MHz bandwidth and two transmit/receive antennas. The media access (MAC layer of the platform supports an abundant two-way signaling for enabling collaboration, scheduling protocols, as well as traffic and channel measurements. In this paper, we focus on the mesh topology and show how to implement a single-frequency mesh network with OpenAirInterface. The key ingredients to enable such a network are a dual-stream MIMO receiver structure and a distributed network synchronization algorithm. We show how to implement these two algorithms in real-time on the OpenAirInterface platform. Further more, we provide results from field trials and compare them to the simulation results.
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
Nitadori, Keigo
2014-01-01
We propose an efficient algorithm for the evaluation of the potential and its gradient of gravitational/electrostatic $N$-body systems, which we call particle mesh multipole method (PMMM or PM$^3$). PMMM can be understood both as an extension of the particle mesh (PM) method and as an optimization of the fast multipole method (FMM).In the former viewpoint, the scalar density and potential held by a grid point are extended to multipole moments and local expansions in $(p+1)^2$ real numbers, where $p$ is the order of expansion. In the latter viewpoint, a hierarchical octree structure which brings its $\\mathcal O(N)$ nature, is replaced with a uniform mesh structure, and we exploit the convolution theorem with fast Fourier transform (FFT) to speed up the calculations. Hence, independent $(p+1)^2$ FFTs with the size equal to the number of grid points are performed. The fundamental idea is common to PPPM/MPE by Shimada et al. (1993) and FFTM by Ong et al. (2003). PMMM differs from them in supporting both the open ...
MeSH key terms for validation and annotation of gene expression clusters
Energy Technology Data Exchange (ETDEWEB)
Rechtsteiner, A. (Andreas); Rocha, L. M. (Luis Mateus)
2004-01-01
Integration of different sources of information is a great challenge for the analysis of gene expression data, and for the field of Functional Genomics in general. As the availability of numerical data from high-throughput methods increases, so does the need for technologies that assist in the validation and evaluation of the biological significance of results extracted from these data. In mRNA assaying with microarrays, for example, numerical analysis often attempts to identify clusters of co-expressed genes. The important task to find the biological significance of the results and validate them has so far mostly fallen to the biological expert who had to perform this task manually. One of the most promising avenues to develop automated and integrative technology for such tasks lies in the application of modern Information Retrieval (IR) and Knowledge Management (KM) algorithms to databases with biomedical publications and data. Examples of databases available for the field are bibliographic databases c ntaining scientific publications (e.g. MEDLINE/PUBMED), databases containing sequence data (e.g. GenBank) and databases of semantic annotations (e.g. the Gene Ontology Consortium and Medical Subject Headings (MeSH)). We present here an approach that uses the MeSH terms and their concept hierarchies to validate and obtain functional information for gene expression clusters. The controlled and hierarchical MeSH vocabulary is used by the National Library of Medicine (NLM) to index all the articles cited in MEDLINE. Such indexing with a controlled vocabulary eliminates some of the ambiguity due to polysemy (terms that have multiple meanings) and synonymy (multiple terms have similar meaning) that would be encountered if terms would be extracted directly from the articles due to differing article contexts or author preferences and background. Further, the hierarchical organization of the MeSH terms can illustrate the conceptuallfunctional relationships of genes
Adaptive Fault-Tolerant Routing in 2D Mesh with Cracky Rectangular Model
Directory of Open Access Journals (Sweden)
Yi Yang
2014-01-01
Full Text Available This paper mainly focuses on routing in two-dimensional mesh networks. We propose a novel faulty block model, which is cracky rectangular block, for fault-tolerant adaptive routing. All the faulty nodes and faulty links are surrounded in this type of block, which is a convex structure, in order to avoid routing livelock. Additionally, the model constructs the interior spanning forest for each block in order to keep in touch with the nodes inside of each block. The procedure for block construction is dynamically and totally distributed. The construction algorithm is simple and ease of implementation. And this is a fully adaptive block which will dynamically adjust its scale in accordance with the situation of networks, either the fault emergence or the fault recovery, without shutdown of the system. Based on this model, we also develop a distributed fault-tolerant routing algorithm. Then we give the formal proof for this algorithm to guarantee that messages will always reach their destinations if and only if the destination nodes keep connecting with these mesh networks. So the new model and routing algorithm maximize the availability of the nodes in networks. This is a noticeable overall improvement of fault tolerability of the system.
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.
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
一种可应用于内燃机瞬态仿真的动网格模型%Dynamic Mesh Model Applied to ICE Transient Simulation
Institute of Scientific and Technical Information of China (English)
孙华文; 杨丽红; 明平剑; 张文平
2016-01-01
提出了一种基于非结构网格的动态层网格实现算法,结合滑移网格算法构建了基于分块滑移动态层的非结构化内燃机动网格模型,并基于TBD620柴油机建立了计算模型,所有算法都基于课题组自主研发的通用输运方程求解软件实现.流场计算采用适用于可压缩流场的有限体积法及SIMPLE算法.通过数值算例对所开发的滑移网格模型和动态层网格模型进行了验证,最后对内燃机缸内瞬态流场进行了仿真.计算结果表明,所发展的非结构化动网格模型可应用于内燃机瞬态流场的仿真.%A new dynamic layer mesh algorithm based on unstructured mesh was introduced and the dynamic mesh model of internal combustion engine(ICE) was built by combining the sliding mesh algorithm based on the sliding dynamic layer .The calculation model of TBD620 diesel engine was further established and all the referred algorithms were realized through the self-developed general transport equation solver .The finite volume method and SIMPLE algorithm for the compressible fluid were utilized in the simulation .Moreover ,the sliding mesh model and dynamic layer mesh model were verified through the numerical examples and finally the in-cylinder transient flow field of ICE was simulated .The results show that the introduced dynamic mesh method can realize the transient flow field simulation of ICE .
Gansen, A.; Hachemi, M. El; Belouettar, S.; Hassan, O.; Morgan, K.
2016-09-01
The standard Yee algorithm is widely used in computational electromagnetics because of its simplicity and divergence free nature. A generalization of the classical Yee scheme to 3D unstructured meshes is adopted, based on the use of a Delaunay primal mesh and its high quality Voronoi dual. This allows the problem of accuracy losses, which are normally associated with the use of the standard Yee scheme and a staircased representation of curved material interfaces, to be circumvented. The 3D dual mesh leapfrog-scheme which is presented has the ability to model both electric and magnetic anisotropic lossy materials. This approach enables the modelling of problems, of current practical interest, involving structured composites and metamaterials.
Application of adaptive mesh refinement to particle-in-cell simulations of plasmas and beams
Energy Technology Data Exchange (ETDEWEB)
Vay, J.-L.; Colella, P.; Kwan, J.W.; McCorquodale, P.; Serafini, D.B.; Friedman, A.; Grote, D.P.; Westenskow, G.; Adam, J.-C.; Heron, A.; Haber, I.
2003-11-04
Plasma simulations are often rendered challenging by the disparity of scales in time and in space which must be resolved. When these disparities are in distinctive zones of the simulation domain, a method which has proven to be effective in other areas (e.g. fluid dynamics simulations) is the mesh refinement technique. We briefly discuss the challenges posed by coupling this technique with plasma Particle-In-Cell simulations, and present examples of application in Heavy Ion Fusion and related fields which illustrate the effectiveness of the approach. We also report on the status of a collaboration under way at Lawrence Berkeley National Laboratory between the Applied Numerical Algorithms Group (ANAG) and the Heavy Ion Fusion group to upgrade ANAG's mesh refinement library Chombo to include the tools needed by Particle-In-Cell simulation codes.
A novel moving mesh method based on the domain decomposition for traveling singular sources problems
Zhou, Xiaoyan; Liang, Keiwei
2012-01-01
This paper studies the numerical solution of traveling singular sources problems. A big challenge is the sources move with different speeds. Our work focus on a moving mesh method based on the domain decomposition. A predictor-corrector algorithm is derived to simulate the position of singular sources, which are described by some ordinary differential equations. The whole domain is splitted into several subdomains according to the positions of the sources. The endpoints of each subdomain are two adjacent sources. In each subdomain, moving mesh method is respectively applied. Moreover, the computation of jump $[\\dot{u}]$ is avoided and there are only two different cases discussed in the discretization of the PDE. Furthermore, the new method has a desired second-order of the spacial convergence. Numerical examples are presented to illustrate the convergence rates and the efficiency of the method. Blow-up phenomenon is also investigated for various motions of the sources.
Wholly smoothing cutter orientations for five-axis NC machining based on cutter contact point mesh
Institute of Scientific and Technical Information of China (English)
无
2010-01-01
Cutting forces with respect to different cutter orientations are analyzed for five-axis NC machining of a ball-end cutter.A measure is then defined to quantify the effects of cutter orientation variation.According to the measure,a novel model and algorithm are proposed to wholly optimize cutter orientations based on a cutter contact(CC) point mesh.The method has two advantages.One is that the cutter orientation smoothnesses along the feed direction and pick-feed direction are both wholly optimized.The other is that only the accessibility cones of mesh points are required to compute and the computation efficiency is improved.These advantages are shown by simulating the machining efficiency,the stability of feed velocities and the smoothness of cutting force.A computational example and a cutting experiment are finally given to illustrate the validity of the proposed method.
Optimum siting and sizing of a large distributed generator in a mesh connected system
Energy Technology Data Exchange (ETDEWEB)
Elnashar, Mohab M.; El Shatshat, Ramadan; Salama, Magdy M.A. [Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario (Canada)
2010-06-15
This paper proposes a new approach to optimally determine the appropriate size and location of the distributed generator (DG) in a large mesh connected system. This paper presents a visual optimization approach in which the planner plays an important role in determining the optimal siting and sizing of the DG through the choice of the appropriate weight factors of the parameters included in the optimization technique according to the system deficiencies. Losses, voltage profile and short circuit level are used in the algorithm to determine the optimum sizes and locations of the DG. The short circuit level parameter is introduced to represent the protective device requirements in the selection of the size and location of the DG. The proposed technique has been tested on the IEEE 24 - bus mesh connected test system. The obtained results showed clearly that the optimal size and location can be simply determined through the proposed approach. (author)
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.
Optimal Channel Width Adaptation, Logical Topology Design, and Routing in Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
Li Li
2009-01-01
Full Text Available Radio frequency spectrum is a finite and scarce resource. How to efficiently use the spectrum resource is one of the fundamental issues for multi-radio multi-channel wireless mesh networks. However, past research efforts that attempt to exploit multiple channels always assume channels of fixed predetermined width, which prohibits the further effective use of the spectrum resource. In this paper, we address how to optimally adapt channel width to more efficiently utilize the spectrum in IEEE802.11-based multi-radio multi-channel mesh networks. We mathematically formulate the channel width adaptation, logical topology design, and routing as a joint mixed 0-1 integer linear optimization problem, and we also propose our heuristic assignment algorithm. Simulation results show that our method can significantly improve spectrum use efficiency and network performance.
Development of an Unstructured Mesh Code for Flows About Complete Vehicles
Peraire, Jaime; Gupta, K. K. (Technical Monitor)
2001-01-01
This report describes the research work undertaken at the Massachusetts Institute of Technology, under NASA Research Grant NAG4-157. The aim of this research is to identify effective algorithms and methodologies for the efficient and routine solution of flow simulations about complete vehicle configurations. For over ten years we have received support from NASA to develop unstructured mesh methods for Computational Fluid Dynamics. As a result of this effort a methodology based on the use of unstructured adapted meshes of tetrahedra and finite volume flow solvers has been developed. A number of gridding algorithms, flow solvers, and adaptive strategies have been proposed. The most successful algorithms developed from the basis of the unstructured mesh system FELISA. The FELISA system has been extensively for the analysis of transonic and hypersonic flows about complete vehicle configurations. The system is highly automatic and allows for the routine aerodynamic analysis of complex configurations starting from CAD data. The code has been parallelized and utilizes efficient solution algorithms. For hypersonic flows, a version of the code which incorporates real gas effects, has been produced. The FELISA system is also a component of the STARS aeroservoelastic system developed at NASA Dryden. One of the latest developments before the start of this grant was to extend the system to include viscous effects. This required the development of viscous generators, capable of generating the anisotropic grids required to represent boundary layers, and viscous flow solvers. We show some sample hypersonic viscous computations using the developed viscous generators and solvers. Although this initial results were encouraging it became apparent that in order to develop a fully functional capability for viscous flows, several advances in solution accuracy, robustness and efficiency were required. In this grant we set out to investigate some novel methodologies that could lead to the
AbouEisha, Hassan M.
2017-07-13
We consider a class of two-and three-dimensional h-refined meshes generated by an adaptive finite element method. We introduce an element partition tree, which controls the execution of the multi-frontal solver algorithm over these refined grids. We propose and study algorithms with polynomial computational cost for the optimization of these element partition trees. The trees provide an ordering for the elimination of unknowns. The algorithms automatically optimize the element partition trees using extensions of dynamic programming. The construction of the trees by the dynamic programming approach is expensive. These generated trees cannot be used in practice, but rather utilized as a learning tool to propose fast heuristic algorithms. In this first part of our paper we focus on the dynamic programming approach, and draw a sketch of the heuristic algorithm. The second part will be devoted to a more detailed analysis of the heuristic algorithm extended for the case of hp-adaptive
SU-D-207-04: GPU-Based 4D Cone-Beam CT Reconstruction Using Adaptive Meshing Method
Energy Technology Data Exchange (ETDEWEB)
Zhong, Z; Gu, X; Iyengar, P; Mao, W; Wang, J [UT Southwestern Medical Center, Dallas, TX (United States); Guo, X [University of Texas at Dallas, Richardson, TX (United States)
2015-06-15
Purpose: Due to the limited number of projections at each phase, the image quality of a four-dimensional cone-beam CT (4D-CBCT) is often degraded, which decreases the accuracy of subsequent motion modeling. One of the promising methods is the simultaneous motion estimation and image reconstruction (SMEIR) approach. The objective of this work is to enhance the computational speed of the SMEIR algorithm using adaptive feature-based tetrahedral meshing and GPU-based parallelization. Methods: The first step is to generate the tetrahedral mesh based on the features of a reference phase 4D-CBCT, so that the deformation can be well captured and accurately diffused from the mesh vertices to voxels of the image volume. After the mesh generation, the updated motion model and other phases of 4D-CBCT can be obtained by matching the 4D-CBCT projection images at each phase with the corresponding forward projections of the deformed reference phase of 4D-CBCT. The entire process of this 4D-CBCT reconstruction method is implemented on GPU, resulting in significantly increasing the computational efficiency due to its tremendous parallel computing ability. Results: A 4D XCAT digital phantom was used to test the proposed mesh-based image reconstruction algorithm. The image Result shows both bone structures and inside of the lung are well-preserved and the tumor position can be well captured. Compared to the previous voxel-based CPU implementation of SMEIR, the proposed method is about 157 times faster for reconstructing a 10 -phase 4D-CBCT with dimension 256×256×150. Conclusion: The GPU-based parallel 4D CBCT reconstruction method uses the feature-based mesh for estimating motion model and demonstrates equivalent image Result with previous voxel-based SMEIR approach, with significantly improved computational speed.
Theodosiou, T; Vizirianakis, I S; Angelis, L; Tsaftaris, A; Darzentas, N
2011-12-01
PubMed is the most widely used database of biomedical literature. To the detriment of the user though, the ranking of the documents retrieved for a query is not content-based, and important semantic information in the form of assigned Medical Subject Headings (MeSH) terms is not readily presented or productively utilized. The motivation behind this work was the discovery of unanticipated information through the appropriate ranking of MeSH term pairs and, indirectly, documents. Such information can be useful in guiding novel research and following promising trends. A web-based tool, called MeSHy, was developed implementing a mainly statistical algorithm. The algorithm takes into account the frequencies of occurrences, concurrences, and the semantic similarities of MeSH terms in retrieved PubMed documents to create MeSH term pairs. These are then scored and ranked, focusing on their unexpectedly frequent or infrequent occurrences. MeSHy presents results through an online interactive interface facilitating further manipulation through filtering and sorting. The results themselves include the MeSH term pairs, along with MeSH categories, the score, and document IDs, all of which are hyperlinked for convenience. To highlight the applicability of the tool, we report the findings of an expert in the pharmacology field on querying the molecularly-targeted drug imatinib and nutrition-related flavonoids. To the best of our knowledge, MeSHy is the first publicly available tool able to directly provide such a different perspective on the complex nature of published work. Implemented in Perl and served by Apache2 at http://bat.ina.certh.gr/tools/meshy/ with all major browsers supported. Copyright © 2011 Elsevier Inc. All rights reserved.
[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
Optimal Transmitter Placement in Wireless Mesh Networks
2009-06-01
overcome snags. This list is certainly not exhaustive: LtCols Serg Posadas and Carl Oros, Carlos Borges, Jerry Brown, Matt Carlyle, Michael Clement...transceiver sites. Their results compare the performance of greedy, Darwinism , and genetic algorithms in solving the network design problem. Calegari...greedy algorithm is prone to falling into inferior local optima. The Darwinism algorithm iteratively guesses the number of APs needed, then
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.
Distributed Mesh Network Authentication Based on CPK%基于CPK的分布式Mesh网络认证
Institute of Scientific and Technical Information of China (English)
蒋雅兰; 魏慧琴
2012-01-01
Through the study of the existing methods of wireless network security authentication and analysis of the applicability of these methods in the wireless Mesh network, aiming at the distributed characteristics of Mesh network, as well as the particularity of the wireless Mesh router in which the wireless connection capacity is limited, this paper puts forward a solution of a distributed Mesh network authentication based on the CPK algorithm, achieving the purpose of authentication in the wireless Mesh network.%通过对现有的无线网络安全认证机制的研究,以及这些机制在无线Mesh网络适应性方面的分析,针对Mesh网络分布式特点以及无线Mesh路由器无线连接能力有限的特殊性,提出了一种基于CPK算法的分布式Mesh网络认证解决方案,实现了分布式Mesh网络认证.
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.
Flow Oriented Channel Assignment for Multi-radio Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
Niu Zhisheng
2010-01-01
Full Text Available We investigate channel assignment for a multichannel wireless mesh network backbone, where each router is equipped with multiple interfaces. Of particular interest is the development of channel assignment heuristics for multiple flows. We present an optimization formulation and then propose two iterative flow oriented heuristics for the conflict-free and interference-aware cases, respectively. To maximize the aggregate useful end-to-end flow rates, both algorithms identify and resolve congestion at instantaneous bottleneck link in each iteration. Then the link rate is optimally allocated among contending flows that share this link by solving a linear programming (LP problem. A thorough performance evaluation is undertaken as a function of the number of channels and interfaces/node and the number of contending flows. The performance of our algorithm is shown to be significantly superior to best known algorithm in its class in multichannel limited radio scenarios.
Constrained-Transport Magnetohydrodynamics with Adaptive-Mesh-Refinement in CHARM
Miniati, Francesco
2011-01-01
We present the implementation of a three-dimensional, second order accurate Godunov-type algorithm for magneto-hydrodynamic (MHD), in the adaptive-mesh-refinement (AMR) cosmological code {\\tt CHARM}. The algorithm is based on the full 12-solve spatially unsplit Corner-Transport-Upwind (CTU) scheme. The fluid quantities are cell-centered and are updated using the Piecewise-Parabolic-Method (PPM), while the magnetic field variables are face-centered and are evolved through application of the Stokes theorem on cell edges via a Constrained-Transport (CT) method. The multidimensional MHD source terms required in the predictor step for high-order accuracy are applied in a simplified form which reduces their complexity in three dimensions without loss of accuracy or robustness. The algorithm is implemented on an AMR framework which requires specific synchronization steps across refinement levels. These include face-centered restriction and prolongation operations and a {\\it reflux-curl} operation, which maintains a ...
Flow Oriented Channel Assignment for Multi-Radio Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
Fei Ye
2010-01-01
Full Text Available We investigate channel assignment for a multichannel wireless mesh network backbone, where each router is equipped with multiple interfaces. Of particular interest is the development of channel assignment heuristics for multiple flows. We present an optimization formulation and then propose two iterative flow oriented heuristics for the conflict-free and interference-aware cases, respectively. To maximize the aggregate useful end-to-end flow rates, both algorithms identify and resolve congestion at instantaneous bottleneck link in each iteration. Then the link rate is optimally allocated among contending flows that share this link by solving a linear programming (LP problem. A thorough performance evaluation is undertaken as a function of the number of channels and interfaces/node and the number of contending flows. The performance of our algorithm is shown to be significantly superior to best known algorithm in its class in multichannel limited radio scenarios.
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
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.