Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic structures”

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 1,261 records · Page 70

Concentration Measurements in Self-Excited, Momentum-Dominated Helium Jets

Flow structure of momentum-dominated pure helium jets discharged vertically into ambient air was investigated using high-speed rainbow schlieren deflectometry (RSD) technique. Effects of the operating parameters, i.e., Reynolds number (Re) and Richardson number (Ri), on the oscillatory behavior of the flow were examined over a range of experimental conditions. To seek the individual effect of these parameters, one of them was fixed and the other was varied with certain constraints. Measurements revealed highly periodic oscillations in the laminar region as well as high regularity in transition and turbulent regions. Maximum spectral power profiles at different axial locations indicated the oscillation amplitude increasing until the breakdown of the jet in the turbulent regime. The transition from the laminar to turbulent flow was also investigated. Fast Fourier transform analysis performed in the transition regime showed that the flow oscillates at a unique frequency, which was the same in the upstream laminar flow region. Measured deflection angle data were used in Abel inversion algorithm to construct the helium concentration fields. Instantaneous helium concentration contours revealed changes in the flow structure and evolution of vortical structures during an oscillation cycle. Temporal evolution plots of helium concentration at different axial location showed repeatable oscillations at all axial and radial locations up to the turbulent regime. A cross-correlation technique, applied to find the spatial displacements of the vortical structures, provided correlation coefficient peaks between consecutive schlieren images. Results show that the vortical structure convected and accelerated only in the axial direction.

Yildirim, Bekir Sedat↗

Early events in the folding of an amphipathic peptide: A multinanosecond molecular dynamics study

Folding of the capped LQQLLQQLLQL peptide is investigated at the water-hexane interface by molecular dynamics simulations for 161.5 ns. Initially placed in the aqueous phase as a beta-strand, the peptide rapidly adsorbs to the interface, where it adopts an amphipathic conformation. The marginal presence of nonamphipathic structures throughout the complete trajectory indicates that the corresponding conformations are strongly disfavored at the interface. It is further suggestive that folding in an interfacial environment proceeds through a pathway of successive amphipathic intermediates. The energetic and entropic penalties involved in the conformational changes along this pathway markedly increase the folding time scales of LQQLLQQLLQL, explaining why the alpha-helix, the hypothesized lowest free energy structure for a sequence with a hydrophobic periodicity of 3.6, has not been reached yet. The formation of a type I beta-turn at the end of the simulation confirms the importance of such motifs as initiation sites allowing the peptide to coalesce towards a secondary structure. Proteins 1999;36:383-399. Copyright 1999 Wiley-Liss, Inc.

NASA Center ARC↗

Vertical Structure in Phytoplankton Growth and Productivity Inferred From Biogeochemical-Argo Floats and the Carbon-Based Productivity Model

Estimates of marine net primary production (NPP) commonly rely on limited in situ 14C incubations or satellite-based algorithms mainly constrained to the surface ocean. Here we combine data from biogeochemical Argo floats with a carbon-based productivity model (CbPM) to compute vertically-resolved estimates of NPP. Inferred NPP profiles derived by informing the CbPM with float-based, depth-resolved, bio-optical data are able to qualitatively reproduce the vertical structure in NPP inferred from in situ 14C incubations at various ocean regions. At station ALOHA, float-based estimates agree within uncertainty with productivity observations at depth, but underestimate surface NPP. We test the ability of the CbPM to infer the depth-resolved structure in NPP from bio-optical properties in the mixed layer, in similar fashion as how remote sensing algorithms of ocean productivity operate. In Southern Ocean waters, the depth-reconstructing implementation of the CbPM overestimates phytoplankton division rates and Chl:C below the mixed layer, resulting in artificially high subsurface NPP when compared with the fully float-informed implementation of the model. The CbPM subsurface extrapolation of phytoplankton Chl, Chl:C division rates, and NPP improves by accounting for deep nutrient (iron) stress impacts on photoacclimation in the Southern Ocean. This improvement is also observed in vertically- integrated NPP, where the mean bias between model implementations in depth-integrated productivity south of 30◦S is reduced by 62 % when account for deep iron limitation. Our results demonstrate that profiling data from biogeochemical Argo floats can serve to inform regional adjustments that lead to the improvement of marine productivity algorithms.

