Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel coordinates”

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.

At least 109 records · Page 6

An efficient method for computation of the manipulator inertia matrix

An efficient method of computation of the manipulator inertia matrix is presented. Using spatial notations, the method leads to the definition of the composite rigid-body spatial inertia, which is a spatial representation of the notion of augmented body. The previously proposed methods, the physical interpretations leading to their derivation, and their redundancies are analyzed. The proposed method achieves a greater efficiency by eliminating the redundancy in the intrinsic equations as well as by a better choice of coordinate frame for their projection. In this case, removing the redundancy leads to greater efficiency of the computation in both serial and parallel senses.

Fijany, Amir↗

Rao-Blackwellization for Adaptive Gaussian Sum Nonlinear Model Propagation

When dealing with imperfect data and general models of dynamic systems, the best estimate is always sought in the presence of uncertainty or unknown parameters. In many cases, as the first attempt, the Extended Kalman filter (EKF) provides sufficient solutions to handling issues arising from nonlinear and non-Gaussian estimation problems. But these issues may lead unacceptable performance and even divergence. In order to accurately capture the nonlinearities of most real-world dynamic systems, advanced filtering methods have been created to reduce filter divergence while enhancing performance. Approaches, such as Gaussian sum filtering, grid based Bayesian methods and particle filters are well-known examples of advanced methods used to represent and recursively reproduce an approximation to the state probability density function (pdf). Some of these filtering methods were conceptually developed years before their widespread uses were realized. Advanced nonlinear filtering methods currently benefit from the computing advancements in computational speeds, memory, and parallel processing. Grid based methods, multiple-model approaches and Gaussian sum filtering are numerical solutions that take advantage of different state coordinates or multiple-model methods that reduced the amount of approximations used. Choosing an efficient grid is very difficult for multi-dimensional state spaces, and oftentimes expensive computations must be done at each point. For the original Gaussian sum filter, a weighted sum of Gaussian density functions approximates the pdf but suffers at the update step for the individual component weight selections. In order to improve upon the original Gaussian sum filter, Ref. [2] introduces a weight update approach at the filter propagation stage instead of the measurement update stage. This weight update is performed by minimizing the integral square difference between the true forecast pdf and its Gaussian sum approximation. By adaptively updating each component weight during the nonlinear propagation stage an approximation of the true pdf can be successfully reconstructed. Particle filtering (PF) methods have gained popularity recently for solving nonlinear estimation problems due to their straightforward approach and the processing capabilities mentioned above. The basic concept behind PF is to represent any pdf as a set of random samples. As the number of samples increases, they will theoretically converge to the exact, equivalent representation of the desired pdf. When the estimated qth moment is needed, the samples are used for its construction allowing further analysis of the pdf characteristics. However, filter performance deteriorates as the dimension of the state vector increases. To overcome this problem Ref. [5] applies a marginalization technique for PF methods, decreasing complexity of the system to one linear and another nonlinear state estimation problem. The marginalization theory was originally developed by Rao and Blackwell independently. According to Ref. [6] it improves any given estimator under every convex loss function. The improvement comes from calculating a conditional expected value, often involving integrating out a supportive statistic. In other words, Rao-Blackwellization allows for smaller but separate computations to be carried out while reaching the main objective of the estimator. In the case of improving an estimator's variance, any supporting statistic can be removed and its variance determined. Next, any other information that dependents on the supporting statistic is found along with its respective variance. A new approach is developed here by utilizing the strengths of the adaptive Gaussian sum propagation in Ref. [2] and a marginalization approach used for PF methods found in Ref. [7]. In the following sections a modified filtering approach is presented based on a special state-space model within nonlinear systems to reduce the dimensionality of the optimization problem in Ref. [2]. First, the adaptive Gaussian sum propagation is explained and then the new marginalized adaptive Gaussian sum propagation is derived. Finally, an example simulation is presented.

state estimation↗

Coordination chemistry in fused-salt solutions

Spectrophotometric work on structural determinations with fused-salt solutions is reviewed. Constraints placed on the method, as well as interpretation of the spectra, are discussed with parallels drawn to aqueous spectrophotometric curves of the same materials.

Gruen, D. M.↗

Multitasking the INS3D-LU code on the Cray Y-MP

