Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “data classification”

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,135 records · Page 63

Selective Sampling for Sensor Type Classification in Buildings

A key barrier to applying any smart technology to a building is the requirement of locating and connecting to the necessary resources among the thousands of sensing and control points, i.e., the metadata mapping problem. Existing solutions depend on exhaustive manual annotation of sensor metadata --- a laborious, costly, and hardly scalable process. To reduce the amount of manual effort required, this paper presents a multi-oracle selective sampling framework to leverage noisy labels from information sources with unknown reliability such as existing buildings, which we refer to as weak oracles, for metadata mapping. This framework involves an interactive process, where a small set of sensor instances are progressively selected and labeled for it to learn how to aggregate the noisy labels as well as to predict sensor types. Two key challenges arise in designing the framework, namely, weak oracle reliability estimation and instance selection for querying. To address the first challenge, we develop a clustering-based approach for weak oracle reliability estimation to capitalize on the observation that weak oracles perform differently in different groups of instances. For the second challenge, we propose a disagreement-based query selection strategy to combine the potential effect of a labeled instance on both reducing classifier uncertainty and improving the quality of label aggregation. We evaluate our solution on a large collection of real-world building sensor data from 5 buildings with more than 11,000 sensors of 18 different types. The experiment results validate the effectiveness of our solution, which outperforms a set of state-of-the-art baselines.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Kinetics-Informed Neural Networks

Chemical kinetics and reaction engineering consists of the phenomenological framework for the disentanglement of reaction mechanisms, optimization of reaction performance and the rational design of chemical processes. Here, we utilize feed-forward artificial neural networks as basis functions to solve ordinary differential equations (ODEs) constrained by differential algebraic equations (DAEs) that describe microkinetic models (MKMs). We present an algebraic framework for the mathematical description and classification of reaction networks, types of elementary reaction, and chemical species. Under this framework, we demonstrate that the simultaneous training of neural nets and kinetic model parameters in a regularized multi-objective optimization setting leads to the solution of the inverse problem through the estimation of kinetic parameters from synthetic experimental data. We analyze a set of scenarios to establish the extent to which kinetic parameters can be retrieved from transient kinetic data, and assess the robustness of the methodology with respect to statistical noise. Furthermore, this approach to inverse kinetic ODEs can assist in the elucidation of reaction mechanisms based on transient data.

36 MATERIALS SCIENCE↗

Block segmentation in feature space for realtime object detection in high granularity images

Computer vision has applications in object detection, image recognition and classification, and object tracking. One of the challenges of computer vision is the presence of useful information at multiple distance scales. Filtering techniques may sacrifice details at small scales in order to prioritize the analysis of large-scale features of the image. We present a strategy for coarse-graining multidimensional data while maintaining fine-grained detail for subsequent analysis. The algorithm is based on fixed-size block segmentation in the feature space. We apply this strategy to solve the long-standing challenge of detecting particle trajectories at the Large Hadron Collider in real time.

Computer vision↗

ATCCfinder - Download and Search the ATCC Genome Portal

Much strain-specific sequence data exists in research conducted before the deployment of large sequencing repositories, making it challenging to identify and validate the identity of strains used in these studies through bioinformatics and phenotyping. The American Type Culture Collection (ATCC) is an organization that sells a wide variety of microbes with strain-level taxonomy classification and associated sequenced reference genomes. Currently, ATCC does not provide a method for searching for sequence similarity between a query sequence and their database of reference genomes. Here I propose the software ATCCfinder, which utilizes ATCC application interface software (API) to generate query-able databases from ATCC Genome resources.

Koehler, Samuel↗

High-resolution (30-m) urban land cover projections for Los Angeles California Urban Area: 2010 to 2100 under SSP5

