Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithm Development”

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 1,693 records · Page 94

Development of window scheduler algorithm exploiting natural ventilation and thermal mass for building energy simulation and smart home controls

Building energy simulations often rely on abstract assumptions when it comes to natural ventilation, such as ‘windows always open [or closed]’ or ‘windows open when outdoor temperature is below a certain threshold.’ However, simulations based on these assumptions fail to fully exploit the cooling potential of natural ventilation, as its effectiveness can be enhanced or diminished by various factors, including the presence of thermal mass. This issue also extends to smart home controls, where determining the window schedule becomes challenging without information about the building's response to outdoor conditions. To address these issues, this study has developed an analytical model for window operation schedules that leverages the passive cooling from natural ventilation. The analytical model was validated against a Modelica simulation. A case study utilizing the BESTEST model of ANSI/ASHRAE Standard 140 underwent validation with EnergyPlus simulations, showing strong concordance. The algorithm provides window schedule recommendations adapted to various airflow rates, thermal masses, and climate variations. Notably, the case study demonstrated that proper window scheduling could reduce indoor temperature by up to 8 °C under the given simulation settings, thereby improving resilience and indicating potential energy savings. Furthermore, the paper explores the potential opportunities and challenges this approach presents, especially for building simulation and smart home applications.

42 ENGINEERING↗

Automated isotope identification algorithm using artificial neural networks

There is a need to develop an algorithm that can determine the relative activities of radio-isotopes in a large dataset of low-resolution gamma-ray spectra that contains a mixture of many radio-isotopes. Low-resolution gamma-ray spectra that contain mixtures of radio-isotopes often exhibit feature over-lap, requiring algorithms that can analyze these features when overlap occurs. While machine learning and pattern recognition algorithms have shown promise for the problem of radio-isotope identification, their ability to identify and quantify mixtures of radio-isotopes has not been studied. Because machine learning algorithms use abstract features of the spectrum, such as the shape of overlapping peaks and Compton continuum, they are a natural choice for analyzing radio-isotope mixtures. An artificial neural network (ANN) has be trained to calculate the relative activities of 32 radio-isotopes in a spectrum. Furthermore, the ANN is trained with simulated gamma-ray spectra, allowing easy expansion of the library of target radio-isotopes. In this paper we present our initial algorithms based on an ANN and evaluate them against a series measured and simulated spectra.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Rapid Calculation of Max-Min Fair Rates for Multi-Commodity Flows in Fat-Tree Networks

Max-min fairness is often used in the performance modeling of interconnection networks. Existing methods to compute max-min fair rates for multi-commodity flows have high complexity and are computationally infeasible for large networks. In this paper, we show that by considering topological features, this problem can be solved efficiently for the fat-tree topology that is widely used in data centers and high performance compute clusters. Several efficient new algorithms are developed for this problem, including a parallel algorithm that can take advantage of multi-core and shared-memory architectures. Using these algorithms, we demonstrate that it is possible to find the max-min fair rate allocation for multi-commodity flows in fat-tree networks that support tens of thousands of nodes. We evaluate the run-time performance of the proposed algorithms and show improvement in orders of magnitude over the previously best known method. Finally, we further demonstrate a new application of max-min fair rate allocation that is only computationally feasible using our new algorithms.

97 MATHEMATICS AND COMPUTING↗

Final Report---Optimization Under Nonconvexity and Uncertainty: Algorithms and Software

the goal of this work was to develop new algorithmic techniques for solving large-scale numerical optimization problems, focusing on problems classes that have proven to be among the most challenging for practitioners: those involving uncertainty and those involving nonconvexity. This research advanced the state-of-the-art in solving mixed integer linear programs containing symmetry, mixed integer nonlinear programs, and stochastic optimization problems. The focus of the work done in the continuation was on Mixed Integer Nonlinear Programs (MINLP)s and Mixed Integer Linear Programs (MILP)s, especially those containing a great deal of symmetry.

97 MATHEMATICS AND COMPUTING↗

On the problem of embedding picture elements in regions

A few new algorithms for region growing in pictures were developed. These algorithms are a step toward finding a satisfactory solution to the image segmentation problem, and in-depth understanding of the problems of nonsemantic image segmentation. The algorithms utilize a sequential decision approach for region boundaries detection. The sequential decisions are supported by a stochastic algorithm that maintains local statistics of the region near the boundaries as the region grows. A few illustrations of the algorithm's performance are included.

