Search NASA⌕ Search

SEARCH · Search NASA

Results for “Communications process”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 1,657 records · Page 92

NASA Performance Report

Introduction NASA's mission is to advance and communicate scientific knowledge and understanding of Earth, the solar system, and the universe; to advance human exploration, use, and development of space; and to research, develop, verify, and transfer advanced aeronautics, space, and related technologies. In support of this mission, NASA has a strategic architecture that consists of four Enterprises supported by four Crosscutting Processes. The Strategic Enterprises are NASA's primary mission areas to include Earth Science, Space Science, Human Exploration and Development of Space, and Aerospace Technology. NASA's Crosscutting Processes are Manage Strategically, Provide Aerospace Products and Capabilities, Generate Knowledge and Communicate Knowledge. The implementation of NASA programs, science, and technology research occurs primarily at our Centers. NASA consists of a Headquarters, nine Centers, and the Jet Propulsion Laboratory, as well as several ancillary installations and offices in the United States and abroad. The nine Centers are as follows: (1) Ames Research Center, (2) Dryden Flight Research Center (DFRC), (3) Glenn Research Center (GRC), (4) Goddard Space Flight Center (GSFC), (5) Johnson Space Center, (6) Kennedy Space Center (KSC), (7) Langley Research Center (LaRC), (8) Marshall Space Flight Center (MSFC), and (9) Stennis Space Center (SSC).

Source record↗

Predictor-corrector models for lightweight massive machine-type communications in Industry 4.0

Future Industry 4.0 scenarios are characterized by seamless integration between computational and physical processes. To achieve this objective, dense platforms made of small sensing nodes and other resource constraint devices are ubiquitously deployed. All these devices have a limited number of computational resources, just enough to perform the simple operation they are in charge of. The remaining operations are delegated to powerful gateways that manage sensing nodes, but resources are never unlimited, and as more and more devices are deployed on Industry 4.0 platforms, gateways present more problems to handle massive machine-type communications. Although the problems are diverse, those related to security are especially critical. To enable sensing nodes to establish secure communications, several semiconductor companies are currently promoting a new generation of devices based on Physical Unclonable Functions, whose usage grows every year in many real industrial scenarios. Those hardware devices do not consume any computational resource but force the gateway to keep large key-value catalogues for each individual node. In this context, memory usage is not scalable and processing delays increase exponentially with each new node on the platform. In this paper, we address this challenge through predictor-corrector models, representing the key-value catalogues. Models are mathematically complex, but we argue that they consume less computational resources than current approaches. The lightweight models are based on complex functions managed as Laurent series, cubic spline interpolations, and Boolean functions also developed as series. Unknown parameters in these models are predicted, and eventually corrected to calculate the output value for each given key. The initial parameters are based on the Kane Yee formula. An experimental analysis and a performance evaluation are provided in the experimental section, showing that the proposed approach causes a significant reduction in the resource consumption.

97 MATHEMATICS AND COMPUTING↗

Applying Strategic Visualization(Registered Trademark) to Lunar and Planetary Mission Design

NASA teams, such as the NASA Exploration Team (NEXT), utilize advanced computational visualization processes to develop mission designs and architectures for lunar and planetary missions. One such process, Strategic Visualization (trademark), is a tool used extensively to help mission designers visualize various design alternatives and present them to other participants of their team. The participants, which may include NASA, industry, and the academic community, are distributed within a virtual network. Consequently, computer animation and other digital techniques provide an efficient means to communicate top-level technical information among team members. Today,Strategic Visualization(trademark) is used extensively both in the mission design process within the technical community, and to communicate the value of space exploration to the general public. Movies and digital images have been generated and shown on nationally broadcast television and the Internet, as well as in magazines and digital media. In our presentation will show excerpts of a computer-generated animation depicting the reference Earth/Moon L1 Libration Point Gateway architecture. The Gateway serves as a staging corridor for human expeditions to the lunar poles and other surface locations. Also shown are crew transfer systems and current reference lunar excursion vehicles as well as the Human and robotic construction of an inflatable telescope array for deployment to the Sun/Earth Libration Point.

Frassanito, John R.↗

Experimental Evaluation of the "Polished Panel Optical Receiver" Concept on the Deep Space Network's 34 Meter Antenna

