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 379 records · Page 21

The Effect of Approximating Some Molecular Integrals in Coupled-Cluster Calculations: Fundamental Frequencies and Rovibrational Spectroscopic Constants of Cyclopropenylidene

The singles and doubles coupled-cluster method that includes a perturbational estimate of connected triple excitations, denoted CCSD(T), has been used, in conjunction with approximate integral techniques, to compute highly accurate rovibrational spectroscopic constants of cyclopropenylidene, C3H2. The approximate integral technique was proposed in 1994 by Rendell and Lee in order to avoid disk storage and input/output bottlenecks, and today it will also significantly aid in the development of algorithms for distributed memory, massively parallel computer architectures. It is shown in this study that use of approximate integrals does not impact the accuracy of CCSD(T) calculations. In addition, the most accurate spectroscopic data yet for C3H2 is presented based on a CCSD(T)/cc-pVQZ quartic force field that is modified to include the effects of core-valence electron correlation. Cyclopropenylidene is of great astronomical and astrobiological interest because it is the smallest aromatic ringed compound to be positively identified in the interstellar medium, and is thus involved in the prebiotic processing of carbon and hydrogen. The singles and doubles coupled-cluster method that includes a perturbational estimate of

Lee, Timothy J.↗

Advanced Optical Diagnostics for Ice Crystal Cloud Measurements in the NASA Glenn Propulsion Systems Laboratory

A light extinction tomography technique has been developed to monitor ice water clouds upstream of a direct connected engine in the Propulsion Systems Laboratory (PSL) at NASA Glenn Research Center (GRC). The system consists of 60 laser diodes with sheet generating optics and 120 detectors mounted around a 36-inch diameter ring. The sources are pulsed sequentially while the detectors acquire line-of-sight extinction data for each laser pulse. Using computed tomography algorithms, the extinction data are analyzed to produce a plot of the relative water content in the measurement plane. To target the low-spatial-frequency nature of ice water clouds, unique tomography algorithms were developed using filtered back-projection methods and direct inversion methods that use Gaussian basis functions. With the availability of a priori knowledge of the mean droplet size and the total water content at some point in the measurement plane, the tomography system can provide near real-time in-situ quantitative full-field total water content data at a measurement plane approximately 5 feet upstream of the engine inlet. Results from ice crystal clouds in the PSL are presented. In addition to the optical tomography technique, laser sheet imaging has also been applied in the PSL to provide planar ice cloud uniformity and relative water content data during facility calibration before the tomography system was available and also as validation data for the tomography system. A comparison between the laser sheet system and light extinction tomography resulting data are also presented. Very good agreement of imaged intensity and water content is demonstrated for both techniques. Also, comparative studies between the two techniques show excellent agreement in calculation of bulk total water content averaged over the center of the pipe.

Bencic, Timothy J.↗

Highlights of Project Accomplishments (2000-2004): Redshift Dependence of the Interaction-Activity Connection

We completed this project by developing the new galaxy-galaxy collision simulation code that we originally proposed. We included star formation heuristically, along with gas recycling and energetic feedback into the interstellar medium of the galaxies. We ran several test simulations. And we finally validated the code by running models to emulate the double-ring galaxy AM 0644-741. Most of the exotic and unique features of this collisional ring galaxy were matched by our models, thereby validating our algorithm, which may now be used by us and by the community for additional dynamic studies of galaxies. A paper has been submitted to the Astrophysical Journal describing our algorithm and the results of the AM 0644-741 modeling.

Borne, Kirk D.↗

Ground facility for large space structures dynamics and control verification

NASA Marshall Space Flight Center has developed a facility in which closed loop control of Large Space Structures (LSS) can be demonstrated and verified. The main objective of the facility is to verify LSS control system techniques so that on-orbit performance can be unsured. The facility consists of an LSS test article or payload which is connected to a 3-axis angular pointing mount assembly that provides control torque commands. The angular pointing mount assembly is attached to a base excitation system which will simulate disturbances most likely to occur for Orbiter and DOD payloads. The control computer contains the calibration software, the reference systems, the alignment procedures, the telemetry software, and the control algorithms. The total system is suspended in such a fashion that the LSS test article has the characteristics common to all LSS.

Waites, Henry↗

Large space structures ground experiment checkout

