Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized 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.

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

At least 1,459 records · Page 81
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

FedCSpc: A Cross-Silo Federated Learning System With Error-Bounded Lossy Parameter Compression

Cross-Silo federated learning is widely used for scaling deep neural network (DNN) training over data silos from different locations worldwide while guaranteeing data privacy. Communication has been identified as the main bottleneck when training large-scale models due to large-volume model parameters and gradient transmission across public networks with limited bandwidth. Most previous works focus on gradient compression, while limited work tries to compress parameters that can not be ignored and extremely affect communication performance during the training. Here, to bridge this gap, we propose FedCSpc: an efficient cross-silo federated learning system with an XAI-driven adaptive parameter compression strategy for large-scale model training. Our work substantially differs from existing gradient compression techniques due to the distinct data features of gradient and parameter. The key contributions of this paper are fourfold. (1) Our designed FedCSpc proposes to compress the parameter during the training using the state-of-the-art error-bounded lossy compressor – SZ3. (2) We develop an adaptive compression error bound adjustment algorithm to guarantee the model accuracy effectively. (3) We exploit an efficient approach to utilize the idle CPU resources of clients to compress the parameters. (4) We perform a comprehensive evaluation with a wide range of models and benchmarks on a GPU cluster with 65 GPUs. Results show that FedCSpc can achieve the same model accuracy as FedAvg while reducing the data volume of parameters and gradients in communication by up to 7.39× and 288×, respectively. With 32 clients on a 4 Gb size model, FedCSpc significantly outperforms FedAvg in wall-clock time in the emulated WAN environment (at the bandwidth of 1 Gbps or lower without loss of generality).

SZ3↗
DOE OSTI2024

EFIT-Prime: Probabilistic and physics-constrained reduced-order neural network model for equilibrium reconstruction in DIII-D

We introduce EFIT-Prime, a novel machine learning surrogate model for EFIT (Equilibrium FIT) that integrates probabilistic and physics-informed methodologies to overcome typical limitations associated with deterministic and ad hoc neural network architectures. EFIT-Prime utilizes a neural architecture search-based deep ensemble for robust uncertainty quantification, providing scalable and efficient neural architectures that comprehensively quantify both data and model uncertainties. Physically informed by the Grad–Shafranov equation, EFIT-Prime applies a constraint on the current density J tor and a smoothness constraint on the first derivative of the poloidal flux, ensuring physically plausible solutions. Furthermore, the spatial location of the diagnostics is explicitly incorporated in the inputs to account for their spatial correlation. Extensive evaluations demonstrate EFIT-Prime's accuracy and robustness across diverse scenarios, most notably showing good generalization on negative-triangularity discharges that were excluded from training. Timing studies indicate an ensemble inference time of 15 ms for predicting a new equilibrium, offering the possibility of plasma control in real-time, if the model is optimized for speed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Estimating cluster masses from SDSS multiband images with transfer learning

ABSTRACT The total masses of galaxy clusters characterize many aspects of astrophysics and the underlying cosmology. It is crucial to obtain reliable and accurate mass estimates for numerous galaxy clusters over a wide range of redshifts and mass scales. We present a transfer-learning approach to estimate cluster masses using the ugriz-band images in the SDSS Data Release 12. The target masses are derived from X-ray or SZ measurements that are only available for a small subset of the clusters. We designed a semisupervised deep learning model consisting of two convolutional neural networks. In the first network, a feature extractor is trained to classify the SDSS photometric bands. The second network takes the previously trained features as inputs to estimate their total masses. The training and testing processes in this work depend purely on real observational data. Our algorithm reaches a mean absolute error (MAE) of 0.232 dex on average and 0.214 dex for the best fold. The performance is comparable to that given by redMaPPer, 0.192 dex. We have further applied a joint integrated gradient and class activation mapping method to interpret such a two-step neural network. The performance of our algorithm is likely to improve as the size of training data set increases. This proof-of-concept experiment demonstrates the potential of deep learning in maximizing the scientific return of the current and future large cluster surveys.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

A Large-Scale Analysis to Optimize the Control and V2V Communication Protocols for CDA Agreement-Seeking Cooperation

