Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Vector Processing”

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 199 records · Page 11

VLSI Processor For Vector Quantization

Pixel intensities in each kernel compared simultaneously with all code vectors. Prototype high-performance, low-power, very-large-scale integrated (VLSI) circuit designed to perform compression of image data by vector-quantization method. Contains relatively simple analog computational cells operating on direct or buffered outputs of photodetectors grouped into blocks in imaging array, yielding vector-quantization code word for each such block in sequence. Scheme exploits parallel-processing nature of vector-quantization architecture, with consequent increase in speed.

Tawel, Raoul↗

Representation and display of vector field topology in fluid flow data sets

The visualization of physical processes in general and of vector fields in particular is discussed. An approach to visualizing flow topology that is based on the physics and mathematics underlying the physical phenomenon is presented. It involves determining critical points in the flow where the velocity vector vanishes. The critical points, connected by principal lines or planes, determine the topology of the flow. The complexity of the data is reduced without sacrificing the quantitative nature of the data set. By reducing the original vector field to a set of critical points and their connections, a representation of the topology of a two-dimensional vector field that is much smaller than the original data set but retains with full precision the information pertinent to the flow topology is obtained. This representation can be displayed as a set of points and tangent curves or as a graph. Analysis (including algorithms), display, interaction, and implementation aspects are discussed.

Helman, James↗

Observation of electroweak production of two jets and a $Z$-boson pair

Electroweak symmetry breaking explains the origin of the masses of elementary particles through their interactions with the Higgs field. Besides the measurements of the Higgs boson properties, the study of the scattering of massive vector bosons with spin 1 allows the nature of electroweak symmetry breaking to be probed. Among all processes related to vector-boson scattering, the electroweak production of two jets and a $Z$-boson pair is a rare and important one. Here we report the observation of this process from proton–proton collision data corresponding to an integrated luminosity of 139 fb -1 recorded at a centre-of-mass energy of 13 TeV with the ATLAS detector at the Large Hadron Collider. We consider two different final states originating from the decays of the $Z$-boson pair: one containing four charged leptons and another containing two charged leptons and two neutrinos. The hypothesis of no electroweak production is rejected with a statistical significance of 5.7$σ$, and the measured cross-section for electroweak production is consistent with the Standard Model prediction. In addition, we report cross-sections for inclusive production of a $Z$-boson pair and two jets for the two final states.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Elucidating the Dynamics of Electroweak Symmetry Breaking through Study of High-Multiplicity Boson Final States at the LHC

To understand the full story of the electroweak symmetry breaking (EWSB) and how the universe arrived at today’s universe, the structure of the Higgs potential needs to be probed. We must carefully select and study processes at the LHC that are sensitive to the Higgs potential. In this context, longitudinal vector boson scattering (VBS) processes, V L V L →V L V L , and di-Higgs production, including V L V L →HH at the LHC have been studied for any potential deviation from SM prediction. However, many classes of models beyond the Standard Model (BSM) may result in the 2→2 process being perfectly well-behaved and SM-like but show interesting deviations in 2→3, 2→4, or 2→n(3) processes. If we are to complete the mission objectives the P5 laid out, then a large swath of 2→n(3) must be thoroughly searched and checked. The research supported by this award used data collected at the Compact Muon Solenoid (CMS) detector at the Large Hadron Collider (LHC) to explore VBS produced VVH process in the semi-merged channel. In addition, in the electroweak sector, there are open questions in the multi-gauge boson couplings and the Higgs couplings to the gauge bosons. The research supported by the award also studied the triboson production WWZ process at the LHC, which is a crossed diagram of a VBS process. During the funded period of 9 months, the analysis designs have been finalized.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Particle-Displacement Tracking In Particle-Image Velocimetry

Particle images processed rapidly and automatically into velocity-vector maps. This technique requires no processing of photographic plates, no tedious visual recognition and manual designation of large numbers of image features for subsequent processing, little or no interruption by technician and is order of magnitude faster than any of prior techniques.

