Search NASA⌕ Search

SEARCH · Search NASA

Results for “block errors”

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 37 records · Page 2

Tolerating memory stack failures in multi-stack systems

Memory management circuitry and processes operate to improve reliability of a group of memory stacks, providing that if a memory stack or a portion thereof fails during the product's lifetime, the system may still recover with no errors or data loss. A front-end controller receives a block of data requested to be written to memory, divides the block into sub-blocks, and creates a new redundant reliability sub-block. The sub-blocks are then written to different memory stacks. When reading data from the memory stacks, the front-end controller detects errors indicating a failure within one of the memory stacks, and recovers corrected data using the reliability sub-block. The front-end controller may monitor errors for signs of a stack failure and disable the failed stack.

Mappouras, Georgios↗

Majorana subsystem qubit codes that also correct odd-weight errors

Abstract A potential platform for topological quantum computation is the Majorana-based tetron architecture. Its building blocks are superconducting islands called tetrons, which host four Majorana zero modes. Existing error correcting codes can correct even-weight errors on tetrons. In a previous proposal by us, we had shown that incorporating tetrons in the stabilizer group allows us to correct a combination of odd-weight errors and even-weight errors on tetrons. In this work, we show that inclusion of tetrons in the gauge group lets us create subsystem codes from conventional Pauli stabilizer codes, which can correct both kinds of errors. Compared to the previous approach, the current approach lets us construct codes with fewer stabilizer generators. This leads to shorter fault-tolerant sequence length, and improves the fault-tolerant pseudothreshold by as much as 84%.

Physics↗

PDF Entity Annotation Tool (PEAT)

While different text mining approaches – including the use of Artificial Intelligence (AI) and other machine based methods - continue to expand at a rapid pace, the tools used by researchers to create the labeled datasets required for training, modeling, and evaluation remain rudimentary. Labeled datasets contain the target attributes the machine is going to learn; for example, training an algorithm to delineate between images of a car or truck would generally require a set of images with a quantitative description of the underlying features of each vehicle type. Development of labeled textual data that can be used to build natural language machine learning models for scientific literature is not currently integrated into existing manual workflows used by domain experts. Published literature is rich with important information, such as different types of embedded text, plots, and tables that can all be used as inputs to train ML/natural language processing (NLP) models, when extracted and prepared in machine readable formats. Currently, both normalized data extraction of use to domain experts and extraction to support development of ML/NLP models are labor intensive and cumbersome manual processes. Automatic extraction of data and information from formats such as PDFs that are optimized for layout and human readability, not machine readability. The PDF (Portable Document Format) Entity Annotation Tool (PEAT) was developed with the goal of allowing users to annotate publications within their current print format, while also allowing those annotations to be captured in a machine-readable format. One of the main issues with traditional annotation tools is that they require transforming the PDF into plain text to facilitate the annotation process. While doing so lessens the technical challenges of annotating data, the user loses all structure and provenance that was inherent in the underlying PDF. Also, textual data extraction from PDFs can be an error prone process. Challenges include identifying sequential blocks of text and a multitude of document formats (multiple columns, font encodings, etc.). As a result of these challenges, using existing tools for development of NLP/ML models directly from PDFs is difficult because the generated outputs are not interoperable. We created a system that allows annotations to be completed on the original PDF document structure, with no plain text extraction. The result is an application that allows for easier and more accurate annotations. In addition, by including a feature that grants the user the ability to easily create a schema, we have developed a system that can be used to annotate text for different domain-centric schemas of relevance to subject matter experts. Different knowledge domains require distinct schemas and annotation tags to support machine learning.

97 MATHEMATICS AND COMPUTING↗

Polarimetry-Enhanced Imaging towards Autonomous Solar Field and Receiver Inspections

During the typical operation of a Concentrating Solar Power (CSP) plant, a large portion of the energy (~45%) can be lost due to various imperfect conditions, such as blocking, shading, mirror soiling, tracking and canting errors, etc. It is necessary to develop efficient and effective field inspection technology to optically survey and characterize a CSP field, which can be used as an input for autonomous control, maintenance scheduling and spot repair whenever necessary to maximize the overall efficiency of the plant. In this project, We aim to apply polarimetric imaging for CSP collector and receiver inspection and develop polarimetric drone cameras (via integrating polarimetric imagers onto drones) for autonomous field inspection in CSP plants.

