检索结果-南通市图书馆

Multiparty simultaneous quantum identity authentication with secret sharing

Science china(Physics,Mechanics & Astronomy) 2008年第3期51卷 321-327页

作者： YANG YuGuang1,2,WEN QiaoYan3 & ZHANG Xing4,5 1 College of Computer Science and technology,beijing university of technology,beijing 100022,china 2 State Key laboratory of Information Security (Graduate university of the Chinese Academy of Sciences),beijing 100049,china 3 School of Science,beijing university of Posts and Telecommunications,beijing 100876,china 4 Institute of Electronic technology,Information Engineering university,Zhengzhou 450004,china 5 trusted computing laboratory,beijing university of technology,beijing 100022,china College of Computer Science and technology Beijing University of Technology Beijing China State Key laboratory of Information Security (Graduate university of the Chinese Academy of Sciences) Beijing China School of Science Beijing University of Posts and Telecommunications Beijing China Institute of Electronic technology Information Engineering University Zhengzhou China trusted computing laboratory Beijing University of Technology Beijing China

Two multiparty simultaneous quantum identity authentication (MSQIA) protocols based on secret sharing are presented. All the users can be authenticated by a trusted third party (TTP) simultaneously. In the first protocol,the TTP shares a random key K with all the users using quantum secret sharing. The ith share acts as the authentication key of the ith user. When it is necessary to perform MSQIA,the TTP generates a random number R secretly and sends a sequence of single photons encoded with K and R to all the users. According to his share,each user performs the corresponding unitary operations on the single photon sequence sequentially. At last,the TTP can judge whether the impersonator exists. The sec-ond protocol is a modified version with a circular structure. The two protocols can be efficiently used for MSQIA in a network. They are feasible with current technol-ogy.

关键词： quantum identity authentication secret sharing quantum cryptography

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A new DNA algorithm to solve graph coloring problem

引用

Progress in Natural Science:Materials International 2007年第6期17卷 733-738页

作者： Jiang Xingpeng1, Li Yin2, Meng Ya3 and Meng Dazhi2(1. National laboratory of Pattern Recognition,Institute of Automation, Chinese Academy of Sciences, beijing 100080, china 2. College of Applied Sciences, beijing university of technology, beijing 100022, china 3. School of Science, beijing Institute of technology, beijing 100081, china) National laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing 100080 China National High Magnetic Field laboratory Florida State University 1800 East Paul Dirac Drive Tallahassee Florida 32306 USA

Using a small quantity of DNA molecules and little experimental time to solve complex problems successfully is a goal of DNA computing. Some NP-hard problems have been solved by DNA computing with lower time complexity than conventional computing. However, this advantage often brings higher space complexity and needs a large number of DNA encoding molecules. One example is graph coloring problem. Current DNA algorithms need exponentially increasing DNA encoding strands with the growing of problem size. Here we propose a new DNA algorithm of graph coloring problem based on the proof of four-color theorem. This algorithm has good properties of needing a relatively small number of operations in polynomial time and needing a small number of DNA encoding molecules (we need only 6R DNA encoding molecules if the number of regions in a graph is R).

关键词： DNA computing NP-hard problem graph coloring problem.

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Weighted weak type estimates for commutators of the Marcinkiewicz integrals

引用

Science china Mathematics 2004年第1期47卷 83-95页

作者： DING Yong, LU Shanzhen & ZHANG PuDepartment of Mathematics, beijing Normal university, beijing 100875, china Department of Information and computing Science, Zhejiang Institute of Science and technology, Hangzhou 310033, china Department of Mathematics Beijing Normal University Beijing China Department of Information and computing Science Zhejiang Institute of Science and Technology Hangzhou China

In this paper the authors give the weighted weak LlogL type estimates for a class of the higher order commutator generated by the Marcinkiewicz integral and a BMO function. In addition, the weak type norm inequalities... 详细信息

关键词： Marcinkiewicz integral, commutator, Ap weight, weak type estimate.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

The correspondence between the concepts in description logics for contexts and formal concept analysis

引用

Science china(Information Sciences) 2012年第5期55卷 1106-1122页

作者： MA Yue 1,2,SUI YueFei 1 & CAO CunGen 1 1 Key laboratory of Intelligent Information Processing,Institute of computing technology,Chinese Academy of Sciences,beijing 100190,china 2 Graduate university of Chinese Academy of Sciences,beijing,china Key laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Graduate university of Chinese Academy of Sciences

Formal concept analysis (FCA) and description logic (DL) are meant to be formalizations of concepts.A formal concept in the former consists of its intent and extent,where the intent is the set of all the attributes shared by each object in the extent of the concept,and the extent is the set of all the objects sharing each property in the intent of the concept.A concept in the latter formalization is simply a concept name,the interpretation of which is a subset of a *** consider the correspondence between concepts in both formalizations,a multi-valued formal context must be represented both as a knowledge base and as a model of the DL for contexts,where concepts are decomposed into tuple concepts C,interpreted as a set of tuples and value concepts V,interpreted as a set of attribute-value *** show that there is a difference between the interpretation of concepts R.V /R.C and the Galois connection between the extent/intent of formal concepts in *** to the Galois connection,there should be concepts of the form + R.V and + R.C inter-preted in FCA,and hence the logical language L for DL is extended to be L + together with + as a constructor so that + R.V and + R.C are well-defined ***,according to the interpretation in DL there should be pseudo concepts in FCA so that the interpretation of concepts R.V /R.C is the extent/intent of pseudo *** correspondence between formal concepts and concepts in L +,and between pseudo concepts and concepts in L are presented in this paper.

关键词： description logic formal concept analysis concept attribute/role

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

An introduction to Tsinghua Cloud

引用

