Search NASA⌕ Search

SEARCH · Search NASA

Results for “binary network”

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 127 records · Page 7

GW190814: Gravitational Waves from the Coalescence of a 23 Solar Mass Black Hole with a 2.6 Solar Mass Compact Object

We report the observation of a compact binary coalescence involving a 22.2–24.3 Me black hole and a compact object with a mass of 2.50–2.67Me (all measurements quoted at the 90% credible level). The gravitational-wavesignal, GW190814, was observed during LIGO’s and Virgo’s third observing run on 2019 August 14 at 21:10:39 UTC and has a signal-to-noise ratio of 25 in the three-detector network. The source was localized to18.5 deg2 at a distance of-+2414541Mpc; no electromagnetic counterpart has been confirmed to date. The source has the most unequal mass ratio yet measured with gravitational waves,-+0.1120.0090.008, and its secondary component is either the lightest black hole or the heaviest neutron star ever discovered in a double compact-object system. The dimensionless spin of the primary black hole is tightly constrained to 0.07. Tests of general relativity reveal no measurable deviations from the theory, and its prediction of higher-multipole emission is confirmed at high confidence. We estimate a merger rate density of 1–23 Gpc−3yr−1 for the new class of binary coalescence sources that GW190814 represents. Astrophysical models predict that binaries with mass ratios similar to this event can form through several channels, but are unlikely to have formed in globular clusters. However, the combination of mass ratio, component masses, and the inferred merger rate for this event challenges all current models of the formation and mass distribution of compact-object binaries.

Gravitational wave astronomy↗

Bit Error Rate and Frame Error Rate Data Processing for Space Communications and Navigation-Related Communication System Analysis Tools

One of the capabilities that the Space Communications and Navigation (SCaN) Strategic Center for Networking, Integration, and Communications (SCENIC) user interface (UI) web application intends to provide its users is the addition of network protocol and link encryption augmentations of communication system analyses. Before any of these analyses capabilities can be modeled, the simulations of bit error rate (BER) and frame error rate (FER) against signal-to-noise ratio (SNR) have been conducted, requiring parameters from several known coding types (low-density parity-check (LDPC), convolutional, etc.), signal modulations (binary phase shift keying (BPSK), quadrature phase shift keying (QPSK), etc.), coding rates (1/2, 1/3, etc.), and frame sizes (1,280, 3,580, etc.). However, in order to extract useful information from the results of these simulations, a curve fitting technique has been applied to each resulting dataset to extend and extrapolate the curve fit of BER and FER down to 10–30 using MATLAB® Curve Fitting Toolbox™ (The MathWorks, Inc.). This is a necessary step because simulations of BER and FER were only performed to around 10–9 due to the extensive simulation time that would be required to obtain significant simulation results at the error levels desired. Furthermore, the fitted curve results were applied to a finer resolution for the SNR at 0.01-dB interval instead of the 0.05-dB interval limitation used in the simulation. All the possible combinations of the coding types, signal modulations, coding rates, frame sizes, and the extension of BER and FER curves would enable users to capture a wide range of link performances that directly relates to the addition of higher level networking data encapsulated in a frame. The curve fitting results also led to the modeling of the optical link error rate performance by solving for coding gain, FER_BER SNR delta, coded optical BER-SNR, and coded optical FER–SNR.

Communication link analysis↗

Binary Correlator for Electromagnetic Signal Patterns

Modulation patterns recognized with extensive calculations. Set of shift registers contains patterns of 1's and 0's representing presence or absence of received signal in designated time/frequency bins. Pattern in shift registers correlated with pattern of expected signal by shifting each cell to right according to expected pattern and summing shift-register outputs in analog summing network. Useful in applications requiring identification of smaller pattern of 1-bit data within larger matrix of such data.

Garrison, J. B.↗

High-Rate Digital Receiver Board

