Parasitic computing

Reliable communication on the Internet is guaranteed by a standard set of protocols, used by all computers. Here we show that these protocols can be exploited to compute with the communication infrastructure, transforming the Internet into a distributed computer in which servers unwittingly perform computation on behalf of a remote node. In this model, which we call 'parasitic computing', one machine forces target computers to solve a piece of a complex computational problem merely by engaging them in standard communication. Consequently, the target computers are unaware that they have performed computation for the benefit of a commanding node. As experimental evidence of the principle of parasitic computing, we harness the power of several web servers across the globe, which-unknown to them-work together to solve an NP complete problem.     

云计算与网格计算比较研究

云计算作为下一代计算模式,在科学计算和商业计算领域发挥着重要作用,受到当前学术界和企业界的广泛关注.云计算不同于传统的以个人计算机为中心的本地计算,它以互联网为中心,通过构建一个或多个由大量普通机器和网络设备连接的数据中心,把海量的数据存储到数据中心上,向上层的服务和应用提供安全、可靠、快捷、透明的数据存储和计算服务.根据国内外相关文献,通过对云计算和网格计算在体系结构、计算模型、编程模型方面进行了深入的讨论,对云计算的概念有更准确和深入的了解.     

云计算--实现概念计算的方法

云理论是实现概念的定性值与数字的定量值之间自然转换的有力工具．本文在云理论的基础上，提出了实现概念计算(也叫简化计算)的云计算方法．概述了云模型与不确定推理；给出了计算的逻辑描述，将计算过程抽象成为推理过程；运用机器学习的方法，给出了计算云化的过程，并且采用不确定推理的方法，给出了云的计算过程；简单阐述了云化计算的系统实现．     

Modeling Trusted Computing

0 IntroductionThe purpose of trusted computingis to solve some of to-day’s security problems through hardware changes topersonal computer . The trusted property can be extendedfromroot of trust to entire PC platformthrough the chain oftrust[1].Root of trustis a small hardware device calledtrustedplatform module (TPM) addedto PC.A well-known project of trusted computing is trustedcomputing platformalliance(TCPA) .It is calledtrusted com-puting group (TCG) now[2 ,3]. Besides this , other…     

E级计算之远景

 超级计算机在当今科技发展中占有举足轻重的地位。在向着E级计算时代迈进之时,精确衡量超算的性能是一个事关超算架构和应用的关键问题。评价一台超算采用不同的基准会产生不同的结果。本文介绍超算中主要的3种排名及其对应的评测基准,并分析了超算本身的发展及应用远景。     

DNA computing on surfaces

DNA computing was proposed as a means of solving a class of intractable computational problems in which the computing time can grow exponentially with problem size (the 'NP-complete' or non-deterministic polynomial time complete problems). The principle of the technique has been demonstrated experimentally for a simple example of the hamiltonian path problem (in this case, finding an airline flight path between several cities, such that each city is visited only once). DNA computational approaches to the solution of other problems have also been investigated. One technique involves the immobilization and manipulation of combinatorial mixtures of DNA on a support. A set of DNA molecules encoding all candidate solutions to the computational problem of interest is synthesized and attached to the surface. Successive cycles of hybridization operations and exonuclease digestion are used to identify and eliminate those members of the set that are not solutions. Upon completion of all the multistep cycles, the solution to the computational problem is identified using a polymerase chain reaction to amplify the remaining molecules, which are then hybridized to an addressed array. The advantages of this approach are its scalability and potential to be automated (the use of solid-phase formats simplifies the complex repetitive chemical processes, as has been demonstrated in DNA and protein synthesis). Here we report the use of this method to solve a NP-complete problem. We consider a small example of the satisfiability problem (SAT), in which the values of a set of boolean variables satisfying certain logical constraints are determined.     

Trust Based Pervasive Computing

Pervasive computing environment is a distributed and mobile space. Trust relationship must be established and ensured between devices and the systems in the pervasive computing environment. The trusted computing （TC） technology introduced by trusted computing group is a distributed-system-wide approach to the provisions of integrity protection of resources. The TC＇s notion of trust and security can be described as conformed system behaviors of a platform environment such that the conformation can be attested to a remote challenger. In this paper the trust requirements in a pervasive/ubiquitous environment are analyzed. Then security schemes for the pervasive computing are proposed using primitives offered by TC technology.     

DNA计算技术进展

论述DNA计算技术进展。先介绍DNA计算的基本原理,论述DNA计算的特点方法和存在的问题,接着介绍DNA计算的国内外研究现状,最后指出DNA计算研究中需要解决的问题。     

Experimental one-way quantum computing

Standard quantum computation is based on sequences of unitary quantum logic gates that process qubits. The one-way quantum computer proposed by Raussendorf and Briegel is entirely different. It has changed our understanding of the requirements for quantum computation and more generally how we think about quantum physics. This new model requires qubits to be initialized in a highly entangled cluster state. From this point, the quantum computation proceeds by a sequence of single-qubit measurements with classical feedforward of their outcomes. Because of the essential role of measurement, a one-way quantum computer is irreversible. In the one-way quantum computer, the order and choices of measurements determine the algorithm computed. We have experimentally realized four-qubit cluster states encoded into the polarization state of four photons. We characterize the quantum state fully by implementing experimental four-qubit quantum state tomography. Using this cluster state, we demonstrate the feasibility of one-way quantum computing through a universal set of one- and two-qubit operations. Finally, our implementation of Grover's search algorithm demonstrates that one-way quantum computation is ideally suited for such tasks.     

基于云计算环境的蚁群优化计算资源分配算法

