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.

SourceResearch connectionFrom yearThrough year

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

At least 523 records · Page 29

All sources NASA NTRS DOE OSTI

NASA NTRS1990

Efficient parametric analysis of performance measures for communication networks

Efficient techniques for estimating performance measures in communication networks in a steady-state or transient setting are developed. These techniques may be used in a simulation environment or in connection with real-time observations. For Markov chain models, the recently proposed standard clock approach is extended, and a class of real-time algorithms for simultaneously generating multiple sample paths under different parameter sets is presented. Attention is focused on the link crash time estimation problem, where a 'crash' is defined as the first time a buffer overflows, given some initial conditions. An algorithm for estimating crash times under various traffic shocks is derived, where all estimates are obtained in parallel to an actual network's normal operation. An algorithm for crash time estimation of a G/D/1 link model is also derived using a different (perturbation-analysis-based) approach. Finally, extensive simulation results are provided to validate the proposed algorithms and compare them to brute-force simulation.

Cassandras, Christos G.↗

NASA NTRS1991

Optimal discrete-time dynamic output-feedback design - A w-domain approach

An alternative method for optimal digital control design is described in this paper. The method is based on the usage of the w-transform and has many attractive design features. One of these is its immediate connection with frequency loop-shaping techniques that are now popular and effective for multivariable control synthesis in continuous-time domain. Furthermore, any design algorithms originally developed for continuous-time systems can now be immediately extended to the discrete-time domain. The main results presented in this paper are the exact problem formulation and solution of an optimal discrete-time dynamic output-feedback design in the w-domain involving a quadratic performance index to random disturbances. In addition, necessary conditions for optimality are obtained for the numerical solution of the optimal output-feedback compensator design. A numerical example is presented illustrating its application to the design of a low-order dynamic compensator in a stability augmentation system of a commercial transport.

Ha, Cheolkeun↗

NASA NTRS2005

Adapting End Host Congestion Control for Mobility

Network layer mobility allows transport protocols to maintain connection state, despite changes in a node's physical location and point of network connectivity. However, some congestion-controlled transport protocols are not designed to deal with these rapid and potentially significant path changes. In this paper we demonstrate several distinct problems that mobility-induced path changes can create for TCP performance. Our premise is that mobility events indicate path changes that require re-initialization of congestion control state at both connection end points. We present the application of this idea to TCP in the form of a simple solution (the Lightweight Mobility Detection and Response algorithm, that has been proposed in the IETF), and examine its effectiveness. In general, we find that the deficiencies presented are both relatively easily and painlessly fixed using this solution. We also find that this solution has the counter-intuitive property of being both more friendly to competing traffic, and simultaneously more aggressive in utilizing newly available capacity than unmodified TCP.

Eddy, Wesley M.↗

NASA NTRS1991

Method and apparatus for eliminating unsuccessful tries in a search tree

A circuit switching system in an M-ary, n-cube connected network completes a best-first path from an originating node to a destination node by latching valid legs of the path as the path is being sought out. Each network node is provided with a routing hyperswitch sub-network, (HSN) connected between that node and bidirectional high capacity communication channels of the n-cube network. The sub-networks are all controlled by routing algorithms which respond to message identification headings (headers) on messages to be routed along one or more routing legs. The header includes information embedded therein which is interpreted by each sub-network to route and historically update the header. A logic circuit, available at every node, implements the algorithm and automatically forwards or back-tracks the header in the network legs of various paths until a completed path is latched.

Peterson, John C.↗

NASA NTRS2023

On Hermite Interpolation using Bernstein Polynomials for Trajectory Generation

This work presents a solution to the two-point Hermite interpolation problem using Bernstein polynomials. The Hermite interpolation problem is of particular interest in aerospace applications where boundary conditions for trajectories often specify derivative constraints. In the examples shown, a trajectory will be generated between an initial condition and a final condition. For example, a trajectory is generated that connects an aircraft’s current position and velocity with a point on the runway at a desired landing velocity. The numerical stability of the proposed algorithms is analyzed empirically.

Bezier curves↗

NASA NTRS1993

Radio jets in colliding galaxies: Testing the interaction-activity connection

The idea that galaxy interactions and merging are related to the generation of starburst and AGN activity in galactic nuclei has been the subject of intensive investigations over the past several years and is still a matter of lively debate. Peculiar morphologies, indicative of tidal interactions, have been detected in high-luminosity radio galaxies, in quasars, and in ultraluminous IRAS galaxies. In addition, low-luminosity radio and active galaxies show similar evidence for a recent merger or for nearby companions. In a recent CCD optical study of galaxies selected on the basis that they all contain well defined radio jets, it was found that almost half of the sample consists of pairs of elliptical galaxies. Many of these low-luminosity radio galaxies with companions show a well defined distorted radio jet structure at the VLA scale with an S- or C-shaped morphology. We have developed a general numerical simulation algorithm for ballistic radio jets with the intention of applying this model to the study of the bent jets seen in colliding pairs of galaxies and with the hope of testing the well documented interaction-activity connection. In our model the morphological evolution of the jets is determined by their response to the simple mechanical forces (i.e., gravity and ram pressure) imposed on them from both the host and the companion galaxies. Radiative losses, jet precession, magnetic effects, relativistic terms, and hydrodynamic instabilities have all been ignored. Starting with a previously derived collision model for the interacting pair of elliptical galaxies NGC 4782/4783, we have used our algorithm to simulate the specific two-sided jet morphology seen in the radio source 3C 278, associated with NGC 4782. This is the first time that such jet simulations have been produced for a galaxy pair whose relative orbit was determined independently from the jet modeling.