NASA Marshall Space Flight Center has developed a facility in which closed loop control of Large Space Structures (LSS) can be demonstrated and verified. The main objective of the facility is to verify LSS control system techniques so that on-orbit performance can be ensured. The facility consists of an LSS test article or payload which is connected to a 3-axis angular pointing mount assembly that provides control torque commands. The angular pointing mount assembly is attached to a base excitation system which will simulate disturbances most likely to occur for Orbiter and DOD payloads. The control computer contains the calibration software, the reference systems, the alignment procedures, the telemetry software, and the control algorithms. The total system is suspended in such a fashion that the LSS test article has the characteristics common to all LSS.

Waites, Henry B.↗

Ground facility for Large Space Structures dynamics and control verification

NASA Marshall Space Flight Center has developed a facility in which closed loop control of Large Space Structures (LSS) can be demonstrated and verified. The main objective of the facility is to verify LSS control system techniques so that on-orbit performance can be ensured. The facility consists of an LSS test article or payload which is connected to a 3-axis angular pointing mount assembly that provides control torque commands. The angular pointing mount assembly is attached to a base excitation system which will simulate disturbances most likely to occur for Orbiter and DOD payloads. The control computer contains the calibration software, the reference systems, the alignment procedures, the telemetry software, and the control algorithms. The total system is suspended in such a fashion that the LSS test article has the characteristics common to all LSS.

Waites, Henry↗

Contributions of Spherical Harmonics to Magnetic and Gravitational Fields

Gravitational forces are of cardinal importance in the dynamics of spacecraft; magnetic attractions sometime play a significant role also, as was the case with the Long Duration Exposure Facility, and as is now true for the first segment of Space Station Freedom. Both satellites depend on gravitational moment and a device known as a magnetic damper to stabilize their orientation. Magnetic fields are mathematically similar to gravitational fields in one important respect: each can be regarded as a gradient of a potential function that, in turn, can be described as an infinite series of spherical harmonics. Consequently, the two fields can be computed, in part, with quantities that need only be evaluated once, resulting in a savings of time when both fields are needed. The objective of this material is to present magnetic field and gravitational force expressions, and point out the terms that belong to both this is accomplished in Section 1 and 2. Section 3 contains the deductive reasoning with which one obtains the expressions of interest. Finally, examples in Section 4 show these equations can be used to reproduce others that arise in connection with special cases such as the magnetic field produced by a tilted dipole, and gravitational force exerted by an oblate spheroid. The mathematics are discussed in the context of terrestrial fields; however, by substituting appropriate constants, the results can be made applicable to fields belonging to other celestial bodies. The expressions presented here share the characteristics of algorithms set forth for computing gravitational force. In particular, computation is performed speedily by means of recursion formulae, and the expressions do not suffer from the shortcoming of a singularity when evaluated at points that lie on the polar axis.

Roithmayr, Carlos M.↗

Image Segmentation Analysis for NASA Earth Science Applications

NASA collects large volumes of imagery data from satellite-based Earth remote sensing sensors. Nearly all of the computerized image analysis of this data is performed pixel-by-pixel, in which an algorithm is applied directly to individual image pixels. While this analysis approach is satisfactory in many cases, it is usually not fully effective in extracting the full information content from the high spatial resolution image data that s now becoming increasingly available from these sensors. The field of object-based image analysis (OBIA) has arisen in recent years to address the need to move beyond pixel-based analysis. The Recursive Hierarchical Segmentation (RHSEG) software developed by the author is being used to facilitate moving from pixel-based image analysis to OBIA. The key unique aspect of RHSEG is that it tightly intertwines region growing segmentation, which produces spatially connected region objects, with region object classification, which groups sets of region objects together into region classes. No other practical, operational image segmentation approach has this tight integration of region growing object finding with region classification This integration is made possible by the recursive, divide-and-conquer implementation utilized by RHSEG, in which the input image data is recursively subdivided until the image data sections are small enough to successfully mitigat the combinatorial explosion caused by the need to compute the dissimilarity between each pair of image pixels. RHSEG's tight integration of region growing object finding and region classification is what enables the high spatial fidelity of the image segmentations produced by RHSEG. This presentation will provide an overview of the RHSEG algorithm and describe how it is currently being used to support OBIA or Earth Science applications such as snow/ice mapping and finding archaeological sites from remotely sensed data.

Tilton, James C.↗

Two Methods for Efficient Solution of the Hitting-Set Problem

