Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “PRESERVATION”

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,639 records · Page 91

Thermally driven phase transitions in freestanding low-buckled silicene, germanene, and stanene

Low-buckled silicene, germanene, and stanene are group-IV graphene allotropes. They form a honeycomb lattice out of two interpenetrating (A and B) triangular sublattices that are vertically separated by a small distance Δ z . The atomic numbers Z of silicon, germanium, and tin are larger than that of carbon (Z C = 6), making them the first experimentally viable two-dimensional topological insulators. Those materials have a twice-energy-degenerate atomistic structure characterized by the buckling direction of the B sublattice with respect to the A sublattice [whereby the B atom either protrudes above (Δ z > 0) or below (Δ z < 0) the A atoms], and the consequences of that energy degeneracy on their elastic and electronic properties have not been reported thus far. Here, we uncover ferroelastic, bistable behavior on silicene, which turns into an average planar structure at about 600 K. Furthermore, the creation of electron and hole puddles obfuscates the zero-temperature spin-orbit coupling (SOC)-induced band gaps at temperatures as low as 200 K, which may discard silicene as a viable two-dimensional topological insulator for room-temperature applications. Germanene, on the other hand, never undergoes a low-buckled-to-planar two-dimensional transformation, becoming amorphous at around 675 K instead, and preserving its SOC-induced band gap despite band broadening. Stanene undergoes a transition onto a crystalline three-dimensional structure at about 300 K, preserving its SOC-induced electronic band gap up to that temperature. Unlike what is observed in silicene and germanene, stanene readily develops a higher-coordinated structure with a high degree of structural order. Furthermore, the structural phenomena are shown to have far-reaching consequences for the electronic and vibrational properties of those two-dimensional topological insulators.

36 MATERIALS SCIENCE↗

Quantum Criticality Under Imperfect Teleportation

Entanglement, measurement, and classical communication together enable teleportation of quantum states between distant parties, in principle, with perfect fidelity. To what extent do correlations and entanglement of a many-body wave function transfer under teleportation protocols? We address this question for the case of an imperfectly teleported quantum critical wave function, focusing on the ground state of a critical Ising chain. We demonstrate that imperfections, e.g., in the entangling gate adopted for a given protocol, effectively manifest as weak measurements acting on the otherwise pristinely teleported critical state. Armed with this perspective, we leverage and further develop the theory of measurement-altered quantum criticality to quantify the resilience of critical-state teleportation. We identify classes of teleportation protocols for which imperfection (i) preserves both the universal long-range entanglement and correlations of the original quantum critical state, (ii) weakly modifies these quantities away from their universal values, and (iii) obliterates long-range entanglement altogether while preserving power-law correlations, albeit with a new set of exponents. We also show that mixed states describing the average over a series of sequential imperfect teleportation events retain pristine power-law correlations due to a “built-in” decoding algorithm, though their entanglement structure measured by the negativity depends on errors similarly to individual protocol runs. These results may allow one to design teleportation protocols that optimize against errors—highlighting a potential practical application of measurement-altered criticality. Published by the American Physical Society 2024

Physics↗

Binary neutron star mergers as potential sources for ultrahigh-energy cosmic rays and high-energy neutrinos

Recent studies suggest that the most energetic cosmic rays, exceeding 100 EeV, may primarily consist of 𝑟-process nuclei. This highlights binary neutron star mergers and collapsars as promising sources of ultrahigh-energy cosmic rays (UHECRs). Building on these insights, we examine the conditions that facilitate the efficient production of UHE 𝑟-process nuclei during the prompt radiation (PR), extended emission (EE), and plateau emission phases of short gamma-ray bursts (sGRBs) following neutron star mergers. Our study reveals that jets associated with the PR phase, characterized by typical bulk Lorentz factors (≳ 400–500), dissipation radii, and magnetic field strengths, can accelerate 𝑟-process nuclei to energies ≳ 100 EeV, while preserving them during propagation within the source. Additionally, we investigate the production of HE neutrinos from photomeson and hadronic interactions, as well as from the 𝛽 decay of accelerated 𝑟-process nuclei. We find that the HE neutrino fluxes from sGRBs, mainly produced via photomeson interactions, are significantly limited to preserve the accelerated heavy nuclei, leading to lower fluxes than the predictions without allowing for contributions to UHECRs. Our results suggest that sGRBs may potentially contribute to UHECRs during the PR phase and to HE neutrinos during the EE phase—a scenario that can be tested by future neutrino observatories.

