On dependability of computing systems

With the rapid development and wide applications of computing systems on which more reliance has been put,a dependable system will be much more important than ever.This paper is first aimed at giving informal but precise definitions characterizing the various attributes o dependability of computing systems an then th importance of (and the relationships among)all te the attributes are explained.Dependability is first introduced as a blobal concept which subsumes the usual atributes of reliability,availability,maintainability,safety and sevurity.The basic definitions given here are then commended and supplemented by detailed material and additional explanations in the subsequent sections. The presentation has been structured as follows so as to attract the reader‘s attention to the important attributions of dependability.Search for a few number of concise concepts enabling the dependability attributes to be expressed as clearly as possible.Use of terms which are identical or as close as possible to those commonly used nowadays.This paper is also intended to provoke people‘s interest in designing a dependable computing system.     

Research on technology of desktop virtualization based on SPICE protocol and its improvement solutions

Increasingly mature cloud computing technology promotes virtual desktop technology, which can solve many problems existing in traditional computing models. However, virtual desktop solutions introduce the thorny problem of how to deliver a real desktop experience to users, as if they are using it locally, especially when playing video. The SPICE （simple protocol for independent computing environments） virtual desktop solution provides several image compression algorithms to address this problem with the purpose of making virtual desktops as real as possible. Although different compression algorithms can contribute their own abilities to different images to a large extent, switching between them is a big problem that consumes a large amount of resources to detect the different type of image and also causes jitter of the virtual desktop. This paper proposes a new solution, called SPICEx, using the JPEG2000 compression algorithm with dynamic compression ratios to solve the problem and finally validates that the performance is better than that of SPICE. With better quality of user experience and also reducing bandwidth consumption, SPICEx solution is meaningful in virtual desktop fields and can be widely used.     

Task-resource scheduling problem

Cloud computing is a new and rapidly emerging computing paradigm where applications,data and IT services are provided over the Internet.The task-resource management is the key role in cloud computing systems.Task-resource scheduling problems are premier which relate to the efficiency of the whole cloud computing facilities.Task-resource scheduling problem is NPcomplete.In this paper,we consider an approach to solve this problem optimally.This approach is based on constructing a logical model for the problem.Using this model,we can apply algorithms for the satisfiability problem(SAT) to solve the task-resource scheduling problem.Also,this model allows us to create a testbed for particle swarm optimization algorithms for scheduling workflows.     

网格计算技术及应用综述

Grid computing is a new kind of distributed computing technology and computing environment ,and also an attentive hot point of information technology in the world. It launches a space for new generation internal application,due to its supporting the complicated service efficiently and useable resource in the Internet. This paper sums up the results and applications instance in the grid computing in the world during recent years ,and then analyzes emphatically the system architecture ,components ,working principle in the grid computing and some typical grid systems ,and then discusses the problems of the large scale science computing and network service in grid computing in China,and alsopoints out the future trends.     

Research on engineering-oriented constraints conflict detection in collaborative design of wire harness technology

Engineering-oriented constraint of harness technology has much information and project information presents progressive changes along with the design.Therefore,how to handle conflict resolution quickly is a problem to be solved.Process model of conflict detection is put forward according to characteristics of harness technology design engineering-oriented constraint,and then two problems of how to conduct conflict positioning and judgment of constraint rules are introduced in this paper.Afterwards in this paper,constraint information directed acyclic graph is established by classified project constraint information to solve the conflict positioning problem;solution of constraint satisfaction problem is applied to realize judgment problem of constraint rules.Finally,example is used to analyze the method in this paper to further verify the correctness and effectiveness of this method.     

A fast calculation of metric scores for learning Bayesian network

Frequent counting is a very so often required operation in machine learning algorithms. A typical machine learning task, learning the structure of Bayesian network (BN) based on metric scoring, is introduced as an example that heavily relies on frequent counting. A fast calculation method for frequent counting enhanced with two cache layers is then presented for learning BN. The main contribution of our approach is to eliminate comparison operations for frequent counting by introducing a multi-radix number system calculation. Both mathematical analysis and empirical comparison between our method and state-of-the-art solution are conducted. The results show that our method is dominantly superior to state-of-the-art solution in solving the problem of learning BN.     

DNA分子计算模型

The field of practical DNA computing opened in 1994 with Adleman's paper,in which a laboratory experi-ment involving DNA molecules was used to solve a small instance of the Hamiltonian Path problem. The characteris-tic of this computation is its powerful ability in parallelism,its huge storage and high energy efficiency. This paper mainly introduces the principles of DNA computing and the sticker computing model.     

