Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm selection”

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 901 records · Page 50

Multi-Area Distribution System State Estimation Using Decentralized Physics-Aware Neural Networks

The development of active distribution grids requires more accurate and lower computational cost state estimation. In this paper, the authors investigate a decentralized learning-based distribution system state estimation (DSSE) approach for large distribution grids. The proposed approach decomposes the feeder-level DSSE into subarea-level estimation problems that can be solved independently. The proposed method is decentralized pruned physics-aware neural network (D-P2N2). The physical grid topology is used to parsimoniously design the connections between different hidden layers of the D-P2N2. Monte Carlo simulations based on one-year of load consumption data collected from smart meters for a three-phase distribution system power flow are developed to generate the measurement and voltage state data. The IEEE 123-node system is selected as the test network to benchmark the proposed algorithm against the classic weighted least squares and state-of-the-art learning-based DSSE approaches. Numerical results show that the D-P2N2 outperforms the state-of-the-art methods in terms of estimation accuracy and computational efficiency.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Integrated Land Suitability Assessment for Depots Siting in a Sustainable Biomass Supply Chain

A sustainable biomass supply chain would require not only an effective and fluid transportation system with a reduced carbon footprint and costs, but also good soil characteristics ensuring durable biomass feedstock presence. Unlike existing approaches that fail to account for ecological factors, this work integrates ecological as well as economic factors for developing sustainable supply chain development. For feedstock to be sustainably supplied, it necessitates adequate environmental conditions, which need to be captured in supply chain analysis. Using geospatial data and heuristics, we present an integrated framework that models biomass production suitability, capturing the economic aspect via transportation network analysis and the environmental aspect via ecological indicators. Production suitability is estimated using scores, considering both ecological factors and road transportation networks. These factors include land cover/crop rotation, slope, soil properties (productivity, soil texture, and erodibility factor) and water availability. This scoring determines the spatial distribution of depots with priority to fields scoring the highest. Two methods for depot selection are presented using graph theory and a clustering algorithm to benefit from contextualized insights from both and potentially gain a more comprehensive understanding of biomass supply chain designs. Graph theory, via the clustering coefficient, helps determine dense areas in the network and indicate the most appropriate location for a depot. Clustering algorithm, via K-means, helps form clusters and determine the depot location at the center of these clusters. An application of this innovative concept is performed on a case study in the US South Atlantic, in the Piedmont region, determining distance traveled and depot locations, with implications on supply chain design. The findings from this study show that a more decentralized depot-based supply chain design with 3depots, obtained using the graph theory method, can be more economical and environmentally friendly compared to a design obtained from the clustering algorithm method with 2 depots. In the former, the distance from fields to depots totals 801,031,476 miles, while in the latter, it adds up to 1,037,606,072 miles, which represents about 30% more distance covered for feedstock transportation.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Bayesian performance evaluation of evapotranspiration models based on eddy covariance systems in an arid region

Abstract. Evapotranspiration (ET) is a major component of the land surface processinvolved in energy fluxes and energy balance, especially in the hydrologicalcycle of agricultural ecosystems. While many models have been developed aspowerful tools to simulate ET, there is no agreement on which model bestdescribes the loss of water to the atmosphere. This study focuses on twoaspects, evaluating the performance of four widely used ET models andidentifying parameters, and the physical mechanisms that havesignificant impacts on the model performance. The four tested models arethe Shuttleworth–Wallace (SW) model, Penman–Monteith (PM) model,Priestley–Taylor and Flint–Childs (PT–FC) model, and advection–aridity (AA)model. By incorporating the mathematically rigorous thermodynamicintegration algorithm, the Bayesian model evidence (BME) approach is adoptedto select the optimal model with half-hourly ET observations obtained at aspring maize field in an arid region. Our results reveal that the SW model has thebest performance, and the extinction coefficient is not merely partitioningthe total available energy into the canopy and surface but also includingthe energy imbalance correction. The extinction coefficient is wellconstrained in the SW model and poorly constrained in the PM model but notconsidered in PT–FC and AA models. This is one of the main reasons that theSW model outperforms the other models. Meanwhile, the good fitting of SWmodel to observations can counterbalance its higher complexity. In addition,the detailed analysis of the discrepancies between observations and modelsimulations during the crop growth season indicate that explicit treatmentof energy imbalance and energy interaction will be the primary way offurther improving ET model performance.

54 ENVIRONMENTAL SCIENCES↗

Application of modern control theory to the design of optimum aircraft controllers

A procedure is described for synthesis of optimal aircraft control systems by application of the concepts of optimal control theory to time-invariant linear systems with quadratic performance criteria. Essential in this synthesis procedure is the solution of the Riccati matrix equation which results in a constant linear feedback control law for an output regulator which maintains a plant in an equilibrium in the presence of impulse disturbances. An algorithm is derived for designing maneuverable output regulators with selected state variables for feedback.

Power, L. J.↗