Wernet, Mark P.↗

Deep learning methods for event verification and image re-purposing detection

Systems and methods herein describe accessing an image, generating a resized image, generating an image feature vector by applying an image classification neural network to the resized image, generating analysis of the image by processing the image feature vector using a machine-learning classifier trained to analyze the image feature vector, and based on the analysis, determining an event that is attributed to the image.

Nataraj, Lakshmanan↗

Field To Farm Aggregation For Agricultural Systems

The Fields to Farms methodology illustrates the generation of farm parcels from the Crop Data Layer (CDL), a raster dataset containing 133 categories representing various crop types and land uses. This methodology involves two primary steps: Field Delineation and Farm Aggregation. The code specifically addresses the aggregation of pre-delineated fields within a county to form farms, adhering to predefined criteria for farm size categories. It is assumed that the field delineation process, which involves creating vector polygons from CDL raster, has been completed beforehand, possibly through external tools or methods. Upon initialization, the script processes county-level fields, preparing them for farm aggregation. In the Farm Aggregation phase, the code iteratively combines delineated fields into farms based on specified criteria, continuing until the aggregated farm size meets predefined thresholds derived from data from the 2017 National Agricultural Statistics Service (NASS) census. Throughout this iterative process, the script dynamically adjusts the aggregation to ensure alignment with the desired distribution reported by NASS. The resulting output of the script is a GeoDataFrame containing classified farms, which are subsequently saved as GeoPackage files. These files enable further analysis and visualization, facilitating comprehensive exploration of the farm landscape generated through the methodology.

