Publications

Results 9926–9950 of 9,998
Skip to search filters

Peer Review Process for the Sandia ASCI V and V Program: Version 1.0

Pilch, Martin P.; Trucano, Timothy G.; Peercy, David E.; Hodges, Ann L.; Young, Eunice R.; Moya, Jaime L.; Trucano, Timothy G.

This report describes the initial definition of the Verification and Validation (V and V) Plan Peer Review Process at Sandia National Laboratories. V and V peer review at Sandia is intended to assess the ASCI code team V and V planning process and execution. Our peer review definition is designed to assess the V and V planning process in terms of the content specified by the Sandia Guidelines for V and V plans. Therefore, the peer review process and process for improving the Guidelines are necessarily synchronized, and form parts of a larger quality improvement process supporting the ASCI V and V program at Sandia.

More Details

Hexahedral Mesh Untangling

Engineering with Computers

Knupp, Patrick K.

We investigate a well-motivated mesh untangling objective function whose optimization automatically produces non-inverted elements when possible. Examples show the procedure is highly effective on simplicial meshes and on non-simplicial (e.g., hexahedral) meshes constructed via mapping or sweeping algorithms. The current whisker-weaving (WW) algorithm in CUBIT usually produces hexahedral meshes that are unsuitable for analyses due to inverted elements. The majority of these meshes cannot be untangled using the new objective function. The most likely source of the difficulty is poor mesh topology.

More Details

The Xyce Parallel Electronic Simulator - An Overview

Hutchinson, Scott A.; Keiter, Eric R.; Hoekstra, Robert J.; Watts, Herman A.; Waters, Lon J.; Schells, Regina L.; Wix, Steven D.

The Xyce{trademark} Parallel Electronic Simulator has been written to support the simulation needs of the Sandia National Laboratories electrical designers. As such, the development has focused on providing the capability to solve extremely large circuit problems by supporting large-scale parallel computing platforms (up to thousands of processors). In addition, they are providing improved performance for numerical kernels using state-of-the-art algorithms, support for modeling circuit phenomena at a variety of abstraction levels and using object-oriented and modern coding-practices that ensure the code will be maintainable and extensible far into the future. The code is a parallel code in the most general sense of the phrase--a message passing parallel implementation--which allows it to run efficiently on the widest possible number of computing platforms. These include serial, shared-memory and distributed-memory parallel as well as heterogeneous platforms. Furthermore, careful attention has been paid to the specific nature of circuit-simulation problems to ensure that optimal parallel efficiency is achieved even as the number of processors grows.

More Details

Aspen-EE: An Agent-Based Model of Infrastructure Interdependency

Barton, Dianne C.; Eidson, Eric D.; Schoenwald, David A.; Stamber, Kevin L.; Reinert, Rhonda K.

This report describes the features of Aspen-EE (Electricity Enhancement), a new model for simulating the interdependent effects of market decisions and disruptions in the electric power system on other critical infrastructures in the US economy. Aspen-EE extends and modifies the capabilities of Aspen, an agent-based model previously developed by Sandia National Laboratories. Aspen-EE was tested on a series of scenarios in which the rules governing electric power trades were changed. Analysis of the scenario results indicates that the power generation company agents will adjust the quantity of power bid into each market as a function of the market rules. Results indicate that when two power markets are faced with identical economic circumstances, the traditionally higher-priced market sees its market clearing price decline, while the traditionally lower-priced market sees a relative increase in market clearing price. These results indicate that Aspen-EE is predicting power market trends that are consistent with expected economic behavior.

More Details

PICO: An Object-Oriented Framework for Branch and Bound

Hart, William E.; Phillips, Cynthia A.; Phillips, Cynthia A.

This report describes the design of PICO, a C++ framework for implementing general parallel branch-and-bound algorithms. The PICO framework provides a mechanism for the efficient implementation of a wide range of branch-and-bound methods on an equally wide range of parallel computing platforms. We first discuss the basic architecture of PICO, including the application class hierarchy and the package's serial and parallel layers. We next describe the design of the serial layer, and its central notion of manipulating subproblem states. Then, we discuss the design of the parallel layer, which includes flexible processor clustering and communication rates, various load balancing mechanisms, and a non-preemptive task scheduler running on each processor. We describe the application of the package to a branch-and-bound method for mixed integer programming, along with computational results on the ASCI Red massively parallel computer. Finally we describe the application of the branch-and-bound mixed-integer programming code to a resource constrained project scheduling problem for Pantex.

More Details

ATR2000 Mercury/MPI Real-Time ATR System User's Guide

Meyer, Richard H.; Doerfler, Douglas W.

The Air Force's Electronic Systems Center has funded Sandia National Laboratories to develop an Automatic Target Recognition (ATR) System for the Air Force's Joint STARS platform using Mercury Computer systems hardware. This report provides general theory on the internal operations of the Real-Time ATR system and provides some basic techniques that can be used to reconfigure the system and monitor its runtime operation. In addition, general information on how to interface an image formation processor and a human machine interface to the ATR is provided. This report is not meant to be a tutorial on the ATR algorithms.