This paper presents the results of multitasking the INS3D-LU code on eight processors. The code is a full Navier-Stokes solver for incompressible fluid in three dimensional generalized coordinates using a lower-upper symmetric-Gauss-Seidel implicit scheme. This code has been fully vectorized on oblique planes of sweep and parallelized using autotasking with some directives and minor modifications. The timing results for five grid sizes are presented and analyzed. The code has achieved a processing rate of over one Gflops.

Fatoohi, Rod↗

Application of Variational Methods to the Thermal Entrance Region of Ducts

A variational method is presented for solving eigenvalue problems which arise in connection with the analysis of convective heat transfer in the thermal entrance region of ducts. Consideration is given, to both situations where the temperature profile depends upon one cross-sectional coordinate (e.g. circular tube) or upon two cross-sectional coordinates (e.g. rectangular duct). The variational method is illustrated and verified by application to laminar heat transfer in a circular tube and a parallel-plate channel, and good agreement with existing numerical solutions is attained. Then, application is made to laminar heat transfer in a square duct as a check, an alternate computation for the square duct is made using a method indicated by Misaps and Pohihausen. The variational method can, in principle, also be applied to problems in turbulent heat transfer.

Sparrow, E. M.↗

DSN Beowulf Cluster-Based VLBI Correlator

The NASA Deep Space Network (DSN) requires a broadband VLBI (very long baseline interferometry) correlator to process data routinely taken as part of the VLBI source Catalogue Maintenance and Enhancement task (CAT M&E) and the Time and Earth Motion Precision Observations task (TEMPO). The data provided by these measurements are a crucial ingredient in the formation of precision deep-space navigation models. In addition, a VLBI correlator is needed to provide support for other VLBI related activities for both internal and external customers. The JPL VLBI Correlator (JVC) was designed, developed, and delivered to the DSN as a successor to the legacy Block II Correlator. The JVC is a full-capability VLBI correlator that uses software processes running on multiple computers to cross-correlate two-antenna broadband noise data. Components of this new system (see Figure 1) consist of Linux PCs integrated into a Beowulf Cluster, an existing Mark5 data storage system, a RAID array, an existing software correlator package (SoftC) originally developed for Delta DOR Navigation processing, and various custom- developed software processes and scripts. Parallel processing on the JVC is achieved by assigning slave nodes of the Beowulf cluster to process separate scans in parallel until all scans have been processed. Due to the single stream sequential playback of the Mark5 data, some ramp-up time is required before all nodes can have access to required scan data. Core functions of each processing step are accomplished using optimized C programs. The coordination and execution of these programs across the cluster is accomplished using Pearl scripts, PostgreSQL commands, and a handful of miscellaneous system utilities. Mark5 data modules are loaded on Mark5 Data systems playback units, one per station. Data processing is started when the operator scans the Mark5 systems and runs a script that reads various configuration files and then creates an experiment-dependent status database used to delegate parallel tasks between nodes and storage areas (see Figure 2). This script forks into three processes: extract, translate, and correlate. Each of these processes iterates on available scan data and updates the status database as the work for each scan is completed. The extract process coordinates and monitors the transfer of data from each of the Mark5s to the Beowulf RAID storage systems. The translate process monitors and executes the data conversion processes on available scan files, and writes the translated files to the slave nodes. The correlate process monitors the execution of SoftC correlation processes on the slave nodes for scans that have completed translation. A comparison of the JVC and the legacy Block II correlator outputs reveals they are well within a formal error, and that the data are comparable with respect to their use in flight navigation. The processing speed of the JVC is improved over the Block II correlator by a factor of 4, largely due to the elimination of the reel-to-reel tape drives used in the Block II correlator.

Rogstad, Stephen P.↗

An analysis of blade vortex interaction aerodynamics and acoustics

The impulsive noise associated with helicopter flight due to Blade-Vortex Interaction, sometimes called blade slap is analyzed especially for the case of a close encounter of the blade-tip vortex with a following blade. Three parts of the phenomena are considered: the tip-vortex structure generated by the rotating blade, the unsteady pressure produced on the following blade during the interaction, and the acoustic radiation due to the unsteady pressure field. To simplify the problem, the analysis was confined to the situation where the vortex is aligned parallel to the blade span in which case the maximum acoustic pressure results. Acoustic radiation due to the interaction is analyzed in space-fixed coordinates and in the time domain with the unsteady pressure on the blade surface as the source of chordwise compact, but spanwise non-compact radiation. Maximum acoustic pressure is related to the vortex core size and Reynolds number which are in turn functions of the blade-tip aerodynamic parameters. Finally noise reduction and performance are considered.

