Inclusion–exclusion principle for belief functions

The inclusion–exclusion principle is a well-known property in probability theory, and is instrumental in some computational problems such as the evaluation of system reliability or the calculation of the probability of a Boolean formula in diagnosis. However, in the setting of uncertainty theories more general than probability theory, this principle no longer holds in general. It is therefore useful to know for which families of events it continues to hold. This paper investigates this question in the setting of belief functions. After exhibiting original sufficient and necessary conditions for the principle to hold, we illustrate its use on the uncertainty analysis of Boolean and non-Boolean systems in reliability.     

Truth,belief and experience — a route to information

In gratitude to Klaus Krickeberg who introduced the author to Shannons information theory, this contribution is devoted to certain basic considerations which are consistent with, yet carry you beyond Shannons original ideas from 1948, cf. [13]. Fact is that since Shannons pioneering work — to a great extent centred around the notion of entropy — a jungle of alternative entropy measures have been suggested. Philosophical speculation will lead us through this jungle and lay out a narrow path of special entropy measures, the so-called Tsallis entropies, thereby providing these entropy measures with special credibility. Dedicated to the 80th birthday of Klaus Krickeberg     

A false belief about fractions – What is its source?

This paper presents the results of interviews with 174 participants solving a problem of elementary mathematics, connected with the part–whole approach to fractions. The motive for the investigation was a specific kind of difficulty observed during a case study conducted to verify the elementary school student's understanding of the concept of fractions. The authors decided to examine the problem in a broader population of mathematics learners at different levels of education: from elementary school to university students and graduates of science majors. Approximately 65% of respondents reported the wrong answer immediately after reading the fraction problem taken from the fourth grade of elementary school. Detailed analysis of the respondents’ performance showed that the source of many wrong answers was a false belief about fractions: The only way to get 1/n of a given whole is to divide this whole into n equal parts, not yet described in educational literature.     

Joint cumulative distribution functions for Dempster–Shafer belief structures using copulas

We first introduce the Dempster–Shafer belief structure and highlight its role in the representation of information about a random variable for which our knowledge of the probabilities is interval-valued. We investigate the formation of the cumulative distribution function (CDF) for these types of variables. It is noted that this is also interval-valued and is expressible in terms of plausibility and belief measures. The class of aggregation operators known as copulas are introduced and a number of their properties are provided. We discuss Sklar’s theorem, which provides for the use of copulas in the formulation of joint CDFs from the marginal CDFs of classic random variables. We then look to extend these ideas to the case of joining the marginal CDFs associated with Dempster–Shafer belief structures. Finally we look at the formulation CDFs obtained from functions of multiple D–S belief structures.     

Leveraging belief propagation, backtrack search, and?statistics for model counting

We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as either lower or upper bounds with different trade-offs between efficiency, bound quality, and correctness guarantee. For lower bounds, we use a recent framework for probabilistic correctness guarantees, and exploit message passing techniques for marginal probability estimation, namely, variations of the Belief Propagation (BP) algorithm. Our results suggest that BP provides useful information even on structured, loopy formulas. For upper bounds, we perform multiple runs of the MiniSat SAT solver with a minor modification, and obtain statistical bounds on the model count based on the observation that the distribution of a certain quantity of interest is often very close to the normal distribution. Our experiments demonstrate that our model counters based on these two ideas, BPCount and MiniCount, can provide very good bounds in time significantly less than alternative approaches.     

Evidential evolving Gustafson–Kessel algorithm for online data streams partitioning using belief function theory

A new online clustering method called E2GK (Evidential Evolving Gustafson–Kessel) is introduced. This partitional clustering algorithm is based on the concept of credal partition defined in the theoretical framework of belief functions. A credal partition is derived online by applying an algorithm resulting from the adaptation of the Evolving Gustafson–Kessel (EGK) algorithm. Online partitioning of data streams is then possible with a meaningful interpretation of the data structure. A comparative study with the original online procedure shows that E2GK outperforms EGK on different entry data sets. To show the performance of E2GK, several experiments have been conducted on synthetic data sets as well as on data collected from a real application problem. A study of parameters’ sensitivity is also carried out and solutions are proposed to limit complexity issues.     

Sums of Squares of Integers

We find a formula for the sum of the first n squares:Sn = 12 22 32 42 … n2.We haveS1 = 1, S2 = 12 22 = 5, S3 = l2 22 32 = 14,S4 = 30, S5 = 55, S6 = 91.and so on. To make things a little simpler, we will also use the sum of the squares of the first zero terms , S0 = 02 = 0. Arranging these values in a table,we find thatSince the third differenes △3Sn are constant,these data values must follow a cubic pattern;that is, the formula for the sum of the squares of the first n integers is a cubic function,     

