Propelinear codes related to some classes of optimal codes

A code is said to be propelinear if its automorphism group contains a subgroup that acts regularly on codewords. We show propelinearity of complements of cyclic codes C _1,i , (i, 2 ^m ? 1) = 1, of length n = 2 ^m ? 1, including the primitive two-error-correcting BCH code, to the Hamming code; the Preparata code to the Hamming code; the Goethals code to the Preparata code; and the Z₄-linear Preparata code to the Z₄-linear perfect code.     

对DUCET中部分藏文字母排序码的商榷

DUCET为每个藏文字符规定了排序码,但部分藏文字母的排序码并不符合藏文字典的排序要求,根据藏文字典的字母顺序对DUCET做了以下修订:修订梵音藏文字母■的排序码;为占位元音■赋予了适当的排序码;修订了下加辅音■的排序码。通过这些修订DUCET能完全支持现代藏文音节、梵音藏文音节以及二者间的混合排序。     

LP structures on type lattices and some refactoring problems

Lattice-based algebraic structures containing semantics of production-logic inference on a type hierarchy in an object-oriented system with an additional relation are introduced. Specific features of these structures, such as closedness, possibility of equivalent transformations, existence of logical reduction, are studied. It is shown how to apply the model developed to verification and optimization of type hierarchies. An important direction of the optimization is automatic elimination of code duplication by “pulling up” common attributes in the type hierarchy. Implementation issues are briefly discussed.     

The generalization of some trellis properties of linear codes to group codes

In this paper, we discuss some trellis properties for codes over a finite Abelian group, which are the generalization of the corresponding trellis properties for linear codes over a field. Also, we also investigate difficulties when we try to generalize a property of a tail-biting trellis for a linear code over a field to a group code. Supported by the National Natural Science Foundation of China (No. 60772131), Shanghai Pujian Talent Program (No. 06PJ14009), Fox Ying Yung Education Foundation (No. 114401) and NCET’08. The material in this paper was presented in part at the 6th International Conference Advanced Communication Technology, Korea, 2005     

A modified Yule process to model the evolution of some object-oriented system properties

We present a model based on the Yule process, able to explain the evolution of some properties of large object-oriented software systems. We study four system properties related to code production of four large object-oriented software systems - Eclipse, Netbeans, JDK and Ant. The properties analysed, namely the naming of variables and methods, the call to methods and the inheritance hierarchies, show a power-law distribution as reported in previous papers for different systems. We use the simulation approach to verify the goodness of our model, finding a very good correspondence between empirical data of subsequent software versions, and the prediction of the model presented.     

On metric rigidity for some classes of codes

A code C in the n-dimensional metric space $ \mathbb{F}_q^n $ \mathbb{F}_q^n over the Galois field GF(q) is said to be metrically rigid if any isometry I: C → $ \mathbb{F}_q^n $ \mathbb{F}_q^n can be extended to an isometry (automorphism) of $ \mathbb{F}_q^n $ \mathbb{F}_q^n . We prove metric rigidity for some classes of codes, including certain classes of equidistant codes and codes corresponding to one class of affine resolvable designs.     

同步变长码码字和码序号的互换算法

基于同步变长码（SVLC）的构造原理，先根据码长的不同将码表分成不同的码组，再根据前n位的不同将码组细分为不同的子码组，然后给出了一种计算SVLC子码组的码长分布的迭代算法。基于码表中码字首先按码长从小到大排列，码长相同时按码字对应的二进制值从小到大排列的准则，并利用码组和子码组的码长分布，给出了一种SVLC的码字和序号互换的算法。     

Aspectualization of code clones—an algorithmic approach

System Modularity has positive effects on software maintainability, reusability, and understandability. One factor that can affect system modularity is code tangling due to code clones. Code tangling can have serious cross-cutting effects on the source code and thereby affect maintainability and reusability of the code. In this research we have developed an algorithmic approach to convert code clones to aspects in order to improve modularity and aid maintainability. Firstly, we use an existing code-clone detection tool to identify code clones in a source code. Secondly, we design algorithms to convert the code clones into aspects and do aspect composition with the original source code. Thirdly, we implement a prototype based on the algorithms. Fourthly, we carry out a performance analysis on the aspects composed source code and our analysis shows that the aspect composed code performs as well as the original code and even better in terms of execution times.     

