Search NASA⌕ Search

SEARCH · Search NASA

Results for “feature set”

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 91 records · Page 5

The Role of Stratigraphy and Loading History in Generating Complex Compaction Bands in Idealized Field-Scale Settings

The Buckskin Gulch locality in Utah is a landmark example of compaction localization. The outcrop of this locality involves distinct stratigraphic heterogeneity and was exposed to complex loading history. It features multiple sets of deformation bands with different kinematics and orientation. Similar formations were seen in the Valley of Fire, Nevada, and the Orange quarry, France, among other localities. The formation of such complex structures, their propagation mechanisms, and frequency is affected by numerous local and ambient factors whose impacts are not yet fully understood. The simulation of the above-mentioned localities is not feasible because of the limited amount of available information. This work, instead, investigates from a geomechanics standpoint how the interplay among material nonlinearity, outcrop stratigraphy, and loading history interconnects with specific spatiotemporal patterns of compaction band propagation. Our study shows that the system stratigraphy can be responsible for the emergence of coexisting compaction bands with different inclination and kinematics. Specifically, we show that stiffness contrasts induce nonlocal stress changes which may favor the initiation of secondary structures with different compaction localization characteristics. Furthermore, systems of inclined compaction bands induced by burial increase display secondary, noncontemporaneous sets of vertical compaction bands under the effects of postburial shortening. Our results indicate that stages of intermediate burial decrease prior to tectonic shortening can promote the formation of such complex systems. Despite the simplifications involved in our analyses, these findings show how geomechanics computations complement field observations and could provide a mechanics-based validation of site-specific reconstruction hypothesis.

58 GEOSCIENCES↗

Self-Supervised and Interpretable Anomaly Detection Using Network Transformers

Machine learning and deep neural networks (DNNs) have been proposed as a tool to identify anomalies in computer network communications. However, due the obfuscated nature of off-the-shelf machine learning models, their output often does not provide enough information to isolate the source of the anomaly to take corrective measures. In this article, we introduce the network transformer (NeT), a DNN model for anomaly detection that incorporates the graph structure of the communication network in order to improve interpretability. Further, the presented approach has the following advantages: first, enhanced interpretability by incorporating the graph structure of computer networks; second, provides a hierarchical set of features that enables analysis at different levels of granularity; second, self-supervised training that does not require labeled data. The NeT model was evaluated on a set of anomalous scenarios executed in a real industrial control system. The presented approach successfully identified the anomalies, the devices affected, and the specific connections causing the anomalies, providing a data-driven hierarchical approach to analyze the behavior of a cyber network.

97 MATHEMATICS AND COMPUTING↗

DMTN-118: Review of Timeseries Features

Rubin Observatory will compute timeseries variability features on lightcurves to aid users in identifying objects of interest, both during realtime Alert Production as well as in the annual Data Releases. The Data Products Definition Document (DPDD; LSE-163) allocates space for pre-computed timeseries features, and a sample set is baselined in LDM-151. However, in the subsequent decade the scientfic community has made a great deal of further progress in this area. This technote reviews the relevant literature, grouping related features where possible; discusses potential concerns and open questions; and proposes a new baseline feature set.

79 ASTRONOMY AND ASTROPHYSICS↗

Novel Technique for Developing Linearized Convex System Models from Experimentally Derived Data

This paper presents a novel technique for generating a convex system model from an experimentally derived data set which features variance among repeated measurements. The convex system model developed as a test case characterizes the dynamic system losses of a vanadium redox flow battery as a function of the active power output and the battery state of charge. The technique hinges on a pre-cleaning via clustering procedure which precedes the formation of a planar convex hull comprised of triangular simplices. The clustering procedure efficiently reduces the experimental data set while mitigating variance among repeated measurements and removes outliers. Ultimately, the lower evelope of the planar convex hull serves as the desired convex system model. The proposed technique reduces systematic model error which is otherwise present when directly developing a planar convex hull model based on an unreduced data set.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Data Summarization and Inference at Scale