Cosmic ray sources↗

High Bragg reflectivity of diamond crystals exposed to multi-kW mm –2 X-ray beams

X-ray free-electron lasers in the oscillator configuration (XFELO) are future fully coherent hard X-rays sources with ultrahigh spectral purity. X-ray beams circulate in an XFELO optical cavity comprising diamond single crystals. They function as high-reflectance (close to 100%), narrowband (~10 meV) Bragg backscattering mirrors. The average power density of the X-ray beams in the XFELO cavity is predicted to be as high as ~10 kW mm –2 . Therefore, XFELO feasibility relies on the ability of diamond crystals to withstand such a high radiation load and preserve their high reflectivity. Here the endurance of diamond crystals to irradiation with multi-kW mm –2 power density X-ray beams is studied. It is shown that the high Bragg reflectivity of the diamond crystals is preserved after the irradiation, provided it is performed at ~1 × 10 –8 Torr high-vacuum conditions. In conclusion, irradiation under 4 × 10 –6 Torr results in a ~1 meV shift of the Bragg peak, which corresponds to a relative lattice distortion of 4 × 10 –8 , while the high Bragg reflectivity stays intact.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Fast automated energy changes at synchrotron radiation beamlines equipped with transfocator or focusing mirrors

Algorithms and procedures to fully automate retuning of synchrotron radiation beamlines over wide energy ranges are discussed. The discussion is based on the implementation at the National Institute of General Medical Sciences and the National Cancer Institute Structural Biology Facility at the Advanced Photon Source. When a user selects a new beamline energy, software synchronously controls the beamline monochromator and undulator to maintain the X-ray beam flux after the monochromator, preserves beam attenuation by determining a new set of attenuator foils, changes, as needed, mirror reflecting stripes and the undulator harmonic, preserves beam focal distance of compound refractive lens focusing by changing the In/Out combination of lenses in the transfocator, and, finally, restores beam position at the sample by on-the-fly scanning of either the Kirkpatrick–Baez mirror angles or the transfocator up/down and inboard/outboard positions. The sample is protected from radiation damage by automatically moving it out of the beam during the energy change and optimization.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Distributed Ledger Technology for Fault Tolerant Distribution Grid Operations

This paper explores the potential of distributed ledger technology (DLT) to improve fault-tolerant grid operations by leveraging its core features as an immutable, decentralized ledger, a distributed, consensus-based agreement process, and a distributed state-replication engine. Distribution power systems deliver electricity to millions of customers; however, they are susceptible to various threats that can result in customer interruptions. These include faults caused by adverse weather conditions, natural disasters, vegetation growth, equipment failure, and malicious attacks. To minimize the effects of these faults, fault-handling approaches rely on network knowledge to isolate affected areas and reconnect unaffected areas, reducing the number of affected customers while maintaining safety. Here, we present a trusted data-sharing architecture that enables independent, distributed actors to reconstruct the pre-fault system state by enabling distributed resources to make appropriate decisions with limited network/system information. Although the process requires some data sharing between switch-delimited areas, the approach limits the amount of private information shared, preserving customers' privacy and business-sensitive information. We include three use cases that form a foundation for third parties to develop functional solutions that can eventually be deployed in the field. The gross error detection method used within switch-delimited areas can identify sensor errors and accurately detect circuit breaker states. The evaluation of possible reconnection while preserving data ownership resulted in a voltage magnitude difference smaller than 0.001% from the OpenDSS power flow solution that has full system knowledge, which is below the expected power flow tolerance. The approach offers a promising opportunity for improving fault-tolerant distribution grid operations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Efficient graph representation framework for chemical molecule similarity tasks

