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

CEUR Workshop Proceedings 2017年 1826卷

作者： Kopp, Oliver Lenhard, Jörg Pautasso, Cesare University of Stuttgart Institute for Parallel and Distributed Systems Universitätsstraße 38 StuttgartDE70569 Germany Karlstad University Department of Mathematics and Computer Science Universitetsgatan 2 KarlstadSE65188 Sweden USI Faculty of Informatics Architecture Design and Web Information Systems Engineering Research Group Via Buffi 13 LuganoCH6900 Switzerland

来源：评论

学校读者我要写书评

暂无评论

Cograph editing: Merging modules is equivalent to editing P4s

arXiv

引用

arXiv 2017年

作者： Fritz, Adrian Hellmuth, Marc Wieseke, Nicolas Stadler, Peter F. Computational Biology of Infection Research Helmholtz Centre for Infection Research Inhoffenstraße 7 BraunschweigD-38124 Germany University of Greifswald Dpt. of Mathematics and Computer Science Walther- Rathenau-Strasse 47 GreifswaldD-17487 Germany Saarland University Center for Bioinformatics Building e 2.1 P.O. Box 151150 SaarbrückenD-66041 Germany Parallel Computing and Complex Systems Group Department of Computer Science University of Leipzig Augustusplatz 10 LeipzigD-04109 Germany Bioinformatics Group Department of Computer Science Interdisciplinary Center of Bioinformatics University of Leipzig Härtelstraße 16-18 LeipzigD-04107 Germany Max-Planck-Institute for Mathematics in the Sciences Inselstraße 22 LeipzigD-04103 Germany Inst. F. Theoretical Chemistry University of Vienna Währingerstraße 17 WienA-1090 Austria Santa Fe Institute 1399 Hyde Park Rd. Santa FeNM87501 United States

The modular decomposition of a graph G = (V;E) does not contain prime modules if and only if G is a cograph, that is, if no quadruple of vertices induces a simple connected path P4. The cograph editing problem consists in inserting into and deleting from G a set F of edges so that H = (V,EΔF) is a cograph and |F| is minimum. This NP-hard combinatorial optimization problem has recently found applications, e.g., in the context of phylogenetics. Efficient heuristics are hence of practical importance. The simple characterization of cographs in terms of their modular decomposition suggests that instead of editing G one could operate directly on the modular decomposition. We show here that editing the induced P4s is equivalent to resolving prime modules by means of a suitable defined merge operation on the submodules. Moreover, we characterize so-called module-preserving edit sets and demonstrate that optimal pairwise sequences of module-preserving edit sets exist for every non-cograph. This eventually leads to an exact algorithm for the cograph editing problem. In addition, we provide two heuristics with time complexity O(|V|3), resp., O(|V|2). Copyright © 2017, The Authors. All rights reserved.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Tinman: Eliminating confidential mobile data exposure with security oriented offloading 15

Tinman: Eliminating confidential mobile data exposure with s...

引用

10th European Conference on computer systems, EuroSys 2015

作者： Xia, Yubin Liu, Yutao Tan, Cheng Ma, Mingyang Guan, Haibing Zang, Binyu Chen, Haibo Shanghai Key Laboratory of Scalable Computing and Systems China Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Department of Computer Science Shanghai Jiao Tong University China

ISBN: (纸本)9781450332385

The wide adoption of smart devices has stimulated a fast shift of security-critical data from desktop to mobile devices. However, recurrent device theft and loss expose mobile devices to various security threats and even physical attacks. This paper presents TinMan, a system that protects confidential data such as web site password and credit card number (we use the term cor to represent these data, which is short for Confidential Record) from being leaked or abused even under device theft. TinMan separates accesses of cor from the rest of the functionalities of an app, by introducing a trusted node to store cor and offloading any code from a mobile device to the trusted node to access cor. This completely eliminates the exposure of cor on the mobile devices. The key challenges to TinMan include deciding when and how to efficiently and transparently offload execution;Tin-Man addresses these challenges with security-oriented offloading with a low-overhead tainting scheme called asymmetric tainting to track accesses to cor to trigger offloading, as well as transparent SSL session injection and TCP payload replacement to offload accesses to cor. We have implemented a prototype of TinMan based on Android and demonstrated how TinMan protects the information of user's bank account and credit card number without modifying the apps. Evaluation results also show that TinMan incurs only a small amount of performance and power overhead. Copyright © 2015 ACM.

关键词： Crime

来源：评论

学校读者我要写书评

暂无评论

Selected Recent Applications of Sparse Grids

引用

Numerical Mathematics(Theory,Methods and Applications) 2015年第1期8卷 47-77页