A high-rate digital receiver (HRDR) implemented as a peripheral component interface (PCI) board has been developed as a prototype of compact, general-purpose, inexpensive, potentially mass-producible data-acquisition interfaces between telemetry systems and personal computers. The installation of this board in a personal computer together with an analog preprocessor enables the computer to function as a versatile, highrate telemetry-data-acquisition and demodulator system. The prototype HRDR PCI board can handle data at rates as high as 600 megabits per second, in a variety of telemetry formats, transmitted by diverse phase-modulation schemes that include binary phase-shift keying and various forms of quadrature phaseshift keying. Costing less than $25,000 (as of year 2003), the prototype HRDR PCI board supplants multiple racks of older equipment that, when new, cost over $500,000. Just as the development of standard network-interface chips has contributed to the proliferation of networked computers, it is anticipated that the development of standard chips based on the HRDR could contribute to reductions in size and cost and increases in performance of telemetry systems.

Ghuman, Parminder↗

Feedforward, high density, programmable read only neural network based memory system

Neural network-inspired, nonvolatile, programmable associative memory using thin-film technology is demonstrated. The details of the architecture, which uses programmable resistive connection matrices in synaptic arrays and current summing and thresholding amplifiers as neurons, are described. Several synapse configurations for a high-density array of a binary connection matrix are also described. Test circuits are evaluated for operational feasibility and to demonstrate the speed of the read operation. The results are discussed to highlight the potential for a read data rate exceeding 10 megabits/sec.

Daud, Taher↗

Exploring Network-Related Optimization Problems Using Quantum Heuristics

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Wang, Zhihui↗

Study network-related optimization problems using quantum alternating optimization ansatz

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics. One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Zhihui Wang↗

Search for Gravitational Waves Associated with Gamma-Ray Bursts Detected by the Interplanetary Network

We present the results of a search for gravitational waves associated with 223 gamma ray bursts (GRBs) detected by the InterPlanetary Network (IPN) in 2005-2010 during LIGO's fifth and sixth science runs and Virgo's first, second, and third science runs. The IPN satellites provide accurate times of the bursts and sky localizations that vary significantly from degree scale to hundreds of square degrees. We search for both a well-modeled binary coalescence signal, the favored progenitor model for short GRBs, and for generic, unmodeled gravitational wave bursts. Both searches use the event time and sky localization to improve the gravitational wave search sensitivity as compared to corresponding all-time, all-sky searches. We find no evidence of a gravitational wave signal associated with any of the IPN GRBs in the sample, nor do we find evidence for a population of weak gravitational wave signals associated with the GRBs. For all IPN-detected GRBs, for which a sufficient duration of quality gravitational wave data are available, we place lower bounds on the distance to the source in accordance with an optimistic assumption of gravitational wave emission energy of 10(exp−2) solar mass c(exp 2) at 150 Hz, and find a median of 13 Mpc. For the 27 short-hard GRBs we place 90% confidence exclusion distances to two source models: a binary neutron star coalescence, with a median distance of 12 Mpc, or the coalescence of a neutron star and black hole, with a median distance of 22 Mpc. Finally, we combine this search with previously published results to provide a population statement for GRB searches in first-generation LIGO and Virgo gravitational wave detectors and a resulting examination of prospects for the advanced gravitational wave detectors.

gravitational wave detectors↗

Development of a width-modulated pulse rebalance electronics loop for strapdown gyroscopes

A new width modulated pulse rebalance electronics loop was developed for use with strapdown gyroscopes. Advantages of the width modulated binary over the ternary loop are the following: (1) The H-switch is easier to implement; (2) torque is applied in finely quantized increments; (3) the analog-to-digital conversion for data generation is inside the loop and is directly determined by the torque pulse; (4) on part of the loop compensation network bypasses the gyroscope; and (5) the torquer is fed constant power.

Blalock, T. V.↗

Robust Strategy for Rocket Engine Health Monitoring

