Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Overlapping”

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,765 records · Page 98

Reconstruction and identification of pairs of collimated τ-leptons decaying hadronically using s=13 TeV pp collision data with the ATLAS detector

This paper describes an algorithm for reconstructing and identifying a highly collimated hadronically decaying τ$$\tau $$-lepton pair with low transverse momentum. When two τ$$\tau $$-leptons are highly collimated, their visible decay products might overlap, degrading the reconstruction performance for each of the τ$$\tau $$-leptons. A dedicated treatment attempting to tag the τ$$\tau $$-lepton pair as a single object is required. The reconstruction algorithm is based on a large radius jet and its associated two leading subjets, and the identification uses a boosted decision tree to discriminate between signatures from τ+τ-$$\tau ^+\tau ^-$$ systems and those arising from QCD jets. The efficiency of the identification algorithm is measured in Zγ$$Z\gamma $$ events using proton–proton collision data at s=13$$\sqrt{s}=13$$ TeV collected by the ATLAS experiment at the Large Hadron Collider between 2015 and 2018, corresponding to an integrated luminosity of 139fb-1$$139\,\text{ fb}^{-1}$$. The resulting data-to-simulation scale factors are close to unity with uncertainties ranging from 26 to 37%.

Aad, G↗

Cold freeze out of superheavy dark matter and Hubble tension

We present a unified framework, the "X miracle", in which dark matter consists of superheavy, nonthermal X particles whose relic abundance is determined not by the conventional weak-scale, semi-relativistic ("hot") freeze-out of WIMPs, but by annihilation or decay occurring within the smallest and earliest gravitationally bound objects. Unlike thermal WIMPs, which decouple at velocities of order 0.3c with relic abundance ρ∞ set by weak-scale interactions, X particles are produced nonthermally with an initial overabun dance ρ ini >> ρ ∞ . They become nonrelativistic extremely early, redshift to ultra-cold velocities, allowing collapse into compact bound structures characterized by a novel quantum gravitational scale, r X = 4$\hbar$ 2 $/Gm^3_X$ = 10 −13 m $\hbar$$/m_Xc$, much larger than the Compton wavelength. The framework predicts a particle mass of 10 12 GeV and an enhanced cross section of 10 −21 m 3 /s. Overlapping particle wavefunctions in these compact structures drive annihilation or decay into additional radiation, leading to a "cold" freeze-out that converts most of ρ ini into radiation while leaving a relic density ρ ∞ . Solutions to the Boltzmann equation indicate that an extreme ("big") depletion, with only one particle in a billion surviving, yields an additional radiation contribution $ΔN_{eff}$ ≈ 0.4, which could help alleviate the Hubble tension. For particles of 10 12 GeV, the scenario predicts a dark coupling constant α X = 0.09 that is responsible for an instanton-induced decay process, consistent with current UHECR bounds. Early collapse at 10 −6 s may release binding energy as high-frequency (100kHz) gravitational waves or ultralight GUT-scale axions (10 −9 eV). Superheavy sterile neutrinos provide a natural particle realization, linking dark matter to neutrino mass and baryogenesis. If gravitationally produced, this framework favors high-scale inflation and effi cient reheating. The "X miracle" thus demonstrates that dark matter need not be weak-scale: gravitational dynamics can control freeze-out and evolution, producing multi-messenger observational signatures in UHECRs, axions, gravitational waves, and small-scale structures.