Lee, D. J.↗

Integration of a Decentralized Linear-Quadratic-Gaussian Control into GSFC's Universal 3-D Autonomous Formation Flying Algorithm

A decentralized control is investigated for applicability to the autonomous formation flying control algorithm developed by GSFC for the New Millenium Program Earth Observer-1 (EO-1) mission. This decentralized framework has the following characteristics: The approach is non-hierarchical, and coordination by a central supervisor is not required; Detected failures degrade the system performance gracefully; Each node in the decentralized network processes only its own measurement data, in parallel with the other nodes; Although the total computational burden over the entire network is greater than it would be for a single, centralized controller, fewer computations are required locally at each node; Requirements for data transmission between nodes are limited to only the dimension of the control vector, at the cost of maintaining a local additional data vector. The data vector compresses all past measurement history from all the nodes into a single vector of the dimension of the state; and The approach is optimal with respect to standard cost functions. The current approach is valid for linear time-invariant systems only. Similar to the GSFC formation flying algorithm, the extension to linear LQG time-varying systems requires that each node propagate its filter covariance forward (navigation) and controller Riccati matrix backward (guidance) at each time step. Extension of the GSFC algorithm to non-linear systems can also be accomplished via linearization about a reference trajectory in the standard fashion, or linearization about the current state estimate as with the extended Kalman filter. To investigate the feasibility of the decentralized integration with the GSFC algorithm, an existing centralized LQG design for a single spacecraft orbit control problem is adapted to the decentralized framework while using the GSFC algorithm's state transition matrices and framework. The existing GSFC design uses both reference trajectories of each spacecraft in formation and by appropriate choice of coordinates and simplified measurement modeling is formulated as a linear time-invariant system. Results for improvements to the GSFC algorithm and a multiple satellite formation will be addressed. The goal of this investigation is to progressively relax the assumptions that result in linear time-invariance, ultimately to the point of linearization of the non-linear dynamics about the current state estimate as in the extended Kalman filter. An assessment will then be made about the feasibility of the decentralized approach to the realistic formation flying application of the EO-1/Landsat 7 formation flying experiment.

Folta, David C.↗

Bounce-Averaged Hamiltonian for Charged Particles in an Axisymmetric but Nondipolar Model Magnetosphere

In order to facilitate bounce-averaged guiding center simulations of geomagnetically trapped particles, we express the kinetic energy of a particle with magnetic coordinates (L,phi) as an analytic function of the first two adiabatic invariants (M, J) and the L value of the field line. The magnetic field model is axisymmetric, consisting of a dipolar B field plus a uniform southward magnetic field parallel to the dipole moment mu(sub E). This model magnetosphere is surrounded by a circular equatorial neutral line whose radius b is an adjustable parameter. The L value of a field line is (by definition) inversely proportional to the flux enclosed by the corresponding magnetic shell of equatorial radius r(sub 0), and the L value at the neutral line (r(sub 0) = b) is denoted L*. The azimuthal coordinate phi measures magnetic local time. The best functional representation found for the normalized difference (L(exp 3)a(exp 3)/mu(sub E))(B(sub m) - B(sub 0)) between mirror-point field B(sub m) and equatorial field B(sub 0) along any field line is a 5-term expansion in powers (2/3 through 6/3) of the quantity X equivalent to (La/mu(sub E))(exp 1/2)K, where K equivalent to (J(exp 2)/8m(sub 0)M)(exp 1/2) is an adiabatically conserved quantity independent of particle energy, m(sub 0) is the rest mass of the particle, and a is the radius of the Earth. This functional form is motivated by results for limiting cases in which particles mirror very near and very far from the magnetic equator. Expansion coefficients corresponding to various powers of X are obtained from least squares fits to numerically computed results for X as a function of L and B(sub m). These are accurately expressible as fourth-order polynomials in (r(sub 0)/b)(exp 3), hence indirectly as functions of L/L* = 3La/2b. This representation, which leads (except for a manageably small region of parameter space) to better than 1% accuracy in the specification of B(sub m) as a function of K and L, allows bounce-averaged guiding center simulations to be performed without actually tracing the bounce motions of individual particles. Bounce-averaged drifts L' (meridional) and phi' (azimuthal) are proportional to derivatives of the Hamiltonian H (sum of kinetic and potential energies) with respect to phi and L, respectively. Our formulation thus provides a computationally efficient method for tracing the bounce-averaged adiabatic motion (conserving all three invariants) and nonadiabatic transport (violating the third invariant while conserving the first two invariants) of geomagnetically trapped particles in the model magnetosphere.

