检索结果-内蒙古大学图书馆

IEEE 24th International Symposium on Software Reliability Engineering Workshops (ISSREW)

作者： Huang, Yanqin Wu, Junhua Feng, Yang Chen, Zhenyu Zhao, Zhihong Nanjing Univ State Key Lab Novel Software Technol Nanjing Peoples R China Southeast Univ Sch Comp Sci & Engn Beijing Peoples R China

ISBN: (纸本)9781479925520

Spectrum-based Fault Localization (SBFL) techniques use risk evaluation formulas to calculate each statement's likelihood of having a bug based on test results. SBFL can not only be used in statement level, but also can be used with other program entities such as branches, functions and so on. Most previous studies have been conducted under the assumption of a single bug. However, software always contains multi-bugs in practice. A natural idea of debugging is to isolate bugs and then use SBFL techniques to locate one bug for each group. In this paper, we conduct an empirical study on clustering for isolating bugs in fault localization. We analyze the effects of six fault localization techniques and two cluster algorithms. The main observations are: (1) ER5 (Wong1) achieves the best results of fault localization with clustering;(2) K-means outperforms hierarchical clustering for isolating bugs in fault localization.

关键词： Spectrum-Based Fault Localization cluster algorithms multi-bugs

来源：评论

学校读者我要写书评

暂无评论

Dynamical behavior of the Niedermayer algorithm applied to Potts models

引用

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS 2012年第15期391卷 3849-3857页

作者： Girardi, D. Penna, T. J. P. Branco, N. S. Univ Fed Fluminense Inst Ciencias Exatas BR-27213350 Volta Redonda RJ Brazil Univ Fed Fluminense Inst Fis BR-24020 Niteroi RJ Brazil Univ Fed Santa Catarina Dept Fis BR-88040900 Florianopolis SC Brazil

In this work, we make a numerical study of the dynamic universality class of the Niedermayer algorithm applied to the two-dimensional Potts model with 2, 3, and 4 states. This algorithm updates clusters of spins and has a free parameter, E-0, which controls the size of these clusters, such that E-0 = 1 is the Metropolis algorithm and E-0 = 0 regains the Wolff algorithm, for the Potts model. For 1 < E-0 < 0, only clusters of equal spins can be formed: we show that the mean size of the clusters of (possibly) turned spins initially grows with the linear size of the lattice, L, but eventually saturates at a given lattice size (L) over tilde, which depends on E-0. For L >= (L) over tilde, the Niedermayer algorithm is in the same dynamic universality class of the Metropolis one, i.e, they have the same dynamic exponent. For E-0 > 0, spins in different states may be added to the cluster but the dynamic behavior is less efficient than for the Wolff algorithm (E-0 = 0). Therefore, our results show that the Wolff algorithm is the best choice for Potts models, when compared to the Niedermayer's generalization. (C) 2012 Elsevier B.V. All rights reserved.

关键词： Numerical simulation cluster algorithms Potts model Dynamic universality class

来源：评论

学校读者我要写书评

暂无评论

SIMULATING SPIN MODELS ON GPU: A TOUR

引用

INTERNATIONAL JOURNAL OF MODERN PHYSICS C 2012年第8期23卷 1240002-1240002页

作者： Weigel, Martin Johannes Gutenberg Univ Mainz Inst Phys D-55099 Mainz Germany Coventry Univ Appl Math Res Ctr Coventry CV1 5FB W Midlands England

The use of graphics processing units (GPUs) in scientific computing has gathered considerable momentum in the past five years. While GPUs in general promise high performance and excellent performance per Watt ratios, not every class of problems is equally well suitable for exploiting the massively parallel architecture they provide. Lattice spin models appear to be prototypic examples of problems suitable for this architecture, at least as long as local update algorithms are employed. In this review, I summarize our recent experience with the simulation of a wide range of spin models on GPU employing an equally wide range of update algorithms, ranging from Metropolis and heat bath updates, over cluster algorithms to generalized ensemble simulations.