Graph data has emerged in numerous scientific domains and machine learning techniques have been widely used for analysis and learning of diverse data for prediction and decision. Machine learning techniques can readily address complex problems by leveraging their structural information. But graphs cannot be directly used for existing machine learning algorithms unless encoded as vectors. The problem of efficient representation of graphs is a substantial challenge in graph machine learning. In this paper, we propose a novel two-stage framework for the representation of chemical molecule graphs based on the strengths of Graph Isomorphism Networks (GINs) and Siamese autoencoders. In the first stage, the GIN model is constructed and trained using the structural information of chemical molecule graphs. Node attributes, edge attributes, and edge indices are used as input data, while graph attributes are used as labels. The GIN model effectively captures the structural characteristics of graphs and can accurately predict graph attributes, i.e., molecular properties. It also generates Graph Embeddings, represented as vectors that encode the structural information of graphs. In the second stage, Graph Embedding vectors are further optimized for downstream similarity tasks while preserving the graph structural information. The Siamese autoencoder is constructed and trained, which reduces the dimensionality of the Graph Embedding vectors, while maximizing the preservation of structural information in the original high-dimensional vectors. The resulting low-dimensional Graph Embeddings can be effectively utilized for tasks such as approximate nearest neighbor search. The experimental results demonstrate the effectiveness of our proposed framework in accurately predicting graph similarity.

Ma, Jiaji↗

A Heterogeneity-Aware Task Scheduler for Spark

Big data processing systems such as Spark are employed in an increasing number of diverse applications-such as machine learning, graph computation, and scientific computing-each with dynamic and different resource needs. These applications increasingly run on heterogeneous hardware, e.g., with out-of-core accelerators. However, big data platforms do not factor in the multi-dimensional heterogeneity of applications and hardware. This leads to a fundamental mismatch between the application and hardware characteristics, and the resource scheduling adopted in big data platforms. For example, Hadoop and Spark consider only data locality when assigning tasks to nodes, and typically disregard the hardware capabilities and suitability to specific application requirements. In this paper, we present RUPAM, a heterogeneity-aware task scheduling system for big data platforms, which considers both task-level resource characteristics and underlying hardware characteristics, as well as preserves data locality. RUPAM adopts a simple yet effective heuristic to decide the dominant scheduling factor (e.g., CPU, memory, or I/O), given a task in a particular stage. Our experiments show that RUPAM is able to improve the performance of representative applications by up to 62.3% compared to the standard Spark scheduler.

Computer Science↗

Differentially Private Generation of Social Networks via Exponential Random Graph Models

Many social networks contain sensitive relational information. One approach to protect the sensitive relational information while offering flexibility for social network research and analysis is to release synthetic social networks at a pre-specified privacy risk level, given the original observed network. In this work, we propose the DP-ERGM procedure that synthesizes networks that satisfy the differential privacy (DP) via the exponential random graph model (EGRM). We apply DP-ERGM to a college student friendship network and compare its original network information preservation in the generated private networks with two other approaches: differentially private DyadWise Randomized Response (DWRR) and Sanitization of the Conditional probability of Edge given Attribute classes (SCEA). The results suggest that DP-EGRM preserves the original information significantly better than DWRR and SCEA in both network statistics and inferences from ERGMs and latent space models. In addition, DP-ERGM satisfies the node DP, a stronger notion of privacy than the edge DP that DWRR and SCEA satisfy.

97 MATHEMATICS AND COMPUTING↗

Clustering High-dimensional Toxicogenomics Data with Rare Signals

