Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “merging”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

DeepMerge – II. Building robust deep learning algorithms for merging galaxy identification across domains

In astronomy, neural networks are often trained on simulation data with the prospect of being used on telescope observations. Unfortunately, training a model on simulation data and then applying it to instrument data leads to a substantial and potentially even detrimental decrease in model accuracy on the new target dataset. Simulated and instrument data represent different data domains, and for an algorithm to work in both, domain-invariant learning is necessary. Here we employ domain adaptation techniques— Maximum Mean Discrepancy (MMD) as an additional transfer loss and Domain Adversarial Neural Networks (DANNs)— and demonstrate their viability to extract domain-invariant features within the astronomical context of classifying merging and non-merging galaxies. Additionally, we explore the use of Fisher loss and entropy minimization to enforce better in-domain class discriminability. We show that the addition of each domain adaptation technique improves the performance of a classifier when compared to conventional deep learning algorithms. We demonstrate this on two examples: between two Illustris-1 simulated datasets of distant merging galaxies, and between Illustris-1 simulated data of nearby merging galaxies and observed data from the Sloan Digital Sky Survey. The use of domain adaptation techniques in our experiments leads to an increase of target domain classification accuracy of up to ~20%. With further development, these techniques will allow astronomers to successfully implement neural network models trained on simulation data to efficiently detect and study astrophysical objects in current and future large-scale astronomical surveys.

galaxies: interactions↗
DOE OSTI2021

Exemplary Merging Clusters: Weak-lensing and X-Ray Analysis of the Double Radio Relic, Merging Galaxy Clusters MACS J1752.0+4440 and ZWCL 1856.8+6616

We report the investigation of merging galaxy clusters that exhibit radio relics is strengthening our understanding of the formation and evolution of galaxy clusters, the nature of dark matter, the intracluster medium, and astrophysical particle acceleration. Each merging cluster provides only a single view of the cluster formation process, and the variety of merging clusters is vast. Clusters hosting double radio relics are rare and extremely important because they allow tight constraints on the merger scenario. We present a weak-lensing and X-ray analysis of MACS J1752.0+4440 (z = 0.365) and ZWCL 1856.8+6616 (z = 0.304), two double radio relic clusters. Our weak-lensing mass estimates show that each cluster is a major merger with approximately 1:1 mass ratio. The total mass of MACS J1752.0+4440 (ZWCL 1856.8+6616) is M 200 =14.7 $_{-3.3}+{+3.8}$ x 10 14 M ⊙ M 200 = 2.4 $_{-0.7}^{+0.9}$ 10 14 M ⊙ ). We find that these two clusters have comparable features in their weak-lensing and gas distributions, even though the systems have vastly different total masses. From the likeness of the X-ray morphologies and the remarkable symmetry of the radio relics, we propose that both systems underwent nearly head-on collisions. However, revelations from the hot-gas features and our multiwavelength data analysis suggest that ZWCL 1856.8+6618 is likely at a later merger phase than MACS J1752.0+4440. We postulate that the SW radio relic in MACS J1752.0+4440 is a result of particle reacceleration.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Energy-Centric Cooperative Onramp Merging Strategy: An Analytical Solution

Cooperative highway onramp merging plays an important role in mitigating highway traffic congestion. A crucial component of a cooperative merging system is the merging sequence strategy, which determines each merging participant's order to reach the merging point. Existing merging sequence strategies can be classified into rule-based and optimization-based approaches. The rule-based strategies can be effortlessly implemented with a light online computational burden. However, they may not achieve the optimal energy efficiency. In contrast, the optimization-based strategies can yield the optimal merging sequence to minimize fuel consumption, but typically involve computationally expensive numerical optimization. To leverage the advantages from both sides, we propose a novel merging sequence strategy that can minimize fuel consumption while avoiding online numerical optimization. The key idea is to analytically formulate the expected fuel consumption of each merging participant. Using a realistic highway onramp scenario based on the NGSIM dataset, we validate the performance and the computational efficiency of the proposed merging sequence strategy via SUMO/SIMULINK joint simulation.

Wang, Zejiang↗
DOE OSTI2020

Experimental characterization of a section of a spherically imploding plasma liner formed by merging hypersonic plasma jets

