Search NASA⌕ Search

SEARCH · Search NASA

Results for “large scale network”

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 127 records · Page 7

Engineering large-scale agent-based systems with consensus

The paper presents the consensus method for the development of large-scale agent-based systems. Systems can be developed as networks of knowledge based agents (KBA) which engage in a collaborative problem solving effort. The method provides a comprehensive and integrated approach to the development of this type of system. This includes a systematic analysis of user requirements as well as a structured approach to generating a system design which exhibits the desired functionality. There is a direct correspondence between system requirements and design components. The benefits of this approach are that requirements are traceable into design components and code thus facilitating verification. The use of the consensus method with two major test applications showed it to be successful and also provided valuable insight into problems typically associated with the development of large systems.

Bokma, A.↗

Quantifying Spatial Drought Propagation Potential in North America Using Complex Network Theory

Droughts have a dominant three-dimensional (3-D) spatiotemporal structure typically spanning hundreds of kilometers and often lasting for months to years. Here, we introduced a novel framework to explore the 3-D structure of the evolution of droughts based on network theory concepts. The proposed framework is applied to identify critical source regions responsible for large-scale drought onsets during 1901–2014 for the North American continent using the Standardized Precipitation Evaporation Index (SPEI). We built a spatial network connecting the drought onset timings for the North American continent. Using a spatially weighted network partitioning algorithm, the whole continent is then classified into regional spatial drought networks (RSN), where droughts are more likely to propagate within these regional systems. Finally, a customized network metric was applied to identify locations (source regions) where the drought onsets further propagate to other areas within the regional spatial network. Our results indicated that the West coast, Texas coastal region, and Southeastern Arkansas as major source regions through which atmospheric drought propagates to Western, South Central, and Eastern North America. The formation of drought source regions are due to presence of high pressure ridges and anomalous wind patterns. Furthermore, our results indicate that the drought propagation from these source regions may be due to inadequate moisture transport. The proposed framework can help to develop an early warning detection system for droughts and other spatially extensive extreme events such as heatwaves and floods.

Goutam Konapala↗

Large Scale Deformation of the Western U.S. Cordillera

The overall objective of the work that was conducted was to understand the present-day large-scale deformations of the crust throughout the western United States and in so doing to improve our ability to assess the potential for seismic hazards in this region. To address this problem, we used a large collection of Global Positioning System (GPS) networks which spans the region to precisely quantify present-day large-scale crustal deformations in a single uniform reference frame. Our results can roughly be divided into an analysis of the GPS observations to infer the deformation field across and within the entire plate boundary zone and an investigation of the implications of this deformation field regarding plate boundary dynamics.

Bennett, Richard A.↗

Short–Period Variables in TESS Full–Frame Image Light Curves Identified via Convolutional Neural Networks

The Transiting Exoplanet Survey Satellite (TESS) mission measured light from stars in ∼85% of the sky throughout its 2 yr primary mission, resulting in millions of TESS 30-minute-cadence light curves to analyze in the search for transiting exoplanets. To search this vast data set, we aim to provide an approach that is computationally efficient, produces accurate predictions, and minimizes the required human search effort. We present a convolutional neural network that we train to identify short-period variables. To make a prediction for a given light curve, our network requires no prior target parameters identified using other methods. Our network performs inference on a TESS 30-minute-cadence light curve in ∼5 ms on a single GPU, enabling large-scale archival searches. We present a collection of 14,156 short-period variables identified by our network. The majority of our identified variables fall into two prominent populations, one of close-orbit main-sequence binaries and another of δ Scuti stars. Our neural network model and related code are additionally provided as open-source code for public use and extension.

Convolutional neural networks↗

BOREAS AFM-5 Level-1 Upper Air Network Data

The Boreal Ecosystem-Atmosphere Study (BOREAS) Airborne Fluxes and Meteorology (AFM)-5 team collected and processed data from the numerous radiosonde flights during the project. The goals of the AFM-05 team were to provide large-scale definition of the atmosphere by supplementing the existing Atmospheric Environment Service (AES) aerological network, both temporally and spatially. This data set includes basic upper-air parameters collected from the network of upper-air stations during the 1993, 1994, and 1996 field campaigns over the entire study region. The data are contained in tabular ASCII files. The level-1 upper-air network data are available from the Earth Observing System Data and Information System (EOSDIS) Oak Ridge National Laboratory (ORNL) Distributed Active Archive Center (DAAC). The data files also are available on a CD-ROM (see document number 20010000884).

Barr, Alan↗