Toxicogenomics studies the gene and protein activities to drug treatments or toxic exposures. As the drugs and genes are numerous, toxicogenomics data are naturally high dimensional, with dimension sizes up to millions. In addition, the distribution of toxicogenomics data is oftentimes skewed, and they contain rare but important signals representing a cell or organism’s response to toxicity. The combination of high dimension and extremely skewed distribution of toxicogenomics data makes clustering analysis extremely challenging.We present our study of clustering toxicogenomics data using classical approaches such as principal component analysis as well as deep learning approaches such as auto-encoders. Our experiments show that these approaches fail to preserve rare signals and produce high-quality clusters. We then explore augmenting matrix factorization with deep learning techniques such as attention mechanism to produce latent representations for clustering. Our technique is able to better preserve rare signals after dimensionality reduction than prior approaches. Furthermore, we combine our augmented matrix factorization with a mechanism similar to autoencoder to balance separable clusters and low regeneration errors. Our experiments demonstrate better clustering with our proposed approach.

Cong, Guojing↗

Single-Net Continual Learning with Progressive Segmented Training

There is an increasing need of continual learning in dynamic systems, such as the self-driving vehicle, the surveillance drone, and the robotic system. Such a system requires learning from the data stream, training the model to preserve previous information and adapt to a new task, and generating a single-headed vector for future inference. Different from previous approaches with dynamic structures, this work focuses on a single network and model segmentation to prevent catastrophic forgetting. Leveraging the redundant capacity of a single network, model parameters for each task are separated into two groups: one important group which is frozen to preserve current knowledge, and secondary group to be saved (not pruned) for a future learning. A fixed-size memory containing a small amount of previously seen data is further adopted to assist the training. Without additional regularization, the simple yet effective approach of Progressive Segmented Training (PST) successfully incorporates multiple tasks and achieves the state-of-the-art accuracy in the single-head evaluation on CIFAR-10 and CIFAR-100 datasets. Moreover, the segmented training significantly improves computation efficiency in continual learning at the edge.

Du, Xiaocong↗

Interpretable Models for Workflow Differentiation in High-Performance Scientific Networks

Scientific workflows in high-performance networks spawn hundreds of interdependent flows that must be managed collectively—yet existing network classifiers treat each flow in isolation, leading to fragmented QoS decisions and missed interflow patterns. We present a novel traffic classification solution that operates at the workflow level, distinguishing entire filetransfer operations from streaming analytics by capturing how concurrent flows interact and burst together. We introduce a workflow identification window (WIW) that ingests raw packet headers from parallel flows into unified tensors, preserving the spatial-temporal patterns that differentiate scientific workflows. This approach achieves 98.7% accuracy using CNN, LSTM, and hybrid architectures, while maintaining 84% accuracy on production traffic collected a week later—demonstrating robustness to temporal drift. By integrating SHAP and GradCAM explainability, we reveal that early-packet timing patterns and cross-flow correlations drive classification decisions, providing operators with interpretable insights. Our system enables coherent workflow-level QoS enforcement and dynamic bandwidth allocation in scientific networks, eliminating manual per-flow configuration while maintaining classification latency at millisecond level.

Giannakou, Anna [LBL, Berkeley]↗

EMT-TS Hybrid Simulation for Large Power Grids Considering IBR-Driven Dynamics

The escalating integration of inverter-based resources (IBRs) poses new challenges to power systems by introducing fast dynamics with higher frequencies, which may need to be simulated by an electromagnetic transient (EMT) program. As an alternative to conducting EMT simulations for the entire system, which is typically time consuming, hybrid simulation between EMT and phasor-domain transient stability (TS) can greatly reduce the computational burden while preserving the detailed fast dynamics in the EMT zone. This paper establishes an EMT-TS hybrid simulation platform using open-source tools, specifically ParaEMT, GridPACK, and HELICS, which are the EMT simulator, TS simulator, and interface framework, respectively. Case studies on the 240-bus Western Electricity Coordinating Council (WECC) system demonstrate that the developed ParaEMT-HELICS-GridPACK hybrid simulator can accurately capture both slow electromechanical and fast IBR-driven dynamics with a 2.4x speedup.

electromagnetic transient↗

Adaptive Spatially Aware I/O for Multiresolution Particle Data Layouts

