Search NASA⌕ Search

SEARCH · Search NASA

Results for “CONNECT algorithm”

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 199 records · Page 11

Development of a large space robot - A multi-segment approach. I

A concept of multisegment robot (of a class of large space cranes) is developed for use in space-based construction operations. The robot consists of a collection of segments, which are pinned together to form a snakelike configuration, with a single degree of freedom representing rotation being retained at each pinned connection and with reaction flywheels suspended within each segment for the control necessary to position each body segment. Algorithms are developed for positioning this serpentine robot to a prescribed location and orientation. A multibody dynamics simulation is used to investigate the behavior and interactions of the robot, demonstrating its viability.

Spanos, P. D.↗

Performance Evaluation of Three Distributed Computing Environments for Scientific Applications

We present performance results for three distributed computing environments using the three simulated CFD applications in the NAS Parallel Benchmark suite. These environments are the DCF cluster, the LACE cluster, and an Intel iPSC/860 machine. The DCF is a prototypic cluster of loosely coupled SGI R3000 machines connected by Ethernet. The LACE cluster is a tightly coupled cluster of 32 IBM RS6000/560 machines connected by Ethernet as well as by either FDDI or an IBM Allnode switch. Results of several parallel algorithms for the three simulated applications are presented and analyzed based on the interplay between the communication requirements of an algorithm and the characteristics of the communication network of a distributed system.

Fatoohi, Rod↗

Isolator Shock Train Response to Dual-Mode Scramjet Throttling-Like Forcing

Typical dual-mode scramjet designs employ an isolator component situated between the inlet and combustor. The isolator fluidically buffers the inlet from the combustor via the formation of a shock train, an interconnected series of shock-boundary layer interactions. The isolator is required during ramjet-engine operation and at the lower edges of the scramjet operational envelope. In an operational engine, transient behavior imposes fluidic dynamics due to attitude adjustments, combustor throttling, aberrant resonances within the combustor, etc. To accommodate these transients, the shock train adjusts on both temporal and spatial scales. Sufficiently large downstream pressure increases in the combustor play a critical role during unstart, whereby strong compression waves propagate upstream in the isolator to ultimately force the shock train out the inlet, if it cannot stabilize to the pressure increase. This critically reduces the engine mass flow rate, potentially causing a catastrophic reduction in thrust and loss of the vehicle. A nearly instantaneous unstart can, in principle, be predicted by a ratio of the normal shock pressure jump in an inviscid isolator. However, lower-magnitude perturbations, below this bound, also induce unstarts. Understanding the transient behavior inherent in unsteady isolator operation is critical to reducing safety margin in isolator length and refining engine control algorithms to improve engine performance. The Isolator Dynamics Research Lab (IDRL) is a cold-flow, direct-connect isolator facility ideal for assessing the fundamental fluid dynamics of shock trains. The internal flow of a scramjet isolator is modeled using a 2D, symmetric Mach 2.5 nozzle followed by a 695 mm long, 25.4x50.8 mm rectangular isolator test section. A blockage cone on a high-speed ball screw actuator downstream of the isolator is pulsed to simulate the throttling behavior in an operational combustor. Wall flush high-speed static pressure transducers detect the streamwise shock train within the isolator. Time delays between the onset of the throttling and the response motion of the shock train are analyzed to assess the controlling scales and parameters. From this analysis, the response time of the isolator shock train system is found to depend primarily on the isolator back pressure time-rate-of-change but quickly saturates to a maximum propagation speed along the isolator. These results inform dual-mode scramjet engine designers of the critical parameters and limits of an unstart resistant engine.

scramjet↗

Validation Assessment for the Soil Moisture Active Passive (SMAP) Level 4 Carbon (L4_C) Data Product Version 5

