Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algorithms and Theoretical Developments”

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 253 records · Page 14

Verification of Small Hole Theory for Application to Wire Chaffing Resulting in Shield Faults

Our work is focused upon developing methods for wire chafe fault detection through the use of reflectometry to assess shield integrity. When shielded electrical aircraft wiring first begins to chafe typically the resulting evidence is small hole(s) in the shielding. We are focused upon developing algorithms and the signal processing necessary to first detect these small holes prior to incurring damage to the inner conductors. Our approach has been to develop a first principles physics model combined with probabilistic inference, and to verify this model with laboratory experiments as well as through simulation. Previously we have presented the electromagnetic small-hole theory and how it might be applied to coaxial cable. In this presentation, we present our efforts to verify this theoretical approach with high-fidelity electromagnetic simulations (COMSOL). Laboratory observations are used to parameterize the computationally efficient theoretical model with probabilistic inference resulting in quantification of hole size and location. Our efforts in characterizing faults in coaxial cable are subsequently leading to fault detection in shielded twisted pair as well as analysis of intermittent faulty connectors using similar techniques.

Schuet, Stefan R.↗

Dynamics of three-dimensional space crane - Motion requirements and computational considerations

Preliminary design requirements for a space crane are surveyed and some theoretical and computational issues that need to be addressed in support of the design activities are identified. Computational experiments conducted so far on rigid space crane models indicate that the sizing of joint actuators and operational constraints can be assessed by quasi-static rigid crane maneuvering simulations. Limited numerical experiments on flexible crane models raise several difficulties in developing control strategies, maneuvering speeds, maximum torque sustainable, and modeling detailed flexibility effects on the tip positioning accuracy. Computational algorithms development that will alleviate some of these difficulties are discussed and illustrated via example test runs.

Park, K. C.↗

Improving Simulated Annealing by Recasting it as a Non-Cooperative Game

The game-theoretic field of COllective INtelligence (COIN) concerns the design of computer-based players engaged in a non-cooperative game so that as those players pursue their self-interests, a pre-specified global goal for the collective computational system is achieved "as a side-effect". Previous implementations of COIN algorithms have outperformed conventional techniques by up to several orders of magnitude, on domains ranging from telecommunications control to optimization in congestion problems. Recent mathematical developments have revealed that these previously developed game-theory-motivated algorithms were based on only two of the three factors determining performance. Consideration of only the third factor would instead lead to conventional optimization techniques like simulated annealing that have little to do with non-cooperative games. In this paper we present an algorithm based on all three terms at once. This algorithm can be viewed as a way to modify simulated annealing by recasting it as a non-cooperative game, with each variable replaced by a player. This recasting allows us to leverage the intelligent behavior of the individual players to substantially improve the exploration step of the simulated annealing. Experiments are presented demonstrating that this recasting improves simulated annealing by several orders of magnitude for spin glass relaxation and bin-packing.

Wolpert, David↗

The mGA1.0: A common LISP implementation of a messy genetic algorithm

Genetic algorithms (GAs) are finding increased application in difficult search, optimization, and machine learning problems in science and engineering. Increasing demands are being placed on algorithm performance, and the remaining challenges of genetic algorithm theory and practice are becoming increasingly unavoidable. Perhaps the most difficult of these challenges is the so-called linkage problem. Messy GAs were created to overcome the linkage problem of simple genetic algorithms by combining variable-length strings, gene expression, messy operators, and a nonhomogeneous phasing of evolutionary processing. Results on a number of difficult deceptive test functions are encouraging with the mGA always finding global optima in a polynomial number of function evaluations. Theoretical and empirical studies are continuing, and a first version of a messy GA is ready for testing by others. A Common LISP implementation called mGA1.0 is documented and related to the basic principles and operators developed by Goldberg et. al. (1989, 1990). Although the code was prepared with care, it is not a general-purpose code, only a research version. Important data structures and global variations are described. Thereafter brief function descriptions are given, and sample input data are presented together with sample program output. A source listing with comments is also included.

