Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “NETWORK ANALYSIS”

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 343 records · Page 19

Near-real-time data transmission during the ICE - Comet Giacobini-Zinner encounter

The data links established between the U.S. and Europe during the September 1985 International Cometary Explorer/Comet Giacobini-Zinner encounter are summarized. The Space Physics Analysis Network (SPAN), which is a link between U.S. universities, research institutes and NASA centers, was responsible for the rapid dissemination and analysis of the data obtained from the encounter. The network was then linked across the Atlantic to support investigators involved in a European experiment on board the spacecraft. It is concluded that SPAN provided ESA personnel with a unique opportunity to experience near-real-time data acquisition. The data transfer was performed successfully, and the experience gained proved useful in assessing ESA's needs for future participation in scientific international networking.

Sanderson, T. R.↗

Concept-based Analysis of Neural Networks via Vision-Language Models

The analysis of vision-based deep neural networks (DNNs) is highly desirable but it is very challenging due to the difficulty of expressing formal specifications for vision tasks and the lack of efficient verification procedures. In this paper, we propose to leverage emerging multimodal, vision-language, foundation models (VLMs) as a lens through which we can reason about vision models. VLMs have been trained on a large body of images accompanied by their textual description, and are thus implicitly aware of high-level, human-understandable concepts describing the images. We describe a logical specification language Con spec designed to facilitate writing specifications in terms of these concepts. To define and formally check Con spec specifications, we build a map between the internal representations of a given vision model and a VLM, leading to an efficient verification procedure of natural-language properties for vision models. We demonstrate our techniques on a ResNet-based classifier trained on the RIVAL-10 dataset using CLIP as the multimodal model.

Large Vision Language Models↗

Combining Flux Balance and Energy Balance Analysis for Large-Scale Metabolic Network: Biochemical Circuit Theory for Analysis of Large-Scale Metabolic Networks

Predicting behavior of large-scale biochemical metabolic networks represents one of the greatest challenges of bioinformatics and computational biology. Approaches, such as flux balance analysis (FBA), that account for the known stoichiometry of the reaction network while avoiding implementation of detailed reaction kinetics are perhaps the most promising tools for the analysis of large complex networks. As a step towards building a complete theory of biochemical circuit analysis, we introduce energy balance analysis (EBA), which compliments the FBA approach by introducing fundamental constraints based on the first and second laws of thermodynamics. Fluxes obtained with EBA are thermodynamically feasible and provide valuable insight into the activation and suppression of biochemical pathways.

Beard, Daniel A.↗

Defining the genetic components of callus formation: A GWAS approach

A characteristic feature of plant cells is the ability to form callus from parenchyma cells in response to biotic and abiotic stimuli. Tissue culture propagation of recalcitrant plant species and genetic engineering for desired phenotypes typically depends on efficient in vitro callus generation. Callus formation is under genetic regulation, and consequently, a molecular understanding of this process underlies successful generation for propagation materials and/or introduction of genetic elements in experimental or industrial applications. Herein, we identified 11 genetic loci significantly associated with callus formation in Populus trichocarpa using a genome-wide association study (GWAS) approach. Eight of the 11 significant gene associations were consistent across biological replications, exceeding a chromosome-wide–log10 (p) = 4.46 [p = 3.47E-05] Bonferroni-adjusted significance threshold. These eight genes were used as hub genes in a high-resolution co-expression network analysis to gain insight into the genome-wide basis of callus formation. A network of positively and negatively co-expressed genes, including several transcription factors, was identified. As proof-of-principle, a transient protoplast assay confirmed the negative regulation of a Chloroplast Nucleoid DNA-binding-related gene (Potri.018G014800) by the LEC2 transcription factor. Many of the candidate genes and co-expressed genes were 1) linked to cell division and cell cycling in plants and 2) showed homology to tumor and cancer-related genes in humans. The GWAS approach based on a high-resolution marker set, and the ability to manipulate targets genes in vitro, provided a catalog of high-confidence genes linked to callus formation that can serve as an important resource for successful manipulation of model and non-model plant species, and likewise, suggests a robust method of discovering common homologous functions across organisms.

59 BASIC BIOLOGICAL SCIENCES↗

Evaluating Space Network (SN) scheduling operations concepts through statistical analysis

