Metric inequalities for routings on direct connections with application to line planning

We consider multi-commodity flow problems in which capacities are installed on paths. In this setting, it is often important to distinguish between flows on direct connection routes, using single paths, and flows that include path switching. We derive a feasibility condition for path capacities supporting such direct connection flows similar to the well-known feasibility condition for arc capacities in ordinary multi-commodity flows. The condition can be expressed in terms of a class of metric inequalities for routings on direct connections. We illustrate the concept on the example of the line planning problem in public transport and present an application to large-scale real-world problems.     

特殊Cartan型李超代数的Borel子代数

本文研究了特征零的代数闭域上秩为4的有限维特殊Cartan型李超代数S的结构.利用正则元的划分,确定出S关于典范环面的所有正根系,从而得到了S的所有Borel子代数;对于每一个正根系,通过给出其单根系,得到了任何两个Borel子代数的连接关系;最后确定了每一个Borel子代数的极大可解性.本文所得结果可用于进一步研究Cartan型单李超代数的结构与表示.     

基于Fuzzy-Grey关联分析的信息资源聚焦的数学模型

本文运用饱和信息维的增减技术对信息获取子空间进行结构上的剖分,用饱和信息维列作为因子列来构造灰色关联空间,将灰色理论中的关联分析用于模糊综合评判模型,用灰色关联系数来替代隶属度,用关联序来描述信息之间的相关联程度,得到信息资源聚焦的一种新的数学模型。     

Construction of long MDS self-dual codes from short codes

In this paper, we propose a mechanism on how to construct long MDS self-dual codes from short ones. These codes are special types of generalized Reed-Solomon (GRS) codes or extended generalized Reed-Solomon codes. The main tool is utilizing additive structure or multiplicative structure on finite fields. By applying this method, more MDS self-dual codes can be constructed.     

A new result on irreducible NFSRs with respect to cascade connection

Nonlinear feedback shift registers (NFSRs) are widely used in stream cipher design as building blocks. The cascade connection of NFSRs, known as an important architecture, has been adopted in Grain family of stream ciphers. In this paper, a new sufficient condition under which an NFSR cannot be decomposed into the cascade connection of two smaller NFSRs is presented, which is easy to be verified from the algebraic normal form (ANF) of the characteristic function. In fact, our results are also applicable to nonsingular Boolean functions, which actually improve a previous research of Rhodes [6] where the characteristic functions of NFSRs cannot be contained.