Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Real numbers”

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

Machine Learning for Neutron Resonance Evaluations [Slides]

The performance of nuclear reactors and other nuclear systems depends on a precise understanding of the neutron interaction cross sections for materials used in these systems. These cross sections exhibit a resonance structure whose shape is determined in part by the angular momentum quantum numbers of the resonances. The correct assignment of the quantum numbers of neutron resonances is therefore of paramount importance. In this presentation, we describe the application of machine learning to automate the quantum number assignments. Scikit-learn classifiers were trained on simulated resonance data whose statistical properties were chosen to mimic real data. We explored the use of several physics (and random matrix theory)-motivated features for training the classifiers, including the nearest neighbor spacing distribution, cumulative level distribution, and channel width distributions. Initial results demonstrated that we can determine resonance spin groups somewhat reliably. We are now investigating the application of our approach to 52 Cr resonance data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Virtual Log-Structured Storage for High-Performance Streaming

Over the past decade, given the higher number of data sources (e.g., Cloud applications, Internet of things) and critical business demands, Big Data transitioned from batch-oriented to real-time analytics. Stream storage systems, such as Apache Kafka, are well known for their increasing role in real-time Big Data analytics. For scalable stream data ingestion and processing, they logically split a data stream topic into multiple partitions. Stream storage systems keep multiple data stream copies to protect against data loss while implementing a stream partition as a replicated log. This architectural choice enables simplified development while trading cluster size with performance and the number of streams optimally managed. This paper introduces a shared virtual log-structured storage approach for improving the cluster throughput when multiple producers and consumers write and consume in parallel data streams. Stream partitions are associated with shared replicated virtual logs transparently to the user, effectively separating the implementation of stream partitioning (and data ordering) from data replication (and durability). We implement the virtual log technique in the KerA stream storage system. When comparing with Apache Kafka, KerA improves the cluster ingestion throughput by up to 4x when multiple producers write over hundreds of data streams.

consistent stream ordering↗

Initial design concepts for solid boron injection in ITER

As part of ITER’s consideration to change its first wall material from beryllium to tungsten, the ITER Organization has proposed studying the feasibility of real-time solid boron injection (SBI) into the plasma to coat the walls and divertor to supplement glow discharge boronization (GDB). Boron deposits getter oxygen and reduce sputtering of tungsten from plasma facing components (PFCs). Particularly in areas with significant plasma wall interactions, boron coatings are expected to be short-lived under high performance plasma conditions. The proposed SBI system aims to maintain boron layers in these areas to avoid excessive radiation from tungsten in the plasma as a risk mitigation to ensure ITER will be able to reach and sustain Q = 10 conditions. The system will be used sparingly, as redeposition of boron can lead to significant tritium retention, which must be minimized in ITER to comply with nuclear safety concerns. SBI is proposed to limit and precisely control the amount of boron injected in real-time during plasma operation. Here, some of the design requirements and initial concepts for an SBI system in ITER are presented based on previous results carried out with SBI systems on a number of tokamaks and stellarators around the world. Previous results using SBI systems installed by PPPL have injected boron particles from 5 µm–2 mm diameter at calibrated rates of 2–200 mg/s in real-time during plasma operation on AUG, DIII-D, EAST, KSTAR, LHD, TFTR, WEST, and W7-X, leading to improved wall conditions with reduced plasma impurity concentrations and radiated power and improved plasma performance. The boron is ionized in the plasma edge and then deposited on plasma-wetted surfaces. On AUG, EAST and WEST reduced tungsten sputtering sources were observed following several discharges with SBI. Extrapolation of these SBI results are presented to estimate the amount of boron needed for wall conditioning in ITER. Real-time SBI control requirements and plasma operation scenarios for ITER are also described.

36 MATERIALS SCIENCE↗

Development and assessment of a reactor system prognosis model with physics-guided machine learning