Borne, Kirk D.↗

NASA NTRS1989

A vectorized algorithm for 3D dynamics of a tethered satellite

Equations of motion characterizing the three dimensional motion of a tethered satellite during the retrieval phase are studied. The mathematical model involves an arbitrary number of point masses connected by weightless cords. Motion occurs in a gravity gradient field. The formulation presented accounts for general functions describing support point motion, rate of tether retrieval, and arbitrary forces applied to the point masses. The matrix oriented program language MATLAB is used to produce an efficient vectorized formulation for computing natural frequencies and mode shapes for small oscillations about the static equilibrium configuration; and for integrating the nonlinear differential equations governing large amplitude motions. An example of time response pertaining to the skip rope effect is investigated.

Wilson, Howard B.↗

DOE OSTI2021

Impact of graph structures for QAOA on MaxCut

The quantum approximate optimization algorithm (QAOA) is a promising method of solving combinatorial optimization problems using quantum computing. QAOA on the MaxCut problem has been studied extensively on graphs with specific structure; however, little is known about the general performance of the algorithm on arbitrary graphs. Here, we investigate how different graph characteristics correlate with QAOA performance at depths at most three on the MaxCut problem for all connected non-isomorphic graphs with at most eight vertices. Some good predictors of QAOA success relate to graph symmetries, odd cycles, and density. For example, on eight vertex graphs, the average probability for selecting an optimal solution for graphs that contain no odd cycles after three iterations of QAOA is 60.6% compared to 48.2% for those that do. The data generated from these studies are shared in a publicly accessible database to serve as a benchmark for QAOA calculations and experiments. Knowing the relationship between structure and performance can be used to identify classes of combinatorial problems that are likely to exhibit a quantum advantage.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Shared automated vehicle fleet operations for first-mile last-mile transit connections with dynamic pooling

Shared automated vehicles (SAVs) have the potential to promote transit ridership by providing efficient first-mile last-mile (FMLM) connections through reduced operational costs to fleet providers and lower out-of-pocket costs to riders. To help plan for a future of integrated mobility, this paper investigates the impacts of SAVs serving FMLM connections, as a mode that provides flexibility in access/egress decisions and is well coordinated with train station schedules. To achieve this objective, a novel dynamic pooling algorithm was introduced to match SAVs with riders while coordinating the riders' arrival times at the light-rail station to a known train schedule. Microsimulations of SAVs and travelers throughout two central Austin neighborhoods show how larger service areas, higher levels of SAV demand, and longer arrival times between successive trains require larger SAV fleet sizes and higher SAV utilization rates to deliver close traveler wait times. Four-person SAVs appear to perform similar to 6-seat SAVs but will cost less to provide. Using a dynamic pooling algorithm tightly coordinated with train arrivals (every 15 min) delivers 87% of travelers to their stations in time to catch the next train, whereas uncoordinated assignments deliver just 58% of travelers in time.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2021

Multilevel Training of Neural Networks

MTNN is a software library for applying multilevel algorithms on training neural networks. Based on PyTorch, it is designed to be an extensible framework to enable researchers to implement multilevel training algorithms on a variety of neural network models. This release includes a culmination of preliminary work in applying the multilevel Full Approximation Scheme technique on fully connected and convolutional neural networks to solve PDE problems (pending publication submission).

Li, Ruipeng↗

DOE OSTI2022

Symmetry relation database and its application to ferroelectric materials discovery

To investigate the displacive phase transition at the atomic scale, we have implemented a numerical algorithm to automate the detection of the symmetry relations between any two candidate crystal structures. Using this algorithm, here we systematically screen all possible polar–nonpolar structure pairs from the Materials Project database and establish a library of ~4500 pairs that can be connected through a continuous phase transition with small atomic displacements. From this database, we identify several new ferroelectric materials. In addition, the database may also be used in other areas, such as material structure prediction and new materials discovery.

36 MATERIALS SCIENCE↗

NASA NTRS1979

Multispectral imaging and analysis system

Arrays of charge coupled devices or linear detector arrays simultaneously obtain spectral reflectance data of different wavelengths for a target area. Several accommodating a particular bandwidth, are individually associated with each array. Data from the arrays are read out in parallel and applied to a computer or microprocessor for processing. The microprocessor serves to analyze the data in real time and if possible, in accordance with hard-wired algorithms. The data are then displayed as an image on an appropriate display unit and also recorded for further use. The display system may be operationally connected to receive a terrain image such that the target area and the analyzed spectral reflectance data are superimposed and simultaneously displayed.

Goetz, A. F. H.↗

NASA NTRS1989

Failure detection and identification

