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

international conference on P2P, parallel, Grid, Cloud and Internet computing (3PGCIC)

作者： Baojiang Cui Peilin Shi Jun Yang Yongle Hao School of Computer Science Beijing University of Posts and Telecommunications Beijing China Nation Engineering Laboratory for Mobile Network Security China

ISBN: (纸本)9781467394741

Cloud computing is a pattern of processing the big data and provides the convenient, on-demand network access to a shared pool of configurable computing resources. Cloud data center's cost is becoming the hot topic in recent years. this paper studies how to minimize the bandwidth cost for uploading deferral big data to a cloud computing platform, based on the MapReduce Framework. We study the deficiency of randomized online algorithm and Dynamic Self-adaption Algorithm, and we propose the improved algorithm to minimize the bandwidth cost based on DSA, and the results demonstrate that the IDSA' performance is better than the ROA and DSA.

关键词： Heuristic algorithms Cloud computing Bandwidth Industries distributed databases Resource management Schedules

来源：评论

学校读者我要写书评

暂无评论

Towards Efficient and Effective distributed Discovery of SWs in P2P Overlay Networks

Towards Efficient and Effective Distributed Discovery of SWs...

引用

international conference on P2P, parallel, Grid, Cloud and Internet computing (3PGCIC)

作者： Adel Boukhadra Karima Benatchba Amar Balla Ecole national Supérieur d'Informatique Alger Algérie

ISBN: (纸本)9781467394741

In this paper, we will focus on the contribution an efficient and an effective approach for a distributed discovery of Semantic Web services (SWs), which address some aspects, related to problems the time complexity of collaboration in the process of automatic discovery for SWs in order to achieve adaptability in a highly-dynamic distributed computing. For this purpose, our approach is based on P2P computing that proved to be scalable, efficient and robust solutions for distributed discovery of SWs. Indeed, we propose a matching technique of ontology OWL-S process model, in order to efficiently and effectively discover appropriate Web services distributed among all peers in a large-size P2P network. For improving performance and effectiveness, our scalable approach is mapped on unstructured P2P networks by exploiting Pareto efficiency to reduce considerably the execution time and message exchanged for disseminating request about the unstructured P2P network structure among the peers, to simplify the management of the P2P network and to ensure the quality of service. the experimental results show that the proposed approach enhances the network scalability while providing good overall performances. Also, we show that our approach can perform more efficient and effective distributed discovery of SWs with low computational cost in terms of completeness and accuracy in P2P computing, when compared to the other approaches.

关键词： Peer-to-peer computing Web services Semantics Ontologies Scalability Collaboration Overlay networks

来源：评论

学校读者我要写书评

暂无评论

Network Traffic Load Balancing in Hierarchical Peer-to-Peer Systems

Network Traffic Load Balancing in Hierarchical Peer-to-Peer ...

引用

international conference on P2P, parallel, Grid, Cloud and Internet computing (3PGCIC)

作者： Gianluca Moro Tommaso Pirini Claudio Sartori Department of Computer Science and Engineering University of Bologna Italy Istituto Nazionale di Fisica Nucleare Sezione di Trieste Trieste Friuli-Venezia Giulia IT

ISBN: (纸本)9781467394741

the management of huge amounts of data distributed across multiple sites has become a necessity more and more demanding. Peer-to-peer systems (P2P) can afford the requirements of managing, indexing, searching and analyzing data with scalability and self-organization. Until now, most efforts have focused primarily on improving the number of hops and structure maintenance messages. However, the non-uniform distribution of data and the hierarchical structures, together with heavy load, can cause unbalanced traffic load. In this paper we improve our previous work on the overlay structure G-Grid, merging it with a Small World network. the Small World networks make a compromise between order and randomness, they are derived from social networks and show an almost uniform traffic distribution. Experiments show how this new hybrid structure obtains the best performance in traffic distribution.

关键词： Peer-to-peer computing Routing Load management Binary trees distributed databases Indexing Maintenance engineering

来源：评论

学校读者我要写书评

暂无评论

An Associative Engines Based Approach Supporting Collaborative Analytics in the Internet of Cultural things

An Associative Engines Based Approach Supporting Collaborati...

引用

international conference on P2P, parallel, Grid, Cloud and Internet computing (3PGCIC)

作者： Angelo Chianese Paolo Benedusi Fiammetta Marulli Francesco Piccialli In. Tel. Tee. spa Sistemi Informativi Napoli Italy Federico II Department of Electrical Engineering and Information Technologies University of Naples Italy

ISBN: (纸本)9781467394741