Autonomous control systems provide recommendations to help operators in decision-making during plant operations ranging from normal operation to accident management. An important step of autonomous control is prognosis. In nuclear engineering domain, prognosis is the process of predicting future conditions of a system or equipment based on present signs and symptoms of a fault. The prognosis model allows predicting future reactor states for possible candidate control strategies so that the outcomes can be evaluated to determine the best control strategy. The prognosis model requires representing direct relationships between the symptoms and the predictions. In nuclear engineering, computational simulations are approximate representations of the operation of the real system. However, prognosis with computational simulations requires high computation power and time due to possible large number of scenarios. Necessary computation resources can be reduced with machine learning (ML) approach for fast predictions by building a surrogate function using the simulation data. A critical issue is, ML models are ignorant of physical knowledge, and these models approximate statistical relationships between the system variables. This ignorance can produce results that are inconsistent with physical laws, even if an optimal result is achieved from a mathematical point of view. Physics-guided machine learning (PGML) is an approach to tackle this issue. Here, this work formulates and illustrates a framework to guide development and assessment of the ML-based prognosis model for autonomous control systems. The development of the prognosis model considers the training of a ML model which consists of optimizing many aspects of the ML approach. The assessment of the prognosis model considers training data limitations and uncertainties of the ML approach. Prognosis models with standalone ML and PGML are developed and assessed on the loss-of-flow scenario of Experimental Breeder Reactor II. The results indicate that PGML based prognosis model has the best performance compared to other prognosis models.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

DESC: A stellarator equilibrium solver

In this paper, the new code DESC is presented to solve for fixed-boundary ideal magnetohydrodynamic equilibria in stellarators. The approach directly solves the equilibrium force balance as a system of nonlinear equations in the form f(x) = 0. The independent variables x represent nested magnetic flux surfaces expressed in the inverse representation with toroidal flux coordinates, and the equations f(x) quantify equilibrium force balance errors at discrete points in real space. Discretizing with global Fourier–Zernike basis functions properly treats the magnetic axis and minimizes the number of coefficients needed to describe the flux surfaces. The pseudospectral method provides great flexibility in where the errors are evaluated, and the system of equations is efficiently solved with a Newton–Raphson iteration. Equilibria are computed and compared against VMEC for both axisymmetric and non-axisymmetric examples. The results show fast convergence rates and solutions with low errors throughout the plasma volume.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Generalized Mercier stability criterion for stellarators

The Mercier criterion is a well-known stability criterion for tokamaks. It is derived from a 2 × 2 matrix eigenvalue problem arising from the expansion of resonant solutions about a singular surface where m−nq=0, with m and n being the poloidal and toroidal mode numbers, respectively, and q being the safety factor. The stability criterion is that the eigenvalues must be real, otherwise, the solution oscillates, violating the Newcomb crossing criterion. Because of the non-axisymmetry of stellarators, different toroidal as well as poloidal harmonics couple to each other. It follows that each singular surface can have multiple resonant harmonics, with multiplicity M≥1. The corresponding matrix eigenvalue problem involves a 2M×2M matrix, resulting in M pairs of positive and negative eigenvalues. The generalized stability criterion is that all eigenvalues must be real. While the original Mercier criterion can be expressed in terms of quadratures of equilibrium quantities over the singular surface, which can be evaluated anywhere, the generalized Mercier criterion can only be evaluated on rational q surfaces with a given set of resonant harmonics.

Physics↗

Constraining primordial non-Gaussianity from DESI quasar targets and Planck CMB lensing

We detect the cross-correlation between 2.7 million DESI quasar targets across 14,700 deg 2 (180 quasars deg -2 ) and Planck 2018 CMB lensing at ~30σ. We use the cross-correlation on very large scales to constrain local primordial non-Gaussianity via the scale dependence of quasar bias. The DESI quasar targets lie at an effective redshift of 1.51 and are separated into four imaging regions of varying depth and image quality. We select quasar targets from Legacy Survey DR9 imaging, apply additional flux and photometric redshift cuts to improve the purity and reduce the fraction of unclassified redshifts, and use early DESI spectroscopy of 194,000 quasar targets to determine their redshift distribution and stellar contamination fraction (2.6%). Due to significant excess large-scale power in the quasar autocorrelation, we apply weights to mitigate contamination from imaging systematics such as depth, extinction, and stellar density. We use realistic contaminated mocks to determine the greatest number of systematic modes that we can fit, before we are biased by overfitting and spuriously remove real power. We find that linear regression with one to seven imaging templates removed per region accurately recovers the input cross-power, f NL and linear bias. As in previous analyses, our fNL constraint depends on the linear primordial non-Gaussianity bias parameter, b Φ = 2(b - p)δ c assuming universality of the halo mass function. We measure f NL = -26 +45 -40 with p = 1.6 (f NL = -18 +29 -27 with p = 1.0), and find that this result is robust under several systematics tests. Future spectroscopic quasar cross-correlations with Planck lensing can tighten the f NL constraints by a factor of 2 if they can remove the excess power on large scales in the quasar auto power spectrum.

79 ASTRONOMY AND ASTROPHYSICS↗

