SEARCH · Engineering Papers

Results for “range finding algorithm”

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.

SourceResearch connectionFrom yearThrough year

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

At least 217 records · Page 12

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Trust-Based Detection and Mitigation of Cyber Attacks in Distributed Cooperative Control of Islanded AC Microgrids

In this study, we address the challenge of detecting and mitigating cyber attacks in the distributed cooperative control of islanded AC microgrids, with a particular focus on detecting False Data Injection Attacks (FDIAs), a significant threat to the Smart Grid (SG). The SG integrates traditional power systems with communication networks, creating a complex system with numerous vulnerable links, making it a prime target for cyber attacks. These attacks can lead to the disclosure of private data, control network failures, and even blackouts. Unlike machine learning-based approaches that require extensive datasets and mathematical models dependent on accurate system modeling, our method is free from such dependencies. To enhance the microgrid’s resilience against these threats, we propose a resilient control algorithm by introducing a novel trustworthiness parameter into the traditional cooperative control algorithm. Our method evaluates the trustworthiness of distributed energy resources (DERs) based on their voltage measurements and exchanged information, using Kullback-Leibler (KL) divergence to dynamically adjust control actions. We validated our approach through simulations on both the IEEE-34 bus feeder system with eight DERs and a larger microgrid with twenty-two DERs. The results demonstrated a detection accuracy of around 100%, with millisecond range mitigation time, ensuring rapid system recovery. Additionally, our method improved system stability by up to almost 100% under attack scenarios, showcasing its effectiveness in promptly detecting attacks and maintaining system resilience. These findings highlight the potential of our approach to enhance the security and stability of microgrid systems in the face of cyber threats.

Computer Science↗

NASA NTRS2006

Space-Based Near-Infrared CO2 Measurements: Testing the Orbiting Carbon Observatory Retrieval Algorithm and Validation Concept Using SCIAMACHY Observations over Park Falls, Wisconsin

