On ℤ2ℤ2[u]-additive codes

In this paper, a new class of additive codes which is referred to as ?₂ ?₂[u]-additive codes is introduced. This is a generalization towards another direction of recently introduced ?₂ ?₄-additive codes [J. Borges, C. Fernández-Córdoba, J. Pujol, J. Rif´a, and M. Villanueva, ?₂ ?₄-linear codes: Generator matrices and duality, Designs Codes Cryptogr. 54(2) (2010), pp. 167–179]. ?₂ ?₄-additive codes have shown to provide a promising class of codes with their algebraic structure and applications such as steganography. The standard generator matrices are established and by introducing orthogonality the parity-check matrices are also obtained. A MacWilliams-type identity that relates the weight enumerator of a code with its dual is proved. Furthermore, a Gray map that maps these codes to binary codes is defined and some examples of optimal codes which are the binary Gray images of ?₂ ?₂[u]-additive codes are presented.     

云计算环境下异构数据节点冗余存储模式的优化

现有的纠删码假设存储节点的可用性是相同的,而现实的应用系统往往由可用性不同的异构存储节点组成,这使得系统的实际可用性与设计的最优值之间存在一定的差异。为了减小系统的实际可用性与设计最优值的差异,将存储节点看作是异构的,提出一种异构存储节点下的可用性分析框架,以及优化的纠删码部署方法。实验表明,所提出的纠删码部署方法的可用性与系统实际可用性的差异小,性能明显优于现有的相关工作。     

环Fp uFp vFp uvFp上的二次剩余码

针对环Fp+ uFp+ vFp+ uvFp上的二次剩余码进行了研究,其中u2=u,v2=v,uv=vu,p是一个奇素数.首先引入了环Fp+ uFp+vFp+ uvFp上长为n的循环码的相关知识,用幂等元的形式定义了环Fp+ uFp+vFp+uvFp上的二次剩余码,给出了其定义和性质,并讨论了它们与其扩展码之间的关系和对偶性质.最后,给出了环F3+uF3+vF3+uvF3上长为11的二次剩余码的幂等生成元的具体形式.     

偏标记学习研究综述

在弱监督信息条件下进行学习已成为机器学习领域的热点研究课题。偏标记学习作为一类重要的弱监督机器学习框架,适于多种实际应用问题的学习建模。在该框架下,每个对象在输入空间由单个示例(属性向量)进行刻画,而在输出空间与一组候选标记相关联,其中仅有一个为其真实标记。本文将对偏标记学习的研究现状进行综述,首先给出该学习框架的定义以及与相关学习框架的区别与联系,然后重点介绍几种典型的偏标记学习算法以及作者在该方面的初步工作,最后对偏标记学习进一步的研究方向进行简要讨论。     

有19-(4,f)型自同构的二元自对偶码

应用二元自对偶码可看成几个自对偶码的直和理论,研究了具有19-(4,f)型自同构、码长在100以内的的二元自对偶码。这种对偶码都可看成一个码长为4的收缩码和GF(2)n上一些偶重量多项式的直和。证明了码长大于80且小于100时,不存在19-(4,f)型的二元自对偶码。根据码长较短的自对偶码分别构造出了码长为76、78和80的二元自对偶码,并给出其生成矩阵。由码的等价得到了这几类码可能的分类情况。运行Matlab程序,证明了具有19-(4,2)型和19-(4,4)型的二元自对偶码在等价情况下都有11个,19-(4,0)型的二元自对偶码在等价情况下是不存在的。     

Code Analysis for Software and System Security Using Open Source Tools

ABSTRACT

Software security helps in identifying and managing risks. One of the effective ways to identify software vulnerabilities is to analyze its code. Code analysis (Chess & West, 2007 Chess, B. and West, J. 2007. Secure programming with static analysis, Boston, MA: Addison-Wesley.  [Google Scholar]) helps in catching common coding mistakes such as buffer overflow, unused variables, memory leaks, and various race conditions, which in turn optimizes computer programs, both in storage and computation aspects. Software developers use either open source tools or commercial tools for verification and validation of software. Without proper validation of a software/system using some standard guidelines, potential attackers can find ways to exploit vulnerabilities and bugs and then can gain control over a system, if they are successful. In this paper, we discuss some of the open source static code analysis and dynamic analysis tools, their merits, and limitations with respect to some target codes that contain possible threats. We consider C/C++ and Java programming languages for our experiments. For static code analyzers, we consider Flawfinder, Splint, and Cppcheck; PMD, Findbugs, and Valgrind for dynamic code analysis, and its plug-in, Memcheck, to perform dynamic analysis on executables. We provide our observations in a comparison table, highlighting these tools strengths and weaknesses.     

采用2D-SMPC码的S-OCDMA系统性能分析

在同步修正素数码（SMPC）基础上,通过给每个不同的种子分配一个不同的波长片,构造了二维正交地址码（2D-SMPC）;分析了码字的相关特性,确定了地址码选取原则;通过Optisystem仿真,研究了该码的多址干扰（MAI）和系统容量等性能。与一维SMPC码性能相比较,验证了其用于S-OCDMA系统时的性能改善。     

一种低复杂度的短LDPC码级联译码算法

为了提高短低密度校验码(Short LDPC)的纠错性能,在研究盒匹配译码算法(BMA)和置信度与分阶统计译码级联算法(BP-OSD)的基础上,提出了一种新的针对短LDPC码译码的BP-BMA级联算法.该算法充分利用了BMA算法具有较低译码复杂度的特性.然后,利用该算法结合对数似然比累积(ALLR)算法进行了计算机仿真.仿真结果表明:BP-BMA级联算法与BP-OSD相比,译码性能有所提高,且译码复杂度大大降低了,在译码性能和复杂度间取得了很好的折中.     

地铁屏蔽门障碍物探测方案的探讨

介绍了目前国内地铁屏蔽门系统障碍物探测的设计方法,根据既有线路上屏蔽门系统障碍物探测功能的实际应用情况,分析原有方案的优劣,提出通过微处理器控制红外编码进行障碍物探测的方案,以解决目前使用逻辑微处理器监视门体速度、比较门速度曲线中预期电机电流与实测的电机电流方案中存在的无法探测质地较软的障碍物、障碍物探测尺寸的限制等不足.