Search NASA⌕ Search

SEARCH · Search NASA

Results for “Checking”

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,261 records · Page 70

Evidence for high mass exclusive dijet production in the D0 experiment

Exclusive diffractive Higgs boson production is an interesting process which could be studied at the Large Hadron Collider. While the cross section for the Higgs boson production at the Fermilab Tevatron Collider is too low for this channel, it is important to check if the class of exclusive diffraction events exists. We present the evidence for the high mass exclusive dijet production in the D0 experiment. Hard diffractive processes are usually described by the exchange of a colorless object called Pomeron. In diffractive hadron hadron collisions, the hadrons will exchange the Pomeron and either one or both hadrons will not dissolve. The events are identified by either a presence of a large forward region of the detector devoid of any activity (rapidity gap) or by a tagging of the intact beam hadron(s). A subset of diffractive events is called exclusive when the whole Pomeron energy is used to produce the diffractive state, i.e there are no Pomeron remnants. Exclusive diffractive production (EDP) of the Higgs boson or any other new final state X pp {yields} p + X + p has been recently proposed as a search channel at the LHC. The cross section for the Higgs boson production is too low at the Tevatron (0.2fb is predicted for a Higgs boson mass of 120 GeV), but it is important to check if this class of events exists in this kinematic region. The CDF Collaboration has recently confirmed the existence of EDP in several channels. In this report, we present the evidence for the exclusive production of high dijet invariant mass events, i.e. a dijet event accompanied by large rapidity gaps on both sides of the calorimeter.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Globus service enhancements for exascale applications and facilities

Many extreme-scale applications require the movement of large quantities of data to, from, and among leadership computing facilities, as well as other scientific facilities and the home institutions of facility users. These applications, particularly when leadership computing facilities are involved, can touch upon edge cases (e.g., terabyte files) that had not been a focus of previous Globus optimization work, which had emphasized rather the movement of many smaller (megabyte to gigabyte) files. We report here on how automated client-driven chunking can be used to accelerate both the movement of large files and the integrity checking operations that have proven to be essential for large data transfers. In conclusion, we present detailed performance studies that provide insights into the benefits of these modifications in a range of file transfer scenarios.

97 MATHEMATICS AND COMPUTING↗

Covariance Testing and Update on 239 Pu and 235 U PFNS Covariances [Slides]

This presentation discusses in detail how covariances were obtained and tested. Along with a look into some of the mathematical checks that were performed. Possible "physics issues" in covariances were highlighted and addressed. Covariances for Dysprosium and Erbium-169 were touched on along with various uncertainties and issues. An update on Uranium-235 and Plutonium-239 Pu PFNS covariances was given.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

The HiVy toolset

The HiVy toolset provides model checking for statecharts. This is achieved by translating statechart specifications into the input language of the spin model checker.

model checking statechart translation validation↗

Future capabilities for the Deep Space Network

This paper will look at three new capabilities that are in different stages of development. First, turbo decoding, which provides improved telemetry performance for data rates up to about 1 Mbps, will be discussed. Next, pseudo-noise ranging will be presented. Pseudo-noise ranging has several advantages over the current sequential ranging, anmely easier operations, improved performance, and the capability to be used in a regenerative implementation on a spacecraft. Finally, Low Density Parity Check decoding will be discussed. LDPC codes can provide performance that matches or slightly exceed turbo codes, but are designed for use in the 10 Mbps range.

turbo code↗

Accumulate repeat accumulate codes

In this paper we propose an innovative channel coding scheme called 'Accumulate Repeat Accumulate codes' (ARA). This class of codes can be viewed as serial turbo-like codes, or as a subclass of Low Density Parity Check (LDPC) codes, thus belief propagation can be used for iterative decoding of ARA codes on a graph. The structure of encoder for this class can be viewed as precoded Repeat Accumulate (RA) code or as precoded Irregular Repeat Accumulate (IRA) code, where simply an accumulator is chosen as a precoder. Thus ARA codes have simple, and very fast encoder structure when they representing LDPC codes. Based on density evolution for LDPC codes through some examples for ARA codes, we show that for maximum variable node degree 5 a minimum bit SNR as low as 0.08 dB from channel capacity for rate 1/2 can be achieved as the block size goes to infinity. Thus based on fixed low maximum variable node degree, its threshold outperforms not only the RA and IRA codes but also the best known LDPC codes with the dame maximum node degree. Furthermore by puncturing the accumulators any desired high rate codes close to code rate 1 can be obtained with thresholds that stay close to the channel capacity thresholds uniformly. Iterative decoding simulation results are provided. The ARA codes also have projected graph or protograph representation that allows for high speed decoder implementation.