具有干扰输入的不确定奇异系统的有限时间控制器设计

The concept of finite-time stability for linear singular system isinduced in this paper. Finite-time control problem is considered for linear singular systems with time-varying parametricuncertainties and exogenous disturbances. The disturbance satisfies a dynamical system with parametric uncertainties. Asufficient condition is presented for robust finite-ime stabilization via state feedback. The condition is translated to a feasibility problem involving restricted linear matrix inequalities (LMIs). A detailed solving method is proposed for the restricted linear matrix inequalities. Finally, an example is given to show the validity of the results.     

HOMOGENIZATION RESULTS FOR ENZYME CATALYZED REACTIONS THROUGH POROUS MEDIA

The aim of this article is to study the effective behavior of the solution of a nonlinear problem arising in the modelling of enzyme catalyzed reactions through the exterior of a domain containing periodically distributed reactive solid obstacles,with period ε.The asymptotic behavior of the solution of such a problem is governed by a new elliptic boundary-value problem,with an extra zero-order term that captures the effect of the enzymatic reactions.     

Solving SAT by Algorithm Transform of Wu s Method

Recently algorithms for solving propositional satisfiability problem, or SAT,have aroused great interest,and more attention has been paid to transformation problem solving.The commonly used transformation is representation transform,but since its intermediate computing procedure is a black box from the viewpoint of the original problem,this approach has many limitations.In this paper,a new approach called algorithm transform is proposed and applied to solving SAT by Wu‘s method,a general algorithm for solving polynomial equations.B y establishing the correspondence between the primitive operation in Wu‘s method and clause resolution is SAT,it is shown that Wu‘s method,when used for solving SAT,,is primarily a restricted clause resolution procedure.While Wu‘s method introduces entirely new concepts.e.g.characteristic set of clauses,to resolution procedure,the complexity result of resolution procedure suggests an exponential lower bound to Wu‘s method for solving general polynomial equations.Moreover,this algorithm transform can help achieve a more efficient implementation of Wu‘s method since it can avoid the complex manipulation of polynomials and can make the best use of domain specific knowledge.     

Application of Mismatch Detection Methods in DNA Computing

In many implementations of DNA computing, reliable detection of hybridization is of prime importance. We have applied several well-established DNA mutation scanning methods to this problem. Since they have been developed for speed and accuracy, these technologies are very promising for DNA computing. We have benchmarked a heteroduplex migration assay and enzymatic detection of mismatches on a 4 variable instance of 3SAT, using a previously described blocking algorithm. The first method is promising, but yielded ambiguous results. On the other hand, we were able to distinguish all perfect from imperfect duplexes by means of a CEL I mismatch endonuclease assay.     

Novel synthesis technique for microwave circuits based on inverse scattering: Efficient algorithm implementation and application

In this article, an efficient algorithm implementation is presented for the synthesis of microwave circuits with arbitrary frequency responses. A comprehensive theory development is included starting from the formalism of the coupled‐mode theory to obtain an exact series solution for the inverse scattering problem. A final algorithm in pseudocode is available in this article together with graphical diagrams to provide a straightforward implementation for the interested reader showing its feasibility for parallel computing. As an example, a design of a matched filter for broadband communications is presented along with the operational insight of the applied method, the influence of the auxiliary parameters, and the comparison between target frequency responses, simulations, and measurements. This application in microstrip technology is enclosed as an instance of the versatility of our synthesis technique and the accuracy of the presented algorithm. © 2011 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2011.     

Performing DNA computation with RecA-mediated triple-stranded DNA structure

A new method of DNA computing using an unusual triple-stranded DNA structure mediated by RecA protein is introduced and a minor 3-variable instance of the satisfiability (SAT) problem is solved. Separations were performed by using biotinylated oligodeoxynucleotide probes coated with RecA protein. During the computation, sequence-specific recognition of double-stranded DNA by homologous oligodeoxynucleotides was fulfilled in the presence of ATPγS. Captured by the magnetic particles coated with streptavidin, the desirable double-stranded DNA strands were retained and extracted. It is suggested that the methods employed here may help decrease the errors in DNA computation and solve some larger size NP- complete problems.     

Protein output for DNA computing

