Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Decoder”

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 595 records · Page 33

A Comparison of Infectious Disease Forecasting Methods across Locations, Diseases, and Time

Accurate infectious disease forecasting can inform efforts to prevent outbreaks and mitigate adverse impacts. This study compares the performance of statistical, machine learning (ML), and deep learning (DL) approaches in forecasting infectious disease incidences across different countries and time intervals. We forecasted three diverse diseases: campylobacteriosis, typhoid, and Q-fever, using a wide variety of features (n = 46) from public datasets, e.g., landscape, climate, and socioeconomic factors. We compared autoregressive statistical models to two tree-based ML models (extreme gradient boosted trees [XGB] and random forest [RF]) and two DL models (multi-layer perceptron and encoder–decoder model). The disease models were trained on data from seven different countries at the region-level between 2009–2017. Forecasting performance of all models was assessed using mean absolute error, root mean square error, and Poisson deviance across Australia, Israel, and the United States for the months of January through August of 2018. The overall model results were compared across diseases as well as various data splits, including country, regions with highest and lowest cases, and the forecasted months out (i.e., nowcasting, short-term, and long-term forecasting). Overall, the XGB models performed the best for all diseases and, in general, tree-based ML models performed the best when looking at data splits. There were a few instances where the statistical or DL models had minutely smaller error metrics for specific subsets of typhoid, which is a disease with very low case counts. Feature importance per disease was measured by using four tree-based ML models (i.e., XGB and RF with and without region name as a feature). The most important feature groups included previous case counts, region name, population counts and density, mortality causes of neonatal to under 5 years of age, sanitation factors, and elevation. This study demonstrates the power of ML approaches to incorporate a wide range of factors to forecast various diseases, regardless of location, more accurately than traditional statistical approaches.

59 BASIC BIOLOGICAL SCIENCES↗

Multi-Level Information Storage Using Engineered Electromechanical Resonances of Piezoelectric Wafers: A Concept Piezoelectric Quick Response (PQR) Code

A piezoelectric-based method for information storage is presented. It involves engineering the polarization profiles of multiple piezoelectric wafers to enhance/suppress specific electromechanical resonances. These enhanced/suppressed resonances can be used to represent multiple frequency-dependent bits, thus enabling multi-level information storage. This multi-level information storage is demonstrated by achieving three information states for a ternary encoding. Using the three information states, we present an approach to encode and decode information from a 2-by-3 array of piezoelectric wafers that we refer to as a concept Piezoelectric Quick Response (PQR) code. The scaling relation between the number of wafers used and the cumulative number of information states that can be achieved with the proposed methodology is briefly discussed. Potential applications of this methodology include tamper-evident devices, embedded product tags in manufacturing/inventory tracking, and additional layers of security with existing information storage technologies.

47 OTHER INSTRUMENTATION↗

Quantum Key Distribution for Critical Infrastructures: Towards Cyber-Physical Security for Hydropower and Dams

Hydropower facilities are often remotely monitored or controlled from a centralized remote control room. Additionally, major component manufacturers monitor the performance of installed components, increasingly via public communication infrastructures. While these communications enable efficiencies and increased reliability, they also expand the cyber-attack surface. Communications may use the internet to remote control a facility’s control systems, or it may involve sending control commands over a network from a control room to a machine. The content could be encrypted and decrypted using a public key to protect the communicated information. These cryptographic encoding and decoding schemes become vulnerable as more advances are made in computer technologies, such as quantum computing. In contrast, quantum key distribution (QKD) and other quantum cryptographic protocols are not based upon a computational problem, and offer an alternative to symmetric cryptography in some scenarios. Although the underlying mechanism of quantum cryptogrpahic protocols such as QKD ensure that any attempt by an adversary to observe the quantum part of the protocol will result in a detectable signature as an increased error rate, potentially even preventing key generation, it serves as a warning for further investigation. In QKD, when the error rate is low enough and enough photons have been detected, a shared private key can be generated known only to the sender and receiver. We describe how this novel technology and its several modalities could benefit the critical infrastructures of dams or hydropower facilities. The presented discussions may be viewed as a precursor to a quantum cybersecurity roadmap for the identification of relevant threats and mitigation.

97 MATHEMATICS AND COMPUTING↗

Data Quality Monitoring for the Hadron Calorimeters Using Transfer Learning for Anomaly Detection

