On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks

This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.

A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system.     

基于动态符号执行的C代码缓冲区溢出检测

缓冲区溢出是C程序中众多安全隐患的根源之一,以C程序代码为目标对象,提出了一个基于底层虚拟机中间代码的缓冲区溢出检测工具PathChecker.该工具基于动态符号执行方法,使用无量词谓词公式刻画缓冲区操作的安全性质,并利用可满足模型理论求解器技术检验缓冲区操作的安全性.实验结果表明,该工具能有效检测C代码中的缓冲区溢出漏洞,且易于推广至其他高级程序语言代码和其他类型安全漏洞的检测.     

Combination of convex theories: Modularity,deduction completeness,and explanation

Decision procedures are key components of theorem provers and constraint satisfaction systems. Their modular combination is of prime interest for building efficient systems, but their effective use is often limited by poor interface capabilities, when such procedures only provide a simple “sat/unsat” answer. In this paper, we develop a framework to design cooperation schemas between such procedures while maintaining modularity of their interfaces. First, we use the framework to specify and prove the correctness of classic combination schemas by Nelson–Oppen and Shostak. Second, we introduce the concept of deduction complete satisfiability procedures, we show how to build them for large classes of theories, then we provide a schema to modularly combine them. Third, we consider the problem of modularly constructing explanations for combinations by re-using available proof-producing procedures for the component theories.     

基于模运算的数字水印算法

提出了一种基于模运算的数字水印算法。该算法具有很好的性能：（1）水印隐藏的效果好,凭借人类的视觉系统无法看出与原图像的差别;（2）可以有效的抵抗JPEG等压缩编码的破坏;（3）可以领先部分图像检测水印,在图像受到损坏的情况下,仍可以检测到水印信息;（4）检测水印时受到口令的限制,不知道口令的人无法正确恢复水印;（5）检测水印时不需要原始图像。     

奇性函数的加权Stancu算子逼近

作为算子逼近中的一种重要类型,Bernstein算子对于函数的逼近无论在逼近论还是计算数学中都具有非常重要的地位。该文研究Bernstein算子的更一般推广——Stancu算子,考虑了Stan-cu算子对在端点处具有奇性的函数的加权逼近,并通过Ditzian-Totik光滑模ω2φ（f,δ）对该算子的逼近阶作出具体估计。     

一种基于复合域的ECC的快速乘法器

基于有限域上椭圆曲线公开密匙协议的离散对数计算算法正日益成为热点,而有限域上的计算尤其是乘法计算极大地影响其加/解密速度。基于ECC中有限域乘法的重要性,该文给出了一种复合域GF((2m1)m2)上的快速乘法器。该乘法器采用并行计算和串行计算相结合的原则,增加少量硬件规模将一次有限域乘法的计算速度由原来的m=m2m1个时钟周期降低到m2个时钟周期,从而极大地提高了乘法器的计算速度。     

关于有限域的一种具体构作

论述了元素在二百个以内的有限域的数目、结构和部分的矩阵表示。     

关于特征和定理的一个注记

阐述了模m的特征、模m的原特征与特征和的定义及其相关引理，然后指出了文献[1]中的特征和定理的证明过程中所存在的问题，同时给出了文献[1]中的特征和定理证明的关键步骤．     

基于Julia分形集的模运算图像加密算法研究

作为信息安全的重要领域,图像加密算法一直是人们研究的热点。针对经典分形集合Julia集的特点,提出一种图像加密算法。将Julia集作为一种随机元素生成密钥,采用模运算方法对图像进行加密,对生成的密文进行两次扩散,得到最终密文。由于Julia集密钥仅需几个参数就可以表示,大大减小了存储空间。并且Julia集的无限性以及混沌特性使得任意参数的极其微小的变动都将导致密钥剧烈变化,无法正常解密。该算法较Rozouvan提出的以Mandelbrot分形集为密钥的转换方法,密钥空间更大,密钥敏感性显著提高,尤其能够有效抵御选择明文攻击。     

cache profiling信息指导的软件流水

软件流水是一种重要的指令调度技术,它通过同时执行来自不同循环迭代的指令来加快循环的执行时间.随着处理器速度和访存速度差距越拉越大,访存指令尤其是cache miss的访存指令日益成为系统性能提高的瓶颈.由于这些指令的延迟不是固定的,如何在软件流水中预测并掩盖这些访存指令的延迟是非常重要的.与前人预测访存延迟的方法不同,引入cache profiling技术,通过动态收集到profile信息来预测访存延迟,并进行适当的调度.当增加模调度循环中的访存指令的延迟时,启动间隔也会随之增大,导致性能不会随之上升.CSMS算法和FLMS算法在尽量不增大启动间隔的情况下,改变访存指令的延迟.改进了CSMS算法和FLMS算法,根据cache profiling的信息来改变访存延迟,所以比前人的方法更为准确.实验表明,新方法可以有效地提高程序性能,对SPEC2000测试程序平均性能提高1%左右,个别例子的性能改进高达11%.