一种半监督学习的代码自动生成性能评估方法

为了提高软件开发的质量和效率,代码自动生成是当前的研究热点,代码自动生成的性能是其中的重要问题.现有代码自动生成的性能分析方法较简单,难以评估代码自动生成过程中程序员与代码自动生成工具各自的特征.本文综合考虑了代码自动生成过程中程序员与代码自动生成工具的作用,提出了一种基于半监督学习的代码自动生成性能评估方法,通过抽取程序员行为与代码自动生成工具行为的重要特征,划分代码自动生成的性能类别,建立了基于深度神经网络的代码自动生成过程性能评估模型,并计算程序员行为特征与代码自动生成工具行为特征对性能的影响程度.实验结果表明,该方法可以有效分析程序员行为与代码自动生成工具行为对代码自动生成过程性能的影响.     

一种面向交通管理的城市道路编码的方法

文中给出了一种基于软件工程理论的面向交通管理的城市道路编码方法，并从应用角度对城市道路编码中的几个主要组成要素，即编码对象、编码粒度、编码结构和编码属性进行了详细编码设计。从广州市智能交通管理指挥系统的实施效果来看，编码设计方案实用可行。     

AADL构件到RTLinux平台C代码的转换方法研究*

为了提高嵌入式软件开发的自动化程度,代码自动生成是一种值得采用的有效方法.在研究体系结构分析与设计语言(AADL)和RTLinux(real-time Linux)平台C代码的特性的基础上,提出了AADL构件到RTLinux平台C代码的转换规则;然后用一个实例实现了代码自动生成,从而验证了转换规则的有效性.     

基于分片融合的代码隐式混淆技术

目前,在代码保护技术研究领域,传统的混淆方法具有明显的混淆特征,分析人员可根据特征对其进行定制化的去混淆处理.为此,提出了一种基于分片融合的代码保护技术,通过在源代码层面将目标代码按照语法规则进行代码分片,依据执行顺序与语法规则,将分片插入另一程序的不同位置,在修复函数调用过程与数据关系后,形成可正常运行两个代码功能的融合后代码.在实验部分,对混淆后的代码,从运行效率、代码复杂度影响、代码相似性这3个维度,与其他混淆技术进行对比.从测试结果可以看出:基于分片融合的代码隐式混淆技术能够有效地模糊代码语义,改变控制流特征,且没有明显的混淆特征.因此,融合技术在对抗多种相似性对比算法的能力上有明显优势.     

Evaluating code complexity triggers,use of complexity measures and the influence of code complexity on maintenance time

Code complexity has been studied intensively over the past decades because it is a quintessential characterizer of code’s internal quality. Previously, much emphasis has been put on creating code complexity measures and applying these measures in practical contexts. To date, most measures are created based on theoretical frameworks, which determine the expected properties that a code complexity measure should fulfil. Fulfilling the necessary properties, however, does not guarantee that the measure characterizes the code complexity that is experienced by software engineers. Subsequently, code complexity measures often turn out to provide rather superficial insights into code complexity. This paper supports the discipline of code complexity measurement by providing empirical insights into the code characteristics that trigger complexity, the use of code complexity measures in industry, and the influence of code complexity on maintenance time. Results of an online survey, conducted in seven companies and two universities with a total of 100 respondents, show that among several code characteristics, two substantially increase code complexity, which subsequently have a major influence on the maintenance time of code. Notably, existing code complexity measures are poorly used in industry.     

基于代码克隆检测的代码来源分析方法

随着软件生态系统和开源社区的发展,代码常在多个软件系统中复制、传播和演化,给软件系统带来了软件质量的不确定性和风险,因此,高效地查找软件系统代码可能的来源是当前研究的热点之一。提出一种基于代码克隆检测的代码来源分析方法,将目标软件代码以方法为单位切割为代码片段,转换为词袋后,在大规模代码资源库中进行并行化代码克隆检测,从而实现方法粒度的代码来源分析。基于该方法,设计并实现了一个代码来源分析工具。该工具能自动分析被测软件项目代码与代码资源库中多个项目以及版本之间的可能来源。实验结果表明,该系统能够有效地找出目标项目在大规模代码库中的代码来源信息,辅助软件维护人员理解和维护代码。     