The Network Control Center (NCC) currently uses the NCC Data System (NCCDS) to schedule customer spacecraft communication requests for the Space Network (SN). The NCC/Request Oriented Scheduling Engine (NCC/ROSE), which implements an operational concept called flexible scheduling, is being tested as a potential replacement for the NCCDS scheduler in an effort to increase the efficiency of the NCC scheduling operations. This paper describes the high fidelity benchmark tests being conducted on NCC/ROSE, the evaluation techniques used to compare schedules, and the results of the tests. This testing will verify the increases in efficiency and productivity that can help the NCC meet the anticipated scheduling loads well into the next century.

Kwadrat, Carl↗

The Midlatitude Continental Convective Clouds Experiment (MC3E) sounding network: operations, processing and analysis

The Midlatitude Continental Convective Clouds Experiment (MC3E) took place during the spring of 2011 centered in north-central Oklahoma, USA. The main goal of this field campaign was to capture the dynamical and microphysical characteristics of precipitating convective systems in the US Central Plains. A major component of the campaign was a six-site radiosonde array designed to capture the large-scale variability of the atmospheric state with the intent of deriving model forcing data sets. Over the course of the 46-day MC3E campaign, a total of 1362 radiosondes were launched from the enhanced sonde network. This manuscript provides details on the instrumentation used as part of the sounding array, the data processing activities including quality checks and humidity bias corrections and an analysis of the impacts of bias correction and algorithm assumptions on the determination of convective levels and indices. It is found that corrections for known radiosonde humidity biases and assumptions regarding the characteristics of the surface convective parcel result in significant differences in the derived values of convective levels and indices in many soundings. In addition, the impact of including the humidity corrections and quality controls on the thermodynamic profiles that are used in the derivation of a large-scale model forcing data set are investigated. The results show a significant impact on the derived large-scale vertical velocity field illustrating the importance of addressing these humidity biases.

54 ENVIRONMENTAL SCIENCES↗

Subsonic Aircraft With Regression and Neural-Network Approximators Designed

At the NASA Glenn Research Center, NASA Langley Research Center's Flight Optimization System (FLOPS) and the design optimization testbed COMETBOARDS with regression and neural-network-analysis approximators have been coupled to obtain a preliminary aircraft design methodology. For a subsonic aircraft, the optimal design, that is the airframe-engine combination, is obtained by the simulation. The aircraft is powered by two high-bypass-ratio engines with a nominal thrust of about 35,000 lbf. It is to carry 150 passengers at a cruise speed of Mach 0.8 over a range of 3000 n mi and to operate on a 6000-ft runway. The aircraft design utilized a neural network and a regression-approximations-based analysis tool, along with a multioptimizer cascade algorithm that uses sequential linear programming, sequential quadratic programming, the method of feasible directions, and then sequential quadratic programming again. Optimal aircraft weight versus the number of design iterations is shown. The central processing unit (CPU) time to solution is given. It is shown that the regression-method-based analyzer exhibited a smoother convergence pattern than the FLOPS code. The optimum weight obtained by the approximation technique and the FLOPS code differed by 1.3 percent. Prediction by the approximation technique exhibited no error for the aircraft wing area and turbine entry temperature, whereas it was within 2 percent for most other parameters. Cascade strategy was required by FLOPS as well as the approximators. The regression method had a tendency to hug the data points, whereas the neural network exhibited a propensity to follow a mean path. The performance of the neural network and regression methods was considered adequate. It was at about the same level for small, standard, and large models with redundancy ratios (defined as the number of input-output pairs to the number of unknown coefficients) of 14, 28, and 57, respectively. In an SGI octane workstation (Silicon Graphics, Inc., Mountainview, CA), the regression training required a fraction of a CPU second, whereas neural network training was between 1 and 9 min, as given. For a single analysis cycle, the 3-sec CPU time required by the FLOPS code was reduced to milliseconds by the approximators. For design calculations, the time with the FLOPS code was 34 min. It was reduced to 2 sec with the regression method and to 4 min by the neural network technique. The performance of the regression and neural network methods was found to be satisfactory for the analysis and design optimization of the subsonic aircraft.

Patnaik, Surya N.↗

Netostat: analyzing dynamic flow patterns in high-speed networks