A paper addresses much of the same subject matter as that of Fast Algorithms for Model-Based Diagnosis (NPO-30582), which appears elsewhere in this issue of NASA Tech Briefs. However, in the paper, the emphasis is more on the hitting-set problem (also known as the transversal problem), which is well known among experts in combinatorics. The authors primary interest in the hitting-set problem lies in its connection to the diagnosis problem: it is a theorem of model-based diagnosis that in the set-theory representation of the components of a system, the minimal diagnoses of a system are the minimal hitting sets of the system. In the paper, the hitting-set problem (and, hence, the diagnosis problem) is translated from a combinatorial to a computational problem by mapping it onto the Boolean satisfiability and integer- programming problems. The paper goes on to describe developments nearly identical to those summarized in the cited companion NASA Tech Briefs article, including the utilization of Boolean-satisfiability and integer- programming techniques to reduce the computation time and/or memory needed to solve the hitting-set problem.

Vatan, Farrokh↗

Empirical modeling for intelligent, real-time manufacture control

Artificial neural systems (ANS), also known as neural networks, are an attempt to develop computer systems that emulate the neural reasoning behavior of biological neural systems (e.g. the human brain). As such, they are loosely based on biological neural networks. The ANS consists of a series of nodes (neurons) and weighted connections (axons) that, when presented with a specific input pattern, can associate specific output patterns. It is essentially a highly complex, nonlinear, mathematical relationship or transform. These constructs have two significant properties that have proven useful to the authors in signal processing and process modeling: noise tolerance and complex pattern recognition. Specifically, the authors have developed a new network learning algorithm that has resulted in the successful application of ANS's to high speed signal processing and to developing models of highly complex processes. Two of the applications, the Weld Bead Geometry Control System and the Welding Penetration Monitoring System, are discussed in the body of this paper.

Xu, Xiaoshu↗

The Latitudinal Excursion of Coronal Magnetic Field Lines in Response to Differential Rotation: MHD Simulations

Solar energetic particles, which are believed to originate from corotating interacting regions (CIRS) at low heliographic latitude, were observed by the Ulysses spacecraft even as it passed over the Sun's poles. One interpretation of this result is that high-latitude field lines intercepted by Ulysses connect to low-latitude CIRs at much larger heliocentric distances. The Fisk model explains the latitudinal excursion of magnetic field lines in the solar corona and heliosphere as the inevitable consequence of the interaction of a tilted dipole in a differentially rotating photosphere with rigidly rotating coronal holes. We use a time-dependent three-dimensional magnetohydrodynamic (MHD) algorithm to follow the evolution of a simple model of the solar corona in response to the differential rotation of the photospheric magnetic flux. We examine the changes of the coronal-hole boundaries, the redistribution of the line-of-sight magnetic field, and the precession of field lines in the corona. Our results confirm the basic idea of the Fisk model, that differential rotation leads to changes in the heliographic latitude of magnetic field lines. However, the latitudinal excursion of magnetic field lines in this simple "tilted dipole" model is too small to explain the Ulysses observations. Although coronal holes in our model rotate more rigidly than do photospheric features (in general agreement with observations), they do not rotate strictly rigidly as assumed by Fisk. This basic difference between our model and Fisk's will be explored in the future by considering more realistic magnetic flux distributions, as observed during Ulysses polar excursions.

Lionello, Roberto↗

An improved far field drag calculation method for nonlinear CFD codes

An improved method to calculate drag based on far field conditions is presented and demonstrated. The method is illustrated using two CFD codes, PARC and CFL3D, and examining their ability to preserve lift and drag coefficients along grid line defined integration paths. The flow fields were generated by solving the Euler equations for a NACA 0012 airfoil at a free stream Mach number of 0.8 and angle of attack of 1.25 degrees. In comparison to force coefficients obtained by surface pressure integration, neither code acceptably preserved both force coefficients throughout the near and far fields. An investigation into the relationship between numerical prediction error and calculated force coefficients revealed a direct connection between solution mass conservation error and force coefficients error. A method to correct the predicted force coefficients based on integrated mass conservation error is described and demonstrated. The corrected force coefficients for both codes are shown to be more accurate than the uncorrected values. The correction method is applicable to both two and three dimensions and is independent of the algorithm used to generate the flow field.

Sirbaugh, James R.↗

Sensor arrays for detecting microorganisms

A sensor array for detecting a microorganism comprising first and second sensors electrically connected to an electrical measuring apparatus, wherein the sensors comprise a region of nonconducting organic material and a region of conducting material compositionally that is different than the nonconducting organic material and an electrical path through the regions of nonconducting organic material and the conducting material. A system for identifying microorganisms using the sensor array, a computer and a pattern recognition algorithm, such as a neural net are also disclosed.

