Results 1  10
of
11
Modal Intervals Revisited Part 1: A Generalized Interval Natural Extension
 Reliable Computing
"... Modal interval theory is an extension of classical interval theory which provides richer interpretations (including in particular inner and outer approximations of the ranges of real functions). In spite of its promising potential, modal interval theory is not widely used today because of its origin ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
Modal interval theory is an extension of classical interval theory which provides richer interpretations (including in particular inner and outer approximations of the ranges of real functions). In spite of its promising potential, modal interval theory is not widely used today because of its original and complicated construction. The present paper proposes a new formulation of modal interval theory. New extensions of continuous real functions to generalized intervals (intervals whose bounds are not constrained to be ordered) are defined. They are called AEextensions. These AEextensions provide the same interpretations as the ones provided by modal interval theory, thus enhancing the interpretation of the classical interval extensions. The construction of AEextensions strictly follows the model of classical interval theory: starting from a generalization of the definition of the extensions to classical intervals, the minimal AEextensions of the elementary operations
Modal Intervals Revisited Part 2: A Generalized Interval MeanValue Extension ∗
"... In Modal Intervals Revisited Part 1, new extensions to generalized intervals (intervals whose bounds are not constrained to be ordered), called AEextensions, have been defined. They provide the same interpretations as modal intervals and therefore enhance the interpretations of classical interval e ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
In Modal Intervals Revisited Part 1, new extensions to generalized intervals (intervals whose bounds are not constrained to be ordered), called AEextensions, have been defined. They provide the same interpretations as modal intervals and therefore enhance the interpretations of classical interval extensions (for example, both inner and outer approximations of function ranges are in the scope of AEextensions). The construction of AEextensions is similar to the cnstruction of classical interval extensions. In particular, a natural AEextension has been defined from Kaucher arithmetic which simplified some central results of modal interval theory. Starting from this framework, the meanvalue AEextension is now defined. It represents a new way to linearize a real function, which is compatible with both inner and outer approximations of its range. With a quadratic order of convergence for realvalued functions, it allows one to overcome some difficulties which were encountered using a preconditioning process together with the natural AEextensions. Some application examples are finally presented, displaying the application potential of the meanvalue AEextension.
Interpretable Interval Constraint Solvers in Semantic Tolerance Analysis
"... A semantic tolerance modeling scheme based on generalized intervals was recently proposed to allow for embedding more tolerancing intents in specifications with a combination of numerical intervals and logical quantifiers. By differentiating a priori and a posteriori tolerances, the logic relationsh ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
A semantic tolerance modeling scheme based on generalized intervals was recently proposed to allow for embedding more tolerancing intents in specifications with a combination of numerical intervals and logical quantifiers. By differentiating a priori and a posteriori tolerances, the logic relationships among variables can be interpreted, which is useful to verify completeness and soundness of numerical estimations in tolerance analysis. In this paper, we present a semantic tolerance analysis approach to estimate tolerance stackups. New interpretable linear and nonlinear constraint solvers are developed to ensure interpretability of variation estimations. This new approach enhances traditional numerical analysis methods by preserving logical information during computation such that more semantics can be derived from numerical results.
1Controller
"... design under fuzzy poleplacement specifications: an interval arithmetic approach ..."
Abstract
 Add to MetaCart
design under fuzzy poleplacement specifications: an interval arithmetic approach
Generalized Interval Projection: A New Technique fo r Consistent Domain Extension, in "IJCAI
, 2007
"... This paper deals with systems of parametric equations over the reals, in the framework of interval constraint programming. As parameters vary within intervals, the solution set of a problem may have a non null volume. In these cases, an inner box (i.e., a box included in the solution set) instead of ..."
Abstract
 Add to MetaCart
This paper deals with systems of parametric equations over the reals, in the framework of interval constraint programming. As parameters vary within intervals, the solution set of a problem may have a non null volume. In these cases, an inner box (i.e., a box included in the solution set) instead of a single punctual solution is of particular interest, because it gives greater freedom for choosing a solution. Our approach is able to build an inner box for the problem starting with a single point solution, by consistently extending the domain of every variable. The key point is a new method called generalized projection. The requirements are that each parameter must occur only once in the system, variable domains must be bounded, and each variable must occur only once in each constraint. Our extension is based on an extended algebraic structure of intervals called generalized intervals, where improper intervals are allowed (e.g. [1,0]). 1
ClosedLoop Analysis in Semantic Tolerance Modeling
"... A semantic tolerance modeling scheme based on generalized intervals was recently proposed to allow for embedding more tolerancing intents in specifications with a combination of numerical intervals and logical quantifiers. By differentiating a priori and a posteriori tolerances, the logic relationsh ..."
Abstract
 Add to MetaCart
(Show Context)
A semantic tolerance modeling scheme based on generalized intervals was recently proposed to allow for embedding more tolerancing intents in specifications with a combination of numerical intervals and logical quantifiers. By differentiating a priori and a posteriori tolerances, the logic relationships among variables can be interpreted, which is useful to verify completeness and soundness of numerical estimations in tolerance analysis. In this paper, we present a semantic tolerance analysis approach to estimate size and geometric tolerance stackups based on closed loops of interval vectors. An interpretable linear system solver is constructed to ensure interpretability of numerical results. A direct linearization method for nonlinear systems is also developed. This new approach enhances traditional numerical analysis methods by preserving logical information during computation such that more semantics can be derived from variation estimations. 1.
Modal Intervals Revisited: A meanvalued . . .
, 2005
"... The modal intervals theory deals with quantified propositions in AEform, i.e. universal quantifiers precede existential ones, where variables are quantified over continuous domains and with equality constraints. It allows to manipulate such quantified propositions computing only with bounds of inte ..."
Abstract
 Add to MetaCart
The modal intervals theory deals with quantified propositions in AEform, i.e. universal quantifiers precede existential ones, where variables are quantified over continuous domains and with equality constraints. It allows to manipulate such quantified propositions computing only with bounds of intervals. A simpler formulation of this theory is presented. Thanks to this new framework, a meanvalue extension to generalized intervals (intervals whose bounds are not constrained to be ordered) is defined. Its application to the validation of quantified propositions is illustrated.