14 SOLAR ENERGY↗

Scalable quantum computational science: A perspective from block-encodings and polynomial transformations

Significant developments made in quantum hardware and error correction recently have been driving quantum computing toward practical utility. However, gaps remain between abstract quantum algorithmic development and practical applications in computational sciences. In this perspective article, we propose several properties that scalable quantum computational science methods should possess. We further discuss how block-encodings and polynomial transformations can potentially serve as a unified framework with the desired properties. Recent advancements on these topics are presented, including the construction and assembly of block-encodings, and various generalizations of quantum signal processing (QSP) algorithms to perform polynomial transformations. The scalability of QSP methods on parallel and distributed quantum architectures is also highlighted. Promising applications in simulation and observable estimation in chemistry, physics, and optimization problems are presented. We hope this perspective serves as a gentle introduction to state-of-the-art quantum algorithms for the computational science community and inspires future development of scalable quantum computational science methodologies that bridge theory and practice.

Bayesian inference↗

Progressive Tree-Based Compression of Large-Scale Particle Data

Scientific simulations and observations using particles have been creating large datasets that require effective and efficient data reduction to store, transfer, and analyze. However, current approaches either compress only small data well while being inefficient for large data, or handle large data but with insufficient compression. Toward effective and scalable compression/decompression of particle positions, we introduce new kinds of particle hierarchies and corresponding traversal orders that quickly reduce reconstruction error while being fast and low in memory footprint. Our solution to compression of large-scale particle data is a flexible block-based hierarchy that supports progressive, random-access, and error-driven decoding, where error estimation heuristics can be supplied by the user. For low-level node encoding, we introduce new schemes that effectively compress both uniform and densely structured particle distributions. Our proposed methods thus target all three phases of a tree-based particle compression pipeline, namely tree construction, tree traversal, and node encoding. In conclusion, the improved efficacy and flexibility of these methods over existing compressors are demonstrated through extensive experimentation, using a wide range of scientific particle datasets.

97 MATHEMATICS AND COMPUTING↗

Exploring Autoencoder-based Error-bounded Compression for Scientific Data

Error-bounded lossy compression is becoming an indispensable technique for the success of today's scientific projects with vast volumes of data produced during the simulations or instrument data acquisitions. Not only can it significantly reduce data size, but it also can control the compression errors based on user-specified error bounds. Autoencoder (AE) models have been widely used in image compression, but few AE-based compression approaches support error-bounding features, which are highly required by scientific applications. To address this issue, we explore using convolutional autoencoders to improve error-bounded lossy compression for scientific data, with the following three key contributions. (1) We provide an in-depth investigation of the characteristics of various autoencoder models and develop an error-bounded autoencoder-based framework in terms of the SZ model. (2) We optimize the compression quality for main stages in our designed AE-based error-bounded compression framework, fine-tuning the block sizes and latent sizes and also optimizing the compression efficiency of latent vectors. (3) We evaluate our proposed solution using five real-world scientific datasets and comparing them with six other related works. Experiments show that our solution exhibits a very competitive compression quality from among all the compressors in our tests. In absolute terms, it can obtain a much better compression quality (100%similar to 800% improvement in compression ratio with the same data distortion) compared with SZ2.1 and ZFP in cases with a high compression ratio.

Liu, Jinyang↗

Effects of Electrical Stimulation on hiPSC-CM Responses to Classic Ion Channel Blockers

