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 811 records · Page 45

Quantum signal processing for simulating cold plasma waves

Numerical modeling of radio-frequency waves in plasma with sufficiently high spatial and temporal resolution remains challenging even with modern computers. However, such simulations can be sped up using quantum computers in the future. In this work, we propose how to do such modeling for cold plasma waves, in particular, for an X wave propagating in an inhomogeneous one-dimensional plasma. The wave system is represented in the form of a vector Schrödinger equation with a Hermitian Hamiltonian. Block encoding is used to represent the Hamiltonian through unitary operations that can be implemented on a quantum computer. To perform the modeling, we apply the so-called quantum signal processing algorithm and construct the corresponding circuit. Quantum simulations with this circuit are emulated on a classical computer, and the results show agreement with traditional classical calculations. We also discuss how our quantum circuit scales with the resolution.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

High-Fidelity Arc-Discharge Model for Hydrogen-Plasma-Smelting-Reduction of Iron Ore

Electrification and use of renewable hydrogen is currently a necessity for decarbonizing the iron-and-steel industry. In this regard, hydrogen plasma smelting reduction (HPSR) is a novel pathway that is being explored for reduction of iron ore. HPSR provides several decarbonization merits compared to conventional blast furnaces. Firstly, the use of renewable hydrogen drastically reduces the CO2 emissions compared to the use of coke. Secondly, renewable electricity in the form of a thermal plasma for making reactive hydrogen species (radicals, ions) are more efficient at reducing iron ore compared to neutral H2. Thirdly, a molten product compatible with downstream processes is obtained from the intense heat transfer from the plasma. However, the scale-up of this technology requires fundamental exploration of hydrogen plasma dynamics and its interaction with complex solid material that include phase changing iron-ore and slag. In this work, we present a first principles continuum scale model for thermal plasmas in Ar/H2 gas mixtures typically used for HPSR. The thermal plasma governing equations for mass, momentum and energy with Lorentz force and Joule heating source terms are solved along with electromagnetic equations for electrostatic and magnetic vector potential. Our solver will be based on Pele, a suite of reacting flow solvers designed for advanced scientific computing architectures (Henry De Frahan et al., Proceedings of SIAM Parallel Processing, 13-25, 2024), and will utilize adaptive mesh generation for enhanced resolutions at locations of intense physicochemical interactions. This study will present the impact of Ar to H2 ratios on excited/dissociated hydrogen species concentrations, plasma temperature and conductivity along with the impact of outgassed species (water, metal vapor, O, OH radicals) from ore surface on gas phase chemistry. Furthermore, the heat and species flux to the surface will be quantified as a function of applied voltages in a transferred arc configuration.

hydrogen plasma↗

Dynamic imaging of crystalline defects in lithium-manganese oxide electrodes during electrochemical activation to high voltage

Crystalline defects are commonly generated in lithium-metal-oxide electrodes during cycling of lithium-ion batteries. Their role in electrochemical reactions is not yet fully understood because, until recently, there has not been an effective operando technique to image dynamic processes at the atomic level. In this study, two types of defects were monitored dynamically during delithiation and concomitant oxidation of oxygen ions by using in situ high-resolution transmission electron microscopy supported by density functional theory calculations. One stacking fault with a fault vector b/6[110] and low mobility contributes minimally to oxygen release from the structure. In contrast, dissociated dislocations with Burgers vector of c/2[001] have high gliding and transverse mobility; they lead to the formation, transport and release subsequently of oxygen related species at the surface of the electrode particles. This work advances the scientific understanding of how oxygen participates and the structural response during the activation process at high potentials.

36 MATERIALS SCIENCE↗

Light quark Yukawas in triboson final states

