Search NASA⌕ Search

SEARCH · Search NASA

Results for “applied computing”

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 469 records · Page 26

GPU Acceleration of Kernel Density Estimators in Monte Carlo Neutron Transport Simulations

Kernel Density Estimators (KDEs) have recently been explored for use in Monte Carlo radiation transport simulations as an alternative to histogram tallies for capturing spatially-resolved quantities such as neutron flux and reaction rates. Histogram tallies suffer from large uncertainties when detailed spatial resolution of the quantity of interest is required; increasing the resolution of the underlying mesh increases the uncertainty in each histogram bin. KDEs obtain estimates of underlying densities on user-defined points, with the uncertainty at those points being independent of the spatial resolution desired since collisions and particle-track segments are allowed to contribute to the score at multiple tally points. Thus, KDEs show potential for obtaining estimates of a smoother spatially-resolved with reduced variance when compared to a histogram. However, this ability that enables KDEs to obtain lower uncertainties per particle history is more computationally expensive than using a traditional histogram bins on a structured mesh. While KDEs are capable of producing lower tally uncertainties compared to histogram binning for a given number of histories, their increased computational cost may make them less efficient. Even so, it is possible to reduce this additional cost by exporting the KDE tally routines onto Graphics Processing Units (GPUs). GPUs are commonly found on high-performance computing machines as a means of increasing performance without adding additional compute nodes. While it is difficult for existing Monte Carlo radiation transport codes to take advantage of GPUs without rewriting large portions of the code, it is possible to leverage GPUs through heterogeneous computing. This work uses a modified version of OpenMC and exports the KDE tally routines onto a GPU to obtain problem-dependent speedups ranging between 1.6 and 5.0 for the problem studied in this paper. While this methodology is applied to KDEs, the same ideas can be applied to other computationally expensive vectorizable portions of Monte Carlo algorithms. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Inference of Causal Networks from Time-Varying Transcriptome Data via Sparse Coding

Temporal analysis of genome-wide data can provide insights into the underlying mechanism of the biological processes in two ways. First, grouping the temporal data provides a richer, more robust representation of the underlying processes that are co-regulated. The net result is a significant dimensional reduction of the genome-wide array data into a smaller set of vocabularies for bioinformatics analysis. Second, the computed set of time-course vocabularies can be interrogated for a potential causal network that can shed light on the underlying interactions. The method is coupled with an experiment for investigating responses to high doses of ionizing radiation with and without a small priming dose. From a computational perspective, inference of a causal network can rapidly become computationally intractable with the increasing number of variables. Additionally, from a bioinformatics perspective, larger networks always hinder interpretation. Therefore, our method focuses on inferring the simplest network that is computationally tractable and interpretable. The method first reduces the number of temporal variables through consensus clustering to reveal a small set of temporal templates. It then enforces simplicity in the network configuration through the sparsity constraint, which is further regularized by requiring continuity between consecutive time points. We present intermediate results for each computational step, and apply our method to a time-course transcriptome dataset for a cell line receiving a challenge dose of ionizing radiation with and without a prior priming dose. Our analyses indicate that (i) the priming dose increases the diversity of the computed templates (e.g., diversity of transcriptome signatures); thus, increasing the network complexity; (ii) as a result of the priming dose, there are a number of unique templates with delayed and oscillatory profiles; and (iii) radiation-induced stress responses are enriched through pathway and subnetwork studies.

59 BASIC BIOLOGICAL SCIENCES↗

Center for Center for Technology for Advanced Scientific Component Software (TASCS)

A resounding success of the Scientific Discovery through Advanced Computing (SciDAC) program is that high-performance computational science is now universally recognized as a critical aspect of scientific discovery [71], complementing both theoretical and experimental research. As scientific communities prepare to exploit unprecedented computing capabilities of emerging leadership-class machines for multi-model simulations at the extreme scale [72], it is more important than ever to address the technical and social challenges of geographically distributed teams that combine expertise in domain science, applied mathematics, and computer science to build robust and flexible codes that can incorporate changes over time. The Center for Technology for Advanced Scientific Component Software (TASCS)1 tackles these these issues by exploiting component-based software development to facilitate collaborative high-performance scientific computing.