Abstract Human induced pluripotent stem cell-derived cardiomyocytes (hiPSC-CMs) hold great potential for personalized cardiac safety prediction, particularly for that of drug-induced proarrhythmia. However, hiPSC-CMs fire spontaneously and the variable beat rates of cardiomyocytes can be a confounding factor that interferes with data interpretation. Controlling beat rates with pacing may reduce batch and assay variations, enable evaluation of rate-dependent drug effects, and facilitate the comparison of results obtained from hiPSC-CMs with those from adult human cardiomyocytes. As electrical stimulation (E-pacing) of hiPSC-CMs has not been validated with high-throughput assays, herein, we compared the responses of hiPSC-CMs exposed with classic cardiac ion channel blockers under spontaneous beating and E-pacing conditions utilizing microelectrode array technology. We found that compared with spontaneously beating hiPSC-CMs, E-pacing: (1) reduced overall assay variabilities, (2) showed limited changes of field potential duration to pacemaker channel block, (3) revealed reverse rate dependence of multiple ion channel blockers on field potential duration, and (4) eliminated the effects of sodium channel block on depolarization spike amplitude and spike slope due to a software error in acquiring depolarization spike at cardiac pacing mode. Microelectrode array optogenetic pacing and current clamp recordings at various stimulation frequencies demonstrated rate-dependent block of sodium channels in hiPSC-CMs as reported in adult cardiomyocytes. In conclusion, pacing enabled more accurate rate- and concentration-dependent drug effect evaluations. Analyzing responses of hiPSC-CMs under both spontaneously beating and rate-controlled conditions may help better assess the effects of test compounds on cardiac electrophysiology and evaluate the value of the hiPSC-CM model.

Wei, Feng↗

Blocking Simulations in GFDL GCMs for CMIP5 and CMIP6

Abstract The frequency of atmospheric blocking has been largely underestimated by general circulation models (GCMs) participating in the Coupled Model Intercomparison Project (CMIP). Errors in the onset, persistence, barotropicity, geographical preference, seasonality, intensity, and moving speed of global blocking were diagnosed in 10 Geophysical Fluid Dynamics Laboratory (GFDL) GCMs for recent CMIP5 and CMIP6 using a detection approach that combines zonal eddies and the reversal of zonal winds. The blocking frequency, similar at 500 and 250 hPa, is underestimated by 50% in the Atlantic–Europe region during December–February but is overestimated by 60% in the Pacific–North America region during that season and by 70% in the southwest Pacific during July–August. These blocking biases at 500 hPa were investigated in the five CMIP6 models that showed improvements over the CMIP5 versions. The Atlantic–Europe underestimate corresponds to lower instantaneous blocking rates, lower persistent blocking rates, and higher persistent stationary ridge rates; the number of blocks with a duration of 4–5 days is only 40%–65% of that in observations. In contrast, the overestimate consists of excessive blocks with a duration longer than 12 days in the Pacific–North America and up to twice as many 4–6-day events in the southwest Pacific. Simulated December–February blocks up to 12 days in the Pacific–North America region tend to be stronger and to move more slowly than those in observations. Diagnostic sensitivity tests indicated that the zonal mean and zonal eddy components of the mean state play a key role, as replacing each with that of observations substantially reduced many of the outstanding biases in these GCMs.

54 ENVIRONMENTAL SCIENCES↗

A Hierarchical OPF Algorithm with Improved Gradient Evaluation in Three-Phase Networks

Linear approximation commonly used in solving alternating-current optimal power flow (AC-OPF) simplifies the system models but incurs accumulated voltage errors in large power networks. Such errors will make the primal-dual type gradient algorithms converge to solutions with voltage violation. In this paper, we improve a recent hierarchical OPF algorithm that rested on primal-dual gradients evaluated with a linearized distribution power flow model. Specifically, we propose a more accurate gradient evaluation method based on an unbalanced three-phase nonlinear distribution power flow model to mitigate the errors arising from linearization. The resultant gradients feature a blocked structure that enables our development of an improved hierarchical primal-dual algorithm to solve the OPF problem. Numerical results on the IEEE 123-bus test feeder and a 4,518-node test feeder show that the proposed method can enhance voltage safety at comparable computational efficiency with the linearized algorithm.

approximation algorithms↗

Online and Offline Data Quality Monitoring for the Mu2e Calorimeter