More Details

Visualization of Information Spaces with VxInsight

Wylie, Brian N.; Boyack, Kevin W.; Davidson, George S.

VxInsight provides a visual mechanism for browsing, exploring and retrieving information from a database. The graphical display conveys information about the relationship between objects in several ways and on multiple scales. In this way, individual objects are always observed within a larger context. For example, consider a database consisting of a set of scientific papers. Imagine that the papers have been organized in a two dimensional geometry so that related papers are located close to each other. Now construct a landscape where the altitude reflects the local density of papers. Papers on physics will form a mountain range, and a different range will stand over the biological papers. In between will be research reports from biophysics and other bridging disciplines. Now, imagine exploring these mountains. If we zoom in closer, the physics mountains will resolve into a set of sub-disciplines. Eventually, by zooming in far enough, the individual papers become visible. By pointing and clicking you can learn more about papers of interest or retrieve their full text. Although physical proximity conveys a great deal of information about the relationship between documents, you can also see which papers reference which others, by drawing lines between the citing and cited papers. For even more information, you can choose to highlight papers by a particular researcher or a particular institution, or show the accumulation of papers through time, watching some disciplines explode and other stagnate. VxInsight is a general purpose tool, which enables this kind of interaction with wide variety of relational data: documents, patents, web pages, and financial transactions are just a few examples. The tool allows users to interactively browse, explore and retrieve information from the database in an intuitive way.

More Details

What makes a beam shaping problem difficult

Proceedings of SPIE - The International Society for Optical Engineering

Romero, L.A.; Dickey, Fred M.

The three most important factors effecting the difficulty of a beam shaping problems were discussed. These factors were scaling, smoothness, and coherence. Algorithms were developed to counteract these factors encountered in the design of any beam shaping system.

More Details

Failure analysis of tungsten coated polysilicon micromachined microengines

Proceedings of SPIE - The International Society for Optical Engineering

Walraven, J.A.; Mani, Seethambal S.; Fleming, J.G.; Headley, Thomas J.; Kotula, Paul G.; Pimentel, Alejandro A.; Rye, Michael J.; Tanner, Danelle M.; Smith, Norman F.

Failure analysis (FA) tools have been applied to analyze tungsten coated polysilicon microengines. These devices were stressed under accelerated conditions at ambient temperatures and pressure. Preliminary results illustrating the failure modes of microengines operated under variable humidity and ultra-high drive frequency will also be shown. Analysis of tungsten coated microengines revealed the absence of wear debris in microengines operated under ambient conditions. Plan view imaging of these microengines using scanning electron microscopy (SEM) revealed no accumulation of wear debris on the surface of the gears or ground plane on microengines operated under standard laboratory conditions. Friction bearing surfaces were exposed and analyzed using the focused ion beam (FIB). These cross sections revealed no accumulation of debris along friction bearing surfaces. By using transmission electron microscopy (TEM) in conjunction with electron energy loss spectroscopy (EELS), we were able to identify the thickness, elemental analysis, and crystallographic properties of tungsten coated MEMS devices. Atomic force microscopy was also utilized to analyze the surface roughness of friction bearing surfaces.

More Details

The Consistent Kinetics Porosity (CKP) Model: A Theory for the Mechanical Behavior of Moderately Porous Solids

Brannon, Rebecca M.

A theory is developed for the response of moderately porous solids (no more than {approximately}20% void space) to high-strain-rate deformations. The model is consistent because each feature is incorporated in a manner that is mathematically compatible with the other features. Unlike simple p-{alpha} models, the onset of pore collapse depends on the amount of shear present. The user-specifiable yield function depends on pressure, effective shear stress, and porosity. The elastic part of the strain rate is linearly related to the stress rate, with nonlinear corrections from changes in the elastic moduli due to pore collapse. Plastically incompressible flow of the matrix material allows pore collapse and an associated macroscopic plastic volume change. The plastic strain rate due to pore collapse/growth is taken normal to the yield surface. If phase transformation and/or pore nucleation are simultaneously occurring, the inelastic strain rate will be non-normal to the yield surface. To permit hardening, the yield stress of matrix material is treated as an internal state variable. Changes in porosity and matrix yield stress naturally cause the yield surface to evolve. The stress, porosity, and all other state variables vary in a consistent manner so that the stress remains on the yield surface throughout any quasistatic interval of plastic deformation. Dynamic loading allows the stress to exceed the yield surface via an overstress ordinary differential equation that is solved in closed form for better numerical accuracy. The part of the stress rate that causes no plastic work (i.e-, the part that has a zero inner product with the stress deviator and the identity tensor) is given by the projection of the elastic stressrate orthogonal to the span of the stress deviator and the identity tensor.The model, which has been numerically implemented in MIG format, has been exercised under a wide array of extremal loading and unloading paths. As will be discussed in a companion sequel report, the CKP model is capable of closely matching plate impact measurements for porous materials.