97 MATHEMATICS AND COMPUTING↗

Predicting Critical Transitions in Multiscale Data

Predicting the dynamics of complex nonlinear systems remains a challenging problem both in dynamical systems theory as well as real world science and engineering applications. Data-driven methods utilizing the latest advances in machine learning (ML) provide a promising new paradigm for this task. Our work centered on Reservoir Computing (RC), which has shown itself to be capable of skillfully predicting chaotic dynamics in multiscale systems. In the first part of the work, the focus is on how to improve predictions of critical transitions in a class of slow-fast metastable systems in which the equations are known. An additional goal was to determine whether a relationship exists between RC and Koopman operator theory, to improve the efficiency and broaden the applicability of the approach. In the second part of this work, a variation on the RC model known as Reconstructive Reservoir Computing (RRC) is applied to real-world data to identify anomalies.

97 MATHEMATICS AND COMPUTING↗

3D neutronic/thermal-hydraulic coupled analysis of MYRRHA

The current tendency in multiphysics calculations applied to reactor physics is the use of already validated computer codes, coupled by means of an iterative approach. In this paper such an approach is explained concerning neutronics and thermal-hydraulics coupled analysis with MCNPX and COBRA-IV codes using a driver program and file exchange between codes. MCNPX provides the neutronic analysis of heterogeneous nuclear systems, both in critical and subcritical states, while COBRA-IV is a subchannel code that can be used for rod bundles or core thermal-hydraulics analysis. In our model, the MCNP temperature dependence of nuclear data is handled via pseudo-material approach, mixing pre-generated cross section data set to obtain the material with the desired cross section temperature. On the other hand, COBRA-IV has been updated to allow for the simulation of liquid metal cooled reactors. The coupled computational tool can be applied to any geometry and coolant, as it is the case of single fuel assembly, at pin-by-pin level, or full core simulation with the average pin of each fuel-assembly. The coupling tool has been applied to the critical core layout of the SCK-CEN MYRRHA concept, an experimental LBE cooled fast reactor presently in engineering design stage. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Demonstration and Validation of Additively Manufactured Intensified Device for Enhanced Carbon Capture

In FY 2018 and 2019, ORNL personnel designed, prototyped, characterized, and tested the enhancement of amine-based carbon capture using additively manufactured intensified devices, i.e., devices combining multiple thermodynamic and kinetic processes into one unit operation. State of the art scrubbing technology often employs inter-stage cooling which requires multiple stages of single-purpose unit operations, leading to larger equipment size, higher capital cost, and sometimes less than optimal operating conditions for each piece of equipment. It was proposed that integrating multiple thermodynamic and kinetic operations into one unit could mitigate or negate these drawbacks. Heat and mass transfer studies demonstrated that an additively manufactured intensified device could significantly improve capture efficiency at bench scale. This project is a continuation of FEAA130 and aims at (1) demonstration and validation of enhanced CO 2 capture with 3D printed intensified devices (i.e., mass exchanger packing with internal cooling channels), for low-aqueous-solvent (LAS) based capture at the ORNL-constructed laboratory-scale (4.5-feet tall) column, namely Column A, with built-in cooling and (2) computational scoping on the conceptual design of a flexible and modular larger column, namely Column B, at ORNL for further demonstration of enhanced capture for aqueous solvent. To execute this multi-faceted project scope, an integrated project team from ORNL’s Manufacturing Science Division is tasked with applying capabilities in computational fluid dynamics (CFD), additive manufacturing, and absorber-scale demonstration/validation experiments.

42 ENGINEERING↗

A computationally efficient parallel Levenberg-Marquardt algorithm for highly parameterized inverse model analyses