NPP↗

An implementation of a tree code on a SIMD, parallel computer

We describe a fast tree algorithm for gravitational N-body simulation on SIMD parallel computers. The tree construction uses fast, parallel sorts. The sorted lists are recursively divided along their x, y and z coordinates. This data structure is a completely balanced tree (i.e., each particle is paired with exactly one other particle) and maintains good spatial locality. An implementation of this tree-building algorithm on a 16k processor Maspar MP-1 performs well and constitutes only a small fraction (approximately 15%) of the entire cycle of finding the accelerations. Each node in the tree is treated as a monopole. The tree search and the summation of accelerations also perform well. During the tree search, node data that is needed from another processor is simply fetched. Roughly 55% of the tree search time is spent in communications between processors. We apply the code to two problems of astrophysical interest. The first is a simulation of the close passage of two gravitationally, interacting, disk galaxies using 65,636 particles. We also simulate the formation of structure in an expanding, model universe using 1,048,576 particles. Our code attains speeds comparable to one head of a Cray Y-MP, so single instruction, multiple data (SIMD) type computers can be used for these simulations. The cost/performance ratio for SIMD machines like the Maspar MP-1 make them an extremely attractive alternative to either vector processors or large multiple instruction, multiple data (MIMD) type parallel computers. With further optimizations (e.g., more careful load balancing), speeds in excess of today's vector processing computers should be possible.

Olson, Kevin M.↗

A parallel algorithm for channel routing on a hypercube

A new parallel simulated annealing algorithm for channel routing on a P processor hypercube is presented. The basic idea used is to partition a set of tracks equally among processors in the hypercube. In parallel, P/2 pairs of processors perform displacements and exchanges of nets between tracks, compute the changes in cost functions, and accept moves using a parallel annealing criteria. Through the use of a unique distributed data structure, it is possible to minimize message traffic and add versatility and efficiency in a parallel routing tool. The algorithm has been implemented and is being tested on some of the popular channel problems from the literature.

Brouwer, Randall↗

Towards real-time simulation of large space structures: Stabilization of fluid/thermal/structure interactions and implementation on high performance supercomputers

Within the Center for Space Construction, the SIMSTRUC project's objectives center around the development of simulation tools for the realistic analysis of large space structures. The word 'tools' is the broad sense; it designates mathematical models, finite element/finite difference formulations, computational algorithms, implementations on advanced computer architectures, and visualization capabilities. The results of our activities during the first year within the SIMSTRUC project are reported. On the modeling side, an alternative approach to fluid/thermal/structure interaction analysis that is a departure from the 'loosely coupled' and 'unified' approaches that are being currently practiced are described. The advantages of our approach both in terms of accuracy and computational efficiency were demonstrated. On the computational side, a software architecture for parallel/vector and massively parallel supercomputers that speeds up finite element and finite difference computations by several orders of magnitude is presented. As an example, the simulation of the deployment of a space structure that used to require over six hours of a workstation using a conventional finite element software, now runs on a multiprocessor using a parallel computation strategy in less than three seconds. In order to promote the physical understanding of the simulation behavior, a real-time visualization capability on the Connection Machine, which allows the analyst to watch the graphical animation of the results at the same time these are generated, was also developed. It is believed that by combining efficient analytical formulations with the state-of-the-art high performance computer implementations and superfast visualization capabilities, SIMSTRUC is moving fast towards the real-time simulation of large space structures. The designers as well as the researchers will certainly benefit from this technology.

Farhat, C.↗

Protein Kinase Classification with 2866 Hidden Markov Models and One Support Vector Machine

