Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Tolerance Bounds”

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 73 records · Page 4

Truncated Gaussians as tolerance sets

This work focuses on the use of truncated Gaussian distributions as models for bounded data measurements that are constrained to appear between fixed limits. The authors prove that the truncated Gaussian can be viewed as a maximum entropy distribution for truncated bounded data, when mean and covariance are given. The characteristic function for the truncated Gaussian is presented; from this, algorithms are derived for calculation of mean, variance, summation, application of Bayes rule and filtering with truncated Gaussians. As an example of the power of their methods, a derivation of the disparity constraint (used in computer vision) from their models is described. The authors' approach complements results in Statistics, but their proposal is not only to use the truncated Gaussian as a model for selected data; they propose to model measurements as fundamentally in terms of truncated Gaussians.

Cozman, Fabio↗

Multi-parametric analysis for mixed integer linear programming: An application to transmission upgrade and congestion management

Upgrading the capacity of existing transmission lines is essential for meeting the growing energy demands, facilitating the integration of renewable energy, and ensuring the security of the transmission system. This study focuses on the selection of lines whose capacities and by how much should be expanded from the perspective of the Independent System Operators (ISOs) to minimize the total system cost. We employ advanced multi-parametric programming and an enhanced branch-and-bound algorithm to address complex mixed-integer linear programming (MILP) problems, considering multi-period time constraints and physical limitations of generators and transmission lines. To characterize the various decisions in transmission expansion, we model the increased capacity of existing lines as parameters within a specified range. This study first relaxes the binary variables to continuous variables and applies the Lagrange method and Karush-Kuhn-Tucker (KKT) conditions to obtain optimal solutions and identify critical regions associated with active and inactive constraints. Moreover, we extend the traditional branch-and-bound (B&B) method by determining the problem’s upper and lower bounds at each node of the B&B decision tree, helping to manage computational challenges in large-scale MILP problems. Here, we compare the difference between the upper and lower bounds to obtain an approximate optimal solution within the decision-makers’ tolerable error range. In addition, the first derivative of the objective function on the parameters of each line is used to inform the selection of lines for easing congestion and maximizing social welfare. Finally, the capacity upgrades are selected by weighing the reductions in system costs against the expense of upgrading line capacities. The findings are supported by numerical simulations and provide transmission-line planners with decision-making guidance.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Model Checking a Byzantine-Fault-Tolerant Self-Stabilizing Protocol for Distributed Clock Synchronization Systems

This report presents the mechanical verification of a simplified model of a rapid Byzantine-fault-tolerant self-stabilizing protocol for distributed clock synchronization systems. This protocol does not rely on any assumptions about the initial state of the system. This protocol tolerates bursts of transient failures, and deterministically converges within a time bound that is a linear function of the self-stabilization period. A simplified model of the protocol is verified using the Symbolic Model Verifier (SMV) [SMV]. The system under study consists of 4 nodes, where at most one of the nodes is assumed to be Byzantine faulty. The model checking effort is focused on verifying correctness of the simplified model of the protocol in the presence of a permanent Byzantine fault as well as confirmation of claims of determinism and linear convergence with respect to the self-stabilization period. Although model checking results of the simplified model of the protocol confirm the theoretical predictions, these results do not necessarily confirm that the protocol solves the general case of this problem. Modeling challenges of the protocol and the system are addressed. A number of abstractions are utilized in order to reduce the state space. Also, additional innovative state space reduction techniques are introduced that can be used in future verification efforts applied to this and other protocols.

Malekpour, Mahyar R.↗

Verification of a Byzantine-Fault-Tolerant Self-stabilizing Protocol for Clock Synchronization

