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.     

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)     

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

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

面向SoC的系统级并行划分方法

为缩短复杂SoC系统的设计周期,降低系统设计的复杂性,提出了一种SoC系统级的并行划分方法.引入带有信号激活率和输入输出延时的过程模型图,为SoC系统构建模型.设计一启发式算法对该过程模型图进行并行划分,同时,该算法能解决有环图的划分问题.通过大量的实验证明,划分结果同要求吻合,说明该划分方法是可行、有效的.     

一种带有链约束的连续型批处理机调度问题

针对链式约束下工件释放时间和工期同序的情况,证明了即使所有工件都是单位加工时间时,极小化最大拖期问题也是强NP-难的.对于工件的零时刻都到达且同一链中工件工期相同的特殊情况,给出了多项式时间的最优算法.     

基于C0复杂度和能量的语音端点检测算法

复杂性测度是反映信号序列的一个重要的非线性特征,复杂性测度的语音端点检测技术具有非线性技术的本质特征。对C₀复杂度作出改进,并与增强后的短时能量相结合,提出了一种更有效的端点检测算法——C₀复杂度能量的语音端点检测方法。实验证明,该算法对噪声有很强的鲁棒性,在低信噪比（0 dB）下仍能准确地检测出语音段。     

可伸缩变换编码在H．263下的应用研究

本文给出了一种复杂度可伸缩的实现转换编码器设计方法,实现了计算量与视频转换编码质量之间的平衡。提出了一种基于H．263编码模型的复杂度可伸缩算法。