Schulz, Michael↗

Planar double delay-line readout technique for microchannel plate detectors

A two-dimensional position-sensitive electrical readout system for microchannel plate detectors in spectroscopic applications has been devised. Two adjacent parallel coplanar delay lines are used. The difference in time of arrival of the electron event signal between the ends of the delay lines gives one coordinate of the centroid of each event pulse. The ratio of the event amplitudes on the two delay lines gives the orthogonal coordinate by means of charge partitioning. The performance characteristics of operational double delay lines for systems of this type are presented.

Lampton, M.↗

Mutual exclusion

Almost all computers today operate as part of a network, where they assist people in coordinating actions. Sometimes what appears to be a single computer is actually a network of cooperating computers; e.g., some supercomputers consist of many processors operating in parallel and exchanging synchronization signals. One of the most fundamental requirements in all these systems is that certain operations be indivisible: the steps of one must not be interleaved with the steps of another. Two approaches were designed to implement this requirement, one based on central locks and the other on distributed order tickets. Practicing scientists and engineers need to come to be familiar with these methods.

Denning, Peter J.↗

Overview of NASA Gateway Lunar Dust Mitigation and Contamination Modeling and Analysis

The planned NASA Artemis campaign has several lunar surface missions in which the NASA Gateway is the waypoint between lunar orbit and the lunar surface for Human Lander System (HLS). Each of these missions is an opportunity for lunar dust to be introduced into the Gateway environment, post surface mission, potentially causing end of life (EOL) performance degradation due to lunar dust contamination of sensitive hardware and systems on the exterior of Gateway and Visiting Vehicles. The Gateway Systems Engineering and Integration (SE&I) and Induced Environments teams are addressing the challenge of lunar dust with a two-pronged approach. Characterization of the lunar dust induced environment around Gateway and contamination risk is accomplished with a comprehensive physics-based framework, the Gateway On-orbit Lunar Dust Modeling and Analysis Program (GOLDMAP), which is currently in development. Analysis results from GOLDMAP define Gateway-level induced environments requirements and are flowed to elements and subsystems. In parallel, a dust mitigation strategy is being developed with a focus on lunar dust protection, dust mitigation technologies, mitigation and testing guidance, and cross-program coordination and is informed by outputs from GOLDMAP analyses. Activities supporting both components include hardware susceptibility assessments and testing, and scientific experiments on lunar regolith.

Gateway↗

Lazy checkpoint coordination for bounding rollback propagation

Independent checkpointing allows maximum process autonomy but suffers from potential domino effects. Coordinated checkpointing eliminates the domino effect by sacrificing a certain degree of process autonomy. In this paper, we propose the technique of lazy checkpoint coordination which preserves process autonomy while employing communication-induced checkpoint coordination for bounding rollback propagation. The introduction of the notion of laziness allows a flexible trade-off between the cost for checkpoint coordination and the average rollback distance. Worst-case overhead analysis provides a means for estimating the extra checkpoint overhead. Communication trace-driven simulation for several parallel programs is used to evaluate the benefits of the proposed scheme for real applications.

Wang, Yi-Min↗

Lazy checkpoint coordination for bounding rollback propagation

Independent checkpointing allows maximum process autonomy but suffers from potential domino effects. Coordinated checkpointing eliminates the domino effect by sacrificing a certain degree of process autonomy. In this paper, we propose the technique of lazy checkpoint coordination which preserves process autonomy while employing communication-induced checkpoint coordination for bounding rollback propagation. The introduction of the notion of laziness allows a flexible trade-off between the cost for checkpoint coordination and the average rollback distance. Worst-case overhead analysis provides a means for estimating the extra checkpoint overhead. Communication trace-driven simulation for several parallel programs is used to evaluate the benefits of the proposed scheme for real applications.

Wang, Yi-Min↗

Numerical Studies of Boundary-Layer Receptivity

