Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Inspires”

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,099 records · Page 61

A quantum algorithm to efficiently sample from interfering binary trees

Quantum computers provide an opportunity to efficiently sample from probability distributions that include non-trivial interference effects between amplitudes. Using a simple process wherein all possible state histories can be specified by a binary tree, we construct an explicit quantum algorithm that runs in polynomial time to sample from the process once. The corresponding naive Markov Chain algorithm does not produce the correct probability distribution and an explicit classical calculation of the full distribution requires exponentially many operations. Finally, the problem can be reduced to a system of two qubits with repeated measurements, shedding light on a quantum-inspired efficient classical algorithm.

97 MATHEMATICS AND COMPUTING↗

TEQUILA: a platform for rapid development of quantum algorithms

Variational quantum algorithms are currently the most promising class of algorithms for deployment on near-term quantum computers. In contrast to classical algorithms, there are almost no standardized methods in quantum algorithmic development yet, and the field continues to evolve rapidly. As in classical computing, heuristics play a crucial role in the development of new quantum algorithms, resulting in a high demand for flexible and reliable ways to implement, test, and share new ideas. In this paper, inspired by this demand, we introduce TEQUILA, a development package for quantum algorithms in PYTHON, designed for fast and flexible implementation, prototyping and deployment of novel quantum algorithms in electronic structure and other fields. TEQUILA operates with abstract expectation values which can be combined, transformed, differentiated, and optimized. On evaluation, the abstract data structures are compiled to run on state of the art quantum simulators or interfaces.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Roadmap for unconventional computing with nanotechnology

Abstract In the ‘Beyond Moore’s Law’ era, with increasing edge intelligence, domain-specific computing embracing unconventional approaches will become increasingly prevalent. At the same time, adopting a variety of nanotechnologies will offer benefits in energy cost, computational speed, reduced footprint, cyber resilience, and processing power. The time is ripe for a roadmap for unconventional computing with nanotechnologies to guide future research, and this collection aims to fill that need. The authors provide a comprehensive roadmap for neuromorphic computing using electron spins, memristive devices, two-dimensional nanomaterials, nanomagnets, and various dynamical systems. They also address other paradigms such as Ising machines, Bayesian inference engines, probabilistic computing with p-bits, processing in memory, quantum memories and algorithms, computing with skyrmions and spin waves, and brain-inspired computing for incremental learning and problem-solving in severely resource-constrained environments. These approaches have advantages over traditional Boolean computing based on von Neumann architecture. As the computational requirements for artificial intelligence grow 50 times faster than Moore’s Law for electronics, more unconventional approaches to computing and signal processing will appear on the horizon, and this roadmap will help identify future needs and challenges. In a very fertile field, experts in the field aim to present some of the dominant and most promising technologies for unconventional computing that will be around for some time to come. Within a holistic approach, the goal is to provide pathways for solidifying the field and guiding future impactful discoveries.

Finocchio, Giovanni (ORCID:0000000210433876)↗

Light by design: emerging frontiers in ultrafast photon sciences and light–matter interactions

Photon sciences and technologies establish the building blocks for myriad scientific and engineering frontiers in life and energy sciences. Because of their overarching functionality, the developmental roadmap and opportunities underpinned by photonics are often semiotically mediated by the delineation of subject areas of application. In this perspective article, we map current and emerging linkages between three intersecting areas of research stewarded by advanced photonics technologies, namely light by design, outlined as (a) quantum and structured photonics, (b) light–matter interactions in accelerators and accelerator-based light sources, and (c) ultrafast sciences and quantum molecular dynamics. In each section, we will concentrate on state-of-the-art achievements and present prospective applications in life sciences, biochemistry, quantum optics and information sciences, and environmental and chemical engineering, all founded on a broad range of photon sources and methodologies. We hope that this interconnected mapping of challenges and opportunities seeds new concepts, theory, and experiments in the advancement of ultrafast photon sciences and light–matter interactions. Additionally, through this mapping, we hope to inspire a critically interdisciplinary approach to the science and applications of light by design.

42 ENGINEERING↗

An end-to-end trainable hybrid classical-quantum classifier