The proliferation of sensors brings an immense volume of spatio-temporal (ST) data in many domains, including monitoring, diagnostics, and prognostics applications. Data curation is a time-consuming process for a large volume of data, making it challenging and expensive to deploy data analytics platforms in new environments. Transfer learning (TL) mechanisms promise to mitigate data sparsity and model complexity by utilizing pre-trained models for a new task. Despite the triumph of TL in fields like computer vision and natural language processing, efforts on complex ST models for anomaly detection (AD) applications are limited. In this study, we present the potential of TL within the context of high-dimensional ST AD with a hybrid autoencoder architecture, incorporating convolutional, graph, and recurrent neural networks. Motivated by the need for improved model accuracy and robustness, particularly in scenarios with limited training data on systems with thousands of sensors, this research investigates the transferability of models trained on different sections of the Hadron Calorimeter of the Compact Muon Solenoid experiment at CERN. The key contributions of the study include exploring TL’s potential and limitations within the context of encoder and decoder networks, revealing insights into model initialization and training configurations that enhance performance while substantially reducing trainable parameters and mitigating data contamination effects.

47 OTHER INSTRUMENTATION↗

100 TeV pp collisions, SM type, PYTHIA8 generator: tev100pp_qcd_pythia8_ptbins

Inclusive dijets in bins of PhaseSpace:pTHatMin. Cross sections depend on pT. 1000 events per file, 100 files per pT bin. How to decode name: Name: tev100_pythia8_ptPTMIN_PTMAX_NUMBER.promc where PTMIN is min pT for PhaseSpace:pTHatMin, PTMAX - PhaseSpace:pTHatMax*2, NUMBER corresponds to the cluster production node. When you run, use "PTMIN-PTMAX" ranges. The actual cut on PhaseSpace:pTHatMax=2*PTMAX to reduce fluctuations in the tails. How to use: To get a sample with a given pT, use "glob" regular expressions (in Jython, Python etc). Example for the code: pT>100 GeV corresponds to "glob.glob(*pt100_*)" . pT bins: # bins pt[1]=50 pt[2]=100 pt[3]=150 pt[4]=200 pt[5]=250 pt[6]=300 pt[7]=350 pt[8]=400 pt[9]=450 pt[10]=500 pt[11]=600 pt[12]=700 pt[13]=800 pt[14]=900 pt[15]=1000 pt[16]=1200 pt[17]=1400 pt[18]=1600 pt[19]=1800 pt[20]=2000 pt[21]=2200 pt[22]=2400 pt[23]=2600 pt[24]=2800 pt[25]=3000 pt[26]=3300 pt[27]=3600 pt[28]=3900 pt[29]=4200 pt[30]=4600 pt[31]=5000 pt[32]=5500 pt[33]=6000 pt[34]=7000 pt[35]=8000 pt[36]=9000 pt[37]=10000 pt[38]=12000 pt[39]=14000 pt[40]=16000 pt[41]=18000 pt[42]=20000 pt[43]=25000 pt[44]=30000 pt[45]=35000 pt[45]=40000. Slimmed as: Particle records are slimmed (all stable with pT>0.3 GeV) and (PID=5 || PID=6) or PID>22 && PID<38) or PID>10 && PID<17).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

13 TeV pp collisions, SM type, PYTHIA8 generator: tev13pp_qcd_pythia8_ptbins

Inclusive dijets in bins of PhaseSpace:pTHatMin. Cross sections depends on pT. 1000 events per files, 100 files per pT bin. How to decode name: Name: tev100_pythia8_ptPTMIN_PTMAX_NUMBER.promc where PTMIN is min pT for PhaseSpace:pTHatMin, PTMAX - PhaseSpace:pTHatMax*2, NUMBER corresponds to the cluster production node. 50000 events per bin, 500 events per file. When you run, use "PTMIN-PTMAX" ranges. The actual cut on PhaseSpace:pTHatMax=2*TMAX to reduce fluctuations on the tails. How to use: To get a sample with a given pT, use "glob" regular expressions (in Jython, Python etc). Example for the code: pT>100 should corresponds to "glob.glob(*pt100_*)". Slimmed as: Particle records are slimmed (all stable with pT>0.3 GeV) and (PID=5 || PID=6) or PID>22 && PID<38) or PID>10 && PID<17).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

100 TeV pp collisions, Top type, PYTHIA8 generator: tev100pp_ttbar_pythia8_ptbins