Low Density Parity Check codes (LDPC)↗

Verifying AI Plan Models: Even the Best Laid Plans Need to be Verified

This viewgraph presentation reviews work on model checking, and specifically the SPIN model checker. The goal of this work is to retire a significant class of risks associated with the use of Artificial Intelligence (Al) Planners on Missions. This effort must provide tangible testing results to a mission using Al technology. It is hoped that the work should be possible to leverage the technique and tools throughout NASA

artificial intelligence↗

Protograph LDPC Codes with Node Degrees at Least 3

In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower, by about 0.2 dB, than the best known irregular LDPC codes with degree at least 3. The main motivation is to gain linear minimum distance to achieve low error floor. Also to construct rate-compatible protograph-based LDPC codes for fixed block length that simultaneously achieves low iterative decoding threshold and linear minimum distance. We start with a rate 1/2 protograph LDPC code with degree-3 nodes and one high degree node. Higher rate codes are obtained by connecting check nodes with degree-2 non-transmitted nodes. This is equivalent to constraint combining in the protograph. The condition where all constraints are combined corresponds to the highest rate code. This constraint must be connected to nodes of degree at least three for the graph to have linear minimum distance. Thus having node degree at least 3 for rate 1/2 guarantees linear minimum distance property to be preserved for higher rates. Through examples we show that the iterative decoding threshold as low as 0.544 dB can be achieved for small protographs with node degrees at least three. A family of low- to high-rate codes with minimum distance linearly increasing in block size and with capacity-approaching performance thresholds is presented. FPGA simulation results for a few example codes show that the proposed codes perform as predicted.

low density parity check (LDPC)↗

Accumulate Repeat Accumulate Coded Modulation

In this paper we propose an innovative coded modulation scheme called 'Accumulate Repeat Accumulate Coded Modulation' (ARA coded modulation). This class of codes can be viewed as serial turbo-like codes, or as a subclass of Low Density Parity Check (LDPC) codes that are combined with high level modulation. Thus at the decoder belief propagation can be used for iterative decoding of ARA coded modulation on a graph, provided a demapper transforms the received in-phase and quadrature samples to reliability of the bits.

coded modulation↗

Protograph LDPC Codes for the Erasure Channel

This viewgraph presentation reviews the use of protograph Low Density Parity Check (LDPC) codes for erasure channels. A protograph is a Tanner graph with a relatively small number of nodes. A "copy-and-permute" operation can be applied to the protograph to obtain larger derived graphs of various sizes. For very high code rates and short block sizes, a low asymptotic threshold criterion is not the best approach to designing LDPC codes. Simple protographs with much regularity and low maximum node degrees appear to be the best choices Quantized-rateless protograph LDPC codes can be built by careful design of the protograph such that multiple puncturing patterns will still permit message passing decoding to proceed

long erasure codes↗

Optimizations of a Hardware Decoder for Deep-Space Optical Communications

The National Aeronautics and Space Administration has developed a capacity approaching modulation and coding scheme that comprises a serial concatenation of an inner accumulate pulse-position modulation (PPM) and an outer convolutional code [or serially concatenated PPM (SCPPM)] for deep-space optical communications. Decoding of this code uses the turbo principle. However, due to the nonbinary property of SCPPM, a straightforward application of classical turbo decoding is very inefficient. Here, we present various optimizations applicable in hardware implementation of the SCPPM decoder. More specifically, we feature a Super Gamma computation to efficiently handle parallel trellis edges, a pipeline-friendly 'maxstar top-2' circuit that reduces the max-only approximation penalty, a low-latency cyclic redundancy check circuit for window-based decoders, and a high-speed algorithmic polynomial interleaver that leads to memory savings. Using the featured optimizations, we implement a 6.72 megabits-per-second (Mbps) SCPPM decoder on a single field-programmable gate array (FPGA). Compared to the current data rate of 256 kilobits per second from Mars, the SCPPM coded scheme represents a throughput increase of more than twenty-six fold. Extension to a 50-Mbps decoder on a board with multiple FPGAs follows naturally. We show through hardware simulations that the SCPPM coded system can operate within 1 dB of the Shannon capacity at nominal operating conditions.

