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 1,261 records · Page 70

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↗

Bayesian chain graph models to characterize microbe-environment dynamics

Microbiome data require statistical models that can simultaneously decode microbes' reaction to the environment and interactions among microbes. While a multiresponse linear regression model seems like a straight-forward solution, we argue that treating it as a graphical model is problematic given that the regression coefficient matrix does not encode the conditional dependence structure between response and predictor nodes. This observation is especially important in biological settings when we have prior knowledge on the edges from specific experimental interventions that can only be properly encoded under a conditional dependence model. Here, we propose a chain graph model with two sets of nodes (predictors and responses) whose solution yields a graph with edges that indeed represent conditional dependence, thus agreeing with the experimenter's intuition on the average behavior of nodes under treatment. The solution to our model is sparse via the Bayesian linear regression (LASSO). In addition, we propose an adaptive extension so that different shrinkages can be applied to different edges to incorporate edge-specific prior knowledge. Our model is computationally inexpensive through an efficient Gibbs sampling algorithm and can account for binary, counting, and compositional responses via an appropriate hierarchical structure. We test the performance of our model in a variety of simulated datasets, thereby showing superior performance to state-of-the-art approaches. We further apply our model to human gut and soil microbial compositional datasets, and we highlight that CG-LASSO can estimate biologically meaningful network structures in the data.

compositional data↗

Eco-PiNN: A Physics-informed Neural Network for Eco-toll Estimation

The eco-toll estimation problem quantifies the expected environmental cost (e.g., energy consumption, exhaust emissions) for a vehicle to travel along a path. This problem is important for societal applications such as eco-routing, which aims to find paths with the lowest exhaust emissions or energy need. The challenges of this problem are threefold: (1) the dependence of a vehicle's eco-toll on its physical parameters; (2) the lack of access to data with eco-toll information; and (3) the influence of contextual information (i.e. the connections of adjacent segments in the path) on the eco-toll of road segments. Prior work on eco-toll estimation has mostly relied on pure data-driven approaches and has high estimation errors given the limited training data. To address these limitations, we propose a novel Eco-toll estimation Physics-informed Neural Network framework (Eco-PiNN) using three novel ideas, namely, (1) a physics-informed decoder that integrates the physical laws governing vehicle dynamics into the network, (2) an attention-based contextual information encoder, and (3) a physics-informed regularization to reduce overfitting. Experiments on real-world heavy-duty truck data show that the proposed method can greatly improve the accuracy of eco-toll estimation compared with state-of-the-art methods.

97 MATHEMATICS AND COMPUTING↗

Diffusion Codes: Self-Correction from Small(er)-Set Expansion with Tunable Non-locality

Optimal constructions of classical LDPC codes can be obtained by choosing the Tanner graph uniformly at random among biregular graphs. We introduce a class of codes that we call ``diffusion codes'', defined by placing each edge connecting bits and checks on some graph, and acting on that graph with a random SWAP network. By tuning the depth of the SWAP network, we can tune a tradeoff between the amount of randomness -- and hence the optimality of code parameters -- and locality with respect to the underlying graph. For diffusion codes defined on the cycle graph, if the SWAP network has depth $\sim Tn$ with $T> n^{2β}$ for arbitrary $β>0$, then we prove that almost surely the Tanner graph is a lossless ``smaller set'' vertex expander for small sets up size $δ\sim \sqrt T \sim n^β$, with bounded bit and check degree. At the same time, the geometric size of the largest stabilizer is bounded by $\sqrt T$ in graph distance. We argue, based on physical intuition, that this result should hold more generally on arbitrary graphs. By taking hypergraph products of these classical codes we obtain quantum LDPC codes defined on the torus with smaller-set boundary and co-boundary expansion and the same expansion/locality tradeoffs as for the classical codes. These codes are self-correcting and admit single-shot decoding, while having the geometric size of the stabilizer growing as an arbitrarily small power law. Our proof technique establishes mixing of a random SWAP network on small subsystems at times scaling with only the subsystem size, which may be of independent interest.

Combinatorics (math.CO)↗

Particle inertial effects on radar Doppler spectra simulation

