Science.gov

Sample records for adaptive grid hierarchy

  1. Hierarchy-Direction Selective Approach for Locally Adaptive Sparse Grids

    SciTech Connect

    Stoyanov, Miroslav K

    2013-09-01

    We consider the problem of multidimensional adaptive hierarchical interpolation. We use sparse grids points and functions that are induced from a one dimensional hierarchical rule via tensor products. The classical locally adaptive sparse grid algorithm uses an isotropic refinement from the coarser to the denser levels of the hierarchy. However, the multidimensional hierarchy provides a more complex structure that allows for various anisotropic and hierarchy selective refinement techniques. We consider the more advanced refinement techniques and apply them to a number of simple test functions chosen to demonstrate the various advantages and disadvantages of each method. While there is no refinement scheme that is optimal for all functions, the fully adaptive family-direction-selective technique is usually more stable and requires fewer samples.

  2. Adaptive 4-8 Texture Hierarchies

    SciTech Connect

    Hwa, L M; Duchaineau, M A; Joy, K I

    2004-08-02

    We address the texture level-of-detail problem for extremely large surfaces such as terrain during real-time, view-dependent rendering. A novel texture hierarchy is introduced based on 4-8 refinement of raster tiles, in which the texture grids in effect rotate 45 degrees for each level of refinement. This hierarchy provides twice as many levels of detail as conventional quad-tree-style refinement schemes such as mipmaps, and thus provides per-pixel view-dependent filtering that is twice as close to the ideal cutoff frequency for an average pixel. Because of this more gradual change in low-pass filtering, and due to the more precise emulation of the ideal cutoff frequency, we find in practice that the transitions between texture levels of detail are not perceptible. This allows rendering systems to avoid the complexity and performance costs of per-pixel blending between texture levels of detail. The 4-8 texturing scheme is integrated into a variant of the Real-time Optimally Adapting Meshes (ROAM) algorithm for view-dependent multiresolution mesh generation. Improvements to ROAM included here are: the diamond data structure as a streamlined replacement for the triangle bintree elements, the use of low-pass-filtered geometry patches in place of individual triangles, integration of 4-8 textures, and a simple out-of-core data access mechanism for texture and geometry tiles.

  3. 3D Structured Grid Adaptation

    NASA Technical Reports Server (NTRS)

    Banks, D. W.; Hafez, M. M.

    1996-01-01

    Grid adaptation for structured meshes is the art of using information from an existing, but poorly resolved, solution to automatically redistribute the grid points in such a way as to improve the resolution in regions of high error, and thus the quality of the solution. This involves: (1) generate a grid vis some standard algorithm, (2) calculate a solution on this grid, (3) adapt the grid to this solution, (4) recalculate the solution on this adapted grid, and (5) repeat steps 3 and 4 to satisfaction. Steps 3 and 4 can be repeated until some 'optimal' grid is converged to but typically this is not worth the effort and just two or three repeat calculations are necessary. They also may be repeated every 5-10 time steps for unsteady calculations.

  4. LAPS Grid generation and adaptation

    NASA Astrophysics Data System (ADS)

    Pagliantini, Cecilia; Delzanno, Gia Luca; Guo, Zehua; Srinivasan, Bhuvana; Tang, Xianzhu; Chacon, Luis

    2011-10-01

    LAPS uses a common-data framework in which a general purpose grid generation and adaptation package in toroidal and simply connected domains is implemented. The initial focus is on implementing the Winslow/Laplace-Beltrami method for generating non-overlapping block structured grids. This is to be followed by a grid adaptation scheme based on Monge-Kantorovich optimal transport method [Delzanno et al., J. Comput. Phys,227 (2008), 9841-9864], that equidistributes application-specified error. As an initial set of applications, we will lay out grids for an axisymmetric mirror, a field reversed configuration, and an entire poloidal cross section of a tokamak plasma reconstructed from a CMOD experimental shot. These grids will then be used for computing the plasma equilibrium and transport in accompanying presentations. A key issue for Monge-Kantorovich grid optimization is the choice of error or monitor function for equi-distribution. We will compare the Operator Recovery Error Source Detector (ORESD) [Lapenta, Int. J. Num. Meth. Eng,59 (2004) 2065-2087], the Tau method and a strategy based on the grid coarsening [Zhang et al., AIAA J,39 (2001) 1706-1715] to find an ``optimal'' grid. Work supported by DOE OFES.

  5. Anisotropic grid adaptation in LES

    NASA Astrophysics Data System (ADS)

    Toosi, Siavash; Larsson, Johan

    2016-11-01

    The modeling errors depend directly on the grid (or filter) spacing in turbulence-resolving simulations (LES, DNS, DES, etc), and are typically at least as significant as the numerical errors. This makes adaptive grid-refinement complicated, since it prevents the estimation of the local error sources through numerical analysis. The present work attempts to address this difficulty with a physics-based error-source indicator that accounts for the anisotropy in the smallest resolved scales, which can thus be used to drive an anisotropic grid-adaptation process. The proposed error indicator is assessed on a sequence of problems, including turbulent channel flow and flows in more complex geometries. The formulation is geometrically general and applicable to complex geometries.

  6. Near-Body Grid Adaption for Overset Grids

    NASA Technical Reports Server (NTRS)

    Buning, Pieter G.; Pulliam, Thomas H.

    2016-01-01

    A solution adaption capability for curvilinear near-body grids has been implemented in the OVERFLOW overset grid computational fluid dynamics code. The approach follows closely that used for the Cartesian off-body grids, but inserts refined grids in the computational space of original near-body grids. Refined curvilinear grids are generated using parametric cubic interpolation, with one-sided biasing based on curvature and stretching ratio of the original grid. Sensor functions, grid marking, and solution interpolation tasks are implemented in the same fashion as for off-body grids. A goal-oriented procedure, based on largest error first, is included for controlling growth rate and maximum size of the adapted grid system. The adaption process is almost entirely parallelized using MPI, resulting in a capability suitable for viscous, moving body simulations. Two- and three-dimensional examples are presented.

  7. Adaptive EAGLE dynamic solution adaptation and grid quality enhancement

    NASA Technical Reports Server (NTRS)

    Luong, Phu Vinh; Thompson, J. F.; Gatlin, B.; Mastin, C. W.; Kim, H. J.

    1992-01-01

    In the effort described here, the elliptic grid generation procedure in the EAGLE grid code was separated from the main code into a subroutine, and a new subroutine which evaluates several grid quality measures at each grid point was added. The elliptic grid routine can now be called, either by a computational fluid dynamics (CFD) code to generate a new adaptive grid based on flow variables and quality measures through multiple adaptation, or by the EAGLE main code to generate a grid based on quality measure variables through static adaptation. Arrays of flow variables can be read into the EAGLE grid code for use in static adaptation as well. These major changes in the EAGLE adaptive grid system make it easier to convert any CFD code that operates on a block-structured grid (or single-block grid) into a multiple adaptive code.

  8. Energy Systems Integration: Demonstrating Distributed Grid-Edge Control Hierarchy

    SciTech Connect

    2017-01-01

    Overview fact sheet about the OMNETRIC Group Integrated Network Testbed for Energy Grid Research and Technology Experimentation (INTEGRATE) project at the Energy Systems Integration Facility. INTEGRATE is part of the U.S. Department of Energy's Grid Modernization Initiative.

  9. Hierarchy and polysynchrony in an adaptive network.

    PubMed

    Botella-Soler, V; Glendinning, P

    2014-06-01

    We describe a simple adaptive network of coupled chaotic maps. The network reaches a stationary state (frozen topology) for all values of the coupling parameter, although the dynamics of the maps at the nodes of the network can be nontrivial. The structure of the network shows interesting hierarchical properties and in certain parameter regions the dynamics is polysynchronous: Nodes can be divided in differently synchronized classes but, contrary to cluster synchronization, nodes in the same class need not be connected to each other. These complicated synchrony patterns have been conjectured to play roles in systems biology and circuits. The adaptive system we study describes ways whereby this behavior can evolve from undifferentiated nodes.

  10. Hierarchy and polysynchrony in an adaptive network

    NASA Astrophysics Data System (ADS)

    Botella-Soler, V.; Glendinning, P.

    2014-06-01

    We describe a simple adaptive network of coupled chaotic maps. The network reaches a stationary state (frozen topology) for all values of the coupling parameter, although the dynamics of the maps at the nodes of the network can be nontrivial. The structure of the network shows interesting hierarchical properties and in certain parameter regions the dynamics is polysynchronous: Nodes can be divided in differently synchronized classes but, contrary to cluster synchronization, nodes in the same class need not be connected to each other. These complicated synchrony patterns have been conjectured to play roles in systems biology and circuits. The adaptive system we study describes ways whereby this behavior can evolve from undifferentiated nodes.

  11. Interactive solution-adaptive grid generation procedure

    NASA Technical Reports Server (NTRS)

    Henderson, Todd L.; Choo, Yung K.; Lee, Ki D.

    1992-01-01

    TURBO-AD is an interactive solution adaptive grid generation program under development. The program combines an interactive algebraic grid generation technique and a solution adaptive grid generation technique into a single interactive package. The control point form uses a sparse collection of control points to algebraically generate a field grid. This technique provides local grid control capability and is well suited to interactive work due to its speed and efficiency. A mapping from the physical domain to a parametric domain was used to improve difficulties encountered near outwardly concave boundaries in the control point technique. Therefore, all grid modifications are performed on the unit square in the parametric domain, and the new adapted grid is then mapped back to the physical domain. The grid adaption is achieved by adapting the control points to a numerical solution in the parametric domain using control sources obtained from the flow properties. Then a new modified grid is generated from the adapted control net. This process is efficient because the number of control points is much less than the number of grid points and the generation of the grid is an efficient algebraic process. TURBO-AD provides the user with both local and global controls.

  12. An Adaptive Unstructured Grid Method by Grid Subdivision, Local Remeshing, and Grid Movement

    NASA Technical Reports Server (NTRS)

    Pirzadeh, Shahyar Z.

    1999-01-01

    An unstructured grid adaptation technique has been developed and successfully applied to several three dimensional inviscid flow test cases. The approach is based on a combination of grid subdivision, local remeshing, and grid movement. For solution adaptive grids, the surface triangulation is locally refined by grid subdivision, and the tetrahedral grid in the field is partially remeshed at locations of dominant flow features. A grid redistribution strategy is employed for geometric adaptation of volume grids to moving or deforming surfaces. The method is automatic and fast and is designed for modular coupling with different solvers. Several steady state test cases with different inviscid flow features were tested for grid/solution adaptation. In all cases, the dominant flow features, such as shocks and vortices, were accurately and efficiently predicted with the present approach. A new and robust method of moving tetrahedral "viscous" grids is also presented and demonstrated on a three-dimensional example.

  13. Emerging hierarchies in dynamically adapting webs

    NASA Astrophysics Data System (ADS)

    Katifori, Eleni; Graewer, Johannes; Magnasco, Marcelo; Modes, Carl

    Transport networks play a key role across four realms of eukaryotic life: slime molds, fungi, plants, and animals. In addition to the developmental algorithms that build them, many also employ adaptive strategies to respond to stimuli, damage, and other environmental changes. We model these adapting network architectures using a generic dynamical system on weighted graphs and find in simulation that these networks ultimately develop a hierarchical organization of the final weighted architecture accompanied by the formation of a system-spanning backbone. We quantify the hierarchical organization of the networks by developing an algorithm that decomposes the architecture to multiple scales and analyzes how the organization in each scale relates to that of the scale above and below it. The methodologies developed in this work are applicable to a wide range of systems including the slime mold physarum polycephalum, human microvasculature, and force chains in granular media.

  14. The fundamentals of adaptive grid movement

    NASA Technical Reports Server (NTRS)

    Eiseman, Peter R.

    1990-01-01

    Basic grid point movement schemes are studied. The schemes are referred to as adaptive grids. Weight functions and equidistribution in one dimension are treated. The specification of coefficients in the linear weight, attraction to a given grid or a curve, and evolutionary forces are considered. Curve by curve and finite volume methods are described. The temporal coupling of partial differential equations solvers and grid generators was discussed.

  15. Structured adaptive grid generation using algebraic methods

    NASA Technical Reports Server (NTRS)

    Yang, Jiann-Cherng; Soni, Bharat K.; Roger, R. P.; Chan, Stephen C.

    1993-01-01

    The accuracy of the numerical algorithm depends not only on the formal order of approximation but also on the distribution of grid points in the computational domain. Grid adaptation is a procedure which allows optimal grid redistribution as the solution progresses. It offers the prospect of accurate flow field simulations without the use of an excessively timely, computationally expensive, grid. Grid adaptive schemes are divided into two basic categories: differential and algebraic. The differential method is based on a variational approach where a function which contains a measure of grid smoothness, orthogonality and volume variation is minimized by using a variational principle. This approach provided a solid mathematical basis for the adaptive method, but the Euler-Lagrange equations must be solved in addition to the original governing equations. On the other hand, the algebraic method requires much less computational effort, but the grid may not be smooth. The algebraic techniques are based on devising an algorithm where the grid movement is governed by estimates of the local error in the numerical solution. This is achieved by requiring the points in the large error regions to attract other points and points in the low error region to repel other points. The development of a fast, efficient, and robust algebraic adaptive algorithm for structured flow simulation applications is presented. This development is accomplished in a three step process. The first step is to define an adaptive weighting mesh (distribution mesh) on the basis of the equidistribution law applied to the flow field solution. The second, and probably the most crucial step, is to redistribute grid points in the computational domain according to the aforementioned weighting mesh. The third and the last step is to reevaluate the flow property by an appropriate search/interpolate scheme at the new grid locations. The adaptive weighting mesh provides the information on the desired concentration

  16. Real-time optimal adaptation for planetary geometry and texture: 4-8 tile hierarchies.

    PubMed

    Hwa, Lok M; Duchaineau, Mark A; Joy, Kenneth I

    2005-01-01

    The real-time display of huge geometry and imagery databases involves view-dependent approximations, typically through the use of precomputed hierarchies that are selectively refined at runtime. A classic motivating problem is terrain visualization in which planetary databases involving billions of elevation and color values are displayed on PC graphics hardware at high frame rates. This paper introduces a new diamond data structure for the basic selective-refinement processing, which is a streamlined method of representing the well-known hierarchies of right triangles that have enjoyed much success in real-time, view-dependent terrain display. Regular-grid tiles are proposed as the payload data per diamond for both geometry and texture. The use of 4-8 grid refinement and coarsening schemes allows level-of-detail transitions that are twice as gradual as traditional quadtree-based hierarchies, as well as very high-quality low-pass filtering compared to subsampling-based hierarchies. An out-of-core storage organization is introduced based on Sierpinski indices per diamond, along with a tile preprocessing framework based on fine-to-coarse, same-level, and coarse-to-fine gathering operations. To attain optimal frame-to-frame coherence and processing-order priorities, dual split and merge queues are developed similar to the Realtime Optimally Adapting Meshes (ROAM) Algorithm, as well as an adaptation of the ROAM frustum culling technique. Example applications of lake-detection and procedural terrain generation demonstrate the flexibility of the tile processing framework.

  17. Grid adaption using Chimera composite overlapping meshes

    NASA Technical Reports Server (NTRS)

    Kao, Kai-Hsiung; Liou, Meng-Sing; Chow, Chuen-Yen

    1993-01-01

    The objective of this paper is to perform grid adaptation using composite over-lapping meshes in regions of large gradient to capture the salient features accurately during computation. The Chimera grid scheme, a multiple overset mesh technique, is used in combination with a Navier-Stokes solver. The numerical solution is first converged to a steady state based on an initial coarse mesh. Solution-adaptive enhancement is then performed by using a secondary fine grid system which oversets on top of the base grid in the high-gradient region, but without requiring the mesh boundaries to join in any special way. Communications through boundary interfaces between those separated grids are carried out using tri-linear interpolation. Applications to the Euler equations for shock reflections and to a shock wave/boundary layer interaction problem are tested. With the present method, the salient features are well resolved.

  18. Grid adaptation using chimera composite overlapping meshes

    NASA Technical Reports Server (NTRS)

    Kao, Kai-Hsiung; Liou, Meng-Sing; Chow, Chuen-Yen

    1994-01-01

    The objective of this paper is to perform grid adaptation using composite overlapping meshes in regions of large gradient to accurately capture the salient features during computation. The chimera grid scheme, a multiple overset mesh technique, is used in combination with a Navier-Stokes solver. The numerical solution is first converged to a steady state based on an initial coarse mesh. Solution-adaptive enhancement is then performed by using a secondary fine grid system which oversets on top of the base grid in the high-gradient region, but without requiring the mesh boundaries to join in any special way. Communications through boundary interfaces between those separated grids are carried out using trilinear interpolation. Application to the Euler equations for shock reflections and to shock wave/boundary layer interaction problem are tested. With the present method, the salient features are well-resolved.

  19. Grid adaptation using Chimera composite overlapping meshes

    NASA Technical Reports Server (NTRS)

    Kao, Kai-Hsiung; Liou, Meng-Sing; Chow, Chuen-Yen

    1993-01-01

    The objective of this paper is to perform grid adaptation using composite over-lapping meshes in regions of large gradient to capture the salient features accurately during computation. The Chimera grid scheme, a multiple overset mesh technique, is used in combination with a Navier-Stokes solver. The numerical solution is first converged to a steady state based on an initial coarse mesh. Solution-adaptive enhancement is then performed by using a secondary fine grid system which oversets on top of the base grid in the high-gradient region, but without requiring the mesh boundaries to join in any special way. Communications through boundary interfaces between those separated grids are carried out using tri-linear interpolation. Applications to the Euler equations for shock reflections and to a shock wave/boundary layer interaction problem are tested. With the present method, the salient features are well resolved.

  20. SAGE - MULTIDIMENSIONAL SELF-ADAPTIVE GRID CODE

    NASA Technical Reports Server (NTRS)

    Davies, C. B.

    1994-01-01

    SAGE, Self Adaptive Grid codE, is a flexible tool for adapting and restructuring both 2D and 3D grids. Solution-adaptive grid methods are useful tools for efficient and accurate flow predictions. In supersonic and hypersonic flows, strong gradient regions such as shocks, contact discontinuities, shear layers, etc., require careful distribution of grid points to minimize grid error and produce accurate flow-field predictions. SAGE helps the user obtain more accurate solutions by intelligently redistributing (i.e. adapting) the original grid points based on an initial or interim flow-field solution. The user then computes a new solution using the adapted grid as input to the flow solver. The adaptive-grid methodology poses the problem in an algebraic, unidirectional manner for multi-dimensional adaptations. The procedure is analogous to applying tension and torsion spring forces proportional to the local flow gradient at every grid point and finding the equilibrium position of the resulting system of grid points. The multi-dimensional problem of grid adaption is split into a series of one-dimensional problems along the computational coordinate lines. The reduced one dimensional problem then requires a tridiagonal solver to find the location of grid points along a coordinate line. Multi-directional adaption is achieved by the sequential application of the method in each coordinate direction. The tension forces direct the redistribution of points to the strong gradient region. To maintain smoothness and a measure of orthogonality of grid lines, torsional forces are introduced that relate information between the family of lines adjacent to one another. The smoothness and orthogonality constraints are direction-dependent, since they relate only the coordinate lines that are being adapted to the neighboring lines that have already been adapted. Therefore the solutions are non-unique and depend on the order and direction of adaption. Non-uniqueness of the adapted grid is

  1. Adaptive refinement tools for tetrahedral unstructured grids

    NASA Technical Reports Server (NTRS)

    Pao, S. Paul (Inventor); Abdol-Hamid, Khaled S. (Inventor)

    2011-01-01

    An exemplary embodiment providing one or more improvements includes software which is robust, efficient, and has a very fast run time for user directed grid enrichment and flow solution adaptive grid refinement. All user selectable options (e.g., the choice of functions, the choice of thresholds, etc.), other than a pre-marked cell list, can be entered on the command line. The ease of application is an asset for flow physics research and preliminary design CFD analysis where fast grid modification is often needed to deal with unanticipated development of flow details.

  2. Cartesian-cell based grid generation and adaptive mesh refinement

    NASA Technical Reports Server (NTRS)

    Coirier, William J.; Powell, Kenneth G.

    1993-01-01

    Viewgraphs on Cartesian-cell based grid generation and adaptive mesh refinement are presented. Topics covered include: grid generation; cell cutting; data structures; flow solver formulation; adaptive mesh refinement; and viscous flow.

  3. Rapid Pattern Recognition of Three Dimensional Objects Using Parallel Processing Within a Hierarchy of Hexagonal Grids

    NASA Astrophysics Data System (ADS)

    Tang, Haojun

    1995-01-01

    This thesis describes using parallel processing within a hierarchy of hexagonal grids to achieve rapid recognition of patterns. A seven-pixel basic hexagonal neighborhood, a sixty-one-pixel superneighborhood and pyramids of a 2-to-4 area ratio are employed. The hexagonal network achieves improved accuracy over the square network for object boundaries. The hexagonal grid with less directional sensitivity is a better approximation of the human vision grid, is more suited to natural scenes than the square grid and avoids the 4-neighbor/8-neighbor problem. Parallel processing in image analysis saves considerable time versus the traditional line-by-line method. Hexagonal parallel processing combines the optimum hexagonal geometry with the parallel structure. Our work has surveyed behavior and internal properties to construct the image on the different level of hexagonal pixel grids in a parallel computation scheme. A computer code has been developed to detect edges of digital images of real objects taken with a CCD camera within a hexagonal grid at any level. The algorithm uses the differences of the local gray level and those of its six neighbors, and is able to determine the boundary of a digital image in parallel. Also a series of algorithms and techniques have been built up to manage edge linking, feature extraction, etc. The digital images obtained from the improved CRS digital image processing system are a good approximation to the images which would be obtained with a real physical hexagonal grid. We envision that our work done within this little-known area will have some important applications in real-time machine vision. A parallel two-layer hexagonal-array retina has been designed to do pattern recognition using simple operations such as differencing, rationing, thresholding, etc. which may occur in the human retina and other biological vision systems.

  4. Cosmos++: Relativistic Magnetohydrodynamics on Unstructured Grids with Local Adaptive Refinement

    SciTech Connect

    Anninos, P; Fragile, P C; Salmonson, J D

    2005-05-06

    A new code and methodology are introduced for solving the fully general relativistic magnetohydrodynamic (GRMHD) equations using time-explicit, finite-volume discretization. The code has options for solving the GRMHD equations using traditional artificial-viscosity (AV) or non-oscillatory central difference (NOCD) methods, or a new extended AV (eAV) scheme using artificial-viscosity together with a dual energy-flux-conserving formulation. The dual energy approach allows for accurate modeling of highly relativistic flows at boost factors well beyond what has been achieved to date by standard artificial viscosity methods. it provides the benefit of Godunov methods in capturing high Lorentz boosted flows but without complicated Riemann solvers, and the advantages of traditional artificial viscosity methods in their speed and flexibility. Additionally, the GRMHD equations are solved on an unstructured grid that supports local adaptive mesh refinement using a fully threated oct-tree (in three dimensions) network to traverse the grid hierarchy across levels and immediate neighbors. A number of tests are presented to demonstrate robustness of the numerical algorithms and adaptive mesh framework over a wide spectrum of problems, boosts, and astrophysical applications, including relativistic shock tubes, shock collisions, magnetosonic shocks, Alfven wave propagation, blast waves, magnetized Bondi flow, and the magneto-rotational instability in Kerr black hole spacetimes.

  5. Transonic airfoil calculations using solution-adaptive grids

    NASA Technical Reports Server (NTRS)

    Holst, T. L.; Brown, D.

    1981-01-01

    A new algorithm for generating solution-adaptive grids (SAG) about airfoil configurations embedded in transonic flow is presented. The present SAG approach uses only the airfoil surface solution to recluster grid points on the airfoil surface, i.e., the reclustering problem is one dimension smaller than the flow-field calculation problem. Special controls automatically built into the elliptic grid generation procedure are then used to obtain grids with suitable interior behavior. This concept of redistributing grid points greatly simplifies the idea of solution-adaptive grids. Numerical results indicate significant improvements in accuracy for SAG grids relative to standard grids using the same number of points.

  6. Elliptic Solvers for Adaptive Mesh Refinement Grids

    SciTech Connect

    Quinlan, D.J.; Dendy, J.E., Jr.; Shapira, Y.

    1999-06-03

    We are developing multigrid methods that will efficiently solve elliptic problems with anisotropic and discontinuous coefficients on adaptive grids. The final product will be a library that provides for the simplified solution of such problems. This library will directly benefit the efforts of other Laboratory groups. The focus of this work is research on serial and parallel elliptic algorithms and the inclusion of our black-box multigrid techniques into this new setting. The approach applies the Los Alamos object-oriented class libraries that greatly simplify the development of serial and parallel adaptive mesh refinement applications. In the final year of this LDRD, we focused on putting the software together; in particular we completed the final AMR++ library, we wrote tutorials and manuals, and we built example applications. We implemented the Fast Adaptive Composite Grid method as the principal elliptic solver. We presented results at the Overset Grid Conference and other more AMR specific conferences. We worked on optimization of serial and parallel performance and published several papers on the details of this work. Performance remains an important issue and is the subject of continuing research work.

  7. On Accuracy of Adaptive Grid Methods for Captured Shocks

    NASA Technical Reports Server (NTRS)

    Yamaleev, Nail K.; Carpenter, Mark H.

    2002-01-01

    The accuracy of two grid adaptation strategies, grid redistribution and local grid refinement, is examined by solving the 2-D Euler equations for the supersonic steady flow around a cylinder. Second- and fourth-order linear finite difference shock-capturing schemes, based on the Lax-Friedrichs flux splitting, are used to discretize the governing equations. The grid refinement study shows that for the second-order scheme, neither grid adaptation strategy improves the numerical solution accuracy compared to that calculated on a uniform grid with the same number of grid points. For the fourth-order scheme, the dominant first-order error component is reduced by the grid adaptation, while the design-order error component drastically increases because of the grid nonuniformity. As a result, both grid adaptation techniques improve the numerical solution accuracy only on the coarsest mesh or on very fine grids that are seldom found in practical applications because of the computational cost involved. Similar error behavior has been obtained for the pressure integral across the shock. A simple analysis shows that both grid adaptation strategies are not without penalties in the numerical solution accuracy. Based on these results, a new grid adaptation criterion for captured shocks is proposed.

  8. Techniques for grid manipulation and adaptation. [computational fluid dynamics

    NASA Technical Reports Server (NTRS)

    Choo, Yung K.; Eisemann, Peter R.; Lee, Ki D.

    1992-01-01

    Two approaches have been taken to provide systematic grid manipulation for improved grid quality. One is the control point form (CPF) of algebraic grid generation. It provides explicit control of the physical grid shape and grid spacing through the movement of the control points. It works well in the interactive computer graphics environment and hence can be a good candidate for integration with other emerging technologies. The other approach is grid adaptation using a numerical mapping between the physical space and a parametric space. Grid adaptation is achieved by modifying the mapping functions through the effects of grid control sources. The adaptation process can be repeated in a cyclic manner if satisfactory results are not achieved after a single application.

  9. Comparing Anisotropic Output-Based Grid Adaptation Methods by Decomposition

    NASA Technical Reports Server (NTRS)

    Park, Michael A.; Loseille, Adrien; Krakos, Joshua A.; Michal, Todd

    2015-01-01

    Anisotropic grid adaptation is examined by decomposing the steps of flow solution, ad- joint solution, error estimation, metric construction, and simplex grid adaptation. Multiple implementations of each of these steps are evaluated by comparison to each other and expected analytic results when available. For example, grids are adapted to analytic metric fields and grid measures are computed to illustrate the properties of multiple independent implementations of grid adaptation mechanics. Different implementations of each step in the adaptation process can be evaluated in a system where the other components of the adaptive cycle are fixed. Detailed examination of these properties allows comparison of different methods to identify the current state of the art and where further development should be targeted.

  10. Automatic adaptive grid refinement for the Euler equations

    NASA Technical Reports Server (NTRS)

    Berger, M. J.; Jameson, A.

    1983-01-01

    A method of adaptive grid refinement for the solution of the steady Euler equations for transonic flow is presented. Algorithm automatically decides where the coarse grid accuracy is insufficient, and creates locally uniform refined grids in these regions. This typically occurs at the leading and trailing edges. The solution is then integrated to steady state using the same integrator (FLO52) in the interior of each grid. The boundary conditions needed on the fine grids are examined and the importance of treating the fine/coarse grid inerface conservatively is discussed. Numerical results are presented.

  11. Moving and adaptive grid methods for compressible flows

    NASA Technical Reports Server (NTRS)

    Trepanier, Jean-Yves; Camarero, Ricardo

    1995-01-01

    This paper describes adaptive grid methods developed specifically for compressible flow computations. The basic flow solver is a finite-volume implementation of Roe's flux difference splitting scheme or arbitrarily moving unstructured triangular meshes. The grid adaptation is performed according to geometric and flow requirements. Some results are included to illustrate the potential of the methodology.

  12. Conservative treatment of boundary interfaces for overlaid grids and multi-level grid adaptations

    NASA Technical Reports Server (NTRS)

    Moon, Young J.; Liou, Meng-Sing

    1989-01-01

    Conservative algorithms for boundary interfaces of overlaid grids are presented. The basic method is zeroth order, and is extended to a higher order method using interpolation and subcell decomposition. The present method, strictly based on a conservative constraint, is tested with overlaid grids for various applications of unsteady and steady supersonic inviscid flows with strong shock waves. The algorithm is also applied to a multi-level grid adaptation in which the next level finer grid is overlaid on the coarse base grid with an arbitrary orientation.

  13. A generic efficient adaptive grid scheme for rocket propulsion modeling

    NASA Technical Reports Server (NTRS)

    Mo, J. D.; Chow, Alan S.

    1993-01-01

    The objective of this research is to develop an efficient, time-accurate numerical algorithm to discretize the Navier-Stokes equations for the predictions of internal one-, two-dimensional and axisymmetric flows. A generic, efficient, elliptic adaptive grid generator is implicitly coupled with the Lower-Upper factorization scheme in the development of ALUNS computer code. The calculations of one-dimensional shock tube wave propagation and two-dimensional shock wave capture, wave-wave interactions, shock wave-boundary interactions show that the developed scheme is stable, accurate and extremely robust. The adaptive grid generator produced a very favorable grid network by a grid speed technique. This generic adaptive grid generator is also applied in the PARC and FDNS codes and the computational results for solid rocket nozzle flowfield and crystal growth modeling by those codes will be presented in the conference, too. This research work is being supported by NASA/MSFC.

  14. Workshop on adaptive grid methods for fusion plasmas

    SciTech Connect

    Wiley, J.C.

    1995-07-01

    The author describes a general `hp` finite element method with adaptive grids. The code was based on the work of Oden, et al. The term `hp` refers to the method of spatial refinement (h), in conjunction with the order of polynomials used as a part of the finite element discretization (p). This finite element code seems to handle well the different mesh grid sizes occuring between abuted grids with different resolutions.

  15. New multigrid approach for three-dimensional unstructured, adaptive grids

    NASA Technical Reports Server (NTRS)

    Parthasarathy, Vijayan; Kallinderis, Y.

    1994-01-01

    A new multigrid method with adaptive unstructured grids is presented. The three-dimensional Euler equations are solved on tetrahedral grids that are adaptively refined or coarsened locally. The multigrid method is employed to propagate the fine grid corrections more rapidly by redistributing the changes-in-time of the solution from the fine grid to the coarser grids to accelerate convergence. A new approach is employed that uses the parent cells of the fine grid cells in an adapted mesh to generate successively coaser levels of multigrid. This obviates the need for the generation of a sequence of independent, nonoverlapping grids as well as the relatively complicated operations that need to be performed to interpolate the solution and the residuals between the independent grids. The solver is an explicit, vertex-based, finite volume scheme that employs edge-based data structures and operations. Spatial discretization is of central-differencing type combined with a special upwind-like smoothing operators. Application cases include adaptive solutions obtained with multigrid acceleration for supersonic and subsonic flow over a bump in a channel, as well as transonic flow around the ONERA M6 wing. Two levels of multigrid resulted in reduction in the number of iterations by a factor of 5.

  16. New multigrid approach for three-dimensional unstructured, adaptive grids

    NASA Astrophysics Data System (ADS)

    Parthasarathy, Vijayan; Kallinderis, Y.

    1994-05-01

    A new multigrid method with adaptive unstructured grids is presented. The three-dimensional Euler equations are solved on tetrahedral grids that are adaptively refined or coarsened locally. The multigrid method is employed to propagate the fine grid corrections more rapidly by redistributing the changes-in-time of the solution from the fine grid to the coarser grids to accelerate convergence. A new approach is employed that uses the parent cells of the fine grid cells in an adapted mesh to generate successively coarser levels of multigrid. This obviates the need for the generation of a sequence of independent, nonoverlapping grids as well as the relatively complicated operations that need to be performed to interpolate the solution and the residuals between the independent grids. The solver is an explicit, vertex-based, finite volume scheme that employs edge-based data structures and operations. Spatial discretization is of central-differencing type combined with special upwind-like smoothing operators. Application cases include adaptive solutions obtained with multigrid acceleration for supersonic and subsonic flow over a bump in a channel, as well as transonic flow around the ONERA M6 wing. Two levels of multigrid resulted in reduction in the number of iterations by a factor of 5.

  17. New multigrid approach for three-dimensional unstructured, adaptive grids

    NASA Astrophysics Data System (ADS)

    Parthasarathy, Vijayan; Kallinderis, Y.

    1994-05-01

    A new multigrid method with adaptive unstructured grids is presented. The three-dimensional Euler equations are solved on tetrahedral grids that are adaptively refined or coarsened locally. The multigrid method is employed to propagate the fine grid corrections more rapidly by redistributing the changes-in-time of the solution from the fine grid to the coarser grids to accelerate convergence. A new approach is employed that uses the parent cells of the fine grid cells in an adapted mesh to generate successively coaser levels of multigrid. This obviates the need for the generation of a sequence of independent, nonoverlapping grids as well as the relatively complicated operations that need to be performed to interpolate the solution and the residuals between the independent grids. The solver is an explicit, vertex-based, finite volume scheme that employs edge-based data structures and operations. Spatial discretization is of central-differencing type combined with a special upwind-like smoothing operators. Application cases include adaptive solutions obtained with multigrid acceleration for supersonic and subsonic flow over a bump in a channel, as well as transonic flow around the ONERA M6 wing. Two levels of multigrid resulted in reduction in the number of iterations by a factor of 5.

  18. Rapid Structured Volume Grid Smoothing and Adaption Technique

    NASA Technical Reports Server (NTRS)

    Alter, Stephen J.

    2006-01-01

    A rapid, structured volume grid smoothing and adaption technique, based on signal processing methods, was developed and applied to the Shuttle Orbiter at hypervelocity flight conditions in support of the Columbia Accident Investigation. Because of the fast pace of the investigation, computational aerothermodynamicists, applying hypersonic viscous flow solving computational fluid dynamic (CFD) codes, refined and enhanced a grid for an undamaged baseline vehicle to assess a variety of damage scenarios. Of the many methods available to modify a structured grid, most are time-consuming and require significant user interaction. By casting the grid data into different coordinate systems, specifically two computational coordinates with arclength as the third coordinate, signal processing methods are used for filtering the data [Taubin, CG v/29 1995]. Using a reverse transformation, the processed data are used to smooth the Cartesian coordinates of the structured grids. By coupling the signal processing method with existing grid operations within the Volume Grid Manipulator tool, problems related to grid smoothing are solved efficiently and with minimal user interaction. Examples of these smoothing operations are illustrated for reductions in grid stretching and volume grid adaptation. In each of these examples, other techniques existed at the time of the Columbia accident, but the incorporation of signal processing techniques reduced the time to perform the corrections by nearly 60%. This reduction in time to perform the corrections therefore enabled the assessment of approximately twice the number of damage scenarios than previously possible during the allocated investigation time.

  19. Rapid Structured Volume Grid Smoothing and Adaption Technique

    NASA Technical Reports Server (NTRS)

    Alter, Stephen J.

    2004-01-01

    A rapid, structured volume grid smoothing and adaption technique, based on signal processing methods, was developed and applied to the Shuttle Orbiter at hypervelocity flight conditions in support of the Columbia Accident Investigation. Because of the fast pace of the investigation, computational aerothermodynamicists, applying hypersonic viscous flow solving computational fluid dynamic (CFD) codes, refined and enhanced a grid for an undamaged baseline vehicle to assess a variety of damage scenarios. Of the many methods available to modify a structured grid, most are time-consuming and require significant user interaction. By casting the grid data into different coordinate systems, specifically two computational coordinates with arclength as the third coordinate, signal processing methods are used for filtering the data [Taubin, CG v/29 1995]. Using a reverse transformation, the processed data are used to smooth the Cartesian coordinates of the structured grids. By coupling the signal processing method with existing grid operations within the Volume Grid Manipulator tool, problems related to grid smoothing are solved efficiently and with minimal user interaction. Examples of these smoothing operations are illustrated for reduction in grid stretching and volume grid adaptation. In each of these examples, other techniques existed at the time of the Columbia accident, but the incorporation of signal processing techniques reduced the time to perform the corrections by nearly 60%. This reduction in time to perform the corrections therefore enabled the assessment of approximately twice the number of damage scenarios than previously possible during the allocated investigation time.

  20. 3-D adaptive grid Navier-Stokes rocket plume calculations

    NASA Astrophysics Data System (ADS)

    Holcomb, J. Eric

    1991-01-01

    Three-dimensional adaptive-grid full Navier-Stokes calculations performed for the base region and plume of the Minuteman first stage and a simplified version of the Titan first stage are used to demonstrate the applicability of the Navier-Stokes flow solver, EAGLE adaptive grid generator, and k-epsilon turbulence model to rocket plume flowfields. The calculations include realistic exhaust gas thermodynamic properties, with frozen chemistry.

  1. An adaptive Cartesian grid generation method for Dirty geometry

    NASA Astrophysics Data System (ADS)

    Wang, Z. J.; Srinivasan, Kumar

    2002-07-01

    Traditional structured and unstructured grid generation methods need a water-tight boundary surface grid to start. Therefore, these methods are named boundary to interior (B2I) approaches. Although these methods have achieved great success in fluid flow simulations, the grid generation process can still be very time consuming if non-water-tight geometries are given. Significant user time can be taken to repair or clean a dirty geometry with cracks, overlaps or invalid manifolds before grid generation can take place. In this paper, we advocate a different approach in grid generation, namely the interior to boundary (I2B) approach. With an I2B approach, the computational grid is first generated inside the computational domain. Then this grid is intelligently connected to the boundary, and the boundary grid is a result of this connection. A significant advantage of the I2B approach is that dirty geometries can be handled without cleaning or repairing, dramatically reducing grid generation time. An I2B adaptive Cartesian grid generation method is developed in this paper to handle dirty geometries without geometry repair. Comparing with a B2I approach, the grid generation time with the I2B approach for a complex automotive engine can be reduced by three orders of magnitude. Copyright

  2. Adaptive Mesh Refinement in Curvilinear Body-Fitted Grid Systems

    NASA Technical Reports Server (NTRS)

    Steinthorsson, Erlendur; Modiano, David; Colella, Phillip

    1995-01-01

    To be truly compatible with structured grids, an AMR algorithm should employ a block structure for the refined grids to allow flow solvers to take advantage of the strengths of unstructured grid systems, such as efficient solution algorithms for implicit discretizations and multigrid schemes. One such algorithm, the AMR algorithm of Berger and Colella, has been applied to and adapted for use with body-fitted structured grid systems. Results are presented for a transonic flow over a NACA0012 airfoil (AGARD-03 test case) and a reflection of a shock over a double wedge.

  3. Topology and grid adaption for high-speed flow computations

    NASA Astrophysics Data System (ADS)

    Abolhassani, Jamshid S.; Tiwari, Surendra N.

    1989-03-01

    This study investigates the effects of grid topology and grid adaptation on numerical solutions of the Navier-Stokes equations. In the first part of this study, a general procedure is presented for computation of high-speed flow over complex three-dimensional configurations. The flow field is simulated on the surface of a Butler wing in a uniform stream. Results are presented for Mach number 3.5 and a Reynolds number of 2,000,000. The O-type and H-type grids have been used for this study, and the results are compared together and with other theoretical and experimental results. The results demonstrate that while the H-type grid is suitable for the leading and trailing edges, a more accurate solution can be obtained for the middle part of the wing with an O-type grid. In the second part of this study, methods of grid adaption are reviewed and a method is developed with the capability of adapting to several variables. This method is based on a variational approach and is an algebraic method. Also, the method has been formulated in such a way that there is no need for any matrix inversion. This method is used in conjunction with the calculation of hypersonic flow over a blunt-nose body. A movie has been produced which shows simultaneously the transient behavior of the solution and the grid adaption.

  4. Topology and grid adaption for high-speed flow computations

    NASA Technical Reports Server (NTRS)

    Abolhassani, Jamshid S.; Tiwari, Surendra N.

    1989-01-01

    This study investigates the effects of grid topology and grid adaptation on numerical solutions of the Navier-Stokes equations. In the first part of this study, a general procedure is presented for computation of high-speed flow over complex three-dimensional configurations. The flow field is simulated on the surface of a Butler wing in a uniform stream. Results are presented for Mach number 3.5 and a Reynolds number of 2,000,000. The O-type and H-type grids have been used for this study, and the results are compared together and with other theoretical and experimental results. The results demonstrate that while the H-type grid is suitable for the leading and trailing edges, a more accurate solution can be obtained for the middle part of the wing with an O-type grid. In the second part of this study, methods of grid adaption are reviewed and a method is developed with the capability of adapting to several variables. This method is based on a variational approach and is an algebraic method. Also, the method has been formulated in such a way that there is no need for any matrix inversion. This method is used in conjunction with the calculation of hypersonic flow over a blunt-nose body. A movie has been produced which shows simultaneously the transient behavior of the solution and the grid adaption.

  5. Grid adaptation and remapping for arbitrary lagrangian eulerian (ALE) methods

    SciTech Connect

    Lapenta, G. M.

    2002-01-01

    Methods to include automatic grid adaptation tools within the Arbitrary Lagrangian Eulerian (ALE) method are described. Two main developments will be described. First, a new grid adaptation approach is described, based on an automatic and accurate estimate of the local truncation error. Second, a new method to remap the information between two grids is presented, based on the MPDATA approach. The Arbitrary Lagrangian Eulerian (ALE) method solves hyperbolic equations by splitting the operators is two phases. First, in the Lagrangian phase, the equations under consideration are written in a Lagrangian frame and are discretized. In this phase, the grid moves with the solution, the velocity of each node being the local fluid velocity. Second, in the Eulerian phase, a new grid is generated and the information is transferred to the new grid. The advantage of considering this second step is the possibility of avoiding mesh distortion and tangling typical of pure Lagrangian methods. The second phase of the ALE method is the primary topic of the present communication. In the Eulerian phase two tasks need to be completed. First, a new grid need to be created (we will refer to this task as rezoning). Second, the information is transferred from the grid available at the end of the Lagrangian phase to the new grid (we will refer to this task as remapping). New techniques are presented for the two tasks of the Eulerian phase: rezoning and remapping.

  6. 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.

  7. Efficient Unstructured Grid Adaptation Methods for Sonic Boom Prediction

    NASA Technical Reports Server (NTRS)

    Campbell, Richard L.; Carter, Melissa B.; Deere, Karen A.; Waithe, Kenrick A.

    2008-01-01

    This paper examines the use of two grid adaptation methods to improve the accuracy of the near-to-mid field pressure signature prediction of supersonic aircraft computed using the USM3D unstructured grid flow solver. The first method (ADV) is an interactive adaptation process that uses grid movement rather than enrichment to more accurately resolve the expansion and compression waves. The second method (SSGRID) uses an a priori adaptation approach to stretch and shear the original unstructured grid to align the grid with the pressure waves and reduce the cell count required to achieve an accurate signature prediction at a given distance from the vehicle. Both methods initially create negative volume cells that are repaired in a module in the ADV code. While both approaches provide significant improvements in the near field signature (< 3 body lengths) relative to a baseline grid without increasing the number of grid points, only the SSGRID approach allows the details of the signature to be accurately computed at mid-field distances (3-10 body lengths) for direct use with mid-field-to-ground boom propagation codes.

  8. Methods for prismatic/tetrahedral grid generation and adaptation

    NASA Astrophysics Data System (ADS)

    Kallinderis, Y.

    1995-10-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.

  9. Three-dimensional adaptive grid-embedding Euler technique

    NASA Astrophysics Data System (ADS)

    Davis, Roger L.; Dannenhoffer, John F., III

    1994-06-01

    A new three-dimensional adaptive-grid Euler procedure is presented that automatically detects high-gradient regions in the flow and locally subdivides the computational grid in these regions to provide a uniform, high level of accuracy over the entire domain. A tunable, semistructured data system is utilized that provides global topological unstructured-grid flexibility along with the efficiency of a local, structured-grid system. In addition, this structure data allows for the flow solution algorithm to be executed on a wide variety of parallel/vector computing platforms. An explicit, time-marching, control volume procedure is used to integrate the Euler equations to a steady state. In addition, a multiple-grid procedure is used throughout the embedded-grid regions as well as on subgrids coarser than the initial grid to accelerate convergence and properly propagate disturbance waves through refined-grid regions. Upon convergence, high flow gradient regions, where it is assumed that large truncation errors in the solution exist, are detected using a combination of directional refinement vectors that have large components in areas of these gradients. The local computational grid is directionally subdivided in these regions and the flow solution is reinitiated. Overall convergence occurs when a prespecified level of accuracy is reached. Solutions are presented that demonstrate the efficiency and accuracy of the present procedure.

  10. SAGE: The Self-Adaptive Grid Code. 3

    NASA Technical Reports Server (NTRS)

    Davies, Carol B.; Venkatapathy, Ethiraj

    1999-01-01

    The multi-dimensional self-adaptive grid code, SAGE, is an important tool in the field of computational fluid dynamics (CFD). It provides an efficient method to improve the accuracy of flow solutions while simultaneously reducing computer processing time. Briefly, SAGE enhances an initial computational grid by redistributing the mesh points into more appropriate locations. The movement of these points is driven by an equal-error-distribution algorithm that utilizes the relationship between high flow gradients and excessive solution errors. The method also provides a balance between clustering points in the high gradient regions and maintaining the smoothness and continuity of the adapted grid, The latest version, Version 3, includes the ability to change the boundaries of a given grid to more efficiently enclose flow structures and provides alternative redistribution algorithms.

  11. An adaptive grid algorithm for one-dimensional nonlinear equations

    NASA Technical Reports Server (NTRS)

    Gutierrez, William E.; Hills, Richard G.

    1990-01-01

    Richards' equation, which models the flow of liquid through unsaturated porous media, is highly nonlinear and difficult to solve. Step gradients in the field variables require the use of fine grids and small time step sizes. The numerical instabilities caused by the nonlinearities often require the use of iterative methods such as Picard or Newton interation. These difficulties result in large CPU requirements in solving Richards equation. With this in mind, adaptive and multigrid methods are investigated for use with nonlinear equations such as Richards' equation. Attention is focused on one-dimensional transient problems. To investigate the use of multigrid and adaptive grid methods, a series of problems are studied. First, a multigrid program is developed and used to solve an ordinary differential equation, demonstrating the efficiency with which low and high frequency errors are smoothed out. The multigrid algorithm and an adaptive grid algorithm is used to solve one-dimensional transient partial differential equations, such as the diffusive and convective-diffusion equations. The performance of these programs are compared to that of the Gauss-Seidel and tridiagonal methods. The adaptive and multigrid schemes outperformed the Gauss-Seidel algorithm, but were not as fast as the tridiagonal method. The adaptive grid scheme solved the problems slightly faster than the multigrid method. To solve nonlinear problems, Picard iterations are introduced into the adaptive grid and tridiagonal methods. Burgers' equation is used as a test problem for the two algorithms. Both methods obtain solutions of comparable accuracy for similar time increments. For the Burgers' equation, the adaptive grid method finds the solution approximately three times faster than the tridiagonal method. Finally, both schemes are used to solve the water content formulation of the Richards' equation. For this problem, the adaptive grid method obtains a more accurate solution in fewer work units and

  12. ICASE/LaRC Workshop on Adaptive Grid Methods

    NASA Technical Reports Server (NTRS)

    South, Jerry C., Jr. (Editor); Thomas, James L. (Editor); Vanrosendale, John (Editor)

    1995-01-01

    Solution-adaptive grid techniques are essential to the attainment of practical, user friendly, computational fluid dynamics (CFD) applications. In this three-day workshop, experts gathered together to describe state-of-the-art methods in solution-adaptive grid refinement, analysis, and implementation; to assess the current practice; and to discuss future needs and directions for research. This was accomplished through a series of invited and contributed papers. The workshop focused on a set of two-dimensional test cases designed by the organizers to aid in assessing the current state of development of adaptive grid technology. In addition, a panel of experts from universities, industry, and government research laboratories discussed their views of needs and future directions in this field.

  13. A Grid Sourcing and Adaptation Study Using Unstructured Grids for Supersonic Boom Prediction

    NASA Technical Reports Server (NTRS)

    Carter, Melissa B.; Deere, Karen A.

    2008-01-01

    NASA created the Supersonics Project as part of the NASA Fundamental Aeronautics Program to advance technology that will make a supersonic flight over land viable. Computational flow solvers have lacked the ability to accurately predict sonic boom from the near to far field. The focus of this investigation was to establish gridding and adaptation techniques to predict near-to-mid-field (<10 body lengths below the aircraft) boom signatures at supersonic speeds using the USM3D unstructured grid flow solver. The study began by examining sources along the body the aircraft, far field sourcing and far field boundaries. The study then examined several techniques for grid adaptation. During the course of the study, volume sourcing was introduced as a new way to source grids using the grid generation code VGRID. Two different methods of using the volume sources were examined. The first method, based on manual insertion of the numerous volume sources, made great improvements in the prediction capability of USM3D for boom signatures. The second method (SSGRID), which uses an a priori adaptation approach to stretch and shear the original unstructured grid to align the grid and pressure waves, showed similar results with a more automated approach. Due to SSGRID s results and ease of use, the rest of the study focused on developing a best practice using SSGRID. The best practice created by this study for boom predictions using the CFD code USM3D involved: 1) creating a small cylindrical outer boundary either 1 or 2 body lengths in diameter (depending on how far below the aircraft the boom prediction is required), 2) using a single volume source under the aircraft, and 3) using SSGRID to stretch and shear the grid to the desired length.

  14. Adaptive hybrid prismatic-tetrahedral grids for viscous flows

    NASA Technical Reports Server (NTRS)

    Kallinderis, Yannis; Khawaja, Aly; Mcmorris, Harlan

    1995-01-01

    The paper presents generation of adaptive 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 an Automatic Receding Method (ARM) 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 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 division of tetrahedra, as well as 2-D directional division of prisms.

  15. Adaptive hybrid prismatic-tetrahedral grids for viscous flows

    NASA Astrophysics Data System (ADS)

    Kallinderis, Yannis; Khawaja, Aly; McMorris, Harlan

    1995-03-01

    The paper presents generation of adaptive 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 an Automatic Receding Method (ARM) 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 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 division of tetrahedra, as well as 2-D directional division of prisms.

  16. A simplified self-adaptive grid method, SAGE

    NASA Technical Reports Server (NTRS)

    Davies, C.; Venkatapathy, E.

    1989-01-01

    The formulation of the Self-Adaptive Grid Evolution (SAGE) code, based on the work of Nakahashi and Deiwert, is described in the first section of this document. The second section is presented in the form of a user guide which explains the input and execution of the code, and provides many examples. Application of the SAGE code, by Ames Research Center and by others, in the solution of various flow problems has been an indication of the code's general utility and success. Although the basic formulation follows the method of Nakahashi and Deiwert, many modifications have been made to facilitate the use of the self-adaptive grid method for single, zonal, and multiple grids. Modifications to the methodology and the simplified input options make this current version a flexible and user-friendly code.

  17. A novel hyperbolic grid generation procedure with inherent adaptive dissipation

    SciTech Connect

    Tai, C.H.; Yin, S.L.; Soong, C.Y.

    1995-01-01

    This paper reports a novel hyperbolic grid-generation with an inherent adaptive dissipation (HGAD), which is capable of improving the oscillation and overlapping of grid lines. In the present work upwinding differencing is applied to discretize the hyperbolic system and, thereby, to develop the adaptive dissipation coefficient. Complex configurations with the features of geometric discontinuity, exceptional concavity and convexity are used as the test cases for comparison of the present HGAD procedure with the conventional hyerbolic and elliptic ones. The results reveal that the HGAD method is superior in orthogonality and smoothness of the grid system. In addition, the computational efficiency of the flow solver may be improved by using the present HGAD procedure. 15 refs., 8 figs.

  18. The multidimensional Self-Adaptive Grid code, SAGE, version 2

    NASA Technical Reports Server (NTRS)

    Davies, Carol B.; Venkatapathy, Ethiraj

    1995-01-01

    This new report on Version 2 of the SAGE code includes all the information in the original publication plus all upgrades and changes to the SAGE code since that time. The two most significant upgrades are the inclusion of a finite-volume option and the ability to adapt and manipulate zonal-matching multiple-grid files. In addition, the original SAGE code has been upgraded to Version 1.1 and includes all options mentioned in this report, with the exception of the multiple grid option and its associated features. Since Version 2 is a larger and more complex code, it is suggested (but not required) that Version 1.1 be used for single-grid applications. This document contains all the information required to run both versions of SAGE. The formulation of the adaption method is described in the first section of this document. The second section is presented in the form of a user guide that explains the input and execution of the code. The third section provides many examples. Successful application of the SAGE code in both two and three dimensions for the solution of various flow problems has proven the code to be robust, portable, and simple to use. Although the basic formulation follows the method of Nakahashi and Deiwert, many modifications have been made to facilitate the use of the self-adaptive grid method for complex grid structures. Modifications to the method and the simple but extensive input options make this a flexible and user-friendly code. The SAGE code can accommodate two-dimensional and three-dimensional, finite-difference and finite-volume, single grid, and zonal-matching multiple grid flow problems.

  19. Adaptive grids and implicit differencing applied to plasma simulation

    SciTech Connect

    Brackbill, J.U.; Forslund, D.W.; Vu, Hoanh.

    1990-01-01

    To understand the kinetic processes that determine energy confinement and impurity production in magnetic confinement experiments, we are developing methods to model kinetic effects on magnetohydrodynamic time scales in realistic geometries. We are using implicit methods and adaptive grids to achieve this goal. 9 refs., 2 figs.

  20. Three-dimensional Navier-Stokes calculations using solution-adapted grids

    NASA Technical Reports Server (NTRS)

    Henderson, T. L.; Huang, W.; Lee, K. D.; Choo, Y. K.

    1993-01-01

    A three-dimensional solution-adaptive grid generation technique is presented. The adaptation technique redistributes grid points to improve the accuracy of a flow solution without increasing the number of grid points. It is applicable to structured grids with a multiblock topology. The method uses a numerical mapping and potential theory to modify the initial grid distribution based on the properties of the flow solution on the initial grid. The technique is demonstrated with two examples - a transonic finite wing and a supersonic blunt fin. The advantages are shown by comparing flow solutions on the adapted grids with those on the initial grids.

  1. Efficient Load Balancing and Data Remapping for Adaptive Grid Calculations

    NASA Technical Reports Server (NTRS)

    Oliker, Leonid; Biswas, Rupak

    1997-01-01

    Mesh adaption is a powerful tool for efficient unstructured- grid computations but causes load imbalance among processors on a parallel machine. We present a novel method to dynamically balance the processor workloads with a global view. This paper presents, for the first time, the implementation and integration of all major components within our dynamic load balancing strategy for adaptive grid calculations. Mesh adaption, repartitioning, processor assignment, and remapping are critical components of the framework that must be accomplished rapidly and efficiently so as not to cause a significant overhead to the numerical simulation. Previous results indicated that mesh repartitioning and data remapping are potential bottlenecks for performing large-scale scientific calculations. We resolve these issues and demonstrate that our framework remains viable on a large number of processors.

  2. Error sensitivity to refinement: a criterion for optimal grid adaptation

    NASA Astrophysics Data System (ADS)

    Luchini, Paolo; Giannnetti, Flavio; Citro, Vincenzo

    2016-11-01

    Most indicators used for automatic grid refinement are suboptimal, in the sense that they do not really minimize the global solution error. This paper concerns with a new indicator, related to the sensitivity map of global stability problems, suitable for an optimal grid refinement that minimizes the global solution error. The new criterion is derived from the properties of the adjoint operator and provides a map of the sensitivity of the global error (or its estimate) to a local mesh refinement. Examples are presented for both a scalar partial differential equation and for the system of Navier-Stokes equations. In the last case, we also present a grid-adaptation algorithm based on the new estimator and on the FreeFem++ software that improves the accuracy of the solution of almost two order of magnitude by redistributing the nodes of the initial computational mesh.

  3. Solution adaptive grids applied to low Reynolds number flow

    NASA Astrophysics Data System (ADS)

    de With, G.; Holdø, A. E.; Huld, T. A.

    2003-08-01

    A numerical study has been undertaken to investigate the use of a solution adaptive grid for flow around a cylinder in the laminar flow regime. The main purpose of this work is twofold. The first aim is to investigate the suitability of a grid adaptation algorithm and the reduction in mesh size that can be obtained. Secondly, the uniform asymmetric flow structures are ideal to validate the mesh structures due to mesh refinement and consequently the selected refinement criteria. The refinement variable used in this work is a product of the rate of strain and the mesh cell size, and contains two variables Cm and Cstr which determine the order of each term. By altering the order of either one of these terms the refinement behaviour can be modified.

  4. On the dynamics of some grid adaption schemes

    NASA Technical Reports Server (NTRS)

    Sweby, Peter K.; Yee, Helen C.

    1994-01-01

    The dynamics of a one-parameter family of mesh equidistribution schemes coupled with finite difference discretisations of linear and nonlinear convection-diffusion model equations is studied numerically. It is shown that, when time marched to steady state, the grid adaption not only influences the stability and convergence rate of the overall scheme, but can also introduce spurious dynamics to the numerical solution procedure.

  5. Adaptive grid methods for RLV environment assessment and nozzle analysis

    NASA Technical Reports Server (NTRS)

    Thornburg, Hugh J.

    1996-01-01

    Rapid access to highly accurate data about complex configurations is needed for multi-disciplinary optimization and design. In order to efficiently meet these requirements a closer coupling between the analysis algorithms and the discretization process is needed. In some cases, such as free surface, temporally varying geometries, and fluid structure interaction, the need is unavoidable. In other cases the need is to rapidly generate and modify high quality grids. Techniques such as unstructured and/or solution-adaptive methods can be used to speed the grid generation process and to automatically cluster mesh points in regions of interest. Global features of the flow can be significantly affected by isolated regions of inadequately resolved flow. These regions may not exhibit high gradients and can be difficult to detect. Thus excessive resolution in certain regions does not necessarily increase the accuracy of the overall solution. Several approaches have been employed for both structured and unstructured grid adaption. The most widely used involve grid point redistribution, local grid point enrichment/derefinement or local modification of the actual flow solver. However, the success of any one of these methods ultimately depends on the feature detection algorithm used to determine solution domain regions which require a fine mesh for their accurate representation. Typically, weight functions are constructed to mimic the local truncation error and may require substantial user input. Most problems of engineering interest involve multi-block grids and widely disparate length scales. Hence, it is desirable that the adaptive grid feature detection algorithm be developed to recognize flow structures of different type as well as differing intensity, and adequately address scaling and normalization across blocks. These weight functions can then be used to construct blending functions for algebraic redistribution, interpolation functions for unstructured grid generation

  6. Unstructured Adaptive Grid Computations on an Array of SMPs

    NASA Technical Reports Server (NTRS)

    Biswas, Rupak; Pramanick, Ira; Sohn, Andrew; Simon, Horst D.

    1996-01-01

    Dynamic load balancing is necessary for parallel adaptive methods to solve unsteady CFD problems on unstructured grids. We have presented such a dynamic load balancing framework called JOVE, in this paper. Results on a four-POWERnode POWER CHALLENGEarray demonstrated that load balancing gives significant performance improvements over no load balancing for such adaptive computations. The parallel speedup of JOVE, implemented using MPI on the POWER CHALLENCEarray, was significant, being as high as 31 for 32 processors. An implementation of JOVE that exploits 'an array of SMPS' architecture was also studied; this hybrid JOVE outperformed flat JOVE by up to 28% on the meshes and adaption models tested. With large, realistic meshes and actual flow-solver and adaption phases incorporated into JOVE, hybrid JOVE can be expected to yield significant advantage over flat JOVE, especially as the number of processors is increased, thus demonstrating the scalability of an array of SMPs architecture.

  7. Adaptive all the way down: building responsive materials from hierarchies of chemomechanical feedback.

    PubMed

    Grinthal, Alison; Aizenberg, Joanna

    2013-09-07

    A living organism is a bundle of dynamic, integrated adaptive processes: not only does it continuously respond to constant changes in temperature, sunlight, nutrients, and other features of its environment, but it does so by coordinating hierarchies of feedback among cells, tissues, organs, and networks all continuously adapting to each other. At the root of it all is one of the most fundamental adaptive processes: the constant tug of war between chemistry and mechanics that interweaves chemical signals with endless reconfigurations of macromolecules, fibers, meshworks, and membranes. In this tutorial we explore how such chemomechanical feedback - as an inherently dynamic, iterative process connecting size and time scales - can and has been similarly evoked in synthetic materials to produce a fascinating diversity of complex multiscale responsive behaviors. We discuss how chemical kinetics and architecture can be designed to generate stimulus-induced 3D spatiotemporal waves and topographic patterns within a single bulk material, and how feedback between interior dynamics and surface-wide instabilities can further generate higher order buckling and wrinkling patterns. Building on these phenomena, we show how yet higher levels of feedback and spatiotemporal complexity can be programmed into hybrid materials, and how these mechanisms allow hybrid materials to be further integrated into multicompartmental systems capable of hierarchical chemo-mechano-chemical feedback responses. These responses no doubt represent only a small sample of the chemomechanical feedback behaviors waiting to be discovered in synthetic materials, and enable us to envision nearly limitless possibilities for designing multiresponsive, multifunctional, self-adapting materials and systems.

  8. A geometry-based adaptive unstructured grid generation algorithm for complex geological media

    NASA Astrophysics Data System (ADS)

    Bahrainian, Seyed Saied; Dezfuli, Alireza Daneh

    2014-07-01

    In this paper a novel unstructured grid generation algorithm is presented that considers the effect of geological features and well locations in grid resolution. The proposed grid generation algorithm presents a strategy for definition and construction of an initial grid based on the geological model, geometry adaptation of geological features, and grid resolution control. The algorithm is applied to seismotectonic map of the Masjed-i-Soleiman reservoir. Comparison of grid results with the “Triangle” program shows a more suitable permeability contrast. Immiscible two-phase flow solutions are presented for a fractured porous media test case using different grid resolutions. Adapted grid on the fracture geometry gave identical results with that of a fine grid. The adapted grid employed 88.2% less CPU time when compared to the solutions obtained by the fine grid.

  9. Parallel architectures for iterative methods on adaptive, block structured grids

    NASA Technical Reports Server (NTRS)

    Gannon, D.; Vanrosendale, J.

    1983-01-01

    A parallel computer architecture well suited to the solution of partial differential equations in complicated geometries is proposed. Algorithms for partial differential equations contain a great deal of parallelism. But this parallelism can be difficult to exploit, particularly on complex problems. One approach to extraction of this parallelism is the use of special purpose architectures tuned to a given problem class. The architecture proposed here is tuned to boundary value problems on complex domains. An adaptive elliptic algorithm which maps effectively onto the proposed architecture is considered in detail. Two levels of parallelism are exploited by the proposed architecture. First, by making use of the freedom one has in grid generation, one can construct grids which are locally regular, permitting a one to one mapping of grids to systolic style processor arrays, at least over small regions. All local parallelism can be extracted by this approach. Second, though there may be a regular global structure to the grids constructed, there will be parallelism at this level. One approach to finding and exploiting this parallelism is to use an architecture having a number of processor clusters connected by a switching network. The use of such a network creates a highly flexible architecture which automatically configures to the problem being solved.

  10. The multidimensional self-adaptive grid code, SAGE

    NASA Technical Reports Server (NTRS)

    Davies, Carol B.; Venkatapathy, Ethiraj

    1992-01-01

    This report describes the multidimensional self-adaptive grid code SAGE. A two-dimensional version of this code was described in an earlier report by the authors. The formulation of the multidimensional version is described in the first section of this document. The second section is presented in the form of a user guide that explains the input and execution of the code and provides many examples. Successful application of the SAGE code in both two and three dimensions for the solution of various flow problems has proven the code to be robust, portable, and simple to use. Although the basic formulation follows the method of Nakahashi and Deiwert, many modifications have been made to facilitate the use of the self-adaptive grid method for complex grid structures. Modifications to the method and the simplified input options make this a flexible and user-friendly code. The new SAGE code can accommodate both two-dimensional and three-dimensional flow problems.

  11. OMEGA: The operational multiscale environment model with grid adaptivity

    SciTech Connect

    Bacon, D.P.

    1995-07-01

    This review talk describes the OMEGA code, used for weather simulation and the modeling of aerosol transport through the atmosphere. Omega employs a 3D mesh of wedge shaped elements (triangles when viewed from above) that adapt with time. Because wedges are laid out in layers of triangular elements, the scheme can utilize structured storage and differencing techniques along the elevation coordinate, and is thus a hybrid of structured and unstructured methods. The utility of adaptive gridding in this moded, near geographic features such as coastlines, where material properties change discontinuously, is illustrated. Temporal adaptivity was used additionally to track moving internal fronts, such as clouds of aerosol contaminants. The author also discusses limitations specific to this problem, including manipulation of huge data bases and fixed turn-around times. In practice, the latter requires a carefully tuned optimization between accuracy and computation speed.

  12. Load Balancing Unstructured Adaptive Grids for CFD Problems

    NASA Technical Reports Server (NTRS)

    Biswas, Rupak; Oliker, Leonid

    1996-01-01

    Mesh adaption is a powerful tool for efficient unstructured-grid computations but causes load imbalance among processors on a parallel machine. A dynamic load balancing method is presented that balances the workload across all processors with a global view. After each parallel tetrahedral mesh adaption, the method first determines if the new mesh is sufficiently unbalanced to warrant a repartitioning. If so, the adapted mesh is repartitioned, with new partitions assigned to processors so that the redistribution cost is minimized. The new partitions are accepted only if the remapping cost is compensated by the improved load balance. Results indicate that this strategy is effective for large-scale scientific computations on distributed-memory multiprocessors.

  13. A Solution Adaptive Technique Using Tetrahedral Unstructured Grids

    NASA Technical Reports Server (NTRS)

    Pirzadeh, Shahyar Z.

    2000-01-01

    An adaptive unstructured grid refinement technique has been developed and successfully applied to several three dimensional inviscid flow test cases. The method is based on a combination of surface mesh subdivision and local remeshing of the volume grid Simple functions of flow quantities are employed to detect dominant features of the flowfield The method is designed for modular coupling with various error/feature analyzers and flow solvers. Several steady-state, inviscid flow test cases are presented to demonstrate the applicability of the method for solving practical three-dimensional problems. In all cases, accurate solutions featuring complex, nonlinear flow phenomena such as shock waves and vortices have been generated automatically and efficiently.

  14. An improved bi-level algorithm for partitioning dynamic grid hierarchies.

    SciTech Connect

    Deiterding, Ralf (California Institute of Technology, Pasadena, CA); Johansson, Henrik (Uppsala University, Uppsala, Sweden); Steensland, Johan; Ray, Jaideep

    2006-05-01

    Structured adaptive mesh refinement methods are being widely used for computer simulations of various physical phenomena. Parallel implementations potentially offer realistic simulations of complex three-dimensional applications. But achieving good scalability for large-scale applications is non-trivial. Performance is limited by the partitioner's ability to efficiently use the underlying parallel computer's resources. Designed on sound SAMR principles, Nature+Fable is a hybrid, dedicated SAMR partitioning tool that brings together the advantages of both domain-based and patch-based techniques while avoiding their drawbacks. But the original bi-level partitioning approach in Nature+Fable is insufficient as it for realistic applications regards frequently occurring bi-levels as ''impossible'' and fails. This document describes an improved bi-level partitioning algorithm that successfully copes with all possible bi-levels. The improved algorithm uses the original approach side-by-side with a new, complementing approach. By using a new, customized classification method, the improved algorithm switches automatically between the two approaches. This document describes the algorithms, discusses implementation issues, and presents experimental results. The improved version of Nature+Fable was found to be able to handle realistic applications and also to generate less imbalances, similar box count, but more communication as compared to the native, domain-based partitioner in the SAMR framework AMROC.

  15. 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.

  16. A Domain-Decomposed Multilevel Method for Adaptively Refined Cartesian Grids with Embedded Boundaries

    NASA Technical Reports Server (NTRS)

    Aftosmis, M. J.; Berger, M. J.; Adomavicius, G.

    2000-01-01

    Preliminary verification and validation of an efficient Euler solver for adaptively refined Cartesian meshes with embedded boundaries is presented. The parallel, multilevel method makes use of a new on-the-fly parallel domain decomposition strategy based upon the use of space-filling curves, and automatically generates a sequence of coarse meshes for processing by the multigrid smoother. The coarse mesh generation algorithm produces grids which completely cover the computational domain at every level in the mesh hierarchy. A series of examples on realistically complex three-dimensional configurations demonstrate that this new coarsening algorithm reliably achieves mesh coarsening ratios in excess of 7 on adaptively refined meshes. Numerical investigations of the scheme's local truncation error demonstrate an achieved order of accuracy between 1.82 and 1.88. Convergence results for the multigrid scheme are presented for both subsonic and transonic test cases and demonstrate W-cycle multigrid convergence rates between 0.84 and 0.94. Preliminary parallel scalability tests on both simple wing and complex complete aircraft geometries shows a computational speedup of 52 on 64 processors using the run-time mesh partitioner.

  17. Adaptive sparse grid expansions of the vibrational Hamiltonian

    SciTech Connect

    Strobusch, D.; Scheurer, Ch.

    2014-02-21

    The vibrational Hamiltonian involves two high dimensional operators, the kinetic energy operator (KEO), and the potential energy surface (PES). Both must be approximated for systems involving more than a few atoms. Adaptive approximation schemes are not only superior to truncated Taylor or many-body expansions (MBE), they also allow for error estimates, and thus operators of predefined precision. To this end, modified sparse grids (SG) are developed that can be combined with adaptive MBEs. This MBE/SG hybrid approach yields a unified, fully adaptive representation of the KEO and the PES. Refinement criteria, based on the vibrational self-consistent field (VSCF) and vibrational configuration interaction (VCI) methods, are presented. The combination of the adaptive MBE/SG approach and the VSCF plus VCI methods yields a black box like procedure to compute accurate vibrational spectra. This is demonstrated on a test set of molecules, comprising water, formaldehyde, methanimine, and ethylene. The test set is first employed to prove convergence for semi-empirical PM3-PESs and subsequently to compute accurate vibrational spectra from CCSD(T)-PESs that agree well with experimental values.

  18. A robust adaptive load frequency control for micro-grids.

    PubMed

    Khooban, Mohammad-Hassan; Niknam, Taher; Blaabjerg, Frede; Davari, Pooya; Dragicevic, Tomislav

    2016-11-01

    The goal of this study is to introduce a novel robust load frequency control (LFC) strategy for micro-grid(s) (MG(s)) in islanded mode operation. Admittedly, power generators in MG(s) cannot supply steady electric power output and sometimes cause unbalance between supply and demand. Battery energy storage system (BESS) is one of the effective solutions to these problems. Due to the high cost of the BESS, a new idea of Vehicle-to-Grid (V2G) is that a battery of Electric-Vehicle (EV) can be applied as a tantamount large-scale BESS in MG(s). As a result, a new robust control strategy for an islanded micro-grid (MG) is introduced that can consider electric vehicles׳ (EV(s)) effect. Moreover, in this paper, a new combination of the General Type II Fuzzy Logic Sets (GT2FLS) and the Modified Harmony Search Algorithm (MHSA) technique is applied for adaptive tuning of proportional-integral (PI) controller. Implementing General Type II Fuzzy Systems is computationally expensive. However, using a recently introduced α-plane representation, GT2FLS can be seen as a composition of several Interval Type II Fuzzy Logic Systems (IT2FLS) with a corresponding level of α for each. Real-data from an offshore wind farm in Sweden and solar radiation data in Aberdeen (United Kingdom) was used in order to examine the performance of the proposed novel controller. A comparison is made between the achieved results of Optimal Fuzzy-PI (OFPI) controller and those of Optimal Interval Type II Fuzzy-PI (IT2FPI) controller, which are of most recent advances in the area at hand. The Simulation results prove the successfulness and effectiveness of the proposed controller.

  19. Anisotropic Solution Adaptive Unstructured Grid Generation Using AFLR

    NASA Technical Reports Server (NTRS)

    Marcum, David L.

    2007-01-01

    An existing volume grid generation procedure, AFLR3, was successfully modified to generate anisotropic tetrahedral elements using a directional metric transformation defined at source nodes. The procedure can be coupled with a solver and an error estimator as part of an overall anisotropic solution adaptation methodology. It is suitable for use with an error estimator based on an adjoint, optimization, sensitivity derivative, or related approach. This offers many advantages, including more efficient point placement along with robust and efficient error estimation. It also serves as a framework for true grid optimization wherein error estimation and computational resources can be used as cost functions to determine the optimal point distribution. Within AFLR3 the metric transformation is implemented using a set of transformation vectors and associated aspect ratios. The modified overall procedure is presented along with details of the anisotropic transformation implementation. Multiple two-and three-dimensional examples are also presented that demonstrate the capability of the modified AFLR procedure to generate anisotropic elements using a set of source nodes with anisotropic transformation metrics. The example cases presented use moderate levels of anisotropy and result in usable element quality. Future testing with various flow solvers and methods for obtaining transformation metric information is needed to determine practical limits and evaluate the efficacy of the overall approach.

  20. A wavelet-optimized, very high order adaptive grid and order numerical method

    NASA Technical Reports Server (NTRS)

    Jameson, Leland

    1996-01-01

    Differencing operators of arbitrarily high order can be constructed by interpolating a polynomial through a set of data followed by differentiation of this polynomial and finally evaluation of the polynomial at the point where a derivative approximation is desired. Furthermore, the interpolating polynomial can be constructed from algebraic, trigonometric, or, perhaps exponential polynomials. This paper begins with a comparison of such differencing operator construction. Next, the issue of proper grids for high order polynomials is addressed. Finally, an adaptive numerical method is introduced which adapts the numerical grid and the order of the differencing operator depending on the data. The numerical grid adaptation is performed on a Chebyshev grid. That is, at each level of refinement the grid is a Chebvshev grid and this grid is refined locally based on wavelet analysis.

  1. Three-dimensional adaptive grid generation for body-fitted coordinate system

    NASA Technical Reports Server (NTRS)

    Chen, S. C.

    1988-01-01

    This report describes a numerical method for generating 3-D grids for general configurations. The basic method involves the solution of a set of quasi-linear elliptic partial differential equations via pointwise relaxation with a local relaxation factor. It allows specification of the grid spacing off the boundary surfaces and the grid orthogonality at the boundary surfaces. It includes adaptive mechanisms to improve smoothness, orthogonality, and flow resolution in the grid interior.

  2. Adaptive 3D single-block grids for the computation of viscous flows around wings

    SciTech Connect

    Hagmeijer, R.; Kok, J.C.

    1996-12-31

    A robust algorithm for the adaption of a 3D single-block structured grid suitable for the computation of viscous flows around a wing is presented and demonstrated by application to the ONERA M6 wing. The effects of grid adaption on the flow solution and accuracy improvements is analyzed. Reynolds number variations are studied.

  3. FUN3D Grid Refinement and Adaptation Studies for the Ares Launch Vehicle

    NASA Technical Reports Server (NTRS)

    Bartels, Robert E.; Vasta, Veer; Carlson, Jan-Renee; Park, Mike; Mineck, Raymond E.

    2010-01-01

    This paper presents grid refinement and adaptation studies performed in conjunction with computational aeroelastic analyses of the Ares crew launch vehicle (CLV). The unstructured grids used in this analysis were created with GridTool and VGRID while the adaptation was performed using the Computational Fluid Dynamic (CFD) code FUN3D with a feature based adaptation software tool. GridTool was developed by ViGYAN, Inc. while the last three software suites were developed by NASA Langley Research Center. The feature based adaptation software used here operates by aligning control volumes with shock and Mach line structures and by refining/de-refining where necessary. It does not redistribute node points on the surface. This paper assesses the sensitivity of the complex flow field about a launch vehicle to grid refinement. It also assesses the potential of feature based grid adaptation to improve the accuracy of CFD analysis for a complex launch vehicle configuration. The feature based adaptation shows the potential to improve the resolution of shocks and shear layers. Further development of the capability to adapt the boundary layer and surface grids of a tetrahedral grid is required for significant improvements in modeling the flow field.

  4. A time-accurate adaptive grid method and the numerical simulation of a shock-vortex interaction

    NASA Technical Reports Server (NTRS)

    Bockelie, Michael J.; Eiseman, Peter R.

    1990-01-01

    A time accurate, general purpose, adaptive grid method is developed that is suitable for multidimensional steady and unsteady numerical simulations. The grid point movement is performed in a manner that generates smooth grids which resolve the severe solution gradients and the sharp transitions in the solution gradients. The temporal coupling of the adaptive grid and the PDE solver is performed with a grid prediction correction method that is simple to implement and ensures the time accuracy of the grid. Time accurate solutions of the 2-D Euler equations for an unsteady shock vortex interaction demonstrate the ability of the adaptive method to accurately adapt the grid to multiple solution features.

  5. Three-dimensional self-adaptive grid method for complex flows

    NASA Technical Reports Server (NTRS)

    Djomehri, M. Jahed; Deiwert, George S.

    1988-01-01

    A self-adaptive grid procedure for efficient computation of three-dimensional complex flow fields is described. The method is based on variational principles to minimize the energy of a spring system analogy which redistributes the grid points. Grid control parameters are determined by specifying maximum and minimum grid spacing. Multidirectional adaptation is achieved by splitting the procedure into a sequence of successive applications of a unidirectional adaptation. One-sided, two-directional constraints for orthogonality and smoothness are used to enhance the efficiency of the method. Feasibility of the scheme is demonstrated by application to a multinozzle, afterbody, plume flow field. Application of the algorithm for initial grid generation is illustrated by constructing a three-dimensional grid about a bump-like geometry.

  6. Cartesian Off-Body Grid Adaption for Viscous Time- Accurate Flow Simulation

    NASA Technical Reports Server (NTRS)

    Buning, Pieter G.; Pulliam, Thomas H.

    2011-01-01

    An improved solution adaption capability has been implemented in the OVERFLOW overset grid CFD code. Building on the Cartesian off-body approach inherent in OVERFLOW and the original adaptive refinement method developed by Meakin, the new scheme provides for automated creation of multiple levels of finer Cartesian grids. Refinement can be based on the undivided second-difference of the flow solution variables, or on a specific flow quantity such as vorticity. Coupled with load-balancing and an inmemory solution interpolation procedure, the adaption process provides very good performance for time-accurate simulations on parallel compute platforms. A method of using refined, thin body-fitted grids combined with adaption in the off-body grids is presented, which maximizes the part of the domain subject to adaption. Two- and three-dimensional examples are used to illustrate the effectiveness and performance of the adaption scheme.

  7. Introducing Enabling Computational Tools to the Climate Sciences: Multi-Resolution Climate Modeling with Adaptive Cubed-Sphere Grids

    SciTech Connect

    Jablonowski, Christiane

    2015-07-14

    The research investigates and advances strategies how to bridge the scale discrepancies between local, regional and global phenomena in climate models without the prohibitive computational costs of global cloud-resolving simulations. In particular, the research explores new frontiers in computational geoscience by introducing high-order Adaptive Mesh Refinement (AMR) techniques into climate research. AMR and statically-adapted variable-resolution approaches represent an emerging trend for atmospheric models and are likely to become the new norm in future-generation weather and climate models. The research advances the understanding of multi-scale interactions in the climate system and showcases a pathway how to model these interactions effectively with advanced computational tools, like the Chombo AMR library developed at the Lawrence Berkeley National Laboratory. The research is interdisciplinary and combines applied mathematics, scientific computing and the atmospheric sciences. In this research project, a hierarchy of high-order atmospheric models on cubed-sphere computational grids have been developed that serve as an algorithmic prototype for the finite-volume solution-adaptive Chombo-AMR approach. The foci of the investigations have lied on the characteristics of both static mesh adaptations and dynamically-adaptive grids that can capture flow fields of interest like tropical cyclones. Six research themes have been chosen. These are (1) the introduction of adaptive mesh refinement techniques into the climate sciences, (2) advanced algorithms for nonhydrostatic atmospheric dynamical cores, (3) an assessment of the interplay between resolved-scale dynamical motions and subgrid-scale physical parameterizations, (4) evaluation techniques for atmospheric model hierarchies, (5) the comparison of AMR refinement strategies and (6) tropical cyclone studies with a focus on multi-scale interactions and variable-resolution modeling. The results of this research project

  8. Analysis of a Major Electric Grid -- Stability and Adaptive Protection

    NASA Astrophysics Data System (ADS)

    Alanzi, Sultan

    Protective systems of the electric grid are designed to detect and mitigate the effects of faults and other disturbances that may occur. Distance relays are used extensively for the detection of faults on transmission lines. Out-of-step relays are used for generator protection to detect loss of synchronism conditions that result from disturbances on the electric grid. Also, when a disturbance occurs and generators may tend to lose synchronism with each other, it is beneficial to separate the overall system into several independent systems that can remain stable. Unfortunately there have been cases, such as the 2003 Northeast blackout where the operation of protective relays, namely the zone 3 distance relay used for transmission line protection, contributed to the cascading effect of the blackout. It is the objective of this dissertation to propose adaptive relays for both distance protection of transmission lines and out-of-step protection of generators. By being adaptive, the relays are made aware of the system operating conditions and can adjust its settings accordingly. Inputs to the adaptive logic can come from system or environmental conditions. As a result of this effort, a new distance relay operating characteristic is proposed, referred to as a mushroom relay, which is a combination of a quadrilateral relay and a Mho relay. Also, a new criterion for determining if a power swing following a disturbance is stable or unstable is proposed. Distance protection of transmission lines is very important when discussing system responses to faults and disturbances. Distance relays are very common worldwide and although they offer great protection, there are limitations that need to be addressed. Parallel line operations (infeed effect) and the loadability limits are among the limitations that lead to improper response of relays. An Adaptive Distance Relays (ADR) offer great benefits to the protection scheme as their settings can be changed in accordance with prefault

  9. Automated Grid Disruption Response System: Robust Adaptive Topology Control (RATC)

    SciTech Connect

    2012-03-01

    GENI Project: The RATC research team is using topology control as a mechanism to improve system operations and manage disruptions within the electric grid. The grid is subject to interruption from cascading faults caused by extreme operating conditions, malicious external attacks, and intermittent electricity generation from renewable energy sources. The RATC system is capable of detecting, classifying, and responding to grid disturbances by reconfiguring the grid in order to maintain economically efficient operations while guaranteeing reliability. The RATC system would help prevent future power outages, which account for roughly $80 billion in losses for businesses and consumers each year. Minimizing the time it takes for the grid to respond to expensive interruptions will also make it easier to integrate intermittent renewable energy sources into the grid.

  10. A multigrid method for steady Euler equations on unstructured adaptive grids

    NASA Technical Reports Server (NTRS)

    Riemslagh, Kris; Dick, Erik

    1993-01-01

    A flux-difference splitting type algorithm is formulated for the steady Euler equations on unstructured grids. The polynomial flux-difference splitting technique is used. A vertex-centered finite volume method is employed on a triangular mesh. The multigrid method is in defect-correction form. A relaxation procedure with a first order accurate inner iteration and a second-order correction performed only on the finest grid, is used. A multi-stage Jacobi relaxation method is employed as a smoother. Since the grid is unstructured a Jacobi type is chosen. The multi-staging is necessary to provide sufficient smoothing properties. The domain is discretized using a Delaunay triangular mesh generator. Three grids with more or less uniform distribution of nodes but with different resolution are generated by successive refinement of the coarsest grid. Nodes of coarser grids appear in the finer grids. The multigrid method is started on these grids. As soon as the residual drops below a threshold value, an adaptive refinement is started. The solution on the adaptively refined grid is accelerated by a multigrid procedure. The coarser multigrid grids are generated by successive coarsening through point removement. The adaption cycle is repeated a few times. Results are given for the transonic flow over a NACA-0012 airfoil.

  11. Aeroacoustic Simulation of Nose Landing Gear on Adaptive Unstructured Grids With FUN3D

    NASA Technical Reports Server (NTRS)

    Vatsa, Veer N.; Khorrami, Mehdi R.; Park, Michael A.; Lockhard, David P.

    2013-01-01

    Numerical simulations have been performed for a partially-dressed, cavity-closed nose landing gear configuration that was tested in NASA Langley s closed-wall Basic Aerodynamic Research Tunnel (BART) and in the University of Florida's open-jet acoustic facility known as the UFAFF. The unstructured-grid flow solver FUN3D, developed at NASA Langley Research center, is used to compute the unsteady flow field for this configuration. Starting with a coarse grid, a series of successively finer grids were generated using the adaptive gridding methodology available in the FUN3D code. A hybrid Reynolds-averaged Navier-Stokes/large eddy simulation (RANS/LES) turbulence model is used for these computations. Time-averaged and instantaneous solutions obtained on these grids are compared with the measured data. In general, the correlation with the experimental data improves with grid refinement. A similar trend is observed for sound pressure levels obtained by using these CFD solutions as input to a FfowcsWilliams-Hawkings noise propagation code to compute the farfield noise levels. In general, the numerical solutions obtained on adapted grids compare well with the hand-tuned enriched fine grid solutions and experimental data. In addition, the grid adaption strategy discussed here simplifies the grid generation process, and results in improved computational efficiency of CFD simulations.

  12. SIMULATION OF DISPERSION OF A POWER PLANT PLUME USING AN ADAPTIVE GRID ALGORITHM

    EPA Science Inventory

    A new dynamic adaptive grid algorithm has been developed for use in air quality modeling. This algorithm uses a higher order numerical scheme?the piecewise parabolic method (PPM)?for computing advective solution fields; a weight function capable of promoting grid node clustering ...

  13. Adaptive Grid Generation for Numerical Solution of Partial Differential Equations.

    DTIC Science & Technology

    1983-12-01

    RETURN 65 Bibliography 1. Thompson , J . F ., "A Survey of Grid Generation Tecniques in Computational Fluid Dynamics," AIAA Paper No. 83-0447, 1-36...edited by K. N. Ghia and U. Ghia. ASME FED, 5: 35-47 (1983). 3. Thompson , J . F ., Thames, F. C., and Mastin, C. W., "Automated Numerical Generation...Equations," Numerical Grid Generation, Edited by J. F. Thompson. New York: North Holland, 1982. 10. Thompson , J . F ., and Mastin, C. W., "Grid Generation

  14. Adaptive Energy Forecasting and Information Diffusion for Smart Power Grids

    SciTech Connect

    Simmhan, Yogesh; Agarwal, Vaibhav; Aman, Saim; Kumbhare, Alok; Natarajan, Sreedhar; Rajguru, Nikhil; Robinson, Ian; Stevens, Samuel; Yin, Wei; Zhou, Qunzhi; Prasanna, Viktor

    2012-05-16

    Smart Power Grids exemplify an emerging class of Cyber Physical Applications that exhibit dynamic, distributed and data intensive (D3) characteristics along with an always-on paradigm to support operational needs. Smart Grids are an outcome of instrumentation, such as Phasor Measurement Units and Smart Power Meters, that is being deployed across the transmission and distribution network of electric grids. These sensors provide utilities with improved situation awareness on near-realtime electricity usage by individual consumers, and the power quality and stability of the transmission network.

  15. An adaptive remeshing scheme for vortex dominated flows using three-dimensional unstructured grids

    NASA Astrophysics Data System (ADS)

    Parikh, Paresh

    1995-10-01

    An adaptive remeshing procedure for vortex dominated flows is described, which uses three-dimensional unstructured grids. Surface grid adaptation is achieved using the static pressure as an adaptation parameter, while entropy is used in the field to accurately identify high vorticity regions. An emphasis has been placed in making the scheme as automatic as possible so that a minimum user interaction is required between remeshing cycles. Adapted flow solutions are obtained on two sharp-edged configurations at low speed, high angle-of-attack flow conditions. The results thus obtained are compared with fine grid CFD solutions and experimental data, and conclusions are drawn as to the efficiency of the adaptive procedure.

  16. Adaptivity via mesh movement with three-dimensional block-structured grids

    SciTech Connect

    Catherall, D.

    1996-12-31

    The method described here is one in which grid nodes are redistributed so that they are attracted towards regions of high solution activity. The major difficulty in attempting this arises from the degree of grid smoothness and orthogonality required by the flow solver. These requirements are met by suitable choice of grid equations, to be satisfied by the adapted grid, and by the inclusion of certain source terms, for added control in regions where grid movement is limited by the local geometry. The method has been coded for multiblock grids, so that complex configurations may be treated. It is demonstrated here for inviscid supercritical flow with two test cases: an ONERA M6 wing with a rounded tip, and a forward-swept wing/fuselage configuration (M151).

  17. A well-balanced numerical scheme for shallow water simulation on adaptive grids

    NASA Astrophysics Data System (ADS)

    Zhang, H. J.; Zhou, J. Z.; Bi, S.; Li, Q. Q.; Fan, Y.

    2014-04-01

    The efficiency of solving two-dimensional shallow-water equations (SWEs) is vital for simulation of large-scale flood inundation. For flood flows over real topography, local high-resolution method, which uses adaptable grids, is required in order to prevent the loss of accuracy of the flow pattern while saving computational cost. This paper introduces an adaptive grid model, which uses an adaptive criterion calculated on the basis of the water lever. The grid adaption is performed by manipulating subdivision levels of the computation grids. As the flow feature varies during the shallow wave propagation, the local grid density changes adaptively and the stored information of neighbor relationship updates correspondingly, achieving a balance between the model accuracy and running efficiency. In this work, a well-balanced (WB) scheme for solving SWEs is introduced. In reconstructions of Riemann state, the definition of the unique bottom elevation on grid interfaces is modified, and the numerical scheme is pre-balanced automatically. By the validation against two idealist test cases, the proposed model is applied to simulate flood inundation due to a dam-break of Zhanghe Reservoir, Hubei province, China. The results show that the presented model is robust and well-balanced, has nice computational efficiency and numerical stability, and thus has bright application prospects.

  18. Adapting wave-front algorithms to efficiently utilize systems with deep communication hierarchies

    SciTech Connect

    Kerbyson, Darren J; Lang, Michael; Pakin, Scott

    2009-01-01

    Large-scale systems increasingly exhibit a differential between intra-chip and inter-chip communication performance. Processor-cores on the same socket are able to communicate at lower latencies, and with higher bandwidths, than cores on different sockets either within the same node or between nodes. A key challenge is to efficiently use this communication hierarchy and hence optimize performance. We consider here the class of applications that contain wave-front processing. In these applications data can only be processed after their upstream neighbors have been processed. Similar dependencies result between processors in which communication is required to pass boundary data downstream and whose cost is typically impacted by the slowest communication channel in use. In this work we develop a novel hierarchical wave-front approach that reduces the use of slower communications in the hierarchy but at the cost of additional computation and higher use of on-chip communications. This tradeoff is explored using a performance model and an implementation on the Petascale Roadrunner system demonstrates a 27% performance improvement at full system-scale on a kernel application. The approach is generally applicable to large-scale multi-core and accelerated systems where a differential in system communication performance exists.

  19. Adaptive Grid Techniques for Elliptic Fluid-Flow Problems,

    DTIC Science & Technology

    1985-12-01

    J . F . (1984), "Grid Generation Techniques in Computational Fluid Dynamics," AIAA Jnl., Vol. 22, No. 11, pp. 1505-1523. Thompson , J . F . (1983...Procedure," Ph.D. Thesis, Dept. of Computer Science, Stanford University, Calif. Tang, W. P., W. Skamarock, and J. Oliger (1985). To appear. Thompson

  20. Locally adapted space-wise grids from GOCE data

    NASA Astrophysics Data System (ADS)

    Reguzzoni, Mirko; Gatti, Andrea; De Gaetani, Carlo; Migliaccio, Federica; Sansò, Fernando

    2014-05-01

    GOCE data are usually translated into a spherical harmonic global model that can be used to generate various functionals of the Earth's gravitational field. An alternative representation of the information coming from GOCE is to project the observed along-track gradients onto a spherical grid at mean satellite altitude. This is the solution pursued in this work by exploiting the so called space-wise approach. In particular, once the data are filtered along the orbit in order to reduce variance and correlation of the observation noise, a gridding procedure is implemented by least-squares collocation on local data patches. Crucial points are the new way in which data are subdivided and local covariances are modeled. Basically the idea is to consider clouds of observation points around each grid knot reducing as much as possible the data undersampling in order to catch their local information. Inside the point cloud a signal covariance model based on local degree variances is used. The method has been applied on a subset of GOCE data. The resulting grid values are compared with those synthesized from a global model based on the same observation time span, showing the differences between the two representations.

  1. New method adaptive to geospatial information acquisition and share based on grid

    NASA Astrophysics Data System (ADS)

    Fu, Yingchun; Yuan, Xiuxiao

    2005-11-01

    As we all know, it is difficult and time-consuming to acquire and share multi-source geospatial information in grid computing environment, especially for the data of different geo-reference benchmark. Although middleware for data format transformation has been applied by many grid applications and GIS software systems, it remains difficult to on demand realize spatial data assembly jobs among various geo-reference benchmarks because of complex computation of rigorous coordinate transformation model. To address the problem, an efficient hierarchical quadtree structure referred as multi-level grids is designed and coded to express the multi-scale global geo-space. The geospatial objects located in a certain grid of multi-level grids may be expressed as an increment value which is relative to the grid central point and is constant in different geo-reference benchmark. A mediator responsible for geo-reference transformation function with multi-level grids has been developed and aligned with grid service. With help of the mediator, a map or query spatial data sets from individual source of different geo-references can be merged into an uniform composite result. Instead of complex data pre-processing prior to compatible spatial integration, the introduced method is adaptive to be integrated with grid-enable service.

  2. Culture adaptation alters transcriptional hierarchies among single human embryonic stem cells reflecting altered patterns of differentiation.

    PubMed

    Gokhale, Paul J; Au-Young, Janice K; Dadi, SriVidya; Keys, David N; Harrison, Neil J; Jones, Mark; Soneji, Shamit; Enver, Tariq; Sherlock, Jon K; Andrews, Peter W

    2015-01-01

    We have used single cell transcriptome analysis to re-examine the substates of early passage, karyotypically Normal, and late passage, karyotypically Abnormal ('Culture Adapted') human embryonic stem cells characterized by differential expression of the cell surface marker antigen, SSEA3. The results confirmed that culture adaptation is associated with alterations to the dynamics of the SSEA3(+) and SSEA3(-) substates of these cells, with SSEA3(-) Adapted cells remaining within the stem cell compartment whereas the SSEA3(-) Normal cells appear to have differentiated. However, the single cell data reveal that these substates are characterized by further heterogeneity that changes on culture adaptation. Notably the Adapted population includes cells with a transcriptome substate suggestive of a shift to a more naïve-like phenotype in contrast to the cells of the Normal population. Further, a subset of the Normal SSEA3(+) cells expresses genes typical of endoderm differentiation, despite also expressing the undifferentiated stem cell genes, POU5F1 (OCT4) and NANOG, whereas such apparently lineage-primed cells are absent from the Adapted population. These results suggest that the selective growth advantage gained by genetically variant, culture adapted human embryonic stem cells may derive in part from a changed substate structure that influences their propensity for differentiation.

  3. Adaptive Unstructured Grid Generation for Modeling of Coastal Margins

    DTIC Science & Technology

    1999-09-30

    applied to the 2+1D simulations of the barotropic circulation in the Tagus estuary (Fortunato et al. 1997). The approach, denoted localized sigma...analysis. Application to the Tagus does not appear to have produced new pathologies relative to a conventional sigma-coordinate discretization, and reduced...particular, adopt and provide additional testbeds and technical feedback for our grid generation software. The Columbia River estuary and plume have provided

  4. Adaptive local grid refinement for the compressible 3-D Euler equations

    NASA Astrophysics Data System (ADS)

    Schoenfeld, Thilo

    A method is presented based on a three-dimensional Euler code, using the explicit finite volume technique and a Runge-Kutta scheme, and applied in an adaptive version for the transonic flow around wings. The method allows embedded subgrids at two levels of refinement. Computations are performed with both various fixed refined grids and in an adaptive version applying a pressure or density gradient sensor. When comparing the results of embedded grid computations with calculations on only a total coarse or fine mesh, it can be stated that the local grid refinement technique is an effective framework to obtain well-resolved solutions with, at the same time, a minimum of grid points.

  5. FLAG: A multi-dimensional adaptive free-Lagrange code for fully unstructured grids

    SciTech Connect

    Burton, D.E.; Miller, D.S.; Palmer, T.

    1995-07-01

    The authors describe FLAG, a 3D adaptive free-Lagrange method for unstructured grids. The grid elements were 3D polygons, which move with the flow, and are refined or reconnected as necessary to achieve uniform accuracy. The authors stressed that they were able to construct a 3D hydro version of this code in 3 months, using an object-oriented FORTRAN approach.

  6. Adaptively-refined overlapping grids for the numerical solution of systems of hyperbolic conservation laws

    NASA Technical Reports Server (NTRS)

    Brislawn, Kristi D.; Brown, David L.; Chesshire, Geoffrey S.; Saltzman, Jeffrey S.

    1995-01-01

    Adaptive mesh refinement (AMR) in conjunction with higher-order upwind finite-difference methods have been used effectively on a variety of problems in two and three dimensions. In this paper we introduce an approach for resolving problems that involve complex geometries in which resolution of boundary geometry is important. The complex geometry is represented by using the method of overlapping grids, while local resolution is obtained by refining each component grid with the AMR algorithm, appropriately generalized for this situation. The CMPGRD algorithm introduced by Chesshire and Henshaw is used to automatically generate the overlapping grid structure for the underlying mesh.

  7. Application of a self-adaptive grid method to complex flows

    NASA Technical Reports Server (NTRS)

    Deiwert, G. S.; Venkatapathy, E.; Davies, C.; Djomehri, J.; Abrahamson, K.

    1989-01-01

    A directional-split, modular, user-friendly grid point distribution code is applied to several test problems. The code is self-adaptive in the sense that grid point spacing is determined by user-specified constants denoting maximum and minimum grid spacings and constants relating the relative influence of smoothness and orthogonality. Estimates of truncation error, in terms of flow-field gradients and/or geometric features, are used to determine the point distribution. Points are redistributed along grid lines in a specified direction in an elliptic manner over a user-specified subdomain, while orthogonality and smoothness are controlled in a parabolic (marching) manner in the remaining directions. Multidirectional adaption is achieved by sequential application of the method in each coordinate direction. The flow-field solution is redistributed onto the newly distributed grid points after each unidirectional adaption by a simple one-dimensional interpolation scheme. For time-accurate schemes such interpolation is not necessary and time-dependent metrics are carried in the fluid dynamic equations to account for grid movement.

  8. Unstructured Grid Adaptation: Status, Potential Impacts, and Recommended Investments Toward CFD Vision 2030

    NASA Technical Reports Server (NTRS)

    Park, Michael A.; Krakos, Joshua A.; Michal, Todd; Loseille, Adrien; Alonso, Juan J.

    2016-01-01

    Unstructured grid adaptation is a powerful tool to control discretization error for Computational Fluid Dynamics (CFD). It has enabled key increases in the accuracy, automation, and capacity of some fluid simulation applications. Slotnick et al. provides a number of case studies in the CFD Vision 2030 Study: A Path to Revolutionary Computational Aerosciences to illustrate the current state of CFD capability and capacity. The authors forecast the potential impact of emerging High Performance Computing (HPC) environments forecast in the year 2030 and identify that mesh generation and adaptivity continue to be significant bottlenecks in the CFD work flow. These bottlenecks may persist because very little government investment has been targeted in these areas. To motivate investment, the impacts of improved grid adaptation technologies are identified. The CFD Vision 2030 Study roadmap and anticipated capabilities in complementary disciplines are quoted to provide context for the progress made in grid adaptation in the past fifteen years, current status, and a forecast for the next fifteen years with recommended investments. These investments are specific to mesh adaptation and impact other aspects of the CFD process. Finally, a strategy is identified to diffuse grid adaptation technology into production CFD work flows.

  9. A self-adaptive-grid method with application to airfoil flow

    NASA Technical Reports Server (NTRS)

    Nakahashi, K.; Deiwert, G. S.

    1985-01-01

    A self-adaptive-grid method is described that is suitable for multidimensional steady and unsteady computations. Based on variational principles, a spring analogy is used to redistribute grid points in an optimal sense to reduce the overall solution error. User-specified parameters, denoting both maximum and minimum permissible grid spacings, are used to define the all-important constants, thereby minimizing the empiricism and making the method self-adaptive. Operator splitting and one-sided controls for orthogonality and smoothness are used to make the method practical, robust, and efficient. Examples are included for both steady and unsteady viscous flow computations about airfoils in two dimensions, as well as for a steady inviscid flow computation and a one-dimensional case. These examples illustrate the precise control the user has with the self-adaptive method and demonstrate a significant improvement in accuracy and quality of the solutions.

  10. A 3D finite-volume scheme for the Euler equations on adaptive tetrahedral grids

    SciTech Connect

    Vijayan, P.; Kallinderis, Y. )

    1994-08-01

    The paper describes the development and application of a new Euler solver for adaptive tetrahedral grids. Spatial discretization uses a finite-volume, node-based scheme that is of central-differencing type. A second-order Taylor series expansion is employed to march the solution in time according to the Lax-Wendroff approach. Special upwind-like smoothing operators for unstructured grids are developed for shock-capturing, as well as for suppression of solution oscillations. The scheme is formulated so that all operations are edge-based, which reduces the computational effort significantly. An adaptive grid algorithm is employed in order to resolve local flow features. This is achieved by dividing the tetrahedral cells locally, guided by a flow feature detection algorithm. Application cases include transonic flow around the ONERA M6 wing and transonic flow past a transport aircraft configuration. Comparisons with experimental data evaluate accuracy of the developed adaptive solver. 31 refs., 33 figs.

  11. Adaptive Local Grid Refinement in Computational Fluid Mechanics.

    DTIC Science & Technology

    1987-11-01

    Adaptive mesh refinements in reservoir simulation applications (R.E. Ew- ing), Proceedings Intl. Conference on Accuracy Est. and Adaptive Refine... reservoir simulation (R.E. Ewing and .J.V. 1{oebbe), Innovati’ve Numerical Mlethods in Engineering, (R.P. Shaw, J. Pc- riaux, A. Chaudouet, J. Wu...Universities, Cheyenne, Wyoming, February 21, 1986, O 9. Finite element techniques for reservoir simulation , Fourth International Sym- posium on Numerical

  12. An object-oriented approach for parallel self adaptive mesh refinement on block structured grids

    NASA Technical Reports Server (NTRS)

    Lemke, Max; Witsch, Kristian; Quinlan, Daniel

    1993-01-01

    Self-adaptive mesh refinement dynamically matches the computational demands of a solver for partial differential equations to the activity in the application's domain. In this paper we present two C++ class libraries, P++ and AMR++, which significantly simplify the development of sophisticated adaptive mesh refinement codes on (massively) parallel distributed memory architectures. The development is based on our previous research in this area. The C++ class libraries provide abstractions to separate the issues of developing parallel adaptive mesh refinement applications into those of parallelism, abstracted by P++, and adaptive mesh refinement, abstracted by AMR++. P++ is a parallel array class library to permit efficient development of architecture independent codes for structured grid applications, and AMR++ provides support for self-adaptive mesh refinement on block-structured grids of rectangular non-overlapping blocks. Using these libraries, the application programmers' work is greatly simplified to primarily specifying the serial single grid application and obtaining the parallel and self-adaptive mesh refinement code with minimal effort. Initial results for simple singular perturbation problems solved by self-adaptive multilevel techniques (FAC, AFAC), being implemented on the basis of prototypes of the P++/AMR++ environment, are presented. Singular perturbation problems frequently arise in large applications, e.g. in the area of computational fluid dynamics. They usually have solutions with layers which require adaptive mesh refinement and fast basic solvers in order to be resolved efficiently.

  13. Adaptive grid finite element model of the tokamak scrapeoff layer

    SciTech Connect

    Kuprat, A.P.; Glasser, A.H.

    1995-07-01

    The authors discuss unstructured grids for application to transport in the tokamak edge SOL. They have developed a new metric with which to judge element elongation and resolution requirements. Using this method, the authors apply a standard moving finite element technique to advance the SOL equations while inserting/deleting dynamically nodes that violate an elongation criterion. In a tokamak plasma, this method achieves a more uniform accuracy, and results in highly stretched triangular finite elements, except near separatrix X-point where transport is more isotropic.

  14. An assessment of the adaptive unstructured tetrahedral grid, Euler Flow Solver Code FELISA

    NASA Technical Reports Server (NTRS)

    Djomehri, M. Jahed; Erickson, Larry L.

    1994-01-01

    A three-dimensional solution-adaptive Euler flow solver for unstructured tetrahedral meshes is assessed, and the accuracy and efficiency of the method for predicting sonic boom pressure signatures about simple generic models are demonstrated. Comparison of computational and wind tunnel data and enhancement of numerical solutions by means of grid adaptivity are discussed. The mesh generation is based on the advancing front technique. The FELISA code consists of two solvers, the Taylor-Galerkin and the Runge-Kutta-Galerkin schemes, both of which are spacially discretized by the usual Galerkin weighted residual finite-element methods but with different explicit time-marching schemes to steady state. The solution-adaptive grid procedure is based on either remeshing or mesh refinement techniques. An alternative geometry adaptive procedure is also incorporated.

  15. Parallel Implementation of an Adaptive Scheme for 3D Unstructured Grids on the SP2

    NASA Technical Reports Server (NTRS)

    Oliker, Leonid; Biswas, Rupak; Strawn, Roger C.

    1996-01-01

    Dynamic mesh adaption on unstructured grids is a powerful tool for computing unsteady flows that require local grid modifications to efficiently resolve solution features. For this work, we consider an edge-based adaption scheme that has shown good single-processor performance on the C90. We report on our experience parallelizing this code for the SP2. Results show a 47.OX speedup on 64 processors when 10% of the mesh is randomly refined. Performance deteriorates to 7.7X when the same number of edges are refined in a highly-localized region. This is because almost all mesh adaption is confined to a single processor. However, this problem can be remedied by repartitioning the mesh immediately after targeting edges for refinement but before the actual adaption takes place. With this change, the speedup improves dramatically to 43.6X.

  16. Parallel implementation of an adaptive scheme for 3D unstructured grids on the SP2

    NASA Technical Reports Server (NTRS)

    Strawn, Roger C.; Oliker, Leonid; Biswas, Rupak

    1996-01-01

    Dynamic mesh adaption on unstructured grids is a powerful tool for computing unsteady flows that require local grid modifications to efficiently resolve solution features. For this work, we consider an edge-based adaption scheme that has shown good single-processor performance on the C90. We report on our experience parallelizing this code for the SP2. Results show a 47.0X speedup on 64 processors when 10 percent of the mesh is randomly refined. Performance deteriorates to 7.7X when the same number of edges are refined in a highly-localized region. This is because almost all the mesh adaption is confined to a single processor. However, this problem can be remedied by repartitioning the mesh immediately after targeting edges for refinement but before the actual adaption takes place. With this change, the speedup improves dramatically to 43.6X.

  17. Grid-Adapted FUN3D Computations for the Second High Lift Prediction Workshop

    NASA Technical Reports Server (NTRS)

    Lee-Rausch, E. M.; Rumsey, C. L.; Park, M. A.

    2014-01-01

    Contributions of the unstructured Reynolds-averaged Navier-Stokes code FUN3D to the 2nd AIAA CFD High Lift Prediction Workshop are described, and detailed comparisons are made with experimental data. Using workshop-supplied grids, results for the clean wing configuration are compared with results from the structured code CFL3D Using the same turbulence model, both codes compare reasonably well in terms of total forces and moments, and the maximum lift is similarly over-predicted for both codes compared to experiment. By including more representative geometry features such as slat and flap brackets and slat pressure tube bundles, FUN3D captures the general effects of the Reynolds number variation, but under-predicts maximum lift on workshop-supplied grids in comparison with the experimental data, due to excessive separation. However, when output-based, off-body grid adaptation in FUN3D is employed, results improve considerably. In particular, when the geometry includes both brackets and the pressure tube bundles, grid adaptation results in a more accurate prediction of lift near stall in comparison with the wind-tunnel data. Furthermore, a rotation-corrected turbulence model shows improved pressure predictions on the outboard span when using adapted grids.

  18. Composite-Grid Techniques and Adaptive Mesh Refinement in Computational Fluid Dynamics

    DTIC Science & Technology

    1990-01-01

    the equations govern- ing the flow. The patched adaptive mesh refinement technique, devised at Stanford by Oliger, et al ., copes with these sources of...patched adaptive mesh refinement technique, devised at Stanford by Oliger et al . [OL184], copes with these sources of error efficiently by refining...differential equation, as in the numerical grid generation methods proposed by Thompson et al . [THO85], or simply a list of pairs of points in

  19. Generalized Monge-Kantorovich optimization for grid generation and adaptation in LP

    SciTech Connect

    Delzanno, G L; Finn, J M

    2009-01-01

    The Monge-Kantorovich grid generation and adaptation scheme of is generalized from a variational principle based on L{sub 2} to a variational principle based on L{sub p}. A generalized Monge-Ampere (MA) equation is derived and its properties are discussed. Results for p > 1 are obtained and compared in terms of the quality of the resulting grid. We conclude that for the grid generation application, the formulation based on L{sub p} for p close to unity leads to serious problems associated with the boundary. Results for 1.5 {approx}< p {approx}< 2.5 are quite good, but there is a fairly narrow range around p = 2 where the results are close to optimal with respect to grid distortion. Furthermore, the Newton-Krylov methods used to solve the generalized MA equation perform best for p = 2.

  20. Stability of a modified Peaceman-Rachford method for the paraxial Helmholtz equation on adaptive grids

    NASA Astrophysics Data System (ADS)

    Sheng, Qin; Sun, Hai-wei

    2016-11-01

    This study concerns the asymptotic stability of an eikonal, or ray, transformation based Peaceman-Rachford splitting method for solving the paraxial Helmholtz equation with high wave numbers. Arbitrary nonuniform grids are considered in transverse and beam propagation directions. The differential equation targeted has been used for modeling propagations of high intensity laser pulses over a long distance without diffractions. Self-focusing of high intensity beams may be balanced with the de-focusing effect of created ionized plasma channel in the situation, and applications of grid adaptations are frequently essential. It is shown rigorously that the fully discretized oscillation-free decomposition method on arbitrary adaptive grids is asymptotically stable with a stability index one. Simulation experiments are carried out to illustrate our concern and conclusions.

  1. A Hyperspherical Adaptive Sparse-Grid Method for High-Dimensional Discontinuity Detection

    SciTech Connect

    Zhang, Guannan; Webster, Clayton G.; Gunzburger, Max D.; Burkardt, John V.

    2015-06-24

    This study proposes and analyzes a hyperspherical adaptive hierarchical sparse-grid method for detecting jump discontinuities of functions in high-dimensional spaces. The method is motivated by the theoretical and computational inefficiencies of well-known adaptive sparse-grid methods for discontinuity detection. Our novel approach constructs a function representation of the discontinuity hypersurface of an N-dimensional discontinuous quantity of interest, by virtue of a hyperspherical transformation. Then, a sparse-grid approximation of the transformed function is built in the hyperspherical coordinate system, whose value at each point is estimated by solving a one-dimensional discontinuity detection problem. Due to the smoothness of the hypersurface, the new technique can identify jump discontinuities with significantly reduced computational cost, compared to existing methods. In addition, hierarchical acceleration techniques are also incorporated to further reduce the overall complexity. Rigorous complexity analyses of the new method are provided as are several numerical examples that illustrate the effectiveness of the approach.

  2. 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.

  3. SIMULATION OF DISPERSION OF A POWER PLANT PLUME USING AN ADAPTIVE GRID ALGORITHM. (R827028)

    EPA Science Inventory

    A new dynamic adaptive grid algorithm has been developed for use in air quality modeling. This algorithm uses a higher order numerical scheme––the piecewise parabolic method (PPM)––for computing advective solution fields; a weight function capable o...

  4. Algebraic grid adaptation method using non-uniform rational B-spline surface modeling

    NASA Technical Reports Server (NTRS)

    Yang, Jiann-Cherng; Soni, B. K.

    1992-01-01

    An algebraic adaptive grid system based on equidistribution law and utilized by the Non-Uniform Rational B-Spline (NURBS) surface for redistribution is presented. A weight function, utilizing a properly weighted boolean sum of various flow field characteristics is developed. Computational examples are presented to demonstrate the success of this technique.

  5. Integration of hp-Adaptivity and a Two Grid Solver. II. Electromagnetic Problems

    DTIC Science & Technology

    2005-01-01

    for lower order FE spaces. More precisely, let T be a grid,M the associated lowest order Nedelec subspaces ofHD(curl; Ω) of the first kind [24], and W... Nedelec , Mixed finite elements in IR3., Numer. Math., 35 (1980), pp. 315–341. [25] D. Pardo and L. Demkowicz, Integration of hp-adaptivity with a two

  6. White Light Schlieren Optics Using Bacteriorhodopsin as an Adaptive Image Grid

    NASA Technical Reports Server (NTRS)

    Peale, Robert; Ruffin, Boh; Donahue, Jeff; Barrett, Carolyn

    1996-01-01

    A Schlieren apparatus using a bacteriorhodopsin film as an adaptive image grid with white light illumination is demonstrated for the first time. The time dependent spectral properties of the film are characterized. Potential applications include a single-ended Schlieren system for leak detection.

  7. Re-architecting flow-control adaptation for grid environments

    SciTech Connect

    Engelhart, A.; Gardner, M. K.; Feng, W. C.

    2004-01-01

    The performance of TCP in wide-area networks (WANs) is becoming increasingly important with the deployment of computational and data grids. At WAN speeds, TCP does not provide good performance for data-intensive applications without the tuning of flow-control buffer sizes. Manual adjustment of buffer sizes is tedious even for network experts. For scientists, tuning is often an impediment to getting work done. Thus, buffer tuning should be automated. Existing techniques for automatic buffer tuning only measure the bandwidth-delay product (BDP) during connection establishment. This ignores the (large) fluctuation of the BDP over the lifetime of the connection. In contrast, the Dynamic Right-Sizing algorithm dynamically changes buffer sizes in response to changing network conditions. In this paper, we describe a new user-space implementation of Dynamic Right-Sizing in FTP (drsFTP) that supports third-party data transfers, a mainstay of scientific computing. In addition to comparing the performance of the new implementation with the old, we give performance results over a live WAN. The new implementation gives transfer rates of up to five times higher than untuned FTP.

  8. Emergent Adaptive Noise Reduction from Communal Cooperation of Sensor Grid

    NASA Technical Reports Server (NTRS)

    Jones, Kennie H.; Jones, Michael G.; Nark, Douglas M.; Lodding, Kenneth N.

    2010-01-01

    In the last decade, the realization of small, inexpensive, and powerful devices with sensors, computers, and wireless communication has promised the development of massive sized sensor networks with dense deployments over large areas capable of high fidelity situational assessments. However, most management models have been based on centralized control and research has concentrated on methods for passing data from sensor devices to the central controller. Most implementations have been small but, as it is not scalable, this methodology is insufficient for massive deployments. Here, a specific application of a large sensor network for adaptive noise reduction demonstrates a new paradigm where communities of sensor/computer devices assess local conditions and make local decisions from which emerges a global behaviour. This approach obviates many of the problems of centralized control as it is not prone to single point of failure and is more scalable, efficient, robust, and fault tolerant

  9. Hybrid Adaptive Ray-Moment Method (HARM2): A highly parallel method for radiation hydrodynamics on adaptive grids

    NASA Astrophysics Data System (ADS)

    Rosen, A. L.; Krumholz, M. R.; Oishi, J. S.; Lee, A. T.; Klein, R. I.

    2017-02-01

    We present a highly-parallel multi-frequency hybrid radiation hydrodynamics algorithm that combines a spatially-adaptive long characteristics method for the radiation field from point sources with a moment method that handles the diffuse radiation field produced by a volume-filling fluid. Our Hybrid Adaptive Ray-Moment Method (HARM2) operates on patch-based adaptive grids, is compatible with asynchronous time stepping, and works with any moment method. In comparison to previous long characteristics methods, we have greatly improved the parallel performance of the adaptive long-characteristics method by developing a new completely asynchronous and non-blocking communication algorithm. As a result of this improvement, our implementation achieves near-perfect scaling up to O (103) processors on distributed memory machines. We present a series of tests to demonstrate the accuracy and performance of the method.

  10. Operational adaptability evaluation index system of pumped storage in UHV receiving-end grids

    NASA Astrophysics Data System (ADS)

    Yuan, Bo; Zong, Jin; Feng, Junshu

    2017-01-01

    Pumped storage is an effective solution to deal with the emergency reserve shortage, renewable energy accommodating and peak-shaving problems in ultra-high voltage (UHV) transmission receiving-end grids. However, governments and public opinion in China tend to evaluate the operational effectiveness of pumped storage using annual utilization hour, which may result in unreasonable and unnecessary dispatch of pumped storage. This paper built an operational adaptability evaluation index system for pumped storage in UHV-receiving end grids from three aspects: security insurance, peak-shaving and renewable energy accommodating, which can provide a comprehensive and objective way to evaluate the operational performance of a pumped storage station.

  11. Parallel computation of three-dimensional flows using overlapping grids with adaptive mesh refinement

    NASA Astrophysics Data System (ADS)

    Henshaw, William D.; Schwendeman, Donald W.

    2008-08-01

    This paper describes an approach for the numerical solution of time-dependent partial differential equations in complex three-dimensional domains. The domains are represented by overlapping structured grids, and block-structured adaptive mesh refinement (AMR) is employed to locally increase the grid resolution. In addition, the numerical method is implemented on parallel distributed-memory computers using a domain-decomposition approach. The implementation is flexible so that each base grid within the overlapping grid structure and its associated refinement grids can be independently partitioned over a chosen set of processors. A modified bin-packing algorithm is used to specify the partition for each grid so that the computational work is evenly distributed amongst the processors. All components of the AMR algorithm such as error estimation, regridding, and interpolation are performed in parallel. The parallel time-stepping algorithm is illustrated for initial-boundary-value problems involving a linear advection-diffusion equation and the (nonlinear) reactive Euler equations. Numerical results are presented for both equations to demonstrate the accuracy and correctness of the parallel approach. Exact solutions of the advection-diffusion equation are constructed, and these are used to check the corresponding numerical solutions for a variety of tests involving different overlapping grids, different numbers of refinement levels and refinement ratios, and different numbers of processors. The problem of planar shock diffraction by a sphere is considered as an illustration of the numerical approach for the Euler equations, and a problem involving the initiation of a detonation from a hot spot in a T-shaped pipe is considered to demonstrate the numerical approach for the reactive case. For both problems, the accuracy of the numerical solutions is assessed quantitatively through an estimation of the errors from a grid convergence study. The parallel performance of the

  12. Parallel Computation of Three-Dimensional Flows using Overlapping Grids with Adaptive Mesh Refinement

    SciTech Connect

    Henshaw, W; Schwendeman, D

    2007-11-15

    This paper describes an approach for the numerical solution of time-dependent partial differential equations in complex three-dimensional domains. The domains are represented by overlapping structured grids, and block-structured adaptive mesh refinement (AMR) is employed to locally increase the grid resolution. In addition, the numerical method is implemented on parallel distributed-memory computers using a domain-decomposition approach. The implementation is flexible so that each base grid within the overlapping grid structure and its associated refinement grids can be independently partitioned over a chosen set of processors. A modified bin-packing algorithm is used to specify the partition for each grid so that the computational work is evenly distributed amongst the processors. All components of the AMR algorithm such as error estimation, regridding, and interpolation are performed in parallel. The parallel time-stepping algorithm is illustrated for initial-boundary-value problems involving a linear advection-diffusion equation and the (nonlinear) reactive Euler equations. Numerical results are presented for both equations to demonstrate the accuracy and correctness of the parallel approach. Exact solutions of the advection-diffusion equation are constructed, and these are used to check the corresponding numerical solutions for a variety of tests involving different overlapping grids, different numbers of refinement levels and refinement ratios, and different numbers of processors. The problem of planar shock diffraction by a sphere is considered as an illustration of the numerical approach for the Euler equations, and a problem involving the initiation of a detonation from a hot spot in a T-shaped pipe is considered to demonstrate the numerical approach for the reactive case. For both problems, the solutions are shown to be well resolved on the finest grid. The parallel performance of the approach is examined in detail for the shock diffraction problem.

  13. An adaptive grid/Navier-Stokes methodology for the calculation of nozzle afterbody base flows with a supersonic freestream

    NASA Technical Reports Server (NTRS)

    Williams, Morgan; Lim, Dennis; Ungewitter, Ronald

    1993-01-01

    This paper describes an adaptive grid method for base flows in a supersonic freestream. The method is based on the direct finite-difference statement of the equidistribution principle. The weighting factor is a combination of the Mach number, density, and velocity first-derivative gradients in the radial direction. Two key ideas of the method are to smooth the weighting factor by using a type of implicit smoothing and to allow boundary points to move in the grid adaptation process. An AGARD nozzle afterbody base flow configuration is used to demonstrate the performance of the adaptive grid methodology. Computed base pressures are compared to experimental data. The adapted grid solutions offer a dramatic improvement in base pressure prediction compared to solutions computed on a nonadapted grid. A total-variation-diminishing (TVD) Navier-Stokes scheme is used to solve the governing flow equations.

  14. The development and application of the self-adaptive grid code, SAGE

    NASA Technical Reports Server (NTRS)

    Davies, Carol B.

    1993-01-01

    The multidimensional self-adaptive grid code, SAGE, has proven to be a flexible and useful tool in the solution of complex flow problems. Both 2- and 3-D examples given in this report show the code to be reliable and to substantially improve flowfield solutions. Since the adaptive procedure is a marching scheme the code is extremely fast and uses insignificant CPU time compared to the corresponding flow solver. The SAGE program is also machine and flow solver independent. Significant effort was made to simplify user interaction, though some parameters still need to be chosen with care. It is also difficult to tell when the adaption process has provided its best possible solution. This is particularly true if no experimental data are available or if there is a lack of theoretical understanding of the flow. Another difficulty occurs if local features are important but missing in the original grid; the adaption to this solution will not result in any improvement, and only grid refinement can result in an improved solution. These are complex issues that need to be explored within the context of each specific problem.

  15. LasR Variant Cystic Fibrosis Isolates Reveal an Adaptable Quorum-Sensing Hierarchy in Pseudomonas aeruginosa.

    PubMed

    Feltner, John B; Wolter, Daniel J; Pope, Christopher E; Groleau, Marie-Christine; Smalley, Nicole E; Greenberg, E Peter; Mayer-Hamblett, Nicole; Burns, Jane; Déziel, Eric; Hoffman, Lucas R; Dandekar, Ajai A

    2016-10-04

    Chronic Pseudomonas aeruginosa infections cause significant morbidity in patients with cystic fibrosis (CF). Over years to decades, P. aeruginosa adapts genetically as it establishes chronic lung infections. Nonsynonymous mutations in lasR, the quorum-sensing (QS) master regulator, are common in CF. In laboratory strains of P. aeruginosa, LasR activates transcription of dozens of genes, including that for another QS regulator, RhlR. Despite the frequency with which lasR coding variants have been reported to occur in P. aeruginosa CF isolates, little is known about their consequences for QS. We sequenced lasR from 2,583 P. aeruginosa CF isolates. The lasR sequences of 580 isolates (22%) coded for polypeptides that differed from the conserved LasR polypeptides of well-studied laboratory strains. This collection included 173 unique lasR coding variants, 116 of which were either missense or nonsense mutations. We studied 31 of these variants. About one-sixth of the variant LasR proteins were functional, including 3 with nonsense mutations, and in some LasR-null isolates, genes that are LasR dependent in laboratory strains were nonetheless expressed. Furthermore, about half of the LasR-null isolates retained RhlR activity. Therefore, in some CF isolates the QS hierarchy is altered such that RhlR quorum sensing is independent of LasR regulation. Our analysis challenges the view that QS-silent P. aeruginosa is selected during the course of a chronic CF lung infection. Rather, some lasR sequence variants retain functionality, and many employ an alternate QS strategy involving RhlR.

  16. LasR Variant Cystic Fibrosis Isolates Reveal an Adaptable Quorum-Sensing Hierarchy in Pseudomonas aeruginosa

    PubMed Central

    Feltner, John B.; Wolter, Daniel J.; Pope, Christopher E.; Groleau, Marie-Christine; Smalley, Nicole E.; Greenberg, E. Peter; Mayer-Hamblett, Nicole; Burns, Jane; Hoffman, Lucas R.

    2016-01-01

    ABSTRACT Chronic Pseudomonas aeruginosa infections cause significant morbidity in patients with cystic fibrosis (CF). Over years to decades, P. aeruginosa adapts genetically as it establishes chronic lung infections. Nonsynonymous mutations in lasR, the quorum-sensing (QS) master regulator, are common in CF. In laboratory strains of P. aeruginosa, LasR activates transcription of dozens of genes, including that for another QS regulator, RhlR. Despite the frequency with which lasR coding variants have been reported to occur in P. aeruginosa CF isolates, little is known about their consequences for QS. We sequenced lasR from 2,583 P. aeruginosa CF isolates. The lasR sequences of 580 isolates (22%) coded for polypeptides that differed from the conserved LasR polypeptides of well-studied laboratory strains. This collection included 173 unique lasR coding variants, 116 of which were either missense or nonsense mutations. We studied 31 of these variants. About one-sixth of the variant LasR proteins were functional, including 3 with nonsense mutations, and in some LasR-null isolates, genes that are LasR dependent in laboratory strains were nonetheless expressed. Furthermore, about half of the LasR-null isolates retained RhlR activity. Therefore, in some CF isolates the QS hierarchy is altered such that RhlR quorum sensing is independent of LasR regulation. Our analysis challenges the view that QS-silent P. aeruginosa is selected during the course of a chronic CF lung infection. Rather, some lasR sequence variants retain functionality, and many employ an alternate QS strategy involving RhlR. PMID:27703072

  17. Why hierarchies thrive.

    PubMed

    Leavitt, Harold J

    2003-03-01

    Hardly anyone has a good word to say about hierarchies. Academics, consultants, and management gurus regularly forecast their imminent replacement because hierarchies--even when populated by considerate and intelligent people--can be cruel and stupid. They routinely transform motivated and loyal employees into disaffected Dilberts. It's no wonder that we continue to search for more humane and productive alternatives to them. Yet the intensity with which we struggle against hierarchies only serves to highlight their durability. Hierarchy, it seems, may be intrinsic not only to the natural world but also to our own natures. In this article, organizational behavior expert Harold J. Leavitt presents neither a defense of human hierarchies nor another attack on them. Instead, he offers a reality check, a reminder that hierarchy remains the basic structure of most, if not all, large, ongoing human organizations. That's because although they are often depicted as being out of date, hierarchies have proved to be extraordinarily adaptive. Over the past 50 years, for example, they have co-opted the three major managerial movements--human relations, analytic management, and communities of practice. Hierarchies also persist because they deliver real practical and psychological value, and they fulfill our deep need for order and security. Despite the good they may do, hierarchies are inevitably authoritarian. That authoritarianism shows up in all kinds of ways and influences everything in organizations, particularly communication. In multilevel organizations, for instance, messages get distorted as they travel up and down the ladder of command. Self-protection and self-interest weigh in, and relevant information is lost as messages make stops along the route. Sensitive leaders take steps to make speaking the truth as painless as possible. But it never is in organizations, because authoritarianism is an immutable element of hierarchy.

  18. Wing tip vortex calculations with an unstructured adaptive-grid Euler solver

    NASA Technical Reports Server (NTRS)

    Strawn, Roger C.

    1991-01-01

    A solution-adaptive grid method has been developed for computing tip-vortex flowfields around rectangular wings. This method uses subdivision in order to locally refine the grid in regions with high vorticity. Two different flow solvers are used. Each solves the three-dimensional Euler equations on unstructured grids. Computed results are compared to experimentally measured surface pressures and vortex velocities on a NACA 0015 rectangular wing. Predicted results for surface pressures and integrated lift agree well with the experimental data. The predicted size of the rotational vortex core is larger than the experimentally-measured value and the peak velocities are less. This discrepancy appears to be caused by deficiencies in the inviscid Euler-equation model. This model cannot capture the complex viscous effects at the tip that determine the detailed structure of the resulting vortex. In spite of this limitation, the present Euler unstructured adaptive-grid method demonstrates the ability to convert vortical flows with low numerical diffusion. Applications for modeling helicopter rotor wake systems are discussed.

  19. An adaptive grid for graph-based segmentation in retinal OCT

    PubMed Central

    Lang, Andrew; Carass, Aaron; Calabresi, Peter A.; Ying, Howard S.; Prince, Jerry L.

    2016-01-01

    Graph-based methods for retinal layer segmentation have proven to be popular due to their efficiency and accuracy. These methods build a graph with nodes at each voxel location and use edges connecting nodes to encode the hard constraints of each layer’s thickness and smoothness. In this work, we explore deforming the regular voxel grid to allow adjacent vertices in the graph to more closely follow the natural curvature of the retina. This deformed grid is constructed by fixing node locations based on a regression model of each layer’s thickness relative to the overall retina thickness, thus we generate a subject specific grid. Graph vertices are not at voxel locations, which allows for control over the resolution that the graph represents. By incorporating soft constraints between adjacent nodes, segmentation on this grid will favor smoothly varying surfaces consistent with the shape of the retina. Our final segmentation method then follows our previous work. Boundary probabilities are estimated using a random forest classifier followed by an optimal graph search algorithm on the new adaptive grid to produce a final segmentation. Our method is shown to produce a more consistent segmentation with an overall accuracy of 3.38 μm across all boundaries. PMID:27773959

  20. Adjoint-Based, Three-Dimensional Error Prediction and Grid Adaptation

    NASA Technical Reports Server (NTRS)

    Park, Michael A.

    2002-01-01

    Engineering computational fluid dynamics (CFD) analysis and design applications focus on output functions (e.g., lift, drag). Errors in these output functions are generally unknown and conservatively accurate solutions may be computed. Computable error estimates can offer the possibility to minimize computational work for a prescribed error tolerance. Such an estimate can be computed by solving the flow equations and the linear adjoint problem for the functional of interest. The computational mesh can be modified to minimize the uncertainty of a computed error estimate. This robust mesh-adaptation procedure automatically terminates when the simulation is within a user specified error tolerance. This procedure for estimating and adapting to error in a functional is demonstrated for three-dimensional Euler problems. An adaptive mesh procedure that links to a Computer Aided Design (CAD) surface representation is demonstrated for wing, wing-body, and extruded high lift airfoil configurations. The error estimation and adaptation procedure yielded corrected functions that are as accurate as functions calculated on uniformly refined grids with ten times as many grid points.

  1. Parallel unstructured grid generation

    NASA Technical Reports Server (NTRS)

    Loehner, Rainald; Camberos, Jose; Merriam, Marshal

    1991-01-01

    A parallel unstructured grid generation algorithm is presented and implemented on the Hypercube. Different processor hierarchies are discussed, and the appropraite hierarchies for mesh generation and mesh smoothing are selected. A domain-splitting algorithm for unstructured grids which tries to minimize the surface-to-volume ratio of each subdomain is described. This splitting algorithm is employed both for grid generation and grid smoothing. Results obtained on the Hypercube demonstrate the effectiveness of the algorithms developed.

  2. Staggered grid lagrangian method with local structured adaptive mesh refinement for modeling shock hydrodynamics

    SciTech Connect

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

    2000-09-26

    A new method for the solution of the unsteady Euler equations has been developed. The method combines staggered grid Lagrangian techniques with structured local adaptive mesh refinement (AMR). This method is a precursor to a more general adaptive arbitrary Lagrangian Eulerian (ALE-AMR) algorithm under development, which will facilitate 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. Many of the core issues involved in the development of the ALE-AMR method hinge upon the integration of AMR with a Lagrange step, which is the focus of the work described here. The novel components of the method are mainly driven by the need to reconcile traditional AMR techniques, which are typically employed on stationary meshes with cell-centered quantities, with the staggered grids and grid motion employed by Lagrangian methods. These new algorithmic components are first developed in one dimension and are then generalized to two dimensions. Solutions of several model problems involving shock hydrodynamics are presented and discussed.

  3. A Hyperspherical Adaptive Sparse-Grid Method for High-Dimensional Discontinuity Detection

    DOE PAGES

    Zhang, Guannan; Webster, Clayton G.; Gunzburger, Max D.; ...

    2015-06-24

    This study proposes and analyzes a hyperspherical adaptive hierarchical sparse-grid method for detecting jump discontinuities of functions in high-dimensional spaces. The method is motivated by the theoretical and computational inefficiencies of well-known adaptive sparse-grid methods for discontinuity detection. Our novel approach constructs a function representation of the discontinuity hypersurface of an N-dimensional discontinuous quantity of interest, by virtue of a hyperspherical transformation. Then, a sparse-grid approximation of the transformed function is built in the hyperspherical coordinate system, whose value at each point is estimated by solving a one-dimensional discontinuity detection problem. Due to the smoothness of the hypersurface, the newmore » technique can identify jump discontinuities with significantly reduced computational cost, compared to existing methods. In addition, hierarchical acceleration techniques are also incorporated to further reduce the overall complexity. Rigorous complexity analyses of the new method are provided as are several numerical examples that illustrate the effectiveness of the approach.« less

  4. A hyper-spherical adaptive sparse-grid method for high-dimensional discontinuity detection

    SciTech Connect

    Zhang, Guannan; Webster, Clayton G; Gunzburger, Max D; Burkardt, John V

    2014-03-01

    This work proposes and analyzes a hyper-spherical adaptive hi- erarchical sparse-grid method for detecting jump discontinuities of functions in high-dimensional spaces is proposed. The method is motivated by the the- oretical and computational inefficiencies of well-known adaptive sparse-grid methods for discontinuity detection. Our novel approach constructs a func- tion representation of the discontinuity hyper-surface of an N-dimensional dis- continuous quantity of interest, by virtue of a hyper-spherical transformation. Then, a sparse-grid approximation of the transformed function is built in the hyper-spherical coordinate system, whose value at each point is estimated by solving a one-dimensional discontinuity detection problem. Due to the smooth- ness of the hyper-surface, the new technique can identify jump discontinuities with significantly reduced computational cost, compared to existing methods. Moreover, hierarchical acceleration techniques are also incorporated to further reduce the overall complexity. Rigorous error estimates and complexity anal- yses of the new method are provided as are several numerical examples that illustrate the effectiveness of the approach.

  5. Damping of spurious numerical reflections off of coarse-fine adaptive mesh refinement grid boundaries

    NASA Astrophysics Data System (ADS)

    Chilton, Sven; Colella, Phillip

    2010-11-01

    Adaptive mesh refinement (AMR) is an efficient technique for solving systems of partial differential equations numerically. The underlying algorithm determines where and when a base spatial and temporal grid must be resolved further in order to achieve the desired precision and accuracy in the numerical solution. However, propagating wave solutions prove problematic for AMR. In systems with low degrees of dissipation (e.g. the Maxwell-Vlasov system) a wave traveling from a finely resolved region into a coarsely resolved region encounters a numerical impedance mismatch, resulting in spurious reflections off of the coarse-fine grid boundary. These reflected waves then become trapped inside the fine region. Here, we present a scheme for damping these spurious reflections. We demonstrate its application to the scalar wave equation and an implementation for Maxwell's Equations. We also discuss a possible extension to the Maxwell-Vlasov system.

  6. Enhancing adaptive sparse grid approximations and improving refinement strategies using adjoint-based a posteriori error estimates

    DOE PAGES

    Jakeman, J. D.; Wildey, T.

    2015-01-01

    In this paper we present an algorithm for adaptive sparse grid approximations of quantities of interest computed from discretized partial differential equations. We use adjoint-based a posteriori error estimates of the interpolation error in the sparse grid to enhance the sparse grid approximation and to drive adaptivity. We show that utilizing these error estimates provides significantly more accurate functional values for random samples of the sparse grid approximation. We also demonstrate that alternative refinement strategies based upon a posteriori error estimates can lead to further increases in accuracy in the approximation over traditional hierarchical surplus based strategies. Throughout this papermore » we also provide and test a framework for balancing the physical discretization error with the stochastic interpolation error of the enhanced sparse grid approximation.« less

  7. Enhancing adaptive sparse grid approximations and improving refinement strategies using adjoint-based a posteriori error estimates

    SciTech Connect

    Jakeman, J. D.; Wildey, T.

    2015-01-01

    In this paper we present an algorithm for adaptive sparse grid approximations of quantities of interest computed from discretized partial differential equations. We use adjoint-based a posteriori error estimates of the interpolation error in the sparse grid to enhance the sparse grid approximation and to drive adaptivity. We show that utilizing these error estimates provides significantly more accurate functional values for random samples of the sparse grid approximation. We also demonstrate that alternative refinement strategies based upon a posteriori error estimates can lead to further increases in accuracy in the approximation over traditional hierarchical surplus based strategies. Throughout this paper we also provide and test a framework for balancing the physical discretization error with the stochastic interpolation error of the enhanced sparse grid approximation.

  8. Grid and basis adaptive polynomial chaos techniques for sensitivity and uncertainty analysis

    SciTech Connect

    Perkó, Zoltán Gilli, Luca Lathouwers, Danny Kloosterman, Jan Leen

    2014-03-01

    The demand for accurate and computationally affordable sensitivity and uncertainty techniques is constantly on the rise and has become especially pressing in the nuclear field with the shift to Best Estimate Plus Uncertainty methodologies in the licensing of nuclear installations. Besides traditional, already well developed methods – such as first order perturbation theory or Monte Carlo sampling – Polynomial Chaos Expansion (PCE) has been given a growing emphasis in recent years due to its simple application and good performance. This paper presents new developments of the research done at TU Delft on such Polynomial Chaos (PC) techniques. Our work is focused on the Non-Intrusive Spectral Projection (NISP) approach and adaptive methods for building the PCE of responses of interest. Recent efforts resulted in a new adaptive sparse grid algorithm designed for estimating the PC coefficients. The algorithm is based on Gerstner's procedure for calculating multi-dimensional integrals but proves to be computationally significantly cheaper, while at the same it retains a similar accuracy as the original method. More importantly the issue of basis adaptivity has been investigated and two techniques have been implemented for constructing the sparse PCE of quantities of interest. Not using the traditional full PC basis set leads to further reduction in computational time since the high order grids necessary for accurately estimating the near zero expansion coefficients of polynomial basis vectors not needed in the PCE can be excluded from the calculation. Moreover the sparse PC representation of the response is easier to handle when used for sensitivity analysis or uncertainty propagation due to the smaller number of basis vectors. The developed grid and basis adaptive methods have been implemented in Matlab as the Fully Adaptive Non-Intrusive Spectral Projection (FANISP) algorithm and were tested on four analytical problems. These show consistent good performance both

  9. Parallel level-set methods on adaptive tree-based grids

    NASA Astrophysics Data System (ADS)

    Mirzadeh, Mohammad; Guittet, Arthur; Burstedde, Carsten; Gibou, Frederic

    2016-10-01

    We present scalable algorithms for the level-set method on dynamic, adaptive Quadtree and Octree Cartesian grids. The algorithms are fully parallelized and implemented using the MPI standard and the open-source p4est library. We solve the level set equation with a semi-Lagrangian method which, similar to its serial implementation, is free of any time-step restrictions. This is achieved by introducing a scalable global interpolation scheme on adaptive tree-based grids. Moreover, we present a simple parallel reinitialization scheme using the pseudo-time transient formulation. Both parallel algorithms scale on the Stampede supercomputer, where we are currently using up to 4096 CPU cores, the limit of our current account. Finally, a relevant application of the algorithms is presented in modeling a crystallization phenomenon by solving a Stefan problem, illustrating a level of detail that would be impossible to achieve without a parallel adaptive strategy. We believe that the algorithms presented in this article will be of interest and useful to researchers working with the level-set framework and modeling multi-scale physics in general.

  10. Adaptive Hierarchical Voltage Control of a DFIG-Based Wind Power Plant for a Grid Fault

    SciTech Connect

    Kim, Jinho; Muljadi, Eduard; Park, Jung-Wook; Kang, Yong Cheol

    2016-11-01

    This paper proposes an adaptive hierarchical voltage control scheme of a doubly-fed induction generator (DFIG)-based wind power plant (WPP) that can secure more reserve of reactive power (Q) in the WPP against a grid fault. To achieve this, each DFIG controller employs an adaptive reactive power to voltage (Q-V) characteristic. The proposed adaptive Q-V characteristic is temporally modified depending on the available Q capability of a DFIG; it is dependent on the distance from a DFIG to the point of common coupling (PCC). The proposed characteristic secures more Q reserve in the WPP than the fixed one. Furthermore, it allows DFIGs to promptly inject up to the Q limit, thereby improving the PCC voltage support. To avert an overvoltage after the fault clearance, washout filters are implemented in the WPP and DFIG controllers; they can prevent a surplus Q injection after the fault clearance by eliminating the accumulated values in the proportional-integral controllers of both controllers during the fault. Test results demonstrate that the scheme can improve the voltage support capability during the fault and suppress transient overvoltage after the fault clearance under scenarios of various system and fault conditions; therefore, it helps ensure grid resilience by supporting the voltage stability.

  11. Adaptive finite-volume WENO schemes on dynamically redistributed grids for compressible Euler equations

    NASA Astrophysics Data System (ADS)

    Pathak, Harshavardhana S.; Shukla, Ratnesh K.

    2016-08-01

    A high-order adaptive finite-volume method is presented for simulating inviscid compressible flows on time-dependent redistributed grids. The method achieves dynamic adaptation through a combination of time-dependent mesh node clustering in regions characterized by strong solution gradients and an optimal selection of the order of accuracy and the associated reconstruction stencil in a conservative finite-volume framework. This combined approach maximizes spatial resolution in discontinuous regions that require low-order approximations for oscillation-free shock capturing. Over smooth regions, high-order discretization through finite-volume WENO schemes minimizes numerical dissipation and provides excellent resolution of intricate flow features. The method including the moving mesh equations and the compressible flow solver is formulated entirely on a transformed time-independent computational domain discretized using a simple uniform Cartesian mesh. Approximations for the metric terms that enforce discrete geometric conservation law while preserving the fourth-order accuracy of the two-point Gaussian quadrature rule are developed. Spurious Cartesian grid induced shock instabilities such as carbuncles that feature in a local one-dimensional contact capturing treatment along the cell face normals are effectively eliminated through upwind flux calculation using a rotated Hartex-Lax-van Leer contact resolving (HLLC) approximate Riemann solver for the Euler equations in generalized coordinates. Numerical experiments with the fifth and ninth-order WENO reconstructions at the two-point Gaussian quadrature nodes, over a range of challenging test cases, indicate that the redistributed mesh effectively adapts to the dynamic flow gradients thereby improving the solution accuracy substantially even when the initial starting mesh is non-adaptive. The high adaptivity combined with the fifth and especially the ninth-order WENO reconstruction allows remarkably sharp capture of

  12. Time-dependent grid adaptation for meshes of triangles and tetrahedra

    NASA Technical Reports Server (NTRS)

    Rausch, Russ D.

    1993-01-01

    This paper presents in viewgraph form a method of optimizing grid generation for unsteady CFD flow calculations that distributes the numerical error evenly throughout the mesh. Adaptive meshing is used to locally enrich in regions of relatively large errors and to locally coarsen in regions of relatively small errors. The enrichment/coarsening procedures are robust for isotropic cells; however, enrichment of high aspect ratio cells may fail near boundary surfaces with relatively large curvature. The enrichment indicator worked well for the cases shown, but in general requires user supervision for a more efficient solution.

  13. Evaluating two sparse grid surrogates and two adaptation criteria for groundwater Bayesian uncertainty quantification

    NASA Astrophysics Data System (ADS)

    Zeng, Xiankui; Ye, Ming; Burkardt, John; Wu, Jichun; Wang, Dong; Zhu, Xiaobin

    2016-04-01

    Sparse grid (SG) stochastic collocation methods have been recently used to build accurate but cheap-to-run surrogates for groundwater models to reduce the computational burden of Bayesian uncertainty analysis. The surrogates can be built for either a log-likelihood function or state variables such as hydraulic head and solute concentration. Using a synthetic groundwater flow model, this study evaluates the log-likelihood and head surrogates in terms of the computational cost of building them, the accuracy of the surrogates, and the accuracy of the distributions of model parameters and predictions obtained using the surrogates. The head surrogates outperform the log-likelihood surrogates for the following four reasons: (1) the shape of the head response surface is smoother than that of the log-likelihood response surface in parameter space, (2) the head variation is smaller than the log-likelihood variation in parameter space, (3) the interpolation error of the head surrogates does not accumulate to be larger than the interpolation error of the log-likelihood surrogates, and (4) the model simulations needed for building one head surrogate can be recycled for building others. For both log-likelihood and head surrogates, adaptive sparse grids are built using two indicators: absolute error and relative error. The adaptive head surrogates are insensitive to the error indicators, because the ratio between the two indicators is hydraulic head, which has small variation in the parameter space. The adaptive log-likelihood surrogates based on the relative error indicators outperform those based on the absolute error indicators, because adaptation based on the relative error indicator puts more sparse-grid nodes in the areas in the parameter space where the log-likelihood is high. While our numerical study suggests building state-variable surrogates and using the relative error indicator for building log-likelihood surrogates, selecting appropriate type of surrogates and

  14. Fair Energy Scheduling for Vehicle-to-Grid Networks Using Adaptive Dynamic Programming.

    PubMed

    Xie, Shengli; Zhong, Weifeng; Xie, Kan; Yu, Rong; Zhang, Yan

    2016-08-01

    Research on the smart grid is being given enormous supports worldwide due to its great significance in solving environmental and energy crises. Electric vehicles (EVs), which are powered by clean energy, are adopted increasingly year by year. It is predictable that the huge charge load caused by high EV penetration will have a considerable impact on the reliability of the smart grid. Therefore, fair energy scheduling for EV charge and discharge is proposed in this paper. By using the vehicle-to-grid technology, the scheduler controls the electricity loads of EVs considering fairness in the residential distribution network. We propose contribution-based fairness, in which EVs with high contributions have high priorities to obtain charge energy. The contribution value is defined by both the charge/discharge energy and the timing of the action. EVs can achieve higher contribution values when discharging during the load peak hours. However, charging during this time will decrease the contribution values seriously. We formulate the fair energy scheduling problem as an infinite-horizon Markov decision process. The methodology of adaptive dynamic programming is employed to maximize the long-term fairness by processing online network training. The numerical results illustrate that the proposed EV energy scheduling is able to mitigate and flatten the peak load in the distribution network. Furthermore, contribution-based fairness achieves a fast recovery of EV batteries that have deeply discharged and guarantee fairness in the full charge time of all EVs.

  15. A numerical study of 2D detonation waves with adaptive finite volume methods on unstructured grids

    NASA Astrophysics Data System (ADS)

    Hu, Guanghui

    2017-02-01

    In this paper, a framework of adaptive finite volume solutions for the reactive Euler equations on unstructured grids is proposed. The main ingredients of the algorithm include a second order total variation diminishing Runge-Kutta method for temporal discretization, and the finite volume method with piecewise linear solution reconstruction of the conservative variables for the spatial discretization in which the least square method is employed for the reconstruction, and weighted essentially nonoscillatory strategy is used to restrain the potential numerical oscillation. To resolve the high demanding on the computational resources due to the stiffness of the system caused by the reaction term and the shock structure in the solutions, the h-adaptive method is introduced. OpenMP parallelization of the algorithm is also adopted to further improve the efficiency of the implementation. Several one and two dimensional benchmark tests on the ZND model are studied in detail, and numerical results successfully show the effectiveness of the proposed method.

  16. Parallel grid library with adaptive mesh refinement for development of highly scalable simulations

    NASA Astrophysics Data System (ADS)

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

    2012-04-01

    As the single CPU core performance is saturating while the number of cores in the fastest supercomputers increases exponentially, the parallel performance of simulations on distributed memory machines is crucial. At the same time, utilizing efficiently the large number of available cores presents a challenge, especially in simulations with run-time adaptive mesh refinement. We have developed a generic grid library (dccrg) aimed at finite volume simulations that is easy to use and scales well up to tens of thousands of cores. The grid has several attractive features: It 1) allows an arbitrary C++ class or structure to be used as cell data; 2) provides a simple interface for adaptive mesh refinement during a simulation; 3) encapsulates the details of MPI communication when updating the data of neighboring cells between processes; and 4) provides a simple interface to run-time load balancing, e.g. domain decomposition, through the Zoltan library. Dccrg is freely available for anyone to use, study and modify under the GNU Lesser General Public License v3. We will present the implementation of dccrg, simple and advanced usage examples and scalability results on various supercomputers and problems.

  17. An Adaptive Integration Model of Vector Polyline to DEM Data Based on Spherical Degeneration Quadtree Grids

    NASA Astrophysics Data System (ADS)

    Zhao, X. S.; Wang, J. J.; Yuan, Z. Y.; Gao, Y.

    2013-10-01

    Traditional geometry-based approach can maintain the characteristics of vector data. However, complex interpolation calculations limit its applications in high resolution and multi-source spatial data integration at spherical scale in digital earth systems. To overcome this deficiency, an adaptive integration model of vector polyline and spherical DEM is presented. Firstly, Degenerate Quadtree Grid (DQG) which is one of the partition models for global discrete grids, is selected as a basic framework for the adaptive integration model. Secondly, a novel shift algorithm is put forward based on DQG proximity search. The main idea of shift algorithm is that the vector node in a DQG cell moves to the cell corner-point when the displayed area of the cell is smaller or equal to a pixel of screen in order to find a new vector polyline approximate to the original one, which avoids lots of interpolation calculations and achieves seamless integration. Detailed operation steps are elaborated and the complexity of algorithm is analyzed. Thirdly, a prototype system has been developed by using VC++ language and OpenGL 3D API. ASTER GDEM data and DCW roads data sets of Jiangxi province in China are selected to evaluate the performance. The result shows that time consumption of shift algorithm decreased about 76% than that of geometry-based approach. Analysis on the mean shift error from different dimensions has been implemented. In the end, the conclusions and future works in the integration of vector data and DEM based on discrete global grids are also given.

  18. A solution-adaptive mesh algorithm for dynamic/static refinement of two and three dimensional grids

    NASA Technical Reports Server (NTRS)

    Benson, Rusty A.; Mcrae, D. S.

    1991-01-01

    An adaptive grid algorithm has been developed in two and three dimensions that can be used dynamically with a solver or as part of a grid refinement process. The algorithm employs a transformation from the Cartesian coordinate system to a general coordinate space, which is defined as a parallelepiped in three dimensions. A weighting function, independent for each coordinate direction, is developed that will provide the desired refinement criteria in regions of high solution gradient. The adaptation is performed in the general coordinate space and the new grid locations are returned to the Cartesian space via a simple, one-step inverse mapping. The algorithm for relocation of the mesh points in the parametric space is based on the center of mass for distributed weights. Dynamic solution-adaptive results are presented for laminar flows in two and three dimensions.

  19. A Freestream-Preserving High-Order Finite-Volume Method for Mapped Grids with Adaptive-Mesh Refinement

    SciTech Connect

    Guzik, S; McCorquodale, P; Colella, P

    2011-12-16

    A fourth-order accurate finite-volume method is presented for solving time-dependent hyperbolic systems of conservation laws on mapped grids that are adaptively refined in space and time. Novel considerations for formulating the semi-discrete system of equations in computational space combined with detailed mechanisms for accommodating the adapting grids ensure that conservation is maintained and that the divergence of a constant vector field is always zero (freestream-preservation property). Advancement in time is achieved with a fourth-order Runge-Kutta method.

  20. The use of the spectral method within the fast adaptive composite grid method

    SciTech Connect

    McKay, S.M.

    1994-12-31

    The use of efficient algorithms for the solution of partial differential equations has been sought for many years. The fast adaptive composite grid (FAC) method combines an efficient algorithm with high accuracy to obtain low cost solutions to partial differential equations. The FAC method achieves fast solution by combining solutions on different grids with varying discretizations and using multigrid like techniques to find fast solution. Recently, the continuous FAC (CFAC) method has been developed which utilizes an analytic solution within a subdomain to iterate to a solution of the problem. This has been shown to achieve excellent results when the analytic solution can be found. The CFAC method will be extended to allow solvers which construct a function for the solution, e.g., spectral and finite element methods. In this discussion, the spectral methods will be used to provide a fast, accurate solution to the partial differential equation. As spectral methods are more accurate than finite difference methods, the ensuing accuracy from this hybrid method outside of the subdomain will be investigated.

  1. An Adaptive Reputation-Based Algorithm for Grid Virtual Organization Formation

    NASA Astrophysics Data System (ADS)

    Cui, Yongrui; Li, Mingchu; Ren, Yizhi; Sakurai, Kouichi

    A novel adaptive reputation-based virtual organization formation is proposed. It restrains the bad performers effectively based on the consideration of the global experience of the evaluator and evaluates the direct trust relation between two grid nodes accurately by consulting the previous trust value rationally. It also consults and improves the reputation evaluation process in PathTrust model by taking account of the inter-organizational trust relationship and combines it with direct and recommended trust in a weighted way, which makes the algorithm more robust against collusion attacks. Additionally, the proposed algorithm considers the perspective of the VO creator and takes required VO services as one of the most important fine-grained evaluation criterion, which makes the algorithm more suitable for constructing VOs in grid environments that include autonomous organizations. Simulation results show that our algorithm restrains the bad performers and resists against fake transaction attacks and badmouth attacks effectively. It provides a clear advantage in the design of a VO infrastructure.

  2. GPU accelerated cell-based adaptive mesh refinement on unstructured quadrilateral grid

    NASA Astrophysics Data System (ADS)

    Luo, Xisheng; Wang, Luying; Ran, Wei; Qin, Fenghua

    2016-10-01

    A GPU accelerated inviscid flow solver is developed on an unstructured quadrilateral grid in the present work. For the first time, the cell-based adaptive mesh refinement (AMR) is fully implemented on GPU for the unstructured quadrilateral grid, which greatly reduces the frequency of data exchange between GPU and CPU. Specifically, the AMR is processed with atomic operations to parallelize list operations, and null memory recycling is realized to improve the efficiency of memory utilization. It is found that results obtained by GPUs agree very well with the exact or experimental results in literature. An acceleration ratio of 4 is obtained between the parallel code running on the old GPU GT9800 and the serial code running on E3-1230 V2. With the optimization of configuring a larger L1 cache and adopting Shared Memory based atomic operations on the newer GPU C2050, an acceleration ratio of 20 is achieved. The parallelized cell-based AMR processes have achieved 2x speedup on GT9800 and 18x on Tesla C2050, which demonstrates that parallel running of the cell-based AMR method on GPU is feasible and efficient. Our results also indicate that the new development of GPU architecture benefits the fluid dynamics computing significantly.

  3. Adaptive-Grid Methods for Phase Field Models of Microstructure Development

    NASA Technical Reports Server (NTRS)

    Provatas, Nikolas; Goldenfeld, Nigel; Dantzig, Jonathan A.

    1999-01-01

    In this work the authors show how the phase field model can be solved in a computationally efficient manner that opens a new large-scale simulational window on solidification physics. Our method uses a finite element, adaptive-grid formulation, and exploits the fact that the phase and temperature fields vary significantly only near the interface. We illustrate how our method allows efficient simulation of phase-field models in very large systems, and verify the predictions of solvability theory at intermediate undercooling. We then present new results at low undercoolings that suggest that solvability theory may not give the correct tip speed in that regime. We model solidification using the phase-field model used by Karma and Rappel.

  4. Preliminary Benchmarking of Plinian Eruption Simulations Using an Adaptive Grid Eulerian Technique

    NASA Astrophysics Data System (ADS)

    Peterson, A. H.; Ogden, D. E.; Wohletz, K. H.; Gisler, G.; Glatzmaier, G. A.

    2005-12-01

    The SAGE (SAIC Adaptive Grid Eulerian) code is an Eulerian hydrodynamics numerical technique employing adaptive mesh refinement at each cycle for every cell in 1-, 2-, and 3-D grids. It is primarily designed to solve high deformation flow of multiple materials and thus provides important capabilities for simulating volcanic eruption phenomena. Its multimaterial equation of state libraries includes a comprehensive coverage of water from solid ice through two-phase liquid and vapor to supercritical states approaching the Hugoniot, and extremely important aspect for simulating volcanic gases in general. In development are strength and failure rules that model non-Newtonian fluid/solid deformation. Because of the low effective sound speeds of eruptive mixtures, the facts that SAGE uses a piecewise, linear, multi-material, Gudonov numerical method to resolve shocks with second-order precision and exactly conserves mass, momentum, and energy, are a highly desirable attributes. Although this code has been previously used to simulate a volcanic eruption (i.e., eruption through a crater lake at Ruapehu volcano by Morrissey and Gisler), we are embarking in an effort to benchmark the code with CFDLib, a well-validated arbitrary Lagrangian-Eulerian code developed at Los Alamos National Laboratory. Through this effort we expect to better understand the strengths and weaknesses, the limitations, and provide direction for important enhancement of SAGE, and potentially provide the volcanological community with a powerful alternative to numerical codes currently available. At this point in our benchmarking, we demonstrate some results for fluid convection within a chamber and fluid jetting through a conduit.

  5. Bayesian strong gravitational-lens modelling on adaptive grids: objective detection of mass substructure in Galaxies

    NASA Astrophysics Data System (ADS)

    Vegetti, S.; Koopmans, L. V. E.

    2009-01-01

    We introduce a new adaptive and fully Bayesian grid-based method to model strong gravitational lenses with extended images. The primary goal of this method is to quantify the level of luminous and dark mass substructure in massive galaxies, through their effect on highly magnified arcs and Einstein rings. The method is adaptive on the source plane, where a Delaunay tessellation is defined according to the lens mapping of a regular grid on to the source plane. The Bayesian penalty function allows us to recover the best non-linear potential-model parameters and/or a grid-based potential correction and to objectively quantify the level of regularization for both the source and potential. In addition, we implement a Nested-Sampling technique to quantify the errors on all non-linear mass model parameters - marginalized over all source and regularization parameters - and allow an objective ranking of different potential models in terms of the marginalized evidence. In particular, we are interested in comparing very smooth lens mass models with ones that contain mass substructures. The algorithm has been tested on a range of simulated data sets, created from a model of a realistic lens system. One of the lens systems is characterized by a smooth potential with a power-law density profile, 12 include a Navarro, Frenk and White (NFW) dark matter substructure of different masses and at different positions and one contains two NFW dark substructures with the same mass but with different positions. Reconstruction of the source and lens potential for all of these systems shows the method is able, in a realistic scenario, to identify perturbations with masses >~107Msolar when located on the Einstein ring. For positions both inside and outside of the ring, masses of at least 109Msolar are required (i.e. roughly the Einstein ring of the perturber needs to overlap with that of the main lens). Our method provides a fully novel and objective test of mass substructure in massive

  6. Moving Overlapping Grids with Adaptive Mesh Refinement for High-Speed Reactive and Non-reactive Flow

    SciTech Connect

    Henshaw, W D; Schwendeman, D W

    2005-08-30

    We consider the solution of the reactive and non-reactive Euler equations on two-dimensional domains that evolve in time. The domains are discretized using moving overlapping grids. In a typical grid construction, boundary-fitted grids are used to represent moving boundaries, and these grids overlap with stationary background Cartesian grids. Block-structured adaptive mesh refinement (AMR) is used to resolve fine-scale features in the flow such as shocks and detonations. Refinement grids are added to base-level grids according to an estimate of the error, and these refinement grids move with their corresponding base-level grids. The numerical approximation of the governing equations takes place in the parameter space of each component grid which is defined by a mapping from (fixed) parameter space to (moving) physical space. The mapped equations are solved numerically using a second-order extension of Godunov's method. The stiff source term in the reactive case is handled using a Runge-Kutta error-control scheme. We consider cases when the boundaries move according to a prescribed function of time and when the boundaries of embedded bodies move according to the surface stress exerted by the fluid. In the latter case, the Newton-Euler equations describe the motion of the center of mass of the each body and the rotation about it, and these equations are integrated numerically using a second-order predictor-corrector scheme. Numerical boundary conditions at slip walls are described, and numerical results are presented for both reactive and non-reactive flows in order to demonstrate the use and accuracy of the numerical approach.

  7. Hierarchi problem

    NASA Astrophysics Data System (ADS)

    Rubin, Sergey G.

    2016-02-01

    The way to solve the hierarchy problem based on multidimensional gravity is discussed. Various metrics of deformed extra space are produced at the Planck scale. It is shown that the Higgs vacuum value depends on a metric of extra space and hence their different numerical values are realized in various universes. An interval of the Higgs vacuum values is proved include zero value. Our universe belongs to a set of universes the vacuum values of which are close to zero

  8. QoS Differential Scheduling in Cognitive-Radio-Based Smart Grid Networks: An Adaptive Dynamic Programming Approach.

    PubMed

    Yu, Rong; Zhong, Weifeng; Xie, Shengli; Zhang, Yan; Zhang, Yun

    2016-02-01

    As the next-generation power grid, smart grid will be integrated with a variety of novel communication technologies to support the explosive data traffic and the diverse requirements of quality of service (QoS). Cognitive radio (CR), which has the favorable ability to improve the spectrum utilization, provides an efficient and reliable solution for smart grid communications networks. In this paper, we study the QoS differential scheduling problem in the CR-based smart grid communications networks. The scheduler is responsible for managing the spectrum resources and arranging the data transmissions of smart grid users (SGUs). To guarantee the differential QoS, the SGUs are assigned to have different priorities according to their roles and their current situations in the smart grid. Based on the QoS-aware priority policy, the scheduler adjusts the channels allocation to minimize the transmission delay of SGUs. The entire transmission scheduling problem is formulated as a semi-Markov decision process and solved by the methodology of adaptive dynamic programming. A heuristic dynamic programming (HDP) architecture is established for the scheduling problem. By the online network training, the HDP can learn from the activities of primary users and SGUs, and adjust the scheduling decision to achieve the purpose of transmission delay minimization. Simulation results illustrate that the proposed priority policy ensures the low transmission delay of high priority SGUs. In addition, the emergency data transmission delay is also reduced to a significantly low level, guaranteeing the differential QoS in smart grid.

  9. A two-stage adaptive stochastic collocation method on nested sparse grids for multiphase flow in randomly heterogeneous porous media

    NASA Astrophysics Data System (ADS)

    Liao, Qinzhuo; Zhang, Dongxiao; Tchelepi, Hamdi

    2017-02-01

    A new computational method is proposed for efficient uncertainty quantification of multiphase flow in porous media with stochastic permeability. For pressure estimation, it combines the dimension-adaptive stochastic collocation method on Smolyak sparse grids and the Kronrod-Patterson-Hermite nested quadrature formulas. For saturation estimation, an additional stage is developed, in which the pressure and velocity samples are first generated by the sparse grid interpolation and then substituted into the transport equation to solve for the saturation samples, to address the low regularity problem of the saturation. Numerical examples are presented for multiphase flow with stochastic permeability fields to demonstrate accuracy and efficiency of the proposed two-stage adaptive stochastic collocation method on nested sparse grids.

  10. Axisymmetric modeling of cometary mass loading on an adaptively refined grid: MHD results

    NASA Technical Reports Server (NTRS)

    Gombosi, Tamas I.; Powell, Kenneth G.; De Zeeuw, Darren L.

    1994-01-01

    The first results of an axisymmetric magnetohydrodynamic (MHD) model of the interaction of an expanding cometary atmosphere with the solar wind are presented. The model assumes that far upstream the plasma flow lines are parallel to the magnetic field vector. The effects of mass loading and ion-neutral friction are taken into account by the governing equations, whcih are solved on an adaptively refined unstructured grid using a Monotone Upstream Centered Schemes for Conservative Laws (MUSCL)-type numerical technique. The combination of the adaptive refinement with the MUSCL-scheme allows the entire cometary atmosphere to be modeled, while still resolving both the shock and the near nucleus of the comet. The main findingsare the following: (1) A shock is formed approximately = 0.45 Mkm upstream of the comet (its location is controlled by the sonic and Alfvenic Mach numbers of the ambient solar wind flow and by the cometary mass addition rate). (2) A contact surface is formed approximately = 5,600 km upstream of the nucleus separating an outward expanding cometary ionosphere from the nearly stagnating solar wind flow. The location of the contact surface is controlled by the upstream flow conditions, the mass loading rate and the ion-neutral drag. The contact surface is also the boundary of the diamagnetic cavity. (3) A closed inner shock terminates the supersonic expansion of the cometary ionosphere. This inner shock is closer to the nucleus on dayside than on the nightside.

  11. Application of adaptive hierarchical sparse grid collocation to the uncertainty quantification of nuclear reactor simulators

    SciTech Connect

    Yankov, A.; Downar, T.

    2013-07-01

    Recent efforts in the application of uncertainty quantification to nuclear systems have utilized methods based on generalized perturbation theory and stochastic sampling. While these methods have proven to be effective they both have major drawbacks that may impede further progress. A relatively new approach based on spectral elements for uncertainty quantification is applied in this paper to several problems in reactor simulation. Spectral methods based on collocation attempt to couple the approximation free nature of stochastic sampling methods with the determinism of generalized perturbation theory. The specific spectral method used in this paper employs both the Smolyak algorithm and adaptivity by using Newton-Cotes collocation points along with linear hat basis functions. Using this approach, a surrogate model for the outputs of a computer code is constructed hierarchically by adaptively refining the collocation grid until the interpolant is converged to a user-defined threshold. The method inherently fits into the framework of parallel computing and allows for the extraction of meaningful statistics and data that are not within reach of stochastic sampling and generalized perturbation theory. This paper aims to demonstrate the advantages of spectral methods-especially when compared to current methods used in reactor physics for uncertainty quantification-and to illustrate their full potential. (authors)

  12. Adaptive grid embedding for the two-dimensional flux-split Euler equations. M.S. Thesis

    NASA Technical Reports Server (NTRS)

    Warren, Gary Patrick

    1990-01-01

    A numerical algorithm is presented for solving the 2-D flux-split Euler equations using a multigrid method with adaptive grid embedding. The method uses an unstructured data set along with a system of pointers for communication on the irregularly shaped grid topologies. An explicit two-stage time advancement scheme is implemented. A multigrid algorithm is used to provide grid level communication and to accelerate the convergence of the solution to steady state. Results are presented for a subcritical airfoil and a transonic airfoil with 3 levels of adaptation. Comparisons are made with a structured upwind Euler code which uses the same flux integration techniques of the present algorithm. Good agreement is obtained with converged surface pressure coefficients. The lift coefficients of the adaptive code are within 2 1/2 percent of the structured code for the sub-critical case and within 4 1/2 percent of the structured code for the transonic case using approximately one-third the number of grid points.

  13. COLLABORATIVE RESEARCH: CONTINUOUS DYNAMIC GRID ADAPTATION IN A GLOBAL ATMOSPHERIC MODEL: APPLICATION AND REFINEMENT

    SciTech Connect

    Gutowski, William J.; Prusa, Joseph M.; Smolarkiewicz, Piotr K.

    2012-05-08

    This project had goals of advancing the performance capabilities of the numerical general circulation model EULAG and using it to produce a fully operational atmospheric global climate model (AGCM) that can employ either static or dynamic grid stretching for targeted phenomena. The resulting AGCM combined EULAG's advanced dynamics core with the "physics" of the NCAR Community Atmospheric Model (CAM). Effort discussed below shows how we improved model performance and tested both EULAG and the coupled CAM-EULAG in several ways to demonstrate the grid stretching and ability to simulate very well a wide range of scales, that is, multi-scale capability. We leveraged our effort through interaction with an international EULAG community that has collectively developed new features and applications of EULAG, which we exploited for our own work summarized here. Overall, the work contributed to over 40 peer-reviewed publications and over 70 conference/workshop/seminar presentations, many of them invited. 3a. EULAG Advances EULAG is a non-hydrostatic, parallel computational model for all-scale geophysical flows. EULAG's name derives from its two computational options: EULerian (flux form) or semi-LAGrangian (advective form). The model combines nonoscillatory forward-in-time (NFT) numerical algorithms with a robust elliptic Krylov solver. A signature feature of EULAG is that it is formulated in generalized time-dependent curvilinear coordinates. In particular, this enables grid adaptivity. In total, these features give EULAG novel advantages over many existing dynamical cores. For EULAG itself, numerical advances included refining boundary conditions and filters for optimizing model performance in polar regions. We also added flexibility to the model's underlying formulation, allowing it to work with the pseudo-compressible equation set of Durran in addition to EULAG's standard anelastic formulation. Work in collaboration with others also extended the demonstrated range of

  14. Validation of elastic registration algorithms based on adaptive irregular grids for medical applications

    NASA Astrophysics Data System (ADS)

    Franz, Astrid; Carlsen, Ingwer C.; Renisch, Steffen; Wischmann, Hans-Aloys

    2006-03-01

    Elastic registration of medical images is an active field of current research. Registration algorithms have to be validated in order to show that they fulfill the requirements of a particular clinical application. Furthermore, validation strategies compare the performance of different registration algorithms and can hence judge which algorithm is best suited for a target application. In the literature, validation strategies for rigid registration algorithms have been analyzed. For a known ground truth they assess the displacement error at a few landmarks, which is not sufficient for elastic transformations described by a huge number of parameters. Hence we consider the displacement error averaged over all pixels in the whole image or in a region-of-interest of clinical relevance. Using artificially, but realistically deformed images of the application domain, we use this quality measure to analyze an elastic registration based on transformations defined on adaptive irregular grids for the following clinical applications: Magnetic Resonance (MR) images of freely moving joints for orthopedic investigations, thoracic Computed Tomography (CT) images for the detection of pulmonary embolisms, and transmission images as used for the attenuation correction and registration of independently acquired Positron Emission Tomography (PET) and CT images. The definition of a region-of-interest allows to restrict the analysis of the registration accuracy to clinically relevant image areas. The behaviour of the displacement error as a function of the number of transformation control points and their placement can be used for identifying the best strategy for the initial placement of the control points.

  15. A general hybrid radiation transport scheme for star formation simulations on an adaptive grid

    SciTech Connect

    Klassen, Mikhail; Pudritz, Ralph E.; Kuiper, Rolf; Peters, Thomas; Banerjee, Robi; Buntemeyer, Lars

    2014-12-10

    Radiation feedback plays a crucial role in the process of star formation. In order to simulate the thermodynamic evolution of disks, filaments, and the molecular gas surrounding clusters of young stars, we require an efficient and accurate method for solving the radiation transfer problem. We describe the implementation of a hybrid radiation transport scheme in the adaptive grid-based FLASH general magnetohydrodyanmics code. The hybrid scheme splits the radiative transport problem into a raytracing step and a diffusion step. The raytracer captures the first absorption event, as stars irradiate their environments, while the evolution of the diffuse component of the radiation field is handled by a flux-limited diffusion solver. We demonstrate the accuracy of our method through a variety of benchmark tests including the irradiation of a static disk, subcritical and supercritical radiative shocks, and thermal energy equilibration. We also demonstrate the capability of our method for casting shadows and calculating gas and dust temperatures in the presence of multiple stellar sources. Our method enables radiation-hydrodynamic studies of young stellar objects, protostellar disks, and clustered star formation in magnetized, filamentary environments.

  16. A Domain-Decomposed Multi-Level Method for Adaptively Refined Cartesian Grids with Embedded Boundaries

    NASA Technical Reports Server (NTRS)

    Aftosmis, M. J.; Berger, M. J.; Adomavicius, G.; Nixon, David (Technical Monitor)

    1998-01-01

    The work presents a new method for on-the-fly domain decomposition technique for mapping grids and solution algorithms to parallel machines, and is applicable to both shared-memory and message-passing architectures. It will be demonstrated on the Cray T3E, HP Exemplar, and SGI Origin 2000. Computing time has been secured on all these platforms. The decomposition technique is an outgrowth of techniques used in computational physics for simulations of N-body problems and the event horizons of black holes, and has not been previously used by the CFD community. Since the technique offers on-the-fly partitioning, it offers a substantial increase in flexibility for computing in heterogeneous environments, where the number of available processors may not be known at the time of job submission. In addition, since it is dynamic it permits the job to be repartitioned without global communication in cases where additional processors become available after the simulation has begun, or in cases where dynamic mesh adaptation changes the mesh size during the course of a simulation. The platform for this partitioning strategy is a completely new Cartesian Euler solver tarcreted at parallel machines which may be used in conjunction with Ames' "Cart3D" arbitrary geometry simulation package.

  17. A General Hybrid Radiation Transport Scheme for Star Formation Simulations on an Adaptive Grid

    NASA Astrophysics Data System (ADS)

    Klassen, Mikhail; Kuiper, Rolf; Pudritz, Ralph E.; Peters, Thomas; Banerjee, Robi; Buntemeyer, Lars

    2014-12-01

    Radiation feedback plays a crucial role in the process of star formation. In order to simulate the thermodynamic evolution of disks, filaments, and the molecular gas surrounding clusters of young stars, we require an efficient and accurate method for solving the radiation transfer problem. We describe the implementation of a hybrid radiation transport scheme in the adaptive grid-based FLASH general magnetohydrodyanmics code. The hybrid scheme splits the radiative transport problem into a raytracing step and a diffusion step. The raytracer captures the first absorption event, as stars irradiate their environments, while the evolution of the diffuse component of the radiation field is handled by a flux-limited diffusion solver. We demonstrate the accuracy of our method through a variety of benchmark tests including the irradiation of a static disk, subcritical and supercritical radiative shocks, and thermal energy equilibration. We also demonstrate the capability of our method for casting shadows and calculating gas and dust temperatures in the presence of multiple stellar sources. Our method enables radiation-hydrodynamic studies of young stellar objects, protostellar disks, and clustered star formation in magnetized, filamentary environments.

  18. Estimation of Model's Marginal likelihood Using Adaptive Sparse Grid Surrogates in Bayesian Model Averaging

    NASA Astrophysics Data System (ADS)

    Zeng, X.

    2015-12-01

    A large number of model executions are required to obtain alternative conceptual models' predictions and their posterior probabilities in Bayesian model averaging (BMA). The posterior model probability is estimated through models' marginal likelihood and prior probability. The heavy computation burden hinders the implementation of BMA prediction, especially for the elaborated marginal likelihood estimator. For overcoming the computation burden of BMA, an adaptive sparse grid (SG) stochastic collocation method is used to build surrogates for alternative conceptual models through the numerical experiment of a synthetical groundwater model. BMA predictions depend on model posterior weights (or marginal likelihoods), and this study also evaluated four marginal likelihood estimators, including arithmetic mean estimator (AME), harmonic mean estimator (HME), stabilized harmonic mean estimator (SHME), and thermodynamic integration estimator (TIE). The results demonstrate that TIE is accurate in estimating conceptual models' marginal likelihoods. The BMA-TIE has better predictive performance than other BMA predictions. TIE has high stability for estimating conceptual model's marginal likelihood. The repeated estimated conceptual model's marginal likelihoods by TIE have significant less variability than that estimated by other estimators. In addition, the SG surrogates are efficient to facilitate BMA predictions, especially for BMA-TIE. The number of model executions needed for building surrogates is 4.13%, 6.89%, 3.44%, and 0.43% of the required model executions of BMA-AME, BMA-HME, BMA-SHME, and BMA-TIE, respectively.

  19. Features of CPB: a Poisson-Boltzmann solver that uses an adaptive Cartesian grid.

    PubMed

    Fenley, Marcia O; Harris, Robert C; Mackoy, Travis; Boschitsch, Alexander H

    2015-02-05

    The capabilities of an adaptive Cartesian grid (ACG)-based Poisson-Boltzmann (PB) solver (CPB) are demonstrated. CPB solves various PB equations with an ACG, built from a hierarchical octree decomposition of the computational domain. This procedure decreases the number of points required, thereby reducing computational demands. Inside the molecule, CPB solves for the reaction-field component (ϕrf ) of the electrostatic potential (ϕ), eliminating the charge-induced singularities in ϕ. CPB can also use a least-squares reconstruction method to improve estimates of ϕ at the molecular surface. All surfaces, which include solvent excluded, Gaussians, and others, are created analytically, eliminating errors associated with triangulated surfaces. These features allow CPB to produce detailed surface maps of ϕ and compute polar solvation and binding free energies for large biomolecular assemblies, such as ribosomes and viruses, with reduced computational demands compared to other Poisson-Boltzmann equation solvers. The reader is referred to http://www.continuum-dynamics.com/solution-mm.html for how to obtain the CPB software.

  20. Adaptive control paradigm for photovoltaic and solid oxide fuel cell in a grid-integrated hybrid renewable energy system

    PubMed Central

    Khan, Laiq

    2017-01-01

    The hybrid power system (HPS) is an emerging power generation scheme due to the plentiful availability of renewable energy sources. Renewable energy sources are characterized as highly intermittent in nature due to meteorological conditions, while the domestic load also behaves in a quite uncertain manner. In this scenario, to maintain the balance between generation and load, the development of an intelligent and adaptive control algorithm has preoccupied power engineers and researchers. This paper proposes a Hermite wavelet embedded NeuroFuzzy indirect adaptive MPPT (maximum power point tracking) control of photovoltaic (PV) systems to extract maximum power and a Hermite wavelet incorporated NeuroFuzzy indirect adaptive control of Solid Oxide Fuel Cells (SOFC) to obtain a swift response in a grid-connected hybrid power system. A comprehensive simulation testbed for a grid-connected hybrid power system (wind turbine, PV cells, SOFC, electrolyzer, battery storage system, supercapacitor (SC), micro-turbine (MT) and domestic load) is developed in Matlab/Simulink. The robustness and superiority of the proposed indirect adaptive control paradigm are evaluated through simulation results in a grid-connected hybrid power system testbed by comparison with a conventional PI (proportional and integral) control system. The simulation results verify the effectiveness of the proposed control paradigm. PMID:28329015

  1. Adaptive control paradigm for photovoltaic and solid oxide fuel cell in a grid-integrated hybrid renewable energy system.

    PubMed

    Mumtaz, Sidra; Khan, Laiq

    2017-01-01

    The hybrid power system (HPS) is an emerging power generation scheme due to the plentiful availability of renewable energy sources. Renewable energy sources are characterized as highly intermittent in nature due to meteorological conditions, while the domestic load also behaves in a quite uncertain manner. In this scenario, to maintain the balance between generation and load, the development of an intelligent and adaptive control algorithm has preoccupied power engineers and researchers. This paper proposes a Hermite wavelet embedded NeuroFuzzy indirect adaptive MPPT (maximum power point tracking) control of photovoltaic (PV) systems to extract maximum power and a Hermite wavelet incorporated NeuroFuzzy indirect adaptive control of Solid Oxide Fuel Cells (SOFC) to obtain a swift response in a grid-connected hybrid power system. A comprehensive simulation testbed for a grid-connected hybrid power system (wind turbine, PV cells, SOFC, electrolyzer, battery storage system, supercapacitor (SC), micro-turbine (MT) and domestic load) is developed in Matlab/Simulink. The robustness and superiority of the proposed indirect adaptive control paradigm are evaluated through simulation results in a grid-connected hybrid power system testbed by comparison with a conventional PI (proportional and integral) control system. The simulation results verify the effectiveness of the proposed control paradigm.

  2. Grid generation and adaptation for the Direct Simulation Monte Carlo Method. [for complex flows past wedges and cones

    NASA Technical Reports Server (NTRS)

    Olynick, David P.; Hassan, H. A.; Moss, James N.

    1988-01-01

    A grid generation and adaptation procedure based on the method of transfinite interpolation is incorporated into the Direct Simulation Monte Carlo Method of Bird. In addition, time is advanced based on a local criterion. The resulting procedure is used to calculate steady flows past wedges and cones. Five chemical species are considered. In general, the modifications result in a reduced computational effort. Moreover, preliminary results suggest that the simulation method is time step dependent if requirements on cell sizes are not met.

  3. MAGNETIC GRID

    DOEpatents

    Post, R.F.

    1960-08-01

    An electronic grid is designed employing magnetic forces for controlling the passage of charged particles. The grid is particularly applicable to use in gas-filled tubes such as ignitrons. thyratrons, etc., since the magnetic grid action is impartial to the polarity of the charged particles and, accordingly. the sheath effects encountered with electrostatic grids are not present. The grid comprises a conductor having sections spaced apart and extending in substantially opposite directions in the same plane, the ends of the conductor being adapted for connection to a current source.

  4. Adapting a commercial power system simulator for smart grid based system study and vulnerability assessment

    NASA Astrophysics Data System (ADS)

    Navaratne, Uditha Sudheera

    The smart grid is the future of the power grid. Smart meters and the associated network play a major role in the distributed system of the smart grid. Advance Metering Infrastructure (AMI) can enhance the reliability of the grid, generate efficient energy management opportunities and many innovations around the future smart grid. These innovations involve intense research not only on the AMI network itself but as also on the influence an AMI network can have upon the rest of the power grid. This research describes a smart meter testbed with hardware in loop that can facilitate future research in an AMI network. The smart meters in the testbed were developed such that their functionality can be customized to simulate any given scenario such as integrating new hardware components into a smart meter or developing new encryption algorithms in firmware. These smart meters were integrated into the power system simulator to simulate the power flow variation in the power grid on different AMI activities. Each smart meter in the network also provides a communication interface to the home area network. This research delivers a testbed for emulating the AMI activities and monitoring their effect on the smart grid.

  5. An adaptive discretization of compressible flow using a multitude of moving Cartesian grids

    NASA Astrophysics Data System (ADS)

    Qiu, Linhai; Lu, Wenlong; Fedkiw, Ronald

    2016-01-01

    We present a novel method for simulating compressible flow on a multitude of Cartesian grids that can rotate and translate. Following previous work, we split the time integration into an explicit step for advection followed by an implicit solve for the pressure. A second order accurate flux based scheme is devised to handle advection on each moving Cartesian grid using an effective characteristic velocity that accounts for the grid motion. In order to avoid the stringent time step restriction imposed by very fine grids, we propose strategies that allow for a fluid velocity CFL number larger than 1. The stringent time step restriction related to the sound speed is alleviated by formulating an implicit linear system in order to find a pressure consistent with the equation of state. This implicit linear system crosses overlapping Cartesian grid boundaries by utilizing local Voronoi meshes to connect the various degrees of freedom obtaining a symmetric positive-definite system. Since a straightforward application of this technique contains an inherent central differencing which can result in spurious oscillations, we introduce a new high order diffusion term similar in spirit to ENO-LLF but solved for implicitly in order to avoid any associated time step restrictions. The method is conservative on each grid, as well as globally conservative on the background grid that contains all other grids. Moreover, a conservative interpolation operator is devised for conservatively remapping values in order to keep them consistent across different overlapping grids. Additionally, the method is extended to handle two-way solid fluid coupling in a monolithic fashion including cases (in the appendix) where solids in close proximity do not properly allow for grid based degrees of freedom in between them.

  6. Three-dimensional computational fluid dynamics modeling of particle uptake by an occupational air sampler using manually-scaled and adaptive grids.

    PubMed

    Landázuri, Andrea C; Sáez, A Eduardo; Anthony, T Renée

    2016-05-01

    This work presents fluid flow and particle trajectory simulation studies to determine the aspiration efficiency of a horizontally oriented occupational air sampler using computational fluid dynamics (CFD). Grid adaption and manual scaling of the grids were applied to two sampler prototypes based on a 37-mm cassette. The standard k-ε model was used to simulate the turbulent air flow and a second order streamline-upwind discretization scheme was used to stabilize convective terms of the Navier-Stokes equations. Successively scaled grids for each configuration were created manually and by means of grid adaption using the velocity gradient in the main flow direction. Solutions were verified to assess iterative convergence, grid independence and monotonic convergence. Particle aspiration efficiencies determined for both prototype samplers were undistinguishable, indicating that the porous filter does not play a noticeable role in particle aspiration. Results conclude that grid adaption is a powerful tool that allows to refine specific regions that require lots of detail and therefore better resolve flow detail. It was verified that adaptive grids provided a higher number of locations with monotonic convergence than the manual grids and required the least computational effort.

  7. Grid generation strategies for turbomachinery configurations

    NASA Technical Reports Server (NTRS)

    Lee, K. D.; Henderson, T. L.

    1991-01-01

    Turbomachinery flow fields involve unique grid generation issues due to their geometrical and physical characteristics. Several strategic approaches are discussed to generate quality grids. The grid quality is further enhanced through blending and adapting. Grid blending smooths the grids locally through averaging and diffusion operators. Grid adaptation redistributes the grid points based on a grid quality assessment. These methods are demonstrated with several examples.

  8. 3-D grid refinement using the University of Michigan adaptive mesh library for a pure advective test

    NASA Astrophysics Data System (ADS)

    Oehmke, R.; Vandenberg, D.; Andronova, N.; Penner, J.; Stout, Q.; Zubov, V.; Jablonowski, C.

    2008-05-01

    The numerical representation of the partial differential equations (PDE) for high resolution atmospheric dynamical and physical features requires division of the atmospheric volume into a set of 3D grids, each of which has a not quite rectangular form. Each location on the grid contains multiple data that together represent the state of Earth's atmosphere. For successful numerical integration of the PDEs the size of each grid box is used to define the Courant-Friedrichs-Levi criterion in setting the time step. 3D adaptive representations of a sphere are needed to represent the evolution of clouds. In this paper we present the University of Michigan adaptive mesh library - a library that supports the production of parallel codes with use of adaptation on a sphere. The library manages the block-structured data layout, handles ghost cell updates among neighboring blocks and splits blocks as refinements occur. The library has several modules that provide a layer of abstraction for adaptive refinement: blocks, which contain individual cells of user data; shells — the global geometry for the problem, including a sphere, reduced sphere, and now a 3D sphere; a load balancer for placement of blocks onto processors; and a communication support layer which encapsulates all data movement. Users provide data manipulation functions for performing interpolation of user data when refining blocks. We rigorously test the library using refinement of the modeled vertical transport of a tracer with prescribed atmospheric sources and sinks. It is both a 2 and a 3D test, and bridges the performance of the model's dynamics and physics needed for inclusion of cloud formation.

  9. Computations of Unsteady Viscous Compressible Flows Using Adaptive Mesh Refinement in Curvilinear Body-fitted Grid Systems

    NASA Technical Reports Server (NTRS)

    Steinthorsson, E.; Modiano, David; Colella, Phillip

    1994-01-01

    A methodology for accurate and efficient simulation of unsteady, compressible flows is presented. The cornerstones of the methodology are a special discretization of the Navier-Stokes equations on structured body-fitted grid systems and an efficient solution-adaptive mesh refinement technique for structured grids. The discretization employs an explicit multidimensional upwind scheme for the inviscid fluxes and an implicit treatment of the viscous terms. The mesh refinement technique is based on the AMR algorithm of Berger and Colella. In this approach, cells on each level of refinement are organized into a small number of topologically rectangular blocks, each containing several thousand cells. The small number of blocks leads to small overhead in managing data, while their size and regular topology means that a high degree of optimization can be achieved on computers with vector processors.

  10. Dynamic response of shock waves in transonic diffuser and supersonic inlet - An analysis with the Navier-Stokes equations and adaptive grid

    NASA Technical Reports Server (NTRS)

    Liu, N.-S.; Shamroth, S. J.; Mcdonald, H.

    1984-01-01

    An existing method which solves the multi-dimensional ensemble-averaged compressible time-dependent Navier-Stokes equations in conjunction with mixing length turbulence model and shock capturing technique has been extended to include the shock-tracking adaptive grid systems. The numerical scheme for solving the governing equations is based on a linearized block implicit approach. The effects of grid-motion and grid-distribution on the calculated flow solutions have been studied in relative detail and this is carried out in the context of physically steady, shocked flows computed with non-stationary grids. Subsequently, the unsteady dynamics of the flows occurring in a supercritically operated transonic diffuser and a mixed compression supersonic inlet have been investigated with the adaptive grid systems by solving the Navier-Stokes equations.

  11. Adaptive analog-SSOR iterative method for solving grid equations with nonselfadjoint operators

    NASA Astrophysics Data System (ADS)

    Alekseenko, Elena; Sukhinov, Alexander; Chistyakov, Alexander; Shishenya, Alexander; Roux, Bernard

    2013-04-01

    Motion models of wave processes in the coastal zone are highly demanded in the projection and construction of coastal surface structures and breakwaters, and also as a component of other models. The most common of the grid approaches is currently vof-method. A significant drawback of this method is in the necessity to solve the convection equation to find fullness of cells. The numerical solution of this equation leads to a strong grid viscosity and "smearing" of the interface. In this paper, we propose a method, which is based on the idea of using a fill, as in vof method, but its conversion is not required to solve the equation of convection. Thus in this work, a mathematical model for the wave hydrodynamics problem, describing wash ashore and taking into account such physical parameters as turbulent exchange, complexity of domain and coastal line geometry, and bottom friction is developed. For the given mathematical model a discrete model is constructed, taking into account dynamical changing of the calculation domain. Discretization of the model is performed on the structured rectangular grid with a new developed finite-volume technique that takes into account fullness of the grid cells that allows describing geometry more accurate. Proposed technique allows improving the real accuracy of a solution in case of complex domain geometry, by improving approximation of the boundary. A software implementation and numerical experiments of the posed problem of the wave hydrodynamics is performed. The results of numerical experiments show the feasibility of using discrete mathematical models of processes that take into account fullness of grid cells, for the simulation of systems with complex geometry of the border. Numerical experiments show that the use of this technique sufficiently smooth solutions are obtained even on coarse grids.

  12. A Dynamically Adaptive Arbitrary Lagrangian-Eulerian Method for Hydrodynamics

    SciTech Connect

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

    2002-10-19

    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. The novel components of the combined ALE-AMR method hinge upon the integration of traditional AMR techniques with both staggered grid Lagrangian operators as well as elliptic relaxation operators on moving, deforming mesh hierarchies. Numerical examples demonstrate the utility of the method in performing detailed three-dimensional shock-driven instability calculations.

  13. A Dynamically Adaptive Arbitrary Lagrangian-Eulerian Method for Hydrodynamics

    SciTech Connect

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

    2004-01-28

    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. The novel components of the combined ALE-AMR method hinge upon the integration of traditional AMR techniques with both staggered grid Lagrangian operators as well as elliptic relaxation operators on moving, deforming mesh hierarchies. Numerical examples demonstrate the utility of the method in performing detailed three-dimensional shock-driven instability calculations.

  14. Parallel Adaptive Mesh Refinement Library

    NASA Technical Reports Server (NTRS)

    Mac-Neice, Peter; Olson, Kevin

    2005-01-01

    Parallel Adaptive Mesh Refinement Library (PARAMESH) is a package of Fortran 90 subroutines designed to provide a computer programmer with an easy route to extension of (1) a previously written serial code that uses a logically Cartesian structured mesh into (2) a parallel code with adaptive mesh refinement (AMR). Alternatively, in its simplest use, and with minimal effort, PARAMESH can operate as a domain-decomposition tool for users who want to parallelize their serial codes but who do not wish to utilize adaptivity. The package builds a hierarchy of sub-grids to cover the computational domain of a given application program, with spatial resolution varying to satisfy the demands of the application. The sub-grid blocks form the nodes of a tree data structure (a quad-tree in two or an oct-tree in three dimensions). Each grid block has a logically Cartesian mesh. The package supports one-, two- and three-dimensional models.

  15. Control Dynamics of Adaptive and Scalable Power and Energy Systems for Military Micro Grids

    DTIC Science & Technology

    2006-12-01

    quality at the levels required for Army installations ( Fairley 2004; Apt et al. 2004; Sheblé 2006; Weaver 2004; EPRI 2003; Silberman 2001; Blum 2004; Behr...Challenges of the 21st Century: 2003 Summary and Synthesis. Report # 1010929. Fairley , P. 2004. The unruly power grid. IEEE Spectrum 41(8): 16-21

  16. COLLABORATIVE RESEARCH: CONTINUOUS DYNAMIC GRID ADAPTATION IN A GLOBAL ATMOSPHERIC MODEL: APPLICATION AND REFINEMENT

    SciTech Connect

    Prusa, Joseph

    2012-05-08

    This project had goals of advancing the performance capabilities of the numerical general circulation model EULAG and using it to produce a fully operational atmospheric global climate model (AGCM) that can employ either static or dynamic grid stretching for targeted phenomena. The resulting AGCM combined EULAG's advanced dynamics core with the physics of the NCAR Community Atmospheric Model (CAM). Effort discussed below shows how we improved model performance and tested both EULAG and the coupled CAM-EULAG in several ways to demonstrate the grid stretching and ability to simulate very well a wide range of scales, that is, multi-scale capability. We leveraged our effort through interaction with an international EULAG community that has collectively developed new features and applications of EULAG, which we exploited for our own work summarized here. Overall, the work contributed to over 40 peer- reviewed publications and over 70 conference/workshop/seminar presentations, many of them invited.

  17. Parallel Domain Connectivity Algorithm for Unsteady Flow Computations using Overlapping and Adaptive Grids

    DTIC Science & Technology

    2010-01-01

    ARC3DC code employs third-order temporal discretizations using a multi-stage Runge – Kutta time-stepping framework and is capable of up to fifth-order...lean cache-friendly data structure and flow solution procedures for isotropic Carte- sian grids and (2) explicit time stepping (using 3-stage Runge ...fringes and holes (termed hole-cutting) can be done in one of two ways, explicitly or implicitly. Explicit hole cutting means the hole boundaries are

  18. Parallel Unsteady Overset Mesh Methodology for Adaptive and Moving Grids with Multiple Solvers

    DTIC Science & Technology

    2010-01-01

    Runge - Kutta time-stepping framework and is capable of up to fifth-order accurate spatial discretizations. Further, the Cartesian grids in the off-body are...no user intervention or explicit hole-map specification is necessary. The capabilities and performance of the package are presented for several test...connectivity approaches have been investigated in the past by various research groups . The prominent among them are PEGASUS5 [5], OVERFLOW-DCF [6, 7], SUGGAR

  19. Parallel Unsteady Overset Mesh Methodology for a Multi-Solver Paradigm with Adaptive Cartesian Grids

    DTIC Science & Technology

    2008-08-21

    a multi-stage Runge - Kutta time-stepping framework and is capable of up to fifth-order accurate spatial discretizations. Further, the Cartesian grids...cutting methodology such that no user inter- vention or explicit hole-map specification is necessary. The capabilities and performance of the package are...application to rotorcraft aerodynamics. Several Domain-Connectivity approaches have been investigated in the past by various research groups . The

  20. 3D Composite Grids Using Bezier Curves and Surfaces in Component Adaptive Methods

    DTIC Science & Technology

    1993-08-01

    bounding curves, an algebraic grid generation method, such as transfinite interpolation of these curves, results in a definition of the interior of...dependent variables is assembled and solved iteratively. The interior generated by the transfinite interpolation technique is used as the initial guess...The boundaries of the face are first parameterized in this fashion Transfinite interpolation is then employed first to obtain a parameterization of

  1. Adaptive Transmission Planning: Implementing a New Paradigm for Managing Economic Risks in Grid Expansion

    SciTech Connect

    Hobbs, Benjamin F.; Xu, Qingyu; Ho, Jonathan; Donohoo, Pearl; Kasina, Saamrat; Ouyang, Jasmine; Park, Sang Woo; Eto, Joseph; Satyal, Vijay

    2016-07-01

    The problem of whether, where, when, and what types of transmission facilities to build in terms of minimizing costs and maximizing net economic benefits has been a challenge for the power industry from the beginning-ever since Thomas Edison debated whether to create longer dc distribution lines (with their high losses) or build new power stations in expanding his urban markets. Today's planning decisions are far more complex, as grids cover the continent and new transmission, generation, and demand-side technologies emerge.

  2. A parallel second-order adaptive mesh algorithm for incompressible flow in porous media.

    PubMed

    Pau, George S H; Almgren, Ann S; Bell, John B; Lijewski, Michael J

    2009-11-28

    In this paper, we present a second-order accurate adaptive algorithm for solving multi-phase, incompressible flow in porous media. We assume a multi-phase form of Darcy's law with relative permeabilities given as a function of the phase saturation. The remaining equations express conservation of mass for the fluid constituents. In this setting, the total velocity, defined to be the sum of the phase velocities, is divergence free. The basic integration method is based on a total-velocity splitting approach in which we solve a second-order elliptic pressure equation to obtain a total velocity. This total velocity is then used to recast component conservation equations as nonlinear hyperbolic equations. Our approach to adaptive refinement uses a nested hierarchy of logically rectangular grids with simultaneous refinement of the grids in both space and time. The integration algorithm on the grid hierarchy is a recursive procedure in which coarse grids are advanced in time, fine grids are advanced multiple steps to reach the same time as the coarse grids and the data at different levels are then synchronized. The single-grid algorithm is described briefly, but the emphasis here is on the time-stepping procedure for the adaptive hierarchy. Numerical examples are presented to demonstrate the algorithm's accuracy and convergence properties and to illustrate the behaviour of the method.

  3. A Parallel Second-Order Adaptive Mesh Algorithm for Incompressible Flow in Porous Media

    SciTech Connect

    Pau, George Shu Heng; Almgren, Ann S.; Bell, John B.; Lijewski, Michael J.

    2008-04-01

    In this paper we present a second-order accurate adaptive algorithm for solving multiphase, incompressible flows in porous media. We assume a multiphase form of Darcy's law with relative permeabilities given as a function of the phase saturation. The remaining equations express conservation of mass for the fluid constituents. In this setting the total velocity, defined to be the sum of the phase velocities, is divergence-free. The basic integration method is based on a total-velocity splitting approach in which we solve a second-order elliptic pressure equation to obtain a total velocity. This total velocity is then used to recast component conservation equations as nonlinear hyperbolic equations. Our approach to adaptive refinement uses a nested hierarchy of logically rectangular grids with simultaneous refinement of the grids in both space and time. The integration algorithm on the grid hierarchy is a recursive procedure in which coarse grids are advanced in time, fine grids areadvanced multiple steps to reach the same time as the coarse grids and the data atdifferent levels are then synchronized. The single grid algorithm is described briefly,but the emphasis here is on the time-stepping procedure for the adaptive hierarchy. Numerical examples are presented to demonstrate the algorithm's accuracy and convergence properties and to illustrate the behavior of the method.

  4. Fast 3-D large-scale gravity and magnetic modeling using unstructured grids and an adaptive multilevel fast multipole method

    NASA Astrophysics Data System (ADS)

    Ren, Zhengyong; Tang, Jingtian; Kalscheuer, Thomas; Maurer, Hansruedi

    2017-01-01

    A novel fast and accurate algorithm is developed for large-scale 3-D gravity and magnetic modeling problems. An unstructured grid discretization is used to approximate sources with arbitrary mass and magnetization distributions. A novel adaptive multilevel fast multipole (AMFM) method is developed to reduce the modeling time. An observation octree is constructed on a set of arbitrarily distributed observation sites, while a source octree is constructed on a source tetrahedral grid. A novel characteristic is the independence between the observation octree and the source octree, which simplifies the implementation of different survey configurations such as airborne and ground surveys. Two synthetic models, a cubic model and a half-space model with mountain-valley topography, are tested. As compared to analytical solutions of gravity and magnetic signals, excellent agreements of the solutions verify the accuracy of our AMFM algorithm. Finally, our AMFM method is used to calculate the terrain effect on an airborne gravity data set for a realistic topography model represented by a triangular surface retrieved from a digital elevation model. Using 16 threads, more than 5800 billion interactions between 1,002,001 observation points and 5,839,830 tetrahedral elements are computed in 453.6 s. A traditional first-order Gaussian quadrature approach requires 3.77 days. Hence, our new AMFM algorithm not only can quickly compute the gravity and magnetic signals for complicated problems but also can substantially accelerate the solution of 3-D inversion problems.

  5. Impact of Load Balancing on Unstructured Adaptive Grid Computations for Distributed-Memory Multiprocessors

    NASA Technical Reports Server (NTRS)

    Sohn, Andrew; Biswas, Rupak; Simon, Horst D.

    1996-01-01

    The computational requirements for an adaptive solution of unsteady problems change as the simulation progresses. This causes workload imbalance among processors on a parallel machine which, in turn, requires significant data movement at runtime. We present a new dynamic load-balancing framework, called JOVE, that balances the workload across all processors with a global view. Whenever the computational mesh is adapted, JOVE is activated to eliminate the load imbalance. JOVE has been implemented on an IBM SP2 distributed-memory machine in MPI for portability. Experimental results for two model meshes demonstrate that mesh adaption with load balancing gives more than a sixfold improvement over one without load balancing. We also show that JOVE gives a 24-fold speedup on 64 processors compared to sequential execution.

  6. A User's Guide to AMR1D: An Instructional Adaptive Mesh Refinement Code for Unstructured Grids

    NASA Technical Reports Server (NTRS)

    deFainchtein, Rosalinda

    1996-01-01

    This report documents the code AMR1D, which is currently posted on the World Wide Web (http://sdcd.gsfc.nasa.gov/ESS/exchange/contrib/de-fainchtein/adaptive _mesh_refinement.html). AMR1D is a one-dimensional finite element fluid-dynamics solver, capable of adaptive mesh refinement (AMR). It was written as an instructional tool for AMR on unstructured mesh codes. It is meant to illustrate the minimum requirements for AMR on more than one dimension. For that purpose, it uses the same type of data structure that would be necessary on a two-dimensional AMR code (loosely following the algorithm described by Lohner).

  7. An adaptive sparse-grid high-order stochastic collocation method for Bayesian inference in groundwater reactive transport modeling

    SciTech Connect

    Zhang, Guannan; Webster, Clayton G; Gunzburger, Max D

    2012-09-01

    Although Bayesian analysis has become vital to the quantification of prediction uncertainty in groundwater modeling, its application has been hindered due to the computational cost associated with numerous model executions needed for exploring the posterior probability density function (PPDF) of model parameters. This is particularly the case when the PPDF is estimated using Markov Chain Monte Carlo (MCMC) sampling. In this study, we develop a new approach that improves computational efficiency of Bayesian inference by constructing a surrogate system based on an adaptive sparse-grid high-order stochastic collocation (aSG-hSC) method. Unlike previous works using first-order hierarchical basis, we utilize a compactly supported higher-order hierar- chical basis to construct the surrogate system, resulting in a significant reduction in the number of computational simulations required. In addition, we use hierarchical surplus as an error indi- cator to determine adaptive sparse grids. This allows local refinement in the uncertain domain and/or anisotropic detection with respect to the random model parameters, which further improves computational efficiency. Finally, we incorporate a global optimization technique and propose an iterative algorithm for building the surrogate system for the PPDF with multiple significant modes. Once the surrogate system is determined, the PPDF can be evaluated by sampling the surrogate system directly with very little computational cost. The developed method is evaluated first using a simple analytical density function with multiple modes and then using two synthetic groundwater reactive transport models. The groundwater models represent different levels of complexity; the first example involves coupled linear reactions and the second example simulates nonlinear ura- nium surface complexation. The results show that the aSG-hSC is an effective and efficient tool for Bayesian inference in groundwater modeling in comparison with conventional

  8. Adaptive Mesh and Algorithm Refinement Using Direct Simulation Monte Carlo

    NASA Astrophysics Data System (ADS)

    Garcia, Alejandro L.; Bell, John B.; Crutchfield, William Y.; Alder, Berni J.

    1999-09-01

    Adaptive mesh and algorithm refinement (AMAR) embeds a particle method within a continuum method at the finest level of an adaptive mesh refinement (AMR) hierarchy. The coupling between the particle region and the overlaying continuum grid is algorithmically equivalent to that between the fine and coarse levels of AMR. Direct simulation Monte Carlo (DSMC) is used as the particle algorithm embedded within a Godunov-type compressible Navier-Stokes solver. Several examples are presented and compared with purely continuum calculations.

  9. ADAPTIVE-GRID SIMULATION OF GROUNDWATER FLOW IN HETEROGENEOUS AQUIFERS. (R825689C068)

    EPA Science Inventory

    Abstract

    The prediction of contaminant transport in porous media requires the computation of the flow velocity. This work presents a methodology for high-accuracy computation of flow in a heterogeneous isotropic formation, employing a dual-flow formulation and adaptive...

  10. Vertical Scan (V-SCAN) for 3-D Grid Adaptive Mesh Refinement for an atmospheric Model Dynamical Core

    NASA Astrophysics Data System (ADS)

    Andronova, N. G.; Vandenberg, D.; Oehmke, R.; Stout, Q. F.; Penner, J. E.

    2009-12-01

    One of the major building blocks of a rigorous representation of cloud evolution in global atmospheric models is a parallel adaptive grid MPI-based communication library (an Adaptive Blocks for Locally Cartesian Topologies library -- ABLCarT), which manages the block-structured data layout, handles ghost cell updates among neighboring blocks and splits a block as refinements occur. The library has several modules that provide a layer of abstraction for adaptive refinement: blocks, which contain individual cells of user data; shells - the global geometry for the problem, including a sphere, reduced sphere, and now a 3D sphere; a load balancer for placement of blocks onto processors; and a communication support layer which encapsulates all data movement. A major performance concern with adaptive mesh refinement is how to represent calculations that have need to be sequenced in a particular order in a direction, such as calculating integrals along a specific path (e.g. atmospheric pressure or geopotential in the vertical dimension). This concern is compounded if the blocks have varying levels of refinement, or are scattered across different processors, as can be the case in parallel computing. In this paper we describe an implementation in ABLCarT of a vertical scan operation, which allows computing along vertical paths in the correct order across blocks transparent to their resolution and processor location. We test this functionality on a 2D and a 3D advection problem, which tests the performance of the model’s dynamics (transport) and physics (sources and sinks) for different model resolutions needed for inclusion of cloud formation.

  11. Adjoint-Based Algorithms for Adaptation and Design Optimizations on Unstructured Grids

    NASA Technical Reports Server (NTRS)

    Nielsen, Eric J.

    2006-01-01

    Schemes based on discrete adjoint algorithms present several exciting opportunities for significantly advancing the current state of the art in computational fluid dynamics. Such methods provide an extremely efficient means for obtaining discretely consistent sensitivity information for hundreds of design variables, opening the door to rigorous, automated design optimization of complex aerospace configuration using the Navier-Stokes equation. Moreover, the discrete adjoint formulation provides a mathematically rigorous foundation for mesh adaptation and systematic reduction of spatial discretization error. Error estimates are also an inherent by-product of an adjoint-based approach, valuable information that is virtually non-existent in today's large-scale CFD simulations. An overview of the adjoint-based algorithm work at NASA Langley Research Center is presented, with examples demonstrating the potential impact on complex computational problems related to design optimization as well as mesh adaptation.

  12. The fluid dynamic approach to equidistribution methods for grid generation and adaptation

    SciTech Connect

    Delzanno, Gian Luca; Finn, John M

    2009-01-01

    The equidistribution methods based on L{sub p} Monge-Kantorovich optimization [Finn and Delzanno, submitted to SISC, 2009] and on the deformation [Moser, 1965; Dacorogna and Moser, 1990, Liao and Anderson, 1992] method are analyzed primarily in the context of grid generation. It is shown that the first class of methods can be obtained from a fluid dynamic formulation based on time-dependent equations for the mass density and the momentum density, arising from a variational principle. In this context, deformation methods arise from a fluid formulation by making a specific assumption on the time evolution of the density (but with some degree of freedom for the momentum density). In general, deformation methods do not arise from a variational principle. However, it is possible to prescribe an optimal deformation method, related to L{sub 1} Monge-Kantorovich optimization, by making a further assumption on the momentum density. Some applications of the L{sub p} fluid dynamic formulation to imaging are also explored.

  13. Adaptive Generation of Multimaterial Grids from imaging data for Biomedical Lagrangian Fluid-Structure Simulations

    SciTech Connect

    Carson, James P.; Kuprat, Andrew P.; Jiao, Xiangmin; Dyedov, Volodymyr; del Pin, Facundo; Guccione, Julius M.; Ratcliffe, Mark B.; Einstein, Daniel R.

    2010-04-01

    Spatial discretization of complex imaging-derived fluid-solid geometries, such as the cardiac environment, is a critical but often overlooked challenge in biomechanical computations. This is particularly true in problems with Lagrangian interfaces, where, the fluid and solid phases must match geometrically. For simplicity and better accuracy, it is also highly desirable for the two phases to share the same surface mesh at the interface between them. We outline a method for solving this problem, and illustrate the approach with a 3D fluid-solid mesh of the mouse heart. An MRI perfusion-fixed dataset of a mouse heart with 50μm isotropic resolution was semi-automatically segmented using a customized multimaterial connected-threshold approach that divided the volume into non-overlapping regions of blood, tissue and background. Subsequently, a multimaterial marching cubes algorithm was applied to the segmented data to produce two detailed, compatible isosurfaces, one for blood and one for tissue. Both isosurfaces were simultaneously smoothed with a multimaterial smoothing algorithm that exactly conserves the volume for each phase. Using these two isosurfaces, we developed and applied novel automated meshing algorithms to generate anisotropic hybrid meshes on arbitrary biological geometries with the number of layers and the desired element anisotropy for each phase as the only input parameters. Since our meshes adapt to the local feature sizes and include boundary layer prisms, they are more efficient and accurate than non-adaptive, isotropic meshes, and the fluid-structure interaction computations will tend to have relative error equilibrated over the whole mesh.

  14. Two general methods for population pharmacokinetic modeling: non-parametric adaptive grid and non-parametric Bayesian.

    PubMed

    Tatarinova, Tatiana; Neely, Michael; Bartroff, Jay; van Guilder, Michael; Yamada, Walter; Bayard, David; Jelliffe, Roger; Leary, Robert; Chubatiuk, Alyona; Schumitzky, Alan

    2013-04-01

    Population pharmacokinetic (PK) modeling methods can be statistically classified as either parametric or nonparametric (NP). Each classification can be divided into maximum likelihood (ML) or Bayesian (B) approaches. In this paper we discuss the nonparametric case using both maximum likelihood and Bayesian approaches. We present two nonparametric methods for estimating the unknown joint population distribution of model parameter values in a pharmacokinetic/pharmacodynamic (PK/PD) dataset. The first method is the NP Adaptive Grid (NPAG). The second is the NP Bayesian (NPB) algorithm with a stick-breaking process to construct a Dirichlet prior. Our objective is to compare the performance of these two methods using a simulated PK/PD dataset. Our results showed excellent performance of NPAG and NPB in a realistically simulated PK study. This simulation allowed us to have benchmarks in the form of the true population parameters to compare with the estimates produced by the two methods, while incorporating challenges like unbalanced sample times and sample numbers as well as the ability to include the covariate of patient weight. We conclude that both NPML and NPB can be used in realistic PK/PD population analysis problems. The advantages of one versus the other are discussed in the paper. NPAG and NPB are implemented in R and freely available for download within the Pmetrics package from www.lapk.org.

  15. Two general methods for population pharmacokinetic modeling: non-parametric adaptive grid and non-parametric Bayesian

    PubMed Central

    Neely, Michael; Bartroff, Jay; van Guilder, Michael; Yamada, Walter; Bayard, David; Jelliffe, Roger; Leary, Robert; Chubatiuk, Alyona; Schumitzky, Alan

    2013-01-01

    Population pharmacokinetic (PK) modeling methods can be statistically classified as either parametric or nonparametric (NP). Each classification can be divided into maximum likelihood (ML) or Bayesian (B) approazches. In this paper we discuss the nonparametric case using both maximum likelihood and Bayesian approaches. We present two nonparametric methods for estimating the unknown joint population distribution of model parameter values in a pharmacokinetic/pharmacodynamic (PK/PD) dataset. The first method is the NP Adaptive Grid (NPAG). The second is the NP Bayesian (NPB) algorithm with a stick-breaking process to construct a Dirichlet prior. Our objective is to compare the performance of these two methods using a simulated PK/PD dataset. Our results showed excellent performance of NPAG and NPB in a realistically simulated PK study. This simulation allowed us to have benchmarks in the form of the true population parameters to compare with the estimates produced by the two methods, while incorporating challenges like unbalanced sample times and sample numbers as well as the ability to include the covariate of patient weight. We conclude that both NPML and NPB can be used in realistic PK/PD population analysis problems. The advantages of one versus the other are discussed in the paper. NPAG and NPB are implemented in R and freely available for download within the Pmetrics package from www.lapk.org. PMID:23404393

  16. MRAG-I2D: Multi-resolution adapted grids for remeshed vortex methods on multicore architectures

    NASA Astrophysics Data System (ADS)

    Rossinelli, Diego; Hejazialhosseini, Babak; van Rees, Wim; Gazzola, Mattia; Bergdorf, Michael; Koumoutsakos, Petros

    2015-05-01

    We present MRAG-I2D, an open source software framework, for multiresolution simulations of two-dimensional, incompressible, viscous flows on multicore architectures. The spatiotemporal scales of the flow field are captured by remeshed vortex methods enhanced by high order average-interpolating wavelets and local time-stepping. The multiresolution solver of the Poisson equation relies on the development of a novel, tree-based multipole method. MRAG-I2D implements a number of HPC strategies to map efficiently the irregular computational workload of wavelet-adapted grids on multicore nodes. The capabilities of the present software are compared to the current state-of-the-art in terms of accuracy, compression rates and time-to-solution. Benchmarks include the inviscid evolution of an elliptical vortex, flow past an impulsively started cylinder at Re = 40- 40 000 and simulations of self-propelled anguilliform swimmers. The results indicate that the present software has the same or better accuracy than state-of-the-art solvers while it exhibits unprecedented performance in terms of time-to-solution.

  17. Optimal Behavioral Hierarchy

    PubMed Central

    Córdova, Natalia; Yee, Debbie; Barto, Andrew G.; Niv, Yael; Botvinick, Matthew M.

    2014-01-01

    Human behavior has long been recognized to display hierarchical structure: actions fit together into subtasks, which cohere into extended goal-directed activities. Arranging actions hierarchically has well established benefits, allowing behaviors to be represented efficiently by the brain, and allowing solutions to new tasks to be discovered easily. However, these payoffs depend on the particular way in which actions are organized into a hierarchy, the specific way in which tasks are carved up into subtasks. We provide a mathematical account for what makes some hierarchies better than others, an account that allows an optimal hierarchy to be identified for any set of tasks. We then present results from four behavioral experiments, suggesting that human learners spontaneously discover optimal action hierarchies. PMID:25122479

  18. Time-splitting finite difference method with the wavelet-adaptive grids for semiclassical Gross-Pitaevskii equation in supercritical case

    NASA Astrophysics Data System (ADS)

    Li, Xueyang; Xiao, Aiguo

    2014-06-01

    The Gross-Pitaevskii equation is the model equation of the single-particle wave function in a Bose-Einstein condensation. A computation difficulty of the Gross-Pitaevskii equation comes from the semiclassical problem in supercritical case. In this paper, we apply a diffeomorphism to transform the original one-dimensional Gross-Pitaevskii equation into a modified equation. The adaptive grids are constructed through the interpolating wavelet method. Then, we use the time-splitting finite difference method with the wavelet-adaptive grids to solve the modified Gross-Pitaevskii equation, where the approximation to the second-order derivative is given by the Lagrange interpolation method. At last, the numerical results are given. It is shown that the obtained time-splitting finite difference method with the wavelet-adaptive grids is very efficient for solving the one-dimensional semiclassical Gross-Pitaevskii equation in supercritical case and it is suitable to deal with the local high oscillation of the solution.

  19. A new algorithm for high-dimensional uncertainty quantification based on dimension-adaptive sparse grid approximation and reduced basis methods

    NASA Astrophysics Data System (ADS)

    Chen, Peng; Quarteroni, Alfio

    2015-10-01

    In this work we develop an adaptive and reduced computational algorithm based on dimension-adaptive sparse grid approximation and reduced basis methods for solving high-dimensional uncertainty quantification (UQ) problems. In order to tackle the computational challenge of "curse of dimensionality" commonly faced by these problems, we employ a dimension-adaptive tensor-product algorithm [16] and propose a verified version to enable effective removal of the stagnation phenomenon besides automatically detecting the importance and interaction of different dimensions. To reduce the heavy computational cost of UQ problems modelled by partial differential equations (PDE), we adopt a weighted reduced basis method [7] and develop an adaptive greedy algorithm in combination with the previous verified algorithm for efficient construction of an accurate reduced basis approximation. The efficiency and accuracy of the proposed algorithm are demonstrated by several numerical experiments.

  20. TranAir: A full-potential, solution-adaptive, rectangular grid code for predicting subsonic, transonic, and supersonic flows about arbitrary configurations. Theory document

    NASA Technical Reports Server (NTRS)

    Johnson, F. T.; Samant, S. S.; Bieterman, M. B.; Melvin, R. G.; Young, D. P.; Bussoletti, J. E.; Hilmes, C. L.

    1992-01-01

    A new computer program, called TranAir, for analyzing complex configurations in transonic flow (with subsonic or supersonic freestream) was developed. This program provides accurate and efficient simulations of nonlinear aerodynamic flows about arbitrary geometries with the ease and flexibility of a typical panel method program. The numerical method implemented in TranAir is described. The method solves the full potential equation subject to a set of general boundary conditions and can handle regions with differing total pressure and temperature. The boundary value problem is discretized using the finite element method on a locally refined rectangular grid. The grid is automatically constructed by the code and is superimposed on the boundary described by networks of panels; thus no surface fitted grid generation is required. The nonlinear discrete system arising from the finite element method is solved using a preconditioned Krylov subspace method embedded in an inexact Newton method. The solution is obtained on a sequence of successively refined grids which are either constructed adaptively based on estimated solution errors or are predetermined based on user inputs. Many results obtained by using TranAir to analyze aerodynamic configurations are presented.

  1. Ansatz for dynamical hierarchies.

    PubMed

    Rasmussen, S; Baas, N A; Mayer, B; Nilsson, M; Olesen, M W

    2001-01-01

    Complex, robust functionalities can be generated naturally in at least two ways: by the assembly of structures and by the evolution of structures. This work is concerned with spontaneous formation of structures. We define the notion of dynamical hierarchies in natural systems and show the importance of this particular kind of organization for living systems. We then define a framework that enables us to formulate, investigate, and manipulate such dynamical hierarchies. This framework allows us to simultaneously investigate different levels of description together with their interrelationship, which is necessary to understand the nature of dynamical hierarchies. Our framework is then applied to a concrete and very simple formal, physicochemical, dynamical hierarchy involving water and monomers at level one, polymers and water at level two, and micelles (polymer aggregates) and water at level three. Formulating this system as a simple two-dimensional molecular dynamics (MD) lattice gas allows us within one dynamical system to demonstrate the successive emergence of two higher levels (three levels all together) of robust structures with associated properties. Second, we demonstrate how the framework for dynamical hierarchies can be used for realistic (predictive) physicochemical simulation of molecular self-assembly and self-organization processes. We discuss the detailed process of micellation using the three-dimensional MD lattice gas. Finally, from these examples we can infer principles about formal dynamical hierarchies. We present an ansatz for how to generate robust, higher-order emergent properties in formal dynamical systems that is based on a conjecture of a necessary minimal complexity within the fundamental interacting structures once a particular simulation framework is chosen.

  2. The Reinforcement Hierarchy

    ERIC Educational Resources Information Center

    Forness, Steven R.

    1973-01-01

    Reinforcement hierarchy implies movement along a continuum from top to bottom, from primitive levels of reinforcement to more sophisticated levels. Unless it is immediately obvious that a child cannot function without the use of lower-order reinforcers, we should approach him as though he responds to topmost reinforcers until he demonstrates…

  3. Smoothed aggregation adaptive spectral element-based algebraic multigrid

    SciTech Connect

    2015-01-20

    SAAMGE provides parallel methods for building multilevel hierarchies and solvers that can be used for elliptic equations with highly heterogeneous coefficients. Additionally, hierarchy adaptation is implemented allowing solving multiple problems with close coefficients without rebuilding the hierarchy.

  4. Using specific and adaptive arrangement of grid-type pilot in channel estimation for white-lightLED-based OFDM visible light communication system

    NASA Astrophysics Data System (ADS)

    Lin, Wan-Feng; Chow, Chi-Wai; Yeh, Chien-Hung

    2015-03-01

    Orthogonal frequency division multiplexing (OFDM) is a promising candidate for light emitting diode (LED)-based optical wireless communication (OWC); however, precise channel estimation is required for synchronization and equalization. In this work, we study and discover that the channel response of the white-lightLED-based OWC was smooth and stable. Hence we propose and demonstrate using a specific and adaptive arrangement of grid-type pilot scheme to estimate the LED OWC channel response. Experimental results show that our scheme can achieve better transmission performance and with some transmission capacity enhancement when compared with the method using training-symbol scheme (also called block-type pilot scheme).

  5. Scientific Final Report: COLLABORATIVE RESEARCH: CONTINUOUS DYNAMIC GRID ADAPTATION IN A GLOBAL ATMOSPHERIC MODEL: APPLICATION AND REFINEMENT

    SciTech Connect

    William J. Gutowski; Joseph M. Prusa, Piotr K. Smolarkiewicz

    2012-04-09

    This project had goals of advancing the performance capabilities of the numerical general circulation model EULAG and using it to produce a fully operational atmospheric global climate model (AGCM) that can employ either static or dynamic grid stretching for targeted phenomena. The resulting AGCM combined EULAG's advanced dynamics core with the 'physics' of the NCAR Community Atmospheric Model (CAM). Effort discussed below shows how we improved model performance and tested both EULAG and the coupled CAM-EULAG in several ways to demonstrate the grid stretching and ability to simulate very well a wide range of scales, that is, multi-scale capability. We leveraged our effort through interaction with an international EULAG community that has collectively developed new features and applications of EULAG, which we exploited for our own work summarized here. Overall, the work contributed to over 40 peer-reviewed publications and over 70 conference/workshop/seminar presentations, many of them invited.

  6. Application of Parallel Adjoint-Based Error Estimation and Anisotropic Grid Adaptation for Three-Dimensional Aerospace Configurations

    NASA Technical Reports Server (NTRS)

    Lee-Rausch, E. M.; Park, M. A.; Jones, W. T.; Hammond, D. P.; Nielsen, E. J.

    2005-01-01

    This paper demonstrates the extension of error estimation and adaptation methods to parallel computations enabling larger, more realistic aerospace applications and the quantification of discretization errors for complex 3-D solutions. Results were shown for an inviscid sonic-boom prediction about a double-cone configuration and a wing/body segmented leading edge (SLE) configuration where the output function of the adjoint was pressure integrated over a part of the cylinder in the near field. After multiple cycles of error estimation and surface/field adaptation, a significant improvement in the inviscid solution for the sonic boom signature of the double cone was observed. Although the double-cone adaptation was initiated from a very coarse mesh, the near-field pressure signature from the final adapted mesh compared very well with the wind-tunnel data which illustrates that the adjoint-based error estimation and adaptation process requires no a priori refinement of the mesh. Similarly, the near-field pressure signature for the SLE wing/body sonic boom configuration showed a significant improvement from the initial coarse mesh to the final adapted mesh in comparison with the wind tunnel results. Error estimation and field adaptation results were also presented for the viscous transonic drag prediction of the DLR-F6 wing/body configuration, and results were compared to a series of globally refined meshes. Two of these globally refined meshes were used as a starting point for the error estimation and field-adaptation process where the output function for the adjoint was the total drag. The field-adapted results showed an improvement in the prediction of the drag in comparison with the finest globally refined mesh and a reduction in the estimate of the remaining drag error. The adjoint-based adaptation parameter showed a need for increased resolution in the surface of the wing/body as well as a need for wake resolution downstream of the fuselage and wing trailing edge

  7. Complex Volume Grid Generation Through the Use of Grid Reusability

    NASA Technical Reports Server (NTRS)

    Alter, Stephen J.

    1997-01-01

    This paper presents a set of surface and volume grid generation techniques which reuse existing surface and volume grids. These methods use combinations of data manipulations to reduce grid generation time, improve grid characteristics, and increase the capabilities of existing domain discretization software. The manipulation techniques utilize physical and computational domains to produce basis function on which to operate and modify grid character and smooth grids using Trans-Finite Interpolation, a vector interpolation method and parametric re-mapping technique. With these new techniques, inviscid grids can be converted to viscous grids, multiple zone grid adaption can be performed to improve CFD solver efficiency, and topological changes to improve modeling of flow fields can be done simply and quickly. Examples of these capabilities are illustrated as applied to various configurations.

  8. A Load Frequency Control in an Off-Grid Sustainable Power System Based on a Parameter Adaptive PID-Type Fuzzy Controller

    NASA Astrophysics Data System (ADS)

    Ronilaya, Ferdian; Miyauchi, Hajime

    2014-10-01

    This paper presents a new implementation of a parameter adaptive PID-type fuzzy controller (PAPIDfc) for a grid-supporting inverter of battery to alleviate frequency fluctuations in a wind-diesel power system. A variable speed wind turbine that drives a permanent magnet synchronous generator is assumed for demonstrations. The PAPIDfc controller is built from a set of control rules that adopts the droop method and uses only locally measurable frequency signal. The output control signal is determined from the knowledge base and the fuzzy inference. The input-derivative gain and the output-integral gain of the PAPIDfc are tuned online. To ensure safe battery operating limits, we also propose a protection scheme called intelligent battery protection (IBP). Several simulation experiments are performed by using MATLAB®/SimPowersystems™. Next, to verify the scheme's effectiveness, the simulation results are compared with the results of conventional controllers. The results demonstrate the effectiveness of the PAPIDfc scheme to control a grid-supporting inverter of the battery in the reduction of frequency fluctuations.

  9. Safe Grid

    NASA Technical Reports Server (NTRS)

    Chow, Edward T.; Stewart, Helen; Korsmeyer, David (Technical Monitor)

    2003-01-01

    The biggest users of GRID technologies came from the science and technology communities. These consist of government, industry and academia (national and international). The NASA GRID is moving into a higher technology readiness level (TRL) today; and as a joint effort among these leaders within government, academia, and industry, the NASA GRID plans to extend availability to enable scientists and engineers across these geographical boundaries collaborate to solve important problems facing the world in the 21 st century. In order to enable NASA programs and missions to use IPG resources for program and mission design, the IPG capabilities needs to be accessible from inside the NASA center networks. However, because different NASA centers maintain different security domains, the GRID penetration across different firewalls is a concern for center security people. This is the reason why some IPG resources are been separated from the NASA center network. Also, because of the center network security and ITAR concerns, the NASA IPG resource owner may not have full control over who can access remotely from outside the NASA center. In order to obtain organizational approval for secured remote access, the IPG infrastructure needs to be adapted to work with the NASA business process. Improvements need to be made before the IPG can be used for NASA program and mission development. The Secured Advanced Federated Environment (SAFE) technology is designed to provide federated security across NASA center and NASA partner's security domains. Instead of one giant center firewall which can be difficult to modify for different GRID applications, the SAFE "micro security domain" provide large number of professionally managed "micro firewalls" that can allow NASA centers to accept remote IPG access without the worry of damaging other center resources. The SAFE policy-driven capability-based federated security mechanism can enable joint organizational and resource owner approved remote

  10. Prediction and Control of Network Cascade: Example of Power Grid or Networking Adaptability from WMD Disruption and Cascading Failures

    SciTech Connect

    Chertkov, Michael

    2012-07-24

    The goal of the DTRA project is to develop a mathematical framework that will provide the fundamental understanding of network survivability, algorithms for detecting/inferring pre-cursors of abnormal network behaviors, and methods for network adaptability and self-healing from cascading failures.

  11. Completing the land resource hierarchy

    Technology Transfer Automated Retrieval System (TEKTRAN)

    The Land Resource Hierarchy of the NRCS is a hierarchal landscape classification consisting of resource areas which represent both conceptual and spatially discrete landscape units stratifying agency programs and practices. The Land Resource Hierarchy (LRH) scales from discrete points (soil pedon an...

  12. Dominance Hierarchies in Young Children

    ERIC Educational Resources Information Center

    Edelman, Murray S.; Omark, Donald R.

    1973-01-01

    This study uses the ethological approach of seeking species characteristics and phylogenetic continuities in an investigation of human behavior. Among primates a striking consistency is the presence of some form of dominance hierarchy in many species. The present study examines peer group dominance hierarchies as they are perceived by children in…

  13. Evaluation of the Operational Multi-scale Environment model with Grid Adaptivity (OMEGA) for use in Wind Energy Applications in the Great Basin of Nevada

    NASA Astrophysics Data System (ADS)

    King, Kristien C.

    In order to further assess the wind energy potential for Nevada, the accuracy of a computational meteorological model, the Operational Multi-scale Environment model with Grid Adaptivity (OMEGA), was evaluated by comparing simulation results with data collected from a wind monitoring tower near Tonopah, NV. The state of Nevada is characterized by high mountains and low-lying valleys, therefore, in order to determine the wind potential for the state, meteorological models that predict the wind must be able to accurately represent and account for terrain features and simulate topographic forcing with accuracy. Topographic forcing has a dominant role in the development and modification of mesoscale flows in regions of complex terrain, like Tonopah, especially at the level of wind turbine blade heights (~80 m). Additionally, model factors such as horizontal resolution, terrain database resolution, model physics, time of model initialization, stability regime, and source of initial conditions may each affect the ability of a mesoscale model to forecast winds correctly. The observational tower used for comparison was located at Stone Cabin, Nevada. The tower had both sonic anemometers and cup anemometers installed at heights of 40 m, 60 m, and 80 m above the surface. During a previous experiment, tower data were collected for the period February 9 through March 10, 2007 and compared to model simulations using the MM5 and WRF models at a number of varying horizontal resolutions. In this previous research, neither the MM5 nor the WRF showed a significant improvement in ability to forecast wind speed with increasing horizontal grid resolution. The present research evaluated the ability of OMEGA to reproduce point winds as compared to the observational data from the Stone Cabin Tower at heights of 40 m, 60 m, and 80 m. Unlike other mesoscale atmospheric models, OMEGA incorporates an unstructured triangular adaptive grid which allows for increased flexibility and accuracy in

  14. Dynamical hierarchies - A summary

    SciTech Connect

    Rasmussen, S.; Barrett, C.L. |; Olesen, M.W.

    1996-04-01

    This paper summarizes some of the problems associated with the generation of higher order emergent structures in formal dynamical systems. In biological systems, higher order hyperstructures occur both in an intuitive and a formal sense: monomers, polymers, membranes, organelles, cells, tissues, organs, etc. constitute an observable hierarchy, apparently generated by the underlying biomolecular process. However, in models and simulations of these systems, it has turned out to be quite difficult to produce higher order emergent structures from first principles. The first problem is to agree on what a higher order structure is. An emergent structure can be defined through an introduction of an observational function. If a property can be observed in the dynamics, but not at the level of the fundamental first order interacting structures, we define it to be emergent. It is well known that second order structures occur relatively easy in simulation, so the problem is how to proceed to third and higher order without external interference. A third order structure is defined through the interaction of second order structures forming a new observable not found at the lower levels.

  15. Anarchy and hierarchy

    SciTech Connect

    Haba, Naoyuki; Murayama, Hitoshi

    2000-09-14

    We advocate a new approach to study models of fermion massesand mixings, namely anarchy proposed in hep-ph/9911341. In this approach,we scan the O(1) coefficients randomly. We argue that this is the correctapproach when the fundamental theory is sufficiently complicated.Assuming there is no physical distinction among three generations ofneutrinos, the probability distributions in MNS mixing angles can bepredicted independent of the choice of the measure. This is because themixing angles are distributed according to the Haar measure of the Liegroups whose elements diagonalize the mass matrices. The near-maximalmixings, as observed in the atmospheric neutrino data and as required inthe LMA solution to the solar neutrino problem, are highly probable. Asmall hierarchy between the Delta m2 for the atmospheric and the solarneutrinos is obtained very easily; the complex seesaw case gives ahierarchy of a factor of 20 as the most probable one, even though thisconclusion is more measure-dependent. U_e3 has to be just below thecurrent limit from the CHOOZ experiment. The CP-violating parameter sindelta is preferred to be maximal. We present a simple SU(5)-likeextension of anarchy to the charged-lepton and quark sectors which workswell phenomenologically.

  16. Information slows down hierarchy growth.

    PubMed

    Czaplicka, Agnieszka; Suchecki, Krzysztof; Miñano, Borja; Trias, Miquel; Hołyst, Janusz A

    2014-06-01

    We consider models of growing multilevel systems wherein the growth process is driven by rules of tournament selection. A system can be conceived as an evolving tree with a new node being attached to a contestant node at the best hierarchy level (a level nearest to the tree root). The proposed evolution reflects limited information on system properties available to new nodes. It can also be expressed in terms of population dynamics. Two models are considered: a constant tournament (CT) model wherein the number of tournament participants is constant throughout system evolution, and a proportional tournament (PT) model where this number increases proportionally to the growing size of the system itself. The results of analytical calculations based on a rate equation fit well to numerical simulations for both models. In the CT model all hierarchy levels emerge, but the birth time of a consecutive hierarchy level increases exponentially or faster for each new level. The number of nodes at the first hierarchy level grows logarithmically in time, while the size of the last, "worst" hierarchy level oscillates quasi-log-periodically. In the PT model, the occupations of the first two hierarchy levels increase linearly, but worse hierarchy levels either do not emerge at all or appear only by chance in the early stage of system evolution to further stop growing at all. The results allow us to conclude that information available to each new node in tournament dynamics restrains the emergence of new hierarchy levels and that it is the absolute amount of information, not relative, which governs such behavior.

  17. Information slows down hierarchy growth

    NASA Astrophysics Data System (ADS)

    Czaplicka, Agnieszka; Suchecki, Krzysztof; Miñano, Borja; Trias, Miquel; Hołyst, Janusz A.

    2014-06-01

    We consider models of growing multilevel systems wherein the growth process is driven by rules of tournament selection. A system can be conceived as an evolving tree with a new node being attached to a contestant node at the best hierarchy level (a level nearest to the tree root). The proposed evolution reflects limited information on system properties available to new nodes. It can also be expressed in terms of population dynamics. Two models are considered: a constant tournament (CT) model wherein the number of tournament participants is constant throughout system evolution, and a proportional tournament (PT) model where this number increases proportionally to the growing size of the system itself. The results of analytical calculations based on a rate equation fit well to numerical simulations for both models. In the CT model all hierarchy levels emerge, but the birth time of a consecutive hierarchy level increases exponentially or faster for each new level. The number of nodes at the first hierarchy level grows logarithmically in time, while the size of the last, "worst" hierarchy level oscillates quasi-log-periodically. In the PT model, the occupations of the first two hierarchy levels increase linearly, but worse hierarchy levels either do not emerge at all or appear only by chance in the early stage of system evolution to further stop growing at all. The results allow us to conclude that information available to each new node in tournament dynamics restrains the emergence of new hierarchy levels and that it is the absolute amount of information, not relative, which governs such behavior.

  18. Adaptation.

    PubMed

    Broom, Donald M

    2006-01-01

    The term adaptation is used in biology in three different ways. It may refer to changes which occur at the cell and organ level, or at the individual level, or at the level of gene action and evolutionary processes. Adaptation by cells, especially nerve cells helps in: communication within the body, the distinguishing of stimuli, the avoidance of overload and the conservation of energy. The time course and complexity of these mechanisms varies. Adaptive characters of organisms, including adaptive behaviours, increase fitness so this adaptation is evolutionary. The major part of this paper concerns adaptation by individuals and its relationships to welfare. In complex animals, feed forward control is widely used. Individuals predict problems and adapt by acting before the environmental effect is substantial. Much of adaptation involves brain control and animals have a set of needs, located in the brain and acting largely via motivational mechanisms, to regulate life. Needs may be for resources but are also for actions and stimuli which are part of the mechanism which has evolved to obtain the resources. Hence pigs do not just need food but need to be able to carry out actions like rooting in earth or manipulating materials which are part of foraging behaviour. The welfare of an individual is its state as regards its attempts to cope with its environment. This state includes various adaptive mechanisms including feelings and those which cope with disease. The part of welfare which is concerned with coping with pathology is health. Disease, which implies some significant effect of pathology, always results in poor welfare. Welfare varies over a range from very good, when adaptation is effective and there are feelings of pleasure or contentment, to very poor. A key point concerning the concept of individual adaptation in relation to welfare is that welfare may be good or poor while adaptation is occurring. Some adaptation is very easy and energetically cheap and

  19. Grid Work

    NASA Technical Reports Server (NTRS)

    1998-01-01

    Pointwise Inc.'s, Gridgen Software is a system for the generation of 3D (three dimensional) multiple block, structured grids. Gridgen is a visually-oriented, graphics-based interactive code used to decompose a 3D domain into blocks, distribute grid points on curves, initialize and refine grid points on surfaces and initialize volume grid points. Gridgen is available to U.S. citizens and American-owned companies by license.

  20. Adapt

    NASA Astrophysics Data System (ADS)

    Bargatze, L. F.

    2015-12-01

    Active Data Archive Product Tracking (ADAPT) is a collection of software routines that permits one to generate XML metadata files to describe and register data products in support of the NASA Heliophysics Virtual Observatory VxO effort. ADAPT is also a philosophy. The ADAPT concept is to use any and all available metadata associated with scientific data to produce XML metadata descriptions in a consistent, uniform, and organized fashion to provide blanket access to the full complement of data stored on a targeted data server. In this poster, we present an application of ADAPT to describe all of the data products that are stored by using the Common Data File (CDF) format served out by the CDAWEB and SPDF data servers hosted at the NASA Goddard Space Flight Center. These data servers are the primary repositories for NASA Heliophysics data. For this purpose, the ADAPT routines have been used to generate data resource descriptions by using an XML schema named Space Physics Archive, Search, and Extract (SPASE). SPASE is the designated standard for documenting Heliophysics data products, as adopted by the Heliophysics Data and Model Consortium. The set of SPASE XML resource descriptions produced by ADAPT includes high-level descriptions of numerical data products, display data products, or catalogs and also includes low-level "Granule" descriptions. A SPASE Granule is effectively a universal access metadata resource; a Granule associates an individual data file (e.g. a CDF file) with a "parent" high-level data resource description, assigns a resource identifier to the file, and lists the corresponding assess URL(s). The CDAWEB and SPDF file systems were queried to provide the input required by the ADAPT software to create an initial set of SPASE metadata resource descriptions. Then, the CDAWEB and SPDF data repositories were queried subsequently on a nightly basis and the CDF file lists were checked for any changes such as the occurrence of new, modified, or deleted

  1. Current Grid operation and future role of the Grid

    NASA Astrophysics Data System (ADS)

    Smirnova, O.

    2012-12-01

    Grid-like technologies and approaches became an integral part of HEP experiments. Some other scientific communities also use similar technologies for data-intensive computations. The distinct feature of Grid computing is the ability to federate heterogeneous resources of different ownership into a seamless infrastructure, accessible via a single log-on. Like other infrastructures of similar nature, Grid functioning requires not only technologically sound basis, but also reliable operation procedures, monitoring and accounting. The two aspects, technological and operational, are closely related: weaker is the technology, more burden is on operations, and other way around. As of today, Grid technologies are still evolving: at CERN alone, every LHC experiment uses an own Grid-like system. This inevitably creates a heavy load on operations. Infrastructure maintenance, monitoring and incident response are done on several levels, from local system administrators to large international organisations, involving massive human effort worldwide. The necessity to commit substantial resources is one of the obstacles faced by smaller research communities when moving computing to the Grid. Moreover, most current Grid solutions were developed under significant influence of HEP use cases, and thus need additional effort to adapt them to other applications. Reluctance of many non-HEP researchers to use Grid negatively affects the outlook for national Grid organisations, which strive to provide multi-science services. We started from the situation where Grid organisations were fused with HEP laboratories and national HEP research programmes; we hope to move towards the world where Grid will ultimately reach the status of generic public computing and storage service provider and permanent national and international Grid infrastructures will be established. How far will we be able to advance along this path, depends on us. If no standardisation and convergence efforts will take place

  2. Application of multi-objective controller to optimal tuning of PID gains for a hydraulic turbine regulating system using adaptive grid particle swam optimization.

    PubMed

    Chen, Zhihuan; Yuan, Yanbin; Yuan, Xiaohui; Huang, Yuehua; Li, Xianshan; Li, Wenwu

    2015-05-01

    A hydraulic turbine regulating system (HTRS) is one of the most important components of hydropower plant, which plays a key role in maintaining safety, stability and economical operation of hydro-electrical installations. At present, the conventional PID controller is widely applied in the HTRS system for its practicability and robustness, and the primary problem with respect to this control law is how to optimally tune the parameters, i.e. the determination of PID controller gains for satisfactory performance. In this paper, a kind of multi-objective evolutionary algorithms, named adaptive grid particle swarm optimization (AGPSO) is applied to solve the PID gains tuning problem of the HTRS system. This newly AGPSO optimized method, which differs from a traditional one-single objective optimization method, is designed to take care of settling time and overshoot level simultaneously, in which a set of non-inferior alternatives solutions (i.e. Pareto solution) is generated. Furthermore, a fuzzy-based membership value assignment method is employed to choose the best compromise solution from the obtained Pareto set. An illustrative example associated with the best compromise solution for parameter tuning of the nonlinear HTRS system is introduced to verify the feasibility and the effectiveness of the proposed AGPSO-based optimization approach, as compared with two another prominent multi-objective algorithms, i.e. Non-dominated Sorting Genetic Algorithm II (NSGAII) and Strength Pareto Evolutionary Algorithm II (SPEAII), for the quality and diversity of obtained Pareto solutions set. Consequently, simulation results show that this AGPSO optimized approach outperforms than compared methods with higher efficiency and better quality no matter whether the HTRS system works under unload or load conditions.

  3. The Volume Grid Manipulator (VGM): A Grid Reusability Tool

    NASA Technical Reports Server (NTRS)

    Alter, Stephen J.

    1997-01-01

    This document is a manual describing how to use the Volume Grid Manipulation (VGM) software. The code is specifically designed to alter or manipulate existing surface and volume structured grids to improve grid quality through the reduction of grid line skewness, removal of negative volumes, and adaption of surface and volume grids to flow field gradients. The software uses a command language to perform all manipulations thereby offering the capability of executing multiple manipulations on a single grid during an execution of the code. The command language can be input to the VGM code by a UNIX style redirected file, or interactively while the code is executing. The manual consists of 14 sections. The first is an introduction to grid manipulation; where it is most applicable and where the strengths of such software can be utilized. The next two sections describe the memory management and the manipulation command language. The following 8 sections describe simple and complex manipulations that can be used in conjunction with one another to smooth, adapt, and reuse existing grids for various computations. These are accompanied by a tutorial section that describes how to use the commands and manipulations to solve actual grid generation problems. The last two sections are a command reference guide and trouble shooting sections to aid in the use of the code as well as describe problems associated with generated scripts for manipulation control.

  4. Incorporation of a hierarchical grid component structure into GRIDGEN

    NASA Technical Reports Server (NTRS)

    Steinbrenner, John P.; Chawner, John R.

    1993-01-01

    The underlying framework of the GRIDGEN multiple block grid generation system has been refined so that grid components are now stored within a hierarchical data structure. This restructuring has enhanced the usability of the software by allowing grids to be generated on a more intuitive level. This new framework also provides a means by which the multiple block system can be edited at most any level in the grid generation process. Editing tools are currently being added to GRIDGEN so that a change to the grid can be propagated backward and forward in the data hierarchy. The new data structure, the editing tools, and other recent GRIDGEN improvements are described in this paper.

  5. Maslow's Hierarchy and Student Retention.

    ERIC Educational Resources Information Center

    Brookman, David M.

    1989-01-01

    Abraham Maslow's hierarchy of needs offers perspective on student motivation and a rationale for college retention programing. Student affairs and faculty interventions addressing student safety needs and engaging students' sense of purpose reinforce persistence. A mentor program is a possible cooperative effort between student personnel and…

  6. The Hierarchy of the Sciences?

    ERIC Educational Resources Information Center

    Cole, Stephen

    1983-01-01

    For 200 years, sciences have been arranged in a hierarchy with natural sciences at the top and social sciences at the bottom. Those at the top are thought to display more consensus and more rapid advancement. However, in current research, there are no systematic differences between sciences in these areas. (Author/IS)

  7. Progress in Grid Generation: From Chimera to DRAGON Grids

    NASA Technical Reports Server (NTRS)

    Liou, Meng-Sing; Kao, Kai-Hsiung

    1994-01-01

    Hybrid grids, composed of structured and unstructured grids, combines the best features of both. The chimera method is a major stepstone toward a hybrid grid from which the present approach is evolved. The chimera grid composes a set of overlapped structured grids which are independently generated and body-fitted, yielding a high quality grid readily accessible for efficient solution schemes. The chimera method has been shown to be efficient to generate a grid about complex geometries and has been demonstrated to deliver accurate aerodynamic prediction of complex flows. While its geometrical flexibility is attractive, interpolation of data in the overlapped regions - which in today's practice in 3D is done in a nonconservative fashion, is not. In the present paper we propose a hybrid grid scheme that maximizes the advantages of the chimera scheme and adapts the strengths of the unstructured grid while at the same time keeps its weaknesses minimal. Like the chimera method, we first divide up the physical domain by a set of structured body-fitted grids which are separately generated and overlaid throughout a complex configuration. To eliminate any pure data manipulation which does not necessarily follow governing equations, we use non-structured grids only to directly replace the region of the arbitrarily overlapped grids. This new adaptation to the chimera thinking is coined the DRAGON grid. The nonstructured grid region sandwiched between the structured grids is limited in size, resulting in only a small increase in memory and computational effort. The DRAGON method has three important advantages: (1) preserving strengths of the chimera grid; (2) eliminating difficulties sometimes encountered in the chimera scheme, such as the orphan points and bad quality of interpolation stencils; and (3) making grid communication in a fully conservative and consistent manner insofar as the governing equations are concerned. To demonstrate its use, the governing equations are

  8. An Assessment of Hierarchy Validation Techniques

    ERIC Educational Resources Information Center

    Capie, William; Jones, Howard L.

    1971-01-01

    Describes an empirical method of developing learning hierarchies by comparing success on each tested behavior with all other behaviors. Advantages, compared with validation of a particular logical hierarchy, are illustrated by application of density principles to prediction of flotation. (AL)

  9. Overture: The grid classes

    SciTech Connect

    Brislawn, K.; Brown, D.; Chesshire, G.; Henshaw, W.

    1997-01-01

    Overture is a library containing classes for grids, overlapping grid generation and the discretization and solution of PDEs on overlapping grids. This document describes the Overture grid classes, including classes for single grids and classes for collections of grids.

  10. Fibonacci Grids

    NASA Technical Reports Server (NTRS)

    Swinbank, Richard; Purser, James

    2006-01-01

    Recent years have seen a resurgence of interest in a variety of non-standard computational grids for global numerical prediction. The motivation has been to reduce problems associated with the converging meridians and the polar singularities of conventional regular latitude-longitude grids. A further impetus has come from the adoption of massively parallel computers, for which it is necessary to distribute work equitably across the processors; this is more practicable for some non-standard grids. Desirable attributes of a grid for high-order spatial finite differencing are: (i) geometrical regularity; (ii) a homogeneous and approximately isotropic spatial resolution; (iii) a low proportion of the grid points where the numerical procedures require special customization (such as near coordinate singularities or grid edges). One family of grid arrangements which, to our knowledge, has never before been applied to numerical weather prediction, but which appears to offer several technical advantages, are what we shall refer to as "Fibonacci grids". They can be thought of as mathematically ideal generalizations of the patterns occurring naturally in the spiral arrangements of seeds and fruit found in sunflower heads and pineapples (to give two of the many botanical examples). These grids possess virtually uniform and highly isotropic resolution, with an equal area for each grid point. There are only two compact singular regions on a sphere that require customized numerics. We demonstrate the practicality of these grids in shallow water simulations, and discuss the prospects for efficiently using these frameworks in three-dimensional semi-implicit and semi-Lagrangian weather prediction or climate models.

  11. Grids = Structure.

    ERIC Educational Resources Information Center

    Barrington, Linda; Carter, Jacky

    2003-01-01

    Proposes that narrow columns provide a flexible system of organization for designers. Notes that grids serve the content on the pages, help to develop a layout that will clearly direct the reader to information; and prevent visual monotony. Concludes when grid layouts are used, school publications look as good as professional ones. (PM)

  12. An adaptive multiblock high-order finite-volume method for solving the shallow-water equations on the sphere

    DOE PAGES

    McCorquodale, Peter; Ullrich, Paul; Johansen, Hans; ...

    2015-09-04

    We present a high-order finite-volume approach for solving the shallow-water equations on the sphere, using multiblock grids on the cubed-sphere. This approach combines a Runge--Kutta time discretization with a fourth-order accurate spatial discretization, and includes adaptive mesh refinement and refinement in time. Results of tests show fourth-order convergence for the shallow-water equations as well as for advection in a highly deformational flow. Hierarchical adaptive mesh refinement allows solution error to be achieved that is comparable to that obtained with uniform resolution of the most refined level of the hierarchy, but with many fewer operations.

  13. Hierarchy measure for complex networks.

    PubMed

    Mones, Enys; Vicsek, Lilla; Vicsek, Tamás

    2012-01-01

    Nature, technology and society are full of complexity arising from the intricate web of the interactions among the units of the related systems (e.g., proteins, computers, people). Consequently, one of the most successful recent approaches to capturing the fundamental features of the structure and dynamics of complex systems has been the investigation of the networks associated with the above units (nodes) together with their relations (edges). Most complex systems have an inherently hierarchical organization and, correspondingly, the networks behind them also exhibit hierarchical features. Indeed, several papers have been devoted to describing this essential aspect of networks, however, without resulting in a widely accepted, converging concept concerning the quantitative characterization of the level of their hierarchy. Here we develop an approach and propose a quantity (measure) which is simple enough to be widely applicable, reveals a number of universal features of the organization of real-world networks and, as we demonstrate, is capable of capturing the essential features of the structure and the degree of hierarchy in a complex network. The measure we introduce is based on a generalization of the m-reach centrality, which we first extend to directed/partially directed graphs. Then, we define the global reaching centrality (GRC), which is the difference between the maximum and the average value of the generalized reach centralities over the network. We investigate the behavior of the GRC considering both a synthetic model with an adjustable level of hierarchy and real networks. Results for real networks show that our hierarchy measure is related to the controllability of the given system. We also propose a visualization procedure for large complex networks that can be used to obtain an overall qualitative picture about the nature of their hierarchical structure.

  14. Hierarchy Measure for Complex Networks

    PubMed Central

    Mones, Enys; Vicsek, Lilla; Vicsek, Tamás

    2012-01-01

    Nature, technology and society are full of complexity arising from the intricate web of the interactions among the units of the related systems (e.g., proteins, computers, people). Consequently, one of the most successful recent approaches to capturing the fundamental features of the structure and dynamics of complex systems has been the investigation of the networks associated with the above units (nodes) together with their relations (edges). Most complex systems have an inherently hierarchical organization and, correspondingly, the networks behind them also exhibit hierarchical features. Indeed, several papers have been devoted to describing this essential aspect of networks, however, without resulting in a widely accepted, converging concept concerning the quantitative characterization of the level of their hierarchy. Here we develop an approach and propose a quantity (measure) which is simple enough to be widely applicable, reveals a number of universal features of the organization of real-world networks and, as we demonstrate, is capable of capturing the essential features of the structure and the degree of hierarchy in a complex network. The measure we introduce is based on a generalization of the m-reach centrality, which we first extend to directed/partially directed graphs. Then, we define the global reaching centrality (GRC), which is the difference between the maximum and the average value of the generalized reach centralities over the network. We investigate the behavior of the GRC considering both a synthetic model with an adjustable level of hierarchy and real networks. Results for real networks show that our hierarchy measure is related to the controllability of the given system. We also propose a visualization procedure for large complex networks that can be used to obtain an overall qualitative picture about the nature of their hierarchical structure. PMID:22470477

  15. Combinatorial solutions to integrable hierarchies

    NASA Astrophysics Data System (ADS)

    Kazarian, M. E.; Lando, S. K.

    2015-06-01

    This paper reviews modern approaches to the construction of formal solutions to integrable hierarchies of mathematical physics whose coefficients are answers to various enumerative problems. The relationship between these approaches and the combinatorics of symmetric groups and their representations is explained. Applications of the results to the construction of efficient computations in problems related to models of quantum field theories are described. Bibliography: 34 titles.

  16. Solving the wrong hierarchy problem

    DOE PAGES

    Blinov, Nikita; Hook, Anson

    2016-06-29

    Many theories require augmenting the Standard Model with additional scalar fields with large order one couplings. We present a new solution to the hierarchy problem for these scalar fields. We explore parity- and Z2-symmetric theories where the Standard Model Higgs potential has two vacua. The parity or Z2 copy of the Higgs lives in the minimum far from the origin while our Higgs occupies the minimum near the origin of the potential. This approach results in a theory with multiple light scalar fields but with only a single hierarchy problem, since the bare mass is tied to the Higgs massmore » by a discrete symmetry. The new scalar does not have a new hierarchy problem associated with it because its expectation value and mass are generated by dimensional transmutation of the scalar quartic coupling. The location of the second Higgs minimum is not a free parameter, but is rather a function of the matter content of the theory. As a result, these theories are extremely predictive. We develop this idea in the context of a solution to the strong CP problem. Lastly, we show this mechanism postdicts the top Yukawa to be within 1σ of the currently measured value and predicts scalar color octets with masses in the range 9-200 TeV.« less

  17. Solving the wrong hierarchy problem

    SciTech Connect

    Blinov, Nikita; Hook, Anson

    2016-06-29

    Many theories require augmenting the Standard Model with additional scalar fields with large order one couplings. We present a new solution to the hierarchy problem for these scalar fields. We explore parity- and Z2-symmetric theories where the Standard Model Higgs potential has two vacua. The parity or Z2 copy of the Higgs lives in the minimum far from the origin while our Higgs occupies the minimum near the origin of the potential. This approach results in a theory with multiple light scalar fields but with only a single hierarchy problem, since the bare mass is tied to the Higgs mass by a discrete symmetry. The new scalar does not have a new hierarchy problem associated with it because its expectation value and mass are generated by dimensional transmutation of the scalar quartic coupling. The location of the second Higgs minimum is not a free parameter, but is rather a function of the matter content of the theory. As a result, these theories are extremely predictive. We develop this idea in the context of a solution to the strong CP problem. Lastly, we show this mechanism postdicts the top Yukawa to be within 1σ of the currently measured value and predicts scalar color octets with masses in the range 9-200 TeV.

  18. Solving the wrong hierarchy problem

    NASA Astrophysics Data System (ADS)

    Blinov, Nikita; Hook, Anson

    2016-06-01

    Many theories require augmenting the Standard Model with additional scalar fields with large order one couplings. We present a new solution to the hierarchy problem for these scalar fields. We explore parity- and Z_2 -symmetric theories where the Standard Model Higgs potential has two vacua. The parity or Z_2 copy of the Higgs lives in the minimum far from the origin while our Higgs occupies the minimum near the origin of the potential. This approach results in a theory with multiple light scalar fields but with only a single hierarchy problem, since the bare mass is tied to the Higgs mass by a discrete symmetry. The new scalar does not have a new hierarchy problem associated with it because its expectation value and mass are generated by dimensional transmutation of the scalar quartic coupling. The location of the second Higgs minimum is not a free parameter, but is rather a function of the matter content of the theory. As a result, these theories are extremely predictive. We develop this idea in the context of a solution to the strong CP problem. We show this mechanism postdicts the top Yukawa to be within 1 σ of the currently measured value and predicts scalar color octets with masses in the range 9-200 TeV.

  19. Grid oscillators

    NASA Technical Reports Server (NTRS)

    Popovic, Zorana B.; Kim, Moonil; Rutledge, David B.

    1988-01-01

    Loading a two-dimensional grid with active devices offers a means of combining the power of solid-state oscillators in the microwave and millimeter-wave range. The grid structure allows a large number of negative resistance devices to be combined. This approach is attractive because the active devices do not require an external locking signal, and the combining is done in free space. In addition, the loaded grid is a planar structure amenable to monolithic integration. Measurements on a 25-MESFET grid at 9.7 GHz show power-combining and frequency-locking without an external locking signal, with an ERP of 37 W. Experimental far-field patterns agree with theoretical results obtained using reciprocity.

  20. Grid Computing

    NASA Astrophysics Data System (ADS)

    Foster, Ian

    2001-08-01

    The term "Grid Computing" refers to the use, for computational purposes, of emerging distributed Grid infrastructures: that is, network and middleware services designed to provide on-demand and high-performance access to all important computational resources within an organization or community. Grid computing promises to enable both evolutionary and revolutionary changes in the practice of computational science and engineering based on new application modalities such as high-speed distributed analysis of large datasets, collaborative engineering and visualization, desktop access to computation via "science portals," rapid parameter studies and Monte Carlo simulations that use all available resources within an organization, and online analysis of data from scientific instruments. In this article, I examine the status of Grid computing circa 2000, briefly reviewing some relevant history, outlining major current Grid research and development activities, and pointing out likely directions for future work. I also present a number of case studies, selected to illustrate the potential of Grid computing in various areas of science.

  1. On matrix Painlevé hierarchies

    NASA Astrophysics Data System (ADS)

    Gordoa, P. R.; Pickering, A.; Zhu, Z. N.

    2016-07-01

    We define a matrix first Painlevé hierarchy and a matrix second Painlevé (PII) hierarchy. For our matrix PII hierarchy we also give auto-Bäcklund transformations and consider the iteration of solutions. This is the first paper to define matrix Painlevé hierarchies and to give auto-Bäcklund transformations for a matrix Painlevé hierarchy. We also consider, amongst other results, the derivation of sequences of special integrals and autonomous limits. Until now it has been unknown how to connect the known matrix PII equation to the obvious candidates for related completely integrable matrix partial differential equations. Our matrix PII hierarchy is placed firmly within the context of a matrix modified Korteweg-de Vries (mKdV) hierarchy. In deriving our matrix PII hierarchy we make use of the Hamiltonian structure of this matrix mKdV hierarchy. We thus see once again the importance for Painlevé hierarchies of the integrability structures of related completely integrable equations.

  2. Grid flexibility and patching techniques

    NASA Technical Reports Server (NTRS)

    Keith, T. G.; Smith, L. W.; Yung, C. N.; Barthelson, S. H.; Dewitt, K. J.

    1984-01-01

    The numerical determination of combustor flowfields is of great value to the combustor designer. An a priori knowledge of the flow behavior can speed the combustor design process and reduce the number of experimental test rigs required to arrive at an optimal design. Even 2-D steady incompressible isothermal flow predictions are of use; many codes of this kind are available, each employing different techniques to surmount the difficulties arising from the nonlinearity of the governing equations and from typically irregular combustor geometries. Mapping techniques (algebraic and elliptic PDE), and adaptive grid methods (both multi-grid and grid embedding) as applied to axisymmetric combustors are discussed.

  3. Multilevel adaptive solution procedure for material nonlinear problems in visual programming environment

    SciTech Connect

    Kim, D.; Ghanem, R.

    1994-12-31

    Multigrid solution technique to solve a material nonlinear problem in a visual programming environment using the finite element method is discussed. The nonlinear equation of equilibrium is linearized to incremental form using Newton-Rapson technique, then multigrid solution technique is used to solve linear equations at each Newton-Rapson step. In the process, adaptive mesh refinement, which is based on the bisection of a pair of triangles, is used to form grid hierarchy for multigrid iteration. The solution process is implemented in a visual programming environment with distributed computing capability, which enables more intuitive understanding of solution process, and more effective use of resources.

  4. Emergent Power Hierarchies and Group Performance.

    PubMed

    Frauendorfer, Denise; Schmid Mast, Marianne; Sanchez-Cortes, Dairazalia; Gatica-Perez, Daniel

    2015-10-01

    In newly formed groups, informal hierarchies emerge automatically and readily. In this study, we argue that emergent group hierarchies enhance group performance (Hypothesis 1) and we assume that the more the power hierarchy within a group corresponds to the task-competence differences of the individual group members, the better the group performs (Hypothesis 2). Twelve three-person groups and 28 four-person groups were investigated while solving the Winter Survival Task. Results show that emerging power hierarchies positively impact group performance but the alignment between task-competence and power hierarchy did not affect group performance. Thus, emergent power hierarchies are beneficial for group performance and although they were on average created around individual group members' competence, this correspondence was not a prerequisite for better group performance.

  5. GRChombo: Numerical relativity with adaptive mesh refinement

    NASA Astrophysics Data System (ADS)

    Clough, Katy; Figueras, Pau; Finkel, Hal; Kunesch, Markus; Lim, Eugene A.; Tunyasuvunakool, Saran

    2015-12-01

    In this work, we introduce {\\mathtt{GRChombo}}: a new numerical relativity code which incorporates full adaptive mesh refinement (AMR) using block structured Berger-Rigoutsos grid generation. The code supports non-trivial ‘many-boxes-in-many-boxes’ mesh hierarchies and massive parallelism through the message passing interface. {\\mathtt{GRChombo}} evolves the Einstein equation using the standard BSSN formalism, with an option to turn on CCZ4 constraint damping if required. The AMR capability permits the study of a range of new physics which has previously been computationally infeasible in a full 3 + 1 setting, while also significantly simplifying the process of setting up the mesh for these problems. We show that {\\mathtt{GRChombo}} can stably and accurately evolve standard spacetimes such as binary black hole mergers and scalar collapses into black holes, demonstrate the performance characteristics of our code, and discuss various physics problems which stand to benefit from the AMR technique.

  6. Modeling rises and falls in money addicted social hierarchies

    NASA Astrophysics Data System (ADS)

    Dybiec, Bartłomiej; Mitarai, Namiko; Sneppen, Kim

    2014-08-01

    The emergence of large communities is inherently associated with the creation of social structures. Connections between individuals are indispensable for cooperative action of agents building social groups. Moreover, social groups usually evolve and their structure changes over time. Consequently, an underlying network connecting individuals is not static, reflecting an ongoing adaptation to new conditions. The evolution of social connections is influenced by the relative position (hierarchy) of individuals building the system as well as by the availability of resources. We explore this aspect of human ambition by modeling the interplay of social networking and an uneven distribution of external resources. The model naturally generates social hierarchies. Remarkably, this social structure exhibits a rise-and-fall behavior. A well pronounced quasi-periodic dynamics, which is closely associated with the dissipation of resources that are needed to sustain the social links, is revealed.

  7. Hierarchy in a double braneworld

    SciTech Connect

    Guerrero, Rommel; Rodriguez, R. Omar; Melfo, Alejandra; Pantoja, Nelson

    2006-10-15

    We show that the hierarchy between the Planck and the weak scales can follow from the tendency of gravitons and fermions to localize at different edges of a thick double wall embedded in an AdS{sub 5} spacetime without reflection symmetry. This double wall is a stable BPS thick-wall solution with two subwalls located at its edges; fermions are coupled to the scalar field through Yukawa interactions, but the lack of reflection symmetry forces them to be localized in one of the subwalls. We show that the graviton zero-mode wave function is suppressed in the fermion edge by an exponential function of the distance between the subwalls, and that the massive modes decouple so that Newtonian gravity is recuperated.

  8. Models of Neutrino Masses: Anarchy versus Hierarchy

    NASA Astrophysics Data System (ADS)

    Altarelli, Guido; Feruglio, Ferruccio; Masina, Isabella

    2003-01-01

    We present a quantitative study of the ability of models with different levels of hierarchy to reproduce the solar neutrino solutions, in particular the LA solution. As a flexible testing ground we consider models based on SU(5) × U(1)F. In this context, we have made statistical simulations of models with different patterns from anarchy to various types of hierarchy: normal hierarchical models with and without automatic suppression of the 23 (sub)determinant and inverse hierarchy models. We find that, not only for the LOW or VO solutions, but even in the LA case, the hierarchical models have a significantly better success rate than those based on anarchy. The normal hierarchy and the inverse hierarchy models have comparable performances in models with see-saw dominance, while the inverse hierarchy models are particularly good in the no see-saw versions. As a possible distinction between these categories of models, the inverse hierarchy models favour a maximal solar mixing angle and their rate of success drops dramatically as the mixing angle decreases, while normal hierarchy models are far more stable in this respect.

  9. On the robustness of Herlihy's hierarchy

    NASA Technical Reports Server (NTRS)

    Jayanti, Prasad

    1993-01-01

    A wait-free hierarchy maps object types to levels in Z(+) U (infinity) and has the following property: if a type T is at level N, and T' is an arbitrary type, then there is a wait-free implementation of an object of type T', for N processes, using only registers and objects of type T. The infinite hierarchy defined by Herlihy is an example of a wait-free hierarchy. A wait-free hierarchy is robust if it has the following property: if T is at level N, and S is a finite set of types belonging to levels N - 1 or lower, then there is no wait-free implementation of an object of type T, for N processes, using any number and any combination of objects belonging to the types in S. Robustness implies that there are no clever ways of combining weak shared objects to obtain stronger ones. Contrary to what many researchers believe, we prove that Herlihy's hierarchy is not robust. We then define some natural variants of Herlihy's hierarchy, which are also infinite wait-free hierarchies. With the exception of one, which is still open, these are not robust either. We conclude with the open question of whether non-trivial robust wait-free hierarchies exist.

  10. Grid generation on surfaces in 3 dimensions

    NASA Technical Reports Server (NTRS)

    Eiseman, Peter R.

    1986-01-01

    The development of a surface grid generation algorithm was initiated. The basic adaptive movement technique of mean-value-relaxation was extended from the viewpoint of a single coordinate grid over a surface described by a single scalar function to that of a surface more generally defined by vector functions and covered by a collection of smoothly connected grids. Within the multiconnected assemblage, the application of control was examined in several instances.

  11. Solving Partial Differential Equations on Overlapping Grids

    SciTech Connect

    Henshaw, W D

    2008-09-22

    We discuss the solution of partial differential equations (PDEs) on overlapping grids. This is a powerful technique for efficiently solving problems in complex, possibly moving, geometry. An overlapping grid consists of a set of structured grids that overlap and cover the computational domain. By allowing the grids to overlap, grids for complex geometries can be more easily constructed. The overlapping grid approach can also be used to remove coordinate singularities by, for example, covering a sphere with two or more patches. We describe the application of the overlapping grid approach to a variety of different problems. These include the solution of incompressible fluid flows with moving and deforming geometry, the solution of high-speed compressible reactive flow with rigid bodies using adaptive mesh refinement (AMR), and the solution of the time-domain Maxwell's equations of electromagnetism.

  12. Generating Composite Overlapping Grids on CAD Geometries

    SciTech Connect

    Henshaw, W.D.

    2002-02-07

    We describe some algorithms and tools that have been developed to generate composite overlapping grids on geometries that have been defined with computer aided design (CAD) programs. This process consists of five main steps. Starting from a description of the surfaces defining the computational domain we (1) correct errors in the CAD representation, (2) determine topology of the patched-surface, (3) build a global triangulation of the surface, (4) construct structured surface and volume grids using hyperbolic grid generation, and (5) generate the overlapping grid by determining the holes and the interpolation points. The overlapping grid generator which is used for the final step also supports the rapid generation of grids for block-structured adaptive mesh refinement and for moving grids. These algorithms have been implemented as part of the Overture object-oriented framework.

  13. Recursion Relations for Double Ramification Hierarchies

    NASA Astrophysics Data System (ADS)

    Buryak, Alexandr; Rossi, Paolo

    2016-03-01

    In this paper we study various properties of the double ramification hierarchy, an integrable hierarchy of hamiltonian PDEs introduced in Buryak (CommunMath Phys 336(3):1085-1107, 2015) using intersection theory of the double ramification cycle in the moduli space of stable curves. In particular, we prove a recursion formula that recovers the full hierarchy starting from just one of the Hamiltonians, the one associated to the first descendant of the unit of a cohomological field theory. Moreover, we introduce analogues of the topological recursion relations and the divisor equation both for the Hamiltonian densities and for the string solution of the double ramification hierarchy. This machinery is very efficient and we apply it to various computations for the trivial and Hodge cohomological field theories, and for the r -spin Witten's classes. Moreover, we prove the Miura equivalence between the double ramification hierarchy and the Dubrovin-Zhang hierarchy for the Gromov-Witten theory of the complex projective line (extended Toda hierarchy).

  14. Hierarchy is Detrimental for Human Cooperation.

    PubMed

    Cronin, Katherine A; Acheson, Daniel J; Hernández, Penélope; Sánchez, Angel

    2015-12-22

    Studies of animal behavior consistently demonstrate that the social environment impacts cooperation, yet the effect of social dynamics has been largely excluded from studies of human cooperation. Here, we introduce a novel approach inspired by nonhuman primate research to address how social hierarchies impact human cooperation. Participants competed to earn hierarchy positions and then could cooperate with another individual in the hierarchy by investing in a common effort. Cooperation was achieved if the combined investments exceeded a threshold, and the higher ranked individual distributed the spoils unless control was contested by the partner. Compared to a condition lacking hierarchy, cooperation declined in the presence of a hierarchy due to a decrease in investment by lower ranked individuals. Furthermore, hierarchy was detrimental to cooperation regardless of whether it was earned or arbitrary. These findings mirror results from nonhuman primates and demonstrate that hierarchies are detrimental to cooperation. However, these results deviate from nonhuman primate findings by demonstrating that human behavior is responsive to changing hierarchical structures and suggests partnership dynamics that may improve cooperation. This work introduces a controlled way to investigate the social influences on human behavior, and demonstrates the evolutionary continuity of human behavior with other primate species.

  15. Hierarchy is Detrimental for Human Cooperation

    PubMed Central

    Cronin, Katherine A.; Acheson, Daniel J.; Hernández, Penélope; Sánchez, Angel

    2015-01-01

    Studies of animal behavior consistently demonstrate that the social environment impacts cooperation, yet the effect of social dynamics has been largely excluded from studies of human cooperation. Here, we introduce a novel approach inspired by nonhuman primate research to address how social hierarchies impact human cooperation. Participants competed to earn hierarchy positions and then could cooperate with another individual in the hierarchy by investing in a common effort. Cooperation was achieved if the combined investments exceeded a threshold, and the higher ranked individual distributed the spoils unless control was contested by the partner. Compared to a condition lacking hierarchy, cooperation declined in the presence of a hierarchy due to a decrease in investment by lower ranked individuals. Furthermore, hierarchy was detrimental to cooperation regardless of whether it was earned or arbitrary. These findings mirror results from nonhuman primates and demonstrate that hierarchies are detrimental to cooperation. However, these results deviate from nonhuman primate findings by demonstrating that human behavior is responsive to changing hierarchical structures and suggests partnership dynamics that may improve cooperation. This work introduces a controlled way to investigate the social influences on human behavior, and demonstrates the evolutionary continuity of human behavior with other primate species. PMID:26692287

  16. Diagonal gates in the Clifford hierarchy

    NASA Astrophysics Data System (ADS)

    Cui, Shawn X.; Gottesman, Daniel; Krishna, Anirudh

    2017-01-01

    The Clifford hierarchy is a set of gates that appears in the theory of fault-tolerant quantum computation, but its precise structure remains elusive. We give a complete characterization of the diagonal gates in the Clifford hierarchy for prime-dimensional qudits. They turn out to be pmth roots of unity raised to polynomial functions of the basis state to which they are applied, and we determine which level of the Clifford hierarchy a given gate sits in based on m and the degree of the polynomial.

  17. Formal language theory: refining the Chomsky hierarchy.

    PubMed

    Jäger, Gerhard; Rogers, James

    2012-07-19

    The first part of this article gives a brief overview of the four levels of the Chomsky hierarchy, with a special emphasis on context-free and regular languages. It then recapitulates the arguments why neither regular nor context-free grammar is sufficiently expressive to capture all phenomena in the natural language syntax. In the second part, two refinements of the Chomsky hierarchy are reviewed, which are both relevant to the extant research in cognitive science: the mildly context-sensitive languages (which are located between context-free and context-sensitive languages), and the sub-regular hierarchy (which distinguishes several levels of complexity within the class of regular languages).

  18. Fermion hierarchy from sfermion anarchy

    DOE PAGES

    Altmannshofer, Wolfgang; Frugiuele, Claudia; Harnik, Roni

    2014-12-31

    We present a framework to generate the hierarchical flavor structure of Standard Model quarks and leptons from loops of superpartners. The simplest model consists of the minimal supersymmetric standard model with tree level Yukawa couplings for the third generation only and anarchic squark and slepton mass matrices. Agreement with constraints from low energy flavor observables, in particular Kaon mixing, is obtained for supersymmetric particles with masses at the PeV scale or above. In our framework both the second and the first generation fermion masses are generated at 1-loop. Despite this, a novel mechanism generates a hierarchy among the first andmore » second generations without imposing a symmetry or small parameters. A second-to-first generation mass ratio of order 100 is typical. The minimal supersymmetric standard model thus includes all the necessary ingredients to realize a fermion spectrum that is qualitatively similar to observation, with hierarchical masses and mixing. The minimal framework produces only a few quantitative discrepancies with observation, most notably the muon mass is too low. Furthermore, we discuss simple modifications which resolve this and also investigate the compatibility of our model with gauge and Yukawa coupling Unification.« less

  19. Sniffing behavior communicates social hierarchy.

    PubMed

    Wesson, Daniel W

    2013-04-08

    Sniffing is a specialized respiratory behavior that is essential for the acquisition of odors [1-4]. Perhaps not independent of this, sniffing is commonly displayed during motivated [5-7] and social behaviors [8, 9]. No measures of sniffing among interacting animals are available, however, calling into question the utility of this behavior in the social context. From radiotelemetry recordings of nasal respiration, I found that investigation by one rat toward the facial region of a conspecific often elicits a decrease in sniffing frequency in the conspecific. This reciprocal display of sniffing was found to be dependent upon the rat's social status in two separate paradigms, with subordinates reliably decreasing their sniffing frequency upon being investigated in the face by dominant rats. Failure of subordinates to decrease their sniffing frequency shortened the latency for agonistic behavior by dominant rats, reflecting that decreases in sniffing serve as appeasement signals during social interactions. Rats rendered unable to smell persisted in displaying reciprocal sniffing behavior, demonstrating the independence of this behavior from olfaction. Oxytocin treatment in rats with established social hierarchies abolished agonistic behaviors and reciprocal sniffing displays. Together, these findings demonstrate that rodents utilize sniffing behaviors communicatively, not only to collect [6, 10-14] but also to convey information.

  20. Fermion hierarchy from sfermion anarchy

    SciTech Connect

    Altmannshofer, Wolfgang; Frugiuele, Claudia; Harnik, Roni

    2014-12-31

    We present a framework to generate the hierarchical flavor structure of Standard Model quarks and leptons from loops of superpartners. The simplest model consists of the minimal supersymmetric standard model with tree level Yukawa couplings for the third generation only and anarchic squark and slepton mass matrices. Agreement with constraints from low energy flavor observables, in particular Kaon mixing, is obtained for supersymmetric particles with masses at the PeV scale or above. In our framework both the second and the first generation fermion masses are generated at 1-loop. Despite this, a novel mechanism generates a hierarchy among the first and second generations without imposing a symmetry or small parameters. A second-to-first generation mass ratio of order 100 is typical. The minimal supersymmetric standard model thus includes all the necessary ingredients to realize a fermion spectrum that is qualitatively similar to observation, with hierarchical masses and mixing. The minimal framework produces only a few quantitative discrepancies with observation, most notably the muon mass is too low. Furthermore, we discuss simple modifications which resolve this and also investigate the compatibility of our model with gauge and Yukawa coupling Unification.

  1. Datums, Ellipsoids, Grids, and Grid Reference Systems

    DTIC Science & Technology

    1992-01-01

    Tunisie Grid, Sud Algerie Grid, Sud Maroc Grid, and Sud Tunisie Grid. 4-1.1.8 The...REFERENCES ON THE SUD ALGERIE AND SUD TUNISIE GRIDS 6-8.5.2 When oil reference boxes cannot be accommodated in the margin, the excess is shown in expanses...GIVING REFERENCES ON THE SUD ALGERIE AND SUD TUNISIE GRIDS 6-21 DMA TM 8358.1 I CHAPTER 7 GRIDS ON MAPS AT 1:250,000 AND 1:500,000 SCALE 7.1 GENERAL.

  2. NLO Hierarchy of Wilson Lines Evolution

    SciTech Connect

    Balitsky, Ian

    2015-03-01

    The high-energy behavior of QCD amplitudes can be described in terms of the rapidity evolution of Wilson lines. I present the hierarchy of evolution equations for Wilson lines in the next-to-leading order.

  3. Liouville Correspondence Between the Short-Pulse Hierarchy and the Sine-Gordon Hierarchy

    NASA Astrophysics Data System (ADS)

    Kang, Jing; Liu, Xiaochuan; Qu, Changzheng

    2016-12-01

    The Liouville correspondence between the short-pulse integrable hierarchy and the sine-Gordon integrable hierarchy is studied. It is shown that the transformation relating the short-pulse equation with the sine-Gordon equation also establishes the correspondence between their flows and Hamiltonian conservation laws in respective hierarchy. This proposes an alternative approach to derive the Hamiltonian conservation laws of the short-pulse equation from the known ones of the classical sine-Gordon equation.

  4. Generation of unstructured grids and Euler solutions for complex geometries

    NASA Technical Reports Server (NTRS)

    Loehner, Rainald; Parikh, Paresh; Salas, Manuel D.

    1989-01-01

    Algorithms are described for the generation and adaptation of unstructured grids in two and three dimensions, as well as Euler solvers for unstructured grids. The main purpose is to demonstrate how unstructured grids may be employed advantageously for the economic simulation of both geometrically as well as physically complex flow fields.

  5. Software systems used for unstructured grid generation at NASA Langley

    NASA Technical Reports Server (NTRS)

    Bockelie, Michael J.

    1993-01-01

    These viewgraphs provide an overview of grid generation system for 3D configurations (Euler Grids) and grid generators of viscous and inviscid flow, solution adaptive for steady and unsteady flow. The five systems presented are VGRID, FELISA, TETRA, NGP, and TGRID.

  6. Non-Galerkin Coarse Grids for Algebraic Multigrid

    SciTech Connect

    Falgout, Robert D.; Schroder, Jacob B.

    2014-06-26

    Algebraic multigrid (AMG) is a popular and effective solver for systems of linear equations that arise from discretized partial differential equations. And while AMG has been effectively implemented on large scale parallel machines, challenges remain, especially when moving to exascale. Particularly, stencil sizes (the number of nonzeros in a row) tend to increase further down in the coarse grid hierarchy, and this growth leads to more communication. Therefore, as problem size increases and the number of levels in the hierarchy grows, the overall efficiency of the parallel AMG method decreases, sometimes dramatically. This growth in stencil size is due to the standard Galerkin coarse grid operator, $P^T A P$, where $P$ is the prolongation (i.e., interpolation) operator. For example, the coarse grid stencil size for a simple three-dimensional (3D) seven-point finite differencing approximation to diffusion can increase into the thousands on present day machines, causing an associated increase in communication costs. We therefore consider algebraically truncating coarse grid stencils to obtain a non-Galerkin coarse grid. First, the sparsity pattern of the non-Galerkin coarse grid is determined by employing a heuristic minimal “safe” pattern together with strength-of-connection ideas. Second, the nonzero entries are determined by collapsing the stencils in the Galerkin operator using traditional AMG techniques. The result is a reduction in coarse grid stencil size, overall operator complexity, and parallel AMG solve phase times.

  7. The closure approximation in the hierarchy equations.

    NASA Technical Reports Server (NTRS)

    Adomian, G.

    1971-01-01

    The expectation of the solution process in a stochastic operator equation can be obtained from averaged equations only under very special circumstances. Conditions for validity are given and the significance and validity of the approximation in widely used hierarchy methods and the ?self-consistent field' approximation in nonequilibrium statistical mechanics are clarified. The error at any level of the hierarchy can be given and can be avoided by the use of the iterative method.

  8. High order finite volume methods on wavelet-adapted grids with local time-stepping on multicore architectures for the simulation of shock-bubble interactions

    NASA Astrophysics Data System (ADS)

    Hejazialhosseini, Babak; Rossinelli, Diego; Bergdorf, Michael; Koumoutsakos, Petros

    2010-11-01

    We present a space-time adaptive solver for single- and multi-phase compressible flows that couples average interpolating wavelets with high-order finite volume schemes. The solver introduces the concept of wavelet blocks, handles large jumps in resolution and employs local time-stepping for efficient time integration. We demonstrate that the inherently sequential wavelet-based adaptivity can be implemented efficiently in multicore computer architectures using task-based parallelism and introducing the concept of wavelet blocks. We validate our computational method on a number of benchmark problems and we present simulations of shock-bubble interaction at different Mach numbers, demonstrating the accuracy and computational performance of the method.

  9. GridMan: A grid manipulation system

    NASA Technical Reports Server (NTRS)

    Eiseman, Peter R.; Wang, Zhu

    1992-01-01

    GridMan is an interactive grid manipulation system. It operates on grids to produce new grids which conform to user demands. The input grids are not constrained to come from any particular source. They may be generated by algebraic methods, elliptic methods, hyperbolic methods, parabolic methods, or some combination of methods. The methods are included in the various available structured grid generation codes. These codes perform the basic assembly function for the various elements of the initial grid. For block structured grids, the assembly can be quite complex due to a large number of clock corners, edges, and faces for which various connections and orientations must be properly identified. The grid generation codes are distinguished among themselves by their balance between interactive and automatic actions and by their modest variations in control. The basic form of GridMan provides a much more substantial level of grid control and will take its input from any of the structured grid generation codes. The communication link to the outside codes is a data file which contains the grid or section of grid.

  10. ARPA-E: Advancing the Electric Grid

    SciTech Connect

    Lemmon, John; Ruiz, Pablo; Sommerer, Tim; Aziz, Michael

    2014-02-24

    The electric grid was designed with the assumption that all energy generation sources would be relatively controllable, and grid operators would always be able to predict when and where those sources would be located. With the addition of renewable energy sources like wind and solar, which can be installed faster than traditional generation technologies, this is no longer the case. Furthermore, the fact that renewable energy sources are imperfectly predictable means that the grid has to adapt in real-time to changing patterns of power flow. We need a dynamic grid that is far more flexible. This video highlights three ARPA-E-funded approaches to improving the grid's flexibility: topology control software from Boston University that optimizes power flow, gas tube switches from General Electric that provide efficient power conversion, and flow batteries from Harvard University that offer grid-scale energy storage.

  11. ARPA-E: Advancing the Electric Grid

    ScienceCinema

    Lemmon, John; Ruiz, Pablo; Sommerer, Tim; Aziz, Michael

    2016-07-12

    The electric grid was designed with the assumption that all energy generation sources would be relatively controllable, and grid operators would always be able to predict when and where those sources would be located. With the addition of renewable energy sources like wind and solar, which can be installed faster than traditional generation technologies, this is no longer the case. Furthermore, the fact that renewable energy sources are imperfectly predictable means that the grid has to adapt in real-time to changing patterns of power flow. We need a dynamic grid that is far more flexible. This video highlights three ARPA-E-funded approaches to improving the grid's flexibility: topology control software from Boston University that optimizes power flow, gas tube switches from General Electric that provide efficient power conversion, and flow batteries from Harvard University that offer grid-scale energy storage.

  12. Development of Three-Dimensional DRAGON Grid Technology

    NASA Technical Reports Server (NTRS)

    Zheng, Yao; Kiou, Meng-Sing; Civinskas, Kestutis C.

    1999-01-01

    For a typical three dimensional flow in a practical engineering device, the time spent in grid generation can take 70 percent of the total analysis effort, resulting in a serious bottleneck in the design/analysis cycle. The present research attempts to develop a procedure that can considerably reduce the grid generation effort. The DRAGON grid, as a hybrid grid, is created by means of a Direct Replacement of Arbitrary Grid Overlapping by Nonstructured grid. The DRAGON grid scheme is an adaptation to the Chimera thinking. The Chimera grid is a composite structured grid, composing a set of overlapped structured grids, which are independently generated and body-fitted. The grid is of high quality and amenable for efficient solution schemes. However, the interpolation used in the overlapped region between grids introduces error, especially when a sharp-gradient region is encountered. The DRAGON grid scheme is capable of completely eliminating the interpolation and preserving the conservation property. It maximizes the advantages of the Chimera scheme and adapts the strengths of the unstructured and while at the same time keeping its weaknesses minimal. In the present paper, we describe the progress towards extending the DRAGON grid technology into three dimensions. Essential and programming aspects of the extension, and new challenges for the three-dimensional cases, are addressed.

  13. The Construction of an Ontology-Based Ubiquitous Learning Grid

    ERIC Educational Resources Information Center

    Liao, Ching-Jung; Chou, Chien-Chih; Yang, Jin-Tan David

    2009-01-01

    The purpose of this study is to incorporate adaptive ontology into ubiquitous learning grid to achieve seamless learning environment. Ubiquitous learning grid uses ubiquitous computing environment to infer and determine the most adaptive learning contents and procedures in anytime, any place and with any device. To achieve the goal, an…

  14. Maslow's hierarchy of needs: a framework for achieving human potential in hospice.

    PubMed

    Zalenski, Robert J; Raspa, Richard

    2006-10-01

    Although the widespread implementation of hospice in the United States has led to tremendous advances in the care of the dying, there has been no widely accepted psychological theory to drive needs assessment and intervention design for the patient and family. The humanistic psychology of Abraham Maslow, especially his theory of motivation and the hierarchy of needs, has been widely applied in business and social science, but only sparsely discussed in the palliative care literature. In this article we review Maslow's original hierarchy, adapt it to hospice and palliative care, apply the adaptation to a case example, and then discuss its implications for patient care, education, and research. The five levels of the hierarchy of needs as adapted to palliative care are: (1) distressing symptoms, such as pain or dyspnea; (2) fears for physical safety, of dying or abandonment; (3) affection, love and acceptance in the face of devastating illness; (4) esteem, respect, and appreciation for the person; (5) selfactualization and transcendence. Maslow's modified hierarchy of palliative care needs could be utilized to provide a comprehensive approach for the assessment of patients' needs and the design of interventions to achieve goals that start with comfort and potentially extend to the experience of transcendence.

  15. Data Grid Management Systems

    NASA Technical Reports Server (NTRS)

    Moore, Reagan W.; Jagatheesan, Arun; Rajasekar, Arcot; Wan, Michael; Schroeder, Wayne

    2004-01-01

    The "Grid" is an emerging infrastructure for coordinating access across autonomous organizations to distributed, heterogeneous computation and data resources. Data grids are being built around the world as the next generation data handling systems for sharing, publishing, and preserving data residing on storage systems located in multiple administrative domains. A data grid provides logical namespaces for users, digital entities and storage resources to create persistent identifiers for controlling access, enabling discovery, and managing wide area latencies. This paper introduces data grids and describes data grid use cases. The relevance of data grids to digital libraries and persistent archives is demonstrated, and research issues in data grids and grid dataflow management systems are discussed.

  16. Boltzmann hierarchy for interacting neutrinos I: formalism

    SciTech Connect

    Oldengott, Isabel M.; Rampf, Cornelius; Wong, Yvonne Y.Y. E-mail: cornelius.rampf@port.ac.uk

    2015-04-01

    Starting from the collisional Boltzmann equation, we derive for the first time and from first principles the Boltzmann hierarchy for neutrinos including interactions with a scalar particle. Such interactions appear, for example, in majoron-like models of neutrino mass generation. We study two limits of the scalar mass: (i) An extremely massive scalar whose only role is to mediate an effective 4-fermion neutrino-neutrino interaction, and (ii) a massless scalar that can be produced in abundance and thus demands its own Boltzmann hierarchy. In contrast to, e.g., the first-order Boltzmann hierarchy for Thomson-scattering photons, our interacting neutrino/scalar Boltzmann hierarchies contain additional momentum-dependent collision terms arising from a non-negligible energy transfer in the neutrino-neutrino and neutrino-scalar interactions. This necessitates that we track each momentum mode of the phase space distributions individually, even if the particles were massless. Comparing our hierarchy with the commonly used (c{sub eff}{sup 2},c{sub vis}{sup 2})-parameterisation, we find no formal correspondence between the two approaches, which raises the question of whether the latter parameterisation even has an interpretation in terms of particle scattering. Lastly, although we have invoked majoron-like models as a motivation for our study, our treatment is in fact generally applicable to all scenarios in which the neutrino and/or other ultrarelativistic fermions interact with scalar particles.

  17. PINGU sensitivity to neutrino mass hierarchy

    SciTech Connect

    Groß, Andreas; Collaboration: IceCube-PINGU Collaboration

    2014-11-18

    Determination of the neutrino mass hierarchy (NMH) is among the most fundamental questions in particle physics. Recent measurements of 1) a large mixing angle between the first and the third neutrino mass eigenstates and 2) the first observation of atmospheric neutrino oscillations at tens of GeV with neutrino telescopes, open the intriguing new possibility to exploit matter effects in neutrino oscillation to determine the neutrino mass hierarchy. A further extension of IceCube/DeepCore called PINGU (Precision IceCube Next Generation Upgrade) has been recently envisioned with the ultimate goal to measure neutrino mass hierarchy. PINGU would consist of additional IceCube-like strings of detectors deployed in the deepest and cleanest ice in the center of IceCube. More densely deployed instrumentation would provide a threshold substantially below 10 GeV and enhance the sensitivity to the mass hierarchy signal in atmospheric neutrinos. Here we discuss an estimate of the PINGU sensitivity to the mass hierarchy determined using an approximation with an Asimov dataset and an oscillation parameter fit.

  18. AstroGrid-D: Grid technology for astronomical science

    NASA Astrophysics Data System (ADS)

    Enke, Harry; Steinmetz, Matthias; Adorf, Hans-Martin; Beck-Ratzka, Alexander; Breitling, Frank; Brüsemeister, Thomas; Carlson, Arthur; Ensslin, Torsten; Högqvist, Mikael; Nickelt, Iliya; Radke, Thomas; Reinefeld, Alexander; Reiser, Angelika; Scholl, Tobias; Spurzem, Rainer; Steinacker, Jürgen; Voges, Wolfgang; Wambsganß, Joachim; White, Steve

    2011-02-01

    We present status and results of AstroGrid-D, a joint effort of astrophysicists and computer scientists to employ grid technology for scientific applications. AstroGrid-D provides access to a network of distributed machines with a set of commands as well as software interfaces. It allows simple use of computer and storage facilities and to schedule or monitor compute tasks and data management. It is based on the Globus Toolkit middleware (GT4). Chapter 1 describes the context which led to the demand for advanced software solutions in Astrophysics, and we state the goals of the project. We then present characteristic astrophysical applications that have been implemented on AstroGrid-D in chapter 2. We describe simulations of different complexity, compute-intensive calculations running on multiple sites (Section 2.1), and advanced applications for specific scientific purposes (Section 2.2), such as a connection to robotic telescopes (Section 2.2.3). We can show from these examples how grid execution improves e.g. the scientific workflow. Chapter 3 explains the software tools and services that we adapted or newly developed. Section 3.1 is focused on the administrative aspects of the infrastructure, to manage users and monitor activity. Section 3.2 characterises the central components of our architecture: The AstroGrid-D information service to collect and store metadata, a file management system, the data management system, and a job manager for automatic submission of compute tasks. We summarise the successfully established infrastructure in chapter 4, concluding with our future plans to establish AstroGrid-D as a platform of modern e-Astronomy.

  19. Cell hierarchy and lineage commitment in the bovine mammary gland.

    PubMed

    Rauner, Gat; Barash, Itamar

    2012-01-01

    The bovine mammary gland is a favorable organ for studying mammary cell hierarchy due to its robust milk-production capabilities that reflect the adaptation of its cell populations to extensive expansion and differentiation. It also shares basic characteristics with the human breast, and identification of its cell composition may broaden our understanding of the diversity in cell hierarchy among mammals. Here, Lin⁻ epithelial cells were sorted according to expression of CD24 and CD49f into four populations: CD24(med)CD49f(pos) (putative stem cells, puStm), CD24(neg)CD49f(pos) (Basal), CD24(high)CD49f(neg) (putative progenitors, puPgt) and CD24(med)CD49f(neg) (luminal, Lum). These populations maintained differential gene expression of lineage markers and markers of stem cells and luminal progenitors. Of note was the high expression of Stat5a in the puPgt cells, and of Notch1, Delta1, Jagged1 and Hey1 in the puStm and Basal populations. Cultured puStm and Basal cells formed lineage-restricted basal or luminal clones and after re-sorting, colonies that preserved a duct-like alignment of epithelial layers. In contrast, puPgt and Lum cells generated only luminal clones and unorganized colonies. Under non-adherent culture conditions, the puPgt and puStm populations generated significantly more floating colonies. The increase in cell number during culture provides a measure of propagation potential, which was highest for the puStm cells. Taken together, these analyses position puStm cells at the top of the cell hierarchy and denote the presence of both bi-potent and luminally restricted progenitors. In addition, a population of differentiated luminal cells was marked. Finally, combining ALDH activity with cell-surface marker analyses defined a small subpopulation that is potentially stem cell-enriched.

  20. Formal language theory: refining the Chomsky hierarchy

    PubMed Central

    Jäger, Gerhard; Rogers, James

    2012-01-01

    The first part of this article gives a brief overview of the four levels of the Chomsky hierarchy, with a special emphasis on context-free and regular languages. It then recapitulates the arguments why neither regular nor context-free grammar is sufficiently expressive to capture all phenomena in the natural language syntax. In the second part, two refinements of the Chomsky hierarchy are reviewed, which are both relevant to the extant research in cognitive science: the mildly context-sensitive languages (which are located between context-free and context-sensitive languages), and the sub-regular hierarchy (which distinguishes several levels of complexity within the class of regular languages). PMID:22688632

  1. The mammary cellular hierarchy and breast cancer.

    PubMed

    Oakes, Samantha R; Gallego-Ortega, David; Ormandy, Christopher J

    2014-11-01

    Advances in the study of hematopoietic cell maturation have paved the way to a deeper understanding the stem and progenitor cellular hierarchy in the mammary gland. The mammary epithelium, unlike the hematopoietic cellular hierarchy, sits in a complex niche where communication between epithelial cells and signals from the systemic hormonal milieu, as well as from extra-cellular matrix, influence cell fate decisions and contribute to tissue homeostasis. We review the discovery, definition and regulation of the mammary cellular hierarchy and we describe the development of the concepts that have guided our investigations. We outline recent advances in in vivo lineage tracing that is now challenging many of our assumptions regarding the behavior of mammary stem cells, and we show how understanding these cellular lineages has altered our view of breast cancer.

  2. Implementing a bubble memory hierarchy system

    NASA Technical Reports Server (NTRS)

    Segura, R.; Nichols, C. D.

    1979-01-01

    This paper reports on implementation of a magnetic bubble memory in a two-level hierarchial system. The hierarchy used a major-minor loop device and RAM under microprocessor control. Dynamic memory addressing, dual bus primary memory, and hardware data modification detection are incorporated in the system to minimize access time. It is the objective of the system to incorporate the advantages of bipolar memory with that of bubble domain memory to provide a smart, optimal memory system which is easy to interface and independent of user's system.

  3. Origin of Mass Hierarchies in Gauge Theories

    NASA Astrophysics Data System (ADS)

    Cvetic, Mirjam

    We study the origin of mass hierarchies for different systems of fundamental interactions; in particular, we analyze whether the W(,L)-W(,R) mass splitting, and the fermion mass hierarchy can be of radiative origin. Within the left-right symmetric gauge structure G (TBOND) SU(2)(,L) x SU(2)(,R) x U(1)(,B-L), where fermions remain massless, the W(,L)-W(,R) mass splitting can be of radiative origin with (eta) = M(,W(,R))/m(,W(,L))) < 2 to 4. This result evades the Georgi-Pais constraint, which claims that quantum corrections can not change the symmetry of the vacuum solution at the tree level. It is found that for a realistic model, where fermions acquire mass, quantum corrections do not, however, restrict (eta) anymore. When the constraints of N = 1 supergravity are imposed on the gauge structure G with the minimal set of Higgs fields, one arrives at the following results: (i) the gravitino mass, is the only relevant scale of the model, it sets the scale for the mass of W(,R), (ii) the mass of W(,L) is necessarily derived radiatively, and (iii) (eta) = (m(,W(,R))/m(,W(,L))) < 0 (16(pi)('2)/g('2))(' 1/4) = 0(10). When the parity-odd singlet is added, a maxi-hierarchy with n >> 1 is a permissible solution. The origin of interfamily mass hierarchy (m(,(tau)) >> m(,(mu)) >> m(,e)) is studied in an instructive model where the three families and the corresponding Higgs fields appear symmetrically in the original Lagrangian. The desired interfamily hierarchy can have radiative origin. This approach again evades the Georgi-Pais constraint. The model suffers from the problem of light pseudo-Goldstone particles. In an attempt to study a complete fermion mass hierarchy problem we study the fermionic mass matrix within a realistic preonic model with four (e, (mu),(tau), (tau)') -fermionic families. The fermion mass hierarchy is realized as a hierarchy in sizes between (e,(mu))- and ((tau),(tau)') -families and as a hierarchy between the condensates formed out of preonic

  4. A perspective on unstructured grid flow solvers

    NASA Technical Reports Server (NTRS)

    Venkatakrishnan, V.

    1995-01-01

    This survey paper assesses the status of compressible Euler and Navier-Stokes solvers on unstructured grids. Different spatial and temporal discretization options for steady and unsteady flows are discussed. The integration of these components into an overall framework to solve practical problems is addressed. Issues such as grid adaptation, higher order methods, hybrid discretizations and parallel computing are briefly discussed. Finally, some outstanding issues and future research directions are presented.

  5. Large Hierarchies from Approximate R Symmetries

    SciTech Connect

    Kappl, Rolf; Ratz, Michael; Schmidt-Hoberg, Kai; Nilles, Hans Peter; Ramos-Sanchez, Saul; Vaudrevange, Patrick K. S.

    2009-03-27

    We show that hierarchically small vacuum expectation values of the superpotential in supersymmetric theories can be a consequence of an approximate R symmetry. We briefly discuss the role of such small constants in moduli stabilization and understanding the huge hierarchy between the Planck and electroweak scales.

  6. The Role of Hierarchy in Parental Nurturance.

    ERIC Educational Resources Information Center

    Faber, Anthony J.

    2002-01-01

    This article discusses the importance of parental hierarchy in regard to meeting the developmental nurturing needs of the child. It builds on Stonefish's (2000) epigenetic model of hierarchical relationship development. Through complementary and supplementary relationships between parent and child, the child is able to have his or her nurturing…

  7. Dark energy and the hierarchy problem

    NASA Astrophysics Data System (ADS)

    Chen, Pisin

    2009-03-01

    The well-known hierarchy between the Planck scale (˜10GeV) and the TeV scale, namely a ratio of ˜10 between the two, is coincidentally repeated in a inverted order between the TeV scale and the dark energy scale at ˜10eV implied by the observations. We argue that this is not a numerical coincidence. The same brane-world setups to address the first hierarchy problem may also in principle address this second hierarchy issue. Specifically, we consider supersymmetry in the bulk and its breaking on the brane and resort to the Casimir energy induced by the bulk graviton-gravitino mass-shift on the brane as the dark energy. For the ADD model we found that our notion is sensible only if the number of extra dimension n=2. We extend our study to the Randall-Sundrum model. Invoking the chirality-flip on the boundaries for SUSY-breaking, the zero-mode gravitino contribution to the Casimir energy does give rise to the double hierarchy. Unfortunately since the higher Kaluza-Klein modes acquire relative mass-shifts at the TeV level, the zero-mode contribution to Casimir energy is overshadowed.

  8. Temporal Hierarchy in Bergson and Whitehead

    ERIC Educational Resources Information Center

    Gunter, Pete A. Y.

    2005-01-01

    This article attempts to demonstrate the intelligibility of Bergson's philosophy by analyzing his philosophical method and then applying it to the notions of biological time and of temporal hierarchy in biology. Bergson's philosophical method contains three parts: the first is factual and scientific, the second intuitional and reflective, and the…

  9. A Social Status Hierarchy: Reading Groups.

    ERIC Educational Resources Information Center

    Bayer, Ann

    1981-01-01

    A study was done to determine the social status and hierarchy attached to reading achievement in a first grade class. In addition to learning to read, children are tacitly learning that reading is the most important subject to be mastered in school and that both group and individual status is determined by the reading group to which one belongs.…

  10. Variables in a Hierarchy of Difficulty.

    ERIC Educational Resources Information Center

    Nickel, Gerhard

    1971-01-01

    This paper is an attempt to show what parameters come into play when dealing with the problem of difficulty in foreign language learning. After subjecting the hierarchy of difficulty set up by R.P. Stockwell and J.D. Bowen to a critical examination, the author discusses various parameters such as individual and national difficulties, the…

  11. M Theory Solution to the Hierarchy Problem

    SciTech Connect

    Acharya, Bobby; Bobkov, Konstantin; Kane, Gordon; Kumar, Piyush; Vaman, Diana

    2006-11-10

    An old idea for explaining the hierarchy is strong gauge dynamics. We show that such dynamics also stabilizes the moduli in M theory compactifications on manifolds of G{sub 2} holonomy without fluxes. This gives stable vacua with softly broken supersymmetry, grand unification, and a distinctive spectrum of TeV and sub-TeV sparticle masses.

  12. Using Analytic Hierarchy Process in Textbook Evaluation

    ERIC Educational Resources Information Center

    Kato, Shigeo

    2014-01-01

    This study demonstrates the application of the analytic hierarchy process (AHP) in English language teaching materials evaluation, focusing in particular on its potential for systematically integrating different components of evaluation criteria in a variety of teaching contexts. AHP is a measurement procedure wherein pairwise comparisons are made…

  13. A Hierarchy Among Attitudes Toward Animals

    ERIC Educational Resources Information Center

    Bart, William M.

    1972-01-01

    Changing attitudes of man toward many animal species are viewed as one aspect in stabilizing ecosystems. This research study attempts to indicate a hierarchy among attitudes toward animals, particularly for the purpose of developing positive attitudes toward rare and endangered species. (BL)

  14. Advanced Unstructured Grid Generation for Complex Aerodynamic Applications

    NASA Technical Reports Server (NTRS)

    Pirzadeh, Shahyar Z.

    2008-01-01

    A new approach for distribution of grid points on the surface and in the volume has been developed and implemented in the NASA unstructured grid generation code VGRID. In addition to the point and line sources of prior work, the new approach utilizes surface and volume sources for automatic curvature-based grid sizing and convenient point distribution in the volume. A new exponential growth function produces smoother and more efficient grids and provides superior control over distribution of grid points in the field. All types of sources support anisotropic grid stretching which not only improves the grid economy but also provides more accurate solutions for certain aerodynamic applications. The new approach does not require a three-dimensional background grid as in the previous methods. Instead, it makes use of an efficient bounding-box auxiliary medium for storing grid parameters defined by surface sources. The new approach is less memory-intensive and more efficient computationally. The grids generated with the new method either eliminate the need for adaptive grid refinement for certain class of problems or provide high quality initial grids that would enhance the performance of many adaptation methods.

  15. Parallel grid population

    DOEpatents

    Wald, Ingo; Ize, Santiago

    2015-07-28

    Parallel population of a grid with a plurality of objects using a plurality of processors. One example embodiment is a method for parallel population of a grid with a plurality of objects using a plurality of processors. The method includes a first act of dividing a grid into n distinct grid portions, where n is the number of processors available for populating the grid. The method also includes acts of dividing a plurality of objects into n distinct sets of objects, assigning a distinct set of objects to each processor such that each processor determines by which distinct grid portion(s) each object in its distinct set of objects is at least partially bounded, and assigning a distinct grid portion to each processor such that each processor populates its distinct grid portion with any objects that were previously determined to be at least partially bounded by its distinct grid portion.

  16. Optimal moving grids for time-dependent partial differential equations

    NASA Technical Reports Server (NTRS)

    Wathen, A. J.

    1992-01-01

    Various adaptive moving grid techniques for the numerical solution of time-dependent partial differential equations were proposed. The precise criterion for grid motion varies, but most techniques will attempt to give grids on which the solution of the partial differential equation can be well represented. Moving grids are investigated on which the solutions of the linear heat conduction and viscous Burgers' equation in one space dimension are optimally approximated. Precisely, the results of numerical calculations of optimal moving grids for piecewise linear finite element approximation of PDE solutions in the least-squares norm are reported.

  17. Optimal moving grids for time-dependent partial differential equations

    NASA Technical Reports Server (NTRS)

    Wathen, A. J.

    1989-01-01

    Various adaptive moving grid techniques for the numerical solution of time-dependent partial differential equations were proposed. The precise criterion for grid motion varies, but most techniques will attempt to give grids on which the solution of the partial differential equation can be well represented. Moving grids are investigated on which the solutions of the linear heat conduction and viscous Burgers' equation in one space dimension are optimally approximated. Precisely, the results of numerical calculations of optimal moving grids for piecewise linear finite element approximation of partial differential equation solutions in the least squares norm.

  18. Scientific Grid computing.

    PubMed

    Coveney, Peter V

    2005-08-15

    We introduce a definition of Grid computing which is adhered to throughout this Theme Issue. We compare the evolution of the World Wide Web with current aspirations for Grid computing and indicate areas that need further research and development before a generally usable Grid infrastructure becomes available. We discuss work that has been done in order to make scientific Grid computing a viable proposition, including the building of Grids, middleware developments, computational steering and visualization. We review science that has been enabled by contemporary computational Grids, and associated progress made through the widening availability of high performance computing.

  19. Unstructured grids on SIMD torus machines

    NASA Technical Reports Server (NTRS)

    Bjorstad, Petter E.; Schreiber, Robert

    1994-01-01

    Unstructured grids lead to unstructured communication on distributed memory parallel computers, a problem that has been considered difficult. Here, we consider adaptive, offline communication routing for a SIMD processor grid. Our approach is empirical. We use large data sets drawn from supercomputing applications instead of an analytic model of communication load. The chief contribution of this paper is an experimental demonstration of the effectiveness of certain routing heuristics. Our routing algorithm is adaptive, nonminimal, and is generally designed to exploit locality. We have a parallel implementation of the router, and we report on its performance.

  20. Advanced Unstructured Grid Generation for Complex Aerodynamic Applications

    NASA Technical Reports Server (NTRS)

    Pirzadeh, Shahyar

    2010-01-01

    A new approach for distribution of grid points on the surface and in the volume has been developed. In addition to the point and line sources of prior work, the new approach utilizes surface and volume sources for automatic curvature-based grid sizing and convenient point distribution in the volume. A new exponential growth function produces smoother and more efficient grids and provides superior control over distribution of grid points in the field. All types of sources support anisotropic grid stretching which not only improves the grid economy but also provides more accurate solutions for certain aerodynamic applications. The new approach does not require a three-dimensional background grid as in the previous methods. Instead, it makes use of an efficient bounding-box auxiliary medium for storing grid parameters defined by surface sources. The new approach is less memory-intensive and more efficient computationally. The grids generated with the new method either eliminate the need for adaptive grid refinement for certain class of problems or provide high quality initial grids that would enhance the performance of many adaptation methods.

  1. Size structures sensory hierarchy in ocean life

    PubMed Central

    Martens, Erik A.; Wadhwa, Navish; Jacobsen, Nis S.; Lindemann, Christian; Andersen, Ken H.; Visser, André

    2015-01-01

    Survival in aquatic environments requires organisms to have effective means of collecting information from their surroundings through various sensing strategies. In this study, we explore how sensing mode and range depend on body size. We find a hierarchy of sensing modes determined by body size. With increasing body size, a larger battery of modes becomes available (chemosensing, mechanosensing, vision, hearing and echolocation, in that order) while the sensing range also increases. This size-dependent hierarchy and the transitions between primary sensory modes are explained on the grounds of limiting factors set by physiology and the physical laws governing signal generation, transmission and reception. We theoretically predict the body size limits for various sensory modes, which align well with size ranges found in literature. The treatise of all ocean life, from unicellular organisms to whales, demonstrates how body size determines available sensing modes, and thereby acts as a major structuring factor of aquatic life. PMID:26378212

  2. Risk prioritisation using the analytic hierarchy process

    NASA Astrophysics Data System (ADS)

    Sum, Rabihah Md.

    2015-12-01

    This study demonstrated how to use the Analytic Hierarchy Process (AHP) to prioritise risks of an insurance company. AHP is a technique to structure complex problems by arranging elements of the problems in a hierarchy, assigning numerical values to subjective judgements on the relative importance of the elements and synthesizing the judgements to determine which elements have the highest priority. The study is motivated by wide application of AHP as a prioritisation technique in complex problems. It aims to show AHP is able to minimise some limitations of risk assessment technique using likelihood and impact. The study shows AHP is able to provide consistency check on subjective judgements, organise a large number of risks into a structured framework, assist risk managers to make explicit risk trade-offs, and provide an easy to understand and systematic risk assessment process.

  3. Colloquium: Hierarchy of scales in language dynamics

    NASA Astrophysics Data System (ADS)

    Blythe, Richard A.

    2015-11-01

    Methods and insights from statistical physics are finding an increasing variety of applications where one seeks to understand the emergent properties of a complex interacting system. One such area concerns the dynamics of language at a variety of levels of description, from the behaviour of individual agents learning simple artificial languages from each other, up to changes in the structure of languages shared by large groups of speakers over historical timescales. In this Colloquium, we survey a hierarchy of scales at which language and linguistic behaviour can be described, along with the main progress in understanding that has been made at each of them - much of which has come from the statistical physics community. We argue that future developments may arise by linking the different levels of the hierarchy together in a more coherent fashion, in particular where this allows more effective use of rich empirical data sets.

  4. Topologically universal spectral hierarchies of quasiperiodic systems

    NASA Astrophysics Data System (ADS)

    Dana, Itzhack

    2014-05-01

    Topological properties of energy spectra of general one-dimensional quasiperiodic systems, describing also Bloch electrons in magnetic fields, are studied for an infinity of irrational modulation frequencies corresponding to irrational numbers of flux quanta per unit cell. These frequencies include well-known ones considered in works on Fibonacci quasicrystals. It is shown that the spectrum for any such frequency exhibits a self-similar hierarchy of clusters characterized by universal (system-independent) values of Chern topological integers which are exactly determined. The cluster hierarchy provides a simple and systematic organization of all the spectral gaps, labeled by universal topological numbers which are exactly determinable, thus avoiding their numerical evaluation using rational approximants of the irrational frequency. These numbers give both the quantum Hall conductance of the system and the winding number of the edge-state energy traversing a gap as a Bloch quasimomentum is varied.

  5. QLC relation and neutrino mass hierarchy

    SciTech Connect

    Ferrandis, Javier; Pakvasa, Sandip

    2005-01-27

    Latest measurements have revealed that the deviation from a maximal solar mixing angle is approximately the Cabibbo angle, i.e., QLC relation. We argue that it is not plausible that this deviation from maximality, be it a coincidence or not, comes from the charged lepton mixing. Consequently we have calculated the required corrections to the exactly bimaximal neutrino mass matrix ansatz necessary to account for the solar mass difference and the solar mixing angle. We point out that the relative size of these two corrections depends strongly on the hierarchy case under consideration. We find that the inverted hierarchy case with opposite CP parities, which is known to guarantee the RGE stability of the solar mixing angle, offers the most plausible scenario for a high energy origin of a QLC-corrected bimaximal neutrino mass matrix. This possibility may allow us to explain the QLC relation in connection with the origin of the charged fermion mass matrices.

  6. Probing Neutrino Hierarchy and Chirality via Wakes.

    PubMed

    Zhu, Hong-Ming; Pen, Ue-Li; Chen, Xuelei; Inman, Derek

    2016-04-08

    The relic neutrinos are expected to acquire a bulk relative velocity with respect to the dark matter at low redshifts, and neutrino wakes are expected to develop downstream of the dark matter halos. We propose a method of measuring the neutrino mass based on this mechanism. This neutrino wake will cause a dipole distortion of the galaxy-galaxy lensing pattern. This effect could be detected by combining upcoming lensing surveys with a low redshift galaxy survey or a 21 cm intensity mapping survey, which can map the neutrino flow field. The data obtained with LSST and Euclid should enable us to make a positive detection if the three neutrino masses are quasidegenerate with each neutrino mass of ∼0.1  eV, and a future high precision 21 cm lensing survey would allow the normal hierarchy and inverted hierarchy cases to be distinguished, and even the right-handed Dirac neutrinos may be detectable.

  7. Dynamic Power Grid Simulation

    SciTech Connect

    Top, Philip; Woodward, Carol; Smith, Steve; Banks, Lawrence; Kelley, Brian

    2015-09-14

    GridDyn is a part of power grid simulation toolkit. The code is designed using modern object oriented C++ methods utilizing C++11 and recent Boost libraries to ensure compatibility with multiple operating systems and environments.

  8. Method of grid generation

    DOEpatents

    Barnette, Daniel W.

    2002-01-01

    The present invention provides a method of grid generation that uses the geometry of the problem space and the governing relations to generate a grid. The method can generate a grid with minimized discretization errors, and with minimal user interaction. The method of the present invention comprises assigning grid cell locations so that, when the governing relations are discretized using the grid, at least some of the discretization errors are substantially zero. Conventional grid generation is driven by the problem space geometry; grid generation according to the present invention is driven by problem space geometry and by governing relations. The present invention accordingly can provide two significant benefits: more efficient and accurate modeling since discretization errors are minimized, and reduced cost grid generation since less human interaction is required.

  9. Context-dependent hierarchies in pigeons

    PubMed Central

    Nagy, Máté; Vásárhelyi, Gábor; Pettit, Benjamin; Roberts-Mariani, Isabella; Vicsek, Tamás; Biro, Dora

    2013-01-01

    Hierarchical organization is widespread in the societies of humans and other animals, both in social structure and in decision-making contexts. In the case of collective motion, the majority of case studies report that dominant individuals lead group movements, in agreement with the common conflation of the terms “dominance” and “leadership.” From a theoretical perspective, if social relationships influence interactions during collective motion, then social structure could also affect leadership in large, swarm-like groups, such as fish shoals and bird flocks. Here we use computer-vision–based methods and miniature GPS tracking to study, respectively, social dominance and in-flight leader–follower relations in pigeons. In both types of behavior we find hierarchically structured networks of directed interactions. However, instead of being conflated, dominance and leadership hierarchies are completely independent of each other. Although dominance is an important aspect of variation among pigeons, correlated with aggression and access to food, our results imply that the stable leadership hierarchies in the air must be based on a different set of individual competences. In addition to confirming the existence of independent and context-specific hierarchies in pigeons, we succeed in setting out a robust, scalable method for the automated analysis of dominance relationships, and thus of social structure, applicable to many species. Our results, as well as our methods, will help to incorporate the broader context of animal social organization into the study of collective behavior. PMID:23878247

  10. Neutrino mass hierarchy determination using reactor antineutrinos

    NASA Astrophysics Data System (ADS)

    Ghoshal, Pomita; Petcov, S. T.

    2011-03-01

    Building on earlier studies, we investigate the possibility to determine the type of neutrino mass spectrum (i.e., "the neutrino mass hierarchy") in a high statistics reactor {bar{ν }_e} experiment with a relatively large KamLAND-like detector and an optimal baseline of 60 Km. We analyze systematically the Fourier Sine and Cosine Transforms (FST and FCT) of simulated reactor antineutrino data with reference to their specific mass hierarchy-dependent features discussed earlier in the literature. We perform also a binned χ 2 analysis of the sensitivity of simulated reactor {bar{ν }_e} event spectrum data to the neutrino mass hierarchy, and determine, in particular, the characteristics of the detector and the experiment (energy resolution, visible energy threshold, exposure, systematic errors, binning of data, etc.), which would allow us to get significant information on, or even determine, the type of the neutrino mass spectrum. We find that if sin2 2 θ 13 is sufficiently large, sin2 2 θ 13 ≳ 0 .02, the requirements on the set-up of interest are very challenging, but not impossible to realize.

  11. Determining the neutrino mass hierarchy with cosmology

    SciTech Connect

    De Bernardis, Francesco; Kitching, Thomas D.; Heavens, Alan; Melchiorri, Alessandro

    2009-12-15

    The combination of current large-scale structure and cosmic microwave background anisotropies data can place strong constraints on the sum of the neutrino masses. Here we show that future cosmic shear experiments, in combination with cosmic microwave background constraints, can provide the statistical accuracy required to answer questions about differences in the mass of individual neutrino species. Allowing for the possibility that masses are nondegenerate we combine Fisher matrix forecasts for a weak lensing survey like Euclid with those for the forthcoming Planck experiment. Under the assumption that neutrino mass splitting is described by a normal hierarchy we find that the combination Planck and Euclid will possibly reach enough sensitivity to put a constraint on the mass of a single species. Using a Bayesian evidence calculation we find that such future experiments could provide strong evidence for either a normal or an inverted neutrino hierarchy. Finally we show that if a particular neutrino hierarchy is assumed then this could bias cosmological parameter constraints, for example, the dark energy equation of state parameter, by > or approx. 1{sigma}, and the sum of masses by 2.3{sigma}. We finally discuss the impact of uncertainties on the theoretical modeling of nonlinearities. The results presented in this analysis are obtained under an approximation to the nonlinear power spectrum. This significant source of uncertainty needs to be addressed in future work.

  12. Context-dependent hierarchies in pigeons.

    PubMed

    Nagy, Máté; Vásárhelyi, Gábor; Pettit, Benjamin; Roberts-Mariani, Isabella; Vicsek, Tamás; Biro, Dora

    2013-08-06

    Hierarchical organization is widespread in the societies of humans and other animals, both in social structure and in decision-making contexts. In the case of collective motion, the majority of case studies report that dominant individuals lead group movements, in agreement with the common conflation of the terms "dominance" and "leadership." From a theoretical perspective, if social relationships influence interactions during collective motion, then social structure could also affect leadership in large, swarm-like groups, such as fish shoals and bird flocks. Here we use computer-vision-based methods and miniature GPS tracking to study, respectively, social dominance and in-flight leader-follower relations in pigeons. In both types of behavior we find hierarchically structured networks of directed interactions. However, instead of being conflated, dominance and leadership hierarchies are completely independent of each other. Although dominance is an important aspect of variation among pigeons, correlated with aggression and access to food, our results imply that the stable leadership hierarchies in the air must be based on a different set of individual competences. In addition to confirming the existence of independent and context-specific hierarchies in pigeons, we succeed in setting out a robust, scalable method for the automated analysis of dominance relationships, and thus of social structure, applicable to many species. Our results, as well as our methods, will help to incorporate the broader context of animal social organization into the study of collective behavior.

  13. IPG Power Grid Overview

    NASA Technical Reports Server (NTRS)

    Hinke, Thomas

    2003-01-01

    This presentation will describe what is meant by grids and then cover the current state of the IPG. This will include an overview of the middleware that is key to the operation of the grid. The presentation will then describe some of the future directions that are planned for the IPG. Finally the presentation will conclude with a brief overview of the Global Grid Forum, which is a key activity that will contribute to the successful availability of grid components.

  14. AstroGrid-PL

    NASA Astrophysics Data System (ADS)

    Stachowski, Greg; Kundera, Tomasz; Ciecielag, Paweł; AstroGridPL Team

    2016-06-01

    We summarise the achievements AstroGrid-PL project, which aims to provide an infrastructure grid computing, distributed storage and Virtual Observatory services to the Polish astronomical community. It was developed from 2011-2015 as a domain grid component within the large PLGrid Plus project for scientific computing in Poland.

  15. GridKit

    SciTech Connect

    Peles, Slaven

    2016-11-06

    GridKit is a software development kit for interfacing power systems and power grid application software with high performance computing (HPC) libraries developed at National Labs and academia. It is also intended as interoperability layer between different numerical libraries. GridKit is not a standalone application, but comes with a suite of test examples illustrating possible usage.

  16. Chimera Grid Tools

    NASA Technical Reports Server (NTRS)

    Chan, William M.; Rogers, Stuart E.; Nash, Steven M.; Buning, Pieter G.; Meakin, Robert

    2005-01-01

    Chimera Grid Tools (CGT) is a software package for performing computational fluid dynamics (CFD) analysis utilizing the Chimera-overset-grid method. For modeling flows with viscosity about geometrically complex bodies in relative motion, the Chimera-overset-grid method is among the most computationally cost-effective methods for obtaining accurate aerodynamic results. CGT contains a large collection of tools for generating overset grids, preparing inputs for computer programs that solve equations of flow on the grids, and post-processing of flow-solution data. The tools in CGT include grid editing tools, surface-grid-generation tools, volume-grid-generation tools, utility scripts, configuration scripts, and tools for post-processing (including generation of animated images of flows and calculating forces and moments exerted on affected bodies). One of the tools, denoted OVERGRID, is a graphical user interface (GUI) that serves to visualize the grids and flow solutions and provides central access to many other tools. The GUI facilitates the generation of grids for a new flow-field configuration. Scripts that follow the grid generation process can then be constructed to mostly automate grid generation for similar configurations. CGT is designed for use in conjunction with a computer-aided-design program that provides the geometry description of the bodies, and a flow-solver program.

  17. Hierarchy of Floquet gaps and edge states for driven honeycomb lattices

    NASA Astrophysics Data System (ADS)

    Perez-Piskunow, P. M.; Foa Torres, L. E. F.; Usaj, Gonzalo

    2015-04-01

    Electromagnetic driving in a honeycomb lattice can induce gaps and topological edge states with a structure of increasing complexity as the frequency of the driving lowers. While the high-frequency case is the most simple to analyze we focus on the multiple photon processes allowed in the low-frequency regime to unveil the hierarchy of Floquet edge states. In the case of low intensities an analytical approach allows us to derive effective Hamiltonians and address the topological character of each gap in a constructive manner. At high intensities we obtain the net number of edge states, given by the winding number, with a numerical calculation of the Chern numbers of each Floquet band. Using these methods, we find a hierarchy that resembles that of a Russian nesting doll. This hierarchy classifies the gaps and the associated edge states in different orders according to the electron-photon coupling strength. For large driving intensities, we rely on the numerical calculation of the winding number, illustrated in a map of topological phase transitions. The hierarchy unveiled with the low-energy effective Hamiltonians, along with the map of topological phase transitions, discloses the complexity of the Floquet band structure in the low-frequency regime. The proposed method for obtaining the effective Hamiltonian can be easily adapted to other Dirac Hamiltonians of two-dimensional materials and even the surface of a three-dimensional topological insulator.

  18. Parallel Anisotropic Tetrahedral Adaptation

    NASA Technical Reports Server (NTRS)

    Park, Michael A.; Darmofal, David L.

    2008-01-01

    An adaptive method that robustly produces high aspect ratio tetrahedra to a general 3D metric specification without introducing hybrid semi-structured regions is presented. The elemental operators and higher-level logic is described with their respective domain-decomposed parallelizations. An anisotropic tetrahedral grid adaptation scheme is demonstrated for 1000-1 stretching for a simple cube geometry. This form of adaptation is applicable to more complex domain boundaries via a cut-cell approach as demonstrated by a parallel 3D supersonic simulation of a complex fighter aircraft. To avoid the assumptions and approximations required to form a metric to specify adaptation, an approach is introduced that directly evaluates interpolation error. The grid is adapted to reduce and equidistribute this interpolation error calculation without the use of an intervening anisotropic metric. Direct interpolation error adaptation is illustrated for 1D and 3D domains.

  19. FermiGrid

    SciTech Connect

    Yocum, D.R.; Berman, E.; Canal, P.; Chadwick, K.; Hesselroth, T.; Garzoglio, G.; Levshina, T.; Sergeev, V.; Sfiligoi, I.; Sharma, N.; Timm, S.; /Fermilab

    2007-05-01

    As one of the founding members of the Open Science Grid Consortium (OSG), Fermilab enables coherent access to its production resources through the Grid infrastructure system called FermiGrid. This system successfully provides for centrally managed grid services, opportunistic resource access, development of OSG Interfaces for Fermilab, and an interface to the Fermilab dCache system. FermiGrid supports virtual organizations (VOs) including high energy physics experiments (USCMS, MINOS, D0, CDF, ILC), astrophysics experiments (SDSS, Auger, DES), biology experiments (GADU, Nanohub) and educational activities.

  20. Grid Architecture 2

    SciTech Connect

    Taft, Jeffrey D.

    2016-01-01

    The report describes work done on Grid Architecture under the auspices of the Department of Electricity Office of Electricity Delivery and Reliability in 2015. As described in the first Grid Architecture report, the primary purpose of this work is to provide stakeholder insight about grid issues so as to enable superior decision making on their part. Doing this requires the creation of various work products, including oft-times complex diagrams, analyses, and explanations. This report provides architectural insights into several important grid topics and also describes work done to advance the science of Grid Architecture as well.

  1. Computational Aerothermodynamic Simulation Issues on Unstructured Grids

    NASA Technical Reports Server (NTRS)

    Gnoffo, Peter A.; White, Jeffery A.

    2004-01-01

    The synthesis of physical models for gas chemistry and turbulence from the structured grid codes LAURA and VULCAN into the unstructured grid code FUN3D is described. A directionally Symmetric, Total Variation Diminishing (STVD) algorithm and an entropy fix (eigenvalue limiter) keyed to local cell Reynolds number are introduced to improve solution quality for hypersonic aeroheating applications. A simple grid-adaptation procedure is incorporated within the flow solver. Simulations of flow over an ellipsoid (perfect gas, inviscid), Shuttle Orbiter (viscous, chemical nonequilibrium) and comparisons to the structured grid solvers LAURA (cylinder, Shuttle Orbiter) and VULCAN (flat plate) are presented to show current capabilities. The quality of heating in 3D stagnation regions is very sensitive to algorithm options in general, high aspect ratio tetrahedral elements complicate the simulation of high Reynolds number, viscous flow as compared to locally structured meshes aligned with the flow.

  2. Which grids are Hamiltonian

    SciTech Connect

    Hedetniemi, S. M.; Hedetniemi, S. T.; Slater, P. J.

    1980-01-01

    A complete grid G/sub m,n/ is a graph having m x n pertices that are connected to form a rectangular lattice in the plane, i.e., all edges of G/sub m,n/ connect vertices along horizontal or vertical lines. A grid is a subgraph of a complete grid. As an illustration, complete grids describe the basic pattern of streets in most cities. This paper examines the existence of Hamiltonian cycles in complete grids and complete grids with one or two vertices removed. It is determined for most values of m,n greater than or equal to 1, which grids G/sub m,n/ - (u) and G/sub m,n/ - (u,v) are Hamiltonian. 12 figures. (RWR)

  3. Information Metacatalog for a Grid

    NASA Technical Reports Server (NTRS)

    Kolano, Paul

    2007-01-01

    SWIM is a Software Information Metacatalog that gathers detailed information about the software components and packages installed on a grid resource. Information is currently gathered for Executable and Linking Format (ELF) executables and shared libraries, Java classes, shell scripts, and Perl and Python modules. SWIM is built on top of the POUR framework, which is described in the preceding article. SWIM consists of a set of Perl modules for extracting software information from a system, an XML schema defining the format of data that can be added by users, and a POUR XML configuration file that describes how these elements are used to generate periodic, on-demand, and user-specified information. Periodic software information is derived mainly from the package managers used on each system. SWIM collects information from native package managers in FreeBSD, Solaris, and IRX as well as the RPM, Perl, and Python package managers on multiple platforms. Because not all software is available, or installed in package form, SWIM also crawls the set of relevant paths from the File System Hierarchy Standard that defines the standard file system structure used by all major UNIX distributions. Using these two techniques, the vast majority of software installed on a system can be located. SWIM computes the same information gathered by the periodic routines for specific files on specific hosts, and locates software on a system given only its name and type.

  4. Understanding The Smart Grid

    SciTech Connect

    2007-11-15

    The report provides an overview of what the Smart Grid is and what is being done to define and implement it. The electric industry is preparing to undergo a transition from a centralized, producer-controlled network to a decentralized, user-interactive one. Not only will the technology involved in the electric grid change, but the entire business model of the industry will change too. A major objective of the report is to identify the changes that the Smart Grid will bring about so that industry participants can be prepared to face them. A concise overview of the development of the Smart Grid is provided. It presents an understanding of what the Smart Grid is, what new business opportunities or risks might come about due to its introduction, and what activities are already taking place regarding defining or implementing the Smart Grid. This report will be of interest to the utility industry, energy service providers, aggregators, and regulators. It will also be of interest to home/building automation vendors, information technology vendors, academics, consultants, and analysts. The scope of the report includes an overview of the Smart Grid which identifies the main components of the Smart Grid, describes its characteristics, and describes how the Smart Grid differs from the current electric grid. The overview also identifies the key concepts involved in the transition to the Smart Grid and explains why a Smart Grid is needed by identifying the deficiencies of the current grid and the need for new investment. The report also looks at the impact of the Smart Grid, identifying other industries which have gone through a similar transition, identifying the overall benefits of the Smart Grid, and discussing the impact of the Smart Grid on industry participants. Furthermore, the report looks at current activities to implement the Smart Grid including utility projects, industry collaborations, and government initiatives. Finally, the report takes a look at key technology

  5. Visual Methods for Model and Grid Validation

    NASA Technical Reports Server (NTRS)

    Pang, Alex

    1998-01-01

    This joint research interchange proposal allowed us to contribute in two directions that are of interest to NASA. These are: (a) data level comparative visualization of experimental and computational fluid flow, and (b) visualization tools for analysis of adaptively refined Cartesian grids.

  6. Institutional networks and adaptive water governance in the Klamath River Basin, USA.

    EPA Science Inventory

    Polycentric networks of formal organizations and informal stakeholder groups, as opposed to centralized institutional hierarchies, can be critically important for strengthening the capacity of governance systems to adapt to unexpected social and biophysical change. Adaptive gover...

  7. Navigation in Grid Space with the NAS Grid Benchmarks

    NASA Technical Reports Server (NTRS)

    Frumkin, Michael; Hood, Robert; Biegel, Bryan A. (Technical Monitor)

    2002-01-01

    We present a navigational tool for computational grids. The navigational process is based on measuring the grid characteristics with the NAS Grid Benchmarks (NGB) and using the measurements to assign tasks of a grid application to the grid machines. The tool allows the user to explore the grid space and to navigate the execution at a grid application to minimize its turnaround time. We introduce the notion of gridscape as a user view of the grid and show how it can be me assured by NGB, Then we demonstrate how the gridscape can be used with two different schedulers to navigate a grid application through a rudimentary grid.

  8. Insightful Workflow For Grid Computing

    SciTech Connect

    Dr. Charles Earl

    2008-10-09

    We developed a workflow adaptation and scheduling system for Grid workflow. The system currently interfaces with and uses the Karajan workflow system. We developed machine learning agents that provide the planner/scheduler with information needed to make decisions about when and how to replan. The Kubrick restructures workflow at runtime, making it unique among workflow scheduling systems. The existing Kubrick system provides a platform on which to integrate additional quality of service constraints and in which to explore the use of an ensemble of scheduling and planning algorithms. This will be the principle thrust of our Phase II work.

  9. Grid enabled Service Support Environment - SSE Grid

    NASA Astrophysics Data System (ADS)

    Goor, Erwin; Paepen, Martine

    2010-05-01

    The SSEGrid project is an ESA/ESRIN project which started in 2009 and is executed by two Belgian companies, Spacebel and VITO, and one Dutch company, Dutch Space. The main project objectives are the introduction of a Grid-based processing on demand infrastructure at the Image Processing Centre for earth observation products at VITO and the inclusion of Grid processing services in the Service Support Environment (SSE) at ESRIN. The Grid-based processing on demand infrastructure is meant to support a Grid processing on demand model for Principal Investigators (PI) and allow the design and execution of multi-sensor applications with geographically spread data while minimising the transfer of huge volumes of data. In the first scenario, 'support a Grid processing on demand model for Principal Investigators', we aim to provide processing power close to the EO-data at the processing and archiving centres. We will allow a PI (non-Grid expert user) to upload his own algorithm, as a process, and his own auxiliary data from the SSE Portal and use them in an earth observation workflow on the SSEGrid Infrastructure. The PI can design and submit workflows using his own processes, processes made available by VITO/ESRIN and possibly processes from other users that are available on the Grid. These activities must be user-friendly and not requiring detailed knowledge about the underlying Grid middleware. In the second scenario we aim to design, implement and demonstrate a methodology to set up an earth observation processing facility, which uses large volumes of data from various geographically spread sensors. The aim is to provide solutions for problems that we face today, like wasting bandwidth by copying large volumes of data to one location. We will avoid this by processing the data where they are. The multi-mission Grid-based processing on demand infrastructure will allow developing and executing complex and massive multi-sensor data (re-)processing applications more

  10. Memory-Scalable GPU Spatial Hierarchy Construction.

    PubMed

    Qiming Hou; Xin Sun; Kun Zhou; Lauterbach, C; Manocha, D

    2011-04-01

    Recent GPU algorithms for constructing spatial hierarchies have achieved promising performance for moderately complex models by using the breadth-first search (BFS) construction order. While being able to exploit the massive parallelism on the GPU, the BFS order also consumes excessive GPU memory, which becomes a serious issue for interactive applications involving very complex models with more than a few million triangles. In this paper, we propose to use the partial breadth-first search (PBFS) construction order to control memory consumption while maximizing performance. We apply the PBFS order to two hierarchy construction algorithms. The first algorithm is for kd-trees that automatically balances between the level of parallelism and intermediate memory usage. With PBFS, peak memory consumption during construction can be efficiently controlled without costly CPU-GPU data transfer. We also develop memory allocation strategies to effectively limit memory fragmentation. The resulting algorithm scales well with GPU memory and constructs kd-trees of models with millions of triangles at interactive rates on GPUs with 1 GB memory. Compared with existing algorithms, our algorithm is an order of magnitude more scalable for a given GPU memory bound. The second algorithm is for out-of-core bounding volume hierarchy (BVH) construction for very large scenes based on the PBFS construction order. At each iteration, all constructed nodes are dumped to the CPU memory, and the GPU memory is freed for the next iteration's use. In this way, the algorithm is able to build trees that are too large to be stored in the GPU memory. Experiments show that our algorithm can construct BVHs for scenes with up to 20 M triangles, several times larger than previous GPU algorithms.

  11. Vanishing point: Scale independence in geomorphological hierarchies

    NASA Astrophysics Data System (ADS)

    Phillips, Jonathan D.

    2016-08-01

    Scale linkage problems in geosciences are often associated with a hierarchy of components. Both dynamical systems perspectives and intuition suggest that processes or relationships operating at fundamentally different scales are independent with respect to influences on system dynamics. But how far apart is "fundamentally different"-that is, what is the "vanishing point" at which scales are no longer interdependent? And how do we reconcile that with the idea (again, supported by both theory and intuition) that we can work our way along scale hierarchies from microscale to planetary (and vice-versa)? Graph and network theory are employed here to address these questions. Analysis of two archetypal hierarchical networks shows low algebraic connectivity, indicating low levels of inferential synchronization. This explains the apparent paradox between scale independence and hierarchical linkages. Incorporating more hierarchical levels results in an increase in complexity or entropy of the network as a whole, but at a nonlinear rate. Complexity increases as a power α of the number of levels in the hierarchy, with α < 1 and usually ≤ 0.6. However, algebraic connectivity decreases at a more rapid rate. Thus, the ability to infer one part of the hierarchical network from other level decays rapidly as more levels are added. Relatedness among system components decreases with differences in scale or resolution, analogous to distance decay in the spatial domain. These findings suggest a strategy of identifying and focusing on the most important or interesting scale levels, rather than attempting to identify the smallest or largest scale levels and work top-down or bottom-up from there. Examples are given from soil geomorphology and karst flow networks.

  12. SBAR 'flattens the hierarchy' among caregivers.

    PubMed

    Heinrichs, W M Leroy; Bauman, Eric; Dev, Parvati

    2012-01-01

    As a young ensign in the US Navy on a nuclear submarine, Doug Bonacum had to brief the captain of the ship following his night-time shift, reporting about potentially dangerous situations that might emerge. He described the "situation, background, assessment, and recommendation". This nascent SBAR communication tool served temporarily to flatten the hierarchy between the ensign and the ship's captain. Years later at KP, Bonacum developed SBAR for facilitating effective conversations between obstetricians and nurses. SBAR has been implemented in "real-world" environments with excellent results. We are implementing SBAR to facilitate communication in CliniSpace among caregivers in this 3D immersive, virtual learning environment.

  13. Lepton masses and mixing without Yukawa hierarchies

    SciTech Connect

    Ponce, William A.; Zapata, Oscar

    2006-11-01

    We investigate the neutrino masses and mixing pattern in a version of the SU(3){sub c}(multiply-in-circle sign)SU(3){sub L}(multiply-in-circle sign)U(1){sub X} model with one extra exotic charged lepton per family as introduced by Ozer. It is shown that an extended scalar sector, together with a discrete Z{sub 2} symmetry, is able to reproduce a consistent lepton mass spectrum without a hierarchy in the Yukawa coupling constants, the former as a consequence of a carefull balance between one universal see-saw and two radiative mechanisms.

  14. Securing smart grid technology

    NASA Astrophysics Data System (ADS)

    Chaitanya Krishna, E.; Kosaleswara Reddy, T.; Reddy, M. YogaTeja; Reddy G. M., Sreerama; Madhusudhan, E.; AlMuhteb, Sulaiman

    2013-03-01

    In the developing countries electrical energy is very important for its all-round improvement by saving thousands of dollars and investing them in other sector for development. For Growing needs of power existing hierarchical, centrally controlled grid of the 20th Century is not sufficient. To produce and utilize effective power supply for industries or people we should have Smarter Electrical grids that address the challenges of the existing power grid. The Smart grid can be considered as a modern electric power grid infrastructure for enhanced efficiency and reliability through automated control, high-power converters, modern communications infrastructure along with modern IT services, sensing and metering technologies, and modern energy management techniques based on the optimization of demand, energy and network availability and so on. The main objective of this paper is to provide a contemporary look at the current state of the art in smart grid communications as well as critical issues on smart grid technologies primarily in terms of information and communication technology (ICT) issues like security, efficiency to communications layer field. In this paper we propose new model for security in Smart Grid Technology that contains Security Module(SM) along with DEM which will enhance security in Grid. It is expected that this paper will provide a better understanding of the technologies, potential advantages and research challenges of the smart grid and provoke interest among the research community to further explore this promising research area.

  15. Grid Technology as a Cyber Infrastructure for Earth Science Applications

    NASA Technical Reports Server (NTRS)

    Hinke, Thomas H.

    2004-01-01

    This paper describes how grids and grid service technologies can be used to develop an infrastructure for the Earth Science community. This cyberinfrastructure would be populated with a hierarchy of services, including discipline specific services such those needed by the Earth Science community as well as a set of core services that are needed by most applications. This core would include data-oriented services used for accessing and moving data as well as computer-oriented services used to broker access to resources and control the execution of tasks on the grid. The availability of such an Earth Science cyberinfrastructure would ease the development of Earth Science applications. With such a cyberinfrastructure, application work flows could be created to extract data from one or more of the Earth Science archives and then process it by passing it through various persistent services that are part of the persistent cyberinfrastructure, such as services to perform subsetting, reformatting, data mining and map projections.

  16. Numerical solution of plasma fluid equations using locally refined grids

    SciTech Connect

    Colella, P., LLNL

    1997-01-26

    This paper describes a numerical method for the solution of plasma fluid equations on block-structured, locally refined grids. The plasma under consideration is typical of those used for the processing of semiconductors. The governing equations consist of a drift-diffusion model of the electrons and an isothermal model of the ions coupled by Poisson's equation. A discretization of the equations is given for a uniform spatial grid, and a time-split integration scheme is developed. The algorithm is then extended to accommodate locally refined grids. This extension involves the advancement of the discrete system on a hierarchy of levels, each of which represents a degree of refinement, together with synchronization steps to ensure consistency across levels. A brief discussion of a software implementation is followed by a presentation of numerical results.

  17. Ambiguities in the grid-inefficiency correction for Frisch-Grid Ionization Chambers

    NASA Astrophysics Data System (ADS)

    Al-Adili, A.; Hambsch, F.-J.; Bencardino, R.; Oberstedt, S.; Pomp, S.

    2012-05-01

    Ionization chambers with Frisch grids have been very successfully applied to neutron-induced fission-fragment studies during the past 20 years. They are radiation resistant and can be easily adapted to the experimental conditions. The use of Frisch grids has the advantage to remove the angular dependency from the charge induced on the anode plate. However, due to the Grid Inefficiency (GI) in shielding the charges, the anode signal remains slightly angular dependent. The correction for the GI is, however, essential to determine the correct energy of the ionizing particles. GI corrections can amount to a few percent of the anode signal. Presently, two contradicting correction methods are considered in literature. The first method adding the angular-dependent part of the signal to the signal pulse height; the second method subtracting the former from the latter. Both additive and subtractive approaches were investigated in an experiment where a Twin Frisch-Grid Ionization Chamber (TFGIC) was employed to detect the spontaneous fission fragments (FF) emitted by a 252Cf source. Two parallel-wire grids with different wire spacing (1 and 2 mm, respectively), were used individually, in the same chamber side. All the other experimental conditions were unchanged. The 2 mm grid featured more than double the GI of the 1 mm grid. The induced charge on the anode in both measurements was compared, before and after GI correction. Before GI correction, the 2 mm grid resulted in a lower pulse-height distribution than the 1 mm grid. After applying both GI corrections to both measurements only the additive approach led to consistent grid independent pulse-height distributions. The application of the subtractive correction on the contrary led to inconsistent, grid-dependent results. It is also shown that the impact of either of the correction methods is small on the FF mass distributions of 235U(nth, f).

  18. Adaptive mesh fluid simulations on GPU

    NASA Astrophysics Data System (ADS)

    Wang, Peng; Abel, Tom; Kaehler, Ralf

    2010-10-01

    We describe an implementation of compressible inviscid fluid solvers with block-structured adaptive mesh refinement on Graphics Processing Units using NVIDIA's CUDA. We show that a class of high resolution shock capturing schemes can be mapped naturally on this architecture. Using the method of lines approach with the second order total variation diminishing Runge-Kutta time integration scheme, piecewise linear reconstruction, and a Harten-Lax-van Leer Riemann solver, we achieve an overall speedup of approximately 10 times faster execution on one graphics card as compared to a single core on the host computer. We attain this speedup in uniform grid runs as well as in problems with deep AMR hierarchies. Our framework can readily be applied to more general systems of conservation laws and extended to higher order shock capturing schemes. This is shown directly by an implementation of a magneto-hydrodynamic solver and comparing its performance to the pure hydrodynamic case. Finally, we also combined our CUDA parallel scheme with MPI to make the code run on GPU clusters. Close to ideal speedup is observed on up to four GPUs.

  19. Understanding the Grid

    SciTech Connect

    2016-01-14

    The electric power grid has been rightly celebrated as the single most important engineering feat of the 20th century. The grid powers our homes, offices, hospitals, and schools; and, increasingly, it powers our favorite devices from smartphones to HDTVs. With those and other modern innovations and challenges, our grid will need to evolve. Grid modernization efforts will help the grid make full use of today’s advanced technologies and serve our needs in the 21st century. While the vast majority of upgrades are implemented by private sector energy companies that own and operate the grid, DOE has been investing in technologies that are revolutionizing the way we generate, store and transmit power.

  20. Gravitational inflaton decay and the hierarchy problem

    SciTech Connect

    Watanabe, Yuki; Komatsu, Eiichiro

    2008-02-15

    We study implications of the large-N species solution to the hierarchy problem, proposed by G. Dvali, for reheating of the Universe after inflation. Dvali's proposal contains additional N{approx}10{sup 32}Z{sub 2}-conserved quantum fields beyond the standard model particles with mass {approx}1 TeV, which weaken gravity by a factor of 1/N, and thus explain the hierarchy between the Plank scale and the electroweak scale. We show that, in this scenario, the decay rates of inflaton fields through gravitational decay channels are enhanced by a factor of N, and thus they decay into N species of the quantum fields very efficiently, in the limit that quantum gravity effects are unimportant for the gravitational decay rate. In order not to violate energy conservation or over-reheat the Universe, inflaton mass, vacuum expectation value of inflaton, or nonminimal gravitational coupling should be tightly fine-tuned. Our conclusion holds even when the gravitational decay is prohibited by some symmetry of the theory; the Universe may still be over-reheated via annihilation of inflatons, if the number density of inflaton quanta is greater than the critical value.

  1. Cortical hierarchy governs rat claustrocortical circuit organization.

    PubMed

    White, Michael G; Cody, Patrick A; Bubser, Michael; Wang, Hui-Dong; Deutch, Ariel Y; Mathur, Brian N

    2017-04-15

    The claustrum is a telencephalic gray matter structure with various proposed functions, including sensory integration and attentional allocation. Underlying these concepts is the reciprocal connectivity of the claustrum with most, if not all, areas of the cortex. What remains to be elucidated to inform functional hypotheses further is whether a pattern exists in the strength of connectivity between a given cortical area and the claustrum. To this end, we performed a series of retrograde neuronal tract tracer injections into rat cortical areas along the cortical processing hierarchy, from primary sensory and motor to frontal cortices. We observed that the number of claustrocortical projections increased as a function of processing hierarchy; claustrum neurons projecting to primary sensory cortices were scant and restricted in distribution across the claustrum, whereas neurons projecting to the cingulate cortex were densely packed and more evenly distributed throughout the claustrum. This connectivity pattern suggests that the claustrum may preferentially subserve executive functions orchestrated by the cingulate cortex. J. Comp. Neurol. 525:1347-1362, 2017. © 2016 Wiley Periodicals, Inc.

  2. A color hierarchy for automatic target selection.

    PubMed

    Tchernikov, Illia; Fallah, Mazyar

    2010-02-24

    Visual processing of color starts at the cones in the retina and continues through ventral stream visual areas, called the parvocellular pathway. Motion processing also starts in the retina but continues through dorsal stream visual areas, called the magnocellular system. Color and motion processing are functionally and anatomically discrete. Previously, motion processing areas MT and MST have been shown to have no color selectivity to a moving stimulus; the neurons were colorblind whenever color was presented along with motion. This occurs when the stimuli are luminance-defined versus the background and is considered achromatic motion processing. Is motion processing independent of color processing? We find that motion processing is intrinsically modulated by color. Color modulated smooth pursuit eye movements produced upon saccading to an aperture containing a surface of coherently moving dots upon a black background. Furthermore, when two surfaces that differed in color were present, one surface was automatically selected based upon a color hierarchy. The strength of that selection depended upon the distance between the two colors in color space. A quantifiable color hierarchy for automatic target selection has wide-ranging implications from sports to advertising to human-computer interfaces.

  3. Simplifying the modal mu-calculus alternation hierarchy

    NASA Astrophysics Data System (ADS)

    Bradfield, J. C.

    In [Bra96], the strictness of the modal mu-calculus alternation hierarchy was shown by transferring a hierarchy from arithmetic; the latter was a corollary of a deep and highly technical analysis of [Lub93]. In this paper, we show that the alternation hierarchy in arithmetic can be established by entirely elementary means; further, simple examples of strict alternation depth n formulae can be constructed, which in turn give very simple examples to separate the modal hierarchy. In addition, the winning strategy formulae of parity games are shown to be such examples.

  4. Gauge transformation and symmetries of the commutative multicomponent BKP hierarchy

    NASA Astrophysics Data System (ADS)

    Li, Chuanzhong

    2016-01-01

    In this paper, we defined a new multi-component B type Kadomtsev-Petviashvili (BKP) hierarchy that takes values in a commutative subalgebra of {gl}(N,{{C}}). After this, we give the gauge transformation of this commutative multicomponent BKP (CMBKP) hierarchy. Meanwhile, we construct a new constrained CMBKP hierarchy that contains some new integrable systems, including coupled KdV equations under a certain reduction. After this, the quantum torus symmetry and quantum torus constraint on the tau function of the commutative multi-component BKP hierarchy will be constructed.

  5. Challenges facing production grids

    SciTech Connect

    Pordes, Ruth; /Fermilab

    2007-06-01

    Today's global communities of users expect quality of service from distributed Grid systems equivalent to that their local data centers. This must be coupled to ubiquitous access to the ensemble of processing and storage resources across multiple Grid infrastructures. We are still facing significant challenges in meeting these expectations, especially in the underlying security, a sustainable and successful economic model, and smoothing the boundaries between administrative and technical domains. Using the Open Science Grid as an example, I examine the status and challenges of Grids operating in production today.

  6. Enhanced Elliptic Grid Generation

    NASA Technical Reports Server (NTRS)

    Kaul, Upender K.

    2007-01-01

    An enhanced method of elliptic grid generation has been invented. Whereas prior methods require user input of certain grid parameters, this method provides for these parameters to be determined automatically. "Elliptic grid generation" signifies generation of generalized curvilinear coordinate grids through solution of elliptic partial differential equations (PDEs). Usually, such grids are fitted to bounding bodies and used in numerical solution of other PDEs like those of fluid flow, heat flow, and electromagnetics. Such a grid is smooth and has continuous first and second derivatives (and possibly also continuous higher-order derivatives), grid lines are appropriately stretched or clustered, and grid lines are orthogonal or nearly so over most of the grid domain. The source terms in the grid-generating PDEs (hereafter called "defining" PDEs) make it possible for the grid to satisfy requirements for clustering and orthogonality properties in the vicinity of specific surfaces in three dimensions or in the vicinity of specific lines in two dimensions. The grid parameters in question are decay parameters that appear in the source terms of the inhomogeneous defining PDEs. The decay parameters are characteristic lengths in exponential- decay factors that express how the influences of the boundaries decrease with distance from the boundaries. These terms govern the rates at which distance between adjacent grid lines change with distance from nearby boundaries. Heretofore, users have arbitrarily specified decay parameters. However, the characteristic lengths are coupled with the strengths of the source terms, such that arbitrary specification could lead to conflicts among parameter values. Moreover, the manual insertion of decay parameters is cumbersome for static grids and infeasible for dynamically changing grids. In the present method, manual insertion and user specification of decay parameters are neither required nor allowed. Instead, the decay parameters are

  7. A grid amplifier

    NASA Technical Reports Server (NTRS)

    Kim, Moonil; Weikle, Robert M., II; Hacker, Jonathan B.; Delisio, Michael P.; Rutledge, David B.; Rosenberg, James J.; Smith, R. P.

    1991-01-01

    A 50-MESFET grid amplifier is reported that has a gain of 11 dB at 3.3 GHz. The grid isolates the input from the output by using vertical polarization for the input beam and horizontal polarization for the transmitted output beam. The grid unit cell is a two-MESFET differential amplifier. A simple calibration procedure allows the gain to be calculated from a relative power measurement. This grid is a hybrid circuit, but the structure is suitable for fabrication as a monolithic wafer-scale integrated circuit, particularly at millimeter wavelengths.

  8. Unstructured surface grid generation

    NASA Technical Reports Server (NTRS)

    Samareh-Abolhassani, Jamshid

    1993-01-01

    Viewgraphs on unstructured surface grid generation are presented. Topics covered include: requirements for curves, surfaces, solids, and text; surface approximation; triangulation; advancing; projection; mapping; and parametric curves.

  9. 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.

  10. 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.

  11. Maximizing Adaptivity in Hierarchical Topological Models Using Cancellation Trees

    SciTech Connect

    Bremer, P; Pascucci, V; Hamann, B

    2008-12-08

    We present a highly adaptive hierarchical representation of the topology of functions defined over two-manifold domains. Guided by the theory of Morse-Smale complexes, we encode dependencies between cancellations of critical points using two independent structures: a traditional mesh hierarchy to store connectivity information and a new structure called cancellation trees to encode the configuration of critical points. Cancellation trees provide a powerful method to increase adaptivity while using a simple, easy-to-implement data structure. The resulting hierarchy is significantly more flexible than the one previously reported. In particular, the resulting hierarchy is guaranteed to be of logarithmic height.

  12. Smart Grid Development: Multinational Demo Project Analysis

    NASA Astrophysics Data System (ADS)

    Oleinikova, I.; Mutule, A.; Obushevs, A.; Antoskovs, N.

    2016-12-01

    This paper analyses demand side management (DSM) projects and stakeholders' experience with the aim to develop, promote and adapt smart grid tehnologies in Latvia. The research aims at identifying possible system service posibilites, including demand response (DR) and determining the appropriate market design for such type of services to be implemented at the Baltic power system level, with the cooperation of distribution system operator (DSO) and transmission system operator (TSO). This paper is prepared as an extract from the global smart grid best practices, smart solutions and business models.

  13. Spaceflight Operations Services Grid (SOSG)

    NASA Technical Reports Server (NTRS)

    Bradford, Robert N.; Thigpen, William W.

    2004-01-01

    In an effort to adapt existing space flight operations services to new emerging Grid technologies we are developing a Grid-based prototype space flight operations Grid. This prototype is based on the operational services being provided to the International Space Station's Payload operations located at the Marshall Space Flight Center, Alabama. The prototype services will be Grid or Web enabled and provided to four user communities through portal technology. Users will have the opportunity to assess the value and feasibility of Grid technologies to their specific areas or disciplines. In this presentation descriptions of the prototype development, User-based services, Grid-based services and status of the project will be presented. Expected benefits, findings and observations (if any) to date will also be discussed. The focus of the presentation will be on the project in general, status to date and future plans. The End-use services to be included in the prototype are voice, video, telemetry, commanding, collaboration tools and visualization among others. Security is addressed throughout the project and is being designed into the Grid technologies and standards development. The project is divided into three phases. Phase One establishes the baseline User-based services required for space flight operations listed above. Phase Two involves applying Gridlweb technologies to the User-based services and development of portals for access by users. Phase Three will allow NASA and end users to evaluate the services and determine the future of the technology as applied to space flight operational services. Although, Phase One, which includes the development of the quasi-operational User-based services of the prototype, development will be completed by March 2004, the application of Grid technologies to these services will have just begun. We will provide status of the Grid technologies to the individual User-based services. This effort will result in an extensible

  14. Interconnection of a photovoltaic power generation system with the grid

    NASA Astrophysics Data System (ADS)

    Corbefin, R.; Vacelet, G.

    Converting photovoltaic system-generated power into a form compatible with grid-furnished power and simultaneously ensuring that maximal power is drawn from the solar system is discussed. A converter is interposed between the solar-derived electricity and the grid lines, allowing the user to apply the power to a load, feed excess power to the grid, and receive power from the grid when the photovoltaic output is too low to fill demand. A dc-ac converter is described, with microprocessor controlled transistorized switching to adapt the solar output to the load amplitude on demand, while maintaining constant voltage. An adaptor allows the converter to take its amplitude, phase, and frequency regulation from the grid, and also assures that power will flow only toward the grid.

  15. Security for grids

    SciTech Connect

    Humphrey, Marty; Thompson, Mary R.; Jackson, Keith R.

    2005-08-14

    Securing a Grid environment presents a distinctive set of challenges. This paper groups the activities that need to be secured into four categories: naming and authentication; secure communication; trust, policy, and authorization; and enforcement of access control. It examines the current state of the art in securing these processes and introduces new technologies that promise to meet the security requirements of Grids more completely.

  16. Internet 2 Access Grid.

    ERIC Educational Resources Information Center

    Simco, Greg

    2002-01-01

    Discussion of the Internet 2 Initiative, which is based on collaboration among universities, businesses, and government, focuses on the Access Grid, a Computational Grid that includes interactive multimedia within high-speed networks to provide resources to enable remote collaboration among the research community. (Author/LRW)

  17. Geometric grid generation

    NASA Technical Reports Server (NTRS)

    Ives, David

    1995-01-01

    This paper presents a highly automated hexahedral grid generator based on extensive geometrical and solid modeling operations developed in response to a vision of a designer-driven one day turnaround CFD process which implies a designer-driven one hour grid generation process.

  18. Structural hierarchy governs fibrin gel mechanics.

    PubMed

    Piechocka, Izabela K; Bacabac, Rommel G; Potters, Max; Mackintosh, Fred C; Koenderink, Gijsje H

    2010-05-19

    Fibrin gels are responsible for the mechanical strength of blood clots, which are among the most resilient protein materials in nature. Here we investigate the physical origin of this mechanical behavior by performing rheology measurements on reconstituted fibrin gels. We find that increasing levels of shear strain induce a succession of distinct elastic responses that reflect stretching processes on different length scales. We present a theoretical model that explains these observations in terms of the unique hierarchical architecture of the fibers. The fibers are bundles of semiflexible protofibrils that are loosely connected by flexible linker chains. This architecture makes the fibers 100-fold more flexible to bending than anticipated based on their large diameter. Moreover, in contrast with other biopolymers, fibrin fibers intrinsically stiffen when stretched. The resulting hierarchy of elastic regimes explains the incredible resilience of fibrin clots against large deformations.

  19. Cancer Stem Cell Hierarchy in Glioblastoma Multiforme

    PubMed Central

    Bradshaw, Amy; Wickremsekera, Agadha; Tan, Swee T.; Peng, Lifeng; Davis, Paul F.; Itinteang, Tinte

    2016-01-01

    Glioblastoma multiforme (GBM), an aggressive tumor that typically exhibits treatment failure with high mortality rates, is associated with the presence of cancer stem cells (CSCs) within the tumor. CSCs possess the ability for perpetual self-renewal and proliferation, producing downstream progenitor cells that drive tumor growth. Studies of many cancer types have identified CSCs using specific markers, but it is still unclear as to where in the stem cell hierarchy these markers fall. This is compounded further by the presence of multiple GBM and glioblastoma cancer stem cell subtypes, making investigation and establishment of a universal treatment difficult. This review examines the current knowledge on the CSC markers SALL4, OCT-4, SOX2, STAT3, NANOG, c-Myc, KLF4, CD133, CD44, nestin, and glial fibrillary acidic protein, specifically focusing on their use and validity in GBM research and how they may be utilized for investigations into GBM’s cancer biology. PMID:27148537

  20. Scale-independent inflation and hierarchy generation

    NASA Astrophysics Data System (ADS)

    Ferreira, Pedro G.; Hill, Christopher T.; Ross, Graham G.

    2016-12-01

    We discuss models involving two scalar fields coupled to classical gravity that satisfy the general criteria: (i) the theory has no mass input parameters, (ii) classical scale symmetry is broken only through -1/12 ςϕ2 R couplings where ς departs from the special conformal value of 1; (iii) the Planck mass is dynamically generated by the vacuum expectations values (VEVs) of the scalars (iv) there is a stage of viable inflation associated with slow roll in the two-scalar potential; (v) the final vacuum has a small to vanishing cosmological constant and an hierarchically small ratio of the VEVs and the ratio of the scalar masses to the Planck scale. This assumes the paradigm of classical scale symmetry as a custodial symmetry of large hierarchies.

  1. Structural Hierarchy Governs Fibrin Gel Mechanics

    PubMed Central

    Piechocka, Izabela K.; Bacabac, Rommel G.; Potters, Max; MacKintosh, Fred C.; Koenderink, Gijsje H.

    2010-01-01

    Abstract Fibrin gels are responsible for the mechanical strength of blood clots, which are among the most resilient protein materials in nature. Here we investigate the physical origin of this mechanical behavior by performing rheology measurements on reconstituted fibrin gels. We find that increasing levels of shear strain induce a succession of distinct elastic responses that reflect stretching processes on different length scales. We present a theoretical model that explains these observations in terms of the unique hierarchical architecture of the fibers. The fibers are bundles of semiflexible protofibrils that are loosely connected by flexible linker chains. This architecture makes the fibers 100-fold more flexible to bending than anticipated based on their large diameter. Moreover, in contrast with other biopolymers, fibrin fibers intrinsically stiffen when stretched. The resulting hierarchy of elastic regimes explains the incredible resilience of fibrin clots against large deformations. PMID:20483337

  2. Simple Resonance Hierarchy for Surmounting Quantum Uncertainty

    SciTech Connect

    Amoroso, Richard L.

    2010-12-22

    For a hundred years violation or surmounting the Quantum Uncertainty Principle has remained a Holy Grail of both theoretical and empirical physics. Utilizing an operationally completed form of Quantum Theory cast in a string theoretic Higher Dimensional (HD) form of Dirac covariant polarized vacuum with a complex Einstein energy dependent spacetime metric, M{sub 4{+-}}C{sub 4} with sufficient degrees of freedom to be causally free of the local quantum state, we present a simple empirical model for ontologically surmounting the phenomenology of uncertainty through a Sagnac Effect RF pulsed Laser Oscillated Vacuum Energy Resonance hierarchy cast within an extended form of a Wheeler-Feynman-Cramer Transactional Calabi-Yau mirror symmetric spacetime bachcloth.

  3. A new wavefunction hierarchy for interacting geminals

    NASA Astrophysics Data System (ADS)

    Limacher, Peter A.

    2016-11-01

    A new truncation scheme for non-orthogonal antisymmetrized products of interacting geminals (APIG) is introduced based on antisymmetrized products of strongly orthogonal geminals (APSG). This wavefunction hierarchy of interacting geminals (IG) allows us to gradually increase the accuracy at which the ground state of a seniority-zero Hamiltonian can be estimated, ranging from APSG up to approximation-free APIG. Mathematical expressions for the lowest four orders (IG0, IG1, IG2, and IG3) are given explicitly and the computational cost to evaluate their transition density matrix is verified to scale only cubically with system size. Exemplary numerical calculations indicate that already a very early truncation level leads to results virtually identical to APIG.

  4. A new wavefunction hierarchy for interacting geminals.

    PubMed

    Limacher, Peter A

    2016-11-21

    A new truncation scheme for non-orthogonal antisymmetrized products of interacting geminals (APIG) is introduced based on antisymmetrized products of strongly orthogonal geminals (APSG). This wavefunction hierarchy of interacting geminals (IG) allows us to gradually increase the accuracy at which the ground state of a seniority-zero Hamiltonian can be estimated, ranging from APSG up to approximation-free APIG. Mathematical expressions for the lowest four orders (IG0, IG1, IG2, and IG3) are given explicitly and the computational cost to evaluate their transition density matrix is verified to scale only cubically with system size. Exemplary numerical calculations indicate that already a very early truncation level leads to results virtually identical to APIG.

  5. Simple Resonance Hierarchy for Surmounting Quantum Uncertainty

    NASA Astrophysics Data System (ADS)

    Amoroso, Richard L.

    2010-12-01

    For a hundred years violation or surmounting the Quantum Uncertainty Principle has remained a Holy Grail of both theoretical and empirical physics. Utilizing an operationally completed form of Quantum Theory cast in a string theoretic Higher Dimensional (HD) form of Dirac covariant polarized vacuum with a complex Einstein energy dependent spacetime metric, M̂4±C4 with sufficient degrees of freedom to be causally free of the local quantum state, we present a simple empirical model for ontologically surmounting the phenomenology of uncertainty through a Sagnac Effect RF pulsed Laser Oscillated Vacuum Energy Resonance hierarchy cast within an extended form of a Wheeler-Feynman-Cramer Transactional Calabi-Yau mirror symmetric spacetime bachcloth.

  6. A Validation Study of Maslow's Hierarchy of Needs Theory.

    ERIC Educational Resources Information Center

    Clay, Rex J.

    A study was conducted to expand the body of research that tests the validity of Abraham Maslow's hierarchy of needs theory in a work context where it often serves as a guide for the supervisor's relationships with his subordinates. Data was gathered by questionnaire which tested for a hierarchy of needs among instructors at four community colleges…

  7. Exploring complete positivity in hierarchy equations of motion

    NASA Astrophysics Data System (ADS)

    Witt, B.; Rudnicki, Ł.; Tanimura, Y.; Mintert, F.

    2017-01-01

    We derive a purely algebraic framework for the identification of hierarchy equations of motion that induce completely positive dynamics and demonstrate the applicability of our approach with several examples. We find bounds on the violation of complete positivity for microscopically derived hierarchy equations of motion and construct well-behaved phenomenological models with strongly non-Markovian revivals of quantum coherence.

  8. The Academic Structure in Japan: Institutional Hierarchy and Academic Mobility.

    ERIC Educational Resources Information Center

    Arimoto, Akira

    The characteristics of the Japanese academic structure are examined with attention to the evolution of institutional hierarchy, the closed academic structure, and the effects of the academic structure upon academic research. The evolution of Japan's institutional hierarchy in academics has been tightly related to factors of nationalism,…

  9. Inferring heuristic classification hierarchies from natural language input

    NASA Technical Reports Server (NTRS)

    Hull, Richard; Gomez, Fernando

    1993-01-01

    A methodology for inferring hierarchies representing heuristic knowledge about the check out, control, and monitoring sub-system (CCMS) of the space shuttle launch processing system from natural language input is explained. Our method identifies failures explicitly and implicitly described in natural language by domain experts and uses those descriptions to recommend classifications for inclusion in the experts' heuristic hierarchies.

  10. Knowledge, Expectations, and Inductive Reasoning within Conceptual Hierarchies

    ERIC Educational Resources Information Center

    Coley, John D.; Hayes, Brett; Lawson, Christopher; Moloney, Michelle

    2004-01-01

    Previous research (e.g. "Cognition" 64 (1997) 73) suggests that the privileged level for inductive inference in a folk biological conceptual hierarchy does not correspond to the ''basic'' level (i.e. the level at which concepts are both informative and distinct). To further explore inductive inference within conceptual hierarchies, we examine…

  11. The Diversity Education Dilemma: Exposing Status Hierarchies without Reinforcing Them

    ERIC Educational Resources Information Center

    Amoroso, Lisa M.; Loyd, Denise Lewin; Hoobler, Jenny M.

    2010-01-01

    A "diversity education dilemma" occurs when exposure to information concerning status hierarchies, related to demographic and other socially salient identity groups, reinforces those hierarchies in the classroom. Discussions of diversity-related issues in a variety of management courses (e.g., immigrant issues in labor relations, the composition…

  12. A Hierarchy of Homodesmotic Reactions for Thermochemistry

    PubMed Central

    Schleyer, Paul v. R.

    2009-01-01

    Chemical equations that balance bond types and atom hybridization to different degrees are often used in computational thermochemistry, for example, to increase accuracy when lower levels of theory are employed. We expose the widespread confusion over such classes of equations and demonstrate that the two most widely used definitions of “homodesmotic” reactions are not equivalent. New definitions are introduced and a consistent hierarchy of reaction classes (RC1 – RC5) for hydrocarbons is constructed: isogyric (RC1) ⊇ isodesmic (RC2) ⊇ hypohomodesmotic (RC3) ⊇ homodesmotic (RC4) ⊇ hyperhomodesmotic (RC5). Each of these successively conserves larger molecular fragments. The concept of isodesmic bond separation reactions is generalized to all classes in this hierarchy, providing a unique sectioning of a given molecule for each reaction type. Several ab initio and density functional methods are applied to the bond separation reactions of 38 hydrocarbons containing five or six carbon atoms. RC4 and RC5 reactions provide bond separation enthalpies with errors consistently less than 0.4 kcal mol−1 across a wide range of theoretical levels, performing significantly better than the other reaction types and far superior to atomization routes. Our recommended bond separation reactions were demonstrated by determining the enthalpies of formation (at 298 K) of 1,3,5-hexatriyne (163.7 ± 0.4 kcal mol−1), 1,3,5,7-octatetrayne (217.6 ± 0.6 kcal mol−1), the larger polyynes C10H2 through C26H2, and an infinite acetylenic carbon chain. PMID:19182999

  13. DICOM image communication in globus-based medical grids.

    PubMed

    Vossberg, Michal; Tolxdorff, Thomas; Krefting, Dagmar

    2008-03-01

    Grid computing, the collaboration of distributed resources across institutional borders, is an emerging technology to meet the rising demand on computing power and storage capacity in fields such as high-energy physics, climate modeling, or more recently, life sciences. A secure, reliable, and highly efficient data transport plays an integral role in such grid environments and even more so in medical grids. Unfortunately, many grid middleware distributions, such as the well-known Globus Toolkit, lack the integration of the world-wide medical image communication standard Digital Imaging and Communication in Medicine (DICOM). Currently, the DICOM protocol first needs to be converted to the file transfer protocol (FTP) that is offered by the grid middleware. This effectively reduces most of the advantages and security an integrated network of DICOM devices offers. In this paper, a solution is proposed that adapts the DICOM protocol to the Globus grid security infrastructure and utilizes routers to transparently route traffic to and from DICOM systems. Thus, all legacy DICOM devices can be seamlessly integrated into the grid without modifications. A prototype of the grid routers with the most important DICOM functionality has been developed and successfully tested in the MediGRID test bed, the German grid project for life sciences.

  14. Optimization Of A Computational Grid

    NASA Technical Reports Server (NTRS)

    Pearce, Daniel G.

    1993-01-01

    In improved method of generation of computational grid, grid-generation process decoupled from definition of geometry. Not necessary to redefine boundary. Instead, continuous boundaries in physical domain specified, and then grid points in computational domain mapped onto continuous boundaries.

  15. Lack of experience-based stratification in homing pigeon leadership hierarchies.

    PubMed

    Watts, Isobel; Pettit, Benjamin; Nagy, Máté; de Perera, Theresa Burt; Biro, Dora

    2016-01-01

    In societies that make collective decisions through leadership, a fundamental question concerns the individual attributes that allow certain group members to assume leadership roles over others. Homing pigeons form transitive leadership hierarchies during flock flights, where flock members are ranked according to the average time differences with which they lead or follow others' movement. Here, we test systematically whether leadership ranks in navigational hierarchies are correlated with prior experience of a homing task. We constructed experimental flocks of pigeons with mixed navigational experience: half of the birds within each flock had been familiarized with a specific release site through multiple previous releases, while the other half had never been released from the same site. We measured the birds' hierarchical leadership ranks, then switched the same birds' roles at a second site to test whether the relative hierarchical positions of the birds in the two subsets would reverse in response to the reversal in levels of experience. We found that while across all releases the top hierarchical positions were occupied by experienced birds significantly more often than by inexperienced ones, the remaining experienced birds were not consistently clustered in the top half-in other words, the network did not become stratified. We discuss our results in light of the adaptive value of structuring leadership hierarchies according to 'merit' (here, navigational experience).

  16. Lack of experience-based stratification in homing pigeon leadership hierarchies

    PubMed Central

    Watts, Isobel; Pettit, Benjamin; Nagy, Máté; de Perera, Theresa Burt; Biro, Dora

    2016-01-01

    In societies that make collective decisions through leadership, a fundamental question concerns the individual attributes that allow certain group members to assume leadership roles over others. Homing pigeons form transitive leadership hierarchies during flock flights, where flock members are ranked according to the average time differences with which they lead or follow others' movement. Here, we test systematically whether leadership ranks in navigational hierarchies are correlated with prior experience of a homing task. We constructed experimental flocks of pigeons with mixed navigational experience: half of the birds within each flock had been familiarized with a specific release site through multiple previous releases, while the other half had never been released from the same site. We measured the birds' hierarchical leadership ranks, then switched the same birds' roles at a second site to test whether the relative hierarchical positions of the birds in the two subsets would reverse in response to the reversal in levels of experience. We found that while across all releases the top hierarchical positions were occupied by experienced birds significantly more often than by inexperienced ones, the remaining experienced birds were not consistently clustered in the top half—in other words, the network did not become stratified. We discuss our results in light of the adaptive value of structuring leadership hierarchies according to ‘merit’ (here, navigational experience). PMID:26909176

  17. Decentral Smart Grid Control

    NASA Astrophysics Data System (ADS)

    Schäfer, Benjamin; Matthiae, Moritz; Timme, Marc; Witthaut, Dirk

    2015-01-01

    Stable operation of complex flow and transportation networks requires balanced supply and demand. For the operation of electric power grids—due to their increasing fraction of renewable energy sources—a pressing challenge is to fit the fluctuations in decentralized supply to the distributed and temporally varying demands. To achieve this goal, common smart grid concepts suggest to collect consumer demand data, centrally evaluate them given current supply and send price information back to customers for them to decide about usage. Besides restrictions regarding cyber security, privacy protection and large required investments, it remains unclear how such central smart grid options guarantee overall stability. Here we propose a Decentral Smart Grid Control, where the price is directly linked to the local grid frequency at each customer. The grid frequency provides all necessary information about the current power balance such that it is sufficient to match supply and demand without the need for a centralized IT infrastructure. We analyze the performance and the dynamical stability of the power grid with such a control system. Our results suggest that the proposed Decentral Smart Grid Control is feasible independent of effective measurement delays, if frequencies are averaged over sufficiently large time intervals.

  18. The open science grid

    SciTech Connect

    Pordes, R.; /Fermilab

    2004-12-01

    The U.S. LHC Tier-1 and Tier-2 laboratories and universities are developing production Grids to support LHC applications running across a worldwide Grid computing system. Together with partners in computer science, physics grid projects and active experiments, we will build a common national production grid infrastructure which is open in its architecture, implementation and use. The Open Science Grid (OSG) model builds upon the successful approach of last year's joint Grid2003 project. The Grid3 shared infrastructure has for over eight months provided significant computational resources and throughput to a range of applications, including ATLAS and CMS data challenges, SDSS, LIGO, and biology analyses, and computer science demonstrators and experiments. To move towards LHC-scale data management, access and analysis capabilities, we must increase the scale, services, and sustainability of the current infrastructure by an order of magnitude or more. Thus, we must achieve a significant upgrade in its functionalities and technologies. The initial OSG partners will build upon a fully usable, sustainable and robust grid. Initial partners include the US LHC collaborations, DOE & NSF Laboratories and Universities & Trillium Grid projects. The approach is to federate with other application communities in the U.S. to build a shared infrastructure open to other sciences and capable of being modified and improved to respond to needs of other applications, including CDF, D0, BaBar, and RHIC experiments. We describe the application-driven, engineered services of the OSG, short term plans and status, and the roadmap for a consortium, its partnerships and national focus.

  19. Trends in life science grid: from computing grid to knowledge grid

    PubMed Central

    Konagaya, Akihiko

    2006-01-01

    Background Grid computing has great potential to become a standard cyberinfrastructure for life sciences which often require high-performance computing and large data handling which exceeds the computing capacity of a single institution. Results This survey reviews the latest grid technologies from the viewpoints of computing grid, data grid and knowledge grid. Computing grid technologies have been matured enough to solve high-throughput real-world life scientific problems. Data grid technologies are strong candidates for realizing "resourceome" for bioinformatics. Knowledge grids should be designed not only from sharing explicit knowledge on computers but also from community formulation for sharing tacit knowledge among a community. Conclusion Extending the concept of grid from computing grid to knowledge grid, it is possible to make use of a grid as not only sharable computing resources, but also as time and place in which people work together, create knowledge, and share knowledge and experiences in a community. PMID:17254294

  20. Grid Connected Functionality

    DOE Data Explorer

    Baker, Kyri; Jin, Xin; Vaidynathan, Deepthi; Jones, Wesley; Christensen, Dane; Sparn, Bethany; Woods, Jason; Sorensen, Harry; Lunacek, Monte

    2016-08-04

    Dataset demonstrating the potential benefits that residential buildings can provide for frequency regulation services in the electric power grid. In a hardware-in-the-loop (HIL) implementation, simulated homes along with a physical laboratory home are coordinated via a grid aggregator, and it is shown that their aggregate response has the potential to follow the regulation signal on a timescale of seconds. Connected (communication-enabled), devices in the National Renewable Energy Laboratory's (NREL's) Energy Systems Integration Facility (ESIF) received demand response (DR) requests from a grid aggregator, and the devices responded accordingly to meet the signal while satisfying user comfort bounds and physical hardware limitations.

  1. Time Hierarchies and Model Reduction in Canonical Non-linear Models

    PubMed Central

    Löwe, Hannes; Kremling, Andreas; Marin-Sanguino, Alberto

    2016-01-01

    The time-scale hierarchies of a very general class of models in differential equations is analyzed. Classical methods for model reduction and time-scale analysis have been adapted to this formalism and a complementary method is proposed. A unified theoretical treatment shows how the structure of the system can be much better understood by inspection of two sets of singular values: one related to the stoichiometric structure of the system and another to its kinetics. The methods are exemplified first through a toy model, then a large synthetic network and finally with numeric simulations of three classical benchmark models of real biological systems. PMID:27708665

  2. Functional dissociation between regularity encoding and deviance detection along the auditory hierarchy.

    PubMed

    Aghamolaei, Maryam; Zarnowiec, Katarzyna; Grimm, Sabine; Escera, Carles

    2016-02-01

    Auditory deviance detection based on regularity encoding appears as one of the basic functional properties of the auditory system. It has traditionally been assessed with the mismatch negativity (MMN) long-latency component of the auditory evoked potential (AEP). Recent studies have found earlier correlates of deviance detection based on regularity encoding. They occur in humans in the first 50 ms after sound onset, at the level of the middle-latency response of the AEP, and parallel findings of stimulus-specific adaptation observed in animal studies. However, the functional relationship between these different levels of regularity encoding and deviance detection along the auditory hierarchy has not yet been clarified. Here we addressed this issue by examining deviant-related responses at different levels of the auditory hierarchy to stimulus changes varying in their degree of deviation regarding the spatial location of a repeated standard stimulus. Auditory stimuli were presented randomly from five loudspeakers at azimuthal angles of 0°, 12°, 24°, 36° and 48° during oddball and reversed-oddball conditions. Middle-latency responses and MMN were measured. Our results revealed that middle-latency responses were sensitive to deviance but not the degree of deviation, whereas the MMN amplitude increased as a function of deviance magnitude. These findings indicated that acoustic regularity can be encoded at the level of the middle-latency response but that it takes a higher step in the auditory hierarchy for deviance magnitude to be encoded, thus providing a functional dissociation between regularity encoding and deviance detection along the auditory hierarchy.

  3. Twisted hierarchies associated with the generalized sine-Gordon equation

    NASA Astrophysics Data System (ADS)

    Ma, Hui; Wu, Derchyi

    2011-09-01

    Twisted U- and twisted U/K-hierarchies are soliton hierarchies introduced by Terng to find higher flows of the generalized sine-Gordon equation. Twisted O(J,J)/O(J)× O(J)-hierarchies are among the most important classes of twisted hierarchies. In this paper, we derive explicit interesting first and higher flows of twisted O(J,J)/O(J)× O(J)-hierarchies, justify that the one-dimensional systems of twisted O(J,J)/O(J)× O(J)-hierarchies for J = Iq, n - q(1 ⩽ q ⩽ n - 1), called the generalized sinh-Gordon equations, are the Gauss-Codazzi equations for n-dimensional timelike submanifolds with constant sectional curvature 1 and index q in pseudo-Euclidean (2n - 1)-dimensional space {R}^{2n-1}_{2q-1} with index 2q - 1. Furthermore, a unified treatment of the inverse scattering theory for twisted O(J,J)/O(J)× O(J)-hierarchies is provided.

  4. Surface grid generation for multi-block structured grids

    NASA Astrophysics Data System (ADS)

    Spekreijse, S. P.; Boerstoel, J. W.; Kuyvenhoven, J. L.; van der Marel, M. J.

    A new grid generation technique for the computation of a structured grid on a generally curved surface in 3D is discussed. The starting assumption is that the parameterization of the surface exists, i.e. a smooth geometrical shape function exists which maps the parametric space (the unit square) one-to-one on the surface. The grid generation system computes a grid on the surface with as boundary conditions the following data specified along the four edges of the surface: (1) the position of the boundary grid points, (2) the grid line slopes at the boundary grid points, (3) the first grid cell lengths at the boundary grid points. The fourth-order elliptic biharmonic equations are used to compute the two families of grid lines in the parametric space. After that, each grid point in the parametric space is found as the intersection point between two individual grid lines, one from each family. The grid points on the surface are finally found by mapping the grid points in the parametric space on the surface via the geometrical shape function. Results are shown for an O-type 2D Euler grid, a C-type 2D Navier-Stokes grid and on some curved surfaces in 3D space.

  5. Grid Computing Education Support

    SciTech Connect

    Steven Crumb

    2008-01-15

    The GGF Student Scholar program enabled GGF the opportunity to bring over sixty qualified graduate and under-graduate students with interests in grid technologies to its three annual events over the three-year program.

  6. Space Development Grid Portal

    NASA Technical Reports Server (NTRS)

    Vaziri, Arsi

    2004-01-01

    This viewgraph presentation provides information on the development of a portal to provide secure and distributed grid computing for Payload Operations Integrated Center and Mission Control Center ground services.

  7. The Particle Physics Data Grid. Final Report

    SciTech Connect

    Livny, Miron

    2002-08-16

    The main objective of the Particle Physics Data Grid (PPDG) project has been to implement and evaluate distributed (Grid-enabled) data access and management technology for current and future particle and nuclear physics experiments. The specific goals of PPDG have been to design, implement, and deploy a Grid-based software infrastructure capable of supporting the data generation, processing and analysis needs common to the physics experiments represented by the participants, and to adapt experiment-specific software to operate in the Grid environment and to exploit this infrastructure. To accomplish these goals, the PPDG focused on the implementation and deployment of several critical services: reliable and efficient file replication service, high-speed data transfer services, multisite file caching and staging service, and reliable and recoverable job management services. The focus of the activity was the job management services and the interplay between these services and distributed data access in a Grid environment. Software was developed to study the interaction between HENP applications and distributed data storage fabric. One key conclusion was the need for a reliable and recoverable tool for managing large collections of interdependent jobs. An attached document provides an overview of the current status of the Directed Acyclic Graph Manager (DAGMan) with its main features and capabilities.

  8. Research on the comparison of extension mechanism of cellular automaton based on hexagon grid and rectangular grid

    NASA Astrophysics Data System (ADS)

    Zhai, Xiaofang; Zhu, Xinyan; Xiao, Zhifeng; Weng, Jie

    2009-10-01

    Historically, cellular automata (CA) is a discrete dynamical mathematical structure defined on spatial grid. Research on cellular automata system (CAS) has focused on rule sets and initial condition and has not discussed its adjacency. Thus, the main focus of our study is the effect of adjacency on CA behavior. This paper is to compare rectangular grids with hexagonal grids on their characteristics, strengths and weaknesses. They have great influence on modeling effects and other applications including the role of nearest neighborhood in experimental design. Our researches present that rectangular and hexagonal grids have different characteristics. They are adapted to distinct aspects, and the regular rectangular or square grid is used more often than the hexagonal grid. But their relative merits have not been widely discussed. The rectangular grid is generally preferred because of its symmetry, especially in orthogonal co-ordinate system and the frequent use of raster from Geographic Information System (GIS). However, in terms of complex terrain, uncertain and multidirectional region, we have preferred hexagonal grids and methods to facilitate and simplify the problem. Hexagonal grids can overcome directional warp and have some unique characteristics. For example, hexagonal grids have a simpler and more symmetric nearest neighborhood, which avoids the ambiguities of the rectangular grids. Movement paths or connectivity, the most compact arrangement of pixels, make hexagonal appear great dominance in the process of modeling and analysis. The selection of an appropriate grid should be based on the requirements and objectives of the application. We use rectangular and hexagonal grids respectively for developing city model. At the same time we make use of remote sensing images and acquire 2002 and 2005 land state of Wuhan. On the base of city land state in 2002, we make use of CA to simulate reasonable form of city in 2005. Hereby, these results provide a proof of

  9. Implementing Production Grids

    NASA Technical Reports Server (NTRS)

    Johnston, William E.; Ziobarth, John (Technical Monitor)

    2002-01-01

    We have presented the essence of experience gained in building two production Grids, and provided some of the global context for this work. As the reader might imagine, there were a lot of false starts, refinements to the approaches and to the software, and several substantial integration projects (SRB and Condor integrated with Globus) to get where we are today. However, the point of this paper is to try and make it substantially easier for others to get to the point where Information Power Grids (IPG) and the DOE Science Grids are today. This is what is needed in order to move us toward the vision of a common cyber infrastructure for science. The author would also like to remind the readers that this paper primarily represents the actual experiences that resulted from specific architectural and software choices during the design and implementation of these two Grids. The choices made were dictated by the criteria laid out in section 1. There is a lot more Grid software available today that there was four years ago, and various of these packages are being integrated into IPG and the DOE Grids. However, the foundation choices of Globus, SRB, and Condor would not be significantly different today than they were four years ago. Nonetheless, if the GGF is successful in its work - and we have every reason to believe that it will be - then in a few years we will see that the 28 functions provided by these packages will be defined in terms of protocols and MIS, and there will be several robust implementations available for each of the basic components, especially the Grid Common Services. The impact of the emerging Web Grid Services work is not yet clear. It will likely have a substantial impact on building higher level services, however it is the opinion of the author that this will in no way obviate the need for the Grid Common Services. These are the foundation of Grids, and the focus of almost all of the operational and persistent infrastructure aspects of Grids.

  10. Random array grid collimator

    DOEpatents

    Fenimore, E.E.

    1980-08-22

    A hexagonally shaped quasi-random no-two-holes touching grid collimator. The quasi-random array grid collimator eliminates contamination from small angle off-axis rays by using a no-two-holes-touching pattern which simultaneously provides for a self-supporting array increasng throughput by elimination of a substrate. The presentation invention also provides maximum throughput using hexagonally shaped holes in a hexagonal lattice pattern for diffraction limited applications. Mosaicking is also disclosed for reducing fabrication effort.

  11. Exploring Hypersonic, Unstructured-Grid Issues through Structured Grids

    NASA Technical Reports Server (NTRS)

    Mazaheri, Ali R.; Kleb, Bill

    2007-01-01

    Pure-tetrahedral unstructured grids have been shown to produce asymmetric heat transfer rates for symmetric problems. Meanwhile, two-dimensional structured grids produce symmetric solutions and as documented here, introducing a spanwise degree of freedom to these structured grids also yields symmetric solutions. The effects of grid skewness and other perturbations of structured-grids are investigated to uncover possible mechanisms behind the unstructured-grid solution asymmetries. By using controlled experiments around a known, good solution, the effects of particular grid pathologies are uncovered. These structured-grid experiments reveal that similar solution degradation occurs as for unstructured grids, especially for heat transfer rates. Non-smooth grids within the boundary layer is also shown to produce large local errors in heat flux but do not affect surface pressures.

  12. Using Grid Benchmarks for Dynamic Scheduling of Grid Applications

    NASA Technical Reports Server (NTRS)

    Frumkin, Michael; Hood, Robert

    2003-01-01

    Navigation or dynamic scheduling of applications on computational grids can be improved through the use of an application-specific characterization of grid resources. Current grid information systems provide a description of the resources, but do not contain any application-specific information. We define a GridScape as dynamic state of the grid resources. We measure the dynamic performance of these resources using the grid benchmarks. Then we use the GridScape for automatic assignment of the tasks of a grid application to grid resources. The scalability of the system is achieved by limiting the navigation overhead to a few percent of the application resource requirements. Our task submission and assignment protocol guarantees that the navigation system does not cause grid congestion. On a synthetic data mining application we demonstrate that Gridscape-based task assignment reduces the application tunaround time.

  13. Quasi-periodic Solutions to the K(-2, -2) Hierarchy

    NASA Astrophysics Data System (ADS)

    Wu, Lihua; Geng, Xianguo

    2016-07-01

    With the help of the characteristic polynomial of Lax matrix for the K(-2, -2) hierarchy, we define a hyperelliptic curve 𝒦n+1 of arithmetic genus n+1. By introducing the Baker-Akhiezer function and meromorphic function, the K(-2, -2) hierarchy is decomposed into Dubrovin-type differential equations. Based on the theory of hyperelliptic curve, the explicit Riemann theta function representation of meromorphic function is given, and from which the quasi-periodic solutions to the K(-2, -2) hierarchy are obtained.

  14. Beyond grid security

    NASA Astrophysics Data System (ADS)

    Hoeft, B.; Epting, U.; Koenig, T.

    2008-07-01

    While many fields relevant to Grid security are already covered by existing working groups, their remit rarely goes beyond the scope of the Grid infrastructure itself. However, security issues pertaining to the internal set-up of compute centres have at least as much impact on Grid security. Thus, this talk will present briefly the EU ISSeG project (Integrated Site Security for Grids). In contrast to groups such as OSCT (Operational Security Coordination Team) and JSPG (Joint Security Policy Group), the purpose of ISSeG is to provide a holistic approach to security for Grid computer centres, from strategic considerations to an implementation plan and its deployment. The generalised methodology of Integrated Site Security (ISS) is based on the knowledge gained during its implementation at several sites as well as through security audits, and this will be briefly discussed. Several examples of ISS implementation tasks at the Forschungszentrum Karlsruhe will be presented, including segregation of the network for administration and maintenance and the implementation of Application Gateways. Furthermore, the web-based ISSeG training material will be introduced. This aims to offer ISS implementation guidance to other Grid installations in order to help avoid common pitfalls.

  15. On the hierarchy of interfacial dislocation structure

    NASA Astrophysics Data System (ADS)

    Balluffi, R. W.; Olson, G. B.

    1985-04-01

    Many different types of dislocations have been defined in dislocation models for grain boundaries and interphase boundaries. It is emphasized that there is no unique dislocation model for a boundary, and that the formal dislocation content depends upon the choice of the lattice correspondence relating the adjoining lattices. However, it is concluded that no problems of real physical significance arise from this lack of uniqueness. “Best≓, or most useful, descriptions often exist, and these are discussed. A hierarchy consisting of four different types of interfacial dislocations may be distinguished, which is useful in describing the dislocation content of interfaces. These entities are termed: (1) primary interfacial dislocations; (2) secondary interfacial dislocations; (3) coherency interfacial dislocations; and (4) translational interfacial dislocations. While there may be a lack of agreement on terminology in the literature, it is believed that these dislocation types are distinguishable and play unique roles in useful dislocation models for interfaces. Detailed descriptions of these dislocation types are given, and actual examples in real interfaces are presented. It is concluded that dislocation descriptions of interface structures become of purely formal significance in the limit of fully incoherent interfaces since the cores are then delocalized. The utility of various dislocation descriptions therefore depends on the degree to which various types of local coherency exist.

  16. Aeromonas hydrophila Lateral Flagellar Gene Transcriptional Hierarchy

    PubMed Central

    Wilhelms, Markus; Gonzalez, Victor; Merino, Susana

    2013-01-01

    Aeromonas hydrophila AH-3 lateral flagella are not assembled when bacteria grow in liquid media; however, lateral flagellar genes are transcribed. Our results indicate that A. hydrophila lateral flagellar genes are transcribed at three levels (class I to III genes) and share some similarities with, but have many important differences from, genes of Vibrio parahaemolyticus. A. hydrophila lateral flagellum class I gene transcription is σ70 dependent, which is consistent with the fact that lateral flagellum is constitutively transcribed, in contrast to the characteristics of V. parahaemolyticus. The fact that multiple genes are included in class I highlights that lateral flagellar genes are less hierarchically transcribed than polar flagellum genes. The A. hydrophila lafK-fliEJL gene cluster (where the subscript L distinguishes genes for lateral flagella from those for polar flagella) is exclusively from class I and is in V. parahaemolyticus class I and II. Furthermore, the A. hydrophila flgAMNL cluster is not transcribed from the σ54/LafK-dependent promoter and does not contain class II genes. Here, we propose a gene transcriptional hierarchy for the A. hydrophila lateral flagella. PMID:23335410

  17. Cortical thickness gradients in structural hierarchies

    PubMed Central

    Wagstyl, Konrad; Ronan, Lisa; Goodyer, Ian M.; Fletcher, Paul C.

    2015-01-01

    MRI, enabling in vivo analysis of cortical morphology, offers a powerful tool in the assessment of brain development and pathology. One of the most ubiquitous measures used—the thickness of the cortex—shows abnormalities in a number of diseases and conditions, but the functional and biological correlates of such alterations are unclear. If the functional connotations of structural MRI measures are to be understood, we must strive to clarify the relationship between measures such as cortical thickness and their cytoarchitectural determinants. We therefore sought to determine whether patterns of cortical thickness mirror a key motif of the cortex, specifically its structural hierarchical organisation. We delineated three sensory hierarchies (visual, somatosensory and auditory) in two species—macaque and human—and explored whether cortical thickness was correlated with specific cytoarchitectural characteristics. Importantly, we controlled for cortical folding which impacts upon thickness and may obscure regional differences. Our results suggest that an easily measurable macroscopic brain parameter, namely, cortical thickness, is systematically related to cytoarchitecture and to the structural hierarchical organisation of the cortex. We argue that the measurement of cortical thickness gradients may become an important way to develop our understanding of brain structure–function relationships. The identification of alterations in such gradients may complement the observation of regionally localised cortical thickness changes in our understanding of normal development and neuropsychiatric illnesses. PMID:25725468

  18. 6D RG flows and nilpotent hierarchies

    NASA Astrophysics Data System (ADS)

    Heckman, Jonathan J.; Rudelius, Tom; Tomasiello, Alessandro

    2016-07-01

    With the eventual aim of classifying renormalization group flows between 6D superconformal field theories (SCFTs), we study flows generated by the vevs of "conformal matter," a generalization of conventional hypermultiplets which naturally appear in the F-theory classification of 6D SCFTs. We consider flows in which the parent UV theory is (on its partial tensor branch) a linear chain of gauge groups connected by conformal matter, with one flavor group G at each end of the chain, and in which the symmetry breaking of the conformal matter at each end is parameterized by the orbit of a nilpotent element, i.e. T-brane data, of one of these flavor symmetries. Such nilpotent orbits admit a partial ordering, which is reflected in a hierarchy of IR fixed points. For each such nilpotent orbit, we determine the corresponding tensor branch for the resulting SCFT. An important feature of this algebraic approach is that it also allows us to systematically compute the unbroken flavor symmetries inherited from the parent UV theory.

  19. Hierarchy, cities size distribution and Zipf's law

    NASA Astrophysics Data System (ADS)

    Semboloni, F.

    2008-06-01

    We show that a hierarchical cities structure can be generated by a self-organized process which grows with a bottom-up mechanism, and that the resulting distribution is power law. First we analytically prove that the power law distribution satisfies the balance between the offer of the city and the demand of its basin of attraction, and that the exponent in the Zipf's law corresponds to the multiplier linking the population of the central city to the population of its basin of attraction. Moreover, the corresponding hierarchical structure shows a variable spanning factor, and the population of the cities linked to the same city up in the hierarchy is variable as well. Second a stochastic dynamic spatial model is proposed, whose numerical results confirm the analytical findings. In this model, inhabitants minimize the transportation cost, so that the greater the importance of this cost, the more stable is the system in its microscopic aspect. After a comparison with the existent methods for the generation of a power law distribution, conclusions are drawn on the connection of hierarchical structure, and power law distribution, with the functioning of the system of cities.

  20. Arc Length Based Grid Distribution For Surface and Volume Grids

    NASA Technical Reports Server (NTRS)

    Mastin, C. Wayne

    1996-01-01

    Techniques are presented for distributing grid points on parametric surfaces and in volumes according to a specified distribution of arc length. Interpolation techniques are introduced which permit a given distribution of grid points on the edges of a three-dimensional grid block to be propagated through the surface and volume grids. Examples demonstrate how these methods can be used to improve the quality of grids generated by transfinite interpolation.

  1. Trade in water and commodities as adaptations to global change

    NASA Astrophysics Data System (ADS)

    Lammers, R. B.; Hertel, T. W.; Prousevitch, A.; Baldos, U. L. C.; Frolking, S. E.; Liu, J.; Grogan, D. S.

    2015-12-01

    The human capacity for altering the water cycle has been well documented and given the expected change due to population, income growth, biofuels, climate, and associated land use change, there remains great uncertainty in both the degree of increased pressure on land and water resources and in our ability to adapt to these changes. Alleviating regional shortages in water supply can be carried out in a spatial hierarchy through i) direct trade of water between all regions, ii) development of infrastructure to improve water availability within regions (e.g. impounding rivers), iii) via inter-basin hydrological transfer between neighboring regions and, iv) via virtual water trade. These adaptation strategies can be managed via market trade in water and commodities to identify those strategies most likely to be adopted. This work combines the physically-based University of New Hampshire Water Balance Model (WBM) with the macro-scale Purdue University Simplified International Model of agricultural Prices Land use and the Environment (SIMPLE) to explore the interaction of supply and demand for fresh water globally. In this work we use a newly developed grid cell-based version of SIMPLE to achieve a more direct connection between the two modeling paradigms of physically-based models with optimization-driven approaches characteristic of economic models. We explore questions related to the global and regional impact of water scarcity and water surplus on the ability of regions to adapt to future change. Allowing for a variety of adaptation strategies such as direct trade of water and expanding the built water infrastructure, as well as indirect trade in commodities, will reduce overall global water stress and, in some regions, significantly reduce their vulnerability to these future changes.

  2. Parallel Adaptive Mesh Refinement

    SciTech Connect

    Diachin, L; Hornung, R; Plassmann, P; WIssink, A

    2005-03-04

    As large-scale, parallel computers have become more widely available and numerical models and algorithms have advanced, the range of physical phenomena that can be simulated has expanded dramatically. Many important science and engineering problems exhibit solutions with localized behavior where highly-detailed salient features or large gradients appear in certain regions which are separated by much larger regions where the solution is smooth. Examples include chemically-reacting flows with radiative heat transfer, high Reynolds number flows interacting with solid objects, and combustion problems where the flame front is essentially a two-dimensional sheet occupying a small part of a three-dimensional domain. Modeling such problems numerically requires approximating the governing partial differential equations on a discrete domain, or grid. Grid spacing is an important factor in determining the accuracy and cost of a computation. A fine grid may be needed to resolve key local features while a much coarser grid may suffice elsewhere. Employing a fine grid everywhere may be inefficient at best and, at worst, may make an adequately resolved simulation impractical. Moreover, the location and resolution of fine grid required for an accurate solution is a dynamic property of a problem's transient features and may not be known a priori. Adaptive mesh refinement (AMR) is a technique that can be used with both structured and unstructured meshes to adjust local grid spacing dynamically to capture solution features with an appropriate degree of resolution. Thus, computational resources can be focused where and when they are needed most to efficiently achieve an accurate solution without incurring the cost of a globally-fine grid. Figure 1.1 shows two example computations using AMR; on the left is a structured mesh calculation of a impulsively-sheared contact surface and on the right is the fuselage and volume discretization of an RAH-66 Comanche helicopter [35]. Note the

  3. The Benefits of Grid Networks

    ERIC Educational Resources Information Center

    Tennant, Roy

    2005-01-01

    In the article, the author talks about the benefits of grid networks. In speaking of grid networks the author is referring to both networks of computers and networks of humans connected together in a grid topology. Examples are provided of how grid networks are beneficial today and the ways in which they have been used.

  4. Smart Grid Integration Laboratory

    SciTech Connect

    Troxell, Wade

    2011-12-22

    The initial federal funding for the Colorado State University Smart Grid Integration Laboratory is through a Congressionally Directed Project (CDP), DE-OE0000070 Smart Grid Integration Laboratory. The original program requested in three one-year increments for staff acquisition, curriculum development, and instrumentation all which will benefit the Laboratory. This report focuses on the initial phase of staff acquisition which was directed and administered by DOE NETL/ West Virginia under Project Officer Tom George. Using this CDP funding, we have developed the leadership and intellectual capacity for the SGIC. This was accomplished by investing (hiring) a core team of Smart Grid Systems engineering faculty focused on education, research, and innovation of a secure and smart grid infrastructure. The Smart Grid Integration Laboratory will be housed with the separately funded Integrid Laboratory as part of CSU's overall Smart Grid Integration Center (SGIC). The period of performance of this grant was 10/1/2009 to 9/30/2011 which included one no cost extension due to time delays in faculty hiring. The Smart Grid Integration Laboratory's focus is to build foundations to help graduate and undergraduates acquire systems engineering knowledge; conduct innovative research; and team externally with grid smart organizations. Using the results of the separately funded Smart Grid Workforce Education Workshop (May 2009) sponsored by the City of Fort Collins, Northern Colorado Clean Energy Cluster, Colorado State University Continuing Education, Spirae, and Siemens has been used to guide the hiring of faculty, program curriculum and education plan. This project develops faculty leaders with the intellectual capacity to inspire its students to become leaders that substantially contribute to the development and maintenance of Smart Grid infrastructure through topics such as: (1) Distributed energy systems modeling and control; (2) Energy and power conversion; (3) Simulation of

  5. Maslow's Implied Matrix: A Clarification of the Need Hierarchy Theory.

    ERIC Educational Resources Information Center

    Marsh, Edward

    1978-01-01

    Maslow's need hierarchy theory is restated by means of a matrix arrangement of the constructs within the theory. After consideration of the consequences of this restatement, some significant research is discussed and directions for future research suggested. (Author)

  6. Analysing hierarchy in the organization of biological and physical systems.

    PubMed

    Jagers op Akkerhuis, Gerard A J M

    2008-02-01

    A structured approach is discussed for analysing hierarchy in the organization of biological and physical systems. The need for a structured approach follows from the observation that many hierarchies in the literature apply conflicting hierarchy rules and include ill-defined systems. As an alternative, we suggest a framework that is based on the following analytical steps: determination of the succession stage of the universe, identification of a specific system as part of the universe, specification of external influences on a system's creation and analysis of a system's internal organization. At the end, the paper discusses practical implications of the proposed method for the analysis of system organization and hierarchy in biology, ecology and physics.

  7. Hierarchy of equations of multiple-time correlation functions

    SciTech Connect

    Alonso, Daniel; Vega, Ines de

    2007-05-15

    In this paper we derive the evolution equations for non-Markovian multiple-time correlation functions of an open quantum system without using any approximation. We find that these equations conform an open hierarchy in which N-time correlation functions are dependent on (N+1)-time correlations. This hierarchy of equations is consistently obtained with two different methods: A first one based on Heisenberg equations of system operators, and a second one based on system propagators. The dependency on higher order correlations, and therefore the open hierarchy structure, only disappears in certain particular cases and when some hypothesis or approximations are considered in the equations. In this paper we consider a perturbative approximation and derive the general evolution equation for N-time correlations. This equation turns to depend only on N-time and lower order correlation functions, conforming a closed hierarchy structure that is useful for computational purposes.

  8. A Hierarchy of Basic Organizational Needs in Liberal Arts Colleges

    ERIC Educational Resources Information Center

    Thompson, Hugh L.; And Others

    1970-01-01

    This study, designed to test the hypothesis that decision making in formal organizations is related to a hierarchy of needs, gained empirical support for the hypothesis from the results of a sampling of 139 private liberal arts college presidents. (JH)

  9. Time Evolution of Density Matrices Using BBGKY Hierarchy

    NASA Astrophysics Data System (ADS)

    Akbari, Ali; Hashemi, Javad; Nieminen, Risto; van Leeuwen, Robert; Rubio, Angel

    2012-02-01

    Our work starts with the BBGKY hierarchy equations which can be straightforwardly derived from the time-dependent Schr"odinger equation for each n-body reduced density matrices (n-RDM). The equations of the BBGKY hierarchy in each level, couple an n-RDM to the (n+1)-RDM. In order to make this set of equations tractable we need to truncate the hierarchy. While people usually truncate the hierarchy at the first level, one can also truncate it at the level of second equation by approximating 3-RDM in terms of 2-RDM and 1-RDM. Regardless of approximations that we choose, the total energy and momentum will be conserved if we solve the first and second equation together. However, we will show that most of the existing approximations are unstable and even diverging in time and ponder the reasons behind it.

  10. Hierarchy of scales in B{yields}PS decays

    SciTech Connect

    Delepine, D.; Lucio M, J. L.; Mendoza S, J. A.; Ramirez, Carlos A.

    2008-08-31

    We show that the naive factorization approach can accommodate the existence of the observed hierarchy of branching ratios for the B{yields}PS decays (P stands for pseudoscalar and S for scalar mesons respectively.

  11. Deploying web-based visual exploration tools on the grid

    SciTech Connect

    Jankun-Kelly, T.J.; Kreylos, Oliver; Shalf, John; Ma, Kwan-Liu; Hamann, Bernd; Joy, Kenneth; Bethel, E. Wes

    2002-02-01

    We discuss a web-based portal for the exploration, encapsulation, and dissemination of visualization results over the Grid. This portal integrates three components: an interface client for structured visualization exploration, a visualization web application to manage the generation and capture of the visualization results, and a centralized portal application server to access and manage grid resources. We demonstrate the usefulness of the developed system using an example for Adaptive Mesh Refinement (AMR) data visualization.

  12. Supersymmetry breaking from superstrings and the gauge hierarchy

    SciTech Connect

    Gaillard, M.K. California Univ., Berkeley, CA . Dept. of Physics)

    1990-07-11

    The gauge hierarchy problem is reviewed and a class of effective field theories obtained from superstrings is described. These are characterized by a classical symmetry, related to the space-time duality of string theory, that is responsible for the suppression of observable supersymmetry breaking effects. At the quantum level, the symmetry is broken by anomalies that provide the seed of observable supersymmetry breaking, and an acceptably large gauge hierarchy may be generated. 39 refs.

  13. Mirror quintic vacua: hierarchies and inflation

    NASA Astrophysics Data System (ADS)

    Bizet, Nana Cabo; Loaiza-Brito, Oscar; Zavala, Ivonne

    2016-10-01

    We study the moduli space of type IIB string theory flux compactifications on the mirror of the CY quintic 3-fold in P^4 . We focus on the dynamics of the four dimensional moduli space, defined by the axio-dilaton τ and the complex structure modulus z. The z-plane has critical points, the conifold, the orbifold and the large complex structure with non trivial monodromies. We find the solutions to the Picard-Fuchs equations obeyed by the periods of the CY in the full z-plane as a series expansion in z around the critical points to arbitrary order. This allows us to discard fake vacua, which appear as a result of keeping only the leading order term in the series expansions. Due to monodromies vacua are located at a given sheet in the z-plane. A dS vacuum appears for a set of fluxes. We revisit vacua with hierarchies among the 4D and 6D physical scales close to the conifold point and compare them with those found at leading order in [1, 2]. We explore slow-roll inflationary directions of the scalar potential by looking at regions where the multi-field slow-roll parameters ɛ and η are smaller than one. The value of ɛ depends strongly on the approximation of the periods and to achieve a stable value, several orders in the expansion are needed. We do not find realizations of single field axion monodromy inflation. Instead, we find that inflationary regions appear along linear combinations of the four real field directions and for certain configurations of fluxes.

  14. Reevaluation of dominance hierarchy in bonobos (Pan paniscus).

    PubMed

    Paoli, T; Palagi, E; Tarli, S M Borgognini

    2006-05-01

    While dominance relationships have been widely studied in chimpanzees, in bonobos, dominance style and linearity of hierarchy are still under debate. In fact, some authors stated that bonobo hierarchy is nonlinear/ill-defined, while others claimed that it is fairly linear. In this paper, we test the hypothesis that a shift in group composition determines changes in linearity of hierarchy. To test this hypothesis, we collected data on one of the largest captive groups in the world, in the Apenheul Primate Park (The Netherlands). We investigated the linearity of the hierarchy in two different periods, with a shifting group composition. We used the corrected Landau's index and David's scores to estimate which animals were most dominant. The major overall result of our study is that hierarchy is fairly nonlinear in this group: during the first study period (eight adults), the hierarchy was nonlinear, whereas during the second one (six adults), it failed to reach statistical linearity. We argue that the reduction of the number of adults is the principal factor affecting linearity. We also found that dominance interactions were evenly distributed across sex classes in both study periods. Furthermore, no correlation was observed between age/body weight and rank. As for the overall dominance relationship between males and females, our results suggest that there is no exclusive female dominance in the Apenheul group. The dominance style of bonobos may be loose and differentially expressed in diverse groups or in the same group, along with shifting conditions.

  15. Inequality matters: classroom status hierarchy and adolescents' bullying.

    PubMed

    Garandeau, Claire F; Lee, Ihno A; Salmivalli, Christina

    2014-07-01

    The natural emergence of status hierarchies in adolescent peer groups has long been assumed to help prevent future intragroup aggression. However, clear evidence of this beneficial influence is lacking. In fact, few studies have examined between-group differences in the degree of status hierarchy (defined as within-group variation in individual status) and how they are related to bullying, a widespread form of aggression in schools. Data from 11,296 eighth- and ninth-graders (mean age = 14.57, 50.6 % female) from 583 classes in 71 schools were used to determine the direction of the association between classroom degree of status hierarchy and bullying behaviors, and to investigate prospective relationships between these two variables over a 6-month period. Multilevel structural equation modeling analyses showed that higher levels of classroom status hierarchy were concurrently associated with higher levels of bullying at the end of the school year. Higher hierarchy in the middle of the school year predicted higher bullying later in the year. No evidence was found to indicate that initial bullying predicted future hierarchy. These findings highlight the importance of a shared balance of power in the classroom for the prevention of bullying among adolescents.

  16. A preprocessor for numerical grid generation of boundary-fitted grids - An application to a solid propellant ablating boundary problem

    NASA Astrophysics Data System (ADS)

    Garriz, J. A.

    1985-01-01

    A code is described which demonstrates the versatility of the differential equations method of grid generation for generating boundary-fitted grids. Two problems from the field of solid mechanics are used to show the code's utility. The problem of successively generating grids for a geometry which changes with time is illustrated with the case of an ablating solid rocket propellant grain. On a more quantitative basis, the problem of successively generating grids whose grid points automatically position or 'adapt' themselves in order to resolve gradients of interest in an evolving solution is illustrated with the classic case of analyzing the state of stress in an axially loaded, rectangular plate with a centered circular hole.

  17. Implicit schemes and parallel computing in unstructured grid CFD

    NASA Technical Reports Server (NTRS)

    Venkatakrishnam, V.

    1995-01-01

    The development of implicit schemes for obtaining steady state solutions to the Euler and Navier-Stokes equations on unstructured grids is outlined. Applications are presented that compare the convergence characteristics of various implicit methods. Next, the development of explicit and implicit schemes to compute unsteady flows on unstructured grids is discussed. Next, the issues involved in parallelizing finite volume schemes on unstructured meshes in an MIMD (multiple instruction/multiple data stream) fashion are outlined. Techniques for partitioning unstructured grids among processors and for extracting parallelism in explicit and implicit solvers are discussed. Finally, some dynamic load balancing ideas, which are useful in adaptive transient computations, are presented.

  18. NREL Smart Grid Projects

    SciTech Connect

    Hambrick, J.

    2012-01-01

    Although implementing Smart Grid projects at the distribution level provides many advantages and opportunities for advanced operation and control, a number of significant challenges must be overcome to maintain the high level of safety and reliability that the modern grid must provide. For example, while distributed generation (DG) promises to provide opportunities to increase reliability and efficiency and may provide grid support services such as volt/var control, the presence of DG can impact distribution operation and protection schemes. Additionally, the intermittent nature of many DG energy sources such as photovoltaics (PV) can present a number of challenges to voltage regulation, etc. This presentation provides an overview a number of Smart Grid projects being performed by the National Renewable Energy Laboratory (NREL) along with utility, industry, and academic partners. These projects include modeling and analysis of high penetration PV scenarios (with and without energy storage), development and testing of interconnection and microgrid equipment, as well as the development and implementation of advanced instrumentation and data acquisition used to analyze the impacts of intermittent renewable resources. Additionally, standards development associated with DG interconnection and analysis as well as Smart Grid interoperability will be discussed.

  19. SLGRID: spectral synthesis software in the grid

    NASA Astrophysics Data System (ADS)

    Sabater, J.; Sánchez, S.; Verdes-Montenegro, L.

    2011-11-01

    SLGRID (http://www.e-ciencia.es/wiki/index.php/Slgrid) is a pilot project proposed by the e-Science Initiative of Andalusia (eCA) and supported by the Spanish e-Science Network in the frame of the European Grid Initiative (EGI). The aim of the project was to adapt the spectral synthesis software Starlight (Cid-Fernandes et al. 2005) to the Grid infrastructure. Starlight is used to estimate the underlying stellar populations (their ages and metallicities) using an optical spectrum, hence, it is possible to obtain a clean nebular spectrum that can be used for the diagnostic of the presence of an Active Galactic Nucleus (Sabater et al. 2008, 2009). The typical serial execution of the code for big samples of galaxies made it ideal to be integrated into the Grid. We obtain an improvement on the computational time of order N, being N the number of nodes available in the Grid. In a real case we obtained our results in 3 hours with SLGRID instead of the 60 days spent using Starlight in a PC. The code has already been ported to the Grid. The first tests were made within the e-CA infrastrusture and, later, itwas tested and improved with the colaboration of the CETA-CIEMAT. The SLGRID project has been recently renewed. In a future it is planned to adapt the code for the reduction of data from Integral Field Units where each dataset is composed of hundreds of spectra. Electronic version of the poster at http://www.iaa.es/~jsm/SEA2010

  20. CAGI: Computer Aided Grid Interface. A work in progress

    NASA Technical Reports Server (NTRS)

    Soni, Bharat K.; Yu, Tzu-Yi; Vaughn, David

    1992-01-01

    Progress realized in the development of a Computer Aided Grid Interface (CAGI) software system in integrating CAD/CAM geometric system output and/or Interactive Graphics Exchange Standard (IGES) files, geometry manipulations associated with grid generation, and robust grid generation methodologies is presented. CAGI is being developed in a modular fashion and will offer fast, efficient and economical response to geometry/grid preparation, allowing the ability to upgrade basic geometry in a step-by-step fashion interactively and under permanent visual control along with minimizing the differences between the actual hardware surface descriptions and corresponding numerical analog. The computer code GENIE is used as a basis. The Non-Uniform Rational B-Splines (NURBS) representation of sculptured surfaces is utilized for surface grid redistribution. The computer aided analysis system, PATRAN, is adapted as a CAD/CAM system. The progress realized in NURBS surface grid generation, the development of IGES transformer, and geometry adaption using PATRAN will be presented along with their applicability to grid generation associated with rocket propulsion applications.

  1. Enabling Science and Engineering Applications on the Grid

    SciTech Connect

    Seidel, Ed

    2004-08-25

    The Grid has the potential to fundamentally change the way science and engineering are done. Aggregate power of computing resources connected by networks - of the Grid - exceeds that of any single supercomputer by many orders of magnitude. At the same time, our ability to carry out computations of the scale and level of detail required, for example, to study the Universe, or simulate a rocket engine, are severely constrained by available computing power. Hence, such applications should be one of the main driving forces behind the development of Grid computing. I will discuss some large scale applications, including simulations of colliding black holes, and show how they are driving the development of Grid computing technology. Applications are already being developed that are not only aware of their needs, but also of the resources available to them on the Grid. They will be able to adapt themselves automatically to respond to their changing needs, to spawn off tasks on other resources, and to adapt to the changing characteristics of the Grid including machine and network loads and availability. I will discuss a number of innovative scenarios for computing on the Grid enabled by such technologies, and demonstrate how close these are to being a reality.

  2. GENIE - Generation of computational geometry-grids for internal-external flow configurations

    NASA Technical Reports Server (NTRS)

    Soni, B. K.

    1988-01-01

    Progress realized in the development of a master geometry-grid generation code GENIE is presented. The grid refinement process is enhanced by developing strategies to utilize bezier curves/surfaces and splines along with weighted transfinite interpolation technique and by formulating new forcing function for the elliptic solver based on the minimization of a non-orthogonality functional. A two step grid adaptation procedure is developed by optimally blending adaptive weightings with weighted transfinite interpolation technique. Examples of 2D-3D grids are provided to illustrate the success of these methods.

  3. Modelling noise propagation using Grid Resources. Progress within GDI-Grid

    NASA Astrophysics Data System (ADS)

    Kiehle, Christian; Mayer, Christian; Padberg, Alexander; Stapelfeld, Hartmut

    2010-05-01

    Modelling noise propagation using Grid Resources. Progress within GDI-Grid. GDI-Grid (english: SDI-Grid) is a research project funded by the German Ministry for Science and Education (BMBF). It aims at bridging the gaps between OGC Web Services (OWS) and Grid infrastructures and identifying the potential of utilizing the superior storage capacities and computational power of grid infrastructures for geospatial applications while keeping the well-known service interfaces specified by the OGC. The project considers all major OGC webservice interfaces for Web Mapping (WMS), Feature access (Web Feature Service), Coverage access (Web Coverage Service) and processing (Web Processing Service). The major challenge within GDI-Grid is the harmonization of diverging standards as defined by standardization bodies for Grid computing and spatial information exchange. The project started in 2007 and will continue until June 2010. The concept for the gridification of OWS developed by lat/lon GmbH and the Department of Geography of the University of Bonn is applied to three real-world scenarios in order to check its practicability: a flood simulation, a scenario for emergency routing and a noise propagation simulation. The latter scenario is addressed by the Stapelfeldt Ingenieurgesellschaft mbH located in Dortmund adapting their LimA software to utilize grid resources. Noise mapping of e.g. traffic noise in urban agglomerates and along major trunk roads is a reoccurring demand of the EU Noise Directive. Input data requires road net and traffic, terrain, buildings and noise protection screens as well as population distribution. Noise impact levels are generally calculated in 10 m grid and along relevant building facades. For each receiver position sources within a typical range of 2000 m are split down into small segments, depending on local geometry. For each of the segments propagation analysis includes diffraction effects caused by all obstacles on the path of sound propagation

  4. Fusion Data Grid Service

    NASA Astrophysics Data System (ADS)

    Shasharina, Svetlana; Wang, Nanbor

    2004-11-01

    Simulations and experiments in the fusion and plasma physics community generate large datasets at remote sites. Visualization and analysis of these datasets are difficult because of the incompatibility among the various data formats adopted by simulation, experiments, and analysis tools, and the large sizes of analyzed data. Grids and Web Services technologies are capable of providing solutions for such heterogeneous settings, but need to be customized to the field-specific needs and merged with distributed technologies currently used by the community. This paper describes how we are addressing these issues in the Fusion Grid Service under development. We also present performance results of relevant data transfer mechanisms including binary SOAP, DIME, GridFTP and MDSplus and CORBA. We will describe the status of data converters (between HDF5 and MDSplus data types), developed in collaboration with MIT (J. Stillerman). Finally, we will analyze bottlenecks of MDSplus data transfer mechanism (work performed in collaboration with General Atomics (D. Schissel and M. Qian).

  5. Information Power Grid Posters

    NASA Technical Reports Server (NTRS)

    Vaziri, Arsi

    2003-01-01

    This document is a summary of the accomplishments of the Information Power Grid (IPG). Grids are an emerging technology that provide seamless and uniform access to the geographically dispersed, computational, data storage, networking, instruments, and software resources needed for solving large-scale scientific and engineering problems. The goal of the NASA IPG is to use NASA's remotely located computing and data system resources to build distributed systems that can address problems that are too large or complex for a single site. The accomplishments outlined in this poster presentation are: access to distributed data, IPG heterogeneous computing, integration of large-scale computing node into distributed environment, remote access to high data rate instruments,and exploratory grid environment.

  6. Turbulent Output-Based Anisotropic Adaptation

    NASA Technical Reports Server (NTRS)

    Park, Michael A.; Carlson, Jan-Renee

    2010-01-01

    Controlling discretization error is a remaining challenge for computational fluid dynamics simulation. Grid adaptation is applied to reduce estimated discretization error in drag or pressure integral output functions. To enable application to high O(10(exp 7)) Reynolds number turbulent flows, a hybrid approach is utilized that freezes the near-wall boundary layer grids and adapts the grid away from the no slip boundaries. The hybrid approach is not applicable to problems with under resolved initial boundary layer grids, but is a powerful technique for problems with important off-body anisotropic features. Supersonic nozzle plume, turbulent flat plate, and shock-boundary layer interaction examples are presented with comparisons to experimental measurements of pressure and velocity. Adapted grids are produced that resolve off-body features in locations that are not known a priori.

  7. GridPV Toolbox

    SciTech Connect

    Broderick, Robert; Quiroz, Jimmy; Grijalva, Santiago; Reno, Matthew; Coogan, Kyle

    2014-07-15

    Matlab Toolbox for simulating the impact of solar energy on the distribution grid. The majority of the functions are useful for interfacing OpenDSS and MATLAB, and they are of generic use for commanding OpenDSS from MATLAB and retrieving GridPV Toolbox information from simulations. A set of functions is also included for modeling PV plant output and setting up the PV plant in the OpenDSS simulation. The toolbox contains functions for modeling the OpenDSS distribution feeder on satellite images with GPS coordinates. Finally, example simulations functions are included to show potential uses of the toolbox functions.

  8. Using analytic hierarchy process approach in ontological multicriterial decision making - Preliminary considerations

    NASA Astrophysics Data System (ADS)

    Wasielewska, K.; Ganzha, M.

    2012-10-01

    In this paper we consider combining ontologically demarcated information with Saaty's Analytic Hierarchy Process (AHP) [1] for the multicriterial assessment of offers during contract negotiations. The context for the proposal is provided by the Agents in Grid project (AiG; [2]), which aims at development of an agent-based infrastructure for efficient resource management in the Grid. In the AiG project, software agents representing users can either (1) join a team and earn money, or (2) find a team to execute a job. Moreover, agents form teams, managers of which negotiate with clients and workers terms of potential collaboration. Here, ontologically described contracts (Service Level Agreements) are the results of autonomous multiround negotiations. Therefore, taking into account relatively complex nature of the negotiated contracts, multicriterial assessment of proposals plays a crucial role. The AHP method is based on pairwise comparisons of criteria and relies on the judgement of a panel of experts. It measures how well does an offer serve the objective of a decision maker. In this paper, we propose how the AHP method can be used to assess ontologically described contract proposals.

  9. Ion Accelerator With Negatively Biased Decelerator Grid

    NASA Technical Reports Server (NTRS)

    Brophy, John R.

    1994-01-01

    Three-grid ion accelerator in which accelerator grid is biased at negative potential and decelerator grid downstream of accelerator grid biased at smaller negative potential. This grid and bias arrangement reduces frequency of impacts, upon accelerator grid, of charge-exchange ions produced downstream in collisions between accelerated ions and atoms and molecules of background gas. Sputter erosion of accelerator grid reduced.

  10. Essential Grid Workflow Monitoring Elements

    SciTech Connect

    Gunter, Daniel K.; Jackson, Keith R.; Konerding, David E.; Lee,Jason R.; Tierney, Brian L.

    2005-07-01

    Troubleshooting Grid workflows is difficult. A typicalworkflow involves a large number of components networks, middleware,hosts, etc. that can fail. Even when monitoring data from all thesecomponents is accessible, it is hard to tell whether failures andanomalies in these components are related toa given workflow. For theGrid to be truly usable, much of this uncertainty must be elim- inated.We propose two new Grid monitoring elements, Grid workflow identifiersand consistent component lifecycle events, that will make Gridtroubleshooting easier, and thus make Grids more usable, by simplifyingthe correlation of Grid monitoring data with a particular Gridworkflow.

  11. Distributed Accounting on the Grid

    NASA Technical Reports Server (NTRS)

    Thigpen, William; Hacker, Thomas J.; McGinnis, Laura F.; Athey, Brian D.

    2001-01-01

    By the late 1990s, the Internet was adequately equipped to move vast amounts of data between HPC (High Performance Computing) systems, and efforts were initiated to link together the national infrastructure of high performance computational and data storage resources together into a general computational utility 'grid', analogous to the national electrical power grid infrastructure. The purpose of the Computational grid is to provide dependable, consistent, pervasive, and inexpensive access to computational resources for the computing community in the form of a computing utility. This paper presents a fully distributed view of Grid usage accounting and a methodology for allocating Grid computational resources for use on a Grid computing system.

  12. Enabling Campus Grids with Open Science Grid Technology

    NASA Astrophysics Data System (ADS)

    Weitzel, Derek; Bockelman, Brian; Fraser, Dan; Pordes, Ruth; Swanson, David

    2011-12-01

    The Open Science Grid is a recognized key component of the US national cyber-infrastructure enabling scientific discovery through advanced high throughput computing. The principles and techniques that underlie the Open Science Grid can also be applied to Campus Grids since many of the requirements are the same, even if the implementation technologies differ. We find five requirements for a campus grid: trust relationships, job submission, resource independence, accounting, and data management. The Holland Computing Center's campus grid at the University of Nebraska-Lincoln was designed to fulfill the requirements of a campus grid. A bridging daemon was designed to bring non-Condor clusters into a grid managed by Condor. Condor features which make it possible to bridge Condor sites into a multi-campus grid have been exploited at the Holland Computing Center as well.

  13. Unlocking the smart grid

    SciTech Connect

    Rokach, Joshua Z.

    2010-10-15

    The country has progressed in a relatively short time from rotary dial phones to computers, cell phones, and iPads. With proper planning and orderly policy implementation, the same will happen with the Smart Grid. Here are some suggestions on how to proceed. (author)

  14. NSTAR Smart Grid Pilot

    SciTech Connect

    Rabari, Anil; Fadipe, Oloruntomi

    2014-03-31

    NSTAR Electric & Gas Corporation (“the Company”, or “NSTAR”) developed and implemented a Smart Grid pilot program beginning in 2010 to demonstrate the viability of leveraging existing automated meter reading (“AMR”) deployments to provide much of the Smart Grid functionality of advanced metering infrastructure (“AMI”), but without the large capital investment that AMI rollouts typically entail. In particular, a central objective of the Smart Energy Pilot was to enable residential dynamic pricing (time-of-use “TOU” and critical peak rates and rebates) and two-way direct load control (“DLC”) by continually capturing AMR meter data transmissions and communicating through customer-sited broadband connections in conjunction with a standardsbased home area network (“HAN”). The pilot was supported by the U.S. Department of Energy’s (“DOE”) through the Smart Grid Demonstration program. NSTAR was very pleased to not only receive the funding support from DOE, but the guidance and support of the DOE throughout the pilot. NSTAR is also pleased to report to the DOE that it was able to execute and deliver a successful pilot on time and on budget. NSTAR looks for future opportunities to work with the DOE and others in future smart grid projects.

  15. The surveillance error grid.

    PubMed

    Klonoff, David C; Lias, Courtney; Vigersky, Robert; Clarke, William; Parkes, Joan Lee; Sacks, David B; Kirkman, M Sue; Kovatchev, Boris

    2014-07-01

    Currently used error grids for assessing clinical accuracy of blood glucose monitors are based on out-of-date medical practices. Error grids have not been widely embraced by regulatory agencies for clearance of monitors, but this type of tool could be useful for surveillance of the performance of cleared products. Diabetes Technology Society together with representatives from the Food and Drug Administration, the American Diabetes Association, the Endocrine Society, and the Association for the Advancement of Medical Instrumentation, and representatives of academia, industry, and government, have developed a new error grid, called the surveillance error grid (SEG) as a tool to assess the degree of clinical risk from inaccurate blood glucose (BG) monitors. A total of 206 diabetes clinicians were surveyed about the clinical risk of errors of measured BG levels by a monitor. The impact of such errors on 4 patient scenarios was surveyed. Each monitor/reference data pair was scored and color-coded on a graph per its average risk rating. Using modeled data representative of the accuracy of contemporary meters, the relationships between clinical risk and monitor error were calculated for the Clarke error grid (CEG), Parkes error grid (PEG), and SEG. SEG action boundaries were consistent across scenarios, regardless of whether the patient was type 1 or type 2 or using insulin or not. No significant differences were noted between responses of adult/pediatric or 4 types of clinicians. Although small specific differences in risk boundaries between US and non-US clinicians were noted, the panel felt they did not justify separate grids for these 2 types of clinicians. The data points of the SEG were classified in 15 zones according to their assigned level of risk, which allowed for comparisons with the classic CEG and PEG. Modeled glucose monitor data with realistic self-monitoring of blood glucose errors derived from meter testing experiments plotted on the SEG when compared to

  16. Grid generation and flow solution method for Euler equations on unstructured grids

    NASA Technical Reports Server (NTRS)

    Anderson, W. Kyle

    1992-01-01

    A grid generation and flow solution algorithm for the Euler equations on unstructured grids is presented. The grid generation scheme, which uses Delaunay triangulation, generates the field points for the mesh based on cell aspect ratios and allows clustering of grid points near solid surfaces. The flow solution method is an implicit algorithm in which the linear set of equations arising at each time step is solved using a Gauss-Seidel procedure that is completely vectorizable. Also, a study is conducted to examine the number of subiterations required for good convergence of the overall algorithm. Grid generation results are shown in two dimensions for an NACA 0012 airfoil as well as a two element configuration. Flow solution results are shown for a two dimensional flow over the NACA 0012 airfoil and for a two element configuration in which the solution was obtained through an adaptation procedure and compared with an exact solution. Preliminary three dimensional results also are shown in which the subsonic flow over a business jet is computed.

  17. Structural measures to track the evolution of SNOMED CT hierarchies.

    PubMed

    Wei, Duo; Helen Gu, Huanying; Perl, Yehoshua; Halper, Michael; Ochs, Christopher; Elhanan, Gai; Chen, Yan

    2015-10-01

    The Systematized Nomenclature of Medicine Clinical Terms (SNOMED CT) is an extensive reference terminology with an attendant amount of complexity. It has been updated continuously and revisions have been released semi-annually to meet users' needs and to reflect the results of quality assurance (QA) activities. Two measures based on structural features are proposed to track the effects of both natural terminology growth and QA activities based on aspects of the complexity of SNOMED CT. These two measures, called the structural density measure and accumulated structural measure, are derived based on two abstraction networks, the area taxonomy and the partial-area taxonomy. The measures derive from attribute relationship distributions and various concept groupings that are associated with the abstraction networks. They are used to track the trends in the complexity of structures as SNOMED CT changes over time. The measures were calculated for consecutive releases of five SNOMED CT hierarchies, including the Specimen hierarchy. The structural density measure shows that natural growth tends to move a hierarchy's structure toward a more complex state, whereas the accumulated structural measure shows that QA processes tend to move a hierarchy's structure toward a less complex state. It is also observed that both the structural density and accumulated structural measures are useful tools to track the evolution of an entire SNOMED CT hierarchy and reveal internal concept migration within it.

  18. Interacting with image hierarchies for fast and accurate object segmentation

    NASA Astrophysics Data System (ADS)

    Beard, David V.; Eberly, David H.; Hemminger, Bradley M.; Pizer, Stephen M.; Faith, R. E.; Kurak, Charles; Livingston, Mark

    1994-05-01

    Object definition is an increasingly important area of medical image research. Accurate and fairly rapid object definition is essential for measuring the size and, perhaps more importantly, the change in size of anatomical objects such as kidneys and tumors. Rapid and fairly accurate object definition is essential for 3D real-time visualization including both surgery planning and Radiation oncology treatment planning. One approach to object definition involves the use of 3D image hierarchies, such as Eberly's Ridge Flow. However, the image hierarchy segmentation approach requires user interaction in selecting regions and subtrees. Further, visualizing and comprehending the anatomy and the selected portions of the hierarchy can be problematic. In this paper we will describe the Magic Crayon tool which allows a user to define rapidly and accurately various anatomical objects by interacting with image hierarchies such as those generated with Eberly's Ridge Flow algorithm as well as other 3D image hierarchies. Preliminary results suggest that fairly complex anatomical objects can be segmented in under a minute with sufficient accuracy for 3D surgery planning, 3D radiation oncology treatment planning, and similar applications. Potential modifications to the approach for improved accuracy are summarized.

  19. Global network structure of dominance hierarchy of ant workers.

    PubMed

    Shimoji, Hiroyuki; Abe, Masato S; Tsuji, Kazuki; Masuda, Naoki

    2014-10-06

    Dominance hierarchy among animals is widespread in various species and believed to serve to regulate resource allocation within an animal group. Unlike small groups, however, detection and quantification of linear hierarchy in large groups of animals are a difficult task. Here, we analyse aggression-based dominance hierarchies formed by worker ants in Diacamma sp. as large directed networks. We show that the observed dominance networks are perfect or approximate directed acyclic graphs, which are consistent with perfect linear hierarchy. The observed networks are also sparse and random but significantly different from networks generated through thinning of the perfect linear tournament (i.e. all individuals are linearly ranked and dominance relationship exists between every pair of individuals). These results pertain to global structure of the networks, which contrasts with the previous studies inspecting frequencies of different types of triads. In addition, the distribution of the out-degree (i.e. number of workers that the focal worker attacks), not in-degree (i.e. number of workers that attack the focal worker), of each observed network is right-skewed. Those having excessively large out-degrees are located near the top, but not the top, of the hierarchy. We also discuss evolutionary implications of the discovered properties of dominance networks.

  20. Equil: A Global Grid System

    NASA Astrophysics Data System (ADS)

    Hahn, Sebastian; Reimer, Christioph; Paulik, Christoph; Wagner, Wolfgang

    2016-08-01

    Geophysical parameters derived from space-borne Earth Observation Systems are either assigned to discrete points on a fixed Earth grid (e.g. regular lon/lat grid) or located on orbital point nodes with a customized arrangement, often in-line with the instrument's measurement geometry. The driving factors of the choice and structure of a spatial reference system (i.e. the grid) are typically spatial resolution, instrument geometry, measurement technique or application.In this study we propose a global grid system, the so- called Equil grid, and demonstrate its realization and structure. An exemplary Equil grid with a base sampling distance of 12.5 km is compared against two other grids commonly used in the domain of remote sensing of soil moisture. The simple nearly-equidistant grid design makes it interesting for a wide range of other geophysical parameters as well.

  1. Adaptive Algebraic Multigrid Methods

    SciTech Connect

    Brezina, M; Falgout, R; MacLachlan, S; Manteuffel, T; McCormick, S; Ruge, J

    2004-04-09

    Our ability to simulate physical processes numerically is constrained by our ability to solve the resulting linear systems, prompting substantial research into the development of multiscale iterative methods capable of solving these linear systems with an optimal amount of effort. Overcoming the limitations of geometric multigrid methods to simple geometries and differential equations, algebraic multigrid methods construct the multigrid hierarchy based only on the given matrix. While this allows for efficient black-box solution of the linear systems associated with discretizations of many elliptic differential equations, it also results in a lack of robustness due to assumptions made on the near-null spaces of these matrices. This paper introduces an extension to algebraic multigrid methods that removes the need to make such assumptions by utilizing an adaptive process. The principles which guide the adaptivity are highlighted, as well as their application to algebraic multigrid solution of certain symmetric positive-definite linear systems.

  2. Photofabricated Wire-Grid Polarizers

    NASA Technical Reports Server (NTRS)

    Siegel, Peter H.; Dengler, Robert J.

    1992-01-01

    Freestanding metallic grids for use as polarizers for electromagnetic radiation at millimeter and submillimeter wavelengths made by simple modification of designs of freestanding square- and nearly-square cell metallic grids, according to proposal. Cross wires provide mechanical support, but distance between cross wires made greater than one wavelength so cross wires have little effect on polarizing characteristics of grid. Possible to fabricate grids commercially for frequencies up to several terahertz.

  3. Applications of algebraic grid generation

    NASA Technical Reports Server (NTRS)

    Eiseman, Peter R.; Smith, Robert E.

    1990-01-01

    Techniques and applications of algebraic grid generation are described. The techniques are univariate interpolations and transfinite assemblies of univariate interpolations. Because algebraic grid generation is computationally efficient, the use of interactive graphics in conjunction with the techniques is advocated. A flexible approach, which works extremely well in an interactive environment, called the control point form of algebraic grid generation is described. The applications discussed are three-dimensional grids constructed about airplane and submarine configurations.

  4. Adaptive numerical methods for partial differential equations

    SciTech Connect

    Cololla, P.

    1995-07-01

    This review describes a structured approach to adaptivity. The Automated Mesh Refinement (ARM) algorithms developed by M Berger are described, touching on hyperbolic and parabolic applications. Adaptivity is achieved by overlaying finer grids only in areas flagged by a generalized error criterion. The author discusses some of the issues involved in abutting disparate-resolution grids, and demonstrates that suitable algorithms exist for dissipative as well as hyperbolic systems.

  5. A grid spacing control technique for algebraic grid generation methods

    NASA Technical Reports Server (NTRS)

    Smith, R. E.; Kudlinski, R. A.; Everton, E. L.

    1982-01-01

    A technique which controls the spacing of grid points in algebraically defined coordinate transformations is described. The technique is based on the generation of control functions which map a uniformly distributed computational grid onto parametric variables defining the physical grid. The control functions are smoothed cubic splines. Sets of control points are input for each coordinate directions to outline the control functions. Smoothed cubic spline functions are then generated to approximate the input data. The technique works best in an interactive graphics environment where control inputs and grid displays are nearly instantaneous. The technique is illustrated with the two-boundary grid generation algorithm.

  6. Grid Interaction Technical Team Roadmap

    SciTech Connect

    2013-06-01

    The mission of the Grid Interaction Technical Team (GITT) is to support a transition scenario to large scale grid-connected vehicle charging with transformational technology, proof of concept and information dissemination. The GITT facilitates technical coordination and collaboration between vehicle-grid connectivity and communication activities among U.S. DRIVE government and industry partners.

  7. Biochemical energetics of hierarchy formation in Betta splendens.

    PubMed

    Haller, J; Wittenberger, C

    1988-01-01

    Two different stages of hierarchy formation in Betta splendens were considered. Winners and losers in a short social contact, and dominant and submissive individuals after the establishment of a hierarchy, respectively, were identified. Metabolical determinations (free glucose, glycogen and protein content, glycogen and protein synthesis, glucose and amino acid oxidation, carbohydrate degradation) were performed. Winners and dominant individuals were shown to be able to produce more energy per unit time than losers and submissives, respectively. Differences in energy metabolism between individuals found in different stages of hierarchy formation also occurred: the carbohydrate degradation reached very high values after a short social contact. This is related to the noticed substitution of aggressive encounters with threat displays in the course of cohabitation.

  8. A Possible Connection Between Dark Energy And the Hierarchy

    SciTech Connect

    Chen, Pisin; Gu, Je-An; /NCTS, Hsinchu

    2007-11-16

    Recently it was suggested that the dark energy maybe related to the well-known hierarchy between the Planck scale ({approx} 10{sup 19} GeV) and the TeV scale. The same brane-world setup to address this hierarchy problem may also in principle address the smallness problem of dark energy. Specifically, the Planck-SM hierarchy ratio was viewed as a quantum gravity-related, dimensionless fine structure constant where various physical energy scales in the system are associated with the Planck mass through different powers of the 'gravity fine structure constant'. In this paper we provide a toy model based on the Randall-Sundrum geometry where SUSY-breaking is induced by the coupling between a SUSY-breaking Higgs field on the brane and the KK gravitinos. We show that the associated Casimir energy density indeed conforms with the dark energy scale.

  9. Statefinder hierarchy: An extended null diagnostic for concordance cosmology

    NASA Astrophysics Data System (ADS)

    Arabsalmani, Maryam; Sahni, Varun

    2011-02-01

    We show how higher derivatives of the expansion factor can be developed into a null diagnostic for concordance cosmology (ΛCDM). It is well known that the Statefinder—the third derivative of the expansion factor written in dimensionless form, a(3)/aH3, equals unity for ΛCDM. We generalize this result and demonstrate that the hierarchy, a(n)/aHn, can be converted to a form that stays pegged at unity in concordance cosmology. This remarkable property of the Statefinder hierarchy enables it to be used as an extended null diagnostic for the cosmological constant. The Statefinder hierarchy combined with the growth rate of matter perturbations defines a composite null diagnostic which can distinguish evolving dark energy from ΛCDM.

  10. Cloud Computing for the Grid: GridControl: A Software Platform to Support the Smart Grid

    SciTech Connect

    2012-02-08

    GENI Project: Cornell University is creating a new software platform for grid operators called GridControl that will utilize cloud computing to more efficiently control the grid. In a cloud computing system, there are minimal hardware and software demands on users. The user can tap into a network of computers that is housed elsewhere (the cloud) and the network runs computer applications for the user. The user only needs interface software to access all of the cloud’s data resources, which can be as simple as a web browser. Cloud computing can reduce costs, facilitate innovation through sharing, empower users, and improve the overall reliability of a dispersed system. Cornell’s GridControl will focus on 4 elements: delivering the state of the grid to users quickly and reliably; building networked, scalable grid-control software; tailoring services to emerging smart grid uses; and simulating smart grid behavior under various conditions.

  11. Space-Time Approximation with Sparse Grids

    SciTech Connect

    Griebel, M; Oeltz, D; Vassilevski, P S

    2005-04-14

    In this article we introduce approximation spaces for parabolic problems which are based on the tensor product construction of a multiscale basis in space and a multiscale basis in time. Proper truncation then leads to so-called space-time sparse grid spaces. For a uniform discretization of the spatial space of dimension d with O(N{sup d}) degrees of freedom, these spaces involve for d > 1 also only O(N{sup d}) degrees of freedom for the discretization of the whole space-time problem. But they provide the same approximation rate as classical space-time Finite Element spaces which need O(N{sup d+1}) degrees of freedoms. This makes these approximation spaces well suited for conventional parabolic and for time-dependent optimization problems. We analyze the approximation properties and the dimension of these sparse grid space-time spaces for general stable multiscale bases. We then restrict ourselves to an interpolatory multiscale basis, i.e. a hierarchical basis. Here, to be able to handle also complicated spatial domains {Omega}, we construct the hierarchical basis from a given spatial Finite Element basis as follows: First we determine coarse grid points recursively over the levels by the coarsening step of the algebraic multigrid method. Then, we derive interpolatory prolongation operators between the respective coarse and fine grid points by a least squares approach. This way we obtain an algebraic hierarchical basis for the spatial domain which we then use in our space-time sparse grid approach. We give numerical results on the convergence rate of the interpolation error of these spaces for various space-time problems with two spatial dimensions. Also implementational issues, data structures and questions of adaptivity are addressed to some extent.

  12. Gridded electron reversal ionizer

    NASA Technical Reports Server (NTRS)

    Chutjian, Ara (Inventor)

    1993-01-01

    A gridded electron reversal ionizer forms a three dimensional cloud of zero or near-zero energy electrons in a cavity within a filament structure surrounding a central electrode having holes through which the sample gas, at reduced pressure, enters an elongated reversal volume. The resultant negative ion stream is applied to a mass analyzer. The reduced electron and ion space-charge limitations of this configuration enhances detection sensitivity for material to be detected by electron attachment, such as narcotic and explosive vapors. Positive ions may be generated by generating electrons having a higher energy, sufficient to ionize the target gas and pulsing the grid negative to stop the electron flow and pulsing the extraction aperture positive to draw out the positive ions.

  13. Shuttle computational grid generation

    NASA Technical Reports Server (NTRS)

    Ing, Chang

    1987-01-01

    The well known Karman-Trefftz conformal transformation, consisting of repeated applications of the same basic formula, were found to be quite successful to body, wing, and wing-body cross sections. This grid generation technique is extended to cross sections of more complex forms, and also more automatic. Computer programs were written for the selection of hinge points on cross section with angular shapes, the Karman-Trefftz tranformation of arbitrary shapes, and the special transform of hinge point on the imaginary axis. A feasibility study is performed for the future application of conformal mapping grid generation to complex three dimensional configurations. Examples such as Orbiter vehicle section and a few others were used.

  14. Smart Grid Demonstration Project

    SciTech Connect

    Miller, Craig; Carroll, Paul; Bell, Abigail

    2015-03-11

    The National Rural Electric Cooperative Association (NRECA) organized the NRECA-U.S. Department of Energy (DOE) Smart Grid Demonstration Project (DE-OE0000222) to install and study a broad range of advanced smart grid technologies in a demonstration that spanned 23 electric cooperatives in 12 states. More than 205,444 pieces of electronic equipment and more than 100,000 minor items (bracket, labels, mounting hardware, fiber optic cable, etc.) were installed to upgrade and enhance the efficiency, reliability, and resiliency of the power networks at the participating co-ops. The objective of this project was to build a path for other electric utilities, and particularly electrical cooperatives, to adopt emerging smart grid technology when it can improve utility operations, thus advancing the co-ops’ familiarity and comfort with such technology. Specifically, the project executed multiple subprojects employing a range of emerging smart grid technologies to test their cost-effectiveness and, where the technology demonstrated value, provided case studies that will enable other electric utilities—particularly electric cooperatives— to use these technologies. NRECA structured the project according to the following three areas: Demonstration of smart grid technology; Advancement of standards to enable the interoperability of components; and Improvement of grid cyber security. We termed these three areas Technology Deployment Study, Interoperability, and Cyber Security. Although the deployment of technology and studying the demonstration projects at coops accounted for the largest portion of the project budget by far, we see our accomplishments in each of the areas as critical to advancing the smart grid. All project deliverables have been published. Technology Deployment Study: The deliverable was a set of 11 single-topic technical reports in areas related to the listed technologies. Each of these reports has already been submitted to DOE, distributed to co-ops, and

  15. Hierarchy of Stochastic Pure States for Open Quantum System Dynamics

    NASA Astrophysics Data System (ADS)

    Suess, D.; Eisfeld, A.; Strunz, W. T.

    2014-10-01

    We derive a hierarchy of stochastic evolution equations for pure states (quantum trajectories) for open quantum system dynamics with non-Markovian structured environments. This hierarchy of pure states (HOPS) is generally applicable and provides the exact reduced density operator as an ensemble average over normalized states. The corresponding nonlinear equations are presented. We demonstrate that HOPS provides an efficient theoretical tool and apply it to the spin-boson model, the calculation of absorption spectra of molecular aggregates, and energy transfer in a photosynthetic pigment-protein complex.

  16. Cosmological Constant as a Manifestation of the Hierarchy

    SciTech Connect

    Chen, Pisin; Gu, Je-An

    2007-12-21

    There has been the suggestion that the cosmological constant as implied by the dark energy is related to the well-known hierarchy between the Planck scale, M{sub PI}, and the Standard Model scale, M{sub SM}. Here we further propose that the same framework that addresses this hierarchy problem must also address the smallness problem of the cosmological constant. Specifically, we investigate the minimal supersymmetric (SUSY) extension of the Randall-Sundrum model where SUSY-breaking is induced on the TeV brane and transmitted into the bulk. We show that the Casimir energy density of the system indeed conforms with the observed dark energy scale.

  17. Parameters of reinforcement and response-class hierarchies.

    PubMed

    Beavers, Gracie A; Iwata, Brian A; Gregory, Meagan K

    2014-01-01

    Shabani, Carr, and Petursdottir (2009) examined the effects of a response-response relation (effort) on the development of a response-class hierarchy using a laboratory model. Response-reinforcer relations may have similar influences. Using a similar translational approach, we examined the effects of reinforcer rate, quality, delay, and magnitude in a series of separate experiments conducted with 8 individuals with intellectual disabilities. Response-class hierarchies emerged along the dimension of rate for 3 of 6 subjects, quality for 5 of 5 subjects, delay for 2 of 8 subjects, and magnitude for 5 of 6 subjects.

  18. Finite-band solutions of the coupled dispersionless hierarchy

    NASA Astrophysics Data System (ADS)

    Li, Zhu

    2016-08-01

    The coupled dispersionless hierarchy is derived with the help of the zero curvature equation. Based on the Lax matrix, we introduce an algebraic curve {{ K }}n of arithmetic genus n, from which we establish the corresponding meromorphic function ϕ, the Baker-Akhiezer function {\\varphi }1, and Dubrovin-type equations. The straightening out of all the flows is given under the Abel-Jacobi coordinates. Using the asymptotic properties of ϕ and {\\varphi }1, we obtain the explicit theta function representations of the meromorphic function ϕ, the Baker-Akhiezer function {\\varphi }1 and of solutions for the whole hierarchy.

  19. Collective cell migration: guidance principles and hierarchies.

    PubMed

    Haeger, Anna; Wolf, Katarina; Zegers, Mirjam M; Friedl, Peter

    2015-09-01

    Collective cell migration results from the establishment and maintenance of collective polarization, mechanocoupling, and cytoskeletal kinetics. The guidance of collective cell migration depends on a reciprocal process between cell-intrinsic multicellular organization with leader-follower cell behavior and results in mechanosensory integration of extracellular guidance cues. Important guidance mechanisms include chemotaxis, haptotaxis, durotaxis, and strain-induced mechanosensing to move cell groups along interfaces and paths of least resistance. Additional guidance mechanisms steering cell groups during specialized conditions comprise electrotaxis and passive drift. To form higher-order cell and tissue structures during morphogenesis and cancer invasion, these guidance principles act in parallel and are integrated for collective adaptation to and shaping of varying tissue environments. We review mechanochemical and electrical inputs and multiparameter signal integration underlying collective guidance, decision making, and outcome.

  20. Wireless Communications in Smart Grid

    NASA Astrophysics Data System (ADS)

    Bojkovic, Zoran; Bakmaz, Bojan

    Communication networks play a crucial role in smart grid, as the intelligence of this complex system is built based on information exchange across the power grid. Wireless communications and networking are among the most economical ways to build the essential part of the scalable communication infrastructure for smart grid. In particular, wireless networks will be deployed widely in the smart grid for automatic meter reading, remote system and customer site monitoring, as well as equipment fault diagnosing. With an increasing interest from both the academic and industrial communities, this chapter systematically investigates recent advances in wireless communication technology for the smart grid.

  1. A grid interfacing zonal algorithm for three-dimensional transonic flows about aircraft configurations

    NASA Astrophysics Data System (ADS)

    Atta, E. H.; Vadyak, J.

    An efficient grid interfacing zonal algorithm has been developed for computing the transonic flow field about three-dimensional multicomponent configurations. The algorithm uses the full-potential formulation and the fully-implicit approximate factorization scheme (AF2). The flow field solution is computed using a component adaptive grid approach in which separate grids are employed for the individual components in the multicomponent configuration, where each component grid is optimized for a particular geometry. The component grids are allowed to overlap, and flow field information is transmitted from one grid to another through the overlap region. An overlapped-grid scheme is implemented for a wing and a wing/pylon/nacelle configuration. Numerical results show that the present algorithm is stable, accurate, and can be used effectively to compute the flow field about complex configurations.

  2. TRMM Gridded Text Products

    NASA Technical Reports Server (NTRS)

    Stocker, Erich Franz

    2007-01-01

    NASA's Tropical Rainfall Measuring Mission (TRMM) has many products that contain instantaneous or gridded rain rates often among many other parameters. However, these products because of their completeness can often seem intimidating to users just desiring surface rain rates. For example one of the gridded monthly products contains well over 200 parameters. It is clear that if only rain rates are desired, this many parameters might prove intimidating. In addition, for many good reasons these products are archived and currently distributed in HDF format. This also can be an inhibiting factor in using TRMM rain rates. To provide a simple format and isolate just the rain rates from the many other parameters, the TRMM product created a series of gridded products in ASCII text format. This paper describes the various text rain rate products produced. It provides detailed information about parameters and how they are calculated. It also gives detailed format information. These products are used in a number of applications with the TRMM processing system. The products are produced from the swath instantaneous rain rates and contain information from the three major TRMM instruments: radar, radiometer, and combined. They are simple to use, human readable, and small for downloading.

  3. An Experimental Framework for Executing Applications in Dynamic Grid Environments

    NASA Technical Reports Server (NTRS)

    Huedo, Eduardo; Montero, Ruben S.; Llorente, Ignacio M.; Bushnell, Dennis M. (Technical Monitor)

    2002-01-01

    The Grid opens up opportunities for resource-starved scientists and engineers to harness highly distributed computing resources. A number of Grid middleware projects are currently available to support the simultaneous exploitation of heterogeneous resources distributed in different administrative domains. However, efficient job submission and management continue being far from accessible to ordinary scientists and engineers due to the dynamic and complex nature of the Grid. This report describes a new Globus framework that allows an easier and more efficient execution of jobs in a 'submit and forget' fashion. Adaptation to dynamic Grid conditions is achieved by supporting automatic application migration following performance degradation, 'better' resource discovery, requirement change, owner decision or remote resource failure. The report also includes experimental results of the behavior of our framework on the TRGP testbed.

  4. Smart grid as a service: a discussion on design issues.

    PubMed

    Chao, Hung-Lin; Tsai, Chen-Chou; Hsiung, Pao-Ann; Chou, I-Hsin

    2014-01-01

    Smart grid allows the integration of distributed renewable energy resources into the conventional electricity distribution power grid such that the goals of reduction in power cost and in environment pollution can be met through an intelligent and efficient matching between power generators and power loads. Currently, this rapidly developing infrastructure is not as "smart" as it should be because of the lack of a flexible, scalable, and adaptive structure. As a solution, this work proposes smart grid as a service (SGaaS), which not only allows a smart grid to be composed out of basic services, but also allows power users to choose between different services based on their own requirements. The two important issues of service-level agreements and composition of services are also addressed in this work. Finally, we give the details of how SGaaS can be implemented using a FIPA-compliant JADE multiagent system.

  5. Unlocking the potential of smart grid technologies with behavioral science

    PubMed Central

    Sintov, Nicole D.; Schultz, P. Wesley

    2015-01-01

    Smart grid systems aim to provide a more stable and adaptable electricity infrastructure, and to maximize energy efficiency. Grid-linked technologies vary widely in form and function, but generally share common potentials: to reduce energy consumption via efficiency and/or curtailment, to shift use to off-peak times of day, and to enable distributed storage and generation options. Although end users are central players in these systems, they are sometimes not central considerations in technology or program design, and in some cases, their motivations for participating in such systems are not fully appreciated. Behavioral science can be instrumental in engaging end-users and maximizing the impact of smart grid technologies. In this paper, we present emerging technologies made possible by a smart grid infrastructure, and for each we highlight ways in which behavioral science can be applied to enhance their impact on energy savings. PMID:25914666

  6. Unlocking the potential of smart grid technologies with behavioral science.

    PubMed

    Sintov, Nicole D; Schultz, P Wesley

    2015-01-01

    Smart grid systems aim to provide a more stable and adaptable electricity infrastructure, and to maximize energy efficiency. Grid-linked technologies vary widely in form and function, but generally share common potentials: to reduce energy consumption via efficiency and/or curtailment, to shift use to off-peak times of day, and to enable distributed storage and generation options. Although end users are central players in these systems, they are sometimes not central considerations in technology or program design, and in some cases, their motivations for participating in such systems are not fully appreciated. Behavioral science can be instrumental in engaging end-users and maximizing the impact of smart grid technologies. In this paper, we present emerging technologies made possible by a smart grid infrastructure, and for each we highlight ways in which behavioral science can be applied to enhance their impact on energy savings.

  7. Smart Grid as a Service: A Discussion on Design Issues

    PubMed Central

    Tsai, Chen-Chou; Chou, I-Hsin

    2014-01-01

    Smart grid allows the integration of distributed renewable energy resources into the conventional electricity distribution power grid such that the goals of reduction in power cost and in environment pollution can be met through an intelligent and efficient matching between power generators and power loads. Currently, this rapidly developing infrastructure is not as “smart” as it should be because of the lack of a flexible, scalable, and adaptive structure. As a solution, this work proposes smart grid as a service (SGaaS), which not only allows a smart grid to be composed out of basic services, but also allows power users to choose between different services based on their own requirements. The two important issues of service-level agreements and composition of services are also addressed in this work. Finally, we give the details of how SGaaS can be implemented using a FIPA-compliant JADE multiagent system. PMID:25243214

  8. Unlocking the potential of smart grid technologies with behavioral science

    SciTech Connect

    Sintov, Nicole D.; Schultz, P. Wesley

    2015-04-09

    Smart grid systems aim to provide a more stable and adaptable electricity infrastructure, and to maximize energy efficiency. Grid-linked technologies vary widely in form and function, but generally share common potentials: to reduce energy consumption via efficiency and/or curtailment, to shift use to off-peak times of day, and to enable distributed storage and generation options. Although end users are central players in these systems, they are sometimes not central considerations in technology or program design, and in some cases, their motivations for participating in such systems are not fully appreciated. Behavioral science can be instrumental in engaging end-users and maximizing the impact of smart grid technologies. In this study, we present emerging technologies made possible by a smart grid infrastructure, and for each we highlight ways in which behavioral science can be applied to enhance their impact on energy savings.

  9. Unlocking the potential of smart grid technologies with behavioral science

    DOE PAGES

    Sintov, Nicole D.; Schultz, P. Wesley

    2015-04-09

    Smart grid systems aim to provide a more stable and adaptable electricity infrastructure, and to maximize energy efficiency. Grid-linked technologies vary widely in form and function, but generally share common potentials: to reduce energy consumption via efficiency and/or curtailment, to shift use to off-peak times of day, and to enable distributed storage and generation options. Although end users are central players in these systems, they are sometimes not central considerations in technology or program design, and in some cases, their motivations for participating in such systems are not fully appreciated. Behavioral science can be instrumental in engaging end-users and maximizingmore » the impact of smart grid technologies. In this study, we present emerging technologies made possible by a smart grid infrastructure, and for each we highlight ways in which behavioral science can be applied to enhance their impact on energy savings.« less

  10. Block algebra in two-component BKP and D type Drinfeld-Sokolov hierarchies

    NASA Astrophysics Data System (ADS)

    Li, Chuanzhong; He, Jingsong

    2013-11-01

    We construct generalized additional symmetries of a two-component BKP hierarchy defined by two pseudo-differential Lax operators. These additional symmetry flows form a Block type algebra with some modified (or additional) terms because of a B type reduction condition of this integrable hierarchy. Further we show that the D type Drinfeld-Sokolov hierarchy, which is a reduction of the two-component BKP hierarchy, possess a complete Block type additional symmetry algebra. That D type Drinfeld-Sokolov hierarchy has a similar algebraic structure as the bigraded Toda hierarchy which is a differential-discrete integrable system.

  11. Fault tolerance in computational grids: perspectives, challenges, and issues.

    PubMed

    Haider, Sajjad; Nazir, Babar

    2016-01-01

    Computational grids are established with the intention of providing shared access to hardware and software based resources with special reference to increased computational capabilities. Fault tolerance is one of the most important issues faced by the computational grids. The main contribution of this survey is the creation of an extended classification of problems that incur in the computational grid environments. The proposed classification will help researchers, developers, and maintainers of grids to understand the types of issues to be anticipated. Moreover, different types of problems, such as omission, interaction, and timing related have been identified that need to be handled on various layers of the computational grid. In this survey, an analysis and examination is also performed pertaining to the fault tolerance and fault detection mechanisms. Our conclusion is that a dependable and reliable grid can only be established when more emphasis is on fault identification. Moreover, our survey reveals that adaptive and intelligent fault identification, and tolerance techniques can improve the dependability of grid working environments.

  12. Evidence for grid cells in a human memory network.

    PubMed

    Doeller, Christian F; Barry, Caswell; Burgess, Neil

    2010-02-04

    Grid cells in the entorhinal cortex of freely moving rats provide a strikingly periodic representation of self-location which is indicative of very specific computational mechanisms. However, the existence of grid cells in humans and their distribution throughout the brain are unknown. Here we show that the preferred firing directions of directionally modulated grid cells in rat entorhinal cortex are aligned with the grids, and that the spatial organization of grid-cell firing is more strongly apparent at faster than slower running speeds. Because the grids are also aligned with each other, we predicted a macroscopic signal visible to functional magnetic resonance imaging (fMRI) in humans. We then looked for this signal as participants explored a virtual reality environment, mimicking the rats' foraging task: fMRI activation and adaptation showing a speed-modulated six-fold rotational symmetry in running direction. The signal was found in a network of entorhinal/subicular, posterior and medial parietal, lateral temporal and medial prefrontal areas. The effect was strongest in right entorhinal cortex, and the coherence of the directional signal across entorhinal cortex correlated with spatial memory performance. Our study illustrates the potential power of combining single-unit electrophysiology with fMRI in systems neuroscience. Our results provide evidence for grid-cell-like representations in humans, and implicate a specific type of neural representation in a network of regions which supports spatial cognition and also autobiographical memory.

  13. Adaptive Vlasov Simulations of Intense Beams

    SciTech Connect

    Sonnendruecker, Eric; Gutnic, Michael; Haefele, Matthieu; Lemaire, Jean-Louis

    2005-06-08

    Most simulations of intense particle beams are performed nowadays using Particle In Cell (PIC) techniques. Direct grid based Vlasov methods have also been used but mostly for 1D simulations as they become very costly in higher dimensions when using uniform phase space grids. We have recently introduced adaptive mesh refinement techniques that allow us to automatically concentrate the grid points at places where the distribution function is varying most. In this paper we shall introduce this technique and show how it can be used to improve the efficiency of grid based Vlasov solvers.

  14. Constructing the ASCI computational grid

    SciTech Connect

    BEIRIGER,JUDY I.; BIVENS,HUGH P.; HUMPHREYS,STEVEN L.; JOHNSON,WILBUR R.; RHEA,RONALD E.

    2000-06-01

    The Accelerated Strategic Computing Initiative (ASCI) computational grid is being constructed to interconnect the high performance computing resources of the nuclear weapons complex. The grid will simplify access to the diverse computing, storage, network, and visualization resources, and will enable the coordinated use of shared resources regardless of location. To match existing hardware platforms, required security services, and current simulation practices, the Globus MetaComputing Toolkit was selected to provide core grid services. The ASCI grid extends Globus functionality by operating as an independent grid, incorporating Kerberos-based security, interfacing to Sandia's Cplant{trademark},and extending job monitoring services. To fully meet ASCI's needs, the architecture layers distributed work management and criteria-driven resource selection services on top of Globus. These services simplify the grid interface by allowing users to simply request ''run code X anywhere''. This paper describes the initial design and prototype of the ASCI grid.

  15. A grid to facilitate physics staffing justification.

    PubMed

    Klein, Eric E

    2009-12-03

    . The grid is easily adaptable when changes to the clinical environment change, such as an increase in IMRT or IGRT applications.

  16. GridTool: A surface modeling and grid generation tool

    NASA Technical Reports Server (NTRS)

    Samareh-Abolhassani, Jamshid

    1995-01-01

    GridTool is designed around the concept that the surface grids are generated on a set of bi-linear patches. This type of grid generation is quite easy to implement, and it avoids the problems associated with complex CAD surface representations and associated surface parameterizations. However, the resulting surface grids are close to but not on the original CAD surfaces. This problem can be alleviated by projecting the resulting surface grids onto the original CAD surfaces. GridTool is designed primary for unstructured grid generation systems. Currently, GridTool supports VGRID and FELISA systems, and it can be easily extended to support other unstructured grid generation systems. The data in GridTool is stored parametrically so that once the problem is set up, one can modify the surfaces and the entire set of points, curves and patches will be updated automatically. This is very useful in a multidisciplinary design and optimization process. GridTool is written entirely in ANSI 'C', the interface is based on the FORMS library, and the graphics is based on the GL library. The code has been tested successfully on IRIS workstations running IRIX4.0 and above. The memory is allocated dynamically, therefore, memory size will depend on the complexity of geometry/grid. GridTool data structure is based on a link-list structure which allows the required memory to expand and contract dynamically according to the user's data size and action. Data structure contains several types of objects such as points, curves, patches, sources and surfaces. At any given time, there is always an active object which is drawn in magenta, or in their highlighted colors as defined by the resource file which will be discussed later.

  17. Smart Grid Risk Management

    NASA Astrophysics Data System (ADS)

    Abad Lopez, Carlos Adrian

    Current electricity infrastructure is being stressed from several directions -- high demand, unreliable supply, extreme weather conditions, accidents, among others. Infrastructure planners have, traditionally, focused on only the cost of the system; today, resilience and sustainability are increasingly becoming more important. In this dissertation, we develop computational tools for efficiently managing electricity resources to help create a more reliable and sustainable electrical grid. The tools we present in this work will help electric utilities coordinate demand to allow the smooth and large scale integration of renewable sources of energy into traditional grids, as well as provide infrastructure planners and operators in developing countries a framework for making informed planning and control decisions in the presence of uncertainty. Demand-side management is considered as the most viable solution for maintaining grid stability as generation from intermittent renewable sources increases. Demand-side management, particularly demand response (DR) programs that attempt to alter the energy consumption of customers either by using price-based incentives or up-front power interruption contracts, is more cost-effective and sustainable in addressing short-term supply-demand imbalances when compared with the alternative that involves increasing fossil fuel-based fast spinning reserves. An essential step in compensating participating customers and benchmarking the effectiveness of DR programs is to be able to independently detect the load reduction from observed meter data. Electric utilities implementing automated DR programs through direct load control switches are also interested in detecting the reduction in demand to efficiently pinpoint non-functioning devices to reduce maintenance costs. We develop sparse optimization methods for detecting a small change in the demand for electricity of a customer in response to a price change or signal from the utility

  18. A grid job monitoring system

    SciTech Connect

    Dumitrescu, Catalin; Nowack, Andreas; Padhi, Sanjay; Sarkar, Subir; /INFN, Pisa /Pisa, Scuola Normale Superiore

    2010-01-01

    This paper presents a web-based Job Monitoring framework for individual Grid sites that allows users to follow in detail their jobs in quasi-real time. The framework consists of several independent components: (a) a set of sensors that run on the site CE and worker nodes and update a database, (b) a simple yet extensible web services framework and (c) an Ajax powered web interface having a look-and-feel and control similar to a desktop application. The monitoring framework supports LSF, Condor and PBS-like batch systems. This is one of the first monitoring systems where an X.509 authenticated web interface can be seamlessly accessed by both end-users and site administrators. While a site administrator has access to all the possible information, a user can only view the jobs for the Virtual Organizations (VO) he/she is a part of. The monitoring framework design supports several possible deployment scenarios. For a site running a supported batch system, the system may be deployed as a whole, or existing site sensors can be adapted and reused with the web services components. A site may even prefer to build the web server independently and choose to use only the Ajax powered web interface. Finally, the system is being used to monitor a glideinWMS instance. This broadens the scope significantly, allowing it to monitor jobs over multiple sites.

  19. A Grid job monitoring system

    NASA Astrophysics Data System (ADS)

    Dumitrescu, Catalin; Nowack, Andreas; Padhi, Sanjay; Sarkar, Subir

    2010-04-01

    This paper presents a web-based Job Monitoring framework for individual Grid sites that allows users to follow in detail their jobs in quasi-real time. The framework consists of several independent components : (a) a set of sensors that run on the site CE and worker nodes and update a database, (b) a simple yet extensible web services framework and (c) an Ajax powered web interface having a look-and-feel and control similar to a desktop application. The monitoring framework supports LSF, Condor and PBS-like batch systems. This is one of the first monitoring systems where an X.509 authenticated web interface can be seamlessly accessed by both end-users and site administrators. While a site administrator has access to all the possible information, a user can only view the jobs for the Virtual Organizations (VO) he/she is a part of. The monitoring framework design supports several possible deployment scenarios. For a site running a supported batch system, the system may be deployed as a whole, or existing site sensors can be adapted and reused with the web services components. A site may even prefer to build the web server independently and choose to use only the Ajax powered web interface. Finally, the system is being used to monitor a glideinWMS instance. This broadens the scope significantly, allowing it to monitor jobs over multiple sites.

  20. Patched based methods for adaptive mesh refinement solutions of partial differential equations

    SciTech Connect

    Saltzman, J.

    1997-09-02

    This manuscript contains the lecture notes for a course taught from July 7th through July 11th at the 1997 Numerical Analysis Summer School sponsored by C.E.A., I.N.R.I.A., and E.D.F. The subject area was chosen to support the general theme of that year`s school which is ``Multiscale Methods and Wavelets in Numerical Simulation.`` The first topic covered in these notes is a description of the problem domain. This coverage is limited to classical PDEs with a heavier emphasis on hyperbolic systems and constrained hyperbolic systems. The next topic is difference schemes. These schemes are the foundation for the adaptive methods. After the background material is covered, attention is focused on a simple patched based adaptive algorithm and its associated data structures for square grids and hyperbolic conservation laws. Embellishments include curvilinear meshes, embedded boundary and overset meshes. Next, several strategies for parallel implementations are examined. The remainder of the notes contains descriptions of elliptic solutions on the mesh hierarchy, elliptically constrained flow solution methods and elliptically constrained flow solution methods with diffusion.