Flood hazard studies in Central Texas using orbital and suborbital remote sensing machinery

Central Texas is subject to infrequent, unusually intense rainstorms which cause extremely rapid runoff from drainage basins developed on the deeply dissected limestone and marl bedrock of the Edwards Plateau. One approach to flood hazard evaluation in this area is a parametric model relating flood hydrograph characteristics to quantitative geomorphic properties of the drainage basins. The preliminary model uses multiple regression techniques to predict potential peak flood discharge from basin magnitude, drainage density, and ruggedness number. After mapping small catchment networks from remote sensing imagery, input data for the model are generated by network digitization and analysis by a computer assisted routine of watershed analysis. The study evaluated the network resolution capabilities of the following data formats: (1) large-scale (1:24,000) topographic maps, employing Strahler's "method of v's," (2) standard low altitude black and white aerial photography (1:13,000 and 1:20,000 scales), (3) NASA - generated aerial infrared photography at scales ranging from 1:48,000 to 1:123,000, and (4) Skylab Earth Resources Experiment Package S-190A and S-190B sensors (1:750,000 and 1:500,000 respectively).

Baker, V. R.↗

Real-Time Adaptive Color Segmentation by Neural Networks

Artificial neural networks that would utilize the cascade error projection (CEP) algorithm have been proposed as means of autonomous, real-time, adaptive color segmentation of images that change with time. In the original intended application, such a neural network would be used to analyze digitized color video images of terrain on a remote planet as viewed from an uninhabited spacecraft approaching the planet. During descent toward the surface of the planet, information on the segmentation of the images into differently colored areas would be updated adaptively in real time to capture changes in contrast, brightness, and resolution, all in an effort to identify a safe and scientifically productive landing site and provide control feedback to steer the spacecraft toward that site. Potential terrestrial applications include monitoring images of crops to detect insect invasions and monitoring of buildings and other facilities to detect intruders. The CEP algorithm is reliable and is well suited to implementation in very-large-scale integrated (VLSI) circuitry. It was chosen over other neural-network learning algorithms because it is better suited to realtime learning: It provides a self-evolving neural-network structure, requires fewer iterations to converge and is more tolerant to low resolution (that is, fewer bits) in the quantization of neural-network synaptic weights. Consequently, a CEP neural network learns relatively quickly, and the circuitry needed to implement it is relatively simple. Like other neural networks, a CEP neural network includes an input layer, hidden units, and output units (see figure). As in other neural networks, a CEP network is presented with a succession of input training patterns, giving rise to a set of outputs that are compared with the desired outputs. Also as in other neural networks, the synaptic weights are updated iteratively in an effort to bring the outputs closer to target values. A distinctive feature of the CEP neural network and algorithm is that each update of synaptic weights takes place in conjunction with the addition of another hidden unit, which then remains in place as still other hidden units are added on subsequent iterations. For a given training pattern, the synaptic weight between (1) the inputs and the previously added hidden units and (2) the newly added hidden unit is updated by an amount proportional to the partial derivative of a quadratic error function with respect to the synaptic weight. The synaptic weight between the newly added hidden unit and each output unit is given by a more complex function that involves the errors between the outputs and their target values, the transfer functions (hyperbolic tangents) of the neural units, and the derivatives of the transfer functions.

Duong, Tuan A.↗

An optimization model for the US Air-Traffic System

A systematic approach for monitoring U.S. air traffic was developed in the context of system-wide planning and control. Towards this end, a network optimization model with nonlinear objectives was chosen as the central element in the planning/control system. The network representation was selected because: (1) it provides a comprehensive structure for depicting essential aspects of the air traffic system, (2) it can be solved efficiently for large scale problems, and (3) the design can be easily communicated to non-technical users through computer graphics. Briefly, the network planning models consider the flow of traffic through a graph as the basic structure. Nodes depict locations and time periods for either individual planes or for aggregated groups of airplanes. Arcs define variables as actual airplanes flying through space or as delays across time periods. As such, a special case of the network can be used to model the so called flow control problem. Due to the large number of interacting variables and the difficulty in subdividing the problem into relatively independent subproblems, an integrated model was designed which will depict the entire high level (above 29000 feet) jet route system for the 48 contiguous states in the U.S. As a first step in demonstrating the concept's feasibility a nonlinear risk/cost model was developed for the Indianapolis Airspace. The nonlinear network program --NLPNETG-- was employed in solving the resulting test cases. This optimization program uses the Truncated-Newton method (quadratic approximation) for determining the search direction at each iteration in the nonlinear algorithm. It was shown that aircraft could be re-routed in an optimal fashion whenever traffic congestion increased beyond an acceptable level, as measured by the nonlinear risk function.