SO(3)-invariant PCA with application to molecular data

Principal component analysis (PCA) is a fundamental technique for dimensionality reduction and denoising; however, its application to three-dimensional data with arbitrary orientations -- common in structural biology -- presents significant challenges. A naive approach requires augmenting the dataset with many rotated copies of each sample, incurring prohibitive computational costs. In this paper, we extend PCA to 3D volumetric datasets with unknown orientations by developing an efficient and principled framework for SO(3)-invariant PCA that implicitly accounts for all rotations without explicit data augmentation. By exploiting underlying algebraic structure, we demonstrate that the computation involves only the square root of the total number of covariance entries, resulting in a substantial reduction in complexity. We validate the method on real-world molecular datasets, demonstrating its effectiveness and opening up new possibilities for large-scale, high-dimensional reconstruction problems.

Fraiman, Michael [Tel Aviv Univ., Tel Aviv (Israel↗

Performance Prediction of Big Data Transfer Through Experimental Analysis and Machine Learning

Big data transfer in next-generation scientific applications is now commonly carried out over connections with guaranteed bandwidth provisioned in High-performance Networks (HPNs) through advance bandwidth reservation. To use HPN resources efficiently, provisioning agents need to carefully schedule data transfer requests and allocate appropriate bandwidths. Such reserved bandwidths, if not fully utilized by the requesting user, could be simply wasted or cause extra overhead and complexity in management due to exclusive access. This calls for the capability of performance prediction to reserve bandwidth resources that match actual needs. Towards this goal, we employ machine learning algorithms to predict big data transfer performance based on extensive performance measurements, which are collected over a span of several years from a large number of data transfer tests using different protocols and toolkits between various end sites on several real-life physical or emulated HPN testbeds. We first identify a comprehensive list of attributes involved in a typical big data transfer process, including end host system configurations, network connection properties, and control parameters of data transfer methods. We then conduct an in-depth exploratory analysis of their impacts on application-level throughput, which provides insights into big data transfer performance and motivates the use of machine learning. We also investigate the applicability of machine learning algorithms and derive their general performance bounds for performance prediction of big data transfer in HPNs. Experimental results show that, with appropriate data preprocessing, the proposed machine learning-based approach achieves 95% or higher prediction accuracy in up to 90% of the cases with very noisy real-life performance measurements.

Yun, Daqing↗

Real-Time Regional PV Spinning Reserve Estimator with AGC Look-Ahead Windows

Curtailed PV generation is a zero-marginal cost spinning reserve that can be used for a number of active power control services. However, unlike the traditional spinning reserve providers, i.e., fossil-fueled generators, who have well-defined operating characteristics, e.g., available headroom or potential high limit (PHL), PV plants have by nature variable and uncertain operating characteristics. To ensure the effective coordination between PV plants and the system operator during an active power control event, accurate forecasts of the PV PHL are essential. A novel reference-control grouping based scaling method has been proposed by NREL to estimate the PV PHL in real-time. This work further enhances the methodology by: 1) improving the model accuracy through machine learning; 2) considering look-ahead windows introduced by the computation and communication latencies; 3) applying the method to regional spinning reserve estimation. A significant performance improvement, over 99% of estimation error reduction, has been observed based on real-world data collected by CAISO and PV plant operators.

potential high limit↗

Real-Time Distributed Control of Smart Inverters for Network-level Optimization

The limitations of centralized optimization methods in managing electric power distribution systems operations have led to the distributed paradigm of computing and decision-making. Unfortunately, the existing distributed optimization algorithms are limited in their applicability to managing fast varying phenomena such as those resulting from highly variable Distributed Energy Resource (DER) generation patterns. They require a large number of communication rounds (in the order of 10 2 to 10 3 ) among the computing agents to solve one instance of the optimization problem. Related real-time distributed control methods are equally limited in their applications to power distribution systems with fast-changing DER generation; they require hundreds of rounds of communication and thus are slow in tracking the network-level optimal solutions. In this paper, we propose a novel distributed voltage controller that provides a fast-tracking of rapidly varying DER generation profiles while simultaneously converging to network-level optimal solutions within a few communication rounds. The proposed control algorithm leverages the radial topology of the system, which reduces the required communication rounds to reach the network-level optimum solution by order of magnitude. The novelty lies in carefully reducing the electrical network model from the perspective of each distributed controller and enabling appropriate data sharing among upstream and downstream nodes to achieve fast convergence. The simulation results demonstrate the effectiveness of the proposed approach in minimizing the feeder losses while maintaining the node voltage within the pre-specified limits.

