Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “graph clustering”

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.

395 records · Page 22

A Solid of Revolution Time Study using COG11.1 and MCNP6.1

The performance of two continuous energy Monte Carlo transport codes, COG11.1 and MCNP6.1, has been compared for the {sup 239}Pu Jezebel Benchmark using cross sections based on the ENDF/B-VII.1 evaluated nuclear data library. The purpose of this study is to determine the length of time it takes each code to complete a series of criticality calculations, using two different methods to model a solid of revolution. A solid of revolution is essential in many fields of engineering and mathematics, and has been a standard feature in computer-aided design and manufacturing since the 1970's. In the field of criticality safety, a solid of revolution can be used to reproduce and simplify complex engineering drawings and systems that would otherwise require excessive use of geometric primitives and computational resources to achieve a comparable level of fidelity. There are two basic methods to model a solid of revolution: Method 1 (COG) specifies a set of x-y pairs or polar coordinates and rotate the curve about the x-axis. Method 2 (COG and MCNP) creates a set of end-to-end conical frustums and/or cylinders. Method 1 is only available in COG and can be implemented using one surface and sector specification. Method 2 can be implemented in both COG and MCNP. This time study was initially conceived as a result of criticality safety analysis performed for a complex system with a high degree of rotational symmetry. Each COG input deck typically took 1-2 days to run in serial mode. COG input decks were then converted to MCNP format and run on the same computer cluster. Instead of expected 1-2 day runtimes, it took MCNP6.1 more than one week to complete each run. Since MCNP typically runs faster than many codes, these lengthy runtimes were considered unusual. This study attempts to investigate the runtime discrepancy between the two codes. The methods and benchmark in this time study were selected to provide a consistent, generalized approach to modeling an arbitrary solid of revolution. While there are many different ways to model the {sup 239}Pu Jezebel Benchmark, the focus of this study is on investigating the practical difference between the two basic methods to model a surface of revolution. Throughout this study, the only code that maintains reasonably low runtimes is COG11.1 (Method 1). Based on the observed performance of each code and method, it is likely that the divergent runtimes are the result of tracking particles across planes that lie between conical frustums, as opposed to defining the object boundary as a single surface. Slight fluctuations in graphed results were also observed, due to random sampling and CPU loading. This was confirmed by re-running input decks and comparing average runtimes to a preliminary curve fit. From the perspective of a criticality safety analyst, the results of this study are expected to contribute towards understanding one of the practical trade-offs between codes and methods as they apply to real-world analysis. Ultimately, it's about choosing the right tool for the job.

97 MATHEMATICS AND COMPUTING↗

Hydrogen bond arrangements in (H 2 O) 20, 24, 28 clathrate hydrate cages: Optimization and many-body analysis

Here we provide a detailed study of hydrogen bonding arrangements, relative stability, residual entropy, and an analysis of the many-body effects in the (H 2 O) 20 (D-cage), (H 2 O) 24 (T-cage), and (H 2 O) 28 (H-cage) hollow cages making up structures I (sI) and II (sII) of clathrate hydrate lattices. Based on the enumeration of the possible hydrogen bonding networks for a fixed oxygen atom scaffold, the residual entropy (S 0 ) of these three gas phase cages was estimated at 0.754 82, 0.754 44, and 0.754 17 · Nk b , where N is the number of molecules and k b is Boltzmann’s constant. A previously identified descriptor of enhanced stability based on the relative arrangement and connectivity of nearest-neighbor fragments on the polyhedral water cluster [strong-weak-effective-bond model] also applies to the larger hollow cages. The three cages contain a maximum of 7, 9, and 11 such preferable arrangements of trans nearest dimer pairs with one “free” OH bond on the donor molecule (t1d dimers). The Many-Body Expansion (MBE) up to the 4-body suggests that the many-body terms vary nearly linearly with the cluster binding energy. Using a hierarchical approach of screening the relative stability of networks starting from optimizations with the TIP4P, TTM2.1-F, and MB-pol classical potentials, subsequently refining at more accurate levels of electronic structure theory (DFT and MP2), and finally correcting for zero-point energy, we were able to identify a group of four low-lying isomers of the (H 2 O) 24 T-cage, two of which are antisymmetric and the other two form a pair of antipode configurations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

FLASH: FPGA-Accelerated Smart Switches with GCN Case Study