The post-launch Cal/Val phase of the SMAP mission is guided by two primary objectives for each science product team: 1) to calibrate, verify, and improve the performance of the science algorithms, and 2) validate accuracies of the science data products as specified in the SMAP Level-1 mission science requirements. Algorithm science and product maintenance activities during the SMAP extended mission phase have also involved periodic algorithm calibration and product refinements to maintain or enhance product consistency and performance as well as science utility. This report provides an assessment of the latest (Version 5) SMAP Level 4 Carbon (L4_C) product. The L4_C Version 5 (v5) global record now spans more than six years (March 2015 – present) of SMAP operations and has benefited from five major reprocessing updates to the operational product. These reprocessing events and L4_C product release updates have incorporated various algorithm refinements and calibration adjustments to account for similar refinements to the upstream GEOS land model assimilation system, SMAP brightness temperatures, and MODIS vegetation inputs used for L4_C processing. The SMAP L4_C algorithms utilize a terrestrial carbon flux model informed by daily surface and root zone soil moisture information contributed from the SMAP Level 4 Soil Moisture (L4_SM) product along with optical remote sensing-based (e.g. MODIS-based) land cover and canopy fractional photosynthetic active radiation (fPAR), and other ancillary biophysical data. The carbon flux model estimates global daily net ecosystem CO2 exchange (NEE) and the component carbon fluxes, namely, vegetation gross primary production (GPP) and soil heterotrophic respiration (Rh). Other L4_C product elements include surface (~0-5 cm depth) soil organic carbon (SOC) stocks and associated environmental constraints to these processes, including soil moisture-related controls on GPP and ecosystem respiration (Kimball et al. 2014, Jones et al. 2017). The L4_C product addresses SMAP carbon cycle science objectives by: 1) providing a direct link between terrestrial carbon fluxes and underlying freeze/thaw and soil moisture-related constraints to these processes, 2) documenting primary connections between terrestrial water, energy and carbon cycles, and 3) improving understanding of terrestrial carbon sink activity. The SMAP L4_C algorithms and operational product are mature and at a CEOS Validation Stage 4 level (Jackson et al. 2012) based on extensive validation of the multi-year record against a diverse array of independent benchmarks, well characterized global performance, and systematic refinements gained from five major reprocessing events. There are no Level-1 mission science requirements for the L4_C product; however, self-imposed requirements have been established focusing on NEE as the primary product field for validation, and on demonstrating L4_C accuracy and success in meeting product science requirements (Jackson et al. 2012). The other L4_C product fields also have strong utility for carbon science applications (e.g., Liu et al. 2019, Endsley et al. 2020); however, analysis of these other fields is considered secondary relative to primary validation activities focusing on NEE. The L4_C targeted accuracy requirements are to meet or exceed a mean unbiased root-mean-square error (ubRMSE, or standard deviation of the error) for NEE of 1.6 g C m-2 d-1 and 30 g C m-2 yr-1, emphasizing northern (≥45°N) boreal and arctic ecosystems; this accuracy is similar to that of tower eddy covariance measurement-based observations (Baldocchi 2008). Methods used for the latest v5 L4_C product performance and validation assessment have been established from the SMAP Cal/Val plan and previous studies (Jackson et al. 2012, Jones et al. 2017) and include: 1) consistency evaluations of the product fields against earlier product releases (version 4 or earlier); 2) comparisons of daily carbon flux estimates with independent tower eddy 4covariance measurement-based daily carbon (CO2) flux observations from core tower validation sites (CVS); and 3) consistency checks against other global carbon products, including soil carbon inventory records, global GPP records derived from tower observation upscaling methods, and satellite-based observations of canopy solar induced chlorophyll fluorescence (SIF) as a surrogate for GPP. Metrics used to evaluate relative agreement between L4_C product fields and observational benchmarks include correlation (r-value), RMSE differences, bias and model sensitivity diagnostics. Following these validation criteria, the present report provides a validation assessment of the latest L4_C product release (v5). Detailed descriptions of the L4_C algorithm and additional global product accuracy and performance results are given elsewhere (Jones et al. 2017, Endsley et al. 2020). The v5 L4_C product replaces earlier product versions and continues to show: (i) accuracy and performance levels meeting or exceeding SMAP L4_C science requirements; (ii) improvement over the previous product version (version 4); and (iii) suitability for a diversity of science applications. Example L4_C applications from the recent literature include clarifying environmental trends and controls on the northern terrestrial carbon sink (Liu et al. 2019), diagnosing drought-related impacts on ecosystem productivity (Li et al. 2020), and regional monitoring of cropland conditions for projecting annual yields (Wurster et al. 2020). 2EXPECTED L4_C ALGORITHM AND PRODUCTPERFORMANCE The L4_C algorithm performance, including variance and uncertainty estimates of model outputs, was determined during the mission pre-launch phase through spatially explicit model sensitivity studies using available model inputs similar to those currently being used for operational production and evaluating the resulting model simulations over the observed range of northern (≥45 °N) and global conditions (Kimball et al. 2012, Entekhabi et al. 2014). The L4_C algorithm options were also evaluated during the mission prelaunch phase, including deriving canopy fPAR from lower order NDVI (Normalized Difference Vegetation Index) inputs in lieu of using MODIS (MOD15) fPAR; and including an explicit model representation of boreal fire disturbance recovery impacts. These results indicated that the L4_C accuracy requirements (i.e., NEE ubRMSE ≤ 30 g C m-2 yr-1or ≤ 1.6 g C m-2 d-1) could be met from the baseline algorithms over more than 82% and 89% of global and northern vegetated land areas, respectively (Yi et al. 2013, Kimball et al. 2014). The global L4_C algorithm error budget for NEE derived during the mission prelaunch phase indicated that the estimated NEE ubRMSE uncertainty is proportional to GPP and is therefore larger in higher biomass productivity areas, including forests and croplands (Kimball et al. 2014). Likewise, NEE ubRMSE uncertainty is expected to be lower in less-productive areas, including grasslands and shrublands. Expected model NEE ubRMSE levels were also generally within targeted accuracy levels for characteristically less-productive boreal and Arctic biomes, even though relative model error as a proportion of total productivity (NEE RMSE / GPP) may be large in these areas. The estimated NEE uncertainty was lower than expected in some warmer tropical high biomass productivity areas (e.g. Amazon rainforest) because of reduced low temperature and moisture constraints to the L4_C respiration calculations so that the bulk of model uncertainty is contributed by GPP in these areas. Model NEE uncertainty in the African Congo was estimated to

