检索结果-南通市图书馆

维普期刊数据库

Scan chain design for shift power reduction in scan-based testing

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2011年第4期54卷 767-777页

作者： LI Jia 1,HU Yu 2.& LI XiaoWei 2.1 The school of software,Tsinghua {2.,Beijing 100084,China 2.The Institute of Computing technology,Chinese Academy of Sciences,Beijing 100190,China The school of software Tsinghua University The Institute of Computing technology Chinese Academy of Sciences

Test power of VLSI systems has become a challenging issue *** scan shift power dominates the average test power and restricts clock frequency of the shift phase,leading to excessive thermal accumulation and long test *** pap.r.proposes a scan chain design technique to solve the above *** on weighted transition metric (WTM),the proposed extended WTM (EWTM) that is utilized to guide the scan chain design algorithm can estimate the scan shift power in both the shift-in and shift-out ***,the wire length overhead of the proposed scan chain design can also be reduced by the proposed distance of EWTM (DEWTM) *** results confirm that the proposed ap.r.ach can significantly reduce scan shift power with low wire length overhead.

关键词： low power DfT scan-based testing test power reduction scan chain design

An index-split Bloom filter for deep packet inspection

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2011年第1期54卷 23-37页

作者： HUANG Kun1 & ZHANG DaFang1,2.1school of Computer and Communication,Hunan university,Changsha 410082.China 2.school of software,Hunan university,Changsha 410082.China school of Computer and Communication Hunan University school of software Hunan University

Deep packet inspection(DpI)scans both packet headers and payloads to search for predefined *** link rates and traffc volumes of Internet are constantly growing,DpI is facing the high p.r.ormance challenge of how to achieve line-speed packet processing with limited embedded *** recent trie bitmap content analyzer(TriBiCa)suffers from high update overhead and many false positive memory accesses,while the shared-node fast hash table(SFHT)suffers from high update overhead and large memory *** pap.r.presents an index-split Bloom filter(ISBF)to overcome these *** a set of off-chip items,an index of each item is split ap.r. into several groups of constant bits,and each group of bits uses an array of on-chip p.r.llel counting Bloom filters(CBFs)to represent the overall off-chip *** an item is queried,several groups of on-chip p.r.llel CBFs constitute an index of an off-chip item candidate for a ***, we propose a lazy deletion algorithm and vacant insertion algorithm to reduce the update overhead of ISBF, where an on-chip deletion bitmap is used to update on-chip p.r.llel CBFs,not adjusting other related off-chip *** ISBF is a time/space-effcient data structure,which not only achieves O(1)average memory accesses of insertion,deletion,and query,but also reduces the memory *** results demonstrate that comp.r.d with the TriBiCa and SFHT,the ISBF significantly reduces the off-chip memory accesses and processing time of primitive op.r.tions,as well as both the on-chip and off-chip memory sizes.

关键词： network security packet processing deep packet inspection hash table Bloom filter

p.r.eptual video hashing robust against geometric distortions

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2012年第7期55卷 1520-1527页

作者： XIANG ShiJun 1,4 ,YANG JianQuan 2.& HUANG JiWu 3 1 school of Information Science and technology,Jinan {2.,Guangzhou 510632.China 2.Shenzhen Institutes of Advanced technology,Chinese Academy of Sciences,Shenzhen 518055,China 3.school of Information Science and technology,Sun Yat-sen {2.,Guangzhou 5102.5,China 4 State Key Laboratory of Information Security,Institute of software,Chinese Academy of Sciences,Beijing 100049,China school of Information Science and technology Jinan University Guangzhou China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing China Shenzhen Institutes of Advanced technology Chinese Academy of Sciences Shenzhen China school of Information Science and technology Sun Yat-sen University Guangzhou China

In this pap.r.we propose a robust p.r.eptual hashing algorithm by using video luminance histogram in *** underlying robustness principles are based on three main aspects:1) Since the histogram is independent of position of a pixel,the algorithm is resistant to geometric deformations; 2. the hash is extracted from the spatial Gaussian-filtering low-frequency component for those common video processing op.r.tions such as noise corruption,low-pass filtering,lossy compression,etc.; 3) a temp.r.l Gaussian-filtering op.r.tion is designed so that the hash is resistant to temp.r.l desynchronization op.r.tions,such as frame rate change and *** a result,the hash function is robust to common geometric distortions and video processing *** results show that the proposed hashing strategy can provide satisfactory robustness and uniqueness.

关键词： video hashing geometric distortion histogram Gaussian filtering

An Hybrid Improved p.r.icle Swarm Algorithms for Constrained Optimization

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

An Hybrid Improved Particle Swarm Algorithms for Constrained...

Selection of unitary op.r.tions in quantum secret sharing without entanglement

2.07北京地区高校研究生学术交流会通信与信息技术会议

作者： Chen Shaoxin Zhou Kuanjiu (software college,dalian {2. university,dalian 11602.)

The pap.r.designed a hybrid improved p.r.icle Swarm Algorithm for Constrained Optimization,a solution of an advanced fitness function,which introduced the conception of feasible zone to treat with the restrained ***,the writer adopted the outer of set to preserve the non-dominated set just found,and joined tab algorithm in selecting of the optimal value of the best,so that it avoided getting into the optimizing locality earlier and improved the solution *** exp.r.ments indicated that this algorithm can solve the constraint multi-objective optimum problems,and it is a most potential multiobjective optimal ap.r.aches.

关键词： Multi-Objective p.r.icle Swarm Algorithm Selection Op.r.tor Tab Algorithm

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2011年第9期54卷 1837-1842页

作者： XU Juan 1,CHEN HanWu 1,LIU WenJie 1,2.& LIU ZhiHao 1 1 school of Computer Science and Engineering,Southeast university,Nanjing 2.0096,China 2.school of Computer and software,Nanjing university of Information Science and technology,Nanjing 2.0044,China school of Computer Science and Engineering Southeast University school of Computer and software Nanjing University of Information Science and Technology

We propose a substitute-Bell-state attack strategy for quantum secret sharing schemes without entanglement,as well as a definition of the minimum failure probability of such attack strategy.A quantitative analysis of security degrees corresponding to different unitary op.r.tions is also provided,when the secret sharing schemes without entanglement are stricken by substitute-Bell-state *** a result,the relation between the selection of unitary op.r.tions and the effect of substitute-Bell-state attack is shown,which can serve as an imp.r.ant guidance for the selection of unitary op.r.tions in designing and implementing quantum secret sharing schemes.

关键词： quantum secret sharing substitute-Bell-state attack unitary op.r.tion minimum failure probability

An algorithm to compute maximal contractions for Horn clauses

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2011年第2期54卷 244-257页

作者： LUO Jie & LI Wei State Key Laboratory of software Development Environment, school of Computer Science and {2., Beihang university, Beijing 100191, China State Key Laboratory of software Development Environment School of Computer Science and Technology Beihang University

In the theory of belief revision, the computation of all maximal subsets (maximal contractions) of a formula set with respect to a set of facts is one of the key problems. In this pap.r. we try to solve this problem b... 详细信息

ract>In the theory of belief revision, the computation of all maximal subsets (maximal contractions) of a formula set with respect to a set of facts is one of the key problems. In this pap.r. we try to solve this problem by studying the algorithm to compute all maximal contractions for Horn clauses. First, we point out and prove the conversion relationship between minimal inconsistent subsets of union of the formula set and the set of facts and maximal contractions of the formula set with respect to the set of facts. Second, we prove a necessary condition of a set of Horn clauses to be minimal inconsistent. Then, based on these two conclusions, we propose an interactive algorithm to enumerate all minimal inconsistent subsets of a given set of Horn clauses and a second algorithm to compute maximal contractions from these minimal inconsistent subsets. Finally, we proposed an interactive algorithm to compute maximal contractions for Horn clauses by composing the above two algorithms.

关键词： maximal contraction minimal inconsistent set minimal subtraction Horn clause

Multi-dimensional project management models for mega-construction companies and their applications

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Technological Sciences) 2011年第S1期54卷 118-124页

作者： LIN ZhengHang 1,2.QIANG MaoShan 1,2.TANG WenZhe 1,2.FAN QiXiang 3 &LIU Qiang 4 1 Institute of project Management and Construction technology,Tsinghua university,Beijing 100084,China 2.State Key Laboratory of Hydraulic and Engineering,Tsinghua university,Beijing 100084,China 3 China Three Gorges Corp.r.tion,Yichang 443002.China 4 school of software,Tsinghua university,Beijing 100084,China Institute of project Management and Construction technology Tsinghua University State Key Laboratory of Hydraulic and Engineering Tsinghua University

China is undertaking an increasing number of mega-infrastructure projects along with its rapid economic *** p.r.icipants in these projects,understand how to adapt the prop.r.and efficient management strategies is *** this pap.r.we propose three distinct models for companies under various background and management requirements,based on sophisticated data analysis and model ***,we successfully committed these models with hydropower development projects and achieved a great progress in enhancing management efficiency.

关键词： project management models mega-construction companies applications hydropower development companies

维普期刊数据库

Finite Element Analysis of Thermal Stresses in Ceramic/Metal Gradient Thermal Barrier Coatings

在线全文

学校读者我要写书评

暂无评论

Journal of Wuhan university of technology(Materials Science) 2005年第3期20卷 44-47页

作者：明平顺肖金生 school of Automotive Engineering Wuhan University of Technology State Key Laboratory of Advanced technology for Materials Synthesis and processing Wuhan University of Technology Wuhan 430070 China

This pap.r.studied the thermal stresses of ceramicl metal gradient thermal barrier coating which combines the conceptions of ceramic thermal barrier coating （TBC） and functionally gradient material （FGM）. Thermal stresses and residual thermal stresses were calculated by an ANSYS finite element analysis software. Negative thermal expansion coefficient method was proposed and element birth and death method was applied to analyze the residual thermal stresses which have non-uniform initial temp.r.ture field. The numerical results show a good agreement with the analytical results and the exp.r.mental results.

关键词： functionally gradient material thermal barrier coating thermal stress finite element analysis ANSYS

维普期刊数据库

Deterministic secure quantum communication without unitary op.r.tion based on high-dimensional entanglement swapping

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2012年第2期55卷 360-367页

作者： LIU ZhiHao1,CHEN HanWu1,LIU WenJie2.XU Juan1 & LI ZhiQiang3 1school of Computer Science and Engineering,Southeast university,Nanjing 2.1189,China 2.0} of Computer and software,Nanjing university of Information Science & technology,Nanjing 2.0044,China 3College of Information Engineering,Yangzhou university,Yangzhou 2.5009,China school of Computer Science and Engineering Southeast University school of Computer and software Nanjing University of Information Science & Technology

By analysis of the basic prop.r.ies of entanglement swapping of high-dimensional Bell states,a universal and general deterministic secure quantum communication(DSQC)protocol is proposed,in which unitary op.r.tion is not *** making use of the results of high-dimensional Bell measurement,the sender and the receiver can encode and decode the message respectively by p.r.orming the modular addition and *** mutually complementary bases are constructed;and according to the prop.r.y of mutual complement,a method for checking security of the high-dimensional quantum channel is put *** common attack strategies are analyzed,and the corresponding error rates are *** the upp.r.bound of the threshold of error rate is deduced.

关键词： deterministic secure quantum communication high-dimensional Bell state entanglement swap-ping high-dimensional Bell measurement