SEARCH · Engineering Papers

Results for “graph sequence”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

141 records · Page 8

All sources NASA NTRS DOE OSTI

DOE OSTI2019

Galaxy morphological classification in deep-wide surveys via unsupervised machine learning

ABSTRACT Galaxy morphology is a fundamental quantity, which is essential not only for the full spectrum of galaxy-evolution studies, but also for a plethora of science in observational cosmology (e.g. as a prior for photometric-redshift measurements and as contextual data for transient light-curve classifications). While a rich literature exists on morphological-classification techniques, the unprecedented data volumes, coupled, in some cases, with the short cadences of forthcoming ‘Big-Data’ surveys (e.g. from the LSST), present novel challenges for this field. Large data volumes make such data sets intractable for visual inspection (even via massively distributed platforms like Galaxy Zoo), while short cadences make it difficult to employ techniques like supervised machine learning, since it may be impractical to repeatedly produce training sets on short time-scales. Unsupervised machine learning, which does not require training sets, is ideally suited to the morphological analysis of new and forthcoming surveys. Here, we employ an algorithm that performs clustering of graph representations, in order to group image patches with similar visual properties and objects constructed from those patches, like galaxies. We implement the algorithm on the Hyper-Suprime-Cam Subaru-Strategic-Program Ultra-Deep survey, to autonomously reduce the galaxy population to a small number (160) of ‘morphological clusters’, populated by galaxies with similar morphologies, which are then benchmarked using visual inspection. The morphological classifications (which we release publicly) exhibit a high level of purity, and reproduce known trends in key galaxy properties as a function of morphological type at z < 1 (e.g. stellar-mass functions, rest-frame colours, and the position of galaxies on the star-formation main sequence). Our study demonstrates the power of unsupervised machine learning in performing accurate morphological analysis, which will become indispensable in this new era of deep-wide surveys.

Martin, G.↗

DOE OSTI2019

PaKman: Scalable Assembly of Large Genomes on Distributed Memory Machines

De novo genome assembly is a fundamental problem in the field of bioinformatics, that aims to assemble the DNA sequence of an unknown genome from numerous short DNA fragments (aka reads) obtained from it. With the advent of high-throughput sequencing technologies, billions of reads can be generated in a matter of hours, necessitating efficient parallelization of the assembly process. While multiple parallel solutions have been proposed in the past, conducting a large- scale assembly at scale remains a challenging problem because of the inherent complexities associated with data movement, and irregular access footprints of memory and I/O operations. In this paper, we present a novel algorithm, called PaKman, to address the problem of performing large-scale genome assemblies on a distributed memory parallel computer. Our approach focuses on improving performance through a combination of novel data structures and algorithmic strategies for reducing the communication and I/O footprint during the assembly process. A key aspect of our algorithm is its graph data structure, which comprises fat nodes (or what we call "macro-nodes") that reduce the communication burden during contig generation. We present an extensive performance and qualitative evaluation of our algorithm, including comparisons to other state-of-the-art parallel assemblers. Our results demonstrate the ability to achieve near-linear speedups on up to 8K cores (tested); outperform state-of-the-art distributed memory and shared memory tools in performance while delivering comparable (if not better) quality; and reduce time to solution significantly. For instance, PaKman is able to complete an assembly of the full human genome in just over a minute on 8K cores.

Ghosh, Priyanka↗

DOE OSTI2018

Quickest Detection for Changes in Maximal kNN Coherence of Random Matrices

This paper addresses the problem of quickest detection of a change in the maximal coherence between columns of a n p random matrix based on a sequence of matrix observations having a single unknown change point. The random matrix is assumed to have identically distributed rows and the maximal coherence is defined as the largest of the ( 2 p) correlation coefficients associated with any row. Likewise the κ nearest neighbor (kNN) coherence is defined as the κ-th largest of these correlation coefficients. The forms of the preand postchange distributions of the observed matrices are assumed to belong to the family of elliptically contoured densities with sparse dispersion matrices but are otherwise unknown. A nonparametric stopping rule is proposed that is based on the maximal kNN sample coherence between columns of each observed random matrix. This is a summary statistic that is related to a test of existence of a hub vertex in a sample correlation graph having degree at least κ. Performance bounds on the delay and false alarm performance of the proposed stopping rule are obtained in the purely high-dimensional regime where p → ∞ and n is fixed. When the prechange dispersion matrix is diagonal it is shown that, among all functions of the proposed summary statistic, the proposed stopping rule is asymptotically optimal under a minimax quickest change detection model as the stopping threshold approaches infinity. Furthermore, the theory developed also applies to sequential hypothesis testing and fixed sample size tests.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