This is the final report for the DOE ASCR grant SC-0022260, Data Summarization and Inference at Scale, PI: Alex Pothen, Purdue University. The goal of the project was to solve data-intensive and compute-intensive problems in the physical sciences, engineering, information science, data science, etc. by designing and implementing new algorithms that could work with a subset of the data. The four subgoals were: (a) The solution of problems where the data is too large to be stored in the memory of a computer. In this streaming model of computation, the data arrives as a stream of elements to the computer, each element is processed as it arrives, and a decision is made to discard the data or to store it; only a small subset of the data proportional to the size of the output solution is stored, and when all the data has been streamed, a solution to the problem is computed from the stored subset. (b) The use of machine learning methods to compute solutions to data-intensive problems. The use of GPUs is critical to obtain high performance on machine learning tasks, but their memory sizes are smaller relative to that of CPUs. For large-scale problems, the data is sampled many times, and small samples are used with repetition, for robustness, to compute solutions to inference tasks. This sampling reduces the memory required to solve the problem, but attention is needed to avoid slow convergence to the solutions, and reduced accuracy of inference. We propose submodular optimization, Large Language Models, and physics-informed neural networks to enable GPU computations here. (c) Modeling and visualization of high-dimensional data using interpretable features. Clinical proteomic data sets from immunology for the detection of cancer and other diseases are temporal and high-dimensional, and algorithms for visualizing these data sets using clinically interpretable features are lacking. We propose methods that compute distances based on the optimal transportation problem and graph edit distances to address this problem. We also propose the use of optimal transport-based distances, spatial statistics, and network structure to classify image data sets, We apply these algorithms to electron micrographs of the peripheral nervous system in the digestive tract. (d) The design of data-intensive algorithms on emerging architectures, specifically, noisy, intermediate-scale quantum (NISQ) devices. Quantum computers offer the possibility of exploring large solution spaces due to the principle of superposition, but current quantum computers are limited by few qubits, short coherence times due to noise, poor interconections among the qubits, etc. We propose the use of the divide and conquer paradigm to solve large-scale problems, wherein collections of small subproblems are solved on the quantum devices, and the solutions to the subproblems are integrated into a solution for the original problem on a classical computer.

97 MATHEMATICS AND COMPUTING↗

Sage: parallel semi-asymmtric graph algorithms for NVRAMs

Non-volatile main memory (NVRAM) technologies provide an attractive set of features for large-scale graph analytics, including byte-addressability, low idle power, and improved memory-density. NVRAM systems today have an order of magnitude more NVRAM than traditional memory (DRAM). NVRAM systems could therefore potentially allow very large graph problems to be solved on a single machine, at a modest cost. However, a significant challenge in achieving high performance is in accounting for the fact that NVRAM writes can be much more expensive than NVRAM reads. In this paper, we propose an approach to parallel graph analytics using the Parallel Semi-Asymmetric Model (PSAM), in which the graph is stored as a read-only data structure (in NVRAM), and the amount of mutable memory is kept proportional to the number of vertices. Similar to the popular semi-external and semi-streaming models for graph analytics, the PSAM approach assumes that the vertices of the graph fit in a fast read-write memory (DRAM), but the edges do not. In NVRAM systems, our approach eliminates writes to the NVRAM, among other benefits. To experimentally study this new setting, we develop Sage, a parallel semi-asymmetric graph engine with which we implement provably-efficient (and often work-optimal) PSAM algorithms for over a dozen fundamental graph problems. We experimentally study Sage using a 48--core machine on the largest publicly-available real-world graph (the Hyperlink Web graph with over 3.5 billion vertices and 128 billion edges) equipped with Optane DC Persistent Memory, and show that Sage outperforms the fastest prior systems designed for NVRAM. Importantly, we also show that Sage nearly matches the fastest prior systems running solely in DRAM, by effectively hiding the costs of repeatedly accessing NVRAM versus DRAM.

97 MATHEMATICS AND COMPUTING↗

ReactionMechanismSimulator.jl: A modern approach to chemical kinetic mechanism simulation and analysis

Abstract We present ReactionMechanismSimulator.jl (RMS), a modern differentiable software for the simulation and analysis of chemical kinetic mechanisms, including multiphase systems. RMS has already been applied to problems in combustion, pyrolysis, polymers, pharmaceuticals, catalysis, and electrocatalysis. RMS is written in Julia, making it easy to develop and allowing it to take advantage of Julia's extensive numerical computing ecosystem. In addition to its extensive library of optimized analytic Jacobians, RMS can generate and use Jacobians computed using automatic differentiation and symbolically generated analytic Jacobians. RMS is demonstrated to be faster than Cantera and Chemkin in several benchmarks. RMS also implements an extensive set of features for analyzing chemical mechanisms, including a library of easy‐to‐call plotting functions, molecular structure resolved flux diagram generation, crash analysis, traditional sensitivity analysis, transitory sensitivity analysis, and an automatic mechanism analysis toolkit. RMS implements efficient adjoint and parallel forward sensitivity analyses. We also demonstrate the ease of adding new features to RMS.

