SEARCH · Search NASA

Results for “test vector”

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 415 records · Page 23

All sources NASA NTRS DOE OSTI

DOE OSTI2022

High-Gradient Wien Spin Rotators at Jefferson Lab

Nuclear physics experiments performed in the Continuous Electron Beam Accelerator Facility (CEBAF) at Jefferson Laboratory (JLab) require spin manipulation of electron beams. Two Wien spin rotators in the injector keV region are essential at CEBAF to establish longitudinal polarization at the end station target, and to flip the polarization direction by ? rad to rule out false asymmetries. In a Wien filter, the homogeneous and independent electric and magnetic fields, along with the velocity vectors of the electrons that traverse it, form a mutually orthogonal system. The magnitude of the electrostatic field, established by biasing two highly-polished electrodes, defines the desired spin angle at the target yet deviates the beam trajectory due to the Lorentz force. The beam trajectory in the Wien is then re-established by adjusting the magnetic field, induced by an electromagnet encasing the device vacuum chamber. This contribution describes the evolution design and high voltage testing of Wien filters for spin manipulation at increased beam energies in the keV injector region, required by high precision parity violation experiments like MOLLER.

Palacios Serrano, G. G.↗

DOE OSTI2020

Search for New Bosons in Gluon-Gluon and Vector Boson Fusion Processes at the LHC and Development of Silicon Module Assembly Techniques for the CMS High Granularity Calorimeter

A search for heavy resonances decaying to a pair of vectors bosons is presented which utilizes events in which a hadronically decaying Z or W boson is identified using jet substructure techniques and large missing transverse momentum is found. Data analyzed were recorded by the Compact Muon Solenoid experiment at the CERN Large Hadron Collider in 2016, 2017, and 2018, and correspond to 137 fb$^{-1}$ . The events are categorized as having arisen from Vector Boson Fusion process or not, and are characterized by their transverse mass distribution. The standard model backgrounds are estimated based on observed yields in control regions. No excess of events above the expected SM background are observed and limits are placed on the production cross section of Radion (spin-0), Wprime (spin-1) and Bulk graviton (spin2) particles. In adiditon, the high luminosity LHC and the CMS HGCAL upgrade are also presented. The assembly techniques and various tests for the Silicon module and the cassette are discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2022

High-Gradient Wien Spin Rotators at Jefferson Lab

Palacios Serrano, G. G.↗

DOE OSTI2026

Feature-Based PMU Event Classification under Variable PMU Participation and Overlapping Events

Danovo Energy Solution's presented its paper named: Feature-Based PMU Event Classification under Variable PMU Participation and Overlapping Events at the 2026 Georgia Tech Fault & Disturbance Analysis Conference. The full paper can be found at OSTI ID# 3169150 Paper Abstract—Phasor Measurement Units (PMUs) stream time synchronized, high-resolution measurements from the grid, enabling data-driven techniques for event detection and classification. Accurate event classification improves grid reliability and stability. Events can be detected by varying numbers of PMUs and exhibit different durations depending on the event type. This variability challenges standard classifiers that require uniform input sizes. Moreover, multiple events may coincide, which increases classification complexity. Standard classifiers assign each instance to the class with the highest predicted probability, whereas overlapping events may exhibit comparable probabilities across multiple classes. In this study, to handle data size variability, we extract a wide range of time–frequency domain features from all available PMUs for each event into a fixed-length vector, facilitating the application of standard machine learning classifiers, including Random Forest, XGBoost, LightGBM, Support Vector Machine, and Multilayer Perceptron. To account for overlapping events, a probabilistic post-processing step is applied. For a given data instance, if multiple predicted class probabilities exceed 30% and the differences between them are less than 10%, the event is assigned to multiple classes. Experiments using real-world PMU data demonstrate that the Random Forest and XGBoost models achieve the highest accuracy, while the proposed post-processing method yields perfect classification performance on external unseen test sets.

Nematirad, Reza [Danova Energy Solutions]↗

DOE OSTI2026

Feature-Based PMU Event Classification under Variable PMU Participation and Overlapping Events