In this work, we report experimental results on merging of hypersonic plasma jets, which is the fundamental building block for forming spherically imploding plasma liners as a potential standoff compression driver for magneto-inertial fusion. Jets are formed and launched by contoured-gap coaxial plasma guns mounted at the six vertices and the center of a hexagon covering approximately one-tenth of the surface area of a 9-ft-diameter spherical chamber. First, from experiments with two and three merging jets of four different species (N, Ar, Kr, and Xe), we show that (1) density spatial non-uniformities can be large (with electron-density jumps ranging from 2.9 for N to 6.6 for Xe) when shocks form upon jet merging, but smaller (density jumps <2) when shocks do not form; (2) jet impurities (20% Ti in these experiments) can increase the level of density spatial non-uniformity by increasing the collisionality of jet merging, leading to shock formation rather than potentially more desirable shockless jet merging; and (3) the liner Mach number can remain high (≳10), as required for plasma liners to be an effective compression driver. Secondly, from experiments with six and seven merging jets using Ar, we present results with improved jet-to-jet mass balance of <2% across jets, including (1) evidence of substantially increased balance in the jet merging and symmetry of the liner structure and (2) potentially favorable changes in the jet-merging morphology with the addition of the seventh jet. Ultimately, for both experiments, we present comparisons between experimental and synthetic data from three-dimensional hydrodynamic codes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

ExTreeM: Scalable Augmented Merge Tree Computation via Extremum Graphs

Over the last decade merge trees have been proven to support a plethora of visualization and analysis tasks since they effectively abstract complex datasets. Here, this paper describes the ExTreeM-Algorithm: A scalable algorithm for the computation of merge trees via extremum graphs. The core idea of ExTreeM is to first derive the extremum graph G of an input scalar field f defined on a cell complex K, and subsequently compute the unaugmented merge tree of f on G instead of K; which are equivalent. Any merge tree algorithm can be carried out significantly faster on G, since K in general contains substantially more cells than G. To further speed up computation, ExTreeM includes a tailored procedure to derive merge trees of extremum graphs. The computation of the fully augmented merge tree, i.e., a merge tree domain segmentation of K, can then be performed in an optional post-processing step. All steps of ExTreeM consist of procedures with high parallel efficiency, and we provide a formal proof of its correctness. Our experiments, performed on publicly available datasets, report a speedup of up to one order of magnitude over the state-of-the-art algorithms included in the TTK and VTK-m software libraries, while also requiring significantly less memory and exhibiting excellent scaling behavior.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Traffic Prediction for Merging Coordination Control in Mixed Traffic Scenarios

Connected and autonomous vehicles (CAVs) have the potential to bring in safety, mobility, and energy benefits to transportation. The control decisions of CAVs are usually determined for a look-ahead horizon based on previewed traffic information. This requires an effective prediction of future traffic conditions and its integration with the CAV control framework. However, the short-term traffic prediction using information from connectivity is a challenging research topic, especially for mixed traffic scenarios. This work focuses on the development of a traffic prediction framework for a merging coordination controller. The previously developed merging controller coordinates the merging sequence and travel speed of CAVs to maximize the energy efficiency and overall mobility. In mixed traffic scenarios, the controller receives information regarding the position of all the vehicles traveling inside a control zone and controls the desired speed of all CAVs. The controller has no control on the human-driven vehicles. The merging controller does not have direct information or an explicit prediction on the behaviors of human-driven vehicles. Aiming to improve the performance of the merging controller in various mixed traffic conditions, a traffic prediction algorithm is developed and evaluated in this work. The performance of this traffic prediction algorithm is investigated for various penetration rates of connectivity for a single-lane secondary road merging to a single-lane primary road. The results show that compared to a constant speed assumption of human-driven vehicles, the proposed traffic prediction algorithm is able to reduce the prediction error of the arrival time of human-driven vehicles at the merging zone by more than 50%.

Shao, Yunli↗
DOE OSTI2023

Illustration of bunch merge simulation in RHIC

Following are examples of a 4 to 2 to 1 merge of proton bunches in RHIC obtained by running the simulation code rhic2mrg23. As the code runs, the user is prompted to enter several numbers. For these examples, RF harmonic number 1440.0 is entered. An RF frequency of 112.597 696 626 MHz at this harmonic is entered. This gives a proton energy of 100 GeV. The merge simulation starts with a uniform distribution of unbunched protons. 2.0 eV-s is entered for the longitudinal emittance of the distribution. The code will recommend a voltage to capture the unbunched protons into 4 harmonic 1440 buckets. A capture voltage of 142.390 kV is recommended. 144.0 kV is entered. It is desirable to capture the protons as “adiabatically” as possible. A capture time of 3318 ms is recommended by the code. 3320.0 ms is entered. A 4 to 2 merge time of 1659 ms is recommended by the code. 1660.0 ms is entered. A 2 to 1 merge time twice that of the 4 to 2 merge is recommended by the code. 3320.0 ms is entered. The code requests a “time fraction” FQMRG to be entered. This is a number (from 0.1 to 1.0) that determines the time at which data are recorded during the 4 to 2 merge. The number 0.5 is entered. This encodes the recording of data halfway through the 4 to 2 merge.