DOE OSTI2023

Rapid Computational Identification of Therapeutic Targets for Pathogens

Biological threats continue to persist and evolve as an important challenge to national security. There are multiple ways in which novel viral pathogens could emerge to pose a serious threat to human health. This project developed a pathogen target identification tool that can rapidly respond to a novel or emerging viral biological threat. A set of computational tools were developed that provide detailed information on the newly sequenced genes, their protein products and the drug target sites for the proteins that are best suited for biological countermeasure development. Three key innovations were developed in the project. 1) Development of a new extensive database of protein pocket structures with structure-based search algorithms to rapidly link novel protein targets with the complete collection of previously experimentally solved protein structures. 2) A novel clustering pipeline was introduced to group matching structures and associated small-molecule binding ligands into a consensus protein pocket with the associated small-molecule chemotypes predicted to fit in the pocket site. The matching experimentally solved structures were used to inform the value of different target sites. 3) Where there are viral protein targets with pockets structurally matched to similar human proteins, a biological knowledge graph, which links molecular interactions with human disease, was used to further assess the potential negative impact of a viral protein target with similarities to human proteins that could have important off target side effects. In total, the project produced a new resource for rapid and detailed assessment of promising targets for countermeasures, reflecting the ongoing wet lab, clinical, and computational data being collected. These capabilities will improve the ability to respond to a biological threat in multiple domains.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2024

Fox Trails

1. This software utilizes python pandas to pull data from P6 databases or XER files. The software transforms the datasets into multiple main tables by joining, filtering, iteratively flattening hierarchical structured data, and pivoting datasets to give simple flat output tables. The activity table includes all of the information related to an activity including activity codes, global, EPS, and project codes, UDFs, and WBS information as separate columns. This includes the code id, code value and sequence number for all levels in hierarchical codes. The resource table is similar to the activity table and includes all of the information related to resources on activities including UPFs and resource codes. The resource time phased table takes the resource information and time phases it for the budget, forecast, late, and actual dates/units/costs that closely matches P6's user interface's values as it implements the resource curve and calendars. The wbs table contains the WBS structure broken out by levels and includes UDFs, codes, and notebook topics. The final P6 data table is the relationships table which simply contains the relationships. 2. When a user updates the tool with data (via giving it P6 project names with database username/password information or XER files) the system creates the data in #1, then creates a networkx graph with the activity data imbedded in the node data and the relationships added as edges. Each edge also has it's float calculated (working time distance between the predecessor and successor) and attached to the edge. Activities are also tagged as a potential start of a path based on their constraints, constraint dates, remaining start date, and activity status. When a user enters an activity ID into the UI, it runs a shortest path calculation on the network graph between each node tagged as potential start to the entered activity id based on the float tagged on the edge. Each path returned by the algorithm contains all of the nodes on the path in order, as well as the total float of the edges that make the path. This data is then collected and returned to the user in the form of a gantt chart with groupings for each path that includes the total float for each group. 3. Similar to 2, if the user passes through a reference dataset each activity set in the path is checked to see if it had a path in the reference dataset, if that path was the primary path between the start and end activities, and what has changed regarding logic and durations. These changes are color coded and summarized before sent to the user to be displayed by the UI for simple discovery. 4. Utilizing the data from #1, the user can submit desired grouping code(s) and filters to the system. The system will then pull the activities, resources, and relationships and create a gantt chart based on the groupings sent and filtered based on the filters sent. 5. The system will produce a gantt chart in a similar method to #4, but allows interactivity with the data. As the user interacts with the gantt chart, the software captures the changes and stores it with the user making the change so that project controls and implement those changes in P6.

Fox, Ben↗

DOE OSTI2020

NCBI’s Virus Discovery Codeathon: Building “FIVE” —The Federated Index of Viral Experiments API Index