Goldberg, David E.↗

Analysis of whisker-toughened CMC structural components using an interactive reliability model

Realizing wider utilization of ceramic matrix composites (CMC) requires the development of advanced structural analysis technologies. This article focuses on the use of interactive reliability models to predict component probability of failure. The deterministic William-Warnke failure criterion serves as theoretical basis for the reliability model presented here. The model has been implemented into a test-bed software program. This computer program has been coupled to a general-purpose finite element program. A simple structural problem is presented to illustrate the reliability model and the computer algorithm.

Duffy, Stephen F.↗

Determination of the coronal magnetic field from vector magnetograph data

A new algorithm was developed, tested, and applied to determine coronal magnetic fields above solar active regions. The coronal field above NOAA active region AR5747 was successfully estimated on 20 Oct. 1989 from data taken at the Mees Solar Observatory of the Univ. of Hawaii. It was shown that observational data can be used to obtain realistic estimates of coronal magnetic fields. The model has significantly extended the realism with which the coronal magnetic field can be inferred from observations. The understanding of coronal phenomena will be greatly advanced by a reliable technique, such as the one presented, for deducing the detailed spatial structure of the coronal field. The payoff from major current and proposed NASA observational efforts is heavily dependent on the success with which the coronal field can be inferred from vector magnetograms. In particular, the present inability to reliably obtain the coronal field has been a major obstacle to the theoretical advancement of solar flare theory and prediction. The results have shown that the evolutional algorithm can be used to estimate coronal magnetic fields.

Mikic, Zoran↗

Glass breaking strength: The role of surface flaws and treatments

Although the intrinsic strength of silicon dioxide glass is of the order of 10 to the 6th power lb/sq in, the practical strength is roughly two orders of magnitude below this theoretical limit, and depends almost entirely on the surface condition of the glass, that is, the number and size of flaws and the residual surface compression (temper) in the glass. Glass parts always fail in tension when these flaws grow under sustained loading to some critical size. Research associated with glass encapsulated crystalline-Si photovoltaic (PV) modules has greatly expanded our knowledge of glass breaking strength and developed sizeable data base for commercially available glass types. A detailed design algorithm is developed for thickness sizing of rectangular glass plates subject to pressure loads. Additional studies examine the strength of glass under impact loading conditions such as that caused by hail. Although the fundamentals of glass breakage are directly applicable to thin film modules, the fracture strength of typical numerical glass must be replaced with data that reflect the high temperature tin oxide processing, laser scribing, and edge processing peculiar to thin film modules. The fundamentals of glass breakage applicable to thin film modules and preliminary fracture strength data for a variety of 1 ft square glass specimens representing preprocessed and post processed sheets from current amorphous-Si module manufacturers are presented.

Moore, D.↗

A Local Scalable Distributed Expectation Maximization Algorithm for Large Peer-to-Peer Networks

This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining tasks in a distributed environment such as clustering, anomaly detection, target tracking to name a few. This technology is crucial for many emerging peer-to-peer applications for bioinformatics, astronomy, social networking, sensor networks and web mining. Centralizing all or some of the data for building global models is impractical in such peer-to-peer environments because of the large number of data sources, the asynchronous nature of the peer-to-peer networks, and dynamic nature of the data/network. The distributed algorithm we have developed in this paper is provably-correct i.e. it converges to the same result compared to a similar centralized algorithm and can automatically adapt to changes to the data and the network. We show that the communication overhead of the algorithm is very low due to its local nature. This monitoring algorithm is then used as a feedback loop to sample data from the network and rebuild the model when it is outdated. We present thorough experimental results to verify our theoretical claims.

Bhaduri, Kanishka↗

Estimation of Instantaneous TOA Albedo at 670 nm over Ice Clouds from POLDER Multidirectional Measurements