Top production in bins of PhaseSpace:mHatMin. Cross section depends on pT. Use the attached log files to find the cross sections. How to decode name: Name: tev100_pythia8_ptPTMIN_PTMAX_NUMBER.promc where PTMIN is min pT for PhaseSpace:ptHatMin, PTMAX - PhaseSpace:pTHatMax*2, NUMBER corresponds to the cluster production node. 2000 events in file, 50 files per bin. When you run, use "PTMIN-PTMAX" ranges. The actual cut on PhaseSpace:pTHatMax=2*TMAX to reduce fluctuations in the tails. How to use: To get a sample with a given pT, use "glob" regular expressions (in Jython, Python etc). Example for the code: pT>100 should corresponds to "glob.glob(*pt100_*)". Slimmed as: Particle records are slimmed (all stable with pT>0.3 GeV) and (PID=5 || PID=6) or PID>22 && PID<38) or PID>10 && PID<17).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

100 TeV pp collisions, SM type, PYTHIA8 generator: tev100pp_wzjet_pythia8_ptbins

Z/W+jet production in bins of PhaseSpace:mHatMin. Cross sections depend on pT and not given. All Z/W decays are included. 1000 events per file, 100 files per pT bin. Cross sections are included in the log files. How to decode name: Name: tev100_pythia8_ptPTMIN_PTMAX_NUMBER.promc where PTMIN is min pT for PhaseSpace:ptHatMin, PTMAX - PhaseSpace:pTHatMax*2, NUMBER corresponds to the cluster production node. When you run, use "PTMIN-PTMAX" ranges. The actual cut on PhaseSpace:pTHatMax=2*PTMAX to reduce fluctuations in the tails. pT bins: pt[1]=50 pt[2]=100 pt[3]=150 pt[4]=200 pt[5]=250 pt[6]=300 pt[7]=350 pt[8]=400 pt[9]=450 pt[10]=500 pt[11]=700 pt[12]=900 pt[13]=1100 pt[14]=1300 pt[15]=1500 pt[16]=1700 pt[17]=1900 pt[18]=2100 pt[19]=2400 pt[20]=2700 pt[21]=3000 pt[22]=3400 pt[23]=3800 pt[24]=4200 pt[25]=4600 pt[26]=5000 pt[27]=5500 pt[28]=6000 pt[29]=6500 pt[30]=7000 pt[31]=7500 pt[32]=8000 pt[33]=8500 pt[34]=9000 pt[35]=10000 pt[36]=12000 pt[37]=14000 pt[38]=18000 pt[39]=22000 pt[40]=25000. How to use: To get a sample with a given pT, use "glob" regular expressions (in Jython, Python etc). Example for the code: pT>100 corresponds to "glob.glob(*pt100_*)". Slimmed as: Particle records are slimmed (all stable with pT>0.3 GeV) and (PID=5 || PID=6) or PID>22 && PID<38) or PID>10 && PID<17).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

100 TeV pp collisions, Higgs type, PYTHIA8 generator: tev100pp_higgs_pythia8_ptbins

Higgs production in bins of PhaseSpace:mHatMin. Cross sections depend on pT and not given. All Higgs decays are included. 2000 events per file, 50 files per pT bin. Cross sections are included in the log files. How to decode name: Name: tev100_pythia8_ptPTMIN_PTMAX_NUMBER.promc where PTMIN is min pT for PhaseSpace:ptHatMin, PTMAX - PhaseSpace:pTHatMax*2, NUMBER corresponds to the cluster production node. When you run, use "PTMIN-PTMAX" ranges. The actual cut on PhaseSpace:pTHatMax=2*PTMAX to reduce fluctuations on the tails. How to use: To get a sample with a given pT, use "glob" regular expressions (in Jython, Python etc). Example for the code: pT>100 corresponds to "glob.glob(*pt100_*)". Slimmed as: Particle records are slimmed (all stable with pT>0.3 GeV) and (PID=5 || PID=6) or PID>22 && PID<38) or PID>10 && PID<17).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

13 TeV pp collisions, Higgs type, PYTHIA8 generator: tev13pp_higgs_pythia8_ptbins

Higgs production in bins of PhaseSpace:mHatMin. Cross sections depend on pT and not given. All decays are included. 1000 events per file, 100 files per pT bin. Cross sections are included in the log files. How to decode name: Name: tev100_pythia8_ptPTMIN_PTMAX_NUMBER.promc where PTMIN is min pT for PhaseSpace:ptHatMin, PTMAX - PhaseSpace:pTHatMax*2, NUMBER corresponds to the cluster production node. The actual gen-level cut is PhaseSpace:pTHatMax=2*TMAX to reduce fluctuations on the tails. How to use: To get a sample with a given pT, use "glob" regular expressions (in Jython, Python etc). Example for the code: pT>100 corresponds to "glob.glob(*pt100_*)". Slimmed as: Particle records are slimmed (all stable with pT>0.3 GeV) and (PID=5 || PID=6) or PID>22 && PID<38) or PID>10 && PID<17).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

