Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mathematics of arrays”

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 271 records · Page 15

Examination of New Theory for Neutron Multiplicity Counting of Non-Point-Like Sources of Special Nuclear Material

The purpose of a nondestructive assay is to accurately verify the declared mass of special nuclear material (SNM) samples in a limited amount of time. One measurement modality is neutron multiplicity counting (NMC), which relates time-correlated neutron detection rates to the mass of SNM present. Traditional theory assumes point-like sources, which can be ill-posed for kilogram-quantity, bulk samples. Recent theory was developed to improve NMC accuracy for non-point-like samples. This work preliminarily examines the theory with measured data. The OSCAR prototype (a 3-by-4 array of 5.08-cm-thick, 5.08-cm-diameter trans-stilbene organic scintillators) measures configurations of 29.41-49.00 kg of highly enriched uranium (93wt% 235 U). Adjusted factorial moments for the emitted neutron multiplicity distributions are used to account for the shape and type of SNM being measured.

252Cf↗

Mathematical model of the current density for the 30-cm engineering model thruster

Mathematical models are presented for both the singly and doubly charged ion current densities downstream of the 30-cm engineering model thruster with 0.5% compensated dished grids. These models are based on the experimental measurements of Vahrenkamp at a 2-amp ion beam operating condition. The cylindrically symmetric beam of constant velocity ions is modeled with continuous radial source and focusing functions across 'plane' grids with similar angular distribution functions. A computer program is used to evaluate the double integral for current densities in the near field and to obtain a far field approximation beyond 10 grid radii. The utility of the model is demonstrated for (1) calculating the directed thrust and (2) determining the impingement levels on various spacecraft surfaces from a two-axis gimballed, 2 x 3 thruster array.

Cuffel, R. F.↗

An updated LLVM-based quantum research compiler with further OpenQASM support