Triple heavy vector boson production, pp → VVV (V = W, Z), has recently been observed for the first time. We propose that precision measurements of this process provide an excellent probe of the first generation light quark Yukawa couplings. Modified quark interactions with the off-shell Higgs in this process lead to a rapid growth of the partonic cross sections with energy, which manifests in an enhanced p T distribution of the final state leptons and quarks. We quantify this effect and estimate the present and future 2σ sensitivity to the up, down, and strange Yukawas. In particular, we find that HL-LHC can reach $\mathscr{O}$(400) sensitivity to the down Yukawa relative to the Standard Model value, improving the current sensitivity in this process by a factor of 10, and which can be further improved to $\mathscr{O}$(30) at FCC-hh. This is competitive with and complementary to constraints from global fits and other on-shell probes of the first generation Yukawas. The triboson sensitivity at HL-LHC corresponds to probing dimension-6 SMEFT operators suppressed by an $\mathscr{O}$(1) TeV scale, similarly to other LHC Higgs probes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Faster Johnson–Lindenstrauss transforms via Kronecker products

The Kronecker product is an important matrix operation with a wide range of applications in signal processing, graph theory, quantum computing and deep learning. In this work, we introduce a generalization of the fast Johnson–Lindenstrauss projection for embedding vectors with Kronecker product structure, the Kronecker fast Johnson–Lindenstrauss transform (KFJLT). The KFJLT reduces the embedding cost by an exponential factor of the standard fast Johnson–Lindenstrauss transform’s cost when applied to vectors with Kronecker structure, by avoiding explicitly forming the full Kronecker products. Here, we prove that this computational gain comes with only a small price in embedding power: consider a finite set of $p$ points in a tensor product of $d$ constituent Euclidean spaces $\bigotimes _{k=d}^{1}{\mathbb{R}}^{n_k}$, and let $N = \prod _{k=1}^{d}n_k$. With high probability, a random KFJLT matrix of dimension $m \times N$ embeds the set of points up to multiplicative distortion $(1\pm \varepsilon )$ provided $m \gtrsim \varepsilon ^{-2} \, \log ^{2d - 1} (p) \, \log N$. We conclude by describing a direct application of the KFJLT to the efficient solution of large-scale Kronecker-structured least squares problems for fitting the CP tensor decomposition.

Kronecker structure↗

Vectorization of Dynamic Subgraphs via Generative Models (Final Report)

An important class of data analysis tasks stem from comparing subsets of connected records within massive sets of complex relational data. A common approach is to represent each set of connected records with a small graph, or set of data entities (graph vertices) and their relationships (graph edges), and efficient methods to gauge similarity for pairs of graphs are of high interest. This project concentrated on dynamic graphs, where each edge record has an associated timestamp denoting the time of observation. Pre-existing techniques for comparing dynamic graphs concentrate on either computing graph edit distance (number of vertex and edge deletion, addition, and timestamp modifications) or vectorizing the graph with counts of a limited set of dynamic graph motifs (tiny fundamental subgraphs) and computing distances between the vectors. These approaches are less able to see similarities in graphs that are fairly different in size but come from identical graph generation processes. The motif counting approach can be improved for graphs from the same process, but suffers from requiring many types of motifs meaning it is expensive. Moreover, many motifs are not present for small graphs, meaning realizing a a much larger graph came from the same process is difficult.

97 MATHEMATICS AND COMPUTING↗

Transverse vorticity measurements

A technique, involving programmed digital calculations, is proposed for evaluating transverse vorticity in typical laboratory shear flows from an array of four hot-wire probes. The computing scheme successfully recovers the velocity vector information from a wide range of velocity magnitudes and a wide range of pitch angles. It is readily implemented in a batch process mode on a digital computer.

Foss, J. F.↗

Application of data flow concepts to a multigrid solver for the Euler equations

In this study a multigrid solver for Euler equations (FLO52R) was examined to determine its performance potential on a hypothetical computer using a data flow architecture. The proposed computer would require massive parallelism to realize its design performance. On the other hand this parallelism would be more easily realized than with a conventional vector processor such as the Cray-1S. Several changes to the proposed design substantially alleviated most of the remaining bottlenecks to parallel processing. Other changes allowed clearer definition of memory access and disk I/O. Finally, a portion of the algorithm was rewritten to improve parallel performance. With these changes, performance levels approaching that of a Cray-1S may be possible for a computer costing far less. Estimates are given for overall speed, memory, and network bandwidth, and for instruction memory requirements.

