Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Linearization error”

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

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

At least 127 records · Page 7

SU-G-TeP4-08: Automating the Verification of Patient Treatment Parameters

Purpose: To automate the daily verification of each patient’s treatment by utilizing the trajectory log files (TLs) written by the Varian TrueBeam linear accelerator while reducing the number of false positives including jaw and gantry positioning errors, that are displayed in the Treatment History tab of Varian’s Chart QA module. Methods: Small deviations in treatment parameters are difficult to detect in weekly chart checks, but may be significant in reducing delivery errors, and would be critical if detected daily. Software was developed in house to read TLs. Multiple functions were implemented within the software that allow it to operate via a GUI to analyze TLs, or as a script to run on a regular basis. In order to determine tolerance levels for the scripted analysis, 15,241 TLs from seven TrueBeams were analyzed. The maximum error of each axis for each TL was written to a CSV file and statistically analyzed to determine the tolerance for each axis accessible in the TLs to flag for manual review. The software/scripts developed were tested by varying the tolerance values to ensure veracity. After tolerances were determined, multiple weeks of manual chart checks were performed simultaneously with the automated analysis to ensure validity. Results: The tolerance values for the major axis were determined to be, 0.025 degrees for the collimator, 1.0 degree for the gantry, 0.002cm for the y-jaws, 0.01cm for the x-jaws, and 0.5MU for the MU. The automated verification of treatment parameters has been in clinical use for 4 months. During that time, no errors in machine delivery of the patient treatments were found. Conclusion: The process detailed here is a viable and effective alternative to manually checking treatment parameters during weekly chart checks.

60 APPLIED LIFE SCIENCES↗

Control by model error estimation

Modern control theory relies upon the fidelity of the mathematical model of the system. Truncated modes, external disturbances, and parameter errors in linear system models are corrected by augmenting to the original system of equations an 'error system' which is designed to approximate the effects of such model errors. A Chebyshev error system is developed for application to the Large Space Telescope (LST).

Likins, P. W.↗

Error-based adaptive non-linear control and regions of feasibility

The nonlinear adaptive algorithm of Kanellakopoulos et al. (1991) was modified to produce an error-based algorithm. This permits global stabilizability for a large subset of pure-feedback nonlinear systems. The algorithm was demonstrated on the single-input stabilization problem, but extends easily to the multiple input tracking problems.

Teel, Andrew R.↗

Minimum entropy filtering for a single output non-Gaussian stochastic system using state transformation

This paper presents a novel filter design for the single-output stochastic non-linear systems subjected to non-Gaussian noises and the proposed assumptions. Based on a state transformation, the unmeasurable states of the systems can be estimated where non-linear terms in the systems have been eliminated. It has been shown that the estimation error is linearly dynamical regarding to the presented vector-valued filter gain which can be optimised by minimising the entropy-based performance criterion. In addition, the convergence of the presented algorithm is analysed in mean-square sense and a numerical example is given to verify the effectiveness of the presented filtering algorithm. Meanwhile, the extended Kalman filter, unscented particle filter and minimum entropy filter are given for the comparisons of the filtering performance. Following the presented framework, some extensions of the presented filtering algorithm are discussed to indicate the flexibility of the filter design. The contribution of this paper can be summarised as establishing a novel minimum entropy filtering framework which consists of model transformation, entropy optimisation and convergence analysis.

42 ENGINEERING↗

Artificial neural network implementation of a near-ideal error prediction controller

A theory has been developed at the University of Virginia which explains the effects of including an ideal predictor in the forward loop of a linear error-sampled system. It has been shown that the presence of this ideal predictor tends to stabilize the class of systems considered. A prediction controller is merely a system which anticipates a signal or part of a signal before it actually occurs. It is understood that an exact prediction controller is physically unrealizable. However, in systems where the input tends to be repetitive or limited, (i.e., not random) near ideal prediction is possible. In order for the controller to act as a stability compensator, the predictor must be designed in a way that allows it to learn the expected error response of the system. In this way, an unstable system will become stable by including the predicted error in the system transfer function. Previous and current prediction controller include pattern recognition developments and fast-time simulation which are applicable to the analysis of linear sampled data type systems. The use of pattern recognition techniques, along with a template matching scheme, has been proposed as one realizable type of near-ideal prediction. Since many, if not most, systems are repeatedly subjected to similar inputs, it was proposed that an adaptive mechanism be used to 'learn' the correct predicted error response. Once the system has learned the response of all the expected inputs, it is necessary only to recognize the type of input with a template matching mechanism and then to use the correct predicted error to drive the system. Suggested here is an alternate approach to the realization of a near-ideal error prediction controller, one designed using Neural Networks. Neural Networks are good at recognizing patterns such as system responses, and the back-propagation architecture makes use of a template matching scheme. In using this type of error prediction, it is assumed that the system error responses be known for a particular input and modeled plant. These responses are used in the error prediction controller. An analysis was done on the general dynamic behavior that results from including a digital error predictor in a control loop and these were compared to those including the near-ideal Neural Network error predictor. This analysis was done for a second and third order system.