SMAP↗

Development of Fast Algorithms Using Recursion, Nesting and Iterations for Computational Electromagnetics

In the first phase of our work, we have concentrated on laying the foundation to develop fast algorithms, including the use of recursive structure like the recursive aggregate interaction matrix algorithm (RAIMA), the nested equivalence principle algorithm (NEPAL), the ray-propagation fast multipole algorithm (RPFMA), and the multi-level fast multipole algorithm (MLFMA). We have also investigated the use of curvilinear patches to build a basic method of moments code where these acceleration techniques can be used later. In the second phase, which is mainly reported on here, we have concentrated on implementing three-dimensional NEPAL on a massively parallel machine, the Connection Machine CM-5, and have been able to obtain some 3D scattering results. In order to understand the parallelization of codes on the Connection Machine, we have also studied the parallelization of 3D finite-difference time-domain (FDTD) code with PML material absorbing boundary condition (ABC). We found that simple algorithms like the FDTD with material ABC can be parallelized very well allowing us to solve within a minute a problem of over a million nodes. In addition, we have studied the use of the fast multipole method and the ray-propagation fast multipole algorithm to expedite matrix-vector multiplication in a conjugate-gradient solution to integral equations of scattering. We find that these methods are faster than LU decomposition for one incident angle, but are slower than LU decomposition when many incident angles are needed as in the monostatic RCS calculations.

Chew, W. C.↗

On the structure of parallelism in a highly concurrent PDE solver

A parallel multigrid algorithm for solving elliptic partial differential equations is developed and evaluated. A V-cycle multigrid method is altered to increase the degree of parallelism. A numerical analysis of the resulting concurrent-iteration multigrid algorithm is performed; its architectural implications are considered; highly parallel systems without shared memory are examined (including mesh-connected arrays, mesh-shuffle-connected systems, permutation networks, and direct VLSI embeddings); and the results of numerical experiments are presented in tables and graphs.

Gannon, D.↗

Three dimensional mesh generation by triangulation of arbitrary point sets

