Fuzzy greedoids were recently introduced as a fuzzy set generalization of (crisp) greedoids. We characterize fuzzy languages which define fuzzy greedoids, give necessary properties and sufficient properties of the fuz...Fuzzy greedoids were recently introduced as a fuzzy set generalization of (crisp) greedoids. We characterize fuzzy languages which define fuzzy greedoids, give necessary properties and sufficient properties of the fuzzy rank function of a fuzzy greedoid, give a characterization of the rank function for a weighted greedoid, and discuss the rank closure of a fuzzy greedoid.展开更多
In many kinds of games with economic significance,it is very important to study the submodularity of functions.In this paper,wemainly study the problem of maximizing a concave function over an intersection of two matr...In many kinds of games with economic significance,it is very important to study the submodularity of functions.In this paper,wemainly study the problem of maximizing a concave function over an intersection of two matroids.We obtain that the submod-ularity may not be preserved,but it involves one maximal submodular problem(or minimal supermodular problem)with some conditions.Moreover,we also present examples showing that these conditions can be satisfied.展开更多
While the formulations of localization rank and stably free rank are given, the characterizations of elements are obtained for a class of VN regular ring. For a ring R, the characters of some properties of K0R are als...While the formulations of localization rank and stably free rank are given, the characterizations of elements are obtained for a class of VN regular ring. For a ring R, the characters of some properties of K0R are also given in terms of the state space of K0.展开更多
We present two recent methods,called UTAGMS and GRIP,from the viewpoint of robust ranking of multi-criteria alternatives.In these methods,the preference information provided by a single or multiple Decision Makers(DMs...We present two recent methods,called UTAGMS and GRIP,from the viewpoint of robust ranking of multi-criteria alternatives.In these methods,the preference information provided by a single or multiple Decision Makers(DMs)is composed of holistic judgements of some selected alternatives,called reference alternatives.The judgements express pairwise comparisons of some reference alternatives(in UTAGMS),and comparisons of selected pairs of reference alternatives from the viewpoint of intensity of preference(in GRIP).Ordinal regression is used to find additive value functions compatible with this preference information.The whole set of compatible value functions is then used in Linear Programming(LP)to calculate a necessary and possible weak preference relations in the set of all alternatives,and in the set of all pairs of alternatives.While the necessary relation is true for all compatible value functions,the possible relation is true for at least one compatible value function.The necessary relation is a partial preorder and the possible relation is a complete and negatively transitive relation.The necessary relations show consequences of the given preference information which are robust because "always true".We illustrate this methodology with an example.展开更多
在结构健康监测(Structural Health Monitoring,SHM)技术中,基于Lamb波的损伤监测方法在板状结构中显示出了巨大的潜力。提出了一种基于近似非凸鲁棒主成分分析(Approximate Non-Convex Robust Principal Component Analysis,ANC-RPCA)...在结构健康监测(Structural Health Monitoring,SHM)技术中,基于Lamb波的损伤监测方法在板状结构中显示出了巨大的潜力。提出了一种基于近似非凸鲁棒主成分分析(Approximate Non-Convex Robust Principal Component Analysis,ANC-RPCA)的异常值分析方法。该算法对于高维测量信号,能够在降维条件下实现有效的损伤诊断。通过使用秩近似函数逼近矩阵的秩,采用非凸惩罚函数逼近?_(0)范数,非凸惩罚函数在一定条件下可以保证稀疏解的唯一性。随着数据矩阵规模的扩大,传统的RPCA采用核范数近似时,奇异值分解的计算复杂度也会上升。新的近似方法能在使计算效率更高的情况下,针对波场图像能够在更低秩的水平下保留有效信息,识别出异常值。将该算法运用到基于Lamb波的波场图像中,通过仿真和实验数据验证其有效性,使用非精确增广拉格朗日乘子(Inexact Augmented Lagrange Multiplier,IALM)法求解,并与目前使用较多的主流RPCA算法进行了效果对比。实验结果表明ANC-RPCA算法在异常值识别中具有良好的性能,相较于其他算法,在计算效率和低秩性等方面具有巨大的优势,证明了所提算法的可靠性和完整性。展开更多
文摘Fuzzy greedoids were recently introduced as a fuzzy set generalization of (crisp) greedoids. We characterize fuzzy languages which define fuzzy greedoids, give necessary properties and sufficient properties of the fuzzy rank function of a fuzzy greedoid, give a characterization of the rank function for a weighted greedoid, and discuss the rank closure of a fuzzy greedoid.
基金supported by Higher Educational Science and Technology Program of Shandong Province(No.J17KA171)Natural Science and Engineering Research Council of Canada(No.06446)+1 种基金the National Natural Science Foundation of China(No.11871081)Science and Technology Program of Beijing Education Commission(No.KM201810005006).
文摘In many kinds of games with economic significance,it is very important to study the submodularity of functions.In this paper,wemainly study the problem of maximizing a concave function over an intersection of two matroids.We obtain that the submod-ularity may not be preserved,but it involves one maximal submodular problem(or minimal supermodular problem)with some conditions.Moreover,we also present examples showing that these conditions can be satisfied.
基金This work was partially supported by the National Natural Science Foundation of China (Grant No. 19901009) NSF of Guangdong Province (Grant Nos. 970472, 000463).
文摘While the formulations of localization rank and stably free rank are given, the characterizations of elements are obtained for a class of VN regular ring. For a ring R, the characters of some properties of K0R are also given in terms of the state space of K0.
文摘We present two recent methods,called UTAGMS and GRIP,from the viewpoint of robust ranking of multi-criteria alternatives.In these methods,the preference information provided by a single or multiple Decision Makers(DMs)is composed of holistic judgements of some selected alternatives,called reference alternatives.The judgements express pairwise comparisons of some reference alternatives(in UTAGMS),and comparisons of selected pairs of reference alternatives from the viewpoint of intensity of preference(in GRIP).Ordinal regression is used to find additive value functions compatible with this preference information.The whole set of compatible value functions is then used in Linear Programming(LP)to calculate a necessary and possible weak preference relations in the set of all alternatives,and in the set of all pairs of alternatives.While the necessary relation is true for all compatible value functions,the possible relation is true for at least one compatible value function.The necessary relation is a partial preorder and the possible relation is a complete and negatively transitive relation.The necessary relations show consequences of the given preference information which are robust because "always true".We illustrate this methodology with an example.