quadratic polynomial interleaver↗

Accumulate-Repeat-Accumulate-Accumulate-Codes

Inspired by recently proposed Accumulate-Repeat-Accumulate (ARA) codes [15], in this paper we propose a channel coding scheme called Accumulate-Repeat-Accumulate-Accumulate (ARAA) codes. These codes can be seen as serial turbo-like codes or as a subclass of Low Density Parity Check (LDPC) codes, and they have a projected graph or protograph representation; this allows for a high-speed iterative decoder implementation using belief propagation. An ARAA code can be viewed as a precoded Repeat-and-Accumulate (RA) code with puncturing in concatenation with another accumulator, where simply an accumulator is chosen as the precoder; thus ARAA codes have a very fast encoder structure. Using density evolution on their associated protographs, we find examples of rate-lJ2 ARAA codes with maximum variable node degree 4 for which a minimum bit-SNR as low as 0.21 dB from the channel capacity limit can be achieved as the block size goes to infinity. Such a low threshold cannot be achieved by RA or Irregular RA (IRA) or unstructured irregular LDPC codes with the same constraint on the maximum variable node degree. Furthermore by puncturing the accumulators we can construct families of higher rate ARAA codes with thresholds that stay close to their respective channel capacity thresholds uniformly. Iterative decoding simulation results show comparable performance with the best-known LDPC codes but with very low error floor even at moderate block sizes.

density evolution↗

Replacing the CCSDS Telecommand Protocol with the Next Generation Uplink (NGU)

The current CCSDS Telecommand (TC) Recommendations 1-3 have essentially been in use since the early 1960s. The purpose of this paper is to propose a successor protocol to TC. The current CCSDS recommendations can only accommodate telecommand rates up to approximately 1 mbit/s. However today's spacecraft are storehouses for software including software for Field Programmable Gate Arrays (FPGA) which are rapidly replacing unique hardware systems. Changes to flight software occasionally require uplinks to deliver very large volumes of data. In the opposite direction, high rate downlink missions that use acknowledged CCSDS File Delivery Protocol (CFDP)4 will increase the uplink data rate requirements. It is calculated that a 5 mbits/s downlink could saturate a 4 kbits/s uplink with CFDP downlink responses: negative acknowledgements (NAKs), FINISHs, End-of-File (EOF), Acknowledgements (ACKs). Moreover, it is anticipated that uplink rates of 10 to 20 mbits/s will be required to support manned missions. The current TC recommendations cannot meet these new demands. Specifically, they are very tightly coupled to the Bose-Chaudhuri-Hocquenghem (BCH) code in Ref. 2. This protocol requires that an uncorrectable BCH codeword delimit the TC frame and terminate the randomization process. This method greatly limits telecom performance since only the BCH code can support the protocol. More modern techniques such as the CCSDS Low Density Parity Check (LDPC)5 codes can provide a minimum performance gain of up to 6 times higher command data rates as long as sufficient power is available in the data. This paper will describe the proposed protocol format, trade-offs, and advantages offered, along with a discussion of how reliable communications takes place at higher nominal rates.