A method for generating an unstructured mesh is described. The approach is quite general and joins an arbitrary set of points to produce a covering of three dimensional space by tetrahedra. After removing the tetrahedra that connect surface points, a mesh suitable for a finite element based flow solver is obtained. Details of the triangulation algorithm are provided together with an analysis of the algorithm efficiency and validity.

Baker, Timothy J.↗

Computational fluid dynamics on a massively parallel computer

A finite difference code was implemented for the compressible Navier-Stokes equations on the Connection Machine, a massively parallel computer. The code is based on the ARC2D/ARC3D program and uses the implicit factored algorithm of Beam and Warming. The codes uses odd-even elimination to solve linear systems. Timings and computation rates are given for the code, and a comparison is made with a Cray XMP.

Jespersen, Dennis C.↗

Neural-Network-Development Program

NETS, software tool for development and evaluation of neural networks, provides simulation of neural-network algorithms plus computing environment for development of such algorithms. Uses back-propagation learning method for all of networks it creates. Enables user to customize patterns of connections between layers of network. Also provides features for saving, during learning process, values of weights, providing more-precise control over learning process. Written in ANSI standard C language. Machine-independent version (MSC-21588) includes only code for command-line-interface version of NETS 3.0.

Phillips, Todd A.↗

Aspects of Unstructured Grids and Finite-Volume Solvers for the Euler and Navier-Stokes Equations

One of the major achievements in engineering science has been the development of computer algorithms for solving nonlinear differential equations such as the Navier-Stokes equations. These algorithms are now used in the practical engineering design of devices such as cars and airplanes as well as theoretical studies of complex phenomena such as fluid turbulence. In past years, limited computer resources have motivated the development of efficient numerical methods in computational fluid dynamics (CFD) utilizing structured meshes. These meshes are comprised of systematic arrays of quadrilateral or hexahedral cells. The use of structured meshes greatly simplifies the implementation of CFD algorithms on conventional computers. Structured meshes also permit the use of highly efficient solution techniques such as alternating direction implicit (ADI) iteration schemes or multigrid. Following the dramatic improvement in computing speed in recent years, emphasis has shifted towards the design of algorithms capable of treating complex geometries. The automatic generation of structured grids about complex geometries is problematic. Unstructured grids offer one promising alternative technique for treating these general geometries. Unstructured meshes have irregular connectivity and usually contain triangles and/or quadrilaterals in two dimensions and tetrahedra and/or hexahedra in three dimensions. The generation and use of unstructured grids poses new challenges in computational fluid dynamics. This is true for both grid generation as well as for the design of algorithms for flow solution. The purpose of these notes is to present recent developments in the unstructured grid generation and flow solution technology.

Barth, T. J.↗

A sparse matrix algorithm on the Boolean vector machine

VLSI technology is being used to implement a prototype Boolean Vector Machine (BVM), which is a large network of very small processors with equally small memories that operate in SIMD mode; these use bit-serial arithmetic, and communicate via cube-connected cycles network. The BVM's bit-serial arithmetic and the small memories of individual processors are noted to compromise the system's effectiveness in large numerical problem applications. Attention is presently given to the implementation of a basic matrix-vector iteration algorithm for space matrices of the BVM, in order to generate over 1 billion useful floating-point operations/sec for this iteration algorithm. The algorithm is expressed in a novel language designated 'BVM'.

Wagner, Robert A.↗

Normalized Cut Algorithm for Automated Assignment of Protein Domains

We present a novel computational method for automatic assignment of protein domains from structural data. At the core of our algorithm lies a recently proposed clustering technique that has been very successful for image-partitioning applications. This grap.,l-theory based clustering method uses the notion of a normalized cut to partition. an undirected graph into its strongly-connected components. Computer implementation of our method tested on the standard comparison set of proteins from the literature shows a high success rate (84%), better than most existing alternative In addition, several other features of our algorithm, such as reliance on few adjustable parameters, linear run-time with respect to the size of the protein and reduced complexity compared to other graph-theory based algorithms, would make it an attractive tool for structural biologists.

Samanta, M. P.↗

Co-axial Joint Technology Applied to Antenna Backup Structures