In this paper we illustrate an integrated approach supporting an information system which combines Business Intelligence, Big Data, Internet of things, GeoSpatial information processing, multimedia resources, structured and unstructured content analysis with Semantic techniques, and Social Network Analysis. this system exploits the specific opportunities provided by Associative in-memory technologies in the context of Cloud computing and Collaborative processes and experiments the use of semantic technologies to mitigate the efforts involved in merging, and analyzing information incoming from different sources. the primary aim is supporting Cultural Heritage (CH) Asset crowdsourcing, promotion, publication, management and usage. Preliminary results are reported from ongoing experimentation, focused on visitors interests and behaviour analysis performed by monitoring, comparing and combining information from different types of populations and visits: on-site ad-hoc (exhibitions, museums, cultural events, etc.), territorial (eg. Historical downtown, touristic areas including relevant CH resources) and Virtual - Worldwide Internet based visits.

关键词： Cultural differences Business Cloud computing Multimedia communication Collaboration Big data Mobile handsets

来源：评论

学校读者我要写书评

暂无评论

Spatial Bloom Filters: Enabling Privacy in Location-Aware applications 10

Spatial Bloom Filters: Enabling Privacy in Location-Aware Ap...

引用

10th China international conference on Information Security and Cryptology (Inscrypt)

作者： Palmieri, Paolo Calderoni, Luca Maio, Dario Delft Univ Technol Parallel & Distributed Syst Grp NL-2628 CD Delft Netherlands Univ Bologna Dept Comp Sci & Engn I-47521 Cesena Italy

ISBN: (纸本)9783319167459;9783319167442

the wide availability of inexpensive positioning systems made it possible to embed them into smartphones and other personal devices. this marked the beginning of location-aware applications, where users request personalized services based on their geographic position. the location of a user is, however, highly sensitive information: the user's privacy can be preserved if only the minimum amount of information needed to provide the service is disclosed at any time. While some applications, such as navigation systems, are based on the users' movements and therefore require constant tracking, others only require knowledge of the user's position in relation to a set of points or areas of interest. In this paper we focus on the latter kind of services, where location information is essentially used to determine membership in one or more geographic sets. We address this problem using Bloom Filters (BF), a compact data structure for representing sets. In particular, we present an extension of the original Bloom filter idea: the Spatial Bloom Filter (SBF). SBF's are designed to manage spatial and geographical information in a space efficient way, and are well-suited for enabling privacy in location-aware applications. We show this by providing two multi-party protocols for privacy-preserving computation of location information, based on the known homomorphic properties of public key encryption schemes. the protocols keep the user's exact position private, but allow the provider of the service to learn when the user is close to specific points of interest, or inside predefined areas. At the same time, the points and areas of interest remain oblivious to the user.

关键词： Location privacy Bloom filters Secure multi-party computation

来源：评论

学校读者我要写书评

暂无评论

Rep on the block: A next generation reputation system based on the blockchain

Rep on the block: A next generation reputation system based ...

引用

international conference for Internet Technology and Secured Transactions (ICITST)

作者： Richard Dennis Gareth Owen School of Computing University of Portsmouth Portsmouth United Kingdom

ISBN: (纸本)9781467383370

this paper presents the first generalized reputation system that can be applied to multiple networks that is based on the blockchain. We first discuss current reputation systems, conducting a critical analysis of their current security vulnerabilities, before looking at how new blockchain based technologies are used. We propose an innovative new reputation system that is based on blockchain technologies which aims to solve many unanswered questions in today's current generation reputation systems. We then consider the limitations of such a system, before using simulations and analyses to demonstrate methods of overcoming these limitations. We conclude by suggesting areas for future studies, and summarizing our findings.

关键词： Peer-to-peer computing Online banking Servers distributed databases Internet Cryptography Negative feedback

来源：评论

学校读者我要写书评

暂无评论

Performance Comparison of parallel Execution using GPU and CPU in SVM Training Session

Performance Comparison of Parallel Execution using GPU and C...

引用

international conference on Advanced Computer Science applications and technologies

作者： Nur Shakirah Md Salleh Muhammad Fahim Baharim Department of Systems and Networking Universiti Tenaga Nasional

ISBN: (纸本)9781509004256

Support Vector Machine (SVM) is a machine learning approach, which is used in a growing number of applications. SVM is a useful technique for data classification. this machine learning approach has been optimized using two (2) parallel computing approaches. this includes symmetric multiprocessor (SMP) approach and vector processor approach. the outcome performance of the implementation of symmetric multiprocessor approach and vector processor approach on SVM training session is the focus of this paper. We have carried out a performance analysis to benchmark between Central Processing Unit (CPU) and Graphics Processing Units (GPUs) optimization. the result shows the GPU optimization of SVM training duration achieves better performance than the CPU optimized program by 3.11 of speedup.

