Meyniel's conjecture holds for random d‐regular graphs

In the game of cops and robber, the cops try to capture a robber moving on the vertices of the graph. The minimum number of cops required to win on a given graph G is called the cop number of G. The biggest open conjecture in this area is the one of Meyniel, which asserts that for some absolute constant C, the cop number of every connected graph G is at most . In a separate paper, we showed that Meyniel's conjecture holds asymptotically almost surely for the binomial random graph. The result was obtained by showing that the conjecture holds for a general class of graphs with some specific expansion‐type properties. In this paper, this deterministic result is used to show that the conjecture holds asymptotically almost surely for random d‐regular graphs when d = d(n) ≥ 3.     

处理噪声问题的泰勒展开交替最小化算法

为了处理图像、计算机视觉和生物信息等领域中广泛存在的稀疏大噪声和高斯噪声问题,提出了一种利用交替方向最小化思想求解主成分追求松弛模型的泰勒展开交替最小化算法(TEAM).采用推广泰勒展开和收缩算子等技术推导出低秩矩阵和稀疏大噪声矩阵的迭代方向矩阵,加入连续技术提高算法的收敛速率,设计出TEAM算法的求解步骤.实验中,将TEAM算法与该领域的顶级算法作分析对比.结果表明,TEAM算法时间优势明显,误差优势略好.     

投影寻踪模型在国民经济综合评价中的应用

文章针对区域国民经济发展的多属性,采用投影寻踪评价模型,用加速遗传算法寻找最佳投影方向,将多维属性指标转换为一维投影值.在此基础上,通过建立单属性指标的分类等级区间,给出区域国民经济发展水平分类的投影值区间,从而实现对区域国民经济发展水平的分类.应用表明,它是国民经济评价的一种计算过程简单、直观的新方法.     

Analysis of orthogonal multi-matching pursuit under restricted isometry property

Orthogonal multi-matching pursuit(OMMP)is a natural extension of orthogonal matching pursuit(OMP)in the sense that N(N≥1)indices are selected per iteration instead of 1.In this paper,the theoretical performance of OMMP under the restricted isometry property(RIP)is presented.We demonstrate that OMMP can exactly recover any K-sparse signal from fewer observations y=φx,provided that the sampling matrixφsatisfiesδKN-N+1+(K/N)~(1/2)θKN-N+1,N1.Moreover,the performance of OMMP for support recovery from noisy observations is also discussed.It is shown that,for l_2 bounded and l_∞bounded noisy cases,OMMP can recover the true support of any K-sparse signal under conditions on the restricted isometry property of the sampling matrixφand the minimum magnitude of the nonzero components of the signal.     

基于组合权重的系统评价模型

提出了基于组合权重的系统评价新模型 ( CWSE) ,即 :直接根据评价指标样本数据集 ,用基于加速遗传算法的投影寻踪方法确定各评价指标的分类权重 ,用基于加速遗传算法的层次分析法确定各评价指标的排序权重 ,用加速遗传算法对各评价指标的分类权重和排序权重进行综合得到组合权重 ,然后以这些组合权重与各评价对象相应评价指标的标准化值进行加权平均 ,得到系统评价的综合指标值 ,据此可对各评价对象进行分类排序 .用 CW SE模型评价中国 30个区域 1995年开发度的结果表明 ,根据开发度的强弱可把这些区域分成 3个强开发区域、6个较强开发区域、10个中等开发区域和 11个弱开发区域 ;CWSE模型简便、通用 ,计算结果较为客观和稳定 ,为系统工程理论和实践提供了新的研究方法 .     

Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method

In this paper, we propose a Quasi-Orthogonal Matching Pursuit (QOMP) algorithm for constructing a sparse approximation of functions in terms of expansion by orthonormal polynomials. For the two kinds of sampled data, data with noises and without noises, we apply the mutual coherence of measurement matrix to establish the convergence of the QOMP algorithm which can reconstruct $s$-sparse Legendre polynomials, Chebyshev polynomials and trigonometric polynomials in $s$ step iterations. The results are also extended to general bounded orthogonal system including tensor product of these three univariate orthogonal polynomials. Finally, numerical experiments will be presented to verify the effectiveness of the QOMP method.     

基于投影寻踪分类模型的高管团队战略协同分析

着眼于企业高管团队战略协同系统所蕴含的学术与实践价值,研究系统效能重于高管团队自身的作为,关注系统优化则更重于传统模式下高管团队的内部建设.本文首先探究了高管团队与企业战略的协同机理;然后将基于实码加速遗传算法的投影寻踪分类模型技术引入子系统及子系统序参量的权重计算和有序度评价,提出了新的协同度评价方法,建立了高管团队的战略协同度评价模型;应用该模型对S企业进行了实例研究,印证了模型的可操作性.企业高管团队的战略协同度评价结果有助于识别具体企业高管团队战略协同进程中的制约要素,从而有针对性地提出优化对策.     

水资源短缺风险因子的筛选模型

水资源短缺评价首先需要确定指标体系,投影寻踪模型与灰色关联度法相结合,可以有效地筛选出水资源短缺风险因子,为进一步进行风险评价奠定了基础,同时也为制定风险的防范措施和对策提供了理论依据.综合应用这两种模型,对北京市2001～2009年的水资源短缺风险进行研究,结果表明:降水量、日照时数、雨日数、单位GDP污水排放量、人均GDP、工业总产值占有率、污水处理率和水循环使用率这8个指标是北京市水资源短缺的主要风险因子.