一般化凸空间上的变分不等式解的存在性问题

在本文,我们首先给出了KKM型定理和择一定理,然后根据上述结果讨论了一 般化凸空间上变分不等式解的存在性问题.     

Graphs with only caterpillars as spanning trees

A connected graph G is caterpillar-pure if each spanning tree of G is a caterpillar. The caterpillar-pure graphs are fully characterized. Loosely speaking they are strings or necklaces of so-called pearls, except for a number of small exceptional cases. An upper bound for the number of edges in terms of the order is given for caterpillar-pure graphs, and those which attain the upper bound are characterized.     

基于残差平方和的线性模型选择简单方法及其相合性研究

本文研究了回归分析理论中的自变量选择的重要问题,利用线性回归模型自变量增减的残差平方和理论,获得了一种选择自变量的准则,该准则的分析表明,它计算简单,而且在一定的条件下具有强相合性.     

不允许卖空证券组合选择的有效子集

证券组合选择的有效子集是指它可取代原有的基本证券集来生成Markowits有效组合前沿.本文给出一个证券集的子集在不允许卖空的条件下是全集的有效子集的充要条件。     

非线性DEDS的周期时间部分合并配置与能稳性

对于具有状态反馈的非自治非线性DEDS,通过引入强连通系的最大能并子集,定义了周期时间部分合并配置和能稳性,给出了周期时间部分合并配置的一个充要条件以及能稳性的一个充分条件,前者推广了已有结果.     

模糊综合评价模型在教师评价中的应用

教师评价是教育评价的一个重要环节 ,我国教师评价的历史不长 ,所以目前尚未建立起科学的评价体系 ,由于教师评价的多因素性及评价因素的模糊性 ,可以用模糊数学建立综合评价模型 .     

关于k—覆盖图的一些新结果

本文给出了一个图G是k-覆盖图的若干充分条件．     

Network reinforcement

We give an algorithm for the following problem: given a graph G=(V,E) with edge-weights and a nonnegative integer k, find a minimum cost set of edges that contains k disjoint spanning trees. This also solves the following reinforcement problem: given a network, a number k and a set of candidate edges, each of them with an associated cost, find a minimum cost set of candidate edges to be added to the network so it contains k disjoint spanning trees. The number k is seen as a measure of the invulnerability of a network. Our algorithm has the same asymptotic complexity as |V| applications of the minimum cut algorithm of Goldberg & Tarjan. Received: April, 2004     

On Left Regular Ordered Semigroups

The main result of the paper is a decomposition theorem of the left regular ordered semigroups into left regular and left simple semigroups.     

On fuzzy multi-valued functions part 3: Fixed-point theorem

In this paper a Fixed-Point Theorem and an application is presented.