Using the geometric concept of an unobservability subspace, a solution is given to the problem of detecting and identifying control system component failures in linear, time-invariant systems. Conditions are developed for the existence of a causal, linear, time-invariant processor that can detect and uniquely identify a component failure, first for the case where components can fail simultaneously, and then for the case where they fail only one at a time. Explicit design algorithms are provided when these conditions are satisfied. In addition to time-domain solvability conditions, frequency-domain interpretations of the results are given, and connections are drawn with results already available in the literature.

Massoumnia, Mohammad-Ali↗

NASA NTRS1989

Two-time scale stabilization of a flexible arm with output feedback

An approach is presented to designing a control system with output feedback for a lightweight flexible arm. A two-time-scale dynamic model is obtained which allows the adoption of a composite control strategy. First a slow control can be designed for the slow (rigid) subsystem, and then a fast stabilizing control for the fast (flexible) subsystem. The problem of the lack of full state measurements connected with the fast control design is solved. An output-feedback, low-order dynamic compensator whose optimal gains are computed by a convergent numerical algorithm is designed. A more robust design can be achieved if a loop transfer recovery procedure is introduced. The design procedure is tested by means of nonlinear simulation, and the results are discussed.

Siciliano, Bruno↗

NASA NTRSDate not supplied

Wildfire monitoring using Unmanned Aerial Vehicles operating under UTM (STEReO)

STEReO (Scalable Traffic Management for Emergency Response Operations) project at NASA Ames is designed to provide UTM (UAS Traffic Management) services to unmanned aerial vehicles (UAVs) used for natural disaster response scenarios like wildfire and hurricanes. This will facilitate the use of unmanned aerial vehicles in regions where UAVs are currently prohibited to fly. In this paper we describe a complete architecture of using UAVs for wild fire monitoring in this STEReO environment. We simulate a complete fire monitoring scenario in an high fidelity simulation environment. The simulation consists of a fire drill in the vicinity of Redding airport, one of the test sites for CAL-FIRE. The autonomous vehicle connects to the STEReO systems and gathers information of other operation in the vicinity. The vehicle then uses on-board path planners and decision making algorithms for fire monitoring and mapping. In this paper the vehicle on-board architecture is described in details and the requirements to fly and interact with the STEReO system is discussed.

UAV UTM↗

NASA NTRSDate not supplied

Quantum-Accelerated Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

We present two algorithms in the Quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact spanning arborescence of minimum weight, the analog of a Minimum Spanning Tree in a directed graph, each of which uses O~(n^(1/4)) rounds of communication and O~(n^(9/4)) messages, achieving a lower round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. The CONGEST distributed computational model allows limited-sized messages to be transmitted within a network described by a communication graph of size n in a series of rounds to address a computational problem. The size limitation for such messages isO(log(n)) bits at each edge of the communication graph per round. The communication graph in the CONGEST-CLIQUE model is fully connected. In the Quantum CONGEST-CLIQUE model, at most O(log(n)) classical and quantum bits (qubits) can be communicated across each edge of the communication graph per round. At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. These speedups further contribute to understanding what problems can be solved more efficiently when we allow quantum communication in this CONGEST-CLIQUE model of distributed computation.

quantum distributed algorithms↗

DOE OSTI2025

Unsupervised Image-Based Classification of Corrosion Severity in Automobile Engine Connecting Rods

Corrosion in engine connecting rods is a critical issue in the automotive industry, potentially leading to catastrophic engine failure, monetary losses, and safety hazards. The labor shortage in the industry further emphasizes the need for fast, accurate, and automated corrosion detection methods to ensure appropriate surface treatments can be applied to restore component integrity. We present an unsupervised image-based framework for classifying corrosion severity in automobile engine connecting rods using short-wave infrared (SWIR) and telecentric grayscale imaging. We employ the structural similarity index measure (SSIM) as a dissimilarity metric and the k-medians clustering algorithm for classification. Our algorithm achieves an overall accuracy of 80.64% for SWIR images, with 100% accuracy in classifying highly corroded samples. For grayscale images, the method attains an overall accuracy of 77.42%, with 90.91% accuracy for highly corroded samples. The method’s ability to work with different imaging modalities and its high accuracy in identifying severe corrosion cases make it a promising tool for automated corrosion assessment in the automotive industry, potentially improving efficiency and safety in engine component maintenance.

42 ENGINEERING↗

DOE OSTI2024

Fault-tolerant grid frequency measurement algorithm during transients

A system determines the frequency of grid signals corresponding to an electrical grid in real time. The system includes a transient detector that monitors a grid signal from a voltage meter or a current meter connected to the electrical grid. The system produces, in real time and at a sampling rate, a deviation signal indicative of a periodicity of the monitored grid signal. The system determines, over one or more cycles of the monitored grid signal, a measurement signal corresponding to the deviation signal. The system determines a frequency signal that corresponds a frequency estimation of the monitored signal by applying a frequency estimation when values of the measurement signal are less than a deviation threshold and maintaining the frequency signal at a constant value when values of the measured signal equal or exceeds the deviation threshold.

Zhan, Lingwei↗