Understanding flow traffic patterns in networks, such as the Internet or service provider networks, is crucial to improving their design and building them robustly. However, as networks grow and become more complex, it is increasingly cumbersome and challenging to study how the many flow patterns, sizes and the continually changing source-destination pairs in the network evolve with time. Here, we present Netostat, a visualization-based network analysis tool that uses visual representation and a mathematics framework to study and capture flow patterns, using graph theoretical methods such as clustering, similarity and difference measures. Netostat generates an interactive graph of all traffic patterns in the network, to isolate key elements that can provide insights for traffic engineering. We present results for U.S. and European research networks, ESnet and GEANT, demonstrating network state changes, to identify major flow trends, potential points of failure, and bottlenecks.

97 MATHEMATICS AND COMPUTING↗

NASTRAN analysis of an air storage piping system

The application of NASTRAN to a complex piping design evaluation problem is summarized. Emphasis is placed on structural modeling aspects, problems encountered in modeling and analyzing curved pipe sections, principal results, and relative merits of using NASTRAN as a pipe analysis and design tool. In addition, the piping and manifolding system was analyzed with SNAP (Structural Network Analysis Program). The parallel SNAP study provides a basis for limited comparisons between NASTRAN and SNAP as to solution agreement and computer execution time and costs.

Young, C. P., Jr.↗

Impacts of Maize Domestication and Breeding on Rhizosphere Microbial Community Recruitment from a Nutrient Depleted Agricultural Soil

Abstract Maize domestication and breeding have resulted in drastic and well documented changes in aboveground traits, but belowground effects on root system functioning and rhizosphere microbial communities remain poorly understood, despite their critical importance for nutrient and water acquisition. We investigated the rhizosphere microbial community composition and structure of ten Zea mays accessions along an evolutionary transect (two teosinte, three inbred maize lines, and five modern maize hybrids) grown in nutrient depleted soil from a low input agricultural system. Microbial community analysis revealed significant differences in community composition between soil compartments (proximal vs. distal rhizosphere) and between plant genetic groups (teosinte, inbred, and modern hybrid). Only a small portion of the microbial community was differentially selected across plant genetic groups: 3.7% of prokaryotic community members and 4.9% of fungal community members were significantly associated with a specific plant genetic group. Indicator species analysis showed the greatest differentiation between modern hybrids and the other two plant genetic groups. Co-occurrence network analysis revealed that microbial co-occurrence patterns of the inbred maize lines’ rhizosphere were significantly more similar to those of the teosintes than to the modern hybrids. Our results suggest that advances in hybrid development significantly impacted rhizosphere microbial communities and network assembly.

59 BASIC BIOLOGICAL SCIENCES↗

Transcriptome divergence during leaf development in two contrasting switchgrass (Panicum virgatum L.) cultivars

The genetics and responses to biotic stressors of tetraploid switchgrass (Panicum virgatum L.) lowland cultivar ‘Kanlow’ and upland cultivar Summer are distinct and can be exploited for trait improvement. In general, there is a paucity of data on the basal differences in transcription across tissue developmental times for switchgrass cultivars. Here, the changes in basal and temporal expression of genes related to leaf functions were evaluated for greenhouse grown ‘Kanlow’, and ‘Summer’ plants. Three biological replicates of the 4 th leaf pooled from 15 plants per replicate were harvested at regular intervals beginning from leaf emergence through senescence. Increases and decreases in leaf chlorophyll and N content were similar for both cultivars. Likewise, multidimensional scaling (MDS) analysis indicated both cultivar-independent and cultivar-specific gene expression. Cultivar-independent genes and gene-networks included those associated with leaf function, such as growth/senescence, carbon/nitrogen assimilation, photosynthesis, chlorophyll biosynthesis, and chlorophyll degradation. However, many genes encoding nucleotide-binding leucine rich repeat (NB-LRRs) proteins and wall-bound kinases associated with detecting and responding to environmental signals were differentially expressed. Several of these belonged to unique cultivar-specific gene co-expression networks. Analysis of genomic resequencing data provided several examples of NB-LRRs genes that were not expressed and/or apparently absent in the genomes of Summer plants. It is plausible that cultivar (ecotype)-specific genes and gene-networks could be one of the drivers for the documented differences in responses to leaf-borne pathogens between these two cultivars. Incorporating broad resistance to plant pathogens in elite switchgrass germplasm could improve sustainability of biomass production under low-input conditions.

59 BASIC BIOLOGICAL SCIENCES↗

Incremental k-core decomposition: Algorithms and evaluation