43 PARTICLE ACCELERATORS↗
DOE OSTI2023

Illustration of bunch merge simulation in AGS

Following are examples of a 4 to 2 to 1 merge of proton bunches in AGS obtained by running the simulation code ags2mrg23. As the code runs, the user is prompted to enter several numbers. For these examples, RF harmonic number 12.0 is entered. An RF frequency of 4.453 913 448 73 MHz at this harmonic is entered. This gives proton G γ = 45.5. The merge simulation starts with a uniform distribution of unbunched protons. 2.0 eV-s is entered for the longitudinal emittance of the distribution. The code will recommend a voltage to capture the unbunched protons into 4 harmonic 12 buckets. A capture voltage of 0.0527 kV is recommended. 0.053 kV is entered. It is desirable to capture the protons as “adiabatically” as possible. Because of the long synchrotron period (372 ms), a capture time of 74,707 ms is recommended by the code. A shorter time, 10,000 ms, is entered to reduce the running time of the code. A 4 to 2 merge time of 37,353 ms is recommended by the code. 4000.0 ms is entered. A 2 to 1 merge time twice that of the 4 to 2 merge is recommended by the code. 8000.0 ms is entered. The code requests a “time fraction” FQMRG to be entered. This is a number (from 0.1 to 1.0) that determines the time at which data are recorded during the 4 to 2 merge. The number 0.5 is entered. This encodes the recording of data halfway through the 4 to 2 merge.

43 PARTICLE ACCELERATORS↗
DOE OSTI2025

Hybrid Simulations of FRC Merging and Compression

An improved understanding of field-reversed configuration (FRC) merging and stability in high acceleration and compression magnetic fields is needed to speed up the development of the pulsed fusion concept developed at Helion Energy. All previous theoretical and simulation work on FRC merging and compression was performed using two-dimensional (2D) magnetohydrodynamic (MHD) models. The results of novel 2D hybrid simulations (fluid electrons and full-orbit kinetic ions) of FRC merging and compression are presented. Results of kinetic and MHD simulations, computed using the HYM code, are compared and analyzed. In cases without axial magnetic compression, both the MHD and hybrid simulations show a high sensitivity to the initial parameters (i.e. FRC separation, velocity, normalized separatrix radius, and plasma viscosity), showing that FRCs with large elongation and separatrix radius either do not merge or merge partially, forming a doublet FRC. In conclusion, application of a mirror coil field at the FRC ends with increasing strength is shown to lead to fast and complete merging of the FRCs in MHD and kinetic simulations.

FRC↗
DOE OSTI2020

DeepMerge: Classifying high-redshift merging galaxies with deep neural networks

In this work, we investigate and demonstrate the use of convolutional neural networks (CNNs) for the task of distinguishing between merging and non-merging galaxies in simulated images, and for the first time at high redshifts (i.e. $z=2$). We extract images of merging and non-merging galaxies from the Illustris-1 cosmological simulation and apply observational and experimental noise that mimics that from the Hubble Space Telescope; the data without noise form a "pristine" data set and that with noise form a "noisy" data set. The test set classification accuracy of the CNN is $79\%$ for pristine and $76\%$ for noisy. The CNN outperforms a Random Forest classifier, which was shown to be superior to conventional one- or two-dimensional statistical methods (Concentration, Asymmetry, the Gini, $M_{20}$ statistics etc.), which are commonly used when classifying merging galaxies. We also investigate the selection effects of the classifier with respect to merger state and star formation rate, finding no bias. Finally, we extract Grad-CAMs (Gradient-weighted Class Activation Mapping) from the results to further assess and interrogate the fidelity of the classification model.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2022

Computing a Stable Distance on Merge Trees

Distances on merge trees facilitate visual comparison of collections of scalar fields. Two desirable properties for these distances to exhibit are 1) the ability to discern between scalar fields which other, less complex topological summaries cannot and 2) to still be robust to perturbations in the dataset. The combination of these two properties, known respectively as stability and discriminativity, has led to theoretical distances which are either thought to be or shown to be computationally complex and thus their implementations have been scarce. In order to design similarity measures on merge trees which are computationally feasible for more complex merge trees, many researchers have elected to loosen the restrictions on at least one of these two properties. The question still remains, however, if there are practical situations where trading these desirable properties is necessary. Here we construct a distance between merge trees which is designed to retain both discriminativity and stability. While our approach can be expensive for large merge trees, we illustrate its use in a setting where the number of nodes is small. This setting can be made more practical since we also provide a proof that persistence simplification increases the outputted distance by at most half of the simplified value. As a result, we demonstrate our distance measure on applications in shape comparison and on detection of periodicity in the von Kármán vortex street.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Serial crystallography with multi-stage merging of thousands of images

