Web页面信息主动检索模型

单个页面信息量远远大于特定用户对页面中的信息需求.为快速准确从当前页面中获取特定用户所需求的兴趣信息,提出了页面信息主动检索模型.该检索模型中,根据页面Block特点将当前Web页面转化成信息树,根据用户过去的浏览行为构造用户特征树,挖掘用户特征树产生用户需求信息集,然后从当前页面中检索需求的信息,获取用户兴趣信息集.详述了主动检索的基本原理,给出了相应的算法描述,并通过实验证明了该模型具有可行性.     

X20 PCC与变频器数据通信的实现

该文介绍了在贝加莱具有开放式架构的集成软件平台Automation StudioV2．7编程环境下Modbus功能块的使用方法,以及B＆RX20系列可编程计算机控制器分别与丹佛斯FC102变频器、ABBACS510变频器、施耐德ATV21变频器的数据通信的实现方法。     

Exploiting the performance gains of modern disk drives by enhancing data locality

Due to the widening performance gap between RAM and disk drives, a large number of I/O optimization methods have been proposed and designed to alleviate the impact of this gap. One of the most effective approaches of improving disk access performance is enhancing data locality. This is because the method could increase the hit ratio of disk cache and reduce the seek time and rotational latency. Disk drives have experienced dramatic development since the first disk drive was announced in 1956. This paper investigates some important characteristics of modern disk drives. Based on the characteristics and the observation that data access on disk drives is highly skewed, the frequently accessed data blocks and the correlated data blocks are clustered into objects and moved to the outer zones of a modern disk drive. The idea attempts to enhance spatial locality, improve the efficiency of aggressive sequential prefetch, and take advantage of Zoned Bit Recording (ZBR). An experimental simulation is employed to investigate the performance gains generated by the enhanced data locality. The performance gains are analyzed by breaking down the disk access time into seek time, rotational latency, data transfer time, and hit ratio of the disk cache. Experimental results provide useful insights into the performance behaviours of a modern disk drive with enhanced data locality.     

Simplicial powers of graphs

In a graph, a vertex is simplicial if its neighborhood is a clique. For an integer k≥1, a graph G=(V_G,E_G) is the k-simplicial power of a graph H=(V_H,E_H) (H a root graph of G) if V_G is the set of all simplicial vertices of H, and for all distinct vertices x and y in V_G, xyE_G if and only if the distance in H between x and y is at most k. This concept generalizes k-leaf powers introduced by Nishimura, Ragde and Thilikos which were motivated by the search for underlying phylogenetic trees; k-leaf powers are the k-simplicial powers of trees. Recently, a lot of work has been done on k-leaf powers and their roots as well as on their variants phylogenetic roots and Steiner roots. For k≤5, k-leaf powers can be recognized in linear time, and for k≤4, structural characterizations are known. For k≥6, the recognition and characterization problems of k-leaf powers are still open. Since trees and block graphs (i.e., connected graphs whose blocks are cliques) have very similar metric properties, it is natural to study k-simplicial powers of block graphs. We show that leaf powers of trees and simplicial powers of block graphs are closely related, and we study simplicial powers of other graph classes containing all trees such as ptolemaic graphs and strongly chordal graphs.     

ESF算法的不可能差分密码分析

分析研究了分组密码算法ESF抵抗不可能差分的能力,使用8轮不可能差分路径,给出了相关攻击结果。基于一条8轮的不可能差分路径,根据轮密钥之间的关系,通过改变原有轮数扩展和密钥猜测的顺序,攻击了11轮的ESF,改善了关于11轮的ESF的不可能差分攻击的结果。计算结果表明:攻击11轮的ESF所需要的数据复杂度为O(2⁵³),时间复杂度为O(2³²),同时也说明了11轮的ESF对不可能差分是不免疫的。     

基于FPGA的轨道振动信号数字监测接收机设计

设计了一种基于FPGA的轨道振动信号数字监测接收机,详细阐述了接收机的数据流走向及其振动信号频域分析的实现.设计中以Altera的cycloneⅢ系列芯片EP3c25Q240C8为硬件平台,以QuartusⅡ9.1为软件平台,数据存储缓存单元使用ISIS公司的IS61NLP102418,频域分析则使用1024个点的FFT,进行功率谱估计.     

On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation

Block sorting in the Burrows-Wheeler transformation is to sort all of the n circular shifts of a string of length n lexicographically. We introduce a notion called the width of a sequence of n strings of length n and show that the values of widths are very different between the two types of sequences of strings; (1) a sequence of n randomly generated strings of length n, and (2) the sequence of n circular shifts of a randomly generated string of length n.     

一种遗传搜索块匹配运动估计算法

运动估计是帧间视频编码中的关键技术,但现有的快速搜索算法中大都是次优算法,且易陷于局部极小点,针对此问题,提出了将一种遗传算法应用于块运动估计中的遗传搜索匹配估计算法（GSAME）,该方法把块运动向量作为遗传染色体,经过杂交、变异等操作,以便得到全局意义上的最优解,并与经典的全局搜索法和三步搜索法进行了比较,实验结果显示,该算法不仅有效地解决了局部极小问题,而且计算量也较少。     

集中式符号库管理方法

在许多ＣＡＤ应用领域,经常需要建立符号库管理系统。该文主要介绍如何利用ＡＲＸ编程接口和ＶＩＳＵ－ＡＬＣ＾＋＋在一个图形文件里建立符号库的方法,并详细说明了符号库的结构以及保存符号信息的有名对象字典的结构。文中还介绍了符号入库、出库的几种方法,以及符号信息的管理方法。