Mcvey, Eugene S.↗

Bit Error Probability for Maximum Likelihood Decoding of Linear Block Codes

In this paper, the bit error probability P(sub b) for maximum likelihood decoding of binary linear codes is investigated. The contribution of each information bit to P(sub b) is considered. For randomly generated codes, it is shown that the conventional approximation at high SNR P(sub b) is approximately equal to (d(sub H)/N)P(sub s), where P(sub s) represents the block error probability, holds for systematic encoding only. Also systematic encoding provides the minimum P(sub b) when the inverse mapping corresponding to the generator matrix of the code is used to retrieve the information sequence. The bit error performances corresponding to other generator matrix forms are also evaluated. Although derived for codes with a generator matrix randomly generated, these results are shown to provide good approximations for codes used in practice. Finally, for decoding methods which require a generator matrix with a particular structure such as trellis decoding or algebraic-based soft decision decoding, equivalent schemes that reduce the bit error probability are discussed.

Lin, Shu↗

Interpolation of a surface from sets of discrete height data of different statistical characteristics

This paper presents and analyzes a method for the interpolation of a unique surface from two sets of independent digital height data of differing statistical characteristics. This method is based on linear prediction and thus relies on the concepts of auto- and cross-covariance functions. The linear prediction algorithm for two sets of digital height measurements is first derived and then evaluated using the method of moving averages and bilinear interpolation for comparison. It is found that the overall root mean square interpolation errors of linear prediction are similar to those from moving averages and bilinear interpolation. This accuracy performance, together with the well known potential for controlled filtering of measuring errors and good-behavior in areas of poor control, makes linear prediction a versatile and general method for interpolating a unique surface from two sets of digital height data, with applications in photogrammetric mapping, remote sensing, and other fields.

Leberl, F.↗

Algorithms for isolating worst case systematic data errors

Two separate algorithms are derived for testing filter sensitivity to systematic data errors. One algorithm provides the absolute minimum Euclidean norm data error for a given estimate component error. The second algorithm can be used to find the minimum norm data error which can be generated by restricted degree Legendre polynomials. A specific very long baseline interferometry (VLBI) baseline estimation is analyzed with the algorithm. It is found that the local vertical is the most sensitive component to error in the data space. The efficiency of a data error sequence linear in elevation angle is within 7% that of the absolute worst case sequence. Elevation angle dependent errors are explored and the special case of a mismodeled troposphere is treated.

Curkendall, D. W.↗

CDGPS-Based Relative Navigation for Multiple Spacecraft

This thesis investigates the use of Carrier-phase Differential GPS (CDGPS) in relative navigation filters for formation flying spacecraft. This work analyzes the relationship between the Extended Kalman Filter (EKF) design parameters and the resulting estimation accuracies, and in particular, the effect of the process and measurement noises on the semimajor axis error. This analysis clearly demonstrates that CDGPS-based relative navigation Kalman filters yield good estimation performance without satisfying the strong correlation property that previous work had associated with "good" navigation filters. Several examples are presented to show that the Kalman filter can be forced to create solutions with stronger correlations, but these always result in larger semimajor axis errors. These linear and nonlinear simulations also demonstrated the crucial role of the process noise in determining the semimajor axis knowledge. More sophisticated nonlinear models were included to reduce the propagation error in the estimator, but for long time steps and large separations, the EKF, which only uses a linearized covariance propagation, yielded very poor performance. In contrast, the CDGPS-based Unscented Kalman relative navigation Filter (UKF) handled the dynamic and measurement nonlinearities much better and yielded far superior performance than the EKF. The UKF produced good estimates for scenarios with long baselines and time steps for which the EKF would diverge rapidly. A hardware-in-the-loop testbed that is compatible with the Spirent Simulator at NASA GSFC was developed to provide a very flexible and robust capability for demonstrating CDGPS technologies in closed-loop. This extended previous work to implement the decentralized relative navigation algorithms in real time.