These data represent simulations of future land use and land cover (LULCC) for Los Angeles urban area (U.S. Census Bureau defined area) as raster tiff images at a 30-m pixel resolution and at decadal time steps from 2010 to 2100. LULCC classes in this product follow the National Land Cover Dataset (NLCD) classification. NLCD 21-24 correspond to open developed, low developed, medium developed, and high developed urban land classes, respectively. Only urban land cover classes (NLCD class 21, 22, 23, and 24) are dynamic over time; however, all NLCD classes are included in the final product. Therefore, NLCD classes that do not convert to an urban class will be similar to year 2000. The products were developed using a hybridized statistical and cellular automata approach. Linear mixed models (LMMs) were used to estimate future urban land budgets based on 1-km urban land fraction projections from Gao and Pesaresi (2021), whereas separate generalized linear mixed models (GLMMs) were used to estimate shifts in urban land intensities based on retrospective shifts in NLCD urban class intensities over a 20- year period. Based on urban land allocations from the statistical models, a cellular-automata and downscaling routine was used to simulate dynamic urban land expansion at a 30-m resolution based on suitability criteria. Scenarios of future urban landcover change projections include variant solutions for the Shared Socioeconomic Pathway 5 (SSP5) based on different population assumptions, different land use intensification assumptions, variable land zoning constraints, and iterative adjustments to correct for over allocation of urban expansion across decadal time periods from 2010 to 2100. This results in 320 raster products.

Land↗

High-resolution (30-m) urban land cover projections for Los Angeles California Urban Area: 2010 to 2100 under SSP3 and SSP5 [Updated simulations based on population-driven urban intensity transitions]

These data (v3) are updated from previous versions (1 and 2) in that they include consider the effects of population on transitions in urban land intensity. This leads to more reasonable differences in urban land projections under variant SSPs. For the present dataset, both SSP3 and SSP5 are provided. These data represent simulations of future land use and land cover (LULCC) for Los Angeles urban area (U.S. Census Bureau defined area) as raster tiff images at a 30-m pixel resolution and at decadal time steps from 2010 to 2100. LULCC classes in this product follow the National Land Cover Dataset (NLCD) classification. NLCD 21-24 correspond to open developed, low developed, medium developed, and high developed urban land classes, respectively. Only urban land cover classes (NLCD class 21, 22, 23, and 24) are dynamic over time; however, all NLCD classes are included in the final product. Therefore, NLCD classes that do not convert to an urban class will be similar to year 2000. The products were developed using a hybridized statistical and cellular automata approach. Linear mixed models (LMMs) were used to estimate future urban land budgets based on 1-km urban land fraction projections from Gao and Pesaresi (2021), whereas separate generalized linear mixed models (GLMMs) were used to estimate shifts in urban land intensities based on retrospective shifts in NLCD urban class intensities over a 20- year period. Based on urban land allocations from the statistical models, a cellular-automata and downscaling routine was used to simulate dynamic urban land expansion at a 30-m resolution based on suitability criteria. Scenarios of future urban landcover change projections include variant solutions for the Shared Socioeconomic Pathway 5 (SSP5) and SSP 3 based on different population assumptions, different land use intensification assumptions, variable land zoning constraints, and iterative adjustments to correct for over allocation of urban expansion across decadal time periods from 2010 to 2100. This results in 320 raster products.

Land↗

Measurement of the top quark pole mass using $ \textrm{t}\overline{\textrm{t}} $+jet events in the dilepton final state in proton-proton collisions at $ \sqrt{s} $ = 13 TeV

A measurement of the top quark pole mass $\mathcal{m}^\text{pole}_\text{t}$ in events where a top quark-antiquark pair ($\text{t}\bar{\text{t}}$) is produced in association with at least one additional jet ($\text{t}\bar{\text{t}}$ +jet) is presented. This analysis is performed using proton-proton collision data at $\sqrt{s}$ = 13 TeV collected by the CMS experiment at the CERN LHC, corresponding to a total integrated luminosity of 36.3 fb -1 . Events with two opposite-sign leptons in the final state (e + e – , μ + μ – , e ± μ ∓ ) are analyzed. The reconstruction of the main observable and the event classification are optimized using multivariate analysis techniques based on machine learning. The production cross section is measured as a function of the inverse of the invariant mass of the $\text{t}\bar{\text{t}}$ +jet system at the parton level using a maximum likelihood unfolding. Given a reference parton distribution function (PDF), the top quark pole mass is extracted using the theoretical predictions at next-to-leading order. For the ABMP16NLO PDF, this results in $\mathcal{m}^\text{pole}_\text{t}$ = 172.93 ± 1.36 GeV.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Detecting anomalous packets in network transfers: investigations using PCA, autoencoder and isolation forest in TCP