Johnson, Matthew S.↗

Accelerated impurity solver for DMFT and its diagrammatic extensions

Here, we present ComCTQMC, a GPU accelerated quantum impurity solver. It uses the continuous-time quantum Monte Carlo (CTQMC) algorithm wherein the partition function is expanded in terms of the hybridisation function (CT-HYB). ComCTQMC supports both partition and worm-space measurements, and it uses improved estimators and the reduced density matrix to improve observable measurements whenever possible. ComCTQMC efficiently measures all one and two-particle Green's functions, all static observables which commute with the local Hamiltonian, and the occupation of each impurity orbital. ComCTQMC can solve complex-valued impurities with crystal fields that are hybridized to both fermionic and bosonic baths. Most importantly, ComCTQMC utilizes graphical processing units (GPUs), if available, to dramatically accelerate the CTQMC algorithm when the Hilbert space is sufficiently large. We demonstrate acceleration by a factor of over 600 (100) in a simulation of δ-Pu at 600 K with (without) crystal fields. In easier problems, the GPU offers less impressive acceleration or even decelerates the CTQMC. Here we describe the theory, algorithms, and structure used by ComCTQMC in order to achieve this set of features and level of acceleration.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Field-based AFDD for refrigerant undercharge in residential HVAC systems: enhancing reliability through false alarm mitigation

This study evaluated rule-based and machine learning (ML) based automated fault detection and diagnostics (AFDD) algorithms for detecting refrigerant undercharge faults in residential heating, ventilation, and air conditioning (HVAC) systems, using actual building data and a minimal set of features. The ML-based algorithms included Decision Tree (DT) and K-Nearest Neighbors (KNN). Both the rule-based and ML-based algorithms demonstrated the capability to detect refrigerant undercharge faults of -30% or more. Both types of algorithms exhibited false alarms before the implementation of a false alarm mitigation algorithm, which motivated the development of such a mitigation strategy. After applying the mitigation, false alarms were substantially reduced, with the rule-based algorithm decreasing to 0.6% and the ML-based algorithms reaching 0%, while maintaining strong detection performance. Although the rule-based algorithm initially showed lower performance compared to the ML-based algorithms, its detection accuracy improved after mitigation to a level comparable to the ML-based algorithms. These results confirm that combining false alarm mitigation with both rule-based and ML-based AFDD algorithms significantly enhances practical reliability while preserving robust fault detection capabilities. Furthermore, the findings demonstrate the potential for field deployment of these algorithms in residential HVAC systems and highlight the importance of minimizing false alarms.

False Alarm↗

Predicting river turbidity in Pine Island Bayou using machine learning techniques coupled with variational mode decomposition

Elevated turbidity levels pose significant public health risks by facilitating the transport of harmful pollutants, including metals, organic compounds, and pathogenic microorganisms into the surface water. These conditions create serious challenges for public recreational water use and drinking water treatment, leading to economic losses and health risks. This study utilizes water monitoring data in Pine Island Bayou, Texas, and develops a Sequence-to-Sequence (S2S) model to predict turbidity using Attention-based Gated Recurrent Units with Encoder-Decoder (AT-GRU-ED) and Long Short-Term Memory (LSTM), coupled with Variational Mode Decomposition (VMD). Compared to the model without VMD, the model demonstrates satisfactory 72-hour turbidity prediction performance, achieving MAEs of 2.60 and 3.29 NTU (reductions of 53% and 58%), RMSEs of 21.08 and 31.49 NTU (reductions of 82% and 80%), and R² values of 0.96 and 0.84 on the validation and test sets, respectively. Feature importance analysis reveals that water temperature is the dominant factor influencing seasonal turbidity patterns, while real-time hourly rainfall significantly contributes to short-term variability. Turbidity typically peaks within 48 hours after rainfall events due to lagged effects from surface runoff and upstream flow. Findings suggest suspending recreational water use and water supply pumping for three days after heavy rainfall can benefit public health and improve water treatment processes. Discharges above 100 m3/s are found to accelerate sediment dilution and transport, reducing turbidity levels more quickly after the peak. In conclusion, the proposed model demonstrates reliable 72-hour turbidity prediction, supporting decision-making for water treatment plant operations and providing early warning for public recreational water use.