Some communication switches, e.g., the Mellanox SHArP and those in the IBM BlueGene clusters, are augmented to process packets at the application level with fixed-function collectives. This approach, however, lacks flexibility, which limits their applicability in diverse and dynamic workloads. Recently, a new type of programmable packet processor, which uses high-level languages, e.g., P4, has emerged as possible candidates. P4-based switches, however, fall short in certain applications, including machine learning, where capabilities not currently supported by P4 are needed. These include more complex calculation, such as sparse computation and fused multiply-accumulate, data-intensive floating point operations, data reuse, and significant memory. The problem addressed here is that such a switch augmentation needs to support: a large amount of state, significant flexible compute capability, and ease of programming, all while maintaining full functionality, including ensuring high throughput, and demonstrating utility. In this work, we propose a programmable look-aside-type accelerator that can be embedded into, or attached to, existing communication switch pipelines and that is capable of processing packets at line-rate. The proposed in-switch accelerator is based on mixing an ISA (subset of RISC-V instructions) with dataflow graphs (found in CGRAs). To augment performance, vector instructions are also supported. To facilitate usability, we have developed a complete toolchain to compile user-provided C/C++ codes to appropriate back-end instructions for configuring the accelerator. While this approach is flexible enough to support various workloads, in this paper, we consider Graph Convolutional Networks (GCNs) as a case study. Experimental results show that this approach considerably improves the performance of distributed GCN applications.

Haghi, Pouya↗

Impact of Water Extraction on Malonamide Aggregation: A Molecular Dynamics and Graph Theoretic Approach

Solution structure in liquid-liquid extraction affects the efficacy of separation; however, even for simplified organic phases, structural characterization and attribution of aggregation to intermolecular interactions are fundamental challenges. We investigate water uptake into organic phases for two malonamides commonly applied to actinide and lanthanide separations. Extracted water induces reorganization of the amphiphilic extractant molecules, although we find this rearrangement is not strongly manifested in small-angle X-ray scattering making it challenging to probe without methods such as atomistic simulation. Using a graph theoretic approach to define hydrogen bonded water/malonamide aggregates from molecular dynamics simulations, we find evidence of a characteristic aggregate size by water number that results from geometric accommodation of the surrounding malonamide molecules. Furthermore, this implies a degree of size selectivity inherent to these water-in-oil aggregates. Conversely, we find no evidence of a characteristic size of the aggregates with respect to their malonamide number. By defining a separate graphical representation of self-association of the amphiphilic malonamides, we quantify how water affects the local and nonlocal topology of the malonamide network, providing a basis for characterization of the structure and impact of polar solutes in increasingly complex organic phases.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Fine-grained Asynchronous Bulk Synchronous parallelism model for PGAS applications

The Partitioned Global Address Space (PGAS) model is well suited for executing irregular applications on cluster-based systems, due to its efficient support for short, one-sided messages. Separately, the actor model has been gaining popularity as a productive asynchronous message-passing approach for distributed objects in enterprise and cloud computing platforms, typically implemented in languages such as Erlang, Scala or Rust. To the best of our knowledge, there has been no past work on using the actor model to deliver both productivity and scalability to irregular PGAS applications with large number of small messages. In this paper, we introduce a new programming system for PGAS applications, in which point-to-point remote operations can be expressed as fine-grained asynchronous actor messages. In our approach, the programmer does not need to worry about programming complexities related to message aggregation and termination detection. Our approach can be viewed as extending the classical Bulk Synchronous Parallelism model with fine-grained asynchronous communications within a phase or superstep. Here, we believe that our approach offers a desirable point in the productivity-performance space for PGAS applications, with more scalable performance and higher productivity relative to past approaches. Specifically, for seven irregular mini-applications from the Bale Kernels and three graph kernels executed using 2048 cores in the NERSC Cori system, our approach shows geometric mean performance improvements of ≥ 20X relative to standard PGAS versions (UPC and OpenSHMEM) while maintaining comparable productivity to those versions.

97 MATHEMATICS AND COMPUTING↗

EMPIRE: Nuclear Reaction Model Code System for Data Evaluation

