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.
In this paper, we develop a family of Neuberger-like results to find points z epsilon H satisfying L(z)z = z and P(z) = z. This family includes Neuberger's theorem and has the additional property that most of the sequences q sub n converge to idempotent elements of B sub 1(H).
Triple-point cell contrains about 300 g of high-purity succinontrile. Experiments show that lower 4 cm of thermometer well are virtually isothermal, making placement of thermometer not very critical. Bulb at bottom of well helps to prevent solid succinontrile mantel from slipping.
Fixed points of diffeomorphism class of Smale and exponential function
A polyphase fast Fourier transform (FFT) spectrum analyzer being designed for NASA's Search for Extraterrestrial Intelligence (SETI) Sky Survey at the Jet Propulsion Laboratory is described. By replacing the time domain multiplicative window preprocessing with polyphase filter processing, much of the processing loss of windowed FFTs can be eliminated. Polyphase coefficient memory costs are minimized by effective use of run length compression. Finite word length effects are analyzed, producing a balanced system with 8 bit inputs, 16 bit fixed point polyphase arithmetic, and 24 bit fixed point FFT arithmetic. Fixed point renormalization midway through the computation is seen to be naturally accommodated by the matrix FFT algorithm proposed. Simulation results validate the finite word length arithmetic analysis and the renormalization technique.
Coinduction is a powerful technique for reasoning about unfounded sets, unbounded structures, infinite automata, and interactive computations [6]. Where induction corresponds to least fixed point's semantics, coinduction corresponds to greatest fixed point semantics. Recently coinduction has been incorporated into logic programming and an elegant operational semantics developed for it [11, 12]. This operational semantics is the greatest fix point counterpart of SLD resolution (SLD resolution imparts operational semantics to least fix point based computations) and is termed co- SLD resolution. In co-SLD resolution, a predicate goal p( t) succeeds if it unifies with one of its ancestor calls. In addition, rational infinite terms are allowed as arguments of predicates. Infinite terms are represented as solutions to unification equations and the occurs check is omitted during the unification process. Coinductive Logic Programming (Co-LP) and Co-SLD resolution can be used to elegantly perform model checking and planning. A combined SLD and Co-SLD resolution based LP system forms the common basis for planning, scheduling, verification, model checking, and constraint solving [9, 4]. This is achieved by amalgamating SLD resolution, co-SLD resolution, and constraint logic programming [13] in a single logic programming system. Given that parallelism in logic programs can be implicitly exploited [8], complex, compute-intensive applications (planning, scheduling, model checking, etc.) can be executed in parallel on multi-core machines. Parallel execution can result in speed-ups as well as in larger instances of the problems being solved. In the remainder we elaborate on (i) how planning can be elegantly and efficiently performed under real-time constraints, (ii) how real-time systems can be elegantly and efficiently model- checked, as well as (iii) how hybrid systems can be verified in a combined system with both co-SLD and SLD resolution. Implementations of co-SLD resolution as well as preliminary implementations of the planning and verification applications have been developed [4]. Co-LP and Model Checking: The vast majority of properties that are to be verified can be classified into safety properties and liveness properties. It is well known within model checking that safety properties can be verified by reachability analysis, i.e, if a counter-example to the property exists, it can be finitely determined by enumerating all the reachable states of the Kripke structure.
This paper presents the correctness proof of Saturation, an algorithm for generating state spaces of concurrent systems, implemented in the SMART tool. Unlike the Breadth First Search exploration algorithm, which is easy to understand and formalise, Saturation is a complex algorithm, employing a mutually-recursive pair of procedures that compute a series of non-trivial, nested local fixed points, corresponding to a chaotic fixed point strategy. A pencil-and-paper proof of Saturation exists, but a machine checked proof had never been attempted. The key element of the proof is the characterisation theorem of saturated nodes in decision diagrams, stating that a saturated node represents a set of states encoding a local fixed-point with respect to firing all events affecting only the node s level and levels below. For our purpose, we have employed the Prototype Verification System (PVS) for formalising the Saturation algorithm, its data structures, and for conducting the proofs.
In this paper, we propose a proof-carrying code framework for program-generators. The enabling technique is abstract parsing, a static string analysis technique, which is used as a component for generating and validating certificates. Our framework provides an efficient solution for certifying program-generators whose safety properties are expressed in terms of the grammar representing the generated program. The fixed-point solution of the analysis is generated and attached with the program-generator on the code producer side. The consumer receives the code with a fixed-point solution and validates that the received fixed point is indeed a fixed point of the received code. This validation can be done in a single pass.
Least squares integral criterion for representation of gravitational potential with fixed mass points
The Magnetospheric Multiscale (MMS) mission will study small-scale reconnection structures and their rapid motions from closely spaced platforms using instruments capable of high angular, energy, and time resolution measurements. To meet these requirements, the Fast Plasma Instrument (FPI) consists of eight (8) identical half top-hat electron sensors and eight (8) identical ion sensors and an Instrument Data Processing Unit (IDPU). The sensors (electron or ion) are grouped into pairs whose 6 degree x 180 degree fields-of-view (FOV) are set 90 degrees apart. Each sensor is equipped with electrostatic aperture steering to allow the sensor to scan a 45 degree x 180 degree fan about the its nominal viewing (0 deflection) direction. Each pair of sensors, known as the Dual Electron Spectrometer (DES) and the Dual Ion Spectrometer (DIS), occupies a quadrant on the MMS spacecraft and the combination of the eight electron/ion sensors, employing aperture steering, image the full-sky every 30-ms (electrons) and 150-ms (ions), respectively. To probe the diffusion regions of reconnection, the highest temporal/spatial resolution mode of FPI results in the DES complement of a given spacecraft generating 6.5-Mb (raised dot) per second of electron data while the DIS generates 1.1-Mb (raised dot) per second of ion data yielding an FPI total data rate of 6.6-Mb (raised dot) per second. The FPI electron/ion data is collected by the IDPU then transmitted to the Central Data Instrument Processor (CIDP) on the spacecraft for science interest ranking. Only data sequences that contain the greatest amount of temporal/spatial structure will be intelligently down-linked by the spacecraft. This requires a data ranking process known as the burst trigger system. The burst trigger system uses pseudo physical quantities to approximate the local plasma environments. As each pseudo quantity will have a different value, a set of two scaling factors is employed for each pseudo term. These pseudo quantities are then combined at the instrument, spacecraft, and observatory level leading to a final ranking of data based on expected scientific interest. Here, we present simulations of the fixed point burst trigger system for the FPI. A variety of data sets based on previous mission data as well as analytical formulations are tested. Comparisons of floating point calculations versus the fixed point hardware simulation are shown. Analysis of the potential sources of error from overflows, quantization, etc. are examined and mitigation methods are presented. Finally a series of calibration curves are presented, showing the expected error in pseudo quantities based solely on the scale parameters chosen and the expected data range. We conclude with a presentation of the current base-lined FPI burst trigger approach.
Fixed points of diffeomorphisms grows exponentially under iteration
A renormalization group is developed for the Navier-Stokes equations driven by an anisotropically correlated random stirring force. The stirring force generates homogeneous turbulence with a preferred direction. The force correlation is the sum of a small anisotropic perturbation and an isotropic correlation chosen, so that the fixed point of renormalization group has a k exp -5/3 energy spectrum. Fixed points for the anisotropic correlation are found near this isotropic fixed point. Two types of anisotropy are analyzed. when the additional stirring is in the plane perpendicular to the preferred direction, the renormalized viscosity is increased. When it is aligned with the preferred direction, the viscosity is decreased. A possible connection with the inverse energy cascade of two-dimensional turbulence is discussed.
A new type of attractor (terminal attractors) for content-addressable memory, associative memory, and pattern recognition in artificial neural networks operating in continuous time is introduced. The idea of a terminal attractor is based upon a violation of the Lipschitz condition at a fixed point. As a result, the fixed point becomes a singular solution which envelopes the family of regular solutions, while each regular solution approaches such an attractor in finite time. It will be shown that terminal attractors can be incorporated into neural networks such that any desired set of these attractors with prescribed basins is provided by an appropriate selection of the synaptic weights. The applications of terminal attractors for content-addressable and associative memories, pattern recognition, self-organization, and for dynamical training are illustrated.
The nonlinear response of infinitely long circular cylindrical shells (thin circular rings) in the presence of a two-to-one internal (autoparametric) resonance to a subharmonic excitation of order one-half of the higher mode is analyzed with the multiple-scale method. Four autonomous first-order ordinary differential equations are derived for the modulation of the amplitudes and phases of the interacting models. These modulation equations are used to determine the fixed points and their stability. The fixed points correspond to periodic oscillations of the shell, whereas the limit-cycle solutions of the modulation equations correspond to amplitude and phase-modulated oscillations of the shell. The force response curves exhibit saturation, jumps, and Hopf bifurcation. As excitation frequency changes, all limit cycles deform and lose stability through either pitchfork or cyclic-fold (saddle-node) bifurcations. Some of these saddle-node bifurcations cause a transition to chaos. The pitchfork bifurcations break the symmetry of the limit cycles.
Detail calculations are presented of the shifts in stick-fixed neutral point of the Republic XF-12 airplane due to the windmilling propellers and to the fuselage. The results of these calculations differ somewhat from those previously made for this airplane by Republic Aviation Corporation personnel under the direction of Langley flight division personnel. Due to these differences the neutral point for the airplane is predicted to be 37.8 percent mean aerodynamic chord, instead of 40.8 percent mean aerodynamic chord as previously reported.
Recurrent networks of polynomial threshold elements with random symmetric interactions are studied. Precise asymptotic estimates are derived for the expected number of fixed points as a function of the margin of stability. In particular, it is shown that there is a critical range of margins of stability (depending on the degree of polynomial interaction) such that the expected number of fixed points with margins below the critical range grows exponentially with the number of nodes in the network, while the expected number of fixed points with margins above the critical range decreases exponentially with the number of nodes in the network. The random energy model is also briefly examined and links with higher order neural networks and higher order spin glass models made explicit.
The Spalart-Allmaras and the Menter SST kappa-omega turbulence models are shown to have the undesirable characteristic that, for fully turbulent computations, a transition region can occur whose extent varies with grid density. Extremely fine two-dimensional grids over the front portion of an airfoil are used to demonstrate the effect. As the grid density is increased, the laminar region near the nose becomes larger. In the Spalart-Allmaras model this behavior is due to convergence to a laminar-behavior fixed point that occurs in practice when freestream turbulence is below some threshold. It is the result of a feature purposefully added to the original model in conjunction with a special trip function. This degenerate fixed point can also cause nonuniqueness regarding where transition initiates on a given grid. Consistent fully turbulent results can easily be achieved by either using a higher freestream turbulence level or by making a simple change to one of the model constants. Two-equation kappa-omega models, including the SST model, exhibit strong sensitivity to numerical resolution near the area where turbulence initiates. Thus, inconsistent apparent transition behavior with grid refinement in this case does not appear to stem from the presence of a degenerate fixed point. Rather, it is a fundamental property of the kappa-omega model itself, and is not easily remedied.
The Spalart-Allmaras and the Menter SST k-omega turbulence models are shown to have the undesirable characteristic that, for fully turbulent computations, a transition region can occur whose extent varies with grid density. Extremely fine two-dimensional grids over the front portion of an airfoil are used to demonstrate the effect. As the grid density is increased, the laminar region near the nose becomes larger. In the Spalart-Allmaras model this behavior is due to convergence to a laminar-behavior fixed point that occurs in practice when freestream turbulence is below some threshold. It is the result of a feature purposefully added to the original model in conjunction with a special trip function. This degenerate fixed point can also cause non-uniqueness regarding where transition initiates on a given grid. Consistent fully turbulent results can easily be achieved by either using a higher freestream turbulence level or by making a simple change to one of the model constants. Two-equation k-omega models, including the SST model, exhibit strong sensitivity to numerical resolution near the area where turbulence initiates. Thus, inconsistent apparent transition behavior with grid refinement in this case does not appear to stem from the presence of a degenerate fixed point. Rather, it is a fundamental property of the k-omega model itself, and is not easily remedied.
Structural damping is an important dynamic characteristic of engineering materials that helps to damp vibrations by reducing their amplitudes. In this investigation, an experimental method is illustrated to determine the damping characteristics of engineering materials using a dual channel Fast Fourier Transform (FFT) analyzer. A portable Compaq III computer which houses the analyzer, is used to collect the dynamic responses of three metal rods. Time-domain information is analyzed to obtain the logarithmic decrement of their damping. The damping coefficients are then compared to determine the variation of damping from material to material. The variations of damping from one point to another of the same material, due to a fixed point excitation, and the variable damping at a fixed point due to excitation at different points, are also demonstrated.