100 TeV pp collisions, SM type, PYTHIA8 generator: tev100pp_gamma_pythia8_ptbins

All direct photon production in bins of PhaseSpace:mHatMin, in the range pT=50-25,000 GeV. Cross sections depend on pT and are not given. 2000 events per file, 50 files per pT bin. Cross sections are included in the log files. How to decode name: Name: tev100_pythia8_ptPTMIN_PTMAX_NUMBER.promc where PTMIN is min pT for PhaseSpace:ptHatMin, PTMAX - PhaseSpace:pTHatMax*2, NUMBER corresponds to the cluster production node. When you run, use "PTMIN-PTMAX" ranges. The actual cut on PhaseSpace:pTHatMax=2*PTMAX to reduce fluctuations in the tails. How to use: To get a sample with a given pT, use "glob" regular expressions (in Jython, Python etc). Example for the code: pT>100 corresponds to "glob.glob(*pt100_*)" <h3>Slimmed as</h3> Particle records are slimmed (all stable with pT>0.3 GeV) and (PID=5 || PID=6) or PID>22 && PID<38) or PID>10 && PID<17).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

13 TeV pp collisions, SM type, PYTHIA8 generator: tev13pp_gamma_pythia8_ptbins

All direct photon production in bins of PhaseSpace:mHatMin. Cross sections depend on pT and not given. All decays are included. 1000 events per file, 100 files per pT bin. Cross sections are included in the log files. How to decode name: Name: tev100_pythia8_ptPTMIN_PTMAX_NUMBER.promc where PTMIN is min pT for PhaseSpace:ptHatMin, PTMAX - PhaseSpace:pTHatMax*2, NUMBER corresponds to the cluster production node. The actual cut is PhaseSpace:pTHatMax=2*PTMAX to reduce fluctuations on the tails. How to use: To get a sample with a given pT, use "glob" regular expressions (in Jython, Python etc). Example for the code: pT>100 corresponds to "glob.glob(*pt100_*)". Slimmed as: Particle records are slimmed (all stable with pT>0.3 GeV) and (PID=5 || PID=6) or PID>22 && PID<38) or PID>10 && PID<17).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

100 TeV pp collisions, Exotics type, PYTHIA8 generator: tev100pp_qstar_pythia8_mbins_slim

Excited Fermions in mass range pT=5-40 TeV. 10000 events per file, 100 files per mass. Compositeness scale (Lambda) is set to the mass of the fermion, so the width is expected to be small (see the log files for details) Cross sections are included in the log files (mass dependent) Note that data are slimmed (see the log file). How to decode name: Name: tev100_pythia8_qstar_m[MASS]_[NUMBER] where [MASS] is generator-level mass as given below: Mass bins (in GeV) m[1]=5000 m[2]=10000 ......... How to use: To get a sample with a given mass, use "glob" regular expressions. Slimmed as: Particle records are slimmed (all stable with pT>0.3 GeV) and (PID=5 || PID=6) or PID>22 && PID<38) or PID>10 && PID<17).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

13 TeV pp collisions, Exotics type, PYTHIA8 generator: tev13pp_qstar_pythia8_mbins

Excited Fermions in mass range pT=6-40 TeV. 5000 events per file, 100 files per mass. Compositeness scale (Lambda) is set to the mass of the fermion, so the width is expected to be small (see the log files for details) Cross sections are included in the log files (mass dependent). How to decode name: Name: tev100_pythia8_qstar_m[MASS]_[NUMBER] where [MASS] is generator-level mass as given below: Mass bins (in GeV) m[1]=2000 m[2]=4000 m[3]=6000 m[4]=8000 m[5]=10000 m[6]=12000 m[7]=14000. How to use: To get a sample with a given mass, use "glob" regular expressions. Slimmed as: Particle records are slimmed (all stable with pT>0.3 GeV) and (PID=5 || PID=6) or PID>22 && PID<38) or PID>10 && PID<17).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

100 TeV pp collisions, SM type, PYTHIA8 generator: tev100pp_qcd_pythia8_ptall