This paper is the basis for a presentation help at the 2026 Georgia Tech Fault & Disturbance Analysis Conference, which can be found at OSTI # 3168287 Paper Abstract—Phasor Measurement Units (PMUs) stream time synchronized, high-resolution measurements from the grid, enabling data-driven techniques for event detection and classification. Accurate event classification improves grid reliability and stability. Events can be detected by varying numbers of PMUs and exhibit different durations depending on the event type. This variability challenges standard classifiers that require uniform input sizes. Moreover, multiple events may coincide, which increases classification complexity. Standard classifiers assign each instance to the class with the highest predicted probability, whereas overlapping events may exhibit comparable probabilities across multiple classes. In this study, to handle data size variability, we extract a wide range of time–frequency domain features from all available PMUs for each event into a fixed-length vector, facilitating the application of standard machine learning classifiers, including Random Forest, XGBoost, LightGBM, Support Vector Machine, and Multilayer Perceptron. To account for overlapping events, a probabilistic post-processing step is applied. For a given data instance, if multiple predicted class probabilities exceed 30% and the differences between them are less than 10%, the event is assigned to multiple classes. Experiments using real-world PMU data demonstrate that the Random Forest and XGBoost models achieve the highest accuracy, while the proposed post-processing method yields perfect classification performance on external unseen test sets.

Nematirad, Reza [Danovo Energy Solutions]↗

DOE OSTI2022

J-PLUS: Support vector machine applied to STAR-GALAXY-QSO classification

Context. In modern astronomy, machine learning has proved to be efficient and effective in mining big data from the newest telescopes. Aims. In this study, we construct a supervised machine-learning algorithm to classify the objects in the Javalambre Photometric Local Universe Survey first data release (J-PLUS DR1). Methods. The sample set is featured with 12-waveband photometry and labeled with spectrum-based catalogs, including Sloan Digital Sky Survey spectroscopic data, the Large Sky Area Multi-Object Fiber Spectroscopic Telescope, and VERONCAT – the Veron Catalog of Quasars & AGN. The performance of the classifier is presented with the applications of blind test validations based on RAdial Velocity Extension, the Kepler Input Catalog, the Two Micron All Sky Survey Redshift Survey, and the UV-bright Quasar Survey. A new algorithm was applied to constrain the potential extrapolation that could decrease the performance of the machine-learning classifier. Results. The accuracies of the classifier are 96.5% in the blind test and 97.0% in training cross-validation. The F1-scores for each class are presented to show the balance between the precision and the recall of the classifier. We also discuss different methods to constrain the potential extrapolation.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2022

Nonlocal Kernel Network (NKN): a Stable and Resolution-Independent Deep Neural Network.

Neural operators have recently become popular tools for designing solution maps between function spaces in the form of neural networks. Differently from classical scientific machine learning approaches that learn parameters of a known partial differential equation (PDE) for a single instance of the input parameters at a fixed resolution, neural operators approximate the solution map of a family of PDEs [6, 7]. Despite their success, the uses of neural operators are so far restricted to relatively shallow neural networks and confined to learning hidden governing laws. In this work, we propose a novel nonlocal neural operator, which we refer to as nonlocal kernel network (NKN), that is resolution independent, characterized by deep neural networks, and capable of handling a variety of tasks such as learning governing equations and classifying images. Our NKN stems from the interpretation of the neural network as a discrete nonlocal diffusion reaction equation that, in the limit of infinite layers, is equivalent to a parabolic nonlocal equation, whose stability is analyzed via nonlocal vector calculus. The resemblance with integral forms of neural operators allows NKNs to capture long-range dependencies in the feature space, while the continuous treatment of node-to-node interactions makes NKNs resolution independent. The resemblance with neural ODEs, reinterpreted in a nonlocal sense, and the stable network dynamics between layers allow for generalization of NKN’s optimal parameters from shallow to deep networks. This fact enables the use of shallow-to-deep initialization techniques [8]. Our tests show that NKNs outperform baseline methods in both learning governing equations and image classification tasks and generalize well to different resolutions and depths.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

