SEARCH · Engineering Papers

Results for “Real numbers”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 181 records · Page 10

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Real-space chirality from crystalline topological defects in the Kitaev spin liquid

We show that certain crystalline topological defects in the gapless Kitaev honeycomb spin liquid model generate a chirality and Majorana fermion orbital magnetization that depends in a universal manner on their emergent flux. Focusing on 5–7 dislocations as building blocks, consisting of pentagon and heptagon disclinations, we identify the Kitaev bond label configurations that preserve solvability. By computing two formulations of local markers M(r) we find that the 5 and 7 lattice defects generate a real-space contribution to Chern number and an associated Majorana fermion orbital magnetization proportional to M(r). The sign of the M(r) contribution from each 5/7 defect, i.e. its q M = ± 1 chirality, is determined by the defect Frank angle sign F and emergent gauge field flux W = ± i through the expression q M = − iFW. Remarkably, though lattice curvature and torsion can interplay with the surrounding gapless background to modify the profile of M(r), its sign q M is determined locally, implying that crystalline defects in the Kitaev spin liquid can generate a robust and observable chirality.

Magnetic properties and materials↗

DOE OSTI2021

Fast GPU-Based Generation of Large Graph Networks From Degree Distributions

Synthetically generated, large graph networks serve as useful proxies to real-world networks for many graph-based applications. The ability to generate such networks helps overcome several limitations of real-world networks regarding their number, availability, and access. Here, we present the design, implementation, and performance study of a novel network generator that can produce very large graph networks conforming to any desired degree distribution. The generator is designed and implemented for efficient execution on modern graphics processing units (GPUs). Given an array of desired vertex degrees and number of vertices for each desired degree, our algorithm generates the edges of a random graph that satisfies the input degree distribution. Multiple runtime variants are implemented and tested: 1) a uniform static work assignment using a fixed thread launch scheme, 2) a load-balanced static work assignment also with fixed thread launch but with cost-aware task-to-thread mapping, and 3) a dynamic scheme with multiple GPU kernels asynchronously launched from the CPU. The generation is tested on a range of popular networks such as Twitter and Facebook, representing different scales and skews in degree distributions. Results show that, using our algorithm on a single modern GPU (NVIDIA Volta V100), it is possible to generate large-scale graph networks at rates exceeding 50 billion edges per second for a 69 billion-edge network. GPU profiling confirms high utilization and low branching divergence of our implementation from small to large network sizes. For networks with scattered distributions, we provide a coarsening method that further increases the GPU-based generation speed by up to a factor of 4 on tested input networks with over 45 billion edges.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1974

Computer programs for calculation of matrix stability and frequency response from a state-space system description

FORTRAN computer subroutines stemming from requirements to process state variable system equations for systems of high order are presented. They find the characteristic equation of a matrix using the method of Danilevsky, the number of roots with positive real parts using the Routh-Horwitz alternate formulation, convert a state variable system description to a Laplace transfer function using the method of Bollinger, and evaluate that transfer function and obtain its frequency response. A sample problem is presented to demonstrate use of the subroutines.

Seidel, R. C.↗

NASA NTRS1974

Experimental and analytical sonic nozzle discharge coefficients for Reynolds numbers up to 8,000,000

Sonic discharge coefficients are presented for two different geometry flow nozzles using nitrogen gas at high pressures where real-gas corrections are significant. Throat Reynolds number range extended up to 8,000,000. Experimentally obtained coefficients for a nozzle with a continuous and finite radius of curvature agreed with those obtained analytically to within 0.2 per cent. Experimental coefficients for a long-radius ASME nozzle agreed to within 0.25 per cent to an empirical equation representing the most probable subsonic discharge coefficient.

Szaniszlo, A. J.↗

NASA NTRS1983

Stability and control over the supersonic and hypersonic speed range