作者： Benjamin Peherstorfer Christoph Kowitz Dirk Pfluger Hans-Joachim Bungartz Scientific Computing Group Dept.of Computer ScienceBoltzmannstr.385748 GarchingGermany Institutefor Advanced Study Technische UniversitätMünchenLichtenbergstr.2a85748 GarchingGermany Institute for Parallel and Distributed Systems University of StuttgartUni-versitätsstr.3870569 StuttgartGermany

Sparse grids have become a versatile tool for a vast range of applications reaching from interpolation and numerical quadrature to data-driven problems and uncertainty *** review four selected real-world applications of sparse grids:financial product pricing with the Black-Scholes model,interactive explo-ration of simulation data with sparse-grid-based surrogate models,analysis of simu-lation data through sparse grid data mining methods,and stability investigations of plasma turbulence simulations.

关键词： Sparse grids hierarchical decomposition adaptivity combination technique

来源：评论

学校读者我要写书评

暂无评论

Context-Aware Computation Offloading for Mobile Cloud Computing: Requirements Analysis, Survey and Design Guideline

引用

Procedia computer science 2015年 56卷 10-17页

作者： Gabriel Orsini Dirk Bade Winfried Lamersdorf Distributed Systems Group Department of Computer Science University of Hamburg Germany

Along with the rise of mobile handheld devices the resource demands of respective applications grow as well. However, mobile devices are still and will always be limited related to performance (e.g., computation, storage and battery life), context adaptation (e.g., intermittent connectivity, scalability and heterogeneity) and security aspects. A prominent solution to overcome these limita- tions is the so-called computation offloading, which is the focus of mobile cloud computing (MCC). However, current approaches fail to address the complexity that results from quickly and constantly changing context conditions in mobile user scenarios and hence developing effective and efficient MCC applications is still challenging. Therefore, this paper first presents a list of re- quirements for MCC applications together with a survey and classification of current solutions. Furthermore, it provides a design guideline for the selection of suitable concepts for different classes of common cloud-augmented mobile applications. Finally, it presents open issues that developers and researchers should be aware of when designing their MCC-approach.

关键词： Mobile Cloud Computing Computation Offloading Context Awareness

来源：评论

学校读者我要写书评

暂无评论

Access control policies enforcement in a cloud environment: Openstack 11

Access control policies enforcement in a cloud environment: ...

引用

11th International Conference on Information Assurance and Security, IAS 2015

作者： Ayache, Meryeme Erradi, Mohammed Freisleben, Bernd Networking and Distributed Systems Research Group ENSIAS Mohammed v University Rabat Morocco Department of Mathematics and Computer Science University of Marburg Germany

ISBN: (纸本)9781467387156

Cloud computing has become a widely used paradigm in many IT domains such as e-health. It offers several advantages to the users, e.g. elasticity, flexibility and the rapid sharing of a huge set of digital data. However, many security and privacy concerns still pose significant challenges. In particular, the most identified problem is how to enforce the user's security policy in the access control of the outsourced data. In fact, cloud environments does not provide facilities to support high level defined security policies. For instance, the swift storage component of openstack supports only fine grained access control to execute a specific action on a specific defined object. In this paper, we designed and implemented a middleware to provide high level security policies while using such swift fine grained primitives. An e-health collaborative application dedicated for remote diagnosis is used to illustrate the suggested approach. © 2015 IEEE.

关键词： Cloud storage

来源：评论

学校读者我要写书评

暂无评论

SYNC or ASYNC: Time to fuse for distributed graph-parallel computation 2015

SYNC or ASYNC: Time to fuse for distributed graph-parallel c...

引用

20th ACM SIGPLAN Symposium on Principles and Practice of parallel Programming, PPoPP 2015

作者： Xie, Chenning Chen, Rong Guan, Haibing Zang, Binyu Chen, Haibo Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science Shanghai Jiao Tong University China

ISBN: (纸本)9781450332057

Large-scale graph-structured computation usually exhibits iterative and convergence-oriented computing nature, where input data is computed iteratively until a convergence condition is reached. Such features have led to the development of two different computation modes for graph-structured programs, namely synchronous (Sync) and asynchronous (Async) modes. Unfortunately, there is currently no in-depth study on their execution properties and thus programmers have to manually choose a mode, either requiring a deep understanding of underlying graph engines, or suffering from suboptimal performance. This paper makes the first comprehensive characterization on the performance of the two modes on a set of typical graph-parallel applications. Our study shows that the performance of the two modes varies significantly with different graph algorithms, partitioning methods, execution stages, input graphs and cluster scales, and no single mode consistently outperforms the other. To this end, this paper proposes Hsync, a hybrid graph computation mode that adaptively switches a graph-parallel program between the two modes for optimal performance. Hsync constantly collects execution statistics on-the-fly and leverages a set of heuristics to predict future performance and determine when a mode switch could be profitable. We have built online sampling and offline profiling approaches combined with a set of heuristics to accurately predicting future performance in the two modes. A prototype called PowerSwitch has been built based on PowerGraph, a state-of-the-art distributed graph-parallel system, to support adaptive execution of graph algorithms. On a 48-node EC2-like cluster, PowerSwitch consistently outperforms the best of both modes, with a speedup ranging from 9% to 73% due to timely switch between two modes. Copyright 2015 ACM.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Task allocation in organic computing systems: Networks with reconfigurable helper units