High spatiotemporal variability of bacterial diversity over short time scales with unique hydrochemical associations within a shallow aquifer

Understanding microbial community structure and function within the subsurface is critical to assessing overall quality and maintenance of groundwater; however, the factors that determine microbial community assembly, structure, and function in groundwater systems and their impact on water quality remains poorly understood. In this study, three shallow wells (FW301, FW303, FW305) in a non-contaminated shallow aquifer in the ENIGMA-Oak Ridge Field Research Center (Oak Ridge, TN) were sampled approximately 3 times a week over a period of three months to measure changes in groundwater geochemistry and microbial diversity. It was expected that the sampled microbial diversity from two historic field wells (FW301, FW303) would be relatively stable, while diversity from a newer well (FW305) would be less stable over time. The wells displayed some degree of hydrochemical variability over time unique to each well, with FW303 being overall the most stable well and FW301 being the most dynamic based upon dissolved oxygen, conductivity, and nitrate. Community analysis via ss-rRNA paired-end sequencing and distribution-based clustering revealed higher OTU richness, diversity, and variability in groundwater communities of FW301 than the other two wells for diversity binned over all time points. Microbial community composition of a given well was on average > 50% dissimilar to any other well at a given time (days), yet, functional gene diversity as measured with GeoChip remained relatively constant. Similarities in community structure across wells were observed with respect to the presence of 20 shared bacterial groups in all samples in all wells, although at varying levels over the tested time period. Similarity percentage (SIMPER) analysis revealed that variability in FW301 was largely attributed to low abundance, highly-transient populations, while variability in the most hydrochemically stable well (FW303) was due to fluctuations in more highly abundant and frequently present taxa. Additionally, the youngest well FW305 showed a dramatic shift in community composition towards the end of the sampling period that was not observed in the other wells, suggesting possible succession events over time. Time-series analysis using vector auto-regressive models and Granger causality showed unique relationships between richness and geochemistry over time in each well. Finally, these results indicate temporally dynamic microbial communities over short time scales, with day-to-day population shifts in local community structure influenced by available source community diversity and local groundwater hydrochemistry.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2020

Deep learning surrogate model for kinetic Landau-fluid closure with collision

In this work, the kinetic Landau-fluid (LF) closure with collision and periodic boundary condition is used in the development of the deep learning (DL) surrogate model. A classical neural network, namely, feedforward neural network or sometimes termed multilayer perceptron, is constructed and trained to learn the kinetic LF closure in the static limit and arbitrary mean free path in configuration space. The preliminary relation between best hyperparameters and critical parameters for data generation is found. Compared with the numerical approach (non-Fourier method) of the LF closure, the deep learning surrogate model shows an order of magnitude of improvement in terms of accuracy. Perhaps most importantly, the surrogate model closure has been integrated for the first time with fluid simulations. Our DL-enabled fluid simulations, for the first time, give the correct Landau damping rate for a wide range of wave vectors, while the Hammett–Perkins closure cannot produce the correct damping rate. We correctly connect the collisionless Hammett–Perkins closure and collisional Braginskii closure to reproduce the intrinsic nonlocal feature of the heat flux with DL techniques. We address the most concerning error accumulation problem and find that simulations with the deep learning surrogate model are as good as, if not better than, simulations with the analytic closure in terms of long-term numerical stability in the linear Landau damping test.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2021

Grid-based minimization at scale: Feldman-Cousins corrections for light sterile neutrino search

High Energy Physics (HEP) experiments generally employ sophisticated statistical methods to present results in searches of new physics. In the problem of searching for sterile neutrinos, likelihood ratio tests are applied to short-baseline neutrino oscillation experiments to construct confidence intervals for the parameters of interest. The test statistics of the form Δχ2 is often used to form the confidence intervals, however, this approach can lead to statistical inaccuracies due to the small signal rate in the region-of-interest. In this paper, we present a computational model for the computationally expensive Feldman-Cousins corrections to construct a statistically accurate confidence interval for neutrino oscillation analysis. The program performs a grid-based minimization over oscillation parameters and is written in C++. Our algorithms make use of vectorization through Eigen3, yielding a single-core speed-up of 350 compared to the original implementation, and achieve MPI data parallelism by employing DIY. We demonstrate the strong scaling of the application at High-Performance Computing (HPC) sites. We utilize HDF5 along with HighFive to write the results of the calculation to file.