The performance and aerodynamic characteristics of the Space Shuttle Columbia are analyzed over the speed range from Mach 2 to 26 using flight data taken from the first five Space Transportation System flights. These data are used to reconstruct the entry trajectory, calculate vehicle performance, and estimate lateral stability and control derivatives including those assocated with the onboard Reaction Control System. The trajectory reconstruction process is discussed in its relationship to the determination of the vehicle flight characteristics. Vehicle performance results are presented which show that lift and drag were generally overpredicted by 3 percent and that the life-to-drag ratio was underpredicted by 1 percent. Anomalies in pitching-moment trim characteristics are shown and noted to be due to real-gas and Mach-number effects. Lateral stability and control derivatives estimated using programmed test input maneuvers are corrected with preflight predictions and are usually within the uncertainties associated with the predictions. The lateral reaction-control system effectiveness is evaluated.

Compton, H. R.↗

NASA NTRS1990

Acoustic echo cancellation for full-duplex voice transmission on fading channels

This paper discusses the implementation of an adaptive acoustic echo canceler for a hands-free cellular phone operating on a fading channel. The adaptive lattice structure, which is particularly known for faster convergence relative to the conventional tapped-delay-line (TDL) structure, is used in the initialization stage. After convergence, the lattice coefficients are converted into the coefficients for the TDL structure which can accommodate a larger number of taps in real-time operation due to its computational simplicity. The conversion method of the TDL coefficients from the lattice coefficients is derived and the DSP56001 assembly code for the lattice and TDL structure is included, as well as simulation results and the schematic diagram for the hardware implementation.

Park, Sangil↗

NASA NTRS1992

A non-linearly stable implicit finite element algorithm for hypersonic aerodynamics

A generalized curvilinear coordinate Taylor weak statement implicit finite element algorithm is developed for the two-dimensional and axisymmetric compressible Navier-Stokes equations for ideal and reacting gases. For accurate hypersonic simulation, air is modeled as a mixture of five perfect gases, i.e., molecular and atomic oxygen and nitrogen as well as nitric oxide. The associated pressure is then determined via Newton solution of the classical chemical equilibrium equation system. The directional semidiscretization is achieved using an optimal metric data Galerkin finite element weak statement, on a developed 'companion conservation law system', permitting classical test and trial space definitions. Utilizing an implicit Runge-Kutta scheme, the terminal algorithm is then nonlinearly stable, and second-order accurate in space and time on arbitrary curvilinear coordinates. Subsequently, a matrix tensor product factorization procedure permits an efficient numerical linear algebra handling for large Courant numbers. For ideal- and real-gas hypersonic flows, the algorithm generates essentially nonoscillatory numerical solutions in the presence of strong detached shocks and boundary layer-inviscid flow interactions.

Iannelli, G. S.↗

NASA NTRS1996

Trends and Issues in Fuzzy Control and Neuro-Fuzzy Modeling

Everyday experience in building and repairing things around the home have taught us the importance of using the right tool for the right job. Although we tend to think of a 'job' in broad terms, such as 'build a bookcase,' we understand well that the 'right job' associated with each 'right tool' is typically a narrowly bounded subtask, such as 'tighten the screws.' Unfortunately, we often lose sight of this principle when solving engineering problems; we treat a broadly defined problem, such as controlling or modeling a system, as a narrow one that has a single 'right tool' (e.g., linear analysis, fuzzy logic, neural network). We need to recognize that a typical real-world problem contains a number of different sub-problems, and that a truly optimal solution (the best combination of cost, performance and feature) is obtained by applying the right tool to the right sub-problem. Here I share some of my perspectives on what constitutes the 'right job' for fuzzy control and describe recent advances in neuro-fuzzy modeling to illustrate and to motivate the synergistic use of different tools.

Chiu, Stephen↗

NASA NTRS2008

Vision System Measures Motions of Robot and External Objects