在RAD中实现代码自动生成

针对MDA中的两个重要转换之一——PSM到应用程序代码的转换,提出了一个基于XSLT技术的代码自动生成器设计方案,用来实现MDA的代码自动生成。此外,对代码生成器的输入、代码生成器的自动生成原理进行了详细讨论;最后给出了一个在RAD中如何采用代码自动生成器生成代码的例子。     

基于数据挖掘的存储数据纠删码容错方法仿真

在存储数据的纠删码容错中,针对传统存储数据纠删码容错方法容错速度较低的问题,提出一种基于数据挖掘的存储数据纠删码容错方法。采用数据挖掘方法对存储数据纠删码进行重构,计算存储数据纠删码的丢失片段;利用CHR算法对存储数据纠删码进行异构修复,通过建立存储数据纠删码容错模型实现存储数据的纠删码容错。为了验证存储数据纠删码容错方法的有效性,将存储数据纠删码容错方法与传统存储数据纠删码容错方法进行对比,实验结果得出:上述方法与基于流水线的存储数据纠删码容错方法、基于RapidRaid码的存储数据纠删码容错方法、基于非规则LDPC码的存储数据纠删码容错方法的容错速度分别为:286Mbps/s、262Mbps/s、243Mbps/s、232Mbps/s,比较可知,所提方法的容错速度最快,证明了上述方法的优越性。     

一种动静态结合的代码反汇编技术

为在不修改二进制代码的情况下提高反汇编的准确性和覆盖率,提出一种静态分析与动态仿真相结合的反汇编技术。在传统静态反汇编算法的基础上,利用代码仿真环境构造动态基本块标记算法,通过监控代码的执行路径达到反汇编求精的目的。测试结果证明了该方法的有效性。     

一种基于CAVLC解码的快速码表查找算法

在分析和研究基于上下文的自适应可变长度编码(CAVLC)码表结构特点的基础上,结合码表统计规律,提出一种新的CAVLC解码码表查找算法。根据码字前缀0的个数和码字长度之间的关系共同决定输入码字后缀位数和数值,实现对输入码流的快速确定,对确定的输入码字,只需再查一次表便可以得到其对应的解码输出。测试结果表明,该优化算法在解码查表速度方面比原算法提高约20%。     

基于源代码扩展信息的细粒度缺陷定位方法

基于信息检索的缺陷定位技术,利用跨语言的语义相似性构造检索模型,通过缺陷报告定位源代码错误,具有方法直观、通用性强的特点.但是由于传统基于信息检索的缺陷定位方法将代码作为纯文本进行处理,只利用了源代码的词汇语义信息,导致在细粒度缺陷定位中面临候选代码语义匮乏产生的准确性低的问题,其结果有用性还有待改进.通过分析程序演化场景下代码改动与缺陷产生间的关系,提出一种基于源代码扩展信息的细粒度缺陷定位方法,以代码词汇语义显性信息及代码执行隐性信息共同丰富源代码语义实现细粒度缺陷定位.利用定位候选点的语义相关上下文丰富代码量,以代码执行中间形式的结构语义实现细粒度代码的可区分,同时以自然语言语义指导基于注意力机制的代码语言表征生成,实现细粒度代码与自然语言间的语义映射,从而实现细粒度缺陷定位方法FlowLocator.实验分析结果表明：与经典的IR缺陷定位方法相比,该方法定位准确性在Top-N排名、平均准确率及平均倒数排名上都有显著提高.     

利用主轴因子法的严重性代码异味相关性分析

代码异味的存在对源代码的可理解性和可维护性有着糟糕的负面影响.通常情况下,研究人员更多是考虑单一代码异味对源代码的影响,但有研究指出,多种代码异味的共同存在以及它们之间的交互往往比单一代码异味有着更严重的负面影响.本文针对主成分分析在布尔类型变量分析中容易产生难以解释的主成分的弊端,提出了一种基于主轴因子法及异味严重性的代码异味相关性分析方法,并在92个系统上对14种代码异味进行试验,从中提取了6个因子,在相关矩阵中新发现了{Extensive Coupling、Long Parameter List}代码异味对的存在.最后本文比较分析了具有严重性标签的代码异味数据集的优势,解释了每个因子的含义并进行分类命名.