Monitoring the health of rocket engine systems is essentially a two-phase process. The acquisition phase involves sensing physical conditions at selected locations, converting physical inputs to electrical signals, conditioning the signals as appropriate to establish scale or filter interference, and recording results in a form that is easy to interpret. The inference phase involves analysis of results from the acquisition phase, comparison of analysis results to established health measures, and assessment of health indications. A variety of analytical tools may be employed in the inference phase of health monitoring. These tools can be separated into three broad categories: statistical, rule based, and model based. Statistical methods can provide excellent comparative measures of engine operating health. They require well-characterized data from an ensemble of "typical" engines, or "golden" data from a specific test assumed to define the operating norm in order to establish reliable comparative measures. Statistical methods are generally suitable for real-time health monitoring because they do not deal with the physical complexities of engine operation. The utility of statistical methods in rocket engine health monitoring is hindered by practical limits on the quantity and quality of available data. This is due to the difficulty and high cost of data acquisition, the limited number of available test engines, and the problem of simulating flight conditions in ground test facilities. In addition, statistical methods incur a penalty for disregarding flow complexity and are therefore limited in their ability to define performance shift causality. Rule based methods infer the health state of the engine system based on comparison of individual measurements or combinations of measurements with defined health norms or rules. This does not mean that rule based methods are necessarily simple. Although binary yes-no health assessment can sometimes be established by relatively simple rules, the causality assignment needed for refined health monitoring often requires an exceptionally complex rule base involving complicated logical maps. Structuring the rule system to be clear and unambiguous can be difficult, and the expert input required to maintain a large logic network and associated rule base can be prohibitive.

Santi, L. Michael↗

Search for Transient Gravitational Waves in Coincidence with Short-Duration Radio Transients During 2007-2013

We present an archival search for transient gravitational-wave bursts in coincidence with 27 single-pulse triggers from Green Bank Telescope pulsar surveys, using the LIGO (Laser Interferometer Gravitational Wave Observatory), Virgo (Variability of Solar Irradiance and Gravity Oscillations) and GEO (German-UK Interferometric Detector) interferometer network. We also discuss a check for gravitational-wave signals in coincidence with Parkes fast radio bursts using similar methods. Data analyzed in these searches were collected between 2007 and 2013. Possible sources of emission of both short-duration radio signals and transient gravitational-wave emission include star quakes on neutron stars, binary coalescence of neutron stars, and cosmic string cusps. While no evidence for gravitational-wave emission in coincidence with these radio transients was found, the current analysis serves as a prototype for similar future searches using more sensitive second-generation interferometers.

Abbott, B. P.↗

Learning and tuning fuzzy logic controllers through reinforcements

A new method for learning and tuning a fuzzy logic controller based on reinforcements from a dynamic system is presented. In particular, our Generalized Approximate Reasoning-based Intelligent Control (GARIC) architecture: (1) learns and tunes a fuzzy logic controller even when only weak reinforcements, such as a binary failure signal, is available; (2) introduces a new conjunction operator in computing the rule strengths of fuzzy control rules; (3) introduces a new localized mean of maximum (LMOM) method in combining the conclusions of several firing control rules; and (4) learns to produce real-valued control actions. Learning is achieved by integrating fuzzy inference into a feedforward network, which can then adaptively improve performance by using gradient descent methods. We extend the AHC algorithm of Barto, Sutton, and Anderson to include the prior control knowledge of human operators. The GARIC architecture is applied to a cart-pole balancing system and has demonstrated significant improvements in terms of the speed of learning and robustness to changes in the dynamic system's parameters over previous schemes for cart-pole balancing.

Berenji, Hamid R.↗

Data Access Tools And Services At The Goddard Distributed Active Archive Center (GDAAC)

As one of the largest providers of Earth Science data from the Earth Observing System, GDAAC provides the latest data from the Moderate Resolution Imaging Spectroradiometer (MODIS), Atmospheric Infrared Sounder (AIRS), Solar Radiation and Climate Experiment (SORCE) data products via GDAAC's data pool (50TB of disk cache). In order to make this huge volume of data more accessible to the public and science communities, the GDAAC offers multiple data access tools and services: Open Source Project for Network Data Access Protocol (OPeNDAP), Grid Analysis and Display System (GrADS/DODS) (GDS), Live Access Server (LAS), OpenGlS Web Map Server (WMS) and Near Archive Data Mining (NADM). The objective is to assist users in retrieving electronically a smaller, usable portion of data for further analysis. The OPeNDAP server, formerly known as the Distributed Oceanographic Data System (DODS), allows the user to retrieve data without worrying about the data format. OPeNDAP is capable of server-side subsetting of HDF, HDF-EOS, netCDF, JGOFS, ASCII, DSP, FITS and binary data formats. The GrADS/DODS server is capable of serving the same data formats as OPeNDAP. GDS has an additional feature of server-side analysis. Users can analyze the data on the server there by decreasing the computational load on their client's system. The LAS is a flexible server that allows user to graphically visualize data on the fly, to request different file formats and to compare variables from distributed locations. Users of LAS have options to use other available graphics viewers such as IDL, Matlab or GrADS. WMS is based on the OPeNDAP for serving geospatial information. WMS supports OpenGlS protocol to provide data in GIs-friendly formats for analysis and visualization. NADM is another access to the GDAAC's data pool. NADM gives users the capability to use a browser to upload their C, FORTRAN or IDL algorithms, test the algorithms, and mine data in the data pool. With NADM, the GDAAC provides an environment physically close to the data source. NADM will benefit users with mining or offer data reduction algorithms by reducing large volumes of data before transmission over the network to the user.

