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.
Reconfigurable, fault-tolerant systems modeled. Semi-Markov unreliability-range evaluator (SURE) computer program is software tool for analysis of reliability of reconfigurable, fault-tolerant systems. Based on new method for computing death-state probabilities of semi-Markov model. Computes accurate upper and lower bounds on probability of failure of system. Written in PASCAL.
Bandit is a 3-kg automated spacecraft in development at Washington University in St. Louis. Bandit's primary mission is to demonstrate proximity navigation, including docking, around a 25-kg student-built host spacecraft. However, because of extreme constraints in mass, power and volume, traditional sensing and actuation methods are not available. In particular, Bandit carries only 8 fixed-magnitude cold-gas thrusters to control its 6 DOF motion. Bandit lacks true inertial sensing, and the ability to sense position relative to the host has error bounds that approach the size of the Bandit itself. Some of the navigation problems are addressed through an extremely robust, error-tolerant soft dock. In addition, we have identified a control methodology that performs well in this constrained environment: behavior-based velocity potential functions, which use a minimum-seeking method similar to Lyapunov functions. We have also adapted the discrete Kalman filter for use on Bandit for position estimation and have developed a similar measurement vs. propagation weighting algorithm for attitude estimation. This paper provides an overview of Bandit and describes the control and estimation approach. Results using our 6DOF flight simulator are provided, demonstrating that these methods show promise for flight use.
Message estimation of sample function from continuous Gaussian random process, establishing and evaluating optimal bounds for procedure
Davies and Wakerly show that Byzantine fault tolerance can be achieved by a cascade of broadcasts and middle value select functions. We present an extension of the Davies and Wakerly protocol, the unified protocol, and its proof of correctness. We prove that it satisfies validity and agreement properties for communication of exact values. We then introduce bounded communication error into the model. Inexact communication is inherent for clock synchronization protocols. We prove that validity and agreement properties hold for inexact communication, and that exact communication is a special case. As a running example, we illustrate the unified protocol using the SPIDER family of fault-tolerant architectures. In particular we demonstrate that the SPIDER interactive consistency, distributed diagnosis, and clock synchronization protocols are instances of the unified protocol.
An analysis was performed to identify the engineering rationale for the existing particulate limits in MSFC-SPEC-164, Cleanliness of Components for Use in Oxygen, Fuel, and Pneumatic Systems, determine the applicability of this rationale to fibers, identify potential risks that may result from fiber contamination in liquid oxygen/fuel bipropellant systems, and bound each of these risks. The objective of this analysis was to determine whether fiber contamination exceeding the established quantitative limits for particulate can be tolerated in these systems and, if so, to derive and recommend quantitative allocations for fibers beyond the limits established for other particulate. Knowledge gaps were identified that limit a complete understanding of the risk of promoted ignition from an accumulation of fibers in a gaseous oxygen system.
Networked communications in space are necessary to achieve scalability in terms of the number of communicating nodes but also in terms of the overall system complexity. A key component to such a system is the ability to synchronize clocks, which is the focus of this paper. The so-called Solar System Internet (SSI) will be built upon Delay Tolerant Networking (DTN), which, in analogy to the Internet Protocol (IP), can be considered a suite of protocols necessary for networking in the space domain. Therefore, our goal is to extend this suite to include a DTN clock synchronization capability, analogous to the Network Time Protocol (NTP) used in the Internet. A motivating example of a network in space is NASA’s LunaNet, a vision for a multi-hop multi-path network extending to the moon wherein not all nodes will have direct connections to an authoritative reference clock. In this paper, we propose a general clock synchronization methodology and algorithm that could be used for LunaNet as well as more elaborate time-varying networks. In recent years, DTN has benefited from modeling efforts founded on the mathematical tool of sheaves. Here we continue this work to provide an approach to clock synchronization. Due to the time-varying nature of space networks, absolute consensus is not possible. However, the sheaf Laplacian provides a practical, distributed approach to approximating consensus by allowing data to diffuse through the network. In particular, the sheaf Laplacian is readily computable, lending our approach to implementation. Our approach is well suited to handle the difficulties of space networks. For instance, differences in clock accuracy mean certain nodes are more authoritative than others; we can account for these differences through hierarchies in the network, generalizing the strata in NTP. Furthermore, just as error estimation is an integral part of NTP, we are able to give concrete error bounds for our approach. Indeed, different applications (e.g., communications schedules, pointing, navigation, distributed science) will have different requirements, hence it is necessary to maintain clocks within a given tolerance. We outline some of the necessary steps to turn our approach into a practical network protocol that could be used in DTN, and we conclude the paper with suggestions for future research.
A validation method for the synchronization subsystem of a fault-tolerant computer system is presented. The high reliability requirement of flight-crucial systems precludes the use of most traditional validation methods. The method presented utilizes formal design proof to uncover design and coding errors and experimentation to validate the assumptions of the design proof. The experimental method is described and illustrated by validating the clock synchronization system of the Software Implemented Fault Tolerance computer. The design proof of the algorithm includes a theorem that defines the maximum skew between any two nonfaulty clocks in the system in terms of specific system parameters. Most of these parameters are deterministic. One crucial parameter is the upper bound on the clock read error, which is stochastic. The probability that this upper bound is exceeded is calculated from data obtained by the measurement of system parameters. This probability is then included in a detailed reliability analysis of the system.
In a fault tolerant control (FTC) system, a parameter varying FTC law is reconfigured based on fault parameters estimated by fault detection and isolation (FDI) modules. FDI modules require some time to detect fault occurrences in aero-vehicle dynamics. In this paper, an FTC analysis framework is provided to calculate the upper bound of an induced-L(sub 2) norm of an FTC system with existence of false identification and detection time delay. The upper bound is written as a function of a fault detection time and exponential decay rates and has been used to determine which FTC law produces less performance degradation (tracking error) due to false identification. The analysis framework is applied for an FTC system of a HiMAT (Highly Maneuverable Aircraft Technology) vehicle. Index Terms fault tolerant control system, linear parameter varying system, HiMAT vehicle.
Tracing the flow of solid matter during an explosion requires a rugged tag that can be measured by a unique identifiable signature. Silica-covered semiconductor quantum dots (QDs) provide a unique and tunable photoluminescent signature that emits from within a sacrificial outer layer. Five types of silica-covered zinc sulfide QDs were synthesized and covalently bound to commercial luminescent powders. The combination of five dots and five powders enables a matrix of 25 unique tags. The tracers are shown to be tolerant of environments associated with chemical explosives and provides a unique tag to evaluate debris fields.
The design characteristics are presented of a fuel tolerant variable geometry staged air combustor using regenerative/convective cooling. The rich/quench/lean variable geometry combustor is designed to achieve low NO(x) emission from fuels containing fuel bound nitrogen. The physical size of the combustor was calculated for a can-annular combustion system with associated operating conditions for the Allison 570-K engine. Preliminary test results indicate that the concept has the potential to meet emission requirements at maximum continuous power operation. However, airflow sealing and improved fuel/air mixing are necessary to meet Department of Energy program goals.
This test report provides the results of radiation tolerance robustness testing that was performed on samples of robotic components and an ultrasonic guided wave air-slot sensor that represent components/sub-systems of the Robotic Air-slot Volumetric Inspection System (RAVIS) that has been engineered for volumetric inspection of Hanford tank bottom plates via under-tank refractory pad air-slots. The specific components tested for 1) functionality during active irradiation and 2) tolerance to cumulative radiation dose (until failure or upon reaching a cumulative dose test limit) were: • four samples each of a printed circuit board (PCB) and direct current (DC) motor, which are robotic components, and • 26 ultrasonic piezoelectric elements (samples) inside an air-slot sensor. The robotic components are part of the RAVIS air-slot inspection crawler drive control system that is responsible for remote communication with and actuation of the air-slot inspection crawler. The failure of either of these components during under-tank deployment would require manual retrieval via the crawler’s tether, which risks damage to the robot/refractory/tank. Preemptive replacement of the components at appropriately conservative dose/time intervals informed by failure dose would reduce the likelihood of under-tank failure. The components were included in radiation tolerance testing to quantify their failure doses to inform replacement intervals. The air-slot sensor is responsible for collecting ultrasonic inspection data (scan images) for the tank bottom plates during under-tank deployment. Compromised signal quality due to elevated noise levels caused by gamma radiation would compromise inspection performance. The air-slot sensor was included in radiation tolerance testing to quantify the impact of active irradiation on sensor signal quality. The irradiation and in-situ functional tests of the PCBs, DC motors and air-slot sensor took place in June and July 2020 at the Pacific Northwest National Laboratory. Testing was performed at a gamma dose rate near 300 rad/hr., which, in the absence of under-tank dose rate data, has been conservatively estimated to be the upper-bound dose rate beneath the primary tanks at Hanford. Irradiation took place at elevated temperatures of 150-200°F to determine failure doses that reflect the compounding effects of gamma radiation and heat. The test results revealed: • The DC motors can tolerate being actively irradiated at the high dose rate at 200°F and can tolerate a cumulative dose of 300,000 rad, that which would be incurred after 5 years of service at the 300 rad/hr dose rate. The component therefore meets minimum and preferred radiation tolerance and lifecycle requirements for robotic components. • The air-slot sensor can tolerate being actively irradiated at the high dose rate at 150°F and can tolerate a cumulative dose of 60,000 rad, that which would be incurred after 1 year of service at the 300 rad/hr dose rate. The sensor therefore meets minimum radiation tolerance and lifecycle requirements. • The PCB can tolerate being actively irradiated at the high dose rate, but can only tolerate a cumulative dose of 19,000 rad at 150-200°F. The PCB does not meet minimum radiation tolerance and lifecycle requirements; however, because the component is considered replaceable, it can be replaced before a cumulative dose of 19,000 rad is reached, determined through either monitoring with a dosimeter or scheduled time intervals that are calculated based on conservative estimates of under-tank dose rates.
Semi-Markov Unreliability Range Evaluator, SURE, computer program is software tool for analysis of reconfigurable, fault-tolerant systems. Traditional reliability analyses based on aggregates of fault-handling and fault-occurrence models. SURE provides efficient means for calculating accurate upper and lower bounds for probabilities of death states for large class of semi-Markov mathematical models, and not merely those reduced to critical-pair architectures.
The fusion of hydrogenases and photosynthetic reaction centers (RCs) has proven to be a promising strategy for the production of sustainable biofuels. Type I (iron-sulfur-containing) RCs, acting as photosensitizers, are capable of promoting electrons to a redox state that can be exploited by hydrogenases for the reduction of protons to dihydrogen (H 2 ). While both [FeFe] and [NiFe] hydrogenases have been used successfully, they tend to be limited due to either O 2 sensitivity, binding specificity, or H 2 production rates. In this study, we fuse a peripheral (stromal) subunit of Photosystem I (PS I), PsaE, to an O 2 -tolerant [FeFe] hydrogenase from Clostridium beijerinckii using a flexible [GGS] 4 linker group (CbHydA1-PsaE). We demonstrate that the CbHydA1 chimera can be synthetically activated in vitro to show bidirectional activity and that it can be quantitatively bound to a PS I variant lacking the PsaE subunit. When illuminated in an anaerobic environment, the nanoconstruct generates H 2 at a rate of 84.9 ± 3.1 µmol H 2 mg chl –1 h –1 . Further, when prepared and illuminated in the presence of O 2 , the nanoconstruct retains the ability to generate H 2 , though at a diminished rate of 2.2 ± 0.5 µmol H 2 mg chl –1 h –1 . This demonstrates not only that PsaE is a promising scaffold for PS I-based nanoconstructs, but the use of an O 2 -tolerant [FeFe] hydrogenase opens the possibility for an in vivo H 2 generating system that can function in the presence of O 2 .
A validation method for the synchronization subsystem of a fault-tolerant computer system is presented. The high reliability requirement of flight crucial systems precludes the use of most traditional validation methods. The method presented utilizes formal design proof to uncover design and coding errors and experimentation to validate the assumptions of the design proof. The experimental method is described and illustrated by validating an experimental implementation of the Software Implemented Fault Tolerance (SIFT) clock synchronization algorithm. The design proof of the algorithm defines the maximum skew between any two nonfaulty clocks in the system in terms of theoretical upper bounds on certain system parameters. The quantile to which each parameter must be estimated is determined by a combinatorial analysis of the system reliability. The parameters are measured by direct and indirect means, and upper bounds are estimated. A nonparametric method based on an asymptotic property of the tail of a distribution is used to estimate the upper bound of a critical system parameter. Although the proof process is very costly, it is extremely valuable when validating the crucial synchronization subsystem.
In 1987, Schneider presented a general paradigm that provides a single proof of a number of fault tolerant clock synchronization algorithms. His proof was subsequently subjected to the rigor of mechanical verification by Shankar. However, both Schneider and Shankar assumed a condition Shankar refers to as a bounded delay. This condition states that the elapsed time between synchronization events (i.e., the time that the local process applies an adjustment to its logical clock) is bounded. This property is really a result of the algorithm and should not be assumed in a proof of correctness. This paper remedies this by providing a proof of this property in the context of the general paradigm proposed by Schneider. The argument given is a generalization of Welch and Lynch's proof of a related property for their algorithm.
This paper presents an approach for the generation of closed manifold surface triangulations from CAD geometry. CAD parts and assemblies are used in their native format, without translation, and a part's native geometry engine is accessed through a modeler-independent application programming interface (API). In seeking a robust and fully automated procedure, the algorithm is based on a new physical space manifold triangulation technique which was developed to avoid robustness issues associated with poorly conditioned mappings. In addition, this approach avoids the usual ambiguities associated with floating-point predicate evaluation on constructed coordinate geometry in a mapped space, The technique is incremental, so that each new site improves the triangulation by some well defined quality measure. Sites are inserted using a variety of priority queues to ensure that new insertions will address the worst triangles first, As a result of this strategy, the algorithm will return its 'best' mesh for a given (prespecified) number of sites. Alternatively, the algorithm may be allowed to terminate naturally after achieving a prespecified measure of mesh quality. The resulting triangulations are 'CFD-ready' in that: (1) Edges match the underlying part model to within a specified tolerance. (2) Triangles on disjoint surfaces in close proximity have matching length-scales. (3) The algorithm produces a triangulation such that no angle is less than a given angle bound, alpha, or greater than Pi - 2alpha This result also sets bounds on the maximum vertex degree, triangle aspect-ratio and maximum stretching rate for the triangulation. In addition to tile output triangulations for a variety of CAD parts, tile discussion presents related theoretical results which assert the existence of such all angle bound, and demonstrate that maximum bounds of between 25 deg and 30 deg may be achieved in practice.
Carbon dioxide is an attractive working fluid for many cycles, including for pumped thermal energy storage (PTES). A challenge with some proposed sCO2 PTES cycles is the operation of sCO2 machinery outside the typical bounds of experience, with local phase change from the liquid state being particularly unknown. Presently, there is insufficient data in the literature regarding multiphase CO2 to adequately design a multiphase-tolerant turbine, so generation of foundational data is required. This experimental study investigates the flow characteristics of sub-sonic liquid CO2 undergoing expansion and phase change in a converging-diverging nozzle. The nozzle is instrumented to measure static pressure, unsteady pressure, temperature, and density. The static pressure transducers are located at 27 axial locations to accurately characterize the pressure profile in the nozzle. High-accuracy RTDs are located at the entrance and exit of the nozzle, and three dynamic pressure transducers are strategically located to capture any unsteady phenomena. During testing, values of mass flow and nozzle inlet pressure are swept to vary the pressure drop and fluid properties. The measured total pressure drop in the nozzle is compared to a homogenous model and the Lockhart-Martinelli correlation method, with the latter predicting loss quite closely. The resulting data set is valuable for validating multiphase numerical models in a simple geometry before implementation of these models in turbomachinery design.
The goal of Delay Tolerant Networking (DTN) is to take a collection of heterogeneous, disparate connections between satellites, space assets, ground stations, and ground infrastructure and bring it together into a cohesive, functioning overlay network. Depending on the systems being considered, one can find links with a one-way light time exceeding minutes (and hours),periodic links which can sometimes be predicted by orbital mechanics, and restrictions based on the variety of capabilities built into these systems. These characteristics preclude traditional network models and routing techniques and have classically led to either rigid routing tables or purely probabilistic models. As the deeper underlying structures remain unknown, development of more DTN-optimized algorithms has lacked the necessary foundation. In a continuation of previous work, the goal of this paper is to identify and study these fundamental structures that exist in delay tolerant networks (DTN), with a focus on space networks. The current routing methodology has been to use contact graph routing (CGR) algorithms. CGR models a series of known contacts as a static graph. For CGR to work, this graph must be globally consistent and must have an accurate picture of the network. Because this is a globally controlled structure, there is little room for flexibility in the event of changes to the network which would naturally occur as the network grows. As a response to the desire for flexibility as the network changes, we introduced the mathematical structure known as sheaves to DTNs last year. The tag-line for sheaves is that they are a mathematically precise way of gluing local data together into unique global data. Thus, sheaves lend extra power to traditional models(and routing algorithms) by taking additional information and merging it, in as consistent a manner as possible, with the representation itself. The clearest example of how Earth-bound networks exhibit behavior that is “sheafy” is link state routers, which build a local-to-global picture of their network by gluing local information together into a global network, exactly as a sheaf would do. For routing within delay tolerant networks to truly exploit this structure, a deeper structure than a graph is required. In this paper, we develop sheaves that can work over directed graphs such as temporal flow networks, we construct a sheaf representation for Dijkstra’s algorithm, and we outline a construction for routing sheaves capable of modeling multicast scenarios. Finally, there is a section of future work suggesting follow-on research.