More Details

VFLOW2D - A Vorte-Based Code for Computing Flow Over Elastically Supported Tubes and Tube Arrays

Wolfe, Walter P.; Strickland, James H.; Homicz, Gregory F.; Gossler, A.A.

A numerical flow model is developed to simulate two-dimensional fluid flow past immersed, elastically supported tube arrays. This work is motivated by the objective of predicting forces and motion associated with both deep-water drilling and production risers in the oil industry. This work has other engineering applications including simulation of flow past tubular heat exchangers or submarine-towed sensor arrays and the flow about parachute ribbons. In the present work, a vortex method is used for solving the unsteady flow field. This method demonstrates inherent advantages over more conventional grid-based computational fluid dynamics. The vortex method is non-iterative, does not require artificial viscosity for stability, displays minimal numerical diffusion, can easily treat moving boundaries, and allows a greatly reduced computational domain since vorticity occupies only a small fraction of the fluid volume. A gridless approach is used in the flow sufficiently distant from surfaces. A Lagrangian remap scheme is used near surfaces to calculate diffusion and convection of vorticity. A fast multipole technique is utilized for efficient calculation of velocity from the vorticity field. The ability of the method to correctly predict lift and drag forces on simple stationary geometries over a broad range of Reynolds numbers is presented.

More Details

Digitally Marking RSA Moduli

Johnston, Anna M.

The moduli used in RSA (see [5]) can be generated by many different sources. The generator of that modulus (assuming a single entity generates the modulus) knows its factorization. They would have the ability to forge signatures or break any system based on this moduli. If a moduli and the RSA parameters associated with it were generated by a reputable source, the system would have higher value than if the parameters were generated by an unknown entity. So for tracking, security, confidence and financial reasons it would be beneficial to know who the generator of the RSA modulus was. This is where digital marking comes in. An RSA modulus ia digitally marked, or digitally trade marked, if the generator and other identifying features of the modulus (such as its intended user, the version number, etc.) can be identified and possibly verified by the modulus itself. The basic concept of digitally marking an RSA modulus would be to fix the upper bits of the modulus to this tag. Thus anyone who sees the public modulus can tell who generated the modulus and who the generator believes the intended user/owner of the modulus is.

More Details

Methods for Multisweep Automation

Shepherd, Jason F.; Mitchell, Scott A.; Knupp, Patrick K.; Mitchell, Scott A.

Sweeping has become the workhorse algorithm for creating conforming hexahedral meshes of complex models. This paper describes progress on the automatic, robust generation of MultiSwept meshes in CUBIT. MultiSweeping extends the class of volumes that may be swept to include those with multiple source and multiple target surfaces. While not yet perfect, CUBIT's MultiSweeping has recently become more reliable, and been extended to assemblies of volumes. Sweep Forging automates the process of making a volume (multi) sweepable: Sweep Verification takes the given source and target surfaces, and automatically classifies curve and vertex types so that sweep layers are well formed and progress from sources to targets.

More Details

Automatic scheme selection for toolkit hex meshing

International Journal for Numerical Methods in Engineering

White, David R.; Tautges, Timothy J.

Current hexahedral mesh generation techniques rely on a set of meshing tools, which when combined with geometry decomposition leads to an adequate mesh generation process. Of these tools, sweeping tends to be the workhorse algorithm, accounting for at least 50 per cent of most meshing applications. Constraints which must be met for a volume to be sweepable are derived, and it is proven that these constraints are necessary but not sufficient conditions for sweepability. This paper also describes a new algorithm for detecting extruded or sweepable geometries. This algorithm, based on these constraints, uses topological and local geometric information, and is more robust than feature recognition-based algorithms. A method for computing sweep dependencies in volume assemblies is also given. The auto sweep detect and sweep grouping algorithms have been used to reduce interactive user time required to generate all-hexahedral meshes by filtering out non-sweepable volumes needing further decomposition and by allowing concurrent meshing of independent sweep groups. Parts of the auto sweep detect algorithm have also been used to identify independent sweep paths, for use in volume-based interval assignment. Published in 2000 by John Wiley & Sons, Ltd.

More Details

Massively Parallel Direct Simulation of Multiphase Flow

Cook, Benjamin K.; Preece, Dale S.

The authors understanding of multiphase physics and the associated predictive capability for multi-phase systems are severely limited by current continuum modeling methods and experimental approaches. This research will deliver an unprecedented modeling capability to directly simulate three-dimensional multi-phase systems at the particle-scale. The model solves the fully coupled equations of motion governing the fluid phase and the individual particles comprising the solid phase using a newly discovered, highly efficient coupled numerical method based on the discrete-element method and the Lattice-Boltzmann method. A massively parallel implementation will enable the solution of large, physically realistic systems.

More Details
Results 9926–9950 of 9,998
Results 9926–9950 of 9,998