Consultative Committee for Space Data Systems (CCS↗

The SeaHorn Verification Framework

In this paper, we present SeaHorn, a software verification framework. The key distinguishing feature of SeaHorn is its modular design that separates the concerns of the syntax of the programming language, its operational semantics, and the verification semantics. SeaHorn encompasses several novelties: it (a) encodes verification conditions using an efficient yet precise inter-procedural technique, (b) provides flexibility in the verification semantics to allow different levels of precision, (c) leverages the state-of-the-art in software model checking and abstract interpretation for verification, and (d) uses Horn-clauses as an intermediate language to represent verification conditions which simplifies interfacing with multiple verification tools based on Horn-clauses. SeaHorn provides users with a powerful verification tool and researchers with an extensible and customizable framework for experimenting with new software verification techniques. The effectiveness and scalability of SeaHorn are demonstrated by an extensive experimental evaluation using benchmarks from SV-COMP 2015 and real avionics code.

Model Checking↗

Trustworthy Autonomy for Gateway Vehicle System Manager

This webinar will present techniques for achieving trusted autonomous operations that are being pioneered on the NASA Lunar Gateway Vehicle System Manager (VSM). The challenges of achieving trusted autonomy faced by the VSM project are similar to challenges in underwater autonomous systems. The webinar will describe the overall approach to verification and present in detail the use of design-time (development) assume-guarantee contracts using model checking and runtime (operational) assume-guarantee contracts. The webinar will conclude with a summary of lessons learned to date and future challenges.

Assume-guarantee contracts↗

Two-Phase Flow in Filters and Orifices: In preparation for Measurements on ISS Packed Bed Reactor Experiment-Water Recovery Series (PBRE-WRS)

Understanding the hydrodynamics of adiabatic two-phase flows in packed bed reactors offers numerous benefits. It enables the optimization of chemical reactions rates and products, crucial for pharmaceuticals and energy production industries. Additionally, this understanding aids in designing more efficient and compact reactors, reducing space and resource requirements. Insights gained from studying such flows in microgravity contribute to advancements of space technologies and the enhancement of our capabilities for undertaking future long duration safe, and sustainable space exploration missions. The Packed Bed Reactor Experiment-Water Recovery Series (PBRE-WRS) is a flight experiment planned for operation on the Microgravity Science Glove box (MSG) facility of the International Space Station (ISS). The objective of the experiment is to validate hydrodynamic models at a range of gas and liquid flow rates. The microgravity environment allows for measurement and observation of aspects of fluid dynamics that are unique when compared to observations made in full or partial gravity environments. The experiment consists of testing two-phase flow hydrodynamics in three different filters, four (4) orifices and one check valve test articles. The experiment utilizes the hardware of the previously flown PBRE and PBRE-2 with packed beds of different packings materials and sizes. The fluid system of the PBRE-WRS consists of a nitrogen gas delivery and water delivery subsystems. The gas delivery subsystem can accommodate two ranges of gas flow rates, just as for the water delivery system. The nitrogen gas loop is open whereas the water loop is closed. Gas is separated from the water using a gas-liquid phase separator which is located in the water delivery module. Preliminary results from ground testing show the pressure drop increasing at different rates with the liquid and gas flow rates in the Brine filter. In this work, a detailed system description is presented along with a summary of results from ground performance testing of different test sections in an end-to-end preflight testing campaign.

Packed Bed Reactor Experiment↗

How do A-train Sensors Intercompare in the Retrieval of Above-Cloud Aerosol Optical Depth? A Case Study-based Assessment

We inter-compare the above-cloud aerosol optical depth (ACAOD) of biomass burning plumes retrieved from different A-train sensors, i.e., MODIS, CALIOP, POLDER, and OMI. These sensors have shown independent capabilities to detect and retrieve aerosol loading above marine boundary layer clouds--a kind of situation often found over the Southeast Atlantic Ocean during dry burning season. A systematic one-to-one comparison reveals that, in general, all passive sensors and CALIOP-based research methods derive comparable ACAOD with differences mostly within 0.2 over homogeneous cloud fields. The 532-nm ACAOD retrieved by CALIOP operational algorithm is largely underestimated; however, it’s 1064-nm AOD when converted to 500 nm shows closer agreement to the passive sensors. Given the different types of sensor measurements processed with different algorithms, the close agreement between them is encouraging. Due to lack of adequate direct measurements above cloud, the validation of satellite-based ACAOD retrievals remains an open challenge. The inter-satellite comparison, however, can be useful for the relative evaluation and consistency check.

54 ENVIRONMENTAL SCIENCES↗

On the validation of seismic imaging methods: Finite frequency or ray theory?

Abstract We investigate the merits of the more recently developed finite‐frequency approach to tomography against the more traditional and approximate ray theoretical approach for state of the art seismic models developed for western North America. To this end, we employ the spectral element method to assess the agreement between observations on real data and measurements made on synthetic seismograms predicted by the models under consideration. We check for phase delay agreement as well as waveform cross‐correlation values. Based on statistical analyses on S wave phase delay measurements, finite frequency shows an improvement over ray theory. Random sampling using cross‐correlation values identifies regions where synthetic seismograms computed with ray theory and finite‐frequency models differ the most. Our study suggests that finite‐frequency approaches to seismic imaging exhibit measurable improvement for pronounced low‐velocity anomalies such as mantle plumes.

58 GEOSCIENCES↗