Large-scale simulations on nonuniform particle distributions that evolve over time are widely used in cosmology, molecular dynamics, and engineering. Such data are often saved in an unstructured format that neither preserves spatial locality nor provides metadata for accelerating spatial or attribute subset queries, leading to poor performance of visualization tasks. Furthermore, the parallel I/O strategy used typically writes a file per process or a single shared file, neither of which is portable or scalable across different HPC systems. We present a portable technique for scalable, spatially aware adaptive aggregation that preserves spatial locality in the output. We evaluate our approach on two supercomputers, Stampede2 and Summit, and demonstrate that it outperforms prior approaches at scale, achieving up to 2.5× faster writes and reads for nonuniform distributions. Furthermore, the layout written by our method is directly suitable for visual analytics, supporting low-latency reads and attribute-based filtering with little overhead.

Usher, Will↗

Virtual Power Plants: Pilots, Challenges, and Innovations Shaping Future Development

Virtual Power Plants (VPPs) aggregate distributed energy resources (DERs) to provide grid services traditionally delivered by centralized power plants. This article reviews the current state of VPP deployment, highlighting business models, compensation mechanisms, and global pilot projects. While VPPs offer benefits such as grid flexibility, resilience, and cost savings, challenges remain in communication infrastructure, regulatory frameworks, market access, and customer engagement. To address these, we propose a scalable, privacy-preserving hierarchical VPP architecture that coordinates with distribution utilities and preserves customer data. We also present the Integrated T&D Control Room of the Future as a key test bed for validating and accelerating VPP adoption. These innovations can help transition VPPs from pilot programs to integral components of a modern, reliable power grid.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Interactive Streamline Exploration and Manipulation Using Deformation

Occlusion presents a major challenge in visualizing three-dimensional flow fields with streamlines. Displaying too many streamlines at once makes it difficult to locate interesting regions, but displaying too few streamlines risks missing important features. A more ideal streamline exploration model is to allow the viewer to freely move across the field that has been populated with interesting streamlines and pull away the streamlines that cause occlusion so that the viewer can inspect the hidden ones in detail. In this paper, we present a streamline deformation algorithm that supports such user-driven interaction with three-dimensional flow fields. We define a view-dependent focus+context technique that moves the streamlines occluding the focus area using a novel displacement model. To preserve the context surrounding the user-chosen focus area, we propose two shape models to define the transition zone for the surrounding streamlines, and the displacement of the contextual streamlines is solved interactively with a goal of preserving their shapes as much as possible. Based on our deformation model, we design an interactive streamline exploration tool using a lens metaphor. Our system runs interactively so that users can move their focus and examine the flow field freely.

flow visualization, focus+context, streamline, def↗

Residential Demand Side Aggregation of Privacy-Conscious Consumers

The increasing adoption of smart meters has led to growing concerns regarding privacy risks stemming from the high resolution measurements. This has given rise to privacy protection techniques that physically alter the consumer's energy load profile, masking private information by using localised devices, e.g. batteries or flexible loads. Meanwhile, there has also been increasing interest in aggregating the distributed energy resources (DERs) of residential consumers to provide services to the grid. In this paper, we propose an online distributed algorithm to aggregate the DERs of privacy-conscious consumers to provide services to the grid, whilst preserving their privacy. Results show that the optimisation solution from the distributed method converges to one close to the optimum computed using an ideal centralised solution method, balancing between grid service provision, consumer preferences and privacy protection. More importantly, the distributed method preserves consumer privacy, and does not require high-bandwidth two-way communications infrastructure.

ancillary services↗

Advances in Coring Procedures of Silicon Photovoltaic Modules

We describe advances on procedures used for the coring of silicon photovoltaic modules. These procedures involve coring specific locations, starting from the back of the modules, and removing selected parts of the cell structure, while preserving the front tempered glass. The standard coring procedures had to be modified from case to case due to the different cell structures and measurement requirements. We provide examples of the characterization of the cored samples by scanning electron microscopy and energy-dispersive X-ray spectroscopy. Finally, we describe a simple process to create small openings at specific locations on the back of photovoltaic modules to allow for efficiency-related measurement of individual cells and groups of cells.

41 EE - Solar Energy Technologies Office (EE-4S)↗