关键词： Component parallel computing OpenMP CUDA Support Vector Machine UCW dataset

来源：评论

学校读者我要写书评

暂无评论

Shuttle: Intrusion Recovery for PaaS

Shuttle: Intrusion Recovery for PaaS

引用

international conference on distributed computing Systems

作者： Dário Nascimento Miguel Correia INESC-ID Universidade de Lisboa

the number of applications being deployed using the Platform as a Service (PaaS) cloud computing model is increasing. Despite the security controls implemented by cloud service providers, we expect intrusions to strike such applications. We present Shuttle, a novel intrusion recovery service. Shuttle recovers from intrusions in applications deployed in PaaS platforms. Our approach allows undoing changes to the state of PaaS applications due to intrusions, without loosing the effect of legitimate operations performed after the intrusions take place. We combine a record-and-replay approach with the elasticity provided by cloud offerings to recover applications deployed on various instances and backed by distributed databases. the service loads a database snapshot taken before the intrusion and replays subsequent requests, as much in parallel as possible, while continuing to execute incoming requests. We present an experimental evaluation of Shuttle on Amazon Web Services. We show Shuttle can replay 1 million requests in 10 minutes and that it can duplicate the number of requests replayed per second by increasing the number of application servers from 1 to 3.

关键词： Servers distributed databases Computational modeling Security Elasticity Software

来源：评论

学校读者我要写书评

暂无评论

How does Oracle Database In-Memory scale out?

How does Oracle Database In-Memory scale out?

引用

international Joint conference on Software technologies (ICSOFT)

作者： Niloy Mukherjee Kartik Kulkarni Hui Jin Jesse Kamp Tirthankar Lahiri Oracle Corporation Redwood Shores U.S.A.

ISBN: (纸本)9781467385312

the Oracle RDBMS In-memory Option (DBIM), introduced in 2014, is an industry-first distributed dual format in-memory RDBMS that allows a database object to be stored in columnar format purely in-memory, simultaneously maintaining transactional consistency with the corresponding row-major format persisted in storage and accessed through in-memory database buffer cache. the in-memory columnar format is highly optimized to break performance barriers in analytic query workloads while the row format is most suitable for OLTP workloads. In this paper, we present the distributed architecture of the Oracle Database In-memory Option that enables the in-memory RDBMS to transparently scale out across a set of Oracle database server instances in an Oracle RAC cluster, both in terms of memory capacity and query processing throughput. the architecture allows complete application-transparent, extremely scalable and automated in-memory distribution of Oracle RDBMS objects across multiple instances in a cluster. It seamlessly provides distribution awareness to the Oracle SQL execution framework, ensuring completely local memory scans through affinitized fault-tolerant parallel execution within and across servers without explicit optimizer plan changes or query rewrites.

关键词： Sociology Statistics distributed databases Indexes Engines Buffer storage

来源：评论

学校读者我要写书评

暂无评论

distributed XML processing over multicore servers

WEBIST 2014 - Proceedings of the 10th International Conferen...

引用

WEBIST 2014 - Proceedings of the 10th international conference on Web Information Systems and technologies 2014年 1卷 200-207页

作者： Uratani, Yoshiyuki Koide, Hiroshi Cavendish, Dirceu Global Scientific Information and Computing Center Tokyo Institute of Technology O-okayama 2-12-1 Meguroku Tokyo 152-8550 Japan Faculty of Computer Science and Systems Engineering Kyushu Institute of Technology Kawazu 680-4 Iizuka Fukuoka 820-8502 Japan Network Design Research Center Kyushu Institute of Technology Kawazu 680-4 Iizuka Fukuoka 820-8502 Japan

ISBN: (纸本)9789897580239

Nowadays, multicore CPU become popular technology to enhance services quality in Web services. this paper characterizes parallel distributed XML processing which can off-load the amount of processing at their servers to networking nodes with varying number of CPU cores. Our implemented distributed XML processing system sends XML documents from a sender node to a server node through relay nodes, which process the documents before arriving at the server. When the relay nodes are connected in tandem, the XML documents are processed in a pipelining manner. When the relay nodes are connected in parallel, the XML documents are processed in a parallel fashion. For well-formedness and grammar validation tasks, the parallel processing reveals inherent advantages compared with pipeline processing regardless of document type, number of CPU cores and processing environment. Moreover, the number of CPU cores impacts efficiency of distributed XML processing via buffer access contention. Copyright © 2014 SCITEPRESS.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：