Wospakrik, Marianette↗

DOE OSTI2019

Coherency-Based Detection Algorithm for Synchrophasor Cyberattacks

The wide area monitoring system (WAMS) is critical for power system situational awareness, but represents a growing cybersecurity vulnerability. Malicious adversaries may seek to compromise one or more PMUs in order to effect control decisions that unnecessarily disrupt typical grid operations. One example of a particularly pernicious attack vector is the spoofing or replaying of a fault event using one or more compromised PMUs. This work documents the development and validation of a coherency-based cyberattack detection algorithm that integrates a sliding-window singular value decomposition (SVD) with physics-based partitioning analysis to achieve accurate classification of events. Special consideration is given to discerning a sophisticated fault-replay or fault spoofing attack from actual faults. A software-based cybersecurity testbed has been developed for rigorous testing of the algorithm. The algorithm is further validated using simulated synchrophasor datasets obtained from a MinniWECC 63-bus test system. Results show that the algorithm can successfully detect fault-replay attacks even when over half of the PMUs are compromised.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2020

Implicit fast sweeping method for hyperbolic systems of conservation laws

Implicit time-accurate methods are often used to integrate stiff problems where explicit schemes impose severe time step restrictions. This paper presents an efficient numerical framework based on the Fast Sweeping Method (FSM) for solving linear and nonlinear hyperbolic systems of conservation laws. The solution at each discrete location is computed by sweeping the numerical domain in several predetermined directions that follow the causality of the characteristic families. The use of a fractional step strategy eliminates the need for a solution selection criterion while one-sided stencils limit the number of sweeps to at most 2 d for d space dimensions. This work focuses on the first-order implicit upwind method since it constitutes the building block for high-order conservative schemes. For problems where the degree of stiffness evolves over time, implicit-explicit hybridization can be accomplished with the same algorithm by simply switching the stencil at each time level. As opposed to traditional implicit solvers, the sweeping method does not require a local time linearization of the fluxes thereby preserving the nonlinear stability properties of the original implicit scheme. It also avoids the large computational and memory requirements associated with solving large block-diagonal systems of equations. Here, a series of one- and two-dimensional test cases are presented for the inviscid Burgers' equation and the reactive Euler equations. The results indicate that the implicit FSM can allow a major reduction in the number of time steps even in the presence of discontinuous solution profiles.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2022

Time-explicit Darwin PIC algorithm

A new approach to Darwin particle-in-cell plasma simulation is described. Using a finite-element approach, the vector potential is assured to be exactly solenoidal. This allows writing the system of multi-species particles as an action-at-a-distance Hamiltonian system. Applying recently-developed explicit symplectic methods to this gives a time-explicit algorithm with all desired properties. Elliptic systems for the electrostatic and magneto-static portions of the problem are inverted efficiently by an algebraic multi-grid algorithm. The algorithm is implemented in a two-dimensional Cartesian-geometry code and tested by application to Weibel instability and to Alfvén wave dynamics. Results show the effectiveness of this approach. Extensions to arbitrary meshes and to a partially time-implicit scheme are briefly discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2019

Multi-Formalism Modeling for Disaster Resilience, Forecasting, and Response