EMPIRE is a modular system of nuclear reaction codes, comprising various nuclear models, and designed for calculations over a broad range of energies and incident particles. A projectile can be a neutron, proton, any ion (including heavy-ions) or a photon. The energy range extends from the beginning of the unresolved resonance region for neutron-induced reactions ({approx} keV) and goes up to several hundred MeV for heavy-ion induced reactions. The code accounts for the major nuclear reaction mechanisms, including direct, pre-equilibrium and compound nucleus ones. Direct reactions are described by a generalized optical model (ECIS03) or by the simplified coupled-channels approach (CCFUS). The pre-equilibrium mechanism can be treated by a deformation dependent multi-step direct (ORION + TRISTAN) model, by a NVWY multi-step compound one or by either a pre-equilibrium exciton model with cluster emission (PCROSS) or by another with full angular momentum coupling (DEGAS). Finally, the compound nucleus decay is described by the full featured Hauser-Feshbach model with {gamma}-cascade and width-fluctuations. Advanced treatment of the fission channel takes into account transmission through a multiple-humped fission barrier with absorption in the wells. The fission probability is derived in the WKB approximation within the optical model of fission. Several options for nuclear level densities include the EMPIRE-specific approach, which accounts for the effects of the dynamic deformation of a fast rotating nucleus, the classical Gilbert-Cameron approach and pre-calculated tables obtained with a microscopic model based on HFB single-particle level schemes with collective enhancement. A comprehensive library of input parameters covers nuclear masses, optical model parameters, ground state deformations, discrete levels and decay schemes, level densities, fission barriers, moments of inertia and {gamma}-ray strength functions. The results can be converted into ENDF-6 formatted files using the accompanying code EMPEND and completed with neutron resonances extracted from the existing evaluations. The package contains the full EXFOR (CSISRS) library of experimental reaction data that are automatically retrieved during the calculations. Publication quality graphs can be obtained using the powerful and flexible plotting package ZVView. The graphic user interface, written in Tcl/Tk, provides for easy operation of the system. This paper describes the capabilities of the code, outlines physical models and indicates parameter libraries used by EMPIRE to predict reaction cross sections and spectra, mainly for nucleon-induced reactions. Selected applications of EMPIRE are discussed, the most important being an extensive use of the code in evaluations of neutron reactions for the new US library ENDF/B-VII.0. Future extensions of the system are outlined, including neutron resonance module as well as capabilities of generating covariances, using both KALMAN and Monte-Carlo methods, that are still being advanced and refined.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

GMFOLD: Subgraph matching for high-throughput DNA-aptamer secondary structure classification and machine learning interpretability

Aptamers are oligonucleotide receptors that bind to their targets with high affinity. Here, we consider aptamers comprised of single-stranded DNA that undergo target-binding-induced conformational changes, giving rise to unique secondary and tertiary structures. Given a specific aptamer primary sequence, there are well-established computational tools (notably mfold) to predict the secondary structure via free energy minimization algorithms. While mfold generates secondary structures for individual sequences, there is a need for a high-throughput process whereby thousands of DNA structures can be predicted in real-time for use in an interactive setting, when combined with aptamer selections that generate candidate pools that are too large to be experimentally interrogated. We developed a new Python code for high-throughput aptamer secondary structure determination (GMfold). GMfold uses subgraph matching methods to group aptamer candidates by secondary structure similarities. We also improve an open-source code, SeqFold, to incorporate subgraph matching concepts. We represent each secondary structure as a lowest-energy bipartite subgraph matching of the DNA graph to itself. These new tools enable thousands of DNA sequences to be compared based on their secondary structures, using machine-learning algorithms. This process is advantageous when analyzing sequences that arise from aptamer selections via systematic evolution of ligands by exponential enrichment (SELEX). This work is a building block for future machine-learning-informed DNA-aptamer selection processes to identify aptamers with improved target affinity and selectivity and advance aptamer biosensors and therapeutics.

Aptamer↗

Final Report for Project DE-FC02-06ER25755 [Pmodels2]