关键词： Spin models Monte Carlo simulations GPU computing cluster algorithms generalized-ensemble simulations

来源：评论

学校读者我要写书评

暂无评论

Achieving the Workload Balance of the clusters

Achieving the Workload Balance of the Clusters

引用

IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)

作者： Ammar, Reda A. Sallam, Al sayed A. H. Sarhan, Amany M. Ragab, Hebat-Allah M. Univ Connecticut Sch Engn Dept Comp Sci & Engn Storrs CT 06269 USA Tanta Univ Fac Engn Comp & Control Dept Tanta Egypt

ISBN: (纸本)9781467307536

Workload focuses not on time or level of effort but on the quality of attention devoted to individual cases. However, the load balancing is a technique to distribute workload evenly across two or more computers, network links, CPUs, hard drives, or other resources, in order to get optimal resource utilization, maximize throughput, minimize response time, and avoid overload. Using multiple components with load balancing, instead of a single component, may increase reliability through redundancy. We focus on load balancing policies for homogeneous clustered.

关键词： Load balance Distributed system Software Restructuring cluster algorithms

来源：评论

学校读者我要写书评

暂无评论

GPU accelerated Monte Carlo simulations of lattice spin models

GPU accelerated Monte Carlo simulations of lattice spin mode...

引用

24th Workshop on Computer Simulation Studies in Condensed Matter Physics (CSP)

作者： Weigel, M. Yavors'kii, T. Johannes Gutenberg Univ Mainz Inst Phys D-55099 Mainz Germany

We consider Monte Carlo simulations of classical spin models of statistical mechanics using the massively parallel architecture provided by graphics processing units (GPUs). We discuss simulations of models with discrete and continuous variables, and using an array of algorithms ranging from single-spin flip Metropolis updates over cluster algorithms to multicanonical and Wang-Landau techniques to judge the scope and limitations of GPU accelerated computation in this field. For most simulations discussed, we find significant speed-ups by two to three orders of magnitude as compared to single-threaded CPU implementations.

关键词： spin models Monte Carlo simulations GPU computing cluster algorithms generalized-ensemble simulations

来源：评论

学校读者我要写书评

暂无评论

GPU accelerated Monte Carlo simulations of lattice spin models

引用

Physics Procedia 2011年 15卷 92-96页

作者： M. Weigel T. Yavorskii Institut fur Physik Johannes Gutenberg-Universitat Mainz Staudinger Weg 7 D-55099 Mainz Germany

关键词： spin models Monte Carlo simulations GPU computing cluster algorithms generalized-ensemble simulations

来源：评论

学校读者我要写书评

暂无评论

GEVA: geometric variability-based approaches for identifying patterns in data

引用

COMPUTATIONAL STATISTICS 2010年第2期25卷 241-255页

作者： Irigoien, Itziar Arenas, Concepcion Fernandez, Elena Mestres, Francisco Univ Barcelona Fac Biol Dept Estadist E-08028 Barcelona Spain UPV EHU Dept Computat & Artificial Intelligence Donostia San Sebastian Spain Univ Politecn Cataluna Dept Estadist & Invest Operat Barcelona Spain Univ Barcelona Dept Genet E-08028 Barcelona Spain

This paper, arising from population studies, develops clustering algorithms for identifying patterns in data. Based on the concept of geometric variability, we have developed one polythetic-divisive and three agglomerative algorithms. The effectiveness of these procedures is shown by relating them to classical clustering algorithms. They are very general since they do not impose constraints on the type of data, so they are applicable to general (economics, ecological, genetics...) studies. Our major contributions include a rigorous formulation for novel clustering algorithms, and the discovery of new relationship between geometric variability and clustering. Finally, these novel procedures give a theoretical frame with an intuitive interpretation to some classical clustering methods to be applied with any type of data, including mixed data. These approaches are illustrated with real data on Drosophila chromosomal inversions.