Mulvey, J. M.↗

Scale-free Graphs for General Aviation Flight Schedules

In the late 1990s a number of researchers noticed that networks in biology, sociology, and telecommunications exhibited similar characteristics unlike standard random networks. In particular, they found that the cummulative degree distributions of these graphs followed a power law rather than a binomial distribution and that their clustering coefficients tended to a nonzero constant as the number of nodes, n, became large rather than O(1/n). Moreover, these networks shared an important property with traditional random graphs as n becomes large the average shortest path length scales with log n. This latter property has been coined the small-world property. When taken together these three properties small-world, power law, and constant clustering coefficient describe what are now most commonly referred to as scale-free networks. Since 1997 at least six books and over 400 articles have been written about scale-free networks. In this manuscript an overview of the salient characteristics of scale-free networks. Computational experience will be provided for two mechanisms that grow (dynamic) scale-free graphs. Additional computational experience will be given for constructing (static) scale-free graphs via a tabu search optimization approach. Finally, a discussion of potential applications to general aviation networks is given.

Alexandov, Natalia M.↗

The large scale dynamics of the outer heliosphere and the long-term modulation of galactic cosmic rays

The network of cosmic ray observatories reaching across the heliosphere has given new insight into the process of solar modulation, establishing that the decreases occur principally in the outer heliosphere and are produced by interplanetary flow systems; that the hysteresis effects appear to be produced by changes in the rigidity dependence of the diffusion coefficient and that the predicted effects on the cosmic ray gradients associated with the reversal of the solar magnetic field polarity are not observed.

Mcdonald, F. B.↗

A large scale software system for simulation and design optimization of mechanical systems

The concept of an advanced integrated, networked simulation and design system is outlined. Such an advanced system can be developed utilizing existing codes without compromising the integrity and functionality of the system. An example has been used to demonstrate the applicability of the concept of the integrated system outlined here. The development of an integrated system can be done incrementally. Initial capabilities can be developed and implemented without having a detailed design of the global system. Only a conceptual global system must exist. For a fully integrated, user friendly design system, further research is needed in the areas of engineering data bases, distributed data bases, and advanced user interface design.

Dopker, Bernhard↗

Global Optimization via Quadratic Disjunctive Programming for Water Networks Design with Energy Recovery

Generalized disjunctive programming (GDP) models with bilinear and concave constraints, often seen in water network design, are challenging optimization problems. This work proposes quadratic and piecewise linear approximations for nonlinear terms to reformulate GDP models into quadratic GDP (QGDP) models that suitable solvers may solve more efficiently. We illustrate the benefits of the quadratic reformulation with a water treatment network design problem in which nonconvexities arise from bilinear terms in the mixers’ mass balances and concave investment cost functions of treatment units. Given the similarities with water network design problems, we suggest quadratic approximation for the GDP model for the optimal design of a large-scale reverse electrodialysis (RED) process. This power technology can recover energy from salinity differences between by-product streams of the water sector, such as desalination brine mixed with regenerated wastewater effluents. The solver Gurobi excels in handling QGDP problems, but weighing the problem’s precision and tractability balance is crucial. The piecewise linear approximation yields more accurate, yet larger QGDP models that may require longer optimization times in large-scale process synthesis problems.

Water Networks↗

Assessing the Evolving Fragility of the Global Food System

The world food crisis in 2008 highlighted the susceptibility of the global food system to price shocks. Here we use annual staple food production and trade data from 1992-2009 to analyse the changing properties of the global food system. Over the 18-year study period, we show that the global food system is relatively homogeneous (85 of countries have low or marginal food self-sufficiency) and increases in complexity, with the number of global wheat and rice trade connections doubling and trade flows increasing by 42 and 90, respectively. The increased connectivity and flows within these global trade networks suggest that the global food system is vulnerable to systemic disruptions, especially considering the tendency for exporting countries to switch to non-exporting states during times of food scarcity in the global markets. To test this hypothesis, we superimpose continental-scale disruptions on the wheat and rice trade networks. We find greater absolute reductions in global wheat and rice exports along with larger losses in network connectivity as the networks evolve due to disruptions in European wheat and Asian rice production. Importantly, our findings indicate that least developed countries suffer greater import losses in more connected networks through their increased dependence on imports for staple foods (due to these large-scale disturbances): mean (median) wheat losses as percentages of staple food supply are 8.9 (3.8) for 1992-1996, increasing to 11 (5.7) for 20052009. Over the same intervals, rice losses increase from 8.2 (2.2) to 14 (5.2). Our work indicates that policy efforts should focus on balancing the efficiency of international trade (and its associated specialization) with increased resilience of domestic production and global demand diversity.