Cooperative driving automation (CDA) Class C, agreement-seeking cooperation, is an innovative and practical solution that can promote cooperation among general passenger vehicles on the road. However, more comprehensive studies are needed before establishing the standard protocols of agreement-seeking cooperation, such as communication frequency and the duration of cooperation. Here, this article presents an initiative study on the impacts of communication capabilities on agreement-seeking cooperation. Through a large-scale analysis by regulating vehicle-to-vehicle (V2V) communication metrics, this work suggests desirable system parameters that can maximize the benefits of cooperation and ensure reliable operability while avoiding exhaustive communication loads. As the first step, an example agreement-seeking cooperation system is created for a car-following scenario, including decision-making and control algorithms for autonomous vehicles. Then, software-in-the-loop tests explore the performance of the developed system as it encounters various communication risks, such as latency and message packet drops. The system performance metrics are evaluated from various angles, including the time consumed for the agreement-seeking process, cooperation ratio, and the ratio of faulty cooperation. Energy saving from the cooperation is assessed by using simulation software that can run multiple high-fidelity vehicle models simultaneously. Based on the analyses, this article suggests the V2V communication requirements for the reliable operation of CDA agreement-seeking, which can be referred to when developing the standard protocols of agreement-seeking cooperation.

42 ENGINEERING↗
DOE OSTI2023

Characterizing and mitigating coherent errors in a trapped ion quantum processor using hidden inverses

Quantum computing testbeds exhibit high-fidelity quantum control over small collections of qubits, enabling performance of precise, repeatable operations followed by measurements. Currently, these noisy intermediate-scale devices can support a sufficient number of sequential operations prior to decoherence such that near term algorithms can be performed with proximate accuracy (like chemical accuracy for quantum chemistry problems). While the results of these algorithms are imperfect, these imperfections can help bootstrap quantum computer testbed development. Demonstrations of these algorithms over the past few years, coupled with the idea that imperfect algorithm performance can be caused by several dominant noise sources in the quantum processor, which can be measured and calibrated during algorithm execution or in post-processing, has led to the use of noise mitigation to improve typical computational results. Conversely, benchmark algorithms coupled with noise mitigation can help diagnose the nature of the noise, whether systematic or purely random. Here, we outline the use of coherent noise mitigation techniques as a characterization tool in trapped-ion testbeds. We perform model-fitting of the noisy data to determine the noise source based on realistic physics focused noise models and demonstrate that systematic noise amplification coupled with error mitigation schemes provides useful data for noise model deduction. Further, in order to connect lower level noise model details with application specific performance of near term algorithms, we experimentally construct the loss landscape of a variational algorithm under various injected noise sources coupled with error mitigation techniques. This type of connection enables application-aware hardware codesign, in which the most important noise sources in specific applications, like quantum chemistry, become foci of improvement in subsequent hardware generations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

A review of machine learning in building load prediction

The surge of machine learning in recent years has been empowering engineer modeling in various fields. The decreasing hardware cost, increasing data accessibility, and advances of building automation system (BAS) allow the collection and storage of a significant amount of building operation data. The two facts provide great opportunities of applying machine learning to building energy systems modeling and analysis. There are a great number of research papers on this topic but there lacks a comprehensive and general review to summarize the current development, limitations, gaps and future trend. In this review paper series, machine learning techniques in building energy system modeling and analysis are reviewed under the organization and logic of the machine learning definition by Tom M. Mitchell: a computer program is said to learn from experience E with respect to some class of tasks T and performance measure P if its performance at tasks in T, as measured by P, improves with experience E. This paper is the first part of the review paper series, which focuses on building load prediction. First, the applications of building load prediction model (task T) are reviewed. Then, the modeling algorithms improving machine learning performance and accuracy (performance P) are reviewed. At the same time, the literature on the data perspective for modeling (experience E), including data engineering from sensors level to data level, pre-processing, feature extraction and selection, is reviewed. Finally, what is well-studied and what is lacking but with great potential are concluded; the gaps between present and future utilization of machine learning techniques are identified; the future trend and development are also predicted. The target readers of this paper are not only researchers from the building side who can get exposed to cutting edge machine learning tools, but also those from machine learning side who can understand the potential and challenge to apply machine learning in buildings.

Liang, Zhang↗
DOE OSTI2019

Machine learning maximized Anderson localization of phonons in aperiodic superlattices

