An axiomatic characterization of the Hirsch-index

The Hirsch-index is a well-known index for measuring and comparing the output of scientific researchers. The main contribution of this article is an axiomatic characterization of the Hirsch-index in terms of three natural axioms. Furthermore, two other scientific impact indices (called the w-index and the maximum-index) are defined and characterized in terms of similar axioms.     

An axiomatic characterization of multilattices

The author presents an axiomatic characterization of M. Benado's definition of a multilattice.     

An axiomatic description of the Strambach planes

In this paper we generalize the construction of Strambach planes to an arbitrary ordered Euclidean field, we describe collineation groups of the obtained structures, and we give an axiomatic characterization of them.     

An axiomatic treatment ofSIMD assignment

The aims of this article are to provide (i) an abstract characterisation of SIMD computation and (ii) a simple proof theory for SIMD programs. A soundness result is stated and the consequences of the result are analysed. The use of the axiomatic theory is illustrated by a proof of a parallel implementation of Euclid's GCD algorithm.     

An axiomatic foundation of Cayley-Klein geometries

We present a common axiomatic characterization of Cayley-Klein geometries over fields of characteristic \({\neq 2}\). To this end the axiom system of Bachmann (Aufbau der Geometrie aus dem Spiegelungsbegriff, 2nd edn. Springer, Heidelberg1973) for plane absolute geometry, which allows a common axiomatization of Euclidean, hyperbolic and elliptic geometry, is generalized. The notion of plane absolute geometry is broadened in several aspects. The most important one is that the principle of duality holds: the dual of a Cayley-Klein geometry is also a Cayley-Klein geometry. The various Cayley-Klein geometries are singled out by additional axioms like the Euclidean or hyperbolic parallel axiom or their dual statements.     

An axiomatic analysis of the Droz-Farny Line Theorem

We analyze an elementary theorem of Euclidean geometry, the Droz-Farny Line Theorem, from the point of view of the foundations of geometry. We start with an elementary synthetic proof which is based on simple properties of the group of motions. The proof reveals that the Droz-Farny Line Theorem is a special case of the Theorem of Goormatigh which is, in turn, a special case of the Counterpairing Theorem of Hessenberg. An axiomatic analysis in the sense of Hilbert [14] and Bachmann [2] leads to a study of different versions of the theorems (e.g., of a dual version or of an absolute version, which is valid in absolute geometry) and to a new axiom system for the associated very general plane absolute geometry (the geometry of pencils and lines). In the last section the role of the theorems in the foundations of geometry is discussed.     

An axiomatic characterization of the potential decisiveness index

Let us consider that somebody is extremely interested in increasing the probability of a proposal to be approved by a certain committee and that to achieve this goal he/she is prepared to pay off one member of the committee. In a situation like this one, and assuming that vote-buying is allowed and free of stigma, which voter should be offered a bribe? The potential decisiveness index for simple games, which measures the effect that ensuring one positive vote produces for the probability of passing the issue at hand, is a good tool with which to acquire the answer. An axiomatic characterization of this index is given in this paper, and its relation to other classical power indices is shown.     

An axiomatic look at a windmill

We present the problem stated in intuitive language as problem 2 at the 52nd International Mathematical Olympiad as a formal statement, and prove that it is valid in ordered regular incidence planes, the weakest ordered geometry whose models can be embedded in projective ordered planes.     

An extension to possibilistic fuzzy cluster analysis

We explore an approach to possibilistic fuzzy clustering that avoids a severe drawback of the conventional approach, namely that the objective function is truly minimized only if all cluster centers are identical. Our approach is based on the idea that this undesired property can be avoided if we introduce a mutual repulsion of the clusters, so that they are forced away from each other. We develop this approach for the possibilistic fuzzy c-means algorithm and the Gustafson–Kessel algorithm. In our experiments we found that in this way we can combine the partitioning property of the probabilistic fuzzy c-means algorithm with the advantages of a possibilistic approach w.r.t. the interpretation of the membership degrees.     

