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.
A procedure is developed for obtaining generalized flip-flop input equations, and a concise method is presented for representing these equations. The procedure is based on solving a four-valued characteristic equation of the flip-flop, and can encompass flip-flops that are too complex to approach intuitively. The technique is presented using Karnaugh maps, but could easily be implemented in software.
Explore the source record for details and available documents.
The results of a series of Perfectly Stirred Reactor (PSR) and Partially Stirred Reactor (PaSR) simulations are compared to each other over a wide range of operating conditions. It is found that the PaSR results can be simulated by a PSR solution with just an adjusted chemical reaction rate. A simple expression has been developed that gives the required change in reaction rate for a PSR solution to simulate the PaSR results. This expression is the basis of a simple turbulence-chemistry interaction model. The interaction model that has been developed is intended for use with simple one-step global reaction mechanisms and for steady-state flow simulations. Due to the simplicity of the model there is very little additional computational cost in adding it to existing CFD codes.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
The effective parallel symbolic computation of operators under composition is discussed. Examples include differential operators under composition and vector fields under the Lie bracket. Data structures consisting of formal linear combinations of rooted labeled trees are discussed. A multiplication on rooted labeled trees is defined, thereby making the set of these data structures into an associative algebra. An algebra homomorphism is defined from the original algebra of operators into this algebra of trees. An algebra homomorphism from the algebra of trees into the algebra of differential operators is then described. The cancellation which occurs when noncommuting operators are expressed in terms of commuting ones occurs naturally when the operators are represented using this data structure. This leads to an algorithm which, for operators which are derivations, speeds up the computation exponentially in the degree of the operator. It is shown that the algebra of trees leads naturally to a parallel version of the algorithm.
It took much effort in the early days of non-Euclidean geometry to break away from the mindset that all spaces are flat and that two distinct parallel lines do not cross. Up to that point, all that was known was Euclidean geometry, and it was difficult to imagine anything else. We have suffered a similar handicap brought on by the enormous relevance of Boolean algebra to the problems of our age-logic and set theory. Previously, I demonstrated that the algebra of questions is not Boolean, but rather is described by the free distributive algebra. To get to this stage took much effort, as many obstacles-most self-placed-had to be overcome. As Boolean algebras were all I had ever known, it was almost impossible for me to imagine working with an algebra where elements do not have complements. With this realization, it became very clear that the sum and product rules of probability theory at the most basic level had absolutely nothing to do with the Boolean algebra of logical statements. Instead, a measure of degree of inclusion can be invented for many different partially ordered sets, and the sum and product rules fall out of the associativity and distributivity of the algebra. To reinforce this very important idea, this paper will go over how these constructions are made, while focusing on the underlying assumptions. I will derive the sum and product rules for a distributive lattice in general and demonstrate how this leads to probability theory on the Boolean lattice and is related to the calculus of quantum mechanical amplitudes on the partially ordered set of experimental setups. I will also discuss the rules that can be derived from modular lattices and their relevance to the cross-ratio of projective geometry.
The algebraic theory of thermodynamics developed in a previous paper is extended to include the algebraic structure that arises from the introduction of a physical body into the theory. The extension is based on very general definitions of both the thermodynamic states of a body and subsystems of that body. The algebraic analysis, which includes bodies in nonuniform states, shows that the set of all thermodynamic states of a body has the same algebraic structure as the set of thermodynamic states and that composite systems are induced by the algebraic structure of thermodynamic states. The analysis also justifies a variational treatment of thermodynamic bodies in uniform as well as nonuniform states. The variational calculation includes all conventional methods of calculation as special cases and helps to illuminate the origin and interpretation of the electrochemical potential.
Several approaches for developing the equations of motion for a three-degree-of-freedom PUMA robot were compared on the basis of computational efficiency (i.e., the number of additions, subtractions, multiplications, and divisions). Of particular interest was the investigation of the use of computer algebra as a tool for developing the equations of motion. Three approaches were implemented algebraically: Lagrange's method, Kane's method, and Wittenburg's method. Each formulation was developed in absolute and relative coordinates. These six cases were compared to each other and to a recursive numerical formulation. The results showed that all of the formulations implemented algebraically required fewer calculations than the recursive numerical algorithm. The algebraic formulations required fewer calculations in absolute coordinates than in relative coordinates. Each of the algebraic formulations could be simplified, using patterns from Kane's method, to yield the same number of calculations in a given coordinate system.
The noise (variance squared) of a component of the electromagnetic field - considered as a quantum oscillator - in the vacuum is equal to one half, in appropriate units (taking Planck's constant and the mass and frequency of the oscillator all equal to 1). A practical definition of a squeezed state is one for which the noise is less than the vacuum value - and the amount of squeezing is determined by the appropriate ratio. Thus the usual coherent (Glauber) states are not squeezed, as they produce the same variance as the vacuum. However, it is not difficult to define states analogous to coherent states which do have this noise-reducing effect. In fact, they are coherent states in the more general group sense but with respect to groups other than the Heisenberg-Weyl Group which defines the Glauber states. The original, conventional squeezed state in quantum optics is that associated with the group SU(1,1). Just as the annihilation operator a of a single photon mode (and its hermitian conjugate a, the creation operator) generates the Heisenberg Weyl algebra, so the pair-photon operator a(sup 2) and its conjugate generates the algebra of the group SU(1,1). Another viewpoint, more productive from the calculational stance, is to note that the automorphism group of the Heisenberg-Weyl algebra is SU(1,1). Needless to say, each of these viewpoints generalizes differently to the quantum group context. Both are discussed. The following topics are addressed: conventional coherent and squeezed states; eigenstate definitions; exponential definitions; algebra (group) definitions; automorphism group definition; example: signal-to-noise ratio; q-coherent and q-squeezed states; M and P q-bosons; eigenstate definitions; exponential definitions; algebra (q-group) definitions; and automorphism q-group definition.
In this paper, the electromagnetic scattering solution for a grass blade with complex cross-section geometry is considered. It is assumed that the blade cross section is electrically small, but its length is large compared to the incident wavelength. In a recent study it has been shown that the scattering solution for such problems, in the form of a polarizability tensor, can be obtained using the low-frequency approximation in conjunction with the method of moments. In addition, the study shows that the relationship between the polarizability tensor of a dielectric cylinder and its dielectric constant can be approximated by a simple algebraic expression. The results of this study are used to show that this algebraic approximation is valid also for cylinders with cross sections the shape of grass blades, providing that proper values am selected for each of three constants appearing in the expression. These constants are dependent on cylinder shape, and if the relationship between the constants and the three parameters describing a grass blade shape can be determined, an algebraic approximation relating polarizability tensor to blade shape, as well as dielectric constant, can be formed. Since the elements of the polarizability tensor are dependent on only these parameters, this algebraic approximation can replace the cumbersome method of moments model. A conjugate gradient method is then implemented to correctly determine the three constants of the algebraic approximation for each blade shape. A third-order polynomial fit to the data is then determined for each constant, thus providing a complete analytic replacement to the numerical (moment method) scattering model. Comparisons of this approximation to the numerical model show an average error of less than 3%.
The ability of three types of turbulence models to accurately predict the effects of curvature on the flow in a U-duct is studied. An explicit algebraic stress model performs slightly better than one- or two-equation linear eddy viscosity models, although it is necessary to fully account for the variation of the production-to-dissipation-rate ratio in the algebraic stress model formulation. In their original formulations, none of these turbulence models fully captures the suppressed turbulence near the convex wall, whereas a full Reynolds stress model does. Some of the underlying assumptions used in the development of algebraic stress models are investigated and compared with the computed flowfield from the full Reynolds stress model. Through this analysis, the assumption of Reynolds stress anisotropy equilibrium used in the algebraic stress model formulation is found to be incorrect in regions of strong curvature. By the accounting for the local variation of the principal axes of the strain rate tensor, the explicit algebraic stress model correctly predicts the suppressed turbulence in the outer part of the boundary layer near the convex wall.
The last century saw the application of Boolean algebra toward the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines. in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. However, modern intelligent machines work by inferring knowledge using only their pre-programmed prior knowledge and the data provided. They lack the ability to ask questions, or request data that would aid their inferences. Recent advances in understanding the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we identified the algebra of questions as the free distributive algebra, which now allows us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper we describe this logic of inference and inquiry using the mathematics of partially ordered sets and the scaffolding of lattice theory, discuss the far-reaching implications of the methodology, and demonstrate its application with current examples in machine learning. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them to not only make inferences from data, but also decide which question to ask, experiment to perform, or measurement to take given what they have learned and what they are designed to understand.
The last century saw the application of Boolean algebra to the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines, in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. Recent advances in our understanding of the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we recently identified the algebra of questions as the free distributive algebra, which will now allow us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper, we examine the foundations of inference and inquiry. We begin with a history of inferential reasoning, highlighting key concepts that have led to the automation of inference in modern machine-learning systems. We then discuss the foundations of inference in more detail using a modern viewpoint that relies on the mathematics of partially ordered sets and the scaffolding of lattice theory. This new viewpoint allows us to develop the logic of inquiry and introduce a measure describing the relevance of a proposed question to an unresolved issue. Last, we will demonstrate the automation of inference, and discuss how this new logic of inquiry will enable intelligent machines to ask questions. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them not only to make inferences from data, but also to decide which question to ask, which experiment to perform, or which measurement to take given what they have learned and what they are designed to understand.
This paper presents a numerical study of the effects of expansion ratio on two-dimensional separating and reattaching flows in plane backward-facing step geometries with parallel walls. Closure of the Reynolds equations was achieved by four different turbulence models: k-epsilon, 'modified' k-epsilon, algebraic stress, and 'modified' algebraic stress models. The k-epsilon model relates the Reynolds stresses to the mean rate of strain through the definition of an isotropic turbulent viscosity. The more advanced algebraic stress model calculates the stresses from implicit algebraic relationships containing the stresses themselves, the mean rate of strain, and the turbulent kinetic energy and its dissipation rate. 'Modified' versions of the models employ a new dissipation rate equation whose production term was made more sensitive to streamwise curvature effects. A new nonequilibrium wall function treatment proposed by Chieng and Launder (1980) was also incorporated into each model.
Report shows how spatial-operator algebra developed by authors used to derive linearized mathematical models of dynamics of robotic manipulators. Aspects of spatial-operator algebra also described in "Robot Control Based On Spatial-Operator Algebra" (NPO-17918), "Unified Formulation Of Dynamics Of Robot Arms" (NPO-18040), and "Spatial-Operator Algebra For Robotic Manipulators" (NPO-17770).
This thesis is organized in two parts. In Part 1, control systems described by a class of nonlinear differential and algebraic equations are introduced. A procedure for local stabilization based on a local state realization is developed. An alternative approach to local stabilization is developed based on a classical linearization of the nonlinear differential-algebraic equations. A theoretical framework is established for solving a tracking problem associated with the differential-algebraic system. First, a simple procedure is developed for the design of a feedback control law which ensures, at least locally, that the tracking error in the closed loop system lies within any given bound if the reference inputs are sufficiently slowly varying. Next, by imposing additional assumptions, a procedure is developed for the design of a feedback control law which ensures that the tracking error in the closed loop system approaches zero exponentially for reference inputs which are not necessarily slowly varying. The control design methodologies are used for simultaneous force and position control in constrained robot systems. The differential-algebraic equations are shown to characterize the slow dynamics of a certain nonlinear control system in nonstandard singularly perturbed form. In Part 2, the attitude stabilization (reorientation) of a rigid spacecraft using only two control torques is considered. First, the case of momentum wheel actuators is considered. The complete spacecraft dynamics are not controllable. However, the spacecraft dynamics are small time locally controllable in a reduced sense. The reduced spacecraft dynamics cannot be asymptotically stabilized using continuous feedback, but a discontinuous feedback control strategy is constructed. Next, the case of gas jet actuators is considered. If the uncontrolled principal axis is not an axis of symmetry, the complete spacecraft dynamics are small time locally controllable. However, the spacecraft attitude cannot be asymptotically stabilized using continuous feedback, but a discontinuous stabilizing feedback control strategy is constructed. If the uncontrolled principal axis is an axis of symmetry, the complete spacecraft dynamics cannot be stabilized. However, the spacecraft dynamics are small time locally controllable in a reduced sense. The reduced spacecraft dynamics cannot be asymptotically stabilized using continuous feedback, but again a discontinuous feedback control strategy is constructed.