A single layer zero skew clock routing in X architecture

With its advantages in wirelength reduction and routing flexibility compared with conventional Manhattan routing, X architecture has been proposed and applied to modern IC design. As a critical part in high-performance integrated circuits, clock network design meets great challenges due to feature size decrease and clock frequency increase. In order to eliminate the delay and attenuation of clock signal introduced by the vias, and to make it more tolerant to process variations, in this paper, we propose an algorithm of a single layer zero skew clock routing in X architecture (called Planar-CRX). Our Planar-CRX method integrates the extended deferred-merge embedding algorithm (DME-X, which extends the DME algorithm to X architecture) with modified Ohtsuki’s line-search algorithm to minimize the total wirelength and the bends. Compared with planar clock routing in the Manhattan plane, our method achieves a reduction of 6.81% in total wirelength on average and gets the resultant clock tree with fewer bends. Experimental results also indicate that our solution can be comparable with previous non-planar zero skew clock routing algorithm. Supported in part by the National Natural Science Foundation of China (Grant No. 60876026), and the Specialized Research Fund for the Doctoral Program of Higher Education (Crant No. 200800030026)     

Design and analysis of switching reduced-order observer and separation principle for T-S fuzzy system

This paper designs and analyzes switching fuzzy reduced-order observer and proves that the corresponding separation principle does hold. A numerical simulation and comparison with smooth fuzzy full-order observer are given to assess switching fuzzy reduced-order observer and the validity of the separation principles. Supported by the National Laboratory of Space Intelligent Control and Open Foundation (Grant No. SIC07010202), and the National Natural Science Foundation of China (Grant Nos. 60604010, 90716021, 60736023)     

Cryptanalysis of RSA for a special case with d > e

In this paper, we study the RSA public key cryptosystem in a special case with the private exponent d larger than the public exponent e. When N ^0.258 ⩽ e ⩽ N ^0.854, d > e and satisfies the given conditions, we can perform cryptanalytic attacks based on the LLL lattice basis reduction algorithm. The idea is an extension of Boneh and Durfee’s researches on low private key RSA, and provides a new solution to finding weak keys in RSA cryptosystems. Supported partially by the National Basic Research Program of China (Grant No. 2003CB314805), the National Natural Science Foundation of China (Grant Nos. 90304014 and 60873249), and the Project funded by Basic Research Foundation of School of Information Science and Technology of Tsinghua     

类的封装与继承

面向对象的程序设计语言,如C＋＋,引入了“类”的概念。相似的对象通过归入某一“类”而联系起来。“类”使数据与程序的封装成为可能,让代码更加安全。由此引发的继承等概念,更是大大提高了语言的灵活性。然而使用类的时候,需要十分小心,以免带来潜在的安全隐患。MISRA C＋＋指出了避免这些陷阱的方法。     

RiMOM: A Dynamic Multistrategy Ontology Alignment Framework

Ontology alignment identifies semantically matching entities in different ontologies. Various ontology alignment strategies have been proposed; however, few systems have explored how to automatically combine multiple strategies to improve the matching effectiveness. This paper presents a dynamic multistrategy ontology alignment framework, named RiMOM. The key insight in this framework is that similarity characteristics between ontologies may vary widely. We propose a systematic approach to quantitatively estimate the similarity characteristics for each alignment task and propose a strategy selection method to automatically combine the matching strategies based on two estimated factors. In the approach, we consider both textual and structural characteristics of ontologies. With RiMOM, we participated in the 2006 and 2007 campaigns of the Ontology Alignment Evaluation Initiative (OAEI). Our system is among the top three performers in benchmark data sets.     

分布式大规模监控视频存储系统THNVR

通过分析网络视频监控应用中的存储需求特点,提出了一种采用低成本SATA硬盘的高性能存储解决方案。该方案使用定长文件,并将结构化与非结构化数据分别存储和检索,彻底克服了传统解决方案中磁盘碎片导致存储性能下降的问题。该方案还采用了自适应的缓冲技术,对磁盘访问进行了有效的规整和调度,充分利用了磁盘的写入带宽。此外,该方案还实现了容错、扩展等重要功能。性能分析显示,该方案在普通计算机和SATA磁盘上能够同时记录256路D1或512路CIF视频数据流。     

Bitmap结构在高性能网络算法设计中的应用

基于Bitmap数据结构的数据压缩技术是一种针对线性存储结构的有效压缩方法,虽被广泛用于网络处理的多个领域(路由查找、网包分类等),却一直缺乏深入的分析。给出了Bitmap结构能提高算法空间性能的理论根据。总结了Bitmap结构在典型网络处理算法中的各种应用,给出了Bitmap结构的数学模型,并通过实例分析了Bitmap结构的优势和不足。Bitmap技术是一种能有效改善网络处理算法存储空间性能的通用技术,并给未来高性能网络处理算法设计提出以及现有算法的改进都提供了启发思路。     

基于模板的SoC结构自动划分方法

针对SoC芯片设计中的系统划分问题,提出一种面向应用的系统结构自动划分方法--基于模板的系统划分方法,并开发了系统划分工具--TBPS.基于模板的系统划分方法通过提取应用描述中的相似结构,并使用相似结构划分系统,最终得到一个尽量复用的系统结构.系统的相似结构划分采用遗传算法实现最优覆盖的搜索,并使用贪婪算法实现资源配置和任务调度.与已有的在系统划分中事先设定目标结构方法不同,文中方法可以根据应用的特点自动生成划分的结构.采用该方法及TBPS实现了应用描述到系统结构的自动划分.实验结果表明了TBPS对数据处理为主的应用划分的有效性.     

多重链路网络分区与QoS度量两级并行QoSR算法

在多重链路上联网络环境下,采用并行路由搜索的思想寻找最优路径,能够获得较好的路径寻优结果,并且算法的时间复杂度较低.给出一种两级并行QoSR算法,将多重链路环境按一定规则划分为若干分区,为每个分区分配一定数量的QoS度量并行处理器和1个分区处理器,在各个分区分别采用QPAS算法,由QoS度量并行处理器并行计算出各分区内的QoS度量Pareto最佳路径,最终由分区处理器调用最短路径并行算法完成分区间代价最小路径的计算.     

基于混合双种群差分进化的电力系统经济负荷分配

针对电力系统经济负荷分配本质上的非线性约束优化问题,提出一种双种群混合差分进化算法.采用两个种群且以较小的计算量实现目标函数的寻优并保持解的可行性,同时引入单纯型法来提高算法的局部搜索能力.基于典型算例对该算法的进化行为进行测试,并通过仿真和比较验证了所提出算法的有效性.