Mitchell, Megan Leigh↗

Estimation of Errors Associated With Use of Linear-Quadratic Formalism for Evaluation of Biologic Equivalence Between Single and Hypofractionated Radiation Doses: An In Vitro Study

Purpose: To investigate the reliability of the linear-quadratic (LQ) formalism and the magnitude of errors associated with its use in assessing biologic equivalence between single, high radiation doses and hypofractionated radiation doses. Methods and Materials: V79 and EMT6 single cells received single doses of 2-12 Gy or two or three fractions of 4 or 5 Gy, each at 4-h intervals. Single and fractionated doses to actually reduce the cell survival to the same level were determined by a colony assay. The {alpha}/{beta} ratio was obtained from the cell survival curves. Using the {alpha}/{beta} ratio and the LQ formalism, equivalent single doses for the hypofractionated doses were calculated. They were then compared with the actually determined equivalent single doses for the hypofractionated doses. The V79 spheroids received single doses of 5-26 Gy or two to five fractions of 5-12 Gy at 2 or 4-h interval, and then were assayed for cell survival. Next, equivalent single doses for the hypofractionated doses were determined, as were done for the single cells. Results: The {alpha}/{beta} ratio was 5.1 Gy for the V79 single cells and 0.36 Gy for EMT6. In V79, the equivalent single doses for the hypofractionated doses calculated using the LQ formalism were 12-19% lower than the actually measured biologically equivalent single doses. In the EMT6 cells, this trend was also seen, but the differences were not significant. In the V79 spheroids, the calculated doses were 18-30% lower than the measured doses. Conclusion: Conversion of hypofractionated radiation doses to single doses using the LQ formalism could underestimate the effect of hypofractionated radiation by {<=}30%.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Error statistics and scalability of quantum error mitigation formulas