Disaster response preparedness, risk mitigation, and effective post-event response are critical for national security, public health, and economic integrity. For areas impacted by extreme events, timely and accurate impact assessments of lifeline infrastructures are critical. Traditional disaster management and situational awareness platforms are not capable of handling the massive influx of available information from traditional and non-traditional sources. Next-generation analytic assessment approaches, where use of dynamically sourced, heterogeneous data with near real-time availability are integrated into a continually-updated analytics framework. The objective of this research was to develop a foundational multi-formalism modeling platform to integrate novel data sources for use in improving situational awareness after a disaster event. Specifically, to 1) provide an architecture for machine-learning based data fusion various multi-sensor datasets; 2) classify, geolocate, and temporally bin novel data sources for use in spatially-enabled machine-learning based data fusion; and 3) derive confidence-based observation data with machine-learning based prediction to fill spatial and temporal observation gaps. This project developed a reusable cloud-based pipeline architecture for ingesting, storing, and analyzing relevant data, executing a range of deep-learning models, and visualize the information geographically. The pipeline development was informed by previous PNNL investments (StreamKit) and built upon leading-edge technologies consisting of: 1) a raw datastore; 2) a data enrichment pipeline with custom and third-party analytics; 3) enriched data storage; and 4) a custom UI to display the enriched data. Machine learning/deep learning models were selected and tested to classify social media images for relevancy and presence of flood waters. Our custom trained relevance models were run on a validation dataset and the overall accuracy of the relevance classifiers ranged from 65% to 90%. We found that convolutional neural network (CNN) models were both faster and more accurate than more traditional machine learning models. We applied the relevance classifier to remove non-relevant images and then undertook a limited training of CNN models to detect flood on ~1,800 labeled images. The testing accuracy of the flood detection models were ~88%. To improve the geographic location of both social media and oblique aerial images we tested a multi-step workflow built on a pre-trained deep-learning model. To identify similarity features from test and reference scenes, we applied the Xception and Faiss models to a set of test images with inaccurate spatial locations, as well and precisely-located reference scenes from the general area. Matching reference scenes to the test scenes with the closest similarity index had limited success in improving the precision of test scene location and additional methods have been identified for testing. Data fusion between authoritative geographic data (satellite imaging) and non-authoritative crowdsourced data is an underlying theme throughout this research and methods are tested bring these data to a common geographic form through feature matching and transformations. The automated extraction of supporting information for disaster response from oblique aerial images or ground-level social media images is accomplished through semantic image segmentation and transformation. The non-authoritative data are used to validate the authoritative data collections and processing and optionally, t+0 flood models. In addition, the common form geographic data are combined with other static landscape features to develop spatially-explicit training vectors used in deep generative statistical inference models to develop complex non-linear relationships in static and dynamic data and ultimately derive a spatially continuous and probabilistic assessment of flood damage with the event domain.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2020

Reconstruction of Charged Particle Tracks in Realistic Detector Geometry Using a Vectorized and Parallelized Kalman Filter Algorithm

One of the most computationally challenging problems expected for the High-Luminosity Large Hadron Collider (HL-LHC) is finding and fitting particle tracks during event reconstruction. Algorithms used at the LHC today rely on Kalman filtering, which builds physical trajectories incrementally while incorporating material e ects and error estimation. Recognizing the need for faster computational throughput, we have adapted Kalman-filterbased methods for highly parallel, many-core SIMD and SIMT architectures that are now prevalent in high-performance hardware. Previously we observed significant parallel speedups, with physics performance comparable to CMS standard tracking, on Intel Xeon, Intel Xeon Phi, and (to a limited extent) NVIDIA GPUs. While early tests were based on artificial events occurring inside an idealized barrel detector, we showed subsequently that our mkFit software builds tracks successfully from complex simulated events (including detector pileup) occurring inside a geometrically accurate representation of the CMS-2017 tracker. Here, we report on advances in both the computational and physics performance of mkFit, as well as progress toward integration with CMS production software. Recently we have improved the overall eciency of the algorithm by preserving short track candidates at a relatively early stage rather than attempting to extend them over many layers. Moreover, mkFit formerly produced an excess of duplicate tracks; these are now explicitly removed in an additional processing step. We demonstrate that with these enhancements, mkFit becomes a suitable choice for the first iteration of CMS tracking, and eventually for later iterations as well. We plan to test this capability in the CMS High Level Trigger during Run 3 of the LHC, with an ultimate goal of using it in both the CMS HLT and oine reconstruction for the HL-LHC CMS tracker.

Cerati, Giuseppe↗

DOE OSTI2022

Time series anomaly detection in power electronics signals with recurrent and ConvLSTM autoencoders