This paper presents the mechanical verification of a simplified model of a rapid Byzantine-fault-tolerant self-stabilizing protocol for distributed clock synchronization systems. This protocol does not rely on any assumptions about the initial state of the system except for the presence of sufficient good nodes, thus making the weakest possible assumptions and producing the strongest results. This protocol tolerates bursts of transient failures, and deterministically converges within a time bound that is a linear function of the self-stabilization period. A simplified model of the protocol is verified using the Symbolic Model Verifier (SMV). The system under study consists of 4 nodes, where at most one of the nodes is assumed to be Byzantine faulty. The model checking effort is focused on verifying correctness of the simplified model of the protocol in the presence of a permanent Byzantine fault as well as confirmation of claims of determinism and linear convergence with respect to the self-stabilization period. Although model checking results of the simplified model of the protocol confirm the theoretical predictions, these results do not necessarily confirm that the protocol solves the general case of this problem. Modeling challenges of the protocol and the system are addressed. A number of abstractions are utilized in order to reduce the state space.

Malekpour, Mahyar R.↗

Deployable Fresnel Rings

Deployable Fresnel rings (DFRs) significantly enhance the realizable gain of an antenna. This innovation is intended to be used in combination with another antenna element, as the DFR itself acts as a focusing or microwave lens element for a primary antenna. This method is completely passive, and is also completely wireless in that it requires neither a cable, nor a connector from the antenna port of the primary antenna to the DFR. The technology improves upon the previous NASA technology called a Tri-Sector Deployable Array Antenna in at least three critical aspects. In contrast to the previous technology, this innovation requires no connector, cable, or other physical interface to the primary communication radio or sensor device. The achievable improvement in terms of antenna gain is significantly higher than has been achieved with the previous technology. Also, where previous embodiments of the Tri-Sector antenna have been constructed with combinations of conventional (e.g., printed circuit board) and conductive fabric materials, this innovation is realized using only conductive and non-conductive fabric (i.e., "e-textile") materials, with the possible exception of a spring-like deployment ring. Conceptually, a DFR operates by canceling the out-of-phase radiation at a plane by insertion of a conducting ring or rings of a specific size and distance from the source antenna, defined by Fresnel zones. Design of DFRs follow similar procedures to those outlined for conventional Fresnel zone rings. Gain enhancement using a single ring is verified experimentally and through computational simulation. The experimental test setup involves a microstrip patch antenna that is directly behind a single-ring DFR and is radiating towards a second microstrip patch antenna. The first patch antenna and DFR are shown. At 2.42 GHz, the DFR improves the transmit antenna gain by 8.6 dB, as shown in Figure 2, relative to the wireless link without the DFR. A figure illustrates the relative strength of power coupling between the first and second microstrip antennas with and without the DFR. Typically, a DFR is designed for use at a particular frequency; however, testing of a DFR indicated a relatively wide operational bandwidth of approximately 8.2%. Wider bandwidth operation and multi-band operation are anticipated by extending the known art of conventional Fresnel rings to the DFRs. Increasing the number of rings used to construct a DFR antenna increases the gain, with the upper bound limited often by the largest practical dimensions that can be tolerated for a given application. The maximum theoretical improvement in gain for a single ring is 9.5 dB. Experimental results are within 0.9 dB of this theoretical value. Adding rings increases gain, and theoretically, improvements of 10 to 13 dB above that of the primary antenna gain can be achieved with two- and three-ring versions.

Kennedy, Timothy F.↗

Effects of Notch Misalignment and Tip Radius on Displacement Field in V-Notch Rail Shear Test as Determined by Photogrammetry

Evolution of the 3D strain field during ASTM-D-7078 v-notch rail shear tests on 8-ply quasi-isotropic carbon fiber/epoxy laminates was determined by optical photogrammetry using an ARAMIS system. Specimens having non-optimal geometry and minor discrepancies in dimensional tolerances were shown to display non-symmetry and/or stress concentration in the vicinity of the notch relative to a specimen meeting the requirements of the standard, but resulting shear strength and modulus values remained within acceptable bounds of standard deviation. Based on these results, and reported difficulty machining specimens to the required tolerances using available methods, it is suggested that a parametric study combining analytical methods and experiment may provide rationale to increase the tolerances on some specimen dimensions, reducing machining costs, increasing the proportion of acceptable results, and enabling a wider adoption of the test method.

Hill, Charles S.↗

Optimising the processing and storage of visibilities using lossy compression

