一本教材中的一道错误习题

指出北航版工科研究生教材《矩阵论引论》中一道有关满秩分解定理应用的习题存在错误,并进行纠正.此题经过适当修改,还可得到一道构造性的习题.     

Rank Properties in Finite Semigroups II: The Small Rank and the Large Rank

This paper is concerned with the application of two possible definitions of rank to certain well-known semigroups.AMS Subject Classification (2000), 20M10     

区间判断的凸锥模型与排序方法

本文用凸锥模型对层次分析法中区间判断条件下的排序问题进行研究，给出了权重向量的合理算法．并对区间判断下权重向量的合理位置，产生逆序的可能性等重要问题进行了探讨和研究，给出了计算实例．     

Wreath Products and Universal Equivalence

We consider the question of preservation of universal equivalence for the cartesian and direct wreath products of lattice-ordered groups and groups. We prove that the basic rank is infinite of the quasivariety of torsion-free nilpotent groups of nilpotence length c (c2)     

矩阵多项式秩的和的恒等式及其应用

证明了矩阵A的两个多项式秩的和等于它们最大公因式与最小公倍式秩的和,这个结果不仅可以概括近期文献的相关工作,而且可以对应用矩阵多项式求逆矩阵的方法作进一步的研究,同时也可使关于矩阵秩恒等式的最新讨论获得一种简单统一的处理方法.     

排名聚合算法在少量长列表聚合中的性能比较分析

排名聚合将多个排名列表聚合成一个综合排名列表,可应用于推荐系统、链路预测、元搜索、提案评选等.当前已有工作从不同角度对不同排名聚合算法进行了综述、比较,但存在算法种类较少、数据统计特性不清晰、评价指标不够合理等局限性.不同排名聚合算法在提出时均声称优于已有算法,但是用于比较的方法不同,测试的数据不同,应用的场景不同,因此何种算法最能适应某一任务在很多情况下仍不甚清楚.本文基于Mallows模型,提出一套生成统计特性可控的不同类型的排名列表的算法,使用一个可应用于不同类型排名列表的通用评价指标,介绍9种排名聚合算法以及它们在聚合少量长列表时的表现.结果发现启发式方法虽然简单,但是在排名列表相似度较高、列表相对简单的情况下,能够接近甚至超过一些优化类方法的结果;列表中平局数量的增长会降低聚合排名的一致性并增加波动;列表数量的增加对聚合效果的影响呈现非单调性.整体而言,基于距离优化的分支定界方法 (FAST)优于其他各类算法,在不同类型的排名列表中表现非常稳定,能够很好地完成少量长列表的排名聚合.     

Characterizing and Generating Bivariate Empirical Rank Distributions Satisfying Certain Positive Dependence Concepts

Abstract

This article introduces an approach for characterizing the classes of empirical distributions that satisfy certain positive dependence notions. Mathematically, this can be expressed as studying certain subsets of the class S_N of permutations of 1, …, N, where each subset corresponds to some positive dependence notions. Explicit techniques for it-eratively characterizing subsets of S_N that satisfy certain positive dependence concepts are obtained and various counting formulas are given. Based on these techniques, graph-theoretic methods are used to introduce new and more efficient algorithms for constructively generating and enumerating the elements of various of these subsets of S_N. For example, the class of positively quadrant dependent permutations in S_N is characterized in this fashion.     

On noncommutative piecewise Noetherian rings

We extend the definition of a piecewise Noetherian ring to the noncommutative case, and investigate various properties of such rings. In particular, we show that a ring with Krull dimension is piecewise Noetherian. Certain fully bounded piecewise Noetherian rings have Gabriel dimension and exhibit the Gabriel correspondence between prime ideals and indecomposable injective modules.     

Mixed-type reverse-order laws of (AB) and (AB)

In this paper, by using the extremal ranks of generalized Schur complements, we study the mixed-type reverse-order laws for (AB)^(1,2,3) and (AB)^(1,2,4), and the sufficient and necessary conditions are established for these two reverse-order laws. Finally, two numerical examples are given to illustrate our results.