发布求助
文献互助 智能选刊 最新文献

2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)最新文献

筛选
英文 中文
Exposing Blurred Image Forgeries through Blind Image Restoration 通过盲图像复原揭露模糊图像伪造
2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC) Pub Date : 2015-11-04 DOI: 10.1109/3PGCIC.2015.50
Feng Zeng, Wei Wang, Min Tang, Zhanghua Cao
{"title":"Exposing Blurred Image Forgeries through Blind Image Restoration","authors":"Feng Zeng, Wei Wang, Min Tang, Zhanghua Cao","doi":"10.1109/3PGCIC.2015.50","DOIUrl":"https://doi.org/10.1109/3PGCIC.2015.50","url":null,"abstract":"When creating a digital forgery, it is often necessary to combine several images. Image splicing is one such form of tampering. In recent years, researchers have proposed various methods for detecting such splicing. In this paper, we propose a novel method for blurred image splicing localization based on blind image restoration. We use blur parameters estimation through the spectrum characteristics of blurred images in order to restore the spliced region and the rest of the image. We also develop a new measure to assist in inconsistent region segmentation in restored images that contain large amounts of ringing effect. Experimental results show efficacy of the method even if the images to be tested have been noised or compressed with a low quality factor.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133996667","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
A Preliminary Evaluation of Web Based Communication Services for Reducing Power Consumption 基于Web的通信服务降低功耗的初步评估
2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC) Pub Date : 2015-11-04 DOI: 10.1109/3PGCIC.2015.141
Ken Nishimura, Kaoru Sugita
{"title":"A Preliminary Evaluation of Web Based Communication Services for Reducing Power Consumption","authors":"Ken Nishimura, Kaoru Sugita","doi":"10.1109/3PGCIC.2015.141","DOIUrl":"https://doi.org/10.1109/3PGCIC.2015.141","url":null,"abstract":"In this study, we evaluate the power consumption of a client-server multimedia communication system. The decrease of the running cost and the improvement of availability are very important for the reduction of the power consumption in communication systems and services. We have conducted various experiments for power consumption by considering different frame rate and size. In this study, we present a preliminary evaluation to measure the performance related with power consumption and playtime for web based communication services.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"4 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134426920","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Analysis and Improvement of a Verifiable Phrase Search over Encrypted Data in a Single Phrase 单个短语中加密数据的可验证短语搜索分析与改进
2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC) Pub Date : 2015-11-04 DOI: 10.1109/3PGCIC.2015.23
Fanyu Kong, Jie Wang, Jia Yu, Xu An Wang
{"title":"Analysis and Improvement of a Verifiable Phrase Search over Encrypted Data in a Single Phrase","authors":"Fanyu Kong, Jie Wang, Jia Yu, Xu An Wang","doi":"10.1109/3PGCIC.2015.23","DOIUrl":"https://doi.org/10.1109/3PGCIC.2015.23","url":null,"abstract":"Z. A. Kissel proposed a verifiable single-phase phrase search scheme using symmetric encryption algorithm, which was proved non-adaptively secure in the Semi-Honestbut-Curious (SHBC) model. We present a security analysis of Z. A. Kissel's scheme and show that the cloud service provider can obtain some new phrases' trapdoors and search outcomes based on the client's a phrase query. Additionally, we propose an improvement to simplify Kissel's scheme and enhance its security.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133307207","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Towards Efficient and Effective Distributed Discovery of SWs in P2P Overlay Networks P2P覆盖网络中SWs的高效分布式发现
2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC) Pub Date : 2015-11-04 DOI: 10.1109/3PGCIC.2015.130
Adel Boukhadra, K. Benatchba, Amar Balla
{"title":"Towards Efficient and Effective Distributed Discovery of SWs in P2P Overlay Networks","authors":"Adel Boukhadra, K. Benatchba, Amar Balla","doi":"10.1109/3PGCIC.2015.130","DOIUrl":"https://doi.org/10.1109/3PGCIC.2015.130","url":null,"abstract":"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.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114507321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fully Secure Hierarchical Inner Product Encryption for Privacy Preserving Keyword Searching in Cloud 云环境中保密性关键字搜索的全安全层次内积加密
2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC) Pub Date : 2015-11-04 DOI: 10.1109/3PGCIC.2015.63
Leyou Zhang, Zhuanning Wang, Y. Mu, Yu-pu Hu
{"title":"Fully Secure Hierarchical Inner Product Encryption for Privacy Preserving Keyword Searching in Cloud","authors":"Leyou Zhang, Zhuanning Wang, Y. Mu, Yu-pu Hu","doi":"10.1109/3PGCIC.2015.63","DOIUrl":"https://doi.org/10.1109/3PGCIC.2015.63","url":null,"abstract":"Cloud computing provides dynamically scalable resources provisioned as a service over networks. But untrustworthy Cloud Service Provider(CSP) offers a big obstacle for the adoption of the cloud service since CSP can access data in Cloud without data owner's permission. Hierarchical Inner Product Encryption (HIPE) covers all applications of anonymous encryption, fully private communication and search on encrypted data, which provide trusted data access control policy to CSP. However, the existing works only achieve either selectively attribute-hiding or adaptively attribute-hiding under some strong assumptions in the public key setting. To overcome them, a novel HIPE in private key setting is issued. The new scheme achieves both fully secure and security reduction under the natural assumption-Decisional Linear (DLIN) assumption in the standard model.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"284 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117305035","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A Parallel Algorithm for the Prediction of Protein Binding Sites 蛋白质结合位点预测的并行算法
2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC) Pub Date : 2015-11-04 DOI: 10.1109/3PGCIC.2015.123
M. Mirto, G. Aloisio
{"title":"A Parallel Algorithm for the Prediction of Protein Binding Sites","authors":"M. Mirto, G. Aloisio","doi":"10.1109/3PGCIC.2015.123","DOIUrl":"https://doi.org/10.1109/3PGCIC.2015.123","url":null,"abstract":"The Pocket-Finder algorithm identifies the location of ligand binding sites in a protein and is a fundamental component for a range of applications including molecular docking, de novo drug design and structural identification and comparison of functional sites. In this paper, we propose a parallel version of the Pocket-Finder algorithm. The proposed parallel algorithm uses a geometrical approach to locate favorable binding sites and has been MPI-enabled for parallel execution. The proposed algorithm has been applied on a small test of 15 proteins and 2 proteins complexes. The algorithm gets very interesting results when applied to large proteins.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"295 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121267967","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Extensional Schemes of Multipartite Non-interactive Key Exchange from Multilinear Maps 多线性映射中多部非交互密钥交换的扩展方案
2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC) Pub Date : 2015-11-04 DOI: 10.1109/3PGCIC.2015.15
Huiwen Jia, Yu-pu Hu, Xu An Wang, Zheliang Liu, Wei Xiong
{"title":"Extensional Schemes of Multipartite Non-interactive Key Exchange from Multilinear Maps","authors":"Huiwen Jia, Yu-pu Hu, Xu An Wang, Zheliang Liu, Wei Xiong","doi":"10.1109/3PGCIC.2015.15","DOIUrl":"https://doi.org/10.1109/3PGCIC.2015.15","url":null,"abstract":"Key agreement is a fundamental primitive in cryptography and the question of generalizing the celebrated 2-party non-interactive key exchange, Diffie-Hellman protocol, to a multipartite setting was left as an important open problem. Boneh and Silverberg proposed the notion of multilinear maps for the first time in 2003 and put forward a theoretical construction of multipartite non-interactive key exchange protocol from multilinear maps. In their protocol, however, the number of users N and the multilinearity k are related by N=k+1, resulting in the system initializing another multilinear map when the number of users who want to exchange a session key changes. In this paper, we describe two extensional schemes, which enables any less than or equal to N users derive a common shared key from an (N-1)-multilinear map. In addition, using our extensional schemes, we show a concrete scenario: The establishment of any discussion group in a user group. Furthermore, we analyze its security.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115146857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Efficient Numerical Simulation for the Nonlinear Laplacian Problem 非线性拉普拉斯问题的高效数值模拟
2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC) Pub Date : 2015-11-04 DOI: 10.1109/3PGCIC.2015.186
Qingli Zhao, Shengxiang Xia, Zongchen Li
{"title":"Efficient Numerical Simulation for the Nonlinear Laplacian Problem","authors":"Qingli Zhao, Shengxiang Xia, Zongchen Li","doi":"10.1109/3PGCIC.2015.186","DOIUrl":"https://doi.org/10.1109/3PGCIC.2015.186","url":null,"abstract":"With the rapid development of computing power and information processing ability, some efficient numerical methods are developed to deal with the complex problems. In this paper, efficient finite difference method is introduced to solve the nonlinear Laplacian problem, in which two variables can be approximated simultaneously. Calculation scheme is established. Numerical experiments are carried out to show the efficiency.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117301246","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Research on War Strategy Games on Mobile Phone Based on Cocos2d-JS 基于Cocos2d-JS的手机战争策略游戏研究
2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC) Pub Date : 2015-11-04 DOI: 10.1109/3PGCIC.2015.128
Guozhi Song, Shuxia Ren, Dakun Zhang, Kunliang Liu, Yumeng Sun, Xu An Wang
{"title":"Research on War Strategy Games on Mobile Phone Based on Cocos2d-JS","authors":"Guozhi Song, Shuxia Ren, Dakun Zhang, Kunliang Liu, Yumeng Sun, Xu An Wang","doi":"10.1109/3PGCIC.2015.128","DOIUrl":"https://doi.org/10.1109/3PGCIC.2015.128","url":null,"abstract":"With the development of mobile Internet technology, war strategy games on mobile are developing rapidly. Especially war strategy mobile phone games based on the Cocos2d-JS game engine has a lot of development potential. On the basis of studying the related technologies of mobile phone game on war strategy, a mobile game based Cocos2d-JS development framework is proposed and the development framework can be reused. The key modules of the framework of the game were analyzed and designed, and implemented. The game is played with a strategic and more emotional user experience.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123721417","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Cultural Heritage Case Study of Visitor Experiences Shared on a Social Network 文化遗产在社交网络上分享游客体验的案例研究
2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC) Pub Date : 2015-11-04 DOI: 10.1109/3PGCIC.2015.55
S. Cuomo, P. D. Michele, A. Galletti, F. Piccialli
{"title":"A Cultural Heritage Case Study of Visitor Experiences Shared on a Social Network","authors":"S. Cuomo, P. D. Michele, A. Galletti, F. Piccialli","doi":"10.1109/3PGCIC.2015.55","DOIUrl":"https://doi.org/10.1109/3PGCIC.2015.55","url":null,"abstract":"In this paper, starting from a real case of an art exhibit, we propose a mathematical model to simulate social network interactions of a visitor that shares his experience on a social network. The Integrate & Fire (I&F) model is used to reproduce the interest of spectators in a cultural heritage community. In our approach, visitor is modelled as a computational neuron, which is connected with his \"friends\" by means of synapses (i.e., connections), representing friendships and/or common interests among them. The real data are of the exhibit are stored on a cloud system framework and representing the input of the proposed model.","PeriodicalId":395401,"journal":{"name":"2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121274984","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 37
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信