提出一种基于蚁群优化(Ant Colony Optimization)的计算资源分配算法.分配计算资源时,首先预测潜在可用节点的计算质量,然后根据云计算环境的特点,通过分析诸如带宽占用、线路质量和响应时间等因素对分配的影响,利用蚁群优化算法得到一组最优的计算资源.通过在Gridsim环境下的仿真分析和比较,这种算法能够在满足云计算环境要求的前提下,获得比其他一些针对网格的分配算法更短的响应时间和更好的运行质量,因而更加适合于云环境.     

云计算环境中P2P计算的优化组织模型

P2P计算具有一些良好的特质,但是由于资源分布的任意性、互联网较大的延时、较低的有效带宽以及较高的数据传输代价,实际中目前的P2P计算效率受到了很大限制。对此问题以前的研究工作主要集中于在现行的P2P计算模型下,对一些机制进行改进。与这些先前工作不同,该研究提出了一个新的模型,它对P2P计算进行优化的组织,即将一些合适的P2P计算实例调度到适合的云计算节点上,并且以最优的方式来为其调度所需资源。更重要地,该文对优化组织过程进行了详细的数学分析和深入的理论建模,并同时对性能和代价进行了考虑。由于问题的解空间将随着问题规模的增长以指数速度扩张,因此提出了基于生物免疫思想的智能计算方法。实验验证了该算法的有效性和效率;并且与现行P2P计算模式进行对比实验的结果表明:该模型和方法为不同类型的P2P计算任务节省了运行时间和实际代价。     

一种基于进化博弈论的云计算虚拟计算资源配置模型

目前针对云计算的资源配置策略研究多关注于云计算资源提供商状况,研究云计算资源提供商的虚拟资源调度管理策略,可以提高云计算资源的可靠性和资源利用率.本文针对云应用提供商,提出基于进化博弈论的自适应资源配置模型,以性能目标为进化博弈目标,通过该模型得到最优的资源分配策略.对比实验结果显示,本模型能有效减少资源的使用.     

基于改进的粒子群优化的云计算资源调度模型

针对云计算系统中多任务并发模式下引发的资源竞争,本文提出了一种基于改进的粒子群优化的云计算资源调度分配模型,以提高资源利用率.首先,对云计算系统中的资源调度问题进行形式化描述,构建以任务的总完成时间为优化对象的目标函数.其次,求解时采用粒子群优化算法,为保证收敛速度且避免粒子群在搜索过程中陷入局部最优,定义了惯性权重函数.另外,引入一个调整算子以优化位置更新.仿真结果表明,本文提出的资源调度分配模型能够有效提高云计算资源利用率,大幅减少任务的处理时间.     

一种基于关系数据库管理系统的图计算平台

本文提出了一种新的基于关系数据库管理系统(Relational Database Management System,RDBMS)(本文简称关系数据库)的图计算平台.该平台将图数据以原生的形式在关系数据库的表格中存储,从而在数据表达上和原生图计算平台达到了一致.该平台将图计算逻辑完整准确地表达为SQL(Structured Query Language)查询语句.关系数据库执行SQL查询语句,从而完成图计算,并将结果返回.实验结果表明,该新的平台有效地利用了关系数据库成熟的查询优化技术,在很多方面优于现有的原生数据平台;而目前的性能局限,也会随着未来关系数据库的不断演化和迭代,得到有效的解决.     

计算网格中的组件服务

在网格环境下的高能计算中,网络应用扩展为一系列的相互作用的组件,一个完整的网络应用应该以即插即用的方式整合这些组件.文中采用了公共组件结构来建立这些组件.为了提高组件之间的通信效率,增加组件的动态扩展性,还需要事件服务以及通道的概念.本文中还用到了一些XML的内容.     

The rise of granular computing

This paper has two purposes. One is to present a critical examination of the rise of granular computing and the other is to suggest a triarchic theory of granular computing. By examining the reasons, justifications, and motivations for the rise of granular computing, we may be able to fully appreciate its scope, goal and potential values. The results enable us to formulate a triarchic theory in the light of research results from many disciplines. The three components of the theory are labeled as the philosophy, the methodology, and the computation. The integration of the three offers a unified view of granular computing as a way of structured thinking, a method of structured problem solving, and a paradigm of structured information processing, focusing on hierarchical granular structures. The triarchic theory is an important effort in synthesizing the various theories and models of granular computing.     

综合计算环境与工具

作为综合计算环境与工具的系列软件 ,进一步阐明所开发的支持工具与采用的开发方法 .从库的存储压缩 ,主库、辅库、字典库的分立协同 ,到库数据的录入介面表格自动生成软件、输出统计表格自动生成及其表格数据的自动生成软件以及系统在线求助软件的通用算法等 .     

基于CORBA的Web计算体系结构的研究

现有的 Web计算体系结构在性能和功能上无法满足未来 Web上企业计算的要求。论文通过分析 Web计算领域内 CORBA (comm on object request broker architecture)体系结构的优势和不足 ,以及 Java计算体系结构的优缺点 ,研究并提出满足 Web计算要求的基于 CORBA和 JavaServlet的 Web计算体系结构。采用这种新的体系结构设计并初步实现了一个原型系统。该系统是一个个人化信息查询服务系统 ,主要提供网络浏览的导航服务。与原有系统比较 ,具有良好的可移植性、互操作性和可复用性 ,并且大大提高了前端的响应处理能力 ,表明新型的体系结构能够很好地解决现有体系结构存在的一些缺陷 ,具有理论上的先进性和现实中的可行性