Lewis, Nathan S.↗

Development of Constraint Force Equation Methodology for Application to Multi-Body Dynamics Including Launch Vehicle Stage Seperation

The objective of this report is to develop and implement a physics based method for analysis and simulation of multi-body dynamics including launch vehicle stage separation. The constraint force equation (CFE) methodology discussed in this report provides such a framework for modeling constraint forces and moments acting at joints when the vehicles are still connected. Several stand-alone test cases involving various types of joints were developed to validate the CFE methodology. The results were compared with ADAMS(Registered Trademark) and Autolev, two different industry standard benchmark codes for multi-body dynamic analysis and simulations. However, these two codes are not designed for aerospace flight trajectory simulations. After this validation exercise, the CFE algorithm was implemented in Program to Optimize Simulated Trajectories II (POST2) to provide a capability to simulate end-to-end trajectories of launch vehicles including stage separation. The POST2/CFE methodology was applied to the STS-1 Space Shuttle solid rocket booster (SRB) separation and Hyper-X Research Vehicle (HXRV) separation from the Pegasus booster as a further test and validation for its application to launch vehicle stage separation problems. Finally, to demonstrate end-to-end simulation capability, POST2/CFE was applied to the ascent, orbit insertion, and booster return of a reusable two-stage-to-orbit (TSTO) vehicle concept. With these validation exercises, POST2/CFE software can be used for performing conceptual level end-to-end simulations, including launch vehicle stage separation, for problems similar to those discussed in this report.

Pamadi, Bandu N.↗

Photon Counting Using Edge-Detection Algorithm

New applications such as high-datarate, photon-starved, free-space optical communications require photon counting at flux rates into gigaphoton-per-second regimes coupled with subnanosecond timing accuracy. Current single-photon detectors that are capable of handling such operating conditions are designed in an array format and produce output pulses that span multiple sample times. In order to discern one pulse from another and not to overcount the number of incoming photons, a detection algorithm must be applied to the sampled detector output pulses. As flux rates increase, the ability to implement such a detection algorithm becomes difficult within a digital processor that may reside within a field-programmable gate array (FPGA). Systems have been developed and implemented to both characterize gigahertz bandwidth single-photon detectors, as well as process photon count signals at rates into gigaphotons per second in order to implement communications links at SCPPM (serial concatenated pulse position modulation) encoded data rates exceeding 100 megabits per second with efficiencies greater than two bits per detected photon. A hardware edge-detection algorithm and corresponding signal combining and deserialization hardware were developed to meet these requirements at sample rates up to 10 GHz. The photon discriminator deserializer hardware board accepts four inputs, which allows for the ability to take inputs from a quadphoton counting detector, to support requirements for optical tracking with a reduced number of hardware components. The four inputs are hardware leading-edge detected independently. After leading-edge detection, the resultant samples are ORed together prior to deserialization. The deserialization is performed to reduce the rate at which data is passed to a digital signal processor, perhaps residing within an FPGA. The hardware implements four separate analog inputs that are connected through RF connectors. Each analog input is fed to a high-speed 1-bit comparator, which digitizes the input referenced to an adjustable threshold value. This results in four independent serial sample streams of binary 1s and 0s, which are ORed together at rates up to 10 GHz. This single serial stream is then deserialized by a factor of 16 to create 16 signal lines at a rate of 622.5 MHz or lower for input to a high-speed digital processor assembly. The new design and corresponding hardware can be employed with a quad-photon counting detector capable of handling photon rates on the order of multi-gigaphotons per second, whereas prior art was only capable of handling a single input at 1/4 the flux rate. Additionally, the hardware edge-detection algorithm has provided the ability to process 3-10 higher photon flux rates than previously possible by removing the limitation that photoncounting detector output pulses on multiple channels being ORed not overlap. Now, only the leading edges of the pulses are required to not overlap. This new photon counting digitizer hardware architecture supports a universal front end for an optical communications receiver operating at data rates from kilobits to over one gigabit per second to meet increased mission data volume requirements.

Gin, Jonathan W.↗

Recursive mass matrix factorization and inversion: An operator approach to open- and closed-chain multibody dynamics