An algorithm that determines the 670-nm top-of-atmosphere (TOA) albedo of ice clouds over ocean using Polarization and Directionality of the Earth's Reflectance ( POLDER) multidirectional measurements is developed. A plane-parallel layer of ice cloud with various optical thicknesses and light scattering phase functions is assumed. For simplicity, we use a double Henyey-Greenstein phase function to approximate the volume-averaged phase function of the ice clouds. A multidirectional reflectance best-fit match between theoretical and POLDER reflectances is used to infer effective cloud optical thickness, phase function and TOA albedo. Sensitivity tests show that while the method does not provide accurate independent retrievals of effective cloud optical depth and phase function, TOA albedo retrievals are accurate to within similar to 3% for both a single layer of ice clouds or a multilayer system of ice clouds and water clouds. When the method is applied to POLDER measurements and retrieved albedos are compared with albedos based on empirical angular distribution models (ADMs), zonal albedo differences are generally smaller than similar to 3%. When albedos are compared with those on the POLDER-I ERB and Cloud product, the differences can reach similar to 15% at small solar zenith angles.

Sun, W.↗

The Algorithm Theoretical Basis Document for the GLAS Atmospheric Data Products

The purpose of this document is to present a detailed description of the algorithm theoretical basis for each of the GLAS data products. This will be the final version of this document. The algorithms were initially designed and written based on the authors prior experience with high altitude lidar data on systems such as the Cloud and Aerosol Lidar System (CALS) and the Cloud Physics Lidar (CPL), both of which fly on the NASA ER-2 high altitude aircraft. These lidar systems have been employed in many field experiments around the world and algorithms have been developed to analyze these data for a number of atmospheric parameters. CALS data have been analyzed for cloud top height, thin cloud optical depth, cirrus cloud emittance (Spinhirne and Hart, 1990) and boundary layer depth (Palm and Spinhirne, 1987, 1998). The successor to CALS, the CPL, has also been extensively deployed in field missions since 2000 including the validation of GLAS and CALIPSO. The CALS and early CPL data sets also served as the basis for the construction of simulated GLAS data sets which were then used to develop and test the GLAS analysis algorithms.

Palm, Stephen P.↗

ATMS Radiometric Noise Characterization

The Advanced Technology Microwave Sounder (ATMS), on SNPP and NOAA-20, provides vertical atmospheric temperature and moisture profiles that are a key input to numerical weather prediction. Full characterization of radiometric noise is critical to error modeling, algorithm development and the potential development of performance requirements and product improvements. This paper presents estimates of white noise and low-frequency 1/f noise as derived from the Allan variance and scan-to-scan autocorrelations of data from the internal hot calibration. This approach allows direct comparison of on-orbit performance of the two units as well as comparison between ground calibration test data and on-orbit performance. The autocorrelation at multiple scan intervals is used as input to a theoretical model of the NET of inferred scene brightness temperature, when using weighted samples of calibration data over multiple scans. This will support selection of optimized calibration weighting functions for each channel, as well as providing further insight into the striping phenomenon. These measured autocorrelations are also compared to the autocorrelations derived from the 1/f spectra obtained both in special ground and on-orbit tests that characterize gain fluctuation. Channel cross-correlations are also presented, which can have a significant impact on effectiveness of direct assimilation performance.

instrument calibration↗

Run Time Assurance for Electric Vertical Takeoff and Landing Aircraft