Deep learning↗

Machine Learning Models to Predict Inhibition of the Bile Salt Export Pump

Cholestatic liver injury is frequently associated with drug inhibition of bile salt transporters, such as the bile salt export pump (BSEP). Reliable in silico models to predict BSEP inhibition directly from chemical structures would significantly reduce costs during drug discovery and could help avoid injury to patients. We report our development of classification and regression models for BSEP inhibition with substantially improved performance over previously published models. We assessed the performance effects of different methods of chemical featurization, data set partitioning, and class labeling and identified the methods producing models that generalized best to novel chemical entities.

59 BASIC BIOLOGICAL SCIENCES↗

Fast and Accurate Machine Learning Strategy for Calculating Partial Atomic Charges in Metal–Organic Frameworks

Computational high-throughput screening using molecular simulations is a powerful tool for identifying top-performing metal–organic frameworks (MOFs) for gas storage and separation applications. Accurate partial atomic charges are often required to model the electrostatic interactions between the MOF and the adsorbate, especially when the adsorption involves molecules with dipole or quadrupole moments such as water and CO 2 . Although ab initio methods can be used to calculate accurate partial atomic charges, these methods are impractical for screening large material databases because of the high computational cost. We developed a random forest machine learning model to predict the partial atomic charges in MOFs using a small yet meaningful set of features that represent both the elemental properties and the local environment of each atom. The model was trained and tested on a collection of about 320 000 density-derived electrostatic and chemical (DDEC) atomic charges calculated on a subset of the Computation-Ready Experimental Metal–Organic Framework (CoRE MOF-2019) database and separately on charge model 5 (CM5) charges. The model predicts accurate atomic charges for MOFs at a fraction of the computational cost of periodic density functional theory (DFT) and is found to be transferable to other porous molecular crystals and zeolites. In conclusion, a strong correlation is observed between the partial atomic charge and the average electronegativity difference between the central atom and its bonded neighbors.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Combined Optical and Radio–Frequency Perspectives on the Time Evolution of Lightning Measured by the FORTE Satellite

We use a cluster feature data set for the Fast On-orbit Recording of Transient Events (FORTE) satellite that combines detections from its pixelated Lightning Locating System (LLS), photodiode detector (PDD) and Radio-Frequency (RF) instrumentation to generate statistics describing the frequency and timing of lightning events detected by each instrument during lightning flashes. Coincident observations from the same vantage point allow us to directly compare flash details that can be resolved by the wide Field of View (FOV) instruments relative to the pixelated LLS—whose design is based on NASA's Lightning Imaging Sensor. We find that both the PDD and RF system typically generate more detections than the lightning imager (mean: 1.5 PDD events per LLS group, 2 RF events per LLS group) from pulses that are either not sufficiently bright in the optical band (in the case of RF) or that lack the optical energy density (in the case of the PDD) required to trigger one of the pixels on the LLS imaging array. This includes additional activity before the first LLS group or after the final LLS group. These FORTE results demonstrate that certain lightning processes would be better resolved by wide-FOV optical and RF instruments than lightning imagers. Current/future space-based missions that use/plan to use similar instruments will improve our understanding of flash evolution by resolving details missed by lightning imagers.

47 OTHER INSTRUMENTATION↗

Co-Occurring Atmospheric Features and Their Contributions to Precipitation Extremes

Object-based identification algorithms for atmospheric features are commonly utilized to attribute global precipitation. This study employs a systematic approach to examine feature co-occurrences and their relationships to mean and extreme precipitation. Four features are identified using existing data sets for atmospheric rivers (ARs), mesoscale convective systems (MCSs), low-pressure systems (LPSs), and fronts (FTs). Often, a single atmospheric phenomenon satisfies the criteria set by multiple feature identification algorithms, yielding an association between precipitation and multiple features. Over the extra-tropics, the number of features attributed to a single event typically increases with precipitation intensity. Over two-thirds of the precipitation is from co-occurring features, with a considerable fraction related to AR-FT co-occurrences. Over the tropics, about one-quarter of precipitation is associated with co-occurring features, with LPS-MCS co-occurrences contributing substantially in monsoon regions. MCSs are the leading single-feature contributors over tropical land and oceans. In the extra-tropics, FTs, ARs, and their co-occurrences account for over half of the total precipitation over oceans. AR-FT-MCS and FT-MCS co-occurrences contribute to extremes (precipitation exceeding the 95th percentile) over both oceans (over 30%) and land (over 20%). Any combination of features involving MCSs shows a larger contribution to high percentiles of precipitation intensity. A case analysis indicates that AR-FT-MCS co-occurrences exhibit convective instability and deep vertical motion, suggesting that the feature trackers and reanalysis are capturing physics relevant to both convective and frontal systems. The results here emphasize the need for simultaneous identifications of multiple features when attributing precipitation to atmospheric phenomena.