The next-generation radio astronomy instruments are providing a massive increase in sensitivity and coverage, largely through increasing the number of stations in the array and the frequency span sampled. The two primary problems encountered when processing the resultant avalanche of data are the need for abundant storage and the constraints imposed by I/O, as I/O bandwidths drop significantly on cold storage. An example of this is the data deluge expected from the SKA Telescopes of more than 60 PB per day, all to be stored on the buffer filesystem. While compressing the data is an obvious solution, the impacts on the final data products are hard to predict. In this paper, we chose an error-controlled compressor – MGARD – and applied it to simulated SKA-Mid and real pathfinder visibility data, in noise-free and noise-dominated regimes. As the data have an implicit error level in the system temperature, using an error bound in compression provides a natural metric for compression. MGARD ensures the compression incurred errors adhere to the user-prescribed tolerance. To measure the degradation of images reconstructed using the lossy compressed data, we proposed a list of diagnostic measures, exploring the trade-off between these error bounds and the corresponding compression ratios, as well as the impact on science quality derived from the lossy compressed data products through a series of experiments. We studied the global and local impacts on the output images for continuum and spectral line examples. We found relative error bounds of as much as 10%, which provide compression ratios of about 20, have a limited impact on the continuum imaging as the increased noise is less than the image RMS, whereas a 1% error bound (compression ratio of 8) introduces an increase in noise of about an order of magnitude less than the image RMS. For extremely sensitive observations and for very precious data, we would recommend a 0.1% error bound with compression ratios of about 4. These have noise impacts two orders of magnitude less than the image RMS levels. At these levels, the limits are due to instabilities in the deconvolution methods. We compared the results to the alternative compression tool DYSCO, in both the impacts on the images and in the relative flexibility. MGARD provides better compression for similar error bounds and has a host of potentially powerful additional features.

Techniques: interferometric↗

Semi-Markov Unreliability Range Evaluator (SURE)

Analysis tool for reconfigurable, fault-tolerant systems, SURE provides efficient way to calculate accurate upper and lower bounds for death state probabilities for large class of semi-Markov models. Calculated bounds close enough for use in reliability studies of ultrareliable computer systems. Written in PASCAL for interactive execution and runs on DEC VAX computer under VMS.

Butler, R. W.↗

Trajectory Specification for Automation of Terminal Air Traffic Control

"Trajectory specification" is the explicit bounding and control of aircraft tra- jectories such that the position at each point in time is constrained to a precisely defined volume of space. The bounding space is defined by cross-track, along-track, and vertical tolerances relative to a reference trajectory that specifies position as a function of time. The tolerances are dynamic and will be based on the aircraft nav- igation capabilities and the current traffic situation. A standard language will be developed to represent these specifications and to communicate them by datalink. Assuming conformance, trajectory specification can guarantee safe separation for an arbitrary period of time even in the event of an air traffic control (ATC) sys- tem or datalink failure, hence it can help to achieve the high level of safety and reliability needed for ATC automation. As a more proactive form of ATC, it can also maximize airspace capacity and reduce the reliance on tactical backup systems during normal operation. It applies to both enroute airspace and the terminal area around airports, but this paper focuses on arrival spacing in the terminal area and presents ATC algorithms and software for achieving a specified delay of runway arrival time.

air traffic control↗

Trajectory Specification for Terminal Air Traffic: Pairwise Conflict Detection and Resolution

Trajectory specification is the explicit bounding and control of aircraft trajectories such that the position at each point in time is constrained to a precisely defined volume of space. The bounding space is defined by cross-track, along-track, and vertical tolerances relative to a reference trajectory that specifies position as a function of time. The tolerances are dynamic and will be based on the aircraft navigation capabilities and the current traffic situation. A standard language will be developed to represent these specifications and to communicate them by datalink. Assuming conformance, trajectory specification can guarantee safe separation for an arbitrary period of time even in the event of an air traffic control (ATC) system or datalink failure, hence it can help to achieve the high level of safety and reliability needed for ATC automation. As a more proactive form of ATC, it can also maximize airspace capacity and reduce the reliance on tactical backup systems during normal operation. It applies to both enroute airspace and the terminal area around airports, but this paper focuses on the terminal area and presents algorithms and software for spacing arrivals and deconflicting both arrivals and departures.

air traffic control↗