The potential development of large aperture ground-based "photon bucket" optical receivers for deep space communications has received considerable attention recently. One approach currently under investigation proposes to polish the aluminum reflector panels of 34-meter microwave antennas to high reflectance, and accept the relatively large spotsize generated by even state-of-the-art polished aluminum panels. Here we describe the experimental effort currently underway at the Deep Space Network (DSN) Goldstone Communications Complex in California, to test and verify these concepts in a realistic operational environment. A custom designed aluminum panel has been mounted on the 34 meter research antenna at Deep-Space Station 13 (DSS-13), and a remotely controlled CCD camera with a large CCD sensor in a weather-proof container has been installed next to the subreflector, pointed directly at the custom polished panel. Using the planet Jupiter as the optical point-source, the point-spread function (PSF) generated by the polished panel has been characterized, the array data processed to determine the center of the intensity distribution, and expected communications performance of the proposed polished panel optical receiver has been evaluated.

photon counting detection↗

Reversible Parallel Discrete Event Formulation of a TLM-based Radio Signal Propagation Model

Radio signal strength estimation is essential in many applications, including the design of military radio communications and industrial wireless installations. For scenarios with large or richly- featured geographical volumes, parallel processing is required to meet the memory and computa- tion time demands. Here, we present a scalable and efficient parallel execution of the sequential model for radio signal propagation recently developed by Nutaro et al. Starting with that model, we (a) provide a vector-based reformulation that has significantly lower computational overhead for event handling, (b) develop a parallel decomposition approach that is amenable to reversibility with minimal computational overheads, (c) present a framework for transparently mapping the conservative time-stepped model into an optimistic parallel discrete event execution, (d) present a new reversible method, along with its analysis and implementation, for inverting the vector-based event model to be executed in an optimistic parallel style of execution, and (e) present performance results from implementation on Cray XT platforms. We demonstrate scalability, with the largest runs tested on up to 127,500 cores of a Cray XT5, enabling simulation of larger scenarios and with faster execution than reported before on the radio propagation model. This also represents the first successful demonstration of the ability to efficiently map a conservative time-stepped model to an optimistic discrete-event execution.

99 GENERAL AND MISCELLANEOUS↗

Data Distribution Satellite

The Data Distribution Satellite (DDS) is described in terms of its role in providing space-data and communication services for the National Research and Education Network. The DDS is envisioned as a processing link in the microwave network that would connect academic, industrial, and government institutions to a high-data-rate service of space data. The general need for science communications is assessed, and it is shown that the data potential exceeds the available spectrum. The DDS could act as a bridge between terrestrial facilities the space network, and other space platforms to provide efficient access to space science data. Government demand for this type of data is high suggesting that the DDS could make use of hopping beams to provide more data at reduced costs.

Stevens, Grady H.↗

Achieving dependability throughout the development process - A distributed software experiment

Distributed software engineering techniques and methods for improving the specification and testing phases are considered. With multiversion development, multiple implementations allow the use of an automated approach to testing called back-to-back (B/B) testing in which the outputs are compared to detect any discrepancies. However, a specification defect may lead to similar errors in the multiple versions and the underlying fault may not be detected with a B/B testing approach. The use of diverse formal specifications has been proposed as a solution to this problem, since defects in independently written specifications are likely to be different. To examine these issues, an experiment was performed using the design diversity approach in the specification, design, implementation, and testing of distributed software. In the experiment, three diverse formal specifications were used to produce multiple independent implementations of a distributed communication protocol in Ada. The problems encountered in building complex concurrent processing systems in Ada were also studied. Many pitfalls were discovered in mapping the formal specifications into Ada implementations.

Kelly, John P. J.↗

Sample-Efficient Adaptive Calibration of Quantum Networks Using Bayesian Optimization

All physical systems employed for quantum information tasks must act as unbiased carriers of encoded quantum states. Ensuring such indistinguishability of information carriers is a major challenge in many quantum information applications, including advanced quantum communication protocols. For photons, the workhorses of quantum communication networks, it is difficult to obtain and maintain their indistinguishability because of environment-induced transformations and loss imparted by communication channels, especially in noisy scenarios. Conventional strategies to mitigate these transformations often require hardware or software overhead that is restrictive (e.g., adding noise), infeasible (e.g., on a satellite), or time-consuming for deployed networks. In this work we propose and develop resource-efficient Bayesian optimization techniques to rapidly and adaptively calibrate the indistinguishability of individual photons for quantum networks using only information derived from their measurement. To experimentally validate our approach, we demonstrate the optimization of Hong-Ou-Mandel interference between two photons-a central task in quantum networking- finding rapid, efficient, and reliable convergence towards maximal photon indistinguishability in the presence of high loss and shot noise. We expect our resource-optimized and experimentally friendly methodology will allow fast and reliable calibration of indistinguishable quanta, a necessary task in distributed quantum computing, communications, and sensing, as well as for fundamental investigations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum cryptography and combined schemes of quantum cryptography communication networks