complex networks↗

Fault tolerance of artificial neural networks with applications in critical systems

This paper investigates the fault tolerance characteristics of time continuous recurrent artificial neural networks (ANN) that can be used to solve optimization problems. The principle of operations and performance of these networks are first illustrated by using well-known model problems like the traveling salesman problem and the assignment problem. The ANNs are then subjected to 13 simultaneous 'stuck at 1' or 'stuck at 0' faults for network sizes of up to 900 'neurons'. The effects of these faults is demonstrated and the cause for the observed fault tolerance is discussed. An application is presented in which a network performs a critical task for a real-time distributed processing system by generating new task allocations during the reconfiguration of the system. The performance degradation of the ANN under the presence of faults is investigated by large-scale simulations, and the potential benefits of delegating a critical task to a fault tolerant network are discussed.

Protzel, Peter W.↗

Launch processing system transition from development to operation

The Launch Processing System has been under development at Kennedy Space Center since 1973. A prototype system was developed and delivered to Marshall Space Flight Center for Solid Rocket Booster checkout in July 1976. The first production hardware arrived in late 1976. The System uses a distributed computer network for command and monitoring and is supported by a dual large scale computer system for 'off line' processing. A high level of automation is anticipated for Shuttle and Payload testing and launch operations to gain the advantages of short turnaround capability, repeatability of operations, and minimization of operations and maintenance (O&M) manpower. Learning how to efficiently apply the system is our current problem. We are searching for more effective ways to convey LPS system performance characteristics from the designer to a large number of users. Once we have done this, we can realize the advantages of LPS system design.

Paul, H. C.↗

Fast Neural Solution Of A Nonlinear Wave Equation

Neural algorithm for simulation of class of nonlinear wave phenomena devised. Numerically solves special one-dimensional case of Korteweg-deVries equation. Intended to be executed rapidly by neural network implemented as charge-coupled-device/charge-injection device, very-large-scale integrated-circuit analog data processor of type described in "CCD/CID Processors Would Offer Greater Precision" (NPO-18972).

Barhen, Jacob↗

Coronal structures deduced from photospheric magnetic field and He I lambda 10830 observations

The National Solar Observatory synoptic program provides an extensive and unique data base of high-resolution full-disk observations of the line-of-sight photospheric magnetic fields and of the He I lambda 10830 equivalent width. These data have been taken nearly daily for more than 21 years since 1974 and provide the opportunity to investigate the behavior of the magnetic fields in the photosphere and those inferred for the corona spanning on the time scales of a day to that of a solar cycle. The intensity of structures observed in He I lambda 10830 are strongly modulated by overlying coronal radiation; areas with low coronal emission are generally brighter in He I lambda 10830, while areas with high coronal emission are darker. For this reason, He I lambda 10830 was selected in the mid-1970's as way to identify and monitor coronal holes, magnetic fields with an open configuration, and the sources of high-speed solar wind streams. The He I lambda 10830 spectroheliograms also show a wide variety of other structures from small-scale, short-lived dark points (less than 30 arc-sec, hours) to the large-scale, long-lived two 'ribbon' flare events that follow the filament eruptions (1000 arc-sec, days). Such structures provide clues about the connections and changes in the large-scale coronal magnetic fields that are rooted in concentrations of magnetic network and active regions in the photosphere. In this paper, what observations of the photospheric magnetic field and He I lambda 10830 can tell us about the short- and long-term evolution of the coronal magnetic fields will be discussed, focussing on the quiet Sun and coronal holes. These data and what we infer from them will be compared with direct observations of the coronal structure from the Yohkoh Soft X-ray Telescope.

Harvey, Karen L.↗

BOREAS AFM-04 Twin Otter Aircraft Flux Data

The BOREAS AFM-5 team collected and processed data from the numerous radiosonde flights during the project. The goals of the AFM-05 team were to provide large-scale definition of the atmosphere by supplementing the existing AES aerological network, both temporally and spatially. This data set includes basic upper-air parameters collected from the network of upper-air stations during the 1993, 1994, and 1996 field campaigns over the entire study region. The data are contained in tabular ASCII files. The data files are available on a CD-ROM (see document number 20010000884) or from the Oak Ridge National Laboratory (ORNL) Distributed Active Archive Center (DAAC).

MacPherson, J. Ian↗