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

7th ACM India Computing Conference, COMPUTE 2014

作者： Goyal, Poonam Kumari, Sonal Kumar, Dhruv Balasubramaniam, Sundar Goyal, Navneet Advanced Data Analytics and Parallel Technologies Laboratory Department of Computer Science and Information Systems BITS-Pilani Pilani India

ISBN: (纸本)9781605588148

parallelizing algorithms to leverage multiple cores in a processor or multiple nodes in a cluster setup is the only way forward to handle ever-increasing volumes of data. OPTICS is a well-known density based clustering algorithm to identify arbitrary shaped clusters. Since, hierarchical cluster ordering of OPTICS is sensitive to the order in which data is processed, typically a priority queue is used to maintain the order. This sequential access order makes it difficult to parallelize OPTICS. Moreover, the execution time of OPTICS increases with increase in density of data. We propose a parallel version of OPTICS for shared memory multi-core systems using a master-slave pattern for parallelization. The master runs concurrently with the slaves and distributes data to the slaves. Each slave performs neighborhood queries for a subset of data. Our approach ensures that cluster ordering matches with that of the classical OPTICS. Our solution runs in a mostly data parallel mode yielding scalable performance. We also argue that our approach is well suited for dense datasets in particular. Copyright 2014 ACM.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

Profiling patterns of bit flipping for software transactional memories 26

Profiling patterns of bit flipping for software transactiona...

引用

26th International Symposium on computer Architecture and High Performance Computing, SBAC-PAD 2014

作者： Teixeira, Felipe L. Pilla, Maurício L. Bois, André R. Du Mossé, Daniel Laboratory of Ubiquitous and Parallel Systems PPGC CDTec UFPEL Pelotas Brazil Department of Computer Science University of Pittsburgh Pittsburgh United States

ISBN: (纸本)9781479969043

Software Transactional Memory (STM) is a synchronization method proposed as an alternative to lockbased synchronization. It provides a higher-level abstraction that is easier to program, and that enables software composition. Transactions are defined by programmers, but the runtime system is responsible for detecting conflicts and avoiding race conditions. Phase Change Memory (PCM) is a new technology that is being developed to replace Dynamic Random Access Memories (DRAMs) in large datacenters. PCM write operations are much more expensive than reads in both energy and time. In this paper, we analyze performance, energy consumption, and write patterns in software transactional memories (STMs) to determine the potential of optimization for PCM scenarios. As the write operations are more expensive both in time and energy in PCMs, benchmarks from the STAMP suite were instrumented to count bits swapped due to store instructions, and experiments were executed using TinySTM. Our results showed a pattern of few bits being flipped for each memory write, and performance was inversely proportional to the number of writes. For most benchmarks, there was a small increase in energy consumption with more threads, which may be explained by the timid contention manager used by TinySTM. © 2014 IEEE.

关键词： Phase change memory

来源：评论

学校读者我要写书评

暂无评论

Density estimation with adaptive sparse grids for large data sets 14

Density estimation with adaptive sparse grids for large data...

引用

14th SIAM International Conference on Data Mining, SDM 2014

作者： Peherstorfer, Benjamin Pflüger, Dirk Bungartz, Hans-Joachim Aerospace Computational Design Laboratory AeroAstro Massachusetts Institute of Technology United States Simulation of Large Systems Group Institute for Parallel and Distributed Systems University of Stuttgart Germany Scientific Computing Group Department of Computer Science Technische Universität München Germany

ISBN: (纸本)9781510811515

Nonparametric density estimation is a fundamental problem of statistics and data mining. Even though kernel density estimation is the most widely used method, its performance highly depends on the choice of the kernel bandwidth, and it can become computationally expensive for large data sets. WTe present an adaptive sparse-grid-based density estimation method which discretizes the estimated density function on basis functions centered at grid points rather than on kernels centered at the data points. Thus, the costs of evaluating the estimated density function are independent from the number of data points. We give details on how to estimate density functions on sparse grids and develop a cross validation technique for the parameter selection. We show numerical results to confirm that our sparse-grid-based method is well-suited for large data sets, and, finally, employ our method for the classification of astronomical objects to demonstrate that it is competitive to current kernel-based density estimation approaches with respect to classification accuracy and runtime. Copyright © SIAM.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Who should review this pull-request: Reviewer recommendation to expedite crowd collaboration 21

Who should review this pull-request: Reviewer recommendation...

引用

21st Asia-Pacific Software Engineering Conference, APSEC 2014

作者： Yu, Yue Wang, Huaimin Yin, Gang Ling, Charles X. National Laboratory for Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha410073 China Department of Computer Science University of Western Ontario LondonONN6A 5B7 Canada

