New field of cryptography： DNA cryptography

The vast parallelism, exceptional energy efficiency and extraordinary information density inherent in DNA molecules are being explored for computing, data stor- age and cryptography. In such research area, novel computers, data storage and cryptography mi…     

New Public Key Cryptosystems from Combinatorial Group Theory

0 IntroductionThe security of most commonly used cryptographicschemesis essentially based onthree families of compu-tational problems :the integer factoring problem(RSAprob-lem) ,the Diffie-Hell man problemand the discrete logarithmproblem,andthe elliptic curve variants thereof .Inthe middleof 1990s , Shor[1], Bonehet al[2]presented some remarkablequantumalgorithms which can solveinteger factoring problemand discrete logarithmproblemover any group including Ga-lois fields and elliptic curve…     

A Parallel Genetic Simulated Annealing Hybrid Algorithm for Task Scheduling

0 IntroductionGrid computingis a hot topic inthe current internet research,and a developing direction of the parallel and distributedprocess[1 ,2].Since the task scheduling in grid computing faces aNP-hard problem[3];it has drawn attention from many scholarsand become the focusinthe field of the current grid computing re-search.In recent years , two global random and opti mal algorithmhave been widelystudiedandappliedinthefield of the gridcompu-ting research: GA(Genetic Algorithm) and SA( …     

Merkle Tree Digital Signature and Trusted Computing Platform

0 IntroductionDigital signatureis a key technique to provide datainteg-rity andsource authenticationcapabilities to enhance da-ta trustworthiness in trusted computing platform. Most cur-rent digital signature schemes are based on complex mathe-matical problems , such as integer factoring, discrete log-arithm,and discrete logarithm on elliptic curves . The hard-ness of these underlying mathematical problems is really un-certain at present . Merkle treeis a method used for authenti-cation and di…     

DNA芯片在最短公共超串问题中的应用

DNA芯片技术是近年来生命科学与信息科学的新兴研究领域,其突出特点在于它的高度并行性、多样化、微型化以及自动化.最短公共超串问题是计算机科学中的NP-完全问题.笔者在DNA计算和DNA芯片基础上,提出了基于DNA芯片解决最短公共超串问题的DNA计算新模型.该模型可对信息高度并行获取,并且具有操作易自动化的优点.     

Linguistic Truth Values Lattice Implication Algebras

In order to study uncertainty reasoning and automatic reasoning with linguistic terms, in this paper, the set of basic linguistic truth values and the set of modifiers are defined, according to common sense; partially orderings are defined on them. Based on it, a lattice implication algebra model L18 of linguistic terms is built; furthermore, its some basic properties are discussed.     

The Mechanism about Key and Credential on Trusted Computing Platform and the Application Study

0 IntroductionPeople need a secure and dependable computing environ-ment[1]. The cryptology is known as the core of com-puter security[2]. The application of cryptologyis mainly ful-filled by key management and credential mechanism.In thispaper , we should study the key management and credentialmechanismbased ontrusted computing platform,and give theactual application of these security mechanisms for buildingtrusted computing environment .1 OverviewTrusted Computing1 .1 The Original of Trus…     

A Behavior-Based Remote Trust Attestation Model

0 IntroductionDue to the fast development of communication technolo-gies ,the lowered cost of hardware,there is anincreas-ing reliance on computer networks . However ,along with thetremendous convenience provided,there is increasing numberof network based attacks .One particular kind of attacks exploits software vulnera-bilities .It is lunched by a virus or worm.Some examples in-clude earlier worms such as Code Red, Ni mda as well as re-cently high speed worms ,such as Slammer , Witty and F…     

网格数据查询优化中的缓存管理研究

鉴于缓存管理在分布式系统中可以减少网络流量,提高系统响应速度,尤其在网格计算环境中可以克服网络连接的带宽瓶颈,提出了一个用于优化网格信息查询的缓存管理模型.网格搜索引擎进行信息检索时,依据用户的查询需求,从网格异地异构数据库中查询并自动抽取信息,进行查询集成并存储在高速缓存中;根据缓存调度算法合理地组织中间结果;按照打分函数的控制,在生成的评分表下进行Top-K排序,合并生成最终结果;在保证网格查询准确性的同时,提高网格异构数据源查询速度.实验表明此方法是有效的.     

网页文本分类中的特征选择研究

由于超链接语言结构本身所提供的信息,网页分类问题不同于一般的文本分类。本文分析了网页内部特征,并在1000篇网页规模语料库的基础上,通过试验对比了三种特征选择方法对高维特征向量空间进行降维的效果。文章还提出了一种新方法,根据特征项所处的位置赋予不同权重的方法,实验表明这种由文本结构导出的权重计算方法能够取得很好的分类效果。