In this report, we describe the research accomplished by the OSU team under the Pmodels2 project. The team has worked on various angles: designing high performance MPI implementations on modern networking technologies (Mellanox InfiniBand (including the new ConnectX2 architecture and Quad Data Rate), QLogic InfiniPath, the emerging 10GigE/iWARP and RDMA over Converged Enhanced Ethernet (RoCE) and Obsidian IB-WAN), studying MPI scalability issues for multi-thousand node clusters using XRC transport, scalable job start-up, dynamic process management support, efficient one-sided communication, protocol offloading and designing scalable collective communication libraries for emerging multi-core architectures. New designs conforming to the Argonne’s Nemesis interface have also been carried out. All of these above solutions have been integrated into the open-source MVAPICH/MVAPICH2 software. This software is currently being used by more than 2,100 organizations worldwide (in 71 countries). As of January ’14, more than 200,000 downloads have taken place from the OSU Web site. In addition, many InfiniBand vendors, server vendors, system integrators and Linux distributors have been incorporating MVAPICH/MVAPICH2 into their software stacks and distributing it. Several InfiniBand systems using MVAPICH/MVAPICH2 have obtained positions in the TOP500 ranking of supercomputers in the world. The latest November ’13 ranking include the following systems: 7th ranked Stampede system at TACC with 462,462 cores; 11th ranked Tsubame 2.5 system at Tokyo Institute of Technology with 74,358 cores; 16th ranked Pleiades system at NASA with 81,920 cores; Work on PGAS models has proceeded on multiple directions. The Scioto framework, which supports task-parallelism in one-sided and global-view parallel programming, has been extended to allow multi-processor tasks that are executed by processor groups. A quantum Monte Carlo application is being ported onto the extended Scioto framework. A public release of Global Trees (GT) has been made, along with the Global Chunks (GC) framework on which GT is built. The Global Chunks (GC) layer is also being used as the basis for the development of a higher level Global Graphs (GG) layer. The Global Graphs (GG) system will provide a global address space view of distributed graph data structures on distributed memory systems.

97 MATHEMATICS AND COMPUTING↗

Automated detection and analysis of particle beams in laser-plasma accelerator simulations

Numerical simulations of laser-plasma wakefield (particle) accelerators model the acceleration of electrons trapped in plasma oscillations (wakes) left behind when an intense laser pulse propagates through the plasma. The goal of these simulations is to better understand the process involved in plasma wake generation and how electrons are trapped and accelerated by the wake. Understanding of such accelerators, and their development, offer high accelerating gradients, potentially reducing size and cost of new accelerators. One operating regime of interest is where a trapped subset of electrons loads the wake and forms an isolated group of accelerated particles with low spread in momentum and position, desirable characteristics for many applications. The electrons trapped in the wake may be accelerated to high energies, the plasma gradient in the wake reaching up to a gigaelectronvolt per centimeter. High-energy electron accelerators power intense X-ray radiation to terahertz sources, and are used in many applications including medical radiotherapy and imaging. To extract information from the simulation about the quality of the beam, a typical approach is to examine plots of the entire dataset, visually determining the adequate parameters necessary to select a subset of particles, which is then further analyzed. This procedure requires laborious examination of massive data sets over many time steps using several plots, a routine that is unfeasible for large data collections. Demand for automated analysis is growing along with the volume and size of simulations. Current 2D LWFA simulation datasets are typically between 1GB and 100GB in size, but simulations in 3D are of the order of TBs. The increase in the number of datasets and dataset sizes leads to a need for automatic routines to recognize particle patterns as particle bunches (beam of electrons) for subsequent analysis. Because of the growth in dataset size, the application of machine learning techniques for scientific data mining is increasingly considered. In plasma simulations, Bagherjeiran et al. presented a comprehensive report on applying graph-based techniques for orbit classification. They used the KAM classifier to label points and components in single and multiple orbits. Love et al. conducted an image space analysis of coherent structures in plasma simulations. They used a number of segmentation and region-growing techniques to isolate regions of interest in orbit plots. Both approaches analyzed particle accelerator data, targeting the system dynamics in terms of particle orbits. However, they did not address particle dynamics as a function of time or inspected the behavior of bunches of particles. Ruebel et al. addressed the visual analysis of massive laser wakefield acceleration (LWFA) simulation data using interactive procedures to query the data. Sophisticated visualization tools were provided to inspect the data manually. Ruebel et al. have integrated these tools to the visualization and analysis system VisIt, in addition to utilizing efficient data management based on HDF5, H5Part, and the index/query tool FastBit. In Ruebel et al. proposed automatic beam path analysis using a suite of methods to classify particles in simulation data and to analyze their temporal evolution. To enable researchers to accurately define particle beams, the method computes a set of measures based on the path of particles relative to the distance of the particles to a beam. To achieve good performance, this framework uses an analysis pipeline designed to quickly reduce the amount of data that needs to be considered in the actual path distance computation. As part of this process, region-growing methods are utilized to detect particle bunches at single time steps. Efficient data reduction is essential to enable automated analysis of large data sets as described in the next section, where data reduction methods are steered to the particular requirements of our clustering analysis. Previously, we have described the application of a set of algorithms to automate the data analysis and classification of particle beams in the LWFA simulation data, identifying locations with high density of high energy particles. These algorithms detected high density locations (nodes) in each time step, i.e. maximum points on the particle distribution for only one spatial variable. Each node was correlated to a node in previous or later time steps by linking these nodes according to a pruned minimum spanning tree (PMST). We call the PMST representation 'a lifetime diagram', which is a graphical tool to show temporal information of high dense groups of particles in the longitudinal direction for the time series. Electron bunch compactness was described by another step of the processing, designed to partition each time step, using fuzzy clustering, into a fixed number of clusters.