Large-scale scientific workflows rely heavily on high-performance file transfers. These transfers require strict quality parameters such as guaranteed bandwidth, no packet loss or data duplication. To have successful file transfers, methods such as predetermined thresholds and statistical analysis need to be done to determine abnormal patterns. Network administrators routinely monitor and analyze network data for diagnosing and alleviating these, making decisions based on their experience. However, as networks grow and become complex, monitoring large data files and quickly processing them, makes it improbable to identify errors and rectify these. Abnormal file transfers have been classified by simply setting alert thresholds, via tools such as PerfSonar and TCP statistics (Tstat). This paper investigates the feasibility of unsupervised feature extraction methods for identifying network anomaly patterns with three unsupervised classification methods—principal component analysis, autoencoder and isolation forest. Here, we collect file transfer statistics from two experiment sets—synthetic iPerf generated traffic and 1000 Genome workflow runs, with synthetically introduced anomalies. Our results show that while PCA and a simple autoencoder finds it difficult to detect clusters, the tree-variant isolation forest is able to identify anomalous packets by breaking down TCP traces into tree classes early.

97 MATHEMATICS AND COMPUTING↗

End-To-End Decentralized Transmission Line Protection in IBR-Dominated Weak Grids Using Interpretable Data-Driven Methods

Traditional transmission line protection relies on predictable synchronous-based fault signatures, which frequently fail under the non-standard, current-limited fault characteristics of Inverter-Based Resources (IBRs). This study investigates how to achieve secure, communication-free fault isolation in IBR-dominated weak grids without relying on opaque, computationally heavy "black-box" machine learning algorithms. To address this, we propose a novel, standalone, and inherently interpretable data-driven protection framework. Unlike centralized methods requiring multi-terminal communication, this decentralized approach relies solely on local measurements using a hierarchical linear-kernel Support Vector Machine (SVM). The methodology decomposes the protection task into four sequential stages that mimic traditional protection elements: fault detection and fault direction identification, fault type classification, zone classification, and location estimation. This multi-stage architecture allows for specialized feature engineering at each stage, combining high computational efficiency with logic traceability. The framework's end-to-end performance was validated via C-code and PSCAD/EMTDC co-simulation, utilizing a real-world utility network and an OEM black-box IBR model. The proposed relay achieves 97.2% overall accuracy and provides a reliable trip decision within a 2.5-cycle window. The results confirm 100% accuracy in fundamental fault detection, reliable zone selectivity across low to moderate fault resistances, and robust security against non-fault transients, proving its immediate viability for integration into commercial numerical relays.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Interregional Electricity Transmission in the United States: Realized Savings and Opportunities for Increased Value, 2014 to 2023

Interregional electricity trade in the United States reduces total energy costs, but falls short of maximizing the economic potential of existing transmission infrastructure. This analysis of thirty-two U.S. electricity system interfaces crossing grid or market seams finds an average achieved cost savings of at least $1,226 million per year. This positive impact is offset by an average annual cost of uneconomic interchange of $551 million. Additional value of at least $238 million per year could be enabled by increasing utilization. Notably, uneconomic flows and low utilization rates can persist even when the price spread between regions is large. These conclusions are derived from historical (2014–2023) data on the magnitude and direction of interregional price spreads, the magnitude and direction of net energy transfers, and how these variables coincide, but do not account for all system constraints. These findings motivate the development and deployment of solutions that improve interregional transmission operations, in parallel with robust transmission infrastructure planning. JEL Classification: Q40 Energy: General

Q40 Energy: General↗

Activation estimates of the RHIC beam dump