Viruses represent important test cases for data federation due to their genome size and the rapid increase in sequence data in publicly available databases. However, some consequences of previously decentralized (unfederated) data are lack of consensus or comparisons between feature annotations. Unifying or displaying alternative annotations should be a priority both for communities with robust entry representation and for nascent communities with burgeoning data sources. To this end, during this three-day continuation of the Virus Hunting Toolkit codeathon series (VHT-2), a new integrated and federated viral index was elaborated. This Federated Index of Viral Experiments (FIVE) integrates pre-existing and novel functional and taxonomy annotations and virus–host pairings. Variability in the context of viral genomic diversity is often overlooked in virus databases. As a proof-of-concept, FIVE was the first attempt to include viral genome variation for HIV, the most well-studied human pathogen, through viral genome diversity graphs. As per the publication of this manuscript, FIVE is the first implementation of a virus-specific federated index of such scope. FIVE is coded in BigQuery for optimal access of large quantities of data and is publicly accessible. Many projects of database or index federation fail to provide easier alternatives to access or query information. To this end, a Python API query system was developed to enhance the accessibility of FIVE.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2024

Graph-learning approach to combine multiresolution seismic velocity models

SUMMARY The resolution of velocity models obtained by tomography varies due to multiple factors and variables, such as the inversion approach, ray coverage, data quality, etc. Combining velocity models with different resolutions can enable more accurate ground motion simulations. Toward this goal, we present a novel methodology to fuse multiresolution seismic velocity maps with probabilistic graphical models (PGMs). The PGMs provide segmentation results, corresponding to various velocity intervals, in seismic velocity models with different resolutions. Further, by considering physical information (such as ray path density), we introduce physics-informed probabilistic graphical models (PIPGMs). These models provide data-driven relations between subdomains with low (LR) and high (HR) resolutions. Transferring (segmented) distribution information from the HR regions enhances the details in the LR regions by solving a maximum likelihood problem with prior knowledge from HR models. When updating areas bordering HR and LR regions, a patch-scanning policy is adopted to consider local patterns and avoid sharp boundaries. To evaluate the efficacy of the proposed PGM fusion method, we tested the fusion approach on both a synthetic checkerboard model and a fault zone structure imaged from the 2019 Ridgecrest, CA, earthquake sequence. The Ridgecrest fault zone image consists of a shallow (top 1 km) high-resolution shear-wave velocity model obtained from ambient noise tomography, which is embedded into the coarser Statewide California Earthquake Center Community Velocity Model version S4.26-M01. The model efficacy is underscored by the deviation between observed and calculated traveltimes along the boundaries between HR and LR regions, 38 per cent less than obtained by conventional Gaussian interpolation. The proposed PGM fusion method can merge any gridded multiresolution velocity model, a valuable tool for computational seismology and ground motion estimation.

Geochemistry & Geophysics↗

DOE OSTI2020

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↗

DOE OSTI2024

Automated Generation of Weather and Climate Analysis Products

Wind roses are an important part to site operations as they depict the wind speed and direction percentage over a time period. In this project, I automated the production of wind roses for SRS meteorological towers. I developed a script to sequence through the dataset by period and create a wind rose for each of those period sets. Graphics were generated for every 4-hour period of the day, for each of the 4 heights of the instruments, for every half of each month. A 10-year climatological period consisted of wind speed and directions measurements at 15-minute intervals. We used the years 2014-2024 as the wind instruments on the tower were upgraded to sonic anemometers in early 2014. I then compared these wind roses to those from a previous study done in 2003 to analyze the differences and similarities in the wind patterns. The wind roses are also used to understand environmental transport conditions at SRS. When comparing the different heights of the anemometers to the 2003 report, there is a similarity in the fact that the direction is relatively the same across the levels, with the wind speeds increasing as you get higher in the air. When comparing the season of our graphs against the 2003 report, we noticed that the winter and summer months appear to have very similar wind directions. However, in the spring we noticed that there were more southerly winds compared to the 2003 report which had more westerly winds. Finally, in the fall months, we noticed that there was a higher percentage of northeasterly winds, while the 2003 report showed more southeasterly winds. We can use these summaries to estimate the directional dependence of dose that the surrounding areas receive throughout the year according to time of day.

47 OTHER INSTRUMENTATION↗

DOE OSTI2024

