Rigidity of a simple extended lower triangular matrix

For the all-ones lower triangular matrices, the upper and lower bounds on rigidity are known to match [P. Pudlak, Z. Vavrin, Computation of rigidity of order n²/r for one simple matrix, Comment Math. Univ. Carolin. 32 (2) (1991) 213-218]. In this short note, we apply these techniques to the all-ones extended lower triangular matrices, to obtain upper and lower bounds with a small gap between the two; we show that the rigidity is .     

电子商务网站搜索引擎优化(SEO)策略研究

搜索引擎优化对电子商务网站推广起着重要的作用。在分析影响搜索引擎网站排名因素的基础上,总结出有利于提高电子商务网站排名的搜索引擎优化(SEO)策略。     

基于多维度的新型排名算法

在处理各项指标成绩线性之和相差不多,而要使成绩平均程度高的排名对象排在前面的排名问题时,普通排名算法存在着一定的局限性。基于多维度的新型排名算法,使得各项考核指标成绩越平均的排名对象名次越靠前,该算法科学合理,应用范围广,有较强的实用性。首介绍了该算法的基本原理,分别通过理论和实例论证了这种新型排名算法的优势,最后基于该算法利用Java语言实现了一个简单的排名软件。     

Optimal design of a distribution-free quality control scheme for cost-efficient monitoring of unknown location

Traditionally, a cost-efficient control chart for monitoring product quality characteristic is designed using prior knowledge regarding the process distribution. In practice, however, the functional form of the underlying process distribution is rarely known a priori. Therefore, the nonparametric (distribution-free) charts have gained more attention in the recent years. These nonparametric schemes are statistically designed either with a fixed in-control average run length or a fixed false alarm rate. Robust and cost-efficient designs of nonparametric control charts especially when the true process location parameter is unknown are not adequately addressed in literature. For this purpose, we develop an economically designed nonparametric control chart for monitoring unknown location parameter. This work is based on the Wilcoxon rank sum (hereafter WRS) statistic. Some exact and approximate procedures for evaluation of the optimal design parameters are extensively discussed. Simulation results show that overall performance of the exact procedure based on bootstrapping is highly encouraging and robust for various continuous distributions. An approximate and simplified procedure may be used in some situations. We offer some illustration and concluding remarks.     

Rank 2 proximal Cantor systems are residually scrambled

Downarowicz and Maass [7 T. Downarowicz and A. Maass, Finite-rank Bratteli–Vershik diagrams are expansive, Ergod. Th. Dynam. Sys. 28 (2008), pp. 739–747.[Web of Science ®] , [Google Scholar]] proposed topological ranks for all homeomorphic Cantor minimal dynamical systems using properly ordered Bratteli diagrams. In this study, we adopt this definition to the case of the essentially minimal zero-dimensional systems. We consider the cases in which topological ranks are 2 and unique minimal sets are fixed points. Akin and Kolyada [2 E. Akin and S. Kolyada, Li–Yorke sensitivity, Nonlinearity 16(4) (2003), pp. 1421–1433.[Crossref], [Web of Science ®] , [Google Scholar]], had shown that if the unique minimal set of an essentially minimal system is a fixed point, then the system must be proximal. The finite topological rank implies expansiveness; furthermore, in the case of proximal Cantor systems with topological rank 2, the expansiveness is always from the lowest degree. Rank 2 proximal Cantor systems are residually scrambled. We present a necessary and sufficient condition for the unique ergodicity of these systems. In addition, we show that the number of ergodic measures of the systems that are topologically mixing can be 1 and 2. Moreover, we present examples that are topologically weakly mixing, not topologically mixing, and uniquely ergodic. Finally, we show that the number of ergodic measures of the systems that are not weakly mixing can be 1 and 2.     

抗干扰的运动目标检测算法

