Stochastic dominance with nonadditive probabilities

Choquet expected utility which uses capacities (i.e. nonadditive probability measures) in place of-additive probability measures has been introduced to decision making under uncertainty to cope with observed effects of ambiguity aversion like the Ellsberg paradox. In this paper we present necessary and sufficient conditions for stochastic dominance between capacities (i.e. the expected utility with respect to one capacity exceeds that with respect to the other one for a given class of utility functions). One wide class of conditions refers to probability inequalities on certain families of sets. To yield another general class of conditions we present sufficient conditions for the existence of a probability measureP with f dC= f dP for all increasing functionsf whenC is a given capacity. Examples includen-th degree stochastic dominance on the reals and many cases of so-called set dominance. Finally, applications to decision making are given including anticipated utility with unknown distortion function.     

关于复杂度,亏群与不可分解模的若干说明

在本文中，我们给出了CG^ (B)≤2但不满意当p=2时CG^ (B)=CG^-(B)=2的p-可解群的块B的亏群的结构。同时亦给出关于复杂度与不可分解模的若干说明。     

Rank, term rank, and chromatic number

Let G be a graph with a nonempty edge set, and with rank rk(G), term rank Rk(G), and chromatic number χ(G). We characterize Rk(G) as being the maximum number of colors in certain proper colorings of G. In particular, we observe that χ(G)Rk(G), with equality holding if and only if (besides isolated vertices) G is either complete or a star. For a twin-free graph G, we observe the bound and we show that this bound is sharp.     

The Rank of a Direct Power of a Small-Cancellation Group

We construct an example of a finitely generated group G such that rank((G )ⁿ)=2 for all n1. For each n, we construct a finitely presented group G _n such that rank((G _n )ⁿ)=2. We conjecture that if G is a word-hyperbolic group then rank(G ⁿ ) as $ n. For each m we give an example of a residually finite group K _m such that K _m has exactly two relators, but K _m has no proper subgroups of index $ m. We construct a finitely generated group D such that there is an epimorphism DD×D.     

Test Sets in Free Metabelian Lie Algebras

We calculate the test rank of a finite rank free metabelian Lie algebra over an arbitrary field and characterize the test sets for these algebras. We prove that each automorphism that is the identity modulo the derived subalgebra and that acts as the identity on some test set is an inner automorphism.     

Asymptotic Bound on the Characteristic Function of Signed Linear Serial Rank Statistics

This work establishes an asymptotic bound on the characteristic function of signed linear serial rank statistics. The result is obtained under rather general conditions including the important case of van der Waerden scores. It generalizes the result of Seoh (1983, Ph.D. Thesis, Department of Mathematics, Indiana University) and constitutes an essential step to the elaboration of Berry-Esséen's bounds and the establishment of Edgeworth expansions. These statistics constitute a natural tool for testing the hypothesis of white noise with a symmetrical (unspecified) distribution in comparison to other alternative hypothesis of serial dependence.     

Calibrating software reliability models when the test environment does not match the user environment

Software failures have become the major factor that brings the system down or causes a degradation in the quality of service. For many applications, estimating the software failure rate from a user's perspective helps the development team evaluate the reliability of the software and determine the release time properly. Traditionally, software reliability growth models are applied to system test data with the hope of estimating the software failure rate in the field. Given the aggressive nature by which the software is exercised during system test, as well as unavoidable differences between the test environment and the field environment, the resulting estimate of the failure rate will not typically reflect the user‐perceived failure rate in the field. The goal of this work is to quantify the mismatch between the system test environment and the field environment. A calibration factor is proposed to map the failure rate estimated from the system test data to the failure rate that will be observed in the field. Non‐homogeneous Poisson process models are utilized to estimate the software failure rate in both the system test phase and the field. For projects that have only system test data, use of the calibration factor provides an estimate of the field failure rate that would otherwise be unavailable. For projects that have both system test data and previous field data, the calibration factor can be explicitly evaluated and used to estimate the field failure rate of future releases as their system test data becomes available. Copyright © 2002 John Wiley & Sons, Ltd.     

How to Express a Parallel Sum of k Matrices

We present an alternative expression for the parallel sum of k Hermitian nonnegative definite matrices by using the Moore-Penrose inverse of a block matrix.     

The minimum forcing number of perfect matchings in the hypercube

Let $M$ be a perfect matching in a graph. A subset $S$ of $M$ is said to be a forcing set of $M$, if $M$ is the only perfect matching in the graph that contains $S$. The minimum size of a forcing set of $M$ is called the forcing number of $M$. Pachter and Kim (1998) conjectured that the forcing number of every perfect matching in the $n$-dimensional hypercube is $2^{n?2}$, for all $n\ge 2$. This was revised by Riddle (2002), who conjectured that it is at least $2^{n?2}$, and proved it for all even $n$. We show that the revised conjecture holds for all $n\ge 2$. The proof is based on simple linear algebra.