Search results for "methodologie"
showing 10 items of 2141 documents
Degree of monotonicity in aggregation process
2010
In this paper we introduce a fuzzy order relation notion in the description of aggregation process. Namely, we use the fuzzy order relation to define the degree of monotonicity, which is equal to 1 for a monotone function with respect to a crisp order relation. In that case, integration of fuzzy order relation allows us to generalize the notion of monotonicity and we try to investigate the benefits of using fuzzy relations instead of a crisp relation. Further we illustrate this definition by examples and study the properties of aggregation functions which have a certain degree of monotonicity.
Regular Varieties of Automata and Coequations
2015
In this paper we use a duality result between equations and coequations for automata, proved by Ballester-Bolinches, Cosme-Ll´opez, and Rutten to characterize nonempty classes of deterministic automata that are closed under products, subautomata, homomorphic images, and sums. One characterization is as classes of automata defined by regular equations and the second one is as classes of automata satisfying sets of coequations called varieties of languages. We show how our results are related to Birkhoff’s theorem for regular varieties.
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
2007
The original publication is available at www.springerlink.com ; ISBN 978-3-540-75519-7 ; ISSN 0302-9743 (Print) 1611-3349 (Online); International audience; We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, \ie surfaces of algebraic degree~2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the adjacency graph of the arrangement. Our implementation is {\em complete} in the sense that it can handle all kinds of…
A Graph Based Algorithm For Intersection Of Subdivision Surfaces
2003
Computing surface intersections is a fundamental problem in geometric modeling. Any boolean operation can be seen as an intersection calculation followed by a selection of the parts necessary for building the surface of the resulting object. A robust and efficient algorithm to compute intersection on subdivision surfaces (surfaces generated by the Loop scheme) is proposed here. This algorithm relies on the concept of a bipartite graph which allows the reduction of the number of faces intersection tests. Intersection computations are accelerated by the use of the bipartite graph and the neighborhood of intersecting faces at a given level of subdivision to deduce intersecting faces at the fol…
A note on Taskinen's counterexamples on the problem of topologies of Grothendieck
1989
By the work of Taskinen (see [4, 5]), we know that there is a Fréchet space E such that Lb(E, l2) is not a (DF)-space. Moreover there is a Fréchet–Montel space F such that is not (DF). In this second example, the duality theorem of Buchwalter (cf. [2, §45.3]) can be applied to obtain that and hence is a (gDF)-space (cf. [1, Ch. 12 or 3, Ch. 8]). The (gDF)-spaces were introduced by several authors to extend the (DF)-spaces of Grothendieck and to provide an adequate frame to consider strict topologies.
Varieties and Covarieties of Languages (Extended Abstract)
2013
AbstractBecause of the isomorphism (X×A)→X≅X→(A→X), the transition structure of a deterministic automaton with state set X and with inputs from an alphabet A can be viewed both as an algebra and as a coalgebra. This algebra-coalgebra duality goes back to Arbib and Manes, who formulated it as a duality between reachability and observability, and is ultimately based on Kalmanʼs duality in systems theory between controllability and observability. Recently, it was used to give a new proof of Brzozowskiʼs minimization algorithm for deterministic automata. Here we will use the algebra-coalgebra duality of automata as a common perspective for the study of both varieties and covarieties, which are …
Extremal problems of approximation theory in fuzzy context
1999
Abstract The problem of approximation of a fuzzy subset of a normed space is considered. We study the error of approximation, which in this case is characterized by an L -fuzzy number. In order to do this we define the supremum of an L -fuzzy set of real numbers as well as the supremum and the infimum of a crisp set of L -fuzzy numbers. The introduced concepts allow us to investigate the best approximation and the optimal linear approximation. In particular, we consider approximation of a fuzzy subset in the space L p m of differentiable functions in the L q -metric. We prove the fuzzy counterparts of duality theorems, which in crisp case allows effectively to solve extremal problems of the…
Equivalence classes of permutations modulo descents and left-to-right maxima
2014
Abstract In a recent paper [2], the authors provide enumerating results for equivalence classes of permutations modulo excedances. In this paper we investigate two other equivalence relations based on descents and left-to-right maxima. Enumerating results are presented for permutations, involutions, derangements, cycles and permutations avoiding one pattern of length three.
A-Codes from Rational Functions over Galois Rings
2006
In this paper, we describe authentication codes via (generalized) Gray images of suitable codes over Galois rings. Exponential sums over these rings help determine--or bound--the parameters of such codes.
The λ-Error Order in Multivariate Interpolation
2005
The aim of this article is to introduce and to study a generalization of the error order of interpolation, named λ – error order of interpolation. This generalization makes possible a deeper analysis of the error in the interpolation process. We derived the general form of the λ – error order of interpolation and then we applied it for many choices of the functional λ.