A prototype of an advanced robotic vision system both (1) measures its own motion with respect to a stationary background and (2) detects other moving objects and estimates their motions, all by use of visual cues. Like some prior robotic and other optoelectronic vision systems, this system is based partly on concepts of optical flow and visual odometry. Whereas prior optoelectronic visual-odometry systems have been limited to frame rates of no more than 1 Hz, a visual-odometry subsystem that is part of this system operates at a frame rate of 60 to 200 Hz, given optical-flow estimates. The overall system operates at an effective frame rate of 12 Hz. Moreover, unlike prior machine-vision systems for detecting motions of external objects, this system need not remain stationary: it can detect such motions while it is moving (even vibrating). The system includes a stereoscopic pair of cameras mounted on a moving robot. The outputs of the cameras are digitized, then processed to extract positions and velocities. The initial image-data-processing functions of this system are the same as those of some prior systems: Stereoscopy is used to compute three-dimensional (3D) positions for all pixels in the camera images. For each pixel of each image, optical flow between successive image frames is used to compute the two-dimensional (2D) apparent relative translational motion of the point transverse to the line of sight of the camera. The challenge in designing this system was to provide for utilization of the 3D information from stereoscopy in conjunction with the 2D information from optical flow to distinguish between motion of the camera pair and motions of external objects, compute the motion of the camera pair in all six degrees of translational and rotational freedom, and robustly estimate the motions of external objects, all in real time. To meet this challenge, the system is designed to perform the following image-data-processing functions: The visual-odometry subsystem (the subsystem that estimates the motion of the camera pair relative to the stationary background) utilizes the 3D information from stereoscopy and the 2D information from optical flow. It computes the relationship between the 3D and 2D motions and uses a least-mean-squares technique to estimate motion parameters. The least-mean-squares technique is suitable for real-time implementation when the number of external-moving-object pixels is smaller than the number of stationary-background pixels.

Talukder, Ashit↗

NASA NTRS2010

Reactive Collision Avoidance Algorithm

The reactive collision avoidance (RCA) algorithm allows a spacecraft to find a fuel-optimal trajectory for avoiding an arbitrary number of colliding spacecraft in real time while accounting for acceleration limits. In addition to spacecraft, the technology can be used for vehicles that can accelerate in any direction, such as helicopters and submersibles. In contrast to existing, passive algorithms that simultaneously design trajectories for a cluster of vehicles working to achieve a common goal, RCA is implemented onboard spacecraft only when an imminent collision is detected, and then plans a collision avoidance maneuver for only that host vehicle, thus preventing a collision in an off-nominal situation for which passive algorithms cannot. An example scenario for such a situation might be when a spacecraft in the cluster is approaching another one, but enters safe mode and begins to drift. Functionally, the RCA detects colliding spacecraft, plans an evasion trajectory by solving the Evasion Trajectory Problem (ETP), and then recovers after the collision is avoided. A direct optimization approach was used to develop the algorithm so it can run in real time. In this innovation, a parameterized class of avoidance trajectories is specified, and then the optimal trajectory is found by searching over the parameters. The class of trajectories is selected as bang-off-bang as motivated by optimal control theory. That is, an avoiding spacecraft first applies full acceleration in a constant direction, then coasts, and finally applies full acceleration to stop. The parameter optimization problem can be solved offline and stored as a look-up table of values. Using a look-up table allows the algorithm to run in real time. Given a colliding spacecraft, the properties of the collision geometry serve as indices of the look-up table that gives the optimal trajectory. For multiple colliding spacecraft, the set of trajectories that avoid all spacecraft is rapidly searched on-line. The optimal avoidance trajectory is implemented as a receding-horizon model predictive control law. Therefore, at each time step, the optimal avoidance trajectory is found and the first time step of its acceleration is applied. At the next time step of the control computer, the problem is re-solved and the new first time step is again applied. This continual updating allows the RCA algorithm to adapt to a colliding spacecraft that is making erratic course changes.

Scharf, Daniel↗

NASA NTRS2014

Model Checking Degrees of Belief in a System of Agents

Reasoning about degrees of belief has been investigated in the past by a number of authors and has a number of practical applications in real life. In this paper we present a unified framework to model and verify degrees of belief in a system of agents. In particular, we describe an extension of the temporal-epistemic logic CTLK and we introduce a semantics based on interpreted systems for this extension. In this way, degrees of beliefs do not need to be provided externally, but can be derived automatically from the possible executions of the system, thereby providing a computationally grounded formalism. We leverage the semantics to (a) construct a model checking algorithm, (b) investigate its complexity, (c) provide a Java implementation of the model checking algorithm, and (d) evaluate our approach using the standard benchmark of the dining cryptographers. Finally, we provide a detailed case study: using our framework and our implementation, we assess and verify the situational awareness of the pilot of Air France 447 flying in off-nominal conditions.