KAMO and BLEND provide particularly effective tools to automatically manage the merging of large numbers of data sets from serial crystallography. The requirement for manual intervention in the process can be reduced by extending BLEND to support additional clustering options such as the use of more accurate cell distance metrics and the use of reflection-intensity correlation coefficients to infer `distances' among sets of reflections. This increases the sensitivity to differences in unit-cell parameters and allows clustering to assemble nearly complete data sets on the basis of intensity or amplitude differences. If the data sets are already sufficiently complete to permit it, one applies KAMO once and clusters the data using intensities only. When starting from incomplete data sets, one applies KAMO twice, first using unit-cell parameters. In this step, either the simple cell vector distance of the original BLEND or the more sensitive NCDist is used. This step tends to find clusters of sufficient size such that, when merged, each cluster is sufficiently complete to allow reflection intensities or amplitudes to be compared. One then uses KAMO again using the correlation between reflections with a common hkl to merge clusters in a way that is sensitive to structural differences that may not have perturbed the unit-cell parameters sufficiently to make meaningful clusters. Many groups have developed effective clustering algorithms that use a measurable physical parameter from each diffraction still or wedge to cluster the data into categories which then can be merged, one hopes, to yield the electron density from a single protein form. Since these physical parameters are often largely independent of one another, it should be possible to greatly improve the efficacy of data-clustering software by using a multi-stage partitioning strategy. Here, one possible approach to multi-stage data clustering is demonstrated. The strategy is to use unit-cell clustering until the merged data are sufficiently complete and then to use intensity-based clustering. Using this strategy, it is demonstrated that it is possible to accurately cluster data sets from crystals that have subtle differences.

36 MATERIALS SCIENCE↗
DOE OSTI2020

DeepMerge: Studying Distant Merging Galaxies with Deep Neural Networks

The hierarchical merging of galaxies is a probe of the cosmos to test the canonical ?CDM cosmology paradigm. A particularly interesting period is "cosmic high noon" at redshifts z? 2?3, during which star formation rates were the highest, and significant amounts of stellar mass assembled into galaxy-scale bodies. Detecting galaxy mergers in observations by conventional automated methods (which use extracted parameters of galaxy structure - asymmetry, clumpiness, concentration etc.) or by visual inspection has proven to be quite time-consuming and prone to errors. Convolutional Neural Network (CNNs) are a primary representative of deep learning algorithms which are used in computer vision tasks by training to detect features in images. CNNs were already used for classification of low-redshift merging galaxies [1, 2]. Here we will use CNN to to learn directly from images (without the need to extract morphology parameters) of distant merging galaxies in order to distinguish between merging and non-merging objects.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Taylor State Merging at SSX: Experiment and Simulation

We describe experiments and simulations of dynamical merging with two Taylor state plasmas in a Swarthmore Spheromak Experiment (SSX) device. Taylor states are formed by magnetized plasma guns at opposite ends of the device. We performed experiments with Taylor states of both senses of magnetic helicity (right-handed twist or left-handed twist). We present results of both counter-helicity merging (one side left-handed, the other right-handed) and co-helicity merging (both sides left-handed). Experiments show significant ion heating, consistent with magnetic reconnection. We suggest that the merged, warm state could be a suitable target for future magneto-inertial fusion experiments. Magnetohydrodynamic simulations of these experiments reveal the structure of the final relaxed, merged state.

Brown, Michael↗
DOE OSTI2022

Memory access response merging in a memory hierarchy

A system and method for efficiently processing memory requests are described. A computing system includes multiple compute units, multiple caches of a memory hierarchy and a communication fabric. A compute unit generates a memory access request that misses in a higher level cache, which sends a miss request to a lower level shared cache. During servicing of the miss request, the lower level cache merges identification information of multiple memory access requests targeting a same cache line from multiple compute units into a merged memory access response. The lower level shared cache continues to insert information into the merged memory access response until the lower level shared cache is ready to issue the merged memory access response. An intermediate router in the communication fabric broadcasts the merged memory access response into multiple memory access responses to send to corresponding compute units.

97 MATHEMATICS AND COMPUTING↗