Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “dynamic graph”

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 775 records · Page 43

Stirling Engine Dynamic System Modeling

The Thermo-Mechanical systems branch at the Glenn Research Center focuses a large amount time on Stirling engines. These engines will be used on missions where solar power is inefficient, especially in deep space. I work with Tim Regan and Ed Lewandowski who are currently developing and validating a mathematical model for the Stirling engines. This model incorporates all aspects of the system including, mechanical, electrical and thermodynamic components. Modeling is done through Simplorer, a program capable of running simulations of the model. Once created and then proven to be accurate, a model is used for developing new ideas for engine design. My largest specific project involves varying key parameters in the model and quantifying the results. This can all be done relatively trouble-free with the help of Simplorer. Once the model is complete, Simplorer will do all the necessary calculations. The more complicated part of this project is determining which parameters to vary. Finding key parameters depends on the potential for a value to be independently altered in the design. For example, a change in one dimension may lead to a proportional change to the rest of the model, and no real progress is made. Also, the ability for a changed value to have a substantial impact on the outputs of the system is important. Results will be condensed into graphs and tables with the purpose of better communication and understanding of the data. With the changing of these parameters, a more optimal design can be created without having to purchase or build any models. Also, hours and hours of results can be simulated in minutes. In the long run, using mathematical models can save time and money. Along with this project, I have many other smaller assignments throughout the summer. My main goal is to assist in the processes of model development, validation and testing.

Nakis, Christopher G.↗

Brownian Shape Motion on Five-Dimensional Potential-Energy Surfaces:Nuclear Fission-Fragment Mass Distributions

Although nuclear fission can be understood qualitatively as an evolution of the nuclear shape, a quantitative description has proven to be very elusive. In particular, until now, there existed no model with demonstrated predictive power for the fission-fragment mass yields. Exploiting the expected strongly damped character of nuclear dynamics, we treat the nuclear shape evolution in analogy with Brownian motion and perform random walks on five-dimensional fission potential-energy surfaces which were calculated previously and are the most comprehensive available. Test applications give good reproduction of highly variable experimental mass yields. This novel general approach requires only a single new global parameter, namely, the critical neck size at which the mass split is frozen in, and the results are remarkably insensitive to its specific value.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Optimization-Based State Estimation Framework for Large-Scale Natural Gas Networks

We propose an optimization-based state estimation framework to track internal spacetime flow and pressure profiles of natural gas networks during dynamic transients. We find that the estimation problem is ill-posed (because of the infinite-dimensional nature of the states) and that this leads to instability of the estimator when short estimation horizons are used. To circumvent this issue, we propose moving horizon strategies that incorporate prior information. In particular, we propose a strategy that initializes the prior using steady-state information and compare its performance against a strategy that does not initialize the prior. We find that both strategies are capable of tracking the state profiles but we also find that superior performance is obtained with steady-state prior initialization. We also find that, under the proposed framework, pressure sensor information at junctions is sufficient to track the state profiles. We also derive approximate transport models and show that some of these can be used to achieve significant computational speed-ups without sacrificing estimation performance. We show that the estimator can be easily implemented in the graph-based modeling framework Plasmo.jl and use a multipipeline network study to demonstrate the developments.

Jalving, Jordan↗

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↗

Quantum search algorithms on a regular lattice

Quantum algorithms for searching for one or more marked items on a d-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms of the level dynamics near an avoided crossing of a one-parameter family of quantum random walks. We give approximations for both the level splitting at the avoided crossing and the effectively two-dimensional subspace of the full Hilbert space spanning the level crossing. This makes it possible to give the leading order behavior for the search time and the localization probability in the limit of large lattice size including the leading order coefficients. For d=2 and d=3, these coefficients are calculated explicitly. Closed form expressions are given for higher dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Predicting Rocket or Jet Noise in Real Time