Quantum computing promises advantages over classical computing in many problems. Nevertheless, noise in quantum devices prevents most quantum algorithms from achieving the quantum advantage. Quantum error mitigation provides a variety of protocols to handle such noise using minimal qubit resources. While some of those protocols have been implemented in experiments for a few qubits, it remains unclear whether error mitigation will be effective in quantum circuits with tens to hundreds of qubits. In this paper, we apply statistics principles to quantum error mitigation and analyse the scaling behaviour of its intrinsic error. We find that the error increases linearly O(ϵN) with the gate number N before mitigation and sublinearly O(ϵ'N γ ) after mitigation, where γ ≈ 0.5, ϵ is the error rate of a quantum gate, and ϵ' is a protocol-dependent factor. The $\sqrt{N}$ scaling is a consequence of the law of large numbers, and it indicates that error mitigation can suppress the error by a larger factor in larger circuits. We propose the importance Clifford sampling as a key technique for error mitigation in large circuits to obtain this result.

97 MATHEMATICS AND COMPUTING↗

SU-E-J-145: Geometric Uncertainty in CBCT Extrapolation for Head and Neck Adaptive Radiotherapy

Purpose: One primary limitation of using CBCT images for H'N adaptive radiotherapy (ART) is the limited field of view (FOV) range. We propose a method to extrapolate the CBCT by using a deformed planning CT for the dose of the day calculations. The aim was to estimate the geometric uncertainty of our extrapolation method. Methods: Ten H'N patients, each with a planning CT (CT1) and a subsequent CT (CT2) taken, were selected. Furthermore, a small FOV CBCT (CT2short) was synthetically created by cropping CT2 to the size of a CBCT image. Then, an extrapolated CBCT (CBCTextrp) was generated by deformably registering CT1 to CT2short and resampling with a wider FOV (42mm more from the CT2short borders), where CT1 is deformed through translation, rigid, affine, and b-spline transformations in order. The geometric error is measured as the distance map ||DVF|| produced by a deformable registration between CBCTextrp and CT2. Mean errors were calculated as a function of the distance away from the CBCT borders. The quality of all the registrations was visually verified. Results: Results were collected based on the average numbers from 10 patients. The extrapolation error increased linearly as a function of the distance (at a rate of 0.7mm per 1 cm) away from the CBCT borders in the S/I direction. The errors (μ±σ) at the superior and inferior boarders were 0.8 ± 0.5mm and 3.0 ± 1.5mm respectively, and increased to 2.7 ± 2.2mm and 5.9 ± 1.9mm at 4.2cm away. The mean error within CBCT borders was 1.16 ± 0.54mm . The overall errors within 4.2cm error expansion were 2.0 ± 1.2mm (sup) and 4.5 ± 1.6mm (inf). Conclusion: The overall error in inf direction is larger due to more large unpredictable deformations in the chest. The error introduced by extrapolation is plan dependent. The mean error in the expanded region can be large, and must be considered during implementation. This work is supported in part by Varian Medical Systems, Palo Alto, CA.

60 APPLIED LIFE SCIENCES↗

Transmission errors and bearing contact of spur, helical and spiral bevel gears

An investigation of transmission errors and bearing contact of spur, helical and spiral bevel gears was performed. Modified tooth surfaces for these gears have been proposed in order to absorb linear transmission errors caused by gear misalignment and to localize the bearing contact. Numerical examples for spur, helical, and spiral bevel gears are presented to illustrate the behavior of the modified gear surfaces with respect to misalignment and errors of assembly. The numerical results indicate that the modified surfaces will perform with a low level of transmission error in non-ideal operating environments.

F. L. Litvin↗

One-dimensional single-mode fiber-optic displacement sensors for submillimeter measurements

We demonstrate the working principle of a one-dimensional intensity-based fiber-optic displacement sensor. The sensor consists of one receiving fiber, which is moved laterally in the optical field emitted by an emitting fiber. It is shown numerically that the sensor response is highly linear (nonlinearity error of 0.1 to 2%) for a wide range of travel (2.24 to 860 {mu}m). The sensor response is also simulated experimentally using a highly precise robot, the results of which correspond very closely to numerical ones. Linearity, travel, and sensitivity are experimentally determined for different gaps between the emitting and the receiving fibers (10 {mu}m to 10 mm). A design chart that includes the nonlinearity error (0.5% to 2%), the travel (2.78 to 860 {mu}m), the sensitivity (0.032 to 0.37 dB/{mu}m), and the gap distance (1 to 10 mm) is finally proposed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Learning Quantum States and Unitaries of Bounded Gate Complexity

While quantum state tomography is notoriously hard, most states hold little interest to practically minded tomographers. Given that states and unitaries appearing in nature are of bounded gate complexity, it is natural to ask if efficient learning becomes possible. In this work, we prove that to learn a state generated by a quantum circuit with G two-qubit gates to a small trace distance, a sample complexity scaling linearly in G is necessary and sufficient. We also prove that the optimal query complexity to learn a unitary generated by G gates to a small average-case error scales linearly in G . While sample-efficient learning can be achieved, we show that under reasonable cryptographic conjectures, the computational complexity for learning states and unitaries of gate complexity G must scale exponentially in G . We illustrate how these results establish fundamental limitations on the expressivity of quantum machine-learning models and provide new perspectives on no-free-lunch theorems in unitary learning. Together, our results answer how the complexity of learning quantum states and unitaries relate to the complexity of creating these states and unitaries. Published by the American Physical Society 2024

Zhao, Haimeng (ORCID:0000000166751489)↗

IBM system/360 assembly language interval arithmetic software

Computer software designed to perform interval arithmetic is described. An interval is defined as the set of all real numbers between two given numbers including or excluding one or both endpoints. Interval arithmetic consists of the various elementary arithmetic operations defined on the set of all intervals, such as interval addition, subtraction, union, etc. One of the main applications of interval arithmetic is in the area of error analysis of computer calculations. For example, it has been used sucessfully to compute bounds on sounding errors in the solution of linear algebraic systems, error bounds in numerical solutions of ordinary differential equations, as well as integral equations and boundary value problems. The described software enables users to implement algorithms of the type described in references efficiently on the IBM 360 system.

Phillips, E. J.↗