The increasing demand to improve focusing accuracy and to accommodate higher frequencies in space communications and radio astronomy has created significant challenges for improving the capability of the constituent systems in radio antennas and telescopes. One important system is the radio antenna/telescope backup structure connections. The backup structure is a key element in providing a stable, precise and rigid support for the reflective surface. The ideal connection for these types of structures is rigid and concentric resulting in minimal deformation with stress/strain curves that are linear, repeatable and exhibiting no hysteresis over the entire service load range. Conceivably such a connection could be designed so that the stress/strain curve mimics the stress/strain characteristics of the connecting member in both tension and compression. When this is achieved then such joints can be said to be 'invisible' in the global behavior of the backup structure. At that point, overall reflector deflection becomes more linear and highly predictable. In conjunction with this advantage, optimized backup structure geometries, adaptive reflectors and compensating algorithms can best be applied in producing an instrument of unparalleled performance. This paper introduces Co-Axial Joint (CAJ) technology as the practical and economical means to produce an invisible connection.

trusses↗

Transmission Scheduling and Routing Algorithms for Delay Tolerant Networks

The challenges of data processing, transmission scheduling and routing within a space network present a multi-criteria optimization problem. Long delays, intermittent connectivity, asymmetric data rates and potentially high error rates make traditional networking approaches unsuitable. The delay tolerant networking architecture and protocols attempt to mitigate many of these issues, yet transmission scheduling is largely manually configured and routes are determined by a static contact routing graph. A high level of variability exists among the requirements and environmental characteristics of different missions, some of which may allow for the use of more opportunistic routing methods. In all cases, resource allocation and constraints must be balanced with the optimization of data throughput and quality of service. Much work has been done researching routing techniques for terrestrial-based challenged networks in an attempt to optimize contact opportunities and resource usage. This paper examines several popular methods to determine their potential applicability to space networks.

Space Networking↗

Analysis of Sting Balance Calibration Data Using Optimized Regression Models

Calibration data of a wind tunnel sting balance was processed using a candidate math model search algorithm that recommends an optimized regression model for the data analysis. During the calibration the normal force and the moment at the balance moment center were selected as independent calibration variables. The sting balance itself had two moment gages. Therefore, after analyzing the connection between calibration loads and gage outputs, it was decided to choose the difference and the sum of the gage outputs as the two responses that best describe the behavior of the balance. The math model search algorithm was applied to these two responses. An optimized regression model was obtained for each response. Classical strain gage balance load transformations and the equations of the deflection of a cantilever beam under load are used to show that the search algorithm s two optimized regression models are supported by a theoretical analysis of the relationship between the applied calibration loads and the measured gage outputs. The analysis of the sting balance calibration data set is a rare example of a situation when terms of a regression model of a balance can directly be derived from first principles of physics. In addition, it is interesting to note that the search algorithm recommended the correct regression model term combinations using only a set of statistical quality metrics that were applied to the experimental data during the algorithm s term selection process.

Ulbrich, N.↗

Design Description of the X-33 Avionics Architecture

In this paper, we provide a design description of the X-33 avionics architecture. The X-33 is an autonomous Single Stage to Orbit (SSTO) launch vehicle currently being developed by Lockheed Martin for NASA as a technology demonstrator for the VentureStar Reusable Launch Vehicle (RLV). The X-33 avionics provides autonomous control of die vehicle throughout takeoff, ascent, descent, approach, landing, rollout, and vehicle safing. During flight the avionics provides communication to the range through uplinked commands and downlinked telemetry. During pre-launch and post-safing activities, the avionics provides interfaces to ground support consoles that perform vehicle flight preparations and maintenance. The X-33 Avionics is a hybrid of centralized and distributed processing elements connected by three dual redundant Mil-Std 1553 data buses. These data buses are controlled by a central processing suite located in the avionics bay and composed of triplex redundant Vehicle Mission Computers (VMCs). The VMCs integrate mission management, guidance, navigation, flight control, subsystem control and redundancy management functions. The vehicle sensors, effectors and subsystems are interfaced directly to the centralized VMCs as remote terminals or through dual redundant Data Interface Units (DIUs). The DIUs are located forward and aft of the avionics bay and provide signal conditioning, health monitoring, low level subsystem control and data interface functions. Each VMC is connected to all three redundant 1553 data buses for monitoring and provides a complete identical data set to the processing algorithms. This enables bus faults to be detected and reconfigured through a voted bus control configuration. Data is also shared between VMCs though a cross channel data link that is implemented in hardware and controlled by AlliedSignal's Fault Tolerant Executive (FTE). The FTE synchronizes processors within the VMC and synchronizes redundant VMCs to each other. The FTE provides an output-voting plane to detect, isolate and contain faults due to internal hardware or software faults and reconfigures the VMCs to accommodate these faults. Critical data in the 1553 messages are scheduled and synchronized to specific processing frames in order to minimize data latency. In order to achieve an open architecture, military and commercial off-the-shelf equipment is incorporated using common processors, standard VME backplanes and chassis, the VxWorks operating system, and MartixX for automatic code generation. The use of off-the-shelf tools and equipment helps reduce development time and enables software reuse. The open architecture allows for technology insertion, while the distributed modular elements allow for expansion to increased redundancy levels to meet the higher reliability goals of future RLVs.