Space-based measurements of reflected sunlight in the near-infrared (NIR) region promise to yield accurate and precise observations of the global distribution of atmospheric CO2. The Orbiting Carbon Observatory (OCO) is a future NASA mission, which will use this technique to measure the column-averaged dry air mole fraction of CO2 (XCO2) with the precision and accuracy needed to quantify CO2 sources and sinks on regional scales (approx.1000 x 1000 sq km and to characterize their variability on seasonal timescales. Here, we have used the OCO retrieval algorithm to retrieve XCO2 and surface pressure from space-based Scanning Imaging Absorption Spectrometer for Atmospheric Chartography (SCIAMACHY) measurements and from coincident ground-based Fourier transform spectrometer (FTS) measurements of the O2 A band at 0.76 mm and the 1.58 mm CO2 band for Park Falls,Wisconsin. Even after accounting for a systematic error in our representation of the O2 absorption cross sections, we still obtained a positive bias between SCIAMACHY and FTS XCO2 retrievals of approx.3.5%. Additionally, the retrieved surface pressures from SCIAMACHY systematically underestimate measurements of a calibrated pressure sensor at the FTS site. These findings lead us to speculate about inadequacies in the forward model of our retrieval algorithm. By assuming a 1% intensity offset in the O2 A band region for the SCIAMACHY XCO2 retrieval, we significantly improved the spectral fit and achieved better consistency between SCIAMACHY and FTS XCO2 retrievals. We compared the seasonal cycle of XCO2 at Park Falls from SCIAMACHY and FTS retrievals with calculations of the Model of Atmospheric Transport and Chemistry/Carnegie-Ames-Stanford Approach (MATCH/CASA) and found a good qualitative agreement but with MATCH/CASA underestimating the measured seasonal amplitude. Furthermore, since SCIAMACHY observations are similar in viewing geometry and spectral range to those of OCO, this study represents an important test of the OCO retrieval algorithm and validation concept using NIR spectra measured from space. Finally, we argue that significant improvements in precision and accuracy could be obtained from a dedicated CO2 instrument such as OCO, which has much higher spectral and spatial resolutions than SCIAMACHY. These measurements would then provide critical data for improving our understanding of the carbon cycle and carbon sources and sinks.

carbon dioxide↗

NASA NTRS1998

Information-Adaptive Image Encoding and Restoration

The multiscale retinex with color restoration (MSRCR) has shown itself to be a very versatile automatic image enhancement algorithm that simultaneously provides dynamic range compression, color constancy, and color rendition. A number of algorithms exist that provide one or more of these features, but not all. In this paper we compare the performance of the MSRCR with techniques that are widely used for image enhancement. Specifically, we compare the MSRCR with color adjustment methods such as gamma correction and gain/offset application, histogram modification techniques such as histogram equalization and manual histogram adjustment, and other more powerful techniques such as homomorphic filtering and 'burning and dodging'. The comparison is carried out by testing the suite of image enhancement methods on a set of diverse images. We find that though some of these techniques work well for some of these images, only the MSRCR performs universally well oil the test set.

Park, Stephen K.↗

NASA NTRS1995

Implementation and Characterization of Three-Dimensional Particle-in-Cell Codes on Multiple-Instruction-Multiple-Data Massively Parallel Supercomputers

A three-dimensional electrostatic particle-in-cell (PIC) plasma simulation code has been developed on coarse-grain distributed-memory massively parallel computers with message passing communications. Our implementation is the generalization to three-dimensions of the general concurrent particle-in-cell (GCPIC) algorithm. In the GCPIC algorithm, the particle computation is divided among the processors using a domain decomposition of the simulation domain. In a three-dimensional simulation, the domain can be partitioned into one-, two-, or three-dimensional subdomains ("slabs," "rods," or "cubes") and we investigate the efficiency of the parallel implementation of the push for all three choices. The present implementation runs on the Intel Touchstone Delta machine at Caltech; a multiple-instruction-multiple-data (MIMD) parallel computer with 512 nodes. We find that the parallel efficiency of the push is very high, with the ratio of communication to computation time in the range 0.3%-10.0%. The highest efficiency (> 99%) occurs for a large, scaled problem with 64(sup 3) particles per processing node (approximately 134 million particles of 512 nodes) which has a push time of about 250 ns per particle per time step. We have also developed expressions for the timing of the code which are a function of both code parameters (number of grid points, particles, etc.) and machine-dependent parameters (effective FLOP rate, and the effective interprocessor bandwidths for the communication of particles and grid points). These expressions can be used to estimate the performance of scaled problems--including those with inhomogeneous plasmas--to other parallel machines once the machine-dependent parameters are known.

Lyster, P. M.↗

NASA NTRS1997

A Comparison of the Multiscale Retinex With Other Image Enhancement Techniques

Rahman, Zia-Ur↗

DOE OSTI2022

A computer vision algorithm for interpreting lacustrine carbonate textures at Searles Valley, USA

Investigations of the paleohydrologies of pluvial lake systems have often employed lake carbonate deposits called “tufa” that grow subaqueously and can be preserved long after the drying of the lake. For this reason, tufa have been used as a proxy for minimum lake level. However, they exhibit a variety of textures that hold the potential to reveal richer paleoclimatological information. With the goal of determining if tufa texture can be used as a proxy for lake environment, this study investigates the textures of tufa at Mono Lake, California in comparison to the fossil tufa in Searles Valley, California. While observations in the last century suggest that the tufa in the Mono basin grew in waters similar to the modern, the tufa at Searles formed during the last glacial period, when the Great Basin contained a system of pluvial lakes on the scale of the modern Great Lakes. The tufa at both basins have been observed to have a range of classifiable textures, and new methods of inspecting visual data could be informative about what factors control these textures. To this end, a t-Distributed Stochastic Neighbor Embedding (t-SNE) algorithm is used to project images of the tufa at Searles and Mono into a coordinate space, allowing for simple, quantitative comparisons of the visual similarity of textures. In this work, the textures of tufa at Searles are compared to each other, as well as to the tufa at Mono. This study performs a robust assessment of the feasibility of Mono Lake as a modern analogue for Searles Valley. It finds that there is a justifiable basis for the comparison of certain fossil facies at Searles to the tufa at Mono, significant progress towards the goal of using texture as a metric for the environment in which tufa formed.

58 GEOSCIENCES↗

NASA NTRS1991

Procedures for Including Secondary Electron Emission in Numerical Simulations of Plasma-Insulator Interactions

Previous Monte Carlo simulations provide a data base for properties of secondary electron emission (SEE) from insulators and metals. Incident primary electrons are considered at energies up to 1200 eV. The behavior of secondary electrons is characterized by (1) yield vs. primary energy E(sub p), (2) distribution vs. secondary energy E(sub s), and (3) distribution vs. angle of emission theta. Special attention is paid to the low energy range E(sub p) up to 50 eV, where the number and energy of secondary electrons is limited by the finite band gap of the insulator. For primary energies above 50 eV the SEE yield curve can be conveniently parameterized by a Haffner formula. The energy distribution of secondary electrons is described by an empirical formula with average energy about 8.0 eV. The angular distribution of secondaries is slightly more peaked in the forward direction than the customary cos theta distribution. Empirical formulas and parameters are given for all yield and distribution curves. Procedures and algorithms are described for using these results to find the SEE yield, and then to choose the energy and angle of emergence of each secondary electron. These procedures can readily be incorporated into numerical simulations of plasma-solid surface interactions in low earth orbit.

Beyst, Brian↗

NASA NTRS2006

Tuning of MEMS Gyroscope using Evolutionary Algorithm and "Switched Drive-Angle" Method

We propose a tuning method for Micro-Electro-Mechanical Systems (MEMS) gyroscopes based on evolutionary computation that has the capacity to efficiently increase the sensitivity of MEMS gyroscopes through tuning and, furthermore, to find the optimally tuned configuration for this state of increased sensitivity. We present the results of an experiment to determine the speed and efficiency of an evolutionary algorithm applied to electrostatic tuning of MEMS micro gyros. The MEMS gyro used in this experiment is a pyrex post resonator gyro (PRG) in a closed-loop control system. A measure of the quality of tuning is given by the difference in resonant frequencies, or frequency split, for the two orthogonal rocking axes. The current implementation of the closed-loop platform is able to measure and attain a relative stability in the sub-millihertz range, leading to a reduction of the frequency split to less than 100 mHz.

Micro-Electro-Mechanical Systems (MEMS)↗

DOE OSTI2020

Benchmarking materials property prediction methods: the Matbench test set and Automatminer reference algorithm

Abstract We present a benchmark test suite and an automated machine learning procedure for evaluating supervised machine learning (ML) models for predicting properties of inorganic bulk materials. The test suite, Matbench, is a set of 13 ML tasks that range in size from 312 to 132k samples and contain data from 10 density functional theory-derived and experimental sources. Tasks include predicting optical, thermal, electronic, thermodynamic, tensile, and elastic properties given a material’s composition and/or crystal structure. The reference algorithm, Automatminer, is a highly-extensible, fully automated ML pipeline for predicting materials properties from materials primitives (such as composition and crystal structure) without user intervention or hyperparameter tuning. We test Automatminer on the Matbench test suite and compare its predictive power with state-of-the-art crystal graph neural networks and a traditional descriptor-based Random Forest model. We find Automatminer achieves the best performance on 8 of 13 tasks in the benchmark. We also show our test suite is capable of exposing predictive advantages of each algorithm—namely, that crystal graph methods appear to outperform traditional machine learning methods given ~10 4 or greater data points. We encourage evaluating materials ML algorithms on the Matbench benchmark and comparing them against the latest version of Automatminer.

36 MATERIALS SCIENCE↗

DOE OSTI2020

Applying Constrained Bayesian Optimization to the Design of Critical Experiments

Often when planning a criticality experiment, many design configurations are iteratively investigated with a Monte Carlo transport code. The goal is that the experiment will be optimal with respect to some variable, like the fraction of fissions occurring at a certain energy range, while simultaneously being critical. Unfortunately, the Monte Carlo transport simulations are expensive, which can ultimately limit the number of configurations that can be explored. In this work, we present how Gaussian processes (GPs) can be used as a reduced-order model in a constrained Bayesian optimization (CBO) algorithm to design a criticality experiment. The GPs replace the Monte Carlo transport simulations that explore the design space. The CBO algorithm efficiently identifies new points in the design space to run the Monte Carlo transport code while respecting the criticality constraint. It does so in a manner that both improves the accuracy of the GP and finds the approximate global optimum. We demonstrate the performance of CBO with the design of a Thermal Epithermal eXperiment (TEX) for the criticality safety validation of nuclear waste models of the Hanford Tank Farm.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

NASA NTRS2002

Retrieval Of Cloud Pressure And Chlorophyll Content Using Raman Scattering In GOME Ultraviolet Spectra

Reliable cloud pressure estimates are needed for accurate retrieval of ozone and other trace gases using satellite-borne backscatter ultraviolet (buv) instruments such as the global ozone monitoring experiment (GOME). Cloud pressure can be derived from buv instruments by utilizing the properties of rotational-Raman scattering (RRS) and absorption by O2-O2. In this paper we estimate cloud pressure from GOME observations in the 355-400 nm spectral range using the concept of a Lambertian-equivalent reflectivity (LER) surface. GOME has full spectral coverage in this range at relatively high spectral resolution with a very high signal-to-noise ratio. This allows for much more accurate estimates of cloud pressure than were possible with its predecessors SBUV and TOMS. We also demonstrate the potential capability to retrieve chlorophyll content with full-spectral buv instruments. We compare our retrieved LER cloud pressure with cloud top pressures derived from the infrared ATSR instrument on the same satellite. The findings confirm results from previous studies that showed retrieved LER cloud pressures from buv observations are systematically higher than IR-derived cloud-top pressure. Simulations using Mie-scattering radiative transfer algorithms that include O2-O2 absorption and RRS show that these differences can be explained by increased photon path length within and below cloud.

Atlas, Robert↗

DOE OSTI2024

Constant-Depth Preparation of Matrix Product States with Adaptive Quantum Circuits

Adaptive quantum circuits, which combine local unitary gates, midcircuit measurements, and feedforward operations, have recently emerged as a promising avenue for efficient state preparation, particularly on near-term quantum devices limited to shallow-depth circuits. Matrix product states (MPS) comprise a significant class of many-body entangled states, efficiently describing the ground states of one-dimensional gapped local Hamiltonians and finding applications in a number of recent quantum algorithms. Recently, it has been shown that the Affleck-Kennedy-Lieb-Tasaki state—a paradigmatic example of an MPS—can be exactly prepared with an adaptive quantum circuit of constant depth, an impossible feat with local unitary gates alone due to its nonzero correlation length [Smith , PRX Quantum 4, 020315 (2023)]. In this work, we broaden the scope of this approach and demonstrate that a diverse class of MPS can be exactly prepared using constant-depth adaptive quantum circuits, outperforming theoretically optimal preparation with unitary circuits. We show that this class includes short- and long-ranged entangled MPS, symmetry-protected topological (SPT) and symmetry-broken states, MPS with finite Abelian, non-Abelian, and continuous symmetries, resource states for MBQC, and families of states with tunable correlation length. Moreover, we illustrate the utility of our framework for designing constant-depth sampling protocols, such as for random MPS or for generating MPS in a particular SPT phase. We present sufficient conditions for particular MPS to be preparable in constant time, with global on-site symmetry playing a pivotal role. Altogether, this work demonstrates the immense promise of adaptive quantum circuits for efficiently preparing many-body entangled states and provides explicit algorithms that outperform known protocols to prepare an essential class of states. Published by the American Physical Society 2024

Smith, Kevin C. (ORCID:0000000223971518)↗

DOE OSTI2022

Experimental error mitigation using linear rescaling for variational quantum eigensolving with up to 20 qubits

Quantum computers have the potential to help solve a range of physics and chemistry problems, but noise in quantum hardware currently limits our ability to obtain accurate results from the execution of quantum-simulation algorithms. Various methods have been proposed to mitigate the impact of noise on variational algorithms, including several that model the noise as damping expectation values of observables. In this work, we benchmark various methods, including a new method proposed here. Here, we compare their performance in estimating the ground-state energies of several instances of the 1D mixed-field Ising model using the variational-quantum-eigensolver algorithm with up to 20 qubits on two of IBM's quantum computers. We find that several error-mitigation techniques allow us to recover energies to within 10% of the true values for circuits containing up to about 25 ansatz layers, where each layer consists of CNOT gates between all neighboring qubits and Y-rotations on all qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1994

Tomographic separation of composite spectra. 2: The components of 29 UW Canis Majoris

We have analyzed the UV photospheric lines of 29 CMa, a 4.39 day period, double-lined O-type spectroscopic binary. Archival data from International Ultraviolet Explorer (IUE)(28 spectra well distributed in oribital phase) were analyzed with several techniques. We find that the mass ratio is q = 1.20 +/- 0.16 (secondary more massive) based on three independent arguments. A tomography algorithm was used to produce the separate spectra of the two stars in six UV spectral regions. The MK spectral classifications of the primary and secondary, O7.5-8 Iab and O9.7 Ib, respectively, were estimated through a comparison of UV line ratios with those in spectral standard stars. The flux ratio of the stars in the UV is 0.36 +/- 0.07 (primary brighter). The primary has a strong P Cygni NIV wavelength 1718 feature, indicating a strong stellar wind. We also present tomographic reconstructions of visual spectral data in the range 4300-4950 A, based on seven observations of differing orbital phases, which confirm the UV classifications, and show that the primary is an Of star. From the spectral classifications, we estimate the temperatures of the stars to be 33,750 K and 29,000 K for primary and secondary, respectively. We then fit visual and UV light curves and show that reasonably good fits can be obtained with these temperatures, a semicontact configuration, an inclination of 74 deg. +/- 2 deg., and an intensity ratio r is less than 0.5.

Bagnuolo, William G., Jr.↗

NASA NTRS2001

Hyperspectral Image Classification using a Self-Organizing Map

The use of hyperspectral data to determine the abundance of constituents in a certain portion of the Earth's surface relies on the capability of imaging spectrometers to provide a large amount of information at each pixel of a certain scene. Today, hyperspectral imaging sensors are capable of generating unprecedented volumes of radiometric data. The Airborne Visible/Infrared Imaging Spectrometer (AVIRIS), for example, routinely produces image cubes with 224 spectral bands. This undoubtedly opens a wide range of new possibilities, but the analysis of such a massive amount of information is not an easy task. In fact, most of the existing algorithms devoted to analyzing multispectral images are not applicable in the hyperspectral domain, because of the size and high dimensionality of the images. The application of neural networks to perform unsupervised classification of hyperspectral data has been tested by several authors and also by us in some previous work. We have also focused on analyzing the intrinsic capability of neural networks to parallelize the whole hyperspectral unmixing process. The results shown in this work indicate that neural network models are able to find clusters of closely related hyperspectral signatures, and thus can be used as a powerful tool to achieve the desired classification. The present work discusses the possibility of using a Self Organizing neural network to perform unsupervised classification of hyperspectral images. In sections 3 and 4, the topology of the proposed neural network and the training algorithm are respectively described. Section 5 provides the results we have obtained after applying the proposed methodology to real hyperspectral data, described in section 2. Different parameters in the learning stage have been modified in order to obtain a detailed description of their influence on the final results. Finally, in section 6 we provide the conclusions at which we have arrived.

Martinez, P.↗

DOE OSTI2020

Optimized Lie–Trotter–Suzuki decompositions for two and three non-commuting terms

Lie–Trotter–Suzuki decompositions are an efficient way to approximate operator exponentials exp ( t H ) when H is a sum of n (non-commuting) terms which, individually, can be exponentiated easily. They are employed in time-evolution algorithms for tensor network states, digital quantum simulation protocols, path integral methods like quantum Monte Carlo, and splitting methods for symplectic integrators in classical Hamiltonian systems. Here, we provide optimized decompositions up to order t 6 . The leading error term is expanded in nested commutators (Hall bases) and we minimize the 1-norm of the coefficients. For n = 2 terms, several of the optima we find are close to those in McLachlan (1995). Generally, our results substantially improve over unoptimized decompositions by Forest, Ruth, Yoshida, and Suzuki. We explain why these decompositions are sufficient to efficiently simulate any one- or two-dimensional lattice model with finite-range interactions. This follows by solving a partitioning problem for the interaction graph.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Barrierless nucleation in glassy precursors drives zeolite formation

Zeolites are crystalline, microporous silicates widely used in catalysis and separations, yet the molecular mechanisms of their formation remain unresolved. Experiments indicate that hydrothermal synthesis of silica zeolites from clear solution proceeds through amorphous nanoaggregates that gradually develop zeolite order in an apparently continuous amorphous to crystal transformation. Here, we combine molecular simulations with advanced algorithms that identify zeolite order and computer vision to elucidate the pathway from clear solution to zeolite nanocrystal. We show that at conditions of hydrothermal synthesis of silica zeolites, the transformation of precursor aggregate into zeolite is not limited by nucleation barriers but by the slow dynamics of reorganization in the glassy precursor matrix. The negligible nucleation barriers result in spinodal-like crystallization that leads to a gradual formation of a mosaic of small crystallites that explain the seemingly continuous character of zeolite crystallization and the catalytic activity of X-ray amorphous, protozeolites and embryonic zeolites. We find that zeolite-like porosity and short-range order emerge early within glassy precursors, well before crystallinity is detected in transmission electron microscopy (TEM) images or X-ray diffraction. The nanoaggregate’s temperature-size phase diagram reveals a convergence of the zeolite–amorphous equilibrium and maximum crystallization rate at ~3 nm diameter nanoparticle diameters and ~200 °C. This convergence signals the termination of the first-order amorphous-to-zeolite transition. Our results provide a unifying framework for understanding nucleation of silica zeolites from solution and suggest that barrierless nucleation may govern the formation of other nanoparticle systems, including minerals and oxides synthesized far below their bulk melting points.

36 MATERIALS SCIENCE↗

DOE OSTI2025

Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem

Simon’s problem is to find a hidden period (a bitstring) encoded into an unknown 2-to-1 function. It is one of the earliest problems for which an exponential quantum speedup was proven for ideal, noiseless quantum computers, albeit in the oracle model. Here, using two different 127-qubit IBM Quantum superconducting processors, we demonstrate an algorithmic quantum speedup for a variant of Simon’s problem where the hidden period has a restricted Hamming weight 𝑤. For sufficiently small values of 𝑤 and for circuits involving up to 58 qubits, we demonstrate an exponential speedup, albeit of a lower quality than the speedup predicted for the noiseless algorithm. The speedup exponent and the range of 𝑤 values for which an exponential speedup exists are significantly enhanced when the computation is protected by dynamical decoupling. Further enhancement is achieved with measurement error mitigation. This case constitutes a demonstration of a bona fide quantum advantage for an Abelian hidden subgroup problem.

computation↗