基于软件实现的多核系统模拟器执行计算密集/数据密集任务的时效性极差,且存在模拟精度和性能评估准确性差的不足,限制其在多核系统结构优化探索中的应用。文章提出一种周期精确的软硬件协同多核系统模拟器(cycle accurate hardware-sof...基于软件实现的多核系统模拟器执行计算密集/数据密集任务的时效性极差,且存在模拟精度和性能评估准确性差的不足,限制其在多核系统结构优化探索中的应用。文章提出一种周期精确的软硬件协同多核系统模拟器(cycle accurate hardware-software co-simulator,CAHSCS),通过在传统模拟器架构中引入硬件计算和存储模块,CAHSCS能有效改善全系统的模拟速度、精度,提高性能评估的准确性。复杂真实任务加载实验结果表明,CAHSCS将大规模复杂数据的运算效率提高了10倍,显著加快了系统设计收敛速度。展开更多
A low computational cost cancelable fingerprint template, namely the multi-line codes was proposed. The formulation of a single-line code involves the inspection of minutiae distribution along a straight line construc...A low computational cost cancelable fingerprint template, namely the multi-line codes was proposed. The formulation of a single-line code involves the inspection of minutiae distribution along a straight line constructed based on the reference minutia. Multi-line code is introduced to elevate the performance by combining several single-line codes. Experiments were carried out on a few FVC databases. It has been proven that the proposed method yields relatively low computational complexity as compared to existing minutiae distribution-based methods, while preserving the performance. The equal error rate obtained for FVC2002 DB1 is 4.69% in stolen-key case, and the total arithmetic operations utilized are 14 520 additions and zero multiplication.展开更多
The Circle algorithm was proposed for large datasets.The idea of the algorithm is to find a set of vertices that are close to each other and far from other vertices.This algorithm makes use of the connection between c...The Circle algorithm was proposed for large datasets.The idea of the algorithm is to find a set of vertices that are close to each other and far from other vertices.This algorithm makes use of the connection between clustering aggregation and the problem of correlation clustering.The best deterministic approximation algorithm was provided for the variation of the correlation of clustering problem,and showed how sampling can be used to scale the algorithms for large datasets.An extensive empirical evaluation was given for the usefulness of the problem and the solutions.The results show that this method achieves more than 50% reduction in the running time without sacrificing the quality of the clustering.展开更多
文摘基于软件实现的多核系统模拟器执行计算密集/数据密集任务的时效性极差,且存在模拟精度和性能评估准确性差的不足,限制其在多核系统结构优化探索中的应用。文章提出一种周期精确的软硬件协同多核系统模拟器(cycle accurate hardware-software co-simulator,CAHSCS),通过在传统模拟器架构中引入硬件计算和存储模块,CAHSCS能有效改善全系统的模拟速度、精度,提高性能评估的准确性。复杂真实任务加载实验结果表明,CAHSCS将大规模复杂数据的运算效率提高了10倍,显著加快了系统设计收敛速度。
文摘A low computational cost cancelable fingerprint template, namely the multi-line codes was proposed. The formulation of a single-line code involves the inspection of minutiae distribution along a straight line constructed based on the reference minutia. Multi-line code is introduced to elevate the performance by combining several single-line codes. Experiments were carried out on a few FVC databases. It has been proven that the proposed method yields relatively low computational complexity as compared to existing minutiae distribution-based methods, while preserving the performance. The equal error rate obtained for FVC2002 DB1 is 4.69% in stolen-key case, and the total arithmetic operations utilized are 14 520 additions and zero multiplication.
基金Projects(60873265,60903222) supported by the National Natural Science Foundation of China Project(IRT0661) supported by the Program for Changjiang Scholars and Innovative Research Team in University of China
文摘The Circle algorithm was proposed for large datasets.The idea of the algorithm is to find a set of vertices that are close to each other and far from other vertices.This algorithm makes use of the connection between clustering aggregation and the problem of correlation clustering.The best deterministic approximation algorithm was provided for the variation of the correlation of clustering problem,and showed how sampling can be used to scale the algorithms for large datasets.An extensive empirical evaluation was given for the usefulness of the problem and the solutions.The results show that this method achieves more than 50% reduction in the running time without sacrificing the quality of the clustering.