Trajectory Specification for Terminal Air Traffic: Pairwise Conflict Detection and Resolution

Trajectory Specification is the explicit bounding and control of aircraft trajectories such that the position at any point in time is constrained to a precisely defined volume of space. The bounding space is defined by cross-track, along-track, and vertical tolerances relative to a reference trajectory that specifies position as a function of time. The tolerances are dynamic and will be based on the aircraft navigation capabilities and the current traffic situation. Assuming conformance, Trajectory Specification can guarantee safe separation for an arbitrary period of time even in the event of an air traffic control (ATC) system or datalink failure; hence it can help to achieve the high level of safety and reliability needed for ATC automation. It can also reduce the reliance on tactical backup systems during normal operation. This paper applies it to the terminal area around a major airport and presents algorithms and software for detecting and resolving conflicts. A representative set of pairwise conflicts was generated, and a fast-time simulation was run on them. All conflicts were successfully resolved in real time, demonstrating the computational feasibility of the concept.

terminal area↗

Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic States

A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-König bound for $n$-dimensional topological stabilizer codes. In this work, we extend topological Pauli stabilizer codes to a broad class of $n$-dimensional Clifford hierarchy stabilizer codes. These codes correspond to the $(n+1)$D Dijkgraaf-Witten gauge theories with non-Abelian topological order. We construct transversal non-Clifford gates through automorphism symmetries represented by cup products. In 2D, we obtain the first transversal non-Clifford logical gates including T and CS for Clifford stabilizer codes, using the automorphism of the twisted $\mathbb{Z}_2^3$ gauge theory (equivalent to $\mathbb{D}_4$ topological order). We also combine it with the just-in-time decoder to fault-tolerantly prepare the logical T magic state in $O(d)$ rounds via code switching. In 3D, we construct a transversal logical $\sqrt{\text{T}}$ gate in a non-Clifford stabilizer code at the third level of the Clifford hierarchy, located on a tetrahedron corresponding to a twisted $\mathbb{Z}_2^4$ gauge theory. Furthermore, our constructions surpass the Bravyi-König bound by achieving the logical gates in the $(n+1)$-th level of Clifford hierarchy in $n$ spatial dimension.