voltage control, optimization, reactive power, inv↗

Real-Time Regional PV Spinning Reserve Estimator with AGC Look-Ahead Windows: Preprint

Curtailed PV generation is a zero-marginal cost spinning reserve that can be used for a number of active power control services. However, unlike the traditional spinning reserve providers, i.e., fossil-fueled generators, who have well-defined operating characteristics, e.g., available headroom or potential high limit (PHL), PV plants have by nature variable and uncertain operating characteristics. To ensure the effective coordination between PV plants and the system operator during an active power control event, accurate forecasts of the PV PHL are essential. A novel reference-control grouping based scaling method has been proposed by NREL to estimate the PV PHL in real-time. This work further enhances the methodology by: 1) improving the model accuracy through machine learning; 2) considering look-ahead windows introduced by the computation and communication latencies; 3) applying the method to regional spinning reserve estimation. A significant performance improvement, over 1.6% of estimation error reduction, has been observed based on real-world data collected by CAISO and PV plant operators.

potential high limit↗

On extraction of twist-two Compton form factors from DVCS observables through harmonic analysis

We investigate the exercise of locally extracting the real and imaginary parts of the four twist-2 Compton form factors (CFFs) {$\mathcal{H,E,\tilde H,\tilde E}$} which arise in the deeply virtual Compton scattering (DVCS) process e + p → e + p + y. Neglecting dynamical higher-twist contributions, we find that there are a sufficient number of DVCS observables and degrees of freedom to extract all 8 leading quantities model-independently, exploiting the azimuthal dependence of the absolute cross sections across all possible beam and target polarizations at a common kinematical point in {Q, t,x b , y}. As an example, for typical JLab lab-frame kinematics, we simplify the reduced DVCS observables to their dominant terms, providing a sufficient number of equations for local determination of the twist-2 CFFs. We demonstrate the feasibility using harmonic fitting to both cross sections and beam spin asymmetries with both real and pseudo-data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The eROSITA Final Equatorial-Depth Survey (eFEDS)

In 2019, the eROSITA telescope on board the Russian-German satellite Spectrum-Roentgen-Gamma (SRG) began to perform a deep all-sky X-ray survey with the aim of identifying ~100 000 clusters and groups over the course of four years. As part of its performance verification phase, a ~140 deg 2 survey, called eROSITA Final Equatorial-Depth Survey (eFEDS), was performed. With a depth typical of the all-sky survey after four years, it allows tests of tools and methods as well as improved predictions for the all-sky survey. As part of this effort, a catalog of 542 X-ray selected galaxy group and cluster candidates was compiled. Here, in this paper, we present the optical follow-up, with the aim of providing redshifts and cluster confirmation for the full sample. Furthermore, we aim to provide additional information on the dynamical state, richness, and optical center of the clusters. Finally, we aim to evaluate the impact of optical cluster confirmation on the purity and completeness of the X-ray selected sample. We used optical imaging data from the Hyper Suprime-Cam Subaru Strategic Program and from the Legacy Survey to identify optical counterparts to the X-ray detected cluster candidates. We make use of the multi-component matched filter cluster confirmation tool (MCMF), as well as of the optical cluster finder CAMIRA to derive cluster redshifts and richnesses. MCMF provided the probabilities with which an optical structure would be a chance superposition with the X-ray candidate. These probabilities were used to identify the best optical counterpart as well as to confirm an X-ray candidate as a cluster. The impact of this confirmation process on catalog purity and completeness was estimated using optical to X-ray scaling relations as well as simulations. The resulting catalog was furthermore matched with public group and cluster catalogs. Optical estimators of the cluster dynamical state were constructed based on density maps of the red-sequence galaxies at the cluster redshift. By providing redshift estimates for all 542 candidates, we construct an optically confirmed sample of 477 clusters and groups with a residual contamination of 6%. Of these, 470 (98.5%) are confirmed using MCMF, and 7 systems are added through cross-matching with spectroscopic group catalogs. Using observable-to-observable scaling and the applied confirmation threshold, we predict that 8 ± 2 real systems have been excluded with the MCMF cut required to build this low-contamination sample. This number agrees well with the 7 systems found through cross-matching that were not confirmed with MCMF. The predicted redshift and mass distribution of this catalog agree well with simulations. Thus, we expect that these 477 systems include >99% of all true clusters in the candidate list. Using an MCMF-independent method, we confirm that the catalog contamination of the confirmed subsample is 6 ± 3%. Application of the same method to the full candidate list yields 17 ± 3%, consistent with estimates coming from the fraction of confirmed systems of ~17% and with expectations from simulations of ~20%. We also present a sample of merging cluster candidates based on the derived estimators of the cluster dynamical state.