Paudel, Rajiv [Idaho National Laboratory (INL), Id↗

On the Use of Mahalanobis Distance in Particle Image Velocimetry Post-Processing

Particle Image Velocimetry (PIV) is a method of flow measurement that has become increasingly popular as an experimental tool. New technology has made high-speed and higher-dimension (stereoscopic, tomographic, etc) methods available to an ever-growing population of researchers. These advanced methods can provide significantly more data than traditional low-speed planar PIV, but these larger data sets also require more resources to process and store. A major time sink in the post-processing of large PIV data sets is the identification and rejection of “bad” or ”spurious” vectors that survive an initial processing step in commercial software, which attempts to identify spurious vectors on an image-by-image basis and not with respect to repeated trials. The Mahalanobis distance, an almost 100-year-old statistical function, was determined to be well suited for this task for its computational efficiency and higher-dimensional nature. This work includes a summary of the Mahalanobis distance and validation of its usefulness as a tool for outlier rejection in the post-processing of PIV data.

Experimental Methods↗

Two-dimensional particle displacement tracking in particle imaging velocimetry

A new particle imaging velocimetry data acquisition and analysis system, which is an order of magnitude faster than any previously proposed system, has been constructed and tested. The new particle displacement tracking (PDT) system is an all electronic technique employing a video camera and a large memory buffer frame-grabber board. Using a simple encoding scheme, a time sequence of single exposure images is time-coded into a single image and then processed to track particle displacements and determine two-dimensional velocity vectors. Use of the PDT technique in a counterrotating vortex flow produced over 1100 velocity vectors in 110 s when processed on an 80386 PC.

Wernet, Mark P.↗

PARA: A New Platform for the Rapid Assembly of gRNA Arrays for Multiplexed CRISPR Technologies

Multiplexed CRISPR technologies have great potential for pathway engineering and genome editing. However, their applications are constrained by complex, laborious and time-consuming cloning steps. In this research, we developed a novel method, PARA, which allows for the one-step assembly of multiple guide RNAs (gRNAs) into a CRISPR vector with up to 18 gRNAs. Here, we demonstrate that PARA is capable of the efficient assembly of transfer RNA/Csy4/ribozyme-based gRNA arrays. To aid in this process and to streamline vector construction, we developed a user-friendly PARAweb tool for designing PCR primers and component DNA parts and simulating assembled gRNA arrays and vector sequences.

59 BASIC BIOLOGICAL SCIENCES↗

On the interpretation of measured ion streams in the wake of the Shuttle Orbiter in terms of plasma expansion processes

Measurements of the flow vector and current density of ion streams between 11 and 18 m downstream in the near wake of the Shuttle Orbiter during the Spacelab 2 mission are compared with a one-dimensional, time-dependent plasma expansion model for wake filling. The model is based on the self-consistent plasma model of Singh et al. (1987) modified to simulate the one-dimensional expansion of counter-streaming plasmas. The results show good agreement between the model and the experimental results, suggesting that the measured streams can be interpreted in terms of collisionless plasma expansion.

Singh, N.↗

Autonomous reconfigurable GPS/INS navigation and pointing system for rendezvous and docking

This paper describes the results of an integrated navigation and pointing system software development effort sponsored by the NASA MSFC through a SBIR Phase 2 Program. The integrated Global Positioning System (GPS)/Inertial Navigation System (INS) implements an autonomous navigation filter that is reconfigurable in real-time to accommodate mission contingencies. An onboard expert system monitors the spacecraft status and reconfigures the navigation filter accordingly, to optimize the system performance. The navigation filter is a multi-mode Kalman filter to estimate the spacecraft position, velocity, and attitude. Three different GPS-based attitude determination techniques, namely, velocity vector matching, attitude vector matching, and interferometric processing, are implemented to encompass different mission contingencies. The integrated GPS/INS navigation filter will use any of these techniques depending on the mission phase and the state of the sensors. The first technique, velocity vector matching, uses the GPS velocity measurement to estimate the INS velocity errors and exploits the correlation between INS velocity and attitude errors to estimate the attitude. The second technique, attitude vector matching, uses INS gyro measurements and GPS carrier phase (integrated Doppler) measurements during a spacecraft rotation maneuver to determine the attitude. Both of these techniques require only one GPS antenna onboard to determine the spacecraft attitude. The third technique, interferometric processing, requires use of multiple GPS antennae. In order to determine 3-axis body attitude, three GPS antennae (2 no-coplanor baselines) are required.

Upadhyay, Triveni N.↗

Investigation of process history and underlying phenomena associated with the synthesis of plutonium oxides using Vector Quantizing Variational Autoencoder

Accurate, high throughput, and unbiased analysis of plutonium oxide particles is needed for analysis of the phenomenology associated with process parameters in their synthesis. Compared to qualitative and taxonomic descriptors, quantitative descriptors of particle morphology through scanning electron microscopy (SEM) have shown success in analyzing process parameters of uranium oxides. Among other candidates, a neural network called a Vector Quantizing Variational Autoencoder (VQ-VAE) has shown the ability to quantitatively describe particle morphology to attain >85% accuracy in identifying uranium oxide processing routes. We utilize a VQ-VAE to quantitatively describe plutonium dioxide (PuO 2 ) particles created in a designed experiment and investigate their phenomenology and prediction of their process parameters. PuO 2 was calcined from Pu(III) oxalates that were precipitated under varying synthetic conditions that related to concentrations, temperature, addition and digestion times, precipitant feed, and strike order; the surface morphology of the resulting PuO 2 powders were analyzed by SEM. A pipeline was developed to extract and quantify useful image representations for individual particles with the VQ-VAE, then further reduce the dimensionality of the feature space using a bottlenecking neural network fit to perform multiple classification tasks simultaneously. The reduced feature space could predict process parameters with greater than 80% accuracies for some parameters with a single particle. They also showed utility for grouping particles with similar surface morphology characteristics together. Both the clustering and classification results reveal valuable information regarding which chemical process parameters chiefly influence the PuO 2 particle morphologies: strike order and oxalic acid feedstock. Doing the same analysis with multiple particles was shown to improve the classification accuracy on each process parameter over the use of a single particle, with statistically significant results generally seen with as few as four particles in a sample.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Reduction of solar vector magnetograph data using a microMSP array processor

The processing of raw data obtained by the solar vector magnetograph at NASA-Marshall requires extensive arithmetic operations on large arrays of real numbers. The objectives of this summer faculty fellowship study are to: (1) learn the programming language of the MicroMSP Array Processor and adapt some existing data reduction routines to exploit its capabilities; and (2) identify other applications and/or existing programs which lend themselves to array processor utilization which can be developed by undergraduate student programmers under the provisions of project JOVE.

Kineke, Jack↗

CCD data processor for maximum likelihood feature classification

The paper describes an advanced technology development which utilizes a high speed analog/binary CCD correlator to perform the matrix multiplications necessary to implement onboard feature classification. The matrix manipulation module uses the maximum likelihood classification algorithm assuming a Gaussian probability density function. The module will process 16 element multispectral vectors at rates in excess of 500 thousand multispectral vector elements per second. System design considerations for the optimum use of this module are discussed, test results from initial device fabrication runs are presented, and the performance in typical processing applications is described

Benz, H. F.↗

Digital Image Velocimetry

Proposed technique for production of velocity maps from sequences of photographic video images of flows seeded with small particles. In digital image velocimetry, image analyzed by digital Fourier tranformation. Process free of noise, more precise, and consumes less time. Eliminates need to process photographs, indicates directions of velocity vectors unambiguously, and offers increased dynamic ranges. Because all processing performed electronically, eventually capable of mapping flow-velocity fields in real time.

Cho, Y. C.↗

Calibration of Predictor Models Using Multiple Validation Experiments

This paper presents a framework for calibrating computational models using data from several and possibly dissimilar validation experiments. The offset between model predictions and observations, which might be caused by measurement noise, model-form uncertainty, and numerical error, drives the process by which uncertainty in the models parameters is characterized. The resulting description of uncertainty along with the computational model constitute a predictor model. Two types of predictor models are studied: Interval Predictor Models (IPMs) and Random Predictor Models (RPMs). IPMs use sets to characterize uncertainty, whereas RPMs use random vectors. The propagation of a set through a model makes the response an interval valued function of the state, whereas the propagation of a random vector yields a random process. Optimization-based strategies for calculating both types of predictor models are proposed. Whereas the formulations used to calculate IPMs target solutions leading to the interval value function of minimal spread containing all observations, those for RPMs seek to maximize the models' ability to reproduce the distribution of observations. Regarding RPMs, we choose a structure for the random vector (i.e., the assignment of probability to points in the parameter space) solely dependent on the prediction error. As such, the probabilistic description of uncertainty is not a subjective assignment of belief, nor is it expected to asymptotically converge to a fixed value, but instead it casts the model's ability to reproduce the experimental data. This framework enables evaluating the spread and distribution of the predicted response of target applications depending on the same parameters beyond the validation domain.

Crespo, Luis G.↗

Supercomputer implementation of finite element algorithms for high speed compressible flows

Prediction of compressible flow phenomena using the finite element method is of recent origin and considerable interest. Two shock capturing finite element formulations for high speed compressible flows are described. A Taylor-Galerkin formulation uses a Taylor series expansion in time coupled with a Galerkin weighted residual statement. The Taylor-Galerkin algorithms use explicit artificial dissipation, and the performance of three dissipation models are compared. A Petrov-Galerkin algorithm has as its basis the concepts of streamline upwinding. Vectorization strategies are developed to implement the finite element formulations on the NASA Langley VPS-32. The vectorization scheme results in finite element programs that use vectors of length of the order of the number of nodes or elements. The use of the vectorization procedure speeds up processing rates by over two orders of magnitude. The Taylor-Galerkin and Petrov-Galerkin algorithms are evaluated for 2D inviscid flows on criteria such as solution accuracy, shock resolution, computational speed and storage requirements. The convergence rates for both algorithms are enhanced by local time-stepping schemes. Extension of the vectorization procedure for predicting 2D viscous and 3D inviscid flows are demonstrated. Conclusions are drawn regarding the applicability of the finite element procedures for realistic problems that require hundreds of thousands of nodes.

Thornton, E. A.↗