This thesis presents the design, implementation, and validation of a calorimeter Data Quality Monitoring (DQM) toolchain for the Mu2e experiment at Fermilab. Mu2e searches for charged lepton flavor violation via coherent muon-to-electron conversion in the field of an aluminum nucleus, $\mu^- Al \rightarrow e^-Al$, a process whose observation would constitute clear evidence of physics beyond the Standard Model. Achieving target sensitivity requires stringent control of detector performance and data integrity during acquisition, as subtle issues in readout configuration, data formatting, or electronics behavior can compromise reconstruction and bias downstream analyzes. To address these challenges, this work develops a multi-layer DQM approach spanning both raw data validation and reconstructed digi-level diagnostics. At the low level, a fragment analysis component performs word- and bit-field decoding of calorimeter readout blocks, enabling sanity checks of the expected structure and producing detailed error and integrity statistics useful for commissioning and troubleshooting. At the digi level, the CaloDigiDQM analyzer is implemented within the art framework and transforms each CaloDigiCollection into a structured hierarchy of ROOT histograms designed for fast drill-down diagnostics. The module generates coherent monitoring views at global, disk, board, and channel granularity, including occupancy, waveform-derived features (baseline, RMS, peak amplitude and position), and left-right sensor consistency metrics. Detector-aware channel-to-electronics mapping is performed through the conditions system (CaloDAQMap), ensuring that diagnostics remain aligned with hardware identifiers used in operations. For end-to-end testing without reliance on live DAQ data, a synthetic CaloDigi producer is developed to generate realistic waveforms with controlled noise and pulse shapes. The resulting system supports both offline ROOT-file production and online operation, including optional histogram streaming through otsdaq via ots::HistoSender. This toolchain provides a practical and scalable foundation for calorimeter commissioning and stable data collection, enabling early detection of anomalies and reducing operational risk for Mu2e.

Vakulenko, Mark [Drew U.] (ORCID:0009000276197818)↗

A Block-Structured Adaptive Mesh Framework to Solve Radiation Transfer Equation in Irregular Embedded Geometries

Radiation transport arises in various scientific, industrial, and medical fields, and understanding its effect in applications is needed to make accurate predictions, safety assessments and performance optimizations. Solving the Radiation Transport Equation (RTE) is challenging due to its integro-differential nature, which involves both differential and integral terms. The differential term describes the change in radiation intensity due to absorption and emission, while the integral term accounts for scattering. The accurate modeling of radiation is further complicated in many applications due to the complex, irregular geometries. Various methods exist for solving the RTE, including the zonal, Monte Carlo, spherical harmonics, discrete ordinates, and finite volume methods. Traditional mesh-based approaches, which rely on structured or unstructured meshes, struggle with irregular geometries due to: a) the difficulty of conforming structured grids to irregular domains, b) challenges in enforcing boundary conditions correctly, and c) the additional computational cost of unstructured mesh methods. This work presents a second-order accurate method for solving the RTE in irregular geometries. The radiation intensity is discretized using the finite-volume method in both spatial and angular directions on regular Cartesian grid blocks. Leveraging the block-structured adaptive mesh refinement (AMR) framework provided by AMReX, our method refines the grid locally to reduce spatial discretization error, ensuring a converged numerical solution while minimizing computational costs elsewhere. A two-stage deferred correction approach is employed: First, a first-order discretization on grid blocks is solved using an algebraic multigrid method in HYPRE. Second, a correction term is applied explicitly to achieve second-order accuracy. The correction term is calculated by approximating the radiation flux on cell faces using a Total Variation Diminishing (TVD) scheme. This approach ensures quick convergence of the multigrid method while preserving higher-order accuracy of the numerical solution. Irregular geometries are resolved as embedded boundaries (EB), resulting in both cut cells and regular cells. In cut cells, we modify the fluxes using face fractions and incorporate additional contributions from EB boundary conditions. To ensure higher-order convergence near the EB interface, the correction term is modified by interpolating the radiation intensity to fictitious ghost points. The implementation takes advantage of modern supercomputers by leveraging AMReX’sMPI/X parallelization strategy where X can be MPI or a GPU accelerator including CUDA, HIP and DPC++. We validate our solver using classical test cases, both with and without EB, demonstrating accuracy and efficiency. Additionally, we analyze the impact of adaptive mesh refinement on solution accuracy and computational cost, highlighting the advantages of our approach for high-resolution radiation transport simulations.