The main application considered in this paper is predicting true kinases from randomly permuted kinases that share the same length and amino acid distributions as the true kinases. Numerous methods already exist for this classification task, such as HMMs, motif-matchers, and sequence comparison algorithms. We build on some of these efforts by creating a vector from the output of thousands of structurally based HMMs, created offline with Pfam-A seed alignments using SAM-T99, which then must be combined into an overall classification for the protein. Then we use a Support Vector Machine for classifying this large ensemble Pfam-Vector, with a polynomial and chisquared kernel. In particular, the chi-squared kernel SVM performs better than the HMMs and better than the BLAST pairwise comparisons, when predicting true from false kinases in some respects, but no one algorithm is best for all purposes or in all instances so we consider the particular strengths and weaknesses of each.

Weber, Ryan↗

Weight minimization of structures for fixed flutter speed via an optimality criterion

A rigorous optimality criterion is derived and a hybrid weight-reduction algorithm developed for the weight minimization of lifting surfaces with a constraint on flutter speed. The weight-reduction algorithm incorporates a simple recursion formula derived from the optimality criterion. Monotonic weight reduction is accomplished by dynamically adjusting a parameter in the recursion formula so as to achieve a predetermined weight decrease. The algorithm thus combines the simplicity of optimality-criterion methods with the convergence characteristics of mathematical-programming methods. The imposition of the flutter constraint is simplified by forcing to zero the imaginary part of the flutter eigenvalue, with the airspeed fixed. Four examples are discussed. The results suggest that significant improvements in efficiency are possible, in comparison with techniques based purely on mathematical programming.

Segenreich, S. A.↗

The multi-disciplinary design study. A life cycle cost algorithm

Life-cycle cost (LCC) is investigated as a comprehensive design criterion for two major interrelated spacecraft subsystems, Controls and Structures. A Multi-Disciplinary Design Tool (MDDT) is developed to evaluate the sensitivity of LCC to subsystem design parameters. Major costs addressed are: non-recurring; launch; ground support; maintenance; expendables; and software. Examples and results from the MDDT are described, including a structural optimization study between different truss designs; a solar array feathering trade for a minimal drag configuration during umbra; and the cost of active control of a flexible structure is compared against the cost of passive damping using visco-elastic material.

Harding, R. R.↗

Evolutionary Optimization of Quadrifilar Helical and Yagi-Uda Antennas

We present optimization results obtained for two type of antennas using evolutionary algorithms. A quadrifilar helical UHF antenna is currently flying aboard NASA's Mars Odyssey spacecraft and is due to reach final Martian orbit insertion in January, 2002. Using this antenna as a benchmark, we ran experiments employing a coevolutionary genetic algorithm to evolve a quadrifilar helical design in-situ - i.e., in the presence of a surrounding structure. Results show a 93% improvement at 400 MHz and a 48% improvement at 438 MHz in the average gain. The evolved antenna is also one-fourth the size. Yagi-Uda antennas are known to be difficult to design and optimize due to their sensitivity at high gain and the inclusion of numerous parasitic elements. Our fitness calculation allows the implicit relationship between power gain and sidelobe/backlobe loss to emerge naturally, a technique that is less complex than previous approaches. Our results include Yagi-Uda antennas that have excellent bandwidth and gain properties with very good impedance characteristics. Results exceeded previous Yagi-Uda antennas produced via evolutionary algorithms by at least 7.8% in mainlobe gain.

Lohn, Jason D.↗

Controlling Tensegrity Robots through Evolution using Friction based Actuation

Traditional robotic structures have limitations in planetary exploration as their rigid structural joints are prone to damage in new and rough terrains. In contrast, robots based on tensegrity structures, composed of rods and tensile cables, offer a highly robust, lightweight, and energy efficient solution over traditional robots. In addition tensegrity robots can be highly configurable by rearranging their topology of rods, cables and motors. However, these highly configurable tensegrity robots pose a significant challenge for locomotion due to their complexity. This study investigates a control pattern for successful locomotion in tensegrity robots through an evolutionary algorithm. A twelve-rod hardware model is rapidly prototyped to utilize a new actuation method based on friction. A web-based physics simulation is created to model the twelve-rod tensegrity ball structure. Square-waves are used as control policies for the actuators of the tensegrity structure. Monte Carlo trials are run to find the most successful number of amplitudes for the square-wave control policy. From the results, an evolutionary algorithm is implemented to find the most optimized solution for locomotion of the twelve-rod tensegrity structure. The software pattern coupled with the new friction based actuation method can serve as the basis for highly efficient tensegrity robots in space exploration.