54 ENVIRONMENTAL SCIENCES↗

Intrinsic glassy-metallic transport in an amorphous coordination polymer

Conducting organic materials, such as doped organic polymers, molecular conductors and emerging coordination polymers4, underpin technologies ranging from displays to flexible electronics. Realizing high electrical conductivity in traditionally insulating organic materials necessitates tuning their electronic structure through chemical doping6. Furthermore, even organic materials that are intrinsically conductive, such as single-component molecular conductors, require crystallinity for metallic behavior. However, conducting polymers are often amorphous to aid durability and processability. Using molecular design to produce high conductivity in undoped amorphous materials would enable tunable and robust conductivity in many applications, but there are no intrinsically conducting organic materials that maintain high conductivity when disordered. Here we report an amorphous coordination polymer, Ni tetrathiafulvalene tetrathiolate, which displays markedly high electronic conductivity (up to 1,200 S cm –1 ) and intrinsic glassy-metallic behavior. Theory shows that these properties are enabled by molecular overlap that is robust to structural perturbations. This unusual set of features results in high conductivity that is stable to humid air for weeks, pH 0–14 and temperatures up to 140 °C. Furthermore, these findings demonstrate that molecular design can enable metallic conductivity even in heavily disordered materials, raising fundamental questions about how metallic transport can exist without periodic structure and indicating exciting new applications for these materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

Automated algorithms to build active galactic nucleus classifiers

ABSTRACT We present a machine learning model to classify active galactic nuclei (AGNs) and galaxies (AGN-galaxy classifier) and a model to identify type 1 (optically unabsorbed) and type 2 (optically absorbed) AGN (type 1/2 classifier). We test tree-based algorithms, using training samples built from the X-ray Multi-Mirror Mission–Newton (XMM–Newton) catalogue and the Sloan Digital Sky Survey (SDSS), with labels derived from the SDSS survey. The performance was tested making use of simulations and of cross-validation techniques. With a set of features including spectroscopic redshifts and X-ray parameters connected to source properties (e.g. fluxes and extension), as well as features related to X-ray instrumental conditions, the precision and recall for AGN identification are 94 and 93 per cent, while the type 1/2 classifier has a precision of 74 per cent and a recall of 80 per cent for type 2 AGNs. The performance obtained with photometric redshifts is very similar to that achieved with spectroscopic redshifts in both test cases, while there is a decrease in performance when excluding redshifts. Our machine learning model trained on X-ray features can accurately identify AGN in extragalactic surveys. The type 1/2 classifier has a valuable performance for type 2 AGNs, but its ability to generalize without redshifts is hampered by the limited census of absorbed AGN at high redshift.

Falocco, S. (ORCID:0000000299841103)↗

Vibrational processing of a dynamic structural flight system: A multichannel spectral estimation approach

Dynamic testing of large flight vehicles (rockets) is not only complex, but also can be very costly. These flights are infrequent and can lead to disastrous effects if something were to fail during the flight. The development of sensors coupled to internal components offers a great challenge in reducing their size, yet still maintaining their precision. Sounding rockets provide both a viable and convenient alternative to the more costly vehicular flights. Some of the major objectives are to test various types of sensors for monitoring components of high interest as well as investigating real-time processing techniques. Signal processing presents an extreme challenge in this noisy multichannel environment. The estimation and tracking of modal frequencies from vibrating structures is an important set of features that can provide information about the components under test; therefore, high resolution multichannel spectral processing is required. Finally, the application of both single channel and multichannel techniques capable of producing reliable modal frequency estimates of a vibrating structure from uncertain accelerometer measurements is discussed.

42 ENGINEERING↗