79 ASTRONOMY AND ASTROPHYSICS↗

Refining Jets for CMS Run 3 using Fast Simulation

As the LHC moves into its high-luminosity phase, the CMS experiment must handle more complex data collected at much higher rates. While the Geant4-based simulation application (FullSim) provides highly accurate simulation to complement real data, FullSim’s intensive consumption of computing resources becomes an increasing liability as the rates increase, while faster tools offer an advantage. The fast MC production application (FastSim) delivers a complete simulation with a factor of 10 speedup over FullSim, but introduces inaccuracies in some observables. A specialized refinement method, Fast Perfekt, employs machine learning to improve the accuracy of FastSim. An initial report of this work focused on the refinement of jet flavor tagging observables. This article presents an update on the refinement, focusing on PUPPI jets with Run 3 data-taking conditions. Refinement is extended to include jet transverse momentum as well as its propagation to missing transverse momentum. A gridbased framework and real-time monitoring system have been developed to facilitate optimization and scaling of the refinement to a large number of target variables.

Güngördü, Açelya Deniz [Istanbul Tech. U.]↗

Preparing exact eigenstates of the open XXZ chain on a quantum computer

The open spin-1/2 XXZ spin chain with diagonal boundary magnetic fields is the paradigmatic example of a quantum integrable model with open boundary conditions. Here, we formulate a quantum algorithm for preparing Bethe states of this model, corresponding to real solutions of the Bethe equations. The algorithm is probabilistic, with a success probability that decreases with the number of down spins. For a Bethe state of L spins with M down spins, which contains a total of $(^{L}_{M})$ $2^{M} M!$ terms, the algorithm requires L+M 2 +2M qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimizers for stabilizing likelihood-free inference

A growing number of applications in particle physics and beyond use neural networks as unbinned likelihood ratio estimators applied to real or simulated data. Precision requirements on the inference tasks demand a high-level of stability from these networks, which are affected by the stochastic nature of training. We show how physics concepts can be used to stabilize network training through a physics-inspired optimizer. In particular, the energy conserving descent (ECD) optimization framework uses classical Hamiltonian dynamics on the space of network parameters to reduce the dependence on the initial conditions while also stabilizing the result near the minimum of the loss function. We develop a version of this optimizer known as , which has few free hyperparameters with limited ranges guided by physical reasoning. We apply to representative likelihood-ratio estimation tasks in particle physics and find on average that it out-performs the widely used Adam optimizer. We expect that ECD will be a useful tool for wide array of data-limited problems, where it is computationally expensive to exhaustively optimize hyperparameters and mitigate fluctuations with ensembling.

Monte Carlo methods↗

Optimal Traffic Signal Control Using Priority Metric Based on Real-Time Measured Traffic Information

Optimizing traffic control systems at traffic intersections can reduce network-wide fuel consumption as well as improve traffic flow. While traffic signals have conventionally been controlled based on predetermined schedules, various adaptive control systems have been developed recently using advanced sensors such as cameras, radars, and LiDARs. By utilizing rich traffic information enabled by the advanced sensors, more efficient or optimal traffic signal control is possible in response to varying traffic conditions. This paper proposes an optimal traffic signal control method to minimize network-wide fuel consumption utilizing real-time traffic information provided by advanced sensors. This new method employs a priority metric calculated by a weighted sum of various factors, including the total number of vehicles, total vehicle speed, vehicle waiting time, and road preference. Genetic Algorithm (GA) is used as a global optimization method to determine the optimal weights in the priority metric. In order to evaluate the effectiveness of the proposed method, a traffic simulation model is developed in a high-fidelity traffic simulation environment called SUMO, based on a real-world traffic network. The traffic flow within this model is simulated using actual measured traffic data from the traffic network, enabling a comprehensive assessment of the novel optimal traffic signal control method in realistic conditions. The simulation results show that the proposed priority metric-based real-time traffic signal control algorithm can significantly reduce network-wide fuel consumption compared to the conventional fixed-time control and coordinated actuated control methods that are currently used in the modeled network. Additionally, incorporating truck priority in the priority metric leads to further improvements in fuel consumption reduction.

47 OTHER INSTRUMENTATION↗