Retrieval of Geophysical Parameters From Radiometric Data

Rapid linear algorithm retrieves meteorological parameters from microwave radiometric data. Versatile 2-step, multiple-linear-regression algorithm examines all possible subsets of available channels and selects optimum subset for retrieving given geophysical or meteorological parameter.

Pandey, P. C.↗

A statistical correlation method for the retrieval of atmospheric moisture profiles by microwave radiometry

A statistical correlation technique is applied to the retrieval of vertical moisture profiles under clear-sky conditions from down-looking radiometric measurements of atmospheric radiation at microwave wavelengths. For a given set of channels, the method selects the optimum radiometric channels for estimating water vapor at specific pressure levels between the surface and 300 mb. The water vapor mixing ratio at these pressure levels is then calculated from a linear combination of the selected channel brightness temperatures. To test its validity the algorithm was applied, in a numerical experiment, to fifty independent tropical radiosondes. The rms absolute deviation of the estimated moisture profiles from the actual profiles was comparable to that obtained using an iterative retrieval method reported earlier. The statistical method, however, requires several orders of magnitude less computer time than the iterative method; it is suitable for high speed processing of large amounts of data.

Kakar, R. K.↗

Space-Subdivision Algorithm for Abstract Trajectories

Computational overhead in testing links between nodes reduced. Computationally efficient algorithm facilitates subdivision of n-dimensional spaces during selection, testing, or optimization of trajectories in those spaces. Reduces cost of computation in such diverse problems as scheduling of interrelated events to avoid conflicts, devising efficient production-line layouts and operating schedules, routing telephone calls, and analyzing the motions of gas particles.

Lyon, Douglas K.↗

Algorithm For Solution Of Subset-Regression Problems

Reliable and flexible algorithm for solution of subset-regression problem performs QR decomposition with new column-pivoting strategy, enables selection of subset directly from originally defined regression parameters. This feature, in combination with number of extensions, makes algorithm very flexible for use in analysis of subset-regression problems in which parameters have physical meanings. Also extended to enable joint processing of columns contaminated by noise with those free of noise, without using scaling techniques.

Verhaegen, Michel↗

Determination of coronal magnetic fields from vector magnetograms

The determination of coronal magnetic fields from vector magnetograms, including the development and application of algorithms to determine force-free coronal fields above selected observations of active regions is studied. Two additional active regions were selected and analyzed. The restriction of periodicity in the 3-D code which is used to determine the coronal field was removed giving the new code variable mesh spacing and is thus able to provide a more realistic description of coronal fields. The NOAA active region AR5747 of 20 Oct. 1989 was studied. A brief account of progress during the research performed is reported.

Mikic, Zoran↗

Determination of coronal magnetic fields from vector magnetograms

This report covers technical progress during the second year of the contract entitled 'Determination of Coronal Magnetic Fields from Vector Magnetograms,' NASW-4728, between NASA and Science Applications International Corporation, and covers the period January 1, 1993 to December 31, 1993. Under this contract SAIC has conducted research into the determination of coronal magnetic fields from vector magnetograms, including the development and application of algorithms to determine force-free coronal fields above selected observations of active regions. The contract began on June 30, 1992 and has a completion date of December 31, 1994. This contract is a continuation of work started in a previous contract, NASW-4571, which covered the period November 15, 1990 to December 14, 1991. During this second year we have concentrated on studying additional active regions and in using the estimated coronal magnetic fields to compare to coronal features inferred from observations.

Mikic, Zoran↗

Minutes of TOPEX/POSEIDON Science Working Team Meeting and Ocean Tides Workshop

This third TOPEX/POSEIDON Science Working Team meeting was held on December 4, 1994 to review progress in defining ocean tide models, precision Earth orbits, and various science algorithms. A related workshop on ocean tides convened to select the best models to be used by scientists in the Geophysical Data Records.

Fu, Lee-Lueng↗

A Two-Wheel Observing Mode for the MAP Spacecraft

The Microwave Anisotropy Probe (MAP) is a follow-on to the Differential Microwave Radiometer (DMR) instrument on the Cosmic Background Explorer (COBE). Due to the MAP project's limited mass, power, and budget, a traditional reliability concept including fully redundant components was not feasible. The MAP design employs selective hardware redundancy, along with backup software modes and algorithms, to improve the odds of mission success. This paper describes the effort to develop a backup control mode, known as Observing II, that will allow the MAP science mission to continue in the event of a failure of one of its three reaction wheel assemblies. This backup science mode requires a change from MAP's nominal zero-momentum control system to a momentum-bias system. In this system, existing thruster-based control modes are used to establish a momentum bias about the sun line sufficient to spin the spacecraft up to the desired scan rate. Natural spacecraft dynamics exhibits spin and nutation similar to the nominal MAP science mode with different relative rotation rates, so the two reaction wheels are used to establish and maintain the desired nutation angle from the sun line. Detailed descriptions of the ObservingII control algorithm and simulation results will be presented, along with the operational considerations of performing the rest of MAP's necessary functions with only two wheels.

