• Aucun résultat trouvé

set functions

Interaction transform for bi-set functions over a finite set

Interaction transform for bi-set functions over a finite set

... against, and the other ones abstain. Hence, such “bi-setfunctions enable a richer modelling of situations in deci- sion making. The question is then to recover the usual tools associated with set ...

26

Remarkable polyhedra related to set functions, games and capacities

Remarkable polyhedra related to set functions, games and capacities

... set function, and is therefore a ...the set of compatible probability ...of set functions, games and capacities can be found in the monograph of the author ...

26

A Radon-Nikodym derivative for almost subadditive set functions

A Radon-Nikodym derivative for almost subadditive set functions

... Building set functions from existing ones can be naturally carried on through Choquet integrals (see [15]), ...for set functions (see [4]). Another version for non-additive set ...

16

Bases and Transforms of Set Functions

Bases and Transforms of Set Functions

... of set functions on a finite set X, which can be alternatively seen as pseudo-Boolean functions, and including as a special cases ...parity functions) and make an emphasis on the ...

16

Remarkable polyhedra related to set functions, games and capacities

Remarkable polyhedra related to set functions, games and capacities

... Introduction Set functions, that is, functions assigning a real number to any subset of a universal set, are encountered in many domains of Operations Research and discrete mathematics, often ...

25

Exact bounds of the Möbius inverse of monotone set functions

Exact bounds of the Möbius inverse of monotone set functions

... monotone set function, interaction AMS Classification: 05, 06, 91 1 Introduction The M¨obius function is a well-known tool in combinatorics and partially ordered sets (see, ...monotone set function (called ...

9

Identification of random shapes from images through polynomial chaos expansion of random level-set functions

Identification of random shapes from images through polynomial chaos expansion of random level-set functions

... The identication of a probabilistic model is a very critical point. It usually requires many samples and robust identication techniques of random variables or elds. Experimental campaigns or in-site measurements are ...

30

Bases and transforms of set functions

Bases and transforms of set functions

... The aim of this paper is to bring a survey on the above mentioned issues. Section 2 gives a brief account on set functions and pseudo-Boolean functions. Section 3 describes the best-known bases ...

17

Bases and transforms of set functions

Bases and transforms of set functions

... Introduction Set functions on a finite set X are of fundamental usage in many areas of discrete math- ematics, ...pseudo-Boolean functions. Specific domains focus on specific subclasses of ...

17

Submodular Partition Functions

Submodular Partition Functions

... LIRMM-Universit´ e Montpellier II, 161 rue Ada, 34392 Montpellier Cedex, France thomasse@lirmm.fr Abstract Adapting the method introduced in Graph Minors X [6], we propose a new proof of the duality between the ...

15

On Skolemising Zermelo's Set Theory

On Skolemising Zermelo's Set Theory

... Although convenient in the perspective of a model-theoretic study, the lan- guage of set theory is too rudimentary to be used to formalise mathematics effectively. For a practical use, it is necessary to enrich ...

20

Molien generating functions and integrity bases for the action of the SO(3) and O(3) groups on a set of vectors

Molien generating functions and integrity bases for the action of the SO(3) and O(3) groups on a set of vectors

... a set of n Γ–covariants which transform according to the n × n representation matrix of the element ...a set of vectors), the action of G extends to the corresponding algebra A of ...a set of ...

31

On comonotonically modular functions

On comonotonically modular functions

... 7. M. Couceiro and J.-L. Marichal. Polynomial functions over bounded distributive lattices, Journal of Multiple-Valued Logic and Soft Computing. In press. 8. M. Grabisch, J.-L. Marichal, R. Mesiar, and E. Pap. ...

4

Entire functions sharing small functions with their difference operators

Entire functions sharing small functions with their difference operators

... [3] B. Chen, and S. Li, Uniquness problems on entire functions that share a small function with their difference operators , Adv. Difference Equ. 2014, 2014:311, 11 pp. [4] Y. M. Chiang, S. J. Feng, On the ...

15

Symbolic Asymptotics : Functions of Two Variables, Implicit Functions

Symbolic Asymptotics : Functions of Two Variables, Implicit Functions

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...

22

Modular Graph Functions

Modular Graph Functions

... Such functions, which we will refer to as modular graph functions, arise, for example, in the low energy expansion of genus-one Type II superstring ...These functions depend on a coordinate, ζ, on ...

43

Comparing products of Schur functions and quasisymmetric functions

Comparing products of Schur functions and quasisymmetric functions

... A symmetric function is called Schur nonnegative if it is a linear combination with nonnegative coefficients of the Schur functions, or, equivalently, if it is the cha[r] ...

74

Epistemic Answer Set Programming

Epistemic Answer Set Programming

... The first approach of this line of research is Gelfond’s epistemic specifications ES [8]: he extended a special form of ASP called disjunctive logic programming [14] by epistemic operato[r] ...

20

The disabled set sail

The disabled set sail

... and control keyboard, and electric winches will be inte- grated directly into the main circuit board via the CAN in- terface. This PSC is based on open-source technology in order to allow the easy in- tegration of new ...

7

Epistemic Answer Set Programming

Epistemic Answer Set Programming

... In both semantics, the selection of these special models from among all models of a program is in two steps plus a fixed point check: first, we compute the reduct of a program by a candi[r] ...

21

Show all 1985 documents...

Sujets connexes