computational fluid dynamics (CFD)↗

A Fast Algebraic Multigrid Solver and Accurate Discretization for Highly Anisotropic Heat Flux I: Open Field Lines

We present a novel solver technique for the anisotropic heat flux equation, aimed at the high level of anisotropy seen in magnetic confinement fusion plasmas. Such problems pose two major challenges: (i) discretization accuracy and (ii) efficient implicit linear solvers. We simultaneously address each of these challenges by constructing a new finite element discretization with excellent accuracy properties, tailored to a novel solver approach based on algebraic multigrid (AMG) methods designed for advective operators. We pose the problem in a mixed formulation, introducing the directional temperature gradient as an auxiliary variable. The temperature and auxiliary fields are discretized in a scalar discontinuous Galerkin space with upwinding principles used for discretizations of advection. We demonstrate the proposed discretization’s superior accuracy over other discretizations of anisotropic heat flux, achieving error 1000x smaller for anisotropy ratio of 10 9 , for closed field lines. The block matrix system is reordered and solved in an approach where the two advection operators are inverted using AMG solvers based on approximate ideal restriction, which is particularly efficient for upwind discontinuous Galerkin discretizations of advection. To ensure that the advection operators are nonsingular, in this paper we restrict ourselves to considering open (acyclic) magnetic field lines for the linear solvers. We demonstrate fast convergence of the proposed iterative solver in highly anisotropic regimes where other diffusion-based AMG methods fail.

97 MATHEMATICS AND COMPUTING↗

Solid State Transformer Controls for Mitigation of E3a High-Altitude Electromagnetic Pulse Insults

This paper explores the use of a solid state transformer (SST) to mitigate the 𝐸 3𝐴 component of a high-altitude electromagnetic pulse (HEMP) insult using external energy storage optimal control techniques. In lieu of conventional passive blocking devices or feedback-controlled energy storage devices, a novel implementation of Hamiltonian error tracking is utilized to develop a feedback control law for the variable converter ratio in an SST. The findings of the simulations performed in this paper suggest that additional energy storage is not necessary to protect an individual load from a HEMP insult. The simulations performed examine the response of a single-phase SST connected to a single voltage source on a long transmission line on the one side and a single linear resistor on the other. The control law is specifically developed for the late-time, low-frequency portion of a HEMP insult, namely the 𝐸 3𝐴 components. The Hamiltonian error-based converter ratio control law is compared with nonlinear optimal feedforward controls to show that the HSSPFC is an external energy storage optimal controller.

HEMP mitigation↗

Fault-tolerant operation and materials science with neutral atom logical qubits

We report on the fault-tolerant operation of logical qubits on a neutral atom quantum computer, with logical performance surpassing physical performance for multiple circuits including Bell state preparation (12x error reduction), random circuits (15x), and a prototype Anderson Impurity Model ground state solver for materials science applications (up to 6x, non-fault-tolerantly). The logical qubits are implemented via the [[4, 2, 2]] code (C 4 ). Our work constitutes the first complete realization of the benchmarking protocol proposed by Gottesman 2016 demonstrating results consistent with fault tolerance. In light of recent advances on applying concatenated C 4 /C 6 detection codes to achieve error correction with high code rates and thresholds, our work can be regarded as a building block towards a practical scheme for fault tolerant quantum computation. Our demonstration of a materials science application with logical qubits particularly demonstrates the immediate value of these techniques on current experiments.

36 MATERIALS SCIENCE↗

Extension of frozen natural orbital approximation to open-shell references: Theory, implementation, and application to single-molecule magnets