Tensegrit↗

Three dimensional unstructured multigrid for the Euler equations

The three dimensional Euler equations are solved on unstructured tetrahedral meshes using a multigrid strategy. The driving algorithm consists of an explicit vertex-based finite element scheme, which employs an edge-based data structure to assemble the residuals. The multigrid approach employs a sequence of independently generated coarse and fine meshes to accelerate the convergence to steady-state of the fine grid solution. Variables, residuals and corrections are passed back and forth between the various grids of the sequence using linear interpolation. The addresses and weights for interpolation are determined in a preprocessing stage using linear interpolation. The addresses and weights for interpolation are determined in a preprocessing stage using an efficient graph traversal algorithm. The preprocessing operation is shown to require a negligible fraction of the CPU time required by the overall solution procedure, while gains in overall solution efficiencies greater than an order of magnitude are demonstrated on meshes containing up to 350,000 vertices. Solutions using globally regenerated fine meshes as well as adaptively refined meshes are given.

Mavriplis, D. J.↗

On Estimating the Phase of Periodic Waveform in Additive Gaussian Noise, Part 2

Motivated by advances in signal processing technology that support more complex algorithms, a new look is taken at the problem of estimating the phase and other parameters of a periodic waveform in additive Gaussian noise. The general problem was introduced and the maximum a posteriori probability criterion with signal space interpretation was used to obtain the structures of optimum and some suboptimum phase estimators for known constant frequency and unknown constant phase with an a priori distribution. Optimal algorithms are obtained for some cases where the frequency is a parameterized function of time with the unknown parameters and phase having a joint a priori distribution. In the last section, the intrinsic and extrinsic geometry of hypersurfaces is introduced to provide insight to the estimation problem for the small noise and large noise cases.

Rauch, L. L.↗

Application of concurrent processing to structural dynamic response computations

Described are the experiences gained from solving for the dynamic response of two simple structures on an experimental Multiple Instruction Multiple Data (MIMD) computer called the finite element machine. Introduced are MIMD computing concepts, describing how the concurrent algorithmic techniques implemented and giving results for the two example problems. The results show computational speedups of up to 7.83 using eight of the finite element machine processors and indicate that significant computational speedups are possible for large order structural computations.

Ransom, J.↗

The effects of longitudinal roughness elements upon the turbulent boundary layer

Velocity profiles and bursting statistics were measured in the presence of cylindrical longitudinal roughness elements (LREs) and compared to similar work by Johansen and Smith (1986). An algorithm was devised to detect low speed streaks (LSS) from the hot-wire rake data, allowing an estimation of the LREs' ability to reduce spatial randomness of the sublayer structure. The velocity profiles agree with Johansen and Smith's result that the effects of the LREs are felt only for y(+) less than about 15. The analysis of the bursting statistics and LSS algorithm output shows that the flow relaxes back to a flat plate boundary layer between the LREs. A crude first approximation is that the LREs simply impose the no-slip boundary condition at an elevation equivalent to their diameter. While the LREs might serve as a nucleation site for the LSS, spatial randomness of the structure is affected only very close to the LREs.

Blackwelder, R. F.↗

Discrete estimation of continuous angle-modulated signals over multipath channels for aeronautical communication

The multipath channel for communication between an aerospace vehicle and a ground terminal is modeled by a multiplicative first-order Markov process. The multiplicative process is treated as a component of the message model and the discrete-time demodulation algorithms using the extended Kalman nonlinear estimation technique are developed for continuous-time angle-modulated signals. The equivalent baseband form of the demodulator structure is derived. Two examples of the message process are discussed for an FM system. The simulation results are presented for various values of the bandwidth expansion ratio and the additive SNR. The performance of the baseband algorithms is discussed.

Takhar, G. S.↗

