Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Showcase”

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 973 records · Page 54

Enhancing cathode composites with conductive alignment synergy for solid-state batteries

Enhancing transport and chemomechanical properties in cathode composites is crucial for the performance of solid-state batteries. Our study introduces the filler-aligned structured thick (FAST) electrode, which notably improves mechanical strength and ionic/electronic conductivity in solid composite cathodes. The FAST electrode incorporates vertically aligned nanoconducting carbon nanotubes within an ion-conducting polymer electrolyte, creating a low-tortuosity electron/ion transport path while strengthening the electrode’s structure. This design not only mitigates recrystallization of the polymer electrolyte but also establishes a densified local electric field distribution and accelerates the migration of lithium ions. The FAST electrode showcases outstanding electrochemical performance with lithium iron phosphate as the active material, achieving a high capacity of 148.2 milliampere hours per gram at 0.2 C over 100 cycles with substantial material loading (49.3 milligrams per square centimeter). This innovative electrode design marks a remarkable stride in addressing the challenges of solid-state lithium metal batteries.

Science & Technology - Other Topics↗

Electronic anisotropy and rotational symmetry breaking at a Weyl semimetal/spin ice interface

In magnetic pyrochlore materials, the interplay of spin-orbit coupling, electronic correlations, and geometrical frustration gives rise to exotic quantum phases, including topological semimetals and spin ice. While these phases have been observed in isolation, the interface-driven phenomena emerging from their interaction have never been realized previously. Here, we report on the discovery of interfacial electronic anisotropy and rotational symmetry breaking at a heterostructure consisting of the Weyl semimetal Eu 2 Ir 2 O 7 and spin ice Dy 2 Ti 2 O 7 . Subjected to magnetic fields, we unveil a sixfold anisotropic transport response that is theoretically accounted by a Kondo-coupled heterointerface, where the spin ice’s field-tuned magnetism induces electron scattering in the Weyl semimetal’s topological Fermi-arc states. Furthermore, at elevated magnetic fields, we reveal a twofold anisotropic response indicative of the emergence of a symmetry-broken many-body state. This discovery showcases the potential of pyrochlore frustrated magnet/topological semimetal heterostructures in search of emergent interfacial phenomena.

Science & Technology - Other Topics↗

A high-throughput experimentation platform for data-driven discovery in electrochemistry

Automating electrochemical analyses combined with artificial intelligence is poised to accelerate discoveries in renewable energy sciences and technologies. This study presents an automated high-throughput electrochemical characterization (AHTech) platform as a cost-effective and versatile tool for rapidly assessing liquid analytes. The Python-controlled platform combines a liquid handling robot, potentiostat, and customizable microelectrode bundles for diverse, reproducible electrochemical measurements in microtiter plates, minimizing chemical consumption and manual effort. To showcase the capability of AHTech, we screened a library of 180 small molecules as electrolyte additives for aqueous zinc metal batteries, generating data for training machine learning models to predict Coulombic efficiencies. Key molecular features governing additive performance were elucidated using Shapley Additive exPlanations and Spearman’s correlation, pinpointing high-performance candidates like cis-4-hydroxy-d-proline, which achieved an average Coulombic efficiency of 99.52% over 200 cycles. The workflow established herein is highly adaptable, offering a powerful framework for accelerating the exploration and optimization of extensive chemical spaces across diverse energy storage and conversion fields.