Reichenfeld, Curtis J.↗

Numerical Models of Human Circulatory System under Altered Gravity: Brain Circulation

A computational fluid dynamics (CFD) approach is presented to model the blood flow through the human circulatory system under altered gravity conditions. Models required for CFD simulation relevant to major hemodynamic issues are introduced such as non-Newtonian flow models governed by red blood cells, a model for arterial wall motion due to fluid-wall interactions, a vascular bed model for outflow boundary conditions, and a model for auto-regulation mechanism. The three-dimensional unsteady incompressible Navier-Stokes equations coupled with these models are solved iteratively using the pseudocompressibility method and dual time stepping. Moving wall boundary conditions from the first-order fluid-wall interaction model are used to study the influence of arterial wall distensibility on flow patterns and wall shear stresses during the heart pulse. A vascular bed modeling utilizing the analogy with electric circuits is coupled with an auto-regulation algorithm for multiple outflow boundaries. For the treatment of complex geometry, a chimera overset grid technique is adopted to obtain connectivity between arterial branches. For code validation, computed results are compared with experimental data for steady and unsteady non-Newtonian flows. Good agreement is obtained for both cases. In sin-type Gravity Benchmark Problems, gravity source terms are added to the Navier-Stokes equations to study the effect of gravitational variation on the human circulatory system. This computational approach is then applied to localized blood flows through a realistic carotid bifurcation and two Circle of Willis models, one using an idealized geometry and the other model using an anatomical data set. A three- dimensional anatomical Circle of Willis configuration is reconstructed from human-specific magnetic resonance images using an image segmentation method. The blood flow through these Circle of Willis models is simulated to provide means for studying gravitational effects on the brain circulation under auto-regulation.

Kim, Chang Sung↗

Parallel Wavefront Analysis for a 4D Interferometer

This software provides a programming interface for automating data collection with a PhaseCam interferometer from 4D Technology, and distributing the image-processing algorithm across a cluster of general-purpose computers. Multiple instances of 4Sight (4D Technology s proprietary software) run on a networked cluster of computers. Each connects to a single server (the controller) and waits for instructions. The controller directs the interferometer to several images, then assigns each image to a different computer for processing. When the image processing is finished, the server directs one of the computers to collate and combine the processed images, saving the resulting measurement in a file on a disk. The available software captures approximately 100 images and analyzes them immediately. This software separates the capture and analysis processes, so that analysis can be done at a different time and faster by running the algorithm in parallel across several processors. The PhaseCam family of interferometers can measure an optical system in milliseconds, but it takes many seconds to process the data so that it is usable. In characterizing an adaptive optics system, like the next generation of astronomical observatories, thousands of measurements are required, and the processing time quickly becomes excessive. A programming interface distributes data processing for a PhaseCam interferometer across a Windows computing cluster. A scriptable controller program coordinates data acquisition from the interferometer, storage on networked hard disks, and parallel processing. Idle time of the interferometer is minimized. This architecture is implemented in Python and JavaScript, and may be altered to fit a customer s needs.

Rao, Shanti R.↗