Abstract. Radar Doppler spectra observations provide a wealth of information about cloud and precipitation microphysics and dynamics. The interpretation of these measurements depends on our ability to simulate these observations accurately using a forward model. The effect of small-scale turbulence on the radar Doppler spectra shape has been traditionally treated by implementing the convolution process on the hydrometeor reflectivity spectrum and environmental turbulence. This approach assumes that all the particles in the radar sampling volume respond the same to turbulent-scale velocity fluctuations and neglects the particle inertial effect. Here, we investigate the inertial effects of liquid-phase particles on the forward modeled radar Doppler spectra. A physics-based simulation (PBS) is developed to demonstrate that big droplets, with large inertia, are unable to follow the rapid change of the velocity field in a turbulent environment. These findings are incorporated into a new radar Doppler spectra simulator. Comparison between the traditional and newly formulated radar Doppler spectra simulators indicates that the conventional simulator leads to an unrealistic broadening of the spectrum, especially in a strong turbulent environment. This study provides clear evidence to illustrate the droplet inertial effect on radar Doppler spectrum and develops a physics-based simulator framework to accurately emulate the Doppler spectrum for a given droplet size distribution (DSD) in a turbulence field. The proposed simulator has various potential applications for the cloud and precipitation studies, and it provides a valuable tool to decode the cloud microphysical and dynamical properties from Doppler radar observation.

54 ENVIRONMENTAL SCIENCES↗

MSD CoP Webinar: Modeling the Operations of Reservoir Systems with LLMs and Inverse Reinforcement Learning

Context: This panel featured three presentations centered on the common theme of applying LLMs and inverse reinforcement learning (IRL) to capture the complex human-environment interactions that are central to the operation of reservoir systems. Dr. Wyatt Arnold will kick off the webinar with a talk on how analyzing LLM chain-of-thought reasoning reveals sophisticated quantitative justification and risk awareness, showing promise as a bridge between quantitative models and value-driven water management decisions. Next, Dr. Matteo Giuliani will build on this with a discussion demonstrating that AI- and IRL-driven approaches can infer the trade-offs between flood control and water supply using historical observations. Finally, Dr. Rohan Singh Wilkho will close the webinar with a talk establishing IRL as a generalizable diagnostic tool for decoding decision-making in managed hydrologic and human-infrastructure systems. Across the three presentations, the application of LLMs and IRL opens new possibilities for the development of adaptive, transparent, and human-aware models supporting water management in an increasingly uncertain future. Presenters: Wyatt Arnold (Politecnico di Milano); Matteo Giuliani (Politecnico di Milano); Rohan Singh Wilkho (Cornell University) Moderator: Patrick M. Reed (MSD CoP Facilitation Team); Stefano Galelli (MSD CoP AI Working Group Co-Chair); David Gold (MSD CoP AI Working Group Co-Chair) This webinar was held on: June 23rd, 2026 from 12-1 PM EST.

Arnold, Wyatt [Politecnico di Milano]↗

Factorized visual representations in the primate visual system and deep neural networks

Object classification has been proposed as a principal objective of the primate ventral visual stream and has been used as an optimization target for deep neural network models (DNNs) of the visual system. However, visual brain areas represent many different types of information, and optimizing for classification of object identity alone does not constrain how other information may be encoded in visual representations. Information about different scene parameters may be discarded altogether (‘invariance’), represented in non-interfering subspaces of population activity (‘factorization’) or encoded in an entangled fashion. In this work, we provide evidence that factorization is a normative principle of biological visual representations. In the monkey ventral visual hierarchy, we found that factorization of object pose and background information from object identity increased in higher-level regions and strongly contributed to improving object identity decoding performance. We then conducted a large-scale analysis of factorization of individual scene parameters – lighting, background, camera viewpoint, and object pose – in a diverse library of DNN models of the visual system. Models which best matched neural, fMRI, and behavioral data from both monkeys and humans across 12 datasets tended to be those which factorized scene parameters most strongly. Notably, invariance to these parameters was not as consistently associated with matches to neural and behavioral data, suggesting that maintaining non-class information in factorized activity subspaces is often preferred to dropping it altogether. Thus, we propose that factorization of visual scene information is a widely used strategy in brains and DNN models thereof.

59 BASIC BIOLOGICAL SCIENCES↗

NIMBUS COMMAND SUBSYSTEM

All satellites have one common requirement, known as the command facility. This is usually a real-time direct RF link from a ground transmitter through the satellite receiver and decoder to a relay or controlled circuit. The more sophisticated research and operational satellites require a command facility which will permit storing of commands to activate systems at predetermined future times when the satellite is beyond the range of the command ground station. These satellites require an accurate clock and a source of precision frequencies. In the Nimbus spacecraft, all these functions are performed by an integrated command and clock subsystem, which includes the command clock and clock-receiver modules in the spacecraft, plus the associated command ground station. This paper will describe the functions and features of these various equipment's.

GROUND SUPPORT SYSTEM↗