Pham, Long↗

Learning and tuning fuzzy logic controllers through reinforcements

This paper presents a new method for learning and tuning a fuzzy logic controller based on reinforcements from a dynamic system. In particular, our generalized approximate reasoning-based intelligent control (GARIC) architecture (1) learns and tunes a fuzzy logic controller even when only weak reinforcement, such as a binary failure signal, is available; (2) introduces a new conjunction operator in computing the rule strengths of fuzzy control rules; (3) introduces a new localized mean of maximum (LMOM) method in combining the conclusions of several firing control rules; and (4) learns to produce real-valued control actions. Learning is achieved by integrating fuzzy inference into a feedforward neural network, which can then adaptively improve performance by using gradient descent methods. We extend the AHC algorithm of Barto et al. (1983) to include the prior control knowledge of human operators. The GARIC architecture is applied to a cart-pole balancing system and demonstrates significant improvements in terms of the speed of learning and robustness to changes in the dynamic system's parameters over previous schemes for cart-pole balancing.

Berenji, Hamid R.↗

Fault structures in rapidly quenched Ni-Mo binary alloys

Fault structures in two Ni-Mo alloy ribbons (Ni-28 at. pct Mo and Ni-35 at. pct Mo) cast by a free jet chill block melt spinning process were studied. Thin foils for TEM studies were made by electrochemical thinning using an alcohol/butyl cellosolve/perchloric acid mixture in a twin jet electropolishing device. The samples displayed typical grains containing linear faulted regions on the wheelside of the two alloy ribbons. However, an anomalous diffraction behavior was observed upon continuous tilting of the sample: the network of diffraction spots from a single grain appeared to expand or contract and rotate. This anomalous diffraction behavior was explained by assuming extended spike formation at reciprocal lattice points, resulting in a network of continuous rel rods. The validity of the model was confirmed by observations of a cross section of the reciprocal lattice parallel to the rel rods.

Jayaraman, N.↗

Adaptive-Sweep Algorithm for Spacecraft Carrier Acquisition and Tracking: System Analysis and Implementation

This paper presents an adaptive-sweep algorithm that can be used in conjunction with a Phased-Lock Loop to acquire and track the carrier of a Binary Phase-shift Keying signal with residual carrier. This algorithm is useful in proximity links where no Doppler pre-compensation is available at the transmitter, and allows the receiver to acquire the incoming carrier even if the experienced Doppler shift is several orders of magnitude larger than the PLL bandwidth. Other applications for this algorithm include Multiple Uplink per Antenna at the Deep Space Network, and generation of observables (Doppler shift, Doppler rate, range rate) for in-situ navigation purposes. This paper enhances a previously presented adaptive-sweep algorithm and its performance analysis in two fronts. First, the algorithm now uses the direction function to automatically estimate the required frequency jump to achieve PLL lock. This enables a fully adaptive-sweep scheme in which system implementer does not need to manually select thresholds. On the other hand, we study the system performance in the presence of Additive White Gaussian Noise and derive necessary conditions for the system to operate at low signal-to-noise conditions. This allows us to create design rules that specify all parameters of the algorithm given a set of system-level requirements. To test the performance of the proposed algorithm, we implement it in GNU Radio, an open-source Software-Defined Radio that interfaces with several commercial radio peripherals. We use this implementation to demonstrate carrier lock and quantify system performance under different noise conditions. We also test the algorithm using open-loop recordings of two downlinks between the Lunar Reconnaissance Orbiter and the Deep Space Network. We show that even after large frequency jumps (tens of kHz), the proposed system is able to rapidly reacquire the carrier and continue operation.

Divsalar, Dariush↗

Computer vision research at Marshall Space Flight Center