A k-core of a graph is a maximal connected subgraph in which every vertex is connected to at least k vertices in the subgraph. k-core decomposition is often used in large-scale network analysis, such as community detection, protein function prediction, visualization, and solving NP-hard problems on real networks efficiently, like maximal clique finding. In many real-world applications, networks change over time. As a result, it is essential to develop efficient incremental algorithms for dynamic graph data. In this paper, we propose a suite of incremental k-core decomposition algorithms for dynamic graph data. These algorithms locate a small subgraph that is guaranteed to contain the list of vertices whose maximum k-core values have changed and efficiently process this subgraph to update the k-core decomposition. We present incremental algorithms for both insertion and deletion operations, and propose auxiliary vertex state maintenance techniques that can further accelerate these operations. Our results show a significant reduction in runtime compared to non-incremental alternatives. We illustrate the efficiency of our algorithms on different types of real and synthetic graphs, at varying scales. Furthermore, for a graph of 16 million vertices, we observe relative throughputs reaching a million times, relative to the non-incremental algorithms.

97 MATHEMATICS AND COMPUTING↗

NAPAbench 2: A network synthesis algorithm for generating realistic protein-protein interaction (PPI) network families

Comparative network analysis provides effective computational means for gaining novel insights into the structural and functional compositions of biological networks. In recent years, various methods have been developed for biological network alignment, whose main goal is to identify important similarities and critical differences between networks in terms of their topology and composition. A major impediment to advancing network alignment techniques has been the lack of gold-standard benchmarks that can be used for accurate and comprehensive performance assessment of such algorithms. The original NAPAbench (network alignment performance assessment benchmark) was developed to address this problem, and it has been widely utilized by many researchers for the development, evaluation, and comparison of novel network alignment techniques. In this work, we introduce NAPAbench 2—a major update of the original NAPAbench that was introduced in 2012. NAPAbench 2 includes a completely redesigned network synthesis algorithm that can generate protein-protein interaction (PPI) network families whose characteristics closely match those of the latest real PPI networks. Furthermore, the network synthesis algorithm comes with an intuitive GUI that allows users to easily generate PPI network families with an arbitrary number of networks of any size, according to a flexible user-defined phylogeny. In addition, NAPAbench 2 provides updated benchmark datasets—created using the redesigned network synthesis algorithm—which can be used for comprehensive performance assessment of network alignment algorithms and their scalability.

42 ENGINEERING↗

Ocean Acidification Regulates the Activity, Community Structure, and Functional Potential of Heterotrophic Bacterioplankton in an Oligotrophic Gyre

Ocean acidification (OA), a result of increased global carbon dioxide (CO 2 ) emissions, is considered a major threat to marine ecosystems. Its effects on bacterioplankton activity, diversity, and community composition have received considerable attention. Yet, the direct impact of OA on heterotrophic bacterioplankton is often masked by the significant response of phytoplankton due to the close coupling of heterotrophic bacterioplankton and autotrophs. Here we investigated the responses of a heterotrophic bacterioplankton assemblage to high p CO 2 (790-ppm) treatment in warm tropical western Pacific waters by conducting a microcosm experiment in dark for 12 days. Heterotrophic bacterioplankton abundance and production were enhanced by OA over the first 6 days of incubation, while the diversity and species richness were negatively affected. Bacterioplankton community composition in the high p CO 2 treatment changed faster than that in the control. The molecular ecological network analysis showed that the elevated CO 2 changed the overall connections among the bacterial community and resulted in a simple network under high CO 2 condition. Species-specific responses to OA were observed and could be attributed to the different life strategies and to the ability of a given species to adapt to environmental conditions. In addition, high-throughput functional gene array analysis revealed that genes related to carbon and nitrogen cycling were positively affected by acidification. Together, our findings suggest that OA has direct effects on heterotrophic bacterioplankton in a low-latitude warm ocean and may therefore affect global biogeochemical cycles.

54 ENVIRONMENTAL SCIENCES↗

Large-scale proteomic analysis of Alzheimer’s disease brain and cerebrospinal fluid reveals early changes in energy metabolism associated with microglia and astrocyte activation

Our understanding of Alzheimer’s disease (AD) pathophysiology remains incomplete. Here, for this work, we used quantitative mass spectrometry and coexpression network analysis to conduct the largest proteomic study thus far on AD. A protein network module linked to sugar metabolism emerged as one of the modules most significantly associated with AD pathology and cognitive impairment. This module was enriched in AD genetic risk factors and in microglia and astrocyte protein markers associated with an anti-inflammatory state, suggesting that the biological functions it represents serve a protective role in AD. Proteins from this module were elevated in cerebrospinal fluid in early stages of the disease. In this study of >2,000 brains and nearly 400 cerebrospinal fluid samples by quantitative proteomics, we identify proteins and biological processes in AD brains that may serve as therapeutic targets and fluid biomarkers for the disease.

