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

13th IEEE International Workshop on FTDCS 2011, the 8th International Conference on ATC 2011, the 8th International Conference on UIC 2011 and the 13th IEEE International Conference on HPCC 2011

作者： Eom, Heungsik Wolinsky, David Isaac Figueiredo, Renato J. Advanced Computing and Information Systems Laboratory Department of Electrical and Computer Engineering University of Florida Gainesville FL United States Department of Computer Science Yale University New Haven United States

ISBN: (纸本)9780769545387

This paper proposes and evaluates Self-Organizing Latency-Aware Resource Ensemble (SOLARE), a peer-to-peer self-organizing and self-managing cluster system based upon network coordinates and utility functions. In contrast to previous works, SOLARE is a fully decentralized clustering algorithm without any central units such as servers, super peers, cluster heads or landmarks. Furthermore, SOLARE allows for adaptability to dynamic network changes by monitoring the utility of a cluster and migrating nodes to other higher-utility clusters when the utility of an existing cluster is low. Quantitative, simulation-driven evaluations show that SOLARE is able to satisfy user demands expressed by utility functions that integrate system parameters in terms of intra cluster latencies and the number of cluster members. Also, we verify the ability of SOLARE to adapt to dynamic network changes through simulation based experiments that consider the number of nodes which migrate into another cluster and average utility value as nodes join SOLARE. © 2011 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Frontier-based multi-robot map exploration using particle swarm optimization

Frontier-based multi-robot map exploration using particle sw...

引用

IEEE Symposium on Swarm Intelligence

作者： Wang, Yiheng Liang, Alei Guan, Haibing School of Software Shanghai Jiao Tong University Shanghai Key Laboratory of Scalable Computing and Systems Shanghai 200240 China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai Key Laboratory of Scalable Computing and Systems Shanghai 200240 China

ISBN: (纸本)9781612840529

Exploring an unknown environment using team of autonomous mobile robots is an important task in many real-world applications. Many existing map exploration algorithms are based on frontier, which is the boundary between unexplored space and known open space. In the context of multiple robots, the main problem of frontier-based algorithm is to choose appropriate target points for the individual robots so that they can efficiently explore the different part of the common area. This paper proposed a novel distributed frontier-based map exploration algorithm using Particle Swarm Optimization model for robot coordination. In this algorithm, the robot keeps moving to the nearby frontier to reduce the size of the unknown region, and is navigated towards frontier far away based on the PSO model after exploring the local area. The exploration is completed when there are no frontier cells on the map. Our algorithm has been implemented and tested both in simulation runs and real world experiment. The result shows that our method has a good scalability and efficiency. © 2011 IEEE.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Evaluating effectiveness of risk identification and management using organisational models

Evaluating effectiveness of risk identification and manageme...

引用

IEEE International Conference on computer Research and Development

作者： Bhuiyan, Moshiur Rana, Sohel Krishna, Aneesh Decision Systems Laboratory School of Computer Science and Software Engineering University of Wollongong NSW 2522 Australia OptInfra Systems Sydney NSW Australia Department of Computing Faculty of Science and Engineering Curtin University of Technology Perth WA 6102 Australia

ISBN: (纸本)9781612848372

In this paper firstly we discuss an approach for supporting risk identification with the use of higher-level organizational models. We provide some intuitive metrics for extracting measures of actor criticality and vulnerability from organizational models. This helps direct risk management to areas of critical importance within organization models. Secondly, we provide details of an experiment that we conducted to evaluate our methodology. We believe our novel approach, will provide added benefits when used with other approaches to risk management during business process management, that do not reference the greater organizational context during risk assessment. © 2011 IEEE.

关键词： Risk management

来源：评论

学校读者我要写书评

暂无评论

Exploring provenance in high performance scientific computing

Exploring provenance in high performance scientific computin...

引用

1st Annual 2011 Workshop on High-Performance computing Meets Databases, HPCDB'11, Co-located with Supercomputing, SC'11

作者： Gadelha Jr., Luiz M.R. Wilde, Michael Mattoso, Marta Foster, Ian Computer and Systems Engineering Program Federal University of Rio de Janeiro Brazil National Laboratory for Scientific Computing Brazil Mathematics and Computer Science Division Argonne National Laboratory United States Computation Institute Argonne National Laboratory University of Chicago United States Department of Computer Science University of Chicago United States