A semi-empirical theoretical model and a C++ computer program that implements the model have been developed for use in predicting the noise generated by a rocket or jet engine. The computer program, entitled the Realtime Rocket and Jet Engine Noise Analysis and Prediction Software, is one of two main subsystems of the Acoustic Prediction/Measurement Tool, which comprises software, acoustic instrumentation, and electronic hardware combined to afford integrated capabilities for real-time prediction and measurement of noise emitted by rocket and jet engines. [The other main subsystem, consisting largely of acoustic instrumentation and electronic hardware, is described in Wireless Acoustic Measurement System, which appears elsewhere in this section.] The theoretical model was derived from the fundamental laws of fluid mechanics, as first was done by M. J. Lighthill in his now famous theory of aerodynamically generated sound. The far-field approximation of the Lighthill theory is incorporated into this model. Many other contributions from various researchers have also been introduced into the model. The model accounts for two noise components: shear noise and self noise. The final result of the model is expressed in terms of a volume integral of the acoustic intensities attributable to these two components, subject to various directivity coefficients. The computer program was written to solve the volume integral. The inputs required by the program are two data files from a computational fluid dynamics (CFD) simulation of the flow of interest: the computational-grid file and the solution file. The CFD solution should be one that has been obtained for conditions that closely approximate those of an experimental test that is yet to be performed. In the current state of development of the model and software, it is recommended that the observation points lie along a radius at an angle >60 from the jet axis. The software provides, and is driven via, a graphical user interface, which facilitates its use. Optionally, the program accepts additional input in the form of data on the measured sound pressure level as a function of frequency at a given far-field location, preferably at an angle of 90 from the jet axis. The user is prompted to use default empirical constants or to choose constants based the measurement data. The user can view the results and compare them with other computational or experimental data. Once satisfied with the results, the user can save a graph of the results in a file that can be imported into documents.

Frendi, Kader↗

Data efficiency and extrapolation trends in neural network interatomic potentials

Abstract Recently, key architectural advances have been proposed for neural network interatomic potentials (NNIPs), such as incorporating message-passing networks, equivariance, or many-body expansion terms. Although modern NNIP models exhibit small differences in test accuracy, this metric is still considered the main target when developing new NNIP architectures. In this work, we show how architectural and optimization choices influence the generalization of NNIPs, revealing trends in molecular dynamics (MD) stability, data efficiency, and loss landscapes. Using the 3BPA dataset, we uncover trends in NNIP errors and robustness to noise, showing these metrics are insufficient to predict MD stability in the high-accuracy regime. With a large-scale study on NequIP, MACE, and their optimizers, we show that our metric of loss entropy predicts out-of-distribution error and data efficiency despite being computed only on the training set. This work provides a deep learning justification for probing extrapolation and can inform the development of next-generation NNIPs.

36 MATERIALS SCIENCE↗

Ring of BEC pools as a trap for persistent flow

Mott insulator-superfluid transition in a periodic lattice of Josephson junctions can be driven by tunneling rate increase. The resulting winding numbers W of the condensate wave function decrease with increasing quench time in accord with the Kibble-Zurek mechanism (KZM). However, in very slow quenches, Bose-Hubbard dynamics rearranges the wave-function phase so that its random walk cools, W{sup 2} decreases and eventually the wave function becomes too cold to overcome potential barriers separating different W. Thus, in contrast with KZM, in very slow quenches W{sup 2} is set by random walk with ''critical'' step size, independently of {tau}{sub Q}. As our study requires use of the truncated Wigner approximation (TWA) over relatively long time intervals, we investigate the validity of TWA by comparing its predictions with exact calculations for suitably small quantum systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Inter-Procedural Resource Sharing in High Level Synthesis through Function Proxies

Modular design is becoming increasingly important in High Level Synthesis (HLS) flows. Current HLS flows generate hierarchical and modular designs that mimic the structure and call graph of input specification translating functions into modules. Function calls are translated instantiating the callee module in the data-path of its caller, allowing for resource sharing when the same function is called multiple times. However, if two different callers invoke the same function, current HLS flows cannot share the instance of the module between the two callers, even if they invoke the function in a mutually exclusive way. In this paper, we propose a methodology that enables sharing of (sub)modules across modules boundaries. Sharing is obtained through function proxies, which act as forwarders of function calls in the original specification to shared modules without adding performance penalties. Building on the concept of function proxies, we propose a methodology and the related components to perform HLS of function calls through function pointers, without requiring complete static knowledge of the alias set (point-to set). We show that module sharing through function proxies provides valuable area savings without significant impacts on the execution delays, and that our synthesis approach for function pointers enables dynamic polymorphism.

