Search NASA⌕ Search

SEARCH · Search NASA

Results for “vector programs”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 163 records · Page 9

Minimax terminal approach problem in two-level hierarchical nonlinear discrete-time dynamical system

We consider a discrete–time dynamical system consisting of three controllable objects. The motions of all objects are given by the corresponding vector nonlinear or linear discrete–time recurrent vector relations, and control system for its has two levels: basic (first or I level) that is dominating and subordinate level (second or II level) and both have different criterions of functioning and united a priori by determined informational and control connections defined in advance. For the dynamical system in question, we propose a mathematical formalization in the form of solving a multistep problem of two-level hierarchical minimax program control over the terminal approach process with incomplete information and give a general scheme for its solving.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Development and Test of a 1,000 Level 3C Fiber Optic Borehole Seismic Receiver Array Applied to Carbon Sequestration

To address the critical site characterization and monitoring needs for CCS programs, US Department of Energy (DOE) awarded Paulsson, Inc. in 2010 a contract to design, build and test a fiber optic based ultra-large bandwidth clamped borehole seismic vector array capable of deploying up to one thousand 3C sensor pods suitable for deployment into high temperature and high pressure boreholes. Paulsson, Inc. has completed a design or a unique borehole seismic system consisting of a novel drill pipe based deployment system that includes a hydraulic clamping mechanism for the sensor pods, a new sensor pod design and most important – a unique fiber optic seismic vector sensor with technical specifications and capabilities that far exceed the state of the art seismic sensor technologies. These novel technologies were all applied to the new borehole seismic system. In combination these technologies will allow for the deployment of up to 1,000 3C sensor pods in vertical, deviated or horizontal wells. Laboratory tests of the fiber optic seismic vector sensors developed during this project have shown that the new borehole seismic sensor technology is capable of generating outstanding high vector fidelity data with extremely large bandwidth: 0.01 – 6,000 Hz. Field tests have shown that the system can record events at magnitudes much smaller than M-2.3 at frequencies up to 2,000 Hz. The sensors have also proved to be about 100 times more sensitive than the regular coil geophones that are used in borehole seismic systems today. The fiber optic seismic sensors have furthermore been qualified to operate at temperatures over 300°C (572°F). The fibers used for the seismic sensors in the system are used to record Distributed Temperature Sensor (DTS) data allowing additional value added data to be recorded simultaneously with the seismic vector sensor data.

01 COAL, LIGNITE, AND PEAT↗

VTK-m User's Guide (V.1.6)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures.

97 MATHEMATICS AND COMPUTING↗

VTK-m User's' Guide (V.1.7)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction. VTK-m simplifies the development of parallel scientific visualization algorithms by providing a framework of supporting functionality that allows developers to focus on visualization operations. Consider the listings in Figure 1.1 that compares the size of the implementation for the Marching Cubes algorithm in VTK-m with the equivalent reference implementation in the CUDA software development kit. Because VTK-m internally manages the parallel distribution of work and data, the VTK-m implementation is shorter and easier to maintain. Additionally, VTK-m provides data abstractions not provided by other libraries that make code written in VTK-m more versatile.This book includes contributions from the VTK-m community including the VTK-m development team and the user community.

97 MATHEMATICS AND COMPUTING↗

The VTK-m Users' Guide (V.1.9)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction. VTK-m simplifies the development of parallel scientific visualization algorithms by providing a framework of supporting functionality that allows developers to focus on visualization operations. Consider the listings in Figure 1.1 that compares the size of the implementation for the Marching Cubes algorithm in VTK-m with the equivalent reference implementation in the CUDA software development kit. Because VTK-m internally manages the parallel distribution of work and data, the VTK-m implementation is shorter and easier to maintain. Additionally, VTK-m provides data abstractions not provided by other libraries that make code written in VTK-m more versatile.

97 MATHEMATICS AND COMPUTING↗