A Vehicle Management End-to-End Testing and Analysis Platform for Validation of Mission and Fault Management Algorithms to Reduce Risk for NASA's Space Launch System

The development of the Space Launch System (SLS) launch vehicle requires cross discipline teams with extensive knowledge of launch vehicle subsystems, information theory, and autonomous algorithms dealing with all operations from pre-launch through on orbit operations. The characteristics of these systems must be matched with the autonomous algorithm monitoring and mitigation capabilities for accurate control and response to abnormal conditions throughout all vehicle mission flight phases, including precipitating safing actions and crew aborts. This presents a large complex systems engineering challenge being addressed in part by focusing on the specific subsystems handling of off-nominal mission and fault tolerance. Using traditional model based system and software engineering design principles from the Unified Modeling Language (UML), the Mission and Fault Management (M&FM) algorithms are crafted and vetted in specialized Integrated Development Teams composed of multiple development disciplines. NASA also has formed an M&FM team for addressing fault management early in the development lifecycle. This team has developed a dedicated Vehicle Management End-to-End Testbed (VMET) that integrates specific M&FM algorithms, specialized nominal and off-nominal test cases, and vendor-supplied physics-based launch vehicle subsystem models. The flexibility of VMET enables thorough testing of the M&FM algorithms by providing configurable suites of both nominal and off-nominal test cases to validate the algorithms utilizing actual subsystem models. The intent is to validate the algorithms and substantiate them with performance baselines for each of the vehicle subsystems in an independent platform exterior to flight software test processes. In any software development process there is inherent risk in the interpretation and implementation of concepts into software through requirements and test processes. Risk reduction is addressed by working with other organizations such as S&MA, Structures and Environments, GNC, Orion, the Crew Office, Flight Operations, and Ground Operations by assessing performance of the M&FM algorithms in terms of their ability to reduce Loss of Mission and Loss of Crew probabilities. In addition, through state machine and diagnostic modeling, analysis efforts investigate a broader suite of failure effects and detection and responses that can be tested in VMET and confirm that responses do not create additional risks or cause undesired states through interactive dynamic effects with other algorithms and systems. VMET further contributes to risk reduction by prototyping and exercising the M&FM algorithms early in their implementation and without any inherent hindrances such as meeting FSW processor scheduling constraints due to their target platform - ARINC 653 partitioned OS, resource limitations, and other factors related to integration with other subsystems not directly involved with M&FM. The plan for VMET encompasses testing the original M&FM algorithms coded in the same C++ language and state machine architectural concepts as that used by Flight Software. This enables the development of performance standards and test cases to characterize the M&FM algorithms and sets a benchmark from which to measure the effectiveness of M&FM algorithms performance in the FSW development and test processes. This paper is outlined in a systematic fashion analogous to a lifecycle process flow for engineering development of algorithms into software and testing. Section I describes the NASA SLS M&FM context, presenting the current infrastructure, leading principles, methods, and participants. Section II defines the testing philosophy of the M&FM algorithms as related to VMET followed by section III, which presents the modeling methods of the algorithms to be tested and validated in VMET. Its details are then further presented in section IV followed by Section V presenting integration, test status, and state analysis. Finally, section VI addresses the summary and forward directions followed by the appendices presenting relevant information on terminology and documentation.

Trevino, Luis↗

Material and Thickness Grading for Aeroelastic Tailoring of the Common Research Model Wing Box

This work quantifies the potential aeroelastic benefits of tailoring a full-scale wing box structure using tailored thickness distributions, material distributions, or both simultaneously. These tailoring schemes are considered for the wing skins, the spars, and the ribs. Material grading utilizes a spatially-continuous blend of two metals: Al and Al+SiC. Thicknesses and material fraction variables are specified at the 4 corners of the wing box, and a bilinear interpolation is used to compute these parameters for the interior of the planform. Pareto fronts detailing the conflict between static aeroelastic stresses and dynamic flutter boundaries are computed with a genetic algorithm. In some cases, a true material grading is found to be superior to a single-material structure.

Stanford, Bret K.↗