HLS, function proxy, FPGA, modular HLS,↗

EMPIRE-3.2 Malta: modular system for nuclear reaction calculations and nuclear data evaluation [User's Manual]

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. The system can be used for theoretical investigations of nuclear reactions as well as for nuclear data evaluation work. Photons, nucleons, deuterons, tritons, helions (3He), α’s, and light or heavy ions can be selected as projectiles. The energy range starts just above the resonance region in the case of a neutron projectile, and extends up to few hundred MeV for heavy ion induced reactions. The code accounts for the major nuclear reaction models, such as optical model, Coupled Channels and DWBA (ECIS06 and OPTMAN), Multi-step Direct (ORION + TRISTAN), NVWY Multi-step Compound, exciton model (PCROSS), hybrid Monte Carlo simulation (DDHMS), and the full featured Hauser-Feshbach model including width fluctuations and the optical model for fission. Heavy ion fusion cross section can be calculated within the simplified coupled channels approach (CCFUS). A comprehensive library of input parameters based on the RIPL-3 library covers nuclear masses, optical model parameters, ground state deformations, discrete levels and decay schemes, level densities, fission barriers, and γ-ray strength functions. Effects of the dynamic deformation of a fast rotating nucleus can be taken into account in the calculations (BARFIT, MOMFIT). The results can be converted into the ENDF-6 format using the accompanying EMPEND code. Modules of the ENDF Utility Codes and the ENDF Pre-Processing codes are applied for ENDF file verification. The package contains the full EXFOR library of experimental data in computational format C4 that are automatically retrieved during the calculations. EMPIRE contains the resonance module that retrieves data from the electronic version of the Atlas of Neutron Resonances by Mughabghab (not provided with the EMPIRE distribution), to produce resonance section and related covariances for the ENDF-6 formatted files. EMPIRE can be used to determine covariances of the calculated data using either sensitivity matrices along with the KALMAN code or employing Monte Carlo approach to produce model generated covariances. In both cases experimental data can be taken into account, either directly (KALMAN) or by feeding the EMPIRE calculated Monte Carlo modelling covariance as a prior to the least square fitting GANDR system. Publication quality graphs can be obtained using the powerful and flexible plotting package ZVView. Interactive plots with ZVView comparing experimental results with calculations can be produced with ENDVER modules. The backbone of the EMPIRE system are bash-shell UNIX scripts that provide for seamless console operation of EMPIRE on Linux, Mac OS X, and Microsoft Windows with GNU gfortran compiler installed. Additionally, the graphical interface, provides for an easy operation of the system on Linux, Mac OS X and virtual Linux machines running on Microsoft Windows.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Short-depth QAOA circuits and quantum annealing on higher-order ising models

Abstract We present a direct comparison between QAOA (Quantum Alternating Operator Ansatz), and QA (Quantum Annealing) on 127 qubit problem instances. QAOA with p = 1, 2 rounds is executed on the 127 qubit heavy-hex graph gate-model quantum computer ibm_washington, using on-device grid-searches for angle finding, and QA is executed on two Pegasus-chip D-Wave quantum annealers. The problems are random Ising models whose connectivity matches heavy-hex graphs and the Pegasus graph connectivity, and optionally include hardware-compatible cubic terms ( Z Z Z terms). The QAOA circuits are heavily optimized and of extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of the heavy-hex lattice. QAOA and QA are both compared against simulated annealing and the optimal solutions are computed exactly using CPLEX. The noiseless mean QAOA expectation values for p = 1, 2 are computed using classical light-cone based simulations. We find QA outperforms QAOA on the evaluated devices.

127 qubits↗

High resolution infrared spectroscopy from space: A preliminary report on the results of the Atmospheric Trace Molecule Spectroscopy (ATMOS) experiment on Spacelab 3

The ATMOS (Atmospheric Trace Molecule Spectroscopy) experiment has the broad purpose of investigating the physical structure, chemistry, and dynamics of the upper atmosphere through the study of the distributions of the neutral minor and trace constituents and their seasonal and long-term variations. The technique used is high-resolution infrared absorption spectroscopy using the Sun as the radiation source, observing the changes in the transmission of the atmosphere as the line-of-sight from the Sun to the spacecraft penetrates the atmosphere close to the Earth's limb at sunrise and sunset. During these periods, interferograms are generated at the rate of one each second which yield, when transformed, high resolution spectra covering the 2.2 to 16 micron region of the infrared. Twenty such occultations were recorded during the Spacelab 3 flight, which have produced concentration profiles for a large number of minor and trace upper atmospheric species in both the Northern and Southern Hemispheres. Several of these species have not previously been observed in spectroscopic data. The data reduction and analysis procedures used following the flight are discussed; a number of examples of the spectra obtained are shown, and a bar graph of the species detected thus far in the analysis is given which shows the altitude ranges for which concentration profiles were retrieved.

Farmer, Crofton B.↗

Efficient Parallelization of Irregular Applications on GPU Architectures

With the enlarging computation capacity of general Graphics Processing Units (GPUs), leveraging GPUs to accelerate parallel applications has become a critical topic in academia and industry. However, a wide range of irregular applications with the computation-/memory-intensive nature cannot easily achieve high GPU utilization. The challenges mainly involve the following aspects: first, data dependence leads to coarse-grained kernel and inefficient parallelism; second, heavy GPU memory usage may cause frequent memory evictions and extra overhead of I/O; third, specific computation patterns produce memory redundancies; last, workload balance and data reusability conjunctly benefit the overall performance, but there may exist a dynamic trade-off between them. Targeting these challenges, this dissertation proposes multiple optimizations to accelerate two real-world applications: many-body correlation functions to simulate nuclear physics in a large-scale scientific system; the other is the eALS-based matrix factorization recommendation system. To accelerate the calculations of many-body correlation functions, this dissertation presents three frameworks in GPU memory management and multi-GPU scheduling. Firstly, an optimized systematic GPU memory management framework, MemHC, utilizes a series of new memory reduction designs in GPU memory allocation, CPU/GPU communications, and GPU memory oversubscription. Secondly, an enhanced multi-GPU scheduling framework, MICCO, particularly by taking both data dimension (e.g., data reuse and data eviction) and computation dimension into account. MICCO designs a heuristic scheduling algorithm and a machine learning-based regression model to generate the optimal settings of a proposed new concept to manage the trade-off. Thirdly, a locality-aware multi-GPU scheduling framework. This scheduler leverages pipeline batch generation with a looking-ahead strategy by building local dependency graphs for memory transfer reduction and better data reuse, achieving up to 79.92% memory cost reduction and 1.67x speedup. To parallelize the eALS-based recommendation system, this dissertation proposes an efficient CPU/GPU heterogeneous recommendation system, HEALS. HEALS employs newly designed architecture-adaptive data formats to achieve load balance and good data locality on CPU and GPU. To mitigate the data dependence, HEALS presents a CPU/GPU collaboration model for both task parallelism and data parallelism with multiple kernel computation optimizations. In summary, this dissertation efficiently accelerates two typical irregular applications on GPUs by building four frameworks, including CPU/GPU collaboration, GPU memory management, and multi-GPU scheduling.

Wang, Qihan↗

Quantum random walks in a coherent atomic system via electromagnetically induced transparency

We propose a scheme to realize the quantum random walk in a coherent five-level atomic system via electromagnetically induced transparency (EIT). From optical Bloch equations describing the dynamics of the electromagnetic field and atomic population and coherence, we show that two circular-polarized components of a probe field display different dispersion properties and hence acquire different phase-shift modifications when passing through atomic cells. We demonstrate that the quantum coherence and interference owing to the EIT effect result in a low absorption of the probe field and hence provide a possibility of realizing a many-step phase-shift quantum random walk. The scheme may be used to experimentally highlight the characteristics of quantum random walk and lead to a promising application for quantum computation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scheduling Operations for Massive Heterogeneous Clusters

High-performance computing (HPC) programming has become increasingly difficult with the advent of hybrid supercomputers consisting of multicore CPUs and accelerator boards such as the GPU. Manual tuning of software to achieve high performance on this type of machine has been performed by programmers. This is needlessly difficult and prone to being invalidated by new hardware, new software, or changes in the underlying code. A system was developed for task-based representation of programs, which when coupled with a scheduler and runtime system, allows for many benefits, including higher performance and utilization of computational resources, easier programming and porting, and adaptations of code during runtime. The system consists of a method of representing computer algorithms as a series of data-dependent tasks. The series forms a graph, which can be scheduled for execution on many nodes of a supercomputer efficiently by a computer algorithm. The schedule is executed by a dispatch component, which is tailored to understand all of the hardware types that may be available within the system. The scheduler is informed by a cluster mapping tool, which generates a topology of available resources and their strengths and communication costs. Software is decoupled from its hardware, which aids in porting to future architectures. A computer algorithm schedules all operations, which for systems of high complexity (i.e., most NASA codes), cannot be performed optimally by a human. The system aids in reducing repetitive code, such as communication code, and aids in the reduction of redundant code across projects. It adds new features to code automatically, such as recovering from a lost node or the ability to modify the code while running. In this project, the innovators at the time of this reporting intend to develop two distinct technologies that build upon each other and both of which serve as building blocks for more efficient HPC usage. First is the scheduling and dynamic execution framework, and the second is scalable linear algebra libraries that are built directly on the former.

Humphrey, John↗

EPID-based verification of the MLC performance for dynamic IMRT and VMAT

Purpose: In advanced radiotherapy treatments such as intensity modulated radiation therapy (IMRT) and volumetric modulated arc therapy (VMAT), verification of the performance of the multileaf collimator (MLC) is an essential part of the linac QA program. The purpose of this study is to use the existing measurement methods for geometric QA of the MLCs and extend them to more comprehensive evaluation techniques, and to develop dedicated robust algorithms to quantitatively investigate the MLC performance in a fast, accurate, and efficient manner. Methods: The behavior of leaves was investigated in the step-and-shoot mode by the analysis of integrated electronic portal imaging device (EPID) images acquired during picket fence tests at fixed gantry angles and arc delivery. The MLC was also studied in dynamic mode by the analysis of cine EPID images of a sliding gap pattern delivered in a variety of conditions including different leaf speeds, deliveries at fixed gantry angles or in arc mode, and changing the direction of leaf motion. The accuracy of the method was tested by detection of the intentionally inserted errors in the delivery patterns. Results: The algorithm developed for the picket fence analysis was able to find each individual leaf position, gap width, and leaf bank skewness in addition to the deviations from expected leaf positions with respect to the beam central axis with sub-pixel accuracy. For the three tested linacs over a period of 5 months, the maximum change in the gap width was 0.5 mm, the maximum deviation from the expected leaf positions was 0.1 mm and the MLC skewness was up to 0.2 Degree-Sign . The algorithm developed for the sliding gap analysis could determine the velocity and acceleration/deceleration of each individual leaf as well as the gap width. There was a slight decrease in the accuracy of leaf performance with increasing leaf speeds. The analysis results were presented through several graphs. The accuracy of the method was assessed as 0.01 mm for both the gap size and peak position determination. Conclusions: This study provides fast, easy, and accurate test methods for routine QA of the MLC performance and helps in faster troubleshooting of MLC problems in both IMRT and VMAT treatments.

60 APPLIED LIFE SCIENCES↗

Molecular Assemblies, Genes and Genomics Integrated Efficiently (MAGGIE)

Final report on MAGGIE. We set ambitious goals to model the functions of individual organisms and their community from molecular to systems scale. These scientific goals are driving the development of sophisticated algorithms to analyze large amounts of experimental measurements made using high throughput technologies to explain and predict how the environment influences biological function at multiple scales and how the microbial systems in turn modify the environment. By experimentally evaluating predictions made using these models we will test the degree to which our quantitative multiscale understanding wilt help to rationally steer individual microbes and their communities towards specific tasks. Towards this end we have made substantial progress towards understanding evolution of gene families, transcriptional structures, detailed structures of keystone molecular assemblies (proteins and complexes), protein interactions, biological networks, microbial interactions, and community structure. Using comparative analysis we have tracked the evolutionary history of gene functions to understand how novel functions evolve. One level up, we have used proteomics data, high-resolution genome tiling microarrays, and 5' RNA sequencing to revise genome annotations, discover new genes including ncRNAs, and map dynamically changing operon structures of five model organisms: For Desulfovibrio vulgaris Hildenborough, Pyrococcus furiosis, Sulfolobus solfataricus, Methanococcus maripaludis and Haiobacterium salinarum NROL We have developed machine learning algorithms to accurately identify protein interactions at a near-zero false positive rate from noisy data generated using tagfess complex purification, TAP purification, and analysis of membrane complexes. Combining other genome-scale datasets produced by ENIGMA (in particular, microarray data) and available from literature we have been able to achieve a true positive rate as high as 65% at almost zero false positives when applied to the manually curated training set. Applying this method to the data representing around a quarter of the fraction space for water soluble proteins in D. vulgaris, we obtained 854 reliable pair wise interactions. Further, we have developed algorithms to analyze and assign significance to protein interaction data from bait pull-down experiments and integrate these data with other systems biology data through associative biclustering in a parallel computing environment. We will 'fill-in' missing information in these interaction data using a 'Transitive Closure' algorithm and subsequently use 'Between Commonality Decomposition' algorithm to discover complexes within these large graphs of protein interactions. To characterize the metabolic activities of proteins and their complexes we are developing algorithms to deconvolute pure mass spectra, estimate chemical formula for m/z values, and fit isotopic fine structure to metabolomics data. We have discovered that in comparison to isotopic pattern fitting methods restricting the chemical formula by these two dimensions actually facilitates unique solutions for chemical formula generators. To understand how microbial functions are regulated we have developed complementary algorithms for reconstructing gene regulatory networks (GRNs). Whereas the network inference algorithms cMonkey and Inferelator developed enable de novo reconstruction of predictive models for GRNs from diverse systems biology data, the RegPrecise and RegPredict framework developed uses evolutionary comparisons of genomes from closely related organisms to reconstruct conserved regulons. We have integrated the two complementary algorithms to rapidly generate comprehensive models for gene regulation of understudied organisms. Our preliminary analyses of these reconstructed GRNs have revealed novel regulatory mechanisms and cis-regulatory motifs, as well asothers that are conserved across species. Finally, we are supporting scientific efforts in ENIGMA with data management solutions and by integrating all of the algorithms, software and data into a Knowledgebase. For instance, we have developed the RegPrecise database (http://regprecise.lbl.gov) which represents manually curated sets of regulons laying the basis for automatic annotation of regulatory interactions in closely related species. We are also in the midst of scaling up MicrobesOnline to handle the growing volume of sequence and functional genomics data. Over the last year our efforts have been focused on providing support for additional genomic and functional genomic data types. Similarly, we have developed several visualization tools to help with the exploration of complex systems biology datasets. A case in point is the Gaggle Genome Browser (GGB), which was enhanced with visualizations for plotting peptide detections and protein-DNA binding alongside transcriptome structure, plus the ability to interactively filter by signal intensity or p-value.

54 ENVIRONMENTAL SCIENCES↗

Quantum Simulations of Radiation Damage in a Molecular Polyethylene Analog

Abstract An atomic‐level understanding of radiation‐induced damage in simple polymers like polyethylene is essential for determining how these chemical changes can alter the physical and mechanical properties of important technological materials such as plastics. Ensembles of quantum simulations of radiation damage in a polyethylene analog are performed using the Density Functional Tight Binding method to help bind its radiolysis and subsequent degradation as a function of radiation dose. Chemical degradation products are categorized with a graph theory approach, and occurrence rates of unsaturated carbon bond formation, crosslinking, cycle formation, chain scission reactions, and out‐gassing products are computed. Statistical correlations between product pairs show significant correlations between chain scission reactions, unsaturated carbon bond formation, and out‐gassing products, though these correlations decrease with increasing atom recoil energy. The results present relatively simple chemical descriptors as possible indications of network rearrangements in the middle range of excitation energies. Ultimately, the work provides a computational framework for determining the coupling between nonequilibrium chemistry in polymers and potential changes to macro‐scale properties that can aid in the interpretation of future radiation damage experiments on plastic materials.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