Inverse modeling seeks model parameters given a set of observations. However, for practical problems because the number of measurements is often large and the model parameters are also numerous, conventional methods for inverse modeling can be computationally expensive. We have developed a new, computationally-efficient parallel Levenberg-Marquardt method for solving inverse modeling problems with a highly parameterized model space. Levenberg-Marquardt methods require the solution of a linear system of equations which can be prohibitively expensive to compute for moderate to large-scale problems. Our novel method projects the original linear problem down to a Krylov subspace, such that the dimensionality of the problem can be significantly reduced. Furthermore, we store the Krylov subspace computed when using the first damping parameter and recycle the subspace for the subsequent damping parameters. The efficiency of our new inverse modeling algorithm is significantly improved using these computational techniques. We apply this new inverse modeling method to invert for random transmissivity fields in 2D and a random hydraulic conductivity field in 3D. Our algorithm is fast enough to solve for the distributed model parameters (transmissivity) in the model domain. The algorithm is coded in Julia and implemented in the MADS computational framework (http://mads.lanl.gov). By comparing with Levenberg-Marquardt methods using standard linear inversion techniques such as QR or SVD methods, our Levenberg-Marquardt method yields a speed-up ratio on the order of ~10 1 to ~10 2 in a multi-core computational environment. Furthermore, our new inverse modeling method is a powerful tool for characterizing subsurface heterogeneity for moderate- to large-scale problems.

97 MATHEMATICS AND COMPUTING↗

A Scalable Reduced‐Order Model for the Steady Navier–Stokes Equations

Scaling up new scientific technologies from laboratory to industry often involves demonstrating performance on a larger scale. Computer simulations can accelerate design and predictions in the deployment process, though traditional numerical methods are computationally intractable even for intermediate pilot plant scales. Recently, the component reduced order modeling method has been developed to tackle this challenge by combining projection reduced order modeling and discontinuous Galerkin domain decomposition. However, while many scientific or engineering applications involve nonlinear physics, this method has only been demonstrated for various linear systems. In this work, the component reduced order modeling method is extended to steady Navier–Stokes flow, with application to general nonlinear physics in view. The large‐scale, global domain is decomposed into a combination of small‐scale unit component. Linear subspaces for flow velocity and pressure are identified via proper orthogonal decomposition over sample snapshots collected from each small‐scale unit component. Velocity bases are augmented with a pressure supremizer to satisfy the inf–sup condition for stable pressure prediction. Two different nonlinear reduced order modeling methods are employed and compared for efficient evaluation of nonlinear advection: A third‐order tensor projection operator and the empirical quadrature procedure. The proposed method is demonstrated on the flow over arrays of five different unit objects, achieving a 23‐fold speedup with less than 4% relative error in domains up to 256 times larger than the unit components. Furthermore, a numerical experiment with the pressure supremizer strongly indicates the need for a supremizer for stable pressure prediction. A comparison between the tensorial approach and the empirical quadrature procedure revealed a slight advantage of the empirical quadrature procedure. The framework is compared with an alternating Schwarz‐based reduced‐order approach, demonstrating improved efficiency and robustness for the DG‐based global solver while retaining flexibility for sub‐scale iterative solvers. The method is further extended to a coupled advection–diffusion and Navier–Stokes system, illustrating its applicability to multi‐physics problems and its potential for more general, inter‐coupled nonlinear systems.

42 ENGINEERING↗

Nonlinear acceleration of SN transport calculations

The use of nonlinear iterative methods, Jacobian-Free Newton-Krylov (JFNK) in particular, for solving eigenvalue problems in transport applications has recently become an active subject of research. While JFNK has been shown to be effective for k-eigenvalue problems, there are a number of input parameters that impact computational efficiency, making it difficult to implement efficiently in a production code using a single set of default parameters. We show that different selections for the forcing parameter in particular can lead to large variations in the amount of computational work for a given problem. In contrast, we present a nonlinear subspace method that sits outside and effectively accelerates nonlinear iterations of a given form and requires only a single input parameter, the subspace size. It is shown to consistently and significantly reduce the amount of computational work when applied to fixed-point iteration, and this combination of methods is shown to be more efficient than JFNK for our application.

97 MATHEMATICS AND COMPUTING↗

DAGSENS: Directed Acyclic Graph Based Direct and Adjoint Transient Sensitivity Analysis for Event-Driven Objective Functions

We present DAGSENS, a new theory for parametric transient sensitivity analysis of Differential Algebraic Equation systems (DAEs), such as SPICE-level circuits. The key ideas behind DAGSENS are, (1) to represent the entire sequence of computations, starting from DAE parameters, all the way up to the objective function whose sensitivity is needed, as a Directed Acyclic Graph (DAG) called the "sensitivity DAG", and (2) to compute the required sensitivities efficiently (with time complexity linear in the size of the sensitivity DAG) by leveraging dynamic programming techniques to traverse the DAG. DAGSENS is simple, elegant, and easy-to-understand compared to existing sensitivity analysis approaches; for example, in DAGSENS, one can switch between direct and adjoint transient sensitivities just by changing the direction of DAG traversal (i.e., topological order vs. reverse topological order). Also, DAGSENS is significantly more powerful than existing sensitivity analysis approaches because it allows one to compute the sensitivities of a much more general class of objective functions, including those defined based on "events" that occur during a transient simulation (e.g., a node voltage crossing a particular threshold, a phase-locked loop (PLL) achieving lock, a signal reaching its maximum/minimum value during a transient run, etc.). In this paper, we apply DAGSENS to compute the sensitivities of important event-driven performance metrics in several real-world electronic and biological applications, including high-speed communication (featuring sub-systems such as I/0 links and PLLs), statistical cell library characterization, and gene expression in Drosophila embryos.

42 ENGINEERING↗

HERMES: A model to describe deformation, burning, explosion, and detonation

HERMES (High Explosive Response to MEchanical Stimulus) was developed to fill the need for a model to describe an explosive response of the type described as BVR (Burn to Violent Response) or HEVR (High Explosive Violent Response). Characteristically this response leaves a substantial amount of explosive unconsumed, the time to reaction is long, and the peak pressure developed is low. In contrast, detonations characteristically consume all explosive present, the time to reaction is short, and peak pressures are high. However, most of the previous models to describe explosive response were models for detonation. The earliest models to describe the response of explosives to mechanical stimulus in computer simulations were applied to intentional detonation (performance) of nearly ideal explosives. In this case, an ideal explosive is one with a vanishingly small reaction zone. A detonation is supersonic with respect to the undetonated explosive (reactant). The reactant cannot respond to the pressure of the detonation before the detonation front arrives, so the precise compressibility of the reactant does not matter. Further, the mesh sizes that were practical for the computer resources then available were large with respect to the reaction zone. As a result, methods then used to model detonations, known as β-burn or program burn, were not intended to resolve the structure of the reaction zone. Instead, these methods spread the detonation front over a few finite-difference zones, in the same spirit that artificial viscosity is used to spread the shock front in inert materials over a few finite-difference zones. These methods are still widely used when the structure of the reaction zone and the build-up to detonation are unimportant. Later detonation models resolved the reaction zone. These models were applied both to performance, particularly as it is affected by the size of the charge, and to situations in which the stimulus was less than that needed for reliable performance, whether as a result of accident, hazard, or a fault in the detonation train. These models describe the build-up of detonation from a shock stimulus. They are generally consistent with the mesoscale picture of ignition at many small defects in the plane of the shock front and the growth of the resulting hot-spots, leading to detonation in heterogeneous explosives such as plastic-bonded explosives (PBX). The models included terms for ignition, and also for the growth of reaction as tracked by the local mass fraction of product gas, {lambda}. The growth of reaction in such models incorporates a form factor that describes the change of surface area per unit volume (specific surface area) as the reaction progresses. For unimolecular crystalline-based explosives, the form factor is consistent with the mesoscale picture of a galaxy of hot spots burning outward and eventually interacting with each other. For composite explosives and propellants, where the fuel and oxidizer are segregated, the diffusion flame at the fuel-oxidizer interface can be interpreted with a different form factor that corresponds to grains burning inward from their surfaces. The form factor influences the energy release rate, and the amount of energy released in the reaction zone. Since the 19 th century, gun and cannon propellants have used perforated geometric shapes that produce an increasing surface area as the propellant burns. This helps maintain the pressure as burning continues while the projectile travels down the barrel, which thereby increases the volume of the hot gas. Interior ballistics calculations use a geometric form factor to describe the changing surface area precisely. As a result, with a suitably modified form factor, detonation models can represent burning and explosion in damaged and broken reactant. The disadvantage of such models in application to accidents is that the ignition term does not distinguish between a value of pressure that results from a shock, and the same pressure that results from a more gradual increase. This disagrees with experiments, where explosives were subjected to a gradual rise in pressure and did not exhibit reaction. More recent models do distinguish between slow pressure rises and shocks, and have had some success in the describing the response of explosives to single and multiple shocks, and the increase of shock sensitivity with porosity, at least over a limited range. The original formulation is appropriate for sustained shocks, but further work is ongoing to describe the response to short pulses. The HERMES model combines features from these prior models. It describes burning and explosion in damaged reactant, and also will develop a detonation if the gradual rise in pressure from burning steepens into a strong-enough shock. The shock strength needed for detonation in a fixed run distance decreases with increasing porosity.

36 MATERIALS SCIENCE↗

Advancing Understanding of Fission Gas Behavior in Nuclear Fuel through Leadership Class Computing

This report describes the outcome of the pilot SciDAC project jointly funded by the DOE Office of Nuclear Energy and the DOE Office of Science, Advanced Scientific Computing Research to advance understanding of fission gas behavior in nuclear fuel. The computational approach involved utilizing both a bottom up and top down multiscale materials modeling to evaluate the processes of xenon fission gas diffusion, xenon clustering and precipitation and the mechanisms of fission gas resolution by energetic fission fragments in uranium dioxide nuclear fuel. The computer science and applied mathematics research activities were focused on optimizing the uranium – oxygen – xenon interatomic potential implementation in the LAMMPS molecular dynamics code for large-scale simulations of fission gas resolution, in addition to improvements in visualization of accelerated molecular dynamics simulations and performance optimization of the Xolotl continuum cluster dynamics with a new grouping scheme to reduce the computational cost of modeling very large fission gas bubbles containing more than 10,000 xenon atoms. The most impactful result from this project stems from a systematic series of atomistic molecular dynamics to evaluate fission gas resolution from xenon bubbles that, combined with the fission product yields and consideration of electron-phonon coupling, informed a first principles model that predicts the magnitude of fission gas resolution in good agreement with empirical estimates.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Crosscut report: Exascale Requirements Reviews, March 9–10, 2017 – Tysons Corner, Virginia. An Office of Science review sponsored by: Advanced Scientific Computing Research, Basic Energy Sciences, Biological and Environmental Research, Fusion Energy Sciences, High Energy Physics, Nuclear Physics

The mission of the U.S. Department of Energy Office of Science (DOE SC) is the delivery of scientific discoveries and major scientific tools to transform our understanding of nature and to advance the energy, economic, and national security missions of the United States. To achieve these goals in today’s world requires investments in not only the traditional scientific endeavors of theory and experiment, but also in computational science and the facilities that support large-scale simulation and data analysis. The Advanced Scientific Computing Research (ASCR) program addresses these challenges in the Office of Science. ASCR’s mission is to discover, develop, and deploy computational and networking capabilities to analyze, model, simulate, and predict complex phenomena important to DOE. ASCR supports research in computational science, three high-performance computing (HPC) facilities — the National Energy Research Scientific Computing Center (NERSC) at Lawrence Berkeley National Laboratory and Leadership Computing Facilities at Argonne (ALCF) and Oak Ridge (OLCF) National Laboratories — and the Energy Sciences Network (ESnet) at Berkeley Lab. ASCR is guided by science needs as it develops research programs, computers, and networks at the leading edge of technologies. As we approach the era of exascale computing, technology changes are creating challenges for science programs in SC for those who need to use high performance computing and data systems effectively. Numerous significant modifications to today’s tools and techniques will be needed to realize the full potential of emerging computing systems and other novel computing architectures. To assess these needs and challenges, ASCR held a series of Exascale Requirements Reviews in 2015–2017, one with each of the six SC program offices,1 and a subsequent Crosscut Review that sought to integrate the findings from each. Participants at the reviews were drawn from the communities of leading domain scientists, experts in computer science and applied mathematics, ASCR facility staff, and DOE program managers in ASCR and the respective program offices. The purpose of these reviews was to identify mission-critical scientific problems within the DOE Office of Science (including experimental facilities) and determine the requirements for the exascale ecosystem that would be needed to address those challenges. The exascale ecosystem includes exascale computing systems, high-end data capabilities, efficient software at scale, libraries, tools, and other capabilities. This effort will contribute to the development of a strategic roadmap for ASCR compute and data facility investments and will help the ASCR Facility Division establish partnerships with Office of Science stakeholders. It will also inform the Office of Science research needs and agenda. The results of the six reviews have been published in reports available on the web at http://exascaleage.org/. This report presents a summary of the individual reports and of common and crosscutting findings, and it identifies opportunities for productive collaborations among the DOE SC program offices.

97 MATHEMATICS AND COMPUTING↗

efam: an e xpanded, metaproteome-supported HMM profile database of viral protein fam ilies

Viruses infect, reprogram and kill microbes, leading to profound ecosystem consequences, from elemental cycling in oceans and soils to microbiome-modulated diseases in plants and animals. Although metagenomic datasets are increasingly available, identifying viruses in them is challenging due to poor representation and annotation of viral sequences in databases. Here, we establish efam, an expanded collection of Hidden Markov Model (HMM) profiles that represent viral protein families conservatively identified from the Global Ocean Virome 2.0 dataset. This resulted in 240 311 HMM profiles, each with at least 2 protein sequences, making efam >7-fold larger than the next largest, pan-ecosystem viral HMM profile database. Adjusting the criteria for viral contig confidence from ‘conservative’ to ‘eXtremely Conservative’ resulted in 37 841 HMM profiles in our efam-XC database. To assess the value of this resource, we integrated efam-XC into VirSorter viral discovery software to discover viruses from less-studied, ecologically distinct oxygen minimum zone (OMZ) marine habitats. This expanded database led to an increase in viruses recovered from every tested OMZ virome by ~24% on average (up to ~42%) and especially improved the recovery of often-missed shorter contigs (<5 kb). Additionally, to help elucidate lesser-known viral protein functions, we annotated the profiles using multiple databases from the DRAM pipeline and virion-associated metaproteomic data, which doubled the number of annotations obtainable by standard, single-database annotation approaches. Together, these marine resources (efam and efam-XC) are provided as searchable, compressed HMM databases that will be updated bi-annually to help maximize viral sequence discovery and study from any ecosystem.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimal adjustment sets for causal query estimation in partially observed biomolecular networks

Abstract Causal query estimation in biomolecular networks commonly selects a ‘valid adjustment set’, i.e. a subset of network variables that eliminates the bias of the estimator. A same query may have multiple valid adjustment sets, each with a different variance. When networks are partially observed, current methods use graph-based criteria to find an adjustment set that minimizes asymptotic variance. Unfortunately, many models that share the same graph topology, and therefore same functional dependencies, may differ in the processes that generate the observational data. In these cases, the topology-based criteria fail to distinguish the variances of the adjustment sets. This deficiency can lead to sub-optimal adjustment sets, and to miss-characterization of the effect of the intervention. We propose an approach for deriving ‘optimal adjustment sets’ that takes into account the nature of the data, bias and finite-sample variance of the estimator, and cost. It empirically learns the data generating processes from historical experimental data, and characterizes the properties of the estimators by simulation. We demonstrate the utility of the proposed approach in four biomolecular Case studies with different topologies and different data generation processes. The implementation and reproducible Case studies are at https://github.com/srtaheri/OptimalAdjustmentSet.

59 BASIC BIOLOGICAL SCIENCES↗

Ergatis: a web interface and scalable software system for bioinformatics workflows

Motivation: The growth of sequence data has been accompanied by an increasing need to analyze data on distributed computer clusters. The use of these systems for routine analysis requires scalable and robust software for data management of large datasets. Software is also needed to simplify data management and make large-scale bioinformatics analysis accessible and reproducible to a wide class of target users. Results: We have developed a workflow management system named Ergatis that enables users to build, execute and monitor pipelines for computational analysis of genomics data. Ergatis contains preconfigured components and template pipelines for a number of common bioinformatics tasks such as prokaryotic genome annotation and genome comparisons. Outputs from many of these components can be loaded into a Chado relational database. Ergatis was designed to be accessible to a broad class of users and provides a user friendly, web-based interface. Ergatis supports highthroughput batch processing on distributed compute clusters and has been used for data management in a number of genome annotation and comparative genomics projects.

59 BASIC BIOLOGICAL SCIENCES↗

Sparse multitask regression for identifying common mechanism of response to therapeutic targets

Motivation: Molecular association of phenotypic responses is an important step in hypothesis generation and for initiating design of new experiments. Current practices for associating gene expression data with multidimensional phenotypic data are typically (i) performed one-to-one, i.e. each gene is examined independently with a phenotypic index and (ii) tested with one stress condition at a time, i.e. different perturbations are analyzed separately. As a result, the complex coordination among the genes responsible for a phenotypic profile is potentially lost. More importantly, univariate analysis can potentially hide new insights into common mechanism of response. Results: In this article, we propose a sparse, multitask regression model together with co-clustering analysis to explore the intrinsic grouping in associating the gene expression with phenotypic signatures. The global structure of association is captured by learning an intrinsic template that is shared among experimental conditions, with local perturbations introduced to integrate effects of therapeutic agents. We demonstrate the performance of our approach on both synthetic and experimental data. Synthetic data reveal that the multitask regression has a superior reduction in the regression error when compared with traditional L1-and L2-regularized regression. On the other hand, experiments with cell cycle inhibitors over a panel of 14 breast cancer cell lines demonstrate the relevance of the computed molecular predictors with the cell cycle machinery, as well as the identification of hidden variables that are not captured by the baseline regression analysis. Accordingly, the system has identified CLCA2 as a hidden transcript and as a common mechanism of response for two therapeutic agents of CI-1040 and Iressa, which are currently in clinical use.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

QAARM: quasi-anharmonic autoregressive model reveals molecular recognition pathways in ubiquitin

Motivation: Molecular dynamics (MD) simulations have dramatically improved the atomistic understanding of protein motions, energetics and function. These growing datasets have necessitated a corresponding emphasis on trajectory analysis methods for characterizing simulation data, particularly since functional protein motions and transitions are often rare and/or intricate events. Observing that such events give rise to long-tailed spatial distributions, we recently developed a higher-order statistics based dimensionality reduction method, called quasi-anharmonic analysis (QAA), for identifying biophysically-relevant reaction coordinates and substates within MD simulations. Further characterization of conformation space should consider the temporal dynamics specific to each identified substate. Results: Our model uses hierarchical clustering to learn energetically coherent substates and dynamic modes of motion from a 0.5µs ubiqutin simulation. Autoregressive (AR) modeling within and between states enables a compact and generative description of the conformational landscape as it relates to functional transitions between binding poses. Lacking a predictive component, QAA is extended here within a general AR model appreciative of the trajectory’s temporal dependencies and the specific, local dynamics accessible to a protein within identified energy wells. These metastable states and their transition rates are extracted within a QAA-derived subspace using hierarchical Markov clustering to provide parameter sets for the second-order AR model. We show the learned model can be extrapolated to synthesize trajectories of arbitrary length.

59 BASIC BIOLOGICAL SCIENCES↗