A metric space (X, d) is called c-monotone if there is a linear order < on X and c > 0 such that d(x, y) 6 c d(x, z) for all x < y < z in X. A brief account of investigation of monotone spaces including applications is presented. 1 Monotone and σ-Monotone Spaces. In [6] I investigated existence of sets in Euclidean spaces that have large Hausdorff dimension and yet host no continuous finite Bor...

The notion of actual causation, as formalized by Halpern and Pearl, has been recently applied to relational databases, to characterize and compute actual causes for possibly unexpected answers to monotone queries. Causes take the form of database tuples, and can be ranked according to their causal responsibility, a numerical measure of their relevance as a cause for the query answer. In this wo...

Identification of monotone measures is a very challenge process. Based on an existing data set of a set function (or, set functions) defined on the power set of a given finite universal set, to determine a monotone measure, simply switching the values of the given set function that violate the monotonicity is not the optimal way and it also causes some side effects. The paper proposes an algori...

We establish upper and lower bounds for the metric entropy and bracketing entropy of the class of d-dimensional bounded monotonic functions under L norms. It is interesting to see that both the metric entropy and bracketing entropy have different behaviors for p < d/(d − 1) and p > d/(d − 1). We apply the new bounds for bracketing entropy to establish a global rate of convergence of the MLE of ...

A notion of monotonicity of multivariate location estimators is introduced. The relationships between this notion and other existing notions are discussed. Finite sample breakdown point properties of multivariate monotone location estimators are investigated. It turns out that the breakdown points of typical multivariate monotone location estimators are independent of the configuration of under...

We fix a logical connection (Stone Pred : Set op −→ BA given by 2 as a schizophrenic object) and study coalgebraic modal logic that is induced by a functor T : Set −→ Set which is finitary, standard, preserves weak pullbacks and finite sets. We prove that for any such T , the cover modality nabla is a left (and its dual delta is a right) adjoint relative to Pω. We then consider monotone unary m...

Let y = h(x) be defined for 0 < x < oo and assume values in 0 ^ y ^ + co. Let S be any linear set of points and p an arbitrary positive number. Cover S by a countable number of open intervals h , I2, • • • of lengths xx, x2 , • • • each of which is less than p, and denote by mp(S; h) the lower bound of h(xi) + h(x2) + • • • for all such coverings of S. Then m(S; h) = limp|0mp(/S; h) is called t...

In this paper we define the fuzzy integral of a positive, measurable function, with respect to a fuzzy measure. We show that the monotone convergence theorem and Fatou’s lemma are still true in this new setting. We study some of the properties of this integral, and show that it coincides with another fuzzy integral defmed in the literature. Our main result is a convergence theorem, that is in a...

Shafer (Economelrica 48 (1980), 467476) proved that in a finite exchange economy value allocations exist, provided that each agent has convex, complete, transitive, compact and monotone preferences. However, if preferences are not convex, then value allocations may not exist. To remedy this difficulty we enlarge the set of value allocations by introducing the concept of approximate value alloca...

Probabilisticmodel checking is a technique for verifyingwhether amodel such as aMarkov chain satisfies a probabilistic, behavioral property – e.g. ‘‘with probability at least 0.999, a device will be elected leader’’. Such properties are expressible in probabilistic temporal logics, e.g. PCTL, and efficient algorithms exist for checking whether these formulae are true or false on finite-state mo...