We discuss cryptographic data protection network schemes combining the approaches of quantum cryptography with advanced computer information processing methods. The use of the latter is due to the presence of a number of unsolved problems in the existing quantum key distribution systems and is also associated with projects for the development of network-centric quantum communications and photonic networks, which involves the employment of multi-agent control models. Developments based on the Y-00 protocol with data encoding by the quantum noise of a transmitting laser are considered, and achievements in the field of quantum-optical random number generators are presented. The latter can be also used to design secure multi-valued logic encoding schemes that are promising for increasing the dimension of the key space in the ‘one-time pad’ method, for solving the tasks of position-dependent cryptography and for implementing multi-agent models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

33rd Actinide Separations Conference

Welcome to the 33rd Actinide Separations Conference hosted this year by the Lawrence Livermore National Laboratory. This annual conference is centered on the idea of networking and communication with scientists from throughout the United States, Britain, France and Japan who have expertise in nuclear material processing. This conference forum provides an excellent opportunity for bringing together experts in the fields of chemistry, nuclear and chemical engineering, and actinide processing to present and discuss experiences, research results, testing and application of actinide separation processes. The exchange of information that will take place between you, and other subject matter experts from around the nation and across the international boundaries, is a critical tool to assist in solving both national and international problems associated with the processing of nuclear materials used for both defense and energy purposes, as well as for the safe disposition of excess nuclear material. Granlibakken is a dedicated conference facility and training campus that is set up to provide the venue that supports communication between scientists and engineers attending the 33rd Actinide Separations Conference. We believe that you will find that Granlibakken and the Lake Tahoe views provide an atmosphere that is stimulating for fruitful discussions between participants from both government and private industry. We thank the Lawrence Livermore National Laboratory and the United States Department of Energy for their support of this conference. We especially thank you, the participants and subject matter experts, for your involvement in the 33rd Actinide Separations Conference.

07 ISOTOPE AND RADIATION SOURCES↗

A terminology for in situ visualization and analysis systems

The term "in situ processing" has evolved over the last decade to mean both a specific strategy for visualizing and analyzing data and an umbrella term for a processing paradigm. The resulting confusion makes it difficult for visualization and analysis scientists to communicate with each other and with their stakeholders. To address this problem, a group of over 50 experts convened with the goal of standardizing terminology. This paper summarizes their findings and proposes a new terminology for describing in situ systems. An important finding from this group was that in situ systems are best described via multiple, distinct axes: integration type, proximity, access, division of execution, operation controls, and output type. This paper discusses these axes, evaluates existing systems within the axes, and explores how currently used terms relate to the axes.

97 MATHEMATICS AND COMPUTING↗

FLASH: FPGA-Accelerated Smart Switches with GCN Case Study

Some communication switches, e.g., the Mellanox SHArP and those in the IBM BlueGene clusters, are augmented to process packets at the application level with fixed-function collectives. This approach, however, lacks flexibility, which limits their applicability in diverse and dynamic workloads. Recently, a new type of programmable packet processor, which uses high-level languages, e.g., P4, has emerged as possible candidates. P4-based switches, however, fall short in certain applications, including machine learning, where capabilities not currently supported by P4 are needed. These include more complex calculation, such as sparse computation and fused multiply-accumulate, data-intensive floating point operations, data reuse, and significant memory. The problem addressed here is that such a switch augmentation needs to support: a large amount of state, significant flexible compute capability, and ease of programming, all while maintaining full functionality, including ensuring high throughput, and demonstrating utility. In this work, we propose a programmable look-aside-type accelerator that can be embedded into, or attached to, existing communication switch pipelines and that is capable of processing packets at line-rate. The proposed in-switch accelerator is based on mixing an ISA (subset of RISC-V instructions) with dataflow graphs (found in CGRAs). To augment performance, vector instructions are also supported. To facilitate usability, we have developed a complete toolchain to compile user-provided C/C++ codes to appropriate back-end instructions for configuring the accelerator. While this approach is flexible enough to support various workloads, in this paper, we consider Graph Convolutional Networks (GCNs) as a case study. Experimental results show that this approach considerably improves the performance of distributed GCN applications.

Haghi, Pouya↗

Reliable communication in the presence of failures