GraphCH: A Deep Framework for Assessing Cyber-Human Aspects in Insider Threat Detection

Insider threat is one of the most damaging cyber attacks that could cause the loss of intellectual property and enterprise data security breaches. Action sequence data such as host logs are used to investigate such threats and develop anomaly-based AI detectors. However, insider threat actions are similar to legitimate user activities, causing AI detectors to fail and suffer from high false alarm rates. Therefore, user cyber activity logs are inadequate to fully unfold insider threats. In this study, we adopt human psychological principles of risk-taking and impulsiveness along with host data to assess the influence and usefulness of human behavioral aspects in insider threat detection. Here, we hypothesize that individuals' impulsive and risk-taking behavior correlates with cyberspace activities. To validate our hypothesis, we conducted an IRB-approved study recruiting 35 participants who work in a large U.S. university and collected their cyber and psychological data for 90 days. Host and human-behavioral data analysis and mapping indicate that impulsive and risk-taking users trigger more system errors causing (un)intentional insider threats and are susceptible to attackers' social engineering and cognitive hacking. Utilizing cyber-human aspects, we introduce a Cyber-Human Graph Neural Network (GNN) based framework GraphCH to identify abnormal user behaviors and detect insider threats.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Automated detection of double nuclei galaxies using GOTHIC and the discovery of a large sample of dual AGN

We present a novel algorithm to detect double nuclei galaxies (DNG) called Gothic (Graph-bOosTed iterated HIll Climbing) – that detects whether a given image of a galaxy has two or more closely separated nuclei. Our aim is to test for the presence of dual/multiple active galactic nuclei (AGN) in galaxies that visually represent a DNG. Although galaxy mergers are common, the detection of dual AGN is rare. Their detection is very important as they help us understand the formation of supermassive black hole (SMBH) binaries, SMBH growth and AGN feedback effects in multiple nuclei systems. There is thus a need for an algorithm to do a systematic survey of existing imaging data for the discovery of DNGs and dual AGNs. We have tested Gothic on an established sample of DNGs with a 100 per cent detection rate and subsequently conducted a blind search of 1 million SDSS DR16 galaxies (with spectroscopic data available) lying in the redshift range of z = 0 to 0.75. From the list of candidate DNGs found, we have detected 159 dual AGNs, of which 2 are triple AGN systems. Our results show that dual AGNs are not common, and triple AGN even rarer. The colour (u–r) magnitude plots of the DNGs indicate that star formation is quenched as the nuclei come closer and as the AGN fraction increases. The quenching is especially prominent for dual/triple AGN galaxies that lie at the extreme end of the red sequence.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2021

Bacterial diversity dynamics in microbial consortia selected for lignin utilization

Lignin is nature’s largest source of phenolic compounds. Its recalcitrance to enzymatic conversion is still a limiting step to increase the value of lignin. Although bacteria are able to degrade lignin in nature, most studies have focused on lignin degradation by fungi. To understand which bacteria are able to use lignin as the sole carbon source, natural selection over time was used to obtain enriched microbial consortia over a 12-week period. The source of microorganisms to establish these microbial consortia were commercial and backyard compost soils. Cultivation occurred at two different temperatures, 30°C and 37°C, in defined culture media containing either Kraft lignin or alkaline-extracted lignin as carbon source. iTag DNA sequencing of bacterial 16S rDNA gene was performed for each of the consortia at six timepoints (passages). The initial bacterial richness and diversity of backyard compost soil consortia was greater than that of commercial soil consortia, and both parameters decreased after the enrichment protocol, corroborating that selection was occurring. Bacterial consortia composition tended to stabilize from the fourth passage on. After the enrichment protocol, Firmicutes phylum bacteria were predominant when lignin extracted by alkaline method was used as a carbon source, whereas Proteobacteria were predominant when Kraft lignin was used. Bray-Curtis dissimilarity calculations at genus level, visualized using NMDS plots, showed that the type of lignin used as a carbon source contributed more to differentiate the bacterial consortia than the variable temperature. The main known bacterial genera selected to use lignin as a carbon source were Altererythrobacter , Aminobacter , Bacillus , Burkholderia , Lysinibacillus , Microvirga , Mycobacterium , Ochrobactrum , Paenibacillus , Pseudomonas , Pseudoxanthomonas , Rhizobiales and Sphingobium . These selected bacterial genera can be of particular interest for studying lignin degradation and utilization, as well as for lignin-related biotechnology applications.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2025