Nanostructuring materials to achieve ultra-low lattice thermal conductivity has proven to be extremely attractive for numerous applications such as thermoelectric energy conversion. Anderson localization of phonons due to aperiodicity can reduce thermal conductivity in superlattices, but the lower limit of thermal conductivity remains elusive due to the prohibitively large design space. In this work, we demonstrate that an intuition-based manual search for aperiodic superlattice structures (random multilayers or RMLs) with the lowest thermal conductivity yields only a local minimum, while a genetic algorithm (GA) based approach can efficiently identify the globally minimum thermal conductivity by only exploring a small fraction of the design space. Our results show that this minimum value occurs at an average RML period that is, surprisingly, smaller than the period corresponding to the minimum SL thermal conductivity. Interestingly, above this critical period, scattering of incoherent phonons at interfaces is less, whereas below this period, the room for randomization becomes less, thus putting more coherent phonons out of Anderson localization and causing increased thermal conductivity. Moreover, the lower limit of the thermal conductivity occurs at a moderate rather than maximum randomness of the layer thickness. Our machine learning approach demonstrates a general process of exploring an otherwise prohibitively large design space to gain non-intuitive physical insights.

42 ENGINEERING↗
DOE OSTI2021

Sub-10 nm Probing of Ferroelectricity in Heterogeneous Materials by Machine Learning Enabled Contact Kelvin Probe Force Microscopy

Reducing the dimensions of ferroelectric materials down to the nanoscale has strong implications on the ferroelectric polarization pattern and on the ability to switch the polarization. As the size of ferroelectric domains shrinks to the nanometer scale, the heterogeneity of the polarization pattern becomes increasingly pronounced, enabling a large variety of possible polar textures in nanocrystalline and nanocomposite materials. Critical to the understanding of fundamental physics of such materials and hence their applications in electronic nanodevices is the ability to investigate their ferroelectric polarization at the nanoscale in a nondestructive way. We show that contact Kelvin probe force microscopy (cKPFM) combined with a k-means response clustering algorithm enables to measure the ferroelectric response at a mapping resolution of 8 nm. In a BaTiO 3 thin film on silicon composed of tetragonal and hexagonal nanocrystals, we determine a nanoscale lateral distribution of discrete ferroelectric response clusters, fully consistent with the nanostructure determined by transmission electron microscopy. Moreover, we apply this data clustering method to the cKPFM responses measured at different temperatures, which allows us to follow the corresponding change in the polarization pattern as the Curie temperature is approached and across the phase transition. This work opens up perspectives for mapping complex ferroelectric polarization textures such as curled/swirled polar textures that can be stabilized in epitaxial heterostructures and more generally for mapping the polar domain distribution of any spatially highly heterogeneous ferroelectric materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Position Papers for the ASCR Workshop on Cybersecurity and Privacy for Scientific Computing Ecosystems

At the request of the Department of Energy's (DOE) Office of Advanced Scientific Computing Research (ASCR), this program committee has been tasked with organizing a workshop to identify basic research needs in cybersecurity and privacy to better support DOE's science and energy mission. As part of the process, the program committee is soliciting community input in the form of position papers to help identify significant use cases, facility issues, and other barriers to enabling verifiably trustworthy computational science while preserving data confidentiality as appropriate for scientific workflows of interest to DOE. The program committee will review these position papers and based on the fit of their area of expertise and interest, selected contributors will have the opportunity to participate in the workshop currently planned as a virtual event November 3-5th, 2021. The thrust areas that will be explored by this workshop are the following: (1) Algorithms for secure, scalable, privacy-enhancing technologies and frameworks, including: Federated AI/ML, Differential privacy, Randomized algorithms, Adversarial modeling & simulation, Graph algorithms, and Formal methods; (2) Platforms to support the entire scientific-computing ecosystem, including edge computing for large-scale experiments, focusing on heterogeneous systems and distributed systems, including: Heterogeneous computing systems, Distributed computing systems, and Secure data architectures; and (3) Data workflows to allow agile use of data while preserving integrity and privacy, making the important properties verifiable either at runtime or post-computation, including: Integrity and provenance and Data management infrastructure. Topics that are out-of-scope for the workshop include discussing specific proposed solutions or areas that are clearly out of DOE's fundamental and applied-sciences mission scope, e.g., cryptography, enterprise security, and general-operations technology.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Towards an Agent-Based Blackboard System for Reactor Design Optimization