43 PARTICLE ACCELERATORS↗

Compare linear-system solver and preconditioner stacks with emphasis on GPU performance and propose phase-2 NGP solver development pathway

The goal of the ExaWind project is to enable predictive simulations of wind farms comprised of many megawatt-scale turbines situated in complex terrain. Predictive simulations will require computational fluid dynamics (CFD) simulations for which the mesh resolves the geometry of the turbines and captures the rotation and large deflections of blades. Whereas such simulations for a single turbine are arguably petascale class, multi-turbine wind farm simulations will require exascale-class resources. The primary physics codes in the ExaWind project are Nalu-Wind, which is an unstructured-grid solver for the acoustically incompressible Navier-Stokes equations, and OpenFAST, which is a whole-turbine simulation code. The Nalu-Wind model consists of the mass-continuity Poisson-type equation for pressure and a momentum equation for the velocity. For such modeling approaches, simulation times are dominated by linear-system setup and solution for the continuity and momentum systems. For the ExaWind challenge problem, the moving meshes greatly affect overall solver costs as reinitialization of matrices and recomputation of preconditioners is required at every time step. In this report we evaluated GPU-performance baselines for the linear solvers in the Trilinos and hypre solver stacks using two representative Nalu-Wind simulations: an atmospheric boundary layer precursor simulation on a structured mesh, and a fixed-wing simulation using unstructured overset meshes. Both strong-scaling and weak-scaling experiments were conducted on the OLCF supercomputer Summit and similar proxy clusters. We focused on the performance of multi-threaded Gauss-Seidel and two-stage Gauss-Seidel that are extensions of classical Gauss-Seidel; of one-reduce GMRES, a communication-reducing variant of the Krylov GMRES; and algebraic multigrid methods that incorporate the afore-mentioned methods. The team has established that AMG methods are capable of solving linear systems arising from the fixed-wing overset meshes on CPU, a critical intermediate result for ExaWind FY20 Q3 and Q4 milestones. For the fixed-wing strong-scaling study (model with 3M grid-points), the team identified that Nalu-Wind simulations with the new Trilinos and hypre solvers scale to modest GPU counts, maintaining above 70% efficiency up to 6 GPUs. However, there still remain significant bottlenecks to performance: matrix assembly (hypre), AMG setup (hypre and Trilinos) In the weak-scaling experiments (going from 0.4M to 211M gridpoints), it's shown that the solver apply phases are faster on GPUs, but that Nalu-Wind simulation times grow, primarily due to the multigrid-setup process. Finally, based on the report outcomes, we propose a linear solver path-forward for the remainder of the ExaWind project. Near term, the NREL team will continue their work on GPU-based linear-system assembly. They will also investigate how the use of alternatives to the NVIDIA UVM (unified virtual memory) paradigm affects performance. Longer term, the NREL team will evaluate algorithmic performance on other types of accelerators and merge their improvements back to the main hypre repository branch. Near term, the Trilinos team will address performance bottlenecks identified in this milestone, such as implementing a GPU-based segregated momentum solve and reusing matrix graphs across linear-system assembly phases. Longer term, the Trilinos team will do detailed analysis and optimization of multigrid setup.

17 WIND ENERGY↗

ADEPT: a domain independent sequence alignment strategy for gpu architectures