Abstract We introduce a hybrid model combining a quantum-inspired tensor network and a variational quantum circuit to perform supervised learning tasks. This architecture allows for the classical and quantum parts of the model to be trained simultaneously, providing an end-to-end training framework. We show that compared to the principal component analysis, a tensor network based on the matrix product state with low bond dimensions performs better as a feature extractor for the input data of the variational quantum circuit in the binary and ternary classification of MNIST and Fashion-MNIST datasets. The architecture is highly adaptable and the classical-quantum boundary can be adjusted according to the availability of the quantum resource by exploiting the correspondence between tensor networks and quantum circuits.

97 MATHEMATICS AND COMPUTING↗

A detailed study of interpretability of deep neural network based top taggers

Abstract Recent developments in the methods of explainable artificial intelligence (XAI) allow researchers to explore the inner workings of deep neural networks (DNNs), revealing crucial information about input–output relationships and realizing how data connects with machine learning models. In this paper we explore interpretability of DNN models designed to identify jets coming from top quark decay in high energy proton–proton collisions at the Large Hadron Collider. We review a subset of existing top tagger models and explore different quantitative methods to identify which features play the most important roles in identifying the top jets. We also investigate how and why feature importance varies across different XAI metrics, how correlations among features impact their explainability, and how latent space representations encode information as well as correlate with physically meaningful quantities. Our studies uncover some major pitfalls of existing XAI methods and illustrate how they can be overcome to obtain consistent and meaningful interpretation of these models. We additionally illustrate the activity of hidden layers as neural activation pattern diagrams and demonstrate how they can be used to understand how DNNs relay information across the layers and how this understanding can help to make such models significantly simpler by allowing effective model reoptimization and hyperparameter tuning. These studies not only facilitate a methodological approach to interpreting models but also unveil new insights about what these models learn. Incorporating these observations into augmented model design, we propose the particle flow interaction network model and demonstrate how interpretability-inspired model augmentation can improve top tagging performance.

97 MATHEMATICS AND COMPUTING↗

Differentiable Earth mover’s distance for data compression at the high-luminosity LHC

Abstract The Earth mover’s distance (EMD) is a useful metric for image recognition and classification, but its usual implementations are not differentiable or too slow to be used as a loss function for training other algorithms via gradient descent. In this paper, we train a convolutional neural network (CNN) to learn a differentiable, fast approximation of the EMD and demonstrate that it can be used as a substitute for computing-intensive EMD implementations. We apply this differentiable approximation in the training of an autoencoder-inspired neural network (encoder NN) for data compression at the high-luminosity LHC at CERN The goal of this encoder NN is to compress the data while preserving the information related to the distribution of energy deposits in particle detectors. We demonstrate that the performance of our encoder NN trained using the differentiable EMD CNN surpasses that of training with loss functions based on mean squared error.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Many-body expansion based machine learning models for octahedral transition metal complexes

Abstract Graph-based machine learning (ML) models for material properties show great potential to accelerate virtual high-throughput screening of large chemical spaces. However, in their simplest forms, graph-based models do not include any 3D information and are unable to distinguish stereoisomers such as those arising from different orderings of ligands around a metal center in coordination complexes. In this work we present a modification to revised autocorrelation descriptors, a molecular graph featurization method, for predicting spin state dependent properties of octahedral transition metal complexes (TMCs). Inspired by analytical semi-empirical models for TMCs, the new modeling strategy is based on the many-body expansion (MBE) and allows one to tune the captured stereoisomer information by changing the truncation order of the MBE. We present the necessary modifications to include this approach in two commonly used ML methods, kernel ridge regression and feed-forward neural networks. On a test set composed of all possible isomers of binary TMCs, the best MBE models achieve mean absolute errors (MAEs) of 2.75 kcal mol −1 on spin-splitting energies and 0.26 eV on frontier orbital energy gaps, a 30%–40% reduction in error compared to models based on our previous approach. We also observe improved generalization to previously unseen ligands where the best-performing models exhibit MAEs of 4.00 kcal mol −1 (i.e. a 0.73 kcal mol −1 reduction) on the spin-splitting energies and 0.53 eV (i.e. a 0.10 eV reduction) on the frontier orbital energy gaps. Because the new approach incorporates insights from electronic structure theory, such as ligand additivity relationships, these models exhibit systematic generalization from homoleptic to heteroleptic complexes, allowing for efficient screening of TMC search spaces.