ISBN: (纸本)9781450311571

Large-scale scientific computations are often organized as a composition of many computational tasks linked through data flow. After the completion of a computational scientific experiment, a scientist has to analyze its outcome, for instance, by checking inputs and outputs of computational tasks that are part of the experiment. This analysis can be automated using provenance management systems that describe, for instance, the production and consumption relationships between data artifacts, such as files, and the computational tasks that compose the scientific application. In this article, we explore the relationship between high performance computing and provenance management systems, observing that storing provenance as structured data enriched with information about the runtime behavior of computational tasks in high performance computing environments can enable interesting and useful queries to correlate computational resource usage, scientific parameters, and data set derivation. We briefly describe how provenance of many-task scientific computations specified and coordinated by the Swift parallel scripting system is gathered and queried. © 2011 ACM.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Time and space efficient spectral clustering via column sampling

Time and space efficient spectral clustering via column samp...

引用

作者： Li, Mu Lian, Xiao-Chen Kwok, James T. Lu, Bao-Liang Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong Hong Kong MOE Microsoft Key Laboratory for Intelligent Computing and Intelligent Systems Shanghai Jiao Tong University Shanghai 200240 China

ISBN: (纸本)9781457703942

Spectral clustering is an elegant and powerful approach for clustering. However, the underlying eigen-decomposition takes cubic time and quadratic space w.r.t. the data set size. These can be reduced by the Nystrm method which samples only a subset of columns from the matrix. However, the manipulation and storage of these sampled columns can still be expensive when the data set is large. In this paper, we propose a time- and space-efficient spectral clustering algorithm which can scale to very large data sets. A general procedure to orthogonalize the approximated eigenvectors is also proposed. Extensive spectral clustering experiments on a number of data sets, ranging in size from a few thousands to several millions, demonstrate the accuracy and scalability of the proposed approach. We further apply it to the task of image segmentation. For images with more than 10 millions pixels, this algorithm can obtain the eigenvectors in 1 minute on a single machine. © 2011 IEEE.

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

No-go theorem for one-way quantum computing on naturally occurring two-level systems

引用

Physical Review A 2011年第5期83卷 050301(R)-050301(R)页

作者： Jianxin Chen Xie Chen Runyao Duan Zhengfeng Ji Bei Zeng Department of Computer Science and Technology Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing China Department of Physics Massachusetts Institute of Technology Cambridge Massachusetts USA Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney New South Wales Australia Perimeter Institute for Theoretical Physics Waterloo Ontario Canada State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Institute for Quantum Computing and Department of Combinatorics and Optimization University of Waterloo Waterloo Ontario Canada

The ground states of some many-body quantum systems can serve as resource states for the one-way quantum computing model, achieving the full power of quantum computation. Such resource states are found, for example, in spin-52 and spin-32 systems. It is, of course, desirable to have a natural resource state in a spin-12, that is, qubit system. Here, we give a negative answer to this question for frustration-free systems with two-body interactions. In fact, it is shown to be impossible for any genuinely entangled qubit state to be a nondegenerate ground state of any two-body frustration-free Hamiltonian. What is more, we also prove that every spin-12 frustration-free Hamiltonian with two-body interaction always has a ground state that is a product of single- or two-qubit states. In other words, there cannot be any interesting entanglement features in the ground state of such a qubit Hamiltonian.

关键词： QUANTUM computers QUANTUM theory HAMILTONIAN operator HAMILTONIAN systems PHYSICS

来源：评论

学校读者我要写书评

暂无评论

A dynamic-static combined code layout reorganization approach for dynamic binary translation

Journal of Software

引用

Journal of Software 2011年第12 SPEC. ISSUE期6卷 2341-2349页

作者： Guan, Haibing Zhu, Erzhou Chen, Kai Ma, Ruhui He, Yunchao Deng, Haipeng Yang, Hongbo Department of Computer Science and Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China