An axiomatic semantics for nested concurrency

We give transformation rules for the concurrent parts of Hoare's language CSP, transforming concurrent CSP programs into nondeterministic, sequential programs.On the basis of these transformations we define an axiomatic semantics for CSP with nested concurrency.This axiomatic system includes a rule for binary, associative process composition, enabling modular verification dealing with parts of concurrent systems as well as full programs.The proof system is fully abstract, in the sense that the internal structure of processes is irrelevant in the specification inasmuch it is not externally observable.An outline of a verification of a recursive, concurrent sorter is given as an example.     

An axiomatic approach to rounded computations

The present paper is intended to give an axiomatic approach to rounded computations. A rounding is defined as a monotone mapping of an ordered set into a subset, which in general is called a lower respectively an upper screen. The first chapter deals with roundings in ordered sets. In the second chapter further properties of roundings in linearly ordered sets are studied. The third chapter deals with the two most important applications, the approximation of the real arithmetic on a finite screen and the approximation of the real interval arithmetic on an upper screen. Beyond these examples various further applications are possible.Sponsored by the Mathematics Research Center, Madison, Wisconsin, under Contract No.: DA-31-124-ARO-D-462.     

An axiomatic characterization of different majority concepts

A lot of decision support systems use some kind of aggregation procedure based on the concept of majority, but not always the same one; it can be simple majority, weak majority or one of the many other kinds of majority. This paper attempts to present the main variants of majority and to characterize them in a uniform way. Consequently, it is now easier to compare different kinds of majority and to understand the dissimilarities (or similarities) between them. This should help decision analysts willing to use a majority procedure to choose the right one for their problem and context.     

An axiomatic approach to egalitarianism in TU-games

A core concept is a solution concept on the class of balanced games that exclusively selects core allocations. We show that every continuous core concept that satisfies both the equal treatment property and a new property called independence of irrelevant core allocations (IIC) necessarily selects egalitarian allocations. IIC requires that, if the core concept selects a certain core allocation for a given game, and this allocation is still a core allocation for a new game with a core that is contained in the core of the first game, then the core concept also chooses this allocation as the solution to the new game. When we replace the continuity requirement by a weak version of additivity we obtain an axiomatization of the egalitarian solution concept that assigns to each balanced game the core allocation minimizing the Euclidean distance to the equal share allocation.     

An axiomatic approach to equivariant cohomology theories

This paper presents a translation of a theorem of Cartan into an equivariant setting. This work is largely based on the study of the homotopical algebra in the sense of Quillen of the category of simplicial objects over the category of rationalO _g-vector spaces. The application is a solution to the equivariant commutative cochain problem. This solution is slightly better than the solution obtained earlier by Triantafillou in that the transformation groupG need not be finite.     

An axiomatic characterization of some locations in trees

We describe axioms that uniquely characterize the absolute median and the squared median (the point that minimizes the sum of squared distances) of a tree. A common feature of these characterizations is a Consistency axiom of the type first used by H.P. Young to characterize a voting procedure called Borda's rule. These results make it possible to argue in favor of, or against, a particular location in terms of principles satisfied or violated.     

On the transformation between possibilistic logic bases and possibilistic causal networks

Possibilistic logic bases and possibilistic graphs are two different frameworks of interest for representing knowledge. The former ranks the pieces of knowledge (expressed by logical formulas) according to their level of certainty, while the latter exhibits relationships between variables. The two types of representation are semantically equivalent when they lead to the same possibility distribution (which rank-orders the possible interpretations). A possibility distribution can be decomposed using a chain rule which may be based on two different kinds of conditioning that exist in possibility theory (one based on the product in a numerical setting, one based on the minimum operation in a qualitative setting). These two types of conditioning induce two kinds of possibilistic graphs. This article deals with the links between the logical and the graphical frameworks in both numerical and quantitative settings. In both cases, a translation of these graphs into possibilistic bases is provided. The converse translation from a possibilistic knowledge base into a min-based graph is also described.