Let X be an arbitrary nonempty set and a lattice of subsets of X such that φ, X∈ . ( ) is the algebra generated by and ( ) denotes those nonnegative, finite, finitely additive measures μ on ( ). I( ) denotes the subset of ( ) of nontrivial zeroone valued measures. Associated with μ ∈ I( ) (or Iσ ( )) are the outer measures μ′ and μ′′ considered in detail. In addition, measurability conditions a...

In this work we derive a variant of the classic Glivenko-Cantelli Theorem, which asserts uniform convergence of the empirical Cumulative Distribution Function (CDF) to the CDF of the underlying distribution. Our variant allows for tighter convergence bounds for extreme values of the CDF. We apply our bound in the context of revenue learning, which is a well-studied problem in economics and algo...

We investigate k-connectivity in secure wireless sensor networks under the random pairwise key predistribution scheme with unreliable links; a network is said to be kconnected if it remains connected despite the failure of any of its (k − 1) nodes or links. With wireless communication links modeled as independent on-off channels, this amounts to analyzing a random graph model formed by intersec...

We study the polyhedral convex hull of a mixed-integer set S defined by a collection of multilinear equations of the form yI = ∏ i∈I xi over the 0−1-cube. Such sets appear frequently in the factorable reformulation of mixed-integer nonlinear optimization problems. In particular, the set S represents the feasible region of a linearized unconstrained zeroone polynomial optimization problem. We de...

A single machine scheduling problem where the objective is to minimize the variance of job completion times is considered. The model is applicable to many environments where it is desirable to provide jobs, customers or computer files, with approximately the same service. It is shown that the problem can be formulated as a problem of maximizing a zeroone quadratic function which is a submodular...

a theorem was recently introduced to establish a relationship betweengoal programming and fuzzy programming for vectormaximum problems.in this short note it is shown that the relationship does not exist underall circumstances. the necessary correction is proposed.

While at first glance the fields of logic and probability may appear as immiscible as oil and water, a closer look reveals that probabilistic questions about logic often have surprisingly elegant and powerful answers. For instance, one might wonder “What is the probability that a certain sentence in a certain logic holds for a randomly chosen structure?” Though in many cases this question will ...

in this paper, a mathematical method is proposed to formulate a generalized ordering problem. this model is formed as a linear optimization model in which some variables are binary. the constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. on the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...