Merriam, M. L.↗

Space shuttle main engine numerical modeling code modifications and analysis

The user of computational fluid dynamics (CFD) codes must be concerned with the accuracy and efficiency of the codes if they are to be used for timely design and analysis of complicated three-dimensional fluid flow configurations. A brief discussion of how accuracy and efficiency effect the CFD solution process is given. A more detailed discussion of how efficiency can be enhanced by using a few Cray Research Inc. utilities to address vectorization is presented and these utilities are applied to a three-dimensional Navier-Stokes CFD code (INS3D).

Ziebarth, John P.↗

Performances Of Fixed-Lag Phase-Smoothing Algorithms

Report discusses performances of fixed-lag nonlinear smoothing algorithms applied to estimation of phase and frequency of sinusoidal carrier signal with process phase noise and additive observation phase noise. Algorithm of type considered functions as suboptimal filter operating on received signal. Algorithm developed for system in which signal sampled at discrete times. Process noise assumed to be Gaussian with zero mean and independent of observation noise. Nonlinear smoothing equations derived in customary matrix-and-vector forms.

Kumar, Rajendra↗

Scanning-Pencil-Beam Radar Scatterometer

SCANSCAT conceptual scanning radar scatterometer placed in nearly polar orbit around Earth at altitude of 705 km aboard Spacecraft B of NASA's Earth Observing System. Measures radar backscattering from surface of ocean. Data processed on ground into normalized radar-backscattering cross sections, then processed into velocities of winds near surface of ocean by use of empirical mathematical model of relationship between normalized backscattering cross section, wind vector at scanned spot, and angle of incidence and azimuth angle of radar beam. Accuracy and coverage exceeds those of fan-beam scatterometer. Modified versions of scanning plan useful in laser inspection of surface finishes on machined parts.

Long, David G.↗

GGOS working group on ground networks and communications

Activities of this Working Group include the investigation of the status quo and the development of a plan for full network integration to support improvements in terrestrial reference frame establishment and maintenance, Earth orientation and gravity field monitoring, precision orbit determination, and other geodetic and gravimetric applications required for the long-term observation of global change. This integration process includes the development of a network of fundamental stations with as many co-located techniques as possible, with precisely determined intersystem vectors. This network would exploit the strengths of each technique and minimize the weaknesses where possible. This paper discusses the organization of the working group, the work done to date, and future tasks.

VLBI↗

Water Across Synthetic Aperture Radar Data (WASARD): SAR Water Body Classification for the Open Data Cube