The VTK-m Users' Guide (V.2.0)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction. VTK-m simplifies the development of parallel scientific visualization algorithms by providing a framework of supporting functionality that allows developers to focus on visualization operations. Consider the listings in Figure 1.1 that compares the size of the implementation for the Marching Cubes algorithm in VTK-m with the equivalent reference implementation in the CUDA software development kit. Because VTK-m internally manages the parallel distribution of work and data, the VTK-m implementation is shorter and easier to maintain. Additionally, VTK-m provides data abstractions not provided by other libraries that make code written in VTK-m more versatile.

97 MATHEMATICS AND COMPUTING↗

The VTK-m User's Guide (V. 2.2)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created VTK-m: the visualization toolkit for multi-/many-core architectures. VTK-m supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. VTK-m also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although VTK-m provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗

The Viskores User's Guide (V.1.0)

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created Viskores: the visualization toolkit for multi-/many-core architectures. Viskores supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. Viskores also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although Viskores provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗

The Viskores User's Guide, Release 1.1

High-performance computing relies on ever finer threading. Advances in processor technology include ever greater numbers of cores, hyperthreading, accelerators with integrated blocks of cores, and special vectorized instructions, all of which require more software parallelism to achieve peak performance. Traditional visualization solutions cannot support this extreme level of concurrency. Extreme scale systems require a new programming model and a fundamental change in how we design algorithms. To address these issues we created Viskores: the visualization toolkit for multi/many-core architectures. Viskores supports a number of algorithms and the ability to design further algorithms through a top-down design with an emphasis on extreme parallelism. Viskores also provides support for finding and building links across topologies, making it possible to perform operations that determine manifold surfaces, interpolate generated values, and find adjacencies. Although Viskores provides a simplified high-level interface for programming, its template-based code removes the overhead of abstraction.

97 MATHEMATICS AND COMPUTING↗

Piperitone ( p -Menth-1-En-3-One): A New Repellent for Tea Shot Hole Borer (Coleoptera: Curculionidae) in Florida Avocado Groves

The tea shot hole borer, Euwallacea perbrevis, has been recently established in Florida, USA, where it vectors fungal pathogens that cause Fusarium dieback in avocado. Pest monitoring uses a two-component lure containing quercivorol and α-copaene. Incorporation of a repellent into IPM programs may reduce the incidence of dieback in avocado groves, particularly if combined with lures in a push–pull system. This study evaluated piperitone and α-farnesene as potential repellents for E. perbrevis, comparing their efficacy to that of verbenone. Replicate 12-week field tests were conducted in commercial avocado groves. Each test compared beetle captures in traps baited with two-component lures versus captures in traps containing lures plus repellent. To complement field trials, Super-Q collections followed by GC analyses were performed to quantify emissions from repellent dispensers field-aged for 12 weeks. Electroantennography (EAG) was also used to measure beetle olfactory response to each repellent. Results indicated that α-farnesene was ineffective; however, piperitone and verbenone were comparable in repellency, achieving 50–70% reduction in captures, with longevity of 10–12 weeks. EAG responses to piperitone and verbenone were equivalent, and significantly greater than response to α-farnesene. Since piperitone is less expensive than verbenone, this study identifies a potential new E. perbrevis repellent.

59 BASIC BIOLOGICAL SCIENCES↗

Naturally occurring 32 Si and low-background silicon dark matter detectors

The naturally occurring radioisotope Si-32 represents a potentially limiting background in future dark matter direct-detection experiments. We investigate sources of Si-32 and the vectors by which it comes to reside in silicon crystals used for fabrication of radiation detectors. We infer that the Si-32 concentration in commercial single-crystal silicon is likely variable, dependent upon the specific geologic and hydrologic history of the source (or sources) of silicon “ore” and the details of the silicon-refinement process. The silicon production industry is large, highly segmented by refining step, and multifaceted in terms of final product type, from which we conclude that production of Si-32-mitigated crystals requires both targeted silicon material selection and a dedicated refinement-through-crystal-production process. We review options for source material selection, including quartz from an underground source and silicon isotopically reduced in Si-32. To quantitatively evaluate the Si-32 content in silicon metal and precursor materials, we propose analytic methods employing chemical processing and radiometric measurements. Ultimately, it appears feasible to produce silicon-based detectors with low levels of Si-32, though significant assay method development is required to validate this claim and thereby enable a quality assurance program during an actual controlled silicon-detector production cycle.