MAS Verification↗

DOE OSTI2022

Synthetic Data Generation Using Machine Learning

Robust machine learning techniques for image analysis require a substantial amount of data to yield confident results. In the nuclear domain, data scarcity is a substantial challenge because there are so few facilities worldwide. This research focuses on being able alleviate the data scarcity problem by generating synthetic data to bridge the gap between large and small datasets. This work achieves that goal using a Generative Adversarial Network (GAN) architectural approach, by training a model on real-world data and expands that small dataset through synthetic data amendments. Model performance is impacted by the size of the real-world dataset and the number of training epochs utilized. This means that 1) It is important to develop your GAN to be optimized with the specific data type, and 2) approaches taken when training the GAN should be specialized to encompass important aspects of the dataset that it is generating. By taking a step to improve dataset sizes in this way, the gap between models trained by parties with significant amount of data and those without access to large data, closes, allowing for robust analyses of satellite imagery for nuclear domain applications.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DOE OSTI2023

Faster approximate subgraph counts with privacy

One of the most common problems studied in the context of differential privacy for graph data is counting the number of non-induced embeddings of a subgraph in a given graph. These counts have very high global sensitivity. Therefore, adding noise based on powerful alternative techniques, such as smooth sensitivity and higher-order local sensitivity have been shown to give significantly better accuracy. However, all these alternatives to global sensitivity become computationally very expensive, and to date efficient polynomial time algorithms are known only for few selected subgraphs, such as triangles, k-triangles, and k-stars. In this paper, we show that good approximations to these sensitivity metrics can be still used to get private algorithms. Using this approach, we much faster algorithms for privately counting the number of triangles in real-world social networks, which can be easily parallelized. We also give a private polynomial time algorithm for counting any constant size subgraph using less noise than the global sensitivity; we show this can be improved significantly for counting paths in special classes of graphs

Nguyen, Dung↗

NASA NTRS1974

Experimental and analytical sonic nozzle discharge coefficients for Reynolds numbers up to 8 x 10 to the 6th power

Sonic discharge coefficients are presented for two different geometry flow nozzles using nitrogen gas at high pressures where real gas corrections are significant. Throat Reynolds number range extended up to 8 million. Experimentally obtained coefficients for a nozzle with a continuous and finite radius of curvature agreed with those obtained analytically to within 0.2 percent. Experimental coefficients for a long radius ASME nozzle agreed to within 1/4 percent to an empirical equation representing the most probable subsonic discharge coefficient.

Szaniszlo, A. J.↗

NASA NTRSDate not supplied

Principles of Fluid Dynamic Similarity Analysis for Slosh Experiments

Most tank slosh test programs are not conducted with flight hardware in a flight-like environment due to cost and schedule constraints. Instead, subscale tanks are typically tested on the ground. If the “real”, flight liquid in the tank is a cryogenic propellant, sometimes a cryogen is used during testing, but more often a simulant liquid is used. Fluid dynamic similarity analysis, or “scaling analysis” as it is sometimes called, for slosh examines nondimensional numbers to determine which fluid dynamic regime(s) a tank is operating in. If the relevant nondimensional numbers of a scale tank test are similar enough to the real tank’s nondimensional numbers, then it is likely that the scale test data will be similar to what would be obtained with the real tank. This type of analysis is useful for guiding experiment design, test liquid selection, and for understanding the physical relevance of prior test data to a specific application. The authors have performed scaling analyses for many slosh test programs conducted in ground, parabolic flight, suborbital, and in-orbit environments. Basics of how to perform the analysis, along with select examples from ground and microgravity environments, are presented. Suggestions for various assumptions and compromises to make are discussed. Limitations and challenges are also discussed.

slosh↗

NASA NTRS1987

Steady bimodal convection in a cylinder at large Prandtl numbers

Steady bimodal convection of an infinite Prandtl-number Boussinesq fluid in a cylinder is considered. An asymptotic analysis similar to the one used by Buell and Catton (1986) for axisymmetric convection yields a solvability condition that determines the radial wavenumber. The analysis is valid for convection far away from the origin, the lateral boundary, and any pattern dislocations. The azimuthal wave number is treated as a parameter, although in real systems it is dependent on the initial and boundary conditions. Results are presented for Rayleigh numbers between 14,000 and 60,000, and for azimuthal wave numbers between 5 and 7. It is shown that for increasing Rayleigh numbers, the selected radial wave number and the heat transfer tend to become independent of the azimuthal wave number. No quantitative experimental data are available, but one qualitative comparison is good.

