H.264视频编码的关键技术分析及复杂度研究测试

H.264比原有的视频编码标准大幅度提高了编码效率和稳定性,但其运算复杂度也大大增加。为了在不影响编码效率的前提下,降低编码运算的复杂度,提高编码的实时性,有必要对H.264的复杂性做出详细研究。H.264通过对传统的帧内预测、帧间预测、变换编码和熵编码等算法的改进来提高压缩率。本文分析H.264上述关键技术,给出基于JM86的模块复杂度测试。测试结果表明H.264编码的复杂性主要体现在帧间预测模块中,要加快H.264的编码速度,就必须对这个模块进行优化。     

图像复杂度描述方法研究

为了更好地对图像的复杂程度进行描述,先从组成论的角度对传统复杂度的描述方法进行了讨论,并将其引入用于描述图像的复杂度,试图找到一种适合于图像的复杂度描述方法。该文首先讨论了组成论中复杂度的计算方法,并分析了其局限和不足;然后在此基础上,针对图像的特殊性提出从灰度级的出现情况、灰度的空间分布情况、目标对象的出现情况等3个方面,借助信息熵、纹理、边缘等相关因子来描述图像的复杂程度;最后,针对不同复杂程度的遥感图像进行了实验。实验结果表明,该描述方法可以反映出图像的整体复杂程度,并可用于不同图像复杂度的定性和定量比较。     

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 .     

Rollout sampling approximate policy iteration

Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervised learning problem. This paper proposes variants of an improved policy iteration scheme which addresses the core sampling problem in evaluating a policy through simulation as a multi-armed bandit machine. The resulting algorithm offers comparable performance to the previous algorithm achieved, however, with significantly less computational effort. An order of magnitude improvement is demonstrated experimentally in two standard reinforcement learning domains: inverted pendulum and mountain-car.     

一种改进的位平面复杂度分割算法

对复杂度直方图的不连续性测度的隐写分析能有效地察觉以位平面复杂度分割(BPCS)隐写的秘密信息的存在。为提高隐写算法的安全性,提出一种改进的BPCS算法,即利用部分可嵌入块作为嵌入信息的调节块,消除由于嵌入秘密信息而造成的复杂度直方图的剧烈变化,确保不连续性测度不会出现明显的峰值。实验结果表明,该算法能有效地抵抗基于复杂度直方图的统计分析,同时也保持了原算法嵌入容量大的特点。     

代码覆盖测试技术在MODE-S应答机中的应用

代码覆盖测试技术可用于结构覆盖测试和程序复杂度分析,代码覆盖测试技术可用于测试用例设计,提高软件测试效率,指导编写高质量的程序代码,代码覆盖是软件测试的底线.代码覆盖测试技术及方法的研究,为软件覆盖测试提供了理论依据.在Mode-S应答机项目中应用TRACE覆盖测试技术,确保了产品满足适航软件标准RTCA/DO-178B LEVEL B的要求.     

Dynamical characteristics of software trustworthiness and their evolutionary complexity

Developing trusted softwares has become an important trend and a natural choice in the development of software technology and applications, and software trustworthiness modeling has become a prerequisite and necessary means. To discuss and explain the basic scientific problems in software trustworthiness and to establish theoretical foundations for software trustworthiness measurement, combining the ideas of dynamical system study, this paper studies evolutionary laws of software trustworthiness and the dynamical mechanism under the effect of various internal and external factors, and proposes dynamical models for software trustworthiness, thus, software trustworthiness can be considered as the statistical characteristics of behaviors of software systems in the dynamical and open environment. By analyzing two simple examples, the paper explains the relationship between the limit evolutionary behaviors of software trustworthiness attributes and dynamical system characteristics, and interprets the dynamical characteristics of software trustworthiness and their evolutionary complexity. Supported partially by the National Basic Research Program of China (Grant No. 2005CB321900) and the National Natural Science Foundation of China (Grant No. 60473091)     

赫夫曼树遍历算法的优化

对数据结构中赫夫曼树和赫夫曼遍历的算法问题进行探讨,针对传统使用的遍历算法存在循环次数较多、算法时间复杂度较大问题,通过修改参数和循环体结构对原有算法进行改进,从而减少循环次数,降低算法时间复杂度,同时也提出了动态编码算法等的优点和可行性。     

与精度归“档”插入排序算法研究的商榷

作为计算机应用中一项复杂而重要的技术,排序一直是计算机领域内人们感兴趣的课题,寻找速度快、附加存储空间开销小的高效排序算法也一直是计算机工作者为之追求的目标。对精度归"档"插入排序算法研究中所存在的几个问题进行商榷与讨论。