This report advances a linear operator approach for analyzing the dynamics of systems of joint-connected rigid bodies.It is established that the mass matrix M for such a system can be factored as M=(I+H phi L)D(I+H phi L) sup T. This yields an immediate inversion M sup -1=(I-H psi L) sup T D sup -1 (I-H psi L), where H and phi are given by known link geometric parameters, and L, psi and D are obtained recursively by a spatial discrete-step Kalman filter and by the corresponding Riccati equation associated with this filter. The factors (I+H phi L) and (I-H psi L) are lower triangular matrices which are inverses of each other, and D is a diagonal matrix. This factorization and inversion of the mass matrix leads to recursive algortihms for forward dynamics based on spatially recursive filtering and smoothing. The primary motivation for advancing the operator approach is to provide a better means to formulate, analyze and understand spatial recursions in multibody dynamics. This is achieved because the linear operator notation allows manipulation of the equations of motion using a very high-level analytical framework (a spatial operator algebra) that is easy to understand and use. Detailed lower-level recursive algorithms can readily be obtained for inspection from the expressions involving spatial operators. The report consists of two main sections. In Part 1, the problem of serial chain manipulators is analyzed and solved. Extensions to a closed-chain system formed by multiple manipulators moving a common task object are contained in Part 2. To retain ease of exposition in the report, only these two types of multibody systems are considered. However, the same methods can be easily applied to arbitrary multibody systems formed by a collection of joint-connected regid bodies.

Rodriguez, G.↗

Locating buildings in aerial photos

Algorithms and techniques for use in the identification and location of large buildings in digitized copies of aerial photographs are developed and tested. The building data would be used in the simulation of objects located in the vicinity of an airport that may be detected by aircraft radar. Two distinct approaches are considered. Most building footprints are rectangular in form. The first approach studied is to search for right-angled corners that characterize rectangular objects and then to connect these corners to complete the building. This problem is difficult because many nonbuilding objects, such as street corners, parking lots, and ballparks often have well defined corners which are often difficult to distinguish from rooftops. Furthermore, rooftops come in a number of shapes, sizes, shadings, and textures which also limit the discrimination task. The strategy used linear sequences of different samples to detect straight edge segments at multiple angles and to determine when these segments meet at approximately right-angles with respect to each other. This technique is effective in locating corners. The test image used has a fairly rectangular block pattern oriented about thirty degrees clockwise from a vertical alignment, and the overall measurement data reflect this. However, this technique does not discriminate between buildings and other objects at an operationally suitable rate. In addition, since multiple paths are tested for each image pixel, this is a time consuming task. The process can be speeded up by preprocessing the image to locate the more optimal sampling paths. The second approach is to rely on a human operator to identify and select the building objects and then to have the computer determine the outline and location of the selected structures. When presented with a copy of a digitized aerial photograph, the operator uses a mouse and cursor to select a target building. After a button on the mouse is pressed, with the cursor fully within the perimeter of the building, the program scans from the position of the cursor to a perimeter position where a shift in grayscale is detected. Once at the perimeter, the process traces along it, around the building, until it eventually returns to the perimeter starting point. Spatial resolution limits cause the perimeter trace to be somewhat course so that a line straightening algorithm is employed. One result is that the building corner positions become more distinctly defined.

Green, James S.↗

Dynamic Shared Computing Resources for Multi-Robot Mars Exploration

The NASA roadmap for 2020 and beyond includes several key technologies which will have a game-changing impact on planetary exploration. The first of these is High Performance Spaceflight Computing (HPSC), which will provide orders of magnitude increases in processing power for next-generation rovers and orbiters (Doyle et al. 2013). The second is Delay Tolerant Networking, which overlays the Deep Space Network, providing internet-like abstractions and store-forward to route data through intermittent delays in connectivity. The third is a trend toward small, co-dependent robots included in flagship missions (MarCO, PUFFER, and Mars Heli). Taken together, these imply an increasing amount of communication and computing heterogeneity on Mars in coming decades. Motivated by these technological trends, we study the concept of Mars on-site shared analysis, information, and communication (MOSAIC) for Mars exploration. The key algorithmic problem associated with MOSAIC networks is simultaneous scheduling of computation, communication, and caching of data, which we illustrate using the three scenarios. We present models, preliminary solutions, and simulation results for two scenarios, showing how mission efficiency relates to communication bandwidth, processing power, geography of the environment, and optimal scheduling of computation, communication, and data caching. The third scenario illustrates future directions of this work.

Chien, Steve↗