The detection of inland water bodies from Synthetic Aperture Radar (SAR) data provides a great advantage over water detection with optical data, since SAR imaging is not impeded by cloud cover. Traditional methods of detecting water from SAR data involves using thresholding methods that can be labor intensive and imprecise. This paper describes Water Across Synthetic Aperture Radar Data (WASARD): a method of water detection from SAR data which automates and simplifies the thresholding process using machine learning on training data created from Geoscience Australia’s WOFS algorithm. Of the machine learning models tested, the Linear Support Vector Machine was determined to be optimal, with the option of training using solely the VH polarization or a combination of the VH and VV polarizations. WASARD was able to identify water in the target area with a correlation of 97% with WOFS. Sentinel-1, Open Data Cube, Earth Observations, Machine Learning, Water Detection 1. INTRODUCTION Water classification is an important function of Earth imaging satellites, as accurate remote classification of land and water can assist in land use analysis, flood prediction, climate change research, as well as a variety of agricultural applications [2]. The ability to identify bodies of water remotely via satellite is immensely cheaper than contracting surveys of the areas in question, meaning that an application that can accurately use satellite data towards this function can make valuable information available to nations which would not be able to afford it otherwise. Highly reliable applications for the remote detection of water currently exist for use with optical satellite data such as that provided by LANDSAT. One such application, Geoscience Australia’s Water Observations from Space (WOFS) has already been ported for use with the Open Data Cube [6]. However, water detection using optical data from Landsat is constrained by its relatively long revisit cycle of 16 days [5], and water detection using any optical data is constrained in that it lacks the ability to make accurate classifications through cloud cover [2]. The alternative solution which solves these problems is water detection using SAR data, which images the Earth using cloud-penetrating microwaves. Because of its advantages over optical data, much research has been done into water detection using SAR data. Traditionally, this has been done using the thresholding method, which involves picking a polarization band and labeling all pixels for which this band’s value is below a certain threshold as containing water. The thresholding method works since water tends to return a much lower backscatter value to the satellite than land [1]. However, this method can be flawed since estimating the proper threshold is often imprecise, complicated, and labor intensive for the end user. Thresholding also tends to use data from only one SAR polarization, when a combination of polarizations can provide insight into whether water is present. [2] In order to alleviate these problems, this paper presents an application for the Open Data Cube to detect water from SAR data using support vector machine (SVM) classification. 2. PLATFORM WASARD is an application for the Open Data Cube, a mechanism which provides a simple yet efficient means of ingesting, storing, and retrieving remote sensing data. Data can be ingested and made analysis ready according to whatever specifications the researcher chooses, and easily resampled to artificially alter a scene’s resolution. Currently WASARD supports water detection on scenes from ESA’s Sentinel-1 and JAXA’s ALOS. When testing WASARD, Sentinel-1 was most commonly used due to its relatively high spatial resolution and its rapid 6 day revisit cycle [5]. With minor alterations to the application's code, however, it could support data from other satellites. 3. METHODOLOGY Using supervised classification, WASARD compares SAR data to a dataset pre-classified by WOFS in order to train an SVM classifier. This classifier is then used to detect water in other SAR scenes outside the training set. Accuracy was measured according to the following metrics:  Precision: a measure of what percentage of the points WASARD labels as water are truly water  Recall: a measure of what percentage of the total water cover WASARD was able to identify.  F1 Score: a harmonic average of the precision and recall scores Both precision and recall are calculated at the end of the training phase, when the trained classifier is compared to a testing dataset. Because the WOFS algorithm’s classifications are used as the truth values when training a WASARD classifier, when precision and recall are mentioned in this paper, they are always with respect to the values produced by WOFS on a similar scene of Landsat data, which themselves have a classification accuracy of 97% [6]. Visual representations of water identified by WASARD in this paper were produced using the function wasard_plot(), which is included in WASARD. 3.1 Algorithm Selection The machine learning model used by WASARD is the Linear Support Vector Machine (SVM). This model uses a supervised learning algorithm to develop a classifier, meaning it creates a vector which can be multiplied by the vector formed by the relevant data bands to determine whether a pixel in a SAR scene contains water. This classifier is trained by comparing data points from selected bands in a SAR scene to their respective labels, which in this case are “water” or “not water” as given by the WOFS algorithm. The SVM was selected over the Random Forest model, which outperformed the SVM in training speed, but had a greater classification time and lower accuracy, and the Multilayer Perceptron Artificial Neural Network, which had a slightly higher average accuracy than the SVM, but much greater training and classification times. Figure 1: Visual representation of the SVM Classifier. Each white point represents a pixel in a SAR scene. In Figure 1, the diagonal line separating pixels determined to be water from those determined not to be water represents the actual classification vector produced by the SVM. It is worth noting that once the model has been trained, classification of pixels is done in a similar manner as in the thresholding method. This is especially true if only one band was used to train the model. 3.1 Feature Selection Sentinel-1 collects data from two bands: the Vertical/Vertical polarization (VV) and the Vertical/Horizontal polarization (VH). When 100 SVM classifiers were created for each polarization individually, and for the combination of the two, the following results were achieved: Figure 2: Accuracy of classifiers trained using different polarization bands. Precision and Recall were measured with respect to the values produced by WOFS. Figure 2 demonstrates that using both the VV and VH bands trades slightly lower recall for significantly greater precision when compared with the VH band alone, and that using the VV band alone is inferior in both metrics. WASARD therefore defaults to using both the VV and VH bands, and includes the option to use solely the VH band. The VV polarization’s lower precision compared to the VH polarization is in contrast to results from previous research and may merit further analysis [4]. 3.2 Training a Classifier The steps in training a classifier with WASARD are 1. Selecting two scenes (one SAR, one optical) with the same spatial extents, and acquired close to each other in time, with a preference that the scenes are taken on the same day. 2. Using the WOFS algorithm to produce an array of the detected water in the scene of optical data, to be used as the labels during supervised learning 3. Data points from the selected bands from the SAR acquisition are bundled together into an array with the corresponding labels gathered from WOFS. A random sample with an equal number of points labeled “Water” and “Not Water” is selected to be partitioned into a training and a testing dataset 4. Using Scikit-Learn’s LinearSVC object, the training dataset is used to produce a classifier, which is then tested against the testing dataset to determine its precision and recall The result is a wasard_classifier object, which has the following attributes: 1. f1, recall, and precision: 3 metrics used to determine the classifier’s accuracy 2. Coefficient: Vector which the SVM uses to make its predictions. The classifier detects water when the dot product of the coefficient and the vector formed by the SAR bands is positive 3. Save(): allows a user to save a classifier to the disk in order to use it without retraining 4. wasard_classify(): Classifies an entire xarray of SAR data using the SVM classifier All of the above steps are performed automatically when the user creates a wasard_classifier object. 3.3 Classifying a Dataset Once the classifier has been created, it can be used to detect water in an xarray of SAR data using wasard_classify(). By taking the dot product of the classifier’s coefficients and the vector formed by the selected bands of SAR data, an array of predictions is constructed. A classifier can effectively be used on the same spatial extents as the ones where it was trained, or on any area with a similar landscape. While