The field of reactor design is rich with opportunities for applications of computational optimization algorithms; these applications can range from preliminary core design to reactor shuffling patterns. Many of these schemes rely on sets of previously generated solutions (sometimes referred to as “generations”) to inform future decisions. While it is important to build upon prior knowledge, this process requires a full generation of solutions to be formed before future solutions can be examined. Rather than relying on a generational scheme to perform an optimization, we propose using an agent-based approach in conjunction with a blackboard framework for performing reactor design optimizations. Utilizing an agent-based approach allows agents to perform tasks independently, while retaining the ability to build off of previous solutions. We develop an agent-based blackboard system (ABBS) for determining the Pareto front (PF) in sodium fast reactor design optimization problems and compared this with the Non-Dominated Sorting Genetic Algorithm II (NSGA-II). Our goal is to evaluate the viability of the ABBS in producing a PF that is comparable with the NSGA-II algorithm. The design space consists of the fuel height, fuel smear, and plutonium fraction in the core, and we seek to minimize the reactivity swing and plutonium mass, while maximizing the burnup. The diversity, coverage, and spread of the PFs generated by the two methods are examined, and the ABBS is able to converge to the same PF as the NSGA-II algorithm. These results show that the ABBS is able to find optimal designs that are similar to those found by the NSGA-II algorithm. We conclude our study by applying the ABBS to the design of a sodium-cooled fast reactor to dispose of weapons-grade plutonium. The ABBS finds a core design that can burn upwards of 17.5 kg of weapons-grade plutonium per year and degrade an additional 195 kg of weapons-grade plutonium per year into non-weapons-grade material.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2026

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Optimizing a magnitude-limited spectroscopic training sample for photometric classification of supernovae

ABSTRACT In preparation for photometric classification of transients from the Legacy Survey of Space and Time (LSST) we run tests with different training data sets. Using estimates of the depth to which the 4-m Multi-Object Spectroscopic Telescope (4MOST) Time Domain Extragalactic Survey (TiDES) can classify transients, we simulate a magnitude-limited sample reaching rAB ≈ 22.5 mag. We run our simulations with the software snmachine, a photometric classification pipeline using machine learning. The machine-learning algorithms struggle to classify supernovae when the training sample is magnitude limited, in contrast to representative training samples. Classification performance noticeably improves when we combine the magnitude-limited training sample with a simulated realistic sample of faint high-redshift supernovae observed from larger spectroscopic facilities; the algorithms’ range of average area under receiver operator characteristic curve (AUC) scores over 10 runs increases from 0.547–0.628 to 0.946–0.969 and purity of the classified sample reaches 95 per cent in all runs for two of the four algorithms. By creating new, artificial light curves using the augmentation software avocado, we achieve a purity in our classified sample of 95 per cent in all 10 runs performed for all machine-learning algorithms considered. We also reach a highest average AUC score of 0.986 with the artificial neural network algorithm. Having ‘true’ faint supernovae to complement our magnitude-limited sample is a crucial requirement in optimization of a 4MOST spectroscopic sample. However, our results are a proof of concept that augmentation is also necessary to achieve the best classification results.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Parametrized process characterization with reduced resource requirements

Quantum process tomography (QPT) is a powerful tool to characterize quantum operations, but it requires considerable resources, making it impractical for more than two-qubit systems. This study proposes an alternative approach that requires significantly fewer resources for unitary process characterization with a built-in method for state preparation and measurement error mitigation. By measuring the quantum process as rotated through the X and Y axes on the Bloch sphere, we can acquire enough information to reconstruct the quantum process matrix χ and measure its fidelity. We test the algorithm's performance against standard QPT using simulated and physical experiments on several IBM quantum processors and compare the resulting process matrices. We demonstrate with numerical experiments that the method can improve gate fidelity via a noise reduction in the imaginary part of the process matrix, along with a stark decrease in the number of experiments needed to perform the characterization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Measurement of the production of charm jets tagged with D0 mesons in pp collisions at $\sqrt{s}$ = 5.02 and 13 TeV

The measurement of the production of charm jets, identified by the presence of a D 0 meson in the jet constituents, is presented in proton–proton collisions at centre-of-mass energies of $\sqrt{s}$= 5.02 and 13 TeV with the ALICE detector at the CERN LHC. The D 0 mesons were reconstructed from their hadronic decay D 0 → K – π + and the respective charge conjugate. Jets were reconstructed from D 0 -meson candidates and charged particles using the anti-k T algorithm, in the jet transverse momentum range 5 < p T,chjet < 50 GeV/c, pseudorapidity |η jet | < 0.9 – R, and with the jet resolution parameters R = 0.2, 0.4, 0.6. The distribution of the jet momentum fraction carried by a D 0 meson along the jet axis $\left({z}_{\Big\Vert}^{\textrm{ch}}\right)$ was measured in the range 0.4 < ${z}_{\Big\Vert}^{\textrm{ch}}$ < 1.0 in four ranges of the jet transverse momentum. Comparisons of results for different collision energies and jet resolution parameters are also presented. The measurements are compared to predictions from Monte Carlo event generators based on leading-order and next-to-leading-order perturbative quantum chromodynamics calculations. A generally good description of the main features of the data is obtained in spite of a few discrepancies at low p T,chjet . Measurements were also done for R = 0.3 at $\sqrt{s}$= 5.02 and are shown along with their comparisons to theoretical predictions in an appendix to this paper.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Circumventing superexponential runtimes for hard instances of quantum adiabatic optimization