60 APPLIED LIFE SCIENCES↗

Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis

Label Propagation is not only a well-known machine learning algorithm for classification but also an effective method for discovering communities and connected components in networks. We propose a new Direction-optimizing Label Propagation Algorithm (DOLPA) framework that enhances the performance of the standard Label Propagation Algorithm (LPA), increases its scalability, and extends its versatility and application scope. As a central feature, the DOLPA framework relies on the use of frontiers and alternates between label push and label pull operations to attain high performance. It is formulated in such a way that the same basic algorithm can be used for finding communities or connected components in graphs by only changing the objective function used. Additionally, DOLPA has parameters for tuning the processing order of vertices in a graph to reduce the number of edges visited and improve the quality of solution obtained. We present the design and implementation of the enhanced algorithm as well as our shared-memory parallelization of it using OpenMP. We also present an extensive experimental evaluation of our implementations using the LFR benchmark and real-world networks drawn from various domains. Compared with an implementation of LPA for community detection available in a widely used network analysis software, we achieve at most five times the F-Score while maintaining similar runtime for graphs with overlapping communities. We also compare DOLPA against an implementation of the Louvain method for community detection using the same LFR-graphs and show that DOLPA achieves about three times the F-Score at just 10% of the runtime. For connected component decomposition, our algorithm achieves orders of magnitude speedups over the basic LP-based algorithm on large-diameter graphs, up to 13.2× speedup over the Shiloach-Vishkin algorithm, and up to 1.6× speedup over Afforest on an Intel Xeon processor using 40 threads.

97 MATHEMATICS AND COMPUTING↗

Dendritic cells focus CTL responses toward highly conserved and topologically important HIV-1 epitopes

During early HIV-1 infection, immunodominant T cell responses to highly variable epitopes lead to the establishment of immune escape virus variants. Here we assessed a type 1-polarized monocyte-derived dendritic cell (MDC1)-based approach to selectively elicit cytotoxic T lymphocyte (CTL) responses against highly conserved and topologically important HIV-1 epitopes in HIV-1-infected individuals from the Thailand RV254/SEARCH 010 cohort who initiated antiretroviral therapy (ART) during early infection (Fiebig stages I-IV). Autologous MDC1 were used as antigen presenting cells to induce in vitro CTL responses against HIV-1 Gag, Pol, Env, and Nef as determined by flow cytometry and ELISpot assay. Ultra-conserved or topologically important antigens were respectively identified using the Epigraph tool and a structure-based network analysis approach and compared to overlapping peptides spanning the Gag proteome. MDC1 presenting either the overlapping Gag, Epigraph, or Network 14-21mer peptide pools consistently activated and expanded HIV-1-specific T cells to epitopes identified at the 9-13mer peptide level. Interestingly, some CTL responses occurred outside known or expected HLA associations, providing evidence of new HLA-associated CTL epitopes. Comparative analyses demonstrated more sequence conservation among Epigraph antigens but a higher magnitude of CTL responses to Network and Gag peptide groups. Importantly, CTL responses against topologically constrained Gag epitopes contained in both the Network and Gag peptide pools were selectively enhanced in the Network pool-initiated cultures. Our study supports the use of MDC1 as a therapeutic strategy to induce and focus CTL responses toward putative fitness-constrained regions of HIV-1 to prevent immune escape and control HIV-1 infection.

60 APPLIED LIFE SCIENCES↗

Neural Networks for Rapid Design and Analysis

Artificial neural networks have been employed for rapid and efficient dynamics and control analysis of flexible systems. Specifically, feedforward neural networks are designed to approximate nonlinear dynamic components over prescribed input ranges, and are used in simulations as a means to speed up the overall time response analysis process. To capture the recursive nature of dynamic components with artificial neural networks, recurrent networks, which use state feedback with the appropriate number of time delays, as inputs to the networks, are employed. Once properly trained, neural networks can give very good approximations to nonlinear dynamic components, and by their judicious use in simulations, allow the analyst the potential to speed up the analysis process considerably. To illustrate this potential speed up, an existing simulation model of a spacecraft reaction wheel system is executed, first conventionally, and then with an artificial neural network in place.

Sparks, Dean W., Jr.↗