Meyer, Ralf (ORCID:0000000322360261)↗

Outlook towards deployable continual learning for particle accelerators

Particle accelerators are high power complex machines. To ensure uninterrupted operation of these machines, thousands of pieces of equipment need to be synchronized, which requires addressing many challenges including design, optimization and control, anomaly detection and machine protection. With recent advancements, machine learning (ML) holds promise to assist in more advance prognostics, optimization, and control. While ML based solutions have been developed for several applications in particle accelerators, only few have reached deployment and even fewer to long term usage, due to particle accelerator data distribution drifts caused by changes in both measurable and non-measurable parameters. In this paper, we identify some of the key areas within particle accelerators where continual learning can allow maintenance of ML model performance with distribution drifts. Particularly, we first discuss existing applications of ML in particle accelerators, and their limitations due to distribution drift. Next, we review existing continual learning techniques and investigate their potential applications to address data distribution drifts in accelerators. By identifying the opportunities and challenges in applying continual learning, this paper seeks to open up the new field and inspire more research efforts towards deployable continual learning for particle accelerators.

43 PARTICLE ACCELERATORS↗

A kinetic-based regularization method for data science applications

We propose a physics-based regularization technique for function learning, inspired by statistical mechanics. By drawing an analogy between optimizing the parameters of an interpolator and minimizing the energy of a system, we introduce corrections that impose constraints on the lower-order moments of the data distribution. This minimizes the discrepancy between the discrete and continuum representations of the data, in turn allowing to access more favorable energy landscapes, thus improving the accuracy of the interpolator. Our approach improves performance in both interpolation and regression tasks, even in high-dimensional spaces. Unlike traditional methods, it does not require empirical parameter tuning, making it particularly effective for handling noisy data. We also show that thanks to its local nature, the method offers computational and memory efficiency advantages over Radial Basis Function interpolators, especially for large datasets.

97 MATHEMATICS AND COMPUTING↗

The ballad of LLM agents: philosophical reasoning for chemistry

Large language models (LLMs) show remarkable potential for scientific reasoning but often produce unreliable or scientifically unactionable outputs when faced with multi-step logic, domain grounding, and interpretability challenges, especially in complex fields like chemistry and materials science. Here, we introduce a framework of philosophical reasoning agents, inspired by canonical thinkers such as Socrates, Descartes, Kant, and Hume, to guide LLM behavior via structured prompt engineering. These agents embody distinct reasoning paradigms (dialectical inquiry, deductive logic, rule-based judgment, and empirical validation) and are evaluated across multiple chemistry subdomains, physical, analytical, general, inorganic, and organic chemistry, using the ChemBench benchmark. Our agentic prompting approach yields substantial accuracy gains on open-ended numerical chemistry questions, with gains of +11.5 percentage points for GPT-4o with Hume, +4.5 percentage points for GPT-5 with Kant, and +21.8 percentage points for GPT-5.1 with Socrates at the strict 1% error threshold, relative to the corresponding base models. Beyond accuracy, we observe benchmark-level model–agent performance patterns, suggesting that different prompting styles interact differently with each base model. These findings demonstrate that embedding philosophy-of-science principles into multi-agent frameworks can improve and produce interpretable, adaptive, and domain-aligned scientific LLMs.

