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.
Viewgraphs on automatic management of parallel and distributed system resources are presented. Topics covered include: parallel applications; intelligent management of multiprocessing systems; performance evaluation of parallel architecture; dynamic concurrent programs; compiler-directed system approach; lattice gaseous cellular automata; and sparse matrix Cholesky factorization.
Biological experience and intuition suggest that self-replication is an inherently complex phenomenon, and early cellular automata models support that conception. More recently, simpler computational models of self-directed replication called sheathed loops have been developed. It is shown here that 'unsheathing' these structures and altering certain assumptions about the symmetry of their components leads to a family of nontrivial self-replicating structures some substantially smaller and simpler than those previously reported. The dependence of replication time and transition function complexity on initial structure size, cell state symmetry, and neighborhood are examined. These results support the view that self-replication is not an inherently complex phenomenon but rather an emergent property arising from local interactions in systems that can be much simpler than is generally believed.
Fast, efficient parallel algorithms are presented for discrete event simulations of dynamic channel assignment schemes for wireless cellular communication networks. The driving events are call arrivals and departures, in continuous time, to cells geographically distributed across the service area. A dynamic channel assignment scheme decides which call arrivals to accept, and which channels to allocate to the accepted calls, attempting to minimize call blocking while ensuring co-channel interference is tolerably low. Specifically, the scheme ensures that the same channel is used concurrently at different cells only if the pairwise distances between those cells are sufficiently large. Much of the complexity of the system comes from ensuring this separation. The network is modeled as a system of interacting continuous time automata, each corresponding to a cell. To simulate the model, conservative methods are used; i.e., methods in which no errors occur in the course of the simulation and so no rollback or relaxation is needed. Implemented on a 16K processor MasPar MP-1, an elegant and simple technique provides speedups of about 15 times over an optimized serial simulation running on a high speed workstation. A drawback of this technique, typical of conservative methods, is that processor utilization is rather low. To overcome this, new methods were developed that exploit slackness in event dependencies over short intervals of time, thereby raising the utilization to above 50 percent and the speedup over the optimized serial code to about 120 times.
Non-enzymatic, template-directed synthesis of oligonucleotides has been extensively studied in the laboratory as a model to understand the kind of chemical processes that might have contributed to the origin of life on Earth. Several oligonucleotides have been shown to catalyze the synthesis of their complements from activated mononucleotides; however, a restricted number of them have been found to self-replicate. Recently we developed an efficient modified cellular automata method that supports the study of self-replicating oligonucleotides. With this method the oligonucleotide molecules are represented as active cells imbedded in a two-dimensional array of inactive cells symbolizing the environment. Random movements and probability-governed chemical reactions occurring in a cellular space can effectively simulate the experimental behavior observed in self-directed replication of oligonucleotides.
The degree to which local climatic variations, eustatic sea level fluctuations, and tectonic uplift have influenced the development of Quaternary marine and fluvial landforms and deposits along the Red Sea coast, Eastern Desert, was investigated using a combination of remote sensing and field data, age determinations of corals, and numerical simulations. False color composites generated from Landsat Thematic Mapper and SPOT image data, digital elevation models derived from sterophotogrammetric analysis of SPOT data, and field observations document that a approximately 10-km wide swath inland from the coast is covered in many places with coalescing alluvial fans of Quaternary age. Wadis cutting through the fans exhibit several pairs of fluvial terraces, and wadi walls expose alluvium interbedded with corraline limestone deposits Further, three distinct coral terraces are evident along the coatline. Climatic, eustatic, and tectonic uplift controls on the overall system were simulated using a cellular automata algorithm with the following characteristics: (1) uplift as a function of position and time, as defined by the elevations and ages of corals; (2) climatic variations driven by insolation changes associated with Milankovitch cycles; (3) sea level fluctuations based on U/Th ages of coral terraces and eustatic data; and (4) parametrized fluvial erosion and deposition. Results imply that the fans and coralline limestones were generated in a setting in which the tectonic uplift rate decreased over the Quarternary to negligible values at present. Coralline limestones formed furing eustatic highstands when alluvium was trapped uspstream and wadis filled with debris. During lowstands, wadis cut into sedimentary deposits; coupled with continuing uplift, fans were dissected, leaving remnant surfaces, and wadi-related terraces were generated by down cutting. Only landforms from the past three to four eustatic sea level cycles (i.e., approximately 300 to 400 kyr) are likely to have survived erosion and deposition associated with fluvial processes.
Automatic formal verification methods for finite-state systems, also known as model-checking, successfully reduce labor costs since they are mostly automatic. Model checkers explicitly or implicitly enumerate the reachable state space of a system, whose behavior is described implicitly, perhaps by a program or a collection of finite automata. Simple properties, such as mutual exclusion or absence of deadlock, can be checked by inspecting individual states. More complex properties, such as lack of starvation, require search for cycles in the state graph with particular properties. Specifications to be checked may consist of built-in properties, such as deadlock or 'unspecified receptions' of messages, another program or implicit description, to be compared with a simulation, bisimulation, or language inclusion relation, or an assertion in one of several temporal logics. Finite-state verification tools are beginning to have a significant impact in commercial designs. There are many success stories of verification tools finding bugs in protocols or hardware controllers. In some cases, these tools have been incorporated into design methodology. Research in finite-state verification has been advancing rapidly, and is showing no signs of slowing down. Recent results include probabilistic algorithms for verification, exploitation of symmetry and independent events, and the use symbolic representations for Boolean functions and systems of linear inequalities. One of the most exciting areas for further research is the combination of model-checking with theorem-proving methods.
The paper identifies speed, agility, human interface, generation of sensitivity information, task decomposition, and data transmission (including storage) as important attributes for a computer environment to have in order to support engineering design effectively. It is argued that when examined in terms of these attributes the presently available environment can be shown to be inadequate a radical improvement is needed, and it may be achieved by combining new methods that have recently emerged from multidisciplinary design optimization (MDO) with massively parallel processing computer technology. The caveat is that, for successful use of that technology in engineering computing, new paradigms for computing will have to be developed - specifically, innovative algorithms that are intrinsically parallel so that their performance scales up linearly with the number of processors. It may be speculated that the idea of simulating a complex behavior by interaction of a large number of very simple models may be an inspiration for the above algorithms, the cellular automata are an example. Because of the long lead time needed to develop and mature new paradigms, development should be now, even though the widespread availability of massively parallel processing is still a few years away.
The paper identifies speed, agility, human interface, generation of sensitivity information, task decomposition, and data transmission (including storage) as important attributes for a computer environment to have in order to support engineering design effectively. It is argued that when examined in terms of these attributes the presently available environment can be shown to be inadequate. A radical improvement is needed, and it may be achieved by combining new methods that have recently emerged from multidisciplinary design optimisation (MDO) with massively parallel processing computer technology. The caveat is that, for successful use of that technology in engineering computing, new paradigms for computing will have to be developed - specifically, innovative algorithms that are intrinsically parallel so that their performance scales up linearly with the number of processors. It may be speculated that the idea of simulating a complex behaviour by interaction of a large number of very simple models may be an inspiration for the above algorithms; the cellular automata are an example. Because of the long lead time needed to develop and mature new paradigms, development should begin now, even though the widespread availability of massively parallel processing is still a few years away.
The paper identifies speed, agility, human interface, generation of sensitivity information, task decomposition, and data transmission (including storage) as important attributes for a computer environment to have in order to support engineering design effectively. It is argued that when examined in terms of these attributes the presently available environment can be shown to be inadequate. A radical improvement is needed, and it may be achieved by combining new methods that have recently emerged from multidisciplinary design optimisation (MDO) with massively parallel processing computer technology. The caveat is that, for successful use of that technology in engineering computing, new paradigms for computing will have to be developed - specifically, innovative algorithms that are intrinsically parallel so that their performance scales up linearly with the number of processors. It may be speculated that the idea of simulating a complex behaviour by interaction of a large number of very simple models may be an inspiration for the above algorithms; the cellular automata are an example. Because of the long lead time needed to develop and mature new paradigms, development should begin now, even though the widespread availability of massively parallel processing is still a few years away.
The aim of this research is to develop new mathematical methodology for the analysis of hybrid systems of the type involved in Air Traffic Control (ATC) problems. Two directions of investigation were initiated. The first used the methodology of nonlinear generalized functions, whose mathematical foundations were initiated by Colombeau and developed further by Oberguggenberger; it has been extended to apply to ordinary differential. Systems of the type encountered in control in joint work with the PI and M. Oberguggenberger. This involved a 'mixture' of 'continuous' and 'discrete' methodology. ATC clearly involves mixtures of two sorts of mathematical problems: (1) The 'continuous' dynamics of a standard control type described by ordinary differential equations (ODE) of the form: {dx/dt = f(x, u)} and (2) the discrete lattice dynamics involved of cellular automata. Most of the CA literature involves a discretization of a partial differential equation system of the type encountered in physics problems (e.g. fluid and gas problems). Both of these directions requires much thinking and new development of mathematical fundamentals before they may be utilized in the ATC work. Rather than consider CA as 'discretization' of PDE systems, I believe that the ATC applications will require a completely different and new mathematical methodology, a sort of discrete analogue of jet bundles and/or the sheaf-theoretic techniques to topologists. Here too, I have begun work on virtually 'virgin' mathematical ground (at least from an 'applied' point of view) which will require considerable preliminary work.
As the operation of large systems becomes ever more dependent on extensive automation, the need for an effective solution to the problem of design and validation of the underlying software becomes more critical. Large systems possess much detailed structure, typically hierarchical, and they are hybrid. Information processing at the top of the hierarchy is by means of formal logic and sentences; on the bottom it is by means of simple scalar differential equations and functions of time; and in the middle it is by an interacting mix of nonlinear multi-axis differential equations and automata, and functions of time and discrete events. The lecture will address the overall problem as it relates to flight vehicle management, describe the middle level, and offer a design approach that is based on Differential Geometry and Discrete Event Dynamic Systems Theory.
As the operation of large systems becomes ever more dependent on extensive automation, the need for an effective solution to the problem of design and validation of the underlying software becomes more critical. Large systems possesses much detailed structure, typically hierarchical, and they are hybrid. Information processing at the top of the hierarchy is by means of formal logic and sentences; on the bottom it is by means of simple scalar differential equations and functions of time; and in the middle it is by an interacting mix of nonlinear multi-axis differential equations and automata, and functions of time and discrete events. The lecture will address the overall problem as it relates to flight vehicle management, describe the middle level, and offer a design approach that is based on Differential Geometry and Discrete Event Dynamic Systems Theory.
Real-time, model-based, deduction has recently emerged as a vital component in AI's tool box for developing highly autonomous reactive systems. Yet one of the current hurdles towards developing model-based reactive systems is the number of methods simultaneously employed, and their corresponding melange of programming and modeling languages. This paper offers an important step towards unification. We introduce RMPL, a rich modeling language that combines probabilistic, constraint-based modeling with reactive programming constructs, while offering a simple semantics in terms of hidden state Markov processes. We introduce probabilistic, hierarchical constraint automata (PHCA), which allow Markov processes to be expressed in a compact representation that preserves the modularity of RMPL programs. Finally, a model-based executive, called Reactive Burton is described that exploits this compact encoding to perform efficIent simulation, belief state update and control sequence generation.
Complex system description is problematic when considering operator task activities interacting with system dynamics. Engineering languages have matured sufficiently to allow machine system description at various levels of depth and breadth but without operator synergy. Concurrently, Task Analysis methods have evolved along diverse lines enabling a description of the operator in the system from various paradigms but not describing the system. A void exists when attempting to view the system and the operator in the same plane. We propose a methodology employing descriptive languages from different domains viewed in a single dimension. Finite Automata (FA) languages describe the machine system in the proposed approach. Operator task specifications, a form of task analysis output, examine the operator activities within the system. Operator task specifications were then selected for discrete task activities and overlaid on the system description to examine operator inputs and subsequently view system responses. Unexpected (surprise) and undesirable system behavior was expected to emerge from this analysis. In this paper we shall first describe the methodology and show how the two perspectives, machine model and operator task specifications are integrated. Following we describe the process of doing such analysis using an example from cockpit automation. The methodology was employed in the analysis of a new function that was added to an existing automatic flight control system. We begin by defining a flight scenario involving all aspects of pilot interaction with the new function. Then, we proceed to develop a basic model of the machine behavior, in the context of pilot actions. Finally we superimpose the operator task specification on the machine model and perform the analysis. The proposed methodology may have broad appeal to system designers and human factors specialists. A common language for engineers of diverse domains is a strong point of this approach. Systems engineers may not fully understand operational considerations and human limitations, and human factors specialists may not be exposed to the full extent of system behavior. We hope the proposed methodology is adopted by both disciplines and in the process each assimilates a common language to address potential shortcomings of either approach separately.
We present an overview of the Java PathExplorer runtime verification tool, in short referred to as JPAX. JPAX can monitor the execution of a Java program and check that it conforms with a set of user provided properties formulated in temporal logic. JPAX can in addition analyze the program for concurrency errors such as deadlocks and data races. The concurrency analysis requires no user provided specification. The tool facilitates automated instrumentation of a program's bytecode, which when executed will emit an event stream, the execution trace, to an observer. The observer dispatches the incoming event stream to a set of observer processes, each performing a specialized analysis, such as the temporal logic verification, the deadlock analysis and the data race analysis. Temporal logic specifications can be formulated by the user in the Maude rewriting logic, where Maude is a high-speed rewriting system for equational logic, but here extended with executable temporal logic. The Maude rewriting engine is then activated as an event driven monitoring process. Alternatively, temporal specifications can be translated into efficient automata, which check the event stream. JPAX can be used during program testing to gain increased information about program executions, and can potentially furthermore be applied during operation to survey safety critical systems.
The purpose of this document is to propose a product-oriented software certification process to facilitate use of software synthesis and formal methods. Why is such a process needed? Currently, software is tested until deemed bug-free rather than proving that certain software properties exist. This approach has worked well in most cases, but unfortunately, deaths still occur due to software failure. Using formal methods (techniques from logic and discrete mathematics like set theory, automata theory and formal logic as opposed to continuous mathematics like calculus) and software synthesis, it is possible to reduce this risk by proving certain software properties. Additionally, software synthesis makes it possible to automate some phases of the traditional software development life cycle resulting in a more streamlined and accurate development process.
We present a theoretical framework for relating continuous partial differential equation (PDE) models of excitable media to discrete cellular automata (CA) models on a randomized lattice. These relations establish a quantitative link between the CA model and the specific physical system under study. We derive expressions for the CA model's plane wave speed, critical curvature, and effective diffusion constant in terms of the model's internal parameters (the interaction radius, excitation threshold, and time step). We then equate these expressions to the corresponding quantities obtained from solution of the PDEs (for a fixed excitability). This yields a set of coupled equations with a unique solution for the required CA parameter values. Here we restrict our analysis to "trigger" wave solutions obtained in the limiting case of a two-dimensional excitable medium with no recovery processes. We tested the correspondence between our CA model and two PDE models (the FitzHugh-Nagumo medium and a medium with a "sawtooth" nonlinear reaction source) and found good agreement with the numerical solutions of the PDEs. Our results suggest that the behavior of trigger waves is actually controlled by a small number of parameters.
This Minnowbrook IV 2003 workshop on Transition and Unsteady Aspects of Turbomachinery Flows includes the following topics: 1) Current Issues in Unsteady Turbomachinery Flows; 2) Global Instability and Control of Low-Pressure Turbine Flows; 3) Influence of End Wall Leakage on Secondary Flow Development in Axial Turbines; 4) Active and Passive Flow Control on Low Pressure Turbine Airfoils; 5) Experimental and Numerical Investigation of Transitional Flows as Affected by Passing Wakes; 6) Effects of Freestream Turbulence on Turbine Blade Heat Transfer; 7) Bypass Transition Via Continuous Modes and Unsteady Effects on Film Cooling; 8) High Frequency Surface Heat Flux Imaging of Bypass Transition; 9) Skin Friction and Heat Flux Oscillations in Upstream Moving Wave Packets; 10) Transition Mechanisms and Use of Surface Roughness to Enhance the Benefits of Wake Passing in LP Turbines; 11) Transient Growth Approach to Roughness-Induced Transition; 12) Roughness- and Freestream-Turbulence-Induced Transient Growth as a Bypass Transition Mechanism; 13) Receptivity Calculations as a Means to Predicting Transition; 14) On Streamwise Vortices in a Curved Wall Jet and Their Effect on the Mean Flow; 15) Plasma Actuators for Separation Control of Low Pressure Turbine Blades; 16) Boundary-Layer Separation Control Under Low-Pressure-Turbine Conditions Using Glow-Discharge Plasma Actuators; 17) Control of Separation for Low Pressure Turbine Blades: Numerical Simulation; 18) Effects of Elevated Free-Stream Turbulence on Active Control of a Separation Bubble; 19) Wakes, Calming and Transition Under Strong Adverse Pressure Gradients; 20) Transitional Bubble in Periodic Flow Phase Shift; 21) Modelling Spots: The Calmed Region, Pressure Gradient Effects and Background; 22) Modeling of Unsteady Transitional Flow on Axial Compressor Blades; 23) Challenges in Predicting Component Efficiencies in Turbomachines With Low Reynolds Number Blading; 24) Observations on the Causal Relationship Between Blade Count and Developing Rotating Stall in a Four Stage Axial Compressor; 25) Experimental and Numerical Study of Non-Linear Interactions in Transonic Nozzle Flow; 26) Clocking Effects on a Modern Stage and One-Half Transonic Turbine; 27) DNS and LES of Transition on Turbine Blades; 28) The Use of Cellular Automata in Modeling the Transition; 29) Predicting Unsteady Buffet Onset Using RANS Solutions; 30) Transition Modelling With the SST Turbulence Model and an Intermittency Transport; and 31) Equation Workshop Summary Transcript