SEARCH · Engineering Papers
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.
Fatigue damage estimation using neural networks is described in the paper. Attention is focused on the method of data generation for both the training and test data used by radial basis function (RBF), backpropagation, and CID4 algorithms used in this study. The performance results of the three neural algorithms are analyzed in terms of their strengths and weaknesses in training.
The data-processing problems associated with imaging spectrometer data are reviewed; new algorithms and optical processing solutions are advanced for this computationally intensive application. Optical decision net, directed graph, and neural net solutions are considered. Decision nets and mineral element determination of nonmixture data are emphasized here. A new Fisher/minimum-variance clustering algorithm is advanced, initialization using minimum-variance clustering is found to be preferred and fast. Tests on a 500-class problem show the excellent performance of this algorithm.
Detection of bad data from measurement sensors and bad commands from control centers need to be carried out to avoid instabilities within large power electronics systems. Towards the same, in this paper, model and data driven methods are proposed to identify anomalies in measured data and commands received by large power electronics systems. The large power electronics system considered in this paper is a multi-port autonomous reconfigurable solar power plant (MARS), which consists of photovoltaic (PV) and energy storage systems (ESSs) that connect to high-voltage direct current (HVdc) system and transmission ac power grid. The proposed algorithms in the MARS power plant to detect bad data from measurements and bad commands from control centers are evaluated in simulations and hardware-in-the-loop (HIL) tests. Furthermore, it has been observed that the proposed algorithms are able to detect bad measurements and commands in all the use cases evaluated.
The NASA Glenn Research Center has developed a new Hybrid Bearing Prognostic Test Rig to evaluate the performance of sensors and algorithms in predicting failures of rolling element bearings for aeronautics and space applications. The failure progression of both conventional and hybrid (ceramic rolling elements, metal races) bearings can be tested from fault initiation to total failure. The effects of different lubricants on bearing life can also be evaluated. Test conditions monitored and recorded during the test include load, oil temperature, vibration, and oil debris. New diagnostic research instrumentation will also be evaluated for hybrid bearing damage detection. This paper summarizes the capabilities of this new test rig.
Background: The thrombin generation (TG) test is useful for characterizing global hemostasis potential, but fluorescence substrate artifacts, such as thrombin-α2macroglobulin (T-α2MG) signal, inner filter effect (IFE), substrate consumption, and calibration algorithms have been suggested as sources of intra- and inter-laboratory variance, which may limit its clinical utility. Methods: Effects of internal vs. external normalization, IFE and T-α2MG on TG curves in normal plasma supplemented with coagulation factors, thrombomodulin, and tissue factor were studied using the Calibrated Automated Thrombinography (CAT; Diagnostica Stago, Parsippany, NJ, USA) and in-house software. Results: The various calibration methods demonstrated no significant difference in producing TG curves, nor increased the robustness of the TG assay. Several TG parameters, including thrombin peak height (TPH), produced from internal linear calibration did not differ significantly from uncalibrated TG parameters. Further, TPH values from internal linear and nonlinear calibration with or without T-α2MG correction correlated well with TPH from external calibration. Higher coefficients of variation (CVs) for TPH values were observed in both platelet-free and platelet-rich plasma with added thrombomodulin. Conclusions: Our work suggests minimal differences between distinct computational approaches toward calibrating and correcting fluorescence signals into TG levels, with most samples returning similar or equivalent TPH results.
Scenario decomposition algorithms for stochastic programs compute bounds by dualizing all nonanticipativity constraints and solving individual scenario problems independently. Here, we develop an approach that improves on these bounds by reinforcing a carefully chosen subset of nonanticipativity constraints, effectively placing scenarios into groups. Specifically, we formulate an optimization problem for grouping scenarios that aims to improve the bound by optimizing a proxy metric based on information obtained from evaluating a subset of candidate feasible solutions. We show that the proposed grouping problem is NP-hard in general, identify a polynomially solvable case, and present two formulations for solving the problem: a matching formulation for a special case and a mixed-integer programming formulation for the general case. We use the proposed grouping scheme as a preprocessing step for a particular scenario decomposition algorithm and demonstrate its effectiveness in solving standard test instances of two-stage 0–1 stochastic programs. Using this approach, we are able to prove optimality for all previously unsolved instances of a standard test set. Additionally, we implement this scheme as a preprocessing step for PySP, a publicly available and widely used implementation of progressive hedging, and compare this grouping approach with standard grouping approaches on large-scale stochastic unit commitment instances. Finally, the idea is extended to propose a finitely convergent algorithm for two-stage stochastic programs with a finite feasible region.
Pre-launch algorithm development & post-launch product evaluation: The GPM GV paradigm moves beyond traditional direct validation/comparison activities by incorporating improved algorithm physics & model applications (end-to-end validation) in the validation process. Three approaches: 1) National Network (surface): Operational networks to identify and resolve first order discrepancies (e.g., bias) between satellite and ground-based precipitation estimates. 2) Physical Process (vertical column): Cloud system and microphysical studies geared toward testing and refinement of physically-based retrieval algorithms. 3) Integrated (4-dimensional): Integration of satellite precipitation products into coupled prediction models to evaluate strengths/limitations of satellite precipitation producers.
The goals are to conduct a research and development program aimed at determining the most effective way to do SETI within the constraints of current technology and estimated budgets. The general search strategy adopted is that which is recommended by the SETI Science Working Group. The strategy for an all sky survey for SETI was further developed over the last year. Scan patterns, scan rates, and signal detection algorithms were developed. Spectral power measurement instrumentation was tested at the Venus Station of the Goldstone Deep Space Communication Complex. A specially designed radio frequency interference (RFI) measurement system was built and installed at the Venus Station. A data base management system for storage and retrieval of the RFI data was partially implemented on a VAX 750 computer at the Jet Propulsion Laboratory.
The purpose of the NASA Langley Airborne Spacing for Terminal Arrival Routes (ASTAR) research aboard the Boeing ecoDemonstrator aircraft was to demonstrate the use of NASA's ASTAR algorithm using contemporary tools of the Federal Aviation Administration's Next Generation Air Transportation System (NEXTGEN). EcoDemonstrator is a Boeing test program which utilizes advanced experimental equipment to accelerate the science of aerospace and environmentally friendly technologies. The ASTAR Flight Test provided a proof-of-concept flight demonstration that exercised an algorithmic-based application in an actual aircraft. The test aircraft conducted Interval Management operations to provide time-based spacing off a target aircraft in non-simulator wind conditions. Work was conducted as a joint effort between NASA and Boeing to integrate ASTAR in a Boeing supplied B787 test aircraft while using a T-38 aircraft as the target. This demonstration was also used to identify operational risks to future flight trials for the NASA Air Traffic Management Technology Demonstration expected in 2017.
A new regression model search algorithm was developed that may be applied to both general multivariate experimental data sets and wind tunnel strain-gage balance calibration data. The algorithm is a simplified version of a more complex algorithm that was originally developed for the NASA Ames Balance Calibration Laboratory. The new algorithm performs regression model term reduction to prevent overfitting of data. It has the advantage that it needs only about one tenth of the original algorithm's CPU time for the completion of a regression model search. In addition, extensive testing showed that the prediction accuracy of math models obtained from the simplified algorithm is similar to the prediction accuracy of math models obtained from the original algorithm. The simplified algorithm, however, cannot guarantee that search constraints related to a set of statistical quality requirements are always satisfied in the optimized regression model. Therefore, the simplified algorithm is not intended to replace the original algorithm. Instead, it may be used to generate an alternate optimized regression model of experimental data whenever the application of the original search algorithm fails or requires too much CPU time. Data from a machine calibration of NASA's MK40 force balance is used to illustrate the application of the new search algorithm.
Effective plotting of finite element models requires the use of fast hidden line plot techniques that provide interactive response. A high speed hidden line technique was developed to facilitate the plotting of NASTRAN finite element models. Based on testing using 14 different models, the new hidden line algorithm (JONES-D) appears to be very fast: its speed equals that for normal (all lines visible) plotting and when compared to other existing methods it appears to be substantially faster. It also appears to be very reliable: no plot errors were observed using the new method to plot NASTRAN models. The new algorithm was made part of the NPLOT NASTRAN plot package and was used by structural analysts for normal production tasks.
Genetic algorithms usually use string or tree representations. We have developed a novel crossover operator for a directed and undirected graph representation, and used this operator to evolve molecules and circuits. Unlike strings or trees, a single point in the representation cannot divide every possible graph into two parts, because graphs may contain cycles. Thus, the crossover operator is non-trivial. A steady-state, tournament selection genetic algorithm code (JavaGenes) was written to implement and test the graph crossover operator. All runs were executed by cycle-scavagging on networked workstations using the Condor batch processing system. The JavaGenes code has evolved pharmaceutical drug molecules and simple digital circuits. Results to date suggest that JavaGenes can evolve moderate sized drug molecules and very small circuits in reasonable time. The algorithm has greater difficulty with somewhat larger circuits, suggesting that directed graphs (circuits) are more difficult to evolve than undirected graphs (molecules), although necessary differences in the crossover operator may also explain the results. In principle, JavaGenes should be able to evolve other graph-representable systems, such as transportation networks, metabolic pathways, and computer networks. However, large graphs evolve significantly slower than smaller graphs, presumably because the space-of-all-graphs explodes combinatorially with graph size. Since the representation strongly affects genetic algorithm performance, adding graphs to the evolutionary programmer's bag-of-tricks should be beneficial. Also, since graph evolution operates directly on the phenotype, the genotype-phenotype translation step, common in genetic algorithm work, is eliminated.
This paper describes an overview of our "Bioinspired Engineering of Exploration Systems for Mars" ( "BEES for Mars") project. The BEES approach distills selected biologically inspired strategies utilizing motion cues/optic flow, bioinspired pattern recognition, biological visual and neural control systems, bioinspired sensing and communication techniques, and birds of prey inspired search and track algorithmic systems. Unique capabilities so enabled, provide potential solutions to future autonomous robotic space and planetary mission applications. With the first series of tests performed in September 2003, August 2004 and September 2004, we have demonstrated the BEES technologies at the El Mirage Dry Lakebed site in the Mojave Desert using Delta Wing experimental prototypes. We call these test flyers the "BEES flyer", since we are developing them as dedicated test platform for the newly developed bioinspired sensors, processors and algorithmic strategies. The Delta Wing offers a robust airframe that can sustain high G launches and offers ease of compact stowability and packaging along with scaling to small size and low ReynOld's number performance for a potential Mars deployment. Our approach to developing light weight, low power autonomous flight systems using concepts distilled from biology promises to enable new applications, of dual use to NASA and DoD needs. Small in size (0.5 -5 Kg) BEES Flyers are demonstrating capabilities for autonomous flight and sensor operability in Mars analog conditions. The BEES project team spans JPL, NASA Ames, Australian National University (ANU), Brigham Young University(BYU), DC Berkeiey, Analogic Computers Inc. and other institutions. The highlights from our recent flight demonstrations exhibiting new Mission enabling capabilities are described. Further, this paper describes two classes of potential new missions for Mars exploration: (1) the long range exploration missions, and (2) observation missions, for real time imaging of critical ephemeral phenomena, that can be enabled by use of BEES flyers. For example, such flyers can serve as a powerful black-box for critical descent and landing data and enablers for improved science missions complementing and supplementing the existing assets like landers and rovers by providing valuable exploration and quick extended low-altitude aerial coverage of the sites of interest by imaging them and distributing instruments to them. Imaging done by orbiters allows broad surface coverage at limited spatial resolution. Low altitude air-borne exploration of Mars offers a means for imaging large areas, perhaps up to several hundred kilometers, quickly and efficiently, providing a close-up birds-eye view of the planetary terrain and close-up approach to constrained difficult areas like canyons and craters. A novel approach to low-mass yet highly capable flyers is enabled by small aircraft equipped using sensors and processors and algorithms developed using BEES technology. This project is focused towards showing the direct impact of blending the best of artificial intelligence attributes and bioinspiration to create a leap beyond existing capability for our future Missions.
The Quality Control (QC) of pre-production strip sensors for the Inner Tracker (ITk) of the ATLAS Inner Detector upgrade has finished, and the collaboration has embarked on the QC test programme for production sensors. This programme will last more than 3 years and comprises the evaluation of approximately 22000 sensors. 8 Types of sensors, 2 barrel and 6 endcap, will be measured at many different collaborating institutes. The sustained throughput requirement of the combined QC processes is around 500 sensors per month in total. Measurement protocols have been established and acceptance criteria have been defined in accordance with the terms agreed with the supplier. For effective monitoring of test results, common data file formats have been agreed upon across the collaboration. To enable evaluation of test results produced by many different test setups at the various collaboration institutes, common algorithms have been developed to collate, evaluate, plot and upload measurement data. This allows for objective application of pass/fail criteria and compilation of corresponding yield data. These scripts have been used to process the data of more than 3000 sensors so far, and have been instrumental for identification of faulty sensors and monitoring of QC testing progress.
We consider nonlinearly constrained optimization problems and discuss a generic double-loop framework consisting of basic algorithmic ingredients that unifies a broad range of nonlinear optimization solvers. This framework has been implemented in the open-source solver Uno, a Swiss Army knife-like C++ optimization framework that unifies many nonlinearly constrained nonconvex optimization solvers. We illustrate the framework with a sequential quadratic programming (SQP) algorithm that maintains an acceptable upper bound on the constraint violation, called a funnel, that is monotonically decreased to control the feasibility of the iterates. Infeasible quadratic subproblems are handled by a feasibility restoration strategy. Globalization is controlled by a line search or a trust-region method. We prove global convergence of the trust-region funnel SQP method, building on known results from filter methods. We implement the algorithm in Uno, and we provide extensive test results for the trust-region line-search funnel SQP on small CUTEst instances.
Achieving large-scale kinetic modeling is a crucial task for the development and optimization of modern plasma devices. With the trend of decreasing pressure in applications, such as plasma etching, kinetic simulations are necessary to self-consistently capture the particle dynamics. The standard, explicit, electrostatic, momentum-conserving particle-in-cell method suffers from restrictive stability constraints on spatial cell size and temporal time step, requiring resolution of the electron Debye length and electron plasma period, respectively. This results in a very high computational cost, making the technique prohibitive for large volume device modeling. We investigate the direct implicit algorithm and the explicit energy conserving algorithm as alternatives to the standard approach, both of which can reduce computational cost with a minimal (or controllable) impact on results. These algorithms are implemented into the well-tested EDIPIC-2D and LTP-PIC codes, and their performance is evaluated via 2D capacitively coupled plasma discharge simulations. The investigation reveals that both approaches enable the utilization of cell sizes larger than the Debye length, resulting in a reduced runtime, while incurring only minor inaccuracies in plasma parameters. The direct implicit method also allows for time steps larger than the electron plasma period; however, care must be taken to avoid numerical heating or cooling. It is demonstrated that by appropriately adjusting the ratio of cell size to time step, it is possible to mitigate this effect to an acceptable level.
In this paper we investigate how implementing machine learning could improve the efficiency of the search for Trans-Neptunian Objects (TNOs) within Dark Energy Survey (DES) data when used alongside orbit fitting. The discovery of multiple TNOs that appear to show a similarity in their orbital parameters has led to the suggestion that one or more undetected planets, an as yet undiscovered “Planet 9”, may be present in the outer solar system. DES is well placed to detect such a planet and has already been used to discover many other TNOs. Here, we perform tests on eight different supervised machine learning algorithms, using a data set consisting of simulated TNOs buried within real DES noise data. We found that the best performing classifier was the Random Forest which, when optimized, performed well at detecting the rare objects. We achieve an area under the receiver operating characteristic (ROC) curve, (AUC) = 0.996 ± 0.001. After optimizing the decision threshold of the Random Forest, we achieve a recall of 0.96 while maintaining a precision of 0.80. Finally, by using the optimized classifier to pre-select objects, we are able to run the orbit-fitting stage of our detection pipeline five times faster.
Controller area networks (CANs) are a broadcast protocol for real-time communication of critical vehicle subsystems. Original equipment manufacturers of passenger vehicles hold secret their mappings of CAN data to vehicle signals, and these definitions vary according to make, model, and year. Without these mappings, the wealth of real-time vehicle information hidden in the CAN packets is uninterpretable, severely impeding vehicle-related research, including CAN cybersecurity and privacy studies, aftermarket tuning, efficiency and performance monitoring, and fault diagnosis to name a few. Guided by the four-part CAN signal definition, we present CAN-D (CAN-Decoder), a modular, four-step pipeline for identifying each signal's boundaries (start bit and length), endianness (byte ordering), signedness (bit-to-integer encoding), and by leveraging diagnostic standards, augmenting a subset of the extracted signals with meaningful, physical interpretation. En route to CAN-D, we provide a comprehensive review of the CAN signal reverse engineering research. All previous methods ignore endianness and signedness, rendering them incapable of decoding many standard CAN signal definitions. Incorporating endianness grows the search space from 128 to 4.72E21 signal tokenizations and introduces a web of changing dependencies. In response, we formulate, formally analyze, and provide an efficient solution to an optimization problem, allowing identification of the optimal set of signal boundaries and byte orderings. In addition, we provide two novel, state-of-the-art signal boundary classifiers—both of which are superior to previous approaches in precision and recall in three different test scenarios—and the first signedness classification algorithm, which exhibits a $>$ 97% F-score. Altogether, CAN-D is the only solution with the potential to extract any CAN signal that is also the state of the art. In evaluation on 10 vehicles of different makes, CAN-D's average $\ell ^1$ error is five times better (81% less) than all previous methods and exhibits lower average error, even when considering only signals that meet prior methods’ assumptions. Finally, CAN-D is implemented in lightweight hardware, allowing for an on-board diagnostic (OBD-II) plugin for real-time in-vehicle CAN decoding.