Lin, Dian-Zhao [Johns Hopkins University, Baltimor↗

Spatial control of heavy-fermion superconductivity in CeIrIn 5

While crystals of strongly correlated metals exhibit a diverse set of electronic ground states, few approaches exist for spatially modulating their properties. In this study, we demonstrate disorder-free control, on the micrometer scale, over the superconducting state in samples of the heavy-fermion superconductor CeIrIn 5 . We pattern crystals by focused ion beam milling to tailor the boundary conditions for the elastic deformation upon thermal contraction during cooling. The resulting nonuniform strain fields induce complex patterns of superconductivity, owing to the strong dependence of the transition temperature on the strength and direction of strain. These findings showcase a generic approach to manipulating electronic order on micrometer length scales in strongly correlated matter without compromising the cleanliness, stoichiometry, or mean free path.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Light-powered CO 2 fixation in a chloroplast mimic with natural and synthetic parts

Nature integrates complex biosynthetic and energy-converting tasks within compartments such as chloroplasts and mitochondria. Chloroplasts convert light into chemical energy, driving carbon dioxide fixation. We used microfluidics to develop a chloroplast mimic by encapsulating and operating photosynthetic membranes in cell-sized droplets. These droplets can be energized by light to power enzymes or enzyme cascades and analyzed for their catalytic properties in multiplex and real time. We demonstrate how these microdroplets can be programmed and controlled by adjusting internal compositions and by using light as an external trigger. We showcase the capability of our platform by integrating the crotonyl–coenzyme A (CoA)/ethylmalonyl-CoA/hydroxybutyryl-CoA (CETCH) cycle, a synthetic network for carbon dioxide conversion, to create an artificial photosynthetic system that interfaces the natural and the synthetic biological worlds.

Miller, Tarryn E.↗

Structure-guided discovery of ancestral CRISPR-Cas13 ribonucleases

The RNA-guided ribonuclease CRISPR-Cas13 enables adaptive immunity in bacteria and programmable RNA manipulation in heterologous systems. Cas13s share limited sequence similarity, hindering discovery of related or ancestral systems. Here, to address this, we developed an automated structural-search pipeline to identify an ancestral clade of Cas13 (Cas13an) and further trace Cas13 origins to defense-associated ribonucleases. Despite being one-third the size of other Cas13s, Cas13an mediates robust programmable RNA depletion and defense against diverse bacteriophages. However, unlike its larger counterparts, Cas13an uses a single active site for both CRISPR RNA processing and RNA-guided cleavage, revealing that the ancestral nuclease domain has two modes of activity. Discovery of Cas13an deepens our understanding of CRISPR-Cas evolution and expands opportunities for precision RNA editing, showcasing the promise of structure-guided genome mining.

59 BASIC BIOLOGICAL SCIENCES↗

Meta Biome: a multiscale model integrating agent-based and metabolic networks to reveal spatial regulation in gut mucosal microbial communities

ABSTRACT Mucosal microbial communities (MMCs) are complex ecosystems near the mucosal layers of the gut essential for maintaining health and modulating disease states. Despite advances in high-throughput omics technologies, current methodologies struggle to capture the dynamic metabolic interactions and spatiotemporal variations within MMCs. In this work, we presentMetaBiome, a multiscale model integrating agent-based modeling (ABM), finite volume methods, and constraint-based models to explore the metabolic interactions within these communities. Integrating ABM allows for the detailed representation of individual microbial agents each governed by rules that dictate cell growth, division, and interactions with their surroundings. Through a layered approach—encompassing microenvironmental conditions, agent information, and metabolic pathways—we simulated different communities to showcase the potential of the model. Using ourin-silicoplatform, we explored the dynamics and spatiotemporal patterns of MMCs in the proximal small intestine and the cecum, simulating the physiological conditions of the two gut regions. Our findings revealed how specific microbes adapt their metabolic processes based on substrate availability and local environmental conditions, shedding light on spatial metabolite regulation and informing targeted therapies for localized gut diseases.MetaBiome provides a detailed representation of microbial agents and their interactions, surpassing the limitations of traditional grid-based systems. This work marks a significant advancement in microbial ecology, as it offers new insights into predicting and analyzing microbial communities. IMPORTANCE Our study presents a novel multiscale model that combines agent-based modeling, finite volume methods, and genome-scale metabolic models to simulate the complex dynamics of mucosal microbial communities in the gut. This integrated approach allows us to capture spatial and temporal variations in microbial interactions and metabolism that are difficult to study experimentally. Key findings from our model include the following: (i) prediction of metabolic cross-feeding and spatial organization in multi-species communities, (ii) insights into how oxygen gradients and nutrient availability shape community composition in different gut regions, and (iii) identification of spatiallyregulated metabolic pathways and enzymes inE. coli. We believe this work represents a significant advance in computational modeling of microbial communities and provides new insights into the spatial regulation of gut microbiome metabolism. The multiscale modeling approach we have developed could be broadly applicable for studying other complex microbial ecosystems.

Microbiology↗

Multilevel Hierarchical Decomposition of Finite Element White Noise with Application to Multilevel Markov Chain Monte Carlo

In this work we develop a new hierarchical multilevel approach to generate Gaussian random field realizations in an algorithmically scalable manner that is well suited to incorporating into multilevel Markov chain Monte Carlo (MCMC) algorithms. This approach builds off of other partial differential equation (PDE) approaches for generating Gaussian random field realizations; in particular, a single field realization may be formed by solving a reaction-diffusion PDE with a spatial white noise source function as the right-hand side. While these approaches have been explored to accelerate forward uncertainty quantification tasks, e.g., multilevel Monte Carlo, the previous constructions are not directly applicable to multilevel MCMC frameworks which build fine-scale random fields in a hierarchical fashion from coarse-scale random fields. Our new hierarchical multilevel method relies on a hierarchical decomposition of the white noise source function in $L^2$ which allows us to form Gaussian random field realizations across multiple levels of discretization in a way that fits into multilevel MCMC algorithmic frameworks. After presenting our main theoretical results and numerical scaling results to showcase the utility of this new hierarchical PDE method for generating Gaussian random field realizations, this method is tested on a four-level MCMC algorithm to explore its feasibility.

algebraic multigrid↗

Reducing Operator Complexity of Galerkin Coarse-grid Operators with Machine Learning

Here, we propose a data-driven and machine-learning-based approach to compute non-Galerkin coarse-grid operators in multigrid (MG) methods, addressing the well-known issue of increasing operator complexity. Guided by the MG theory on spectrally equivalent coarse-grid operators, we have developed novel machine learning algorithms that utilize neural networks combined with smooth test vectors from multigrid eigenvalue problems. The proposed method demonstrates promise in reducing the complexity of coarse-grid operators while maintaining overall MG convergence for solving parametric partial differential equation problems. Numerical experiments on anisotropic rotated Laplacian and linear elasticity problems are provided to showcase the performance and comparison with existing methods for computing non-Galerkin coarse-grid operators.

97 MATHEMATICS AND COMPUTING↗

Score-Based Physics-Informed Neural Networks for High-Dimensional Fokker–Planck Equations

The Fokker-Planck (FP) equation is a foundational partial differential equation (PDE) in stochastic processes involving Brownian motions. However, the curse of dimensionality (CoD) poses a formidable challenge when dealing with high-dimensional FP equations. Although Monte Carlo simulation and (vanilla) Physics-Informed Neural Networks (PINNs) have shown the potential to tackle CoD, both methods exhibit significant numerical errors in high dimensions when dealing with the probability density function (PDF) associated with Brownian motion. The point-wise PDF values tend to decrease exponentially as dimensionality increases, surpassing the precision of numerical simulations and resulting in substantial errors. In addition, due to its massive sampling, Monte Carlo fails to offer fast sampling. Modeling the logarithm likelihood (LL) via vanilla PINNs transforms the FP equation into a notoriously difficult Hamilton-Jacobi-Bellman (HJB) equation, which is impractical for PINN learning, whose error grows rapidly with dimension. To this end, we propose a novel approach utilizing a score-based solver to fit the score function in stochastic differential equations (SDEs). The score function, defined as the gradient of the LL, plays a fundamental role in inferring LL and PDF and enables fast SDE sampling, offering an effective means to overcome the CoD. Three fitting methods, Score Matching (SM), Sliced Score Matching (SSM), and Score-PINN, are introduced, each contributing unique advantages in computational complexity, accuracy, and generality. The proposed score-based SDE solver operates in two stages: first, employing score matching or Score-PINN to acquire the score function; and second, solving the LL via an ordinary differential equation (ODE) using the obtained score function. Comparative evaluations across these methods showcase varying trade-offs. The proposed methodology is evaluated across diverse SDEs, including anisotropic Ornstein-Uhlenbeck processes, geometric Brownian motion, and Brownian motion with varying eigenspace. We also test various distributions, including Gaussian, Log-normal, Laplace, and Cauchy distributions. The numerical results demonstrate the score-based SDE solver’s stability, speed, and performance across different experimental settings, solidifying its potential as a solution to CoD for high-dimensional FP equations.

97 MATHEMATICS AND COMPUTING↗

Unveiling hidden physics at the LHC

The field of particle physics is at the crossroads. The discovery of a Higgs-like boson completed the Standard Model (SM), but the lacking observation of convincing resonances Beyond the SM (BSM) offers no guidance for the future of particle physics. On the other hand, the motivation for New Physics has not diminished and is, in fact, reinforced by several striking anomalous results in many experiments. Here we summarise the status of the most significant anomalies, including the most recent results for the flavour anomalies, the multi-lepton anomalies at the LHC, the Higgs-like excess at around 96 GeV, and anomalies in neutrino physics, astrophysics, cosmology, and cosmic rays. While the LHC promises up to 4 ab –1 of integrated luminosity and far-reaching physics programmes to unveil BSM physics, we consider the possibility that the latter could be tested with present data, but that systemic shortcomings of the experiments and their search strategies may preclude their discovery for several reasons, including: final states consisting in soft particles only, associated production processes, QCD-like final states, close-by SM resonances, and SUSY scenarios where no missing energy is produced. New search strategies could help to unveil the hidden BSM signatures, devised by making use of the CERN open data as a new testing ground. We discuss the CERN open data with its policies, challenges, and potential usefulness for the community. We showcase the example of the CMS collaboration, which is the only collaboration regularly releasing some of its data. We find it important to stress that individuals using public data for their own research does not imply competition with experimental efforts, but rather provides unique opportunities to give guidance for further BSM searches by the collaborations. Wide access to open data is paramount to fully exploit the LHCs potential.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Practical Obstacles of Data Transfer: Why researchers still love scp

The importance of computing facilities is heralded every six months with the announcement of the new Top500 list, showcasing the world s fastest supercomputers. Unfortu- nately, with great computing capability does not come great long-term data storage capacity, which often means users must move their data to their local site archive, to remote sites where they may be doing future computation or anal- ysis, or back to their home institution, else face the dreaded data purge that most HPC centers employ to keep utiliza- tion of large parallel filesystems low to manage performance and capacity. At HPC centers, data transfer is crucial to the scientific workflow and will increase in importance as computing systems grow in size. The Energy Sciences Net- work (ESnet) recently launched its fifth generation network, a 100 Gbps high-performance, unclassified national network connecting more than 40 DOE research sites to support scientific research and collaboration. Despite the tenfold increase in bandwidth to DOE research sites amenable to multiple data transfer streams and high throughput, in prac- tice, researchers often under-utilize the network and resort to painfully-slow single stream transfer methods such as scp to avoid the complexity of using multiple stream tools such as GridFTP and bbcp, and contend with frustration from the lack of consistency of available tools between sites. In this study we survey and assess the data transfer methods pro- vided at several DOE supported computing facilities, includ- ing both leadership-computing facilities, connected through ESnet. We present observed transfer rates, suggested opti- mizations, and discuss the obstacles the tools must overcome to receive wide-spread adoption over scp.

Nam, Hai Ah↗

DELTACON: A Principled Massive-Graph Similarity Function with Attribution

How much did a network change since yesterday? How different is the wiring between Bob's brain (a left-handed male) and Alice's brain (a right-handed female)? Graph similarity with known node correspondence, i.e. the detection of changes in the connectivity of graphs, arises in numerous settings. In this work, we formally state the axioms and desired properties of the graph similarity functions, and evaluate when state-of-the-art methods fail to detect crucial connectivity changes in graphs. We propose DeltaCon, a principled, intuitive, and scalable algorithm that assesses the similarity between two graphs on the same nodes (e.g. employees of a company, customers of a mobile carrier). In our experiments on various synthetic and real graphs we showcase the advantages of our method over existing similarity measures. We also employ DeltaCon to real applications: (a) we classify people to groups of high and low creativity based on their brain connectivity graphs, and (b) do temporal anomaly detection in the who-emails-whom Enron graph.

97 MATHEMATICS AND COMPUTING↗

O3BNN: An Out-Of-Order Architecture for High-Performance Binarized Neural Network Inference with Fine-Grained Pruning

In this work, we demonstrate that the highly-condensed BNN model can be shrunk significantly further by dynamically pruning irregular redundant edges. Based on two new observations on BNN-specific properties, our out-of-order (OoO) architecture – O3BNN, can curtail remaining edge evaluation in cases where the binary output of a neuron can be determined early. Similar to Instruction-Level-Parallelism (ILP), these fine-grained, irregular, runtime pruning opportunities are traditionally presumed to be di cult to exploit. We evaluate our design on an FPGA platform using three well-known networks, including VggNet-16, AlexNet for ImageNet, and a VGG-like network for Cifar-10. Results show that our out-of-order approach can prune 27%, 16%, and 42% of the operations for the three networks respectively, without any accuracy loss, leading to at least 1.7×, 1.5×, and 2.1× speedups over state-of-the-art implementations on FPGA/GPU/CPU BNN implementations. Our approach is inference runtime pruning, so no retrain or fine-tuning is needed. We demonstrate our design on an FPGA platform. However, this is only for showcasing the method; the approach does not rely on any FPGA-specific features and can thus be adopted by other devices as well.

Geng, Tong↗

Quantification of Energy Cost Savings through Optimization and Control of Appliances within Smart Neighborhood Homes

Electric utilities are driving towards enabling automatic scheduling and control of the consumption pattern of appliances such as heating, ventilation, and air conditioning (HVAC) and water heater (WH) systems (e.g., through preheating and pre-cooling, etc.) within smart neighborhoods to minimize energy cost and peak load demand. Quantifying economic savings through direct comparison of the optimized energy usage profile on a specific day with the typical non-optimized usage profile on another day is not a fair comparison because energy usage highly depends on weather conditions and human behaviour especially appliance like HVAC on those days. In this paper, we propose a novel approach of identifying similar weather day pairs which can then be used to compare the energy use profiles within homes between the identified pairs. We then demonstrate how the proposed approach can be used to compute cost savings due to optimization and control of smart appliances at home and neighborhood-level within a future-focused smart neighborhood of 62 residential homes. We also demonstrate a simulation based approach to quantify cost savings and showcase our findings through customized and interactive visualizations.

Chinthavali, Supriya↗

Automating NISQ Application Design with Meta Quantum Circuits with Constraints (MQCC)

Near-term intermediate scale quantum (NISQ) computers are likely to have very restricted hardware resources, where precisely controllable qubits are expensive, error-prone, and scarce. Programmers of such computers must therefore balance trade-offs among a large number of (potentially heterogeneous) factors specific to the targeted application and quantum hardware. To assist them, we propose Meta Quantum Circuits with Constraints (MQCC), a meta-programming framework for quantum programs. Programmers express their application as a succinct collection of normal quantum circuits stitched together by a set of (manually or automatically) added meta-level choice variables, whose values are constrained according to a programmable set of quantitative optimization criteria. MQCC’s compiler generates the appropriate constraints and solves them via an SMT solver, producing an optimized, runnable program. We showcase a few MQCC’s applications for its generality including an automatic generation of efficient error syndrome extraction schemes for fault-tolerant quantum error correction with heterogeneous qubits and an approach to writing approximate quantum Fourier transformation and quantum phase estimation that smoothly trades off accuracy and resource use. We also illustrate that MQCC can easily encode prior one-off NISQ application designs-–multi-programming (MP), crosstalk mitigation (CM)—as well as a combination of their optimization goals (i.e., a combined MP-CM).

97 MATHEMATICS AND COMPUTING↗

Differentiable Quantum Programming with Unbounded Loops

The emergence of variational quantum applications has led to the development of automatic differentiation techniques in quantum computing. Existing work has formulated differentiable quantum programming with bounded loops, providing a framework for scalable gradient calculation by quantum means for training quantum variational applications. However, promising parameterized quantum applications, e.g., quantum walk and unitary implementation, cannot be trained in the existing framework due to the natural involvement of unbounded loops. To fill in the gap, we provide the first differentiable quantum programming framework with unbounded loops, including a newly designed differentiation rule, code transformation, and their correctness proof. Technically, we introduce a randomized estimator for derivatives to deal with the infinite sum in the differentiation of unbounded loops, whose applicability in classical and probabilistic programming is also discussed. We implement our framework with Python and Q# and demonstrate a reasonable sample efficiency. Through extensive case studies, we showcase an exciting application of our framework in automatically identifying close-to-optimal parameters for several parameterized quantum applications.

Computer Science↗

Unveiling Temporal Performance Deviation: Leveraging Clustering in Microservices Performance Analysis

As the market for cloud computing continues to grow, an increasing number of users are deploying applications as microservices. The shift introduces unique challenges in identifying and addressing performance issues, particularly within large and complex infrastructures. To address this challenge, we propose a methodology that unveils temporal performance deviations in microservices by clustering containers based on their performance characteristics at different time intervals. Showcasing our methodology on the Alibaba dataset, we found both stable and dynamic performance patterns, providing a valuable tool for enhancing overall performance and reliability in modern application landscapes.

Clustering↗