ISBN: (纸本)9781479974252

Github facilitates the pull-request mechanism as an outstanding social coding paradigm by integrating with social media. The review process of pull-requests is a typical crowdsourcing job which needs to solicit opinions of the community. Recommending appropriate reviewers can reduce the time between the submission of a pull-request and the actual review of it. In this paper, we firstly extend the traditional Machine Learning (ML) based approach of bug triaging to reviewer recommendation. Furthermore, we analyze social relations between contributors and reviewers, and propose a novel approach to recommend highly relevant reviewers by mining comment networks (CN) of given projects. Finally, we demonstrate the effectiveness of these two approaches with quantitative evaluations. The results show that CN-based approach achieves a significant improvement over the ML-based approach, and on average it reaches a precision of 78% and 67% for top-1 and top-2 recommendation respectively, and a recall of 77% for top-10 recommendation. © 2014 IEEE.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

The Chinese ‘‘HumanFlesh’’ Web:the first decade and beyond

引用

Chinese science Bulletin 2014年第26期59卷 3352-3361页

作者： Fei-Yue Wang Daniel Zeng Qingpeng Zhang James A. Hendler Jianping Cao The State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Department of Management Information Systems The University of Arizona Tucson Department of Systems Engineering and Engineering Management City University of Hong Kong Tetherless World Constellation Department of Computer Science Rensselaer Polytechnic Institute Troy The Research Center for Computational Experiments and Parallel Systems National University of Defense Technology

Human flesh search(HFS), a Web-enabled crowdsourcing phenomenon, originated in China a decade ago. In this article, we present the first comprehensive empirical analysis of HFS, focusing on the scope of HFS activities, the patterns of HFS crowd collaboration process, and the characteristics of HFS participant networks. A survey of HFS participants was conducted to provide an in-depth understanding of the HFS community and various factors that motivate these participants to contribute. This article also advocates a new stream of Web science and social computing research that will be important in predicting the future growth and use of the World Wide Web.

关键词：中国人网址肉 Web功能实证分析参与者共同体万维网

来源：评论

学校读者我要写书评

暂无评论

Coupling algorithms for partitioned multi-physics simulations 44

Coupling algorithms for partitioned multi-physics simulation...

引用

44. Jahrestagung der Gesellschaft fur Informatik INFORMATIK 2014 - Big Data - Komplexitat meistern - Big Data - Mastering Complexity: 44th Annual Meeting of the Society for computer science, INFORMATICS 2014

作者： Uekermann, Benjamin Gatzhammer, Bernhard Mehl, Miriam Department of Computer Science Technische Universität München Boltzmannstraße 3 Garching85748 Germany Institute for Parallel and Distributed Systems Universität Stuttgart Universitätsstraße 38 Stuttgart70569 Germany

ISBN: (纸本)9783885796268

Partitioned coupling approaches are an important tool in order to achieve a decent time-to-solution for multi-physics problems with more than two physical fields or changing combinations of fields. We study different approaches to deduce coupling schemes for partitioned multi-physics scenarios, by means of a simple, but yet challenging fluid-structure-fluid model problem. To our knowledge, this is the first time that a fully implicit black-box coupling scheme for partitioned multi-physics scenarios is described. This allows the simulation of a new range of applications in a partitioned way.

关键词： Fluid structure interaction

来源：评论

学校读者我要写书评

暂无评论

Location-Aware Multi-user Resource Allocation in distributed Clouds

Location-Aware Multi-user Resource Allocation in Distributed...

引用

10th Annual Conference of Advanced computer Architecture, ACA 2014

作者： Li, Jiaxin Li, Dongsheng Zheng, Jing Quan, Yong National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China Information Center of Logistics Department Beijing China School of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)9783662444900

Resource allocation for multi-user across multiple data centers is an important problem in cloud computing environments. Many geographically-distributed users may request virtualized resources simultaneously. And the distances from users to allocated resources have much impact on the quality of service (QoS) in multiple data centers environment. Most existing methods do not take all these factors into account when allocating resources. They usually result in poor runtime performance of users' virtual computing environment and the remarkable difference of users' QoS. In this paper, we propose RAMD, a resource allocation algorithm based on multi-stage decision in multiple data centers. The RAMD algorithm allocate VMs to users, taking into account the correlation and interaction between multiple users, so as to minimize the sum of all users' service distances (i.e. determined by user location and network distance of virtual machines). Experimental results show that the algorithm can effectively deal with the cloud resource allocation for multi-user across multiple data centers. It can improve the runtime performance of users' virtualized resources and reduce the difference of QoS. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Using synthetic peptides to benchmark peptide identification software and search parameters for MS/MS data analysis