RhizoGrid Indexed Sorghum Rhizosphere Multi-Omics

PerCon SFA project data dentification of spatially resolved biomarkers of drought in Sorghum bicolor rhizosphere molecular-microbe interactions using a novel root cartography "RhizoGrid" system for sampling plants under drought and control conditions across 10 equally sized root zone environments (4 quadrants each). Each quadrant was sampled and processed for 16S amplicon, metabolomics, and X-ray computed tomography (XCT). Data download includes experimental metadata and results files for 16S rRNA sequence analysis of microbial community assembly (processed data files), liquid chromatography mass spectrometry (LC-MS) metabolomics analysis of microbial community root exudates (processed data files), X-ray computed tomography (XCT) spatial gradient analysis (raw and processed data files) of microbial community composition, and related computational modeling outputs.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2015

A MULTI-WAVELENGTH POLARIMETRIC STUDY OF THE BLAZAR CTA 102 DURING A GAMMA-RAY FLARE IN 2012

We perform a multi-wavelength polarimetric study of the quasar CTA 102 during an extraordinarily bright γ-ray outburst detected by the Fermi Large Area Telescope in 2012 September–October when the source reached a flux of F{sub >100} {sub MeV} = 5.2 ± 0.4 × 10{sup −6} photons cm{sup −2} s{sup −1}. At the same time, the source displayed an unprecedented optical and near-infrared (near-IR) outburst. We study the evolution of the parsec-scale jet with ultra-high angular resolution through a sequence of 80 total and polarized intensity Very Long Baseline Array images at 43 GHz, covering the observing period from 2007 June to 2014 June. We find that the γ-ray outburst is coincident with flares at all the other frequencies and is related to the passage of a new superluminal knot through the radio core. The powerful γ-ray emission is associated with a change in direction of the jet, which became oriented more closely to our line of sight (θ ∼ 1.°2) during the ejection of the knot and the γ-ray outburst. During the flare, the optical polarized emission displays intra-day variability and a clear clockwise rotation of electric vector position angles (EVPAs), which we associate with the path followed by the knot as it moves along helical magnetic field lines, although a random walk of the EVPA caused by a turbulent magnetic field cannot be ruled out. We locate the γ-ray outburst a short distance downstream of the radio core, parsecs from the black hole. This suggests that synchrotron self-Compton scattering of NIR to ultraviolet photons is the probable mechanism for the γ-ray production.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2022

PCP consensus protein/peptide alphavirus antigens stimulate broad spectrum neutralizing antibodies

Vaccines based on proteins and peptides may be safer and if calculated based on many sequences, more broad-spectrum than those designed based on single strains. Physicochemical Property Consensus (PCP con ) alphavirus (AV) antigens from the B-domain of the E2 envelope protein were designed, synthesized recombinantly and shown to be immunogenic (i.e. sera after inoculation detected the antigen in dotspots and ELISA). Antibodies in sera after inoculation with B-region antigens based on individual AV species (eastern or Venezuelan equine encephalitis (EEEV con , VEEV con ), or chikungunya (CHIKV con ) bound only their cognate protein, while those designed against multiple species (Mosaik con and EVC con ) recognized all three serotype specific antigens. The VEEV con and EEEV con sera only showed antiviral activity against their related strains (in plaque reduction neutralization assays (PRNT 50/80 ). Peptides designed to surface exposed areas of the E2-A-domain of CHIKV con were added to CHIKV con inocula to provide anti-CHIKV antibodies. EVC con , based on three different alphavirus species, combined with E2-A-domain peptides from AllAV con , a PCPcon of 24 diverse AV, generated broad spectrum, antiviral antibodies against VEEV, EEEV and CHIKV, AV with less than 35% amino acid identity to each other (>65% diversity). This is a promising start to a molecularly defined vaccine against all AV. A further study with these antigens can illuminate what areas are most important for a robust immune response, resistant to mutations in rapidly evolving viruses. The validated computational methods can also be used to design broad spectrum antigens against many other pathogen families.

59 BASIC BIOLOGICAL SCIENCES↗