Search NASA⌕ Search

Engineering topics

Sofia, Heidi J

Publications and source records attributed to Sofia, Heidi J.

Cray XMT Brings New Energy to High-Performance Computing

The ability to solve our nation’s most challenging problems—whether it’s cleaning up the environment, finding alternative forms of energy or improving public health and safety—requires new scientific discoveries. High performance experimental and computational technologies from the past decade are helping to accelerate these scientific discoveries, but they introduce challenges of their own. The vastly increasing volumes and complexities of experimental and computational data pose significant challenges to traditional high-performance computing (HPC) platforms as terabytes to petabytes of data must be processed and analyzed. And the growing complexity of computer models that incorporate dynamic multiscale and multiphysics phenomena place enormous demands on high-performance computer architectures. Just as these new challenges are arising, the computer architecture world is experiencing a renaissance of innovation. The continuing march of Moore’s law has provided the opportunity to put more functionality on a chip, enabling the achievement of performance in new ways. Power limitations, however, will severely limit future growth in clock rates. The challenge will be to obtain greater utilization via some form of on-chip parallelism, but the complexities of emerging applications will require significant innovation in high-performance architectures. The Cray XMT, the successor to the Tera/Cray MTA, provides an alternative platform for addressing computations that stymie current HPC systems, holding the potential to substantially accelerate data analysis and predictive analytics for many complex challenges in energy, national security and fundamental science that traditional computing cannot do.

97 MATHEMATICS AND COMPUTING↗

Backbone 1H, 13C, and 15N NMR assignments for the Cyanothece 51142 protein cce_0567: a protein associated with nitrogen fixation in the DUF683 family

The recently sequenced genome of the diurnal cyanobacterium Cyanothece sp. PCC 51142 (contig 83.1_1_243_746) contains the sequence for an hypothetical protein that falls into the DUF683 family. As observed for the other 54 DUF683 proteins currently listed in the GenBank database, this 78-residue (9.0 kDa) protein in Cyanothece is also found in a nitrogen fixation gene cluster suggesting that it is involved in the process. To date no structural information exists for any of the proteins in the DUF683 family. In an effort to elucidate the biochemical role DUF683 may play in nitrogen fixation and to obtain structural information for a member of the DUF683 protein family, a construct containing DUF683 from Cyanothece 51142 was generated, expressed, purified, and the solution properties characterized. A total rotational correlation time (tc) of 17.1 ns was estimated by nuclear magnetic resonance (NMR) spectroscopy suggesting a molecular weight of ~ 40 kDa, an observation dictating that DUF683 is a tetramer in solution. Using triple-labeled (2H, 13C, 15N) and residue-specific 15N-labeled amino acids (L, K, V, and E/Q) samples, most of the backbone and side chain resonances for DUF683 were assigned. The 13C alpha chemical shifts and NOESY NMR data indicate that the protein is helical from K18-E75.

59 BASIC BIOLOGICAL SCIENCES↗

BioGraphE: High-performance bionetwork analysis using the Biological Graph Environment

Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching have great potential as analysis techniques for newly available data in biology. Yet, as the amount of genomic and bionetwork information rapidly grows, scientists need advanced new computational strategies and tools for dealing with the complexities of the bionetwork analysis and the volume of the data. We introduce a computational framework for graph analysis called the Biological Graph Environment (BioGraphE), which provides a general, scalable integration platform for connecting graph problems in biology to optimized computational solvers and high-performance systems. This framework enables biology researchers and computational scientists to identify and deploy network analysis applications and to easily connect them to efficient and powerful computational software and hardware that are specifically designed and tuned to solve complex graph problems. In our particular application of BioGraphE to support network analysis in genome biology, we investigate the use of a Boolean satisfiability solver known as Survey Propagation as a core computational solver and high-performance parallel systems that utilize multi-threaded architectures. In our application of BioGraphE to conduct bionetwork analysis of homology networks, we found that BioGraphE and a custom, parallel implementation of the Survey Propagation SAT solver were capable of solving very large bionetwork problems at high rates of execution on different high-performance computing platforms.

59 BASIC BIOLOGICAL SCIENCES↗

A Dynamic Multiscale Magnifying Tool for Exploring Large Sparse Graphs

We present an information visualization tool, known as GreenMax, to visually explore large small-world graphs with up to a million graph nodes on a desktop computer. A major motivation for scanning a small-world graph in such a brute-force fashion is the demanding goal of identifying not just the well-known features but also the unknown-known and unknown-unknown features of the graph. GreenMax uses a highly effective multilevel graph drawing approach to pre-process a large graph by generating a hierarchy of increasingly coarse layouts that later support the dynamic zooming of the graph. This paper describes the graph visualization challenges, elaborates our solution, and evaluates the contributions of GreenMax in the larger context of visual analytics on large small-world graphs. We report the results of two case studies using GreenMax and the results support our claim that we can use GreenMax to locate unexpected features or structures behind a graph.

97 MATHEMATICS AND COMPUTING↗