Yakimovsky, Y.↗

Contextual classification on PASM

The use of N microprocessors in the SIMD mode of parallel processing to do classifications almost N times faster than a single microprocessor is discussed. Examples of contextual classifiers are given, uniprocessor algorithms for performing contextual classifications are presented, and their computational complexity is analyzed. The SIMD mode of parallel processing is defined and PASM is overviewed. The presented uniprocessor algorithms are used as a basis for developing parallel algorithms for performing computationally intensive contextual classifications.

Siegel, H. J.↗

Design of a walking robot

Carnegie Mellon University's Autonomous Planetary Exploration Program (APEX) is currently building the Daedalus robot; a system capable of performing extended autonomous planetary exploration missions. Extended autonomy is an important capability because the continued exploration of the Moon, Mars and other solid bodies within the solar system will probably be carried out by autonomous robotic systems. There are a number of reasons for this - the most important of which are the high cost of placing a man in space, the high risk associated with human exploration and communication delays that make teleoperation infeasible. The Daedalus robot represents an evolutionary approach to robot mechanism design and software system architecture. Daedalus incorporates key features from a number of predecessor systems. Using previously proven technologies, the Apex project endeavors to encompass all of the capabilities necessary for robust planetary exploration. The Ambler, a six-legged walking machine was developed by CMU for demonstration of technologies required for planetary exploration. In its five years of life, the Ambler project brought major breakthroughs in various areas of robotic technology. Significant progress was made in: mechanism and control, by introducing a novel gait pattern (circulating gait) and use of orthogonal legs; perception, by developing sophisticated algorithms for map building; and planning, by developing and implementing the Task Control Architecture to coordinate tasks and control complex system functions. The APEX project is the successor of the Ambler project.

Whittaker, William↗

SeaWiFS Technical Report Series. Volume 29: SeaWiFS CZCS-type pigment algorithm