Starin, Scott R.↗

Restoring Redundancy to the MAP Propulsion System

The Microwave Anisotropy Probe (MAP) is a follow-on to the Differential Microwave Radiometer (DMR) instrument on the Cosmic Background Explorer (COBE). Due to the MAP project's limited mass, power, and financial resources, a traditional reliability concept including fully redundant components was not feasible. The MAP design employs selective hardware redundancy, along with backup software modes and algorithms, to improve the odds of mission success. In particular, MAP's propulsion system, which is used for orbit maneuvers and momentum management, uses eight thrusters positioned and oriented in such a way that its thruster-based attitude control modes can maintain three-axis attitude control in the event of the failure of any one thruster.

O'Donnell, James R., Jr.↗

Interpretable Machine Learning for Molecular Biosignatures: a Novel Single-Sample Feature Importance Method That Is Sensitive To Statistical Interactions

Isotope ratio mass spectrometry (IRMS) of volatiles (e.g., CO 2 ) promises to be a powerful tool for potential biosignature detection for future missions to ocean worlds (OW) such as Europa and Enceladus. Machine learning (ML) methods for IRMS data could enable science autonomy by onboard prediction of seawater chemistry and biosignature presence. However, ML models are likely to be complex and involve statistical interactions between features (variables), which can make predictions seem opaque and enigmatic. For ML predictions as significant as extraterrestrial biosignatures, we must place extraordinary confidence in models. It is therefore essential that these models make interpretable predictions (i.e., human-understandable) and include false-prediction diagnostics. We achieve high accuracy and interpretability in ML biosignature and seawater chemistry models for OW through a nearest-neighbors feature selection tool that detects statistical interactions between predictors, constructs interaction networks for visualization of selected features working together to make a prediction, and reports single-sample feature importance scores for false-detection diagnostics. Here we develop a novel single-sample nearest-neighbors projected distance regression(ssNPDR) feature selection method that improves upon existing single-sample algorithms through the inclusion of statistical interactions while providing false-prediction diagnostics for ML models.

geochemistry↗

A dataflow analysis tool for parallel processing of algorithms

A graph-theoretic design process and software tool is presented for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described using a dataflow graph and are intended to be executed repetitively on a set of identical parallel processors. Typical applications include signal processing and control law problems. Graph analysis techniques are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool is shown to facilitate the application of the design process to a given problem.

Jones, Robert L., III↗

Improving Search Properties in Genetic Programming

With the advancing computer processing capabilities, practical computer applications are mostly limited by the amount of human programming required to accomplish a specific task. This necessary human participation creates many problems, such as dramatically increased cost. To alleviate the problem, computers must become more autonomous. In other words, computers must be capable to program/reprogram themselves to adapt to changing environments/tasks/demands/domains. Evolutionary computation offers potential means, but it must be advanced beyond its current practical limitations. Evolutionary algorithms model nature. They maintain a population of structures representing potential solutions to the problem at hand. These structures undergo a simulated evolution by means of mutation, crossover, and a Darwinian selective pressure. Genetic programming (GP) is the most promising example of an evolutionary algorithm. In GP, the structures that evolve are trees, which is a dramatic departure from previously used representations such as strings in genetic algorithms. The space of potential trees is defined by means of their elements: functions, which label internal nodes, and terminals, which label leaves. By attaching semantic interpretation to those elements, trees can be interpreted as computer programs (given an interpreter), evolved architectures, etc. JSC has begun exploring GP as a potential tool for its long-term project on evolving dextrous robotic capabilities. Last year we identified representation redundancies as the primary source of inefficiency in GP. Subsequently, we proposed a method to use problem constraints to reduce those redundancies, effectively reducing GP complexity. This method was implemented afterwards at the University of Missouri. This summer, we have evaluated the payoff from using problem constraints to reduce search complexity on two classes of problems: learning boolean functions and solving the forward kinematics problem. We have also developed and implemented methods to use additional problem heuristics to fine-tune the searchable space, and to use typing information to further reduce the search space. Additional improvements have been proposed, but they are yet to be explored and implemented.

Janikow, Cezary Z.↗

Cost-effectiveness methodology for computer systems selection

A new approach to the problem of selecting a computer system design has been developed. The purpose of this methodology is to identify a system design that is capable of fulfilling system objectives in the most economical way. The methodology characterizes each system design by the cost of the system life cycle and by the system's effectiveness in reaching objectives. Cost is measured by a 'system cost index' derived from an analysis of all expenditures and possible revenues over the system life cycle. Effectiveness is measured by a 'system utility index' obtained by combining the impact that each selection factor has on the system objectives and it is assessed through a 'utility curve'. A preestablished algorithm combines cost and utility and provides a ranking of the alternative system designs from which the 'best' design is selected.

Vallone, A.↗