NASA is conducting research to demonstrate and evaluate the application of Run Time Assurance (RTA) as a means to assure safety in Electric Vertical Takeoff and Landing (eVTOL) aircraft with highly automated or autonomous flight capability supervised by a single onboard pilot. The work described in this report demonstrates an application of RTA and examines the implications for design and analysis of aircraft functions and systems; aircraft safety hazards; safety assurance; development assurance; and pilot tasks and performance. This research effort also seeks to assess the efficacy of the combined application of traditional Functional Hazard Analysis (FHA) and the more modern System Theoretic Process Analysis (STPA) techniques to perform hazard analyses on aircraft with complex automated and autonomous systems and an onboard pilot. During the research effort we developed architectural designs of two alternate eVTOL aircraft, generally following the process characterized in the SAE standards ARP4754 and ARP4761. The design has focused on the control architectures of these aircraft, which are identical except that one incorporates RTA techniques to reduce the criticality of some key software components. Artifacts of this process include a taxonomy of aircraft-level functions, aircraft-level architecture diagrams, aircraft-level functional hazard assessments (AFHA), function allocations onto aircraft systems and subsystems, functional block diagrams for a select set of control-related functions, and system-level functional hazard assessments (SFHA) for those functions. This project has highlighted the notion that DAL D is something of a sweet spot for low-confidence controllers in an RTA-based design. Among the many activities described in DO-178C, the activities related to requirement verifiability, algorithmic accuracy, and test coverage can be the most challenging for the kinds of advanced control techniques that may be desirable in novel UAM designs, such as adaptive control, machine-learning, artificial intelligence, numerical search, and Monte Carlo based algorithms. Moreover, the standard requires that development teams demonstrate that errors leading to unacceptable failure conditions have been removed from the software. The RTA architecture, which cordons off the low-confidence function, makes it much easier to show this for these kinds of algorithms. With regard to the use of STPA and FHA as complementary hazard analysis techniques, our research effort led us to the conclusion that STPA should be used to derive requirements for hardware and software systems and/or components. Also, STPA is a natural complement to other processes in ARP4754A involving design studies and iteration.

Run-time assurance↗

Space-Related Applications of Intelligent Control: Which Algorithm to Choose? (Theoretical Analysis of the Problem)

For a space mission to be successful it is vitally important to have a good control strategy. For example, with the Space Shuttle it is necessary to guarantee the success and smoothness of docking, the smoothness and fuel efficiency of trajectory control, etc. For an automated planetary mission it is important to control the spacecraft's trajectory, and after that, to control the planetary rover so that it would be operable for the longest possible period of time. In many complicated control situations, traditional methods of control theory are difficult or even impossible to apply. In general, in uncertain situations, where no routine methods are directly applicable, we must rely on the creativity and skill of the human operators. In order to simulate these experts, an intelligent control methodology must be developed. The research objectives of this project were: to analyze existing control techniques; to find out which of these techniques is the best with respect to the basic optimality criteria (stability, smoothness, robustness); and, if for some problems, none of the existing techniques is satisfactory, to design new, better intelligent control techniques.

Kreinovich, Vladik↗

Distributed Monitoring of the R(sup 2) Statistic for Linear Regression

The problem of monitoring a multivariate linear regression model is relevant in studying the evolving relationship between a set of input variables (features) and one or more dependent target variables. This problem becomes challenging for large scale data in a distributed computing environment when only a subset of instances is available at individual nodes and the local data changes frequently. Data centralization and periodic model recomputation can add high overhead to tasks like anomaly detection in such dynamic settings. Therefore, the goal is to develop techniques for monitoring and updating the model over the union of all nodes data in a communication-efficient fashion. Correctness guarantees on such techniques are also often highly desirable, especially in safety-critical application scenarios. In this paper we develop DReMo a distributed algorithm with very low resource overhead, for monitoring the quality of a regression model in terms of its coefficient of determination (R2 statistic). When the nodes collectively determine that R2 has dropped below a fixed threshold, the linear regression model is recomputed via a network-wide convergecast and the updated model is broadcast back to all nodes. We show empirically, using both synthetic and real data, that our proposed method is highly communication-efficient and scalable, and also provide theoretical guarantees on correctness.

Bhaduri, Kanishka↗

Parallel Directionally Split Solver Based on Reformulation of Pipelined Thomas Algorithm