针对改进族群进化算法(EGEA)中对族群模式的有效采样问题,提出以竞争指数为选择指标的常规选择、以族群为选择单位的常规选择以及基于竞争指数的模拟退火排序选择3种选择机制,并通过多维函数优化问题进行实验分析,结果表明3种选择机制都能够在一定程度上提高EGEA的搜索效率,且基于竞争指数的模拟退火排序选择算子的实现更简便,对EGEA综合性能的提高也更明显。     

Semisimple algebras of almost minimal rank over the reals

A famous lower bound for the bilinear complexity of the multiplication in associative algebras is the Alder–Strassen bound. Algebras for which this bound is tight are called algebras of minimal rank. After 25 years of research, these algebras are now well understood. Here we start the investigation of the algebras for which the Alder–Strassen bound is off by one. As a first result, we completely characterize the semisimple algebras over R$\mathbb{R}$ whose bilinear complexity is by one larger than the Alder–Strassen bound. Furthermore, we characterize all algebras A$A$ (with radical) of minimal rank plus one over R$\mathbb{R}$ for which A/radA$A/radA$ has minimal rank plus one. The other possibility is that A/radA$A/radA$ has minimal rank. For this case, we only present a partial result.     

ARM嵌入式系统模糊可靠性评价

嵌入式系统在现在和可预见的未来的生活中发挥着举足轻重的作用,而其可靠性成为制约行业发展的关键技术.针对常规设计中更多的侧重于系统各项功能性实现,较少关注系统的可靠性问题,在总结常规可靠性设计方法的基础上,从嵌入式系统硬件和软件结合的角度提出了一种新的ARM嵌入式系统可靠性等级评价方法.该评价方法将各个量化因子用折线相连,计算其围成图形的面积与最大图形面积之比,由此得到系统的可靠性等级.将该方法应用于所设计的ARM嵌入式数据采集器,评价结果表明,数据采集器的可靠性大于80％,系统可靠稳定.     

词语序差的分布特点与文本间词汇异同

该文在已有关于“频级”“频序”研究的基础上,结合两种不同类型的语料,采用词汇计量分析方法,考察词语的“序差”所具有的分布特点。该研究发现,对于两种文本的共有词集,词的序差呈对称分布,且集中分布于中位数附近,存在离群值序差。这一特点在序差图上表现为“中段平直,双尾翘曲”的“双尾分布”形态。根据词语序差的分布规律,可以将文本共有词划分为“中段”“下尾”“上尾”三个层次。“中段”词语反映两个文本的共性特征,“下尾”及“上尾”词语反映两个文本的差异性特征,这些特征具有反映文本的主题内容和文体风格的语言学意义。     

分类错误指导的分层B-CNN模型用于细粒度分类

目的 细粒度分类近年来受到了越来越多研究者的广泛关注,其难点是分类目标间的差异非常小。为此提出一种分类错误指导的分层双线性卷积神经网络模型。方法 该模型的核心思想是将双线性卷积神经网络算法（B-CNN）容易分错、混淆的类再分别进行重新训练和分类。首先,为得到易错类,提出分类错误指导的聚类算法。该算法基于受限拉普拉斯秩（CLR）聚类模型,其核心“关联矩阵”由“分类错误矩阵”构造。其次,以聚类结果为基础,构建了新的分层B-CNN模型。结果 用分类错误指导的分层B-CNN模型在CUB-200-2011、 FGVC-Aircraft-2013b和Stanford-cars 3个标准数据集上进行了实验,相比于单层的B-CNN模型,分类准确率分别由84.35%,83.56%,89.45%提高到了84.67%,84.11%,89.78%,验证了本文算法的有效性。结论 本文提出了用分类错误矩阵指导聚类从而进行重分类的方法,相对于基于特征相似度而构造的关联矩阵,分类错误矩阵直接针对分类问题,可以有效提高易混淆类的分类准确率。本文方法针对比较相近的目标,尤其是有非常相近的目标的情况,通过将容易分错、混淆的目标分组并进行再训练和重分类,使得分类效果更好,适用于细粒度分类问题。