Representation of Bounded Convex Sets By Rational Convex Hull Of Its Gamma-Extreme Points

H. Minkowski proved C= convext C whenever C is a compact convex subset of a finite-dimensional linear space. If C is bounded but not closed, this representation does not hold anymore. In this case, we introduce the set of so-called γ-extreme points extγC of C and show C = convext γ C = raco extγ C, where raco M denotes the rational convex hull of M.     

Convexity and Haar null sets

It is shown that for every closed, convex and nowhere dense subset of a superreflexive Banach space there exists a Radon probability measure on so that for all . In particular, closed, convex, nowhere dense sets in separable superreflexive Banach spaces are Haar null. This is unlike the situation in separable nonreflexive Banach spaces, where there always exists a closed convex nowhere dense set which is not Haar null.

     

Test sets for integer programs

In this paper I discuss various properties of the simplicial complex of maximal lattice free bodies associated with a matrixA. If the matrix satisfies some mild conditions, and isgeneric, the edges of the complex form the minimal test set for the family of integer programs obtained by selecting a particular row ofA as the objective function, and using the remaining rows to impose constraints on the integer variables.     

Difference systems of sets based on cosets partitions

Difference systems of sets （DSS） are combinatorial configurations that arise in connection with code synchronization. This paper proposes a new method to construct DSSs, which uses known DSSs to partition some of the cosets of Zv relative to subgroup of order k, where v = km is a composite number. As applications, we obtain some new optimal DSSs.     

Constrained regulation of continuous Petri nets

This paper deals with constrained regulation of continuous Petri nets under the so-called infinite servers semantics. Our aim is to design feedback gains that permit us to reach both desired stationary marking vector and desired asymptotic firing rate vector. The proposed approach takes into account constraints on the control, the marking of the Petri net, and the stability of the closed-loop system. The existence of a solution is first expressed geometrically, in terms of the inclusion of two polyhedral sets. They are reformulated algebraically as linear matrix inequalities, which provides an effective way to calculate feedback gains answering the problem. Finally, an application to an assembly production system is given.     

Refinement type equations and Grincevi?jus series

We consider L¹-solutions of the following refinement type equations

     

Bounds for the Perron root, singularity/nonsingularity conditions, and eigenvalue inclusion sets

Using a unified approach based on the monotonicity property of the Perron root and its circuit extension, a series of exact two-sided bounds for the Perron root of a nonnegative matrix in terms of paths in the associated directed graph is obtained. A method for deriving the so-called mixed upper bounds is suggested. Based on the upper bounds for the Perron root, new diagonal dominance type conditions for matrices are introduced. The singularity/nonsingularity problem for matrices satisfying such conditions is analyzed, and the associated eigenvalue inclusion sets are presented. In particular, a bridge connecting Gerschgorin disks with Brualdi eigenvalue inclusion sets is found. Extensions to matrices partitioned into blocks are proposed.     

Variable Fuzzy Sets and its Application in Comprehensive Risk Evaluation for Flood-control Engineering System

Due to significance of the engineering system for flood control and the multi-dimensional synthesis of the risk evaluation issue that the paper selects typical risk indexes to classify risk degree of flood-control engineering. Under global view of system that the variable fuzzy sets method is presented to set up comprehensive evaluation model for flood-control engineering system (FCES). The method can scientifically and reasonably determine membership degrees and relative membership functions of disquisitive indexes at level interval that relating to engineering, also it can fully use one’s experience and knowledge, qualitative and quantitative information of index system to obtain weights of indexes for operating comprehensive risk evaluation for FCES. The numerical example shows that the proposed method is feasible and effective, and the evaluation results are reasonable.     

基于粗集与概念格的属性简约讨论

概念格的属性简约是在形式背景下解决复杂问题的重要途径,通过对概念格、粗糙集的讨论,将两者有效结合,并借助粗糙集上(下)近似的方法,得出了一个对概念格属性简约的方法,方法将二维的概念格属性简约转化为一维的一种对象格的简约,避免了形式背景下的概念的计算和进一步的可辨识矩阵的计算,方法简便,算法简单易实现,是概念格属性简约有效的算法.     

The complexity of recursion theoretic games

We show that some natural games introduced by Lachlan in 1970 as a model of recursion theoretic constructions are undecidable, contrary to what was previously conjectured. Several consequences are pointed out; for instance, the set of all -sentences that are uniformly valid in the lattice of recursively enumerable sets is undecidable. Furthermore we show that these games are equivalent to natural subclasses of effectively presented Borel games.