Xu, Zhijie Jay [Pacific Northwest National Laborat↗

Neutrinos in Stellar Astrophysics (in The Encyclopedia of Cosmology)

The physics of the mysterious and stealthy neutrino is at the heart of many phenomena in the cosmos. These particles interact with matter and with each other through the aptly named weak interaction. At typical astrophysical energies the weak interaction is some twenty orders of magnitude weaker than the electromagnetic interaction. However, in the early universe and in collapsing stars neutrinos can more than make up for their feeble interaction strength with huge numbers. Neutrinos can dominate the dynamics in these sites and set the conditions that govern the synthesis of the elements. Here we journey through the history of the discovery of these particles and describe their role in stellar evolution and collapse, the big bang, and multi-messenger astrophysics. Neutrino physics is at the frontier of elementary particle physics, nuclear physics, astrophysics and cosmology. All of these fields overlap in the neutrino story.

Haxton, Wick↗

Few-shot Learning for Post-disaster Structure Damage Assessment

Automating post-disaster damage assessment with remote sensing data is critical for faster surveys of structures impacted by natural disasters. One significant obstacle to training state-of-the-art deep neural networks to support this automation is that large quantities of labelled data are often required. However, obtaining those labels is particularly unrealistic to support post-disaster damage assessment in a timely manner. Few-shot learning methods could help to mitigate this by reducing the amount of labelled data required to successfully train a model while achieving satisfactory results. To this end, we explore a feature reweighting method to the YOLOv3 object detection architecture to achieve few-shot learning of damage assessment models on the xBD dataset. Our results show that the feature reweighting approach yield improved mAP over the baseline with significantly fewer labelled samples. In addition, we use t-SNE to analyze the class-specific reweighting vectors generated by the reweighting module in order to evaluate their inter-class and intra-class similarity. We find that the vectors form clusters based on class, and that these clusters overlap with visually similar classes. Those results show the potential to employ this few-shot learning strategy for rapid damage assessment with post-event remote sensing images.

Bowman, Jordan↗

Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis

Label Propagation is not only a well-known machine learning algorithm for classification but also an effective method for discovering communities and connected components in networks. We propose a new Direction-optimizing Label Propagation Algorithm (DOLPA) framework that enhances the performance of the standard Label Propagation Algorithm (LPA), increases its scalability, and extends its versatility and application scope. As a central feature, the DOLPA framework relies on the use of frontiers and alternates between label push and label pull operations to attain high performance. It is formulated in such a way that the same basic algorithm can be used for finding communities or connected components in graphs by only changing the objective function used. Additionally, DOLPA has parameters for tuning the processing order of vertices in a graph to reduce the number of edges visited and improve the quality of solution obtained. We present the design and implementation of the enhanced algorithm as well as our shared-memory parallelization of it using OpenMP. We also present an extensive experimental evaluation of our implementations using the LFR benchmark and real-world networks drawn from various domains. Compared with an implementation of LPA for community detection available in a widely used network analysis software, we achieve at most five times the F-Score while maintaining similar runtime for graphs with overlapping communities. We also compare DOLPA against an implementation of the Louvain method for community detection using the same LFR-graphs and show that DOLPA achieves about three times the F-Score at just 10% of the runtime. For connected component decomposition, our algorithm achieves orders of magnitude speedups over the basic LP-based algorithm on large-diameter graphs, up to 13.2× speedup over the Shiloach-Vishkin algorithm, and up to 1.6× speedup over Afforest on an Intel Xeon processor using 40 threads.

97 MATHEMATICS AND COMPUTING↗

PyOED: An Extensible Suite for Data Assimilation and Model-Constrained Optimal Design of Experiments

This article describes PyOED, a highly extensible scientific package that enables developing and testing model-constrained optimal experimental design (OED) for inverse problems. Specifically, PyOED aims to be a comprehensive Python toolkit for model-constrained OED. The package targets scientists and researchers interested in understanding the details of OED formulations and approaches. It is also meant to enable researchers to experiment with standard and innovative OED technologies with a wide range of test problems (e.g., simulation models). OED, inverse problems (e.g., Bayesian inversion), and data assimilation (DA) are closely related research fields, and their formulations overlap significantly. Thus, PyOED is continuously being expanded with a plethora of Bayesian inversion, DA, and OED methods as well as new scientific simulation models, observation error models, and observation operators. These pieces are added such that they can be permuted to enable testing OED methods in various settings of varying complexities. The PyOED core is completely written in Python and utilizes the inherent object-oriented capabilities; however, the current version of PyOED is meant to be extensible rather than scalable. Specifically, PyOED is developed to “enable rapid development and benchmarking of OED methods with minimal coding effort and to maximize code reutilization.” This article provides a brief description of the PyOED layout and philosophy and provides a set of exemplary test cases and tutorials to demonstrate the potential of the package.

97 MATHEMATICS AND COMPUTING↗

DIMPLES: Distributed Influence Maximization for Pandemic pLanning on Exascale Systems

We study exascale parallel algorithms for the selection of intervention or monitoring strategies in massive realistic socio-technical networks through scalable Influence Maximization (InfMax) algorithms. We employ novel techniques to enable efficient scaling on up to 8k nodes of OLCF Frontier, with 65k AMD GPUs and 458k AMD CPU cores. Current state-of-the-art InfMax tools are limited to networks with only a few million actors (vertices) and a few hundred million interactions (edges). By overcoming these limitations, we show that our approach is capable of processing a realistic social contact network of the United States with 285 million nodes and about 8 billion edges. This two orders-of-magnitude improvement over the previous state-of-the-art is obtained by leveraging algorithmic advancements for the InfMax problem and designing several problem-specific approaches to overlap communication with computation, improve GPU efficiency, and lower the application’s memory requirements. We evaluate strong scaling for computing 10k most influential seeds using up to 8k nodes of an exascale system, and weak scaling from 128 to 8k system nodes for seed sets ranging from 625 to 40k seeds. We achieve the fastest-known runtime of 25 minutes while performing 48 million diffusion simulations totaling 2.31 petabytes to identify 40k influential seeds using 8k nodes, and take 5.75 minutes to identify 10k seeds while using 4k nodes.

Minutoli, Marco [Pacific Northwest National Labora↗

DoCeph: DPU-Offloaded Messaging in Ceph for Reduced Host CPU Utilization

Ceph is a widely used distributed object store, but its messenger layer imposes substantial CPU overhead on the host. To address this limitation, we propose DoCeph, a DPU-offloaded storage architecture for Ceph that disaggregates the system by offloading the communication-intensive messaging component to the DPU while retaining the storage backend on the host. The DPU efficiently manages communication, using lightweight RPC for metadata operations and DMA for data transfer. Moreover, DoCeph introduces a pipelining technique that overlaps data transmission with buffer preparation, mitigating hardware-imposed transfer size limitations. We implemented DoCeph on a Ceph cluster with NVIDIA BlueField-3 DPUs. Evaluation results indicate that DoCeph cuts host CPU usage by up to 92% while sustaining stable throughput and providing larger performance benefits for object writes over 1 MB.

Park, Kuri [Sogang University]↗

IRIS-MASH: Efficient Multi-device Asynchronous Multi-Stream Heterogeneous Computing

In the rapidly evolving field of high-performance computing (HPC), effectively leveraging heterogeneous devices through asynchronous task programming is paramount. This paper presents a robust asynchronous task programming model tailored for a multi-device, multi-stream execution environment that incorporates a diverse array of heterogeneous computing units, including GPUs from various vendors and other accelerators. Current state-of-the-art task programming models provide methodologies to support asynchronous task executions, but they typically handle homogeneous devices using native programming languages, while support for heterogeneous devices is limited to frameworks like OpenCL. This gap presents significant challenges in abstracting heterogeneous devices to harness their true asynchronous capabilities effectively using their native programming languages. By implementing asynchronous task execution, our model significantly boosts the performance of tiled algorithm task graphs through overlapping data transfers with computation and enabling the simultaneous execution of multiple kernels. We integrate this approach into a heterogeneous Intelligent Runtime System (IRIS) and assess its performance using a suite of tiled algorithm benchmarks from the heterogeneous math kernels library (MatRIS) based on IRIS. Experimental results demonstrate a performance improvement ranging from 1.6 × to 2 × over IRIS without asynchronous support, and a notable 22% performance enhancement compared to established runtime systems such as StarPU and PaRSEC. This approach significantly improves computation efficiency of HPC workflows and provides a solid base for future exploration and development in the area of asynchronous task programming in heterogeneous systems.

Miniskar, Narasinga Rao [ORNL] (ORCID:000000018259↗

CORE-BFS: Communication-Optimized REctangular-partitioned BFS Achieving 160.845 TeraTEPS on Frontier Supercomputer

Distributed Breadth-First Search (BFS) is fundamental to many large-scale graph applications, but its performance on parallel systems is often limited by high communication overhead. This paper presents CORE-BFS, an extremely scalable GPU-based BFS implementation that introduces a unique rectangular 2D partitioning-based design for Frontier supercomputer. To further improve performance, we propose four key optimizations: (1) Rectangular 2D-partition specific data formats that use two compressed row and one compressed column status array bitmaps combined with a Double Compressed Sparse Row (DCSR) format per partition, reducing memory footprint and inter-rank traffic; (2) Adaptive frontier & communication strategy that unifies top-down and bottom-up traversal on the rectangular layout, uses lazy synchronization in top-down levels, and switches variants based on frontier size to minimize communication overhead; (3) Frontier-split degree-aware update that maps frontier vertices to thread-centric, wavefront-centric, and block-centric kernels based on their degree to improve GPU utilization and memory coalescing; (4) Row-reduction pipeline that overlaps bottom-up adjacency list processing with row-wise bitmap reduction to hide inter-rank latency. Together, these techniques increase parallelism while reducing memory and communication overhead. On the Graph500 benchmark, CORE - BFS scales up to 9,248 Frontier nodes with scale-42 graphs and reaches 160.845 TTEPS, delivering a 5.42 × speedup over our previous Frontier implementation.

Yang, Haoshen [Rutgers University]↗

Spatially Accelerated Winding Numbers for Curved Geometry

The generalized winding number (GWN) is a scalar field that supports robust containment queries on curved geometry, including non-watertight, overlapping, and nested boundary representations. While queries can be easily parallelized over samples, direct evaluation on parametric curves and surfaces remains costly for large and complex models. Fast, state-of-the-art GWN approaches leverage a spatial index to approximate the GWN, typically coupled with a Taylor expansion which approximates the GWN contribution for far clusters of geometric primitives. However, such methods operate only on discrete inputs such as triangle meshes and point clouds, and would introduce containment errors near boundaries if applied to curved input. We extend support for fast GWN evaluation over arbitrary collections of NURBS curves in 2D and trimmed NURBS patches in 3D via a Bounding Volume Hierarchy that stores efficiently precomputed moment data in the hierarchy nodes. When querying the hierarchy, approximations for far clusters are used alongside direct evaluation for nearby NURBS primitives, achieving sub-linear complexity while preserving the geometric features in the vicinity of the query point. Central to our performance improvements is an adaptive subdivision strategy for NURBS primitives during a preprocessing phase, creating better spatial partitions while retaining the same accuracy for containment decisions as a direct evaluation. We demonstrate the performance and accuracy of our approach across a large collection of 2D and 3D datasets.

Computer science↗

Modeling Plant Metabolism: From Network Reconstruction to Mechanistic Models

Mathematical modeling of plant metabolism allows the plant science community to understand the organization of plant metabolism, obtain quantitative insights into metabolic functions, and derive engineering strategies for manipulation of metabolism. Among the various modeling approaches, metabolic pathway analysis can dissect the basic functional modes of subsections of core metabolism, such as photorespiration, and reveal how classical definitions of metabolic pathways have overlapping functionality. In current research using constraint-based modeling in plants, numerous computational tools are currently available to analyze large-scale and genome-scale metabolic networks. For 13 C-metabolic flux analysis, principles of isotopic steady state have been used to study heterotrophic plant tissues, while nonstationary isotope labeling approaches are amenable to the study of photoautotrophic and secondary metabolism. Enzyme kinetic models explore pathways in mechanistic detail, and we discuss different approaches to determine or estimate kinetic parameters. In this review, we describe recent advances and challenges in modeling plant metabolism.

59 BASIC BIOLOGICAL SCIENCES↗

Combined Mixed Potential Electrochemical Sensors and Artificial Neural Networks for the Quantificationand Identification of Methane in Natural Gas Emissions Monitoring

Sensors capable of quantifying methane concentration and discriminating between possible sources are needed for natural gas leak detection where multiple spatially overlapping sources including wetlands and agriculture may be present. We report on the fabrication by an additive manufacturing process of a four electrode La 0.87 Sr 0.13 CrO 3 , Indium Tin Oxide (In 2 O 3 90 wt%, SnO 2 10 wt%), Au, Pt mixed potential electrochemical sensor using yttria-stabilized zirconia (YSZ) as a solid electrolyte to natural gas detection. Artificial neural networks (ANNs) are used to automatically decode the possible source and concentration of methane. The ANNs trained on sensor data are capable of correctly discriminating between three sources of methane emissions from simulated mixtures of emissions from cattle, wetlands, or natural gas with >98% accuracy. Quantification error for methane in mixtures of CH 4 in air, CH 4 + NH3 in air, and simulated natural gas is less than 1.5% ppm when a two-temperature dataset is employed.

03 NATURAL GAS↗

Methods for Quantitative Thermal Analysis of Lithium Solid-State and Beyond Battery Safety

The use of differential scanning calorimetry (DSC) to measure the thermal behavior of individual components and electrolyte/electrode combinations is common. However, here we focus on DSC tests on an anode, cathode, and electrolyte (ACE) component combination over a temperature range that includes many of the phase transitions and key reactions (i.e., to 500 °C) that contribute to thermal runaway. This method can help quantify the complex reaction network in a full cell, thereby informing potential safety issues. Here, we used DSC heat flow data from a solid-state Li 0.43 CoO 2 +C+PVDF | LLZO | Li metal ACE sample and its components to quantify key factors affecting results. We focused on three areas: (1) ACE sample preparation and assembly in DSC pans, (2) DSC measurement parameters, and (3) heat flow analysis. Key points include the choice of component ratios (e.g., commercially relevant N:P capacity ratio), the importance of conductive carbon and binder, type of pan used, DSC ramp rate, and integration method used when dealing with broad and overlapping exothermic peaks. This work deepens the scientific basis and best practices for obtaining heat flow data from ACE samples for early-stage evaluation of solid-state and beyond battery safety.

25 ENERGY STORAGE↗

Resveratrol Ameliorates Lipopolysaccharide-Induced Sudden Sensorineural Hearing Loss in In Vitro Model through Multitarget Antiapoptotic Mechanism Based on Network Pharmacology and Molecular Docking

Objective. To explore the effects of resveratrol (RSV) on hair cell apoptosis caused by sudden sensorineural hearing loss (SSNHL) and its effect on lipopolysaccharide-induced apoptosis of HEI-OC1 cells. Methods. We used the network pharmacology method to screen molecules related to RSV for the treatment of SSNHL and analyzed these molecules and their enriched biological processes and signaling pathways through Kyoto Encyclopedia of Genes and Genomes (KEGG) and Gene Ontology (GO) analysis. We selected hub genes related to apoptosis using protein-protein interaction (PPI) analysis for in vitro and molecular docking verification. Results. Eighty overlapping genes were identified as potential targets for RSV treatment of SSNHL. Further GO analysis showed that the biological processes were mainly related to toxicity, cell proliferation, and lipopolysaccharide reactions. KEGG analysis showed that the AGE-RAGE signaling pathway in diabetic complications, Kaposi’s sarcoma-associated herpesvirus infection, FoxO signaling pathway, PI3K-Akt signaling pathway, and other inflammatory signaling pathways were concentrated. AKT1, STAT3, JUN, TNF, TP53, MAPK3, CASP3, and VEGFA were screened as HUB genes using PPI analysis. The apoptosis-related proteins TNF, CASP3, AKT1, and TP53 were selected for in vitro experiments, which showed that mRNA was significantly different before and after RSV intervention, confirming that the corresponding protein receptors could bind well with RSV. Conclusion. RSV mainly affects the prognosis of SSNHL through anti-inflammatory effects and may improve hair cell apoptosis caused by inflammatory factors through multitargeted interventions involving TNF, CASP3, AKT1, and TP53.

Ye, Shiming↗

Synergy of Coupled Kink and Tearing Modes in Fast Ion Transport

One aspect of the interaction between fast ions and magnetohydrodynamic (MHD) instabilities is the fast ion transport. Coupled kink and tearing MHD instabilities have also been reported to cause fast ion transport. Recently, the ''kick" model has been developed to compute the evolution of the fast ion distribution from the neutral beam injection using instabilities as phase space resonance sources. The goal of this paper is to utilize the kick model to understand the physics of fast ion transport caused by the coupled kink and tearing modes. Soft X-ray diagnostics are used to identify the mode parameters in NSTX. The comparison of neutron rates measured and computed from time-dependent TRANSP simulation with the kick model shows the coupling of kink and tearing mode is important in determination of the fast ion transport. The numerical scan of the mode parameters shows that the relative phase of the kink and tearing modes and the overlapping of kink and tearing mode resonances in the phase space can affect the fast ion transport, suggesting that the synergy of the coupled modes may be causing the fast ion transpor

Energetic Particles↗

LIvermore SEM image Tools

Scanning Electron Microscopy (SEM) images provide a variety of structural and morphological information for the characterization of the nanomaterials. This code offers automatic recognition and quantitative analysis of SEM images in a high-throughput manner using computer vision and machine learning techniques. The main function of this application is to extract particle size and morphology information of overlapping nanoparticles and core-shell nanostructures in a user friendly interface. The code is written in C++ with QT environment, and has been tested on MacOSX.

KIM, HYOJIN↗

Asynchronous I/O VOL Connector (AsyncVOL) v0.1

Asynchronous I/O is becoming increasingly popular with the large amount of data access required by scientific applications. They can take advantage of an asynchronous interface by scheduling I/O as early as possible and overlap computation or communication with I/O operations, which hides the cost associated with I/O and improves the overall performance.

Tang, Houjun↗