Vertices of π-Irreducible Characters of Groups of Odd Order

If G is a group of odd order and χ ∈ Irr(G) lifts an irreducible Brauer character ?, then we associate to χ a canonical pair (Q, δ) up to G-conjugacy, where Q is a vertex of ? and δ ∈ Irr(Q) is a linear character of Q. We show that (Q, δ) is a Navarro vertex for χ. We also discuss examples.     

Stability of Solution of a Class of Quasilinear Elliptic Equations

In this paper, using capacity theory and extension theorem of Lipschitz functions we first discuss the uniqueness of weak solution of nonhomogeneous quasilinear elliptic equationsin space W(θ,p)(Ω), which is bigger than W1,p(Ω). Next, using revise reverse Holder inequality we prove that if ωc is uniformly p-think, then there exists a neighborhood U of p, such that for all t ∈U, the weak solutions of equation corresponding t are bounded uniformly. Finally, we get the stability of weak solutions on exponent p.     

On the Growth of Components of Meromorphic Solutions of Systems of Complex Differential Equations

This paper investigates the problem of the growth of the components of meromorphic solutions of a class of a system of complex algebraic differential equations, and generalized some of N. Toda＇s results concerning the growth of differential equations to the case of systems of differential equations. The paper considers the existence of admissible solutions of the system of differential equations.     

Correlation of zeros of automorphic L-functions

We compute the n-level correlation of normalized nontrivial zeros of a product of L-functions:L(s,π1)···L(s,πk), where πj, j=1,...,k, are automorphic cuspidal representations of GLmj(QA). Here the sizes of the groups GLmj(QA) are not necessarily the same. When these L(s,πj) are distinct, we prove that their nontrivial zeros are uncorrelated, as predicted by random matrix theory and verified numerically. When L(s,πj) are not necessarily distinct, our results will lead to a proof that the n-level correlation of normalized nontrivial zeros of the product L-function follows the superposition of Gaussian Unitary Ensemble (GUE) models of individual L-functions and products of lower rank GUEs. The results are unconditional when m1,...,mk 4,but are under Hypothesis H in other cases.     

Extension of a Theorem of Carleson-Duren

1. Introduction A theorem of Carleson,as generalized by Duren characterizes those positive measure μ on the unit disc U={z∈C:|z|<1} for which the H~p norm domiates the L~q(μ) norm of elements of H~p. Later on, Hasting proved an analogous results with H~p replaced by A~p, the Bergman space of fuctions f     

Dynamics of Polynomial Automorphisms of C~N

ＤｙｎａｍｉｃｓｏｆＰｏｌｙｎｏｍｉａｌＡｕｔｏｍｏｒｐｈｉｓｍｓｏｆＣ~Ｎ￥ＺｈａｎｇＷｅｎｊｕｎ（ＨｅｎａｎＵｎｉｖｅｒｓｉｔｙ，Ｋａｉｆｅｎｇ，Ｐ．Ｒ．Ｃｈｉａｎ，４７５００１）Ａｂｓｔｒａｃｔ：Ｔｈｉｓｐａｐｅｒｉｓａｓｓｉｇｎｅｄｔｏｄｉｓ?..     

Estimates of groups of deviations of Faber sums and strong summability of faber series on classes of ψ-integrals

We establish upper bounds for a group of *-deviations of Faber sums on the classes of -integrals in a complex plane introduced by Stepanets.Translated from Ukrainskyi Matematychnyi Zhurnal, Vol. 56, No. 4, pp. 451–461, April, 2004.     

Lie Bialgebras of a Family of Lie Algebras of Block Type

Lie bialgebra structures on a family of Lie algebras of Block type are shown to be triangular coboundary.     

Group of Self-Equivalences of Sum Object

In general category, the group of self-equivalences of sum object can decompose as the product of its two subgroups under certain conditions and also several split short exact sequences are obtained. Subsequently, we apply the above results to the category of space under a space and get some results which are dual to those in fibrewise category.     

The Degree of Unsolvability of Models

The purpose of this paper is to describe the complexity of models by theirdegrees of unsolvability,J.Richter defined the degree of a structure to be deg ()=sup{deg(),deg(R_i),i=1,…,n},Where is a model for afinite language L={R_i,i=1,…,n}and the universe of is a subset of ω. Shepointed out that, according to her definition, there can be models which areisomorphic but their degrees are different.Also,her discussions are restricted tofinite languages and models whose universes are subsets of ω.