Abstract Quantum computing is a rapidly growing field with the potential to change how we solve previously intractable problems. Emerging hardware is approaching a complexity that requires increasingly sophisticated programming and control. Scaffold is an older quantum programming language that was originally designed for resource estimation for far-future, large quantum machines, and ScaffCC is the corresponding LLVM-based compiler. For the first time, we provide a full and complete overview of the language itself, the compiler as well as its pass structure. While previous works Abhari et al (2015 Parallel Comput. 45 2–17), Abhari et al (2012 Scaffold: quantum programming language https://cs.princeton.edu/research/techreps/TR-934-12 ), have piecemeal descriptions of different portions of this toolchain, we provide a more full and complete description in this paper. We also introduce updates to ScaffCC including conditional measurement and multidimensional qubit arrays designed to keep in step with modern quantum assembly languages, as well as an alternate toolchain targeted at maintaining correctness and low resource count for noisy-intermediate scale quantum (NISQ) machines, and compatibility with current versions of LLVM and Clang. Our goal is to provide the research community with a functional LLVM framework for quantum program analysis, optimization, and generation of executable code.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algorithm for Autonomous Landing

Because of their small size, high maneuverability, and easy deployment, micro aerial vehicles (MAVs) are used for a wide variety of both civilian and military missions. One of their current drawbacks is the vast array of sensors (such as GPS, altimeter, radar, and the like) required to make a landing. Due to the MAV s small payload size, this is a major concern. Replacing the imaging sensors with a single monocular camera is sufficient to land a MAV. By applying optical flow algorithms to images obtained from the camera, time-to-collision can be measured. This is a measurement of position and velocity (but not of absolute distance), and can avoid obstacles as well as facilitate a landing on a flat surface given a set of initial conditions. The key to this approach is to calculate time-to-collision based on some image on the ground. By holding the angular velocity constant, horizontal speed decreases linearly with the height, resulting in a smooth landing. Mathematical proofs show that even with actuator saturation or modeling/ measurement uncertainties, MAVs can land safely. Landings of this nature may have a higher velocity than is desirable, but this can be compensated for by a cushioning or dampening system, or by using a system of legs to grab onto a surface. Such a monocular camera system can increase vehicle payload size (or correspondingly reduce vehicle size), increase speed of descent, and guarantee a safe landing by directly correlating speed to height from the ground.

Kuwata, Yoshiaki↗

Quantifying the Variation in the Number of Donors in Quantum Dots Created Using Atomic Precision Advanced Manufacturing

Atomic-precision advanced manufacturing enables unique silicon quantum electronics built on quantum dots fabricated from small numbers of phosphorus dopants. The number of dopant atoms comprising a dot plays a central role in determining the behavior of charge and spin confined to the dots and thus overall device performance. Here in this work, we use both theoretical and experimental techniques to explore the combined impact of lithographic variation and stochastic kinetics on the number of P incorporations in quantum dots made using these techniques and how this variation changes as a function of the size of the dot. Using a kinetic model of PH3 dissociation augmented with novel reaction barriers, we demonstrate that for a 2 × 3 silicon dimer window the probability that no donor incorporates goes to zero, allowing for certainty in the placement of at least one donor. However, this still comes with some uncertainty in the precise number of incorporated donors (either one or two), and this variability may still impact certain applications. We also examine the impact of the size of the initial lithographic window, finding that the incorporation fraction saturates to δ-layer-like coverage as the circumference-to-area ratio decreases. We predict that this incorporation fraction depends strongly on the dosage of the precursor and that the standard deviation of the number of incorporations scales as ~√n, as would be expected for a sequence of largely independent incorporation events. Finally, we characterize an array of 36 experimentally prepared multidonor 3 × 3 nm lithographic windows with scanning tunneling microscopy, measuring the fidelity of the lithography to the desired array and the final location of PH x fragments within these lithographic windows. We use our kinetic model to examine the expected variability due to the observed lithographic error, predicting a negligible impact on incorporation statistics. We find good agreement between our model and the inferred incorporation locations in these windows from scanning tunneling microscope measurements.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Memristive linear algebra

The advent of memristive devices offers a promising avenue for efficient and scalable analog computing, particularly for linear algebra operations essential in various scientific and engineering applications. This paper investigates the potential of memristive crossbars in implementing matrix inversion algorithms. We explore both static and dynamic approaches, emphasizing the advantages of analog and in-memory computing for matrix operations beyond multiplication. In particular, we demonstrate that the electrical properties of memristive crossbars uniquely suit them for the evolution of a family of matrix exponentials, which can be exploited for the efficient computation of matrix inverses and online solutions for linear problems. Our results demonstrate that memristive arrays can reduce computational complexity. We also study power consumption and show a tradeoff between precision and energy. Furthermore, we address the challenges of device variability, precision, and scalability, providing insights into the practical implementation of these algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computing Sparse Tensor Decompositions via Chapel and C++/MPI Interoperability without Intermediate I/O

We extend an existing approach for efficient use of shared mapped memory across Chapel and C++ for graph data stored as 1-D arrays to sparse tensor data stored using a combination of 2-D and 1-D arrays. We describe the specific extensions that provide use of shared mapped memory tensor data for a particular C++ tensor decomposition tool called GentenMPI. We then demonstrate our approach on several real-world datasets, providing timing results that illustrate minimal overhead incurred using this approach. Finally, we extend our work to improve memory usage and provide convenient random access to sparse shared mapped memory tensor elements in Chapel, while still being capable of leveraging high performance implementations of tensor algorithms in C++.

97 MATHEMATICS AND COMPUTING↗

Validation of MCNP Critical Benchmark Models of PU-MET-FAST-016

A new centralized repository of high-quality MCNP models of critical benchmark experiments is currently under development at Los Alamos National Laboratory (LANL). The repository is the combined effort of the Nuclear Criticality Safety, Nuclear Data, and Monte Carlo code development/application organizations at LANL. The initial set of benchmark models in the repository are derived from the Whisper Suite provided with MCNP6.2 and are evaluated against the benchmark experiments described in the International Criticality Safety Benchmark Evaluation Project (ICSBEP) Handbook. The goal is to build a single LANL benchmark collection that is up to date with the latest ICSBEP revision, has a formal review and revision process, is contained in an open-source repository, and utilizes new Python tools for improved input and output file review. This paper describes the validation of the models associated with PU-MET-FAST-016, “Flooded 3X3X3 Arrays of 3-kg Plutonium (Pu) Metal Cylinders – Phase I”. In this critical experiment, twenty-seven 3-kg Pu metal cylinders with a height of 46.33 ± 0.15 mm and diameter of 65.25 ± 0.05 mm were arranged in a cubic array. The Pu cylinders were sealed in aluminum cans, and three cans were placed in each of nine perforated aluminum sleeves, as shown in Fig. 1. The nine sleeves were supported by an aluminum frame that allowed for control of the lateral spacing of the cylinders, both in the X and Y directions. The benchmark experiment measured thirteen configurations. Of these configurations, six were modeled using MCNP.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An optimized FM-index library for nucleotide and amino acid search

Abstract Background Pattern matching is a key step in a variety of biological sequence analysis pipelines. The FM-index is a compressed data structure for pattern matching, with search run time that is independent of the length of the database text. Implementation of the FM-index is reasonably complicated, so that increased adoption will be aided by the availability of a fast and flexible FM-index library. Results We present AvxWindowedFMindex (AWFM-index), a lightweight, open-source, thread-parallel FM-index library written in C that is optimized for indexing nucleotide and amino acid sequences. AWFM-index introduces a new approach to storing FM-index data in a strided bit-vector format that enables extremely efficient computation of the FM-index occurrence function via AVX2 bitwise instructions, and combines this with optional on-disk storage of the index’s suffix array and a cache-efficient lookup table for partial k-mer searches. The AWFM-index performs exact match count and locate queries faster than SeqAn3’s FM-index implementation across a range of comparable memory footprints. When optimized for speed, AWFM-index is $$\sim $$ ∼ 2–4x faster than SeqAn3 for nucleotide search, and $$\sim $$ ∼ 2–6x faster for amino acid search; it is also $$\sim $$ ∼ 4x faster with similar memory footprint when storing the suffix array in on-disk SSD storage. Conclusions AWFM-index is easy to incorporate into bioinformatics software, offers run-time performance parameterization, and provides clients with FM-index functionality at both a high-level (count or locate all instances of a query string) and low-level (step-wise control of the FM-index backward-search process). The open-source library is available for download at https://github.com/TravisWheelerLab/AvxWindowFmIndex.

59 BASIC BIOLOGICAL SCIENCES↗

Parallel asynchronous systems and image processing algorithms

A new hardware approach to implementation of image processing algorithms is described. The approach is based on silicon devices which would permit an independent analog processing channel to be dedicated to evey pixel. A laminar architecture consisting of a stack of planar arrays of the device would form a two-dimensional array processor with a 2-D array of inputs located directly behind a focal plane detector array. A 2-D image data stream would propagate in neuronlike asynchronous pulse coded form through the laminar processor. Such systems would integrate image acquisition and image processing. Acquisition and processing would be performed concurrently as in natural vision systems. The research is aimed at implementation of algorithms, such as the intensity dependent summation algorithm and pyramid processing structures, which are motivated by the operation of natural vision systems. Implementation of natural vision algorithms would benefit from the use of neuronlike information coding and the laminar, 2-D parallel, vision system type architecture. Besides providing a neural network framework for implementation of natural vision algorithms, a 2-D parallel approach could eliminate the serial bottleneck of conventional processing systems. Conversion to serial format would occur only after raw intensity data has been substantially processed. An interesting challenge arises from the fact that the mathematical formulation of natural vision algorithms does not specify the means of implementation, so that hardware implementation poses intriguing questions involving vision science.

Coon, D. D.↗

PythonFOAM: In-situ data analyses with OpenFOAM and Python

Here, we outline the development of a general-purpose Python-based data analysis tool for OpenFOAM. Our implementation relies on the construction of OpenFOAM applications that have bindings to data analysis libraries in Python. Double precision data in OpenFOAM is cast to a NumPy array using the NumPy C-API and Python modules may then be used for arbitrary data analysis and manipulation on flow-field information. We highlight how the proposed wrapper may be used for an in-situ online singular value decomposition (SVD) implemented in Python and accessed from the OpenFOAM solver PimpleFOAM. Here, 'in-situ' refers to a programming paradigm that allows for a concurrent computation of the data analysis on the same computational resources utilized for the partial differential equation solver. In addition, to demonstrate parallel deployments, we deploy a distributed SVD, which collects snapshot data across the ranks of a distributed simulation to compute the global left singular vectors. Crucially, both OpenFOAM and Python share the same message passing interface (MPI) communicator for this deployment which allows Python objects and functions to exchange NumPy arrays across ranks. Subsequently, we provide scaling assessments of this distributed SVD on multiple nodes of Intel Broadwell and KNL architectures for canonical test cases such as the large eddy simulations of a backward facing step and a channel flow at friction Reynolds number of 395. Finally, we demonstrate the deployment of a deep neural network for compressing the flow-field information using an autoencoder to demonstrate an ability to use state-of-the-art machine learning tools in the Python ecosystem.

97 MATHEMATICS AND COMPUTING↗

Final Report for Tech-X Corporations’s contribution to Enhancing Understanding of High Energy Density Plasmas from Wire Array and Solid Liner Implosions Using Fluid Modeling with Kinetic Closures

Recent results from experiments and simulation of magnetically driven pulsed power liners have explored the role of the early-time electrothermal instability in the evolution of the magneto-Rayleigh-Taylor instability. Our focus will be on understanding the development of such instabilities and the potential stabilization mechanisms via electron thermal conduction, viscosity, and large magnetic fields which we expect could play a significant role in supporting the success of the MagLIF program. Experiments have shown that studies of high-energy density plasmas from wire-array implosions require physics modeling that goes well beyond simple models such as ideal magnetohydrodynamics. The goal of this work is to provide increased understanding of these experiments by employing simulations with a multi-fluid extended-MHD model which uses kinetic closures for thermal conduction, resistivity and viscosity. We will use codes easily available to the wider research community, including university students, with a secondary goal of providing the community with well-benchmarked tools capable of advanced modeling of high-energy-density plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

MATAR: A performance portability and productivity implementation of data-oriented design with Kokkos

There is a need for simple, fast, and memory-efficient multidimensional data structures for dense and sparse storage that arise with numerical methods and in software applications. The data structures must perform equally well across multiple computer architectures, including CPUs and GPUs. For this purpose, we developed MATAR, a C++ software library that allows for simple creation and use of intricate data structures that is also portable across disparate architectures using Kokkos. Here, the performance aspect is achieved by forcing contiguous memory layout (or as close to contiguous as possible) for multidimensional and multi-size dense or sparse MATrix and ARray (hence, MATAR) types. Our results show that MATAR has the capability to improve memory utilization, performance, and programmer productivity in scientific computing. This is achieved by fitting more work into the available memory, minimizing memory loads required, and by loading memory in the most efficient order. This document describes the purpose of the work, the implementation of each of the data types, and the resulting performance both in some simple baseline test cases and in an application code.

97 MATHEMATICS AND COMPUTING↗

Analysis and mitigation of parasitic resistance effects for analog in-memory neural network acceleration

To support the increasing demands for efficient deep neural network processing, accelerators based on analog in-memory computation of matrix multiplication have recently gained significant attention for reducing the energy of neural network inference. However, analog processing within memory arrays must contend with the issue of parasitic voltage drops across the metal interconnects, which distort the results of the computation and limit the array size. This work analyzes how parasitic resistance affects the end-to-end inference accuracy of state-of-the-art convolutional neural networks, and comprehensively studies how various design decisions at the device, circuit, architecture, and algorithm levels affect the system's sensitivity to parasitic resistance effects. Here, a set of guidelines are provided for how to design analog accelerator hardware that is intrinsically robust to parasitic resistance, without any explicit compensation or re-training of the network parameters.

97 MATHEMATICS AND COMPUTING↗

Predicting Wind Loading and Instability in Solar Tracking PV Arrays

Wind loading and the fluctuating pressure loads it creates on PV panel surfaces are associated with multiple degradation mechanisms and failures. Modest wind speeds create reversing loads that can initiate cell cracks and weather cracked cells. Stronger wind speeds and extreme weather events can lead to larger scale forces and the aerodynamic instability known as torsional galloping. All these effects are dependent on the complex coupling between wind speed, panel orientation, and a myriad of other hardware and site-specific factors. In this work, we present the latest developments from our work to build an open-source, high-performance computing (HPC) fluid dynamics solver to predict and mitigate these effects. This simulation package allows users to easily specify different array layouts, solar-tracking angles, panel geometries, and weather conditions before automatically generating a refined computational mesh and solving for the unsteady loading on each panel surface. Small domains (e.g., a single panel row in isolation) can be solved on a modern laptop, while larger domains or very high-fidelity studies can be solved on distributed or HPC resources with minimal modifications to the underlying problem specification. We present preliminary case studies obtained using this simulation package and highlight how increased wind speeds combined with sub-optimal tracking angles can exacerbate degradation drivers.

aerodynamics↗

Benchmark Evaluation of one Dimensional Array of HEU Moderated and Reflected by Lucite [Poster]

Two critical experiments with HEU-Lucite were performed using the Planet Universal Critical Assembly Machine at Los Alamos National Laboratory in 2019. HEU foils were interleaved with Lucite in a column stack for moderation and reflection from the square Lucite plates. The evaluation of the experiments is presented. A Monte-Carlo (MCNP6) calculation model was developed for the determination of uncertainties and their effect on the multiplication factor. Experimental uncertainties were found to be low with the overall uncertainty in k eff approximately 240 pcm. The comparison of calculations with experimental data is presented.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A computational modeling framework for pre-clinical evaluation of cardiac mapping systems

There are a variety of difficulties in evaluating clinical cardiac mapping systems, most notably the inability to record the transmembrane potential throughout the entire heart during patient procedures which prevents the comparison to a relevant “gold standard”. Cardiac mapping systems are comprised of hardware and software elements including sophisticated mathematical algorithms, both of which continue to undergo rapid innovation. The purpose of this study is to develop a computational modeling framework to evaluate the performance of cardiac mapping systems. The framework enables rigorous evaluation of a mapping system’s ability to localize and characterize (i.e., focal or reentrant) arrhythmogenic sources in the heart. The main component of our tool is a library of computer simulations of various dynamic patterns throughout the entire heart in which the type and location of the arrhythmogenic sources are known. Our framework allows for performance evaluation for various electrode configurations, heart geometries, arrhythmias, and electrogram noise levels and involves blind comparison of mapping systems against a “silver standard” comprised of computer simulations in which the precise transmembrane potential patterns throughout the heart are known. A feasibility study was performed using simulations of patterns in the human left atria and three hypothetical virtual catheter electrode arrays. Activation times (AcT) and patterns (AcP) were computed for three virtual electrode arrays: two basket arrays with good and poor contact and one high-resolution grid with uniform spacing. The average root mean squared difference of AcTs of electrograms and those of the nearest endocardial action potential was less than 1 ms and therefore appears to be a poor performance metric. In an effort to standardize performance evaluation of mapping systems a novel performance metric is introduced based on the number of AcPs identified correctly and those considered spurious as well as misclassifications of arrhythmia type; spatial and temporal localization accuracy of correctly identified patterns was also quantified. This approach provides a rigorous quantitative analysis of cardiac mapping system performance. Proof of concept of this computational evaluation framework suggests that it could help safeguard that mapping systems perform as expected as well as provide estimates of system accuracy.

59 BASIC BIOLOGICAL SCIENCES↗

Imagining physically impossible self-rotations: geometry is more important than gravity

Previous studies found that it is easier for observers to spatially update displays during imagined self-rotation versus array rotation. The present study examined whether either the physics of gravity or the geometric relationship between the viewer and array guided this self-rotation advantage. Experiments 1-3 preserved a real or imagined orthogonal relationship between the viewer and the array, requiring a rotation in the observer's transverse plane. Despite imagined self-rotations that defied gravity, a viewer advantage remained. Without this orthogonal relationship (Experiment 4), the viewer advantage was lost. We suggest that efficient transformation of the egocentric reference frame relies on the representation of body-environment relations that allow rotation around the observer's principal axis. This efficiency persists across different and conflicting physical and imagined postures.

NASA Discipline Space Human Factors↗