Kobayashi, Ryohei [Institute for Advanced Study, P↗

Trajectory Specification for High-Capacity Air Traffic Control

In the current air traffic management system, the fundamental limitation on airspace capacity is the cognitive ability of human air traffic controllers to maintain safe separation with high reliability. The doubling or tripling of airspace capacity that will be needed over the next couple of decades will require that tactical separation be at least partially automated. Standardized conflict-free four-dimensional trajectory assignment will be needed to accomplish that objective. A trajectory specification format based on the Extensible Markup Language is proposed for that purpose. This format can be used to downlink a trajectory request, which can then be checked on the ground for conflicts and approved or modified, if necessary, then uplinked as the assigned trajectory. The horizontal path is specified as a series of geodetic waypoints connected by great circles, and the great-circle segments are connected by turns of specified radius. Vertical profiles for climb and descent are specified as low-order polynomial functions of along-track position, which is itself specified as a function of time. Flight technical error tolerances in the along-track, cross-track, and vertical axes define a bounding space around the reference trajectory, and conformance will guarantee the required separation for a period of time known as the conflict time horizon. An important safety benefit of this regimen is that the traffic will be able to fly free of conflicts for at least several minutes even if all ground systems and the entire communication infrastructure fail. Periodic updates in the along-track axis will adjust for errors in the predicted along-track winds.

Paielli, Russell A.↗

CsbZIP2-miR9748-CsNPF4.4 Module Mediates High Temperature Tolerance of Cucumber Through Jasmonic Acid Pathway

High temperature stress seriously affects the growth of cucumber seedlings, and even leads to a decline in yield and quality. miRNAs have been shown to be involved in regulating the response to stress in plants, but little is known about its effects on cucumber high temperature stress tolerance. Here, we found that high temperature stress induced the expression of miR9748 in cucumber. Overexpression of cucumber miR9748 in Arabidopsis improved high temperature tolerance. Transcriptome analysis revealed that miR9748 might mediate high temperature tolerance through plant hormone signal pathway. 5′ RNA ligase-mediated rapid amplification of cDNA ends (5′ RLM-RACE) and transient transformation technology demonstrated that CsNPF4.4 was the target gene of miR9748. CsNPF4.4 overexpression plants decreased high temperature tolerance accompanied by reducing the content of jasmonic acid (JA), but alleviated by foliar application of methyl jasmonate, indicating that CsNPF4.4 negatively regulated high temperature stress tolerance through inhibition JA signal pathway. Furthermore, high temperature stress also increased the expression level of CsbZIP2 . Yeast one-hybrid and dual-luciferase assays showed that CsbZIP2 directly bound to the promoter of MIR9748 to induce its expression. Taken together, our results indicated that CsbZIP2 directly regulated miR9748 expression to cleave CsNPF4.4 to mediate high temperature tolerance through JA pathway.

Li, Lan↗

Approximate symmetries and quantum error correction

Abstract Quantum error correction (QEC) is a key concept in quantum computation as well as many areas of physics. There are fundamental tensions between continuous symmetries and QEC. One vital situation is unfolded by the Eastin–Knill theorem, which forbids the existence of QEC codes that admit transversal continuous symmetry actions (transformations). Here, we systematically study the competition between continuous symmetries and QEC in a quantitative manner. We first define a series of meaningful measures of approximate symmetries motivated from different perspectives, and then establish a series of trade-off bounds between them and QEC accuracy utilizing multiple different methods. Remarkably, the results allow us to derive general quantitative limitations of transversally implementable logical gates, an important topic in fault-tolerant quantum computation. As concrete examples, we showcase two explicit types of quantum codes, obtained from quantum Reed–Muller codes and thermodynamic codes, respectively, that nearly saturate our bounds. Finally, we discuss several potential applications of our results in physics.

Physics↗

Reliable Devices Yield Stable Quantum Computations

Stable quantum computation requires noisy results to remain bounded even in the presence of noise fluctuations. Yet non-stationary noise processes lead to drift in the varying characteristics of a quantum device that can greatly influence the circuit outcomes. Here we address how temporal and spatial variations in noise relate device reliability to quantum computing stability. First, our approach quantifies the differences in statistical distributions of characterization metrics collected at different times and locations using Hellinger distance. We then validate an analytical bound that relates this distance directly to the stability of a computed expectation value. Our demonstration uses numerical simulations with models informed by the washington superconducting transmon device. We find that the stability metric is consistently bounded from above by the corresponding Hellinger distance, which can be cast as a specified tolerance level. These results underscore the significance of reliable quantum computing devices and the impact for stable quantum computation.

Dasgupta, Samudra↗

A regional perspective on the palynofloral response to K-T boundary event(s) with emphasis on variations imposed by the effects of sedimentary facies and latitude

Palynological studies deal with fossil reproductive bodies that were produced by fully functioning plants, whereas most faunal studies are based on death assemblages. Therefore, changes in pollen and spore assemblages cannot be used directly as evidence of catastrophic mass killings but only to indicate changes in ecological conditions. The impact of the Cretaceous-Tertiary boundary event on terrestrial plant communities is illustrated by the degree, rate and selectivity of change. As in most classical palynological studies, the degree of change is expressed in terms of relative abundance and changes in species diversity. It is recognized that sampling interval and continuity of the rock record within individual sections can affect the percieved rate of change. Even taking these factors into account, a gradual change in relative abundance and multiple levels of apparent extinctions, associated with the interval bounding the K-T boundary, can be demonstrated. Climatic change, which locally exceeds the tolerance of individual species, and the possible loss of a group of pollinating agents are examined as possible explanations for the selectivity of apparent extinctions and/or locally truncated occurrences. The aspects of change are demonstrated with data from four different K-T boundary localities in Western Canada between paleolatitudes 60 and 75 deg north. Together, the four localities discussed allow changes imposed by latitude and differences in the depositional environment be isolated from the boundary event itself which is reflected by the truncated ranges of several species throughout the region of study. What must be recognized is that variations in the response of vegetation to the K-T boundary event(s) occurred throughout the Western Interior basin.

Sweet, A. R.↗