Bioinformatic workflows frequently make use of automated genome assembly and protein clustering tools. At the core of most of these tools, a significant portion of execution time is spent in determining optimal local alignment between two sequences. This task is performed with the Smith-Waterman algorithm, which is a dynamic programming based method. With the advent of modern sequencing technologies and increasing size of both genome and protein databases, a need for faster Smith-Waterman implementations has emerged. Multiple SIMD strategies for the Smith-Waterman algorithm are available for CPUs. However, with the move of HPC facilities towards accelerator based architectures, a need for an efficient GPU accelerated strategy has emerged. Existing GPU based strategies have either been optimized for a specific type of characters (Nucleotides or Amino Acids) or for only a handful of application use-cases. In this paper, we present ADEPT, a new sequence alignment strategy for GPU architectures that is domain independent, supporting alignment of sequences from both genomes and proteins. Our proposed strategy uses GPU specific optimizations that do not rely on the nature of sequence. We demonstrate the feasibility of this strategy by implementing the Smith-Waterman algorithm and comparing it to similar CPU strategies as well as the fastest known GPU methods for each domain. ADEPT’s driver enables it to scale across multiple GPUs and allows easy integration into software pipelines which utilize large scale computational systems. We have shown that the ADEPT based Smith-Waterman algorithm demonstrates a peak performance of 360 GCUPS and 497 GCUPs for protein based and DNA based datasets respectively on a single GPU node (8 GPUs) of the Cori Supercomputer. Overall ADEPT shows 10x faster performance in a node-to-node comparison against a corresponding SIMD CPU implementation. ADEPT demonstrates a performance that is either comparable or better than existing GPU strategies. We demonstrated the efficacy of ADEPT in supporting existing bionformatics software pipelines by integrating ADEPT in MetaHipMer a high-performance denovo metagenome assembler and PASTIS a high-performance protein similarity graph construction pipeline. Our results show 10% and 30% boost of performance in MetaHipMer and PASTIS respectively.

59 BASIC BIOLOGICAL SCIENCES↗

Coherency-Constrained Spectral Clustering for Power Network Reduction

This paper presents a methodology for reducing the complexity of large-scale power network models using spectral clustering, aggregation of electrical components, and cost function approximation. Two approaches are explored using unconstrained and constrained spectral clustering to determine areas for effective system reduction. Once the system areas are determined, both loads and generators by type are aggregated, and their new cost function is approximated through polynomial curve-fitting or statistical methods. The performance of reduced networks is evaluated in terms of their ability to follow the true daily cost of the original system over a 24-hour period considering a set of several days. Two test systems are taken as test beds. Application of the methodology to a modified version of the IEEE 39-bus system reduces it from 17 generators to a 4-bus system and 9 generators with about 93% of accuracy. Similarly, the IEEE 118-bus system is reduced from 19 generators to a 3-bus system with three aggregated units achieving over 99% of accuracy. These findings address scalability challenges and enhance accuracy for high and mid-loading level conditions, and by aggregating thermal units with similar cost functions.

42 ENGINEERING↗

A Parallel Genetic Algorithm for Automated Electronic Circuit Design

Parallelized versions of genetic algorithms (GAs) are popular primarily for three reasons: the GA is an inherently parallel algorithm, typical GA applications are very compute intensive, and powerful computing platforms, especially Beowulf-style computing clusters, are becoming more affordable and easier to implement. In addition, the low communication bandwidth required allows the use of inexpensive networking hardware such as standard office ethernet. In this paper we describe a parallel GA and its use in automated high-level circuit design. Genetic algorithms are a type of trial-and-error search technique that are guided by principles of Darwinian evolution. Just as the genetic material of two living organisms can intermix to produce offspring that are better adapted to their environment, GAs expose genetic material, frequently strings of 1s and Os, to the forces of artificial evolution: selection, mutation, recombination, etc. GAs start with a pool of randomly-generated candidate solutions which are then tested and scored with respect to their utility. Solutions are then bred by probabilistically selecting high quality parents and recombining their genetic representations to produce offspring solutions. Offspring are typically subjected to a small amount of random mutation. After a pool of offspring is produced, this process iterates until a satisfactory solution is found or an iteration limit is reached. Genetic algorithms have been applied to a wide variety of problems in many fields, including chemistry, biology, and many engineering disciplines. There are many styles of parallelism used in implementing parallel GAs. One such method is called the master-slave or processor farm approach. In this technique, slave nodes are used solely to compute fitness evaluations (the most time consuming part). The master processor collects fitness scores from the nodes and performs the genetic operators (selection, reproduction, variation, etc.). Because of dependency issues in the GA, it is possible to have idle processors. However, as long as the load at each processing node is similar, the processors are kept busy nearly all of the time. In applying GAs to circuit design, a suitable genetic representation 'is that of a circuit-construction program. We discuss one such circuit-construction programming language and show how evolution can generate useful analog circuit designs. This language has the desirable property that virtually all sets of combinations of primitives result in valid circuit graphs. Our system allows circuit size (number of devices), circuit topology, and device values to be evolved. Using a parallel genetic algorithm and circuit simulation software, we present experimental results as applied to three analog filter and two amplifier design tasks. For example, a figure shows an 85 dB amplifier design evolved by our system, and another figure shows the performance of that circuit (gain and frequency response). In all tasks, our system is able to generate circuits that achieve the target specifications.