In anticipation of the expiration of the RHIC ASE in December 2025 and the need to demonstrate compliance with nuclear facility rule (10CFR830), this study quantifies the radionuclide inventory and respective activity at the beam dumps by simulating a period of five years of operation using conservative assumptions. Simulations were performed with the Monte Carlo particle transport and interaction code FLUKA and its dosimetry results were compared with measured dose rate data, showing good agreement. The beam dump was deemed to constitute the main hotspot of residual radiation and also representative of a worst case scenario in terms of induced activation. The activation levels calculated indicate that the RHIC tunnel will be well below the thresholds of a DOE’s category-3 nuclear facility classification.

43 PARTICLE ACCELERATORS↗

Attention-Augmented Parametric Kernel Graph Neural Network (APKGNN) for Node Classification

We present a new graph neural network, the Attention-based Parametric-Kernel augmented Graph Neural Network (APKGNN), developed for node classification tasks. Despite extensive work on modeling multi-faceted relationships between connected nodes of a graph, the effect of attention on edge features mapped to relationships has not yet been analyzed through learning representation. This study derives such an attention vector by first calculating node features corresponding to endpoints of an edge and then aggregating these with extracted local intrinsic patches of a given graph to generate augmented local patch vectors. This process uses a parametric kernel based on Gaussian mixture models (GMMs) to embed local neighborhoods of the graph in local patches. The patch vectors then convolve with the above node features to produce an updated node representation. We show that this new learning representation (APKGNN) achieves higher node classification accuracy on tasks - both standard benchmarks (Cora, PubMed, Citeseer) and new experimental short text corpora where nodes correspond to text documents and words. This implementation of the GNN convolution layer outperforms state-of-the-art (SOTA) algorithms, achieving higher training, validation, and test accuracy by a significant margin on three standard benchmark data sets under both SOTA experimental settings and those for new testbeds.

Bose, Avishek↗

Certifiably Robust Neural ODE With Learning-Based Barrier Function

Neural Ordinary Differential Equations (ODEs) have gained traction in many applications. While recent studies have focused on empirically increasing the robustness of neural ODEs against natural or adversarial attacks, certified robustness is still lacking. In this work, we propose a framework for training a neural ODE using barrier functions and demonstrate improved robustness for classification problems. Finally, we further provide the first generalization guarantee of robustness against adversarial attacks using a wait-and-judge scenario approach.

97 MATHEMATICS AND COMPUTING↗

Universal Fourier Attack for Time Series

A wide variety of adversarial attacks have been proposed and explored using image and audio data. These attacks are notoriously easy to generate digitally when the attacker can directly manipulate the input to a model, but are much more difficult to implement in the real world. In this paper we present a universal, time invariant attack for general time series data such that the attack has a frequency spectrum primarily composed of the frequencies present in the original data. The universality of the attack makes it fast and easy to implement as no computation is required to add it to an input, while time invariance is useful for real world deployment. Additionally, the frequency constraint ensures the attack can withstand filtering defenses. We demonstrate the effectiveness of the attack on two different classification tasks through both digital and real world experiments, and show that the attack is robust against common transform-and-compare defense pipelines.

97 MATHEMATICS AND COMPUTING↗

Anchoring

This software provides methods and functions for training deep image classification models based on the principle of anchoring. It features a user-friendly PyTorch wrapper that facilitates the easy conversion of any model into an anchored model. The software supports various standard datasets and includes scripts for conducting evaluations. Developed with PyTorch, it is compatible with common neural network architectures used for image data. Additionally, it offers tools for computing evaluation metrics to assess model performance.

Narayanaswamy, Vivek Sivaraman↗

Novel Application of Machine Learning Techniques for Rapid Source Apportionment of Aerosol Mass Spectrometer Datasets