关键词： cluster algorithms Geometric-variability Divisive algorithm Agglomerative algorithm Population studies

来源：评论

学校读者我要写书评

暂无评论

ENERGY-EFFICIENT ROUTING BASED ON DIRECTIONAL ANTENNAS FOR WIRELESS SENSOR NETWORKS

ENERGY-EFFICIENT ROUTING BASED ON DIRECTIONAL ANTENNAS FOR W...

引用

2010 3rd IEEE International Conference on Broadband Network & Multimedia Technology(2010年第三届IEEE宽带网络与多媒体国际会议 IC-BNMT 2010)

作者： Qingyang Li Qianbin Chen Zhi Ren Yong Huang Chongqing Key Laboratory of Mobile Communications TechnologySchool of Communication and Information Chongqing Key Laboratory of Mobile Communications Technology School of Communication and Information

In this paper, we proposed an energy-efficient clustering routing algorithm based on directional antennas (EECDA) for wireless sensor networks. In a large scene, a cluster-head is responsible for data acquisition within its cluster and data forwarding among different clusters. As the sensor nodes are too simple and the energy providing is limited, the energy will be quickly run out with the increase of the amount of round. The joining of directional antennas can reduce the interference in network, minimize the unnecessary sending energy consumption, and extend the lifetime of the network. Modeling and simulating of EECDA on the OPNET simulator platform, we get the quantitative results that reflect the performance and effectiveness of our proposed algorithm.

关键词： wireless senor networks routing cluster algorithms directional antennas

来源：评论

学校读者我要写书评

暂无评论

The percolation signature of the spin glass transition

引用

JOURNAL OF STATISTICAL PHYSICS 2008年第1期130卷 113-128页

作者： Machta, J. Newman, C. M. Stein, D. L. Univ Massachusetts Dept Phys Amherst MA 01003 USA NYU Courant Inst Math Sci New York NY 10012 USA NYU Dept Phys New York NY 10012 USA

Magnetic ordering at low temperature for Ising ferromagnets manifests itself within the associated Fortuin–Kasteleyn (FK) random cluster representation as the occurrence of a single positive density percolating network. In this paper we investigate the percolation signature for Ising spin glass ordering—both in short-range (EA); infinite-range (SK) models—within a two-replica FK representation; also within the different Chayes–Machta–Redner two-replica graphical representation. Based on numerical studies of the ±J EA model in three dimensions; on rigorous results for the SK model, we conclude that the spin glass transition corresponds to the appearance of two percolating clusters of unequal densities.

关键词： ising spin glass percolation graphical representations cluster algorithms fortuin kasteleyn

来源：评论

学校读者我要写书评

暂无评论

Spin chain simulations with a meron cluster algorithm

引用

INTERNATIONAL JOURNAL OF MODERN PHYSICS C 2007年第9期18卷 1497-1511页

作者： Boyer, Thomas Bietenholz, Wolfgang Wuilloud, Jair Humboldt Univ Inst Phys D-12489 Berlin Germany Ecole Normale Super F-94235 Cachan France NIC DESY Zeuthen D-15738 Zeuthen Germany Univ Geneva Dept Phys Theor CH-1211 Geneva 4 Switzerland

We apply a meron cluster algorithm to the XY spin chain, which describes a quantum rotor. This is a multi-cluster simulation supplemented by an improved estimator, which deals with objects of half-integer topological charge. This method is powerful enough to provide precise results for the model with a theta-term - it is therefore one of the rare examples, where a system with a complex action can be solved numerically. In particular we measure the correlation length, as well as the topological and magnetic susceptibility. We discuss the algorithmic efficiency in view of the critical slowing down. Due to the excellent performance that we observe, it is strongly motivated to work on new applications of meron cluster algorithms in higher dimensions.

关键词： cluster algorithms theta vacua spin chains

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：