Harb, Hassan [Argonne National Laboratory (ANL), A↗

Few-mode and anisotropic quantum transport in InSb nanoribbons using an all-van der Waals material-based gate

High-quality electrostatic gating is a fundamental ingredient for successful semiconducting device physics, and a key element of realizing clean quantum transport. Inspired by the widespread improvement of transport quality when two-dimensional van der Waals (vdW) materials are gated exclusively by other vdW materials, we have developed a method for gating non-vdW materials with an all-vdW gate stack, consisting of a hexagonal boron nitride dielectric layer and a few-layer graphite gate electrode. We demonstrate this gating approach on MOVPE-grown InSb nanoribbons (NRs), a novel variant of the InSb nanowire, with a flattened cross-section. In our all-vdW gated NR devices we observe conductance features that are reproducible and have low- to near-zero gate hysteresis. We also report quantized conductance, which persists to lower magnetic fields and longer channel lengths than typical InSb nanowire devices reported to date. Additionally, we observe level splitting that is highly anisotropic in an applied magnetic field, which we attribute to the ribbon cross-section. The performance of our devices is consistent with the reduced disorder expected from the all-vdW gating scheme, and marks the first report of ballistic, few-modes quantum transport in a non-vdW material with an all-vdW gate. Our results establish all-vdW gating as a promising approach for high-quality gating of non-vdW materials for quantum transport, which is in principle applicable generically, beyond InSb systems. In addition, the work showcases the specific potential of all-vdW gate/InSb NR devices for enabling clean quantum devices that may be relevant for spintronics and topological superconductivity studies.

InSb↗

Digital coded exposure formation of frames from event-based imagery

Abstract Event-driven neuromorphic imagers have a number of attractive properties including low-power consumption, high dynamic range, the ability to detect fast events, low memory consumption and low band-width requirements. One of the biggest challenges with using event-driven imagery is that the field of event data processing is still embryonic. In contrast, decades worth of effort have been invested in the analysis of frame-based imagery. Hybrid approaches for applying established frame-based analysis techniques to event-driven imagery have been studied since event-driven imagers came into existence. However, the process for forming frames from event-driven imagery has not been studied in detail. This work presents a principled digital coded exposure approach for forming frames from event-driven imagery that is inspired by the physics exploited in a conventional camera featuring a shutter. The technique described in this work provides a fundamental tool for understanding the temporal information content that contributes to the formation of a frame from event-driven imagery data. Event-driven imagery allows for the application of arbitrary virtual digital shutter functions to form the final frame on a pixel-by-pixel basis. The proposed approach allows for the careful control of the spatio-temporal information that is captured in the frame. Furthermore, unlike a conventional physical camera, event-driven imagery can be formed into any variety of possible frames in post-processing after the data is captured. Furthermore, unlike a conventional physical camera, coded-exposure virtual shutter functions can assume arbitrary values including positive, negative, real, and complex values. The coded exposure approach also enables the ability to perform applications of industrial interest such as digital stroboscopy without any additional hardware. The ability to form frames from event-driven imagery in a principled manner opens up new possibilities in the ability to use conventional frame-based image processing techniques on event-driven imagery.

47 OTHER INSTRUMENTATION↗

Binary operations on neuromorphic hardware with application to linear algebraic operations and stochastic equations

Abstract Non-von Neumann computational hardware, based on neuron-inspired, non-linear elements connected via linear, weighted synapses—so-called neuromorphic systems—is a viable computational substrate. Since neuromorphic systems have been shown to use less power than CPUs for many applications, they are of potential use in autonomous systems such as robots, drones, and satellites, for which power resources are at a premium. The power used by neuromorphic systems is approximately proportional to the number of spiking events produced by neurons on-chip. However, typical information encoding on these chips is in the form of firing rates that unarily encode information. That is, the number of spikes generated by a neuron is meant to be proportional to an encoded value used in a computation or algorithm. Unary encoding is less efficient (produces more spikes) than binary encoding. For this reason, here we present neuromorphic computational mechanisms for implementing binary two’s complement operations. We use the mechanisms to construct a neuromorphic, binary matrix multiplication algorithm that may be used as a primitive for linear differential equation integration, deep networks, and other standard calculations. We also construct a random walk circuit and apply it in Brownian motion simulations. We study how both algorithms scale in circuit size and iteration time.

97 MATHEMATICS AND COMPUTING↗

Climate Nowcasting

The climate is changing so rapidly that climatologies based on historical statistics cannot reliably capture the current risk of extreme weather events hazardous to society. Decision relevant projections of weather extreme probability over the next 10–15 years are needed to enable adaptation and resilience in the face of this evolving risk. Current weather forecasts/predictions and long-term climate projections for decades into the future are inadequate for providing this information to stakeholders that need it, targeting forecast horizons either too short or too far into the future. We argue that a new approach is needed: climate nowcasting. Climate nowcasting would focus on user-inspired extreme metrics over the next 10–15 year time frame, targeting specific impacts and locations down to a local scale, by engaging with stakeholders to understand their needs and provide information in a format relevant for decision making. Importantly, climate nowcasting will not consist of a single approach or data set, involving rather data fusion from different sources of information: simulations, observations and data driven methods, likely through different weights depending on the metric of interest. Predictions must be accompanied by serious engagement with stakeholders facing climate risks, and clearly present uncertainties and limitations of any prediction. Such a vision is very different from how typical climate or weather forecasts are applied today.

Gettelman, Andrew↗

A resource adequacy assessment of correlated wide-area outages in the power grid

As the power grid is undergoing rapid transformations, numerous questions are emerging about its vulnerability to wide-area extreme events (WAEE), which could influence its operations. Relatively few analyses have been conducted to date regarding the impact of correlated outages during WAEEs on the grid’s ability to balance resources with demand. This study addresses this gap by conducting a resource adequacy analysis for a hurricane-inspired WAEE on a 2035 synthetic power grid system for the United States. A sensitivity analysis was also conducted to characterize the relative impact of weather on unserved energy. Our results indicate that although the magnitude and duration of the shortfalls vary depending on weather conditions, persistent shortfalls are observed in some regions. Initial explorations indicate a strong correlation between transmission-constrained regions and regions with persistent shortfalls. Future work could generate empirically-grounded representations for generator outages as well as conduct causal analyses of these shortfalls to improve understanding of drivers as well as possible mitigation strategies. Continued exploration of extreme weather impacts on the grid is important to develop more robust understanding of the reliability and resilience of our power systems, especially as they undergo rapid transformations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Skeletides: A Modular, Simplified Physical Model of Protein Secondary Structure

Three-dimensional (3D) models are essential for visualization and conceptual understanding of complex architectures such as protein structure. Although there is a plethora of software platforms that allow digital depictions of protein structure at an atomic level in silico, physical models are needed to convey an intuitive understanding of biomolecular architecture. However, it is a challenge to represent all the relevant features of proteins in a single physical model due to their sheer structural complexity. Here, we describe a modular protein model that focuses only on representation of the secondary structure—the underlying structural skeleton. The simplified model consists of amino acid units, which can be linked together to reproduce the two most fundamental structural features of protein secondary structure: the relative positions of the amino acid alpha carbon atoms, and the intra-main chain hydrogen bonding pattern. We use 3D printing and magnets to create a set of three modular amino acid building blocks, which when linked together into a chain, can faithfully represent alpha helices, beta sheets, and turns. These simple to make models can be used to quickly assemble the alpha carbon trace of an entire protein domain, which conveys a tactile experience of the complexity of protein skeletal architecture. These models highlight the modularity of protein structure: where a single structural unit, the amino acid, can be linked together to form a larger, regular secondary structure. These models also have a propensity to spontaneously organize into alpha helices and beta sheets, as demonstrated by their ability to autonomously assemble when placed in a circulating water tank. These models provide a missing educational tool to expand knowledge of protein structure, foster deeper insight into protein folding, and inspire greater interest in biomacromolecular architecture.

36 MATERIALS SCIENCE↗

Automorphic spectra and the conformal bootstrap

We describe a new method for constraining Laplacian spectra of hyperbolic surfaces and 2-orbifolds. The main ingredient is consistency of the spectral decomposition of integrals of products of four automorphic forms. Using a combination of representation theory of PSL 2 (R) and semidefinite programming, the method yields rigorous upper bounds on the Laplacian spectral gap. In several examples, the bound is nearly sharp. For instance, our bound on all genus-2 surfaces is λ 1 ≤ 3.8388976481, while the Bolza surface has λ 1 ≈ 3.838887258. The bounds also allow us to determine the set of spectral gaps attained by all hyperbolic 2-orbifolds. Our methods can be generalized to higher-dimensional hyperbolic manifolds and to yield stronger bounds in the two-dimensional case. The ideas were closely inspired by modern conformal bootstrap.

Kravchuk, Petr↗