Natural orbitals are often used to achieve a more compact representation of correlated wave-functions. Using natural orbitals computed as eigenstates of the virtual–virtual block of the state density matrix instead of the canonical Hartree–Fock orbitals results in smaller errors when the same fraction of virtual space is frozen. This strategy, termed frozen natural orbital (FNO) approach, is effective in reducing the cost of regular coupled-cluster (CC) calculations and some multistate methods, such as EOM-IP-CC (equation-of-motion CC for ionization potentials). This contribution extends the FNO approach to the EOM-SF-CC ansatz (EOM-CC with spin-flip). In contrast to EOM-IP-CCSD, EOM-SF-CCSD relies on high-spin open-shell references. Using FNOs computed for an open-shell reference leads to an erratic behavior of the EOM-SF-CC energies and properties due to an inconsistent truncation of the α and β orbital spaces. A general solution to problems arising in the EOM-CC calculations utilizing open-shell references, termed OSFNO (open-shell FNO), is proposed. Furthermore, by means of singular value decomposition (SVD) of the overlap matrix of the α and β orbitals, the OSFNO algorithm identifies the corresponding orbitals and determines virtual orbitals corresponding to the singly occupied space. This is followed by SVD of the singlet part of the state density matrix in the remaining virtual orbital subspace. The so-computed FNOs preserve the spin purity of the open-shell orbital subspace to the extent allowed by the original reference, thus facilitating a safe truncation of the virtual space. The performance of OSFNO is benchmarked for selected diradicals and triradicals.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

tih_vqe [SWR-23-32]

This software supports the paper, "Exploring the scaling limitations of the variational quantum eigensolver with the bond dissociation of hydride diatomic molecules," published in the International Journal of Quantum Chemistry, whose abstract is as follows: Materials simulations involving strongly correlated electrons pose fundamental challenges to state-of-the-art electronic structure methods but are hypothesized to be the ideal use case for quantum computing. To date, no quantum computer has simulated a molecule of a size and complexity relevant to real-world applications, despite the fact that the variational quantum eigensolver (VQE) algorithm can predict chemically accurate total energies. Nevertheless, because of the many applications of moderately-sized, strongly correlated systems, such as molecular catalysts, the successful use of the VQE stands as an important waypoint in the advancement toward useful chemical modeling on near-term quantum processors. In this paper, we take a significant step in this direction. We lay out the steps, write, and run parallel code for an (emulated) quantum computer to compute the bond dissociation curves of the TiH, LiH, NaH, and KH diatomic hydride molecules using VQE. TiH was chosen as a relatively simple chemical system that incorporates d orbitals and strong electron correlation. Because current VQE implementations on existing quantum hardware are limited by qubit error rates, the number of qubits available, and the allowable gate depth, recent studies have focused on chemical systems involving s and p block elements. Through VQE + UCCSD calculations of TiH, we evaluate the near-term feasibility of modeling a molecule with d-orbitals on real quantum hardware. We demonstrate that the inclusion of d-orbitals and the use of the UCCSD ansatz, which are both necessary to capture the correct TiH physics, dramatically increase the cost of this problem. We estimate the approximate error rates necessary to model TiH on current quantum computing hardware using VQE+UCCSD and show them to likely be prohibitive until significant improvements in hardware and error correction algorithms are available.

Graf, Peter↗

Towards a wavefront-preservation X-ray crystal monochromator for high-repetition-rate FELs

The wavefront preservation of coherent X-ray free-electron laser beams is pushing the requirement on the quality and performance of X-ray optics to an unprecedented level. The Strehl ratio can be used to quantify this requirement. In this paper, the criteria for thermal deformation of the X-ray optics are formulated, especially for crystal monochromators. To preserve the X-ray wavefront, the standard deviation of the height error should be sub-nm for mirrors and less than 25 pm for crystal monochromators. Cryocooled silicon crystals combined with two techniques can be used to achieve this level of performance for monochromator crystals: (1) using a focusing element to compensate the second-order component of the thermal deformation; (2) introducing a cooling pad between the cooling block and silicon crystal and optimizing the effective cooling temperature. Each of these techniques allows the thermal deformation in standard deviation of the height error to be reduced by an order of magnitude. As an example, for the LCLS-II-HE Dynamic X-ray Scattering instrument, the criteria on thermal deformation of a high-heat-load monochromator crystal can be achieved for a 100 W SASE FEL beam. Wavefront propagation simulations confirm that the reflected beam intensity profile is satisfactory on both the peak power density and focused beam size.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