The Sea-viewing Wide Field-of-view Sensor (SeaWiFS) mission will provide operational ocean color that will be superior to the previous Coastal Zone Color Sensor (CZCS) proof-of-concept mission. an algorithm is needed that exploits the full functionality of SeaWiFS whilst remaining compatible in concept with algorithms used for the CZCS. This document describes the theoretical rationale of radiance band-radio methods for determining chlorophyll alpha and other important biogeochemical parameters, and their implementation for the SeaWiFS mission. Pigment interrelationships are examined to explain the success of the CZCS algorithms. In the context where chlorophyll alpha absorbs only weakly at 520 nm, the success of the 520 nm to 550 nm CZCS band ratio needs to be explained. This is explained by showing that in pigment data from a range of oceanic provinces chlorophyll alpha (absorbing at less than 490 nm), carotenoids (absorbing at greater than 460 nm), and total pigment are highly correlated. Correlations within pigment groups particularly photoprotectant and photosynthetic carotenoids are less robust. The sources of variability in optical data re examined using the NIMBUS Experiment Team (NET) bio-optical data set and bio-optical model. In both the model and NET data, the majority of the variance in the optical data is attributed to variability in pigment (chlorophyll alpha, and total particulates, with less than 5% of the variability resulting from pigment assemblage. The relationships between band ratios and chlorophyll is examined analytically, and a new formulation based on a dual hyperbolic model is suggested which gives a better calibration curve than the conventional log-log linear regression fit. The new calibration curve shows that 490:555 ratio is the best single-band ratio and is the recommended CZCS-type pigment algorithm. Using both the model and NET data, a number of multiband algorithms are developed; the best of which is an algorithm based on the 443:555 and 490:555 ratios. From model data, the form of potential algorithms for other products, such as total particulates and dissolved organic matter (DOM), are suggested.

Hooker, Stanford B.↗

SeaWiFS Technical Report Series: The SeaWiFS CZCS-Type Pigment Algorithm - Volume 29

The Sea-viewing Wide Field-of-view Sensor (SeaWiFS) mission will provide operational ocean color that will be superior to the previous Coastal Zone Color Sensor (CZCS) proof-of-concept mission. An algorithm is needed that exploits the full functionality of SeaWiFS whilst remaining compatible in concept with algorithms used for the CZCS. This document describes the theoretical rationale of radiance band-ratio methods for determining chlorophyll-a and other important biogeochemical parameters, and their implementation for the SeaWIFS mission. Pigment interrelationships are examined to explain the success of the CZCS algorithms. In the context where chlorophyll-a absorbs only weakly at 520 nm, the success of the 520 nm to 550 nm CZCS band ratio needs to be explained. This is explained by showing that in pigment data from a range of oceanic provinces chlorophyll-a (absorbing at less than 490 nm), carotenoids (absorbing at greater than 460 nm), and total pigment are highly correlated. Correlations within pigment groups particularly photoprotectant and photosynthetic carotenoids are less robust. The sources of variability in optical data are examined using the NIMBUS Experiment Team (NET) bio-optical data set and bio-optical model. In both the model and NET data, the majority of the variance in the optical data is attributed to variability in pigment (chlorophyll-a), and total particulates, with less than 5% of the variability resulting from pigment assemblage. The relationships between band ratios and chlorophyll is examined analytically, and a new formulation based on a dual hyperbolic model is suggested which gives a better calibration curve than the conventional log-log linear regression fit. The new calibration curve shows the 490:555 ratio is the best single-band ratio and is the recommended CZCS-type pigment algorithm. Using both the model and NET data, a number of multiband algorithms are developed; the best of which is an algorithm based on the 443:555 and 490:555 ratios. From model data, the form of potential algorithms for other products, such as total particulates and dissolved organic matter (DOM), are suggested.

Hooker, Stanford B.↗

Atmospheric Ascent Guidance for Rocket-Powered Launch Vehicles

An advanced ascent guidance algorithm for rocket- powered launch vehicles is developed. This algorithm cyclically solves the calculus-of-variations two-point boundary-value problem starting at vertical rise completion through main engine cutoff. This is different from traditional ascent guidance algorithms which operate in a simple open-loop mode until high dynamic pressure (including the critical max-Q) portion of the trajectory is over, at which time guidance operates under the assumption of negligible aerodynamic acceleration (i.e., vacuum dynamics). The initial costate guess is corrected based on errors in the terminal state constraints and the transversality conditions. Judicious approximations are made to reduce the order and complexity of the state/costate system. Results comparing guided launch vehicle trajectories with POST open-loop trajectories are given verifying the basic formulation of the algorithm. Multiple shooting is shown to be a very effective numerical technique for this application. In particular, just one intermediate shooting point, in addition to the initial shooting point, is sufficient to significantly reduce sensitivity to the guessed initial costates. Simulation results from a high-fidelity trajectory simulation are given for the case of launch to sub-orbital cutoff conditions as well as launch to orbit conditions. An abort to downrange landing site formulation of the algorithm is presented.

Dukeman, Greg A.↗

Tactical Synthesis Of Efficient Global Search Algorithms

Algorithm synthesis transforms a formal specification into an efficient algorithm to solve a problem. Algorithm synthesis in Specware combines the formal specification of a problem with a high-level algorithm strategy. To derive an efficient algorithm, a developer must define operators that refine the algorithm by combining the generic operators in the algorithm with the details of the problem specification. This derivation requires skill and a deep understanding of the problem and the algorithmic strategy. In this paper we introduce two tactics to ease this process. The tactics serve a similar purpose to tactics used for determining indefinite integrals in calculus, that is suggesting possible ways to attack the problem.

Nedunuri, Srinivas↗

Concepts and Challenges for Environmentally Friendly En Route Operations

A flight trajectory optimization algorithm with fuel and contrails models, which develops alternative flight paths, provides policy makers the necessary data to make tradeoffs between persistent contrails mitigation and aircraft fuel consumption. This study develops an algorithm that calculates wind-optimal trajectories for cruising aircraft while avoiding the regions of airspace prone to persistent contrails formation. The optimal trajectory is derived using Singular Perturbation Method. The regions of airspace favorable to persistent contrails formation are modeled as high-risk areas that aircraft should avoid and are adjustable. The tradeoffs between persistent contrails formation and additional travel time are investigated for wind-optimal trajectories and various contrails-avoidance trajectories at 10 different cruising altitudes for flights departing from Chicago and San Diego to New York. The additional travel times required for avoiding 100% persistent contrails formation at various flight altitudes ranged from approximately 0% to 4.3% for flights from Chicago to New York. For flights between San Diego and New York, additional traveling times vary between 1.3% and 5% depending on the cruise altitude and the percentage of contrail avoidance. Talk will present the results of aircraft fuel consumptions that are proportional to the travel time for cruising aircraft.

Sridhar, Banavar↗

Integrated Model Reduction and Control of Aircraft with Flexible Wings

This paper presents an integrated approach to the modeling and control of aircraft with exible wings. The coupled aircraft rigid body dynamics with a high-order elastic wing model can be represented in a nite dimensional state-space form. Given a set of desired output covariance, a model reduction process is performed by using the weighted Modal Cost Analysis (MCA). A dynamic output feedback controller, which is designed based on the reduced-order model, is developed by utilizing output covariance constraint (OCC) algorithm, and the resulting OCC design weighting matrix is used for the next iteration of the weighted cost analysis. This controller is then validated for full-order evaluation model to ensure that the aircraft's handling qualities are met and the uttering motion of the wings suppressed. An iterative algorithm is developed in CONDUIT environment to realize the integration of model reduction and controller design. The proposed integrated approach is applied to NASA Generic Transport Model (GTM) for demonstration.

AEROELASTIC↗

Prevalence and scalable control of localized networks

The ability to control network dynamics is essential for ensuring desirable functionality of many technological, biological, and social systems. Such systems often consist of a large number of network elements, and controlling large-scale networks remains challenging because the computation and communication requirements increase prohibitively fast with network size. Here, we introduce a notion of network locality that can be exploited to make the control of networks scalable, even when the dynamics are nonlinear. We show that network locality is captured by an information metric and is almost universally observed across real and model networks. In localized networks, the optimal control actions and system responses are both shown to be necessarily concentrated in small neighborhoods induced by the information metric. This allows us to develop localized algorithms for determining network controllability and optimizing the placement of driver nodes. This also allows us to develop a localized algorithm for designing local feedback controllers that approach the performance of the corresponding best global controllers, while incurring a computational cost orders-of-magnitude lower. Here, we validate the locality, performance, and efficiency of the algorithms in Kuramoto oscillator networks, as well as three large empirical networks: synchronization dynamics in the Eastern US power grid, epidemic spreading mediated by the global air-transportation network, and Alzheimer’s disease dynamics in a human brain network. Taken together, our results establish that large networks can be controlled with computation and communication costs comparable to those for small networks.

42 ENGINEERING↗

Computerized scheme for evaluating mammographic phantom images

Purpose: The authors developed a computer algorithm to automatically evaluate images of the American College of Radiology (ACR) mammography accreditation phantom. Methods: The developed algorithm consist of the edge detection of wax insert, nonuniformity correction of background, and correction for magnification and also calculate the cross-correlation coefficient by image matching technique. The algorithm additionally evaluates target shape for fibers, target contrast for speck groups, and target circularity for masses. To obtain an ideal template image without noise and spatial resolution loss, the wax insert containing the embedded test pattern was extracted from the phantom and radiographed. Two template images and ten test phantom images were prepared for this study. The results of evaluation using the algorithm outputs were compared with the averaged results of observer studies by six skilled observers. Results: In comparing the results from the algorithm outputs with the results of observers, the authors found that the computer outputs were well correlated with the evaluations by observers, and they indicate the quality of the phantom image. The correlation coefficients between results of observer studies and two outputs of computer algorithm, i.e., the cross-correlation coefficient by template matching and indices of target shape for fibers, were 0.89 (95% confidence interval, 0.82-0.93; hereinafter the same) and 0.85 (0.76-0.91). The correlation coefficients between observer's results and two outputs: the cross-correlation coefficient and indices of target contrast for speck groups, were 0.83 (0.79-0.86) and 0.85 (0.81-0.88) and between observer's results and two outputs: the cross-correlation coefficient and indices of target circularity for masses, were 0.90 (0.84-0.94) and 0.87 (0.77-0.92). Conclusions: Image evaluation using the ACR phantom is indispensable in quality control of a mammography system. The proposed algorithm is useful for quality control and image evaluation of mammography units.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Development of an Innovative Algorithm for Aerodynamics-Structure Interaction Using Lattice Boltzmann Method

The lattice Boltzmann equation (LBE) is a kinetic formulation which offers an alternative computational method capable of solving fluid dynamics for various systems. Major advantages of the method are owing to the fact that the solution for the particle distribution functions is explicit, easy to implement, and the algorithm is natural to parallelize. In this final report, we summarize the works accomplished in the past three years. Since most works have been published, the technical details can be found in the literature. Brief summary will be provided in this report. In this project, a second-order accurate treatment of boundary condition in the LBE method is developed for a curved boundary and tested successfully in various 2-D and 3-D configurations. To evaluate the aerodynamic force on a body in the context of LBE method, several force evaluation schemes have been investigated. A simple momentum exchange method is shown to give reliable and accurate values for the force on a body in both 2-D and 3-D cases. Various 3-D LBE models have been assessed in terms of efficiency, accuracy, and robustness. In general, accurate 3-D results can be obtained using LBE methods. The 3-D 19-bit model is found to be the best one among the 15-bit, 19-bit, and 27-bit LBE models. To achieve desired grid resolution and to accommodate the far field boundary conditions in aerodynamics computations, a multi-block LBE method is developed by dividing the flow field into various blocks each having constant lattice spacing. Substantial contribution to the LBE method is also made through the development of a new, generalized lattice Boltzmann equation constructed in the moment space in order to improve the computational stability, detailed theoretical analysis on the stability, dispersion, and dissipation characteristics of the LBE method, and computational studies of high Reynolds number flows with singular gradients. Finally, a finite difference-based lattice Boltzmann method is developed for inviscid compressible flows.

Mei, Ren-Wei↗

Neutrino Oscillations in Supernovae

A (core-collapse) supernova is the final death call of a massive star during which a gigantic amount of a special kind of elementary particles known as neutrinos are released for a brief period of time. An earlier work by the PI and his collaborators has shown that the dense neutrino gas deep inside the supernova can experience "flavor transformation" or "oscillations" in a collective fashion, a macroscopic quantum phenomenon spanning over distances of 100-1000 kilometers. During this process neutrinos of different energies and propagation directions change their identities simultaneously. This phenomenon may be a key to understanding the mechanism of supernova explosion and the origin of many of the chemical elements found on the earth which were produced in the supernovae exploded in the past. The previous understanding of neutrino oscillations in supernovae was based on a stationary 3-dimensional model with 1 spatial dimension and 2 momentum dimensions. In this "neutrino bulb model" neutrinos are emitted from a spherically symmetric surface and they are decoupled from the motion of matter and the production of chemical elements. In order to accurately model the neutrino oscillations in supernovae and determine its physical consequences, sophisticated 7-dimensional (1 temporal dimension + 3 spatial dimensions + 3 momentum dimensions) modelling of neutrino transport must be performed self-consistently together with the hydrodynamic simulation of the flow of energy and matter inside the supernova and with the calculation of the production and destruction of chemical elements through a large nucleosynthesis network. Although it will be long journey to achieve the lofty goal, our project has made important progress in three different fronts towards this goal. In the first front we explored new computing hardware on which the next generation simulation codes may be run. We ported the neutrino bulb code to the platform of Graphics Processing Unit (GPU) and then later developed a new bulb code that can be run on supercomputers equipped with the Intel Xeon CPUs and/or the Xeon Phi coprocessors. In the second front we developed new algorithms that can be used towards computing neutrino oscillations in multi-dimensional models. We have developed a moment expansion method which is approximately 10 times more efficient than the old algorithm. We have also developed numerical codes to solve neutrino oscillations in toy models with two spatial dimensions. In the last front we used analytic methods to study neutrino oscillations in more sophisticated models, e.g. of multiple spatial dimensions and/or with time dependence. By analyzing the neutrino oscillations in toy models with two spacial dimensions we found that the approximate spacial translation symmetry, which is similar to the spherical symmetry in the neutrino bulb model, can be broken spontaneously as neutrino oscillations begin. By analyzing a time-dependent neutrino bulb model we found that certain modes of neutrino oscillations that are suppressed in the stationary model can become active in the time-dependent model. We have also developed theories which give insights to how ordinary matter may affect neutrino oscillations in supernovae and other astrophysical environments.

Duan, Huaiyu↗