引用

EuPA Open Proteomics 2014年 5卷 21-31页

作者： Quandt, Andreas Espona, Lucia Balasko, Akos Weisser, Hendrik Brusniak, Mi-Youn Kunszt, Peter Aebersold, Ruedi Malmström, Lars Department of Biology Institute of Molecular Systems Biology ETH Zurich Switzerland SyBIT SystemsX.ch Switzerland MTA SZTAKI Laboratory of Parallel and Distributed Systems Budapest Hungary Institute for Systems Biology Seattle United States S3IT University of Zurich Switzerland Faculty of Science University of Zurich Switzerland

Tandem mass spectrometry and sequence database searching are widely used in proteomics to identify peptides in complex mixtures. Here we present a benchmark study in which a pool of 20,103 synthetic peptides was measured and the resulting data set was analyzed using around 1800 different software and parameter set combinations. The results indicate a strong relationship between the performance of an analysis workflow and the applied parameter settings. We present and discuss strategies to optimize parameter settings in order to significantly increase the number of correctly assigned fragment ion spectra and to make the analysis method robust. © 2014 The Authors.

关键词： Classical database search Data analysis Mass spectrometry Search engine Synthetic peptides

来源：评论

学校读者我要写书评

暂无评论

Hierarchical categorization of open source software by online profiles

Hierarchical categorization of open source software by onlin...

引用

作者： Wang, Tao Wang, Huaimin Yin, Gang Yang, Cheng Li, Xiang Zou, Peng Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China Department of Computer Science University of Western Ontario London ON N6A 5B7 Canada Academy of Equipment Beijing 100000 China

The large amounts of freely available open source software over the Internet are fundamentally changing the traditional paradigms of software development. Efficient categorization of the massive projects for retrieving relevant software is of vital importance for Internet-based software development such as solution searching, best practices learning and so on. Many previous works have been conducted on software categorization by mining source code or byte code, but were verified on only relatively small collections of projects with coarse-grained categories or clusters. However, Internet-based software development requires finer-grained, more scalable and language-independent categorization approaches. In this paper, we propose a novel approach to hierarchically categorize software projects based on their online profiles. We design a SVMbased categorization framework and adopt a weighted combination strategy to aggregate different types of profile attributes from multiple repositories. Different basic classification algorithms and feature selection techniques are employed and compared. Extensive experiments are carried out on more than 21,000 projects across five repositories. The results show that our approach achieves significant improvements by using weighted combination. Compared to the previous work, our approach presents competitive results with more finer-grained and multi-layered category hierarchy with more than 120 categories. Unlike approaches that use source code or byte code, our approach is more effective for large-scale and languageindependent software categorization. In addition, experiments suggest that hierarchical categorization combined with general keyword-based searching improves the retrieval efficiency and accuracy. Copyright © 2014 The Institute of Electronics, Information and Communication Engineers.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Concurrent and consistent virtual machine introspection with hardware transactional memory

Concurrent and consistent virtual machine introspection with...

引用

IEEE Symposium on High-Performance computer Architecture

作者： Yutao Liu Yubin Xia Haibing Guan Binyu Zang Haibo Chen Institute of Parallel and Distributed Systems Shanghai Jiao Tong University Department of Computer Science Shanghai Jiao Tong University

Virtual machine introspection, which provides tamperresistant, high-fidelity “out of the box” monitoring of virtual machines, has many prominent security applications including VM-based intrusion detection, malware analysis and memory forensic analysis. However, prior approaches are either intrusive in stopping the world to avoid race conditions between introspection tools and the guest VM, or providing no guarantee of getting a consistent state of the guest VM. Further, there is currently no effective means for timely examining the VM states in question. In this paper, we propose a novel approach, called TxIntro, which retrofits hardware transactional memory (HTM) for concurrent, timely and consistent introspection of guest VMs. Specifically, TxIntro leverages the strong atomicity of HTM to actively monitor updates to critical kernel data structures. Then TxIntro can mount introspection to timely detect malicious tampering. To avoid fetching inconsistent kernel states for introspection, TxIntro uses HTM to add related synchronization states into the read set of the monitoring core and thus can easily detect potential inflight concurrent kernel updates. We have implemented and evaluated TxIntro based on Xen VMM on a commodity Intel Haswell machine that provides restricted transactional memory (RTM) support. To demonstrate the effectiveness of TxIntro, we implemented a set of kernel rootkit detectors using TxIntro. Evaluation results show that TxIntro is effective in detecting these rootkits, and is efficient in adding negligible performance overhead.

关键词： Kernel Monitoring Educational institutions Abstracts Single photon emission computed tomography Virtual machine monitors Continuous wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：