The anomalies in the high voltage converter modulator (HVCM) remain a major down time for the spallation neutron source facility, that delivers the most intense neutron beam in the world for scientific materials research. In this work, we propose neural network architectures based on Recurrent AutoEncoders (RAE) to detect anomalies ahead of time in the power signals coming from the HVCM. Bi-directional gated recurrent unit, bi-directional long-short term memory (LSTM), and convolutional LSTM (ConvLSTM) are developed, trained, and tested using real experimental signals from the HVCM module. The results show a good performance of the proposed RAE models, achieving precision up to 91%, recall up to 88%, false omission rate as low as 20% (i.e. 80% of the anomalies were detected), and area under the ROC curve up to 0.9. The three RAE models provide very comparable performance, with LSTM showing slightly better performance than GRU and ConvLSTM. The RAE models are benchmarked against other anomaly detection methods, including isolation forest, support vector machine, local outlier factor, feedforward and convolutional autoencoders, and others; showing a better performance. Here, the results of this study demonstrate the promising potential of RAE in anomaly detection for real-world power systems, and for increasing the reliability of the HVCM modules in the spallation neutron source.

42 ENGINEERING↗

DOE OSTI2018

Computation at a coordinate singularity

Coordinate singularities are sometimes encountered in computational problems. An important example involves global atmospheric models used for climate and weather prediction. Classical spherical coordinates can be used to parameterize the manifold – that is, generate a grid for the computational spherical shell domain. This particular parameterization offers significant benefits such as orthogonality and exact representation of curvature and connection (Christoffel) coefficients. But it also exhibits two polar singularities and at or near these points typical continuity/integral constraints on dependent fields and their derivatives are generally inadequate and lead to poor model performance and erroneous results. Other parameterizations have been developed that eliminate polar singularities, but problems of weaker singularities and enhanced grid noise compared to spherical coordinates (away from the poles) persist. Here, in this study reparameterization invariance of geometric objects (scalars, vectors and the forms generated by their covariant derivatives) is utilized to generate asymptotic forms for dependent fields of interest valid in the neighborhood of a pole. The central concept is that such objects cannot be altered by the metric structure of a parameterization. The new boundary conditions enforce symmetries that are required for transformations of geometric objects. They are implemented in an implicit polar filter of a structured grid, nonhydrostatic global atmospheric model that is simulating idealized Held–Suarez flows. A series of test simulations using different configurations of the asymptotic boundary conditions are made, along with control simulations that use the default model numerics with no absorber, at three different grid sizes. Typically the test simulations are ~ 20% faster in wall clock time than the control—resulting from a decrease in noise at the poles in all cases. In the control simulations adverse numerical effects from the polar singularity are observed to increase with grid resolution. In contrast, test simulations demonstrate robust polar behavior independent of grid resolution.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Superallowed 0 + → 0 + nuclear β decays: 2020 critical survey, with implications for V ud and CKM unitarity

A new critical survey of all half-life, decay-energy and branching-ratio measurements related to 23 superallowed 0 + → 0 + β decays is presented. Included are 222 individual measurements of comparable precision obtained from 174 published references. Compared with our last survey in 2015, we have added results from 28 new publications and eliminated an approximately equal number whose results have been superseded by much more precise modern data. We obtain world-average ft values for each of the 21 transitions that have a complete set of data, then apply radiative and isospin-symmetry-breaking corrections to extract “corrected” Ft values. Fifteen of these Ft values now have a precision of 0.3% or better and all take the same value within statistics, as expected from conservation of the vector current. Their average, Ft¯, when combined with the muon lifetime, yields the up-down quark-mixing element of the Cabibbo-Kobayashi-Maskawa matrix, V ud = 0.97373 ± 0.00031. This is lower than our 2015 result by one standard deviation and its uncertainty is increased by 50%. This is a consequence, not of any shifts in the experimental data, but of new calculations for the radiative corrections. The lower V ud value now leads to greater tension in the top-row test of unitarity in the CKM matrix. Updates in experimental data have independently led to a factor-of-two tighter limit being set on the possible existence of a scalar interaction. In conclusion, the new limit on Fierz interference is b F ≤ 0.0033 at the 90% confidence level.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