assay↗

Gravity, two times, tractors, Weyl invariance, and six-dimensional quantum mechanics

Fefferman and Graham showed some time ago that four-dimensional conformal geometries could be analyzed in terms of six-dimensional, ambient, Riemannian geometries admitting a closed homothety. Recently, it was shown how conformal geometry provides a description of physics manifestly invariant under local choices of unit systems. Strikingly, Einstein's equations are then equivalent to the existence of a parallel scale tractor (a six-component vector subject to a certain first order covariant constancy condition at every point in four-dimensional spacetime). These results suggest a six-dimensional description of four-dimensional physics, a viewpoint promulgated by the 2 times physics program of Bars. The Fefferman-Graham construction relies on a triplet of operators corresponding, respectively, to a curved six-dimensional light cone, the dilation generator and the Laplacian. These form an sp(2) algebra which Bars employs as a first class algebra of constraints in a six-dimensional gauge theory. In this article four-dimensional gravity is recast in terms of six-dimensional quantum mechanics by melding the 2 times and tractor approaches. This parent formulation of gravity is built from an infinite set of six-dimensional fields. Successively integrating out these fields yields various novel descriptions of gravity including a new four-dimensional one built from a scalar doublet, a tractor-vector multiplet and a conformal class of metrics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Minimax approach problem with incomplete information for the two-level hierarchical discrete-time dynamical system

We consider a discrete-time dynamical system consisting of three controllable objects. The motions of all objects are given by the corresponding vector linear or convex discrete-time recurrent vector relations, and control system for its has two levels: basic (first or I level) that is dominating and subordinate level (second or II level) and both have different criterions of functioning and united a priori by determined informational and control connections defined in advance. For the dynamical system in question, we propose a mathematical formalization in the form of solving a multistep problem of two-level hierarchical minimax program control over the terminal approach process with incomplete information and give a general scheme for its solution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Recent advances and future prospects for Monte Carlo

The history of Monte Carlo methods is closely linked to that of computers: The first known Monte Carlo program was written in 1947 for the ENIAC; a pre-release of the first Fortran compiler was used for Monte Carlo In 1957; Monte Carlo codes were adapted to vector computers in the 1980s, clusters and parallel computers in the 1990s, and teraflop systems in the 2000s. Recent advances include hierarchical parallelism, combining threaded calculations on multicore processors with message-passing among different nodes. With the advances In computmg, Monte Carlo codes have evolved with new capabilities and new ways of use. Production codes such as MCNP, MVP, MONK, TRIPOLI and SCALE are now 20-30 years old (or more) and are very rich in advanced featUres. The former 'method of last resort' has now become the first choice for many applications. Calculations are now routinely performed on office computers, not just on supercomputers. Current research and development efforts are investigating the use of Monte Carlo methods on FPGAs. GPUs, and many-core processors. Other far-reaching research is exploring ways to adapt Monte Carlo methods to future exaflop systems that may have 1M or more concurrent computational processes.

99 GENERAL AND MISCELLANEOUS↗

Recent Results in Parity-Violating Electron Scattering at Jefferson Lab: PREX and HAPPEX-III