引用

International Journal of Autonomous and Adaptive Communications systems 2015年第1期8卷 60-80页

作者： Merkle, Daniel Middendorf, Martin Scheidler, Alexander Department of Mathematics and Computer Science University of Southern Denmark Campusvej 55 Odense M5230 Denmark Parallel Computing and Complex Systems Group Department of Computer Science University of Leipzig Johannisgasse 26 Leipzig04103 Germany Université Libre de Bruxelles Av F. D. Roosevelt 50 CP 194/6 Bruxelles1050 Belgium

In this paper, computing systems that have no central control and consist of many (partially) autonomous components are studied. Two types of components are distinguished which are called workers and helpers respectively. The components are connected via a network and the helper components perform service tasks for the worker components. It is assumed that the helper components exhibit reconfigurable hardware to be able to execute different service tasks efficiently. The problem addressed in this paper is how to organise such a decentralised system in a way that requests of the workers are executed by suitable helpers and the total reconfiguration costs of the helpers are small. Several decentralised task allocation methods are proposed. One of them uses a combination of a fully decentralised dynamic clustering algorithm and a self-organised task allocation system. The clustering algorithm is used to classify the service requests that are sent through the network in order to give the helpers hints which requests are suitable to be executed by them. Simulations are done for static and dynamic scenarios to investigate the reconfiguration costs and the number of dropped requests, i.e., requests that could not be satisfied. The results show that the clustering-based system has a strong adaptive behaviour and that the decentralised clustering is able to reduce the reconfiguration costs significantly. Copyright © 2015 Inderscience Enterprises Ltd.

关键词： Reconfigurable hardware

来源：评论

学校读者我要写书评

暂无评论

distributed privacy-preserving data aggregation via anonymization 3rd

引用

3rd International Conference on Networked systems, NETYS 2015

作者： Benkaouz, Yahya Erradi, Mohammed Freisleben, Bernd Networking and Distributed Systems Research Group ENSIAS Mohammed V University Rabat Morocco Department of Mathematics and Computer Science Philipps-Universität Marburg Marburg Germany

ISBN: (纸本)9783319268491

Data aggregation is a key element in many applications that draw insights from data analytics, such as medical research, smart metering, recommendation systems and real-time marketing. In general, data is gathered from several sources, processed, and publicly released for data analysis. Since the considered data might contain personal and sensitive information, special handling of private data is required. In this paper, we present a novel distributed privacy-preserving data aggregation protocol, called ADiPA. It relies on anonymization techniques for protecting personal data, such as k-anonymity, l-diversity and t-closeness. Its purpose is to allow a set of entities to derive aggregate results from data tables that are partitioned across these entities in a fully decentralized manner while preserving the privacy of their individual sensitive inputs. ADiPA neither relies on a trusted third party nor on cryptographic techniques. The protocol performs accurate aggregation when communication links and nodes do not fail. © Springer International Publishing Switzerland 2015.

关键词： Privacy-preserving techniques

来源：评论

学校读者我要写书评

暂无评论

Streaming 4K/UHD video to the rest of us: Can bandwidth sharing help? 16

Streaming 4K/UHD video to the rest of us: Can bandwidth shar...

引用

16th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WoWMoM 2015

作者： Montes, Isabel Chua, Jaymari Cruz, Michelangelo Remillano, Augusto Young, Joseph Darwin Ocampo, Roel Festin, Cedric Computer Networks Laboratory Electrical and Electronics Engineering Institute University of the Philippines Diliman Philippinese United States Networks and Distributed Systems Group Department of Computer Science University of the Philippines Diliman Philippinese United States

ISBN: (纸本)9781479984619

High quality video streaming for mobile users is difficult to achieve in some areas of the world due to poor broadband capacity and sparse network coverage. We propose a bandwidth-sharing scheme to allow users with limited uplink bandwidth to borrow idle bandwidth from nearby access points and provide these users the opportunity to experience higher quality video than what their own bandwidth could normally support. We developed a Linux kernel implementation of a multipath less-than-best-effort (MP-LBE) protocol for bandwidth scavenging and demonstrated, through testbed experiments, that video quality may be improved through bandwidth sharing. This may bring us closer to the 'video everywhere' vision even as incremental upgrades are made on broadband Internet infrastructure. © 2015 IEEE.

关键词： Video streaming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：