SEARCH · Engineering Papers
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.
A bound is derived and analyzed for the bit error rate (BER) of a Viterbi decoder with survivor truncation. Estimates of the SNR (signal-to-noise ratio) loss on the AWGN (additive white Gaussian noise) channel due to truncation are obtained for convolutional codes. Larger truncation lengths are required than the smallest value that does not effectively decrease the code's free distance, especially at low Eb/N0.
Accurate and timely predictions of airline pushbacks can potentially lead to improved performance of automated decision-support tools for airport surface traffic, thus reducing the variability and average duration of costly airline delays. One factor which affects the realization of these benefits is the level of uncertainty inherent in the turn processes. To characterize this inherent uncertainty, three techniques are developed for predicting time-to-go until pushback as a function of available ground-time; elapsed ground-time; and the status (not-started/in-progress/completed) of individual turn processes (cleaning, fueling, etc.). These techniques are tested against a large and detailed dataset covering approximately l0(exp 4) real-world turn operations obtained through collaboration with Deutsche Lufthansa AG. Even after the dataset is filtered to obtain a sample of turn operations with minimal uncertainty, the standard deviation of forecast error for all three techniques is lower-bounded away from zero, indicating that turn operations have a significant stochastic component. This lower-bound result shows that decision-support tools must be designed to incorporate robust mechanisms for coping with pushback demand stochasticity, rather than treating the pushback demand process as a known deterministic input.
In this paper, upper bounds to the average maximum-likelihood bit error probability of serially concatenated coding schemes are derived, design guidelines for the outer and inner codes that maximize the interleaver gain are presented, and finally, a highly-performing iterative decoding algorithm is proposed.
This study presents a multilevel convergence framework for multigrid-reduction-in-time (MGRIT) as a generalization of previous two-grid estimates. The framework provides a priori upper bounds on the convergence of MGRIT V- and F-cycles, with different relaxation schemes, by deriving the respective residual and error propagation operators. The residual and error operators are functions of the time-stepping operator, analyzed directly and bounded in the norm, both numerically and analytically. We present various upper bounds of different computational cost and varying sharpness. These upper bounds are complemented by proposing analytic formulae for the approximate convergence factor of V-cycle algorithms that take the number of fine grid time points, the temporal coarsening factors, and the eigenvalues of the time-stepping operator as parameters. The paper concludes with supporting numerical investigations of parabolic (anisotropic diffusion) and hyperbolic (wave equation) model problems. We assess the sharpness of the bounds and the quality of the approximate convergence factors. Observations from these numerical investigations demonstrate the value of the proposed multilevel convergence framework for estimating MGRIT convergence a priori and for the design of a convergent algorithm. We further highlight that observations in the literature are captured by the theory, including that two-level Parareal and multilevel MGRIT with F-relaxation do not yield scalable algorithms and the benefit of a stronger relaxation scheme. An important observation is that with increasing numbers of levels MGRIT convergence deteriorates for the hyperbolic model problem, while constant convergence factors can be achieved for the diffusion equation. The theory also indicates that L-stable Runge--Kutta schemes are more amendable to multilevel parallel-in-time integration with MGRIT than A-stable Runge--Kutta schemes.
This paper deals with correction of shape distortion due to zero-mean normally distributed errors in structural sizes. The concept of ideal actuators - actuators that can produce any desired displacement field - is introduced. Using this concept, a bound on the possible improvement in the expected value of the root-mean-square shape error is obtained. The shape correction associated with the ideal actuators is also characterized. An actuator effectiveness index is developed by comparing the displacement field generated by the actuator to the ideal. The results are specialized to a simple form for truss structures composed of nominally identical members. The bound and effectiveness index are tested on a 55-m radiometer antenna truss structure. It is found that previously obtained results for optimum actuators had a performance close to the bound obtained here. Also, it is found that large numbers of actuators are needed for large reductions in shape errors. Furthermore, the actuators associated with the optimum design are shown to have high effectiveness indices. Since only a small fraction of truss elements tend to have high effectiveness indices, the use of the effectiveness index can greatly reduce the number of truss members that need to be considered actuator sites.
We present a Neumann-subproblem a posteriori finite element procedure for the efficient and accurate calculation of rigorous, 'constant-free' upper and lower bounds for sensitivity derivatives of functionals of the solutions of partial differential equations. The design motivation for sensitivity derivative error control is discussed; the a posteriori finite element procedure is described; the asymptotic bounding properties and computational complexity of the method are summarized; and illustrative numerical results are presented.
Accurate day-ahead load forecasting is essential for reliable power system operations and market efficiency. System operators such as the Midcontinent Independent System Operator (MISO) rely on forecasts from multiple vendors, yet combining them effectively remains a persistent challenge due to vendor-specific biases. This paper presents a novel LSTM-Attention Fusion Network with Error Representation (LAF-Net) that enhances day-ahead hourly load forecasting through deep residual learning and multi-modal cross-attention. The proposed model builds a historical error memory from past vendor performance and dynamically queries it with future hour context to generate adaptive, hour-specific trust weights for each vendor. A bounded residual correction further refines forecasts by mitigating systematic and temporally localized errors. Tested on real MISO LBA data with multi-vendor forecasts, LAF-Net consistently outperforms the best vendor baseline across all 38 LBAs, achieving more than a 40% reduction in system-level mean absolute error (MAE) during peak load hours relative to the best vendor baseline.
Learning to integrate non-linear equations from highly resolved direct numerical simulations has seen recent interest for reducing the computational load for fluid simulations. Here, we focus on determining a flux-limiter for shock capturing methods. Focusing on flux limiters provides a specific plug-and-play component for existing numerical methods. Since their introduction, an array of flux limiters has been designed. Using the coarse-grained Burgers' equation, we show that flux-limiters may be rank-ordered in terms of their log-error relative to high-resolution data. We then develop a theory to find an optimal flux-limiter and present flux-limiters that outperform others tested for integrating Burgers' equation on lattices with [Formula: see text], and 2x, 3x, 4x, and 8x coarse-grainings. We train a continuous piecewise linear limiter by minimizing the mean-squared misfit to six-grid point segments of high-resolution data, averaged over all segments. While flux limiters are generally designed to have an output of φ(r) = 1 at a flux ratio of r = 1, our limiters are not bound by this rule and yet produce a smaller error than standard limiters. Here we find that our machine learned limiters have distinctive features that may provide new rules-of-thumb for the development of improved limiters. Additionally, we use our theory to learn flux-limiters that outperform standard limiters across a range of values (as opposed to at a specific fixed value) of coarse-graining, number of discretized bins, and diffusion parameter. This demonstrates the ability to produce flux limiters that should be more broadly useful than standard limiters for general applications.
Nowcasts, or near-real-time (NRT) forecasts, of soil moisture based on the Soil Moisture Active and Passive (SMAP) mission could provide substantial value for a range of applications including hazards monitoring and agricultural planning. To provide such a NRT forecast with high fidelity, we enhanced a time series deep learning architecture, long short-term memory (LSTM), with a novel data integration (DI) kernel to assimilate the most recent SMAP observations as soon as they become available. The kernel is adaptive in that it can accommodate irregular observational schedules. Testing over the CONUS, this NRT forecast product showcases predictions with unprecedented accuracy when evaluated against subsequent SMAP retrievals. It showed smaller error than NRT forecasts reported in the literature, especially at longer forecast latency. The comparative advantage was due to LSTM’s structural improvements, as well as its ability to utilize more input variables and more training data. The DI-LSTM was compared to the original LSTM model that runs without data integration, referred to as the projection model here. We found that the DI procedure removed the autocorrelated effects of forcing errors and errors due to processes not represented in the inputs, for example, irrigation and floodplain/lake inundation, as well as mismatches due to unseen forcing conditions. The effects of this purely data-driven DI kernel are discussed for the first time in the geosciences. Furthermore, this work presents an upper-bound estimate for the random component of the SMAP retrieval error.
The Wide Area Augmentation System (WAAS), an augmentation of the Global Positioning System (GPS), provides safe and reliable use of GPS signals for airline navigation over much of North America. Currently the largest source of positioning error in the system is signal delay caused by the ionosphere. To allow the user to take account of such error, WAAS computes and broadcasts ionospheric vertical delays at a set of regularly-spaced grid points. In addition, WAAS computes and broadcasts a safety-critical integrity bound at each ionospheric grid point (IGP) called the Grid Ionospheric Vertical Error (GIVE). GIVEs are constructed to be sufficiently large to protect the user against positioning error due to the presence of ionospheric irregularity. In the initial operating capability (IOC) of WAAS, the vertical delay estimate at each IGP is determined from a planar fit of neighboring slant delay measurements, projected to vertical using an obliquity factor specified by the standard thin-shell model of the ionosphere. In WAAS Follow-On (WFO) Release 3, however, the vertical delay will be estimated by an established, geo-statistical technique known as kriging. Compared to the planar fit model, the kriging model is found, in general, to match better the observed random structure of the vertical delay. This paper presents the kriging methodology that will be used to estimate the vertical delay and its uncertainty at each IGP, and it assesses the subsequent improvement in WAAS availability enabled by kriging.
Popular HPC network interconnection simulators such as SST Macro provide a variety of configurable parameters to explore the design space of hardware components such as network links and switches. While such knobs provide flexibility to explore design trade-offs for novel hardware, manually configuring simulations for existing hardware to focus on topology exploration can be cumbersome and error-prone, leading to widely inaccurate simulations. This challenge is compounded when specifications of various (proprietary) technologies are not readily available or are intentionally omitted. In this work, we provide a methodology to automatically tune the simulation configuration of the multiple network models running within SST Macro using Bayesian optimization. We perform this optimization in the context of multiple messaging regimes (i.e., small to large and latency to bandwidth-bound messages) and provide a detailed analysis of the simulation error for four systems. With our automated framework, we achieve a 5x improvement in accuracy over best-effort configurations based on available hardware specifications.
Popular HPC network interconnection simulators such as SST/macro provide a variety of configurable parameters to explore the design space of hardware components such as network interface cards (NIC), switches, and links among them. While such knobs provide flexibility to explore design trade-offs for novel hardware, manually configuring simulations for matching configurations of the existing hardware to focus on topology exploration can be cumbersome and error-prone, leading to widely inaccurate simulations. This challenge is compounded when specifications of various (proprietary) technologies are not readily available or intentionally omitted. In this work, we propose a framework to autotune the multiple network models’ simulation configurations within SST/macro using Tree-structured Parzen Estimator-based Bayesian optimization to observe the effect on simulation accuracy across different message regimes. These regimes consist of small to large message sizes and latency to bandwidth-bound messages. We provide a detailed analysis of the simulation error for four representative HPC systems. Our Bayesian optimization based autotuning framework for network models achieves a maximum of 5x improvement in accuracy over best-effort manual configurations based on available hardware specifications.
In the original version, the bounds given in Eqs. (87a) and (87b) on the contribution to the early-time optical depth, (15,30), contained a numerical error in deriving the 95th percentile from the Monte Carlo samples. The corrected 95% upper bounds are: τ(15,30) < 0:018 (lowE, flat τ(15, 30), FlexKnot), (1) τ(15, 30) < 0:023 (lowE, flat knot, FlexKnot): (2) These bounds are a factor of 3 larger than the originally reported results. Consequently, the new bounds do not significantly improve upon previous results from Planck data presented in Millea & Bouchet (2018) as was stated, but are instead comparable. Equations (1) and (2) give results that are now similar to those of Heinrich & Hu (2021), who used the same Planck 2018 data to derive a 95% upper bound of 0.020 using the principal component analysis (PCA) model and uniform priors on the PCA mode amplitudes.
Mathematical filter scheme for bounding cross correlation between random forcing function and state error in orbital navigation system
Backward error analyses of the application of Householder transformations to both the standard and the generalized eigenvalue problems are presented. The analysis for the standard eigenvalue problem determines the error from the application of an exact similarity transformation, and the analysis for the generalized eigenvalue problem determines the error from the application of an exact equivalence transformation. Bounds for the norms of the resulting perturbation matrices are presented and compared with existing bounds when known.
New good (K, 1/N) convolutional codes for 8 or = to K or = to 13 and 2 or = to N or = to 8 were found and tabulated which require minimum signal-to-noise ratio (SNR) for given desired bit error rates (BER) with Viterbi decoding. The transfer function bound was used for the BER evaluations. These low-rate codes are expected to have a number of applications, especially for systems having large bandwidth-bit time products such as deep space and spread spectrum communication systems.
New good (K, 1/N) convolutional codes for 8 or = to K or = to 13 and 2 or = to N or = to 8 were found and tabulated which require minimum signal-to-noise ratio (SNR) for given desired bit error rates (BER) with Viterbi decoding. The transfer function bound was used for the BER evaluations. These low-rate codes are expected to have a number of applications, especially for systems having large bandwidth-bit time products such as deep space and spread spectrum communication systems.
A low complexity, open-loop, discrete-time, delay-multiply-average (DMA) technique for estimating the frequency offset for digitally modulated MPSK signals is investigated. A nonlinearity is used to remove the MPSK modulation and generate the carrier component to be extracted. Theoretical and simulated performance results are presented and compared to the Cramer-Rao lower bound (CRLB) for the variance of the frequency estimation error. For all signal-to-noise ratios (SNR's) above threshold, it is shown that the CRLB can essentially be achieved with linear complexity.