Kreiser, Zachary↗

WavPool: A New Block for Deep Neural Networks

Modern deep neural networks comprise many operational layers, such as dense or convolutional layers, which are often collected into blocks. In this work, we introduce a new, wavelet-transform-based network architecture that we call the multi-resolution perceptron: by adding a pooling layer, we create a new network block, the WavPool. The first step of the multi-resolution perceptron is transforming the data into its multi-resolution decomposition form by convolving the input data with filters of fixed coefficients but increasing size. Following image processing techniques, we are able to make scale and spatial information simultaneously accessible to the network without increasing the size of the data vector. WavPool outperforms a similar multilayer perceptron while using fewer parameters, and outperforms a comparable convolutional neural network by ~ 10% on relative accuracy on CIFAR-10.

McDermott, Samuel D.↗

Decentralized Microgrid Protection Through Relative Fault Direction Classification: Preprint

Protection in inverter-based resources (IBRs) dominated microgrids generally face significant challenges due to the low fault current and inconsistent fault behaviors from IBRs. Recently, machine learning-based approaches have attracted considerable attention to address these challenges. This paper introduces a novel decentralized protection strategy for microgrids. The proposed method decomposes the protection challenge into several distributed learning tasks, enabling individual relays to autonomously determine the direction of faults using a binary classification framework based on support vector machine (SVM) algorithms. Following the distributed fault direction estimation, classifier outcomes are shared among neighboring relays, facilitating a local decision-making process to ascertain the presence of faults within the neighborhood. Finally, a tripping signal is generated based on the classifier results of each relay to operate the circuit breaker. To test and validate this approach, a 100% renewable microgrid model is simulated in MATLAB/Simulink. In the numerical analysis, the application of SVM classifiers in our approach yields impressive results: an average relay classification accuracy of 98%, and a 96% accuracy in circuit breaker control. These findings highlight the potential of machine-learning-based approaches in enhancing the efficiency and reliability of microgrid protection systems.

decentralized algorithm↗

Machine Learning-Based Model Predictive Control of Two-Time-Scale Systems