Classical optimization problems can be solved by adiabatically preparing the ground state of a quantum Hamiltonian that encodes the problem. The performance of this approach is determined by the smallest gap encountered during the evolution. Here, we consider the maximum independent set problem, which can be efficiently encoded in the Hamiltonian describing a Rydberg atom array. We present a general construction of instances of the problem for which the minimum gap decays superexponentially with system size, implying a superexponentially large time to solution via adiabatic evolution. The small gap arises from locally independent choices which cause the system to initially evolve and localize into a configuration far from the solution in terms of Hamming distance. We investigate remedies to this problem. Specifically, we show that quantum quenches in these models can exhibit signatures of quantum many-body scars, which in turn, can circumvent the superexponential gaps. By quenching from a suboptimal configuration, states with a larger ground-state overlap can be prepared, illustrating the utility of quantum quenches as an algorithmic tool. Published by the American Physical Society 2024

Schiffer, Benjamin F. (ORCID:0000000189512157)↗
DOE OSTI2021

Two-phase accurate multiplexed structured image capture (2pAc-MUSIC)

Multiplexed Structural Image Capture (MUSIC) technique uses modulation of light from a scene prior to imaging to encode the temporal evolution of target into spatial frequency shifts, with each shift corresponding to a unique time and resulting in individual distinct snapshots. Computational-processing of the multiplexed single-shot image can recover the nanosecond-resolution scene evolution. One of the limitations is the loss of spatial resolution of the recovered image due to limitations of the low-pass spatial frequency filtering depth. Here we demonstrated that two images with complementary spatial phases can be used to enhance the spatial resolutions. For this application, 2 Phase Accurate (2pAc)-MUSIC is implemented that a scene is encoded with two complementary phases. The increased spatial information captured reduces the lower frequency noise in the Fourier domain found in single-phase MUSIC. A recovery algorithm combines the 180-degree spatial frequency shifted images into a single scene and applies a spatial filter in the Fourier domain that has a larger depth than previously possible to achieve a scene with increased spatial resolution. The 2pAc-MUSIC can effectively enhance the spatial resolution by removing the overlapping zero-order spatial frequencies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Compact spectroscopy of keV to MeV X-rays from a laser wakefield accelerator

We reconstruct spectra of secondary X-rays from a tunable 250–350 MeV laser wakefield electron accelerator from single-shot X-ray depth-energy measurements in a compact (7.5 × 7.5 × 15 cm), modular X-ray calorimeter made of alternating layers of absorbing materials and imaging plates. X-rays range from few-keV betatron to few-MeV inverse Compton to > 100 MeV bremsstrahlung emission, and are characterized both individually and in mixtures. Geant4 simulations of energy deposition of single-energy X-rays in the stack generate an energy-vs-depth response matrix for a given stack configuration. An iterative reconstruction algorithm based on analytic models of betatron, inverse Compton and bremsstrahlung photon energy distributions then unfolds X-ray spectra, typically within a minute. We discuss uncertainties, limitations and extensions of both measurement and reconstruction methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Analysis techniques for blob properties from gas puff imaging data

Filamentary structures, also known as blobs, are a prominent feature of turbulence and transport at the edge of magnetically confined plasmas. They cause cross-field particle and energy transport and are, therefore, of interest in tokamak physics and, more generally, nuclear fusion research. Several experimental techniques have been developed to study their properties. Among these, measurements are routinely performed with stationary probes, passive imaging, and, in more recent years, Gas Puff Imaging (GPI). In this work, we present different analysis techniques developed and used on 2D data from the suite of GPI diagnostics in the Tokamak à Configuration Variable, featuring different temporal and spatial resolutions. Although specifically developed to be used on GPI data, these techniques can be employed to analyze 2D turbulence data presenting intermittent, coherent structures. We focus on size, velocity, and appearance frequency evaluation with, among other methods, conditional averaging sampling, individual structure tracking, and a recently developed machine learning algorithm. We describe in detail the implementation of these techniques, compare them against each other, and comment on the scenarios to which these techniques are best applied and on the requirements that the data must fulfill in order to yield meaningful results.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