Massachusetts Institute of Technology second quarterly report, 1 May - 31 July 1969
Mathematical filter scheme for bounding cross correlation between random forcing function and state error in orbital navigation system
SEARCH · Search NASA
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.
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.
Unscheduled shutdown of nuclear power facilities for recalibration and replacement of faulty sensors can be expensive and disruptive to grid management. In this work, we present virtual (software) sensors that can replace a faulty physical sensor for a short duration thus allowing recalibration to be safely deferred to a later time. The virtual sensor model uses a Gaussian process model to process input data from redundant and other nearby sensors. Predicted data includes uncertainty bounds including spatial association uncertainty and measurement noise and error. Using data from an instrumented cooling water flow loop testbed, the virtual sensor model has predicted correct sensor measurements and the associated error corresponding to a faulty sensor.
Unscheduled shutdown of nuclear power facilities for recalibration and replacement of faulty sensors can be expensive and disruptive to grid management. In this work, we present virtual (software) sensors that can replace a faulty physical sensor for a short duration thus allowing recalibration to be safely deferred to a later time. The virtual sensor model uses a Gaussian process model to process input data from redundant and other nearby sensors. Predicted data includes uncertainty bounds including spatial association uncertainty and measurement noise and error. Using data from an instrumented cooling water flow loop test bed, the virtual sensor model has predicted correct sensor measurements and the associated error corresponding to a faulty sensor. (authors)
We study the quantum error correction properties of the black hole interior in a toy model for an evaporating black hole: Jackiw-Teitelboim gravity entangled with a non-gravitational bath. After the Page time, the black hole interior degrees of freedom in this system are encoded in the bath Hilbert space. We use the gravitational path integral to show that the interior density matrix is correctable against the action of quantum operations on the bath which (i) do not have prior access to details of the black hole microstates, and (ii) do not have a large, negative coherent information with respect to the maximally mixed state on the bath, with the lower bound controlled by the black hole entropy and code subspace dimension. Thus, the encoding of the black hole interior in the radiation is robust against generic, low-rank quantum operations. For erasure errors, gravity comes within an O (1) distance of saturating the Singleton bound on the tolerance of error correcting codes. For typical errors in the bath to corrupt the interior, they must have a rank that is a large multiple of the bath Hilbert space dimension, with the precise coefficient set by the black hole entropy and code subspace dimension.
We prove the universality of the generalized QDD{sub N{sub 1N{sub 2}}} (quadratic dynamical decoupling) pulse sequence for near-optimal suppression of general single-qubit decoherence. Earlier work showed numerically that this dynamical decoupling sequence, which consists of an inner Uhrig DD (UDD) and outer UDD sequence using N{sub 1} and N{sub 2} pulses, respectively, can eliminate decoherence to O(T{sup N}) using O(N{sup 2}) unequally spaced ''ideal'' (zero-width) pulses, where T is the total evolution time and N=N{sub 1}=N{sub 2}. A proof of the universality of QDD has been given for even N{sub 1}. Here we give a general universality proof of QDD for arbitrary N{sub 1} and N{sub 2}. As in earlier proofs, our result holds for arbitrary bounded environments. Furthermore, we explore the single-axis (polarization) error suppression abilities of the inner and outer UDD sequences. We analyze both the single-axis QDD performance and how the overall performance of QDD depends on the single-axis errors. We identify various performance effects related to the parities and relative magnitudes of N{sub 1} and N{sub 2}. We prove that using QDD{sub N{sub 1N{sub 2}}} decoherence can always be eliminated to O(T{sup min{l_brace}N{sub 1},N{sub 2}{r_brace}}).
Chebyshev polynomials maximum property, examining effect of roundoff errors in Horner scheme for floating point arithmetic
Bounded-angle iterative decoding is a modified version of conventional iterative decoding, conceived as a means of reducing undetected-error rates for short low-density parity-check (LDPC) codes. For a given code, bounded-angle iterative decoding can be implemented by means of a simple modification of the decoder algorithm, without redesigning the code. Bounded-angle iterative decoding is based on a representation of received words and code words as vectors in an n-dimensional Euclidean space (where n is an integer).
Probabilistic proofs of the Johnson-Lindenstrauss lemma imply that random projection can reduce the dimension of a data set and approximately preserve pairwise distances. If a distance being approximately preserved is called a success, and the complement of this event is called a failure, then such a random projection likely results in no failures. Assuming a Gaussian random projection, the lemma is proved by showing that the no-failure probability is positive using a combination of Bonferroni's inequality and Markov's inequality. This paper modifies this proof in two ways to obtain a greater lower bound on the no-failure probability. First, Bonferroni's inequality is applied to pairs of failures instead of individual failures. Second, since a pair of projection errors has a bivariate gamma distribution, this probability of a pair of successes is bounded using an inequality from [Jensen, 1969]. If n is the number of points to be embedded and μ is the probability of success, then this leads to an increase in the lower bound on the no-failure probability of $\frac{1}{2}$ ($\genfrac{}{}{0pt}{}{n}{2}$) (1- μ ) 2 is ($\genfrac{}{}{0pt}{}{n}{2}$) is even and $\frac{1}{2}$ (($\genfrac{}{}{0pt}{}{n}{2}$)-1) (1- μ ) 2 if ($\genfrac{}{}{0pt}{}{n}{2}$) is odd. For example, if n =10 5 points are to be embedded in k =10 4 dimensions with a tolerance of ϵ=0.1, then the improvement in the lower bound is on the order of 10 -14 . We also show that further improvement is possible if the inequality in [Jensen, 1969] extends to three successes, though we do not have a proof of this result.
The problem of determining the optimum guidance policy for an interplanetary spacecraft is treated as a stochastic optimal control problem. An algorithm for computing the optimum velocity correction and the optimum execution time (with allowance for correction-dependent errors) is derived in the case of a single midcourse correction. The performance index was chosen to be an upper bound for the probability that the mission fails, and it is defined as a function of the maximum allowable velocity correction and the maximum allowable deviation of the terminal state. Numerical results obtained for a Jupiter fly-by mission indicate that the execution errors have a significant influence on the performance index, but an acceptably small upper bound on the probability of mission failure can be obtained for sufficiently small execution errors.
Upper bounds on high speed satellite collision probability, P (sub c), have been investigated. Previous methods assume an individual position error covariance matrix is available for each object. The two matrices being combined into a single, relative position error covariance matrix. Components of the combined error covariance are then varied to obtain a maximum P (sub c). If error covariance information for only one of the two objects was available, either some default shape has been used or nothing could be done. An alternative is presented that uses the known covariance information along with a critical value of the missing covariance to obtain an approximate but useful P (sub c) upper bound. There are various avenues along which an upper bound on the high speed satellite collision probability has been pursued. Typically, for the collision plane representation of the high speed collision probability problem, the predicted miss position in the collision plane is assumed fixed. Then the shape (aspect ratio of ellipse), the size (scaling of standard deviations) or the orientation (rotation of ellipse principal axes) of the combined position error ellipse is varied to obtain a maximum P (sub c). Regardless as to the exact details of the approach, previously presented methods all assume that an individual position error covariance matrix is available for each object and the two are combined into a single, relative position error covariance matrix. This combined position error covariance matrix is then modified according to the chosen scheme to arrive at a maximum P (sub c). But what if error covariance information for one of the two objects is not available? When error covariance information for one of the objects is not available the analyst has commonly defaulted to the situation in which only the relative miss position and velocity are known without any corresponding state error covariance information. The various usual methods of finding a maximum P (sub c) do no good because the analyst defaults to no knowledge of the combined, relative position error covariance matrix. It is reasonable to think, given an assumption of no covariance information, an analyst might still attempt to determine the error covariance matrix that results in an upper bound on the P (sub c). Without some guidance on limits to the shape, size and orientation of the unknown covariance matrix, the limiting case is a degenerate ellipse lying along the relative miss vector in the collision plane. Unless the miss position is exceptionally large or the at-risk object is exceptionally small, this method results in a maximum P (sub c) too large to be of practical use. For example, assuming that the miss distance is equal to the current ISS alert volume along-track (+ or -) distance of 25 kilometers and that the at-risk area has a 70 meter radius. The maximum (degenerate ellipse) P (sub c) is about 0.00136. At 40 kilometers, the maximum P (sub c) would be 0.00085 which is still almost an order of magnitude larger than the ISS maneuver threshold of 0.0001. In fact, a miss distance of almost 340 kilometers is necessary to reduce the maximum P (sub c) associated with this degenerate ellipse to the ISS maneuver threshold value. Such a result is frequently of no practical value to the analyst. Some improvement may be made with respect to this problem by realizing that while the position error covariance matrix of one of the objects (usually the debris object) may not be known the position error covariance matrix of the other object (usually the asset) is almost always available. Making use of the position error covariance information for the one object provides an improvement in finding a maximum P (sub c) which, in some cases, may offer real utility. The equations to be used are presented and their use discussed.
The ongoing story of the structure of EmrE, the archetypical member of the small multidrug-resistance family, is described. The archetypical member of the small multidrug-resistance family is EmrE, a multidrug transporter that extrudes toxic polyaromatic cations from the cell coupled to the inward movement of protons down a concentration gradient. The architecture of EmrE was first defined from the analysis of two-dimensional crystals by cryoelectron microscopy (cryo-EM), which showed that EmrE was an unusual asymmetric dimer formed from a bundle of eight α-helices. The most favoured interpretation of the structure was that the monomers were oriented in opposite orientations in the membrane in an antiparallel orientation. A model was subsequently built based upon the cryo-EM data and evolutionary constraints and this model was consistent with mutagenic data indicating which amino-acid residues were important for substrate binding and transport. Two X-ray structures that differed significantly from the cryo-EM structure were subsequently retracted owing to a data-analysis error. However, the revised X-ray structure with substrate bound is extremely similar to the model built from the cryo-EM structure (r.m.s.d. of 1.4 Å), suggesting that the proposed antiparallel orientation of the monomers is indeed correct; this represents a new structural paradigm in membrane-protein structures. The vast majority of mutagenic and biochemical data corroborate this structure, although cross-linking studies and recent EPR data apparently support a model of EmrE that contains parallel dimers.
Lieb-Robinson bounds demonstrate the emergence of locality in many-body quantum systems. Intuitively, Lieb-Robinson bounds state that, with local or exponentially decaying interactions, the correlation that can be built up between two sites separated by distance 𝑟 after a time 𝑡 decays as exp (𝑣𝑡 −𝑟), where 𝑣 is the emergent Lieb-Robinson velocity. In many problems, it is important to also capture how much of an operator grows to act on 𝑟 𝑑 sites in 𝑑 spatial dimensions. Perturbation theory and cluster expansion methods suggest that, at short times, these volume-filling operators are suppressed as exp (−𝑟 𝑑 ). We confirm this intuition, showing that, for 𝑟 >𝑣𝑡, the volume-filling operator is suppressed by exp (−(𝑟−𝑣𝑡) 𝑑 /(𝑣𝑡) 𝑑−1 ). This closes a conceptual and practical gap between the cluster expansion and the Lieb-Robinson bound. We then present two very different applications of this new bound. Firstly, we obtain improved bounds on the classical computational resources necessary to simulate many-body dynamics with error tolerance 𝜀 for any finite time 𝑡: as 𝜀 becomes sufficiently small, only 𝜀 −O(𝑡 𝑑−1 ) resources are needed. A protocol that likely saturates this bound is given. Secondly, we prove that disorder operators have volume-law suppression near the “solvable (Ising) point” in quantum phases with spontaneous symmetry breaking, which implies a new diagnostic for distinguishing many-body phases of quantum matter.
Investigation of the detailed capabilities and performance characterization of systems that employ L-orthogonal signaling techniques. L-orthogonal signals represent a unified set of signals wherein the polyphase and orthogonal (bi-orthogonal) signal sets are included as special cases. This fact is important, since orthogonal (bi-orthogonal) and polyphase signaling sets represent opposing forces as far as tradeoffs between error probability, energy-to-noise ratio, and bandwidth requirements are concerned. Bounds on the performance of the optimum receiver and the performance of various suboptimum (practical) receiver structures are given. Coherent and differentially coherent detection of differentially encoded signals are also pursued. Various comparisons and tradeoffs are made by means of numerical evaluation of the error probability expressions.
Purpose: To evaluate intrafraction variability and deformation of the lumpectomy cavity (LC), breast, and nearby organs. Methods and Materials: Sixteen left-sided postlumpectomy and 1 bilateral breast cancer cases underwent free-breathing CT (FBCT) and 10-phase 4-dimensional CT (4DCT). Deformable image registration was used for deformation analysis and contour propagation of breast, heart, lungs, and LC between end-exhale and end-inhale 4DCT phases. Respiration-induced motion was calculated via centroid analysis. Two planning target volumes (PTVs) were compared: PTV{sub FBCT} from the FBCT volume with an isotropic 10 mm expansion (5 mm excursion and 5 mm setup error) and PTV{sub 4DCT} generated from the union of 4DCT contours with isotropic 5 mm margin for setup error. Volume and geometry were evaluated via percent difference and bounding box analysis, respectively. Deformation correlations between breast/cavity, breast/lung, and breast/heart were evaluated. Associations were tested between cavity deformation and proximity to chest wall and breast surface. Results: Population-based 3-dimensional vector excursions were 2.5 ± 1.0 mm (range, 0.8-3.8 mm) for the cavity and 2.0 ± 0.8 mm (range, 0.7-3.0 mm) for the ipsilateral breast. Cavity excursion was predominantly in the anterior and superior directions (1.0 ± 0.8 mm and −1.8 ± 1.2 mm, respectively). Similarly, for all cases, LCs and ipsilateral breasts yielded median deformation values in the superior direction. For 14 of 17 patients, the LCs and breast interquartile ranges tended toward the anterior direction. The PTV{sub FBCT} was 51.5% ± 10.8% larger (P<.01) than PTV{sub 4DCT}. Bounding box analysis revealed that PTV{sub FBCT} was 9.8 ± 1.2 (lateral), 9.0 ± 2.2 (anterior–posterior), and 3.9 ± 1.8 (superior–inferior) mm larger than PTV{sub 4DCT}. Significant associations between breast and cavity deformation were found for 6 of 9 axes. No dependency was found between cavity deformation and proximity to chest wall or breast surface. Conclusions: Lumpectomy cavity and breast deformation and motion demonstrated large variability. A PTV{sub 4DCT} approach showed value in patient-specific margins, particularly if robust interfraction setup analysis can be performed.