Lattice Cleaving: A Multimaterial Tetrahedral Meshing Algorithm with Guarantees

PubMed Central

Bronson, Jonathan; Levine, Joshua A.; Whitaker, Ross

2014-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, to reduce element counts in regions of homogeneity. Additionally, we provide proofs showing that both element quality and geometric fidelity are bounded using this approach. PMID:24356365

MHD Simulation of the HIT-SI Experiment

NASA Astrophysics Data System (ADS)

Marklin, George

2003-10-01

The Helicity Injected Torus (HIT) experiment at the University of Washington has been reconfigured into a high beta spheromak with steady state AC current drive [1]. Helicity is injected by two half torus Reversed Field Pinches (RFP's) connected to the ends of the cylindrically symmetric flux conserver, rotated by 90 degrees from each other. The RFP's are driven with sinusoidally varying voltage and flux. Each side has its voltage and flux in phase, but is 90 degrees out of phase from the other side. The helicity injection rate, which is proportional to the voltage times the flux, goes like sin(wt)^2 on one side and cos(wt)^2 on the other, making the total injection rate constant in time. The complex multiply connected 3-dimensional geometry of this device make it difficult to simulate with existing codes that typically use a structured mesh. This poster will describe a new 3D MHD simulation code and a new 3D Taylor state code which both use an unstructured finite element mesh. The mesh is generated from a CAD-like description of an arbitrary arrangement of 3D geometrical objects. Taylor states in the HIT-SI geometry will be shown for different combinations of fluxes in the two injectors. MHD simulation results will be shown starting from a Taylor state with uniform density and temperature and continuing through several cycles of time dependent helicity injection. Field line tracing plots will show the quality of the flux surfaces at various stages in the injection cycle. [1] T. R. Jarboe, Fusion Technology, vol. 36, p. 85, 1999

Improved ALE mesh velocities for complex flows

DOE PAGES

Bakosi, Jozsef; Waltz, Jacob I.; Morgan, Nathaniel Ray

2017-05-31

A key choice in the development of arbitrary Lagrangian-Eulerian solution algorithms is how to move the computational mesh. The most common approaches are smoothing and relaxation techniques, or to compute a mesh velocity field that produces smooth mesh displacements. We present a method in which the mesh velocity is specified by the irrotational component of the fluid velocity as computed from a Helmholtz decomposition, and excess compression of mesh cells is treated through a noniterative, local spring-force model. This approach allows distinct and separate control over rotational and translational modes. In conclusion, the utility of the new mesh motion algorithmmore » is demonstrated on a number of 3D test problems, including problems that involve both shocks and significant amounts of vorticity.« less

Arbitrary Lagrangian-Eulerian Method with Local Structured Adaptive Mesh Refinement for Modeling Shock Hydrodynamics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Anderson, R W; Pember, R B; Elliott, N S

2001-10-22

A new method that combines staggered grid Arbitrary Lagrangian-Eulerian (ALE) techniques with structured local adaptive mesh refinement (AMR) has been developed for solution of the Euler equations. This method facilitates the solution of problems currently at and beyond the boundary of soluble problems by traditional ALE methods by focusing computational resources where they are required through dynamic adaption. Many of the core issues involved in the development of the combined ALEAMR method hinge upon the integration of AMR with a staggered grid Lagrangian integration method. The novel components of the method are mainly driven by the need to reconcile traditionalmore » AMR techniques, which are typically employed on stationary meshes with cell-centered quantities, with the staggered grids and grid motion employed by Lagrangian methods. Numerical examples are presented which demonstrate the accuracy and efficiency of the method.« less

Finite element generation of arbitrary 3-D fracture networks for flow analysis in complicated discrete fracture networks

NASA Astrophysics Data System (ADS)

Zhang, Qi-Hua

2015-10-01

Finite element generation of complicated fracture networks is the core issue and source of technical difficulty in three-dimensional (3-D) discrete fracture network (DFN) flow models. Due to the randomness and uncertainty in the configuration of a DFN, the intersection lines (traces) are arbitrarily distributed in each face (fracture and other surfaces). Hence, subdivision of the fractures is an issue relating to subdivision of two-dimensional (2-D) domains with arbitrarily-distributed constraints. When the DFN configuration is very complicated, the well-known approaches (e.g. Voronoi Delaunay-based methods and advancing-front techniques) cannot operate properly. This paper proposes an algorithm to implement end-to-end connection between traces to subdivide 2-D domains into closed loops. The compositions of the vertices in the common edges between adjacent loops (which may belong to a single fracture or two connected fractures) are thus ensured to be topologically identical. The paper then proposes an approach for triangulating arbitrary loops which does not add any nodes to ensure consistency of the meshes at the common edges. In addition, several techniques relating to tolerance control and improving code robustness are discussed. Finally, the equivalent permeability of the rock mass is calculated for some very complicated DFNs (the DFN may contain 1272 fractures, 633 connected fractures, and 16,270 closed loops). The results are compared with other approaches to demonstrate the veracity and efficiency of the approach proposed in this paper.

Connectivity-based, all-hexahedral mesh generation method and apparatus

DOEpatents

Tautges, T.J.; Mitchell, S.A.; Blacker, T.D.; Murdoch, P.

1998-06-16

The present invention is a computer-based method and apparatus for constructing all-hexahedral finite element meshes for finite element analysis. The present invention begins with a three-dimensional geometry and an all-quadrilateral surface mesh, then constructs hexahedral element connectivity from the outer boundary inward, and then resolves invalid connectivity. The result of the present invention is a complete representation of hex mesh connectivity only; actual mesh node locations are determined later. The basic method of the present invention comprises the step of forming hexahedral elements by making crossings of entities referred to as ``whisker chords.`` This step, combined with a seaming operation in space, is shown to be sufficient for meshing simple block problems. Entities that appear when meshing more complex geometries, namely blind chords, merged sheets, and self-intersecting chords, are described. A method for detecting invalid connectivity in space, based on repeated edges, is also described, along with its application to various cases of invalid connectivity introduced and resolved by the method. 79 figs.

Connectivity-based, all-hexahedral mesh generation method and apparatus

DOEpatents

Tautges, Timothy James; Mitchell, Scott A.; Blacker, Ted D.; Murdoch, Peter

1998-01-01

The present invention is a computer-based method and apparatus for constructing all-hexahedral finite element meshes for finite element analysis. The present invention begins with a three-dimensional geometry and an all-quadrilateral surface mesh, then constructs hexahedral element connectivity from the outer boundary inward, and then resolves invalid connectivity. The result of the present invention is a complete representation of hex mesh connectivity only; actual mesh node locations are determined later. The basic method of the present invention comprises the step of forming hexahedral elements by making crossings of entities referred to as "whisker chords." This step, combined with a seaming operation in space, is shown to be sufficient for meshing simple block problems. Entities that appear when meshing more complex geometries, namely blind chords, merged sheets, and self-intersecting chords, are described. A method for detecting invalid connectivity in space, based on repeated edges, is also described, along with its application to various cases of invalid connectivity introduced and resolved by the method.

Multi-Material ALE with AMR for Modeling Hot Plasmas and Cold Fragmenting Materials

NASA Astrophysics Data System (ADS)

Alice, Koniges; Nathan, Masters; Aaron, Fisher; David, Eder; Wangyi, Liu; Robert, Anderson; David, Benson; Andrea, Bertozzi

2015-02-01

We have developed a new 3D multi-physics multi-material code, ALE-AMR, which combines Arbitrary Lagrangian Eulerian (ALE) hydrodynamics with Adaptive Mesh Refinement (AMR) to connect the continuum to the microstructural regimes. The code is unique in its ability to model hot radiating plasmas and cold fragmenting solids. New numerical techniques were developed for many of the physics packages to work efficiently on a dynamically moving and adapting mesh. We use interface reconstruction based on volume fractions of the material components within mixed zones and reconstruct interfaces as needed. This interface reconstruction model is also used for void coalescence and fragmentation. A flexible strength/failure framework allows for pluggable material models, which may require material history arrays to determine the level of accumulated damage or the evolving yield stress in J2 plasticity models. For some applications laser rays are propagating through a virtual composite mesh consisting of the finest resolution representation of the modeled space. A new 2nd order accurate diffusion solver has been implemented for the thermal conduction and radiation transport packages. One application area is the modeling of laser/target effects including debris/shrapnel generation. Other application areas include warm dense matter, EUV lithography, and material wall interactions for fusion devices.

Comparison of updated Lagrangian FEM with arbitrary Lagrangian Eulerian method for 3D thermo-mechanical extrusion of a tube profile

NASA Astrophysics Data System (ADS)

Kronsteiner, J.; Horwatitsch, D.; Zeman, K.

2017-10-01

Thermo-mechanical numerical modelling and simulation of extrusion processes faces several serious challenges. Large plastic deformations in combination with a strong coupling of thermal with mechanical effects leads to a high numerical demand for the solution as well as for the handling of mesh distortions. The two numerical methods presented in this paper also reflect two different ways to deal with mesh distortions. Lagrangian Finite Element Methods (FEM) tackle distorted elements by building a new mesh (called re-meshing) whereas Arbitrary Lagrangian Eulerian (ALE) methods use an "advection" step to remap the solution from the distorted to the undistorted mesh. Another difference between conventional Lagrangian and ALE methods is the separate treatment of material and mesh in ALE, allowing the definition of individual velocity fields. In theory, an ALE formulation contains the Eulerian formulation as a subset to the Lagrangian description of the material. The investigations presented in this paper were dealing with the direct extrusion of a tube profile using EN-AW 6082 aluminum alloy and a comparison of experimental with Lagrangian and ALE results. The numerical simulations cover the billet upsetting and last until one third of the billet length is extruded. A good qualitative correlation of experimental and numerical results could be found, however, major differences between Lagrangian and ALE methods concerning thermo-mechanical coupling lead to deviations in the thermal results.

Diffuse interface simulation of bubble rising process: a comparison of adaptive mesh refinement and arbitrary lagrange-euler methods

NASA Astrophysics Data System (ADS)

Wang, Ye; Cai, Jiejin; Li, Qiong; Yin, Huaqiang; Yang, Xingtuan

2018-06-01

Gas-liquid two phase flow exists in several industrial processes and light-water reactors (LWRs). A diffuse interface based finite element method with two different mesh generation methods namely, the Adaptive Mesh Refinement (AMR) and the Arbitrary Lagrange Euler (ALE) methods is used to model the shape and velocity changes in a rising bubble. Moreover, the calculating speed and mesh generation strategies of AMR and ALE are contrasted. The simulation results agree with the Bhagat's experiments, indicating that both mesh generation methods can simulate the characteristics of bubble accurately. We concluded that: the small bubble rises as elliptical with oscillation, whereas a larger bubble (11 mm > d > 7 mm) rises with a morphology between the elliptical and cap type with a larger oscillation. When the bubble is large (d > 11 mm), it rises up as a cap type, and the amplitude becomes smaller. Moreover, it takes longer to achieve the stable shape from the ellipsoid to the spherical cap type with the increase of the bubble diameter. The results also show that for smaller diameter case, the ALE method uses fewer grids and has a faster calculation speed, but the AMR method can solve the case of a large geometry deformation efficiently.

Resistive-force theory for mesh-like superhydrophobic surfaces

NASA Astrophysics Data System (ADS)

Schnitzer, Ory; Yariv, Ehud

2018-03-01

A common realization of superhydrophobic surfaces makes use of a mesh-like geometry, where pockets of air are trapped in a periodic array of holes in a no-slip solid substrate. We consider the small-solid-fraction limit where the ribs of the mesh are narrow. In this limit, we obtain a simple leading-order approximation for the slip-length tensor of an arbitrary mesh geometry. This approximation scales as the solid-fraction logarithm, as anticipated by Ybert et al. [Phys. Fluids 19, 123601 (2007), 10.1063/1.2815730]; in the special case of a square mesh it agrees with the analytical results obtained by Davis and Lauga [Phys. Fluids 21, 113101 (2009), 10.1063/1.3250947].

Method and apparatus for connecting finite element meshes and performing simulations therewith

DOEpatents

Dohrmann, Clark R.; Key, Samuel W.; Heinstein, Martin W.

2003-05-06

The present invention provides a method of connecting dissimilar finite element meshes. A first mesh, designated the master mesh, and a second mesh, designated the slave mesh, each have interface surfaces proximal the other. Each interface surface has a corresponding interface mesh comprising a plurality of interface nodes. Each slave interface node is assigned new coordinates locating the interface node on the interface surface of the master mesh. The slave interface surface is further redefined to be the projection of the slave interface mesh onto the master interface surface.

An efficient Adaptive Mesh Refinement (AMR) algorithm for the Discontinuous Galerkin method: Applications for the computation of compressible two-phase flows

NASA Astrophysics Data System (ADS)

Papoutsakis, Andreas; Sazhin, Sergei S.; Begg, Steven; Danaila, Ionut; Luddens, Francky

2018-06-01

We present an Adaptive Mesh Refinement (AMR) method suitable for hybrid unstructured meshes that allows for local refinement and de-refinement of the computational grid during the evolution of the flow. The adaptive implementation of the Discontinuous Galerkin (DG) method introduced in this work (ForestDG) is based on a topological representation of the computational mesh by a hierarchical structure consisting of oct- quad- and binary trees. Adaptive mesh refinement (h-refinement) enables us to increase the spatial resolution of the computational mesh in the vicinity of the points of interest such as interfaces, geometrical features, or flow discontinuities. The local increase in the expansion order (p-refinement) at areas of high strain rates or vorticity magnitude results in an increase of the order of accuracy in the region of shear layers and vortices. A graph of unitarian-trees, representing hexahedral, prismatic and tetrahedral elements is used for the representation of the initial domain. The ancestral elements of the mesh can be split into self-similar elements allowing each tree to grow branches to an arbitrary level of refinement. The connectivity of the elements, their genealogy and their partitioning are described by linked lists of pointers. An explicit calculation of these relations, presented in this paper, facilitates the on-the-fly splitting, merging and repartitioning of the computational mesh by rearranging the links of each node of the tree with a minimal computational overhead. The modal basis used in the DG implementation facilitates the mapping of the fluxes across the non conformal faces. The AMR methodology is presented and assessed using a series of inviscid and viscous test cases. Also, the AMR methodology is used for the modelling of the interaction between droplets and the carrier phase in a two-phase flow. This approach is applied to the analysis of a spray injected into a chamber of quiescent air, using the Eulerian-Lagrangian approach. This enables us to refine the computational mesh in the vicinity of the droplet parcels and accurately resolve the coupling between the two phases.

Unstructured and adaptive mesh generation for high Reynolds number viscous flows

NASA Technical Reports Server (NTRS)

Mavriplis, Dimitri J.

1991-01-01

A method for generating and adaptively refining a highly stretched unstructured mesh suitable for the computation of high-Reynolds-number viscous flows about arbitrary two-dimensional geometries was developed. The method is based on the Delaunay triangulation of a predetermined set of points and employs a local mapping in order to achieve the high stretching rates required in the boundary-layer and wake regions. The initial mesh-point distribution is determined in a geometry-adaptive manner which clusters points in regions of high curvature and sharp corners. Adaptive mesh refinement is achieved by adding new points in regions of large flow gradients, and locally retriangulating; thus, obviating the need for global mesh regeneration. Initial and adapted meshes about complex multi-element airfoil geometries are shown and compressible flow solutions are computed on these meshes.

Overset meshing coupled with hybridizable discontinuous Galerkin finite elements

DOE PAGES

Kauffman, Justin A.; Sheldon, Jason P.; Miller, Scott T.

2017-03-01

We introduce the use of hybridizable discontinuous Galerkin (HDG) finite element methods on overlapping (overset) meshes. Overset mesh methods are advantageous for solving problems on complex geometrical domains. We also combine geometric flexibility of overset methods with the advantages of HDG methods: arbitrarily high-order accuracy, reduced size of the global discrete problem, and the ability to solve elliptic, parabolic, and/or hyperbolic problems with a unified form of discretization. This approach to developing the ‘overset HDG’ method is to couple the global solution from one mesh to the local solution on the overset mesh. We present numerical examples for steady convection–diffusionmore » and static elasticity problems. The examples demonstrate optimal order convergence in all primal fields for an arbitrary amount of overlap of the underlying meshes.« less

A point-centered arbitrary Lagrangian Eulerian hydrodynamic approach for tetrahedral meshes

DOE PAGES

Morgan, Nathaniel R.; Waltz, Jacob I.; Burton, Donald E.; ...

2015-02-24

We present a three dimensional (3D) arbitrary Lagrangian Eulerian (ALE) hydrodynamic scheme suitable for modeling complex compressible flows on tetrahedral meshes. The new approach stores the conserved variables (mass, momentum, and total energy) at the nodes of the mesh and solves the conservation equations on a control volume surrounding the point. This type of an approach is termed a point-centered hydrodynamic (PCH) method. The conservation equations are discretized using an edge-based finite element (FE) approach with linear basis functions. All fluxes in the new approach are calculated at the center of each tetrahedron. A multidirectional Riemann-like problem is solved atmore » the center of the tetrahedron. The advective fluxes are calculated by solving a 1D Riemann problem on each face of the nodal control volume. A 2-stage Runge–Kutta method is used to evolve the solution forward in time, where the advective fluxes are part of the temporal integration. The mesh velocity is smoothed by solving a Laplacian equation. The details of the new ALE hydrodynamic scheme are discussed. Results from a range of numerical test problems are presented.« less

Jali - Unstructured Mesh Infrastructure for Multi-Physics Applications

DOE Office of Scientific and Technical Information (OSTI.GOV)

Garimella, Rao V; Berndt, Markus; Coon, Ethan

2017-04-13

Jali is a parallel unstructured mesh infrastructure library designed for use by multi-physics simulations. It supports 2D and 3D arbitrary polyhedral meshes distributed over hundreds to thousands of nodes. Jali can read write Exodus II meshes along with fields and sets on the mesh and support for other formats is partially implemented or is (https://github.com/MeshToolkit/MSTK), an open source general purpose unstructured mesh infrastructure library from Los Alamos National Laboratory. While it has been made to work with other mesh frameworks such as MOAB and STKmesh in the past, support for maintaining the interface to these frameworks has been suspended formore » now. Jali supports distributed as well as on-node parallelism. Support of on-node parallelism is through direct use of the the mesh in multi-threaded constructs or through the use of "tiles" which are submeshes or sub-partitions of a partition destined for a compute node.« less

LR: Compact connectivity representation for triangle meshes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gurung, T; Luffel, M; Lindstrom, P

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 formore » traversing a mesh, and show that LR often saves both space and traversal time over competing representations.« less

Minimizing finite-volume discretization errors on polyhedral meshes

NASA Astrophysics Data System (ADS)

Mouly, Quentin; Evrard, Fabien; van Wachem, Berend; Denner, Fabian

2017-11-01

Tetrahedral meshes are widely used in CFD to simulate flows in and around complex geometries, as automatic generation tools now allow tetrahedral meshes to represent arbitrary domains in a relatively accessible manner. Polyhedral meshes, however, are an increasingly popular alternative. While tetrahedron have at most four neighbours, the higher number of neighbours per polyhedral cell leads to a more accurate evaluation of gradients, essential for the numerical resolution of PDEs. The use of polyhedral meshes, nonetheless, introduces discretization errors for finite-volume methods: skewness and non-orthogonality, which occur with all sorts of unstructured meshes, as well as errors due to non-planar faces, specific to polygonal faces with more than three vertices. Indeed, polyhedral mesh generation algorithms cannot, in general, guarantee to produce meshes free of non-planar faces. The presented work focuses on the quantification and optimization of discretization errors on polyhedral meshes in the context of finite-volume methods. A quasi-Newton method is employed to optimize the relevant mesh quality measures. Various meshes are optimized and CFD results of cases with known solutions are presented to assess the improvements the optimization approach can provide.

WENO schemes on arbitrary mixed-element unstructured meshes in three space dimensions

NASA Astrophysics Data System (ADS)

Tsoutsanis, P.; Titarev, V. A.; Drikakis, D.

2011-02-01

The paper extends weighted essentially non-oscillatory (WENO) methods to three dimensional mixed-element unstructured meshes, comprising tetrahedral, hexahedral, prismatic and pyramidal elements. Numerical results illustrate the convergence rates and non-oscillatory properties of the schemes for various smooth and discontinuous solutions test cases and the compressible Euler equations on various types of grids. Schemes of up to fifth order of spatial accuracy are considered.

A coupled ALE-AMR method for shock hydrodynamics

DOE PAGES

Waltz, J.; Bakosi, J.

2018-03-05

We present a numerical method combining adaptive mesh refinement (AMR) with arbitrary Lagrangian-Eulerian (ALE) mesh motion for the simulation of shock hydrodynamics on unstructured grids. The primary goal of the coupled method is to use AMR to reduce numerical error in ALE simulations at reduced computational expense relative to uniform fine mesh calculations, in the same manner that AMR has been used in Eulerian simulations. We also identify deficiencies with ALE methods that AMR is able to mitigate, and discuss the unique coupling challenges. The coupled method is demonstrated using three-dimensional unstructured meshes of up to O(10 7) tetrahedral cells.more » Convergence of ALE-AMR solutions towards both uniform fine mesh ALE results and analytic solutions is demonstrated. Speed-ups of 5-10× for a given level of error are observed relative to uniform fine mesh calculations.« less

A coupled ALE-AMR method for shock hydrodynamics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Waltz, J.; Bakosi, J.

We present a numerical method combining adaptive mesh refinement (AMR) with arbitrary Lagrangian-Eulerian (ALE) mesh motion for the simulation of shock hydrodynamics on unstructured grids. The primary goal of the coupled method is to use AMR to reduce numerical error in ALE simulations at reduced computational expense relative to uniform fine mesh calculations, in the same manner that AMR has been used in Eulerian simulations. We also identify deficiencies with ALE methods that AMR is able to mitigate, and discuss the unique coupling challenges. The coupled method is demonstrated using three-dimensional unstructured meshes of up to O(10 7) tetrahedral cells.more » Convergence of ALE-AMR solutions towards both uniform fine mesh ALE results and analytic solutions is demonstrated. Speed-ups of 5-10× for a given level of error are observed relative to uniform fine mesh calculations.« less

Laser Ray Tracing in a Parallel Arbitrary Lagrangian-Eulerian Adaptive Mesh Refinement Hydrocode

DOE Office of Scientific and Technical Information (OSTI.GOV)

Masters, N D; Kaiser, T B; Anderson, R W

2009-09-28

ALE-AMR is a new hydrocode that we are developing as a predictive modeling tool for debris and shrapnel formation in high-energy laser experiments. In this paper we present our approach to implementing laser ray-tracing in ALE-AMR. We present the equations of laser ray tracing, our approach to efficient traversal of the adaptive mesh hierarchy in which we propagate computational rays through a virtual composite mesh consisting of the finest resolution representation of the modeled space, and anticipate simulations that will be compared to experiments for code validation.

Revisiting the Least-squares Procedure for Gradient Reconstruction on Unstructured Meshes

NASA Technical Reports Server (NTRS)

Mavriplis, Dimitri J.; Thomas, James L. (Technical Monitor)

2003-01-01

The accuracy of the least-squares technique for gradient reconstruction on unstructured meshes is examined. While least-squares techniques produce accurate results on arbitrary isotropic unstructured meshes, serious difficulties exist for highly stretched meshes in the presence of surface curvature. In these situations, gradients are typically under-estimated by up to an order of magnitude. For vertex-based discretizations on triangular and quadrilateral meshes, and cell-centered discretizations on quadrilateral meshes, accuracy can be recovered using an inverse distance weighting in the least-squares construction. For cell-centered discretizations on triangles, both the unweighted and weighted least-squares constructions fail to provide suitable gradient estimates for highly stretched curved meshes. Good overall flow solution accuracy can be retained in spite of poor gradient estimates, due to the presence of flow alignment in exactly the same regions where the poor gradient accuracy is observed. However, the use of entropy fixes has the potential for generating large but subtle discretization errors.

Three-dimensional unstructured grid refinement and optimization using edge-swapping

NASA Technical Reports Server (NTRS)

Gandhi, Amar; Barth, Timothy

1993-01-01

This paper presents a three-dimensional (3-D) 'edge-swapping method based on local transformations. This method extends Lawson's edge-swapping algorithm into 3-D. The 3-D edge-swapping algorithm is employed for the purpose of refining and optimizing unstructured meshes according to arbitrary mesh-quality measures. Several criteria including Delaunay triangulations are examined. Extensions from two to three dimensions of several known properties of Delaunay triangulations are also discussed.

An advancing front Delaunay triangulation algorithm designed for robustness

NASA Technical Reports Server (NTRS)

Mavriplis, D. J.

1992-01-01

A new algorithm is described for generating an unstructured mesh about an arbitrary two-dimensional configuration. Mesh points are generated automatically by the algorithm in a manner which ensures a smooth variation of elements, and the resulting triangulation constitutes the Delaunay triangulation of these points. The algorithm combines the mathematical elegance and efficiency of Delaunay triangulation algorithms with the desirable point placement features, boundary integrity, and robustness traditionally associated with advancing-front-type mesh generation strategies. The method offers increased robustness over previous algorithms in that it cannot fail regardless of the initial boundary point distribution and the prescribed cell size distribution throughout the flow-field.

An h-p Taylor-Galerkin finite element method for compressible Euler equations

NASA Technical Reports Server (NTRS)

Demkowicz, L.; Oden, J. T.; Rachowicz, W.; Hardy, O.

1991-01-01

An extension of the familiar Taylor-Galerkin method to arbitrary h-p spatial approximations is proposed. Boundary conditions are analyzed, and a linear stability result for arbitrary meshes is given, showing the unconditional stability for the parameter of implicitness alpha not less than 0.5. The wedge and blunt body problems are solved with both linear, quadratic, and cubic elements and h-adaptivity, showing the feasibility of higher orders of approximation for problems with shocks.

A case study to quantify prediction bounds caused by model-form uncertainty of a portal frame

NASA Astrophysics Data System (ADS)

Van Buren, Kendra L.; Hall, Thomas M.; Gonzales, Lindsey M.; Hemez, François M.; Anton, Steven R.

2015-01-01

Numerical simulations, irrespective of the discipline or application, are often plagued by arbitrary numerical and modeling choices. Arbitrary choices can originate from kinematic assumptions, for example the use of 1D beam, 2D shell, or 3D continuum elements, mesh discretization choices, boundary condition models, and the representation of contact and friction in the simulation. This work takes a step toward understanding the effect of arbitrary choices and model-form assumptions on the accuracy of numerical predictions. The application is the simulation of the first four resonant frequencies of a one-story aluminum portal frame structure under free-free boundary conditions. The main challenge of the portal frame structure resides in modeling the joint connections, for which different modeling assumptions are available. To study this model-form uncertainty, and compare it to other types of uncertainty, two finite element models are developed using solid elements, and with differing representations of the beam-to-column and column-to-base plate connections: (i) contact stiffness coefficients or (ii) tied nodes. Test-analysis correlation is performed to compare the lower and upper bounds of numerical predictions obtained from parametric studies of the joint modeling strategies to the range of experimentally obtained natural frequencies. The approach proposed is, first, to characterize the experimental variability of the joints by varying the bolt torque, method of bolt tightening, and the sequence in which the bolts are tightened. The second step is to convert what is learned from these experimental studies to models that "envelope" the range of observed bolt behavior. We show that this approach, that combines small-scale experiments, sensitivity analysis studies, and bounding-case models, successfully produces lower and upper bounds of resonant frequency predictions that match those measured experimentally on the frame structure. (Approved for unlimited, public release, LA-UR-13-27561).

Texturing of continuous LOD meshes with the hierarchical texture atlas

NASA Astrophysics Data System (ADS)

Birkholz, Hermann

2006-02-01

For the rendering of detailed virtual environments, trade-offs have to be made between image quality and rendering time. An immersive experience of virtual reality always demands high frame-rates with the best reachable image qual-ity. Continuous Level of Detail (cLoD) triangle-meshes provide an continuous spectrum of detail for a triangle mesh that can be used to create view-dependent approximations of the environment in real-time. This enables the rendering with a constant number of triangles and thus with constant frame-rates. Normally the construction of such cLoD mesh representations leads to the loss of all texture information of the original mesh. To overcome this problem, a parameter domain can be created, in order to map the surface properties (colour, texture, normal) to it. This parameter domain can be used to map the surface properties back to arbitrary approximations of the original mesh. The parameter domain is often a simplified version of the mesh to be parameterised. This limits the reachable simplification to the domain mesh which has to map the surface of the original mesh with the least possible stretch. In this paper, a hierarchical domain mesh is presented, that scales between very coarse domain meshes and good property-mapping.

A hybrid framework for coupling arbitrary summation-by-parts schemes on general meshes

NASA Astrophysics Data System (ADS)

Lundquist, Tomas; Malan, Arnaud; Nordström, Jan

2018-06-01

We develop a general interface procedure to couple both structured and unstructured parts of a hybrid mesh in a non-collocated, multi-block fashion. The target is to gain optimal computational efficiency in fluid dynamics simulations involving complex geometries. While guaranteeing stability, the proposed procedure is optimized for accuracy and requires minimal algorithmic modifications to already existing schemes. Initial numerical investigations confirm considerable efficiency gains compared to non-hybrid calculations of up to an order of magnitude.

Emerging trend prediction in biomedical literature.

PubMed

Moerchen, Fabian; Fradkin, Dmitriy; Dejori, Mathaeus; Wachmann, Bernd

2008-11-06

We present a study on how to predict new emerging trends in the biomedical domain based on textual data. We thereby propose a way of anticipating the transformation of arbitrary information into ground truth knowledge by predicting the inclusion of new terms into the MeSH ontology. We also discuss the preparation of a dataset for the evaluation of emerging trend prediction algorithms that is based on PubMed abstracts and related MeSH terms. The results suggest that early prediction of emerging trends is possible.

Numerical modeling of pulsed laser-material interaction and of laser plume dynamics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhao, Qiang; Shi, Yina

2015-03-10

We have developed two-dimensional Arbitrary Lagrangian Eulerian (ALE) code which is used to study the physical processes, the plasma absorption, the crater profile, and the temperature distribution on metallic target and below the surface. The ALE method overcomes problems with Lagrangian moving mesh distortion by mesh smoothing and conservative quantities remapping from Lagrangian mesh to smoothed one. A new second order accurate diffusion solver has been implemented for the thermal conduction and radiation transport on distorted mesh. The results of numerical simulation of pulsed laser ablation are presented. The influences of different processes, such as time evolution of the surfacemore » temperature, interspecies interactions (elastic collisions, recombination-dissociation reaction), interaction with an ambient gas are examined. The study presents particular interest for the analysis of experimental results obtained during pulsed laser ablation.« less

Dynamic Mesh Adaptation for Front Evolution Using Discontinuous Galerkin Based Weighted Condition Number Mesh Relaxation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Greene, Patrick T.; Schofield, Samuel P.; Nourgaliev, Robert

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 amore » 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.« less

Design of an essentially non-oscillatory reconstruction procedure on finite-element type meshes

NASA Technical Reports Server (NTRS)

Abgrall, R.

1991-01-01

An essentially non-oscillatory reconstruction for functions defined on finite-element type meshes was designed. Two related problems are studied: the interpolation of possibly unsmooth multivariate functions on arbitrary meshes and the reconstruction of a function from its average in the control volumes surrounding the nodes of the mesh. Concerning the first problem, we have studied the behavior of the highest coefficients of the Lagrange interpolation function which may admit discontinuities of locally regular curves. This enables us to choose the best stencil for the interpolation. The choice of the smallest possible number of stencils is addressed. Concerning the reconstruction problem, because of the very nature of the mesh, the only method that may work is the so called reconstruction via deconvolution method. Unfortunately, it is well suited only for regular meshes as we show, but we also show how to overcome this difficulty. The global method has the expected order of accuracy but is conservative up to a high order quadrature formula only. Some numerical examples are given which demonstrate the efficiency of the method.

Gas flow calculation method of a ramjet engine

NASA Astrophysics Data System (ADS)

Kostyushin, Kirill; Kagenov, Anuar; Eremin, Ivan; Zhiltsov, Konstantin; Shuvarikov, Vladimir

2017-11-01

At the present study calculation methodology of gas dynamics equations in ramjet engine is presented. The algorithm is based on Godunov`s scheme. For realization of calculation algorithm, the system of data storage is offered, the system does not depend on mesh topology, and it allows using the computational meshes with arbitrary number of cell faces. The algorithm of building a block-structured grid is given. Calculation algorithm in the software package "FlashFlow" is implemented. Software package is verified on the calculations of simple configurations of air intakes and scramjet models.

Enriching Triangle Mesh Animations with Physically Based Simulation.

PubMed

Li, Yijing; Xu, Hongyi; Barbic, Jernej

2017-10-01

We present a system to combine arbitrary triangle mesh animations with physically based Finite Element Method (FEM) simulation, enabling control over the combination both in space and time. The input is a triangle mesh animation obtained using any method, such as keyframed animation, character rigging, 3D scanning, or geometric shape modeling. The input may be non-physical, crude or even incomplete. The user provides weights, specified using a minimal user interface, for how much physically based simulation should be allowed to modify the animation in any region of the model, and in time. Our system then computes a physically-based animation that is constrained to the input animation to the amount prescribed by these weights. This permits smoothly turning physics on and off over space and time, making it possible for the output to strictly follow the input, to evolve purely based on physically based simulation, and anything in between. Achieving such results requires a careful combination of several system components. We propose and analyze these components, including proper automatic creation of simulation meshes (even for non-manifold and self-colliding undeformed triangle meshes), converting triangle mesh animations into animations of the simulation mesh, and resolving collisions and self-collisions while following the input.

Three new models for evaluation of standard involute spur gear mesh stiffness

NASA Astrophysics Data System (ADS)

Liang, Xihui; Zhang, Hongsheng; Zuo, Ming J.; Qin, Yong

2018-02-01

Time-varying mesh stiffness is one of the main internal excitation sources of gear dynamics. Accurate evaluation of gear mesh stiffness is crucial for gear dynamic analysis. This study is devoted to developing new models for spur gear mesh stiffness evaluation. Three models are proposed. The proposed model 1 can give very accurate mesh stiffness result but the gear bore surface must be assumed to be rigid. Enlighted by the proposed model 1, our research discovers that the angular deflection pattern of the gear bore surface of a pair of meshing gears under a constant torque basically follows a cosine curve. Based on this finding, two other models are proposed. The proposed model 2 evaluates gear mesh stiffness by using angular deflections at different circumferential angles of an end surface circle of the gear bore. The proposed model 3 requires using only the angular deflection at an arbitrary circumferential angle of an end surface circle of the gear bore but this model can only be used for a gear with the same tooth profile among all teeth. The proposed models are accurate in gear mesh stiffness evaluation and easy to use. Finite element analysis is used to validate the accuracy of the proposed models.

High-Order Moving Overlapping Grid Methodology in a Spectral Element Method

NASA Astrophysics Data System (ADS)

Merrill, Brandon E.

A moving overlapping mesh methodology that achieves spectral accuracy in space and up to second-order accuracy in time is developed for solution of unsteady incompressible flow equations in three-dimensional domains. The targeted applications are in aerospace and mechanical engineering domains and involve problems in turbomachinery, rotary aircrafts, wind turbines and others. The methodology is built within the dual-session communication framework initially developed for stationary overlapping meshes. The methodology employs semi-implicit spectral element discretization of equations in each subdomain and explicit treatment of subdomain interfaces with spectrally-accurate spatial interpolation and high-order accurate temporal extrapolation, and requires few, if any, iterations, yet maintains the global accuracy and stability of the underlying flow solver. Mesh movement is enabled through the Arbitrary Lagrangian-Eulerian formulation of the governing equations, which allows for prescription of arbitrary velocity values at discrete mesh points. The stationary and moving overlapping mesh methodologies are thoroughly validated using two- and three-dimensional benchmark problems in laminar and turbulent flows. The spatial and temporal global convergence, for both methods, is documented and is in agreement with the nominal order of accuracy of the underlying solver. Stationary overlapping mesh methodology was validated to assess the influence of long integration times and inflow-outflow global boundary conditions on the performance. In a turbulent benchmark of fully-developed turbulent pipe flow, the turbulent statistics are validated against the available data. Moving overlapping mesh simulations are validated on the problems of two-dimensional oscillating cylinder and a three-dimensional rotating sphere. The aerodynamic forces acting on these moving rigid bodies are determined, and all results are compared with published data. Scaling tests, with both methodologies, show near linear strong scaling, even for moderately large processor counts. The moving overlapping mesh methodology is utilized to investigate the effect of an upstream turbulent wake on a three-dimensional oscillating NACA0012 extruded airfoil. A direct numerical simulation (DNS) at Reynolds Number 44,000 is performed for steady inflow incident upon the airfoil oscillating between angle of attack 5.6° and 25° with reduced frequency k=0.16. Results are contrasted with subsequent DNS of the same oscillating airfoil in a turbulent wake generated by a stationary upstream cylinder.

Mesh Oriented datABase

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tautges, Timothy J.

MOAB is a component for representing and evaluating mesh data. MOAB can store stuctured 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 handlesmore » 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 isa powerful yet simple interface for representing metadata or application-specific data. For example, sets and tags can be used together to describe geometric topology, boundary condition, and inter-processor interface groupings in a mesh. MOAB is used in several ways in various applications. MOAB serves as the underlying mesh data representation in the VERDE mesh verification code. MOAB can also be used as a mesh input mechanism, using mesh readers induded with MOAB, or as a t’anslator between mesh formats, using readers and writers included with MOAB.« less

An automatic generation of non-uniform mesh for CFD analyses of image-based multiscale human airway models

NASA Astrophysics Data System (ADS)

Miyawaki, Shinjiro; Tawhai, Merryn H.; Hoffman, Eric A.; Lin, Ching-Long

2014-11-01

The authors have developed a method to automatically generate non-uniform CFD mesh for image-based human airway models. The sizes of generated tetrahedral elements vary in both radial and longitudinal directions to account for boundary layer and multiscale nature of pulmonary airflow. The proposed method takes advantage of our previously developed centerline-based geometry reconstruction method. In order to generate the mesh branch by branch in parallel, we used the open-source programs Gmsh and TetGen for surface and volume meshes, respectively. Both programs can specify element sizes by means of background mesh. The size of an arbitrary element in the domain is a function of wall distance, element size on the wall, and element size at the center of airway lumen. The element sizes on the wall are computed based on local flow rate and airway diameter. The total number of elements in the non-uniform mesh (10 M) was about half of that in the uniform mesh, although the computational time for the non-uniform mesh was about twice longer (170 min). The proposed method generates CFD meshes with fine elements near the wall and smooth variation of element size in longitudinal direction, which are required, e.g., for simulations with high flow rate. NIH Grants R01-HL094315, U01-HL114494, and S10-RR022421. Computer time provided by XSEDE.

An electrostatic Particle-In-Cell code on multi-block structured meshes

NASA Astrophysics Data System (ADS)

Meierbachtol, Collin S.; Svyatskiy, Daniil; Delzanno, Gian Luca; Vernon, Louis J.; Moulton, J. David

2017-12-01

We present an electrostatic Particle-In-Cell (PIC) code on multi-block, locally structured, curvilinear meshes called Curvilinear PIC (CPIC). Multi-block meshes are essential to capture complex geometries accurately and with good mesh quality, something that would not be possible with single-block structured meshes that are often used in PIC and for which CPIC was initially developed. Despite the structured nature of the individual blocks, multi-block meshes resemble unstructured meshes in a global sense and introduce several new challenges, such as the presence of discontinuities in the mesh properties and coordinate orientation changes across adjacent blocks, and polyjunction points where an arbitrary number of blocks meet. In CPIC, these challenges have been met by an approach that features: (1) a curvilinear formulation of the PIC method: each mesh block is mapped from the physical space, where the mesh is curvilinear and arbitrarily distorted, to the logical space, where the mesh is uniform and Cartesian on the unit cube; (2) a mimetic discretization of Poisson's equation suitable for multi-block meshes; and (3) a hybrid (logical-space position/physical-space velocity), asynchronous particle mover that mitigates the performance degradation created by the necessity to track particles as they move across blocks. The numerical accuracy of CPIC was verified using two standard plasma-material interaction tests, which demonstrate good agreement with the corresponding analytic solutions. Compared to PIC codes on unstructured meshes, which have also been used for their flexibility in handling complex geometries but whose performance suffers from issues associated with data locality and indirect data access patterns, PIC codes on multi-block structured meshes may offer the best compromise for capturing complex geometries while also maintaining solution accuracy and computational efficiency.

An electrostatic Particle-In-Cell code on multi-block structured meshes

DOE PAGES

Meierbachtol, Collin S.; Svyatskiy, Daniil; Delzanno, Gian Luca; ...

2017-09-14

We present an electrostatic Particle-In-Cell (PIC) code on multi-block, locally structured, curvilinear meshes called Curvilinear PIC (CPIC). Multi-block meshes are essential to capture complex geometries accurately and with good mesh quality, something that would not be possible with single-block structured meshes that are often used in PIC and for which CPIC was initially developed. In spite of the structured nature of the individual blocks, multi-block meshes resemble unstructured meshes in a global sense and introduce several new challenges, such as the presence of discontinuities in the mesh properties and coordinate orientation changes across adjacent blocks, and polyjunction points where anmore » arbitrary number of blocks meet. In CPIC, these challenges have been met by an approach that features: (1) a curvilinear formulation of the PIC method: each mesh block is mapped from the physical space, where the mesh is curvilinear and arbitrarily distorted, to the logical space, where the mesh is uniform and Cartesian on the unit cube; (2) a mimetic discretization of Poisson's equation suitable for multi-block meshes; and (3) a hybrid (logical-space position/physical-space velocity), asynchronous particle mover that mitigates the performance degradation created by the necessity to track particles as they move across blocks. The numerical accuracy of CPIC was verified using two standard plasma–material interaction tests, which demonstrate good agreement with the corresponding analytic solutions. And compared to PIC codes on unstructured meshes, which have also been used for their flexibility in handling complex geometries but whose performance suffers from issues associated with data locality and indirect data access patterns, PIC codes on multi-block structured meshes may offer the best compromise for capturing complex geometries while also maintaining solution accuracy and computational efficiency.« less

An electrostatic Particle-In-Cell code on multi-block structured meshes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Meierbachtol, Collin S.; Svyatskiy, Daniil; Delzanno, Gian Luca

We present an electrostatic Particle-In-Cell (PIC) code on multi-block, locally structured, curvilinear meshes called Curvilinear PIC (CPIC). Multi-block meshes are essential to capture complex geometries accurately and with good mesh quality, something that would not be possible with single-block structured meshes that are often used in PIC and for which CPIC was initially developed. In spite of the structured nature of the individual blocks, multi-block meshes resemble unstructured meshes in a global sense and introduce several new challenges, such as the presence of discontinuities in the mesh properties and coordinate orientation changes across adjacent blocks, and polyjunction points where anmore » arbitrary number of blocks meet. In CPIC, these challenges have been met by an approach that features: (1) a curvilinear formulation of the PIC method: each mesh block is mapped from the physical space, where the mesh is curvilinear and arbitrarily distorted, to the logical space, where the mesh is uniform and Cartesian on the unit cube; (2) a mimetic discretization of Poisson's equation suitable for multi-block meshes; and (3) a hybrid (logical-space position/physical-space velocity), asynchronous particle mover that mitigates the performance degradation created by the necessity to track particles as they move across blocks. The numerical accuracy of CPIC was verified using two standard plasma–material interaction tests, which demonstrate good agreement with the corresponding analytic solutions. And compared to PIC codes on unstructured meshes, which have also been used for their flexibility in handling complex geometries but whose performance suffers from issues associated with data locality and indirect data access patterns, PIC codes on multi-block structured meshes may offer the best compromise for capturing complex geometries while also maintaining solution accuracy and computational efficiency.« less

CPU-GPU mixed implementation of virtual node method for real-time interactive cutting of deformable objects using OpenCL.

PubMed

Jia, Shiyu; Zhang, Weizhong; Yu, Xiaokang; Pan, Zhenkuan

2015-09-01

Surgical simulators need to simulate interactive cutting of deformable objects in real time. The goal of this work was to design an interactive cutting algorithm that eliminates traditional cutting state classification and can work simultaneously with real-time GPU-accelerated deformation without affecting its numerical stability. A modified virtual node method for cutting is proposed. Deformable object is modeled as a real tetrahedral mesh embedded in a virtual tetrahedral mesh, and the former is used for graphics rendering and collision, while the latter is used for deformation. Cutting algorithm first subdivides real tetrahedrons to eliminate all face and edge intersections, then splits faces, edges and vertices along cutting tool trajectory to form cut surfaces. Next virtual tetrahedrons containing more than one connected real tetrahedral fragments are duplicated, and connectivity between virtual tetrahedrons is updated. Finally, embedding relationship between real and virtual tetrahedral meshes is updated. Co-rotational linear finite element method is used for deformation. Cutting and collision are processed by CPU, while deformation is carried out by GPU using OpenCL. Efficiency of GPU-accelerated deformation algorithm was tested using block models with varying numbers of tetrahedrons. Effectiveness of our cutting algorithm under multiple cuts and self-intersecting cuts was tested using a block model and a cylinder model. Cutting of a more complex liver model was performed, and detailed performance characteristics of cutting, deformation and collision were measured and analyzed. Our cutting algorithm can produce continuous cut surfaces when traditional minimal element creation algorithm fails. Our GPU-accelerated deformation algorithm remains stable with constant time step under multiple arbitrary cuts and works on both NVIDIA and AMD GPUs. GPU-CPU speed ratio can be as high as 10 for models with 80,000 tetrahedrons. Forty to sixty percent real-time performance and 100-200 Hz simulation rate are achieved for the liver model with 3,101 tetrahedrons. Major bottlenecks for simulation efficiency are cutting, collision processing and CPU-GPU data transfer. Future work needs to improve on these areas.

Matrix multiplication on the Intel Touchstone Delta

DOE Office of Scientific and Technical Information (OSTI.GOV)

Huss-Lederman, S.; Jacobson, E.M.; Tsao, A.

1993-12-31

Matrix multiplication is a key primitive in block matrix algorithms such as those found in LAPACK. We present results from our study of matrix multiplication algorithms on the Intel Touchstone Delta, a distributed memory message-passing architecture with a two-dimensional mesh topology. We obtain an implementation that uses communication primitives highly suited to the Delta and exploits the single node assembly-coded matrix multiplication. Our algorithm is completely general, able to deal with arbitrary mesh aspect ratios and matrix dimensions, and has achieved parallel efficiency of 86% with overall peak performance in excess of 8 Gflops on 256 nodes for an 8800more » {times} 8800 matrix. We describe our algorithm design and implementation, and present performance results that demonstrate scalability and robust behavior over varying mesh topologies.« less

Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics

NASA Technical Reports Server (NTRS)

Farhat, Charbel; Lesoinne, Michel

1993-01-01

Most of the recently proposed computational methods for solving partial differential equations on multiprocessor architectures stem from the 'divide and conquer' paradigm and involve some form of domain decomposition. For those methods which also require grids of points or patches of elements, it is often necessary to explicitly partition the underlying mesh, especially when working with local memory parallel processors. In this paper, a family of cost-effective algorithms for the automatic partitioning of arbitrary two- and three-dimensional finite element and finite difference meshes is presented and discussed in view of a domain decomposed solution procedure and parallel processing. The influence of the algorithmic aspects of a solution method (implicit/explicit computations), and the architectural specifics of a multiprocessor (SIMD/MIMD, startup/transmission time), on the design of a mesh partitioning algorithm are discussed. The impact of the partitioning strategy on load balancing, operation count, operator conditioning, rate of convergence and processor mapping is also addressed. Finally, the proposed mesh decomposition algorithms are demonstrated with realistic examples of finite element, finite volume, and finite difference meshes associated with the parallel solution of solid and fluid mechanics problems on the iPSC/2 and iPSC/860 multiprocessors.

Design and simulation of origami structures with smooth folds

PubMed Central

Peraza Hernandez, E. A.; Lagoudas, D. C.

2017-01-01

Origami has enabled new approaches to the fabrication and functionality of multiple structures. Current methods for origami design are restricted to the idealization of folds as creases of zeroth-order geometric continuity. Such an idealization is not proper for origami structures of non-negligible fold thickness or maximum curvature at the folds restricted by material limitations. For such structures, folds are not properly represented as creases but rather as bent regions of higher-order geometric continuity. Such fold regions of arbitrary order of continuity are termed as smooth folds. This paper presents a method for solving the following origami design problem: given a goal shape represented as a polygonal mesh (termed as the goal mesh), find the geometry of a single planar sheet, its pattern of smooth folds, and the history of folding motion allowing the sheet to approximate the goal mesh. The parametrization of the planar sheet and the constraints that allow for a valid pattern of smooth folds are presented. The method is tested against various goal meshes having diverse geometries. The results show that every determined sheet approximates its corresponding goal mesh in a known folded configuration having fold angles obtained from the geometry of the goal mesh. PMID:28484322

Design and simulation of origami structures with smooth folds.

PubMed

Peraza Hernandez, E A; Hartl, D J; Lagoudas, D C

2017-04-01

Origami has enabled new approaches to the fabrication and functionality of multiple structures. Current methods for origami design are restricted to the idealization of folds as creases of zeroth-order geometric continuity. Such an idealization is not proper for origami structures of non-negligible fold thickness or maximum curvature at the folds restricted by material limitations. For such structures, folds are not properly represented as creases but rather as bent regions of higher-order geometric continuity. Such fold regions of arbitrary order of continuity are termed as smooth folds . This paper presents a method for solving the following origami design problem: given a goal shape represented as a polygonal mesh (termed as the goal mesh ), find the geometry of a single planar sheet, its pattern of smooth folds, and the history of folding motion allowing the sheet to approximate the goal mesh. The parametrization of the planar sheet and the constraints that allow for a valid pattern of smooth folds are presented. The method is tested against various goal meshes having diverse geometries. The results show that every determined sheet approximates its corresponding goal mesh in a known folded configuration having fold angles obtained from the geometry of the goal mesh.

Dynamic mesh adaptation for front evolution using discontinuous Galerkin based weighted condition number relaxation

DOE PAGES

Greene, Patrick T.; Schofield, Samuel P.; Nourgaliev, Robert

2017-01-27

A new mesh smoothing method designed to cluster cells near a dynamically evolving interface is presented. The method is based on weighted condition number mesh relaxation with the weight function 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 fields, such as a volume fractionmore » or index function, is provided. Results show that the low-order level set works equally well as the actual level set for mesh smoothing. Meshes generated for a number of interface geometries are presented, including cases with multiple level sets. Lastly, dynamic cases with moving interfaces show the new method is capable of maintaining a desired resolution near the interface with an acceptable number of relaxation iterations per time step, which demonstrates the method's potential to be used as a mesh relaxer for arbitrary Lagrangian Eulerian (ALE) methods.« less

Automated quadrilateral surface discretization method and apparatus usable to generate mesh in a finite element analysis system

DOEpatents

Blacker, Teddy D.

1994-01-01

An automatic quadrilateral surface discretization method and apparatus is provided for automatically discretizing a geometric region without decomposing the region. The automated quadrilateral surface discretization method and apparatus automatically generates a mesh of all quadrilateral elements which is particularly useful in finite element analysis. The generated mesh of all quadrilateral elements is boundary sensitive, orientation insensitive and has few irregular nodes on the boundary. A permanent boundary of the geometric region is input and rows are iteratively layered toward the interior of the geometric region. Also, an exterior permanent boundary and an interior permanent boundary for a geometric region may be input and the rows are iteratively layered inward from the exterior boundary in a first counter clockwise direction while the rows are iteratively layered from the interior permanent boundary toward the exterior of the region in a second clockwise direction. As a result, a high quality mesh for an arbitrary geometry may be generated with a technique that is robust and fast for complex geometric regions and extreme mesh gradations.

Combination nickel foam expanded nickel screen electrical connection supports for solid oxide fuel cells

DOEpatents

Draper, Robert; Prevish, Thomas; Bronson, Angela; George, Raymond A.

2007-01-02

A solid oxide fuel assembly is made, wherein rows (14, 25) of fuel cells (17, 19, 21, 27, 29, 31), each having an outer interconnection (20) and an outer electrode (32), are disposed next to each other with corrugated, electrically conducting expanded metal mesh member (22) between each row of cells, the corrugated mesh (22) having top crown portions and bottom portions, where the top crown portion (40) have a top bonded open cell nickel foam (51) which contacts outer interconnections (20) of the fuel cells, said mesh and nickel foam electrically connecting each row of fuel cells, and where there are no more metal felt connections between any fuel cells.

Hexahedral mesh generation via the dual arrangement of surfaces

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mitchell, S.A.; Tautges, T.J.

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 compatiblemore » 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.« less

Arbitrary-Lagrangian-Eulerian Discontinuous Galerkin schemes with a posteriori subcell finite volume limiting on moving unstructured meshes

NASA Astrophysics Data System (ADS)

Boscheri, Walter; Dumbser, Michael

2017-10-01

We present a new family of high order accurate fully discrete one-step Discontinuous Galerkin (DG) finite element schemes on moving unstructured meshes for the solution of nonlinear hyperbolic PDE in multiple space dimensions, which may also include parabolic terms in order to model dissipative transport processes, like molecular viscosity or heat conduction. High order piecewise polynomials of degree N are adopted to represent the discrete solution at each time level and within each spatial control volume of the computational grid, while high order of accuracy in time is achieved by the ADER approach, making use of an element-local space-time Galerkin finite element predictor. A novel nodal solver algorithm based on the HLL flux is derived to compute the velocity for each nodal degree of freedom that describes the current mesh geometry. In our algorithm the spatial mesh configuration can be defined in two different ways: either by an isoparametric approach that generates curved control volumes, or by a piecewise linear decomposition of each spatial control volume into simplex sub-elements. Each technique generates a corresponding number of geometrical degrees of freedom needed to describe the current mesh configuration and which must be considered by the nodal solver for determining the grid velocity. The connection of the old mesh configuration at time tn with the new one at time t n + 1 provides the space-time control volumes on which the governing equations have to be integrated in order to obtain the time evolution of the discrete solution. Our numerical method belongs to the category of so-called direct Arbitrary-Lagrangian-Eulerian (ALE) schemes, where a space-time conservation formulation of the governing PDE system is considered and which already takes into account the new grid geometry (including a possible rezoning step) directly during the computation of the numerical fluxes. We emphasize that our method is a moving mesh method, as opposed to total Lagrangian formulations that are based on a fixed computational grid and which instead evolve the mapping of the reference configuration to the current one. Our new Lagrangian-type DG scheme adopts the novel a posteriori sub-cell finite volume limiter method recently developed in [62] for fixed unstructured grids. In this approach, the validity of the candidate solution produced in each cell by an unlimited ADER-DG scheme is verified against a set of physical and numerical detection criteria, such as the positivity of pressure and density, the absence of floating point errors (NaN) and the satisfaction of a relaxed discrete maximum principle (DMP) in the sense of polynomials. Those cells which do not satisfy all of the above criteria are flagged as troubled cells and are recomputed at the aid of a more robust second order TVD finite volume scheme. To preserve the subcell resolution capability of the original DG scheme, the FV limiter is run on a sub-grid that is 2 N + 1 times finer compared to the mesh of the original unlimited DG scheme. The new subcell averages are then gathered back into a high order DG polynomial by a usual conservative finite volume reconstruction operator. The numerical convergence rates of the new ALE ADER-DG schemes are studied up to fourth order in space and time and several test problems are simulated in order to check the accuracy and the robustness of the proposed numerical method in the context of the Euler and Navier-Stokes equations for compressible gas dynamics, considering both inviscid and viscous fluids. Finally, an application inspired by Inertial Confinement Fusion (ICF) type flows is considered by solving the Euler equations and the PDE of viscous and resistive magnetohydrodynamics (VRMHD).

Analysis of Slope Limiters on Irregular Grids

NASA Technical Reports Server (NTRS)

Berger, Marsha; Aftosmis, Michael J.

2005-01-01

This paper examines the behavior of flux and slope limiters on non-uniform grids in multiple dimensions. Many slope limiters in standard use do not preserve linear solutions on irregular grids impacting both accuracy and convergence. We rewrite some well-known limiters to highlight their underlying symmetry, and use this form to examine the proper - ties of both traditional and novel limiter formulations on non-uniform meshes. A consistent method of handling stretched meshes is developed which is both linearity preserving for arbitrary mesh stretchings and reduces to common limiters on uniform meshes. In multiple dimensions we analyze the monotonicity region of the gradient vector and show that the multidimensional limiting problem may be cast as the solution of a linear programming problem. For some special cases we present a new directional limiting formulation that preserves linear solutions in multiple dimensions on irregular grids. Computational results using model problems and complex three-dimensional examples are presented, demonstrating accuracy, monotonicity and robustness.

Real-time solution of linear computational problems using databases of parametric reduced-order models with arbitrary underlying meshes

NASA Astrophysics Data System (ADS)

Amsallem, David; Tezaur, Radek; Farhat, Charbel

2016-12-01

A comprehensive approach for real-time computations using a database of parametric, linear, projection-based reduced-order models (ROMs) based on arbitrary underlying meshes is proposed. In the offline phase of this approach, the parameter space is sampled and linear ROMs defined by linear reduced operators are pre-computed at the sampled parameter points and stored. Then, these operators and associated ROMs are transformed into counterparts that satisfy a certain notion of consistency. In the online phase of this approach, a linear ROM is constructed in real-time at a queried but unsampled parameter point by interpolating the pre-computed linear reduced operators on matrix manifolds and therefore computing an interpolated linear ROM. The proposed overall model reduction framework is illustrated with two applications: a parametric inverse acoustic scattering problem associated with a mockup submarine, and a parametric flutter prediction problem associated with a wing-tank system. The second application is implemented on a mobile device, illustrating the capability of the proposed computational framework to operate in real-time.

Progress in the Simulation of Steady and Time-Dependent Flows with 3D Parallel Unstructured Cartesian Methods

NASA Technical Reports Server (NTRS)

Aftosmis, M. J.; Berger, M. J.; Murman, S. M.; Kwak, Dochan (Technical Monitor)

2002-01-01

The proposed paper will present recent extensions in the development of an efficient Euler solver for adaptively-refined Cartesian meshes with embedded boundaries. The paper will focus on extensions of the basic method to include solution adaptation, time-dependent flow simulation, and arbitrary rigid domain motion. The parallel multilevel method makes use of on-the-fly parallel domain decomposition to achieve extremely good scalability on large numbers of processors, and is coupled with an automatic coarse mesh generation algorithm for efficient processing by a multigrid smoother. Numerical results are presented demonstrating parallel speed-ups of up to 435 on 512 processors. Solution-based adaptation may be keyed off truncation error estimates using tau-extrapolation or a variety of feature detection based refinement parameters. The multigrid method is extended to for time-dependent flows through the use of a dual-time approach. The extension to rigid domain motion uses an Arbitrary Lagrangian-Eulerlarian (ALE) formulation, and results will be presented for a variety of two- and three-dimensional example problems with both simple and complex geometry.

Boundary-fitted curvilinear coordinate systems for solution of partial differential equations on fields containing any number of arbitrary two-dimensional bodies

NASA Technical Reports Server (NTRS)

Thompson, J. F.; Thames, F. C.; Mastin, C. W.

1977-01-01

A method is presented for automatic numerical generation of a general curvilinear coordinate system with coordinate lines coincident with all boundaries of a general multi-connected two-dimensional region containing any number of arbitrarily shaped bodies. No restrictions are placed on the shape of the boundaries, which may even be time-dependent, and the approach is not restricted in principle to two dimensions. With this procedure the numerical solution of a partial differential system may be done on a fixed rectangular field with a square mesh with no interpolation required regardless of the shape of the physical boundaries, regardless of the spacing of the curvilinear coordinate lines in the physical field, and regardless of the movement of the coordinate system in the physical plane. A number of examples of coordinate systems and application thereof to the solution of partial differential equations are given. The FORTRAN computer program and instructions for use are included.

Experimental demonstration of the optical multi-mesh hypercube: scaleable interconnection network for multiprocessors and multicomputers.

PubMed

Louri, A; Furlonge, S; Neocleous, C

1996-12-10

A prototype of a novel topology for scaleable optical interconnection networks called the optical multi-mesh hypercube (OMMH) is experimentally demonstrated to as high as a 150-Mbit/s data rate (2(7) - 1 nonreturn-to-zero pseudo-random data pattern) at a bit error rate of 10(-13)/link by the use of commercially available devices. OMMH is a scaleable network [Appl. Opt. 33, 7558 (1994); J. Lightwave Technol. 12, 704 (1994)] architecture that combines the positive features of the hypercube (small diameter, connectivity, symmetry, simple routing, and fault tolerance) and the mesh (constant node degree and size scaleability). The optical implementation method is divided into two levels: high-density local connections for the hypercube modules, and high-bit-rate, low-density, long connections for the mesh links connecting the hypercube modules. Free-space imaging systems utilizing vertical-cavity surface-emitting laser (VCSEL) arrays, lenslet arrays, space-invariant holographic techniques, and photodiode arrays are demonstrated for the local connections. Optobus fiber interconnects from Motorola are used for the long-distance connections. The OMMH was optimized to operate at the data rate of Motorola's Optobus (10-bit-wide, VCSEL-based bidirectional data interconnects at 150 Mbits/s). Difficulties encountered included the varying fan-out efficiencies of the different orders of the hologram, misalignment sensitivity of the free-space links, low power (1 mW) of the individual VCSEL's, and noise.

Gradient Calculation Methods on Arbitrary Polyhedral Unstructured Meshes for Cell-Centered CFD Solvers

NASA Technical Reports Server (NTRS)

Sozer, Emre; Brehm, Christoph; Kiris, Cetin C.

2014-01-01

A survey of gradient reconstruction methods for cell-centered data on unstructured meshes is conducted within the scope of accuracy assessment. Formal order of accuracy, as well as error magnitudes for each of the studied methods, are evaluated on a complex mesh of various cell types through consecutive local scaling of an analytical test function. The tests highlighted several gradient operator choices that can consistently achieve 1st order accuracy regardless of cell type and shape. The tests further offered error comparisons for given cell types, leading to the observation that the "ideal" gradient operator choice is not universal. Practical implications of the results are explored via CFD solutions of a 2D inviscid standing vortex, portraying the discretization error properties. A relatively naive, yet largely unexplored, approach of local curvilinear stencil transformation exhibited surprisingly favorable properties

Two-dimensional mesh embedding for Galerkin B-spline methods

NASA Technical Reports Server (NTRS)

Shariff, Karim; Moser, Robert D.

1995-01-01

A number of advantages result from using B-splines as basis functions in a Galerkin method for solving partial differential equations. Among them are arbitrary order of accuracy and high resolution similar to that of compact schemes but without the aliasing error. This work develops another property, namely, the ability to treat semi-structured embedded or zonal meshes for two-dimensional geometries. This can drastically reduce the number of grid points in many applications. Both integer and non-integer refinement ratios are allowed. The report begins by developing an algorithm for choosing basis functions that yield the desired mesh resolution. These functions are suitable products of one-dimensional B-splines. Finally, test cases for linear scalar equations such as the Poisson and advection equation are presented. The scheme is conservative and has uniformly high order of accuracy throughout the domain.

An analysis of options available for developing a common laser ray tracing package for Ares and Kull code frameworks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Weeratunga, S K

Ares and Kull are mature code frameworks that support ALE hydrodynamics for a variety of HEDP applications at LLNL, using two widely different meshing approaches. While Ares is based on a 2-D/3-D block-structured mesh data base, Kull is designed to support unstructured, arbitrary polygonal/polyhedral meshes. In addition, both frameworks are capable of running applications on large, distributed-memory parallel machines. Currently, both these frameworks separately support assorted collections of physics packages related to HEDP, including one for the energy deposition by laser/ion-beam ray tracing. This study analyzes the options available for developing a common laser/ion-beam ray tracing package that can bemore » easily shared between these two code frameworks and concludes with a set of recommendations for its development.« less

AN EXTENSION OF THE ATHENA++ CODE FRAMEWORK FOR GRMHD BASED ON ADVANCED RIEMANN SOLVERS AND STAGGERED-MESH CONSTRAINED TRANSPORT

DOE Office of Scientific and Technical Information (OSTI.GOV)

White, Christopher J.; Stone, James M.; Gammie, Charles F.

2016-08-01

We present a new general relativistic magnetohydrodynamics (GRMHD) code integrated into the Athena++ framework. Improving upon the techniques used in most GRMHD codes, ours allows the use of advanced, less diffusive Riemann solvers, in particular HLLC and HLLD. We also employ a staggered-mesh constrained transport algorithm suited for curvilinear coordinate systems in order to maintain the divergence-free constraint of the magnetic field. Our code is designed to work with arbitrary stationary spacetimes in one, two, or three dimensions, and we demonstrate its reliability through a number of tests. We also report on its promising performance and scalability.

An alternative to unstructured grids for computing gas dynamic flows around arbitrarily complex two-dimensional bodies

NASA Technical Reports Server (NTRS)

Quirk, James J.

1992-01-01

In this paper we describe an approach for dealing with arbitrary complex, two dimensional geometries, the so-called cartesian boundary method. Conceptually, the cartesian boundary method is quite simple. Solid bodies blank out areas of a background, cartesian mesh, and the resultant cut cells are singled out for special attention. However, there are several obstacles that must be overcome in order to achieve a practical scheme. We present a general strategy that overcomes these obstacles, together with some details of our successful conversion of an adaptive mesh algorithm from a body-fitted code to a cartesian boundary code.

Arbitrary Order Mixed Mimetic Finite Differences Method with Nodal Degrees of Freedom

DOE Office of Scientific and Technical Information (OSTI.GOV)

Iaroshenko, Oleksandr; Gyrya, Vitaliy; Manzini, Gianmarco

2016-09-01

In this work we consider a modification to an arbitrary order mixed mimetic finite difference method (MFD) for a diffusion equation on general polygonal meshes [1]. The modification is based on moving some degrees of freedom (DoF) for a flux variable from edges to vertices. We showed that for a non-degenerate element this transformation is locally equivalent, i.e. there is a one-to-one map between the new and the old DoF. Globally, on the other hand, this transformation leads to a reduction of the total number of degrees of freedom (by up to 40%) and additional continuity of the discrete flux.

Expanded nickel screen electrical connection supports for solid oxide fuel cells

DOEpatents

Draper, Robert; Antol, Ronald F.; Zafred, Paolo R.

2002-01-01

A solid oxide fuel assembly is made, wherein rows (14, 24) of fuel cells (16, 18, 20, 26, 28, 30), each having an outer interconnection (36) and an outer electrode (32), are disposed next to each other with corrugated, electrically conducting expanded metal mesh (22) between each row of cells, the corrugated mesh (22) having top crown portions (40) and bottom shoulder portions (42), where the top crown portion (40) contacts outer interconnections (36) of the fuel cells (16, 18, 20) in a first row (14), and the bottom shoulder portions (42) contacts outer electrodes (32) of the fuel cells in a second row (24), said mesh electrically connecting each row of fuel cells, and where there are no metal felt connections between any fuel cells.

Discontinuous Skeletal Gradient Discretisation methods on polytopal meshes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Di Pietro, Daniele A.; Droniou, Jérôme; Manzini, Gianmarco

Here, in this work we develop arbitrary-order Discontinuous Skeletal Gradient Discretisations (DSGD) on general polytopal meshes. Discontinuous Skeletal refers to the fact that the globally coupled unknowns are broken polynomials on the mesh skeleton. The key ingredient is a high-order gradient reconstruction composed of two terms: (i) a consistent contribution obtained mimicking an integration by parts formula inside each element and (ii) a stabilising term for which sufficient design conditions are provided. An example of stabilisation that satisfies the design conditions is proposed based on a local lifting of high-order residuals on a Raviart–Thomas–Nédélec subspace. We prove that the novelmore » DSGDs satisfy coercivity, consistency, limit-conformity, and compactness requirements that ensure convergence for a variety of elliptic and parabolic problems. Lastly, links with Hybrid High-Order, non-conforming Mimetic Finite Difference and non-conforming Virtual Element methods are also studied. Numerical examples complete the exposition.« less

Discontinuous Skeletal Gradient Discretisation methods on polytopal meshes

DOE PAGES

Di Pietro, Daniele A.; Droniou, Jérôme; Manzini, Gianmarco

2017-11-21

Here, in this work we develop arbitrary-order Discontinuous Skeletal Gradient Discretisations (DSGD) on general polytopal meshes. Discontinuous Skeletal refers to the fact that the globally coupled unknowns are broken polynomials on the mesh skeleton. The key ingredient is a high-order gradient reconstruction composed of two terms: (i) a consistent contribution obtained mimicking an integration by parts formula inside each element and (ii) a stabilising term for which sufficient design conditions are provided. An example of stabilisation that satisfies the design conditions is proposed based on a local lifting of high-order residuals on a Raviart–Thomas–Nédélec subspace. We prove that the novelmore » DSGDs satisfy coercivity, consistency, limit-conformity, and compactness requirements that ensure convergence for a variety of elliptic and parabolic problems. Lastly, links with Hybrid High-Order, non-conforming Mimetic Finite Difference and non-conforming Virtual Element methods are also studied. Numerical examples complete the exposition.« less

High-performance parallel analysis of coupled problems for aircraft propulsion

NASA Technical Reports Server (NTRS)

Felippa, C. A.; Farhat, C.; Lanteri, S.; Maman, N.; Piperno, S.; Gumaste, U.

1994-01-01

This research program deals with the application of high-performance computing methods for the analysis of complete jet engines. We have entitled this program by applying the two dimensional parallel aeroelastic codes to the interior gas flow problem of a bypass jet engine. The fluid mesh generation, domain decomposition, and solution capabilities were successfully tested. We then focused attention on methodology for the partitioned analysis of the interaction of the gas flow with a flexible structure and with the fluid mesh motion that results from these structural displacements. This is treated by a new arbitrary Lagrangian-Eulerian (ALE) technique that models the fluid mesh motion as that of a fictitious mass-spring network. New partitioned analysis procedures to treat this coupled three-component problem are developed. These procedures involved delayed corrections and subcycling. Preliminary results on the stability, accuracy, and MPP computational efficiency are reported.

Grouper: a compact, streamable triangle mesh data structure.

PubMed

Luffel, Mark; Gurung, Topraj; Lindstrom, Peter; Rossignac, Jarek

2014-01-01

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 present a linear-time construction algorithm that allows streaming out Grouper meshes using a small memory footprint while preserving the initial ordering of vertices. As a part of 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.

Automatic Mesh Generation of Hybrid Mesh on Valves in Multiple Positions in Feedline Systems

NASA Technical Reports Server (NTRS)

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.

A robust and contact resolving Riemann solver on unstructured mesh, Part I, Euler method

NASA Astrophysics Data System (ADS)

Shen, Zhijun; Yan, Wei; Yuan, Guangwei

2014-07-01

This article presents a new cell-centered numerical method for compressible flows on arbitrary unstructured meshes. A multi-dimensional Riemann solver based on the HLLC method (denoted by HLLC-2D solver) is established. The work is an extension from the cell-centered Lagrangian scheme of Maire et al. [27] to the Eulerian framework. Similarly to the work in [27], a two-dimensional contact velocity defined on a grid node is introduced, and the motivation is to keep an edge flux consistency with the node velocity connected to the edge intrinsically. The main new feature of the algorithm is to relax the condition that the contact pressures must be same in the traditional HLLC solver. The discontinuous fluxes are constructed across each wave sampling direction rather than only along the contact wave direction. The two-dimensional contact velocity of the grid node is determined via enforcing conservation of mass, momentum and total energy, and thus the new method satisfies these conservation properties at nodes rather than on grid edges. Other good properties of the HLLC-2d solver, such as the positivity and the contact preserving, are described, and the two-dimensional high-order extension is constructed employing MUSCL type reconstruction procedure. Numerical results based on both quadrilateral and triangular grids are presented to demonstrate the robustness and the accuracy of this new solver, which shows it has better performance than the existing HLLC method.

Compatible, energy conserving, bounds preserving remap of hydrodynamic fields for an extended ALE scheme

DOE PAGES

Burton, Donald E.; Morgan, Nathaniel Ray; Charest, Marc Robert Joseph; ...

2017-11-22

From the very origins of numerical hydrodynamics in the Lagrangian work of von Neumann and Richtmyer [83], the issue of total energy conservation as well as entropy production has been problematic. Because of well known problems with mesh deformation, Lagrangian schemes have evolved into Arbitrary Lagrangian–Eulerian (ALE) methods [39] that combine the best properties of Lagrangian and Eulerian methods. Energy issues have persisted for this class of methods. We believe that fundamental issues of energy conservation and entropy production in ALE require further examination. The context of the paper is an ALE scheme that is extended in the sense thatmore » it permits cyclic or periodic remap of data between grids of the same or differing connectivity. The principal design goals for a remap method then consist of total energy conservation, bounded internal energy, and compatibility of kinetic energy and momentum. We also have secondary objectives of limiting velocity and stress in a non-directional manner, keeping primitive variables monotone, and providing a higher than second order reconstruction of remapped variables. Particularly, the new contributions fall into three categories associated with: energy conservation and entropy production, reconstruction and bounds preservation of scalar and tensor fields, and conservative remap of nonlinear fields. Our paper presents a derivation of the methods, details of implementation, and numerical results for a number of test problems. The methods requires volume integration of polynomial functions in polytopal cells with planar facets, and the requisite expressions are derived for arbitrary order.« less

Compatible, energy conserving, bounds preserving remap of hydrodynamic fields for an extended ALE scheme

NASA Astrophysics Data System (ADS)

Burton, D. E.; Morgan, N. R.; Charest, M. R. J.; Kenamond, M. A.; Fung, J.

2018-02-01

From the very origins of numerical hydrodynamics in the Lagrangian work of von Neumann and Richtmyer [83], the issue of total energy conservation as well as entropy production has been problematic. Because of well known problems with mesh deformation, Lagrangian schemes have evolved into Arbitrary Lagrangian-Eulerian (ALE) methods [39] that combine the best properties of Lagrangian and Eulerian methods. Energy issues have persisted for this class of methods. We believe that fundamental issues of energy conservation and entropy production in ALE require further examination. The context of the paper is an ALE scheme that is extended in the sense that it permits cyclic or periodic remap of data between grids of the same or differing connectivity. The principal design goals for a remap method then consist of total energy conservation, bounded internal energy, and compatibility of kinetic energy and momentum. We also have secondary objectives of limiting velocity and stress in a non-directional manner, keeping primitive variables monotone, and providing a higher than second order reconstruction of remapped variables. In particular, the new contributions fall into three categories associated with: energy conservation and entropy production, reconstruction and bounds preservation of scalar and tensor fields, and conservative remap of nonlinear fields. The paper presents a derivation of the methods, details of implementation, and numerical results for a number of test problems. The methods requires volume integration of polynomial functions in polytopal cells with planar facets, and the requisite expressions are derived for arbitrary order.

Compatible, energy conserving, bounds preserving remap of hydrodynamic fields for an extended ALE scheme

DOE Office of Scientific and Technical Information (OSTI.GOV)

Burton, Donald E.; Morgan, Nathaniel Ray; Charest, Marc Robert Joseph

From the very origins of numerical hydrodynamics in the Lagrangian work of von Neumann and Richtmyer [83], the issue of total energy conservation as well as entropy production has been problematic. Because of well known problems with mesh deformation, Lagrangian schemes have evolved into Arbitrary Lagrangian–Eulerian (ALE) methods [39] that combine the best properties of Lagrangian and Eulerian methods. Energy issues have persisted for this class of methods. We believe that fundamental issues of energy conservation and entropy production in ALE require further examination. The context of the paper is an ALE scheme that is extended in the sense thatmore » it permits cyclic or periodic remap of data between grids of the same or differing connectivity. The principal design goals for a remap method then consist of total energy conservation, bounded internal energy, and compatibility of kinetic energy and momentum. We also have secondary objectives of limiting velocity and stress in a non-directional manner, keeping primitive variables monotone, and providing a higher than second order reconstruction of remapped variables. Particularly, the new contributions fall into three categories associated with: energy conservation and entropy production, reconstruction and bounds preservation of scalar and tensor fields, and conservative remap of nonlinear fields. Our paper presents a derivation of the methods, details of implementation, and numerical results for a number of test problems. The methods requires volume integration of polynomial functions in polytopal cells with planar facets, and the requisite expressions are derived for arbitrary order.« less

Grouper: A Compact, Streamable Triangle Mesh Data Structure.

PubMed

Luffel, Mark; Gurung, Topraj; Lindstrom, Peter; Rossignac, Jarek

2013-05-08

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 present a linear-time construction algorithm that allows streaming out Grouper meshes using a small memory footprint while preserving the initial ordering of vertices. As part of 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, 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.

A Finite Element Method for Simulation of Compressible Cavitating Flows

NASA Astrophysics Data System (ADS)

Shams, Ehsan; Yang, Fan; Zhang, Yu; Sahni, Onkar; Shephard, Mark; Oberai, Assad

2016-11-01

This work focuses on a novel approach for finite element simulations of multi-phase flows which involve evolving interface with phase change. Modeling problems, such as cavitation, requires addressing multiple challenges, including compressibility of the vapor phase, interface physics caused by mass, momentum and energy fluxes. We have developed a mathematically consistent and robust computational approach to address these problems. We use stabilized finite element methods on unstructured meshes to solve for the compressible Navier-Stokes equations. Arbitrary Lagrangian-Eulerian formulation is used to handle the interface motions. Our method uses a mesh adaptation strategy to preserve the quality of the volumetric mesh, while the interface mesh moves along with the interface. The interface jump conditions are accurately represented using a discontinuous Galerkin method on the conservation laws. Condensation and evaporation rates at the interface are thermodynamically modeled to determine the interface velocity. We will present initial results on bubble cavitation the behavior of an attached cavitation zone in a separated boundary layer. We acknowledge the support from Army Research Office (ARO) under ARO Grant W911NF-14-1-0301.

Anisotropic diffusion in mesh-free numerical magnetohydrodynamics

NASA Astrophysics Data System (ADS)

Hopkins, Philip F.

2017-04-01

We extend recently developed mesh-free Lagrangian methods for numerical magnetohydrodynamics (MHD) to arbitrary anisotropic diffusion equations, including: passive scalar diffusion, Spitzer-Braginskii conduction and viscosity, cosmic ray diffusion/streaming, anisotropic radiation transport, non-ideal MHD (Ohmic resistivity, ambipolar diffusion, the Hall effect) and turbulent 'eddy diffusion'. We study these as implemented in the code GIZMO for both new meshless finite-volume Godunov schemes (MFM/MFV). We show that the MFM/MFV methods are accurate and stable even with noisy fields and irregular particle arrangements, and recover the correct behaviour even in arbitrarily anisotropic cases. They are competitive with state-of-the-art AMR/moving-mesh methods, and can correctly treat anisotropic diffusion-driven instabilities (e.g. the MTI and HBI, Hall MRI). We also develop a new scheme for stabilizing anisotropic tensor-valued fluxes with high-order gradient estimators and non-linear flux limiters, which is trivially generalized to AMR/moving-mesh codes. We also present applications of some of these improvements for SPH, in the form of a new integral-Godunov SPH formulation that adopts a moving-least squares gradient estimator and introduces a flux-limited Riemann problem between particles.

Method of generating a surface mesh

DOEpatents

Shepherd, Jason F [Albuquerque, NM; Benzley, Steven [Provo, UT; Grover, Benjamin T [Tracy, CA

2008-03-04

A method and machine-readable medium provide a technique to generate and modify a quadrilateral finite element surface mesh using dual creation and modification. After generating a dual of a surface (mesh), a predetermined algorithm may be followed to generate and modify a surface mesh of quadrilateral elements. The predetermined algorithm may include the steps of generating two-dimensional cell regions in dual space, determining existing nodes in primal space, generating new nodes in the dual space, and connecting nodes to form the quadrilateral elements (faces) for the generated and modifiable surface mesh.

Radial cold trap

DOEpatents

Grundy, Brian R.

1981-01-01

The radial cold trap comprises a housing having a plurality of mesh bands disposed therein. The mesh bands comprise concentrically arranged bands of mesh with the mesh specific surface area of each band increasing from the outermost mesh band to the innermost mesh band. An inlet nozzle is attached to the outside section of the housing while an outlet nozzle is attached to the inner portion of the housing so as to be concentrically connected to the innermost mesh band. An inlet baffle having orifices therein may be disposed around the outermost mesh band and within the housing for directing the flow of the fluid from the inlet nozzle to the outermost mesh band in a uniform manner. The flow of fluid passes through each consecutive mesh band and into the outlet nozzle. The circular pattern of the symmetrically arranged mesh packing allows for better utilization of the entire cold trap volume.

Radial cold trap

DOEpatents

Grundy, B.R.

1981-09-29

The radial cold trap comprises a housing having a plurality of mesh bands disposed therein. The mesh bands comprise concentrically arranged bands of mesh with the mesh specific surface area of each band increasing from the outermost mesh band to the innermost mesh band. An inlet nozzle is attached to the outside section of the housing while an outlet nozzle is attached to the inner portion of the housing so as to be concentrically connected to the innermost mesh band. An inlet baffle having orifices therein may be disposed around the outermost mesh band and within the housing for directing the flow of the fluid from the inlet nozzle to the outermost mesh band in a uniform manner. The flow of fluid passes through each consecutive mesh band and into the outlet nozzle. The circular pattern of the symmetrically arranged mesh packing allows for better utilization of the entire cold trap volume. 2 figs.

Interference Analysis for Highly Directional 60 GHz Mesh Networks: The Case for Rethinking Medium Access Control

DTIC Science & Technology

2010-11-24

Helmken, “Performance analysis of coherent DS - CDMA systems in a Nakagami fading channel with arbitrary parameters,” Vehicular Technology, IEEE...Transactions on, vol. 46, no. 2, pp. 289–297, may 1997. [26] M. Sunay and P. McLane, “Calculating error probabilities for DS - CDMA systems: when not to use

Translation and integration of numerical atomic orbitals in linear molecules

DOE Office of Scientific and Technical Information (OSTI.GOV)

Heinäsmäki, Sami, E-mail: sami.heinasmaki@gmail.com

2014-02-14

We present algorithms for translation and integration of atomic orbitals for LCAO calculations in linear molecules. The method applies to arbitrary radial functions given on a numerical mesh. The algorithms are based on pseudospectral differentiation matrices in two dimensions and the corresponding two-dimensional Gaussian quadratures. As a result, multicenter overlap and Coulomb integrals can be evaluated effectively.

A direct Arbitrary-Lagrangian-Eulerian ADER-WENO finite volume scheme on unstructured tetrahedral meshes for conservative and non-conservative hyperbolic systems in 3D

NASA Astrophysics Data System (ADS)

Boscheri, Walter; Dumbser, Michael

2014-10-01

In this paper we present a new family of high order accurate Arbitrary-Lagrangian-Eulerian (ALE) one-step ADER-WENO finite volume schemes for the solution of nonlinear systems of conservative and non-conservative hyperbolic partial differential equations with stiff source terms on moving tetrahedral meshes in three space dimensions. A WENO reconstruction technique is used to achieve high order of accuracy in space, while an element-local space-time Discontinuous Galerkin finite element predictor on moving curved meshes is used to obtain a high order accurate one-step time discretization. Within the space-time predictor the physical element is mapped onto a reference element using a high order isoparametric approach, where the space-time basis and test functions are given by the Lagrange interpolation polynomials passing through a predefined set of space-time nodes. Since our algorithm is cell-centered, the final mesh motion is computed by using a suitable node solver algorithm. A rezoning step as well as a flattener strategy are used in some of the test problems to avoid mesh tangling or excessive element deformations that may occur when the computation involves strong shocks or shear waves. The ALE algorithm presented in this article belongs to the so-called direct ALE methods because the final Lagrangian finite volume scheme is based directly on a space-time conservation formulation of the governing PDE system, with the rezoned geometry taken already into account during the computation of the fluxes. We apply our new high order unstructured ALE schemes to the 3D Euler equations of compressible gas dynamics, for which a set of classical numerical test problems has been solved and for which convergence rates up to sixth order of accuracy in space and time have been obtained. We furthermore consider the equations of classical ideal magnetohydrodynamics (MHD) as well as the non-conservative seven-equation Baer-Nunziato model of compressible multi-phase flows with stiff relaxation source terms.

A 3D finite element ALE method using an approximate Riemann solution

DOE PAGES

Chiravalle, V. P.; Morgan, N. R.

2016-08-09

Arbitrary Lagrangian–Eulerian finite volume methods that solve a multidimensional Riemann-like problem at the cell center in a staggered grid hydrodynamic (SGH) arrangement have been proposed. This research proposes a new 3D finite element arbitrary Lagrangian–Eulerian SGH method that incorporates a multidimensional Riemann-like problem. Here, two different Riemann jump relations are investigated. A new limiting method that greatly improves the accuracy of the SGH method on isentropic flows is investigated. A remap method that improves upon a well-known mesh relaxation and remapping technique in order to ensure total energy conservation during the remap is also presented. Numerical details and test problemmore » results are presented.« less

A 3D finite element ALE method using an approximate Riemann solution

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chiravalle, V. P.; Morgan, N. R.

Arbitrary Lagrangian–Eulerian finite volume methods that solve a multidimensional Riemann-like problem at the cell center in a staggered grid hydrodynamic (SGH) arrangement have been proposed. This research proposes a new 3D finite element arbitrary Lagrangian–Eulerian SGH method that incorporates a multidimensional Riemann-like problem. Here, two different Riemann jump relations are investigated. A new limiting method that greatly improves the accuracy of the SGH method on isentropic flows is investigated. A remap method that improves upon a well-known mesh relaxation and remapping technique in order to ensure total energy conservation during the remap is also presented. Numerical details and test problemmore » results are presented.« less

A multi-dimensional high-order DG-ALE method based on gas-kinetic theory with application to oscillating bodies

NASA Astrophysics Data System (ADS)

Ren, Xiaodong; Xu, Kun; Shyy, Wei

2016-07-01

This paper presents a multi-dimensional high-order discontinuous Galerkin (DG) method in an arbitrary Lagrangian-Eulerian (ALE) formulation to simulate flows over variable domains with moving and deforming meshes. It is an extension of the gas-kinetic DG method proposed by the authors for static domains (X. Ren et al., 2015 [22]). A moving mesh gas kinetic DG method is proposed for both inviscid and viscous flow computations. A flux integration method across a translating and deforming cell interface has been constructed. Differently from the previous ALE-type gas kinetic method with piecewise constant mesh velocity at each cell interface within each time step, the mesh velocity variation inside a cell and the mesh moving and rotating at a cell interface have been accounted for in the finite element framework. As a result, the current scheme is applicable for any kind of mesh movement, such as translation, rotation, and deformation. The accuracy and robustness of the scheme have been improved significantly in the oscillating airfoil calculations. All computations are conducted in a physical domain rather than in a reference domain, and the basis functions move with the grid movement. Therefore, the numerical scheme can preserve the uniform flow automatically, and satisfy the geometric conservation law (GCL). The numerical accuracy can be maintained even for a largely moving and deforming mesh. Several test cases are presented to demonstrate the performance of the gas-kinetic DG-ALE method.

Transport Protocols for Wireless Mesh Networks

NASA Astrophysics Data System (ADS)

Eddie Law, K. L.

Transmission control protocol (TCP) provides reliable connection-oriented services between any two end systems on the Internet. With TCP congestion control algorithm, multiple TCP connections can share network and link resources simultaneously. These TCP congestion control mechanisms have been operating effectively in wired networks. However, performance of TCP connections degrades rapidly in wireless and lossy networks. To sustain the throughput performance of TCP connections in wireless networks, design modifications may be required accordingly in the TCP flow control algorithm, and potentially, in association with other protocols in other layers for proper adaptations. In this chapter, we explain the limitations of the latest TCP congestion control algorithm, and then review some popular designs for TCP connections to operate effectively in wireless mesh network infrastructure.

Extension of the Time-Spectral Approach to Overset Solvers for Arbitrary Motion

NASA Technical Reports Server (NTRS)

Leffell, Joshua Isaac; Murman, Scott M.; Pulliam, Thomas H.

2012-01-01

Forced periodic flows arise in a broad range of aerodynamic applications such as rotorcraft, turbomachinery, and flapping wing configurations. Standard practice involves solving the unsteady flow equations forward in time until the initial transient exits the domain and a statistically stationary flow is achieved. It is often required to simulate through several periods to remove the initial transient making unsteady design optimization prohibitively expensive for most realistic problems. An effort to reduce the computational cost of these calculations led to the development of the Harmonic Balance method [1, 2] which capitalizes on the periodic nature of the solution. The approach exploits the fact that forced temporally periodic flow, while varying in the time domain, is invariant in the frequency domain. Expanding the temporal variation at each spatial node into a Fourier series transforms the unsteady governing equations into a steady set of equations in integer harmonics that can be tackled with the acceleration techniques afforded to steady-state flow solvers. Other similar approaches, such as the Nonlinear Frequency Domain [3,4,5], Reduced Frequency [6] and Time-Spectral [7, 8, 9] methods, were developed shortly thereafter. Additionally, adjoint-based optimization techniques can be applied [10, 11] as well as frequency-adaptive methods [12, 13, 14] to provide even more flexibility to the method. The Fourier temporal basis functions imply spectral convergence as the number of harmonic modes, and correspondingly number of time samples, N, is increased. Some elect to solve the equations in the frequency domain directly, while others choose to transform the equations back into the time domain to simplify the process of adding this capability to existing solvers, but each harnesses the underlying steady solution in the frequency domain. These temporal projection methods will herein be collectively referred to as Time-Spectral methods. Time-Spectral methods have demonstrated marked success in reducing the computational costs associated with simulating periodic forced flows, but have yet to be fully applied to overset or Cartesian solvers for arbitrary motion with dynamic hole-cutting. Overset and Cartesian grid methodologies are versatile techniques capable of handling complex geometry configurations in practical engineering applications, and the combination of the Time-Spectral approach with this general capability potentially provides an enabling new design and analysis tool. In an arbitrary moving-body scenario for these approaches, a Lagrangian body moves through a fixed Eulerian mesh and mesh points in the Eulerian mesh interior to the solid body are removed (cut or blanked), leaving a hole in the Eulerian mesh. During the dynamic motion some gridpoints in the domain are blanked and do not have a complete set of time-samples preventing a direct implementation of the Time-Spectral method. Murman[6] demonstrated the Time-Spectral approach for a Cartesian solver with a rigid domain motion, wherein the hole cutting remains constant. Similarly, Custer et al. [15, 16] used the NASA overset OVERFLOW solver and limited the amount of relative motion to ensure static hole-cutting and interpolation. Recently, Mavriplis and Mundis[17] demonstrated a qualitative method for applying the Time-Spectral approach to an unstructured overset solver for arbitrary motion. The goal of the current work is to develop a robust and general method for handling arbitrary motion with the Time-Spectral approach within an overset or Cartesian mesh method, while still approaching the spectral convergence rate of the original Time-Spectral approach. The viscous OVERFLOW solver will be augmented with the new Time-Spectral algorithm and the capability of the method for benchmark problems in rotorcraft and turbomachinery will be demonstrated. This abstract begins with a brief synopsis of the Time-Spectral approach for overset grids and provides details of e current approach to allow for arbitrary motion. Model problem results in one and two dimensions are included to demonstrate the viability of the method and the convergence properties. Section IV briefly outlines the implementation into the OVERFLOW solver, and the abstract closes with a description of the benchmark test cases which will be included in the final paper.

Combining 3d Volume and Mesh Models for Representing Complicated Heritage Buildings

NASA Astrophysics Data System (ADS)

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.

Density matrix solutions for the susceptibilities of a three-level system with arbitrary relaxation rates and field strengths

NASA Technical Reports Server (NTRS)

Ryan, J. C.; Lawandy, N. M.

1986-01-01

The susceptibilities for a three-level system with arbitrary pump and signal field strengths are derived for arbitrary longitudinal and transverse relaxation rates. The results are of interest in connection with the calculation of the Raman gain in systems where resonance enhancement plays a dominant role.

Integration of Mesh Optimization with 3D All-Hex Mesh Generation, LDRD Subcase 3504340000, Final Report

DOE Office of Scientific and Technical Information (OSTI.GOV)

KNUPP,PATRICK; MITCHELL,SCOTT A.

1999-11-01

In an attempt to automatically produce high-quality all-hex meshes, we investigated a mesh improvement strategy: given an initial poor-quality all-hex mesh, we iteratively changed the element connectivity, adding and deleting elements and nodes, and optimized the node positions. We found a set of hex reconnection primitives. We improved the optimization algorithms so they can untangle a negative-Jacobian mesh, even considering Jacobians on the boundary, and subsequently optimize the condition number of elements in an untangled mesh. However, even after applying both the primitives and optimization we were unable to produce high-quality meshes in certain regions. Our experiences suggest that manymore » boundary configurations of quadrilaterals admit no hexahedral mesh with positive Jacobians, although we have no proof of this.« less

Solving very large, sparse linear systems on mesh-connected parallel computers

NASA Technical Reports Server (NTRS)

Opsahl, Torstein; Reif, John

1987-01-01

The implementation of Pan and Reif's Parallel Nested Dissection (PND) algorithm on mesh connected parallel computers is described. This is the first known algorithm that allows very large, sparse linear systems of equations to be solved efficiently in polylog time using a small number of processors. How the processor bound of PND can be matched to the number of processors available on a given parallel computer by slowing down the algorithm by constant factors is described. Also, for the important class of problems where G(A) is a grid graph, a unique memory mapping that reduces the inter-processor communication requirements of PND to those that can be executed on mesh connected parallel machines is detailed. A description of an implementation on the Goodyear Massively Parallel Processor (MPP), located at Goddard is given. Also, a detailed discussion of data mappings and performance issues is given.

Well-balanced Arbitrary-Lagrangian-Eulerian finite volume schemes on moving nonconforming meshes for the Euler equations of gas dynamics with gravity

NASA Astrophysics Data System (ADS)

Gaburro, Elena; Castro, Manuel J.; Dumbser, Michael

2018-06-01

In this work, we present a novel second-order accurate well-balanced arbitrary Lagrangian-Eulerian (ALE) finite volume scheme on moving nonconforming meshes for the Euler equations of compressible gas dynamics with gravity in cylindrical coordinates. The main feature of the proposed algorithm is the capability of preserving many of the physical properties of the system exactly also on the discrete level: besides being conservative for mass, momentum and total energy, also any known steady equilibrium between pressure gradient, centrifugal force, and gravity force can be exactly maintained up to machine precision. Perturbations around such equilibrium solutions are resolved with high accuracy and with minimal dissipation on moving contact discontinuities even for very long computational times. This is achieved by the novel combination of well-balanced path-conservative finite volume schemes, which are expressly designed to deal with source terms written via non-conservative products, with ALE schemes on moving grids, which exhibit only very little numerical dissipation on moving contact waves. In particular, we have formulated a new HLL-type and a novel Osher-type flux that are both able to guarantee the well balancing in a gas cloud rotating around a central object. Moreover, to maintain a high level of quality of the moving mesh, we have adopted a nonconforming treatment of the sliding interfaces that appear due to the differential rotation. A large set of numerical tests has been carried out in order to check the accuracy of the method close and far away from the equilibrium, both, in one- and two-space dimensions.

Unstructured Finite Elements and Dynamic Meshing for Explicit Phase Tracking in Multiphase Problems

NASA Astrophysics Data System (ADS)

Chandra, Anirban; Yang, Fan; Zhang, Yu; Shams, Ehsan; Sahni, Onkar; Oberai, Assad; Shephard, Mark

2017-11-01

Multi-phase processes involving phase change at interfaces, such as evaporation of a liquid or combustion of a solid, represent an interesting class of problems with varied applications. Large density ratio across phases, discontinuous fields at the interface and rapidly evolving geometries are some of the inherent challenges which influence the numerical modeling of multi-phase phase change problems. In this work, a mathematically consistent and robust computational approach to address these issues is presented. We use stabilized finite element methods on mixed topology unstructured grids for solving the compressible Navier-Stokes equations. Appropriate jump conditions derived from conservations laws across the interface are handled by using discontinuous interpolations, while the continuity of temperature and tangential velocity is enforced using a penalty parameter. The arbitrary Lagrangian-Eulerian (ALE) technique is utilized to explicitly track the interface motion. Mesh at the interface is constrained to move with the interface while elsewhere it is moved using the linear elasticity analogy. Repositioning is applied to the layered mesh that maintains its structure and normal resolution. In addition, mesh modification is used to preserve the quality of the volumetric mesh. This work is supported by the U.S. Army Grants W911NF1410301 and W911NF16C0117.

ALEGRA -- A massively parallel h-adaptive code for solid dynamics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Summers, R.M.; Wong, M.K.; Boucheron, E.A.

1997-12-31

ALEGRA is a multi-material, arbitrary-Lagrangian-Eulerian (ALE) code for solid dynamics designed to run on massively parallel (MP) computers. It combines the features of modern Eulerian shock codes, such as CTH, with modern Lagrangian structural analysis codes using an unstructured grid. ALEGRA is being developed for use on the teraflop supercomputers to conduct advanced three-dimensional (3D) simulations of shock phenomena important to a variety of systems. ALEGRA was designed with the Single Program Multiple Data (SPMD) paradigm, in which the mesh is decomposed into sub-meshes so that each processor gets a single sub-mesh with approximately the same number of elements. Usingmore » this approach the authors have been able to produce a single code that can scale from one processor to thousands of processors. A current major effort is to develop efficient, high precision simulation capabilities for ALEGRA, without the computational cost of using a global highly resolved mesh, through flexible, robust h-adaptivity of finite elements. H-adaptivity is the dynamic refinement of the mesh by subdividing elements, thus changing the characteristic element size and reducing numerical error. The authors are working on several major technical challenges that must be met to make effective use of HAMMER on MP computers.« less

Three-dimensional local ALE-FEM method for fluid flow in domains containing moving boundaries/objects interfaces

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carrington, David Bradley; Monayem, A. K. M.; Mazumder, H.

2015-03-05

A three-dimensional finite element method for the numerical simulations of fluid flow in domains containing moving rigid objects or boundaries is developed. The method falls into the general category of Arbitrary Lagrangian Eulerian methods; it is based on a fixed mesh that is locally adapted in the immediate vicinity of the moving interfaces and reverts to its original shape once the moving interfaces go past the elements. The moving interfaces are defined by separate sets of marker points so that the global mesh is independent of interface movement and the possibility of mesh entanglement is eliminated. The results is amore » fully robust formulation capable of calculating on domains of complex geometry with moving boundaries or devises that can also have a complex geometry without danger of the mesh becoming unsuitable due to its continuous deformation thus eliminating the need for repeated re-meshing and interpolation. Moreover, the boundary conditions on the interfaces are imposed exactly. This work is intended to support the internal combustion engines simulator KIVA developed at Los Alamos National Laboratories. The model's capabilities are illustrated through application to incompressible flows in different geometrical settings that show the robustness and flexibility of the technique to perform simulations involving moving boundaries in a three-dimensional domain.« less

TESS: A RELATIVISTIC HYDRODYNAMICS CODE ON A MOVING VORONOI MESH

DOE Office of Scientific and Technical Information (OSTI.GOV)

Duffell, Paul C.; MacFadyen, Andrew I., E-mail: pcd233@nyu.edu, E-mail: macfadyen@nyu.edu

2011-12-01

We have generalized a method for the numerical solution of hyperbolic systems of equations using a dynamic Voronoi tessellation of the computational domain. The Voronoi tessellation is used to generate moving computational meshes for the solution of multidimensional systems of conservation laws in finite-volume form. The mesh-generating points are free to move with arbitrary velocity, with the choice of zero velocity resulting in an Eulerian formulation. Moving the points at the local fluid velocity makes the formulation effectively Lagrangian. We have written the TESS code to solve the equations of compressible hydrodynamics and magnetohydrodynamics for both relativistic and non-relativistic fluidsmore » on a dynamic Voronoi mesh. When run in Lagrangian mode, TESS is significantly less diffusive than fixed mesh codes and thus preserves contact discontinuities to high precision while also accurately capturing strong shock waves. TESS is written for Cartesian, spherical, and cylindrical coordinates and is modular so that auxiliary physics solvers are readily integrated into the TESS framework and so that this can be readily adapted to solve general systems of equations. We present results from a series of test problems to demonstrate the performance of TESS and to highlight some of the advantages of the dynamic tessellation method for solving challenging problems in astrophysical fluid dynamics.« less

Analysis of electrophoresis performance

NASA Technical Reports Server (NTRS)

Roberts, Glyn O.

1988-01-01

A flexible efficient computer code is being developed to simulate electrophoretic separation phenomena, in either a cylindrical or a rectangular geometry. The code will computer the evolution in time of the concentrations of an arbitrary number of chemical species, and of the temperature, pH distribution, conductivity, electric field, and fluid motion. Use of nonuniform meshes and fast accurate implicit time-stepping will yield accurate answers at economical cost.

Adaptive Meshing of Ship Air-Wake Flowfields

DTIC Science & Technology

2014-10-21

performs cut- cell operations at geometry boundaries. A second-order spatial finite-volume scheme has been incorporated with explicit first order...The cells intersected by the geometry are handled using the “cut- cell ” approach, which is basically creating arbitrary polyhedral elements with...appropriate surface boundary conditions. Any cells completely outside the computational domain are tagged external and not solved in the flow solution

Grouper: A Compact, Streamable Triangle Mesh Data Structure

DOE Office of Scientific and Technical Information (OSTI.GOV)

Luffel, Mark; Gurung, Topraj; Lindstrom, Peter

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 meshesmore » 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.« less

An arbitrary high-order Discontinuous Galerkin method for elastic waves on unstructured meshes - III. Viscoelastic attenuation

NASA Astrophysics Data System (ADS)

Käser, Martin; Dumbser, Michael; de la Puente, Josep; Igel, Heiner

2007-01-01

We present a new numerical method to solve the heterogeneous anelastic, seismic wave equations with arbitrary high order accuracy in space and time on 3-D unstructured tetrahedral meshes. Using the velocity-stress formulation provides a linear hyperbolic system of equations with source terms that is completed by additional equations for the anelastic functions including the strain history of the material. These additional equations result from the rheological model of the generalized Maxwell body and permit the incorporation of realistic attenuation properties of viscoelastic material accounting for the behaviour of elastic solids and viscous fluids. The proposed method combines the Discontinuous Galerkin (DG) finite element (FE) method with the ADER approach using Arbitrary high order DERivatives for flux calculations. The DG approach, in contrast to classical FE methods, uses a piecewise polynomial approximation of the numerical solution which allows for discontinuities at element interfaces. Therefore, the well-established theory of numerical fluxes across element interfaces obtained by the solution of Riemann problems can be applied as in the finite volume framework. The main idea of the ADER time integration approach is a Taylor expansion in time in which all time derivatives are replaced by space derivatives using the so-called Cauchy-Kovalewski procedure which makes extensive use of the governing PDE. Due to the ADER time integration technique the same approximation order in space and time is achieved automatically and the method is a one-step scheme advancing the solution for one time step without intermediate stages. To this end, we introduce a new unrolled recursive algorithm for efficiently computing the Cauchy-Kovalewski procedure by making use of the sparsity of the system matrices. The numerical convergence analysis demonstrates that the new schemes provide very high order accuracy even on unstructured tetrahedral meshes while computational cost and storage space for a desired accuracy can be reduced when applying higher degree approximation polynomials. In addition, we investigate the increase in computing time, when the number of relaxation mechanisms due to the generalized Maxwell body are increased. An application to a well-acknowledged test case and comparisons with analytic and reference solutions, obtained by different well-established numerical methods, confirm the performance of the proposed method. Therefore, the development of the highly accurate ADER-DG approach for tetrahedral meshes including viscoelastic material provides a novel, flexible and efficient numerical technique to approach 3-D wave propagation problems including realistic attenuation and complex geometry.

The domain interface method: a general-purpose non-intrusive technique for non-conforming domain decomposition problems

NASA Astrophysics Data System (ADS)

Cafiero, M.; Lloberas-Valls, O.; Cante, J.; Oliver, J.

2016-04-01

A domain decomposition technique is proposed which is capable of properly connecting arbitrary non-conforming interfaces. The strategy essentially consists in considering a fictitious zero-width interface between the non-matching meshes which is discretized using a Delaunay triangulation. Continuity is satisfied across domains through normal and tangential stresses provided by the discretized interface and inserted in the formulation in the form of Lagrange multipliers. The final structure of the global system of equations resembles the dual assembly of substructures where the Lagrange multipliers are employed to nullify the gap between domains. A new approach to handle floating subdomains is outlined which can be implemented without significantly altering the structure of standard industrial finite element codes. The effectiveness of the developed algorithm is demonstrated through a patch test example and a number of tests that highlight the accuracy of the methodology and independence of the results with respect to the framework parameters. Considering its high degree of flexibility and non-intrusive character, the proposed domain decomposition framework is regarded as an attractive alternative to other established techniques such as the mortar approach.

A high-order staggered meshless method for elliptic problems

DOE PAGES

Trask, Nathaniel; Perego, Mauro; Bochev, Pavel Blagoveston

2017-03-21

Here, we present a new meshless method for scalar diffusion equations, which is motivated by their compatible discretizations on primal-dual grids. Unlike the latter though, our approach is truly meshless because it only requires the graph of nearby neighbor connectivity of the discretization points. This graph defines a local primal-dual grid complex with a virtual dual grid, in the sense that specification of the dual metric attributes is implicit in the method's construction. Our method combines a topological gradient operator on the local primal grid with a generalized moving least squares approximation of the divergence on the local dual grid. We show that the resulting approximation of the div-grad operator maintains polynomial reproduction to arbitrary orders and yields a meshless method, which attainsmore » $$O(h^{m})$$ convergence in both $L^2$- and $H^1$-norms, similar to mixed finite element methods. We demonstrate this convergence on curvilinear domains using manufactured solutions in two and three dimensions. Application of the new method to problems with discontinuous coefficients reveals solutions that are qualitatively similar to those of compatible mesh-based discretizations.« less

A Dissipative Systems Theory for FDTD With Application to Stability Analysis and Subgridding

NASA Astrophysics Data System (ADS)

Bekmambetova, Fadime; Zhang, Xinyue; Triverio, Piero

2017-02-01

This paper establishes a far-reaching connection between the Finite-Difference Time-Domain method (FDTD) and the theory of dissipative systems. The FDTD equations for a rectangular region are written as a dynamical system having the magnetic and electric fields on the boundary as inputs and outputs. Suitable expressions for the energy stored in the region and the energy absorbed from the boundaries are introduced, and used to show that the FDTD system is dissipative under a generalized Courant-Friedrichs-Lewy condition. Based on the concept of dissipation, a powerful theoretical framework to investigate the stability of FDTD methods is devised. The new method makes FDTD stability proofs simpler, more intuitive, and modular. Stability conditions can indeed be given on the individual components (e.g. boundary conditions, meshes, embedded models) instead of the whole coupled setup. As an example of application, we derive a new subgridding method with material traverse, arbitrary grid refinement, and guaranteed stability. The method is easy to implement and has a straightforward stability proof. Numerical results confirm its stability, low reflections, and ability to handle material traverse.

Scan Directed Load Balancing for Highly-Parallel Mesh-Connected Computers

DTIC Science & Technology

1991-07-01

DTIC ~ ELECTE OCT 2 41991 AD-A242 045 Scan Directed Load Balancing for Highly-Parallel Mesh-Connected Computers’ Edoardo S. Biagioni Jan F. Prins...Department of Computer Science University of North Carolina Chapel Hill, N.C. 27599-3175 USA biagioni @cs.unc.edu prinsOcs.unc.edu Abstract Scan Directed...MasPar Computer Corpora- tion. Bibliography [1] Edoardo S. Biagioni . Scan Directed Load Balancing. PhD thesis., University of North Carolina, Chapel Hill

Multiresolution Distance Volumes for Progressive Surface Compression

DOE Office of Scientific and Technical Information (OSTI.GOV)

Laney, D E; Bertram, M; Duchaineau, M A

2002-04-18

We present a surface compression method that stores surfaces as wavelet-compressed signed-distance volumes. Our approach enables the representation of surfaces with complex topology and arbitrary numbers of components within a single multiresolution data structure. This data structure elegantly handles topological modification at high compression rates. Our method does not require the costly and sometimes infeasible base mesh construction step required by subdivision surface approaches. We present several improvements over previous attempts at compressing signed-distance functions, including an 0(n) distance transform, a zero set initialization method for triangle meshes, and a specialized thresholding algorithm. We demonstrate the potential of sampled distancemore » volumes for surface compression and progressive reconstruction for complex high genus surfaces.« less

3D hierarchical interface-enriched finite element method: Implementation and applications

NASA Astrophysics Data System (ADS)

Soghrati, Soheil; Ahmadian, Hossein

2015-10-01

A hierarchical interface-enriched finite element method (HIFEM) is proposed for the mesh-independent treatment of 3D problems with intricate morphologies. The HIFEM implements a recursive algorithm for creating enrichment functions that capture gradient discontinuities in nonconforming finite elements cut by arbitrary number and configuration of materials interfaces. The method enables the mesh-independent simulation of multiphase problems with materials interfaces that are in close proximity or contact while providing a straightforward general approach for evaluating the enrichments. In this manuscript, we present a detailed discussion on the implementation issues and required computational geometry considerations associated with the HIFEM approximation of thermal and mechanical responses of 3D problems. A convergence study is provided to investigate the accuracy and convergence rate of the HIFEM and compare them with standard FEM benchmark solutions. We will also demonstrate the application of this mesh-independent method for simulating the thermal and mechanical responses of two composite materials systems with complex microstructures.

Investigation of Advanced Counterrotation Blade Configuration Concepts for High Speed Turboprop Systems. Task 3: Advanced Fan Section Grid Generator Final Report and Computer Program User's Manual

NASA Technical Reports Server (NTRS)

Crook, Andrew J.; Delaney, Robert A.

1991-01-01

A procedure is studied for generating three-dimensional grids for advanced turbofan engine fan section geometries. The procedure constructs a discrete mesh about engine sections containing the fan stage, an arbitrary number of axisymmetric radial flow splitters, a booster stage, and a bifurcated core/bypass flow duct with guide vanes. The mesh is an h-type grid system, the points being distributed with a transfinite interpolation scheme with axial and radial spacing being user specified. Elliptic smoothing of the grid in the meridional plane is a post-process option. The grid generation scheme is consistent with aerodynamic analyses utilizing the average-passage equation system developed by Dr. John Adamczyk of NASA Lewis. This flow solution scheme requires a series of blade specific grids each having a common axisymmetric mesh, but varying in the circumferential direction according to the geometry of the specific blade row.

DNA rendering of polyhedral meshes at the nanoscale

NASA Astrophysics Data System (ADS)

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.

DNA rendering of polyhedral meshes at the nanoscale.

PubMed

Benson, Erik; Mohammed, Abdulmelik; Gardell, Johan; Masich, Sergej; Czeizler, Eugen; Orponen, Pekka; Högberg, Björn

2015-07-23

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.

Multiphase Interface Tracking with Fast Semi-Lagrangian Contouring.

PubMed

Li, Xiaosheng; He, Xiaowei; Liu, Xuehui; Zhang, Jian J; Liu, Baoquan; Wu, Enhua

2016-08-01

We propose a semi-Lagrangian method for multiphase interface tracking. In contrast to previous methods, our method maintains an explicit polygonal mesh, which is reconstructed from an unsigned distance function and an indicator function, to track the interface of arbitrary number of phases. The surface mesh is reconstructed at each step using an efficient multiphase polygonization procedure with precomputed stencils while the distance and indicator function are updated with an accurate semi-Lagrangian path tracing from the meshes of the last step. Furthermore, we provide an adaptive data structure, multiphase distance tree, to accelerate the updating of both the distance function and the indicator function. In addition, the adaptive structure also enables us to contour the distance tree accurately with simple bisection techniques. The major advantage of our method is that it can easily handle topological changes without ambiguities and preserve both the sharp features and the volume well. We will evaluate its efficiency, accuracy and robustness in the results part with several examples.

A Reconstructed Discontinuous Galerkin Method for the Euler Equations on Arbitrary Grids

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hong Luo; Luqing Luo; Robert Nourgaliev

2012-11-01

A reconstruction-based discontinuous Galerkin (RDG(P1P2)) method, a variant of P1P2 method, is presented for the solution of the compressible Euler equations on arbitrary grids. In this method, an in-cell reconstruction, designed to enhance the accuracy of the discontinuous Galerkin method, is used to obtain a quadratic polynomial solution (P2) from the underlying linear polynomial (P1) discontinuous Galerkin solution using a least-squares method. The stencils used in the reconstruction involve only the von Neumann neighborhood (face-neighboring cells) and are compact and consistent with the underlying DG method. The developed RDG method is used to compute a variety of flow problems onmore » arbitrary meshes to demonstrate its accuracy, efficiency, robustness, and versatility. The numerical results indicate that this RDG(P1P2) method is third-order accurate, and outperforms the third-order DG method (DG(P2)) in terms of both computing costs and storage requirements.« less

Direct Replacement of Arbitrary Grid-Overlapping by Non-Structured Grid

NASA Technical Reports Server (NTRS)

Kao, Kai-Hsiung; Liou, Meng-Sing

1994-01-01

A new approach that uses nonstructured mesh to replace the arbitrarily overlapped structured regions of embedded grids is presented. The present methodology uses the Chimera composite overlapping mesh system so that the physical domain of the flowfield is subdivided into regions which can accommodate easily-generated grid for complex configuration. In addition, a Delaunay triangulation technique generates nonstructured triangular mesh which wraps over the interconnecting region of embedded grids. It is designed that the present approach, termed DRAGON grid, has three important advantages: eliminating some difficulties of the Chimera scheme, such as the orphan points and/or bad quality of interpolation stencils; making grid communication in a fully conservative way; and implementation into three dimensions is straightforward. A computer code based on a time accurate, finite volume, high resolution scheme for solving the compressible Navier-Stokes equations has been further developed to include both the Chimera overset grid and the nonstructured mesh schemes. For steady state problems, the local time stepping accelerates convergence based on a Courant - Friedrichs - Leury (CFL) number near the local stability limit. Numerical tests on representative steady and unsteady supersonic inviscid flows with strong shock waves are demonstrated.

Functional Data Approximation on Bounded Domains using Polygonal Finite Elements.

PubMed

Cao, Juan; Xiao, Yanyang; Chen, Zhonggui; Wang, Wenping; Bajaj, Chandrajit

2018-07-01

We construct and analyze piecewise approximations of functional data on arbitrary 2D bounded domains using generalized barycentric finite elements, and particularly quadratic serendipity elements for planar polygons. We compare approximation qualities (precision/convergence) of these partition-of-unity finite elements through numerical experiments, using Wachspress coordinates, natural neighbor coordinates, Poisson coordinates, mean value coordinates, and quadratic serendipity bases over polygonal meshes on the domain. For a convex n -sided polygon, the quadratic serendipity elements have 2 n basis functions, associated in a Lagrange-like fashion to each vertex and each edge midpoint, rather than the usual n ( n + 1)/2 basis functions to achieve quadratic convergence. Two greedy algorithms are proposed to generate Voronoi meshes for adaptive functional/scattered data approximations. Experimental results show space/accuracy advantages for these quadratic serendipity finite elements on polygonal domains versus traditional finite elements over simplicial meshes. Polygonal meshes and parameter coefficients of the quadratic serendipity finite elements obtained by our greedy algorithms can be further refined using an L 2 -optimization to improve the piecewise functional approximation. We conduct several experiments to demonstrate the efficacy of our algorithm for modeling features/discontinuities in functional data/image approximation.

A computational method for sharp interface advection.

PubMed

Roenby, Johan; Bredmose, Henrik; Jasak, Hrvoje

2016-11-01

We devise a numerical method for passive advection of a surface, such as the interface between two incompressible fluids, across a computational mesh. The method is called isoAdvector, and is developed for general meshes consisting of arbitrary polyhedral cells. The algorithm is based on the volume of fluid (VOF) idea of calculating the volume of one of the fluids transported across the mesh faces during a time step. The novelty of the isoAdvector concept consists of two parts. First, we exploit an isosurface concept for modelling the interface inside cells in a geometric surface reconstruction step. Second, from the reconstructed surface, we model the motion of the face-interface intersection line for a general polygonal face to obtain the time evolution within a time step of the submerged face area. Integrating this submerged area over the time step leads to an accurate estimate for the total volume of fluid transported across the face. The method was tested on simple two-dimensional and three-dimensional interface advection problems on both structured and unstructured meshes. The results are very satisfactory in terms of volume conservation, boundedness, surface sharpness and efficiency. The isoAdvector method was implemented as an OpenFOAM ® extension and is published as open source.

Recent advances in high-order WENO finite volume methods for compressible multiphase flows

NASA Astrophysics Data System (ADS)

Dumbser, Michael

2013-10-01

We present two new families of better than second order accurate Godunov-type finite volume methods for the solution of nonlinear hyperbolic partial differential equations with nonconservative products. One family is based on a high order Arbitrary-Lagrangian-Eulerian (ALE) formulation on moving meshes, which allows to resolve the material contact wave in a very sharp way when the mesh is moved at the speed of the material interface. The other family of methods is based on a high order Adaptive Mesh Refinement (AMR) strategy, where the mesh can be strongly refined in the vicinity of the material interface. Both classes of schemes have several building blocks in common, in particular: a high order WENO reconstruction operator to obtain high order of accuracy in space; the use of an element-local space-time Galerkin predictor step which evolves the reconstruction polynomials in time and that allows to reach high order of accuracy in time in one single step; the use of a path-conservative approach to treat the nonconservative terms of the PDE. We show applications of both methods to the Baer-Nunziato model for compressible multiphase flows.

A fully consistent and conservative vertically adaptive coordinate system for SLIM 3D v0.4 with an application to the thermocline oscillations of Lake Tanganyika

NASA Astrophysics Data System (ADS)

Delandmeter, Philippe; Lambrechts, Jonathan; Legat, Vincent; Vallaeys, Valentin; Naithani, Jaya; Thiery, Wim; Remacle, Jean-François; Deleersnijder, Eric

2018-03-01

The discontinuous Galerkin (DG) finite element method is well suited for the modelling, with a relatively small number of elements, of three-dimensional flows exhibiting strong velocity or density gradients. Its performance can be highly enhanced by having recourse to r-adaptivity. Here, a vertical adaptive mesh method is developed for DG finite elements. This method, originally designed for finite difference schemes, is based on the vertical diffusion of the mesh nodes, with the diffusivity controlled by the density jumps at the mesh element interfaces. The mesh vertical movement is determined by means of a conservative arbitrary Lagrangian-Eulerian (ALE) formulation. Though conservativity is naturally achieved, tracer consistency is obtained by a suitable construction of the mesh vertical velocity field, which is defined in such a way that it is fully compatible with the tracer and continuity equations at a discrete level. The vertically adaptive mesh approach is implemented in the three-dimensional version of the geophysical and environmental flow Second-generation Louvain-la-Neuve Ice-ocean Model (SLIM 3D; www.climate.be/slim). Idealised benchmarks, aimed at simulating the oscillations of a sharp thermocline, are dealt with. Then, the relevance of the vertical adaptivity technique is assessed by simulating thermocline oscillations of Lake Tanganyika. The results are compared to measured vertical profiles of temperature, showing similar stratification and outcropping events.

An unstructured-mesh finite-volume MPDATA for compressible atmospheric dynamics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kühnlein, Christian, E-mail: christian.kuehnlein@ecmwf.int; Smolarkiewicz, Piotr K., E-mail: piotr.smolarkiewicz@ecmwf.int

An advancement of the unstructured-mesh finite-volume MPDATA (Multidimensional Positive Definite Advection Transport Algorithm) is presented that formulates the error-compensative pseudo-velocity of the scheme to rely only on face-normal advective fluxes to the dual cells, in contrast to the full vector employed in previous implementations. This is essentially achieved by expressing the temporal truncation error underlying the pseudo-velocity in a form consistent with the flux-divergence of the governing conservation law. The development is especially important for integrating fluid dynamics equations on non-rectilinear meshes whenever face-normal advective mass fluxes are employed for transport compatible with mass continuity—the latter being essential for flux-formmore » schemes. In particular, the proposed formulation enables large-time-step semi-implicit finite-volume integration of the compressible Euler equations using MPDATA on arbitrary hybrid computational meshes. Furthermore, it facilitates multiple error-compensative iterations of the finite-volume MPDATA and improved overall accuracy. The advancement combines straightforwardly with earlier developments, such as the nonoscillatory option, the infinite-gauge variant, and moving curvilinear meshes. A comprehensive description of the scheme is provided for a hybrid horizontally-unstructured vertically-structured computational mesh for efficient global atmospheric flow modelling. The proposed finite-volume MPDATA is verified using selected 3D global atmospheric benchmark simulations, representative of hydrostatic and non-hydrostatic flow regimes. Besides the added capabilities, the scheme retains fully the efficacy of established finite-volume MPDATA formulations.« less

Deposition and post-processing techniques for transparent conductive films

DOE Office of Scientific and Technical Information (OSTI.GOV)

Christoforo, Mark Greyson; Mehra, Saahil; Salleo, Alberto

2017-07-04

In one embodiment, a method is provided for fabrication of a semitransparent conductive mesh. A first solution having conductive nanowires suspended therein and a second solution having nanoparticles suspended therein are sprayed toward a substrate, the spraying forming a mist. The mist is processed, while on the substrate, to provide a semitransparent conductive material in the form of a mesh having the conductive nanowires and nanoparticles. The nanoparticles are configured and arranged to direct light passing through the mesh. Connections between the nanowires provide conductivity through the mesh.

A spring system method for a mesh generation problem

NASA Astrophysics Data System (ADS)

Romanov, A.

2018-04-01

A new direct method for the 2d-mesh generation for a simply-connected domain using a spring system is observed. The method can be used with other methods to modify a mesh for growing solid problems. Advantages and disadvantages of the method are shown. Different types of boundary conditions are explored. The results of modelling for different target domains are given. Some applications for composite materials are studied.

A mesh partitioning algorithm for preserving spatial locality in arbitrary geometries

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nivarti, Girish V., E-mail: g.nivarti@alumni.ubc.ca; Salehi, M. Mahdi; Bushe, W. Kendal

2015-01-15

Highlights: •An algorithm for partitioning computational meshes is proposed. •The Morton order space-filling curve is modified to achieve improved locality. •A spatial locality metric is defined to compare results with existing approaches. •Results indicate improved performance of the algorithm in complex geometries. -- Abstract: A space-filling curve (SFC) is a proximity preserving linear mapping of any multi-dimensional space and is widely used as a clustering tool. Equi-sized partitioning of an SFC ignores the loss in clustering quality that occurs due to inaccuracies in the mapping. Often, this results in poor locality within partitions, especially for the conceptually simple, Morton ordermore » curves. We present a heuristic that improves partition locality in arbitrary geometries by slicing a Morton order curve at points where spatial locality is sacrificed. In addition, we develop algorithms that evenly distribute points to the extent possible while maintaining spatial locality. A metric is defined to estimate relative inter-partition contact as an indicator of communication in parallel computing architectures. Domain partitioning tests have been conducted on geometries relevant to turbulent reactive flow simulations. The results obtained highlight the performance of our method as an unsupervised and computationally inexpensive domain partitioning tool.« less

An unstructured mesh arbitrary Lagrangian-Eulerian unsteady incompressible flow solver and its application to insect flight aerodynamics

NASA Astrophysics Data System (ADS)

Su, Xiaohui; Cao, Yuanwei; Zhao, Yong

2016-06-01

In this paper, an unstructured mesh Arbitrary Lagrangian-Eulerian (ALE) incompressible flow solver is developed to investigate the aerodynamics of insect hovering flight. The proposed finite-volume ALE Navier-Stokes solver is based on the artificial compressibility method (ACM) with a high-resolution method of characteristics-based scheme on unstructured grids. The present ALE model is validated and assessed through flow passing over an oscillating cylinder. Good agreements with experimental results and other numerical solutions are obtained, which demonstrates the accuracy and the capability of the present model. The lift generation mechanisms of 2D wing in hovering motion, including wake capture, delayed stall, rapid pitch, as well as clap and fling are then studied and illustrated using the current ALE model. Moreover, the optimized angular amplitude in symmetry model, 45°, is firstly reported in details using averaged lift and the energy power method. Besides, the lift generation of complete cyclic clap and fling motion, which is simulated by few researchers using the ALE method due to large deformation, is studied and clarified for the first time. The present ALE model is found to be a useful tool to investigate lift force generation mechanism for insect wing flight.

Higher-Order Advection-Based Remap of Magnetic Fields in an Arbitrary Lagrangian-Eulerian Code

NASA Astrophysics Data System (ADS)

Cornille, Brian; White, Dan

2017-10-01

We will present methods formulated for the Eulerian advection stage of an arbitrary Lagrangian-Eulerian code for the new addition of magnetohydrodynamic (MHD) effects. The various physical fields are advanced in time using a Lagrangian formulation of the system. When this Lagrangian motion produces substantial distortion of the mesh, it can be difficult or impossible to progress the simulation forward. This is overcome by relaxation of the mesh while the physical fields are frozen. The code has already successfully been extended to include evolution of magnetic field diffusion during the Lagrangian motion stage. This magnetic field is discretized using an H(div) compatible finite element basis. The advantage of this basis is that the divergence-free constraint of magnetic fields is maintained exactly during the Lagrangian motion evolution. Our goal is to preserve this property during Eulerian advection as well. We will demonstrate this property and the importance of MHD effects in several numerical experiments. In pulsed-power experiments magnetic fields may be imposed or spontaneously generated. When these magnetic fields are present, the evolution of the experiment may differ from a comparable configuration without magnetic fields. Prepared by LLNL under Contract DE-AC52-07NA27344. Supported by DOE CSGF under Grant Number DE-FG02-97ER25308.

Covariant formulation of scalar-torsion gravity

NASA Astrophysics Data System (ADS)

Hohmann, Manuel; Järv, Laur; Ualikhanova, Ulbossyn

2018-05-01

We consider a generalized teleparallel theory of gravitation, where the action contains an arbitrary function of the torsion scalar and a scalar field, f (T ,ϕ ) , thus encompassing the cases of f (T ) gravity and a nonminimally coupled scalar field as subclasses. The action is manifestly Lorentz invariant when besides the tetrad one allows for a flat but nontrivial spin connection. We derive the field equations and demonstrate how the antisymmetric part of the tetrad equations is automatically satisfied when the spin connection equation holds. The spin connection equation is a vital part of the covariant formulation, since it determines the spin connection associated with a given tetrad. We discuss how the spin connection equation can be solved in general and provide the cosmological and spherically symmetric examples. Finally, we generalize the theory to an arbitrary number of scalar fields.

Parallel three-dimensional magnetotelluric inversion using adaptive finite-element method. Part I: theory and synthetic study

NASA Astrophysics Data System (ADS)

Grayver, Alexander V.

2015-07-01

This paper presents a distributed magnetotelluric inversion scheme based on adaptive finite-element method (FEM). The key novel aspect of the introduced algorithm is the use of automatic mesh refinement techniques for both forward and inverse modelling. These techniques alleviate tedious and subjective procedure of choosing a suitable model parametrization. To avoid overparametrization, meshes for forward and inverse problems were decoupled. For calculation of accurate electromagnetic (EM) responses, automatic mesh refinement algorithm based on a goal-oriented error estimator has been adopted. For further efficiency gain, EM fields for each frequency were calculated using independent meshes in order to account for substantially different spatial behaviour of the fields over a wide range of frequencies. An automatic approach for efficient initial mesh design in inverse problems based on linearized model resolution matrix was developed. To make this algorithm suitable for large-scale problems, it was proposed to use a low-rank approximation of the linearized model resolution matrix. In order to fill a gap between initial and true model complexities and resolve emerging 3-D structures better, an algorithm for adaptive inverse mesh refinement was derived. Within this algorithm, spatial variations of the imaged parameter are calculated and mesh is refined in the neighborhoods of points with the largest variations. A series of numerical tests were performed to demonstrate the utility of the presented algorithms. Adaptive mesh refinement based on the model resolution estimates provides an efficient tool to derive initial meshes which account for arbitrary survey layouts, data types, frequency content and measurement uncertainties. Furthermore, the algorithm is capable to deliver meshes suitable to resolve features on multiple scales while keeping number of unknowns low. However, such meshes exhibit dependency on an initial model guess. Additionally, it is demonstrated that the adaptive mesh refinement can be particularly efficient in resolving complex shapes. The implemented inversion scheme was able to resolve a hemisphere object with sufficient resolution starting from a coarse discretization and refining mesh adaptively in a fully automatic process. The code is able to harness the computational power of modern distributed platforms and is shown to work with models consisting of millions of degrees of freedom. Significant computational savings were achieved by using locally refined decoupled meshes.

A framework for developing a mimetic tensor artificial viscosity for Lagrangian hydrocodes on arbitrary polygonal and polyhedral meshes (u)

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lipnikov, Konstantin; Shashkov, Mikhail

2011-01-11

We construct a new mimetic tensor artificial viscosity on general polygonal and polyhedral meshes. The tensor artificial viscosity is based on a mimetic discretization of coordinate invariant operators, divergence of a tensor and gradient of a vector. The focus of this paper is on the symmetric form, div ({mu},{var_epsilon}(u)), of the tensor artificial viscosity where {var_epsilon}(u) is the symmetrized gradient of u and {mu}, is a tensor. The mimetic discretizations of this operator is derived for the case of a full tensor coefficient {mu}, that may reflect a shock direction. We demonstrate performance of the new viscosity for the Nohmore » implosion, Sedov explosion and Saltzman piston problems in both Cartesian and axisymmetric coordinate systems.« less

Monogamy Relations of Measurement-Induced Disturbance

NASA Astrophysics Data System (ADS)

Liu, Feng; Li, Fei; Wei, Yun-Xia; Ma, Hong-Yang

2017-06-01

The standard monogamy imposes severe limitations to sharing quantum correlations in multipartite quantum systems, which is a star topology and is established by Coffman, Kundu and Wootters. In this work, we discuss some monogamy relations beyond it, and focus on the measurement-induced disturbance (MID) which quantifies the multipartite quantum correlation. We prove exactly that MID obeys the property of discarding quantum systems never increases in an arbitrary quantum state. Moreover, we define a new kind of sharper monogamy relation which shows that the sum of all bipartite MID can not exceed the amount of total MID. This restriction is similarly called a mesh monogamy. We numerically study how MID is distributed in a 4-qubit mixed state, and which relation exists between the mesh monogamy of MID and the level of obeying the standard monogamy.

Self-Avoiding Walks over Adaptive Triangular Grids

NASA Technical Reports Server (NTRS)

Heber, Gerd; Biswas, Rupak; Gao, Guang R.; Saini, Subhash (Technical Monitor)

1998-01-01

In this paper, we present a new approach to constructing a "self-avoiding" walk through a triangular mesh. Unlike the popular approach of visiting mesh elements using space-filling curves which is based on a geometric embedding, our approach is combinatorial in the sense that it uses the mesh connectivity only. We present an algorithm for constructing a self-avoiding walk which can be applied to any unstructured triangular mesh. The complexity of the algorithm is O(n x log(n)), where n is the number of triangles in the mesh. We show that for hierarchical adaptive meshes, the algorithm can be easily parallelized by taking advantage of the regularity of the refinement rules. The proposed approach should be very useful in the run-time partitioning and load balancing of adaptive unstructured grids.

Evaluation of a transient, simultaneous, arbitrary Lagrange-Euler based multi-physics method for simulating the mitral heart valve.

PubMed

Espino, Daniel M; Shepherd, Duncan E T; Hukins, David W L

2014-01-01

A transient multi-physics model of the mitral heart valve has been developed, which allows simultaneous calculation of fluid flow and structural deformation. A recently developed contact method has been applied to enable simulation of systole (the stage when blood pressure is elevated within the heart to pump blood to the body). The geometry was simplified to represent the mitral valve within the heart walls in two dimensions. Only the mitral valve undergoes deformation. A moving arbitrary Lagrange-Euler mesh is used to allow true fluid-structure interaction (FSI). The FSI model requires blood flow to induce valve closure by inducing strains in the region of 10-20%. Model predictions were found to be consistent with existing literature and will undergo further development.

Damping and support in high-temperature superconducting levitation systems

DOEpatents

Hull, John R [Sammamish, WA; McIver, Carl R [Everett, WA; Mittleider, John A [Kent, WA

2009-12-15

Methods and apparatuses to provide improved auxiliary damping for superconducting bearings in superconducting levitation systems are disclosed. In a superconducting bearing, a cryostat housing the superconductors is connected to a ground state with a combination of a damping strip of material, a set of linkage arms to provide vertical support, and spring washers to provide stiffness. Alternately, the superconducting bearing may be supported by a cryostat connected to a ground state by posts constructed from a mesh of fibers, with the damping and stiffness controlled by the fiber composition, size, and mesh geometry.

Finite element meshing approached as a global minimization process

DOE Office of Scientific and Technical Information (OSTI.GOV)

WITKOWSKI,WALTER R.; JUNG,JOSEPH; DOHRMANN,CLARK R.

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 amore » 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 before this project ended. The primary complexity in the extension was in the connectivity problem formulation. Defining all of the interparticle interactions that occur in three-dimensions and expressing them in mathematical relationships is very difficult.« less

Challenges for Wireless Mesh Networks to provide reliable carrier-grade services

NASA Astrophysics Data System (ADS)

von Hugo, D.; Bayer, N.

2011-08-01

Provision of mobile and wireless services today within a competitive environment and driven by a huge amount of steadily emerging new services and applications is both challenge and chance for radio network operators. Deployment and operation of an infrastructure for mobile and wireless broadband connectivity generally requires planning effort and large investments. A promising approach to reduce expenses for radio access networking is offered by Wireless Mesh Networks (WMNs). Here traditional dedicated backhaul connections to each access point are replaced by wireless multi-hop links between neighbouring access nodes and few gateways to the backbone employing standard radio technology. Such a solution provides at the same time high flexibility in both deployment and the amount of offered capacity and shall reduce overall expenses. On the other hand currently available mesh solutions do not provide carrier grade service quality and reliability and often fail to cope with high traffic load. EU project CARMEN (CARrier grade MEsh Networks) was initiated to incorporate different heterogeneous technologies and new protocols to allow for reliable transmission over "best effort" radio channels, to support a reliable mobility and network management, self-configuration and dynamic resource usage, and thus to offer a permanent or temporary broadband access at high cost efficiency. The contribution provides an overview on preliminary project results with focus on main technical challenges from a research and implementation point of view. Especially impact of mesh topology on the overall system performance in terms of throughput and connection reliability and aspects of a dedicated hybrid mobility management solution will be discussed.

EMPHASIS/Nevada UTDEM user guide. Version 2.0.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Turner, C. David; Seidel, David Bruce; Pasik, Michael Francis

The Unstructured Time-Domain ElectroMagnetics (UTDEM) portion of the EMPHASIS suite solves Maxwell's equations using finite-element techniques on unstructured meshes. This document provides user-specific information to facilitate the use of the code for applications of interest. UTDEM is a general-purpose code for solving Maxwell's equations on arbitrary, unstructured tetrahedral meshes. The geometries and the meshes thereof are limited only by the patience of the user in meshing and by the available computing resources for the solution. UTDEM solves Maxwell's equations using finite-element method (FEM) techniques on tetrahedral elements using vector, edge-conforming basis functions. EMPHASIS/Nevada Unstructured Time-Domain ElectroMagnetic Particle-In-Cell (UTDEM PIC) ismore » a superset of the capabilities found in UTDEM. It adds the capability to simulate systems in which the effects of free charge are important and need to be treated in a self-consistent manner. This is done by integrating the equations of motion for macroparticles (a macroparticle is an object that represents a large number of real physical particles, all with the same position and momentum) being accelerated by the electromagnetic forces upon the particle (Lorentz force). The motion of these particles results in a current, which is a source for the fields in Maxwell's equations.« less

A new adaptive mesh refinement strategy for numerically solving evolutionary PDE's

NASA Astrophysics Data System (ADS)

Burgarelli, Denise; Kischinhevsky, Mauricio; Biezuner, Rodney Josue

2006-11-01

A graph-based implementation of quadtree meshes for dealing with adaptive mesh refinement (AMR) in the numerical solution of evolutionary partial differential equations is discussed using finite volume methods. The technique displays a plug-in feature that allows replacement of a group of cells in any region of interest for another one with arbitrary refinement, and with only local changes occurring in the data structure. The data structure is also specially designed to minimize the number of operations needed in the AMR. Implementation of the new scheme allows flexibility in the levels of refinement of adjacent regions. Moreover, storage requirements and computational cost compare competitively with mesh refinement schemes based on hierarchical trees. Low storage is achieved for only the children nodes are stored when a refinement takes place. These nodes become part of a graph structure, thus motivating the denomination autonomous leaves graph (ALG) for the new scheme. Neighbors can then be reached without accessing their parent nodes. Additionally, linear-system solvers based on the minimization of functionals can be easily employed. ALG was not conceived with any particular problem or geometry in mind and can thus be applied to the study of several phenomena. Some test problems are used to illustrate the effectiveness of the technique.

Numerical calculation of listener-specific head-related transfer functions and sound localization: Microphone model and mesh discretization

PubMed Central

Ziegelwanger, Harald; Majdak, Piotr; Kreuzer, Wolfgang

2015-01-01

Head-related transfer functions (HRTFs) can be numerically calculated by applying the boundary element method on the geometry of a listener’s head and pinnae. The calculation results are defined by geometrical, numerical, and acoustical parameters like the microphone used in acoustic measurements. The scope of this study was to estimate requirements on the size and position of the microphone model and on the discretization of the boundary geometry as triangular polygon mesh for accurate sound localization. The evaluation involved the analysis of localization errors predicted by a sagittal-plane localization model, the comparison of equivalent head radii estimated by a time-of-arrival model, and the analysis of actual localization errors obtained in a sound-localization experiment. While the average edge length (AEL) of the mesh had a negligible effect on localization performance in the lateral dimension, the localization performance in sagittal planes, however, degraded for larger AELs with the geometrical error as dominant factor. A microphone position at an arbitrary position at the entrance of the ear canal, a microphone size of 1 mm radius, and a mesh with 1 mm AEL yielded a localization performance similar to or better than observed with acoustically measured HRTFs. PMID:26233020

A computational method for sharp interface advection

PubMed Central

Bredmose, Henrik; Jasak, Hrvoje

2016-01-01

We devise a numerical method for passive advection of a surface, such as the interface between two incompressible fluids, across a computational mesh. The method is called isoAdvector, and is developed for general meshes consisting of arbitrary polyhedral cells. The algorithm is based on the volume of fluid (VOF) idea of calculating the volume of one of the fluids transported across the mesh faces during a time step. The novelty of the isoAdvector concept consists of two parts. First, we exploit an isosurface concept for modelling the interface inside cells in a geometric surface reconstruction step. Second, from the reconstructed surface, we model the motion of the face–interface intersection line for a general polygonal face to obtain the time evolution within a time step of the submerged face area. Integrating this submerged area over the time step leads to an accurate estimate for the total volume of fluid transported across the face. The method was tested on simple two-dimensional and three-dimensional interface advection problems on both structured and unstructured meshes. The results are very satisfactory in terms of volume conservation, boundedness, surface sharpness and efficiency. The isoAdvector method was implemented as an OpenFOAM® extension and is published as open source. PMID:28018619

Electromagnetic forward modelling for realistic Earth models using unstructured tetrahedral meshes and a meshfree approach

NASA Astrophysics Data System (ADS)

Farquharson, C.; Long, J.; Lu, X.; Lelievre, P. G.

2017-12-01

Real-life geology is complex, and so, even when allowing for the diffusive, low resolution nature of geophysical electromagnetic methods, we need Earth models that can accurately represent this complexity when modelling and inverting electromagnetic data. This is particularly the case for the scales, detail and conductivity contrasts involved in mineral and hydrocarbon exploration and development, but also for the larger scale of lithospheric studies. Unstructured tetrahedral meshes provide a flexible means of discretizing a general, arbitrary Earth model. This is important when wanting to integrate a geophysical Earth model with a geological Earth model parameterized in terms of surfaces. Finite-element and finite-volume methods can be derived for computing the electric and magnetic fields in a model parameterized using an unstructured tetrahedral mesh. A number of such variants have been proposed and have proven successful. However, the efficiency and accuracy of these methods can be affected by the "quality" of the tetrahedral discretization, that is, how many of the tetrahedral cells in the mesh are long, narrow and pointy. This is particularly the case if one wants to use an iterative technique to solve the resulting linear system of equations. One approach to deal with this issue is to develop sophisticated model and mesh building and manipulation capabilities in order to ensure that any mesh built from geological information is of sufficient quality for the electromagnetic modelling. Another approach is to investigate other methods of synthesizing the electromagnetic fields. One such example is a "meshfree" approach in which the electromagnetic fields are synthesized using a mesh that is distinct from the mesh used to parameterized the Earth model. There are then two meshes, one describing the Earth model and one used for the numerical mathematics of computing the fields. This means that there are no longer any quality requirements on the model mesh, which makes the process of building a geophysical Earth model from a geological model much simpler. In this presentation we will explore the issues that arise when working with realistic Earth models and when synthesizing geophysical electromagnetic data for them. We briefly consider meshfree methods as a possible means of alleviating some of these issues.

A finite element conjugate gradient FFT method for scattering

NASA Technical Reports Server (NTRS)

Collins, Jeffery D.; Zapp, John; Hsa, Chang-Yu; Volakis, John L.

1990-01-01

An extension of a two dimensional formulation is presented for a three dimensional body of revolution. With the introduction of a Fourier expansion of the vector electric and magnetic fields, a coupled two dimensional system is generated and solved via the finite element method. An exact boundary condition is employed to terminate the mesh and the fast fourier transformation (FFT) is used to evaluate the boundary integrals for low O(n) memory demand when an iterative solution algorithm is used. By virtue of the finite element method, the algorithm is applicable to structures of arbitrary material composition. Several improvements to the two dimensional algorithm are also described. These include: (1) modifications for terminating the mesh at circular boundaries without distorting the convolutionality of the boundary integrals; (2) the development of nonproprietary mesh generation routines for two dimensional applications; (3) the development of preprocessors for interfacing SDRC IDEAS with the main algorithm; and (4) the development of post-processing algorithms based on the public domain package GRAFIC to generate two and three dimensional gray level and color field maps.

A versatile embedded boundary adaptive mesh method for compressible flow in complex geometry

NASA Astrophysics Data System (ADS)

Al-Marouf, M.; Samtaney, R.

2017-05-01

We present an embedded ghost fluid method for numerical solutions of the compressible Navier Stokes (CNS) equations in arbitrary complex domains. A PDE multidimensional extrapolation approach is used to reconstruct the solution in the ghost fluid regions and imposing boundary conditions on the fluid-solid interface, coupled with a multi-dimensional algebraic interpolation for freshly cleared cells. The CNS equations are numerically solved by the second order multidimensional upwind method. Block-structured adaptive mesh refinement, implemented with the Chombo framework, is utilized to reduce the computational cost while keeping high resolution mesh around the embedded boundary and regions of high gradient solutions. The versatility of the method is demonstrated via several numerical examples, in both static and moving geometry, ranging from low Mach number nearly incompressible flows to supersonic flows. Our simulation results are extensively verified against other numerical results and validated against available experimental results where applicable. The significance and advantages of our implementation, which revolve around balancing between the solution accuracy and implementation difficulties, are briefly discussed as well.

Digital relief generation from 3D models

NASA Astrophysics Data System (ADS)

Wang, Meili; Sun, Yu; Zhang, Hongming; Qian, Kun; Chang, Jian; He, Dongjian

2016-09-01

It is difficult to extend image-based relief generation to high-relief generation, as the images contain insufficient height information. To generate reliefs from three-dimensional (3D) models, it is necessary to extract the height fields from the model, but this can only generate bas-reliefs. To overcome this problem, an efficient method is proposed to generate bas-reliefs and high-reliefs directly from 3D meshes. To produce relief features that are visually appropriate, the 3D meshes are first scaled. 3D unsharp masking is used to enhance the visual features in the 3D mesh, and average smoothing and Laplacian smoothing are implemented to achieve better smoothing results. A nonlinear variable scaling scheme is then employed to generate the final bas-reliefs and high-reliefs. Using the proposed method, relief models can be generated from arbitrary viewing positions with different gestures and combinations of multiple 3D models. The generated relief models can be printed by 3D printers. The proposed method provides a means of generating both high-reliefs and bas-reliefs in an efficient and effective way under the appropriate scaling factors.

Efficient low-bit-rate adaptive mesh-based motion compensation technique

NASA Astrophysics Data System (ADS)

Mahmoud, Hanan A.; Bayoumi, Magdy A.

2001-08-01

This paper proposes a two-stage global motion estimation method using a novel quadtree block-based motion estimation technique and an active mesh model. In the first stage, motion parameters are estimated by fitting block-based motion vectors computed using a new efficient quadtree technique, that divides a frame into equilateral triangle blocks using the quad-tree structure. Arbitrary partition shapes are achieved by allowing 4-to-1, 3-to-1 and 2-1 merge/combine of sibling blocks having the same motion vector . In the second stage, the mesh is constructed using an adaptive triangulation procedure that places more triangles over areas with high motion content, these areas are estimated during the first stage. finally the motion compensation is achieved by using a novel algorithm that is carried by both the encoder and the decoder to determine the optimal triangulation of the resultant partitions followed by affine mapping at the encoder. Computer simulation results show that the proposed method gives better performance that the conventional ones in terms of the peak signal-to-noise ration (PSNR) and the compression ratio (CR).

Performance evaluation of multi-channel wireless mesh networks with embedded systems.

PubMed

Lam, Jun Huy; Lee, Sang-Gon; Tan, Whye Kit

2012-01-01

Many commercial wireless mesh network (WMN) products are available in the marketplace with their own proprietary standards, but interoperability among the different vendors is not possible. Open source communities have their own WMN implementation in accordance with the IEEE 802.11s draft standard, Linux open80211s project and FreeBSD WMN implementation. While some studies have focused on the test bed of WMNs based on the open80211s project, none are based on the FreeBSD. In this paper, we built an embedded system using the FreeBSD WMN implementation that utilizes two channels and evaluated its performance. This implementation allows the legacy system to connect to the WMN independent of the type of platform and distributes the load between the two non-overlapping channels. One channel is used for the backhaul connection and the other one is used to connect to the stations to wireless mesh network. By using the power efficient 802.11 technology, this device can also be used as a gateway for the wireless sensor network (WSN).

Watermarking on 3D mesh based on spherical wavelet transform.

PubMed

Jin, Jian-Qiu; Dai, Min-Ya; Bao, Hu-Jun; Peng, Qun-Sheng

2004-03-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.

Interface projection techniques for fluid-structure interaction modeling with moving-mesh methods

NASA Astrophysics Data System (ADS)

Tezduyar, Tayfun E.; Sathe, Sunil; Pausewang, Jason; Schwaab, Matthew; Christopher, Jason; Crabtree, Jason

2008-12-01

The stabilized space-time fluid-structure interaction (SSTFSI) technique developed by the Team for Advanced Flow Simulation and Modeling (T★AFSM) was applied to a number of 3D examples, including arterial fluid mechanics and parachute aerodynamics. Here we focus on the interface projection techniques that were developed as supplementary methods targeting the computational challenges associated with the geometric complexities of the fluid-structure interface. Although these supplementary techniques were developed in conjunction with the SSTFSI method and in the context of air-fabric interactions, they can also be used in conjunction with other moving-mesh methods, such as the Arbitrary Lagrangian-Eulerian (ALE) method, and in the context of other classes of FSI applications. The supplementary techniques currently consist of using split nodal values for pressure at the edges of the fabric and incompatible meshes at the air-fabric interfaces, the FSI Geometric Smoothing Technique (FSI-GST), and the Homogenized Modeling of Geometric Porosity (HMGP). Using split nodal values for pressure at the edges and incompatible meshes at the interfaces stabilizes the structural response at the edges of the membrane used in modeling the fabric. With the FSI-GST, the fluid mechanics mesh is sheltered from the consequences of the geometric complexity of the structure. With the HMGP, we bypass the intractable complexities of the geometric porosity by approximating it with an “equivalent”, locally-varying fabric porosity. As test cases demonstrating how the interface projection techniques work, we compute the air-fabric interactions of windsocks, sails and ringsail parachutes.

MAGNA (Materially and Geometrically Nonlinear Analysis). Part II. Preprocessor Manual.

DTIC Science & Technology

1982-12-01

AGRID can accept a virtually arbitrary collection of point coor- dinates which lie on a surface of interest, and generate a regular grid of mesh points...in the form of a collection of such patches to be translated into an assemblage of biquadratic surface elements (see Subsection 2.1, Figure 2.2...using IMPRESS can be converted for use with the present preprocessor by means of the IMPRINT translator. IMPRINT is a collection of conversion routines

Computing Gravitational Fields of Finite-Sized Bodies

NASA Technical Reports Server (NTRS)

Quadrelli, Marco

2005-01-01

A computer program utilizes the classical theory of gravitation, implemented by means of the finite-element method, to calculate the near gravitational fields of bodies of arbitrary size, shape, and mass distribution. The program was developed for application to a spacecraft and to floating proof masses and associated equipment carried by the spacecraft for detecting gravitational waves. The program can calculate steady or time-dependent gravitational forces, moments, and gradients thereof. Bodies external to a proof mass can be moving around the proof mass and/or deformed under thermoelastic loads. An arbitrarily shaped proof mass is represented by a collection of parallelepiped elements. The gravitational force and moment acting on each parallelepiped element of a proof mass, including those attributable to the self-gravitational field of the proof mass, are computed exactly from the closed-form equation for the gravitational potential of a parallelepiped. The gravitational field of an arbitrary distribution of mass external to a proof mass can be calculated either by summing the fields of suitably many point masses or by higher-order Gauss-Legendre integration over all elements surrounding the proof mass that are part of a finite-element mesh. This computer program is compatible with more general finite-element codes, such as NASTRAN, because it is configured to read a generic input data file, containing the detailed description of the finiteelement mesh.

Advanced DPSM approach for modeling ultrasonic wave scattering in an arbitrary geometry

NASA Astrophysics Data System (ADS)

Yadav, Susheel K.; Banerjee, Sourav; Kundu, Tribikram

2011-04-01

Several techniques are used to diagnose structural damages. In the ultrasonic technique structures are tested by analyzing ultrasonic signals scattered by damages. The interpretation of these signals requires a good understanding of the interaction between ultrasonic waves and structures. Therefore, researchers need analytical or numerical techniques to have a clear understanding of the interaction between ultrasonic waves and structural damage. However, modeling of wave scattering phenomenon by conventional numerical techniques such as finite element method requires very fine mesh at high frequencies necessitating heavy computational power. Distributed point source method (DPSM) is a newly developed robust mesh free technique to simulate ultrasonic, electrostatic and electromagnetic fields. In most of the previous studies the DPSM technique has been applied to model two dimensional surface geometries and simple three dimensional scatterer geometries. It was difficult to perform the analysis for complex three dimensional geometries. This technique has been extended to model wave scattering in an arbitrary geometry. In this paper a channel section idealized as a thin solid plate with several rivet holes is formulated. The simulation has been carried out with and without cracks near the rivet holes. Further, a comparison study has been also carried out to characterize the crack. A computer code has been developed in C for modeling the ultrasonic field in a solid plate with and without cracks near the rivet holes.

An overlapped grid method for multigrid, finite volume/difference flow solvers: MaGGiE

NASA Technical Reports Server (NTRS)

Baysal, Oktay; Lessard, Victor R.

1990-01-01

The objective is to develop a domain decomposition method via overlapping/embedding the component grids, which is to be used by upwind, multi-grid, finite volume solution algorithms. A computer code, given the name MaGGiE (Multi-Geometry Grid Embedder) is developed to meet this objective. MaGGiE takes independently generated component grids as input, and automatically constructs the composite mesh and interpolation data, which can be used by the finite volume solution methods with or without multigrid convergence acceleration. Six demonstrative examples showing various aspects of the overlap technique are presented and discussed. These cases are used for developing the procedure for overlapping grids of different topologies, and to evaluate the grid connection and interpolation data for finite volume calculations on a composite mesh. Time fluxes are transferred between mesh interfaces using a trilinear interpolation procedure. Conservation losses are minimal at the interfaces using this method. The multi-grid solution algorithm, using the coaser grid connections, improves the convergence time history as compared to the solution on composite mesh without multi-gridding.

An interpolation-free ALE scheme for unsteady inviscid flows computations with large boundary displacements over three-dimensional adaptive grids

NASA Astrophysics Data System (ADS)

Re, B.; Dobrzynski, C.; Guardone, A.

2017-07-01

A novel strategy to solve the finite volume discretization of the unsteady Euler equations within the Arbitrary Lagrangian-Eulerian framework over tetrahedral adaptive grids is proposed. The volume changes due to local mesh adaptation are treated as continuous deformations of the finite volumes and they are taken into account by adding fictitious numerical fluxes to the governing equation. This peculiar interpretation enables to avoid any explicit interpolation of the solution between different grids and to compute grid velocities so that the Geometric Conservation Law is automatically fulfilled also for connectivity changes. The solution on the new grid is obtained through standard ALE techniques, thus preserving the underlying scheme properties, such as conservativeness, stability and monotonicity. The adaptation procedure includes node insertion, node deletion, edge swapping and points relocation and it is exploited both to enhance grid quality after the boundary movement and to modify the grid spacing to increase solution accuracy. The presented approach is assessed by three-dimensional simulations of steady and unsteady flow fields. The capability of dealing with large boundary displacements is demonstrated by computing the flow around the translating infinite- and finite-span NACA 0012 wing moving through the domain at the flight speed. The proposed adaptive scheme is applied also to the simulation of a pitching infinite-span wing, where the bi-dimensional character of the flow is well reproduced despite the three-dimensional unstructured grid. Finally, the scheme is exploited in a piston-induced shock-tube problem to take into account simultaneously the large deformation of the domain and the shock wave. In all tests, mesh adaptation plays a crucial role.

Hierarchical Material Properties in Finite Element Analysis: The Oilfield Infrastructure Problem.

NASA Astrophysics Data System (ADS)

Weiss, C. J.; Wilson, G. A.

2017-12-01

Geophysical simulation of low-frequency electromagnetic signals within built environments such as urban centers and industrial landscapes facilities is a challenging computational problem because strong conductors (e.g., pipes, fences, rail lines, rebar, etc.) are not only highly conductive and/or magnetic relative to the surrounding geology, but they are very small in one or more of their physical length coordinates. Realistic modeling of such structures as idealized conductors has long been the standard approach; however this strategy carries with it computational burdens such as cumbersome implementation of internal boundary conditions, and limited flexibility for accommodating realistic geometries. Another standard approach is "brute force" discretization (often coupled with an equivalent medium model) whereby 100's of millions of voxels are used to represent these strong conductors, but at the cost of extreme computation times (and mesh design) for a simulation result when possible. To minimize these burdens, a new finite element scheme (Weiss, Geophysics, 2017) has been developed in which the material properties reside on a hierarchy of geometric simplicies (i.e., edges, facets and volumes) within an unstructured tetrahedral mesh. This allows thin sheet—like structures, such as subsurface fractures, to be economically represented by a connected set of triangular facets, for example, that freely conform to arbitrary "real world" geometries. The same holds thin pipe/wire-like structures, such as casings or pipelines. The hierarchical finite element scheme has been applied to problems in electro- and magnetostatics for oilfield problems where the elevated, but finite, conductivity and permeability of the steel-cased oil wells must be properly accounted for, yielding results that are otherwise unobtainable, with run times as low as a few 10s of seconds. Extension of the hierarchical finite element concept to broadband electromagnetics is presently underway, as are its implications for geophysical inversion.

Acoustic emission source location in composite structure by Voronoi construction using geodesic curve evolution.

PubMed

Gangadharan, R; Prasanna, G; Bhat, M R; Murthy, C R L; Gopalakrishnan, S

2009-11-01

Conventional analytical/numerical methods employing triangulation technique are suitable for locating acoustic emission (AE) source in a planar structure without structural discontinuities. But these methods cannot be extended to structures with complicated geometry, and, also, the problem gets compounded if the material of the structure is anisotropic warranting complex analytical velocity models. A geodesic approach using Voronoi construction is proposed in this work to locate the AE source in a composite structure. The approach is based on the fact that the wave takes minimum energy path to travel from the source to any other point in the connected domain. The geodesics are computed on the meshed surface of the structure using graph theory based on Dijkstra's algorithm. By propagating the waves in reverse virtually from these sensors along the geodesic path and by locating the first intersection point of these waves, one can get the AE source location. In this work, the geodesic approach is shown more suitable for a practicable source location solution in a composite structure with arbitrary surface containing finite discontinuities. Experiments have been conducted on composite plate specimens of simple and complex geometry to validate this method.

MOAB : a mesh-oriented database.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tautges, Timothy James; Ernst, Corey; Stimpson, Clint

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 storemore » 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-specific data. For example, sets and tags can be used together to describe geometric topology, boundary condition, and inter-processor interface groupings in a mesh. MOAB is used in several ways in various applications. MOAB serves as the underlying mesh data representation in the VERDE mesh verification code. MOAB can also be used as a mesh input mechanism, using mesh readers included with MOAB, or as a translator between mesh formats, using readers and writers included with MOAB. The remainder of this report is organized as follows. Section 2, 'Getting Started', provides a few simple examples of using MOAB to perform simple tasks on a mesh. Section 3 discusses the MOAB data model in more detail, including some aspects of the implementation. Section 4 summarizes the MOAB function API. Section 5 describes some of the tools included with MOAB, and the implementation of mesh readers/writers for MOAB. Section 6 contains a brief description of MOAB's relation to the TSTT mesh interface. Section 7 gives a conclusion and future plans for MOAB development. Section 8 gives references cited in this report. A reference description of the full MOAB API is contained in Section 9.« less

Link failure detection in a parallel computer

DOEpatents

Archer, Charles J.; Blocksome, Michael A.; Megerian, Mark G.; Smith, Brian E.

2010-11-09

Methods, apparatus, and products are disclosed for link failure detection in a parallel computer including compute nodes connected in a rectangular mesh network, each pair of adjacent compute nodes in the rectangular mesh network connected together using a pair of links, that includes: assigning each compute node to either a first group or a second group such that adjacent compute nodes in the rectangular mesh network are assigned to different groups; sending, by each of the compute nodes assigned to the first group, a first test message to each adjacent compute node assigned to the second group; determining, by each of the compute nodes assigned to the second group, whether the first test message was received from each adjacent compute node assigned to the first group; and notifying a user, by each of the compute nodes assigned to the second group, whether the first test message was received.

Syringe Injectable Electronics: Precise Targeted Delivery with Quantitative Input/Output Connectivity.

PubMed

Hong, Guosong; Fu, Tian-Ming; Zhou, Tao; Schuhmann, Thomas G; Huang, Jinlin; Lieber, Charles M

2015-10-14

Syringe-injectable mesh electronics with tissue-like mechanical properties and open macroporous structures is an emerging powerful paradigm for mapping and modulating brain activity. Indeed, the ultraflexible macroporous structure has exhibited unprecedented minimal/noninvasiveness and the promotion of attractive interactions with neurons in chronic studies. These same structural features also pose new challenges and opportunities for precise targeted delivery in specific brain regions and quantitative input/output (I/O) connectivity needed for reliable electrical measurements. Here, we describe new results that address in a flexible manner both of these points. First, we have developed a controlled injection approach that maintains the extended mesh structure during the "blind" injection process, while also achieving targeted delivery with ca. 20 μm spatial precision. Optical and microcomputed tomography results from injections into tissue-like hydrogel, ex vivo brain tissue, and in vivo brains validate our basic approach and demonstrate its generality. Second, we present a general strategy to achieve up to 100% multichannel I/O connectivity using an automated conductive ink printing methodology to connect the mesh electronics and a flexible flat cable, which serves as the standard "plug-in" interface to measurement electronics. Studies of resistance versus printed line width were used to identify optimal conditions, and moreover, frequency-dependent noise measurements show that the flexible printing process yields values comparable to commercial flip-chip bonding technology. Our results address two key challenges faced by syringe-injectable electronics and thereby pave the way for facile in vivo applications of injectable mesh electronics as a general and powerful tool for long-term mapping and modulation of brain activity in fundamental neuroscience through therapeutic biomedical studies.

Analysis of Modeling Parameters on Threaded Screws.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vigil, Miquela S.; Brake, Matthew Robert; Vangoethem, Douglas

2015-06-01

Assembled mechanical systems often contain a large number of bolted connections. These bolted connections (joints) are integral aspects of the load path for structural dynamics, and, consequently, are paramount for calculating a structure's stiffness and energy dissipation prop- erties. However, analysts have not found the optimal method to model appropriately these bolted joints. The complexity of the screw geometry cause issues when generating a mesh of the model. This paper will explore different approaches to model a screw-substrate connec- tion. Model parameters such as mesh continuity, node alignment, wedge angles, and thread to body element size ratios are examined. Themore » results of this study will give analysts a better understanding of the influences of these parameters and will aide in finding the optimal method to model bolted connections.« less

Pellet Cladding Mechanical Interaction Modeling Using the Extended Finite Element Method

DOE Office of Scientific and Technical Information (OSTI.GOV)

Spencer, Benjamin W.; Jiang, Wen; Dolbow, John E.

As a brittle material, the ceramic UO2 used as light water reactor fuel experiences significant fracturing throughout its life, beginning with the first rise to power of fresh fuel. This has multiple effects on the thermal and mechanical response of the fuel/cladding system. One such effect that is particularly important is that when there is mechanical contact between the fuel and cladding, cracks that extending from the outer surface of the fuel into the volume of the fuel cause elevated stresses in the adjacent cladding, which can potentially lead to cladding failure. Modeling the thermal and mechanical response of themore » cladding in the vicinity of these surface-breaking cracks in the fuel can provide important insights into this behavior to help avoid operating conditions that could lead to cladding failure. Such modeling has traditionally been done in the context of finite-element-based fuel performance analysis by modifying the fuel mesh to introduce discrete cracks. While this approach is effective in capturing the important behavior at the fuel/cladding interface, there are multiple drawbacks to explicitly incorporating the cracks in the finite element mesh. Because the cracks are incorporated in the original mesh, the mesh must be modified for cracks of specified location and depth, so it is difficult to account for crack propagation and the formation of new cracks at other locations. The extended finite element method (XFEM) has emerged in recent years as a powerful method to represent arbitrary, evolving, discrete discontinuities within the context of the finite element method. Development work is underway by the authors to implement XFEM in the BISON fuel performance code, and this capability has previously been demonstrated in simulations of fracture propagation in ceramic nuclear fuel. These preliminary demonstrations have included only the fuel, and excluded the cladding for simplicity. This paper presents initial results of efforts to apply XFEM to model stress concentrations induced by fuel fractures at the fuel/cladding interface during pellet cladding mechanical interaction (PCMI). This is accomplished by enhancing the thermal and mechanical contact enforcement algorithms employed by BISON to permit their use in conjunction with XFEM. The results from this methodology are demonstrated to be equivalent to those from using meshed discrete cracks. While the results of the two methods are equivalent for the case of a stationary crack, it is demonstrated that XFEM provides the additional flexibility of allowing arbitrary crack initiation and propagation during the analysis, and minimizes model setup effort for cases with stationary cracks.« less

Model Checking a Self-Stabilizing Distributed Clock Synchronization Protocol for Arbitrary Digraphs

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R.

2011-01-01

This report presents the mechanical verification of a self-stabilizing distributed clock synchronization protocol for arbitrary digraphs in the absence of faults. This protocol does not rely on assumptions about the initial state of the system, other than the presence of at least one node, and no central clock or a centrally generated signal, pulse, or message is used. The system under study is an arbitrary, non-partitioned digraph ranging from fully connected to 1-connected networks of nodes while allowing for differences in the network elements. Nodes are anonymous, i.e., they do not have unique identities. There is no theoretical limit on the maximum number of participating nodes. The only constraint on the behavior of the node is that the interactions with other nodes are restricted to defined links and interfaces. This protocol deterministically converges within a time bound that is a linear function of the self-stabilization period.

The anatomy of floating shock fitting. [shock waves computation for flow field

NASA Technical Reports Server (NTRS)

Salas, M. D.

1975-01-01

The floating shock fitting technique is examined. Second-order difference formulas are developed for the computation of discontinuities. A procedure is developed to compute mesh points that are crossed by discontinuities. The technique is applied to the calculation of internal two-dimensional flows with arbitrary number of shock waves and contact surfaces. A new procedure, based on the coalescence of characteristics, is developed to detect the formation of shock waves. Results are presented to validate and demonstrate the versatility of the technique.

A general gridding, discretization, and coarsening methodology for modeling flow in porous formations with discrete geological features

NASA Astrophysics Data System (ADS)

Karimi-Fard, M.; Durlofsky, L. J.

2016-10-01

A comprehensive framework for modeling flow in porous media containing thin, discrete features, which could be high-permeability fractures or low-permeability deformation bands, is presented. The key steps of the methodology are mesh generation, fine-grid discretization, upscaling, and coarse-grid discretization. Our specialized gridding technique combines a set of intersecting triangulated surfaces by constructing approximate intersections using existing edges. This procedure creates a conforming mesh of all surfaces, which defines the internal boundaries for the volumetric mesh. The flow equations are discretized on this conforming fine mesh using an optimized two-point flux finite-volume approximation. The resulting discrete model is represented by a list of control-volumes with associated positions and pore-volumes, and a list of cell-to-cell connections with associated transmissibilities. Coarse models are then constructed by the aggregation of fine-grid cells, and the transmissibilities between adjacent coarse cells are obtained using flow-based upscaling procedures. Through appropriate computation of fracture-matrix transmissibilities, a dual-continuum representation is obtained on the coarse scale in regions with connected fracture networks. The fine and coarse discrete models generated within the framework are compatible with any connectivity-based simulator. The applicability of the methodology is illustrated for several two- and three-dimensional examples. In particular, we consider gas production from naturally fractured low-permeability formations, and transport through complex fracture networks. In all cases, highly accurate solutions are obtained with significant model reduction.

A hybridized discontinuous Galerkin framework for high-order particle-mesh operator splitting of the incompressible Navier-Stokes equations

NASA Astrophysics Data System (ADS)

Maljaars, Jakob M.; Labeur, Robert Jan; Möller, Matthias

2018-04-01

A generic particle-mesh method using a hybridized discontinuous Galerkin (HDG) framework is presented and validated for the solution of the incompressible Navier-Stokes equations. Building upon particle-in-cell concepts, the method is formulated in terms of an operator splitting technique in which Lagrangian particles are used to discretize an advection operator, and an Eulerian mesh-based HDG method is employed for the constitutive modeling to account for the inter-particle interactions. Key to the method is the variational framework provided by the HDG method. This allows to formulate the projections between the Lagrangian particle space and the Eulerian finite element space in terms of local (i.e. cellwise) ℓ2-projections efficiently. Furthermore, exploiting the HDG framework for solving the constitutive equations results in velocity fields which excellently approach the incompressibility constraint in a local sense. By advecting the particles through these velocity fields, the particle distribution remains uniform over time, obviating the need for additional quality control. The presented methodology allows for a straightforward extension to arbitrary-order spatial accuracy on general meshes. A range of numerical examples shows that optimal convergence rates are obtained in space and, given the particular time stepping strategy, second-order accuracy is obtained in time. The model capabilities are further demonstrated by presenting results for the flow over a backward facing step and for the flow around a cylinder.

Establishing mesh topology in multi-material cells: enabling technology for robust and accurate multi-material simulations

DOE PAGES

Kikinzon, Evgeny; Shashkov, Mikhail Jurievich; Garimella, Rao Veerabhadra

2018-05-29

Real world problems are typically multi-material, combining materials such as gases, liquids and solids that have very different properties. The material interfaces may be fixed in time or can be a part of the solution, as in fluid-structure interactions or air-water dynamics, and therefore move and change shape. In such problems the computational mesh may be non-conformal to interfaces due to complexity of these interfaces, presence of small fractions of materials, or because the mesh does not move with the flow, as in the arbitrary Lagrangian–Eulerian (ALE) methods. In order to solve problems of interest on such meshes, interface reconstructionmore » methods are usually used to recover an approximation of material regions within the cells. For a cell intersecting multiple material regions, these approximations of contained subregions can be considered as single-material subcells in a local mesh that we call a minimesh. In this paper, we discuss some of the requirements that discretization methods have on topological information in the resulting hierarchical meshes and present an approach that allows incorporating the buildup of sufficiently detailed topology into the nested dissections based PLIC-type reconstruction algorithms (e.g. Volume-of-Fluid, Moment-of-Fluid) in an efficient and robust manner. Specifically, we describe the X-MOF interface reconstruction algorithm in 2D, which extends the Moment-Of-Fluid (MOF) method to include the topology of minimeshes created inside of multi-material cells and parent-child relations between corresponding mesh entities on different hierarchy levels. X-MOF retains the property of being local to a cell and not requiring external communication, which makes it suitable for massively parallel applications. Here, we demonstrate some scaling results for the X-MOF implementation in Tangram, a modern interface reconstruction framework for exascale computing.« less

Quinoa - Adaptive Computational Fluid Dynamics, 0.2

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bakosi, Jozsef; Gonzalez, Francisco; Rogers, Brandon

Quinoa is a set of computational tools that enables research and numerical analysis in fluid dynamics. At this time it remains a test-bed to experiment with various algorithms using fully asynchronous runtime systems. Currently, Quinoa consists of the following tools: (1) Walker, a numerical integrator for systems of stochastic differential equations in time. It is a mathematical tool to analyze and design the behavior of stochastic differential equations. It allows the estimation of arbitrary coupled statistics and probability density functions and is currently used for the design of statistical moment approximations for multiple mixing materials in variable-density turbulence. (2) Inciter,more » an overdecomposition-aware finite element field solver for partial differential equations using 3D unstructured grids. Inciter is used to research asynchronous mesh-based algorithms and to experiment with coupling asynchronous to bulk-synchronous parallel code. Two planned new features of Inciter, compared to the previous release (LA-CC-16-015), to be implemented in 2017, are (a) a simple Navier-Stokes solver for ideal single-material compressible gases, and (b) solution-adaptive mesh refinement (AMR), which enables dynamically concentrating compute resources to regions with interesting physics. Using the NS-AMR problem we plan to explore how to scale such high-load-imbalance simulations, representative of large production multiphysics codes, to very large problems on very large computers using an asynchronous runtime system. (3) RNGTest, a test harness to subject random number generators to stringent statistical tests enabling quantitative ranking with respect to their quality and computational cost. (4) UnitTest, a unit test harness, running hundreds of tests per second, capable of testing serial, synchronous, and asynchronous functions. (5) MeshConv, a mesh file converter that can be used to convert 3D tetrahedron meshes from and to either of the following formats: Gmsh, (http://www.geuz.org/gmsh), Netgen, (http://sourceforge.net/apps/mediawiki/netgen-mesher), ExodusII, (http://sourceforge.net/projects/exodusii), HyperMesh, (http://www.altairhyperworks.com/product/HyperMesh).« less

Establishing mesh topology in multi-material cells: enabling technology for robust and accurate multi-material simulations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kikinzon, Evgeny; Shashkov, Mikhail Jurievich; Garimella, Rao Veerabhadra

Real world problems are typically multi-material, combining materials such as gases, liquids and solids that have very different properties. The material interfaces may be fixed in time or can be a part of the solution, as in fluid-structure interactions or air-water dynamics, and therefore move and change shape. In such problems the computational mesh may be non-conformal to interfaces due to complexity of these interfaces, presence of small fractions of materials, or because the mesh does not move with the flow, as in the arbitrary Lagrangian–Eulerian (ALE) methods. In order to solve problems of interest on such meshes, interface reconstructionmore » methods are usually used to recover an approximation of material regions within the cells. For a cell intersecting multiple material regions, these approximations of contained subregions can be considered as single-material subcells in a local mesh that we call a minimesh. In this paper, we discuss some of the requirements that discretization methods have on topological information in the resulting hierarchical meshes and present an approach that allows incorporating the buildup of sufficiently detailed topology into the nested dissections based PLIC-type reconstruction algorithms (e.g. Volume-of-Fluid, Moment-of-Fluid) in an efficient and robust manner. Specifically, we describe the X-MOF interface reconstruction algorithm in 2D, which extends the Moment-Of-Fluid (MOF) method to include the topology of minimeshes created inside of multi-material cells and parent-child relations between corresponding mesh entities on different hierarchy levels. X-MOF retains the property of being local to a cell and not requiring external communication, which makes it suitable for massively parallel applications. Here, we demonstrate some scaling results for the X-MOF implementation in Tangram, a modern interface reconstruction framework for exascale computing.« less

Identifying Blocks Formed by Curbed Fractures Using Exact Arithmetic

NASA Astrophysics Data System (ADS)

Zheng, Y.; Xia, L.; Yu, Q.; Zhang, X.

2015-12-01

Identifying blocks formed by fractures is important in rock engineering. Most studies assume the fractures to be perfect planar whereas curved fractures are rarely considered. However, large fractures observed in the field are often curved. This paper presents a new method for identifying rock blocks formed by both curved and planar fractures based on the element-block-assembling approach. The curved and planar fractures are represented as triangle meshes and planar discs, respectively. In the beginning of the identification method, the intersection segments between different triangle meshes are calculated and the intersected triangles are re-meshed to construct a piecewise linear complex (PLC). Then, the modeling domain is divided into tetrahedral subdomains under the constraint of the PLC and these subdomains are further decomposed into element blocks by extended planar fractures. Finally, the element blocks are combined and the subdomains are assembled to form complex blocks. The combination of two subdomains is skipped if and only if the common facet lies on a curved fracture. In this study, the exact arithmetic is used to handle the computational errors, which may threat the robustness of the block identification program when the degenerated cases are encountered. Specifically, a real number is represented as the ratio between two integers and the basic arithmetic such as addition, subtraction, multiplication and division between different real numbers can be performed exactly if an arbitrary precision integer package is used. In this way, the exact construction of blocks can be achieved without introducing computational errors. Several analytical examples are given in this paper and the results show effectiveness of this method in handling arbitrary shaped blocks. Moreover, there is no limitation on the number of blocks in a block system. The results also show (suggest) that the degenerated cases can be handled without affecting the robustness of the identification program.

Research on bulbous bow optimization based on the improved PSO algorithm

NASA Astrophysics Data System (ADS)

Zhang, Sheng-long; Zhang, Bao-ji; Tezdogan, Tahsin; Xu, Le-ping; Lai, Yu-yang

2017-08-01

In order to reduce the total resistance of a hull, an optimization framework for the bulbous bow optimization was presented. The total resistance in calm water was selected as the objective function, and the overset mesh technique was used for mesh generation. RANS method was used to calculate the total resistance of the hull. In order to improve the efficiency and smoothness of the geometric reconstruction, the arbitrary shape deformation (ASD) technique was introduced to change the shape of the bulbous bow. To improve the global search ability of the particle swarm optimization (PSO) algorithm, an improved particle swarm optimization (IPSO) algorithm was proposed to set up the optimization model. After a series of optimization analyses, the optimal hull form was found. It can be concluded that the simulation based design framework built in this paper is a promising method for bulbous bow optimization.

The DANTE Boltzmann transport solver: An unstructured mesh, 3-D, spherical harmonics algorithm compatible with parallel computer architectures

DOE Office of Scientific and Technical Information (OSTI.GOV)

McGhee, J.M.; Roberts, R.M.; Morel, J.E.

1997-06-01

A spherical harmonics research code (DANTE) has been developed which is compatible with parallel computer architectures. DANTE provides 3-D, multi-material, deterministic, transport capabilities using an arbitrary finite element mesh. The linearized Boltzmann transport equation is solved in a second order self-adjoint form utilizing a Galerkin finite element spatial differencing scheme. The core solver utilizes a preconditioned conjugate gradient algorithm. Other distinguishing features of the code include options for discrete-ordinates and simplified spherical harmonics angular differencing, an exact Marshak boundary treatment for arbitrarily oriented boundary faces, in-line matrix construction techniques to minimize memory consumption, and an effective diffusion based preconditioner formore » scattering dominated problems. Algorithm efficiency is demonstrated for a massively parallel SIMD architecture (CM-5), and compatibility with MPP multiprocessor platforms or workstation clusters is anticipated.« less

Numerical integration of discontinuous functions: moment fitting and smart octree

NASA Astrophysics Data System (ADS)

Hubrich, Simeon; Di Stolfo, Paolo; Kudela, László; Kollmannsberger, Stefan; Rank, Ernst; Schröder, Andreas; Düster, Alexander

2017-11-01

A fast and simple grid generation can be achieved by non-standard discretization methods where the mesh does not conform to the boundary or the internal interfaces of the problem. However, this simplification leads to discontinuous integrands for intersected elements and, therefore, standard quadrature rules do not perform well anymore. Consequently, special methods are required for the numerical integration. To this end, we present two approaches to obtain quadrature rules for arbitrary domains. The first approach is based on an extension of the moment fitting method combined with an optimization strategy for the position and weights of the quadrature points. In the second approach, we apply the smart octree, which generates curved sub-cells for the integration mesh. To demonstrate the performance of the proposed methods, we consider several numerical examples, showing that the methods lead to efficient quadrature rules, resulting in less integration points and in high accuracy.

Numerical techniques for the solution of the compressible Navier-Stokes equations and implementation of turbulence models. [separated turbulent boundary layer flow problems

NASA Technical Reports Server (NTRS)

Baldwin, B. S.; Maccormack, R. W.; Deiwert, G. S.

1975-01-01

The time-splitting explicit numerical method of MacCormack is applied to separated turbulent boundary layer flow problems. Modifications of this basic method are developed to counter difficulties associated with complicated geometry and severe numerical resolution requirements of turbulence model equations. The accuracy of solutions is investigated by comparison with exact solutions for several simple cases. Procedures are developed for modifying the basic method to improve the accuracy. Numerical solutions of high-Reynolds-number separated flows over an airfoil and shock-separated flows over a flat plate are obtained. A simple mixing length model of turbulence is used for the transonic flow past an airfoil. A nonorthogonal mesh of arbitrary configuration facilitates the description of the flow field. For the simpler geometry associated with the flat plate, a rectangular mesh is used, and solutions are obtained based on a two-equation differential model of turbulence.

Speed-up of the volumetric method of moments for the approximate RCS of large arbitrary-shaped dielectric targets

NASA Astrophysics Data System (ADS)

Moreno, Javier; Somolinos, Álvaro; Romero, Gustavo; González, Iván; Cátedra, Felipe

2017-08-01

A method for the rigorous computation of the electromagnetic scattering of large dielectric volumes is presented. One goal is to simplify the analysis of large dielectric targets with translational symmetries taken advantage of their Toeplitz symmetry. Then, the matrix-fill stage of the Method of Moments is efficiently obtained because the number of coupling terms to compute is reduced. The Multilevel Fast Multipole Method is applied to solve the problem. Structured meshes are obtained efficiently to approximate the dielectric volumes. The regular mesh grid is achieved by using parallelepipeds whose centres have been identified as internal to the target. The ray casting algorithm is used to classify the parallelepiped centres. It may become a bottleneck when too many points are evaluated in volumes defined by parametric surfaces, so a hierarchical algorithm is proposed to minimize the number of evaluations. Measurements and analytical results are included for validation purposes.

A Cartesian grid approach with hierarchical refinement for compressible flows

NASA Technical Reports Server (NTRS)

Quirk, James J.

1994-01-01

Many numerical studies of flows that involve complex geometries are limited by the difficulties in generating suitable grids. We present a Cartesian boundary scheme for two-dimensional, compressible flows that is unfettered by the need to generate a computational grid and so it may be used, routinely, even for the most awkward of geometries. In essence, an arbitrary-shaped body is allowed to blank out some region of a background Cartesian mesh and the resultant cut-cells are singled out for special treatment. This is done within a finite-volume framework and so, in principle, any explicit flux-based integration scheme can take advantage of this method for enforcing solid boundary conditions. For best effect, the present Cartesian boundary scheme has been combined with a sophisticated, local mesh refinement scheme, and a number of examples are shown in order to demonstrate the efficacy of the combined algorithm for simulations of shock interaction phenomena.

Tempest: Mesoscale test case suite results and the effect of order-of-accuracy on pressure gradient force errors

NASA Astrophysics Data System (ADS)

Guerra, J. E.; Ullrich, P. A.

2014-12-01

Tempest is a new non-hydrostatic atmospheric modeling framework that allows for investigation and intercomparison of high-order numerical methods. It is composed of a dynamical core based on a finite-element formulation of arbitrary order operating on cubed-sphere and Cartesian meshes with topography. The underlying technology is briefly discussed, including a novel Hybrid Finite Element Method (HFEM) vertical coordinate coupled with high-order Implicit/Explicit (IMEX) time integration to control vertically propagating sound waves. Here, we show results from a suite of Mesoscale testing cases from the literature that demonstrate the accuracy, performance, and properties of Tempest on regular Cartesian meshes. The test cases include wave propagation behavior, Kelvin-Helmholtz instabilities, and flow interaction with topography. Comparisons are made to existing results highlighting improvements made in resolving atmospheric dynamics in the vertical direction where many existing methods are deficient.

Seismic waves in heterogeneous material: subcell resolution of the discontinuous Galerkin method

NASA Astrophysics Data System (ADS)

Castro, Cristóbal E.; Käser, Martin; Brietzke, Gilbert B.

2010-07-01

We present an important extension of the arbitrary high-order discontinuous Galerkin (DG) finite-element method to model 2-D elastic wave propagation in highly heterogeneous material. In this new approach we include space-variable coefficients to describe smooth or discontinuous material variations inside each element using the same numerical approximation strategy as for the velocity-stress variables in the formulation of the elastic wave equation. The combination of the DG method with a time integration scheme based on the solution of arbitrary accuracy derivatives Riemann problems still provides an explicit, one-step scheme which achieves arbitrary high-order accuracy in space and time. Compared to previous formulations the new scheme contains two additional terms in the form of volume integrals. We show that the increasing computational cost per element can be overcompensated due to the improved material representation inside each element as coarser meshes can be used which reduces the total number of elements and therefore computational time to reach a desired error level. We confirm the accuracy of the proposed scheme performing convergence tests and several numerical experiments considering smooth and highly heterogeneous material. As the approximation of the velocity and stress variables in the wave equation and of the material properties in the model can be chosen independently, we investigate the influence of the polynomial material representation on the accuracy of the synthetic seismograms with respect to computational cost. Moreover, we study the behaviour of the new method on strong material discontinuities, in the case where the mesh is not aligned with such a material interface. In this case second-order linear material approximation seems to be the best choice, with higher-order intra-cell approximation leading to potential instable behaviour. For all test cases we validate our solution against the well-established standard fourth-order finite difference and spectral element method.

The arbitrary order mimetic finite difference method for a diffusion equation with a non-symmetric diffusion tensor

NASA Astrophysics Data System (ADS)

Gyrya, V.; Lipnikov, K.

2017-11-01

We present the arbitrary order mimetic finite difference (MFD) discretization for the diffusion equation with non-symmetric tensorial diffusion coefficient in a mixed formulation on general polygonal meshes. The diffusion tensor is assumed to be positive definite. The asymmetry of the diffusion tensor requires changes to the standard MFD construction. We present new approach for the construction that guarantees positive definiteness of the non-symmetric mass matrix in the space of discrete velocities. The numerically observed convergence rate for the scalar quantity matches the predicted one in the case of the lowest order mimetic scheme. For higher orders schemes, we observed super-convergence by one order for the scalar variable which is consistent with the previously published result for a symmetric diffusion tensor. The new scheme was also tested on a time-dependent problem modeling the Hall effect in the resistive magnetohydrodynamics.

The arbitrary order mixed mimetic finite difference method for the diffusion equation

DOE PAGES

Gyrya, Vitaliy; Lipnikov, Konstantin; Manzini, Gianmarco

2016-05-01

Here, we propose an arbitrary-order accurate mimetic finite difference (MFD) method for the approximation of diffusion problems in mixed form on unstructured polygonal and polyhedral meshes. As usual in the mimetic numerical technology, the method satisfies local consistency and stability conditions, which determines the accuracy and the well-posedness of the resulting approximation. The method also requires the definition of a high-order discrete divergence operator that is the discrete analog of the divergence operator and is acting on the degrees of freedom. The new family of mimetic methods is proved theoretically to be convergent and optimal error estimates for flux andmore » scalar variable are derived from the convergence analysis. A numerical experiment confirms the high-order accuracy of the method in solving diffusion problems with variable diffusion tensor. It is worth mentioning that the approximation of the scalar variable presents a superconvergence effect.« less

The arbitrary order mimetic finite difference method for a diffusion equation with a non-symmetric diffusion tensor

DOE PAGES

Gyrya, V.; Lipnikov, K.

2017-07-18

Here, we present the arbitrary order mimetic finite difference (MFD) discretization for the diffusion equation with non-symmetric tensorial diffusion coefficient in a mixed formulation on general polygonal meshes. The diffusion tensor is assumed to be positive definite. The asymmetry of the diffusion tensor requires changes to the standard MFD construction. We also present new approach for the construction that guarantees positive definiteness of the non-symmetric mass matrix in the space of discrete velocities. The numerically observed convergence rate for the scalar quantity matches the predicted one in the case of the lowest order mimetic scheme. For higher orders schemes, wemore » observed super-convergence by one order for the scalar variable which is consistent with the previously published result for a symmetric diffusion tensor. The new scheme was also tested on a time-dependent problem modeling the Hall effect in the resistive magnetohydrodynamics.« less

The arbitrary order mimetic finite difference method for a diffusion equation with a non-symmetric diffusion tensor

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gyrya, V.; Lipnikov, K.

Here, we present the arbitrary order mimetic finite difference (MFD) discretization for the diffusion equation with non-symmetric tensorial diffusion coefficient in a mixed formulation on general polygonal meshes. The diffusion tensor is assumed to be positive definite. The asymmetry of the diffusion tensor requires changes to the standard MFD construction. We also present new approach for the construction that guarantees positive definiteness of the non-symmetric mass matrix in the space of discrete velocities. The numerically observed convergence rate for the scalar quantity matches the predicted one in the case of the lowest order mimetic scheme. For higher orders schemes, wemore » observed super-convergence by one order for the scalar variable which is consistent with the previously published result for a symmetric diffusion tensor. The new scheme was also tested on a time-dependent problem modeling the Hall effect in the resistive magnetohydrodynamics.« less

A Reconstructed Discontinuous Galerkin Method for the Compressible Navier-Stokes Equations on Arbitrary Grids

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hong Luo; Luqing Luo; Robert Nourgaliev

2010-09-01

A reconstruction-based discontinuous Galerkin (RDG) method is presented for the solution of the compressible Navier–Stokes equations on arbitrary grids. The RDG method, originally developed for the compressible Euler equations, is extended to discretize viscous and heat fluxes in the Navier–Stokes equations using a so-called inter-cell reconstruction, where a smooth solution is locally reconstructed using a least-squares method from the underlying discontinuous DG solution. Similar to the recovery-based DG (rDG) methods, this reconstructed DG method eliminates the introduction of ad hoc penalty or coupling terms commonly found in traditional DG methods. Unlike rDG methods, this RDG method does not need tomore » judiciously choose a proper form of a recovered polynomial, thus is simple, flexible, and robust, and can be used on arbitrary grids. The developed RDG method is used to compute a variety of flow problems on arbitrary meshes to demonstrate its accuracy, efficiency, robustness, and versatility. The numerical results indicate that this RDG method is able to deliver the same accuracy as the well-known Bassi–Rebay II scheme, at a half of its computing costs for the discretization of the viscous fluxes in the Navier–Stokes equations, clearly demonstrating its superior performance over the existing DG methods for solving the compressible Navier–Stokes equations.« less

A Reconstructed Discontinuous Galerkin Method for the Compressible Navier-Stokes Equations on Arbitrary Grids

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hong Luo; Luqing Luo; Robert Nourgaliev

2010-01-01

A reconstruction-based discontinuous Galerkin (RDG) method is presented for the solution of the compressible Navier-Stokes equations on arbitrary grids. The RDG method, originally developed for the compressible Euler equations, is extended to discretize viscous and heat fluxes in the Navier-Stokes equations using a so-called inter-cell reconstruction, where a smooth solution is locally reconstructed using a least-squares method from the underlying discontinuous DG solution. Similar to the recovery-based DG (rDG) methods, this reconstructed DG method eliminates the introduction of ad hoc penalty or coupling terms commonly found in traditional DG methods. Unlike rDG methods, this RDG method does not need tomore » judiciously choose a proper form of a recovered polynomial, thus is simple, flexible, and robust, and can be used on arbitrary grids. The developed RDG method is used to compute a variety of flow problems on arbitrary meshes to demonstrate its accuracy, efficiency, robustness, and versatility. The numerical results indicate that this RDG method is able to deliver the same accuracy as the well-known Bassi-Rebay II scheme, at a half of its computing costs for the discretization of the viscous fluxes in the Navier-Stokes equations, clearly demonstrating its superior performance over the existing DG methods for solving the compressible Navier-Stokes equations.« less

Intercluster Connection in Cognitive Wireless Mesh Networks Based on Intelligent Network Coding

NASA Astrophysics Data System (ADS)

Chen, Xianfu; Zhao, Zhifeng; Jiang, Tao; Grace, David; Zhang, Honggang

2009-12-01

Cognitive wireless mesh networks have great flexibility to improve spectrum resource utilization, within which secondary users (SUs) can opportunistically access the authorized frequency bands while being complying with the interference constraint as well as the QoS (Quality-of-Service) requirement of primary users (PUs). In this paper, we consider intercluster connection between the neighboring clusters under the framework of cognitive wireless mesh networks. Corresponding to the collocated clusters, data flow which includes the exchanging of control channel messages usually needs four time slots in traditional relaying schemes since all involved nodes operate in half-duplex mode, resulting in significant bandwidth efficiency loss. The situation is even worse at the gateway node connecting the two colocated clusters. A novel scheme based on network coding is proposed in this paper, which needs only two time slots to exchange the same amount of information mentioned above. Our simulation shows that the network coding-based intercluster connection has the advantage of higher bandwidth efficiency compared with the traditional strategy. Furthermore, how to choose an optimal relaying transmission power level at the gateway node in an environment of coexisting primary and secondary users is discussed. We present intelligent approaches based on reinforcement learning to solve the problem. Theoretical analysis and simulation results both show that the intelligent approaches can achieve optimal throughput for the intercluster relaying in the long run.

A Reduced Order Model of Force Displacement Curves for the Failure of Mechanical Bolts in Tension.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Moore, Keegan J.; Sandia National Lab.; Brake, Matthew Robert

2015-12-01

Assembled mechanical systems often contain a large number of bolted connections. These bolted connections (joints) are integral aspects of the load path for structural dynamics, and, consequently, are paramount for calculating a structure's stiffness and energy dissipation prop- erties. However, analysts have not found the optimal method to model appropriately these bolted joints. The complexity of the screw geometry causes issues when generating a mesh of the model. This report will explore different approaches to model a screw-substrate connec- tion. Model parameters such as mesh continuity, node alignment, wedge angles, and thread to body element size ratios are examined. Themore » results of this study will give analysts a better understanding of the influences of these parameters and will aide in finding the optimal method to model bolted connections.« less

A Numerical Investigation of Two-Different Drosophila Forward Flight Modes

NASA Astrophysics Data System (ADS)

Sahin, Mehmet; Dilek, Ezgi; Erzincanli, Belkis

2016-11-01

The parallel large-scale unstructured finite volume method based on an Arbitrary Lagrangian-Eulerian (ALE) formulation has been applied in order to investigate the near wake structure of Drosophila in forward flight. DISTENE MeshGems-Hexa algorithm based on the octree method is used to generate the all hexahedral mesh for the wing-body combination. The mesh deformation algorithm is based on the indirect radial basis function (RBF) method at each time level while avoiding remeshing in order to enhance numerical robustness. The large-scale numerical simulations are carried out for a flapping Drosophila in forward flight. In the first case, the wing tip-path plane is tilted forward to generate forward force. In the second case, paddling wing motion is used to generate the forward fore. The λ2-criterion proposed by Jeong and Hussain (1995) is used for investigating the time variation of the Eulerian coherent structures in the near wake. The present simulations reveal highly detailed near wake topology for a hovering Drosophila. This is very useful in terms of understanding physics in biological flights which can provide a very useful tool for designing bio-inspired MAVs.

An Energy- and Charge-conserving, Implicit, Electrostatic Particle-in-Cell Algorithm in curvilinear geometry

NASA Astrophysics Data System (ADS)

Chen, G.; Chacón, L.; Barnes, D. C.

2012-03-01

A recent proof-of-principle study proposes an energy- and charge-conserving, fully implicit particle-in-cell algorithm in one dimension [1], which is able to use timesteps comparable to the dynamical timescale of interest. Here, we generalize the method to employ non-uniform meshes via a curvilinear map. The key enabling technology is a hybrid particle pusher [2], with particle positions updated in logical space and particle velocities updated in physical space. The self-adaptive, charge-conserving particle mover of Ref. [1] is extended to the non-uniform mesh case. The fully implicit implementation, using a Jacobian-free Newton-Krylov iterative solver, remains exactly charge- and energy-conserving. The extension of the formulation to multiple dimensions will be discussed. We present numerical experiments of 1D electrostatic, long-timescale ion-acoustic wave and ion-acoustic shock wave simulations, demonstrating that charge and energy are conserved to round-off for arbitrary mesh non-uniformity, and that the total momentum remains well conserved.[4pt] [1] Chen, Chac'on, Barnes, J. Comput. Phys. 230 (2011). [0pt] [2] Camporeale and Delzanno, Bull. Am. Phys. Soc. 56(6) (2011); Wang, et al., J. Plasma Physics, 61 (1999).

DOE Office of Scientific and Technical Information (OSTI.GOV)

Duchaineau, M.; Wolinsky, M.; Sigeti, D.E.

Real-time terrain rendering for interactive visualization remains a demanding task. We present a novel algorithm with several advantages over previous methods: our method is unusually stingy with polygons yet achieves real-time performance and is scalable to arbitrary regions and resolutions. The method provides a continuous terrain mesh of specified triangle count having provably minimum error in restricted but reasonably general classes of permissible meshes and error metrics. Our method provides an elegant solution to guaranteeing certain elusive types of consistency in scenes produced by multiple scene generators which share a common finest-resolution database but which otherwise operate entirely independently. Thismore » consistency is achieved by exploiting the freedom of choice of error metric allowed by the algorithm to provide, for example, multiple exact lines-of-sight in real-time. Our methods rely on an off-line pre-processing phase to construct a multi-scale data structure consisting of triangular terrain approximations enhanced ({open_quotes}thickened{close_quotes}) with world-space error information. In real time, this error data is efficiently transformed into screen-space where it is used to guide a greedy top-down triangle subdivision algorithm which produces the desired minimal error continuous terrain mesh. Our algorithm has been implemented and it operates at real-time rates.« less

Momentum Advection on a Staggered Mesh

NASA Astrophysics Data System (ADS)

Benson, David J.

1992-05-01

Eulerian and ALE (arbitrary Lagrangian-Eulerian) hydrodynamics programs usually split a timestep into two parts. The first part is a Lagrangian step, which calculates the incremental motion of the material. The second part is referred to as the Eulerian step, the advection step, or the remap step, and it accounts for the transport of material between cells. In most finite difference and finite element formulations, all the solution variables except the velocities are cell-centered while the velocities are edge- or vertex-centered. As a result, the advection algorithm for the momentum is, by necessity, different than the algorithm used for the other variables. This paper reviews three momentum advection methods and proposes a new one. One method, pioneered in YAQUI, creates a new staggered mesh, while the other two, used in SALE and SHALE, are cell-centered. The new method is cell-centered and its relationship to the other methods is discussed. Both pure advection and strong shock calculations are presented to substantiate the mathematical analysis. From the standpoint of numerical accuracy, both the staggered mesh and the cell-centered algorithms can give good results, while the computational costs are highly dependent on the overall architecture of a code.

Discrete differential geometry: The nonplanar quadrilateral mesh

NASA Astrophysics Data System (ADS)

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.

Semi-regular remeshing based trust region spherical geometry image for 3D deformed mesh used MLWNN

NASA Astrophysics Data System (ADS)

Dhibi, Naziha; Elkefi, Akram; Bellil, Wajdi; Ben Amar, Chokri

2017-03-01

Triangular surface are now widely used for modeling three-dimensional object, since these models are very high resolution and the geometry of the mesh is often very dense, it is then necessary to remesh this object to reduce their complexity, the mesh quality (connectivity regularity) must be ameliorated. In this paper, we review the main methods of semi-regular remeshing of the state of the art, given the semi-regular remeshing is mainly relevant for wavelet-based compression, then we present our method for re-meshing based trust region spherical geometry image to have good scheme of 3d mesh compression used to deform 3D meh based on Multi library Wavelet Neural Network structure (MLWNN). Experimental results show that the progressive re-meshing algorithm capable of obtaining more compact representations and semi-regular objects and yield an efficient compression capabilities with minimal set of features used to have good 3D deformation scheme.

Gas pipe explorer robot

NASA Technical Reports Server (NTRS)

Wilcox, Brian (Inventor)

2004-01-01

A gas pipe explorer formed of a plurality of connecting elements, and an articulation element between the connected elements. The connected elements include drive capabilities, and the articulation element allows the connected elements to traverse gas pipes of arbitrary shapes and sizes. A sensor may sends the characteristics of the gas pipe, and the communication element may send back those sends characteristics. The communication can be wired, over a tether connecting the device to a remote end. Alternatively, the connection can be wireless, driven by either a generator or a battery.

Turbine component cooling channel mesh with intersection chambers

DOEpatents

Lee, Ching-Pang; Marra, John J

2014-05-06

A mesh (35) of cooling channels (35A, 35B) with an array of cooling channel intersections (42) in a wall (21, 22) of a turbine component. A mixing chamber (42A-C) at each intersection is wider (W1, W2)) than a width (W) of each of the cooling channels connected to the mixing chamber. The mixing chamber promotes swirl, and slows the coolant for more efficient and uniform cooling. A series of cooling meshes (M1, M2) may be separated by mixing manifolds (44), which may have film cooling holes (46) and/or coolant refresher holes (48).

System data communication structures for active-control transport aircraft, volume 1

NASA Technical Reports Server (NTRS)

Hopkins, A. L.; Martin, J. H.; Brock, L. D.; Jansson, D. G.; Serben, S.; Smith, T. B.; Hanley, L. D.

1981-01-01

Candidate data communication techniques are identified, including dedicated links, local buses, broadcast buses, multiplex buses, and mesh networks. The design methodology for mesh networks is then discussed, including network topology and node architecture. Several concepts of power distribution are reviewed, including current limiting and mesh networks for power. The technology issues of packaging, transmission media, and lightning are addressed, and, finally, the analysis tools developed to aid in the communication design process are described. There are special tools to analyze the reliability and connectivity of networks and more general reliability analysis tools for all types of systems.

Surface modification of polypropylene mesh devices with cyclodextrin via cold plasma for hernia repair: Characterization and antibacterial properties

NASA Astrophysics Data System (ADS)

Sanbhal, Noor; Mao, Ying; Sun, Gang; Xu, Rui Fang; Zhang, Qian; Wang, Lu

2018-05-01

Light weight polypropylene (PP) mesh is the most widely used implant among all other synthetic meshes for hernia repair. However, infection is the complication associated to all synthetic meshes after hernia repair. Thus, to manage mesh related infection; antibacterial drug is generally loaded to surgical implants to supply drug locally in mesh implanted site. Nevertheless, PP mesh restricts the loading of antibacterial drug at operated area due to its low wettability. The aim of this study was to introduce a novel antimicrobial PP mesh modified with β-cyclodextrine (CD) and loaded with antimicrobial agent for infection prevention. A cold oxygen plasma treatment was able to activate the surfaces of polypropylene fibers, and then CD was incorporated onto the surfaces of PP fibers. Afterward, triclosan, as a model antibacterial agent, was loaded into CD cavity to provide desired antibacterial functions. The modified polypropylene mesh samples CD-Tric-1, CD-Tric-3 exhibited excellent inhibition zone and continuous antibacterial efficacy against E. coli and S. aureus up to 6 and 7 days respectively. Results of AFM, SEM, FTIR and antibacterial tests evidenced that oxygen plasma process is necessary to increase chemical connection between CD molecules and PP fibers. The samples were also characterized by using EDX, XRD, TGA, DSC and water contact angle.

A new procedure for dynamic adaption of three-dimensional unstructured grids

NASA Technical Reports Server (NTRS)

Biswas, Rupak; Strawn, Roger

1993-01-01

A new procedure is presented for the simultaneous coarsening and refinement of three-dimensional unstructured tetrahedral meshes. This algorithm allows for localized grid adaption that is used to capture aerodynamic flow features such as vortices and shock waves in helicopter flowfield simulations. The mesh-adaption algorithm is implemented in the C programming language and uses a data structure consisting of a series of dynamically-allocated linked lists. These lists allow the mesh connectivity to be rapidly reconstructed when individual mesh points are added and/or deleted. The algorithm allows the mesh to change in an anisotropic manner in order to efficiently resolve directional flow features. The procedure has been successfully implemented on a single processor of a Cray Y-MP computer. Two sample cases are presented involving three-dimensional transonic flow. Computed results show good agreement with conventional structured-grid solutions for the Euler equations.

Scalable air cathode microbial fuel cells using glass fiber separators, plastic mesh supporters, and graphite fiber brush anodes.

PubMed

Zhang, Xiaoyuan; Cheng, Shaoan; Liang, Peng; Huang, Xia; Logan, Bruce E

2011-01-01

The combined use of brush anodes and glass fiber (GF1) separators, and plastic mesh supporters were used here for the first time to create a scalable microbial fuel cell architecture. Separators prevented short circuiting of closely-spaced electrodes, and cathode supporters were used to avoid water gaps between the separator and cathode that can reduce power production. The maximum power density with a separator and supporter and a single cathode was 75 ± 1 W/m(3). Removing the separator decreased power by 8%. Adding a second cathode increased power to 154 ± 1 W/m(3). Current was increased by connecting two MFCs connected in parallel. These results show that brush anodes, combined with a glass fiber separator and a plastic mesh supporter, produce a useful MFC architecture that is inherently scalable due to good insulation between the electrodes and a compact architecture. Copyright © 2010 Elsevier Ltd. All rights reserved.

Symmetry- and essentially-bound-preserving flux-corrected remapping of momentum in staggered ALE hydrodynamics

NASA Astrophysics Data System (ADS)

Velechovský, J.; Kuchařík, M.; Liska, R.; Shashkov, M.; Váchal, P.

2013-12-01

We present a new flux-corrected approach for remapping of velocity in the framework of staggered arbitrary Lagrangian-Eulerian methods. The main focus of the paper is the definition and preservation of coordinate invariant local bounds for velocity vector and development of momentum remapping method such that the radial symmetry of the radially symmetric flows is preserved when remapping from one equiangular polar mesh to another. The properties of this new method are demonstrated on a set of selected numerical cyclic remapping tests and a full hydrodynamic example.

N-MODY: A Code for Collisionless N-body Simulations in Modified Newtonian Dynamics

NASA Astrophysics Data System (ADS)

Londrillo, Pasquale; Nipoti, Carlo

2011-02-01

N-MODY is a parallel particle-mesh code for collisionless N-body simulations in modified Newtonian dynamics (MOND). N-MODY is based on a numerical potential solver in spherical coordinates that solves the non-linear MOND field equation, and is ideally suited to simulate isolated stellar systems. N-MODY can be used also to compute the MOND potential of arbitrary static density distributions. A few applications of N-MODY indicate that some astrophysically relevant dynamical processes are profoundly different in MOND and in Newtonian gravity with dark matter.

Developing a Learning Algorithm-Generated Empirical Relaxer

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mitchell, Wayne; Kallman, Josh; Toreja, Allen

2016-03-30

One of the main difficulties when running Arbitrary Lagrangian-Eulerian (ALE) simulations is determining how much to relax the mesh during the Eulerian step. This determination is currently made by the user on a simulation-by-simulation basis. We present a Learning Algorithm-Generated Empirical Relaxer (LAGER) which uses a regressive random forest algorithm to automate this decision process. We also demonstrate that LAGER successfully relaxes a variety of test problems, maintains simulation accuracy, and has the potential to significantly decrease both the person-hours and computational hours needed to run a successful ALE simulation.

Automatic generation of endocardial surface meshes with 1-to-1 correspondence from cine-MR images

NASA Astrophysics Data System (ADS)

Su, Yi; Teo, S.-K.; Lim, C. W.; Zhong, L.; Tan, R. S.

2015-03-01

In this work, we develop an automatic method to generate a set of 4D 1-to-1 corresponding surface meshes of the left ventricle (LV) endocardial surface which are motion registered over the whole cardiac cycle. These 4D meshes have 1- to-1 point correspondence over the entire set, and is suitable for advanced computational processing, such as shape analysis, motion analysis and finite element modelling. The inputs to the method are the set of 3D LV endocardial surface meshes of the different frames/phases of the cardiac cycle. Each of these meshes is reconstructed independently from border-delineated MR images and they have no correspondence in terms of number of vertices/points and mesh connectivity. To generate point correspondence, the first frame of the LV mesh model is used as a template to be matched to the shape of the meshes in the subsequent phases. There are two stages in the mesh correspondence process: (1) a coarse matching phase, and (2) a fine matching phase. In the coarse matching phase, an initial rough matching between the template and the target is achieved using a radial basis function (RBF) morphing process. The feature points on the template and target meshes are automatically identified using a 16-segment nomenclature of the LV. In the fine matching phase, a progressive mesh projection process is used to conform the rough estimate to fit the exact shape of the target. In addition, an optimization-based smoothing process is used to achieve superior mesh quality and continuous point motion.

Polypropylene Surgical Mesh Coated with Extracellular Matrix Mitigates the Host Foreign Body Response

PubMed Central

Wolf, Matthew T.; Carruthers, Christopher A.; Dearth, Christopher L.; Crapo, Peter M.; Huber, Alexander; Burnsed, Olivia A.; Londono, Ricardo; Johnson, Scott A.; Daly, Kerry A.; Stahl, Elizabeth C.; Freund, John M.; Medberry, Christopher J.; Carey, Lisa E.; Nieponice, Alejandro; Amoroso, Nicholas J.; Badylak, Stephen F.

2013-01-01

Surgical mesh devices composed of synthetic materials are commonly used for ventral hernia repair. These materials provide robust mechanical strength and are quickly incorporated into host tissue; factors which contribute to reduced hernia recurrence rates. However, such mesh devices cause a foreign body response with the associated complications of fibrosis and patient discomfort. In contrast, surgical mesh devices composed of naturally occurring extracellular matrix (ECM) are associated with constructive tissue remodeling, but lack the mechanical strength of synthetic materials. A method for applying a porcine dermal ECM hydrogel coating to a polypropylene mesh is described herein with the associated effects upon the host tissue response and biaxial mechanical behavior. Uncoated and ECM coated heavy-weight BARD™ Mesh were compared to the light-weight ULTRAPRO™ and BARD™ Soft Mesh devices in a rat partial thickness abdominal defect overlay model. The ECM coated mesh attenuated the pro-inflammatory response compared to all other devices, with a reduced cell accumulation and fewer foreign body giant cells. The ECM coating degraded by 35 days, and was replaced with loose connective tissue compared to the dense collagenous tissue associated with the uncoated polypropylene mesh device. Biaxial mechanical characterization showed that all of the mesh devices were of similar isotropic stiffness. Upon explantation, the light-weight mesh devices were more compliant than the coated or uncoated heavy-weight devices. The present study shows that an ECM coating alters the default host response to a polypropylene mesh, but not the mechanical properties in an acute in vivo abdominal repair model. PMID:23873846

A Security Analysis of the 802.11s Wireless Mesh Network Routing Protocol and Its Secure Routing Protocols

PubMed Central

Tan, Whye Kit; Lee, Sang-Gon; Lam, Jun Huy; Yoo, Seong-Moo

2013-01-01

Wireless mesh networks (WMNs) can act as a scalable backbone by connecting separate sensor networks and even by connecting WMNs to a wired network. The Hybrid Wireless Mesh Protocol (HWMP) is the default routing protocol for the 802.11s WMN. The routing protocol is one of the most important parts of the network, and it requires protection, especially in the wireless environment. The existing security protocols, such as the Broadcast Integrity Protocol (BIP), Counter with cipher block chaining message authentication code protocol (CCMP), Secure Hybrid Wireless Mesh Protocol (SHWMP), Identity Based Cryptography HWMP (IBC-HWMP), Elliptic Curve Digital Signature Algorithm HWMP (ECDSA-HWMP), and Watchdog-HWMP aim to protect the HWMP frames. In this paper, we have analyzed the vulnerabilities of the HWMP and developed security requirements to protect these identified vulnerabilities. We applied the security requirements to analyze the existing secure schemes for HWMP. The results of our analysis indicate that none of these protocols is able to satisfy all of the security requirements. We also present a quantitative complexity comparison among the protocols and an example of a security scheme for HWMP to demonstrate how the result of our research can be utilized. Our research results thus provide a tool for designing secure schemes for the HWMP. PMID:24002231

A security analysis of the 802.11s wireless mesh network routing protocol and its secure routing protocols.

PubMed

Tan, Whye Kit; Lee, Sang-Gon; Lam, Jun Huy; Yoo, Seong-Moo

2013-09-02

Wireless mesh networks (WMNs) can act as a scalable backbone by connecting separate sensor networks and even by connecting WMNs to a wired network. The Hybrid Wireless Mesh Protocol (HWMP) is the default routing protocol for the 802.11s WMN. The routing protocol is one of the most important parts of the network, and it requires protection, especially in the wireless environment. The existing security protocols, such as the Broadcast Integrity Protocol (BIP), Counter with cipher block chaining message authentication code protocol (CCMP), Secure Hybrid Wireless Mesh Protocol (SHWMP), Identity Based Cryptography HWMP (IBC-HWMP), Elliptic Curve Digital Signature Algorithm HWMP (ECDSA-HWMP), and Watchdog-HWMP aim to protect the HWMP frames. In this paper, we have analyzed the vulnerabilities of the HWMP and developed security requirements to protect these identified vulnerabilities. We applied the security requirements to analyze the existing secure schemes for HWMP. The results of our analysis indicate that none of these protocols is able to satisfy all of the security requirements. We also present a quantitative complexity comparison among the protocols and an example of a security scheme for HWMP to demonstrate how the result of our research can be utilized. Our research results thus provide a tool for designing secure schemes for the HWMP.

3D unstructured-mesh radiation transport codes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Morel, J.

1997-12-31

Three unstructured-mesh radiation transport codes are currently being developed at Los Alamos National Laboratory. The first code is ATTILA, which uses an unstructured tetrahedral mesh in conjunction with standard Sn (discrete-ordinates) angular discretization, standard multigroup energy discretization, and linear-discontinuous spatial differencing. ATTILA solves the standard first-order form of the transport equation using source iteration in conjunction with diffusion-synthetic acceleration of the within-group source iterations. DANTE is designed to run primarily on workstations. The second code is DANTE, which uses a hybrid finite-element mesh consisting of arbitrary combinations of hexahedra, wedges, pyramids, and tetrahedra. DANTE solves several second-order self-adjoint forms of the transport equation including the even-parity equation, the odd-parity equation, and a new equation called the self-adjoint angular flux equation. DANTE also offers three angular discretization options:more » $$S{_}n$$ (discrete-ordinates), $$P{_}n$$ (spherical harmonics), and $$SP{_}n$$ (simplified spherical harmonics). DANTE is designed to run primarily on massively parallel message-passing machines, such as the ASCI-Blue machines at LANL and LLNL. The third code is PERICLES, which uses the same hybrid finite-element mesh as DANTE, but solves the standard first-order form of the transport equation rather than a second-order self-adjoint form. DANTE uses a standard $$S{_}n$$ discretization in angle in conjunction with trilinear-discontinuous spatial differencing, and diffusion-synthetic acceleration of the within-group source iterations. PERICLES was initially designed to run on workstations, but a version for massively parallel message-passing machines will be built. The three codes will be described in detail and computational results will be presented.« less

A Matlab-based finite-difference solver for the Poisson problem with mixed Dirichlet-Neumann boundary conditions

NASA Astrophysics Data System (ADS)

Reimer, Ashton S.; Cheviakov, Alexei F.

2013-03-01

A Matlab-based finite-difference numerical solver for the Poisson equation for a rectangle and a disk in two dimensions, and a spherical domain in three dimensions, is presented. The solver is optimized for handling an arbitrary combination of Dirichlet and Neumann boundary conditions, and allows for full user control of mesh refinement. The solver routines utilize effective and parallelized sparse vector and matrix operations. Computations exhibit high speeds, numerical stability with respect to mesh size and mesh refinement, and acceptable error values even on desktop computers. Catalogue identifier: AENQ_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AENQ_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: GNU General Public License v3.0 No. of lines in distributed program, including test data, etc.: 102793 No. of bytes in distributed program, including test data, etc.: 369378 Distribution format: tar.gz Programming language: Matlab 2010a. Computer: PC, Macintosh. Operating system: Windows, OSX, Linux. RAM: 8 GB (8, 589, 934, 592 bytes) Classification: 4.3. Nature of problem: To solve the Poisson problem in a standard domain with “patchy surface”-type (strongly heterogeneous) Neumann/Dirichlet boundary conditions. Solution method: Finite difference with mesh refinement. Restrictions: Spherical domain in 3D; rectangular domain or a disk in 2D. Unusual features: Choice between mldivide/iterative solver for the solution of large system of linear algebraic equations that arise. Full user control of Neumann/Dirichlet boundary conditions and mesh refinement. Running time: Depending on the number of points taken and the geometry of the domain, the routine may take from less than a second to several hours to execute.

The Extension of Wireless Mesh Networks Via Vertical Takeoff and Landing Unmanned Aerial Vehicles

DTIC Science & Technology

2007-12-01

development. When connected to Crossbow’s Stargate Processor Board (SPB400) (See Figure 19), via the standard 51-pin connector, the MNAV100CA combines with...also be connected and processed by the Stargate to support intelligent robotics applications.22 22 UAV

Weakly supervised automatic segmentation and 3D modeling of the knee joint from MR images

NASA Astrophysics Data System (ADS)

Amami, Amal; Ben Azouz, Zouhour

2013-12-01

Automatic segmentation and 3D modeling of the knee joint from MR images, is a challenging task. Most of the existing techniques require the tedious manual segmentation of a training set of MRIs. We present an approach that necessitates the manual segmentation of one MR image. It is based on a volumetric active appearance model. First, a dense tetrahedral mesh is automatically created on a reference MR image that is arbitrary selected. Second, a pairwise non-rigid registration between each MRI from a training set and the reference MRI is computed. The non-rigid registration is based on a piece-wise affine deformation using the created tetrahedral mesh. The minimum description length is then used to bring all the MR images into a correspondence. An average image and tetrahedral mesh, as well as a set of main modes of variations, are generated using the established correspondence. Any manual segmentation of the average MRI can be mapped to other MR images using the AAM. The proposed approach has the advantage of simultaneously generating 3D reconstructions of the surface as well as a 3D solid model of the knee joint. The generated surfaces and tetrahedral meshes present the interesting property of fulfilling a correspondence between different MR images. This paper shows preliminary results of the proposed approach. It demonstrates the automatic segmentation and 3D reconstruction of a knee joint obtained by mapping a manual segmentation of a reference image.

Mesh Networking in the Tactical Environment Using White Space Technolog

DTIC Science & Technology

2015-12-01

Connect network with multi- ple clients . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48 Table 4.5 Results of White Space simulation...functionality to devices seeking to allocate unutilized spectrum space . The devices are able to poll the database, via a connection to a web based...and 28 schools, all of whom were provided Internet connectivity by Adaptrum white space devices [16]. The use of white space devices made this

Fault-Tolerant Self-Stabilizing Distributed Clock Synchronization Protocol for Arbitrary Digraphs

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R. (Inventor)

2014-01-01

A self-stabilizing network in the form of an arbitrary, non-partitioned digraph includes K nodes having a synchronizer executing a protocol. K-1 monitors of each node may receive a Sync message transmitted from a directly connected node. When the Sync message is received, the logical clock value for the receiving node is set to between 0 and a communication latency value (gamma) if the clock value is less than a minimum event-response delay (D). A new Sync message is also transmitted to any directly connected nodes if the clock value is greater than or equal to both D and a graph threshold (T(sub S)). When the Sync message is not received the synchronizer increments the clock value if the clock value is less than a resynchronization period (P), and resets the clock value and transmits a new Sync message to all directly connected nodes when the clock value equals or exceeds P.

Optimization-based mesh correction with volume and convexity constraints

DOE PAGES

D'Elia, Marta; Ridzal, Denis; Peterson, Kara J.; ...

2016-02-24

In this study, we consider the problem of finding a mesh such that 1) it is the closest, with respect to a suitable metric, to a given source mesh having the same connectivity, and 2) the volumes of its cells match a set of prescribed positive values that are not necessarily equal to the cell volumes in the source mesh. This volume correction problem arises in important simulation contexts, such as satisfying a discrete geometric conservation law and solving transport equations by incremental remapping or similar semi-Lagrangian transport schemes. In this paper we formulate volume correction as a constrained optimizationmore » problem in which the distance to the source mesh defines an optimization objective, while the prescribed cell volumes, mesh validity and/or cell convexity specify the constraints. We solve this problem numerically using a sequential quadratic programming (SQP) method whose performance scales with the mesh size. To achieve scalable performance we develop a specialized multigrid-based preconditioner for optimality systems that arise in the application of the SQP method to the volume correction problem. Numerical examples illustrate the importance of volume correction, and showcase the accuracy, robustness and scalability of our approach.« less

A chimera grid scheme. [multiple overset body-conforming mesh system for finite difference adaptation to complex aircraft configurations

NASA Technical Reports Server (NTRS)

Steger, J. L.; Dougherty, F. C.; Benek, J. A.

1983-01-01

A mesh system composed of multiple overset body-conforming grids is described for adapting finite-difference procedures to complex aircraft configurations. In this so-called 'chimera mesh,' a major grid is generated about a main component of the configuration and overset minor grids are used to resolve all other features. Methods for connecting overset multiple grids and modifications of flow-simulation algorithms are discussed. Computational tests in two dimensions indicate that the use of multiple overset grids can simplify the task of grid generation without an adverse effect on flow-field algorithms and computer code complexity.

A coordinate free description of magnetohydrostatic equilibria

NASA Technical Reports Server (NTRS)

Martens, P. C. H.

1986-01-01

The question what geometrical restrictions are imposed on static magnetic fields by the magnetohydrostatic (MHS) equation is addressed. The general mathematical problem is therefore to determine the solutions of the MHS equations in the corona subject to an arbitrary normal component of the magnetic field at the boundary and arbitrary connectivity. What constraints the MHS equations impose on the geometry of the solutions, expressed in metric tensors, will be determined.

Limited-path-length entanglement percolation in quantum complex networks

NASA Astrophysics Data System (ADS)

Cuquet, Martí; Calsamiglia, John

2011-03-01

We study entanglement distribution in quantum complex networks where nodes are connected by bipartite entangled states. These networks are characterized by a complex structure, which dramatically affects how information is transmitted through them. For pure quantum state links, quantum networks exhibit a remarkable feature absent in classical networks: it is possible to effectively rewire the network by performing local operations on the nodes. We propose a family of such quantum operations that decrease the entanglement percolation threshold of the network and increase the size of the giant connected component. We provide analytic results for complex networks with an arbitrary (uncorrelated) degree distribution. These results are in good agreement with numerical simulations, which also show enhancement in correlated and real-world networks. The proposed quantum preprocessing strategies are not robust in the presence of noise. However, even when the links consist of (noisy) mixed-state links, one can send quantum information through a connecting path with a fidelity that decreases with the path length. In this noisy scenario, complex networks offer a clear advantage over regular lattices, namely, the fact that two arbitrary nodes can be connected through a relatively small number of steps, known as the small-world effect. We calculate the probability that two arbitrary nodes in the network can successfully communicate with a fidelity above a given threshold. This amounts to working out the classical problem of percolation with a limited path length. We find that this probability can be significant even for paths limited to few connections and that the results for standard (unlimited) percolation are soon recovered if the path length exceeds by a finite amount the average path length, which in complex networks generally scales logarithmically with the size of the network.

Laser additive manufacturing of 3D meshes for optical applications.

PubMed

Essa, Khamis; Sabouri, Aydin; Butt, Haider; Basuny, Fawzia Hamed; Ghazy, Mootaz; El-Sayed, Mahmoud Ahmed

2018-01-01

Selective laser melting (SLM) is a widely used additive manufacturing process that can be used for printing of intricate three dimensional (3D) metallic structures. Here we demonstrate the fabrication of titanium alloy Ti-6Al-4V alloy based 3D meshes with nodally-connected diamond like unit cells, with lattice spacing varying from 400 to 1000 microns. A Concept Laser M2 system equipped with laser that has a wavelength of 1075 nm, a constant beam spot size of 50μm and maximum power of 400W was used to manufacture the 3D meshes. These meshes act as optical shutters / directional transmitters and display interesting optical properties. A detailed optical characterisation was carried out and it was found that these structures can be optimised to act as scalable rotational shutters with high efficiencies and as angle selective transmission screens for protection against unwanted and dangerous radiations. The efficiency of fabricated lattice structures can be increased by enlarging the meshing size.

Laser additive manufacturing of 3D meshes for optical applications

PubMed Central

Essa, Khamis; Sabouri, Aydin; Butt, Haider; Basuny, Fawzia Hamed; Ghazy, Mootaz

2018-01-01

Selective laser melting (SLM) is a widely used additive manufacturing process that can be used for printing of intricate three dimensional (3D) metallic structures. Here we demonstrate the fabrication of titanium alloy Ti–6Al–4V alloy based 3D meshes with nodally-connected diamond like unit cells, with lattice spacing varying from 400 to 1000 microns. A Concept Laser M2 system equipped with laser that has a wavelength of 1075 nm, a constant beam spot size of 50μm and maximum power of 400W was used to manufacture the 3D meshes. These meshes act as optical shutters / directional transmitters and display interesting optical properties. A detailed optical characterisation was carried out and it was found that these structures can be optimised to act as scalable rotational shutters with high efficiencies and as angle selective transmission screens for protection against unwanted and dangerous radiations. The efficiency of fabricated lattice structures can be increased by enlarging the meshing size. PMID:29414982

Aerodynamic Shape Optimization of Complex Aircraft Configurations via an Adjoint Formulation

NASA Technical Reports Server (NTRS)

Reuther, James; Jameson, Antony; Farmer, James; Martinelli, Luigi; Saunders, David

1996-01-01

This work describes the implementation of optimization techniques based on control theory for complex aircraft configurations. Here control theory is employed to derive the adjoint differential equations, the solution of which allows for a drastic reduction in computational costs over previous design methods (13, 12, 43, 38). In our earlier studies (19, 20, 22, 23, 39, 25, 40, 41, 42) it was shown that this method could be used to devise effective optimization procedures for airfoils, wings and wing-bodies subject to either analytic or arbitrary meshes. Design formulations for both potential flows and flows governed by the Euler equations have been demonstrated, showing that such methods can be devised for various governing equations (39, 25). In our most recent works (40, 42) the method was extended to treat wing-body configurations with a large number of mesh points, verifying that significant computational savings can be gained for practical design problems. In this paper the method is extended for the Euler equations to treat complete aircraft configurations via a new multiblock implementation. New elements include a multiblock-multigrid flow solver, a multiblock-multigrid adjoint solver, and a multiblock mesh perturbation scheme. Two design examples are presented in which the new method is used for the wing redesign of a transonic business jet.

Recent developments in multidimensional transport methods for the APOLLO 2 lattice code

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zmijarevic, I.; Sanchez, R.

1995-12-31

A usual method of preparation of homogenized cross sections for reactor coarse-mesh calculations is based on two-dimensional multigroup transport treatment of an assembly together with an appropriate leakage model and reaction-rate-preserving homogenization technique. The actual generation of assembly spectrum codes based on collision probability methods is capable of treating complex geometries (i.e., irregular meshes of arbitrary shape), thus avoiding the modeling error that was introduced in codes with traditional tracking routines. The power and architecture of current computers allow the treatment of spatial domains comprising several mutually interacting assemblies using fine multigroup structure and retaining all geometric details of interest.more » Increasing safety requirements demand detailed two- and three-dimensional calculations for very heterogeneous problems such as control rod positioning, broken Pyrex rods, irregular compacting of mixed- oxide (MOX) pellets at an MOX-UO{sub 2} interface, and many others. An effort has been made to include accurate multi- dimensional transport methods in the APOLLO 2 lattice code. These include extension to three-dimensional axially symmetric geometries of the general-geometry collision probability module TDT and the development of new two- and three-dimensional characteristics methods for regular Cartesian meshes. In this paper we discuss the main features of recently developed multidimensional methods that are currently being tested.« less

Multi-resolutional shape features via non-Euclidean wavelets: Applications to statistical analysis of cortical thickness

PubMed Central

Kim, Won Hwa; Singh, Vikas; Chung, Moo K.; Hinrichs, Chris; Pachauri, Deepti; Okonkwo, Ozioma C.; Johnson, Sterling C.

2014-01-01

Statistical analysis on arbitrary surface meshes such as the cortical surface is an important approach to understanding brain diseases such as Alzheimer’s disease (AD). Surface analysis may be able to identify specific cortical patterns that relate to certain disease characteristics or exhibit differences between groups. Our goal in this paper is to make group analysis of signals on surfaces more sensitive. To do this, we derive multi-scale shape descriptors that characterize the signal around each mesh vertex, i.e., its local context, at varying levels of resolution. In order to define such a shape descriptor, we make use of recent results from harmonic analysis that extend traditional continuous wavelet theory from the Euclidean to a non-Euclidean setting (i.e., a graph, mesh or network). Using this descriptor, we conduct experiments on two different datasets, the Alzheimer’s Disease NeuroImaging Initiative (ADNI) data and images acquired at the Wisconsin Alzheimer’s Disease Research Center (W-ADRC), focusing on individuals labeled as having Alzheimer’s disease (AD), mild cognitive impairment (MCI) and healthy controls. In particular, we contrast traditional univariate methods with our multi-resolution approach which show increased sensitivity and improved statistical power to detect a group-level effects. We also provide an open source implementation. PMID:24614060

Electrical characteristic of the titanium mesh electrode for transcutaneous intrabody communication to monitor implantable artificial organs.

PubMed

Okamoto, Eiji; Kikuchi, Sakiko; Mitamura, Yoshinori

2016-09-01

We have developed a tissue-inducing electrode using titanium mesh to obtain mechanically and electrically stable contact with the tissue for a new transcutaneous communication system using the human body as a conductive medium. In this study, we investigated the electrical properties of the titanium mesh electrode by measuring electrode-tissue interface resistance in vivo. The titanium mesh electrode (Hi-Lex Co., Zellez, Hyogo, Japan) consisted of titanium fibers (diameter of 50 μm), and it has an average pore size of 200 μm and 87 % porosity. The titanium mesh electrode has a diameter of 5 mm and thickness of 1.5 mm. Three titanium mesh electrodes were implanted separately into the dorsal region of the rat. We measured the electrode-electrode impedance using an LCR meter for 12 weeks, and we calculated the tissue resistivity and electrode-tissue interface resistance. The electrode-tissue interface resistance of the titanium mesh electrode decreased slightly until the third POD and then continuously increased to 75 Ω. The electrode-tissue interface resistance of the titanium mesh electrode is stable and it has lower electrode-tissue interface resistance than that of a titanium disk electrode. The extracted titanium mesh electrode after 12 weeks implantation was fixed in 10 % buffered formalin solution and stained with hematoxylin-eosin. Light microscopic observation showed that the titanium mesh electrode was filled with connective tissue, inflammatory cells and fibroblasts with some capillaries in the pores of the titanium mesh. The results indicate that the titanium mesh electrode is a promising electrode for the new transcutaneous communication system.

SPECT-CT Comparison of Lung Deposition using a System combining a Vibrating-mesh Nebulizer with a Valved Holding Chamber and a Conventional Jet Nebulizer: a Randomized Cross-over Study.

PubMed

Dugernier, Jonathan; Hesse, Michel; Vanbever, Rita; Depoortere, Virginie; Roeseler, Jean; Michotte, Jean-Bernard; Laterre, Pierre-François; Jamar, François; Reychler, Gregory

2017-02-01

To compare in vivo the total and regional pulmonary deposition of aerosol particles generated by a new system combining a vibrating-mesh nebulizer with a specific valved holding chamber and constant-output jet nebulizer connected to a corrugated tube. Cross-over study comparing aerosol delivery to the lungs using two nebulizers in 6 healthy male subjects: a vibrating-mesh nebulizer combined with a valved holding chamber (Aerogen Ultra®, Aerogen Ltd., Galway, Ireland) and a jet nebulizer connected to a corrugated tube (Opti-Mist Plus Nebulizer®, ConvaTec, Bridgewater, NJ). Nebulizers were filled with diethylenetriaminepentaacetic acid labelled with technetium-99 m ( 99m Tc-DTPA, 2 mCi/4 mL). Pulmonary deposition of 99m Tc-DTPA was measured by single-photon emission computed tomography combined with a low dose CT-scan (SPECT-CT). Pulmonary aerosol deposition from SPECT-CT analysis was six times increased with the vibrating-mesh nebulizer as compared to the jet nebulizer (34.1 ± 6.0% versus 5.2 ± 1.1%, p < 0.001). However, aerosol penetration expressed as the three-dimensional normalized ratio of the outer and the inner regions of the lungs was similar between both nebulizers. This study demonstrated the high superiority of the new system combining a vibrating-mesh nebulizer with a valved holding chamber to deliver nebulized particles into the lungs as comparted to a constant-output jet nebulizer with a corrugated tube.

Numerical electromagnetic frequency domain analysis with discrete exterior calculus

NASA Astrophysics Data System (ADS)

Chen, Shu C.; Chew, Weng Cho

2017-12-01

In this paper, we perform a numerical analysis in frequency domain for various electromagnetic problems based on discrete exterior calculus (DEC) with an arbitrary 2-D triangular or 3-D tetrahedral mesh. We formulate the governing equations in terms of DEC for 3-D and 2-D inhomogeneous structures, and also show that the charge continuity relation is naturally satisfied. Then we introduce a general construction for signed dual volume to incorporate material information and take into account the case when circumcenters fall outside triangles or tetrahedrons, which may lead to negative dual volume without Delaunay triangulation. Then we examine the boundary terms induced by the dual mesh and provide a systematical treatment of various boundary conditions, including perfect magnetic conductor (PMC), perfect electric conductor (PEC), Dirichlet, periodic, and absorbing boundary conditions (ABC) within this method. An excellent agreement is achieved through the numerical calculation of several problems, including homogeneous waveguides, microstructured fibers, photonic crystals, scattering by a 2-D PEC, and resonant cavities.

An efficicient data structure for three-dimensional vertex based finite volume method

NASA Astrophysics Data System (ADS)

Akkurt, Semih; Sahin, Mehmet

2017-11-01

A vertex based three-dimensional finite volume algorithm has been developed using an edge based data structure.The mesh data structure of the given algorithm is similar to ones that exist in the literature. However, the data structures are redesigned and simplied in order to fit requirements of the vertex based finite volume method. In order to increase the cache efficiency, the data access patterns for the vertex based finite volume method are investigated and these datas are packed/allocated in a way that they are close to each other in the memory. The present data structure is not limited with tetrahedrons, arbitrary polyhedrons are also supported in the mesh without putting any additional effort. Furthermore, the present data structure also supports adaptive refinement and coarsening. For the implicit and parallel implementation of the FVM algorithm, PETSc and MPI libraries are employed. The performance and accuracy of the present algorithm are tested for the classical benchmark problems by comparing the CPU time for the open source algorithms.

Meshing complex macro-scale objects into self-assembling bricks

PubMed Central

Hacohen, Adar; Hanniel, Iddo; Nikulshin, Yasha; Wolfus, Shuki; Abu-Horowitz, Almogit; Bachelet, Ido

2015-01-01

Self-assembly provides an information-economical route to the fabrication of objects at virtually all scales. However, there is no known algorithm to program self-assembly in macro-scale, solid, complex 3D objects. Here such an algorithm is described, which is inspired by the molecular assembly of DNA, and based on bricks designed by tetrahedral meshing of arbitrary objects. Assembly rules are encoded by topographic cues imprinted on brick faces while attraction between bricks is provided by embedded magnets. The bricks can then be mixed in a container and agitated, leading to properly assembled objects at high yields and zero errors. The system and its assembly dynamics were characterized by video and audio analysis, enabling the precise time- and space-resolved characterization of its performance and accuracy. Improved designs inspired by our system could lead to successful implementation of self-assembly at the macro-scale, allowing rapid, on-demand fabrication of objects without the need for assembly lines. PMID:26226488

Parallel implementation of a Lagrangian-based model on an adaptive mesh in C++: Application to sea-ice

NASA Astrophysics Data System (ADS)

Samaké, Abdoulaye; Rampal, Pierre; Bouillon, Sylvain; Ólason, Einar

2017-12-01

We present a parallel implementation framework for a new dynamic/thermodynamic sea-ice model, called neXtSIM, based on the Elasto-Brittle rheology and using an adaptive mesh. The spatial discretisation of the model is done using the finite-element method. The temporal discretisation is semi-implicit and the advection is achieved using either a pure Lagrangian scheme or an Arbitrary Lagrangian Eulerian scheme (ALE). The parallel implementation presented here focuses on the distributed-memory approach using the message-passing library MPI. The efficiency and the scalability of the parallel algorithms are illustrated by the numerical experiments performed using up to 500 processor cores of a cluster computing system. The performance obtained by the proposed parallel implementation of the neXtSIM code is shown being sufficient to perform simulations for state-of-the-art sea ice forecasting and geophysical process studies over geographical domain of several millions squared kilometers like the Arctic region.

A regularized vortex-particle mesh method for large eddy simulation

NASA Astrophysics Data System (ADS)

Spietz, H. J.; Walther, J. H.; Hejlesen, M. M.

2017-11-01

We present recent developments of the remeshed vortex particle-mesh method for simulating incompressible fluid flow. The presented method relies on a parallel higher-order FFT based solver for the Poisson equation. Arbitrary high order is achieved through regularization of singular Green's function solutions to the Poisson equation and recently we have derived novel high order solutions for a mixture of open and periodic domains. With this approach the simulated variables may formally be viewed as the approximate solution to the filtered Navier Stokes equations, hence we use the method for Large Eddy Simulation by including a dynamic subfilter-scale model based on test-filters compatible with the aforementioned regularization functions. Further the subfilter-scale model uses Lagrangian averaging, which is a natural candidate in light of the Lagrangian nature of vortex particle methods. A multiresolution variation of the method is applied to simulate the benchmark problem of the flow past a square cylinder at Re = 22000 and the obtained results are compared to results from the literature.

A Reconstructed Discontinuous Galerkin Method for the Compressible Euler Equations on Arbitrary Grids

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hong Luo; Luquing Luo; Robert Nourgaliev

2009-06-01

A reconstruction-based discontinuous Galerkin (DG) method is presented for the solution of the compressible Euler equations on arbitrary grids. By taking advantage of handily available and yet invaluable information, namely the derivatives, in the context of the discontinuous Galerkin methods, a solution polynomial of one degree higher is reconstructed using a least-squares method. The stencils used in the reconstruction involve only the van Neumann neighborhood (face-neighboring cells) and are compact and consistent with the underlying DG method. The resulting DG method can be regarded as an improvement of a recovery-based DG method in the sense that it shares the samemore » nice features as the recovery-based DG method, such as high accuracy and efficiency, and yet overcomes some of its shortcomings such as a lack of flexibility, compactness, and robustness. The developed DG method is used to compute a variety of flow problems on arbitrary meshes to demonstrate the accuracy and efficiency of the method. The numerical results indicate that this reconstructed DG method is able to obtain a third-order accurate solution at a slightly higher cost than its second-order DG method and provide an increase in performance over the third order DG method in terms of computing time and storage requirement.« less

Unsteady density-current equations for highly curved terrain

NASA Technical Reports Server (NTRS)

Sivakumaran, N. S.; Dressler, R. F.

1989-01-01

New nonlinear partial differential equations containing terrain curvature and its rate of change are derived that describe the flow of an atmospheric density current. Unlike the classical hydraulic-type equations for density currents, the new equations are valid for two-dimensional, gradually varied flow over highly curved terrain, hence suitable for computing unsteady (or steady) flows over arbitrary mountain/valley profiles. The model assumes the atmosphere above the density current exerts a known arbitrary variable pressure upon the unknown interface. Later this is specialized to the varying hydrostatic pressure of the atmosphere above. The new equations yield the variable velocity distribution, the interface position, and the pressure distribution that contains a centrifugal component, often significantly larger than its hydrostatic component. These partial differential equations are hyperbolic, and the characteristic equations and characteristic directions are derived. Using these to form a characteristic mesh, a hypothetical unsteady curved-flow problem is calculated, not based upon observed data, merely as an example to illustrate the simplicity of their application to unsteady flows over mountains.

Adjoint Sensitivity Computations for an Embedded-Boundary Cartesian Mesh Method and CAD Geometry

NASA Technical Reports Server (NTRS)

Nemec, Marian; Aftosmis,Michael J.

2006-01-01

Cartesian-mesh methods are perhaps the most promising approach for addressing the issues of flow solution automation for aerodynamic design problems. In these methods, the discretization of the wetted surface is decoupled from that of the volume mesh. This not only enables fast and robust mesh generation for geometry of arbitrary complexity, but also facilitates access to geometry modeling and manipulation using parametric Computer-Aided Design (CAD) tools. Our goal is to combine the automation capabilities of Cartesian methods with an eficient computation of design sensitivities. We address this issue using the adjoint method, where the computational cost of the design sensitivities, or objective function gradients, is esseutially indepeudent of the number of design variables. In previous work, we presented an accurate and efficient algorithm for the solution of the adjoint Euler equations discretized on Cartesian meshes with embedded, cut-cell boundaries. Novel aspects of the algorithm included the computation of surface shape sensitivities for triangulations based on parametric-CAD models and the linearization of the coupling between the surface triangulation and the cut-cells. The objective of the present work is to extend our adjoint formulation to problems involving general shape changes. Central to this development is the computation of volume-mesh sensitivities to obtain a reliable approximation of the objective finction gradient. Motivated by the success of mesh-perturbation schemes commonly used in body-fitted unstructured formulations, we propose an approach based on a local linearization of a mesh-perturbation scheme similar to the spring analogy. This approach circumvents most of the difficulties that arise due to non-smooth changes in the cut-cell layer as the boundary shape evolves and provides a consistent approximation tot he exact gradient of the discretized abjective function. A detailed gradient accurace study is presented to verify our approach. Thereafter, we focus on a shape optimization problem for an Apollo-like reentry capsule. The optimization seeks to enhance the lift-to-drag ratio of the capsule by modifyjing the shape of its heat-shield in conjunction with a center-of-gravity (c.g.) offset. This multipoint and multi-objective optimization problem is used to demonstrate the overall effectiveness of the Cartesian adjoint method for addressing the issues of complex aerodynamic design. This abstract presents only a brief outline of the numerical method and results; full details will be given in the final paper.

Modelling the oscillations of the thermocline in a lake by means of a fully consistent and conservative 3D finite-element model with a vertically adaptive mesh

NASA Astrophysics Data System (ADS)

Delandmeter, Philippe; Lambrechts, Jonathan; Vallaeys, Valentin; Naithani, Jaya; Remacle, Jean-François; Legat, Vincent; Deleersnijder, Eric

2017-04-01

Vertical discretisation is crucial in the modelling of lake thermocline oscillations. For finite element methods, a simple way to increase the resolution close to the oscillating thermocline is to use vertical adaptive coordinates. With an Arbitrary Lagrangian-Eulerian (ALE) formulation, the mesh can be adapted to increase the resolution in regions with strong shear or stratification. In such an application, consistency and conservativity must be strictly enforced. SLIM 3D, a discontinuous-Galerkin finite element model for shallow-water flows (www.climate.be/slim, e.g. Kärnä et al., 2013, Delandmeter et al., 2015), was designed to be strictly consistent and conservative in its discrete formulation. In this context, special care must be paid to the coupling of the external and internal modes of the model and the moving mesh algorithm. In this framework, the mesh can be adapted arbitrarily in the vertical direction. Two moving mesh algorithms were implemented: the first one computes an a-priori optimal mesh; the second one diffuses vertically the mesh (Burchard et al., 2004, Hofmeister et al., 2010). The criteria used to define the optimal mesh and the diffusion function are related to a suitable measure of shear and stratification. We will present in detail the design of the model and how the consistency and conservativity is obtained. Then we will apply it to both idealised benchmarks and the wind-forced thermocline oscillations in Lake Tanganyika (Naithani et al. 2002). References Tuomas Kärnä, Vincent Legat and Eric Deleersnijder. A baroclinic discontinuous Galerkin finite element model for coastal flows, Ocean Modelling, 61:1-20, 2013. Philippe Delandmeter, Stephen E Lewis, Jonathan Lambrechts, Eric Deleersnijder, Vincent Legat and Eric Wolanski. The transport and fate of riverine fine sediment exported to a semi-open system. Estuarine, Coastal and Shelf Science, 167:336-346, 2015. Hans Burchard and Jean-Marie Beckers. Non-uniform adaptive vertical grids in one-dimensional numerical ocean models. Ocean Modelling, 6:51-81, 2004. Richard Hofmeister, Hans Burchard and Jean-Marie Beckers. Non-uniform adaptive vertical grids for 3d numerical ocean models. Ocean Modelling, 33:70-86, 2010. Jaya Naithani, Eric Deleersnijder and Pierre-Denis Plisnier. Origin of intraseasonal variability in Lake Tanganyika. Geophysical Research Letters, 29(23), doi:10.1029/2002GL015843, 2002.

A finite element formulation for scattering from electrically large 2-dimensional structures

NASA Technical Reports Server (NTRS)

Ross, Daniel C.; Volakis, John L.

1992-01-01

A finite element formulation is given using the scattered field approach with a fictitious material absorber to truncate the mesh. The formulation includes the use of arbitrary approximation functions so that more accurate results can be achieved without any modification to the software. Additionally, non-polynomial approximation functions can be used, including complex approximation functions. The banded system that results is solved with an efficient sparse/banded iterative scheme and as a consequence, large structures can be analyzed. Results are given for simple cases to verify the formulation and also for large, complex geometries.

N-MODY: a code for collisionless N-body simulations in modified Newtonian dynamics.

NASA Astrophysics Data System (ADS)

Londrillo, P.; Nipoti, C.

We describe the numerical code N-MODY, a parallel particle-mesh code for collisionless N-body simulations in modified Newtonian dynamics (MOND). N-MODY is based on a numerical potential solver in spherical coordinates that solves the non-linear MOND field equation, and is ideally suited to simulate isolated stellar systems. N-MODY can be used also to compute the MOND potential of arbitrary static density distributions. A few applications of N-MODY indicate that some astrophysically relevant dynamical processes are profoundly different in MOND and in Newtonian gravity with dark matter.

Proteus-MOC: A 3D deterministic solver incorporating 2D method of characteristics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Marin-Lafleche, A.; Smith, M. A.; Lee, C.

2013-07-01

A new transport solution methodology was developed by combining the two-dimensional method of characteristics with the discontinuous Galerkin method for the treatment of the axial variable. The method, which can be applied to arbitrary extruded geometries, was implemented in PROTEUS-MOC and includes parallelization in group, angle, plane, and space using a top level GMRES linear algebra solver. Verification tests were performed to show accuracy and stability of the method with the increased number of angular directions and mesh elements. Good scalability with parallelism in angle and axial planes is displayed. (authors)

Geo-PUMMA: Urban and Periurban Landscape Representation Toolbox for Hydrological Distributed Modeling

NASA Astrophysics Data System (ADS)

Sanzana, Pedro; Gironas, Jorge; Braud, Isabelle; Branger, Flora; Rodriguez, Fabrice; Vargas, Ximena; Hitschfeld, Nancy; Francisco Munoz, Jose

2016-04-01

In addition to land use changes, the process of urbanization can modify the direction of the surface and sub-surface flows, generating complex environments and increasing the types of connectivity between pervious and impervious areas. Thus, hydrological pathways in urban and periurban areas are significantly affected by artificial elements like channels, pipes, streets and other elements of storm water systems. This work presents Geo-PUMMA, a new GIS toolbox to generate vectorial meshes for distributed hydrological modeling and extract the drainage network in urban and periurban terrain. Geo-PUMMA gathers spatial information maps (e.g. cadastral, soil types, geology and digital elevation models) to produce Hydrological Response Units (HRU) and Urban Hydrological Elements (UHE). Geo-PUMMA includes tools to improve the initial mesh derived from GIS layers intersection in order to respect geometrical constraints, which ensures numerical stability while preserving the shape of the initial HRUs and minimizing the small elements to lower computing times. The geometrical constraints taken into account include: elements convexity, limitation of the number of sliver elements (e.g. roads) and of very small or very large elements. This toolbox allows the representation of basins at small scales (0.1-10km2), as it takes into account the hydrological connectivity of the main elements explicitly, and improves the representation of water pathways compared with classical raster approaches. Geo-PUMMA also allows the extraction of basin morphologic properties such as the width function, the area function and the imperviousness function. We applied this new toolbox to two periurban catchments: the Mercier catchment located near Lyon, France, and the Estero El Guindo catchment located in the Andean piedmont in the Maipo River, Chile. We use the capability of Geo-PUMMA to generate three different meshes. The first one is the initial mesh derived from the direct intersection of GIS layers. The second one is based on fine triangulation of HRUs and is considered the best one we can obtain (reference mesh). The third one is the recommended mesh, preserving the shape of the initial HRUs and limiting the number of elements. The representation of the drainage network and its morphological properties is compared between the three meshes. This comparison shows that the drainage network representation is particularly improved at small to medium spatial scales when using the recommended meshes (i.e. 120-150 m for the El Guindo catchment and 80-150 m for the Mercier catchment). The results also show that the recommended mesh correctly represents the main features of the drainage network as compared to the reference mesh. KEYWORDS: GRASS-GIS, Computer-assisted mesh generation, periurban catchments

3D Reconstruction of human bones based on dictionary learning.

PubMed

Zhang, Binkai; Wang, Xiang; Liang, Xiao; Zheng, Jinjin

2017-11-01

An effective method for reconstructing a 3D model of human bones from computed tomography (CT) image data based on dictionary learning is proposed. In this study, the dictionary comprises the vertices of triangular meshes, and the sparse coefficient matrix indicates the connectivity information. For better reconstruction performance, we proposed a balance coefficient between the approximation and regularisation terms and a method for optimisation. Moreover, we applied a local updating strategy and a mesh-optimisation method to update the dictionary and the sparse matrix, respectively. The two updating steps are iterated alternately until the objective function converges. Thus, a reconstructed mesh could be obtained with high accuracy and regularisation. The experimental results show that the proposed method has the potential to obtain high precision and high-quality triangular meshes for rapid prototyping, medical diagnosis, and tissue engineering. Copyright © 2017 IPEM. Published by Elsevier Ltd. All rights reserved.

Methods to control ectomycorrhizal colonization: effectiveness of chemical and physical barriers.

PubMed

Teste, François P; Karst, Justine; Jones, Melanie D; Simard, Suzanne W; Durall, Daniel M

2006-12-01

We conducted greenhouse experiments using Douglas-fir (Pseudotsuga menziesii var. glauca) seedlings where chemical methods (fungicides) were used to prevent ectomycorrhizal colonization of single seedlings or physical methods (mesh barriers) were used to prevent formation of mycorrhizal connections between neighboring seedlings. These methods were chosen for their ease of application in the field. We applied the fungicides, Topas (nonspecific) and Senator (ascomycete specific), separately and in combination at different concentrations and application frequencies to seedlings grown in unsterilized forest soils. Additionally, we assessed the ability of hyphae to penetrate mesh barriers of various pore sizes (0.2, 1, 20, and 500 microm) to form mycorrhizas on roots of neighboring seedlings. Ectomycorrhizal colonization was reduced by approximately 55% with the application of Topas at 0.5 g l(-1). Meshes with pore sizes of 0.2 and 1 microm were effective in preventing the formation of mycorrhizas via hyphal growth across the mesh barriers. Hence, meshes in this range of pore sizes could also be used to prevent the formation of common mycorrhizal networks in the field. Depending on the ecological question of interest, Topas or the employment of mesh with pore sizes <1 microm are suitable for restricting mycorrhization in the field.

OpenGl Visualization Tool and Library Version: 1.0

DOE Office of Scientific and Technical Information (OSTI.GOV)

2010-06-22

GLVis is an OpenGL tool for visualization of finite element meshes and functions. When started without any options, GLVis starts a server, which waits for a socket connections and visualizes any recieved data. This way the results of simulations on a remote (parallel) machine can be visualized on the lical user desktop. GLVis can also be used to visualize a mesh with or without a finite element function (solution). It can run a batch sequence of commands (GLVis scripts), or display previously saved socket streams.

Encoding the local connectivity patterns of fMRI for cognitive task and state classification.

PubMed

Onal Ertugrul, Itir; Ozay, Mete; Yarman Vural, Fatos T

2018-06-15

In this work, we propose a novel framework to encode the local connectivity patterns of brain, using Fisher vectors (FV), vector of locally aggregated descriptors (VLAD) and bag-of-words (BoW) methods. We first obtain local descriptors, called mesh arc descriptors (MADs) from fMRI data, by forming local meshes around anatomical regions, and estimating their relationship within a neighborhood. Then, we extract a dictionary of relationships, called brain connectivity dictionary by fitting a generative Gaussian mixture model (GMM) to a set of MADs, and selecting codewords at the mean of each component of the mixture. Codewords represent connectivity patterns among anatomical regions. We also encode MADs by VLAD and BoW methods using k-Means clustering. We classify cognitive tasks using the Human Connectome Project (HCP) task fMRI dataset and cognitive states using the Emotional Memory Retrieval (EMR). We train support vector machines (SVMs) using the encoded MADs. Results demonstrate that, FV encoding of MADs can be successfully employed for classification of cognitive tasks, and outperform VLAD and BoW representations. Moreover, we identify the significant Gaussians in mixture models by computing energy of their corresponding FV parts, and analyze their effect on classification accuracy. Finally, we suggest a new method to visualize the codewords of the learned brain connectivity dictionary.

Tubular screen electrical connection support for solid oxide fuel cells

DOEpatents

Tomlins, Gregory W.; Jaszcar, Michael P.

2002-01-01

A solid oxide fuel assembly is made of fuel cells (16, 16', 18, 24, 24', 26), each having an outer interconnection layer (36) and an outer electrode (28), which are disposed next to each other with rolled, porous, hollow, electrically conducting metal mesh conductors (20, 20') between the fuel cells, connecting the fuel cells at least in series along columns (15, 15') and where there are no metal felt connections between any fuel cells.

Parallel grid library for rapid and flexible simulation development

NASA Astrophysics Data System (ADS)

Honkonen, I.; von Alfthan, S.; Sandroos, A.; Janhunen, P.; Palmroth, M.

2013-04-01

We present an easy to use and flexible grid library for developing highly scalable parallel simulations. The distributed cartesian cell-refinable grid (dccrg) supports adaptive mesh refinement and allows an arbitrary C++ class to be used as cell data. The amount of data in grid cells can vary both in space and time allowing dccrg to be used in very different types of simulations, for example in fluid and particle codes. Dccrg transfers the data between neighboring cells on different processes transparently and asynchronously allowing one to overlap computation and communication. This enables excellent scalability at least up to 32 k cores in magnetohydrodynamic tests depending on the problem and hardware. In the version of dccrg presented here part of the mesh metadata is replicated between MPI processes reducing the scalability of adaptive mesh refinement (AMR) to between 200 and 600 processes. Dccrg is free software that anyone can use, study and modify and is available at https://gitorious.org/dccrg. Users are also kindly requested to cite this work when publishing results obtained with dccrg. Catalogue identifier: AEOM_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEOM_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, N. Ireland Licensing provisions: GNU Lesser General Public License version 3 No. of lines in distributed program, including test data, etc.: 54975 No. of bytes in distributed program, including test data, etc.: 974015 Distribution format: tar.gz Programming language: C++. Computer: PC, cluster, supercomputer. Operating system: POSIX. The code has been parallelized using MPI and tested with 1-32768 processes RAM: 10 MB-10 GB per process Classification: 4.12, 4.14, 6.5, 19.3, 19.10, 20. External routines: MPI-2 [1], boost [2], Zoltan [3], sfc++ [4] Nature of problem: Grid library supporting arbitrary data in grid cells, parallel adaptive mesh refinement, transparent remote neighbor data updates and load balancing. Solution method: The simulation grid is represented by an adjacency list (graph) with vertices stored into a hash table and edges into contiguous arrays. Message Passing Interface standard is used for parallelization. Cell data is given as a template parameter when instantiating the grid. Restrictions: Logically cartesian grid. Running time: Running time depends on the hardware, problem and the solution method. Small problems can be solved in under a minute and very large problems can take weeks. The examples and tests provided with the package take less than about one minute using default options. In the version of dccrg presented here the speed of adaptive mesh refinement is at most of the order of 106 total created cells per second. http://www.mpi-forum.org/. http://www.boost.org/. K. Devine, E. Boman, R. Heaphy, B. Hendrickson, C. Vaughan, Zoltan data management services for parallel dynamic applications, Comput. Sci. Eng. 4 (2002) 90-97. http://dx.doi.org/10.1109/5992.988653. https://gitorious.org/sfc++.

Characterization of the mechanism of drug-drug interactions from PubMed using MeSH terms.

PubMed

Lu, Yin; Figler, Bryan; Huang, Hong; Tu, Yi-Cheng; Wang, Ju; Cheng, Feng

2017-01-01

Identifying drug-drug interaction (DDI) is an important topic for the development of safe pharmaceutical drugs and for the optimization of multidrug regimens for complex diseases such as cancer and HIV. There have been about 150,000 publications on DDIs in PubMed, which is a great resource for DDI studies. In this paper, we introduced an automatic computational method for the systematic analysis of the mechanism of DDIs using MeSH (Medical Subject Headings) terms from PubMed literature. MeSH term is a controlled vocabulary thesaurus developed by the National Library of Medicine for indexing and annotating articles. Our method can effectively identify DDI-relevant MeSH terms such as drugs, proteins and phenomena with high accuracy. The connections among these MeSH terms were investigated by using co-occurrence heatmaps and social network analysis. Our approach can be used to visualize relationships of DDI terms, which has the potential to help users better understand DDIs. As the volume of PubMed records increases, our method for automatic analysis of DDIs from the PubMed database will become more accurate.

Mesh materials and hernia repair

PubMed Central

Elango, Santhini; Perumalsamy, Sakthivel; Ramachandran, Krishnakumar; Vadodaria, Ketankumar

2017-01-01

Hernia incidence has been observed since ancient time. Advancement in the medical textile industry came up with the variety of mesh materials to repair hernia, but none of them are without complications including recurrence of hernia. Therefore individuals once developed with the hernia could not lead a healthy and comfortable life. This drawn attention of surgeons, patients, researchers and industry to know the exact mechanism behind its development, complications and recurrence. Recent investigations highlighted the role of genetic factors and connective tissue disorders being the reason for the development of hernia apart from the abnormal pressure that is known to develop during other disease conditions. This review discusses different mesh materials, their advantages and disadvantages and their biological response after its implantation. PMID:28840830

Fault-tolerant onboard digital information switching and routing for communications satellites

NASA Technical Reports Server (NTRS)

Shalkhauser, Mary JO; Quintana, Jorge A.; Soni, Nitin J.; Kim, Heechul

1993-01-01

The NASA Lewis Research Center is developing an information-switching processor for future meshed very-small-aperture terminal (VSAT) communications satellites. The information-switching processor will switch and route baseband user data onboard the VSAT satellite to connect thousands of Earth terminals. Fault tolerance is a critical issue in developing information-switching processor circuitry that will provide and maintain reliable communications services. In parallel with the conceptual development of the meshed VSAT satellite network architecture, NASA designed and built a simple test bed for developing and demonstrating baseband switch architectures and fault-tolerance techniques. The meshed VSAT architecture and the switching demonstration test bed are described, and the initial switching architecture and the fault-tolerance techniques that were developed and tested are discussed.

MESHMAKER (MM) V1.5

DOE Office of Scientific and Technical Information (OSTI.GOV)

MORIDIS, GEORGE

2016-05-02

MeshMaker v1.5 is a code that describes the system geometry and discretizes the domain in problems of flow and transport through porous and fractured media that are simulated using the TOUGH+ [Moridis and Pruess, 2014] or TOUGH2 [Pruess et al., 1999; 2012] families of codes. It is a significantly modified and drastically enhanced version of an earlier simpler facility that was embedded in the TOUGH2 codes [Pruess et al., 1999; 2012], from which it could not be separated. The code (MeshMaker.f90) is a stand-alone product written in FORTRAN 95/2003, is written according to the tenets of Object-Oriented Programming, has amore » modular structure and can perform a number of mesh generation and processing operations. It can generate two-dimensional radially symmetric (r,z) meshes, and one-, two-, and three-dimensional rectilinear (Cartesian) grids in (x,y,z). The code generates the file MESH, which includes all the elements and connections that describe the discretized simulation domain and conforming to the requirements of the TOUGH+ and TOUGH2 codes. Multiple-porosity processing for simulation of flow in naturally fractured reservoirs can be invoked by means of a keyword MINC, which stands for Multiple INteracting Continua. The MINC process operates on the data of the primary (porous medium) mesh as provided on disk file MESH, and generates a secondary mesh containing fracture and matrix elements with identical data formats on file MINC.« less

Singularities and n-dimensional black holes in torsion theories

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cembranos, J.A.R.; Valcarcel, J. Gigante; Torralba, F.J. Maldonado, E-mail: cembra@fis.ucm.es, E-mail: jorgegigante@ucm.es, E-mail: fmaldo01@ucm.es

2017-04-01

In this work we have studied the singular behaviour of gravitational theories with non symmetric connections. For this purpose we introduce a new criteria for the appearance of singularities based on the existence of black/white hole regions of arbitrary codimension defined inside a spacetime of arbitrary dimension. We discuss this prescription by increasing the complexity of the particular torsion theory under study. In this sense, we start with Teleparallel Gravity, then we analyse Einstein-Cartan theory, and finally dynamical torsion models.

Extrusion-Based 3D Printing of Hierarchically Porous Advanced Battery Electrodes.

PubMed

Lacey, Steven D; Kirsch, Dylan J; Li, Yiju; Morgenstern, Joseph T; Zarket, Brady C; Yao, Yonggang; Dai, Jiaqi; Garcia, Laurence Q; Liu, Boyang; Gao, Tingting; Xu, Shaomao; Raghavan, Srinivasa R; Connell, John W; Lin, Yi; Hu, Liangbing

2018-03-01

A highly porous 2D nanomaterial, holey graphene oxide (hGO), is synthesized directly from holey graphene powder and employed to create an aqueous 3D printable ink without the use of additives or binders. Stable dispersions of hydrophilic hGO sheets in water (≈100 mg mL -1 ) can be readily achieved. The shear-thinning behavior of the aqueous hGO ink enables extrusion-based printing of fine filaments into complex 3D architectures, such as stacked mesh structures, on arbitrary substrates. The freestanding 3D printed hGO meshes exhibit trimodal porosity: nanoscale (4-25 nm through-holes on hGO sheets), microscale (tens of micrometer-sized pores introduced by lyophilization), and macroscale (<500 µm square pores of the mesh design), which are advantageous for high-performance energy storage devices that rely on interfacial reactions to promote full active-site utilization. To elucidate the benefit of (nano)porosity and structurally conscious designs, the additive-free architectures are demonstrated as the first 3D printed lithium-oxygen (Li-O 2 ) cathodes and characterized alongside 3D printed GO-based materials without nanoporosity as well as nanoporous 2D vacuum filtrated films. The results indicate the synergistic effect between 2D nanomaterials, hierarchical porosity, and overall structural design, as well as the promise of a freeform generation of high-energy-density battery systems. © 2018 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Evaluation and correction of laser-scanned point clouds

NASA Astrophysics Data System (ADS)

Teutsch, Christian; Isenberg, Tobias; Trostmann, Erik; Weber, Michael; Berndt, Dirk; Strothotte, Thomas

2005-01-01

The digitalization of real-world objects is of great importance in various application domains. E.g. in industrial processes quality assurance is very important. Geometric properties of workpieces have to be measured. Traditionally, this is done with gauges which is somewhat subjective and time-consuming. We developed a robust optical laser scanner for the digitalization of arbitrary objects, primary, industrial workpieces. As measuring principle we use triangulation with structured lighting and a multi-axis locomotor system. Measurements on the generated data leads to incorrect results if the contained error is too high. Therefore, processes for geometric inspection under non-laboratory conditions are needed that are robust in permanent use and provide high accuracy as well as high operation speed. The many existing methods for polygonal mesh optimization produce very esthetic 3D models but often require user interaction and are limited in processing speed and/or accuracy. Furthermore, operations on optimized meshes consider the entire model and pay only little attention to individual measurements. However, many measurements contribute to parts or single scans with possibly strong differences between neighboring scans being lost during mesh construction. Also, most algorithms consider unsorted point clouds although the scanned data is structured through device properties and measuring principles. We use this underlying structure to achieve high processing speeds and extract intrinsic system parameters and use them for fast pre-processing.

New Computer Simulations of Macular Neural Functioning

NASA Technical Reports Server (NTRS)

Ross, Muriel D.; Doshay, D.; Linton, S.; Parnas, B.; Montgomery, K.; Chimento, T.

1994-01-01

We use high performance graphics workstations and supercomputers to study the functional significance of the three-dimensional (3-D) organization of gravity sensors. These sensors have a prototypic architecture foreshadowing more complex systems. Scaled-down simulations run on a Silicon Graphics workstation and scaled-up, 3-D versions run on a Cray Y-MP supercomputer. A semi-automated method of reconstruction of neural tissue from serial sections studied in a transmission electron microscope has been developed to eliminate tedious conventional photography. The reconstructions use a mesh as a step in generating a neural surface for visualization. Two meshes are required to model calyx surfaces. The meshes are connected and the resulting prisms represent the cytoplasm and the bounding membranes. A finite volume analysis method is employed to simulate voltage changes along the calyx in response to synapse activation on the calyx or on calyceal processes. The finite volume method insures that charge is conserved at the calyx-process junction. These and other models indicate that efferent processes act as voltage followers, and that the morphology of some afferent processes affects their functioning. In a final application, morphological information is symbolically represented in three dimensions in a computer. The possible functioning of the connectivities is tested using mathematical interpretations of physiological parameters taken from the literature. Symbolic, 3-D simulations are in progress to probe the functional significance of the connectivities. This research is expected to advance computer-based studies of macular functioning and of synaptic plasticity.

Mean-field equations for neuronal networks with arbitrary degree distributions.

PubMed

Nykamp, Duane Q; Friedman, Daniel; Shaker, Sammy; Shinn, Maxwell; Vella, Michael; Compte, Albert; Roxin, Alex

2017-04-01

The emergent dynamics in networks of recurrently coupled spiking neurons depends on the interplay between single-cell dynamics and network topology. Most theoretical studies on network dynamics have assumed simple topologies, such as connections that are made randomly and independently with a fixed probability (Erdös-Rényi network) (ER) or all-to-all connected networks. However, recent findings from slice experiments suggest that the actual patterns of connectivity between cortical neurons are more structured than in the ER random network. Here we explore how introducing additional higher-order statistical structure into the connectivity can affect the dynamics in neuronal networks. Specifically, we consider networks in which the number of presynaptic and postsynaptic contacts for each neuron, the degrees, are drawn from a joint degree distribution. We derive mean-field equations for a single population of homogeneous neurons and for a network of excitatory and inhibitory neurons, where the neurons can have arbitrary degree distributions. Through analysis of the mean-field equations and simulation of networks of integrate-and-fire neurons, we show that such networks have potentially much richer dynamics than an equivalent ER network. Finally, we relate the degree distributions to so-called cortical motifs.

Quantum-assisted learning of graphical models with arbitrary pairwise connectivity

NASA Astrophysics Data System (ADS)

Realpe-Gómez, John; Benedetti, Marcello; Biswas, Rupak; Perdomo-Ortiz, Alejandro

Mainstream machine learning techniques rely heavily on sampling from generally intractable probability distributions. There is increasing interest in the potential advantages of using quantum computing technologies as sampling engines to speedup these tasks. However, some pressing challenges in state-of-the-art quantum annealers have to be overcome before we can assess their actual performance. The sparse connectivity, resulting from the local interaction between quantum bits in physical hardware implementations, is considered the most severe limitation to the quality of constructing powerful machine learning models. Here we show how to surpass this `curse of limited connectivity' bottleneck and illustrate our findings by training probabilistic generative models with arbitrary pairwise connectivity on a real dataset of handwritten digits and two synthetic datasets in experiments with up to 940 quantum bits. Our model can be trained in quantum hardware without full knowledge of the effective parameters specifying the corresponding Boltzmann-like distribution. Therefore, the need to infer the effective temperature at each iteration is avoided, speeding up learning, and the effect of noise in the control parameters is mitigated, improving accuracy. This work was supported in part by NASA, AFRL, ODNI, and IARPA.

Mean-field equations for neuronal networks with arbitrary degree distributions

NASA Astrophysics Data System (ADS)

Nykamp, Duane Q.; Friedman, Daniel; Shaker, Sammy; Shinn, Maxwell; Vella, Michael; Compte, Albert; Roxin, Alex

2017-04-01

The emergent dynamics in networks of recurrently coupled spiking neurons depends on the interplay between single-cell dynamics and network topology. Most theoretical studies on network dynamics have assumed simple topologies, such as connections that are made randomly and independently with a fixed probability (Erdös-Rényi network) (ER) or all-to-all connected networks. However, recent findings from slice experiments suggest that the actual patterns of connectivity between cortical neurons are more structured than in the ER random network. Here we explore how introducing additional higher-order statistical structure into the connectivity can affect the dynamics in neuronal networks. Specifically, we consider networks in which the number of presynaptic and postsynaptic contacts for each neuron, the degrees, are drawn from a joint degree distribution. We derive mean-field equations for a single population of homogeneous neurons and for a network of excitatory and inhibitory neurons, where the neurons can have arbitrary degree distributions. Through analysis of the mean-field equations and simulation of networks of integrate-and-fire neurons, we show that such networks have potentially much richer dynamics than an equivalent ER network. Finally, we relate the degree distributions to so-called cortical motifs.

Effects of polyglactin mesh combined with resorbable calcium carbonate or replamineform hydroxyapatite on periodontal repair in dogs.

PubMed

Moon, I S; Chai, J K; Cho, K S; Wikesjö, U M; Kim, C K

1996-10-01

This study evaluates periodontal repair and biomaterial reaction following implantation of a polyglactin mesh with or without porous resorbable calcium carbonate (RCC) or porous replamineform hydroxyapatite (RHA) in conjunction with reconstructive surgery. Ligature- and surgically-induced interproximal periodontal defects of left and right mandibular premolar teeth in 7 dogs were used. Bilaterally, mesial defects of the 2nd, 3rd and 4th premolar teeth were treated with polyglactin mesh, polyglactin mesh and RHA, or polyglactin mesh and RCC, respectively. The polyglactin mesh, shaped according to the contour of the defect, was adapted to the experimental teeth; its coronal margin positioned immediately apical to the cemento-enamel junction. Gingival flap margins were adapted and sutured to cover the polyglactin mesh completely. Clinical healing was generally uneventful. The dogs were sacrificed to provide block sections for histologic evaluation at 1, 3, 6, 12, 26, 32 and 56 weeks following wound closure. Generally, cementum regeneration was observed beginning at week 6 in all groups. Bone regeneration was observed from week 3 in polyglactin mesh-treated groups, and from week 6 in polyglactin mesh+RCC or polyglactin mesh+RHA treated groups. Bone regeneration appeared enhanced in polyglactin mesh+RCC or polyglactin mesh+RHA treated defects at week 12 and 26, with little difference between the three experimental conditions at week 56. Polyglactin mesh degradation was observed at week 3 and appeared complete at week 12. The RHA did not appear to resorb, while the RCC was gradually replaced by bone from week 3. Within limitations of the study conditions, periodontal regeneration was observed following implantation of a polyglactin mesh with or without RCC or RHA in conjunction with reconstructive surgery. As a conclusion, there seems to be no significant difference in periodontal regeneration after 12 months of healing between the group treated with the membrane only, and the group treated with the membrane and the bone substitution material. Changes in connective fiber orientation over the 1st 12 weeks of healing may suggest that "fibrous encapsulation" observed in earlier studies may only represent a transient stage in periodontal regeneration.

Implementation of non-axisymmetric mesh system in the gyrokinetic PIC code (XGC) for Stellarators

NASA Astrophysics Data System (ADS)

Moritaka, Toseo; Hager, Robert; Cole, Micheal; Chang, Choong-Seock; Lazerson, Samuel; Ku, Seung-Hoe; Ishiguro, Seiji

2017-10-01

Gyrokinetic simulation is a powerful tool to investigate turbulent and neoclassical transports based on the first-principles of plasma kinetics. The gyrokinetic PIC code XGC has been developed for integrated simulations that cover the entire region of Tokamaks. Complicated field line and boundary structures should be taken into account to demonstrate edge plasma dynamics under the influence of X-point and vessel components. XGC employs gyrokinetic Poisson solver on unstructured triangle mesh to deal with this difficulty. We introduce numerical schemes newly developed for XGC simulation in non-axisymmetric Stellarator geometry. Triangle meshes in each poloidal plane are defined by PEST poloidal angle in the VMEC equilibrium so that they have the same regular structure in the straight field line coordinate. Electric charge of marker particle is distributed to the triangles specified by the field-following projection to the neighbor poloidal planes. 3D spline interpolation in a cylindrical mesh is also used to obtain equilibrium magnetic field at the particle position. These schemes capture the anisotropic plasma dynamics and resulting potential structure with high accuracy. The triangle meshes can smoothly connect to unstructured meshes in the edge region. We will present the validation test in the core region of Large Helical Device and discuss about future challenges toward edge simulations.

The ADER-DG method for seismic wave propagation and earthquake rupture dynamics

NASA Astrophysics Data System (ADS)

Pelties, Christian; Gabriel, Alice; Ampuero, Jean-Paul; de la Puente, Josep; Käser, Martin

2013-04-01

We will present the Arbitrary high-order DERivatives Discontinuous Galerkin (ADER-DG) method for solving the combined elastodynamic wave propagation and dynamic rupture problem. The ADER-DG method enables high-order accuracy in space and time while being implemented on unstructured tetrahedral meshes. A tetrahedral element discretization provides rapid and automatized mesh generation as well as geometrical flexibility. Features as mesh coarsening and local time stepping schemes can be applied to reduce computational efforts without introducing numerical artifacts. The method is well suited for parallelization and large scale high-performance computing since only directly neighboring elements exchange information via numerical fluxes. The concept of fluxes is a key ingredient of the numerical scheme as it governs the numerical dispersion and diffusion properties and allows to accommodate for boundary conditions, empirical friction laws of dynamic rupture processes, or the combination of different element types and non-conforming mesh transitions. After introducing fault dynamics into the ADER-DG framework, we will demonstrate its specific advantages in benchmarking test scenarios provided by the SCEC/USGS Spontaneous Rupture Code Verification Exercise. An important result of the benchmark is that the ADER-DG method avoids spurious high-frequency contributions in the slip rate spectra and therefore does not require artificial Kelvin-Voigt damping, filtering or other modifications of the produced synthetic seismograms. To demonstrate the capabilities of the proposed scheme we simulate an earthquake scenario, inspired by the 1992 Landers earthquake, that includes branching and curved fault segments. Furthermore, topography is respected in the discretized model to capture the surface waves correctly. The advanced geometrical flexibility combined with an enhanced accuracy will make the ADER-DG method a useful tool to study earthquake dynamics on complex fault systems in realistic rheologies.

Maxis-A rezoning and remapping code in two dimensional cylindrical geometry

NASA Astrophysics Data System (ADS)

Lin, Zhiwei; Jiang, Shaoen; Zhang, Lu; Kuang, Longyu; Li, Hang

2018-06-01

This paper presents the new version of our code Maxis (Lin et al., 2011). Maxis is a local rezoning and remapping code in two dimensional cylindrical geometry, which can be employed to address the grid distortion problem of unstructured meshes. The new version of Maxis is mostly programmed in the C language which considerably improves its computational efficiency with respect to the former Matlab version. A new algorithm for determining the intersection of two arbitrary convex polygons is also incorporated into the new version. Some additional linking functions are further provided in the new version for the purpose of combining Maxis and MULTI2D.

Solution of internal ballistic problem for SRM with grain of complex shape during main firing phase

NASA Astrophysics Data System (ADS)

Kiryushkin, A. E.; Minkov, L. L.

2017-10-01

Solid rocket motor (SRM) internal ballistics problems are related to the problems with moving boundaries. The algorithm able to solve similar problems in axisymmetric formulation on Cartesian mesh with an arbitrary order of accuracy is considered in this paper. The base of this algorithm is the ghost point extrapolation using inverse Lax-Wendroff procedure. Level set method is used as an implicit representation of the domain boundary. As an example, the internal ballistics problem for SRM with umbrella type grain was solved during the main firing phase. In addition, flow parameters distribution in the combustion chamber was obtained for different time moments.

Aerodynamic interaction between vortical wakes and lifting two-dimensional bodies

NASA Technical Reports Server (NTRS)

Stremel, Paul M.

1987-01-01

Unsteady rotor wake interactions with the empenage, tail boom, and other aerodynamic surfaces of a helicopter have a significant influence on its aerodynamic performance, the ride quality, and amount of vibration. A numerical method for computing the aerodynamic interaction between an interacting vortex wake and the viscous flow about arbitrary two-dimensional bodies has been developed to address this helicopter problem. The method solves for the flow field velocities on a body-fitted computational mesh using finite-difference techniques. The interaction of a rotor wake with the flow about a 4:1 elliptic cylinder at 45-deg incidence was calculated for a Reynolds number of 3000.

An entropy stable nodal discontinuous Galerkin method for the two dimensional shallow water equations on unstructured curvilinear meshes with discontinuous bathymetry

NASA Astrophysics Data System (ADS)

Wintermeyer, Niklas; Winters, Andrew R.; Gassner, Gregor J.; Kopriva, David A.

2017-07-01

We design an arbitrary high-order accurate nodal discontinuous Galerkin spectral element approximation for the non-linear two dimensional shallow water equations with non-constant, possibly discontinuous, bathymetry on unstructured, possibly curved, quadrilateral meshes. The scheme is derived from an equivalent flux differencing formulation of the split form of the equations. We prove that this discretization exactly preserves the local mass and momentum. Furthermore, combined with a special numerical interface flux function, the method exactly preserves the mathematical entropy, which is the total energy for the shallow water equations. By adding a specific form of interface dissipation to the baseline entropy conserving scheme we create a provably entropy stable scheme. That is, the numerical scheme discretely satisfies the second law of thermodynamics. Finally, with a particular discretization of the bathymetry source term we prove that the numerical approximation is well-balanced. We provide numerical examples that verify the theoretical findings and furthermore provide an application of the scheme for a partial break of a curved dam test problem.

Modeling NIF experimental designs with adaptive mesh refinement and Lagrangian hydrodynamics

NASA Astrophysics Data System (ADS)

Koniges, A. E.; Anderson, R. W.; Wang, P.; Gunney, B. T. N.; Becker, R.; Eder, D. C.; MacGowan, B. J.; Schneider, M. B.

2006-06-01

Incorporation of adaptive mesh refinement (AMR) into Lagrangian hydrodynamics algorithms allows for the creation of a highly powerful simulation tool effective for complex target designs with three-dimensional structure. We are developing an advanced modeling tool that includes AMR and traditional arbitrary Lagrangian-Eulerian (ALE) techniques. Our goal is the accurate prediction of vaporization, disintegration and fragmentation in National Ignition Facility (NIF) experimental target elements. Although our focus is on minimizing the generation of shrapnel in target designs and protecting the optics, the general techniques are applicable to modern advanced targets that include three-dimensional effects such as those associated with capsule fill tubes. Several essential computations in ordinary radiation hydrodynamics need to be redesigned in order to allow for AMR to work well with ALE, including algorithms associated with radiation transport. Additionally, for our goal of predicting fragmentation, we include elastic/plastic flow into our computations. We discuss the integration of these effects into a new ALE-AMR simulation code. Applications of this newly developed modeling tool as well as traditional ALE simulations in two and three dimensions are applied to NIF early-light target designs.

A virtual surgical training system that simulates cutting of soft tissue using a modified pre-computed elastic model.

PubMed

Toe, Kyaw Kyar; Huang, Weimin; Yang, Tao; Duan, Yuping; Zhou, Jiayin; Su, Yi; Teo, Soo-Kng; Kumar, Selvaraj Senthil; Lim, Calvin Chi-Wan; Chui, Chee Kong; Chang, Stephen

2015-08-01

This work presents a surgical training system that incorporates cutting operation of soft tissue simulated based on a modified pre-computed linear elastic model in the Simulation Open Framework Architecture (SOFA) environment. A precomputed linear elastic model used for the simulation of soft tissue deformation involves computing the compliance matrix a priori based on the topological information of the mesh. While this process may require a few minutes to several hours, based on the number of vertices in the mesh, it needs only to be computed once and allows real-time computation of the subsequent soft tissue deformation. However, as the compliance matrix is based on the initial topology of the mesh, it does not allow any topological changes during simulation, such as cutting or tearing of the mesh. This work proposes a way to modify the pre-computed data by correcting the topological connectivity in the compliance matrix, without re-computing the compliance matrix which is computationally expensive.

Effect of mesh-peel ply variation on mechanical properties of E-glas composite by infusion vacuum method

NASA Astrophysics Data System (ADS)

Abdurohman, K.; Siahaan, Mabe

2018-04-01

Composite materials made of glass fiber EW-135 with epoxy lycal resin with vacuum infusion method have been performed. The dried glass fiber is arranged in a mold then connected to a vacuum machine and a resin tube. Then, the vacuum machine is turned on and at the same time the resin is sucked and flowed into the mold. This paper reports on the effect of using mesh- peel ply singles on upper-side laminates called A and the effect of using double mesh-peel ply on upper and lower-side laminates call B with glass fiber arrangement is normal and ± 450 in vacuum infusion process. Followed by the manufacture of tensile test specimen and tested its tensile strength with universal test machine 100kN Tensilon RTF 2410, at room temperature with constant crosshead speed. From tensile test results using single and double layers showed that double mesh-peel ply can increase tensile strength 14% and Young modulus 17%.

Topological patterns of mesh textures in serpentinites

NASA Astrophysics Data System (ADS)

Miyazawa, M.; Suzuki, A.; Shimizu, H.; Okamoto, A.; Hiraoka, Y.; Obayashi, I.; Tsuji, T.; Ito, T.

2017-12-01

Serpentinization is a hydration process that forms serpentine minerals and magnetite within the oceanic lithosphere. Microfractures crosscut these minerals during the reactions, and the structures look like mesh textures. It has been known that the patterns of microfractures and the system evolutions are affected by the hydration reaction and fluid transport in fractures and within matrices. This study aims at quantifying the topological patterns of the mesh textures and understanding possible conditions of fluid transport and reaction during serpentinization in the oceanic lithosphere. Two-dimensional simulation by the distinct element method (DEM) generates fracture patterns due to serpentinization. The microfracture patterns are evaluated by persistent homology, which measures features of connected components of a topological space and encodes multi-scale topological features in the persistence diagrams. The persistence diagrams of the different mesh textures are evaluated by principal component analysis to bring out the strong patterns of persistence diagrams. This approach help extract feature values of fracture patterns from high-dimensional and complex datasets.

Numerical simulation of tunneling through arbitrary potential barriers applied on MIM and MIIM rectenna diodes

NASA Astrophysics Data System (ADS)

Abdolkader, Tarek M.; Shaker, Ahmed; Alahmadi, A. N. M.

2018-07-01

With the continuous miniaturization of electronic devices, quantum-mechanical effects such as tunneling become more effective in many device applications. In this paper, a numerical simulation tool is developed under a MATLAB environment to calculate the tunneling probability and current through an arbitrary potential barrier comparing three different numerical techniques: the finite difference method, transfer matrix method, and transmission line method. For benchmarking, the tool is applied to many case studies such as the rectangular single barrier, rectangular double barrier, and continuous bell-shaped potential barrier, each compared to analytical solutions and giving the dependence of the error on the number of mesh points. In addition, a thorough study of the J ‑ V characteristics of MIM and MIIM diodes, used as rectifiers for rectenna solar cells, is presented and simulations are compared to experimental results showing satisfactory agreement. On the undergraduate level, the tool provides a deeper insight for students to compare numerical techniques used to solve various tunneling problems and helps students to choose a suitable technique for a certain application.

Smart-Home Architecture Based on Bluetooth mesh Technology

NASA Astrophysics Data System (ADS)

Wan, Qing; Liu, Jianghua

2018-03-01

This paper describes the smart home network system based on Nordic nrf52832 device. Nrf52832 is new generation RF SOC device focus on sensor monitor and low power Bluetooth connection applications. In this smart home system, we set up a self-organizing network system which consists of one control node and a lot of monitor nodes. The control node manages the whole network works; the monitor nodes collect the sensor information such as light intensity, temperature, humidity, PM2.5, etc. Then update to the control node by Bluetooth mesh network. The design results show that the Bluetooth mesh wireless network system is flexible and construction cost is low, which is suitable for the communication characteristics of a smart home network. We believe it will be wildly used in the future.

Aspects of Unstructured Grids and Finite-Volume Solvers for the Euler and Navier-Stokes Equations

NASA Technical Reports Server (NTRS)

Barth, Timothy J.

1992-01-01

One of the major achievements in engineering science has been the development of computer algorithms for solving nonlinear differential equations such as the Navier-Stokes equations. In the past, limited computer resources have motivated the development of efficient numerical schemes in computational fluid dynamics (CFD) utilizing structured meshes. The use of structured meshes greatly simplifies the implementation of CFD algorithms on conventional computers. Unstructured grids on the other hand offer an alternative to modeling complex geometries. Unstructured meshes have irregular connectivity and usually contain combinations of triangles, quadrilaterals, tetrahedra, and hexahedra. The generation and use of unstructured grids poses new challenges in CFD. The purpose of this note is to present recent developments in the unstructured grid generation and flow solution technology.

Decomposability and convex structure of thermal processes

NASA Astrophysics Data System (ADS)

Mazurek, Paweł; Horodecki, Michał

2018-05-01

We present an example of a thermal process (TP) for a system of d energy levels, which cannot be performed without an instant access to the whole energy space. This TP is uniquely connected with a transition between some states of the system, that cannot be performed without access to the whole energy space even when approximate transitions are allowed. Pursuing the question about the decomposability of TPs into convex combinations of compositions of processes acting non-trivially on smaller subspaces, we investigate transitions within the subspace of states diagonal in the energy basis. For three level systems, we determine the set of extremal points of these operations, as well as the minimal set of operations needed to perform an arbitrary TP, and connect the set of TPs with thermomajorization criterion. We show that the structure of the set depends on temperature, which is associated with the fact that TPs cannot increase deterministically extractable work from a state—the conclusion that holds for arbitrary d level system. We also connect the decomposability problem with detailed balance symmetry of an extremal TPs.

Performance characteristics of a nanoscale double-gate reconfigurable array

NASA Astrophysics Data System (ADS)

Beckett, Paul

2008-12-01

The double gate transistor is a promising device applicable to deep sub-micron design due to its inherent resistance to short-channel effects and superior subthreshold performance. Using both TCAD and SPICE circuit simulation, it is shown that the characteristics of fully depleted dual-gate thin-body Schottky barrier silicon transistors will not only uncouple the conflicting requirements of high performance and low standby power in digital logic, but will also allow the development of a locally-connected reconfigurable computing mesh. The magnitude of the threshold shift effect will scale with device dimensions and will remain compatible with oxide reliability constraints. A field-programmable architecture based on the double gate transistor is described in which the operating point of the circuit is biased via one gate while the other gate is used to form the logic array, such that complex heterogeneous computing functions may be developed from this homogeneous, mesh-connected organization.

Performance of highly connected photonic switching lossless metro-access optical networks

NASA Astrophysics Data System (ADS)

Martins, Indayara Bertoldi; Martins, Yara; Barbosa, Felipe Rudge

2018-03-01

The present work analyzes the performance of photonic switching networks, optical packet switching (OPS) and optical burst switching (OBS), in mesh topology of different sizes and configurations. The "lossless" photonic switching node is based on a semiconductor optical amplifier, demonstrated and validated with experimental results on optical power gain, noise figure, and spectral range. The network performance was evaluated through computer simulations based on parameters such as average number of hops, optical packet loss fraction, and optical transport delay (Am). The combination of these elements leads to a consistent account of performance, in terms of network traffic and packet delivery for OPS and OBS metropolitan networks. Results show that a combination of highly connected mesh topologies having an ingress e-buffer present high efficiency and throughput, with very low packet loss and low latency, ensuring fast data delivery to the final receiver.

Hybrid powertrain system

DOEpatents

Grillo, Ricardo C.; O'Neil, Walter K.; Preston, David M.

2005-09-20

A hybrid powertrain system is provided that includes a first prime mover having a rotational output, a second prime mover having a rotational output, and a transmission having a main shaft supporting at least two main shaft gears thereon. The transmission includes a first independent countershaft drivingly connected to the first prime mover and including at least one ratio gear supported thereon that meshes with a respective main shaft gear. A second independent countershaft is drivingly connected to the second prime mover and includes at least one ratio gear supported thereon that meshes with a respective main shaft gear. The ratio gears on the first and second countershafts cooperate with the main shaft gears to provide at least one gear ratio between the first and second countershafts and the main shaft. A shift control mechanism selectively engages and disengages the first and second countershafts for rotation with the main shaft.

A comparative study of an ABC and an artificial absorber for truncating finite element meshes

NASA Technical Reports Server (NTRS)

Oezdemir, T.; Volakis, John L.

1993-01-01

The type of mesh termination used in the context of finite element formulations plays a major role on the efficiency and accuracy of the field solution. The performance of an absorbing boundary condition (ABC) and an artificial absorber (a new concept) for terminating the finite element mesh was evaluated. This analysis is done in connection with the problem of scattering by a finite slot array in a thick ground plane. The two approximate mesh truncation schemes are compared with the exact finite element-boundary integral (FEM-BI) method in terms of accuracy and efficiency. It is demonstrated that both approximate truncation schemes yield reasonably accurate results even when the mesh is extended only 0.3 wavelengths away from the array aperture. However, the artificial absorber termination method leads to a substantially more efficient solution. Moreover, it is shown that the FEM-BI method remains quite competitive with the FEM-artificial absorber method when the FFT is used for computing the matrix-vector products in the iterative solution algorithm. These conclusions are indeed surprising and of major importance in electromagnetic simulations based on the finite element method.

Spinning geodesic Witten diagrams

DOE PAGES

Dyer, Ethan; Freedman, Daniel Z.; Sully, James

2017-11-10

We present an expression for the four-point conformal blocks of symmetric traceless operators of arbitrary spin as an integral over a pair of geodesics in Anti-de Sitter space, generalizing the geodesic Witten diagram formalism of Hijano et al. to arbitrary spin. As an intermediate step in the derivation, we identify a convenient basis of bulk threepoint interaction vertices which give rise to all possible boundary three point structures. Lastly, we highlight a direct connection between the representation of the conformal block as geodesic Witten diagram and the shadow operator formalism.

Development of an unstructured solution adaptive method for the quasi-three-dimensional Euler and Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Jiang, Yi-Tsann

1993-01-01

A general solution adaptive scheme-based on a remeshing technique is developed for solving the two-dimensional and quasi-three-dimensional Euler and Favre-averaged Navier-Stokes equations. The numerical scheme is formulated on an unstructured triangular mesh utilizing an edge-based pointer system which defines the edge connectivity of the mesh structure. Jameson's four-stage hybrid Runge-Kutta scheme is used to march the solution in time. The convergence rate is enhanced through the use of local time stepping and implicit residual averaging. As the solution evolves, the mesh is regenerated adaptively using flow field information. Mesh adaptation parameters are evaluated such that an estimated local numerical error is equally distributed over the whole domain. For inviscid flows, the present approach generates a complete unstructured triangular mesh using the advancing front method. For turbulent flows, the approach combines a local highly stretched structured triangular mesh in the boundary layer region with an unstructured mesh in the remaining regions to efficiently resolve the important flow features. One-equation and two-equation turbulence models are incorporated into the present unstructured approach. Results are presented for a wide range of flow problems including two-dimensional multi-element airfoils, two-dimensional cascades, and quasi-three-dimensional cascades. This approach is shown to gain flow resolution in the refined regions while achieving a great reduction in the computational effort and storage requirements since solution points are not wasted in regions where they are not required.

Development of an unstructured solution adaptive method for the quasi-three-dimensional Euler and Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Jiang, Yi-Tsann; Usab, William J., Jr.

1993-01-01

A general solution adaptive scheme based on a remeshing technique is developed for solving the two-dimensional and quasi-three-dimensional Euler and Favre-averaged Navier-Stokes equations. The numerical scheme is formulated on an unstructured triangular mesh utilizing an edge-based pointer system which defines the edge connectivity of the mesh structure. Jameson's four-stage hybrid Runge-Kutta scheme is used to march the solution in time. The convergence rate is enhanced through the use of local time stepping and implicit residual averaging. As the solution evolves, the mesh is regenerated adaptively using flow field information. Mesh adaptation parameters are evaluated such that an estimated local numerical error is equally distributed over the whole domain. For inviscid flows, the present approach generates a complete unstructured triangular mesh using the advancing front method. For turbulent flows, the approach combines a local highly stretched structured triangular mesh in the boundary layer region with an unstructured mesh in the remaining regions to efficiently resolve the important flow features. One-equation and two-equation turbulence models are incorporated into the present unstructured approach. Results are presented for a wide range of flow problems including two-dimensional multi-element airfoils, two-dimensional cascades, and quasi-three-dimensional cascades. This approach is shown to gain flow resolution in the refined regions while achieving a great reduction in the computational effort and storage requirements since solution points are not wasted in regions where they are not required.

Orbital Transfer Techniques for Round-Trip Mars Missions

NASA Astrophysics Data System (ADS)

Landau, D. F.; Barbee, B. W.; Woolley, R. C.; Gershman, R.

2012-06-01

Efficient methods to transfer among a variety of Mars orbits is presented. Emphasis is placed on connecting arrival and departure interplanetary trajectories to an arbitrary circular target orbit for a hybrid human/robotic Mars sample return mission.

The role of symmetry in the regulation of brain dynamics

NASA Astrophysics Data System (ADS)

Tang, Evelyn; Giusti, Chad; Cieslak, Matthew; Grafton, Scott; Bassett, Danielle

Synchronous neural processes regulate a wide range of behaviors from attention to learning. Yet structural constraints on these processes are far from understood. We draw on new theoretical links between structural symmetries and the control of synchronous function, to offer a reconceptualization of the relationships between brain structure and function in human and non-human primates. By classifying 3-node motifs in macaque connectivity data, we find the most prevalent motifs can theoretically ensure a diversity of function including strict synchrony as well as control to arbitrary states. The least prevalent motifs are theoretically controllable to arbitrary states, which may not be desirable in a biological system. In humans, regions with high topological similarity of connections (a continuous notion related to symmetry) are most commonly found in fronto-parietal systems, which may account for their critical role in cognitive control. Collectively, our work underscores the role of symmetry and topological similarity in regulating dynamics of brain function.

Correctness Proof of a Self-Stabilizing Distributed Clock Synchronization Protocol for Arbitrary Digraphs

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R.

2011-01-01

This report presents a deductive proof of a self-stabilizing distributed clock synchronization protocol. It is focused on the distributed clock synchronization of an arbitrary, non-partitioned digraph ranging from fully connected to 1-connected networks of nodes while allowing for differences in the network elements. This protocol does not rely on assumptions about the initial state of the system, and no central clock or a centrally generated signal, pulse, or message is used. Nodes are anonymous, i.e., they do not have unique identities. There is no theoretical limit on the maximum number of participating nodes. The only constraint on the behavior of the node is that the interactions with other nodes are restricted to defined links and interfaces. We present a deductive proof of the correctness of the protocol as it applies to the networks with unidirectional and bidirectional links. We also confirm the claims of determinism and linear convergence.

[Research of the durability of connective tissue complexes formed in the implantation area of various types of allograft during the experiment].

PubMed

Ioffe, O Iu; Shvets', I M; Stetsenko, O P; Tsiura, Iu P; Tarasiuk, T V; Lamashevs'kyĭ, V P; Makovets'kyĭ, I V; Furmanov, Iu O

2014-01-01

The aim of the study is to examine in the experiment on the animals the mechanical properties of connective tissue complexes formed in alloplasty area using the intraperitoneal on lay mesh and sublay methodologies with further comparison of them. The experiment has been conducted on 12 rabbits of Russian chinchilla breed. Animals were distributed in the following way: the first group--operated by intraperitoneal on lay mesh methodology (n = 6) through implantation of composite grid Proceed with one-side celullose coating produced by "Ethicon" company. The second group--performed modeling of preperitoneal plastic using two-component composite grid with large-pores Ultrapro produced by "Ethicon" company (n = 6). For the tensometric evaluation of the strength of implant integration into the red wall was used entire area of anterior red wall together with the implanted transplant. According to the deflection diagrams and dynamometer rates defined the maximum burden rates which is equivalent of muscular tissue budge against polymeric matrix. Statistically significant distinctions during 14 days were not detected; however strength during 30 days in the first group was 3 times higher than in the second group. We consider that the methodology of intraperitoneal on lay mesh can be considered as operation of choice of surgery treatment of the umbilical hernias.

Improved Simulation of Electrodiffusion in the Node of Ranvier by Mesh Adaptation.

PubMed

Dione, Ibrahima; Deteix, Jean; Briffard, Thomas; Chamberland, Eric; Doyon, Nicolas

2016-01-01

In neural structures with complex geometries, numerical resolution of the Poisson-Nernst-Planck (PNP) equations is necessary to accurately model electrodiffusion. This formalism allows one to describe ionic concentrations and the electric field (even away from the membrane) with arbitrary spatial and temporal resolution which is impossible to achieve with models relying on cable theory. However, solving the PNP equations on complex geometries involves handling intricate numerical difficulties related either to the spatial discretization, temporal discretization or the resolution of the linearized systems, often requiring large computational resources which have limited the use of this approach. In the present paper, we investigate the best ways to use the finite elements method (FEM) to solve the PNP equations on domains with discontinuous properties (such as occur at the membrane-cytoplasm interface). 1) Using a simple 2D geometry to allow comparison with analytical solution, we show that mesh adaptation is a very (if not the most) efficient way to obtain accurate solutions while limiting the computational efforts, 2) We use mesh adaptation in a 3D model of a node of Ranvier to reveal details of the solution which are nearly impossible to resolve with other modelling techniques. For instance, we exhibit a non linear distribution of the electric potential within the membrane due to the non uniform width of the myelin and investigate its impact on the spatial profile of the electric field in the Debye layer.

Model Checking A Self-Stabilizing Synchronization Protocol for Arbitrary Digraphs

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R.

2012-01-01

This report presents the mechanical verification of a self-stabilizing distributed clock synchronization protocol for arbitrary digraphs in the absence of faults. This protocol does not rely on assumptions about the initial state of the system, other than the presence of at least one node, and no central clock or a centrally generated signal, pulse, or message is used. The system under study is an arbitrary, non-partitioned digraph ranging from fully connected to 1-connected networks of nodes while allowing for differences in the network elements. Nodes are anonymous, i.e., they do not have unique identities. There is no theoretical limit on the maximum number of participating nodes. The only constraint on the behavior of the node is that the interactions with other nodes are restricted to defined links and interfaces. This protocol deterministically converges within a time bound that is a linear function of the self-stabilization period. A bounded model of the protocol is verified using the Symbolic Model Verifier (SMV) for a subset of digraphs. Modeling challenges of the protocol and the system are addressed. The model checking effort is focused on verifying correctness of the bounded model of the protocol as well as confirmation of claims of determinism and linear convergence with respect to the self-stabilization period.

Comparable Systems Analysis: Design and Operation of Advanced Control Centers

DOT National Transportation Integrated Search

2011-12-01

This paper examines next generation wide-area cellular such as fourth generation (4G) will be able to support vehicular applications, and how transportation infrastructure may mesh with wireless networks. This report is part of the Connected Vehicle ...

Grid generation in three dimensions by Poisson equations with control of cell size and skewness at boundary surfaces

NASA Technical Reports Server (NTRS)

Sorenson, R. L.; Steger, J. L.

1983-01-01

An algorithm for generating computational grids about arbitrary three-dimensional bodies is developed. The elliptic partial differential equation (PDE) approach developed by Steger and Sorenson and used in the NASA computer program GRAPE is extended from two to three dimensions. Forcing functions which are found automatically by the algorithm give the user the ability to control mesh cell size and skewness at boundary surfaces. This algorithm, as is typical of PDE grid generators, gives smooth grid lines and spacing in the interior of the grid. The method is applied to a rectilinear wind-tunnel case and to two body shapes in spherical coordinates.

A Weak Galerkin Method for the Reissner–Mindlin Plate in Primary Form

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mu, Lin; Wang, Junping; Ye, Xiu

We developed a new finite element method for the Reissner–Mindlin equations in its primary form by using the weak Galerkin approach. Like other weak Galerkin finite element methods, this one is highly flexible and robust by allowing the use of discontinuous approximating functions on arbitrary shape of polygons and, at the same time, is parameter independent on its stability and convergence. Furthermore, error estimates of optimal order in mesh size h are established for the corresponding weak Galerkin approximations. Numerical experiments are conducted for verifying the convergence theory, as well as suggesting some superconvergence and a uniform convergence of themore » method with respect to the plate thickness.« less

A Weak Galerkin Method for the Reissner–Mindlin Plate in Primary Form

DOE PAGES

Mu, Lin; Wang, Junping; Ye, Xiu

2017-10-04

We developed a new finite element method for the Reissner–Mindlin equations in its primary form by using the weak Galerkin approach. Like other weak Galerkin finite element methods, this one is highly flexible and robust by allowing the use of discontinuous approximating functions on arbitrary shape of polygons and, at the same time, is parameter independent on its stability and convergence. Furthermore, error estimates of optimal order in mesh size h are established for the corresponding weak Galerkin approximations. Numerical experiments are conducted for verifying the convergence theory, as well as suggesting some superconvergence and a uniform convergence of themore » method with respect to the plate thickness.« less

Free stream capturing in fluid conservation law for moving coordinates in three dimensions

NASA Technical Reports Server (NTRS)

Obayashi, Shigeru

1991-01-01

The free-stream capturing technique for both the finite-volume (FV) and finite-difference (FD) framework is summarized. For an arbitrary motion of the grid, the FV analysis shows that volumes swept by all six surfaces of the cell have to be computed correctly. This means that the free-stream capturing time-metric terms should be calculated not only from a surface vector of a cell at a single time level, but also from a volume swept by the cell surface in space and time. The FV free-stream capturing formulation is applicable to the FD formulation by proper translation from an FV cell to an FD mesh.

An Enriched Shell Element for Delamination Simulation in Composite Laminates

NASA Technical Reports Server (NTRS)

McElroy, Mark

2015-01-01

A formulation is presented for an enriched shell finite element capable of delamination simulation in composite laminates. The element uses an adaptive splitting approach for damage characterization that allows for straightforward low-fidelity model creation and a numerically efficient solution. The Floating Node Method is used in conjunction with the Virtual Crack Closure Technique to predict delamination growth and represent it discretely at an arbitrary ply interface. The enriched element is verified for Mode I delamination simulation using numerical benchmark data. After determining important mesh configuration guidelines for the vicinity of the delamination front in the model, a good correlation was found between the enriched shell element model results and the benchmark data set.

ms 2: A molecular simulation tool for thermodynamic properties, release 3.0

NASA Astrophysics Data System (ADS)

Rutkai, Gábor; Köster, Andreas; Guevara-Carrion, Gabriela; Janzen, Tatjana; Schappals, Michael; Glass, Colin W.; Bernreuther, Martin; Wafai, Amer; Stephan, Simon; Kohns, Maximilian; Reiser, Steffen; Deublein, Stephan; Horsch, Martin; Hasse, Hans; Vrabec, Jadran

2017-12-01

A new version release (3.0) of the molecular simulation tool ms 2 (Deublein et al., 2011; Glass et al. 2014) is presented. Version 3.0 of ms 2 features two additional ensembles, i.e. microcanonical (NVE) and isobaric-isoenthalpic (NpH), various Helmholtz energy derivatives in the NVE ensemble, thermodynamic integration as a method for calculating the chemical potential, the osmotic pressure for calculating the activity of solvents, the six Maxwell-Stefan diffusion coefficients of quaternary mixtures, statistics for sampling hydrogen bonds, smooth-particle mesh Ewald summation as well as the ability to carry out molecular dynamics runs for an arbitrary number of state points in a single program execution.

On physical-constraints-preserving schemes for special relativistic magnetohydrodynamics with a general equation of state

NASA Astrophysics Data System (ADS)

Wu, Kailiang; Tang, Huazhong

2018-06-01

The paper studies the physical-constraints-preserving (PCP) schemes for multi-dimensional special relativistic magnetohydrodynamics with a general equation of state (EOS) on more general meshes. It is an extension of the work (Wu and Tang in Math. Models Methods Appl. Sci. 27:1871-1928, 2017) which focuses on the ideal EOS and uniform Cartesian meshes. The general EOS without a special expression poses some additional difficulties in discussing the mathematical properties of admissible state set with the physical constraints on the fluid velocity, density and pressure. Rigorous analyses are provided for the PCP property of finite volume or discontinuous Galerkin schemes with the Lax-Friedrichs (LxF)-type flux on a general mesh with non-self-intersecting polytopes. Those are built on a more general form of generalized LxF splitting property and a different convex decomposition technique. It is shown in theory that the PCP property is closely connected with a discrete divergence-free condition, which is proposed on the general mesh and milder than that in Wu and Tang (2017).

Grid generation for the solution of partial differential equations

NASA Technical Reports Server (NTRS)

Eiseman, Peter R.; Erlebacher, Gordon

1989-01-01

A general survey of grid generators is presented with a concern for understanding why grids are necessary, how they are applied, and how they are generated. After an examination of the need for meshes, the overall applications setting is established with a categorization of the various connectivity patterns. This is split between structured grids and unstructured meshes. Altogether, the categorization establishes the foundation upon which grid generation techniques are developed. The two primary categories are algebraic techniques and partial differential equation techniques. These are each split into basic parts, and accordingly are individually examined in some detail. In the process, the interrelations between the various parts are accented. From the established background in the primary techniques, consideration is shifted to the topic of interactive grid generation and then to adaptive meshes. The setting for adaptivity is established with a suitable means to monitor severe solution behavior. Adaptive grids are considered first and are followed by adaptive triangular meshes. Then the consideration shifts to the temporal coupling between grid generators and PDE-solvers. To conclude, a reflection upon the discussion, herein, is given.

Grid generation for the solution of partial differential equations

NASA Technical Reports Server (NTRS)

Eiseman, Peter R.; Erlebacher, Gordon

1987-01-01

A general survey of grid generators is presented with a concern for understanding why grids are necessary, how they are applied, and how they are generated. After an examination of the need for meshes, the overall applications setting is established with a categorization of the various connectivity patterns. This is split between structured grids and unstructured meshes. Altogether, the categorization establishes the foundation upon which grid generation techniques are developed. The two primary categories are algebraic techniques and partial differential equation techniques. These are each split into basic parts, and accordingly are individually examined in some detail. In the process, the interrelations between the various parts are accented. From the established background in the primary techniques, consideration is shifted to the topic of interactive grid generation and then to adaptive meshes. The setting for adaptivity is established with a suitable means to monitor severe solution behavior. Adaptive grids are considered first and are followed by adaptive triangular meshes. Then the consideration shifts to the temporal coupling between grid generators and PDE-solvers. To conclude, a reflection upon the discussion, herein, is given.

Automated Generation of Finite-Element Meshes for Aircraft Conceptual Design

NASA Technical Reports Server (NTRS)

Li, Wu; Robinson, Jay

2016-01-01

This paper presents a novel approach for automated generation of fully connected finite-element meshes for all internal structural components and skins of a given wing-body geometry model, controlled by a few conceptual-level structural layout parameters. Internal structural components include spars, ribs, frames, and bulkheads. Structural layout parameters include spar/rib locations in wing chordwise/spanwise direction and frame/bulkhead locations in longitudinal direction. A simple shell thickness optimization problem with two load conditions is used to verify versatility and robustness of the automated meshing process. The automation process is implemented in ModelCenter starting from an OpenVSP geometry and ending with a NASTRAN 200 solution. One subsonic configuration and one supersonic configuration are used for numerical verification. Two different structural layouts are constructed for each configuration and five finite-element meshes of different sizes are generated for each layout. The paper includes various comparisons of solutions of 20 thickness optimization problems, as well as discussions on how the optimal solutions are affected by the stress constraint bound and the initial guess of design variables.

GRAPE- TWO-DIMENSIONAL GRIDS ABOUT AIRFOILS AND OTHER SHAPES BY THE USE OF POISSON'S EQUATION

NASA Technical Reports Server (NTRS)

Sorenson, R. L.

1994-01-01

The ability to treat arbitrary boundary shapes is one of the most desirable characteristics of a method for generating grids, including those about airfoils. In a grid used for computing aerodynamic flow over an airfoil, or any other body shape, the surface of the body is usually treated as an inner boundary and often cannot be easily represented as an analytic function. The GRAPE computer program was developed to incorporate a method for generating two-dimensional finite-difference grids about airfoils and other shapes by the use of the Poisson differential equation. GRAPE can be used with any boundary shape, even one specified by tabulated points and including a limited number of sharp corners. The GRAPE program has been developed to be numerically stable and computationally fast. GRAPE can provide the aerodynamic analyst with an efficient and consistent means of grid generation. The GRAPE procedure generates a grid between an inner and an outer boundary by utilizing an iterative procedure to solve the Poisson differential equation subject to geometrical restraints. In this method, the inhomogeneous terms of the equation are automatically chosen such that two important effects are imposed on the grid. The first effect is control of the spacing between mesh points along mesh lines intersecting the boundaries. The second effect is control of the angles with which mesh lines intersect the boundaries. Along with the iterative solution to Poisson's equation, a technique of coarse-fine sequencing is employed to accelerate numerical convergence. GRAPE program control cards and input data are entered via the NAMELIST feature. Each variable has a default value such that user supplied data is kept to a minimum. Basic input data consists of the boundary specification, mesh point spacings on the boundaries, and mesh line angles at the boundaries. Output consists of a dataset containing the grid data and, if requested, a plot of the generated mesh. The GRAPE program is written in FORTRAN IV for batch execution and has been implemented on a CDC 6000 series computer with a central memory requirement of approximately 135K (octal) of 60 bit words. For plotted output the commercially available DISSPLA graphics software package is required. The GRAPE program was developed in 1980.

Fuel cell with metal screen flow-field

DOEpatents

Wilson, M.S.; Zawodzinski, C.

1998-08-25

A polymer electrolyte membrane (PEM) fuel cell is provided with electrodes supplied with a reactant on each side of a catalyzed membrane assembly (CMA). The fuel cell includes a metal mesh defining a rectangular flow-field pattern having an inlet at a first corner and an outlet at a second corner located on a diagonal from the first corner, wherein all flow paths from the inlet to the outlet through the square flow field pattern are equivalent to uniformly distribute the reactant over the CMA. In a preferred form of metal mesh, a square weave screen forms the flow-field pattern. In a particular characterization of the present invention, a bipolar plate electrically connects adjacent fuel cells, where the bipolar plate includes a thin metal foil having an anode side and a cathode side; a first metal mesh on the anode side of the thin metal foil; and a second metal mesh on the cathode side of the thin metal foil. In another characterization of the present invention, a cooling plate assembly cools adjacent fuel cells, where the cooling plate assembly includes an anode electrode and a cathode electrode formed of thin conducting foils; and a metal mesh flow field there between for distributing cooling water flow over the electrodes to remove heat generated by the fuel cells. 11 figs.

Fuel cell with metal screen flow-field

DOEpatents

Wilson, Mahlon S.; Zawodzinski, Christine

2001-01-01

A polymer electrolyte membrane (PEM) fuel cell is provided with electrodes supplied with a reactant on each side of a catalyzed membrane assembly (CMA). The fuel cell includes a metal mesh defining a rectangular flow-field pattern having an inlet at a first corner and an outlet at a second corner located on a diagonal from the first corner, wherein all flow paths from the inlet to the outlet through the square flow field pattern are equivalent to uniformly distribute the reactant over the CMA. In a preferred form of metal mesh, a square weave screen forms the flow-field pattern. In a particular characterization of the present invention, a bipolar plate electrically connects adjacent fuel cells, where the bipolar plate includes a thin metal foil having an anode side and a cathode side; a first metal mesh on the anode side of the thin metal foil; and a second metal mesh on the cathode side of the thin metal foil. In another characterization of the present invention, a cooling plate assembly cools adjacent fuel cells, where the cooling plate assembly includes an anode electrode and a cathode electrode formed of thin conducting foils; and a metal mesh flow field therebetween for distributing cooling water flow over the electrodes to remove heat generated by the fuel cells.

Fuel cell with metal screen flow-field

DOEpatents

Wilson, Mahlon S.; Zawodzinski, Christine

1998-01-01

A polymer electrolyte membrane (PEM) fuel cell is provided with electrodes supplied with a reactant on each side of a catalyzed membrane assembly (CMA). The fuel cell includes a metal mesh defining a rectangular flow-field pattern having an inlet at a first corner and an outlet at a second corner located on a diagonal from the first corner, wherein all flow paths from the inlet to the outlet through the square flow field pattern are equivalent to uniformly distribute the reactant over the CMA. In a preferred form of metal mesh, a square weave screen forms the flow-field pattern. In a particular characterization of the present invention, a bipolar plate electrically connects adjacent fuel cells, where the bipolar plate includes a thin metal foil having an anode side and a cathode side; a first metal mesh on the anode side of the thin metal foil; and a second metal mesh on the cathode side of the thin metal foil. In another characterization of the present invention, a cooling plate assembly cools adjacent fuel cells, where the cooling plate assembly includes an anode electrode and a cathode electrode formed of thin conducting foils; and a metal mesh flow field therebetween for distributing cooling water flow over the electrodes to remove heat generated by the fuel cells.

Amplitude Modulator Chassis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Erbert, G

2009-09-01

The Amplitude Modulator Chassis (AMC) is the final component in the MOR system and connects directly to the PAM input through a 100-meter fiber. The 48 AMCs temporally shape the 48 outputs of the MOR using an arbitrary waveform generator coupled to an amplitude modulator. The amplitude modulation element is a two stage, Lithium Niobate waveguide device, where the intensity of the light passing through the device is a function of the electrical drive applied. The first stage of the modulator is connected to a programmable high performance Arbitrary Waveform Generator (AWG) consisting of 140 impulse generators space 250 psmore » apart. An arbitrary waveform is generated by independently varying the amplitude of each impulse generator and then summing the impulses together. In addition to the AWG a short pulse generator is also connected to the first stage of the modulator to provide a sub 100-ps pulse used for timing experiments. The second stage of the modulator is connect to a square pulse generator used to further attenuate any pre or post pulse light passing through the first stage of the modulator. The fast rise and fall time of the square pulse generator is also used to produce fast rise and fall times of the AWG by clipping the AWG pulse. For maximum extinction, a pulse bias voltage is applied to each stage of the modulator. A pulse voltage is applied as opposed to a DC voltage to prevent charge buildup on the modulator. Each bias voltage is adjustable to provide a minimum of 50-dB extinction. The AMC is controlled through ICCS to generate the desired temporal pulse shape. This process involves a closed-loop control algorithm, which compares the desired temporal waveform to the produced optical pulse, and iterates the programming of the AWG until the two waveforms agree within an allowable tolerance.« less

Boundary Recovery For Delaunay Tetrahedral Meshes Using Local Topological Transformations

PubMed Central

Ghadyani, Hamid; Sullivan, John; Wu, Ziji

2009-01-01

Numerous high-quality, volume mesh-generation systems exist. However, no strategy can address all geometry situations without some element qualities being compromised. Many 3D mesh generation algorithms are based on Delaunay tetrahedralization which frequently fails to preserve the input boundary surface topology. For biomedical applications, this surface preservation can be critical as they usually contain multiple material regions of interest coherently connected. In this paper we present an algorithm as a post-processing method that optimizes local regions of compromised element quality and recovers the original boundary surface facets (triangles) regardless of the original mesh generation strategy. The algorithm carves out a small sub-volume in the vicinity of the missing boundary facet or compromised element, creating a cavity. If the task is to recover a surface boundary facet, a natural exit hole in the cavity will be present. This hole is patched with the missing boundary surface face first followed by other patches to seal the cavity. If the task was to improve a compromised region, then the cavity is already sealed. Every triangular facet of the cavity shell is classified as an active face and can be connected to another shell node creating a tetrahedron. In the process the base of the tetrahedron is removed from the active face list and potentially 3 new active faces are created. This methodology is the underpinnings of our last resort method. Each active face can be viewed as the trunk of a tree. An exhaustive breath and depth search will identify all possible tetrahedral combinations to uniquely fill the cavity. We have streamlined this recursive process reducing the time complexity by orders of magnitude. The original surfaces boundaries (internal and external) are fully restored and the quality of compromised regions improved. PMID:20305743

A novel approach in formulation of special transition elements: Mesh interface elements

NASA Technical Reports Server (NTRS)

Sarigul, Nesrin

1991-01-01

The objective of this research program is in the development of more accurate and efficient methods for solution of singular problems encountered in various branches of mechanics. The research program can be categorized under three levels. The first two levels involve the formulation of a new class of elements called 'mesh interface elements' (MIE) to connect meshes of traditional elements either in three dimensions or in three and two dimensions. The finite element formulations are based on boolean sum and blending operators. MEI are being formulated and tested in this research to account for the steep gradients encountered in aircraft and space structure applications. At present, the heat transfer and structural analysis problems are being formulated from uncoupled theory point of view. The status report: (1) summarizes formulation for heat transfer and structural analysis; (2) explains formulation of MEI; (3) examines computational efficiency; and (4) shows verification examples.

Analysis and design of numerical schemes for gas dynamics 1: Artificial diffusion, upwind biasing, limiters and their effect on accuracy and multigrid convergence

NASA Technical Reports Server (NTRS)

Jameson, Antony

1994-01-01

The theory of non-oscillatory scalar schemes is developed in this paper in terms of the local extremum diminishing (LED) principle that maxima should not increase and minima should not decrease. This principle can be used for multi-dimensional problems on both structured and unstructured meshes, while it is equivalent to the total variation diminishing (TVD) principle for one-dimensional problems. A new formulation of symmetric limited positive (SLIP) schemes is presented, which can be generalized to produce schemes with arbitrary high order of accuracy in regions where the solution contains no extrema, and which can also be implemented on multi-dimensional unstructured meshes. Systems of equations lead to waves traveling with distinct speeds and possibly in opposite directions. Alternative treatments using characteristic splitting and scalar diffusive fluxes are examined, together with modification of the scalar diffusion through the addition of pressure differences to the momentum equations to produce full upwinding in supersonic flow. This convective upwind and split pressure (CUSP) scheme exhibits very rapid convergence in multigrid calculations of transonic flow, and provides excellent shock resolution at very high Mach numbers.

Discrete crack growth analysis methodology for through cracks in pressurized fuselage structures

NASA Technical Reports Server (NTRS)

Potyondy, David O.; Wawrzynek, Paul A.; Ingraffea, Anthony R.

1994-01-01

A methodology for simulating the growth of long through cracks in the skin of pressurized aircraft fuselage structures is described. Crack trajectories are allowed to be arbitrary and are computed as part of the simulation. The interaction between the mechanical loads acting on the superstructure and the local structural response near the crack tips is accounted for by employing a hierarchical modeling strategy. The structural response for each cracked configuration is obtained using a geometrically nonlinear shell finite element analysis procedure. Four stress intensity factors, two for membrane behavior and two for bending using Kirchhoff plate theory, are computed using an extension of the modified crack closure integral method. Crack trajectories are determined by applying the maximum tangential stress criterion. Crack growth results in localized mesh deletion, and the deletion regions are remeshed automatically using a newly developed all-quadrilateral meshing algorithm. The effectiveness of the methodology and its applicability to performing practical analyses of realistic structures is demonstrated by simulating curvilinear crack growth in a fuselage panel that is representative of a typical narrow-body aircraft. The predicted crack trajectory and fatigue life compare well with measurements of these same quantities from a full-scale pressurized panel test.

Field Model: An Object-Oriented Data Model for Fields

NASA Technical Reports Server (NTRS)

Moran, Patrick J.

2001-01-01

We present an extensible, object-oriented data model designed for field data entitled Field Model (FM). FM objects can represent a wide variety of fields, including fields of arbitrary dimension and node type. FM can also handle time-series data. FM achieves generality through carefully selected topological primitives and through an implementation that leverages the potential of templated C++. FM supports fields where the nodes values are paired with any cell type. Thus FM can represent data where the field nodes are paired with the vertices ("vertex-centered" data), fields where the nodes are paired with the D-dimensional cells in R(sup D) (often called "cell-centered" data), as well as fields where nodes are paired with edges or other cell types. FM is designed to effectively handle very large data sets; in particular FM employs a demand-driven evaluation strategy that works especially well with large field data. Finally, the interfaces developed for FM have the potential to effectively abstract field data based on adaptive meshes. We present initial results with a triangular adaptive grid in R(sup 2) and discuss how the same design abstractions would work equally well with other adaptive-grid variations, including meshes in R(sup 3).

A resistive mesh phantom for assessing the performance of EIT systems.

PubMed

Gagnon, Hervé; Cousineau, Martin; Adler, Andy; Hartinger, Alzbeta E

2010-09-01

Assessing the performance of electrical impedance tomography (EIT) systems usually requires a phantom for validation, calibration, or comparison purposes. This paper describes a resistive mesh phantom to assess the performance of EIT systems while taking into account cabling stray effects similar to in vivo conditions. This phantom is built with 340 precision resistors on a printed circuit board representing a 2-D circular homogeneous medium. It also integrates equivalent electrical models of the Ag/AgCl electrode impedances. The parameters of the electrode models were fitted from impedance curves measured with an impedance analyzer. The technique used to build the phantom is general and applicable to phantoms of arbitrary shape and conductivity distribution. We describe three performance indicators that can be measured with our phantom for every measurement of an EIT data frame: SNR, accuracy, and modeling accuracy. These performance indicators were evaluated on our EIT system under different frame rates and applied current intensities. The performance indicators are dependent on frame rate, operating frequency, applied current intensity, measurement strategy, and intermodulation distortion when performing simultaneous measurements at several frequencies. These parameter values should, therefore, always be specified when reporting performance indicators to better appreciate their significance.

A Highly Parallelized Special-Purpose Computer for Many-Body Simulations with an Arbitrary Central Force: MD-GRAPE

NASA Astrophysics Data System (ADS)

Fukushige, Toshiyuki; Taiji, Makoto; Makino, Junichiro; Ebisuzaki, Toshikazu; Sugimoto, Daiichiro

1996-09-01

We have developed a parallel, pipelined special-purpose computer for N-body simulations, MD-GRAPE (for "GRAvity PipE"). In gravitational N- body simulations, almost all computing time is spent on the calculation of interactions between particles. GRAPE is specialized hardware to calculate these interactions. It is used with a general-purpose front-end computer that performs all calculations other than the force calculation. MD-GRAPE is the first parallel GRAPE that can calculate an arbitrary central force. A force different from a pure 1/r potential is necessary for N-body simulations with periodic boundary conditions using the Ewald or particle-particle/particle-mesh (P^3^M) method. MD-GRAPE accelerates the calculation of particle-particle force for these algorithms. An MD- GRAPE board has four MD chips and its peak performance is 4.2 GFLOPS. On an MD-GRAPE board, a cosmological N-body simulation takes 6O0(N/10^6^)^3/2^ s per step for the Ewald method, where N is the number of particles, and would take 24O(N/10^6^) s per step for the P^3^M method, in a uniform distribution of particles.

Water wave energy transducer

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lamberti, J.

1983-06-28

A water wave energy transducer comprises a boat having pivoted arms projecting out over the water, a float being mounted on the outboard end of each arm so that the arms are oscillated by wave action on the floats. Drive sprockets fixed on the arms coaxially with their pivots are connected by drive chains with two driven sprockets coaxial, respectively, with two gears which mesh with one another and one of which meshes with an output gear. The driven sprockets are coupled with the coaxial gears by one-way clutches which are oppositely arranged so that one drives when the sprocketsmore » turn in one direction and the other drives when the sprockets turn in the opposite direction. Hence, the output gear is driven in the same direction by both upward and downward movement of the floats. The output gear is connected by a speed increasing gear train with an electric generator which can supply current to a motor for propelling the boat, or through a cable to the shore when the boat is anchored.« less

ICCD: interactive continuous collision detection between deformable models using connectivity-based culling.

PubMed

Tang, Min; Curtis, Sean; Yoon, Sung-Eui; Manocha, Dinesh

2009-01-01

We present an interactive algorithm for continuous collision detection between deformable models. We introduce multiple techniques to improve the culling efficiency and the overall performance of continuous collision detection. First, we present a novel formulation for continuous normal cones and use these normal cones to efficiently cull large regions of the mesh as part of self-collision tests. Second, we introduce the concept of "procedural representative triangles" to remove all redundant elementary tests between nonadjacent triangles. Finally, we exploit the mesh connectivity and introduce the concept of "orphan sets" to eliminate redundant elementary tests between adjacent triangle primitives. In practice, we can reduce the number of elementary tests by two orders of magnitude. These culling techniques have been combined with bounding volume hierarchies and can result in one order of magnitude performance improvement as compared to prior collision detection algorithms for deformable models. We highlight the performance of our algorithm on several benchmarks, including cloth simulations, N-body simulations, and breaking objects.

Full Mesh Audio Conferencing Using the Point-to-Multipoint On-Board Switching Capability of ACTS

NASA Technical Reports Server (NTRS)

Rivett, Mary L.; Sethna, Zubin H.

1996-01-01

The purpose of this paper is to describe an implementation of audio conferencing using the ACTS T1-VSAT network. In particular, this implementation evaluates the use of the on-board switching capability of the satellite as a viable alternative for providing the multipoint connectivity normally provided by terrestrial audio bridge equipment The system that was implemented provides full mesh, full-duplex audio conferencing, with end-to-end voice paths between all participants requiring only a single hop (i.e. 250 msec. delay). Moreover, it addresses the lack of spontaneity in current systems by allowing a user to easily start a conference from any standard telephone handset connected to an ACTS earth station, and quickly add new members to the conference at any time using the 'hook flash' capability. No prior scheduling of resources is required and there is no central point of control, thereby providing the user with the spontaneity desired in audio conference control.

Fluid-Structure Interaction Simulation of Prosthetic Aortic Valves: Comparison between Immersed Boundary and Arbitrary Lagrangian-Eulerian Techniques for the Mesh Representation

PubMed Central

Iannaccone, Francesco; Degroote, Joris; Vierendeels, Jan; Segers, Patrick

2016-01-01

In recent years the role of FSI (fluid-structure interaction) simulations in the analysis of the fluid-mechanics of heart valves is becoming more and more important, being able to capture the interaction between the blood and both the surrounding biological tissues and the valve itself. When setting up an FSI simulation, several choices have to be made to select the most suitable approach for the case of interest: in particular, to simulate flexible leaflet cardiac valves, the type of discretization of the fluid domain is crucial, which can be described with an ALE (Arbitrary Lagrangian-Eulerian) or an Eulerian formulation. The majority of the reported 3D heart valve FSI simulations are performed with the Eulerian formulation, allowing for large deformations of the domains without compromising the quality of the fluid grid. Nevertheless, it is known that the ALE-FSI approach guarantees more accurate results at the interface between the solid and the fluid. The goal of this paper is to describe the same aortic valve model in the two cases, comparing the performances of an ALE-based FSI solution and an Eulerian-based FSI approach. After a first simplified 2D case, the aortic geometry was considered in a full 3D set-up. The model was kept as similar as possible in the two settings, to better compare the simulations’ outcomes. Although for the 2D case the differences were unsubstantial, in our experience the performance of a full 3D ALE-FSI simulation was significantly limited by the technical problems and requirements inherent to the ALE formulation, mainly related to the mesh motion and deformation of the fluid domain. As a secondary outcome of this work, it is important to point out that the choice of the solver also influenced the reliability of the final results. PMID:27128798

The Application of COMSOL Multiphysics Package on the Modelling of Complex 3-D Lithospheric Electrical Resistivity Structures - A Case Study from the Proterozoic Orogenic belt within the North China Craton

NASA Astrophysics Data System (ADS)

Guo, L.; Yin, Y.; Deng, M.; Guo, L.; Yan, J.

2017-12-01

At present, most magnetotelluric (MT) forward modelling and inversion codes are based on finite difference method. But its structured mesh gridding cannot be well adapted for the conditions with arbitrary topography or complex tectonic structures. By contrast, the finite element method is more accurate in calculating complex and irregular 3-D region and has lower requirement of function smoothness. However, the complexity of mesh gridding and limitation of computer capacity has been affecting its application. COMSOL Multiphysics is a cross-platform finite element analysis, solver and multiphysics full-coupling simulation software. It achieves highly accurate numerical simulations with high computational performance and outstanding multi-field bi-directional coupling analysis capability. In addition, its AC/DC and RF module can be used to easily calculate the electromagnetic responses of complex geological structures. Using the adaptive unstructured grid, the calculation is much faster. In order to improve the discretization technique of computing area, we use the combination of Matlab and COMSOL Multiphysics to establish a general procedure for calculating the MT responses for arbitrary resistivity models. The calculated responses include the surface electric and magnetic field components, impedance components, magnetic transfer functions and phase tensors. Then, the reliability of this procedure is certificated by 1-D, 2-D and 3-D and anisotropic forward modeling tests. Finally, we establish the 3-D lithospheric resistivity model for the Proterozoic Wutai-Hengshan Mts. within the North China Craton by fitting the real MT data collected there. The reliability of the model is also verified by induced vectors and phase tensors. Our model shows more details and better resolution, compared with the previously published 3-D model based on the finite difference method. In conclusion, COMSOL Multiphysics package is suitable for modeling the 3-D lithospheric resistivity structures under complex tectonic deformation backgrounds, which could be a good complement to the existing finite-difference inversion algorithms.

Multicasting in Wireless Communications (Ad-Hoc Networks): Comparison against a Tree-Based Approach

NASA Astrophysics Data System (ADS)

Rizos, G. E.; Vasiliadis, D. C.

2007-12-01

We examine on-demand multicasting in ad hoc networks. The Core Assisted Mesh Protocol (CAMP) is a well-known protocol for multicast routing in ad-hoc networks, generalizing the notion of core-based trees employed for internet multicasting into multicast meshes that have much richer connectivity than trees. On the other hand, wireless tree-based multicast routing protocols use much simpler structures for determining route paths, using only parent-child relationships. In this work, we compare the performance of the CAMP protocol against the performance of wireless tree-based multicast routing protocols, in terms of two important factors, namely packet delay and ratio of dropped packets.

Procedure for Tooth Contact Analysis of a Face Gear Meshing With a Spur Gear Using Finite Element Analysis

NASA Technical Reports Server (NTRS)

Bibel, George; Lewicki, David G. (Technical Monitor)

2002-01-01

A procedure was developed to perform tooth contact analysis between a face gear meshing with a spur pinion using finite element analysis. The face gear surface points from a previous analysis were used to create a connected tooth solid model without gaps or overlaps. The face gear surface points were used to create a five tooth face gear Patran model (with rim) using Patran PCL commands. These commands were saved in a series of session files suitable for Patran input. A four tooth spur gear that meshes with the face gear was designed and constructed with Patran PCL commands. These commands were also saved in a session files suitable for Patran input. The orientation of the spur gear required for meshing with the face gear was determined. The required rotations and translations are described and built into the session file for the spur gear. The Abaqus commands for three-dimensional meshing were determined and verified for a simplified model containing one spur tooth and one face gear tooth. The boundary conditions, loads, and weak spring constraints were determined to make the simplified model work. The load steps and load increments to establish contact and obtain a realistic load was determined for the simplified two tooth model. Contact patterns give some insight into required mesh density. Building the two gears in two different local coordinate systems and rotating the local coordinate systems was verified as an easy way to roll the gearset through mesh. Due to limitation of swap space, disk space and time constraints of the summer period, the larger model was not completed.

Quantized Average Consensus on Gossip Digraphs with Reduced Computation

NASA Astrophysics Data System (ADS)

Cai, Kai; Ishii, Hideaki

The authors have recently proposed a class of randomized gossip algorithms which solve the distributed averaging problem on directed graphs, with the constraint that each node has an integer-valued state. The essence of this algorithm is to maintain local records, called “surplus”, of individual state updates, thereby achieving quantized average consensus even though the state sum of all nodes is not preserved. In this paper we study a modified version of this algorithm, whose feature is primarily in reducing both computation and communication effort. Concretely, each node needs to update fewer local variables, and can transmit surplus by requiring only one bit. Under this modified algorithm we prove that reaching the average is ensured for arbitrary strongly connected graphs. The condition of arbitrary strong connection is less restrictive than those known in the literature for either real-valued or quantized states; in particular, it does not require the special structure on the network called balanced. Finally, we provide numerical examples to illustrate the convergence result, with emphasis on convergence time analysis.

Generalized Optoelectronic Model of Series-Connected Multijunction Solar Cells

DOE PAGES

Geisz, John F.; Steiner, Myles A.; Garcia, Ivan; ...

2015-10-02

The emission of light from each junction in a series-connected multijunction solar cell, we found, both complicates and elucidates the understanding of its performance under arbitrary conditions. Bringing together many recent advances in this understanding, we present a general 1-D model to describe luminescent coupling that arises from both voltage-driven electroluminescence and voltage-independent photoluminescence in nonideal junctions that include effects such as Sah-Noyce-Shockley (SNS) recombination with n ≠ 2, Auger recombination, shunt resistance, reverse-bias breakdown, series resistance, and significant dark area losses. The individual junction voltages and currents are experimentally determined from measured optical and electrical inputs and outputs ofmore » the device within the context of the model to fit parameters that describe the devices performance under arbitrary input conditions. Furthermore, our techniques to experimentally fit the model are demonstrated for a four-junction inverted metamorphic solar cell, and the predictions of the model are compared with concentrator flash measurements.« less

Identification of Linear and Nonlinear Sensory Processing Circuits from Spiking Neuron Data.

PubMed

Florescu, Dorian; Coca, Daniel

2018-03-01

Inferring mathematical models of sensory processing systems directly from input-output observations, while making the fewest assumptions about the model equations and the types of measurements available, is still a major issue in computational neuroscience. This letter introduces two new approaches for identifying sensory circuit models consisting of linear and nonlinear filters in series with spiking neuron models, based only on the sampled analog input to the filter and the recorded spike train output of the spiking neuron. For an ideal integrate-and-fire neuron model, the first algorithm can identify the spiking neuron parameters as well as the structure and parameters of an arbitrary nonlinear filter connected to it. The second algorithm can identify the parameters of the more general leaky integrate-and-fire spiking neuron model, as well as the parameters of an arbitrary linear filter connected to it. Numerical studies involving simulated and real experimental recordings are used to demonstrate the applicability and evaluate the performance of the proposed algorithms.

Navier-Stokes Aerodynamic Simulation of the V-22 Osprey on the Intel Paragon MPP

NASA Technical Reports Server (NTRS)

Vadyak, Joseph; Shrewsbury, George E.; Narramore, Jim C.; Montry, Gary; Holst, Terry; Kwak, Dochan (Technical Monitor)

1995-01-01

The paper will describe the Development of a general three-dimensional multiple grid zone Navier-Stokes flowfield simulation program (ENS3D-MPP) designed for efficient execution on the Intel Paragon Massively Parallel Processor (MPP) supercomputer, and the subsequent application of this method to the prediction of the viscous flowfield about the V-22 Osprey tiltrotor vehicle. The flowfield simulation code solves the thin Layer or full Navier-Stoke's equation - for viscous flow modeling, or the Euler equations for inviscid flow modeling on a structured multi-zone mesh. In the present paper only viscous simulations will be shown. The governing difference equations are solved using a time marching implicit approximate factorization method with either TVD upwind or central differencing used for the convective terms and central differencing used for the viscous diffusion terms. Steady state or Lime accurate solutions can be calculated. The present paper will focus on steady state applications, although time accurate solution analysis is the ultimate goal of this effort. Laminar viscosity is calculated using Sutherland's law and the Baldwin-Lomax two layer algebraic turbulence model is used to compute the eddy viscosity. The Simulation method uses an arbitrary block, curvilinear grid topology. An automatic grid adaption scheme is incorporated which concentrates grid points in high density gradient regions. A variety of user-specified boundary conditions are available. This paper will present the application of the scalable and superscalable versions to the steady state viscous flow analysis of the V-22 Osprey using a multiple zone global mesh. The mesh consists of a series of sheared cartesian grid blocks with polar grids embedded within to better simulate the wing tip mounted nacelle. MPP solutions will be shown in comparison to equivalent Cray C-90 results and also in comparison to experimental data. Discussions on meshing considerations, wall clock execution time, load balancing, and scalability will be provided.

Dynamic Rupture Benchmarking of the ADER-DG Method

NASA Astrophysics Data System (ADS)

Gabriel, Alice; Pelties, Christian

2013-04-01

We will verify the arbitrary high-order derivative Discontinuous Galerkin (ADER-DG) method in various test cases of the 'SCEC/USGS Dynamic Earthquake Rupture Code Verification Exercise' benchmark suite (Harris et al. 2009). The ADER-DG scheme is able to solve the spontaneous rupture problem with high-order accuracy in space and time on three-dimensional unstructured tetrahedral meshes. Strong mesh coarsening or refinement at areas of interest can be applied to keep the computational costs feasible. Moreover, the method does not generate spurious high-frequency contributions in the slip rate spectra and therefore does not require any artificial damping as demonstrated in previous presentations and publications (Pelties et al. 2010 and 2012). We will show that the mentioned features hold also for more advanced setups as e.g. a branching fault system, heterogeneous background stresses and bimaterial faults. The advanced geometrical flexibility combined with an enhanced accuracy will make the ADER-DG method a useful tool to study earthquake dynamics on complex fault systems in realistic rheologies. References: Harris, R.A., M. Barall, R. Archuleta, B. Aagaard, J.-P. Ampuero, H. Bhat, V. Cruz-Atienza, L. Dalguer, P. Dawson, S. Day, B. Duan, E. Dunham, G. Ely, Y. Kaneko, Y. Kase, N. Lapusta, Y. Liu, S. Ma, D. Oglesby, K. Olsen, A. Pitarka, S. Song, and E. Templeton, The SCEC/USGS Dynamic Earthquake Rupture Code Verification Exercise, Seismological Research Letters, vol. 80, no. 1, pages 119-126, 2009 Pelties, C., J. de la Puente, and M. Kaeser, Dynamic Rupture Modeling in Three Dimensions on Unstructured Meshes Using a Discontinuous Galerkin Method, AGU 2010 Fall Meeting, abstract #S21C-2068 Pelties, C., J. de la Puente, J.-P. Ampuero, G. Brietzke, and M. Kaeser, Three-Dimensional Dynamic Rupture Simulation with a High-order Discontinuous Galerkin Method on Unstructured Tetrahedral Meshes, JGR. - Solid Earth, VOL. 117, B02309, 2012

Dynamic Rupture Benchmarking of the ADER-DG Method

NASA Astrophysics Data System (ADS)

Pelties, C.; Gabriel, A.

2012-12-01

We will verify the arbitrary high-order derivative Discontinuous Galerkin (ADER-DG) method in various test cases of the 'SCEC/USGS Dynamic Earthquake Rupture Code Verification Exercise' benchmark suite (Harris et al. 2009). The ADER-DG scheme is able to solve the spontaneous rupture problem with high-order accuracy in space and time on three-dimensional unstructured tetrahedral meshes. Strong mesh coarsening or refinement at areas of interest can be applied to keep the computational costs feasible. Moreover, the method does not generate spurious high-frequency contributions in the slip rate spectra and therefore does not require any artificial damping as demonstrated in previous presentations and publications (Pelties et al. 2010 and 2012). We will show that the mentioned features hold also for more advanced setups as e.g. a branching fault system, heterogeneous background stresses and bimaterial faults. The advanced geometrical flexibility combined with an enhanced accuracy will make the ADER-DG method a useful tool to study earthquake dynamics on complex fault systems in realistic rheologies. References: Harris, R.A., M. Barall, R. Archuleta, B. Aagaard, J.-P. Ampuero, H. Bhat, V. Cruz-Atienza, L. Dalguer, P. Dawson, S. Day, B. Duan, E. Dunham, G. Ely, Y. Kaneko, Y. Kase, N. Lapusta, Y. Liu, S. Ma, D. Oglesby, K. Olsen, A. Pitarka, S. Song, and E. Templeton, The SCEC/USGS Dynamic Earthquake Rupture Code Verification Exercise, Seismological Research Letters, vol. 80, no. 1, pages 119-126, 2009 Pelties, C., J. de la Puente, and M. Kaeser, Dynamic Rupture Modeling in Three Dimensions on Unstructured Meshes Using a Discontinuous Galerkin Method, AGU 2010 Fall Meeting, abstract #S21C-2068 Pelties, C., J. de la Puente, J.-P. Ampuero, G. Brietzke, and M. Kaeser, Three-Dimensional Dynamic Rupture Simulation with a High-order Discontinuous Galerkin Method on Unstructured Tetrahedral Meshes, JGR. - Solid Earth, VOL. 117, B02309, 2012

Multi-dimensional multi-species modeling of transient electrodeposition in LIGA microfabrication.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Evans, Gregory Herbert; Chen, Ken Shuang

2004-06-01

This report documents the efforts and accomplishments of the LIGA electrodeposition modeling project which was headed by the ASCI Materials and Physics Modeling Program. A multi-dimensional framework based on GOMA was developed for modeling time-dependent diffusion and migration of multiple charged species in a dilute electrolyte solution with reduction electro-chemical reactions on moving deposition surfaces. By combining the species mass conservation equations with the electroneutrality constraint, a Poisson equation that explicitly describes the electrolyte potential was derived. The set of coupled, nonlinear equations governing species transport, electric potential, velocity, hydrodynamic pressure, and mesh motion were solved in GOMA, using themore » finite-element method and a fully-coupled implicit solution scheme via Newton's method. By treating the finite-element mesh as a pseudo solid with an arbitrary Lagrangian-Eulerian formulation and by repeatedly performing re-meshing with CUBIT and re-mapping with MAPVAR, the moving deposition surfaces were tracked explicitly from start of deposition until the trenches were filled with metal, thus enabling the computation of local current densities that potentially influence the microstructure and frictional/mechanical properties of the deposit. The multi-dimensional, multi-species, transient computational framework was demonstrated in case studies of two-dimensional nickel electrodeposition in single and multiple trenches, without and with bath stirring or forced flow. Effects of buoyancy-induced convection on deposition were also investigated. To further illustrate its utility, the framework was employed to simulate deposition in microscreen-based LIGA molds. Lastly, future needs for modeling LIGA electrodeposition are discussed.« less

Water Impact Test and Simulation of a Composite Energy Absorbing Fuselage Section

NASA Technical Reports Server (NTRS)

Fasanella, Edwin L.; Jackson, Karen E.; Sparks, Chad; Sareen, Ashish

2003-01-01

In March 2002, a 25-ft/s vertical drop test of a composite fuselage section was conducted onto water. The purpose of the test was to obtain experimental data characterizing the structural response of the fuselage section during water impact for comparison with two previous drop tests that were performed onto a rigid surface and soft soil. For the drop test, the fuselage section was configured with ten 100-lb. lead masses, five per side, that were attached to seat rails mounted to the floor. The fuselage section was raised to a height of 10-ft. and dropped vertically into a 15-ft. diameter pool filled to a depth of 3.5-ft. with water. Approximately 70 channels of data were collected during the drop test at a 10-kHz sampling rate. The test data were used to validate crash simulations of the water impact that were developed using the nonlinear, explicit transient dynamic codes, MSC.Dytran and LS-DYNA. The fuselage structure was modeled using shell and solid elements with a Lagrangian mesh, and the water was modeled with both Eulerian and Lagrangian techniques. The fluid-structure interactions were executed using the fast general coupling in MSC.Dytran and the Arbitrary Lagrange-Euler (ALE) coupling in LS-DYNA. Additionally, the smooth particle hydrodynamics (SPH) meshless Lagrangian technique was used in LS-DYNA to represent the fluid. The simulation results were correlated with the test data to validate the modeling approach. Additional simulation studies were performed to determine how changes in mesh density, mesh uniformity, fluid viscosity, and failure strain influence the test-analysis correlation.

ATHENA 3D: A finite element code for ultrasonic wave propagation

NASA Astrophysics Data System (ADS)

Rose, C.; Rupin, F.; Fouquet, T.; Chassignole, B.

2014-04-01

The understanding of wave propagation phenomena requires use of robust numerical models. 3D finite element (FE) models are generally prohibitively time consuming. However, advances in computing processor speed and memory allow them to be more and more competitive. In this context, EDF R&D developed the 3D version of the well-validated FE code ATHENA2D. The code is dedicated to the simulation of wave propagation in all kinds of elastic media and in particular, heterogeneous and anisotropic materials like welds. It is based on solving elastodynamic equations in the calculation zone expressed in terms of stress and particle velocities. The particularity of the code relies on the fact that the discretization of the calculation domain uses a Cartesian regular 3D mesh while the defect of complex geometry can be described using a separate (2D) mesh using the fictitious domains method. This allows combining the rapidity of regular meshes computation with the capability of modelling arbitrary shaped defects. Furthermore, the calculation domain is discretized with a quasi-explicit time evolution scheme. Thereby only local linear systems of small size have to be solved. The final step to reduce the computation time relies on the fact that ATHENA3D has been parallelized and adapted to the use of HPC resources. In this paper, the validation of the 3D FE model is discussed. A cross-validation of ATHENA 3D and CIVA is proposed for several inspection configurations. The performances in terms of calculation time are also presented in the cases of both local computer and computation cluster use.

Recent work on material interface reconstruction

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mosso, S.J.; Swartz, B.K.

1997-12-31

For the last 15 years, many Eulerian codes have relied on a series of piecewise linear interface reconstruction algorithms developed by David Youngs. In a typical Youngs` method, the material interfaces were reconstructed based upon nearly cell values of volume fractions of each material. The interfaces were locally represented by linear segments in two dimensions and by pieces of planes in three dimensions. The first step in such reconstruction was to locally approximate an interface normal. In Youngs` 3D method, a local gradient of a cell-volume-fraction function was estimated and taken to be the local interface normal. A linear interfacemore » was moved perpendicular to the now known normal until the mass behind it matched the material volume fraction for the cell in question. But for distorted or nonorthogonal meshes, the gradient normal estimate didn`t accurately match that of linear material interfaces. Moreover, curved material interfaces were also poorly represented. The authors will present some recent work in the computation of more accurate interface normals, without necessarily increasing stencil size. Their estimate of the normal is made using an iterative process that, given mass fractions for nearby cells of known but arbitrary variable density, converges in 3 or 4 passes in practice (and quadratically--like Newton`s method--in principle). The method reproduces a linear interface in both orthogonal and nonorthogonal meshes. The local linear approximation is generally 2nd-order accurate, with a 1st-order accurate normal for curved interfaces in both two and three dimensional polyhedral meshes. Recent work demonstrating the interface reconstruction for curved surfaces will /be discussed.« less

Open Group Transformations

NASA Astrophysics Data System (ADS)

Batalin, Igor; Marnelius, Robert

Open groups whose generators are in arbitrary involutions may be quantized within a ghost extended framework in terms of a nilpotent BFV-BRST charge operator. Previously we have shown that generalized quantum Maurer-Cartan equations for arbitrary open groups may be extracted from the quantum connection operators and that they also follow from a simple quantum master equation involving an extended nilpotent BFV-BRST charge and a master charge. Here we give further details of these results. In addition we establish the general structure of the solutions of the quantum master equation. We also construct an extended formulation whose properties are determined by the extended BRST charge in the master equation.

Using the Schur Complement to Reduce Runtime in KULL's Magnetic Diffusion Package

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brunner, T A; Kolev, T V

2010-12-15

Recently a Resistive Magnetohydrodynamics (MHD) package has been added to the KULL code. In order to be compatible with the underlying hydrodynamics algorithm, a new sub-zonal magnetics discretization was developed that supports arbitrary polygonal and polyhedral zones. This flexibility comes at the cost of many more unknowns per zone - approximately ten times more for a hexahedral mesh. We can eliminate some (or all, depending on the dimensionality) of the extra unknowns from the global matrix during assembly by using a Schur complement approach. This trades expensive global work for cache-friendly local work, while still allowing solution for the fullmore » system. Significant improvements in the solution time are observed for several test problems.« less

Using a two-step matrix solution to reduce the run time in KULL's magnetic diffusion package

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brunner, T A; Kolev, T V

2010-12-17

Recently a Resistive Magnetohydrodynamics (MHD) package has been added to the KULL code. In order to be compatible with the underlying hydrodynamics algorithm, a new sub-zonal magnetics discretization was developed that supports arbitrary polygonal and polyhedral zones. This flexibility comes at the cost of many more unknowns per zone - approximately ten times more for a hexahedral mesh. We can eliminate some (or all, depending on the dimensionality) of the extra unknowns from the global matrix during assembly by using a Schur complement approach. This trades expensive global work for cache-friendly local work, while still allowing solution for the fullmore » system. Significant improvements in the solution time are observed for several test problems.« less

Computer program for calculating full potential transonic, quasi-three-dimensional flow through a rotating turbomachinery blade row

NASA Technical Reports Server (NTRS)

Farrell, C. A.

1982-01-01

A fast, reliable computer code is described for calculating the flow field about a cascade of arbitrary two dimensional airfoils. The method approximates the three dimensional flow in a turbomachinery blade row by correcting for stream tube convergence and radius change in the throughflow direction. A fully conservative solution of the full potential equation is combined with the finite volume technique on a body-fitted periodic mesh, with an artificial density imposed in the transonic region to insure stability and the capture of shock waves. The instructions required to set up and use the code are included. The name of the code is QSONIC. A numerical example is also given to illustrate the output of the program.

Optimal eavesdropping in cryptography with three-dimensional quantum states.

PubMed

Bruss, D; Macchiavello, C

2002-03-25

We study optimal eavesdropping in quantum cryptography with three-dimensional systems, and show that this scheme is more secure against symmetric attacks than protocols using two-dimensional states. We generalize the according eavesdropping transformation to arbitrary dimensions, and discuss the connection with optimal quantum cloning.

Introduction to a system for implementing neural net connections on SIMD architectures

NASA Technical Reports Server (NTRS)

Tomboulian, Sherryl

1988-01-01

Neural networks have attracted much interest recently, and using parallel architectures to simulate neural networks is a natural and necessary application. The SIMD model of parallel computation is chosen, because systems of this type can be built with large numbers of processing elements. However, such systems are not naturally suited to generalized communication. A method is proposed that allows an implementation of neural network connections on massively parallel SIMD architectures. The key to this system is an algorithm permitting the formation of arbitrary connections between the neurons. A feature is the ability to add new connections quickly. It also has error recovery ability and is robust over a variety of network topologies. Simulations of the general connection system, and its implementation on the Connection Machine, indicate that the time and space requirements are proportional to the product of the average number of connections per neuron and the diameter of the interconnection network.

Introduction to a system for implementing neural net connections on SIMD architectures

NASA Technical Reports Server (NTRS)

Tomboulian, Sherryl

1988-01-01

Neural networks have attracted much interest recently, and using parallel architectures to simulate neural networks is a natural and necessary application. The SIMD model of parallel computation is chosen, because systems of this type can be built with large numbers of processing elements. However, such systems are not naturally suited to generalized elements. A method is proposed that allows an implementation of neural network connections on massively parallel SIMD architectures. The key to this system is an algorithm permitting the formation of arbitrary connections between the neurons. A feature is the ability to add new connections quickly. It also has error recovery ability and is robust over a variety of network topologies. Simulations of the general connection system, and its implementation on the Connection Machine, indicate that the time and space requirements are proportional to the product of the average number of connections per neuron and the diameter of the interconnection network.

An analysis of general chain systems

NASA Technical Reports Server (NTRS)

Passerello, C. E.; Huston, R. L.

1972-01-01

A general analysis of dynamic systems consisting of connected rigid bodies is presented. The number of bodies and their manner of connection is arbitrary so long as no closed loops are formed. The analysis represents a dynamic finite element method, which is computer-oriented and designed so that nonworking, interval constraint forces are automatically eliminated. The method is based upon Lagrange's form of d'Alembert's principle. Shifter matrix transformations are used with the geometrical aspects of the analysis. The method is illustrated with a space manipulator.

Stable configurations in social networks

NASA Astrophysics Data System (ADS)

Bronski, Jared C.; DeVille, Lee; Ferguson, Timothy; Livesay, Michael

2018-06-01

We present and analyze a model of opinion formation on an arbitrary network whose dynamics comes from a global energy function. We study the global and local minimizers of this energy, which we call stable opinion configurations, and describe the global minimizers under certain assumptions on the friendship graph. We show a surprising result that the number of stable configurations is not necessarily monotone in the strength of connection in the social network, i.e. the model sometimes supports more stable configurations when the interpersonal connections are made stronger.

Wireless mesh networks.

PubMed

Wang, Xinheng

2008-01-01

Wireless telemedicine using GSM and GPRS technologies can only provide low bandwidth connections, which makes it difficult to transmit images and video. Satellite or 3G wireless transmission provides greater bandwidth, but the running costs are high. Wireless networks (WLANs) appear promising, since they can supply high bandwidth at low cost. However, the WLAN technology has limitations, such as coverage. A new wireless networking technology named the wireless mesh network (WMN) overcomes some of the limitations of the WLAN. A WMN combines the characteristics of both a WLAN and ad hoc networks, thus forming an intelligent, large scale and broadband wireless network. These features are attractive for telemedicine and telecare because of the ability to provide data, voice and video communications over a large area. One successful wireless telemedicine project which uses wireless mesh technology is the Emergency Room Link (ER-LINK) in Tucson, Arizona, USA. There are three key characteristics of a WMN: self-organization, including self-management and self-healing; dynamic changes in network topology; and scalability. What we may now see is a shift from mobile communication and satellite systems for wireless telemedicine to the use of wireless networks based on mesh technology, since the latter are very attractive in terms of cost, reliability and speed.

Critically safe volume vacuum pickup for use in wet or dry cleanup of radioactive enclosures

DOEpatents

Zeren, J.D.

1993-12-28

A physical compact vacuum pickup device of critically safe volume and geometric shape is provided for use in radioactive enclosures, such as a small glove box, to facilitate manual cleanup of either wet or dry radioactive material. The device is constructed and arranged so as to remain safe when filled to capacity with plutonium-239 oxide. Two fine mesh filter bags are supported on the exterior of a rigid fine mesh stainless steel cup. This assembly is sealed within, and spaced from, the interior walls of a stainless steel canister. An air inlet communicates with the interior of the canister. A modified conventional vacuum head is physically connected to, and associated with, the interior of the mesh cup. The volume of the canister, as defined by the space between the mesh cup and the interior walls of the canister, forms a critically safe volume and geometric shape for dry radioactive particles that are gathered within the canister. A critically safe liquid volume is maintained by operation of a suction terminating float valve, and/or by operation of redundant vacuum check/liquid drain valves and placement of the air inlet. 5 figures.

Hip joint replacement using monofilament polypropylene surgical mesh: an animal model.

PubMed

Białecki, Jacek; Majchrzycki, Marian; Szymczak, Antoni; Klimowicz-Bodys, Małgorzata Dorota; Wierzchoś, Edward; Kołomecki, Krzysztof

2014-01-01

Hip joint dysplasia is a deformation of the articular elements (pelvic acetabulum, head of the femur, and/or ligament of the head of the femur) leading to laxity of the hip components and dislocation of the femoral head from the pelvic acetabulum. Diagnosis is based on symptoms observed during clinical and radiological examinations. There are two treatment options: conservative and surgical. The classic surgical procedures are juvenile pubic symphysiodesis (JPS), triple pelvic osteotomy (TPO), total hip replacement (THR), and femoral head and neck resection (FHNE). The aim of this experiment was to present an original technique of filling the acetabulum with a polypropylene implant, resting the femoral neck directly on the mesh. The experiment was performed on eight sheep. The clinical value of the new surgical technique was evaluated using clinical, radiological, and histological methods. This technique helps decrease the loss of limb length by supporting the femoral neck on the mesh equivalent to the femoral head. It also reduces joint pain and leads to the formation of stable and mobile pseudarthrosis. The mesh manifested osteoprotective properties and enabled the formation of a stiff-elastic connection within the hip joint. The method is very cost-effective and the technique itself is simple to perform.

Critically safe volume vacuum pickup for use in wet or dry cleanup of radioactive enclosures

DOEpatents

Zeren, Joseph D.

1993-12-28

A physical compact vacuum pickup device of critically safe volume and geometric shape is provided for use in radioactive enclosures, such as a small glove box, to facilitate manual cleanup of either wet or dry radioactive material. The device is constructed and arranged so as to remain safe when filled to capacity with plutonium-239 oxide. Two fine mesh filter bags are supported on the exterior of a rigid fine mesh stainless steel cup. This assembly is sealed within, and spaced from, the interior walls of a stainless steel canister. An air inlet communicates with the interior of the canister. A modified conventional vacuum head is physically connected to, and associated with, the interior of the mesh cup. The volume of the canister, as defined by the space between the mesh cup and the interior walls of the canister, forms a critically safe volume and geometric shape for dry radioactive particles that are gathered within the canister. A critically safe liquid volume is maintained by operation of a suction terminating float valve, and/or by operation of redundant vacuum check/liquid drain valves and placement of the air inlet.

Silicon-fiber blanket solar-cell array concept

NASA Technical Reports Server (NTRS)

Eliason, J. T.

1973-01-01

Proposed economical manufacture of solar-cell arrays involves parallel, planar weaving of filaments made of doped silicon fibers with diffused radial junction. Each filament is a solar cell connected either in series or parallel with others to form a blanket of deposited grids or attached electrode wire mesh screens.

Growing multiplex networks with arbitrary number of layers

NASA Astrophysics Data System (ADS)

Momeni, Naghmeh; Fotouhi, Babak

2015-12-01

This paper focuses on the problem of growing multiplex networks. Currently, the results on the joint degree distribution of growing multiplex networks present in the literature pertain to the case of two layers and are confined to the special case of homogeneous growth and are limited to the state state (that is, the limit of infinite size). In the present paper, we first obtain closed-form solutions for the joint degree distribution of heterogeneously growing multiplex networks with arbitrary number of layers in the steady state. Heterogeneous growth means that each incoming node establishes different numbers of links in different layers. We consider both uniform and preferential growth. We then extend the analysis of the uniform growth mechanism to arbitrary times. We obtain a closed-form solution for the time-dependent joint degree distribution of a growing multiplex network with arbitrary initial conditions. Throughout, theoretical findings are corroborated with Monte Carlo simulations. The results shed light on the effects of the initial network on the transient dynamics of growing multiplex networks and takes a step towards characterizing the temporal variations of the connectivity of growing multiplex networks, as well as predicting their future structural properties.

Something to Chew On

ERIC Educational Resources Information Center

Burchell, David

2004-01-01

It's never easy to connect long-term social and cultural changes to short-term electoral ones. They're like two different timescales--one incremental, even geological in pace, the other immediate and seemingly will-o'-the-wisp. Opinion polls are like weather reports, where the weather-systems seem to scud around with arbitrary and unintelligible…

Current Issues in Reductions-in-Force.

ERIC Educational Resources Information Center

Caplan, Gerald A.

The practitioner advising a school board in connection with a reduction in force can appreciate that the board has great flexibility in implementing its decision. As long as the board's actions are not arbitrary, capricious, or pretextual, and they afford minimal due process protections to tenured teachers, the board's decisions will withstand…

A semi-automatic computer-aided method for surgical template design

NASA Astrophysics Data System (ADS)

Chen, Xiaojun; Xu, Lu; Yang, Yue; Egger, Jan

2016-02-01

This paper presents a generalized integrated framework of semi-automatic surgical template design. Several algorithms were implemented including the mesh segmentation, offset surface generation, collision detection, ruled surface generation, etc., and a special software named TemDesigner was developed. With a simple user interface, a customized template can be semi- automatically designed according to the preoperative plan. Firstly, mesh segmentation with signed scalar of vertex is utilized to partition the inner surface from the input surface mesh based on the indicated point loop. Then, the offset surface of the inner surface is obtained through contouring the distance field of the inner surface, and segmented to generate the outer surface. Ruled surface is employed to connect inner and outer surfaces. Finally, drilling tubes are generated according to the preoperative plan through collision detection and merging. It has been applied to the template design for various kinds of surgeries, including oral implantology, cervical pedicle screw insertion, iliosacral screw insertion and osteotomy, demonstrating the efficiency, functionality and generality of our method.

Finding Regions of Interest on Toroidal Meshes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wu, Kesheng; Sinha, Rishi R; Jones, Chad

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 magneticmore » 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.« less

A semi-automatic computer-aided method for surgical template design

PubMed Central

Chen, Xiaojun; Xu, Lu; Yang, Yue; Egger, Jan

2016-01-01

This paper presents a generalized integrated framework of semi-automatic surgical template design. Several algorithms were implemented including the mesh segmentation, offset surface generation, collision detection, ruled surface generation, etc., and a special software named TemDesigner was developed. With a simple user interface, a customized template can be semi- automatically designed according to the preoperative plan. Firstly, mesh segmentation with signed scalar of vertex is utilized to partition the inner surface from the input surface mesh based on the indicated point loop. Then, the offset surface of the inner surface is obtained through contouring the distance field of the inner surface, and segmented to generate the outer surface. Ruled surface is employed to connect inner and outer surfaces. Finally, drilling tubes are generated according to the preoperative plan through collision detection and merging. It has been applied to the template design for various kinds of surgeries, including oral implantology, cervical pedicle screw insertion, iliosacral screw insertion and osteotomy, demonstrating the efficiency, functionality and generality of our method. PMID:26843434

A semi-automatic computer-aided method for surgical template design.

PubMed

Chen, Xiaojun; Xu, Lu; Yang, Yue; Egger, Jan

2016-02-04

This paper presents a generalized integrated framework of semi-automatic surgical template design. Several algorithms were implemented including the mesh segmentation, offset surface generation, collision detection, ruled surface generation, etc., and a special software named TemDesigner was developed. With a simple user interface, a customized template can be semi- automatically designed according to the preoperative plan. Firstly, mesh segmentation with signed scalar of vertex is utilized to partition the inner surface from the input surface mesh based on the indicated point loop. Then, the offset surface of the inner surface is obtained through contouring the distance field of the inner surface, and segmented to generate the outer surface. Ruled surface is employed to connect inner and outer surfaces. Finally, drilling tubes are generated according to the preoperative plan through collision detection and merging. It has been applied to the template design for various kinds of surgeries, including oral implantology, cervical pedicle screw insertion, iliosacral screw insertion and osteotomy, demonstrating the efficiency, functionality and generality of our method.

A vectorized algorithm for 3D dynamics of a tethered satellite

NASA Technical Reports Server (NTRS)

Wilson, Howard B.

1989-01-01

Equations of motion characterizing the three dimensional motion of a tethered satellite during the retrieval phase are studied. The mathematical model involves an arbitrary number of point masses connected by weightless cords. Motion occurs in a gravity gradient field. The formulation presented accounts for general functions describing support point motion, rate of tether retrieval, and arbitrary forces applied to the point masses. The matrix oriented program language MATLAB is used to produce an efficient vectorized formulation for computing natural frequencies and mode shapes for small oscillations about the static equilibrium configuration; and for integrating the nonlinear differential equations governing large amplitude motions. An example of time response pertaining to the skip rope effect is investigated.

Theory of nonstationary Hawkes processes

NASA Astrophysics Data System (ADS)

Tannenbaum, Neta Ravid; Burak, Yoram

2017-12-01

We expand the theory of Hawkes processes to the nonstationary case, in which the mutually exciting point processes receive time-dependent inputs. We derive an analytical expression for the time-dependent correlations, which can be applied to networks with arbitrary connectivity, and inputs with arbitrary statistics. The expression shows how the network correlations are determined by the interplay between the network topology, the transfer functions relating units within the network, and the pattern and statistics of the external inputs. We illustrate the correlation structure using several examples in which neural network dynamics are modeled as a Hawkes process. In particular, we focus on the interplay between internally and externally generated oscillations and their signatures in the spike and rate correlation functions.

Modelling of piezoelectric actuator dynamics for active structural control

NASA Technical Reports Server (NTRS)

Hagood, Nesbitt W.; Chung, Walter H.; Von Flotow, Andreas

1990-01-01

The paper models the effects of dynamic coupling between a structure and an electrical network through the piezoelectric effect. The coupled equations of motion of an arbitrary elastic structure with piezoelectric elements and passive electronics are derived. State space models are developed for three important cases: direct voltage driven electrodes, direct charge driven electrodes, and an indirect drive case where the piezoelectric electrodes are connected to an arbitrary electrical circuit with embedded voltage and current sources. The equations are applied to the case of a cantilevered beam with surface mounted piezoceramics and indirect voltage and current drive. The theoretical derivations are validated experimentally on an actively controlled cantilevered beam test article with indirect voltage drive.

Performance analysis of signaling protocols on OBS switches

NASA Astrophysics Data System (ADS)

Kirci, Pinar; Zaim, A. Halim

2005-10-01

In this paper, Just-In-Time (JIT), Just-Enough-Time (JET) and Horizon signalling schemes for Optical Burst Switched Networks (OBS) are presented. These signaling schemes run over a core dWDM network and a network architecture based on Optical Burst Switches (OBS) is proposed to support IP, ATM and Burst traffic. In IP and ATM traffic several packets are assembled in a single packet called burst and the burst contention is handled by burst dropping. The burst length distribution in IP traffic is arbitrary between 0 and 1, and is fixed in ATM traffic at 0,5. Burst traffic on the other hand is arbitrary between 1 and 5. The Setup and Setup ack length distributions are arbitrary. We apply the Poisson model with rate λ and Self-Similar model with pareto distribution rate α to identify inter-arrival times in these protocols. We consider a communication between a source client node and a destination client node over an ingress and one or more multiple intermediate switches.We use buffering only in the ingress node. The communication is based on single burst connections in which, the connection is set up just before sending a burst and then closed as soon as the burst is sent. Our analysis accounts for several important parameters, including the burst setup, burst setup ack, keepalive messages and the optical switching protocol. We compare the performance of the three signalling schemes on the network under as burst dropping probability under a range of network scenarios.

Small, low cost, artificial kidney

NASA Technical Reports Server (NTRS)

Lavender, A. R.; Markley, F. W.

1972-01-01

Disposable hemodialyzer is described that can be used at home by non-medically trained personnel. Short lengths of semipermeable membrane tubes are arranged in parallel, supported by plastic mesh and encased in epoxy at ends. Tubes are connected to input and output blood manifolds which are separated by dialysate chamber. Daily dialysis requires only two hours or less.

Insect-vacs for sampling Asian citrus psyllid (Homoptera: psyllidae) on citrus trees

USDA-ARS?s Scientific Manuscript database

Three vacuum devices were compared for sampling psyllid populations. One was an AC rechargeable, handheld, cordless model and a second was a handheld, DC model powered through a cord connected to a 12V vehicle battery. Each of these devices had a mesh cylinder (substituted for a dust bag) in which...

Effect of node attributes on the temporal dynamics of network structure

NASA Astrophysics Data System (ADS)

Momeni, Naghmeh; Fotouhi, Babak

2017-03-01

Many natural and social networks evolve in time and their structures are dynamic. In most networks, nodes are heterogeneous, and their roles in the evolution of structure differ. This paper focuses on the role of individual attributes on the temporal dynamics of network structure. We focus on a basic model for growing networks that incorporates node attributes (which we call "quality"), and we focus on the problem of forecasting the structural properties of the network in arbitrary times for an arbitrary initial network. That is, we address the following question: If we are given a certain initial network with given arbitrary structure and known node attributes, then how does the structure change in time as new nodes with given distribution of attributes join the network? We solve the model analytically and obtain the quality-degree joint distribution and degree correlations. We characterize the role of individual attributes in the position of individual nodes in the hierarchy of connections. We confirm the theoretical findings with Monte Carlo simulations.

Simulating Large-Scale Earthquake Dynamic Rupture Scenarios On Natural Fault Zones Using the ADER-DG Method

NASA Astrophysics Data System (ADS)

Gabriel, Alice; Pelties, Christian

2014-05-01

In this presentation we will demonstrate the benefits of using modern numerical methods to support physic-based ground motion modeling and research. For this purpose, we utilize SeisSol an arbitrary high-order derivative Discontinuous Galerkin (ADER-DG) scheme to solve the spontaneous rupture problem with high-order accuracy in space and time using three-dimensional unstructured tetrahedral meshes. We recently verified the method in various advanced test cases of the 'SCEC/USGS Dynamic Earthquake Rupture Code Verification Exercise' benchmark suite, including branching and dipping fault systems, heterogeneous background stresses, bi-material faults and rate-and-state friction constitutive formulations. Now, we study the dynamic rupture process using 3D meshes of fault systems constructed from geological and geophysical constraints, such as high-resolution topography, 3D velocity models and fault geometries. Our starting point is a large scale earthquake dynamic rupture scenario based on the 1994 Northridge blind thrust event in Southern California. Starting from this well documented and extensively studied event, we intend to understand the ground-motion, including the relevant high frequency content, generated from complex fault systems and its variation arising from various physical constraints. For example, our results imply that the Northridge fault geometry favors a pulse-like rupture behavior.

Jet simulations and gamma-ray burst afterglow jet breaks

NASA Astrophysics Data System (ADS)

van Eerten, H. J.; Meliani, Z.; Wijers, R. A. M. J.; Keppens, R.

2011-01-01

The conventional derivation of the gamma-ray burst afterglow jet break time uses only the blast wave fluid Lorentz factor and therefore leads to an achromatic break. We show that in general gamma-ray burst afterglow jet breaks are chromatic across the self-absorption break. Depending on circumstances, the radio jet break may be postponed significantly. Using high-accuracy adaptive mesh fluid simulations in one dimension, coupled to a detailed synchrotron radiation code, we demonstrate that this is true even for the standard fireball model and hard-edged jets. We confirm these effects with a simulation in two dimensions. The frequency dependence of the jet break is a result of the angle dependence of the emission, the changing optical depth in the self-absorbed regime and the shape of the synchrotron spectrum in general. In the optically thin case the conventional analysis systematically overestimates the jet break time, leading to inferred opening angles that are underestimated by a factor of ˜1.3 and explosion energies that are underestimated by a factor of ˜1.7, for explosions in a homogeneous environment. The methods presented in this paper can be applied to adaptive mesh simulations of arbitrary relativistic fluid flows. All analysis presented here makes the usual assumption of an on-axis observer.

Simulating Space Capsule Water Landing with Explicit Finite Element Method

NASA Technical Reports Server (NTRS)

Wang, John T.; Lyle, Karen H.

2007-01-01

A study of using an explicit nonlinear dynamic finite element code for simulating the water landing of a space capsule was performed. The finite element model contains Lagrangian shell elements for the space capsule and Eulerian solid elements for the water and air. An Arbitrary Lagrangian Eulerian (ALE) solver and a penalty coupling method were used for predicting the fluid and structure interaction forces. The space capsule was first assumed to be rigid, so the numerical results could be correlated with closed form solutions. The water and air meshes were continuously refined until the solution was converged. The converged maximum deceleration predicted is bounded by the classical von Karman and Wagner solutions and is considered to be an adequate solution. The refined water and air meshes were then used in the models for simulating the water landing of a capsule model that has a flexible bottom. For small pitch angle cases, the maximum deceleration from the flexible capsule model was found to be significantly greater than the maximum deceleration obtained from the corresponding rigid model. For large pitch angle cases, the difference between the maximum deceleration of the flexible model and that of its corresponding rigid model is smaller. Test data of Apollo space capsules with a flexible heat shield qualitatively support the findings presented in this paper.

Simulating Fragmentation and Fluid-Induced Fracture in Disordered Media Using Random Finite-Element Meshes

DOE PAGES

Bishop, Joseph E.; Martinez, Mario J.; Newell, Pania

2016-11-08

Fracture and fragmentation are extremely nonlinear multiscale processes in which microscale damage mechanisms emerge at the macroscale as new fracture surfaces. Numerous numerical methods have been developed for simulating fracture initiation, propagation, and coalescence. In this paper, we present a computational approach for modeling pervasive fracture in quasi-brittle materials based on random close-packed Voronoi tessellations. Each Voronoi cell is formulated as a polyhedral finite element containing an arbitrary number of vertices and faces. Fracture surfaces are allowed to nucleate only at the intercell faces. Cohesive softening tractions are applied to new fracture surfaces in order to model the energy dissipatedmore » during fracture growth. The randomly seeded Voronoi cells provide a regularized discrete random network for representing fracture surfaces. The potential crack paths within the random network are viewed as instances of realizable crack paths within the continuum material. Mesh convergence of fracture simulations is viewed in a weak, or distributional, sense. The explicit facet representation of fractures within this approach is advantageous for modeling contact on new fracture surfaces and fluid flow within the evolving fracture network. Finally, applications of interest include fracture and fragmentation in quasi-brittle materials and geomechanical applications such as hydraulic fracturing, engineered geothermal systems, compressed-air energy storage, and carbon sequestration.« less

Simulating Fragmentation and Fluid-Induced Fracture in Disordered Media Using Random Finite-Element Meshes

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bishop, Joseph E.; Martinez, Mario J.; Newell, Pania

Fracture and fragmentation are extremely nonlinear multiscale processes in which microscale damage mechanisms emerge at the macroscale as new fracture surfaces. Numerous numerical methods have been developed for simulating fracture initiation, propagation, and coalescence. In this paper, we present a computational approach for modeling pervasive fracture in quasi-brittle materials based on random close-packed Voronoi tessellations. Each Voronoi cell is formulated as a polyhedral finite element containing an arbitrary number of vertices and faces. Fracture surfaces are allowed to nucleate only at the intercell faces. Cohesive softening tractions are applied to new fracture surfaces in order to model the energy dissipatedmore » during fracture growth. The randomly seeded Voronoi cells provide a regularized discrete random network for representing fracture surfaces. The potential crack paths within the random network are viewed as instances of realizable crack paths within the continuum material. Mesh convergence of fracture simulations is viewed in a weak, or distributional, sense. The explicit facet representation of fractures within this approach is advantageous for modeling contact on new fracture surfaces and fluid flow within the evolving fracture network. Finally, applications of interest include fracture and fragmentation in quasi-brittle materials and geomechanical applications such as hydraulic fracturing, engineered geothermal systems, compressed-air energy storage, and carbon sequestration.« less

GPU based contouring method on grid DEM data

NASA Astrophysics Data System (ADS)

Tan, Liheng; Wan, Gang; Li, Feng; Chen, Xiaohui; Du, Wenlong

2017-08-01

This paper presents a novel method to generate contour lines from grid DEM data based on the programmable GPU pipeline. The previous contouring approaches often use CPU to construct a finite element mesh from the raw DEM data, and then extract contour segments from the elements. They also need a tracing or sorting strategy to generate the final continuous contours. These approaches can be heavily CPU-costing and time-consuming. Meanwhile the generated contours would be unsmooth if the raw data is sparsely distributed. Unlike the CPU approaches, we employ the GPU's vertex shader to generate a triangular mesh with arbitrary user-defined density, in which the height of each vertex is calculated through a third-order Cardinal spline function. Then in the same frame, segments are extracted from the triangles by the geometry shader, and translated to the CPU-side with an internal order in the GPU's transform feedback stage. Finally we propose a "Grid Sorting" algorithm to achieve the continuous contour lines by travelling the segments only once. Our method makes use of multiple stages of GPU pipeline for computation, which can generate smooth contour lines, and is significantly faster than the previous CPU approaches. The algorithm can be easily implemented with OpenGL 3.3 API or higher on consumer-level PCs.

Wireless Sensor Networks - Node Localization for Various Industry Problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Derr, Kurt; Manic, Milos

Fast, effective monitoring following airborne releases of toxic substances is critical to mitigate risks to threatened population areas. Wireless sensor nodes at fixed predetermined locations may monitor such airborne releases and provide early warnings to the public. A challenging algorithmic problem is determining the locations to place these sensor nodes while meeting several criteria: 1) provide complete coverage of the domain, and 2) create a topology with problem dependent node densities, while 3) minimizing the number of sensor nodes. This manuscript presents a novel approach to determining optimal sensor placement, Advancing Front mEsh generation with Constrained dElaunay Triangulation and Smoothingmore » (AFECETS) that addresses these criteria. A unique aspect of AFECETS is the ability to determine wireless sensor node locations for areas of high interest (hospitals, schools, high population density areas) that require higher density of nodes for monitoring environmental conditions, a feature that is difficult to find in other research work. The AFECETS algorithm was tested on several arbitrary shaped domains. AFECETS simulation results show that the algorithm 1) provides significant reduction in the number of nodes, in some cases over 40%, compared to an advancing front mesh generation algorithm, 2) maintains and improves optimal spacing between nodes, and 3) produces simulation run times suitable for real-time applications.« less

A consistent and conservative scheme for MHD flows with complex boundaries on an unstructured Cartesian adaptive system

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Jie; Ni, Ming-Jiu, E-mail: mjni@ucas.ac.cn

2014-01-01

The numerical simulation of Magnetohydrodynamics (MHD) flows with complex boundaries has been a topic of great interest in the development of a fusion reactor blanket for the difficulty to accurately simulate the Hartmann layers and side layers along arbitrary geometries. An adaptive version of a consistent and conservative scheme has been developed for simulating the MHD flows. Besides, the present study forms the first attempt to apply the cut-cell approach for irregular wall-bounded MHD flows, which is more flexible and conveniently implemented under adaptive mesh refinement (AMR) technique. It employs a Volume-of-Fluid (VOF) approach to represent the fluid–conducting wall interfacemore » that makes it possible to solve the fluid–solid coupling magnetic problems, emphasizing at how electric field solver is implemented when conductivity is discontinuous in cut-cell. For the irregular cut-cells, the conservative interpolation technique is applied to calculate the Lorentz force at cell-center. On the other hand, it will be shown how consistent and conservative scheme is implemented on fine/coarse mesh boundaries when using AMR technique. Then, the applied numerical schemes are validated by five test simulations and excellent agreement was obtained for all the cases considered, simultaneously showed good consistency and conservative properties.« less

Wireless Sensor Networks - Node Localization for Various Industry Problems

DOE PAGES

Derr, Kurt; Manic, Milos

2015-06-01

Fast, effective monitoring following airborne releases of toxic substances is critical to mitigate risks to threatened population areas. Wireless sensor nodes at fixed predetermined locations may monitor such airborne releases and provide early warnings to the public. A challenging algorithmic problem is determining the locations to place these sensor nodes while meeting several criteria: 1) provide complete coverage of the domain, and 2) create a topology with problem dependent node densities, while 3) minimizing the number of sensor nodes. This manuscript presents a novel approach to determining optimal sensor placement, Advancing Front mEsh generation with Constrained dElaunay Triangulation and Smoothingmore » (AFECETS) that addresses these criteria. A unique aspect of AFECETS is the ability to determine wireless sensor node locations for areas of high interest (hospitals, schools, high population density areas) that require higher density of nodes for monitoring environmental conditions, a feature that is difficult to find in other research work. The AFECETS algorithm was tested on several arbitrary shaped domains. AFECETS simulation results show that the algorithm 1) provides significant reduction in the number of nodes, in some cases over 40%, compared to an advancing front mesh generation algorithm, 2) maintains and improves optimal spacing between nodes, and 3) produces simulation run times suitable for real-time applications.« less

Mapping the Structure and Dynamics of Genomics-Related MeSH Terms Complex Networks

PubMed Central

Siqueiros-García, Jesús M.; Hernández-Lemus, Enrique; García-Herrera, Rodrigo; Robina-Galatas, Andrea

2014-01-01

It has been proposed that the history and evolution of scientific ideas may reflect certain aspects of the underlying socio-cognitive frameworks in which science itself is developing. Systematic analyses of the development of scientific knowledge may help us to construct models of the collective dynamics of science. Aiming at scientific rigor, these models should be built upon solid empirical evidence, analyzed with formal tools leading to ever-improving results that support the related conclusions. Along these lines we studied the dynamics and structure of the development of research in genomics as represented by the entire collection of genomics-related scientific papers contained in the PubMed database. The analyzed corpus consisted in more than 49,000 articles published in the years 1987 (first appeareance of the term Genomics) to 2011, categorized by means of the Medical Subheadings (MeSH) content-descriptors. Complex networks were built where two MeSH terms were connected if they are descriptors of the same article(s). The analysis of such networks revealed a complex structure and dynamics that to certain extent resembled small-world networks. The evolution of such networks in time reflected interesting phenomena in the historical development of genomic research, including what seems to be a phase-transition in a period marked by the completion of the first draft of the Human Genome Project. We also found that different disciplinary areas have different dynamic evolution patterns in their MeSH connectivity networks. In the case of areas related to science, changes in topology were somewhat fast while retaining a certain core-stucture, whereas in the humanities, the evolution was pretty slow and the structure resulted highly redundant and in the case of technology related issues, the evolution was very fast and the structure remained tree-like with almost no overlapping terms. PMID:24699262

3D Voronoi grid dedicated software for modeling gas migration in deep layered sedimentary formations with TOUGH2-TMGAS

NASA Astrophysics Data System (ADS)

Bonduà, Stefano; Battistelli, Alfredo; Berry, Paolo; Bortolotti, Villiam; Consonni, Alberto; Cormio, Carlo; Geloni, Claudio; Vasini, Ester Maria

2017-11-01

As is known, a full three-dimensional (3D) unstructured grid permits a great degree of flexibility when performing accurate numerical reservoir simulations. However, when the Integral Finite Difference Method (IFDM) is used for spatial discretization, constraints (arising from the required orthogonality between the segment connecting the blocks nodes and the interface area between blocks) pose difficulties in the creation of grids with irregular shaped blocks. The full 3D Voronoi approach guarantees the respect of IFDM constraints and allows generation of grids conforming to geological formations and structural objects and at the same time higher grid resolution in volumes of interest. In this work, we present dedicated pre- and post-processing gridding software tools for the TOUGH family of numerical reservoir simulators, developed by the Geothermal Research Group of the DICAM Department, University of Bologna. VORO2MESH is a new software coded in C++, based on the voro++ library, allowing computation of the 3D Voronoi tessellation for a given domain and the creation of a ready to use TOUGH2 MESH file. If a set of geological surfaces is available, the software can directly generate the set of Voronoi seed points used for tessellation. In order to reduce the number of connections and so to decrease computation time, VORO2MESH can produce a mixed grid with regular blocks (orthogonal prisms) and irregular blocks (polyhedron Voronoi blocks) at the point of contact between different geological formations. In order to visualize 3D Voronoi grids together with the results of numerical simulations, the functionality of the TOUGH2Viewer post-processor has been extended. We describe an application of VORO2MESH and TOUGH2Viewer to validate the two tools. The case study deals with the simulation of the migration of gases in deep layered sedimentary formations at basin scale using TOUGH2-TMGAS. A comparison between the simulation performances of unstructured and structured grids is presented.

Resource Optimization Scheme for Multimedia-Enabled Wireless Mesh Networks

PubMed Central

Ali, Amjad; Ahmed, Muhammad Ejaz; Piran, Md. Jalil; Suh, Doug Young

2014-01-01

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. PMID:25111241

Earth As An Unstructured Mesh and Its Recovery from Seismic Waveform Data

NASA Astrophysics Data System (ADS)

De Hoop, M. V.

2015-12-01

We consider multi-scale representations of Earth's interior from thepoint of view of their possible recovery from multi- andhigh-frequency seismic waveform data. These representations areintrinsically connected to (geologic, tectonic) structures, that is,geometric parametrizations of Earth's interior. Indeed, we address theconstruction and recovery of such parametrizations using localiterative methods with appropriately designed data misfits andguaranteed convergence. The geometric parametrizations containinterior boundaries (defining, for example, faults, salt bodies,tectonic blocks, slabs) which can, in principle, be obtained fromsuccessive segmentation. We make use of unstructured meshes. For the adaptation and recovery of an unstructured mesh we introducean energy functional which is derived from the Hausdorff distance. Viaan augmented Lagrangian method, we incorporate the mentioned datamisfit. The recovery is constrained by shape optimization of theinterior boundaries, and is reminiscent of Hausdorff warping. We useelastic deformation via finite elements as a regularization whilefollowing a two-step procedure. The first step is an update determinedby the energy functional; in the second step, we modify the outcome ofthe first step where necessary to ensure that the new mesh isregular. This modification entails an array of techniques includingtopology correction involving interior boundary contacting andbreakup, edge warping and edge removal. We implement this as afeed-back mechanism from volume to interior boundary meshesoptimization. We invoke and apply a criterion of mesh quality controlfor coarsening, and for dynamical local multi-scale refinement. Wepresent a novel (fluid-solid) numerical framework based on theDiscontinuous Galerkin method.

Resource optimization scheme for multimedia-enabled wireless mesh networks.

PubMed

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.

Underworld: What we set out to do, How far did we get, What did we Learn ? (Invited)

NASA Astrophysics Data System (ADS)

Moresi, L. N.

2013-12-01

Underworld was conceived as a tool for modelling 3D lithospheric deformation coupled with the underlying / surrounding mantle flow. The challenges involved were to find a method capable of representing the complicated, non-linear, history dependent rheology of the near surface as well as being able to model mantle convection, and, simultaneously, to be able to solve the numerical system efficiently. Underworld is a hybrid particle / mesh code reminiscent of the particle-in-cell techniques from the early 1960s. The Underworld team (*) was not the first to use this approach, nor the last, but the team does have considerable experience and much has been learned along the way. The use of a finite element method as the underlying "cell" in which the Lagrangian particles are embedded considerably reduces errors associated with mapping material properties to the cells. The particles are treated as moving quadrature points in computing the stiffness matrix integrals. The decoupling of deformation markers from computation points allows the use of structured meshes, efficient parallel decompositions, and simple-to-code geometric multigrid solution methods. For a 3D code such efficiencies are very important. The elegance of the method is that it can be completely described in a couple of sentences. However, there are some limitations: it is not obvious how to retain this elegance for unstructured or adaptive meshes, arbitrary element types are not sufficiently well integrated by the simple quadrature approach, and swarms of particles representing volumes are usually an inefficient representation of surfaces. This will be discussed ! (*) Although not formally constituted, my co-conspirators in this exercise are listed as the Underworld team and I will reveal their true identities on the day.

A high-order vertex-based central ENO finite-volume scheme for three-dimensional compressible flows

DOE PAGES

Charest, Marc R.J.; Canfield, Thomas R.; Morgan, Nathaniel R.; ...

2015-03-11

High-order discretization methods offer the potential to reduce the computational cost associated with modeling compressible flows. However, it is difficult to obtain accurate high-order discretizations of conservation laws that do not produce spurious oscillations near discontinuities, especially on multi-dimensional unstructured meshes. A novel, high-order, central essentially non-oscillatory (CENO) finite-volume method that does not have these difficulties is proposed for tetrahedral meshes. The proposed unstructured method is vertex-based, which differs from existing cell-based CENO formulations, and uses a hybrid reconstruction procedure that switches between two different solution representations. It applies a high-order k-exact reconstruction in smooth regions and a limited linearmore » reconstruction when discontinuities are encountered. Both reconstructions use a single, central stencil for all variables, making the application of CENO to arbitrary unstructured meshes relatively straightforward. The new approach was applied to the conservation equations governing compressible flows and assessed in terms of accuracy and computational cost. For all problems considered, which included various function reconstructions and idealized flows, CENO demonstrated excellent reliability and robustness. Up to fifth-order accuracy was achieved in smooth regions and essentially non-oscillatory solutions were obtained near discontinuities. The high-order schemes were also more computationally efficient for high-accuracy solutions, i.e., they took less wall time than the lower-order schemes to achieve a desired level of error. In one particular case, it took a factor of 24 less wall-time to obtain a given level of error with the fourth-order CENO scheme than to obtain the same error with the second-order scheme.« less

The Scattering of Particles with Spin from Targets with Spin

ERIC Educational Resources Information Center

Stewart, Noel M.

1978-01-01

The density matrix is used to obtain an expression for the mean value of any spin operator in the scattering of particles with arbitrary spin. The example of spin-1/2-spin-1 scattering is developed and physical information obtained by establishing connections with the polarization tensor and Wolfenstein observables. (Author/GA)

Stabilization of a locally minimal forest

NASA Astrophysics Data System (ADS)

Ivanov, A. O.; Mel'nikova, A. E.; Tuzhilin, A. A.

2014-03-01

The method of partial stabilization of locally minimal networks, which was invented by Ivanov and Tuzhilin to construct examples of shortest trees with given topology, is developed. According to this method, boundary vertices of degree 2 are not added to all edges of the original locally minimal tree, but only to some of them. The problem of partial stabilization of locally minimal trees in a finite-dimensional Euclidean space is solved completely in the paper, that is, without any restrictions imposed on the number of edges remaining free of subdivision. A criterion for the realizability of such stabilization is established. In addition, the general problem of searching for the shortest forest connecting a finite family of boundary compact sets in an arbitrary metric space is formalized; it is shown that such forests exist for any family of compact sets if and only if for any finite subset of the ambient space there exists a shortest tree connecting it. The theory developed here allows us to establish further generalizations of the stabilization theorem both for arbitrary metric spaces and for metric spaces with some special properties. Bibliography: 10 titles.

Second central extension in Galilean covariant field theory

NASA Astrophysics Data System (ADS)

Hagen, C. R.

2002-07-01

The possibility of a connection between the second central extension of the planar Galilei group and the spin variable is considered. This idea is explored within the framework of local Galilean covariant field theory for free fields of arbitrary spin. It is shown that such systems generally display only a trivial realization of the second central extension. While it is possible to realize any desired value of the extension parameter by suitable redefinition of the boost operator, such an approach has no necessary connection to the spin of the basic underlying field.

Free-Lagrange methods for compressible hydrodynamics in two space dimensions

NASA Astrophysics Data System (ADS)

Crowley, W. E.

1985-03-01

Since 1970 a research and development program in Free-Lagrange methods has been active at Livermore. The initial steps were taken with incompressible flows for simplicity. Since then the effort has been concentrated on compressible flows with shocks in two space dimensions and time. In general, the line integral method has been used to evaluate derivatives and the artificial viscosity method has been used to deal with shocks. Basically, two Free-Lagrange formulations for compressible flows in two space dimensions and time have been tested and both will be described. In method one, all prognostic quantities were node centered and staggered in time. The artificial viscosity was zone centered. One mesh reconnection philosphy was that the mesh should be optimized so that nearest neighbors were connected together. Another was that vertex angles should tend toward equality. In method one, all mesh elements were triangles. In method two, both quadrilateral and triangular mesh elements are permitted. The mesh variables are staggered in space and time as suggested originally by Richtmyer and von Neumann. The mesh reconnection strategy is entirely different in method two. In contrast to the global strategy of nearest neighbors, we now have a more local strategy that reconnects in order to keep the integration time step above a user chosen threshold. An additional strategy reconnects in the vicinity of large relative fluid motions. Mesh reconnection consists of two parts: (1) the tools that permits nodes to be merged and quads to be split into triangles etc. and; (2) the strategy that dictates how and when to use the tools. Both tools and strategies change with time in a continuing effort to expand the capabilities of the method. New ideas are continually being tried and evaluated.

Verification of transport equations in a general purpose commercial CFD code.

NASA Astrophysics Data System (ADS)

Melot, Matthieu; Nennemann, Bernd; Deschênes, Claire

2016-11-01

In this paper, the Verification and Validation methodology is presented. This method aims to increase the reliability and the trust that can be placed into complex CFD simulations. The first step of this methodology, the code verification is presented in greater details. The CFD transport equations in steady state, transient and Arbitrary Eulerian Lagrangian (ALE, used for transient moving mesh) formulations in Ansys CFX are verified. It is shown that the expected spatial and temporal order of convergence are achieved for the steady state and the transient formulations. Unfortunately this is not completely the case for the ALE formulation. As for a lot of other commercial and in-house CFD codes, the temporal convergence of the velocity is limited to a first order where a second order would have been expected.

A new discrete Kirchhoff-Mindlin element based on Mindlin-Reissner plate theory and assumed shear strain fields. I - An extended DKT element for thick-plate bending analysis. II - An extended DKQ element for thick-plate bending analysis

NASA Astrophysics Data System (ADS)

Katili, Irwan

1993-06-01

A new three-node nine-degree-of-freedom triangular plate bending element is proposed which is valid for the analysis of both thick and thin plates. The element, called the discrete Kirchhoff-Mindlin triangle (DKMT), has a proper rank, passes the patch test for thin and thick plates in an arbitrary mesh, and is free of shear locking. As an extension of the DKMT element, a four-node element with 3 degrees of freedom per node is developed. The element, referred to as DKMQ (discrete Kirchhoff-Mindlin quadrilateral) is found to provide good results for both thin and thick plates without any compatibility problems.

On an adaptive preconditioned Crank-Nicolson MCMC algorithm for infinite dimensional Bayesian inference

NASA Astrophysics Data System (ADS)

Hu, Zixi; Yao, Zhewei; Li, Jinglai

2017-03-01

Many scientific and engineering problems require to perform Bayesian inference for unknowns of infinite dimension. In such problems, many standard Markov Chain Monte Carlo (MCMC) algorithms become arbitrary slow under the mesh refinement, which is referred to as being dimension dependent. To this end, a family of dimensional independent MCMC algorithms, known as the preconditioned Crank-Nicolson (pCN) methods, were proposed to sample the infinite dimensional parameters. In this work we develop an adaptive version of the pCN algorithm, where the covariance operator of the proposal distribution is adjusted based on sampling history to improve the simulation efficiency. We show that the proposed algorithm satisfies an important ergodicity condition under some mild assumptions. Finally we provide numerical examples to demonstrate the performance of the proposed method.

Surface tension models for a multi-material ALE code with AMR

DOE Office of Scientific and Technical Information (OSTI.GOV)

Liu, Wangyi; Koniges, Alice; Gott, Kevin

A number of surface tension models have been implemented in a 3D multi-physics multi-material code, ALE–AMR, which combines Arbitrary Lagrangian Eulerian (ALE) hydrodynamics with Adaptive Mesh Refinement (AMR). ALE–AMR is unique in its ability to model hot radiating plasmas, cold fragmenting solids, and most recently, the deformation of molten material. The surface tension models implemented include a diffuse interface approach with special numerical techniques to remove parasitic flow and a height function approach in conjunction with a volume-fraction interface reconstruction package. These surface tension models are benchmarked with a variety of test problems. In conclusion, based on the results, themore » height function approach using volume fractions was chosen to simulate droplet dynamics associated with extreme ultraviolet (EUV) lithography.« less

A mesh-free approach to acoustic scattering from multiple spheres nested inside a large sphere by using diagonal translation operators.

PubMed

Hesford, Andrew J; Astheimer, Jeffrey P; Greengard, Leslie F; Waag, Robert C

2010-02-01

A multiple-scattering approach is presented to compute the solution of the Helmholtz equation when a number of spherical scatterers are nested in the interior of an acoustically large enclosing sphere. The solution is represented in terms of partial-wave expansions, and a linear system of equations is derived to enforce continuity of pressure and normal particle velocity across all material interfaces. This approach yields high-order accuracy and avoids some of the difficulties encountered when using integral equations that apply to surfaces of arbitrary shape. Calculations are accelerated by using diagonal translation operators to compute the interactions between spheres when the operators are numerically stable. Numerical results are presented to demonstrate the accuracy and efficiency of the method.

A mesh-free approach to acoustic scattering from multiple spheres nested inside a large sphere by using diagonal translation operators

PubMed Central

Hesford, Andrew J.; Astheimer, Jeffrey P.; Greengard, Leslie F.; Waag, Robert C.

2010-01-01

A multiple-scattering approach is presented to compute the solution of the Helmholtz equation when a number of spherical scatterers are nested in the interior of an acoustically large enclosing sphere. The solution is represented in terms of partial-wave expansions, and a linear system of equations is derived to enforce continuity of pressure and normal particle velocity across all material interfaces. This approach yields high-order accuracy and avoids some of the difficulties encountered when using integral equations that apply to surfaces of arbitrary shape. Calculations are accelerated by using diagonal translation operators to compute the interactions between spheres when the operators are numerically stable. Numerical results are presented to demonstrate the accuracy and efficiency of the method. PMID:20136208

Surface tension models for a multi-material ALE code with AMR

DOE PAGES

Liu, Wangyi; Koniges, Alice; Gott, Kevin; ...

2017-06-01

A number of surface tension models have been implemented in a 3D multi-physics multi-material code, ALE–AMR, which combines Arbitrary Lagrangian Eulerian (ALE) hydrodynamics with Adaptive Mesh Refinement (AMR). ALE–AMR is unique in its ability to model hot radiating plasmas, cold fragmenting solids, and most recently, the deformation of molten material. The surface tension models implemented include a diffuse interface approach with special numerical techniques to remove parasitic flow and a height function approach in conjunction with a volume-fraction interface reconstruction package. These surface tension models are benchmarked with a variety of test problems. In conclusion, based on the results, themore » height function approach using volume fractions was chosen to simulate droplet dynamics associated with extreme ultraviolet (EUV) lithography.« less

Hydraulic redistribution of water from Pinus ponderosa trees to seedlings: evidence for an ectomycorrhizal pathway.

PubMed

Warren, Jeffrey M; Brooks, J Renée; Meinzer, Frederick C; Eberhart, Joyce L

2008-01-01

While there is strong evidence for hydraulic redistribution (HR) of soil water by trees, it is not known if common mycorrhizal networks (CMN) can facilitate HR from mature trees to seedlings under field conditions. Ponderosa pine (Pinus ponderosa) seedlings were planted into root-excluding 61-microm mesh barrier chambers buried in an old-growth pine forest. After 2 yr, several mature trees were cut and water enriched in D(2)O and acid fuchsin dye was applied to the stumps. Fine roots and mycorrhizal root tips of source trees became heavily dyed, indicating reverse sap flow in root xylem transported water from stems throughout root systems to the root hyphal mantle that interfaces with CMN. Within 3 d, D(2)O was found in mesh-chamber seedling foliage > 1 m from source trees; after 3 wk, eight of 10 mesh-chamber seedling stem samples were significantly enriched above background levels. Average mesh-chamber enrichment was 1.8 x greater than that for two seedlings for which the connections to CMN were broken by trenching before D(2)O application. Even small amounts of water provided to mycorrhizas by HR may maintain hyphal viability and facilitate nutrient uptake under drying conditions, which may provide an advantage to seedlings hydraulically linked by CMN to large trees.

Hip Joint Replacement Using Monofilament Polypropylene Surgical Mesh: An Animal Model

PubMed Central

Białecki, Jacek; Klimowicz-Bodys, Małgorzata Dorota; Wierzchoś, Edward; Kołomecki, Krzysztof

2014-01-01

Hip joint dysplasia is a deformation of the articular elements (pelvic acetabulum, head of the femur, and/or ligament of the head of the femur) leading to laxity of the hip components and dislocation of the femoral head from the pelvic acetabulum. Diagnosis is based on symptoms observed during clinical and radiological examinations. There are two treatment options: conservative and surgical. The classic surgical procedures are juvenile pubic symphysiodesis (JPS), triple pelvic osteotomy (TPO), total hip replacement (THR), and femoral head and neck resection (FHNE). The aim of this experiment was to present an original technique of filling the acetabulum with a polypropylene implant, resting the femoral neck directly on the mesh. The experiment was performed on eight sheep. The clinical value of the new surgical technique was evaluated using clinical, radiological, and histological methods. This technique helps decrease the loss of limb length by supporting the femoral neck on the mesh equivalent to the femoral head. It also reduces joint pain and leads to the formation of stable and mobile pseudarthrosis. The mesh manifested osteoprotective properties and enabled the formation of a stiff-elastic connection within the hip joint. The method is very cost-effective and the technique itself is simple to perform. PMID:24987672

On the Resource Efficiency of Virtual Concatenation in SDH/SONET Mesh Transport Networks Bearing Protected Scheduled Connections

NASA Astrophysics Data System (ADS)

Kuri, Josu�; Gagnaire, Maurice; Puech, Nicolas

2005-10-01

Virtual concatenation (VCAT) is a Synchronous Digital Hierarchy (SDH)/Synchronous Optical Network (SONET) network functionality recently standardized by the International Telecommunication Union Telecommunication Standardization Sector (ITU-T). VCAT provides the flexibility required to efficiently allocate network resources to Ethernet, Fiber Channel (FC), Enterprise System Connection (ESCON), and other important data traffic signals. In this article, we assess the resources' gain provided by VCAT with respect to contiguous concatenation (CCAT) in SDH/SONET mesh transport networks bearing protected scheduled connection demands (SCDs). As explained later, an SCD is a connection demand for which the set-up and tear-down dates are known in advance. We define mathematical models to quantify the add/drop and transmission resources required to instantiate a set of protected SCDs in VCAT-and CCAT-capable networks. Quantification of transmission resources requires a routing and slot assignment (RSA) problem to be solved. We formulate the RSA problem in VCAT-and CCAT-capable networks as two different combinatorial optimization problems: RSA in VCAT-capable networks (RSAv) and RSA in CCAT-capable networks (RSAc), respectively. Protection of the SCDs is considered in the formulations using a shared backup path protection (SBPP) technique. We propose a simulated annealing (SA)-based meta-heuristic algorithm to compute approximate solutions to these problems (i.e., solutions whose cost approximates the cost of the optimal ones). The gain in transmission resources and the cost structure of add/drop resources making VCAT-capable networks more economical are analyzed for different traffic scenarios.

Comparison of insect vacuums for sampling Asian citrus psyllid (Homoptera: Psyllidae) on citrus trees

USDA-ARS?s Scientific Manuscript database

Three vacuum devices were compared for sampling psyllid populations. One was an AC rechargeable, handheld, cordless model and a second was a handheld, DC model powered through a cord connected to a 12V vehicle battery. Each of these devices had a mesh cylinder (substituted for a dust bag) in which...

Stability and self-organization of planetary systems.

PubMed

Pakter, Renato; Levin, Yan

2018-04-01

We show that stability of planetary systems is intimately connected with their internal order. An arbitrary initial distribution of planets is susceptible to catastrophic events in which planets either collide or are ejected from the planetary system. These instabilities are a fundamental consequence of chaotic dynamics and of Arnold diffusion characteristic of many body gravitational interactions. To ensure stability over astronomical time scale of a realistic planetary system-in which planets have masses comparable to those of planets in the solar system-the motion must be quasiperiodic. A dynamical mechanism is proposed which naturally evolves a planetary system to a quasiperiodic state from an arbitrary initial condition. A planetary self-organization predicted by the theory is similar to the one found in our solar system.

On the role of dealing with quantum coherence in amplitude amplification

NASA Astrophysics Data System (ADS)

Rastegin, Alexey E.

2018-07-01

Amplitude amplification is one of primary tools in building algorithms for quantum computers. This technique generalizes key ideas of the Grover search algorithm. Potentially useful modifications are connected with changing phases in the rotation operations and replacing the intermediate Hadamard transform with arbitrary unitary one. In addition, arbitrary initial distribution of the amplitudes may be prepared. We examine trade-off relations between measures of quantum coherence and the success probability in amplitude amplification processes. As measures of coherence, the geometric coherence and the relative entropy of coherence are considered. In terms of the relative entropy of coherence, complementarity relations with the success probability seem to be the most expository. The general relations presented are illustrated within several model scenarios of amplitude amplification processes.

Stability and self-organization of planetary systems

NASA Astrophysics Data System (ADS)

Pakter, Renato; Levin, Yan

2018-04-01

We show that stability of planetary systems is intimately connected with their internal order. An arbitrary initial distribution of planets is susceptible to catastrophic events in which planets either collide or are ejected from the planetary system. These instabilities are a fundamental consequence of chaotic dynamics and of Arnold diffusion characteristic of many body gravitational interactions. To ensure stability over astronomical time scale of a realistic planetary system—in which planets have masses comparable to those of planets in the solar system—the motion must be quasiperiodic. A dynamical mechanism is proposed which naturally evolves a planetary system to a quasiperiodic state from an arbitrary initial condition. A planetary self-organization predicted by the theory is similar to the one found in our solar system.

Study of the Effect of a Closed-End Side Branch on Sinusoidally Perturbed Flow of Liquid in a Line

NASA Technical Reports Server (NTRS)

Lewis, William; Blade, Robert J.; Dorsch, Robert G.

1963-01-01

Classical undamped acoustic-wave theory was used to determine analytical relations among sinusoidal perturbations of pressure and flow at the ends of a hydraulic-transmission line having a closed-end branch of arbitrary length attached at an arbitrary point. Experimental data were obtained for the equilateral case (a branch half as long as the main line connected to the main line at the midpoint) at mean flow speeds of 5 to 10 feet per second. Measured pressure-perturbation ratios agreed closely with analytical predictions. As frequencies for which the branch length was an odd multiple of 1/4 wavelength, waves in the main line were almost completely reflected at the junction point.

Analysis of stationary availability factor of two-level backbone computer networks with arbitrary topology

NASA Astrophysics Data System (ADS)

Rahman, P. A.

2018-05-01

This scientific paper deals with the two-level backbone computer networks with arbitrary topology. A specialized method, offered by the author for calculation of the stationary availability factor of the two-level backbone computer networks, based on the Markov reliability models for the set of the independent repairable elements with the given failure and repair rates and the methods of the discrete mathematics, is also discussed. A specialized algorithm, offered by the author for analysis of the network connectivity, taking into account different kinds of the network equipment failures, is also observed. Finally, this paper presents an example of calculation of the stationary availability factor for the backbone computer network with the given topology.

Secondary Emission Calorimeter Sensor Development

NASA Astrophysics Data System (ADS)

Winn, David R.; Onel, Yasar

2012-12-01

In a Secondary Emission electron(SEe) detector module, Secondary Emission electrons (SEe) are generated from an SE surface/cathode, when charged hadronic or electromagnetic particles, particularly shower particles, penetrate an SE sampling module placed between absorber materials (Fe, Cu, Pb, W etc) in calorimeters. The SE cathode is a thin (10-50 nm thick) film (simple metal-oxides, or other higher yield materials) on the surface of a metal plate, which serves as the entrance “window” to a compact vacuum vessel (metal or metal-ceramic); this SE film cathode is analogous to a photocathode, and the SEe are similar to p.e., which are then amplified by dynodes, also is in a PMT. SE sensor modules can make use of electrochemically etched/machined or laser-cut metal mesh dynode sheets, as large as ~30 cm square, to amplify the Secondary Emission Electrons (SEe), much like those that compact metal mesh or mesh dynode PMT's use to amplify p.e.'s. The construction requirements easier than a PMT, since the entire final assembly can be done in air; there are no critical controlled thin film depositions, cesiation or other oxygen-excluded processes or other required vacuum activation, and consequently bake-out can be a refractory temperatures; the module is sealed by normal vacuum techniques (welding or brazing or other high temperature joinings), with a simple final heated vacuum pump-out and tip-off. The modules envisioned are compact, high gain, high speed, exceptionally radiation damage resistant, rugged, and cost effective, and can be fabricated in arbitrary tileable shapes. The SE sensor module anodes can be segmented transversely to sizes appropriate to reconstruct electromagnetic cores with high precision. The GEANT4 and existing calorimeter data estimated calorimeter response performance is between 35-50 Secondary Emission electrons per GeV, in a 1 cm thick Cu absorber calorimeter, with a gain per SEe > 105 per SEe, and an e/pi<1.2. The calorimeter pulse width is estimated to be <15 ns. With fine mesh sampling only (no thick absorbers) the resolution is ~25 MeV at 1 GeV.

Collector/Compactor for Waste or Debris

NASA Technical Reports Server (NTRS)

Mangialiardi, John K.

1987-01-01

Device collects and compacts debris by sweeping through volume with net. Consists of movable vane, fixed vane, and elastic net connected to both vanes. Movable vane is metal strip curved to follow general contour of container with clearance to prevent interference with other parts on inside wall of container. One end of movable vane mounted in bearing and other end connected to driveshaft equipped with handle. User rotates movable vane, net stretched and swept through container. Captures most of debris coarser than mesh as it moves, compressing debris as it arrives at fixed vane. Applications include cleaning swimming pools and tanks.

Discretization-dependent model for weakly connected excitable media

NASA Astrophysics Data System (ADS)

Arroyo, Pedro André; Alonso, Sergio; Weber dos Santos, Rodrigo

2018-03-01

Pattern formation has been widely observed in extended chemical and biological processes. Although the biochemical systems are highly heterogeneous, homogenized continuum approaches formed by partial differential equations have been employed frequently. Such approaches are usually justified by the difference of scales between the heterogeneities and the characteristic spatial size of the patterns. Under different conditions, for example, under weak coupling, discrete models are more adequate. However, discrete models may be less manageable, for instance, in terms of numerical implementation and mesh generation, than the associated continuum models. Here we study a model to approach discreteness which permits the computer implementation on general unstructured meshes. The model is cast as a partial differential equation but with a parameter that depends not only on heterogeneities sizes, as in the case of quasicontinuum models, but also on the discretization mesh. Therefore, we refer to it as a discretization-dependent model. We validate the approach in a generic excitable media that simulates three different phenomena: the propagation of action membrane potential in cardiac tissue, in myelinated axons of neurons, and concentration waves in chemical microemulsions.

Radiation Coupling with the FUN3D Unstructured-Grid CFD Code

NASA Technical Reports Server (NTRS)

Wood, William A.

2012-01-01

The HARA radiation code is fully-coupled to the FUN3D unstructured-grid CFD code for the purpose of simulating high-energy hypersonic flows. The radiation energy source terms and surface heat transfer, under the tangent slab approximation, are included within the fluid dynamic ow solver. The Fire II flight test, at the Mach-31 1643-second trajectory point, is used as a demonstration case. Comparisons are made with an existing structured-grid capability, the LAURA/HARA coupling. The radiative surface heat transfer rates from the present approach match the benchmark values within 6%. Although radiation coupling is the focus of the present work, convective surface heat transfer rates are also reported, and are seen to vary depending upon the choice of mesh connectivity and FUN3D ux reconstruction algorithm. On a tetrahedral-element mesh the convective heating matches the benchmark at the stagnation point, but under-predicts by 15% on the Fire II shoulder. Conversely, on a mixed-element mesh the convective heating over-predicts at the stagnation point by 20%, but matches the benchmark away from the stagnation region.

Effects of local and global network connectivity on synergistic epidemics

NASA Astrophysics Data System (ADS)

Broder-Rodgers, David; Pérez-Reche, Francisco J.; Taraskin, Sergei N.

2015-12-01

Epidemics in networks can be affected by cooperation in transmission of infection and also connectivity between nodes. An interplay between these two properties and their influence on epidemic spread are addressed in the paper. A particular type of cooperative effects (called synergy effects) is considered, where the transmission rate between a pair of nodes depends on the number of infected neighbors. The connectivity effects are studied by constructing networks of different topology, starting with lattices with only local connectivity and then with networks that have both local and global connectivity obtained by random bond-rewiring to nodes within a certain distance. The susceptible-infected-removed epidemics were found to exhibit several interesting effects: (i) for epidemics with strong constructive synergy spreading in networks with high local connectivity, the bond rewiring has a negative role in epidemic spread, i.e., it reduces invasion probability; (ii) in contrast, for epidemics with destructive or weak constructive synergy spreading on networks of arbitrary local connectivity, rewiring helps epidemics to spread; (iii) and, finally, rewiring always enhances the spread of epidemics, independent of synergy, if the local connectivity is low.

Effects of local and global network connectivity on synergistic epidemics.

PubMed

Broder-Rodgers, David; Pérez-Reche, Francisco J; Taraskin, Sergei N

2015-12-01

Epidemics in networks can be affected by cooperation in transmission of infection and also connectivity between nodes. An interplay between these two properties and their influence on epidemic spread are addressed in the paper. A particular type of cooperative effects (called synergy effects) is considered, where the transmission rate between a pair of nodes depends on the number of infected neighbors. The connectivity effects are studied by constructing networks of different topology, starting with lattices with only local connectivity and then with networks that have both local and global connectivity obtained by random bond-rewiring to nodes within a certain distance. The susceptible-infected-removed epidemics were found to exhibit several interesting effects: (i) for epidemics with strong constructive synergy spreading in networks with high local connectivity, the bond rewiring has a negative role in epidemic spread, i.e., it reduces invasion probability; (ii) in contrast, for epidemics with destructive or weak constructive synergy spreading on networks of arbitrary local connectivity, rewiring helps epidemics to spread; (iii) and, finally, rewiring always enhances the spread of epidemics, independent of synergy, if the local connectivity is low.

Flat connections in open string mirror symmetry

NASA Astrophysics Data System (ADS)

Alim, Murad; Hecht, Michael; Jockers, Hans; Mayr, Peter; Mertens, Adrian; Soroush, Masoud

2012-06-01

We study a flat connection defined on the open-closed deformation space of open string mirror symmetry for type II compactifications on Calabi-Yau threefolds with D-branes. We use flatness and integrability conditions to define distinguished flat coordinates and the superpotential function at an arbitrary point in the open-closed deformation space. Integrability conditions are given for concrete deformation spaces with several closed and open string deformations. We study explicit examples for expansions around different limit points, including orbifold Gromov-Witten invariants, and brane configurations with several brane moduli. In particular, the latter case covers stacks of parallel branes with non-Abelian symmetry.

AMR on the CM-2

NASA Technical Reports Server (NTRS)

Berger, Marsha J.; Saltzman, Jeff S.

1992-01-01

We describe the development of a structured adaptive mesh algorithm (AMR) for the Connection Machine-2 (CM-2). We develop a data layout scheme that preserves locality even for communication between fine and coarse grids. On 8K of a 32K machine we achieve performance slightly less than 1 CPU of the Cray Y-MP. We apply our algorithm to an inviscid compressible flow problem.

Numerical Analysis of Solids at Failure

DTIC Science & Technology

2011-08-20

failure analyses include the formulation of invariant finite elements for thin Kirchhoff rods, and preliminary initial studies of growth in...analysis of the failure of other structural/mechanical systems, including the finite element modeling of thin Kirchhoff rods and the constitutive...algorithm based on the connectivity graph of the underlying finite element mesh. In this setting, the discontinuities are defined by fronts propagating

The AIS-5000 parallel processor

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schmitt, L.A.; Wilson, S.S.

1988-05-01

The AIS-5000 is a commercially available massively parallel processor which has been designed to operate in an industrial environment. It has fine-grained parallelism with up to 1024 processing elements arranged in a single-instruction multiple-data (SIMD) architecture. The processing elements are arranged in a one-dimensional chain that, for computer vision applications, can be as wide as the image itself. This architecture has superior cost/performance characteristics than two-dimensional mesh-connected systems. The design of the processing elements and their interconnections as well as the software used to program the system allow a wide variety of algorithms and applications to be implemented. In thismore » paper, the overall architecture of the system is described. Various components of the system are discussed, including details of the processing elements, data I/O pathways and parallel memory organization. A virtual two-dimensional model for programming image-based algorithms for the system is presented. This model is supported by the AIS-5000 hardware and software and allows the system to be treated as a full-image-size, two-dimensional, mesh-connected parallel processor. Performance bench marks are given for certain simple and complex functions.« less

A new method for automated discontinuity trace mapping on rock mass 3D surface model

NASA Astrophysics Data System (ADS)

Li, Xiaojun; Chen, Jianqin; Zhu, Hehua

2016-04-01

This paper presents an automated discontinuity trace mapping method on a 3D surface model of rock mass. Feature points of discontinuity traces are first detected using the Normal Tensor Voting Theory, which is robust to noisy point cloud data. Discontinuity traces are then extracted from feature points in four steps: (1) trace feature point grouping, (2) trace segment growth, (3) trace segment connection, and (4) redundant trace segment removal. A sensitivity analysis is conducted to identify optimal values for the parameters used in the proposed method. The optimal triangular mesh element size is between 5 cm and 6 cm; the angle threshold in the trace segment growth step is between 70° and 90°; the angle threshold in the trace segment connection step is between 50° and 70°, and the distance threshold should be at least 15 times the mean triangular mesh element size. The method is applied to the excavation face trace mapping of a drill-and-blast tunnel. The results show that the proposed discontinuity trace mapping method is fast and effective and could be used as a supplement to traditional direct measurement of discontinuity traces.

Transonic Flow Field Analysis for Wing-Fuselage Configurations

NASA Technical Reports Server (NTRS)

Boppe, C. W.

1980-01-01

A computational method for simulating the aerodynamics of wing-fuselage configurations at transonic speeds is developed. The finite difference scheme is characterized by a multiple embedded mesh system coupled with a modified or extended small disturbance flow equation. This approach permits a high degree of computational resolution in addition to coordinate system flexibility for treating complex realistic aircraft shapes. To augment the analysis method and permit applications to a wide range of practical engineering design problems, an arbitrary fuselage geometry modeling system is incorporated as well as methodology for computing wing viscous effects. Configuration drag is broken down into its friction, wave, and lift induced components. Typical computed results for isolated bodies, isolated wings, and wing-body combinations are presented. The results are correlated with experimental data. A computer code which employs this methodology is described.

A second-order cell-centered Lagrangian ADER-MOOD finite volume scheme on multidimensional unstructured meshes for hydrodynamics

NASA Astrophysics Data System (ADS)

Boscheri, Walter; Dumbser, Michael; Loubère, Raphaël; Maire, Pierre-Henri

2018-04-01

In this paper we develop a conservative cell-centered Lagrangian finite volume scheme for the solution of the hydrodynamics equations on unstructured multidimensional grids. The method is derived from the Eucclhyd scheme discussed in [47,43,45]. It is second-order accurate in space and is combined with the a posteriori Multidimensional Optimal Order Detection (MOOD) limiting strategy to ensure robustness and stability at shock waves. Second-order of accuracy in time is achieved via the ADER (Arbitrary high order schemes using DERivatives) approach. A large set of numerical test cases is proposed to assess the ability of the method to achieve effective second order of accuracy on smooth flows, maintaining an essentially non-oscillatory behavior on discontinuous profiles, general robustness ensuring physical admissibility of the numerical solution, and precision where appropriate.

3-D direct current resistivity anisotropic modelling by goal-oriented adaptive finite element methods

NASA Astrophysics Data System (ADS)

Ren, Zhengyong; Qiu, Lewen; Tang, Jingtian; Wu, Xiaoping; Xiao, Xiao; Zhou, Zilong

2018-01-01

Although accurate numerical solvers for 3-D direct current (DC) isotropic resistivity models are current available even for complicated models with topography, reliable numerical solvers for the anisotropic case are still an open question. This study aims to develop a novel and optimal numerical solver for accurately calculating the DC potentials for complicated models with arbitrary anisotropic conductivity structures in the Earth. First, a secondary potential boundary value problem is derived by considering the topography and the anisotropic conductivity. Then, two a posteriori error estimators with one using the gradient-recovery technique and one measuring the discontinuity of the normal component of current density are developed for the anisotropic cases. Combing the goal-oriented and non-goal-oriented mesh refinements and these two error estimators, four different solving strategies are developed for complicated DC anisotropic forward modelling problems. A synthetic anisotropic two-layer model with analytic solutions verified the accuracy of our algorithms. A half-space model with a buried anisotropic cube and a mountain-valley model are adopted to test the convergence rates of these four solving strategies. We found that the error estimator based on the discontinuity of current density shows better performance than the gradient-recovery based a posteriori error estimator for anisotropic models with conductivity contrasts. Both error estimators working together with goal-oriented concepts can offer optimal mesh density distributions and highly accurate solutions.

Fluid-Structure Interaction Study on a Pre-Buckled Deformable Flat Ribbon

NASA Astrophysics Data System (ADS)

Fovargue, Lauren; Shams, Ehsan; Watterson, Amy; Corson, Dave; Filardo, Benjamin; Zimmerman, Daniel; Shan, Bob; Oberai, Assad

2015-11-01

A Fluid-Structure Interaction study is conducted for the flow over a deformable flat ribbon. This mechanism, which is called ribbon frond, maybe used as a device for pumping water and/or harvesting energy in rivers. We use a lower dimensional mathematical model, which represents the ribbon as a pre-buckled structure. The surface forces from the fluid flow, dictate the deformation of the ribbon, and the ribbon in turn imposes boundary conditions for the incompressible Navier-Stokes equations. The mesh motion is handled using an Arbitrary Lagrangian-Eulerian (ALE) scheme and the fluid-structure coupling is handled by iterating over the staggered governing equations for the structure, the fluid and the mesh. Simulations are conducted at three different free stream velocities. The results, including the frequency of oscillations, show agreement with experimental data. The vortical structures near the surface of the ribbon and its deformation are highly correlated. It is observed that the ribbon motion exhibits deviation from a harmonic motion, especially at lower free stream velocities. The behavior of the ribbon is compared to swimming animals, such as eels, in order to better understand its performance. The authors acknowledge support from ONR SBIR Phase II, contract No. N0001412C0604 and USDA, NIFA SBIR Phase I, contract No. 2013-33610-20836 and NYSERDA PON 2569, contract No. 30364.

Programming of the complex logarithm function in the solution of the cracked anisotropic plate loaded by a point force

NASA Astrophysics Data System (ADS)

Zaal, K. J. J. M.

1991-06-01

In programming solutions of complex function theory, the complex logarithm function is replaced by the complex logarithmic function, introducing a discontinuity along the branch cut into the programmed solution which was not present in the mathematical solution. Recently, Liaw and Kamel presented their solution of the infinite anisotropic centrally cracked plate loaded by an arbitrary point force, which they used as Green's function in a boundary element method intended to evaluate the stress intensity factor at the tip of a crack originating from an elliptical home. Their solution may be used as Green's function of many more numerical methods involving anisotropic elasticity. In programming applications of Liaw and Kamel's solution, the standard definition of the logarithmic function with the branch cut at the nonpositive real axis cannot provide a reliable computation of the displacement field for Liaw and Kamel's solution. Either the branch cut should be redefined outside the domain of the logarithmic function, after proving that the domain is limited to a part of the plane, or the logarithmic function should be defined on its Riemann surface. A two dimensional line fractal can provide the link between all mesh points on the plane essential to evaluate the logarithm function on its Riemann surface. As an example, a two dimensional line fractal is defined for a mesh once used by Erdogan and Arin.

Numerical Modeling of Complex Targets for High-Energy- Density Experiments with Ion Beams and other Drivers

DOE PAGES

Koniges, Alice; Liu, Wangyi; Lidia, Steven; ...

2016-04-01

We explore the simulation challenges and requirements for experiments planned on facilities such as the NDCX-II ion accelerator at LBNL, currently undergoing commissioning. Hydrodynamic modeling of NDCX-II experiments include certain lower temperature effects, e.g., surface tension and target fragmentation, that are not generally present in extreme high-energy laser facility experiments, where targets are completely vaporized in an extremely short period of time. Target designs proposed for NDCX-II range from metal foils of order one micron thick (thin targets) to metallic foam targets several tens of microns thick (thick targets). These high-energy-density experiments allow for the study of fracture as wellmore » as the process of bubble and droplet formation. We incorporate these physics effects into a code called ALE-AMR that uses a combination of Arbitrary Lagrangian Eulerian hydrodynamics and Adaptive Mesh Refinement. Inclusion of certain effects becomes tricky as we must deal with non-orthogonal meshes of various levels of refinement in three dimensions. A surface tension model used for droplet dynamics is implemented in ALE-AMR using curvature calculated from volume fractions. Thick foam target experiments provide information on how ion beam induced shock waves couple into kinetic energy of fluid flow. Although NDCX-II is not fully commissioned, experiments are being conducted that explore material defect production and dynamics.« less

Mathematical modeling of the aerodynamic characteristics in flight dynamics

NASA Technical Reports Server (NTRS)

Tobak, M.; Chapman, G. T.; Schiff, L. B.

1984-01-01

Basic concepts involved in the mathematical modeling of the aerodynamic response of an aircraft to arbitrary maneuvers are reviewed. The original formulation of an aerodynamic response in terms of nonlinear functionals is shown to be compatible with a derivation based on the use of nonlinear functional expansions. Extensions of the analysis through its natural connection with ideas from bifurcation theory are indicated.

A programmable five qubit quantum computer using trapped atomic ions

NASA Astrophysics Data System (ADS)

Debnath, Shantanu

2017-04-01

In order to harness the power of quantum information processing, several candidate systems have been investigated, and tailored to demonstrate only specific computations. In my thesis work, we construct a general-purpose multi-qubit device using a linear chain of trapped ion qubits, which in principle can be programmed to run any quantum algorithm. To achieve such flexibility, we develop a pulse shaping technique to realize a set of fully connected two-qubit rotations that entangle arbitrary pairs of qubits using multiple motional modes of the chain. Following a computation architecture, such highly expressive two-qubit gates along with arbitrary single-qubit rotations can be used to compile modular universal logic gates that are effected by targeted optical fields and hence can be reconfigured according to any algorithm circuit programmed in the software. As a demonstration, we run the Deutsch-Jozsa and Bernstein-Vazirani algorithm, and a fully coherent quantum Fourier transform, that we use to solve the `period finding' and `quantum phase estimation' problem. Combining these results with recent demonstrations of quantum fault-tolerance, Grover's search algorithm, and simulation of boson hopping establishes the versatility of such a computation module that can potentially be connected to other modules for future large-scale computations.

DRAGON Grid: A Three-Dimensional Hybrid Grid Generation Code Developed

NASA Technical Reports Server (NTRS)

Liou, Meng-Sing

2000-01-01

Because grid generation can consume 70 percent of the total analysis time for a typical three-dimensional viscous flow simulation for a practical engineering device, payoffs from research and development could reduce costs and increase throughputs considerably. In this study, researchers at the NASA Glenn Research Center at Lewis Field developed a new hybrid grid approach with the advantages of flexibility, high-quality grids suitable for an accurate resolution of viscous regions, and a low memory requirement. These advantages will, in turn, reduce analysis time and increase accuracy. They result from an innovative combination of structured and unstructured grids to represent the geometry and the computation domain. The present approach makes use of the respective strengths of both the structured and unstructured grid methods, while minimizing their weaknesses. First, the Chimera grid generates high-quality, mostly orthogonal meshes around individual components. This process is flexible and can be done easily. Normally, these individual grids are required overlap each other so that the solution on one grid can communicate with another. However, when this communication is carried out via a nonconservative interpolation procedure, a spurious solution can result. Current research is aimed at entirely eliminating this undesired interpolation by directly replacing arbitrary grid overlapping with a nonstructured grid called a DRAGON grid, which uses the same set of conservation laws over the entire region, thus ensuring conservation everywhere. The DRAGON grid is shown for a typical film-cooled turbine vane with 33 holes and 3 plenum compartments. There are structured grids around each geometrical entity and unstructured grids connecting them. In fiscal year 1999, Glenn researchers developed and tested the three-dimensional DRAGON grid-generation tools. A flow solver suitable for the DRAGON grid has been developed, and a series of validation tests are underway.

A CLASS OF RECONSTRUCTED DISCONTINUOUS GALERKIN METHODS IN COMPUTATIONAL FLUID DYNAMICS

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hong Luo; Yidong Xia; Robert Nourgaliev

2011-05-01

A class of reconstructed discontinuous Galerkin (DG) methods is presented to solve compressible flow problems on arbitrary grids. The idea is to combine the efficiency of the reconstruction methods in finite volume methods and the accuracy of the DG methods to obtain a better numerical algorithm in computational fluid dynamics. The beauty of the resulting reconstructed discontinuous Galerkin (RDG) methods is that they provide a unified formulation for both finite volume and DG methods, and contain both classical finite volume and standard DG methods as two special cases of the RDG methods, and thus allow for a direct efficiency comparison.more » Both Green-Gauss and least-squares reconstruction methods and a least-squares recovery method are presented to obtain a quadratic polynomial representation of the underlying linear discontinuous Galerkin solution on each cell via a so-called in-cell reconstruction process. The devised in-cell reconstruction is aimed to augment the accuracy of the discontinuous Galerkin method by increasing the order of the underlying polynomial solution. These three reconstructed discontinuous Galerkin methods are used to compute a variety of compressible flow problems on arbitrary meshes to assess their accuracy. The numerical experiments demonstrate that all three reconstructed discontinuous Galerkin methods can significantly improve the accuracy of the underlying second-order DG method, although the least-squares reconstructed DG method provides the best performance in terms of both accuracy, efficiency, and robustness.« less

Novel 3D Compression Methods for Geometry, Connectivity and Texture

NASA Astrophysics Data System (ADS)

Siddeq, M. M.; Rodrigues, M. A.

2016-06-01

A large number of applications in medical visualization, games, engineering design, entertainment, heritage, e-commerce and so on require the transmission of 3D models over the Internet or over local networks. 3D data compression is an important requirement for fast data storage, access and transmission within bandwidth limitations. The Wavefront OBJ (object) file format is commonly used to share models due to its clear simple design. Normally each OBJ file contains a large amount of data (e.g. vertices and triangulated faces, normals, texture coordinates and other parameters) describing the mesh surface. In this paper we introduce a new method to compress geometry, connectivity and texture coordinates by a novel Geometry Minimization Algorithm (GM-Algorithm) in connection with arithmetic coding. First, each vertex ( x, y, z) coordinates are encoded to a single value by the GM-Algorithm. Second, triangle faces are encoded by computing the differences between two adjacent vertex locations, which are compressed by arithmetic coding together with texture coordinates. We demonstrate the method on large data sets achieving compression ratios between 87 and 99 % without reduction in the number of reconstructed vertices and triangle faces. The decompression step is based on a Parallel Fast Matching Search Algorithm (Parallel-FMS) to recover the structure of the 3D mesh. A comparative analysis of compression ratios is provided with a number of commonly used 3D file formats such as VRML, OpenCTM and STL highlighting the performance and effectiveness of the proposed method.

Arbitrary spin-to-orbital angular momentum conversion of light

NASA Astrophysics Data System (ADS)

Devlin, Robert C.; Ambrosio, Antonio; Rubin, Noah A.; Mueller, J. P. Balthasar; Capasso, Federico

2017-11-01

Optical elements that convert the spin angular momentum (SAM) of light into vortex beams have found applications in classical and quantum optics. These elements—SAM-to-orbital angular momentum (OAM) converters—are based on the geometric phase and only permit the conversion of left- and right-circular polarizations (spin states) into states with opposite OAM. We present a method for converting arbitrary SAM states into total angular momentum states characterized by a superposition of independent OAM. We designed a metasurface that converts left- and right-circular polarizations into states with independent values of OAM and designed another device that performs this operation for elliptically polarized states. These results illustrate a general material-mediated connection between SAM and OAM of light and may find applications in producing complex structured light and in optical communication.

Node property of weighted networks considering connectability to nodes within two degrees of separation.

PubMed

Amano, Sun-Ichi; Ogawa, Ken-Ichiro; Miyake, Yoshihiro

2018-05-31

Weighted networks have been extensively studied because they can represent various phenomena in which the diversity of edges is essential. To investigate the properties of weighted networks, various centrality measures have been proposed, such as strength, weighted clustering coefficients, and weighted betweenness centrality. In such measures, only direct connections or entire network connectivity from arbitrary nodes have been used to calculate the connectivity of each node. However, in weighted networks composed of autonomous elements such as humans, middle ranges from each node are also considered to be meaningful for characterizing each node's connectability. In this study, we define a new node property in weighted networks to consider connectability to nodes within a range of two degrees of separation, then apply this new centrality to face-to-face human communication networks in corporate organizations. Our results show that the proposed centrality distinguishes inherent communities corresponding to the job types in each organization with a high degree of accuracy. This indicates the possibility that connectability to nodes within two degrees of separation reveals potential trends of weighted networks that are not apparent from conventional measures.

The Robustness Analysis of Wireless Sensor Networks under Uncertain Interference

PubMed Central

Deng, Changjian

2013-01-01

Based on the complex network theory, robustness analysis of condition monitoring wireless sensor network under uncertain interference is present. In the evolution of the topology of sensor networks, the density weighted algebraic connectivity is taken into account, and the phenomenon of removing and repairing the link and node in the network is discussed. Numerical simulation is conducted to explore algebraic connectivity characteristics and network robustness performance. It is found that nodes density has the effect on algebraic connectivity distribution in the random graph model; high density nodes carry more connections, use more throughputs, and may be more unreliable. Moreover, the results show that, when network should be more error tolerant or robust by repairing nodes or adding new nodes, the network should be better clustered in median and high scale wireless sensor networks and be meshing topology in small scale networks. PMID:24363613

Electrospun meshes possessing region-wise differences in fiber orientation, diameter, chemistry and mechanical properties for engineering bone-ligament-bone tissues.

PubMed

Samavedi, Satyavrata; Vaidya, Prasad; Gaddam, Prudhvidhar; Whittington, Abby R; Goldstein, Aaron S

2014-12-01

Although bone-patellar tendon-bone (B-PT-B) autografts are the gold standard for repair of anterior cruciate ligament ruptures, they suffer from drawbacks such as donor site morbidity and limited supply. Engineered tissues modeled after B-PT-B autografts are promising alternatives because they have the potential to regenerate connective tissue and facilitate osseointegration. Towards the long-term goal of regenerating ligaments and their bony insertions, the objective of this study was to construct 2D meshes and 3D cylindrical composite scaffolds - possessing simultaneous region-wise differences in fiber orientation, diameter, chemistry and mechanical properties - by electrospinning two different polymers from off-set spinnerets. Using a dual drum collector, 2D meshes consisting of an aligned polycaprolactone (PCL) fiber region, randomly oriented poly(lactide-co-glycolide) (PLGA) fiber region and a transition region (comprised of both PCL and PLGA fibers) were prepared, and region-wise differences were confirmed by microscopy and tensile testing. Bone marrow stromal cells (BMSCs) cultured on these meshes exhibited random orientations and low aspect ratios on the random PLGA regions, and high aspect ratios and alignment on the aligned PCL regions. Next, meshes containing an aligned PCL region flanked by two transition regions and two randomly oriented PLGA regions were prepared and processed into 3D cylindrical composite scaffolds using an interpenetrating photo-crosslinkable polyethylene glycol diacrylate hydrogel to recapitulate the shape of B-PT-B autografts. Tensile testing indicated that cylindrical composites were mechanically robust, and eventually failed due to stress concentration in the aligned PCL region. In summary, this study demonstrates a process to fabricate electrospun meshes possessing region-wise differences in properties that can elicit region-dependent cell responses, and be readily processed into scaffolds with the shape of B-PT-B autografts. © 2014 Wiley Periodicals, Inc.

eBits: Compact stream of mesh refinements for remote visualization

DOE PAGES

Sati, Mukul; Lindstrom, Peter; Rossignac, Jarek

2016-05-12

Here, we focus on applications where a remote client needs to visualize or process a complex, manifold triangle mesh, M, but only in a relatively small, user controlled, Region of Interest (RoI) at a time. The client first downloads a coarse base mesh, pre-computed on the server via a series of simplification passes on M, one per Level of Detail (LoD), each pass identifying an independent set of triangles, collapsing them, and, for each collapse, storing, in a Vertex Expansion Record (VER), the information needed to reverse the collapse. On each client initiated RoI modification request, the server pushes tomore » the client a selected subset of these VERs, which, when decoded and applied to refine the mesh locally, ensure that the portion in the RoI is always at full resolution. The eBits approach proposed here offers state of the art compression ratios (using less than 2.5 bits per new full resolution RoI triangle when the RoI has more than 2000 vertices to transmit the connectivity for the selective refinements) and fine-grain control (allowing the user to adjust the RoI by small increments). The effectiveness of eBits results from several novel ideas and novel variations of previous solutions. We represent the VERs using persistent labels so that they can be applied in different orders within a given LoD. The server maintains a shadow copy of the client’s mesh. To avoid sending IDs identifying which vertices should be expanded, we either transmit, for each new vertex, a compact encoding of its death tag–the LoD at which it will be expanded if it lies in the Rol–or transmit vertex masks for the RoI and its neighboring vertices. We also propose a three-step simplification that reduces the overall transmission cost by increasing both the simplification effectiveness and the regularity of the valences in the resulting meshes.« less

eBits: Compact stream of mesh refinements for remote visualization

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sati, Mukul; Lindstrom, Peter; Rossignac, Jarek

2016-05-12

Here, we focus on applications where a remote client needs to visualize or process a complex, manifold triangle mesh, M, but only in a relatively small, user controlled, Region of Interest (RoI) at a time. The client first downloads a coarse base mesh, pre-computed on the server via a series of simplification passes on M, one per Level of Detail (LoD), each pass identifying an independent set of triangles, collapsing them, and, for each collapse, storing, in a Vertex Expansion Record (VER), the information needed to reverse the collapse. On each client initiated RoI modification request, the server pushes tomore » the client a selected subset of these VERs, which, when decoded and applied to refine the mesh locally, ensure that the portion in the RoI is always at full resolution. The eBits approach proposed here offers state of the art compression ratios (using less than 2.5 bits per new full resolution RoI triangle when the RoI has more than 2000 vertices to transmit the connectivity for the selective refinements) and fine-grain control (allowing the user to adjust the RoI by small increments). The effectiveness of eBits results from several novel ideas and novel variations of previous solutions. We represent the VERs using persistent labels so that they can be applied in different orders within a given LoD. The server maintains a shadow copy of the client’s mesh. To avoid sending IDs identifying which vertices should be expanded, we either transmit, for each new vertex, a compact encoding of its death tag ​–the LoD at which it will be expanded if it lies in the RoI–or transmit vertex masks for the RoI and its neighboring vertices. We also propose a three-step simplification that reduces the overall transmission cost by increasing both the simplification effectiveness and the regularity of the valences in the resulting meshes.« less

Clinical evaluation of expanded mesh connective tissue graft in the treatment for multiple adjacent gingival recessions in the esthetic zone

PubMed Central

Shanmugam, M.; Shivakumar, B.; Meenapriya, B.; Anitha, V.; Ashwath, B.

2015-01-01

Background: Multiple approaches have been used to replace lost, damaged or diseased gingival tissues. The connective tissue graft (CTG) procedure is the golden standard method for root coverage. Although multiple sites often need grafting, the palatal mucosa supplies only a limited area of grafting material. To overcome this limitation, expanded mesh graft provides a method whereby a graft can be stretched to cover a large area. The aim of this study was to evaluate the effectiveness and the predictability of expanded mesh CTG (e-MCTG) in the treatment of adjacent multiple gingival recessions. Materials and Methods: Sixteen patients aged 20–50 years contributed to 55 sites, each site falling into at least three adjacent Miller's Class 1 or Class 2 gingival recession. The CTG obtained from the palatal mucosa was expanded to cover the recipient bed, which was 1.5 times larger than the graft. Clinical measurements were recorded at baseline and 3 months, 12 months postoperatively. Results: A mean coverage of 1.96 mm ± 0.66 mm and 2.22 mm ± 0.68 mm was obtained at the end of 3rd and 12th month, respectively. Twelve months after surgery a statistically significant increase in CAL (2.2 mm ± 0.68 mm, P < 0.001) and increasing WKT (1.75 ± 0.78, P < 0.001) were obtained. In 80% of the treated sites, 100% root coverage was achieved (mean 93.5%). Conclusions: The results of this study demonstrated that multiple adjacent recessions were treated by using e-MCTG technique can be applied and highly predictable root coverage can be achieved. PMID:26321829

SLIM: an alternative Web interface for MEDLINE/PubMed searches – a preliminary study

PubMed Central

Muin, Michael; Fontelo, Paul; Liu, Fang; Ackerman, Michael

2005-01-01

Background With the rapid growth of medical information and the pervasiveness of the Internet, online search and retrieval systems have become indispensable tools in medicine. The progress of Web technologies can provide expert searching capabilities to non-expert information seekers. The objective of the project is to create an alternative search interface for MEDLINE/PubMed searches using JavaScript slider bars. SLIM, or Slider Interface for MEDLINE/PubMed searches, was developed with PHP and JavaScript. Interactive slider bars in the search form controlled search parameters such as limits, filters and MeSH terminologies. Connections to PubMed were done using the Entrez Programming Utilities (E-Utilities). Custom scripts were created to mimic the automatic term mapping process of Entrez. Page generation times for both local and remote connections were recorded. Results Alpha testing by developers showed SLIM to be functionally stable. Page generation times to simulate loading times were recorded the first week of alpha and beta testing. Average page generation times for the index page, previews and searches were 2.94 milliseconds, 0.63 seconds and 3.84 seconds, respectively. Eighteen physicians from the US, Australia and the Philippines participated in the beta testing and provided feedback through an online survey. Most users found the search interface user-friendly and easy to use. Information on MeSH terms and the ability to instantly hide and display abstracts were identified as distinctive features. Conclusion SLIM can be an interactive time-saving tool for online medical literature research that improves user control and capability to instantly refine and refocus search strategies. With continued development and by integrating search limits, methodology filters, MeSH terms and levels of evidence, SLIM may be useful in the practice of evidence-based medicine. PMID:16321145

SLIM: an alternative Web interface for MEDLINE/PubMed searches - a preliminary study.

PubMed

Muin, Michael; Fontelo, Paul; Liu, Fang; Ackerman, Michael

2005-12-01

With the rapid growth of medical information and the pervasiveness of the Internet, online search and retrieval systems have become indispensable tools in medicine. The progress of Web technologies can provide expert searching capabilities to non-expert information seekers. The objective of the project is to create an alternative search interface for MEDLINE/PubMed searches using JavaScript slider bars. SLIM, or Slider Interface for MEDLINE/PubMed searches, was developed with PHP and JavaScript. Interactive slider bars in the search form controlled search parameters such as limits, filters and MeSH terminologies. Connections to PubMed were done using the Entrez Programming Utilities (E-Utilities). Custom scripts were created to mimic the automatic term mapping process of Entrez. Page generation times for both local and remote connections were recorded. Alpha testing by developers showed SLIM to be functionally stable. Page generation times to simulate loading times were recorded the first week of alpha and beta testing. Average page generation times for the index page, previews and searches were 2.94 milliseconds, 0.63 seconds and 3.84 seconds, respectively. Eighteen physicians from the US, Australia and the Philippines participated in the beta testing and provided feedback through an online survey. Most users found the search interface user-friendly and easy to use. Information on MeSH terms and the ability to instantly hide and display abstracts were identified as distinctive features. SLIM can be an interactive time-saving tool for online medical literature research that improves user control and capability to instantly refine and refocus search strategies. With continued development and by integrating search limits, methodology filters, MeSH terms and levels of evidence, SLIM may be useful in the practice of evidence-based medicine.

Unified connected theory of few-body reaction mechanisms in N-body scattering theory

NASA Technical Reports Server (NTRS)

Polyzou, W. N.; Redish, E. F.

1978-01-01

A unified treatment of different reaction mechanisms in nonrelativistic N-body scattering is presented. The theory is based on connected kernel integral equations that are expected to become compact for reasonable constraints on the potentials. The operators T/sub +-//sup ab/(A) are approximate transition operators that describe the scattering proceeding through an arbitrary reaction mechanism A. These operators are uniquely determined by a connected kernel equation and satisfy an optical theorem consistent with the choice of reaction mechanism. Connected kernel equations relating T/sub +-//sup ab/(A) to the full T/sub +-//sup ab/ allow correction of the approximate solutions for any ignored process to any order. This theory gives a unified treatment of all few-body reaction mechanisms with the same dynamic simplicity of a model calculation, but can include complicated reaction mechanisms involving overlapping configurations where it is difficult to formulate models.

Simulation capability for dynamics of two-body flexible satellites

NASA Technical Reports Server (NTRS)

Austin, F.; Zetkov, G.

1973-01-01

An analysis and computer program were prepared to realistically simulate the dynamic behavior of a class of satellites consisting of two end bodies separated by a connecting structure. The shape and mass distribution of the flexible end bodies are arbitrary; the connecting structure is flexible but massless and is capable of deployment and retraction. Fluid flowing in a piping system and rigid moving masses, representing a cargo elevator or crew members, have been modeled. Connecting structure characteristics, control systems, and externally applied loads are modeled in easily replaced subroutines. Subroutines currently available include a telescopic beam-type connecting structure as well as attitude, deployment, spin and wobble control. In addition, a unique mass balance control system was developed to sense and balance mass shifts due to the motion of a cargo elevator. The mass of the cargo may vary through a large range. Numerical results are discussed for various types of runs.

Covariant Derivatives and the Renormalization Group Equation

NASA Astrophysics Data System (ADS)

Dolan, Brian P.

The renormalization group equation for N-point correlation functions can be interpreted in a geometrical manner as an equation for Lie transport of amplitudes in the space of couplings. The vector field generating the diffeomorphism has components given by the β functions of the theory. It is argued that this simple picture requires modification whenever any one of the points at which the amplitude is evaluated becomes close to any other. This modification necessitates the introduction of a connection on the space of couplings and new terms appear in the renormalization group equation involving covariant derivatives of the β function and the curvature associated with the connection. It is shown how the connection is related to the operator product expansion coefficients, but there remains an arbitrariness in its definition.

Double-outlet right ventricle: Pathology and angiocardiography.

PubMed

Freedom, Robert M.; Yoo, Shi-Joon

2000-01-01

Double-outlet right ventricle is but one form of abnormal ventriculoarterial connection. The definition that more than half of each great artery originates above the morphologically right ventricle is arbitrary. As pointed out by Lecompte, those features that should be defined in hearts with the ventriculoarterial connection of double-outlet right ventricle (and indeed other forms of abnormal ventriculoarterial connection) include the nature of the infundibular septum, ventriculoinfundibular fold, trabeculoseptomargin-alis, attachments of infundibular septum to anterior or posterior limb of trabeculoseptomargin-alis, the size and position of the ventricular septal defect, the spatial relation of great artery(s) to the ventricular septal defect, the spatial relationship between the great, and the distance between the tricuspid and pulmonary valves and the semilunar valves. Copyright 2000 by W.B. Saunders Company

Partial Validation of Multibody Program to Optimize Simulated Trajectories II (POST II) Parachute Simulation With Interacting Forces

NASA Technical Reports Server (NTRS)

Raiszadeh, Ben; Queen, Eric M.

2002-01-01

A capability to simulate trajectories Of Multiple interacting rigid bodies has been developed. This capability uses the Program to Optimize Simulated Trajectories II (POST II). Previously, POST II had the ability to simulate multiple bodies without interacting forces. The current implementation is used for the Simulation of parachute trajectories, in which the parachute and suspended bodies can be treated as rigid bodies. An arbitrary set of connecting lines can be included in the model and are treated as massless spring-dampers. This paper discusses details of the connection line modeling and results of several test cases used to validate the capability.

Two stage gear tooth dynamics program

NASA Technical Reports Server (NTRS)

Boyd, Linda S.

1989-01-01

The epicyclic gear dynamics program was expanded to add the option of evaluating the tooth pair dynamics for two epicyclic gear stages with peripheral components. This was a practical extension to the program as multiple gear stages are often used for speed reduction, space, weight, and/or auxiliary units. The option was developed for either stage to be a basic planetary, star, single external-external mesh, or single external-internal mesh. The two stage system allows for modeling of the peripherals with an input mass and shaft, an output mass and shaft, and a connecting shaft. Execution of the initial test case indicated an instability in the solution with the tooth paid loads growing to excessive magnitudes. A procedure to trace the instability is recommended as well as a method of reducing the program's computation time by reducing the number of boundary condition iterations.

Pre-configured polyhedron based protection against multi-link failures in optical mesh networks.

PubMed

Huang, Shanguo; Guo, Bingli; Li, Xin; Zhang, Jie; Zhao, Yongli; Gu, Wanyi

2014-02-10

This paper focuses on random multi-link failures protection in optical mesh networks, instead of single, the dual or sequential failures of previous studies. Spare resource efficiency and failure robustness are major concerns in link protection strategy designing and a k-regular and k-edge connected structure is proved to be one of the optimal solutions for link protection network. Based on this, a novel pre-configured polyhedron based protection structure is proposed, and it could provide protection for both simultaneous and sequential random link failures with improved spare resource efficiency. Its performance is evaluated in terms of spare resource consumption, recovery rate and average recovery path length, as well as compared with ring based and subgraph protection under probabilistic link failure scenarios. Results show the proposed novel link protection approach has better performance than previous works.

Cylindrical Asymmetrical Capacitor Devices for Space Applications

NASA Technical Reports Server (NTRS)

Campbell, Jonathan W. (Inventor)

2004-01-01

An asymmetrical capacitor system is provided which creates a thrust force. The system is adapted for use in space applications and includes a capacitor device provided with a first conductive element and a second conductive element axially spaced from the first conductive element and of smaller axial extent. A shroud supplied with gas surrounds the capacitor device. The second conductive element can be a wire ring or mesh mounted on dielectric support posts affixed to a dielectric member which separates the conductive elements or a wire or mesh annulus surrounding a barrel-shaped dielectric member on which the h t element is also mounted. A high voltage source is connected across the conductive elements and applies a high voltage to the conductive elements of sufficient value to create a thrust force on the system inducing movement thereof.

Dynamic segment shared protection for multicast traffic in meshed wavelength-division-multiplexing optical networks

NASA Astrophysics Data System (ADS)

Liao, Luhua; Li, Lemin; Wang, Sheng

2006-12-01

We investigate the protection approach for dynamic multicast traffic under shared risk link group (SRLG) constraints in meshed wavelength-division-multiplexing optical networks. We present a shared protection algorithm called dynamic segment shared protection for multicast traffic (DSSPM), which can dynamically adjust the link cost according to the current network state and can establish a primary light-tree as well as corresponding SRLG-disjoint backup segments for a dependable multicast connection. A backup segment can efficiently share the wavelength capacity of its working tree and the common resources of other backup segments based on SRLG-disjoint constraints. The simulation results show that DSSPM not only can protect the multicast sessions against a single-SRLG breakdown, but can make better use of the wavelength resources and also lower the network blocking probability.

A Navier-Strokes Chimera Code on the Connection Machine CM-5: Design and Performance

NASA Technical Reports Server (NTRS)

Jespersen, Dennis C.; Levit, Creon; Kwak, Dochan (Technical Monitor)

1994-01-01

We have implemented a three-dimensional compressible Navier-Stokes code on the Connection Machine CM-5. The code is set up for implicit time-stepping on single or multiple structured grids. For multiple grids and geometrically complex problems, we follow the 'chimera' approach, where flow data on one zone is interpolated onto another in the region of overlap. We will describe our design philosophy and give some timing results for the current code. A parallel machine like the CM-5 is well-suited for finite-difference methods on structured grids. The regular pattern of connections of a structured mesh maps well onto the architecture of the machine. So the first design choice, finite differences on a structured mesh, is natural. We use centered differences in space, with added artificial dissipation terms. When numerically solving the Navier-Stokes equations, there are liable to be some mesh cells near a solid body that are small in at least one direction. This mesh cell geometry can impose a very severe CFL (Courant-Friedrichs-Lewy) condition on the time step for explicit time-stepping methods. Thus, though explicit time-stepping is well-suited to the architecture of the machine, we have adopted implicit time-stepping. We have further taken the approximate factorization approach. This creates the need to solve large banded linear systems and creates the first possible barrier to an efficient algorithm. To overcome this first possible barrier we have considered two options. The first is just to solve the banded linear systems with data spread over the whole machine, using whatever fast method is available. This option is adequate for solving scalar tridiagonal systems, but for scalar pentadiagonal or block tridiagonal systems it is somewhat slower than desired. The second option is to 'transpose' the flow and geometry variables as part of the time-stepping process: Start with x-lines of data in-processor. Form explicit terms in x, then transpose so y-lines of data are in-processor. Form explicit terms in y, then transpose so z-lines are in processor. Form explicit terms in z, then solve linear systems in the z-direction. Transpose to the y-direction, then solve linear systems in the y-direction. Finally transpose to the x direction and solve linear systems in the x-direction. This strategy avoids inter-processor communication when differencing and solving linear systems, but requires a large amount of communication when doing the transposes. The transpose method is more efficient than the non-transpose strategy when dealing with scalar pentadiagonal or block tridiagonal systems. For handling geometrically complex problems the chimera strategy was adopted. For multiple zone cases we compute on each zone sequentially (using the whole parallel machine), then send the chimera interpolation data to a distributed data structure (array) laid out over the whole machine. This information transfer implies an irregular communication pattern, and is the second possible barrier to an efficient algorithm. We have implemented these ideas on the CM-5 using CMF (Connection Machine Fortran), a data parallel language which combines elements of Fortran 90 and certain extensions, and which bears a strong similarity to High Performance Fortran. We make use of the Connection Machine Scientific Software Library (CMSSL) for the linear solver and array transpose operations.

Semi-Autonomous Vehicle Project

NASA Technical Reports Server (NTRS)

Stewart, Christopher

2016-01-01

The primary objective this summer is "evaluating standards for wireless architecture for the internet of things". The Internet of Things is the network of physical objects or "things" embedded with electronics, software, sensors and network connectivity which enables these objects to collect and exchange data and make decisions based on said data. This was accomplished by creating a semi-autonomous vehicle that takes advantage of multiple sensors, cameras, and onboard computers and combined them with a mesh network which enabled communication across large distances with little to no interruption. The mesh network took advantage of what is known as DTN - Disruption Tolerant Networking which according to NASA is the new communications protocol that is "the first step towards interplanetary internet." The use of DTN comes from the fact that it will store information if an interruption in communications is detected and even forward that information via other relays within range so that the data is not lost. This translates well into the project because as the car moves further away from whatever is sending it commands (in this case a joystick), the information can still be forwarded to the car with little to no loss of information thanks to the mesh nodes around the driving area.

Affine connection form of Regge calculus

NASA Astrophysics Data System (ADS)

Khatsymovsky, V. M.

2016-12-01

Regge action is represented analogously to how the Palatini action for general relativity (GR) as some functional of the metric and a general connection as independent variables represents the Einstein-Hilbert action. The piecewise flat (or simplicial) spacetime of Regge calculus is equipped with some world coordinates and some piecewise affine metric which is completely defined by the set of edge lengths and the world coordinates of the vertices. The conjugate variables are the general nondegenerate matrices on the three-simplices which play the role of a general discrete connection. Our previous result on some representation of the Regge calculus action in terms of the local Euclidean (Minkowsky) frame vectors and orthogonal connection matrices as independent variables is somewhat modified for the considered case of the general linear group GL(4, R) of the connection matrices. As a result, we have some action invariant w.r.t. arbitrary change of coordinates of the vertices (and related GL(4, R) transformations in the four-simplices). Excluding GL(4, R) connection from this action via the equations of motion we have exactly the Regge action for the considered spacetime.

Improved algorithms and methods for room sound-field prediction by acoustical radiosity in arbitrary polyhedral rooms.

PubMed

Nosal, Eva-Marie; Hodgson, Murray; Ashdown, Ian

2004-08-01

This paper explores acoustical (or time-dependent) radiosity--a geometrical-acoustics sound-field prediction method that assumes diffuse surface reflection. The literature of acoustical radiosity is briefly reviewed and the advantages and disadvantages of the method are discussed. A discrete form of the integral equation that results from meshing the enclosure boundaries into patches is presented and used in a discrete-time algorithm. Furthermore, an averaging technique is used to reduce computational requirements. To generalize to nonrectangular rooms, a spherical-triangle method is proposed as a means of evaluating the integrals over solid angles that appear in the discrete form of the integral equation. The evaluation of form factors, which also appear in the numerical solution, is discussed for rectangular and nonrectangular rooms. This algorithm and associated methods are validated by comparison of the steady-state predictions for a spherical enclosure to analytical solutions.

Improved algorithms and methods for room sound-field prediction by acoustical radiosity in arbitrary polyhedral rooms

NASA Astrophysics Data System (ADS)

Nosal, Eva-Marie; Hodgson, Murray; Ashdown, Ian

2004-08-01

This paper explores acoustical (or time-dependent) radiosity-a geometrical-acoustics sound-field prediction method that assumes diffuse surface reflection. The literature of acoustical radiosity is briefly reviewed and the advantages and disadvantages of the method are discussed. A discrete form of the integral equation that results from meshing the enclosure boundaries into patches is presented and used in a discrete-time algorithm. Furthermore, an averaging technique is used to reduce computational requirements. To generalize to nonrectangular rooms, a spherical-triangle method is proposed as a means of evaluating the integrals over solid angles that appear in the discrete form of the integral equation. The evaluation of form factors, which also appear in the numerical solution, is discussed for rectangular and nonrectangular rooms. This algorithm and associated methods are validated by comparison of the steady-state predictions for a spherical enclosure to analytical solutions.

Complex Geometric Models of Diffusion and Relaxation in Healthy and Damaged White Matter

PubMed Central

Farrell, Jonathan A.D.; Smith, Seth A.; Reich, Daniel S.; Calabresi, Peter A.; van Zijl, Peter C.M.

2010-01-01

Which aspects of tissue microstructure affect diffusion weighted MRI signals? Prior models, many of which use Monte-Carlo simulations, have focused on relatively simple models of the cellular microenvironment and have not considered important anatomic details. With the advent of higher-order analysis models for diffusion imaging, such as high-angular-resolution diffusion imaging (HARDI), more realistic models are necessary. This paper presents and evaluates the reproducibility of simulations of diffusion in complex geometries. Our framework is quantitative, does not require specialized hardware, is easily implemented with little programming experience, and is freely available as open-source software. Models may include compartments with different diffusivities, permeabilities, and T2 time constants using both parametric (e.g., spheres and cylinders) and arbitrary (e.g., mesh-based) geometries. Three-dimensional diffusion displacement-probability functions are mapped with high reproducibility, and thus can be readily used to assess reproducibility of diffusion-derived contrasts. PMID:19739233

Methods for simulation-based analysis of fluid-structure interaction.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Barone, Matthew Franklin; Payne, Jeffrey L.

2005-10-01

Methods for analysis of fluid-structure interaction using high fidelity simulations are critically reviewed. First, a literature review of modern numerical techniques for simulation of aeroelastic phenomena is presented. The review focuses on methods contained within the arbitrary Lagrangian-Eulerian (ALE) framework for coupling computational fluid dynamics codes to computational structural mechanics codes. The review treats mesh movement algorithms, the role of the geometric conservation law, time advancement schemes, wetted surface interface strategies, and some representative applications. The complexity and computational expense of coupled Navier-Stokes/structural dynamics simulations points to the need for reduced order modeling to facilitate parametric analysis. The proper orthogonalmore » decomposition (POD)/Galerkin projection approach for building a reduced order model (ROM) is presented, along with ideas for extension of the methodology to allow construction of ROMs based on data generated from ALE simulations.« less

FE Modelling of the Fluid-Structure-Acoustic Interaction for the Vocal Folds Self-Oscillation

NASA Astrophysics Data System (ADS)

Švancara, Pavel; Horáček, J.; Hrůza, V.

The flow induced self-oscillation of the human vocal folds in interaction with acoustic processes in the simplified vocal tract model was explored by three-dimensional (3D) finite element (FE) model. Developed FE model includes vocal folds pretension before phonation, large deformations of the vocal fold tissue, vocal folds contact, fluid-structure interaction, morphing the fluid mesh according the vocal folds motion (Arbitrary Lagrangian-Eulerian approach), unsteady viscous compressible airflow described by the Navier-Stokes equations and airflow separation during the glottis closure. Iterative partitioned approach is used for modelling the fluid-structure interaction. Computed results prove that the developed model can be used for simulation of the vocal folds self-oscillation and resulting acoustic waves. The developed model enables to numerically simulate an influence of some pathological changes in the vocal fold tissue on the voice production.

Analysis of ballistic transport in nanoscale devices by using an accelerated finite element contact block reduction approach

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li, H.; Li, G., E-mail: gli@clemson.edu

2014-08-28

An accelerated Finite Element Contact Block Reduction (FECBR) approach is presented for computational analysis of ballistic transport in nanoscale electronic devices with arbitrary geometry and unstructured mesh. Finite element formulation is developed for the theoretical CBR/Poisson model. The FECBR approach is accelerated through eigen-pair reduction, lead mode space projection, and component mode synthesis techniques. The accelerated FECBR is applied to perform quantum mechanical ballistic transport analysis of a DG-MOSFET with taper-shaped extensions and a DG-MOSFET with Si/SiO{sub 2} interface roughness. The computed electrical transport properties of the devices obtained from the accelerated FECBR approach and associated computational cost as amore » function of system degrees of freedom are compared with those obtained from the original CBR and direct inversion methods. The performance of the accelerated FECBR in both its accuracy and efficiency is demonstrated.« less

Numerical solution of the Navier-Stokes equations for blunt nosed bodies in supersonic flows

NASA Technical Reports Server (NTRS)

Warsi, Z. U. A.; Devarayalu, K.; Thompson, J. F.

1978-01-01

A time dependent, two dimensional Navier-Stokes code employing the method of body fitted coordinate technique was developed for supersonic flows past blunt bodies of arbitrary shapes. The bow shock ahead of the body is obtained as part of the solution, viz., by shock capturing. A first attempt at mesh refinement in the shock region was made by using the forcing function in the coordinate generating equations as a linear function of the density gradients. The technique displaces a few lines from the neighboring region into the shock region. Numerical calculations for Mach numbers 2 and 4.6 and Reynolds numbers from 320 to 10,000 were performed for a circular cylinder with and without a fairing. Results of Mach number 4.6 and Reynolds number 10,000 for an isothermal wall temperature of 556 K are presented in detail.

Computational Study of the Richtmyer-Meshkov Instability with a Complex Initial Condition

NASA Astrophysics Data System (ADS)

McFarland, Jacob; Reilly, David; Greenough, Jeffrey; Ranjan, Devesh

2014-11-01

Results are presented for a computational study of the Richtmyer-Meshkov instability with a complex initial condition. This study covers experiments which will be conducted at the newly-built inclined shock tube facility at the Georgia Institute of Technology. The complex initial condition employed consists of an underlying inclined interface perturbation with a broadband spectrum of modes superimposed. A three-dimensional staggered mesh arbitrary Lagrange Eulerian (ALE) hydrodynamics code developed at Lawerence Livermore National Laboratory called ARES was used to obtain both qualitative and quantitative results. Qualitative results are discussed using time series of density plots from which mixing width may be extracted. Quantitative results are also discussed using vorticity fields, circulation components, and energy spectra. The inclined interface case is compared to the complex interface case in order to study the effect of initial conditions on shocked, variable-density flows.

Parallel Solver for H(div) Problems Using Hybridization and AMG

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lee, Chak S.; Vassilevski, Panayot S.

2016-01-15

In this paper, a scalable parallel solver is proposed for H(div) problems discretized by arbitrary order finite elements on general unstructured meshes. The solver is based on hybridization and algebraic multigrid (AMG). Unlike some previously studied H(div) solvers, the hybridization solver does not require discrete curl and gradient operators as additional input from the user. Instead, only some element information is needed in the construction of the solver. The hybridization results in a H1-equivalent symmetric positive definite system, which is then rescaled and solved by AMG solvers designed for H1 problems. Weak and strong scaling of the method are examinedmore » through several numerical tests. Our numerical results show that the proposed solver provides a promising alternative to ADS, a state-of-the-art solver [12], for H(div) problems. In fact, it outperforms ADS for higher order elements.« less

Organ culture in 3-dimensional matrix: in vitro model for evaluating biological compliance of synthetic meshes for abdominal wall repair.

PubMed

Dasdia, T; Bazzaco, S; Bottero, L; Buffa, R; Ferrero, S; Campanelli, G; Dolfini, E

1998-01-01

A new in vitro method to evaluate the early critical interactions between synthetic prosthetic materials and growing tissues is reported. The correct spatial organization and proper cell to cell interaction required to mimic the in vivo environment was obtained in a 3-dimensional (3-D) embryo organ culture. The clot formed by plasma and chick-embryo extract provided a natural 3-D extracellular matrix that was able to support the growth and differentiation of intestinal tissue dissected from 12-day-old chick embryos. Different materials used for the repair of abdominal wall defects were taken as standards; all the prosthetic materials were devoid of any evident cytotoxic potential over a 10-day culture period, so they did not interfere with the organogenesis process. A polyglactin mesh (Vicryl) was fully incorporated into the growing tissue, but early signs of its degradation were detectable. The biologically inert materials polyethylene terephthalate (Mersilene) and polypropylene (Marlex, Prolene, and Herniamesh) retained their structural integrity when incubated with cultured tissue at 37 degrees C, and they did not hinder cellular proliferation or fibroblast migration. However, the outgrowth behavior was very different while the connective tissue invaded the interstices of the polyethylene terephthalate mesh; the explants and the migrating cells were repelled by hydrophobic polypropylene meshes. These findings are in agreement with other reported results in in vivo studies. Therefore, this method can be considered as reliable and predictable for the evaluation of biopolymers.

New approaches to virtual environment surgery

NASA Technical Reports Server (NTRS)

Ross, M. D.; Twombly, A.; Lee, A. W.; Cheng, R.; Senger, S.

1999-01-01

This research focused on two main problems: 1) low cost, high fidelity stereoscopic imaging of complex tissues and organs; and 2) virtual cutting of tissue. A further objective was to develop these images and virtual tissue cutting methods for use in a telemedicine project that would connect remote sites using the Next Generation Internet. For goal one we used a CT scan of a human heart, a desktop PC with an OpenGL graphics accelerator card, and LCD stereoscopic glasses. Use of multiresolution meshes ranging from approximately 1,000,000 to 20,000 polygons speeded interactive rendering rates enormously while retaining general topography of the dataset. For goal two, we used a CT scan of an infant skull with premature closure of the right coronal suture, a Silicon Graphics Onyx workstation, a Fakespace Immersive WorkBench and CrystalEyes LCD glasses. The high fidelity mesh of the skull was reduced from one million to 50,000 polygons. The cut path was automatically calculated as the shortest distance along the mesh between a small number of hand selected vertices. The region outlined by the cut path was then separated from the skull and translated/rotated to assume a new position. The results indicate that widespread high fidelity imaging in virtual environment is possible using ordinary PC capabilities if appropriate mesh reduction methods are employed. The software cutting tool is applicable to heart and other organs for surgery planning, for training surgeons in a virtual environment, and for telemedicine purposes.

Methods for prismatic/tetrahedral grid generation and adaptation

NASA Technical Reports Server (NTRS)

Kallinderis, Y.

1995-01-01

The present work involves generation of hybrid prismatic/tetrahedral grids for complex 3-D geometries including multi-body domains. The prisms cover the region close to each body's surface, while tetrahedra are created elsewhere. Two developments are presented for hybrid grid generation around complex 3-D geometries. The first is a new octree/advancing front type of method for generation of the tetrahedra of the hybrid mesh. The main feature of the present advancing front tetrahedra generator that is different from previous such methods is that it does not require the creation of a background mesh by the user for the determination of the grid-spacing and stretching parameters. These are determined via an automatically generated octree. The second development is a method for treating the narrow gaps in between different bodies in a multiply-connected domain. This method is applied to a two-element wing case. A High Speed Civil Transport (HSCT) type of aircraft geometry is considered. The generated hybrid grid required only 170 K tetrahedra instead of an estimated two million had a tetrahedral mesh been used in the prisms region as well. A solution adaptive scheme for viscous computations on hybrid grids is also presented. A hybrid grid adaptation scheme that employs both h-refinement and redistribution strategies is developed to provide optimum meshes for viscous flow computations. Grid refinement is a dual adaptation scheme that couples 3-D, isotropic division of tetrahedra and 2-D, directional division of prisms.

A note on powers in finite fields

NASA Astrophysics Data System (ADS)

Aabrandt, Andreas; Lundsgaard Hansen, Vagn

2016-08-01

The study of solutions to polynomial equations over finite fields has a long history in mathematics and is an interesting area of contemporary research. In recent years, the subject has found important applications in the modelling of problems from applied mathematical fields such as signal analysis, system theory, coding theory and cryptology. In this connection, it is of interest to know criteria for the existence of squares and other powers in arbitrary finite fields. Making good use of polynomial division in polynomial rings over finite fields, we have examined a classical criterion of Euler for squares in odd prime fields, giving it a formulation that is apt for generalization to arbitrary finite fields and powers. Our proof uses algebra rather than classical number theory, which makes it convenient when presenting basic methods of applied algebra in the classroom.

Calculation of three-dimensional (3-D) internal flow by means of the velocity-vorticity formulation on a staggered grid

NASA Technical Reports Server (NTRS)

Stremel, Paul M.

1995-01-01

A method has been developed to accurately compute the viscous flow in three-dimensional (3-D) enclosures. This method is the 3-D extension of a two-dimensional (2-D) method developed for the calculation of flow over airfoils. The 2-D method has been tested extensively and has been shown to accurately reproduce experimental results. As in the 2-D method, the 3-D method provides for the non-iterative solution of the incompressible Navier-Stokes equations by means of a fully coupled implicit technique. The solution is calculated on a body fitted computational mesh incorporating a staggered grid methodology. In the staggered grid method, the three components of vorticity are defined at the centers of the computational cell sides, while the velocity components are defined as normal vectors at the centers of the computational cell faces. The staggered grid orientation provides for the accurate definition of the vorticity components at the vorticity locations, the divergence of vorticity at the mesh cell nodes and the conservation of mass at the mesh cell centers. The solution is obtained by utilizing a fractional step solution technique in the three coordinate directions. The boundary conditions for the vorticity and velocity are calculated implicitly as part of the solution. The method provides for the non-iterative solution of the flow field and satisfies the conservation of mass and divergence of vorticity to machine zero at each time step. To test the method, the calculation of simple driven cavity flows have been computed. The driven cavity flow is defined as the flow in an enclosure driven by a moving upper plate at the top of the enclosure. To demonstrate the ability of the method to predict the flow in arbitrary cavities, results will he shown for both cubic and curved cavities.

Dirichlet boundary conditions for arbitrary-shaped boundaries in stellarator-like magnetic fields for the Flux-Coordinate Independent method

NASA Astrophysics Data System (ADS)

Hill, Peter; Shanahan, Brendan; Dudson, Ben

2017-04-01

We present a technique for handling Dirichlet boundary conditions with the Flux Coordinate Independent (FCI) parallel derivative operator with arbitrary-shaped material geometry in general 3D magnetic fields. The FCI method constructs a finite difference scheme for ∇∥ by following field lines between poloidal planes and interpolating within planes. Doing so removes the need for field-aligned coordinate systems that suffer from singularities in the metric tensor at null points in the magnetic field (or equivalently, when q → ∞). One cost of this method is that as the field lines are not on the mesh, they may leave the domain at any point between neighbouring planes, complicating the application of boundary conditions. The Leg Value Fill (LVF) boundary condition scheme presented here involves an extrapolation/interpolation of the boundary value onto the field line end point. The usual finite difference scheme can then be used unmodified. We implement the LVF scheme in BOUT++ and use the Method of Manufactured Solutions to verify the implementation in a rectangular domain, and show that it does not modify the error scaling of the finite difference scheme. The use of LVF for arbitrary wall geometry is outlined. We also demonstrate the feasibility of using the FCI approach in no n-axisymmetric configurations for a simple diffusion model in a "straight stellarator" magnetic field. A Gaussian blob diffuses along the field lines, tracing out flux surfaces. Dirichlet boundary conditions impose a last closed flux surface (LCFS) that confines the density. Including a poloidal limiter moves the LCFS to a smaller radius. The expected scaling of the numerical perpendicular diffusion, which is a consequence of the FCI method, in stellarator-like geometry is recovered. A novel technique for increasing the parallel resolution during post-processing, in order to reduce artefacts in visualisations, is described.

A Monte Carlo modeling on charging effect for structures with arbitrary geometries

NASA Astrophysics Data System (ADS)

Li, C.; Mao, S. F.; Zou, Y. B.; Li, Yong Gang; Zhang, P.; Li, H. M.; Ding, Z. J.

2018-04-01

Insulating materials usually suffer charging effects when irradiated by charged particles. In this paper, we present a Monte Carlo study on the charging effect caused by electron beam irradiation for sample structures with any complex geometry. When transporting in an insulating solid, electrons encounter elastic and inelastic scattering events; the Mott cross section and a Lorentz-type dielectric function are respectively employed to describe such scatterings. In addition, the band gap and the electron–long optical phonon interaction are taken into account. The electronic excitation in inelastic scattering causes generation of electron–hole pairs; these negative and positive charges establish an inner electric field, which in turn induces the drift of charges to be trapped by impurities, defects, vacancies etc in the solid, where the distributions of trapping sites are assumed to have uniform density. Under charging conditions, the inner electric field distorts electron trajectories, and the surface electric potential dynamically alters secondary electron emission. We present, in this work, an iterative modeling method for a self-consistent calculation of electric potential; the method has advantages in treating any structure with arbitrary complex geometry, in comparison with the image charge method—which is limited to a quite simple boundary geometry. Our modeling is based on: the combination of the finite triangle mesh method for an arbitrary geometry construction; a self-consistent method for the spatial potential calculation; and a full dynamic description for the motion of deposited charges. Example calculations have been done to simulate secondary electron yield of SiO2 for a semi-infinite solid, the charging for a heterostructure of SiO2 film grown on an Au substrate, and SEM imaging of a SiO2 line structure with rough surfaces and SiO2 nanoparticles with irregular shapes. The simulations have explored interesting interlaced charge layer distribution underneath the nanoparticle surface and the mechanism by which it is produced.

Implementation of a parallel unstructured Euler solver on the CM-5

NASA Technical Reports Server (NTRS)

Morano, Eric; Mavriplis, D. J.

1995-01-01

An efficient unstructured 3D Euler solver is parallelized on a Thinking Machine Corporation Connection Machine 5, distributed memory computer with vectoring capability. In this paper, the single instruction multiple data (SIMD) strategy is employed through the use of the CM Fortran language and the CMSSL scientific library. The performance of the CMSSL mesh partitioner is evaluated and the overall efficiency of the parallel flow solver is discussed.

High-Order Methods for Computational Physics

DTIC Science & Technology

1999-03-01

computation is running in 278 Ronald D. Henderson parallel. Instead we use the concept of a voxel database (VDB) of geometric positions in the mesh [85...processor 0 Fig. 4.19. Connectivity and communications axe established by building a voxel database (VDB) of positions. A VDB maps each position to a...studies such as the highly accurate stability computations considered help expand the database for this benchmark problem. The two-dimensional linear

A Sommerfeld toolbox for colored dark sectors

NASA Astrophysics Data System (ADS)

El Hedri, Sonia; Kaminska, Anna; de Vries, Maikel

2017-09-01

We present analytical formulas for the Sommerfeld corrections to the annihilation of massive colored particles into quarks and gluons through the strong interaction. These corrections are essential to accurately compute the dark matter relic density for coannihilation with colored partners. Our formulas allow us to compute the Sommerfeld effect, not only for the lowest term in the angular momentum expansion of the amplitude, but for all orders in the partial wave expansion. In particular, we carefully account for the effects of the spin of the annihilating particle on the symmetry of the two-particle wave function. This work focuses on strongly interacting particles of arbitrary spin in the triplet, sextet and octet color representations. For typical velocities during freeze-out, we find that including Sommerfeld corrections on the next-to-leading order partial wave leads to modifications of up to 10 to 20 percent on the total annihilation cross section. Complementary to QCD, we generalize our results to particles charged under an arbitrary unbroken SU( N) gauge group, as encountered in dark glueball models. In connection with this paper a Mathematica notebook is provided to compute the Sommerfeld corrections for colored particles up to arbitrary order in the angular momentum expansion.

Spatial scan statistics for detection of multiple clusters with arbitrary shapes.

PubMed

Lin, Pei-Sheng; Kung, Yi-Hung; Clayton, Murray

2016-12-01

In applying scan statistics for public health research, it would be valuable to develop a detection method for multiple clusters that accommodates spatial correlation and covariate effects in an integrated model. In this article, we connect the concepts of the likelihood ratio (LR) scan statistic and the quasi-likelihood (QL) scan statistic to provide a series of detection procedures sufficiently flexible to apply to clusters of arbitrary shape. First, we use an independent scan model for detection of clusters and then a variogram tool to examine the existence of spatial correlation and regional variation based on residuals of the independent scan model. When the estimate of regional variation is significantly different from zero, a mixed QL estimating equation is developed to estimate coefficients of geographic clusters and covariates. We use the Benjamini-Hochberg procedure (1995) to find a threshold for p-values to address the multiple testing problem. A quasi-deviance criterion is used to regroup the estimated clusters to find geographic clusters with arbitrary shapes. We conduct simulations to compare the performance of the proposed method with other scan statistics. For illustration, the method is applied to enterovirus data from Taiwan. © 2016, The International Biometric Society.

Key-Node-Separated Graph Clustering and Layouts for Human Relationship Graph Visualization.

PubMed

Itoh, Takayuki; Klein, Karsten

2015-01-01

Many graph-drawing methods apply node-clustering techniques based on the density of edges to find tightly connected subgraphs and then hierarchically visualize the clustered graphs. However, users may want to focus on important nodes and their connections to groups of other nodes for some applications. For this purpose, it is effective to separately visualize the key nodes detected based on adjacency and attributes of the nodes. This article presents a graph visualization technique for attribute-embedded graphs that applies a graph-clustering algorithm that accounts for the combination of connections and attributes. The graph clustering step divides the nodes according to the commonality of connected nodes and similarity of feature value vectors. It then calculates the distances between arbitrary pairs of clusters according to the number of connecting edges and the similarity of feature value vectors and finally places the clusters based on the distances. Consequently, the technique separates important nodes that have connections to multiple large clusters and improves the visibility of such nodes' connections. To test this technique, this article presents examples with human relationship graph datasets, including a coauthorship and Twitter communication network dataset.

Interacting epidemics on overlay networks

NASA Astrophysics Data System (ADS)

Funk, Sebastian; Jansen, Vincent A. A.

2010-03-01

The interaction between multiple pathogens spreading on networks connecting a given set of nodes presents an ongoing theoretical challenge. Here, we aim to understand such interactions by studying bond percolation of two different processes on overlay networks of arbitrary joint degree distribution. We find that an outbreak of a first pathogen providing immunity to another one spreading subsequently on a second network connecting the same set of nodes does so most effectively if the degrees on the two networks are positively correlated. In that case, the protection is stronger the more heterogeneous the degree distributions of the two networks are. If, on the other hand, the degrees are uncorrelated or negatively correlated, increasing heterogeneity reduces the potential of the first process to prevent the second one from reaching epidemic proportions. We generalize these results to cases where the edges of the two networks overlap to arbitrary amount, or where the immunity granted is only partial. If both processes grant immunity to each other, we find a wide range of possible situations of coexistence or mutual exclusion, depending on the joint degree distribution of the underlying networks and the amount of immunity granted mutually. These results generalize the concept of a coexistence threshold and illustrate the impact of large-scale network structure on the interaction between multiple spreading agents.

SU-E-I-87: Automated Liver Segmentation Method for CBCT Dataset by Combining Sparse Shape Composition and Probabilistic Atlas Construction

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li, Dengwang; Liu, Li; Chen, Jinhu

2014-06-01

Purpose: The aiming of this study was to extract liver structures for daily Cone beam CT (CBCT) images automatically. Methods: Datasets were collected from 50 intravenous contrast planning CT images, which were regarded as training dataset for probabilistic atlas and shape prior model construction. Firstly, probabilistic atlas and shape prior model based on sparse shape composition (SSC) were constructed by iterative deformable registration. Secondly, the artifacts and noise were removed from the daily CBCT image by an edge-preserving filtering using total variation with L1 norm (TV-L1). Furthermore, the initial liver region was obtained by registering the incoming CBCT image withmore » the atlas utilizing edge-preserving deformable registration with multi-scale strategy, and then the initial liver region was converted to surface meshing which was registered with the shape model where the major variation of specific patient was modeled by sparse vectors. At the last stage, the shape and intensity information were incorporated into joint probabilistic model, and finally the liver structure was extracted by maximum a posteriori segmentation.Regarding the construction process, firstly the manually segmented contours were converted into meshes, and then arbitrary patient data was chosen as reference image to register with the rest of training datasets by deformable registration algorithm for constructing probabilistic atlas and prior shape model. To improve the efficiency of proposed method, the initial probabilistic atlas was used as reference image to register with other patient data for iterative construction for removing bias caused by arbitrary selection. Results: The experiment validated the accuracy of the segmentation results quantitatively by comparing with the manually ones. The volumetric overlap percentage between the automatically generated liver contours and the ground truth were on an average 88%–95% for CBCT images. Conclusion: The experiment demonstrated that liver structures of CBCT with artifacts can be extracted accurately for following adaptive radiation therapy. This work is supported by National Natural Science Foundation of China (No. 61201441), Research Fund for Excellent Young and Middle-aged Scientists of Shandong Province (No. BS2012DX038), Project of Shandong Province Higher Educational Science and Technology Program (No. J12LN23), Jinan youth science and technology star (No.20120109)« less

The Data Transfer Kit: A geometric rendezvous-based tool for multiphysics data transfer

DOE Office of Scientific and Technical Information (OSTI.GOV)

Slattery, S. R.; Wilson, P. P. H.; Pawlowski, R. P.

2013-07-01

The Data Transfer Kit (DTK) is a software library designed to provide parallel data transfer services for arbitrary physics components based on the concept of geometric rendezvous. The rendezvous algorithm provides a means to geometrically correlate two geometric domains that may be arbitrarily decomposed in a parallel simulation. By repartitioning both domains such that they have the same geometric domain on each parallel process, efficient and load balanced search operations and data transfer can be performed at a desirable algorithmic time complexity with low communication overhead relative to other types of mapping algorithms. With the increased development efforts in multiphysicsmore » simulation and other multiple mesh and geometry problems, generating parallel topology maps for transferring fields and other data between geometric domains is a common operation. The algorithms used to generate parallel topology maps based on the concept of geometric rendezvous as implemented in DTK are described with an example using a conjugate heat transfer calculation and thermal coupling with a neutronics code. In addition, we provide the results of initial scaling studies performed on the Jaguar Cray XK6 system at Oak Ridge National Laboratory for a worse-case-scenario problem in terms of algorithmic complexity that shows good scaling on 0(1 x 104) cores for topology map generation and excellent scaling on 0(1 x 105) cores for the data transfer operation with meshes of O(1 x 109) elements. (authors)« less

A general higher-order remap algorithm for ALE calculations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chiravalle, Vincent P

2011-01-05

A numerical technique for solving the equations of fluid dynamics with arbitrary mesh motion is presented. The three phases of the Arbitrary Lagrangian Eulerian (ALE) methodology are outlined: the Lagrangian phase, grid relaxation phase and remap phase. The Lagrangian phase follows a well known approach from the HEMP code; in addition the strain rate andflow divergence are calculated in a consistent manner according to Margolin. A donor cell method from the SALE code forms the basis of the remap step, but unlike SALE a higher order correction based on monotone gradients is also added to the remap. Four test problemsmore » were explored to evaluate the fidelity of these numerical techniques, as implemented in a simple test code, written in the C programming language, called Cercion. Novel cell-centered data structures are used in Cercion to reduce the complexity of the programming and maximize the efficiency of memory usage. The locations of the shock and contact discontinuity in the Riemann shock tube problem are well captured. Cercion demonstrates a high degree of symmetry when calculating the Sedov blast wave solution, with a peak density at the shock front that is similar to the value determined by the RAGE code. For a flyer plate test problem both Cercion and FLAG give virtually the same velocity temporal profile at the target-vacuum interface. When calculating a cylindrical implosion of a steel shell, Cercion and FLAG agree well and the Cercion results are insensitive to the use of ALE.« less

Graph Representations of Flow and Transport in Fracture Networks using Machine Learning

NASA Astrophysics Data System (ADS)

Srinivasan, G.; Viswanathan, H. S.; Karra, S.; O'Malley, D.; Godinez, H. C.; Hagberg, A.; Osthus, D.; Mohd-Yusof, J.

2017-12-01

Flow and transport of fluids through fractured systems is governed by the properties and interactions at the micro-scale. Retaining information about the micro-structure such as fracture length, orientation, aperture and connectivity in mesh-based computational models results in solving for millions to billions of degrees of freedom and quickly renders the problem computationally intractable. Our approach depicts fracture networks graphically, by mapping fractures to nodes and intersections to edges, thereby greatly reducing computational burden. Additionally, we use machine learning techniques to build simulators on the graph representation, trained on data from the mesh-based high fidelity simulations to speed up computation by orders of magnitude. We demonstrate our methodology on ensembles of discrete fracture networks, dividing up the data into training and validation sets. Our machine learned graph-based solvers result in over 3 orders of magnitude speedup without any significant sacrifice in accuracy.

Space-time interface-tracking with topology change (ST-TC)

NASA Astrophysics Data System (ADS)

Takizawa, Kenji; Tezduyar, Tayfun E.; Buscher, Austin; Asada, Shohei

2014-10-01

To address the computational challenges associated with contact between moving interfaces, such as those in cardiovascular fluid-structure interaction (FSI), parachute FSI, and flapping-wing aerodynamics, we introduce a space-time (ST) interface-tracking method that can deal with topology change (TC). In cardiovascular FSI, our primary target is heart valves. The method is a new version of the deforming-spatial-domain/stabilized space-time (DSD/SST) method, and we call it ST-TC. It includes a master-slave system that maintains the connectivity of the "parent" mesh when there is contact between the moving interfaces. It is an efficient, practical alternative to using unstructured ST meshes, but without giving up on the accurate representation of the interface or consistent representation of the interface motion. We explain the method with conceptual examples and present 2D test computations with models representative of the classes of problems we are targeting.

Overview of the Helios Version 2.0 Computational Platform for Rotorcraft Simulations

NASA Technical Reports Server (NTRS)

Sankaran, Venkateswaran; Wissink, Andrew; Datta, Anubhav; Sitaraman, Jayanarayanan; Jayaraman, Buvna; Potsdam, Mark; Katz, Aaron; Kamkar, Sean; Roget, Beatrice; Mavriplis, Dimitri;

A Numerical Scheme for the Solution of the Space Charge Problem on a Multiply Connected Region

NASA Astrophysics Data System (ADS)

Budd, C. J.; Wheeler, A. A.

1991-11-01

In this paper we extend the work of Budd and Wheeler ( Proc. R. Soc. London A, 417, 389, 1988) , who described a new numerical scheme for the solution of the space charge equation on a simple connected domain, to multiply connected regions. The space charge equation, ▿ · ( Δ overlineϕ ▽ overlineϕ) = 0 , is a third-order nonlinear partial differential equation for the electric potential overlineϕ which models the electric field in the vicinity of a coronating conductor. Budd and Wheeler described a new way of analysing this equation by constructing an orthogonal coordinate system ( overlineϕ, overlineψ) and recasting the equation in terms of x, y, and ▽ overlineϕ as functions of ( overlineϕ, overlineψ). This transformation is singular on multiply connected regions and in this paper we show how this may be overcome to provide an efficient numerical scheme for the solution of the space charge equation. This scheme also provides a new method for the solution of Laplaces equation and the calculation of orthogonal meshes on multiply connected regions.

Three-Dimensional Shallow Water Adaptive Hydraulics (ADH-SW3) Validation: Galveston Bay Hydrodynamics and Salinity Transport

DTIC Science & Technology

2015-04-01

model mesh with elements (vertical co-ordinate in meters). ....................... 5 Figure 3. Ocean tidal boundary (Hour 0 = 1 Jan 1990, 12:00 a.m...7 Figure 4. Ocean salt boundary (Hour 0 = 1 Jan 1990, 12:00 a.m...channel and the connections of Galveston Bay to the open ocean . Figures 1 and 2 illustrate the distribution of vertical layers and resolution in the

Configuration and Calibration of High Temperature Furnaces for Testing Ceramic Matrix Composites

DTIC Science & Technology

2014-10-01

Actual Furnace Cavity Stainless Steel Mesh Cage For Electrical Connections (both sides) High Temperature Power Lead Clamp Furnace Control TC’s Power... tests generate the basic properties such as modulus (E), ultimate tensile strength (UTS), proportional limit (PL), strain at failure (f), as well as...stress- strain behavior. Each material was tested at room temperature, at the maximum use temperature for the CMC system (as determined by the CMC

Output synchronization of discrete-time dynamical networks based on geometrically incremental dissipativity.

PubMed

Li, Chensong; Zhao, Jun

2017-01-01

In this work, we investigate the output synchronization problem for discrete-time dynamical networks with identical nodes. Firstly, if each node of a network is geometrically incrementally dissipative, the entire network can be viewed as a geometrically dissipative nonlinear system by choosing a particular input-output pair. Then, based on the geometrical dissipativity property, we consider two cases: output synchronization under arbitrary topology and switching topology, respectively. For the first case, we establish several criteria of output synchronization under arbitrary switching between a set of connection topologies by employing a common Lyapunov function. For the other case, we give the design method of a switching signal to achieve output synchronization even if all subnetworks are not synchronous. Finally, an example is provided to illustrate the effectiveness of the main results. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Universal Stabilization of a Parametrically Coupled Qubit

NASA Astrophysics Data System (ADS)

Lu, Yao; Chakram, S.; Leung, N.; Earnest, N.; Naik, R. K.; Huang, Ziwen; Groszkowski, Peter; Kapit, Eliot; Koch, Jens; Schuster, David I.

2017-10-01

We autonomously stabilize arbitrary states of a qubit through parametric modulation of the coupling between a fixed frequency qubit and resonator. The coupling modulation is achieved with a tunable coupling design, in which the qubit and the resonator are connected in parallel to a superconducting quantum interference device. This allows for quasistatic tuning of the qubit-cavity coupling strength from 12 MHz to more than 300 MHz. Additionally, the coupling can be dynamically modulated, allowing for single-photon exchange in 6 ns. Qubit coherence times exceeding 20 μ s are maintained over the majority of the range of tuning, limited primarily by the Purcell effect. The parametric stabilization technique realized using the tunable coupler involves engineering the qubit bath through a combination of photon nonconserving sideband interactions realized by flux modulation, and direct qubit Rabi driving. We demonstrate that the qubit can be stabilized to arbitrary states on the Bloch sphere with a worst-case fidelity exceeding 80%.

Arbitrary spin-to-orbital angular momentum conversion of light.

PubMed

Devlin, Robert C; Ambrosio, Antonio; Rubin, Noah A; Mueller, J P Balthasar; Capasso, Federico

2017-11-17

Optical elements that convert the spin angular momentum (SAM) of light into vortex beams have found applications in classical and quantum optics. These elements-SAM-to-orbital angular momentum (OAM) converters-are based on the geometric phase and only permit the conversion of left- and right-circular polarizations (spin states) into states with opposite OAM. We present a method for converting arbitrary SAM states into total angular momentum states characterized by a superposition of independent OAM. We designed a metasurface that converts left- and right-circular polarizations into states with independent values of OAM and designed another device that performs this operation for elliptically polarized states. These results illustrate a general material-mediated connection between SAM and OAM of light and may find applications in producing complex structured light and in optical communication. Copyright © 2017, American Association for the Advancement of Science.

Groupwise connectivity-based parcellation of the whole human cortical surface using watershed-driven dimension reduction.

PubMed

Lefranc, Sandrine; Roca, Pauline; Perrot, Matthieu; Poupon, Cyril; Le Bihan, Denis; Mangin, Jean-François; Rivière, Denis

2016-05-01

Segregating the human cortex into distinct areas based on structural connectivity criteria is of widespread interest in neuroscience. This paper presents a groupwise connectivity-based parcellation framework for the whole cortical surface using a new high quality diffusion dataset of 79 healthy subjects. Our approach performs gyrus by gyrus to parcellate the whole human cortex. The main originality of the method is to compress for each gyrus the connectivity profiles used for the clustering without any anatomical prior information. This step takes into account the interindividual cortical and connectivity variability. To this end, we consider intersubject high density connectivity areas extracted using a surface-based watershed algorithm. A wide validation study has led to a fully automatic pipeline which is robust to variations in data preprocessing (tracking type, cortical mesh characteristics and boundaries of initial gyri), data characteristics (including number of subjects), and the main algorithmic parameters. A remarkable reproducibility is achieved in parcellation results for the whole cortex, leading to clear and stable cortical patterns. This reproducibility has been tested across non-overlapping subgroups and the validation is presented mainly on the pre- and postcentral gyri. Copyright © 2016 The Authors. Published by Elsevier B.V. All rights reserved.

Balancing Contention and Synchronization on the Intel Paragon

NASA Technical Reports Server (NTRS)

Bokhari, Shahid H.; Nicol, David M.

1996-01-01

The Intel Paragon is a mesh-connected distributed memory parallel computer. It uses an oblivious and deterministic message routing algorithm: this permits us to develop highly optimized schedules for frequently needed communication patterns. The complete exchange is one such pattern. Several approaches are available for carrying it out on the mesh. We study an algorithm developed by Scott. This algorithm assumes that a communication link can carry one message at a time and that a node can only transmit one message at a time. It requires global synchronization to enforce a schedule of transmissions. Unfortunately global synchronization has substantial overhead on the Paragon. At the same time the powerful interconnection mechanism of this machine permits 2 or 3 messages to share a communication link with minor overhead. It can also overlap multiple message transmission from the same node to some extent. We develop a generalization of Scott's algorithm that executes complete exchange with a prescribed contention. Schedules that incur greater contention require fewer synchronization steps. This permits us to tradeoff contention against synchronization overhead. We describe the performance of this algorithm and compare it with Scott's original algorithm as well as with a naive algorithm that does not take interconnection structure into account. The Bounded contention algorithm is always better than Scott's algorithm and outperforms the naive algorithm for all but the smallest message sizes. The naive algorithm fails to work on meshes larger than 12 x 12. These results show that due consideration of processor interconnect and machine performance parameters is necessary to obtain peak performance from the Paragon and its successor mesh machines.

A wave superposition method formulated in digital acoustic space

NASA Astrophysics Data System (ADS)

Hwang, Yong-Sin

In this thesis, a new formulation of the Wave Superposition method is proposed wherein the conventional mesh approach is replaced by a simple 3-D digital work space that easily accommodates shape optimization for minimizing or maximizing radiation efficiency. As sound quality is in demand in almost all product designs and also because of fierce competition between product manufacturers, faster and accurate computational method for shape optimization is always desired. Because the conventional Wave Superposition method relies solely on mesh geometry, it cannot accommodate fast shape changes in the design stage of a consumer product or machinery, where many iterations of shape changes are required. Since the use of a mesh hinders easy shape changes, a new approach for representing geometry is introduced by constructing a uniform lattice in a 3-D digital work space. A voxel (a portmanteau, a new word made from combining the sound and meaning, of the words, volumetric and pixel) is essentially a volume element defined by the uniform lattice, and does not require separate connectivity information as a mesh element does. In the presented method, geometry is represented with voxels that can easily adapt to shape changes, therefore it is more suitable for shape optimization. The new method was validated by computing radiated sound power of structures of simple and complex geometries and complex mode shapes. It was shown that matching volume velocity is a key component to an accurate analysis. A sensitivity study showed that it required at least 6 elements per acoustic wavelength, and a complexity study showed a minimal reduction in computational time.

Image Segmentation, Registration, Compression, and Matching

NASA Technical Reports Server (NTRS)

Yadegar, Jacob; Wei, Hai; Yadegar, Joseph; Ray, Nilanjan; Zabuawala, Sakina

2011-01-01

A novel computational framework was developed of a 2D affine invariant matching exploiting a parameter space. Named as affine invariant parameter space (AIPS), the technique can be applied to many image-processing and computer-vision problems, including image registration, template matching, and object tracking from image sequence. The AIPS is formed by the parameters in an affine combination of a set of feature points in the image plane. In cases where the entire image can be assumed to have undergone a single affine transformation, the new AIPS match metric and matching framework becomes very effective (compared with the state-of-the-art methods at the time of this reporting). No knowledge about scaling or any other transformation parameters need to be known a priori to apply the AIPS framework. An automated suite of software tools has been created to provide accurate image segmentation (for data cleaning) and high-quality 2D image and 3D surface registration (for fusing multi-resolution terrain, image, and map data). These tools are capable of supporting existing GIS toolkits already in the marketplace, and will also be usable in a stand-alone fashion. The toolkit applies novel algorithmic approaches for image segmentation, feature extraction, and registration of 2D imagery and 3D surface data, which supports first-pass, batched, fully automatic feature extraction (for segmentation), and registration. A hierarchical and adaptive approach is taken for achieving automatic feature extraction, segmentation, and registration. Surface registration is the process of aligning two (or more) data sets to a common coordinate system, during which the transformation between their different coordinate systems is determined. Also developed here are a novel, volumetric surface modeling and compression technique that provide both quality-guaranteed mesh surface approximations and compaction of the model sizes by efficiently coding the geometry and connectivity/topology components of the generated models. The highly efficient triangular mesh compression compacts the connectivity information at the rate of 1.5-4 bits per vertex (on average for triangle meshes), while reducing the 3D geometry by 40-50 percent. Finally, taking into consideration the characteristics of 3D terrain data, and using the innovative, regularized binary decomposition mesh modeling, a multistage, pattern-drive modeling, and compression technique has been developed to provide an effective framework for compressing digital elevation model (DEM) surfaces, high-resolution aerial imagery, and other types of NASA data.

Numerical Simulations of Spacecraft Charging: Selected Applications

NASA Astrophysics Data System (ADS)

Moulton, J. D.; Delzanno, G. L.; Meierbachtol, C.; Svyatskiy, D.; Vernon, L.; Borovsky, J.; Thomsen, M. F.

2016-12-01

The electrical charging of spacecraft due to bombarding charged particles affects their performance and operation. We study this charging using CPIC, a particle-in-cell code specifically designed for studying plasma-material interactions. CPIC is based on multi-block curvilinear meshes, resulting in near-optimal computational performance while maintaining geometric accuracy. It is interfaced to a mesh generator that creates a computational mesh conforming to complex objects like a spacecraft. Relevant plasma parameters can be imported from the SHIELDS framework (currently under development at LANL), which simulates geomagnetic storms and substorms in the Earth's magnetosphere. Selected physics results will be presented, together with an overview of the code. The physics results include spacecraft-charging simulations with geometry representative of the Van Allen Probes spacecraft, focusing on the conditions that can lead to significant spacecraft charging events. Second, results from a recent study that investigates the conditions for which a high-power (>keV) electron beam could be emitted from a magnetospheric spacecraft will be presented. The latter study proposes a spacecraft-charging mitigation strategy based on the plasma contactor technology that might allow beam experiments to operate in the low-density magnetosphere. High-power electron beams could be used for instance to establish magnetic-field-line connectivity between ionosphere and magnetosphere and help solving long-standing questions in ionospheric/magnetospheric physics.

Irregular-regular mode oscillations inside plasma bubble and its fractal analysis in glow discharge magnetized plasma

NASA Astrophysics Data System (ADS)

Megalingam, Mariammal; Hari Prakash, N.; Solomon, Infant; Sarma, Arun; Sarma, Bornali

2017-04-01

Experimental evidence of different kinds of oscillations in floating potential fluctuations of glow discharge magnetized plasma is being reported. A spherical gridded cage is inserted into the ambient plasma volume for creating plasma bubbles. Plasma is produced between a spherical mesh grid and chamber. The spherical mesh grid of 80% optical transparency is connected to the positive terminal of power supply and considered as anode. Two Langmuir probes are kept in the ambient plasma to measure the floating potential fluctuations in different positions within the system, viz., inside and outside the spherical mesh grid. At certain conditions of discharge voltage (Vd) and magnetic field, irregular to regular mode appears, and it shows chronological changes with respect to magnetic field. Further various nonlinear analyses such as Recurrence Plot, Hurst exponent, and Lyapunov exponent have been carried out to investigate the dynamics of oscillation at a range of discharge voltages and external magnetic fields. Determinism, entropy, and Lmax are important measures of Recurrence Quantification Analysis which indicate an irregular to regular transition in the dynamics of the fluctuations. Furthermore, behavior of the plasma oscillation is characterized by the technique called multifractal detrended fluctuation analysis to explore the nature of the fluctuations. It reveals that it has a multifractal nature and behaves as a long range correlated process.

Automatic two- and three-dimensional mesh generation based on fuzzy knowledge processing

NASA Astrophysics Data System (ADS)

Yagawa, G.; Yoshimura, S.; Soneda, N.; Nakao, K.

1992-09-01

This paper describes the development of a novel automatic FEM mesh generation algorithm based on the fuzzy knowledge processing technique. A number of local nodal patterns are stored in a nodal pattern database of the mesh generation system. These nodal patterns are determined a priori based on certain theories or past experience of experts of FEM analyses. For example, such human experts can determine certain nodal patterns suitable for stress concentration analyses of cracks, corners, holes and so on. Each nodal pattern possesses a membership function and a procedure of node placement according to this function. In the cases of the nodal patterns for stress concentration regions, the membership function which is utilized in the fuzzy knowledge processing has two meanings, i.e. the “closeness” of nodal location to each stress concentration field as well as “nodal density”. This is attributed to the fact that a denser nodal pattern is required near a stress concentration field. What a user has to do in a practical mesh generation process are to choose several local nodal patterns properly and to designate the maximum nodal density of each pattern. After those simple operations by the user, the system places the chosen nodal patterns automatically in an analysis domain and on its boundary, and connects them smoothly by the fuzzy knowledge processing technique. Then triangular or tetrahedral elements are generated by means of the advancing front method. The key issue of the present algorithm is an easy control of complex two- or three-dimensional nodal density distribution by means of the fuzzy knowledge processing technique. To demonstrate fundamental performances of the present algorithm, a prototype system was constructed with one of object-oriented languages, Smalltalk-80 on a 32-bit microcomputer, Macintosh II. The mesh generation of several two- and three-dimensional domains with cracks, holes and junctions was presented as examples.

Investigation of Dynamic Force/Vibration Transmission Characteristics of Four-Square Type Gear Durability Test Machines

NASA Technical Reports Server (NTRS)

Kahraman, Ahmet

2002-01-01

In this study, design requirements for a dynamically viable, four-square type gear test machine are investigated. Variations of four-square type gear test machines have been in use for durability and dynamics testing of both parallel- and cross-axis gear set. The basic layout of these machines is illustrated. The test rig is formed by two gear pairs, of the same reduction ratio, a test gear pair and a reaction gear pair, connected to each other through shafts of certain torsional flexibility to form an efficient, closed-loop system. A desired level of constant torque is input to the circuit through mechanical (a split coupling with a torque arm) or hydraulic (a hydraulic actuator) means. The system is then driven at any desired speed by a small DC motor. The main task in hand is the isolation of the test gear pair from the reaction gear pair under dynamic conditions. Any disturbances originated at the reaction gear mesh might potentially travel to the test gearbox, altering the dynamic loading conditions of the test gear mesh, and hence, influencing the outcome of the durability or dynamics test. Therefore, a proper design of connecting structures becomes a major priority. Also, equally important is the issue of how close the operating speed of the machine is to the resonant frequencies of the gear meshes. This study focuses on a detailed analysis of the current NASA Glenn Research Center gear pitting test machine for evaluation of its resonance and vibration isolation characteristics. A number of these machines as the one illustrated has been used over last 30 years to establish an extensive database regarding the influence of the gear materials, processes surface treatments and lubricants on gear durability. This study is intended to guide an optimum design of next generation test machines for the most desirable dynamic characteristics.

Network Analysis in Disorders of Consciousness: Four Problems and One Proposed Solution (Exponential Random Graph Models)

PubMed Central

Dell'Italia, John; Johnson, Micah A.; Vespa, Paul M.; Monti, Martin M.

2018-01-01

In recent years, the study of the neural basis of consciousness, particularly in the context of patients recovering from severe brain injury, has greatly benefited from the application of sophisticated network analysis techniques to functional brain data. Yet, current graph theoretic approaches, as employed in the neuroimaging literature, suffer from four important shortcomings. First, they require arbitrary fixing of the number of connections (i.e., density) across networks which are likely to have different “natural” (i.e., stable) density (e.g., patients vs. controls, vegetative state vs. minimally conscious state patients). Second, when describing networks, they do not control for the fact that many characteristics are interrelated, particularly some of the most popular metrics employed (e.g., nodal degree, clustering coefficient)—which can lead to spurious results. Third, in the clinical domain of disorders of consciousness, there currently are no methods for incorporating structural connectivity in the characterization of functional networks which clouds the interpretation of functional differences across groups with different underlying pathology as well as in longitudinal approaches where structural reorganization processes might be operating. Finally, current methods do not allow assessing the dynamics of network change over time. We present a different framework for network analysis, based on Exponential Random Graph Models, which overcomes the above limitations and is thus particularly well suited for clinical populations with disorders of consciousness. We demonstrate this approach in the context of the longitudinal study of recovery from coma. First, our data show that throughout recovery from coma, brain graphs vary in their natural level of connectivity (from 10.4 to 14.5%), which conflicts with the standard approach of imposing arbitrary and equal density thresholds across networks (e.g., time-points, subjects, groups). Second, we show that failure to consider the interrelation between network measures does lead to spurious characterization of both inter- and intra-regional brain connectivity. Finally, we show that Separable Temporal ERGM can be employed to describe network dynamics over time revealing the specific pattern of formation and dissolution of connectivity that accompany recovery from coma. PMID:29946293

A Self-Stabilizing Hybrid-Fault Tolerant Synchronization Protocol

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R.

2014-01-01

In this report we present a strategy for solving the Byzantine general problem for self-stabilizing a fully connected network from an arbitrary state and in the presence of any number of faults with various severities including any number of arbitrary (Byzantine) faulty nodes. Our solution applies to realizable systems, while allowing for differences in the network elements, provided that the number of arbitrary faults is not more than a third of the network size. The only constraint on the behavior of a node is that the interactions with other nodes are restricted to defined links and interfaces. Our solution does not rely on assumptions about the initial state of the system and no central clock nor centrally generated signal, pulse, or message is used. Nodes are anonymous, i.e., they do not have unique identities. We also present a mechanical verification of a proposed protocol. A bounded model of the protocol is verified using the Symbolic Model Verifier (SMV). The model checking effort is focused on verifying correctness of the bounded model of the protocol as well as confirming claims of determinism and linear convergence with respect to the self-stabilization period. We believe that our proposed solution solves the general case of the clock synchronization problem.

EXHIBIT - SPACESUITS

NASA Image and Video Library

1982-02-08

S82-26645 (March 1982) --- Spacesuit inner gloves consist of pressure bladders covered by Beta Cloth. EVA outer gloves are made of Beta Cloth, Mylar and a metallic mesh hand area. The thumb and fingertips of the glove are molded of silicone rubber to permit a degree of sensitivity. The inner gloves attach to the suit by pressure sealing rings, similar to these used in helmet-to-suit connections. The outer gloves served as a cover to protect from micrometeorites, abrasions and heat.

Microgravity, Mesh-Crawling Legged Robots

NASA Technical Reports Server (NTRS)

Behar, Alberto; Marzwell, Neville; Matthews, Jaret; Richardson, Krandalyn; Wall, Jonathan; Poole, Michael; Foor, David; Rodgers, Damian

2008-01-01

The design, fabrication, and microgravity flight-testing are part of a continuing development of palm-sized mobile robots that resemble spiders (except that they have six legs apiece, whereas a spider has eight legs). Denoted SpiderBots (see figure), they are prototypes of proposed product line of relatively inexpensive walking robots that could be deployed in large numbers to function cooperatively in construction, repair, exploration, search, and rescue activities in connection with exploration of outer space and remote planets.

SutraGUI, a graphical-user interface for SUTRA, a model for ground-water flow with solute or energy transport

USGS Publications Warehouse

Winston, Richard B.; Voss, Clifford I.

2004-01-01

This report describes SutraGUI, a flexible graphical user-interface (GUI) that supports two-dimensional (2D) and three-dimensional (3D) simulation with the U.S. Geological Survey (USGS) SUTRA ground-water-flow and transport model (Voss and Provost, 2002). SutraGUI allows the user to create SUTRA ground-water models graphically. SutraGUI provides all of the graphical functionality required for setting up and running SUTRA simulations that range from basic to sophisticated, but it is also possible for advanced users to apply programmable features within Argus ONE to meet the unique demands of particular ground-water modeling projects. SutraGUI is a public-domain computer program designed to run with the proprietary Argus ONE? package, which provides 2D Geographic Information System (GIS) and meshing support. For 3D simulation, GIS and meshing support is provided by programming contained within SutraGUI. When preparing a 3D SUTRA model, the model and all of its features are viewed within Argus 1 in 2D projection. For 2D models, SutraGUI is only slightly changed in functionality from the previous 2D-only version (Voss and others, 1997) and it provides visualization of simulation results. In 3D, only model preparation is supported by SutraGUI, and 3D simulation results may be viewed in SutraPlot (Souza, 1999) or Model Viewer (Hsieh and Winston, 2002). A comprehensive online Help system is included in SutraGUI. For 3D SUTRA models, the 3D model domain is conceptualized as bounded on the top and bottom by 2D surfaces. The 3D domain may also contain internal surfaces extending across the model that divide the domain into tabular units, which can represent hydrogeologic strata or other features intended by the user. These surfaces can be non-planar and non-horizontal. The 3D mesh is defined by one or more 2D meshes at different elevations that coincide with these surfaces. If the nodes in the 3D mesh are vertically aligned, only a single 2D mesh is needed. For nonaligned meshes, two or more 2D meshes of similar connectivity are used. Between each set of 2D meshes (and model surfaces), the vertical space in the 3D mesh is evenly divided into a user-specified number of layers of finite elements. Boundary conditions may be specified for 3D models in SutraGUI using a variety of geometric shapes that may be located freely within the 3D model domain. These shapes include points, lines, sheets, and solids. These are represented by 2D contours (within the vertically-projected Argus ONE view) with user-defined elevations. In addition, boundary conditions may be specified for 3D models as points, lines, and areas that are located exactly within the surfaces that define the model top and the bottoms of the tabular units. Aquifer properties may be specified separately for each tabular unit. If the aquifer properties vary vertically within a unit, SutraGUI provides the Sutra_Z function that can be used to specify such variation.

A Comparison of a Relational and Nested-Relational IDEF0 Data Model

DTIC Science & Technology

1990-03-01

develop, some of the problems inherent iu the hierarchical 5 model were circumvented by the more sophisticated network model. Like the hierarchical model...uetwork database consists of a collection of records connected via links. Unlike the hierarchical model, the network model allows arbitrary graphs as...opposed to trees. Thus, each node may have everal owners and may, in turn, own any number of other records. The network model provides a lchanism by

Decentralized state estimation for a large-scale spatially interconnected system.

PubMed

Liu, Huabo; Yu, Haisheng

2018-03-01

A decentralized state estimator is derived for the spatially interconnected systems composed of many subsystems with arbitrary connection relations. An optimization problem on the basis of linear matrix inequality (LMI) is constructed for the computations of improved subsystem parameter matrices. Several computationally effective approaches are derived which efficiently utilize the block-diagonal characteristic of system parameter matrices and the sparseness of subsystem connection matrix. Moreover, this decentralized state estimator is proved to converge to a stable system and obtain a bounded covariance matrix of estimation errors under certain conditions. Numerical simulations show that the obtained decentralized state estimator is attractive in the synthesis of a large-scale networked system. Copyright © 2018 ISA. Published by Elsevier Ltd. All rights reserved.

Numerical approach of the quantum circuit theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Silva, J.J.B., E-mail: jaedsonfisica@hotmail.com; Duarte-Filho, G.C.; Almeida, F.A.G.

2017-03-15

In this paper we develop a numerical method based on the quantum circuit theory to approach the coherent electronic transport in a network of quantum dots connected with arbitrary topology. The algorithm was employed in a circuit formed by quantum dots connected each other in a shape of a linear chain (associations in series), and of a ring (associations in series, and in parallel). For both systems we compute two current observables: conductance and shot noise power. We find an excellent agreement between our numerical results and the ones found in the literature. Moreover, we analyze the algorithm efficiency formore » a chain of quantum dots, where the mean processing time exhibits a linear dependence with the number of quantum dots in the array.« less

Complete affine connection in the causal boundary: static, spherically symmetric spacetimes

NASA Astrophysics Data System (ADS)

Harris, Steven (Stacey) G.

2017-02-01

The boundary at I^+, future null infinity, for a standard static, spherically symmetric spactime is examined for possible linear connections. Two independent methods are employed, one for treating I^+ as the future causal boundary, and one for treating it as a conformal boundary (the latter is subsumed in the former, which is of greater generality). Both methods provide the same result: a constellation of various possible connections, depending on an arbitrary choice of a certain function, a sort of gauge freedom in obtaining a natural connection on I^+; choosing that function to be constant (for instance) results in a complete connection. Treating I^+ as part of the future causal boundary, the method is to impute affine connections on null hypersurfaces going out to I^+, in terms of a transverse vector field on each null hypersurface (there is much gauge freedom on choice of the transverse vector fields). Treating I^+ as part of a conformal boundary, the method is to make a choice of conformal factor that makes the boundary totally geodesic in the enveloping manifold (there is much gauge freedom in choice of that conformal factor). Similar examination is made of other boundaries, such as timelike infinity and timelike and spacelike singularities. These are much simpler, as they admit a unique connection from a similar limiting process (i.e., no gauge freedom); and that connection is complete.

High-order polygonal discontinuous Petrov-Galerkin (PolyDPG) methods using ultraweak formulations

NASA Astrophysics Data System (ADS)

Vaziri Astaneh, Ali; Fuentes, Federico; Mora, Jaime; Demkowicz, Leszek

2018-04-01

This work represents the first endeavor in using ultraweak formulations to implement high-order polygonal finite element methods via the discontinuous Petrov-Galerkin (DPG) methodology. Ultraweak variational formulations are nonstandard in that all the weight of the derivatives lies in the test space, while most of the trial space can be chosen as copies of $L^2$-discretizations that have no need to be continuous across adjacent elements. Additionally, the test spaces are broken along the mesh interfaces. This allows one to construct conforming polygonal finite element methods, termed here as PolyDPG methods, by defining most spaces by restriction of a bounding triangle or box to the polygonal element. The only variables that require nontrivial compatibility across elements are the so-called interface or skeleton variables, which can be defined directly on the element boundaries. Unlike other high-order polygonal methods, PolyDPG methods do not require ad hoc stabilization terms thanks to the crafted stability of the DPG methodology. A proof of convergence of the form $h^p$ is provided and corroborated through several illustrative numerical examples. These include polygonal meshes with $n$-sided convex elements and with highly distorted concave elements, as well as the modeling of discontinuous material properties along an arbitrary interface that cuts a uniform grid. Since PolyDPG methods have a natural a posteriori error estimator a polygonal adaptive strategy is developed and compared to standard adaptivity schemes based on constrained hanging nodes. This work is also accompanied by an open-source $\\texttt{PolyDPG}$ software supporting polygonal and conventional elements.

The isolation of spatial patterning modes in a mathematical model of juxtacrine cell signalling.

PubMed

O'Dea, R D; King, J R

2013-06-01

Juxtacrine signalling mechanisms are known to be crucial in tissue and organ development, leading to spatial patterns in gene expression. We investigate the patterning behaviour of a discrete model of juxtacrine cell signalling due to Owen & Sherratt (1998, Mathematical modelling of juxtacrine cell signalling. Math. Biosci., 153, 125-150) in which ligand molecules, unoccupied receptors and bound ligand-receptor complexes are modelled. Feedback between the ligand and receptor production and the level of bound receptors is incorporated. By isolating two parameters associated with the feedback strength and employing numerical simulation, linear stability and bifurcation analysis, the pattern-forming behaviour of the model is analysed under regimes corresponding to lateral inhibition and induction. Linear analysis of this model fails to capture the patterning behaviour exhibited in numerical simulations. Via bifurcation analysis, we show that since the majority of periodic patterns fold subcritically from the homogeneous steady state, a wide variety of stable patterns exists at a given parameter set, providing an explanation for this failure. The dominant pattern is isolated via numerical simulation. Additionally, by sampling patterns of non-integer wavelength on a discrete mesh, we highlight a disparity between the continuous and discrete representations of signalling mechanisms: in the continuous case, patterns of arbitrary wavelength are possible, while sampling such patterns on a discrete mesh leads to longer wavelength harmonics being selected where the wavelength is rational; in the irrational case, the resulting aperiodic patterns exhibit 'local periodicity', being constructed from distorted stable shorter wavelength patterns. This feature is consistent with experimentally observed patterns, which typically display approximate short-range periodicity with defects.

Exclusion of broiler breeder females from male feeders with a male only grill. 1. Behavioral and technical aspects of design and development.

PubMed

Brake, J; Khamidullin, T N; Fisinin, V I

1993-03-01

A series of experiments was conducted in order to develop a feeder grill that would allow broiler breeder males, but not females, to eat. Females are typically excluded from male feeders by increasing the height of the feeder. However, male feeder heights that exclude most females increase the time required for males to consume a given amount of feed 19 to 60%. Typical male feeder height from floor to feeder pan lip in commercial practice is 55 cm, which is about the distance from floor to the head of the male in an erect posture. Females measure about 40 cm in an erect posture. Because the necks of males (8.0 cm) are longer than those of females (6.3 cm), the lip of male feeder pans was extended horizontally 12.7 cm with a wire mesh on the assumption that females could not stretch their necks enough to reach the feed. However, the females learned quickly to perch on the extended lip and eat. Total exclusion of females from the male feeder, regardless of feeder height, was achieved by placing a horizontal upper mesh 5.6 to 10.2 cm above the extended lip, and connecting the upper mesh to the lower extended lip of the feeder with vertical bars spaced 5.1 cm apart. The horizontal upper mesh prevented perching by females and the 5.1-cm spacing of the vertical bars allowed males but not females to reach the feed by inserting their heads and necks up to their shoulders.(ABSTRACT TRUNCATED AT 250 WORDS)

[INFLUENCE OF TITANIUM COATING ON THE BIOCOMPATIBILITY OF POLYPROPYLENE IMPLANTS].

PubMed

Babichenko, I I; Kazantsev, A A; Titarov, D L; Shemyatovsky, K A; Ghevondian, N M; Melchenko, D; Alekhin, A I

2016-01-01

Comparative analysis of the proliferative activity of inflammatory cells and distribution of collagen types I and III was carried out around the net materials of polypropylene and titanium coating polypropylene using im- munohistochemical method and polarization microscopy. Experimental modeling of implanted mesh material were made in the soft tissues of the lumbar region of rats. On the 7th postoperative day, quantitative analysis of proliferating cells delected using antibodies to the Ki-67 protein showed, a significant decrease (p < 0.001) in the number of proliferating cells around the network elements of the polypropylene (29.1 ± 5.7 %), when com- pared to similar figures of infiltrates in titanium coating polypropylene (33.6 ± 3.1 %). Similar patterns were found on the 30th day of the experiment--15.9 ± 4.3 and 26.9 ± 3.6%--respectively (p < 0.001). Different types of collagen fibers in the granulomas around various types of implanted mesh material were detected on sections stained with Sirius red at polarizing light. On the 7th day after surgery, the ratio of collagen fibers ty- pe I and III in granulomas around the mesh material made of polypropylene was 1.085 ± 0.022 and this rati around materials of titanium coated polypropylene was higher--1.107 ± 0.013 (p = 0.017). On the 30th posto- perative day in the interface area ratio I/III collagen significantly increased and amounted to 1.174 ± 0.036 and 1.246 ± 0.102, respectively (p = 0.045). Assessing the impact of the use of titanium as a coating on the po- lypropylene, it can be argued that it promotes the formation of collagen I type and a more mature connective tis- sue around the mesh of the implants.

Municipal waste processing apparatus

DOEpatents

Mayberry, John L.

1989-01-01

Municipal waste materials are processed by crushing the materials so that pieces of noncombustible material are smaller than a selected size and pieces of combustible material are larger than the selected size. The crushed materials are placed on a vibrating mesh screen conveyor belt having openings which pass the smaller, noncombustible pieces of material, but do not pass the larger, combustible pieces of material. Consecutive conveyors may be connected by an intermediate vibratory plate. An air knife can be used to further separate materials based on weight.

Array architectures for iterative algorithms

NASA Technical Reports Server (NTRS)

Jagadish, Hosagrahar V.; Rao, Sailesh K.; Kailath, Thomas

1987-01-01

Regular mesh-connected arrays are shown to be isomorphic to a class of so-called regular iterative algorithms. For a wide variety of problems it is shown how to obtain appropriate iterative algorithms and then how to translate these algorithms into arrays in a systematic fashion. Several 'systolic' arrays presented in the literature are shown to be specific cases of the variety of architectures that can be derived by the techniques presented here. These include arrays for Fourier Transform, Matrix Multiplication, and Sorting.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wintermeyer, Niklas; Winters, Andrew R., E-mail: awinters@math.uni-koeln.de; Gassner, Gregor J.

We design an arbitrary high-order accurate nodal discontinuous Galerkin spectral element approximation for the non-linear two dimensional shallow water equations with non-constant, possibly discontinuous, bathymetry on unstructured, possibly curved, quadrilateral meshes. The scheme is derived from an equivalent flux differencing formulation of the split form of the equations. We prove that this discretization exactly preserves the local mass and momentum. Furthermore, combined with a special numerical interface flux function, the method exactly preserves the mathematical entropy, which is the total energy for the shallow water equations. By adding a specific form of interface dissipation to the baseline entropy conserving schememore » we create a provably entropy stable scheme. That is, the numerical scheme discretely satisfies the second law of thermodynamics. Finally, with a particular discretization of the bathymetry source term we prove that the numerical approximation is well-balanced. We provide numerical examples that verify the theoretical findings and furthermore provide an application of the scheme for a partial break of a curved dam test problem.« less

3D Printing Multi-Functionality: Embedded RF Antennas and Components

NASA Technical Reports Server (NTRS)

Shemelya, C. M.; Zemba, M.; Liang, M.; Espalin, D.; Kief, C.; Xin, H.; Wicker, R. B.; MacDonald, E. W.

2015-01-01

Significant research and press has recently focused on the fabrication freedom of Additive Manufacturing (AM) to create both conceptual models and final end-use products. This flexibility allows design modifications to be immediately reflected in 3D printed structures, creating new paradigms within the manufacturing process. 3D printed products will inevitably be fabricated locally, with unit-level customization, optimized to unique mission requirements. However, for the technology to be universally adopted, the processes must be enhanced to incorporate additional technologies; such as electronics, actuation, and electromagnetics. Recently, a novel 3D printing platform, Multi3D manufacturing, was funded by the presidential initiative for revitalizing manufacturing in the USA using 3D printing (America Makes - also known as the National Additive Manufacturing Innovation Institute). The Multi3D system specifically targets 3D printed electronics in arbitrary form; and building upon the potential of this system, this paper describes RF antennas and components fabricated through the integration of material extrusion 3D printing with embedded wire, mesh, and RF elements.