Science china(Information Sciences) 2010年第7期53卷 1481-1486页

作者： ZHENG WeiMin1,2 1Department of Computer Science and technology, Tsinghua university, beijing 100084, china 2Tsinghua National laboratory for Information Science and technology, beijing 100084, china Department of Computer Science and technology Tsinghua University Tsinghua National laboratory for Information Science and technology

Cloud computing has become a trend that draws attention from both academia and industry all over the world. This paper unveils details of Tsinghua Cloud, a comprehensive solution for cloud computing developed by Tsing... 详细信息

关键词： cloud computing distributed file system virtual computing environment data sharing

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Design of secure operating systems with high security levels

引用

Science in china(Series F) 2007年第3期50卷 399-418页

作者： QING SiHan1,2 & SHEN ChangXiang3 1 Institute of Software, Chinese Academy of Sciences, beijing 100080, china 2 School of Software and Microelectronics, Peking university, beijing 102600, china 3 Institute of computing technology, Navy, beijing 100841, china Institute of Software Chinese Academy of Sciences School of Software and Microelectronics Peking University Institute of computing technology

Numerous Internet security incidents have shown that support from secure operating systems is paramount to fighting threats posed by modern computing environments. Based on the requirements of the relevant national and international standards and criteria, in combination with our experience in the design and development of the ANSHENG v4.0 secure operating system with high security level （hereafter simply referred to as ANSHENG OS）, this paper addresses the following key issues in the design of secure operating systems with high security levels： security architecture, security policy models, and covert channel analysis. The design principles of security architecture and three basic security models： confidentiality, integrity, and privilege control models are discussed, respectively. Three novel security models and new security architecture are proposed. The prominent features of these proposals, as well as their applications to the ANSHENG OS, are elaborated. Cover channel analysis （CCA） is a well-known hard problem in the design of secure operating systems with high security levels since to date it lacks a sound theoretical basis and systematic analysis approach. In order to resolve the fundamental difficulties of CCA, we have set up a sound theoretical basis for completeness of covert channel identification and have proposed a unified framework for covert channel identification and an efficient backward tracking search method. The successful application of our new proposals to the ANSHENG OS has shown that it can help ease and speedup the entire CCA process.

关键词： secure operating systems with high security levels architecture security model covert channel analysis

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

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 university,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 *** paper 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 approach can significantly reduce scan shift power with low wire length overhead.

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

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Strict constraints on 2D primitive pairs for engineering symbol recognition:Theory and application

引用

Science china(Information Sciences) 2012年第5期55卷 1032-1041页

作者： LI Ting 1,2,QIU XianJie 1,HUANG He 1 & WANG ZhaoQi 1 1 Virtual Reality laboratory,Institute of computing technology Chinese Academy of Sciences,beijing 100190,china 2 Graduate university of Chinese Academy of Sciences,beijing 100049,china Virtual Reality laboratory Institute of Computing Technology Chinese Academy of Sciences Graduate university of Chinese Academy of Sciences

Geometric constraints on the line-line pair,line-arc pair and arcarc pair are *** con-straints are able to encode the geometric relations between lines,arcs and circles.A geometric proof is presented to demonstrate that the constraints are stable under translation,rotation,uniform scaling or reflection of the primitive *** on the constraints,an algorithm for recognizing symbols in drawings is ***-perimental results show that,compared with three other methods,our method can distinguish more primitive pairs and has higher accuracy in engineering symbol recognition.

关键词： coordinated multi-point transmission multicell cooperation capacity analysis MIMO-OFDM power allocation frequency selective MIMO channel

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Giant complete automaton for uncertain multiple string matching and its high speed construction algorithm

引用

Science china(Information Sciences) 2011年第8期54卷 1562-1571页

作者： HU Yue 1,2, GAO QingShi 1,2 ,GUO Li 2 & WANG PeiFeng 1 1 School of Information Engineering,university of Science and technology beijing,beijing 100083,china 2 Institute of computing technology,Chinese Academy of Sciences,beijing 100190,china School of Information Engineering University of Science and Technology Beijing Institute of computing technology Chinese Academy of Sciences

Multiple string matching is often completed under the presence of U- or V-uncertain-strings,or combinations *** large numbers of strings with U-, V-,and U-V-uncertain-strings,including the interleaving of two or more uncertain strings,is important to thoroughly gathering useful information and detecting harmful *** paper proposes a complete automaton and its high-speed construction algorithm for large-scale U-, V-,and U-V-uncertain multiple strings,including two or more uncertain strings interlaced with one *** maximum number of parallel complete automation of the V-uncertain string is also *** paper reveals that there are two kinds of pretermissions,i.e.,similarly-connected and interlaced-string pretermissions,and that mistake may appear in the matching of the regular expressions,or states in the automaton may increase in number,if the intersection of the U-uncertain strings sets and the homologous subsequent special point in the U-uncertain strings sets are not eliminated from the whole system.

关键词： multiple string matching U-uncertain-strings V-uncertain-strings U-V-uncertain-strings complete automaton

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Analysis of moment invariants under general linear transformation

引用

Science china(Information Sciences) 2010年第7期53卷 1305-1311页

作者： DIAO LuHong1, LI Hua2, ZHANG Sen1 & LIU Lei1 1College of Applied Sciences, beijing university of technology, beijing 100124, china 2National Center of Intelligent computing, Institute of computing technology, Chinese Academy of Science, beijing 100080, china College of Applied Sciences Beijing University of Technology National Center of Intelligent computing Institute of Computing Technology Chinese Academy of Science

This paper presents the necessary and sufficient condition of moment invariants under general linear transformation. Based on this condition, arbitrary order and dimensional moment invariant sets can be constructed. D... 详细信息

关键词： moment invariants independence linear transformation

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：