可允许集上的广义向量拟均衡问题

主要讨论可允许集上的广义向量拟均衡问题,推广L in的一些结果.     

Pre—Separation Axioms in Fuzzifying Topology

1　 IntroductionYing[5,6 ] introduced and elementally developed so called fuzzifying topology with the semanticmethod of continuous valued L ogic.Shen[7] introduced and studied T0 -,T1-,T2 (Hausdorff) -,T3(regularity) -,T4 (normality) -separation axioms in fuzzifying topology.In [3 ]the concepts of thefamily of fuzzifying pre-open sets,fuzzifying pre-neighbourhood structure of a point and fuzzifyingpre-closure are introduced and studied.It is worth to mention that pre-separation axioms are …     

Complete Surjections and Complete Epimorphisms over Completely Distributive Lattices

Generators and lattice properties of the poset of complete homomorphisic images of a completely distributive lattice are exploited via the localic methods. Some intrinsic and extrinsic conditions about this poset to be a completely distributive lattice are given. It is shown that the category of completely distributive lattices is co-well-powered,and complete epimorphisms on completely distributive lattice are not necessary to be surjections. Finally, some conditions about complete epimorphisms to be surjections are given.     

Spectrum is periodic for n-intervals

In this paper we study spectral sets which are unions of finitely many intervals in R. We show that any spectrum associated with such a spectral set Ω is periodic, with the period an integral multiple of the measure of Ω. As a consequence we get a structure theorem for such spectral sets and observe that the generic case is that of the equal interval case.     

Solving Nonconvex Planar Location Problems by Finite Dominating Sets

It is well-known that some of the classical location problems with polyhedral gauges can be solved in polynomial time by finding a finite dominating set, i.e. a finite set of candidates guaranteed to contain at least one optimal location.In this paper it is first established that this result holds for a much larger class of problems than currently considered in the literature. The model for which this result can be proven includes, for instance, location problems with attraction and repulsion, and location-allocation problems.Next, it is shown that the approximation of general gauges by polyhedral ones in the objective function of our general model can be analyzed with regard to the subsequent error in the optimal objective value. For the approximation problem two different approaches are described, the sandwich procedure and the greedy algorithm. Both of these approaches lead - for fixed - to polynomial approximation algorithms with accuracy for solving the general model considered in this paper.     

关于模糊复数的两个表现定理

给出模糊复数的两个表现定理。     

Embedding with a Lipschitz function

We investigate a new notion of embedding of subsets of {?1,1}ⁿ in a given normed space, in a way which preserves the structure of the given set as a class of functions on {1, …, n}. This notion is an extension of the margin parameter often used in Nonparametric Statistics. Our main result is that even when considering “small” subsets of {?1, 1}ⁿ, the vast majority of such sets do not embed in a better way than the entire cube in any normed space that satisfies a minor structural assumption. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005     

Two-stage integer programs with stochastic right-hand sides: a superadditive dual approach

We consider two-stage pure integer programs with discretely distributed stochastic right-hand sides. We present an equivalent superadditive dual formulation that uses the value functions in both stages. We give two algorithms for finding the value functions. To solve the reformulation after obtaining the value functions, we develop a global branch-and-bound approach and a level-set approach to find an optimal tender. We show that our method can solve randomly generated instances whose extensive forms are several orders of magnitude larger than the extensive forms of those instances found in the literature. This work is supported by National Science Foundation grants DMI-0217190 and DMI-0355433.     

连续值域信息系统的规则提取与知识约简

研究连续值域信息系统的规则提取和知识约简，给出规则提取的完整方法和2种新的知识约简的概念，讨论各种协调集之间的关系，探讨系统允许误差变化对规则提取的影响。