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

2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing最新文献

筛选
英文 中文
An Automatic Method for Deriving OWL Ontologies from XML Documents 从XML文档中自动获取OWL本体的方法
2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2014-11-08 DOI: 10.1109/3PGCIC.2014.88
A. Minutolo, A. Esposito, Mario Ciampi, M. Esposito, G. Cassetti
{"title":"An Automatic Method for Deriving OWL Ontologies from XML Documents","authors":"A. Minutolo, A. Esposito, Mario Ciampi, M. Esposito, G. Cassetti","doi":"10.1109/3PGCIC.2014.88","DOIUrl":"https://doi.org/10.1109/3PGCIC.2014.88","url":null,"abstract":"In the last decade, the field of Big Data Analytics has become increasingly important in both the academic and the business communities. Typically, data are mostly structured, collected by different actors through various heterogeneous and distributed information sources, and stored and managed often directly in XML. In order to enable large volume of data to be described in such a way that their meaning can be exploited by machines and, thus, semantic queries and automatic inferential procedures can be enabled, this paper presents an automatic method to derive OWL ontologies from XML schemas. The main contribution of this method relies on the possibility of producing a target ontology starting from multiple XML schemas, by discriminating between domain and cross-domain entities and, contextually, simplifying the overall structure of the final ontology generated, i.e. By eliminating not-used cross-domain entities. This method has been applied to a concrete application case in the healthcare domain, with the goal of generating an ontological model from the XML schemas implementing the HL7 Version 3 Clinical Document Architecture Release 2.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128247180","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
JavaScript Malicious Codes Analysis Based on Naive Bayes Classification 基于朴素贝叶斯分类的JavaScript恶意代码分析
2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2014-11-08 DOI: 10.1109/3PGCIC.2014.147
Yongle Hao, Hongliang Liang, Daijie Zhang, Qian Zhao, Baojiang Cui
{"title":"JavaScript Malicious Codes Analysis Based on Naive Bayes Classification","authors":"Yongle Hao, Hongliang Liang, Daijie Zhang, Qian Zhao, Baojiang Cui","doi":"10.1109/3PGCIC.2014.147","DOIUrl":"https://doi.org/10.1109/3PGCIC.2014.147","url":null,"abstract":"Given the security threats of JavaScript malicious codes attacks in the Internet environment, this paper presents a method that uses the Naive Bayes classification to analyze JavaScript malicious codes. The method uses many malicious and normal sample data, and trains the classifier using extended API symbol features with a high degree of predictability of malicious codes, which contain variable names, function names, string constants and comments extracted from the JavaScript codes. Experiments show that the analysis method of JavaScript malicious codes is effective and achieves high accuracy.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128369800","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}
引用次数: 7
Mining Mobile Internet Packets for Malware Detection 基于恶意软件检测的移动互联网数据包挖掘
2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2014-11-08 DOI: 10.1109/3PGCIC.2014.98
Haifeng Jin, Baojiang Cui, Jianxin Wang
{"title":"Mining Mobile Internet Packets for Malware Detection","authors":"Haifeng Jin, Baojiang Cui, Jianxin Wang","doi":"10.1109/3PGCIC.2014.98","DOIUrl":"https://doi.org/10.1109/3PGCIC.2014.98","url":null,"abstract":"With the fast development of mobile devices, the volume of mobile internet traffic increased dramatically. Various information is potential to be mined from it. In this paper, the large-scale mobile internet traffic is employed to protect end-users from mobile malwares that emerge at a similar speed to that of mobile internet. Traditional mobile malware detection methods often inevitably consume the limited battery life and computing resource of the end device. To solve these problems, a novel framework, Mining Mobile Internet Packets for Malware Detection (MMIP-MD), is proposed. Since the new technology of format preserving encryption (FPE) made the data of mobile internet traffic from telecommunication operators accessible and minable without leaking end-users' privacies, the framework thus aims feasibly at detecting mobile malwares using the traffic data only, which moves the detection from the end device to the internet side. It has good extensibility since a variety of mining algorithms can be applied on this framework to discover behavioral patterns of malwares. In addition, a real example of Bayes classification was implemented to illustrate the framework and test its feasibility.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131787047","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}
引用次数: 3
New Evaluation Criterion of File Replicas Placement for Replication Strategies in Data Grids 数据网格中复制策略文件副本放置的新评价标准
2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2014-11-08 DOI: 10.1109/3PGCIC.2014.29
C. Hamdeni, T. Hamrouni, Faouzi Ben Charrada
{"title":"New Evaluation Criterion of File Replicas Placement for Replication Strategies in Data Grids","authors":"C. Hamdeni, T. Hamrouni, Faouzi Ben Charrada","doi":"10.1109/3PGCIC.2014.29","DOIUrl":"https://doi.org/10.1109/3PGCIC.2014.29","url":null,"abstract":"Data grids provide distributed resources for dealing with large scale applications generating huge volume of data that require to be efficiently managed, shared and analyzed. Data replication is a useful technique to solve these tasks since it allows minimizing data access time through creating many replicas and storing them in appropriate locations. Several replication strategies have been proposed in the literature. The main idea of our work is to propose a new aspect of the evaluation of replication strategies which is the quality assessment of replicas placement in the data grid. In this paper, we prove the influence of the distribution of replicas through sites on the evaluation results. We then show the importance of evaluating the quality of the replicas distribution in data grids.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131990130","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
Static Compliance Checking beyond Separation of Duty Constraints 超越职责分离约束的静态遵从性检查
2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2014-11-08 DOI: 10.1109/3PGCIC.2014.53
Yang Bo, Chunhe Xia, Yang Luo, Qing Tang
{"title":"Static Compliance Checking beyond Separation of Duty Constraints","authors":"Yang Bo, Chunhe Xia, Yang Luo, Qing Tang","doi":"10.1109/3PGCIC.2014.53","DOIUrl":"https://doi.org/10.1109/3PGCIC.2014.53","url":null,"abstract":"In many application domains, processes often have to comply with business level rules and policies, called compliance constraint. Separation of duty requirement is one of such constraint, and enhancement measures are taken to make sure the business process is compliance with the constraints. Separation of duty Algebra is a high level policy designed to specify Separation of duty constraints, which can describe both quantification requirements and qualification requirements. In this article, we improve the high level description SoDA by involving task information. The improved specification expresses relations between user and task, describes bind of duty constraint beyond separation of duty. In order to make the high level policy act on concrete process, we proceed by constructing mapping rules to translate high level policies to low level constraints, which is representing by Description Logic. Then, we propose a framework for business process compliance checking. At last we give a case study to show the suitably of the method.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132283852","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
Self-Certified Public Auditing for Data Integrity in Cloud Storage 云存储数据完整性自认证公众审计
2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2014-11-08 DOI: 10.1109/3PGCIC.2014.75
Jianhong Zhang, Weina Zeng
{"title":"Self-Certified Public Auditing for Data Integrity in Cloud Storage","authors":"Jianhong Zhang, Weina Zeng","doi":"10.1109/3PGCIC.2014.75","DOIUrl":"https://doi.org/10.1109/3PGCIC.2014.75","url":null,"abstract":"In cloud storage, after data file is outsourced, data owner no longer physical controls over the storage. To efficiently verify these data integrity, several public auditing schemes for data integrity checking were proposed to achieve data integrity checking. The existing auditing schemes makes that the auditor executes high computation to check data integrity. It might become a burden for a lot of data owner. To solve the above problem, we propose a novel public auditing scheme with public verifiability and constant communication cost based on self-certified signature scheme in this paper. Thorough analysis shows that our proposed scheme is secure and efficient. The security of our scheme is based on the fixed inversion problem (FI) of the bilinear map and the inversion of hash function.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117254917","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}
引用次数: 4
High Efficient Multi-party Quantum Secret Sharing Scheme 高效的多方量子秘密共享方案
2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2014-11-08 DOI: 10.1109/3PGCIC.2014.70
Xiaoqian Zhang, Xiaoqing Tan, Cui Liang
{"title":"High Efficient Multi-party Quantum Secret Sharing Scheme","authors":"Xiaoqian Zhang, Xiaoqing Tan, Cui Liang","doi":"10.1109/3PGCIC.2014.70","DOIUrl":"https://doi.org/10.1109/3PGCIC.2014.70","url":null,"abstract":"Multi-party quantum secret sharing scheme with high efficient based on entanglement states is proposed and analyzed. A three-party which is presented shares a sequence of joint key bits. In this scheme, a general proof of the security against eavesdropping for three-party quantum secret sharing based on entanglement swapping is provided. The scheme which is showed is secure against a dishonest participant's intercept-and-resend attack and eavesdropper's entangle auxiliary-particles attack. In case of eavesdropping attacks with full information again, the detection bit needs to be transmitted except those for detection, the total efficiency of the scheme approaches to 100%. The protocol can be generalized to N-party system by using N-partite entanglement states.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"273 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134075146","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
Intelligent Bio-inspired Approach for Secrecy Management in the Cloud 基于智能生物的云端保密管理方法
2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2014-11-08 DOI: 10.1109/3PGCIC.2014.78
M. Ogiela, L. Ogiela, U. Ogiela
{"title":"Intelligent Bio-inspired Approach for Secrecy Management in the Cloud","authors":"M. Ogiela, L. Ogiela, U. Ogiela","doi":"10.1109/3PGCIC.2014.78","DOIUrl":"https://doi.org/10.1109/3PGCIC.2014.78","url":null,"abstract":"In the paper will be presented some advances in crypto-biometric procedures used for encryption and division of secret data in the cloud. A novel solutions of the secret data sharing will be presented, based on the concept of mathematical linguistics, which are used to split and share information between various instances in the cloud. The essence of the presented approach is a linguistic concept stemming from the theory of formal languages, which concept is used in recording, analysing and interpreting various types of data treated as elements of a certain formal language.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116264264","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}
引用次数: 3
Improved Recommendation System with Friends on SNS 改进的SNS好友推荐系统
2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2014-11-08 DOI: 10.1109/3PGCIC.2014.31
Yanxiang Ling, Qing Liao
{"title":"Improved Recommendation System with Friends on SNS","authors":"Yanxiang Ling, Qing Liao","doi":"10.1109/3PGCIC.2014.31","DOIUrl":"https://doi.org/10.1109/3PGCIC.2014.31","url":null,"abstract":"With the rapid development of the Internet, SNS services and 3G commercial mobile applications which brings tremendous opportunity, although the time on the development of SNS is very short in China, social web game is in the early stage of development, because of massive user, the potential commercial value of Chinese SNS is still a great mining space. A relatively large defects is the precipitation and accumulation on content, the dynamic of friends will affect our own decisions largely, it is favorable for the activity of SNS to increase the number of friends. We study some algorithms and models of the recommended system in this paper, and add the context awareness into the SNS friend recommended system, improve the calculation formula of similarity. We have improved the existing models, and conduct experiments to validate it and compare it with previous methods.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"704 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115945302","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 Dynamic Multiple Digital Watermarking Model based on Temporal Series 基于时间序列的动态多重数字水印模型
2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2014-11-08 DOI: 10.1109/3PGCIC.2014.123
Xiaoyi Zhou, Jixin Ma, W.-C. Du, Yihong Li
{"title":"A Dynamic Multiple Digital Watermarking Model based on Temporal Series","authors":"Xiaoyi Zhou, Jixin Ma, W.-C. Du, Yihong Li","doi":"10.1109/3PGCIC.2014.123","DOIUrl":"https://doi.org/10.1109/3PGCIC.2014.123","url":null,"abstract":"This paper introduces a dynamic multiple digital watermarking model based on a formal characterization of time-series in terms of temporal logic. The security analysis shows that the proposed method of mapping multiple watermarks into a single one overcomes the problem of volume limitation and overlapping of multiple watermarks in a multi-digital-watermarking system.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126730353","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信