Dynamic binary translation (DBT) has attracted much attention as a powerful technique for the runtime adaptation of software among different ISAs. It offers unprecedented flexibility in the control and modification of a program during the runtime. However, its inherent high overhead has perplexed researchers for many years. In order to reduce the overhead of DBT, this paper presents a dynamic-static combined approach to reorganize the layout of software cache. Under this approach, we first employ an emulating execution to collect the profile information and the translated target code. Especially, the path of execution flow will be tracked. In the static phase, based on the profile information collected in the previous stage, we first use the method of code replicating to build the traces, and then reorganize the layout of the target code by putting the hottest traces at the top of the software cache. Because of exact prediction and improved locality, the execution stream will concentrate on a small area with less control transfer. This approach can greatly reduce the overhead of DBT on the condition that the program runs repeatedly. Experimental results on executing the SPEC 2000 benchmarks show that our approach can reduce more than 30% run time on average. © 2011 Academy Publisher.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

A translation framework for executing the sequential binary code on CPU/GPU based architectures

Journal of Software

引用

Journal of Software 2011年第12 SPEC. ISSUE期6卷 2331-2340页

作者： Zhu, Erzhou Guan, Haibing Dong, Guoxing Yang, Yindong Yang, Hongbo Department of Computer Science and Engineering Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University Shanghai China

The method of using DBT (dynamic binary translation) to execute the source ISAs binary code on target platforms has been perplexed by low overhead for many years. GPU as a many-core processor has tremendous computational power. Employing GPU as a coprocessor to parallel execute the hot spot of binary code hold a great promise of substantially reduce the overhead of DBT. This paper presents a novel translation framework for constructing the virtual execution environment aiming at accelerating the process of DBT on CPU/GPU based architectures. With parallelizable parts (hot spots) of binary code and their related information, the framework converts the sequential code into PTX form and executes them on GPUs. Under the framework, we need not to rewrite the source code, and the binary compatibility issues between different GPUs are also resolved properly. Experimental results on several programs from CUDA SDK Code Samples and Parboil Benchmark Suite show that the framework can significantly improve the performance, usually have 10X speedup on average compared to X86 native platforms. Especially, when the scale of input become larger, the performance becomes even better. © 2011 Academy Publisher.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Trusted Framework for Health Information Exchange

Trusted Framework for Health Information Exchange

引用

Frontiers of Information Technology (FIT)

作者： Muhammad Afzal Maqbool Hussain Mahmood Ahmad Zahid Anwar School of Electrical Engineering and Computer Science Semantic Systems Research Laboratory Pakistan Department of Computing School of Electrical Engineering and Computer Science Pakistan

Healthcare Interchange Exchange (HIE) is set of healthcare entities that link regions and nations around the world to share healthcare information about patients. HIE provides a unified interface to various stakeholders to access patient data. For example, individuals want to access personal data, practitioners want to import their patient data from Personal Health Records (PHR) and researchers want to access anonymized patient data for research purposes with ensured individual privacy. Keeping in view requirements of various stakeholders it is challenging to design an HIE system that ensures the security and privacy of patient information, such that the health records remain interoperable and scalable. This paper proposes, an HIE framework that will provide secure access to patient data and adhere to the interoperability rules. Implementation of l-diversity algorithm ensures individual privacy especially when the data is made available publicly for statistical analysis.

关键词： Medical services Authentication Data privacy Joining processes Encryption Standards organizations

来源：评论

学校读者我要写书评

暂无评论

Incorporating cellular sorting structure for better prediction of protein subcellular locations

Incorporating cellular sorting structure for better predicti...

引用

作者： Yang, Wen-Yun Lu, Bao-Liang Kwok, James T. Department of Computer Science and Engineering Shanghai Jiao Tong University No. 800 Dongchuan Road Shanghai China MOE Microsoft Laboratory for Intelligent Computing and Intelligent Systems Shanghai Jiao Tong University No. 800 Dongchuan Road Shanghai China Department of Computer Science and Engineering Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong Hong Kong

This article explores the interdependences between subcellular locations and incorporates them with support vector machines for prediction of protein subcellular localisation. Traditional prediction systems utilise a 'flat' structure of classifiers, such as the one-versus-all and one-versus-one schemes, with amino acid compositions to perform the prediction. Apart from those existing studies that ignore the interdependences between subcellular locations, we take advantage of a hierarchical structure to organise the subcellular locations and model their relationships. Here, we propose to use four kinds of hierarchical prediction methods and make comparative studies on three datasets. Experimental results show that three of the hierarchical models outperform the traditional 'flat' model in terms of tree loss values. In particular, one hierarchical model outperforms the traditional 'flat' model for all evaluation measures. Moreover, we gained some valuable insights into the sorting process by using hierarchical structures. © 2011 Taylor & Francis.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：