In this study, we present a general form of nonlinear two-time-scale systems, where singular perturbation analysis is used to separate the dynamics of the slow and fast subsystems. Machine learning techniques are utilized to approximate the dynamics of both subsystems. Specifically, a recurrent neural network (RNN) and a feedforward neural network (FNN) are used to predict the slow and fast state vectors, respectively. Moreover, we investigate the generalization error bounds for these machine learning models approximating the dynamics of two-time-scale systems. Next, under the assumption that the fast states are asymptotically stable, our focus shifts toward designing a Lyapunov-based model predictive control (LMPC) scheme that exclusively employs the RNN to predict the dynamics of the slow states. Additionally, we derive sufficient conditions to guarantee the closed-loop stability of the system under the sample-and-hold implementation of the controller. A nonlinear chemical process example is used to demonstrate the theory. In particular, two RNN models are constructed: one to model the full two-time-scale system and the other to predict solely the slow state vector. Both models are integrated within the LMPC scheme, and we compare their closed-loop performance while assessing the computational time required to execute the LMPC optimization problem.

97 MATHEMATICS AND COMPUTING↗

Short-interval SMS wind vector determinations for a severe local storms area

Short-interval SMS-2 visible digital image data are used to derive wind vectors from cloud tracking on time-lapsed sequences of geosynchronous satellite images. The cloud tracking areas are located in the Central Plains, where on May 6, 1975 hail-producing thunderstorms occurred ahead of a well defined dry line. Cloud tracking is performed on the Goddard Space Flight Center Atmospheric and Oceanographic Information Processing System. Lower tropospheric cumulus tracers are selected with the assistance of a cloud-top height algorithm. Divergence is derived from the cloud motions using a modified Cressman (1959) objective analysis technique which is designed to organize irregularly spaced wind vectors into uniformly gridded wind fields. The results demonstrate the feasibility of using satellite-derived wind vectors and their associated divergence fields in describing the conditions preceding severe local storm development. For this case, an area of convergence appeared ahead of the dry line and coincided with the developing area of severe weather. The magnitude of the maximum convergence varied between -10 to the -5th and -10 to the -14th per sec. The number of satellite-derived wind vectors which were required to describe conditions of the low-level atmosphere was adequate before numerous cumulonimbus cells formed. This technique is limited in areas of advanced convection.

Peslen, C. A.↗

GPS-Based Navigation and Orbit Determination for the AMSAT Phase 3D Satellite

This paper summarizes the results of processing GPS data from the AMSAT Phase 3D (AP3) satellite for real-time navigation and post-processed orbit determination experiments. AP3 was launched into a geostationary transfer orbit (GTO) on November 16, 2000 from Kourou, French Guiana, and then was maneuvered into its HEO over the next several months. It carries two Trimble TANS Vector GPS receivers for signal reception at apogee and at perigee. Its spin stabilization mode currently makes it favorable to track GPS satellites from the backside of the constellation while at perigee, and to track GPS satellites from below while at perigee. To date, the experiment has demonstrated that it is feasible to use GPS for navigation and orbit determination in HEO, which will be of great benefit to planned and proposed missions that will utilize such orbits for science observations. It has also shown that there are many important operational considerations to take into account. For example, GPS signals can be tracked above the constellation at altitudes as high as 58000 km, but sufficient amplification of those weak signals is needed. Moreover, GPS receivers can track up to 4 GPS satellites at perigee while moving as fast as 9.8 km/sec, but unless the receiver can maintain lock on the signals long enough, point solutions will be difficult to generate. The spin stabilization of AP3, for example, appears to cause signal levels to fluctuate as other antennas on the satellite block the signals. As a result, its TANS Vectors have been unable to lock on to the GPS signals long enough to down load the broadcast ephemeris and then generate position and velocity solutions. AP3 is currently in its eclipse season, and thus most of the spacecraft subsystems have been powered off. In Spring 2002, they will again be powered up and AP3 will be placed into a three-axis stabilization mode. This will significantly enhance the likelihood that point solutions can be generated, and perhaps more important, that the receiver clock can be synchronized to GPS time. This is extremely important for real-time and post-processed orbit determination, where removal of receiver clock bias from the data time tags is needed, for time-tagging of science observations. Current analysis suggests that the inability to generate point solutions has allowed the TANS Vector clock bias to drift freely, being perhaps as large as 5-7 seconds by October, 2001, thus causing up to 50 km of along-track orbit error. The data collected in May, 2002 while in three-axis stabilized mode should provide a significant improvement in the orbit determination results.

Davis, George↗