Inclusive dijets in bins of PhaseSpace:pTHatMin. No upper cut on pTHat was set. Cross sections depend on pT. 1000 events per file, 50 files per pT bin. The sample was designed for jet resolution studies. Cross sections depend on pT. How to decode name: Name: tev100_pythia8_ptPTMIN_NUMBER.promc where PTMIN is min pT for PhaseSpace:pTHatMin. NUMBER corresponds to the cluster production node. How to use: To get a sample with a given pT, use "glob" regular expressions (in Jython, Python etc). Example for the code: pT>100 GeV corresponds to "glob.glob(*pt100_*)" . pT bins: # bins in minimum pT: pt[1]=50 pt[2]=100 pt[3]=200 pt[4]=400 pt[5]=800 pt[6]=1600 pt[7]=3200 pt[8]=6400 pt[9]=12800 pt[10]=25600 pt[11]=51200

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

On Neural Architectures for Astronomical Time-series Classification with Application to Variable Stars

Despite the utility of neural networks (NNs) for astronomical time-series classification, the proliferation of learning architectures applied to diverse data sets has thus far hampered a direct intercomparison of different approaches. Here we perform the first comprehensive study of variants of NN-based learning and inference for astronomical time series, aiming to provide the community with an overview on relative performance and, hopefully, a set of best-in-class choices for practical implementations. In both supervised and self-supervised contexts, we study the effects of different time-series-compatible layer choices, namely the dilated temporal convolutional neural network (dTCNs), long-short term memory NNs, gated recurrent units and temporal convolutional NNs (tCNNs). Additionally, we also study the efficacy and performance of encoder-decoder (i.e., autoencoder) networks compared to direct classification networks, different pathways to include auxiliary (non-time-series) metadata, and different approaches to incorporate multi-passband data (i.e., multiple time series per source). Performance—applied to a sample of 17,604 variable stars (VSs) from the MAssive Compact Halo Objects (MACHO) survey across 10 imbalanced classes—is measured in training convergence time, classification accuracy, reconstruction error, and generated latent variables. We find that networks with recurrent NNs generally outperform dTCNs and, in many scenarios, yield to similar accuracy as tCNNs. In learning time and memory requirements, convolution-based layers perform better. We conclude by discussing the advantages and limitations of deep architectures for VS classification, with a particular eye toward next-generation surveys such as the Legacy Survey of Space and Time, the Roman Space Telescope, and Zwicky Transient Facility.

79 ASTRONOMY AND ASTROPHYSICS↗

Unsupervised Machine Learning for Exploratory Data Analysis of Exoplanet Transmission Spectra

Abstract Transit spectroscopy is a powerful tool for decoding the chemical compositions of the atmospheres of extrasolar planets. In this paper, we focus on unsupervised techniques for analyzing spectral data from transiting exoplanets. After cleaning and validating the data, we demonstrate methods for: (i) initial exploratory data analysis, based on summary statistics (estimates of location and variability); (ii) exploring and quantifying the existing correlations in the data; (iii) preprocessing and linearly transforming the data to its principal components; (iv) dimensionality reduction and manifold learning; (v) clustering and anomaly detection; and (vi) visualization and interpretation of the data. To illustrate the proposed unsupervised methodology, we use a well-known public benchmark data set of synthetic transit spectra. We show that there is a high degree of correlation in the spectral data, which calls for appropriate low-dimensional representations. We explore a number of different techniques for such dimensionality reduction and identify several suitable options in terms of summary statistics, principal components, etc. We uncover interesting structures in the principal component basis, namely well-defined branches corresponding to different chemical regimes of the underlying atmospheres. We demonstrate that those branches can be successfully recovered with a K-means clustering algorithm in a fully unsupervised fashion. We advocate for lower-dimensional representations of the spectroscopic data in terms of the main principal components, in order to reveal the existing structure in the data and quickly characterize the chemical class of a planet.

Matchev, Konstantin T. (ORCID:0000000341829096)↗

Unsupervised physics-informed disentanglement of multimodal data

Here, we introduce physics-informed multimodal autoencoders (PIMA) - a variational inference framework for discovering shared information in multimodal datasets. Individual modalities are embedded into a shared latent space and fused through a product-of-experts formulation, enabling a Gaussian mixture prior to identify shared features. Sampling from clusters allows cross-modal generative modeling, with a mixture-of-experts decoder that imposes inductive biases from prior scientific knowledge and thereby imparts structured disentanglement of the latent space. This approach enables cross-modal inference and the discovery of features in high-dimensional heterogeneous datasets. Consequently, this approach provides a means to discover fingerprints in multimodal scientific datasets and to avoid traditional bottlenecks related to high-fidelity measurement and characterization of scientific datasets.

97 MATHEMATICS AND COMPUTING↗