Orbital docking, inspection, and sevicing are operations which have the potential for capability enhancement as well as cost reduction for space operations by the application of computer vision technology. Research at MSFC has been a natural outgrowth of orbital docking simulations for remote manually controlled vehicles such as the Teleoperator Retrieval System and the Orbital Maneuvering Vehicle (OMV). Baseline design of the OMV dictates teleoperator control from a ground station. This necessitates a high data-rate communication network and results in several seconds of time delay. Operational costs and vehicle control difficulties could be alleviated by an autonomous or semi-autonomous control system onboard the OMV which would be based on a computer vision system having capability to recognize video images in real time. A concept under development at MSFC with these attributes is based on syntactic pattern recognition. It uses tree graphs for rapid recognition of binary images of known orbiting target vehicles. This technique and others being investigated at MSFC will be evaluated in realistic conditions by the use of MSFC orbital docking simulators. Computer vision is also being applied at MSFC as part of the supporting development for Work Package One of Space Station Freedom.

Vinz, Frank L.↗

Development of Machine Learning Algorithms to Segment and Study Images of Astromaterial Samples

Introduction: Micrometer-scale chemical analyses of chondritic meteorites and mission-returned asteroid samples can reveal details of the physical and chemical processes operating in the early solar system, including processes that gave rise to planets, moons, and minor bodies. These primitive astromaterials are comprised of chondrules, calcium- and aluminum-rich inclusions (CAI), and many other silicates, oxides, metals, sulfides, and fine-grained materials. The chemical and mineralogical complexity of these samples, vast populations of different components, and heterogeneity across mm to km scales, all limit our understanding of the origin and evolution of these materials. Here, we describe recent efforts to use machine learning techniques to automate the segmentation of chemical maps of chondritic meteorites, designed to aid studies of asteroid samples returned by spacecraft. By automating the task of segmentation it will become possible to rapidly analyze and interpret the sizes, shapes, mineralogy, chemistry, and other properties of every chondrule, calcium- and aluminum-rich inclusion (CAI) and other clast within and between asteroid samples. Sample return missions significantly accelerate and heighten the need to develop such new data analysis techniques, and associated data repositories. Techniques: Neural networks require abundant training data, i.e. images which have been segmented by a human user. We have manually segmented data available from previous petrologic and chemical work at NASA Johnson Space Center and the American Museum of Natural History [1-4]. These data were derived from energy- and wavelength-dispersive X-ray spectroscopy (EDS, WDS) mapping of samples from many chondrite groups. The Deeplabv3+ [5] neural network architecture was trained on human-labeled masks and used to create machine-labeled masks. Several different algorithms were investigated, with inputs ranging from common RGB image formats through to hyperspectral datasets, with raw data comprising greyscale maps of Mg, Ca, and Al, with or without Si, Fe, Ti for both EDS and WDS data, and extending to other elements in EDS only. Each greyscale image was paired with a binary mask for each labelled particle type. Results: The trained algorithms can segment (Fig 1), classify, and measure the dimensions of thousands of particles in chemical maps of a standard 1-inch round petrographic section in seconds to minutes, rather than many hours needed by a human. Accuracy of the algorithms varied from chondrite to chondrite and across particle types. Further results and details of the algorithms will be presented at the workshop. Future directions: Machine learning has the potential to revolutionize our understanding of complex particle populations contained within primitive astromaterial, with segmentation being a critical first step. Example applications include better understanding of particle transport, nebular reservoirs, parent body accretion, and a deeper understanding of the relationships between particle populations and bulk rock elemental and isotopic compositions. In addition to benefits that machine learning can bring to individual researchers, building a community data repository of thousands to millions of particles across hundreds of samples will open up many other possibilities. For example, with a large enough dataset it will be possible to search for exceptionally closely matching particles across disparate samples. Such a capability would enable a single CAI from OSIRISREx or Hayabusa/II samples to be matched to chondritic CAIs that exhibit near-identical size, texture, and mineralogy, down to the level of similar core phenocrysts, zonation, and rim sequences. Such comparative analyses will help to disentangle precursor chemistry, chronology, gas/dust reservoirs during heating, and accretion. Such an endeavor would be impossible without machine learning and a large community data repository of astromaterial chemical/mineralogic maps.

Machine Learning↗