In this research an efficient parallel algorithm for 3-D directionally split problems is developed. The proposed algorithm is based on a reformulated version of the pipelined Thomas algorithm that starts the backward step computations immediately after the completion of the forward step computations for the first portion of lines This algorithm has data available for other computational tasks while processors are idle from the Thomas algorithm. The proposed 3-D directionally split solver is based on the static scheduling of processors where local and non-local, data-dependent and data-independent computations are scheduled while processors are idle. A theoretical model of parallelization efficiency is used to define optimal parameters of the algorithm, to show an asymptotic parallelization penalty and to obtain an optimal cover of a global domain with subdomains. It is shown by computational experiments and by the theoretical model that the proposed algorithm reduces the parallelization penalty about two times over the basic algorithm for the range of the number of processors (subdomains) considered and the number of grid nodes per subdomain.

Povitsky, A.↗

Aircraft Turbofan Engine Health Estimation Using Constrained Kalman Filtering

Kalman filters are often used to estimate the state variables of a dynamic system. However, in the application of Kalman filters some known signal information is often either ignored or dealt with heuristically. For instance, state variable constraints (which may be based on physical considerations) are often neglected because they do not fit easily into the structure of the Kalman filter. This paper develops an analytic method of incorporating state variable inequality constraints in the Kalman filter. The resultant filter is a combination of a standard Kalman filter and a quadratic programming problem. The incorporation of state variable constraints increases the computational effort of the filter but significantly improves its estimation accuracy. The improvement is proven theoretically and shown via simulation results obtained from application to a turbofan engine model. This model contains 16 state variables, 12 measurements, and 8 component health parameters. It is shown that the new algorithms provide improved performance in this example over unconstrained Kalman filtering.

Simon, Dan↗

Remote sounding of the tropical cirrus cloud temperature and optical depth using 6.5 and 10.5-micron radiometers during STEP

A dual-channel retrieval technique involving the water vapor band at 6.5 microns and the window region at 10.5 microns has been developed to infer the temperature and emissivity of tropical anvils. This technique has been applied to data obtained from the ER-2 narrow field-of-view radiometers during two flights in the field observation of the Stratosphere-Troposphere Exchange Project near Darwin, Australia, January-February 1987. The retrieved cloud temperatures are between 190 and 240 K, while the cloud emissivities derived from the retrieval algorithm range from about 0.2 to 1. Moreover, the visible optical depths have been obtained from the cloud emissivity through a theoretical parameterization with values of 0.5-10. A significant portion of tropical cirrus clouds are found to have optical depths greater than about 6. Because of the parameterization, the present technique is unable to precisely determine the optical depth values for optically thick cirrus clouds.

Liou, K. N.↗

Detection of soil erosion with Thematic Mapper (TM) satellite data within Pinyon-Juniper woodlands

Pinyon-Juniper woodlands dominate approximately 24.3 million hectares (60 million acres) in the western United States. The overall objective was to test the sensitivity of the LANDSAT Thematic Mapper (TM) spectral data for detecting varying degrees of soil erosion within the Pinyon-Juniper woodlands. A second objective was to assess the potential of the spectral data for assigning the Universal Soil Loss Equation (USLE) crop management (C) factor values to varying cover types within the woodland. Thematic Mapper digital data for June 2, 1984 on channels 2, 3, 4, and 5 were used. Digital data analysis was performed using the ELAS software package. Best results were achieved using CLUS, an unsupervised clustering algorithm. Fifteen of the 40 Pinyon-Juniper signatures were identified as being relatively pure Pinyon-Juniper woodland. Final analysis resulted in the grouping of the 15 signatures into three major groups. Ten study sites were selected from each of the three groups and located on the ground. At each site the following field measurements were taken: percent tree canopy and percent understory cover, soil texture, total soil loss, and soil erosion rate estimates. A technique for measuring soil erosion within Pinyon-Juniper woodlands was developed. A theoretical model of site degradation after Pinyon-Juniper invasion is presented.

Price, Kevin Paul↗