Buell, Jeffrey C.↗

NASA NTRS1991

How far we are from the complete knowledge: Complexity of knowledge acquisition in Dempster-Shafer approach

When a knowledge base represents the experts' uncertainty, then it is reasonable to ask how far we are from the complete knowledge, that is, how many more questions do we have to ask (to these experts, to nature by means of experimenting, etc) in order to attain the complete knowledge. Of course, since we do not know what the real world is, we cannot get the precise number of questions from the very beginning: it is quite possible, for example, that we ask the right question first and thus guess the real state of the world after the first question. So we have to estimate this number and use this estimate as a natural measure of completeness for a given knowledge base. We give such estimates for Dempster-Shafer formalism. Namely, we show that this average number of questions can be obtained by solving a simple mathematical optimization problem. In principle this characteristic is not always sufficient to express the fact that sometimes we have more knowledge. For example, it has the same value if we have an event with two possible outcomes and nothing else is known, and if there is an additional knowledge that the probability of every outcome is 0.5. We'll show that from the practical viewpoint this is not a problem, because the difference between the necessary number of questions in both cases is practically negligible.

Chokr, Bassam A.↗

NASA NTRS1994

Investigation of a Laminar Flow Leading Edge

The recent resurgence of interest in utilizing laminar flow on aircraft surfaces for reduction in skin friction drag has generated a considerable amount of research in natural laminar flow (NLF) and hybrid laminar flow control (HLFC) on transonic aircraft wings. This research has focused primarily on airfoil design and understanding transition behavior with little concern for the surface imperfections and manufacturing variations inherent to most production aircraft. In order for laminar flow to find wide-spread use on production aircraft, techniques for constructing the wings must be found such that the large surface imperfections present in the leading edge region of current aircraft do not occur. Toward this end, a modification to existing leading edge construction techniques was devised such that the resulting surface did not contain large gaps and steps as are common on current production aircraft of this class. A lowspeed experiment was first conducted on a simulation of the surface that would result from this construction technique. Preston tube measurements of the boundary layer downstream of the simulated joint and flow visualization using sublimation chemicals validated the literature on the effects of steps on a laminar boundary layer. These results also indicated that the construction technique was indeed compatible with laminar flow. In order to fully validate the compatibility of this construction technique with laminar flow, thus proving that it is possible to build wings that are smooth enough to be used on business jets and light transports in a manner compatible with laminar flow, a flight experiment is being conducted. In this experiment Mach number and Reynolds number will be matched in a real flight environment. The experiment is being conducted using the NASA Dryden F-104 Flight Test Fixture (FTF). The FTF is a low aspect ratio ventral fin mounted beneath an F-104G research aircraft. A new nose shape was designed and constructed for this experiment. This nose shape provides an accelerating pressure gradient in the leading edge region. By flying the aircraft at appropriate Mach numbers and altitudes, this nose shape simulates the leading edge region of a laminar flow wing for a business jet or light transport. Manufactured into the nose shape is a spanwise slot located approximately four inches downstream of the leading edge. The slot, which is an inch wide and one-eighth of an inch deep allows the simulation of surface imperfections, such as gaps and steps at skin joints, which will occur on aircraft using this new construction technique. By placing strips of aluminum of various sizes and shapes in the slot, the effect on the boundary layer of different sizes and shapes of steps and gaps will be examined. It is planned to use five different configurations, differing primarily in the size and number of gaps. Downstream of the slot, the state of the boundary layer is determined using hot film gages and Stanton gages. Agreement between these two very different techniques of measuring boundary layer properties is considered important to being able to state with confidence the effects on the boundary layer of the simulated manufacturing imperfections. To date, the aircraft has not flown. First flights of the aircraft are on schedule to begin October 4, 1993. Low-speed, preliminary experiments at matching Reynolds numbers have been completed.

Drake, Aaron↗