In recent years, several strategies for DNA based molecular computing have been investigated. An important area of research is the detection and analysis of output molecules. We demonstrate how DNA computing can be extended with in vivo translation of the output. In the resulting proteins, the information per kilogram is about 15-fold higher than in the original DNA output. The proteins are therefore of correspondingly smaller mass, which facilitates their subsequent detection using highly sensitive mass spectrometry methods. We have tested this approach on an instance of the Minimal Dominating Set problem. The DNA used in the computation was constructed as an open reading frame in a plasmid, under the control of a strong inducible promoter. Sequential application of restriction endonucleases yielded a library of potential solutions to the problem instance. The mixture of plasmids was then used for expression of a protein representation. Using MALDI-TOF mass spectrometry, a protein corresponding to the correct solution could be detected. The results indicate the feasibility of the extension of DNA computing to include protein technology. Our strategy opens up new possibilities for both scaling of DNA computations and implementations that employ output of functional molecules or phenotypes.     

粘贴DNA模型的多级分离技术及其应用

利用粘贴DNA模型现有的4种基本操作来解决问题效率低下,为解决这一问题,提出多级分离的概念,设计一个多级分离装置的模型,引入了多级分离技术.以可满足性问题(satisfiabilty problem,SAT)为例说明了该技术与装置的应用;通过实例的分析对比,展示了该技术的优越性.最后,证实了多级分离装置的有效性,并对多级分离技术的前景给予了展望.     

一种基于移动Agent的分布式并行计算模型

针对传统的分布式并行计算方案所存在的缺点,提出了一种基于移动Agent技术的分布式并行计算模型。在简单介绍移动Agent技术后,给出了基于移动Agent的分布式并行计算模型,并详细叙述了该模型的具体工作过程和实现方案。模型设计完成后,用此模型来解决计算量很大的数值计算问题。首先利用数学工具分析设计出该问题的适合于分布式并行计算的方案,然后依照模型实现实验程序。实验测试表明根据该模型实现的分布式并行计算程序具有较高的加速比和并行效率,并有效地提高了分布式并行计算的稳定性、灵活性、可扩展性和移动性。     

求解SAT问题的分级重排搜索算法

局部搜索法在ＳＡＴ问题上的成功运用已引起越来越广泛的重视,然而,它在面对不可满足问题例时的局限性不能不被考虑．分级重排搜索算法ＭＳＲＡ（ｍｕｌｔｉ－ｓｔａｇｅｓｅａｒｃｈｒｅａｒｒａｎｇｅ－ｍｅｎｔａｌｇｏｒｉｔｈｍ）正是为克服局部搜索法的不完备性而提出的,准确地讲,它是几种算法在思想上的集成,但为明确起见,把其最典型的分级重排过程作为名称．分级重排搜索算法在求解ＳＡＴ问题时,能表现出优于单一求解策略（如局部搜索法或回溯算法）的明显特性．由于可根据约束条件的强弱来估计ＳＡＴ问题例的可满足性,因此能够以此来确定更有效的求解策略．     

DSM中一种新型Cache一致性管理算法

存储器一致性管理是分布式共享存储器ＤＳＭ（ｄｉｓｔｒｉｂｕｔｅｄｓｈａｒｅｄｍｅｍｏｒｙ）系统的一个重要问题．在基于目录和所有者管理一致性的ＤＳＭ系统中,如何适时地更新所有者链表以及目录中关于所有者的信息是缩短查表时间的关键．本文介绍一种新型的链表更新算法的设计及其性能分析．分析表明,这种方案对维护存储器一致性来说,具有较灵活的适应性并有助于缩短查表时间,提高系统性能．该算法也可适用于树形层次结构的一致性管理方案．     

基于远程方法调用开发分布计算系统

随着网络技术、面向对象技术的成熟，分布计算已成为软件设计的主流技术。本文对远程方法调用的体系结构与调用机制进行研究．通过一个实例给出利用Java RMI开发分布计算系统的方法。基于Java RMI的远程方法调用为实现企业分布计算提供了行之有效的解决方案。     

Average-case analysis for the MAX-2SAT problem

We propose a simple probability model for MAX-2SAT instances for discussing the average-case complexity of the MAX-2SAT problem. Our model is a “planted solution model”, where each instance is generated randomly from a target solution. We show that for a large range of parameters, the planted solution (more precisely, one of the planted solution pairs) is the optimal solution for the generated instance with high probability. We then give a simple linear-time algorithm based on a message passing method, and we prove that it solves the MAX-2SAT problem with high probability for random MAX-2SAT instances under this planted solution model for probability parameters within a certain range.