Long, Jason D.↗

Power Systems Evaluated for Solar Electric Propulsion Vehicles

Solar electric propulsion (SEP) mission architectures are applicable to a wide range NASA missions including the robotic exploration of the outer planets in the next decade and the human exploration of Mars within the next 2 decades. SEP enables architectures that are very mass efficient with reasonable power levels (1-MW class) aerobrake and cryogenic upper-stage transportation technologies are utilized. In this architecture, the efficient SEP stage transfers the payload from low Earth orbit (LEO) High Energy Elliptical Parking Orbit (HEEPO) within a period of 6 to 12 months. highthrust, cryogenic upper stage and payload then separate from the SEP vehicle for injection to the planetary target, allowing for fast heliocentric trip times. This mission architecture offers a potential reduction in mass to LEO in comparison to alternative all-chemical nuclear propulsion schemes. Mass reductions may allow launch vehicle downsizing enable missions that would have been grounded because of cost constraints. The preceding figure illustrates a conceptual SEP stage design for a human Mars mission. Researchers at the NASA Glenn Research Center at Lewis Field designed conceptual SEP vehicle, conceived the mission architecture to use this vehicle, and analyzed the vehicle s performance. This SEP stage has a dry mass of 35 metric tons (MT), 40 MT of xenon propellant, and a photovoltaic array that spans 110 m, providing power to a cluster of eight 100-kW Hall thrusters. The stage can transfer an 80-MT payload and upper stage to the desired HEEPO. Preliminary packaging studies show this space-station-class SEP vehicle meets the proposed "Magnum" launch vehicle and volume requirements with considerable margin. An SEP vehicle for outer planetary missions, such as the Europa Mapper Mission, would be dramatically smaller than human Mars mission SEP stage. In this mission architecture, the SEP power system with the payload to provide spacecraft power throughout the mission. Several photovoltaic array design concepts were considered for the SEP vehicle power system for the human mission to Mars. These include a space station derivative, a SCARLET (Solar Concentrator Arrays with Refractive Linear Element Technology) derivative, and a hybrid inflatable-deployable thin polymer membrane array with thin-film solar cells (as shown in the concept illustration). This concept is based on a design developed for the Next Generation Space Telescope Sun shield. The array is divided into 16 independent electrical sections with 500-V, negative-grounded solar cell strings. The power system employs a channelized, 500-Vdc power management and distribution (PMAD) architecture with lithium ion batteries for energy storage for vehicle and payload secondary loads (the high-power Hall thrusters do not operate in eclipse periods). The 500-V PMAD voltage permits "direct-drive" thruster operation, greatly reducing the power processing unit size, complexity, and power loss. Similar power system architecture, designs, and technology are assumed for the Europa Mapper Mission SEP vehicle. The primary exceptions are that the photovoltaic array is assumed to consist of two rectangular wings and that the power system rating is 15 kW in Earth orbit and 200 W at Europa. To size the SEP vehicle power system, a dedicated Fortran code was developed to predict detailed power system performance, mass, and thermal control requirements. This code also modeled all the relevant Earth orbit environments; that is, the particulate radiation, plasma, meteoroids and debris, ultraviolet radiation, contamination, and thermal conditions. Analysis results for the Human Mars Mission SEP vehicle show a power system mass of 9-MT and photovoltaic array area of 5800-square meters for the thin-membrane design concept with CuInS2 thin-film cells. Power processing unit input power for a thin-membrane array design with three-junction, amorphous SiGe solar cells is shown in the graph. Power falls off rapidly inhe first weeks of the mission because of light-induced (Staebler-Wronksi) solar cell losses. During the next 200 days, power decreases steadily as the SEP stage spirals through the proton belts and sustains the bulk of the mission radiation damage. Once the vehicle apogee is above approximately four Earth radii, little additional degradation is incurred. From 400 to 800 days, a 1100-km "parking" orbit is maintained to await the next payload transfer opportunity. This orbit is below the main proton belt, and thus, little radiation dose is accumulated during this time period. During the second LEO-to-HEEPO transfer, power degrades somewhat further, but power requirements are still met. In comparison, the Europa Mapper SEP vehicle power system had a mass of 150 kg and a thin membrane array area of 100 square meters.

