IDC Reengineering Phase 2 Elaboration Iteration E1 Refines Event Storyboards.
Abstract not provided.
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.
Abstract not provided.
A technique for computer vision uses a polygon contour to trace an object. The technique includes rendering a polygon contour superimposed over a first frame of image data. The polygon contour is iteratively refined to more accurately trace the object within the first frame after each iteration. The refinement includes computing image energies along lengths of contour lines of the polygon contour and adjusting positions of the contour lines based at least in part on the image energies.
Manual chemical kinetic model construction often requires modelists to at least implicitly guess all possible decay pathways and their relative fluxes for all important species. We present a workflow and associated tool for automatic generation and re finement of pressure-dependent networks that should enable modelists to efficiently and comprehensively identify decay pathways and estimate respective parameters for chemical species. This tool combines the capabilities of the Reaction Mechanism Generator (RMG) software to generate possible reaction paths, determine thermochemistry, approximate rate coefficients and estimate frequencies with the capabilities of the Arkane software to use quantum chemical parameters to compute thermochemistry and pressure dependent rates. A flux-based algorithm is used to decide which isomers to add to the network. Isomers added to the network are reacted to form other channels. When enough of the flux is accounted for by the isomers and bimolecular product channels, the generation process terminates to yield a comprehensive network. Network sensitivity analysis is applied to the network to identify the most important wells and barriers that can be refined using quantum chemistry calculations. Iterative refinement can then be used to achieve accuracy. The comprehensive network can be easily reduced using energy and flux-based algorithms to the most important channels and isomers in the network.
Intelligent perturbation algorithms for space scheduling optimization are presented in the form of the viewgraphs. The following subject areas are covered: optimization of planning, scheduling, and manifesting; searching a discrete configuration space; heuristic algorithms used for optimization; use of heuristic methods on a sample scheduling problem; intelligent perturbation algorithms are iterative refinement techniques; properties of a good iterative search operator; dispatching examples of intelligent perturbation algorithm and perturbation operator attributes; scheduling implementations using intelligent perturbation algorithms; major advances in scheduling capabilities; the prototype ISF (industrial Space Facility) experiment scheduler; optimized schedule (max revenue); multi-variable optimization; Space Station design reference mission scheduling; ISF-TDRSS command scheduling demonstration; and example task - communications check.
This paper applies the Bayesian Model Averaging (BMA) statistical ensemble technique to estimate small molecule solvation free energies. There is a wide range methods for predicting solvation free energies, ranging from empirical statistical models to {\it ab initio} quantum mechanical approaches. Each of these methods are based on a set of conceptual assumptions that can affect a method's predictive accuracy and transferability. Using an iterative statistical process, we have selected and combined solvation energy estimates using an ensemble of 17 diverse methods from the SAMPL4 blind prediction study to form a single, aggregated solvation energy estimate. The ensemble design process evaluates the statistical information in each individual method as well as the performance of the aggregate estimate obtained from the ensemble as a whole. Methods that possess minimal or redundant information are pruned from the ensemble and the evaluation process repeats until aggregate predictive performance can no longer be improved. We show that this process results in a final aggregate estimate that outperforms all individual methods by reducing estimate errors by as much as 91% to 1.2 kcal/mol accuracy. We also compare our iterative refinement approach to other statistical ensemble approaches and demonstrate that this iterative process reduces estimate errors by as much as 61%. This work provides a new approach for accurate solvation free energy prediction and lays the foundation for future work on aggregate models that can balance computational cost with predictive accuracy.
Apex is a toolkit for constructing software that behaves intelligently and responsively in demanding task environments. Reflecting its origin at NASA where Apex continues to be developed, current applications include: a) Providing autonomous mission management and tactical control capabilities for unmanned aerial vehicles including an autonomous surveillance helicopter and a simulation prototype of an unmanned fixed-wing aircraft to be used for wildfire mapping; b) Simulating human air traffic controllers, pilots and astronauts to help predict how people might respond to changes in equipment or procedures; and c) Predicting the precise duration and sequence of routine human behaviors based on a human-computer interaction engineering technique called CPM-GOMS. Among Apex s components are a set of implemented reasoning services, such as those for reactive planning and temporal pattern recognition; a software architecture that embeds and integrates these services and allows additional reasoning elements to be added as extensions; a formal language for specifying agent knowledge; a simulation environment to facilitate prototyping and analysis; and Sherpa, a set of tools for visualizing autonomy logic and runtime behavior. In combination, these are meant to provide a flexible and usable framework for creating, testing, and deploying intelligent agent software. Overall, our goal in developing Apex is to lower economic barriers to developing intelligent software agents. New ideas about how to extend or modify the system are evaluated in terms of their impact in reducing the time, expertise, and inventiveness required to build and maintain applications. For example, potential enhancements to the AI reasoning capabilities in the system are reviewed not only for usefulness and distinctiveness, but also for their impact on the readability and general usability of Apex s behavior representation language (PDL) and on the transparency of resulting behavior. A second central part of our approach is to iteratively refine Apex based on lessons learned from as diverse a set of applications as possible. Many applications have been developed by users outside the core development team including engineers, researchers, and students. Usability is thus a central concern for every aspect of Apex visible to a user, including PDL, Sherpa, the Apex installation process, APIs, and user documentation. Apex users vary in their areas of expertise and in their familiarity with autonomy technology. Focusing on usability, a development philosophy summarized by the project motto "Usable Autonomy," has been important part of enabling diverse users to employ Apex successfully and to provide feedback needed to guide iterative, user-centered refinement.
Agile development methods, which have gone from outlier to mainstream in software development, are poised to expand into all aspects of space mission development. Modern software development operates on a principle of continuous deployment, where progress is verified not with conventional metrics, but with a continuous build, available to key stakeholders, enabling direct examination of the state of the code base, and assessment of progress through demonstration of capability. Delivery times are measured in weeks, not months. Stakeholders are part of the process on an ongoing basis. The cost of change is comparatively low and requirements, which often are not precisely defined at the start of a project, may be iteratively refined in a series of agile development cycles. Agile methods are compatible with traditional system engineering methods and may be tailored to the space operations environment. The low cost of change and iterative development cycles of agile enable requirements to be defined as outcomes and constraints, with design details to be refined during the development cycle. We are now at a point where agile methods may be extended beyond software, to Mission Systems, including the Mission Operations System and the Ground Data System. For NASA’s VIPER Lunar Rover Mission, scheduled to land at a lunar pole in late 2023, we are developing the Mission System using agile methods. As in agile software, where the measure of progress is working code, in agile mission system development, the measure of capability is what we can demonstrate. Demonstrations over presentations. We demonstrate mission system capability using simulations. The concept of operations, from commanding, to driving the rover, to how we downlink images for evaluation for a near-real time command cycle, will be tested and proven in simulation, years before we begin the traditional simulation cycle for training. “Say it then simulate it.” We develop and refine our designs using simulations, with an emphasis on new components of the system that are not well known early. For example, the required duration of a mission planning cycle for a lunar surface asset such as VIPER, that operates twenty-four hours a day, seven days a week, with continuous communications and a unique set of constraints based on the physics of the lunar poles and the line of site to Earth, is a unique problem in mission planning that is unlikely to be solved in a series of meetings. A small number of requirements specifying the outcomes may serve as the jumping off point to an agile development cycle, with demonstration in simulations. We have already demonstrated this process with simulations of rover driver decision time. VIPER is driven using near-real time command and control to waypoints. The driver decision time between waypoints is a fundamental enabling unit of productivity to accomplish the mission timeline. We have validated driver decision time in simulations of rover driving at the lunar South Pole, using the prototype mission tools for driving, command and control. The capability to develop and refine designs using simulations as part of agile Mission System development cycle changes the nature of team interactions, creating a focus on doing, rather than analyzing and documenting. Waterfall development cycles were, in part, a product of the significant cost of change in the early days of spaceflight. When the cost of change is high, it is vital to get your requirements right at the outset, because the system will be built to those specifications, and, when change is expensive, you better get it right early. However, modern technology has greatly lowered the cost of change, enabling iterative, rapid development cycles, in which key operations concepts may be tested and refined during development. Extending agile development to the Mission System for VIPER is a significant step in moving agile development methods for space operations beyond software, to the Mission System.
Current automated approaches for compositional model checking in the assume-guarantee style are based on learning of assumptions as deterministic automata. We propose an alternative approach based on abstraction refinement. Our new method computes the assumptions for the assume-guarantee rules as conservative and not necessarily deterministic abstractions of some of the components, and refines those abstractions using counter-examples obtained from model checking them together with the other components. Our approach also exploits the alphabets of the interfaces between components and performs iterative refinement of those alphabets as well as of the abstractions. We show experimentally that our preliminary implementation of the proposed alternative achieves similar or better performance than a previous learning-based implementation.
A new algebraic reconstruction technique (ART) code based on the iterative refinement method of least squares solution for tomographic reconstruction is presented. Accuracy and the convergence of the technique is evaluated through the application of numerically generated interferometric data. It was found that, in general, the accuracy of the results was superior to other reported techniques. The iterative method unconditionally converged to a solution for which the residual was minimum. The effects of increased data were studied. The inversion error was found to be a function of the input data error only. The convergence rate, on the other hand, was affected by all three parameters. Finally, the technique was applied to experimental data, and the results are reported.
Precision optics have been widely required in many advanced technological applications. X-ray mirrors, as an example, serve as the key optical components at synchrotron radiation and free electron laser facilities. They are rectangular silicon or glass substrates where a rectangular Clear Aperture (CA) needs to be polished to sub-nanometer Root Mean Squared (RMS) to keep the imaging capability of the incoming X-ray wavefront at the diffraction limit. The convolutional polishing model requires a CA to be extended with extra data, from which the dwell time is calculated via deconvolution. However, since deconvolution is very sensitive to boundary errors and noise, the existing surface extension methods can hardly fulfill the sub-nanometer requirement. On one hand, the figure errors in a CA were improperly modeled during the extension, leading to continuity issues along the boundary. On the other hand, uncorrectable high-frequency errors and noise were also extended. In this study, we propose a novel Robust Iterative Surface Extension (RISE) method that resolves these problems with a data fitting strategy. RISE models the figure errors in a CA with orthogonal polynomials and ensures that only correctable errors are fit and extended. Combined with boundary conditions, an iterative refinement of dwell time is then proposed to compensate the errors brought by the extension and deconvolution, which drastically reduces the estimated figure error residuals in a CA while the increase of total dwell time is negligible. To our best knowledge, RISE is the first data fitting-based surface extension method and is the first to optimize dwell time based on iterative extension. An experimental verification of RISE is given by fabricating two elliptic cylinders (10 mm × 80 mm CAs) starting from a sphere with a radius of curvature around 173 m using ion beam figuring. The figure errors in the two CAs greatly improved from 204.96 nm RMS and 190.28 nm RMS to 0.62 nm RMS and 0.71 nm RMS, respectively, which proves that RISE is an effective method for sub-nanometer level X-ray mirror fabrication.
An important class of mobile manipulation problems are move-to-grasp problems where a mobile robot must navigate to and pick up an object. One of the distinguishing features of this class of tasks is its coarse-to-fine structure. Near the beginning of the task, the robot can only sense the target object coarsely or indirectly and make gross motion toward the object. However, after the robot has located and approached the object, the robot must finely control its grasping contacts using precise visual and haptic feedback. This paper proposes that move-to-grasp problems are naturally solved by a sequence of controllers that iteratively refines what ultimately becomes the final solution. This paper introduces the notion of a refining sequence of controllers and characterizes this type of solution. The approach is demonstrated in a move-to-grasp task where Robonaut, the NASA/JSC dexterous humanoid, is mounted on a mobile base and navigates to and picks up a geological sample box. In a series of tests, it is shown that a refining sequence of controllers decreases variance in robot configuration relative to the sample box until a successful grasp has been achieved.
An important class of mobile manipulation problems are move-to-grasp problems where a mobile robot must navigate to and pick up an object. One of the distinguishing features of this class of tasks is its coarse-to-fine structure. Near the beginning of the task, the robot can only sense the target object coarsely or indirectly and make gross motion toward the object. However, after the robot has located and approached the object, the robot must finely control its grasping contacts using precise visual and haptic feedback. In this paper, it is proposed that move-to-grasp problems are naturally solved by a sequence of controllers that iteratively refines what ultimately becomes the final solution. This paper introduces the notion of a refining sequence of controllers and characterizes this type of solution. The approach is demonstrated in a move-to-grasp task where Robonaut, the NASA/JSC dexterous humanoid, is mounted on a mobile base and navigates to and picks up a geological sample box. In a series of tests, it is shown that a refining sequence of controllers decreases variance in robot configuration relative to the sample box until a successful grasp has been achieved.
Improvements are presented of a computer algorithm developed for the time-accurate flow analysis of rotating machines. The flow model is a finite volume method utilizing a high-resolution approximate Riemann solver for interface flux definitions. The numerical scheme is a block LU implicit iterative-refinement method which possesses apparent unconditional stability. Multiblock composite gridding is used to orderly partition the field into a specified arrangement of blocks exhibiting varying degrees of similarity. Block-block relative motion is achieved using local grid distortion to reduce grid skewness and accommodate arbitrary time step selection. A general high-order numerical scheme is applied to satisfy the geometric conservation law. An even-blade-count counterrotating unducted fan configuration is chosen for a computational study comparing solutions resulting from altering parameters such as time step size and iteration count. The solutions are compared with measured data.
In recent years, a new kind of accelerated hardware has gained popularity in the artificial intelligence (AI) community which enables extremely high-performance tensor contractions in reduced precision for deep neural network calculations. In this article, we exploit Nvidia Tensor cores, a prototypical example of such AI-hardware, to develop a mixed precision approach for computing a dense matrix factorization of the inverse overlap matrix in electronic structure theory, S –1 . This factorization of S –1 , written as ZZT = S –1 , is used to transform the general matrix eigenvalue problem into a standard matrix eigenvalue problem. Here we present a mixed precision iterative refinement algorithm where Z is given recursively using matrix–matrix multiplications and can be computed with high performance on Tensor cores. To understand the performance and accuracy of Tensor cores, comparisons are made to GPU-only implementations in single and double precision. Additionally, we propose a nonparametric stopping criteria which is robust in the face of lower precision floating point operations. The algorithm is particularly useful when we have a good initial guess to Z, for example, from previous time steps in quantum-mechanical molecular dynamics simulations or from a previous iteration in a geometry optimization.
This paper reports the results of a recently completed real-time adaptive drag minimization wind tunnel investigation of a highly flexible wing wind tunnel model equipped with the Variable Camber Continuous Trailing Flap (VCCTEF) technology at the University of Washington Aeronautical Laboratory (UWAL). The wind tunnel investigation is funded by NASA SBIR Phase II contract with Scientific Systems Company, Inc. (SSCI) and University of Washington (UW) as a subcontractor. The wind tunnel model is a sub-scale Common Research Model (CRM) wing constructed of foam core and fiberglass skin and is aeroelastically scaled to achieve a wing tip deflection of 10% of the wing semi-span which represents a typical wing tip deflection for a modern transport such as Boeing 787. The jig-shape twist of the CRM wing is optimized using a CART3D aero-structural model to achieve the minimum induced drag for the design cruise lift coefficient of 0.5. The wing is equipped with two chord wise cambered segments for each of the six span wise flap sections for a total of 12 individual flap segments that comprise the VCCTEF system. Each of the 12 flap segments is actively controlled by an electric servo-actuator. The real-time adaptive drag optimization strategy includes an on-board aerodynamic model identification, a model excitation, and a real-time drag optimization. The on-board aerodynamic model is constructed parametrically as a function of the angle of attack and flap positions to model the lift and drag coefficients of the wing. The lift coefficient models include a linear model and a second-order model. The drag coefficient models include a quadratic model and a higher-order up to 6th-order model to accurately model the drag coefficient at high angles of attack. The onboard aerodynamic model identification includes a recursive least-squares (RLS) algorithm and a batch least-squares (BLS) algorithm designed to estimate the model parameters. The model excitation method is designed to sample the input set that comprises the angle of attack and the flap positions. Three model excitation methods are developed: random excitation method, sweep method, and iterative angle-of-attack seeking method. The real-time drag optimization includes a generic algorithm developed by SSCI and several optimization methods developed by NASA which include a second-order gradient Newton-Raphson optimization method, an iterative gradient optimization method, a pseudo-inverse optimization method, an analytical optimization method, and an iterative refinement optimization method. The first wind tunnel test entry took place in September 2017. This test revealed major hardware issues and required further redesign of the flap servo mechanisms. The second test entry took place in April 2018. However, the test was not successful due to the issues with the onboard aerodynamic model identification RLS algorithm which incorrectly identified model parameters. This test also provides an experimental comparison study between the VCCTEF and a variable camber discrete trailing edge flap (VCDTEF) without the elastomer transition mechanisms. The experimental result confirms the benefit of the VCCTEF which produces lower drag by 5% than the VCDTEF. The third and final test entry took place in June 2018 after the issues with the RLS algorithm have been identified and corrected. Additional improvements were implemented. These include the BLS algorithm, the iterative angle-of-attack seeking method, the iterative gradient optimization method, and the pseudo-inverse optimization method. The test objectives were successfully demonstrated as the real-time drag optimization identifies several optimal solutions at off-design lift coefficients. The iterative gradient optimization method is found to achieve up to 4.7% drag reduction for the off-design lift coefficient of 0.7. The pseudo-inverse optimization method which does not require the drag coefficient model is found to be quite effective in reducing drag. Up to 9.4% drag reduction for the off-design lift coefficient of 0.7 is achieved with the pseudo-inverse optimization method. The wind tunnel investigation demonstrates the potential of real-time drag optimization technology. Several new capabilities are developed that could enable future adaptive wing technologies for flexible wings equipped with drag control devices such as the VCCTEF.
Purpose: Accurate delineation of organs at risk (OARs) is a precondition for intensity modulated radiation therapy. However, manual delineation of OARs is time consuming and prone to high interobserver variability. Because of image artifacts and low image contrast between different structures, however, the number of available approaches for autosegmentation of structures in the head-neck area is still rather low. In this project, a new approach for automated segmentation of head-neck CT images that combine the robustness of multiatlas-based segmentation with the flexibility of geodesic active contours and the prior knowledge provided by statistical appearance models is presented. Methods: The presented approach is using an atlas-based segmentation approach in combination with label fusion in order to initialize a segmentation pipeline that is based on using statistical appearance models and geodesic active contours. An anatomically correct approximation of the segmentation result provided by atlas-based segmentation acts as a starting point for an iterative refinement of this approximation. The final segmentation result is based on using model to image registration and geodesic active contours, which are mutually influencing each other. Results: 18 CT images in combination with manually segmented labels of parotid glands and brainstem were used in a leave-one-out cross validation scheme in order to evaluate the presented approach. For this purpose, 50 different statistical appearance models have been created and used for segmentation. Dice coefficient (DC), mean absolute distance and max. Hausdorff distance between the autosegmentation results and expert segmentations were calculated. An average Dice coefficient of DC = 0.81 (right parotid gland), DC = 0.84 (left parotid gland), and DC = 0.86 (brainstem) could be achieved. Conclusions: The presented framework provides accurate segmentation results for three important structures in the head neck area. Compared to a segmentation approach based on using multiple atlases in combination with label fusion, the proposed hybrid approach provided more accurate results within a clinically acceptable amount of time.
Purpose: Positron emission tomography (PET) is a nuclear medical imaging technology that produces 3D images reflecting tissue metabolic activity in human body. PET has been widely used in various clinical applications, such as in diagnosis of brain disorders. High-quality PET images play an essential role in diagnosing brain diseases/disorders. In practice, in order to obtain high-quality PET images, a standard-dose radionuclide (tracer) needs to be used and injected into a living body. As a result, it will inevitably increase the patient’s exposure to radiation. One solution to solve this problem is predicting standard-dose PET images using low-dose PET images. As yet, no previous studies with this approach have been reported. Accordingly, in this paper, the authors propose a regression forest based framework for predicting a standard-dose brain [{sup 18}F]FDG PET image by using a low-dose brain [{sup 18}F]FDG PET image and its corresponding magnetic resonance imaging (MRI) image. Methods: The authors employ a regression forest for predicting the standard-dose brain [{sup 18}F]FDG PET image by low-dose brain [{sup 18}F]FDG PET and MRI images. Specifically, the proposed method consists of two main steps. First, based on the segmented brain tissues (i.e., cerebrospinal fluid, gray matter, and white matter) in the MRI image, the authors extract features for each patch in the brain image from both low-dose PET and MRI images to build tissue-specific models that can be used to initially predict standard-dose brain [{sup 18}F]FDG PET images. Second, an iterative refinement strategy, via estimating the predicted image difference, is used to further improve the prediction accuracy. Results: The authors evaluated their algorithm on a brain dataset, consisting of 11 subjects with MRI, low-dose PET, and standard-dose PET images, using leave-one-out cross-validations. The proposed algorithm gives promising results with well-estimated standard-dose brain [{sup 18}F]FDG PET image and substantially enhanced image quality of low-dose brain [{sup 18}F]FDG PET image. Conclusions: In this paper, the authors propose a framework to generate standard-dose brain [{sup 18}F]FDG PET image using low-dose brain [{sup 18}F]FDG PET and MRI images. Both the visual and quantitative results indicate that the standard-dose brain [{sup 18}F]FDG PET can be well-predicted using MRI and low-dose brain [{sup 18}F]FDG PET.
Purpose: To develop a method for the fusion of 3D echocardiography and Scanning-Beam Digital X-ray (SBDX) fluoroscopy to assist with catheter device and soft tissue visualization during interventional procedures. Methods: SBDX is a technology for low-dose inverse geometry x-ray fluoroscopy that performs digital tomosynthesis at multiple planes in real time. In this study, transesophageal echocardiography (TEE) images were fused with SBDX images by estimating the 3D position and orientation (the “pose”) of the TEE probe within the x-ray coordinate system and then spatially transforming the TEE image data to match this pose. An initial pose estimate was obtained through tomosynthesis-based 3D localization of points along the probe perimeter. Position and angle estimates were then iteratively refined by comparing simulated projections of a 3D probe model against SBDX x-ray images. Algorithm performance was quantified by imaging a TEE probe in different known orientations and locations within the x-ray field (0-30 degree tilt angle, up to 50 mm translation). Fused 3D TEE/SBDX imaging was demonstrated by imaging a tissue-mimicking polyvinyl alcohol cylindrical cavity as a catheter was navigated along the cavity axis. Results: Detected changes in probe tilt angle agreed with the known changes to within 1.2 degrees. For a 50 mm translation along the source-detector axis, the detected translation was 50.3 mm. Errors for in-plane translations ranged from 0.1 to 0.9 mm. In a fused 3D TEE/SBDX display, the catheter device was well visualized and coincident with the device shadow in the TEE images. The TEE images portrayed phantom boundaries that were not evident under x-ray. Conclusion: Registration of soft tissue anatomy derived from TEE imaging and device imaging from SBDX x-ray fluoroscopy is feasible. The simultaneous 3D visualization of these two modalities may be useful in interventional procedures involving the navigation of devices to soft tissue anatomy.