In this work, we apply machine learning approaches sparse multinomial logistic regression to classify aerosol mass spectrometer (AMS) unit mass resolution (UMR) data followed by an ensemble regression technique for source apportionment of organic aerosols (OA). The classifier was trained on 60 well characterized laboratory and positive matrix factorization (PMF) deconvolved reference spectra to identify eight OA types. These include four laboratory-derived secondary organic aerosol (SOA) spectra, which include isoprene photooxidation SOA, isoprene epoxydiols (IEPOX) SOA, a monoterpene SOA type that includes a-pinene and ß-pinene SOA, and aromatic SOA from oxidation of naphthalene and m-xylene precursors, as well as PMF deconvolved spectra for three primary organic aerosol (POA) types, namely, hydrocarbon-like organic aerosol (HOA), biomass burning organic aerosol (BBOA), and cooking OA (COA), and a more oxidized oxygenated OA type (MO-OOA). A 5-fold cross-validation strategy, repeated 10 times, was used to assess the classifier’s performance. The classifier had high classification accuracy for COA, aromatic SOA, and isoprene SOA spectra but incorrectly classified ~9% by number of MO-OOA spectra as BBOA, 12% of BBOA spectra as HOA (and vice versa), and 18% of IEPOX-SOA spectra as aromatic SOA. Next, an ensemble regression model was trained on an artificially generated dataset consisting of mixtures of different OA types to assess its ability to predict fractional mass abundances from classification probabilities of various OA species obtained from the multinomial logistic regression classifier trained on the reference spectra. Ultimately, the proposed approach was applied for source apportionment of aircraft-based AMS measurements of OA UMR spectra during the HI-SCALE field campaign. On two representative days (May 6th and 18th, 2016), the algorithm determined that ~50-60% of OA by mass was MO-OOA, which represented a highly aged organic aerosol mixture from different sources. On both days, BBOA was determined to contribute less than 10% to OA by mass. However, on May 18th, the aromatic SOA fraction was higher compared to that on May 6th. The proposed approach is capable of rapidly analyzing AMS data in real time, making it suitable for applications where rapid source apportionment of AMS OA spectra is desirable.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Dynamics-Based Peptide–MHC Binding Optimization by a Convolutional Variational Autoencoder: A Use-Case Model for CASTELO

An unsolved challenge in the development of antigen-specific immunotherapies is determining the optimal antigens to target. Comprehension of antigen–major histocompatibility complex (MHC) binding is paramount toward achieving this goal. Here, we apply CASTELO, a combined machine learning-molecular dynamics (ML-MD) approach, to identify per-residue antigen binding contributions and then design novel antigens of increased MHC-II binding affinity for a type 1 diabetes-implicated system. We build upon a small-molecule lead optimization algorithm by training a convolutional variational autoencoder (CVAE) on MD trajectories of 48 different systems across four antigens and four HLA serotypes. We develop several new machine learning metrics including a structure-based anchor residue classification model as well as cluster comparison scores. ML-MD predictions agree well with experimental binding results and free energy perturbation-predicted binding affinities. Moreover, ML-MD metrics are independent of traditional MD stability metrics such as contact area and root-mean-square fluctuations (RMSF), which do not reflect binding affinity data. Finally, our work supports the role of structure-based deep learning techniques in antigen-specific immunotherapy design.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Identifications of RR Lyrae Stars and Quasars from the Simulated Data of Mephisto-W Survey

We have investigated the feasibilities and accuracies of the identifications of RR Lyrae stars and quasars from the simulated data of the Multi-channel Photometric Survey Telescope (Mephisto) W Survey. Based on the variable sources light curve libraries from the Sloan Digital Sky Survey (SDSS) Stripe 82 data and the observation history simulation from the Mephisto-W Survey Scheduler, we have simulated the uvgriz multi-band light curves of RR Lyrae stars, quasars and other variable sources for the first-year observation of Mephisto W Survey. We have applied the ensemble machine learning algorithm Random Forest Classifier (RFC) to identify RR Lyrae stars and quasars, respectively. We build training and test samples and extract ~150 features from the simulated light curves and train two RFCs respectively for the RR Lyrae star and quasar classification. We find that, our RFCs are able to select the RR Lyrae stars and quasars with remarkably high precision and completeness, with purity = 95.4% and completeness = 96.9% for the RR Lyrae RFC and purity = 91.4% and completeness = 90.2% for the quasar RFC. In conclusion, we have also derived relative importances of the extracted features utilized to classify RR Lyrae stars and quasars.

(galaxies:) quasars: general↗