Kerslake, Thomas W.↗

New MOF based on lithium tetrahydrofuran-2,3,4,5-tetracarboxylate: Its structure and conductivity behavior

A novel metal–organic framework, [Li{sub 6}(HTFTA){sub 2}(H{sub 2}O){sub 3}]·3H{sub 2}O (LiTFTA, H{sub 4}TFTA is tetrahydrofuran-2,3,4,5-tetracarboxylic acid), has been synthesized under solvothermal conditions and its structure was determined by single-crystal X-ray diffraction studies. It has six different LiO{sub 4} tetrahedra which forms two kinds of tetranuclear clusters that are coordinated to the ligands and form an overall three-dimensional structure with channels running along the crystallographic a axis. Some of the carboxylate groups of the ligand moiety jut out into the channels and the channels are occupied by water molecules. The proton conductivity behavior of LiTFTA with respect to temperature and relative humidity was analyzed by our newly developed impedance data analysis method called a random-walk approach. The results were compared with the data obtained by an analysis using an equivalent electric circuit model. Based on the physical parameters obtained by the random-walk method and the known structure we suggested the mechanism of the proton conductivity in this material. The proton conduction proceeds most probably by a vehicle conduction mechanism which employs mainly water molecules of crystallization present in the channels of LiTFTA. The value of the diffusion coefficient increases with temperature whereas the number of charge carriers remains constant. On the other hand, both the number of charge carriers and diffusion coefficient increase with increasing relative humidity. - Graphical abstract: Structure of a new metal organic framework was determined and its ionic conductivity was evaluated using a random-walk approach. - Highlights: • Lithium tetrahydrofuran-2,3,4,5-tetracarboxylate is a MOF with water-filled pores. • The impedance spectra indicate that this material is ion conductive. • Conductivity was evaluated using a random walk approach. • The number of charge carriers and diffusion coefficient was determined.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Using graph neural networks to reconstruct charged pion showers in the CMS High Granularity Calorimeter

A novel method to reconstruct the energy of hadronic showersin the CMS High Granularity Calorimeter (HGCAL) is presented. TheHGCAL is a sampling calorimeter with very fine transverse andlongitudinal granularity. The active media are silicon sensors andscintillator tiles readout by SiPMs and the absorbers are acombination of lead and Cu/CuW in the electromagnetic section, andsteel in the hadronic section. The shower reconstruction method isbased on graph neural networks and it makes use of a dynamicreduction network architecture. It is shown that the algorithm isable to capture and mitigate the main effects that normally hinderthe reconstruction of hadronic showers using classicalreconstruction methods, by compensating for fluctuations in themultiplicity, energy, and spatial distributions of the shower'sconstituents. The performance of the algorithm is evaluated usingtest beam data collected in 2018 prototype of the CMS HGCALaccompanied by a section of the CALICE AHCAL prototype. Thecapability of the method to mitigate the impact of energy leakagefrom the calorimeter is also demonstrated.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Deciphering the Solvation Structure of Aqueous ZnCl 2 Solutions from X-ray Absorption Spectra Using the Interpretable Graph Neural Network

Machine learning (ML) provides powerful pathways for predicting spectroscopic observables from atomic structures, but its broader impact depends on making model predictions interpretable in terms of physical and chemical principles. Here, we introduce a physics-guided graph neural network (GNN) model that predicts Zn K-edge X-ray spectroscopy (XAS) spectra of aqueous ZnCl 2 solutions. Training data are generated from ab initio XAS calculations on molecular dynamics snapshots obtained using a machine learning interatomic potential. The GNN reproduces experimental spectra across concentrations from dilute (<0.1 m) to highly concentrated (30 m, “water-in-salt”) regimes and scales efficiently to large, disordered liquid systems beyond the reach of conventional ab initio approaches. Gradient-based attribution analysis reveals that the model learns physically meaningful structure-spectrum relationships. Ligand-specific attributions reflect orbital hybridization patterns and the origin of the excitations derived from the density functional theory. Bond-length attributions recover spectral shifts consistent with multiple-scattering theory. Finally, this work bridges data-driven prediction with electronic-structure theory, establishing a general paradigm for interpretable ML that links atomic structure, electronic structure, and spectroscopic observables.

25 ENERGY STORAGE↗