The design and correctness of a communication facility for a distributed computer system are reported on. The facility provides support for fault-tolerant process groups in the form of a family of reliable multicast protocols that can be used in both local- and wide-area networks. These protocols attain high levels of concurrency, while respecting application-specific delivery ordering constraints, and have varying cost and performance that depend on the degree of ordering desired. In particular, a protocol that enforces causal delivery orderings is introduced and shown to be a valuable alternative to conventional asynchronous communication protocols. The facility also ensures that the processes belonging to a fault-tolerant process group will observe consistant orderings of events affecting the group as a whole, including process failures, recoveries, migration, and dynamic changes to group properties like member rankings. A review of several uses for the protocols is the ISIS system, which supports fault-tolerant resilient objects and bulletin boards, illustrates the significant simplification of higher level algorithms made possible by our approach.

Birman, Kenneth P.↗

Using Simulation to Examine the Effect of MPI Message Matching Costs on Application Performance

Attaining high performance with MPI applications requires efficient message matching to minimize message processing overheads and the latency these overheads introduce into application communication. We use a validated simulation-based approach to examine the relationship between MPI message matching performance and application time-to-solution. Specifically, we examine how the performance of several important HPC workloads is affected by the time required for matching. Our analysis yields several important contributions: (i) the performance of current workloads is unlikely to be significantly affected by MPI matching unless match queue operations get much slower or match queues get much longer; (ii) match queue designs that provide sublinear performance as a function of queue length are unlikely to yield much benefit unless match queue lengths increase dramatically; and (iii) we provide guidance on how long the mean time per match attempt may be without significantly affecting application performance. The results and analysis in this paper provide valuable guidance on the design and development of MPI message match queues.

97 MATHEMATICS AND COMPUTING↗

The study on knowledge transferring incentive for information system requirement development

Information system requirement development is a process of users’ knowledge sharing and transferring. However the tacit requirements developing is a main problem during requirement development process, for the reason of difficult to encoding, express, and communicate. Knowledge fusion and corporate effort is needed to finding tacit requirements. Under this background, our paper try to find out the rule of effort dynamic evolutionary of software developer and user by building an evolutionary game model on the condition of incentive system. And in addition this paper provides an in depth discussion at the end of this paper.

97 MATHEMATICS AND COMPUTING↗

Quasi-collinear tunable acousto-optic paratellurite crystal filters for wavelength division multiplexing and optical channel selection

Quasi-collinear acousto-optic interaction is studied in acoustically and optically anisotropic paratellurite crystals. The possible applications of this interaction in acousto-optic tunable filters with a high spectral resolution are discussed. Different modifications of devices are compared and variants of devices intended for processing light beams and selection of light signals in fibreoptic communication systems with wavelength division multiplexing (WDM) at {lambda} {approx_equal} 1550 nm are considered. (light modulation)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Robust quantum repeater with atomic ensembles and single-photon sources

We present an efficient scheme for generating high-fidelity entanglement locally which is essential for quantum repeater protocols. Two local 'polarization' entangled states of atomic ensembles u and d are generated by absorbing a single photon emitted by on-demand single-photon sources, based on which high-fidelity local entanglement between four ensembles can be established efficiently through Bell-state measurement. Entanglement in basic links and entanglement connection between links are carried out by the use of two-photon interference. In addition to being robust against phase fluctuations in the quantum channels, this scheme may speed up quantum communication with higher fidelity compared with the partial read protocol [Sangouard et al., Phys. Rev. A 77, 062301 (2008)] which may generate entanglement most quickly among the previous schemes with the same ingredients.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal Gaussian entanglement swapping

We consider entanglement swapping with general mixed two-mode Gaussian states and calculate the optimal gains for a broad class of such states including those states most relevant in communication scenarios. We show that, for this class of states, entanglement swapping adds no additional mixedness; that is, the ensemble-average output state has the same purity as the input states. This implies that, by using intermediate entanglement swapping steps, it is, in principle, possible to distribute entangled two-mode Gaussian states of higher purity as compared to direct transmission. We then apply the general results on optimal Gaussian swapping to the problem of quantum communication over a lossy fiber and demonstrate that, in contrast to the negative conclusions in the literature, swapping-based schemes in fact often perform better than direct transmission for high input squeezing. However, an effective transmission analysis reveals that the hope for improved performance based on optimal Gaussian entanglement swapping is spurious since the swapping does not lead to an enhancement of the effective transmission. This implies that the same or better results can always be obtained using direct transmission in combination with, in general, less squeezing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