Direct numerical simulations (DNS) of the acoustic receptivity process on a semi-infinite flat plate with a modified-super-elliptic (MSE) leading edge are performed. The incompressible Navier-Stokes equations are solved in stream-function/vorticity form in a general curvilinear coordinate system. The steady basic-state solution is found by solving the governing equations using an alternating direction implicit (ADI) procedure which takes advantage of the parallelism present in line-splitting techniques. Time-harmonic oscillations of the farfield velocity are applied as unsteady boundary conditions to the unsteady disturbance equations. An efficient time-harmonic scheme is used to produce the disturbance solutions. Buffer-zone techniques have been applied to eliminate wave reflection from the outflow boundary. The spatial evolution of Tollmien-Schlichting (T-S) waves is analyzed and compared with experiment and theory. The effects of nose-radius, frequency, Reynolds number, angle of attack, and amplitude of the acoustic wave are investigated. This work is being performed in conjunction with the experiments at the Arizona State University Unsteady Wind Tunnel under the direction of Professor William Saric. The simulations are of the same configuration and parameters used in the wind-tunnel experiments.

Reed, Helen L.↗

NASA Tech Briefs, August 2003

Topics covered include: Stable, Thermally Conductive Fillers for Bolted Joints; Connecting to Thermocouples with Fewer Lead Wires; Zipper Connectors for Flexible Electronic Circuits; Safety Interlock for Angularly Misdirected Power Tool; Modular, Parallel Pulse-Shaping Filter Architectures; High-Fidelity Piezoelectric Audio Device; Photovoltaic Power Station with Ultracapacitors for Storage; Time Analyzer for Time Synchronization and Monitor of the Deep Space Network; Program for Computing Albedo; Integrated Software for Analyzing Designs of Launch Vehicles; Abstract-Reasoning Software for Coordinating Multiple Agents; Software Searches for Better Spacecraft-Navigation Models; Software for Partly Automated Recognition of Targets; Antistatic Polycarbonate/Copper Oxide Composite; Better VPS Fabrication of Crucibles and Furnace Cartridges; Burn-Resistant, Strong Metal-Matrix Composites; Self-Deployable Spring-Strip Booms; Explosion Welding for Hermetic Containerization; Improved Process for Fabricating Carbon Nanotube Probes; Automated Serial Sectioning for 3D Reconstruction; and Parallel Subconvolution Filtering Architectures.

Source record↗

An architecture for real-time vision processing

To study the feasibility of developing an architecture for real time vision processing, a task queue server and parallel algorithms for two vision operations were designed and implemented on an i860-based Mercury Computing System 860VS array processor. The proposed architecture treats each vision function as a task or set of tasks which may be recursively divided into subtasks and processed by multiple processors coordinated by a task queue server accessible by all processors. Each idle processor subsequently fetches a task and associated data from the task queue server for processing and posts the result to shared memory for later use. Load balancing can be carried out within the processing system without the requirement for a centralized controller. The author concludes that real time vision processing cannot be achieved without both sequential and parallel vision algorithms and a good parallel vision architecture.

Chien, Chiun-Hong↗

A Novel Multi-Spacecraft Interplanetary Global Trajectory Optimization Transcription

As the frontier of space exploration continues to advance, so does the design complexity of future interplanetary missions. One avenue of this increasing complexity includes a class of designs known as "Distributed Spacecraft Missions"; missions where multiple spacecraft coordinate to perform shared objectives. Current approaches for the global trajectory optimization of these Multi-Vehicle Missions (MVMs) are prone to shortcomings including laborious iterative design, considerable human-in-the-loop effort, treatment of the multi-vehicle problem as multiple separate trajectory optimization subproblems (resulting in suboptimal solutions where the whole is less than the sum of its parts), and poor handling of coordination objectives and constraints. There are only a handful of software platforms in existence capable of fully-automated, rapid, interplanetary mission and systems global optimization including the Parallel Global Multiobjective Optimizer (PaGMO), the Gravity Assisted Low-thrust Local Optimization Program (GALLOP), and the Evolutionary Mission Trajectory Generator (EMTG). However, none of these tools is capable of performing such tasks for MVM designs. The work outlined in this paper lays the groundwork for a technique to begin addressing these shortcomings. We present a fully-automated technique which frames interplanetary MVMs as Multi-Objective, Multi-Agent Hybrid Optimal Control Problems (MOMA HOCP). First, the basic functionality of this technique is validated on the single-vehicle problem of reproducing the Cassini interplanetary cruise.

Interplanetary↗