The fast development of internet application is boosting the development of cloud computing, a new paradigm of provisioning computing infrastructure and services over network. In cloud computing environment, MapReduce...
详细信息
Recently, cloud computing has emerged as a new computing paradigm on the Internet. With the development of cloud computing, enterprise data centers shift towards a utility computing model where many critical business ...
详细信息
With the rapid development of internet applications, more and more network service and commercial applications are deployed to cloud computing environment, with petabytes of data to be processed. MapReduce is one of t...
详细信息
AS well as in real physical environment, time subsystem is also a vital part in the distributed virtual environment. DVMM, based on multi-nodes and achieves single system image, has faced with the challenge of the tim...
详细信息
Network addressing is a traditional problem in communications network. IP addressing which can fully reflect the characteristics of Wireless Sensor Network will provide good support for the design of network routing a...
详细信息
Spectra-based fault localization (SFL) techniques have brought encouraging results and a variety of program spectra have been proposed to locate faults. Different types of abnormal behaviors may be revealed by differe...
详细信息
Symbolic execution based test generation has made progress in recent years. However, in order to scale to larger programs there are some issues to be solved. Among them, generating a set of feasible paths to achieve h...
详细信息
Energy-efficiency is a critical factor in designing clustering protocols of Wireless Sensor networks. In this paper, we propose an Energy-based Cluster-head Inheritance Algorithm (EICA), which adopts a novel kind of C...
详细信息
Consider random hypergraphs on n vertices, where each k-element subset of vertices is selected with probability p independently and randomly as a hyperedge. By sparse we mean that the total number of hyperedges is O(n...
详细信息
ISBN:
(纸本)9781577355120
Consider random hypergraphs on n vertices, where each k-element subset of vertices is selected with probability p independently and randomly as a hyperedge. By sparse we mean that the total number of hyperedges is O(n) or O(n ln n). When k = 2, these are exactly the classical Erdös-Rényi random graphs G(n, p). We prove that with high probability, hinge width on these sparse random hypergraphs can grow linearly with the expected number of hyperedges. Some random constraint satisfaction problems such as Model RB and Model RD have satisfiability thresholds on these sparse constraint hypergraphs, thus the large hinge width results provide some theoretical evidence for random instances around satisfiability thresholds to be hard for a standard hinge-decomposition based algorithm. We also conduct experiments on these and other kinds of random graphs with several hundreds vertices, including regular random graphs and power law random graphs. The experimental results also show that hinge width can grow linearly with the number of edges on these different random graphs. These results may be of further interests.
This paper presents parallel point-multiplication on conic curves based on standard NAF algorithm and Chinese Remainder Theorem. All analysis of parallel methodologies should take advantage of the basic parallel algor...
详细信息
暂无评论