The parity-violating asymmetry APV in electron scattering from the 208Pb nucleus is cleanly sensitive to the neutron radius Rn. A precision measurement of Rn would have important implications for the understanding of nuclear structure, and be a powerful constaint on the symmetry energy Sν(n) of neutron-rich nuclear matter, including neutron stars. The PREX collaboration has completed a first run, measuring Rn to a precision of ~2.5\%. The measurement of APV in electron-proton scattering is sensitive to vector form-factors associated with an intrinsic strange quark content of the nucleon. While at one time such contributions were considered to be potentially large, a world-wide program of parity-violation measurements has constrained these form-factors to be smaller than a few percent of the electric and magnetic form-factors of the proton at low momentum-transfer. HAPPEX-III has recently completed a measurement to improve the precision of this constaint at Q2~0.6GeV2, a region in which previous experiments had indicated the possibility of intriguingly large strange contributions. Results from each experiment, and prospects for more precise Rn measurements, will be discussed.

Paschke, Kent↗

A family of second-order fully explicit time integration schemes

A new family of fully explicit time integration methods is proposed, which has second-order accuracy for structures with and without damping. Using a diagonal mass matrix, the suggested scheme remains fully explicit not only for structures with a non-diagonal damping matrix, but also when the internal force vector is a nonlinear function of velocity. The present algorithm has an acceptable domain of stability, and it is self-starting. This technique introduces effectively numerical dissipation to suppress the high-frequency spurious modes, while at the same time the lower modes are not affected too much. In addition, numerical dispersion error of the scheme is considerably smaller than that of the central difference method. Solving several linear and nonlinear problems highlights the superior performance of the authors’ approach. Findings demonstrate that solution time for the suggested scheme is much less than that of the central difference technique. The related algorithm can be easily implemented into programs, which already contain the central difference method.

97 MATHEMATICS AND COMPUTING↗

AETHER: A simulation platform for inductively coupled plasma

An in-house code is developed to simulate the inductively coupled plasma (ICP). The model comprises the fluid, electromagnetic and transformer submodels. Fluid equations are solved to evaluate the plasma flow parameters, including the plasma and neutral densities, ion and neutral velocities, electron flux, electron temperature, and electric potential. The model relies on the ambipolar approximation and offers the evaluation of plasma parameters without solving the sheath region. The electromagnetic model handles the calculation of the electric and magnetic fields using the magnetic vector potential. The transformer model captures the effect of the matching circuit utilized in laboratory experiments for RF power deposition. The continuity and momentum equations are solved using finite volume method. The energy, electric potential, and magnetic vector potential equations are solved using finite difference method. The resulting linear systems of equations are solved with iterative solvers including Jacobi and GMRES. The code is written using the C++ programming language, it works in parallel and has graphical user interface. The model is applied to study ICP characteristics of a plasma confined within a cylindrical chamber with dielectric walls for two different power deposition cases. The results obtained from the developed model are verified using the plasma module of COMSOL Multiphysics. The model is also applied to a plasma source configuration, and it is demonstrated that there is an overall increase in the plasma potential when current is extracted from ICP with a biased wall electrode.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Ionizing radiation effects in SONOS-based neuromorphic inference accelerators

Here, we evaluate the sensitivity of neuromorphic inference accelerators based on Silicon-Oxide-Nitride-Oxide-Silicon (SONOS) charge trap memory arrays to total ionizing dose (TID) effects. Data retention statistics were collected for 16 Mbit of 40 nm SONOS digital memory exposed to ionizing radiation from a Co-60 source, showing good retention of the bits up to the maximum dose of 500 krad(Si). Using this data, we formulate a rate-equation-based model for the TID response of trapped charge carriers in the ONO stack, and predict the effect of TID on intermediate device states between ‘program’ and ‘erase’. This model is then used to simulate arrays of low-power, analog SONOS devices that store 8-bit neural network weights and support in situ matrix-vector multiplication. We evaluate the accuracy of the irradiated SONOS-based inference accelerator on two image recognition tasks – CIFAR-10 and the challenging ImageNet dataset – using state-of-the-art convolutional neural networks, such as ResNet-50. We find that across the datasets and neural networks evaluated, the accelerator tolerates a maximum TID between 10 krad(Si) and 100 krad(Si), with deeper networks being more susceptible to accuracy losses due to TID.

43 PARTICLE ACCELERATORS↗