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

2013 International Conference on Cloud and Service Computing最新文献

筛选
英文 中文
Empowering Designers to Estimate Function-Level Power for Developing Green Applications 授权设计人员评估开发绿色应用程序的功能级功率
2013 International Conference on Cloud and Service Computing Pub Date : 2013-11-04 DOI: 10.1109/CSC.2013.17
Qiaozhen Chai, Zhongzhi Luan, D. Qian, Ming Xie, Wei Chen
{"title":"Empowering Designers to Estimate Function-Level Power for Developing Green Applications","authors":"Qiaozhen Chai, Zhongzhi Luan, D. Qian, Ming Xie, Wei Chen","doi":"10.1109/CSC.2013.17","DOIUrl":"https://doi.org/10.1109/CSC.2013.17","url":null,"abstract":"Power consumption in clusters has become increasingly important over the past few years. Our previous research had added power consumption to the list of managed resources to help to understand and control power profile of the clusters. We believe that in the near future, power consumption will be a charging criterion in the cloud computing services. User may pay for the energy used by their workload. Significant opportunities for power optimization exist at application design stage and are not yet fully exploited by application designers. However, it is difficult for developers to measure the energy used by their workload, and to explore how energy use might change with conditions that vary outside of the developer's control to build energy optimization policies. We solve the problem by proposing a function-component-level power model that allows developers to estimate the energy use for their application in function-level. Different from prior hardware-based measurement, we built the power prediction model based on profiling the Performance Monitor Counter, which is easy to deploy in various platforms. We also visualized the power data with call graph of the application and expand eclipse IDE tools with power feature. Experiment results showed that our method is lightweight and easy to use.","PeriodicalId":338002,"journal":{"name":"2013 International Conference on Cloud and Service Computing","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115494261","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
Optimal Service Selection Based on Business for Cloud Computing 基于业务的云计算最优服务选择
2013 International Conference on Cloud and Service Computing Pub Date : 2013-11-04 DOI: 10.1109/CSC.2013.22
Xiaochen Liu, Chunhe Xia, Zhao Wei, Xiaoning Sun, Zhiqiang Zhan
{"title":"Optimal Service Selection Based on Business for Cloud Computing","authors":"Xiaochen Liu, Chunhe Xia, Zhao Wei, Xiaoning Sun, Zhiqiang Zhan","doi":"10.1109/CSC.2013.22","DOIUrl":"https://doi.org/10.1109/CSC.2013.22","url":null,"abstract":"When organization select service provider (SP) in cloud computing based on service-oriented architecture (SOA), the optimal management of services is the kernel content of cloud computing from SP perspectives. However, it is difficult to realize the optimization of service selection in an open environment which contains large amounts of randomicity and uncertainty. In this paper, we focus on solving the service selection in SOA automatically, and the metrics are evaluated for SOA which combines the key performance of service from business, services and implementation level, and these metrics are brought forward to analyze the local and global performance. An ant colony optimization algorithm (ACO) based method is developed to realize the optimization of service selection in effective and efficient way.","PeriodicalId":338002,"journal":{"name":"2013 International Conference on Cloud and Service Computing","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124663703","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
An Empirical Study on BLAST Parallel Acceleration BLAST平行加速度的实证研究
2013 International Conference on Cloud and Service Computing Pub Date : 2013-11-04 DOI: 10.1109/CSC.2013.36
Li Ruan, Quan Zhou, Yilei Wu, Donghui Sui, Limin Xiao
{"title":"An Empirical Study on BLAST Parallel Acceleration","authors":"Li Ruan, Quan Zhou, Yilei Wu, Donghui Sui, Limin Xiao","doi":"10.1109/CSC.2013.36","DOIUrl":"https://doi.org/10.1109/CSC.2013.36","url":null,"abstract":"Sequence alignment is of great importance in bioinformatics research and one of the areas that present a significant computational challenge because of the amount and complexity of big data to be processed. Most of published implementations in bioinformatics are still focused on the analysis and/or assembly of biological sequences. Moreover, there lacks practical performance comparison on MPI based BLAST (Basic Local Alignment Search Tool) acceleration methods. This paper introduces an empirical study on accelerating BLAST using the MPI, and comparing the speedup performance between pblast based on MPI. Results show our method achieve a good speedup.","PeriodicalId":338002,"journal":{"name":"2013 International Conference on Cloud and Service Computing","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132790099","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
Design and Implementation of a Cloud Based Forensic Science Information System Model 基于云的法医学信息系统模型的设计与实现
2013 International Conference on Cloud and Service Computing Pub Date : 2013-11-04 DOI: 10.1109/CSC.2013.29
Na Li, Yanhui Du
{"title":"Design and Implementation of a Cloud Based Forensic Science Information System Model","authors":"Na Li, Yanhui Du","doi":"10.1109/CSC.2013.29","DOIUrl":"https://doi.org/10.1109/CSC.2013.29","url":null,"abstract":"In order to solve the problem of actively adapt to the police informatization and the development trend of cloud technical, a Cloud Based Forensic Science Information System Model is proposed in this paper. Forensic Science Information Management System can largely benefit from cloud based models in terms of cost reduction and resource utilization. The purpose of system design is accounting forensic science management from the heavy manual work extricate themselves, thereby improving work efficiency. Compared with conventional design schemes, this system can easy and ubiquitous access to forensic science data in the cloud, and opportunities to utilize the services of forensic science experts who maybe in remote areas. Therefore, develop a cloud based forensic science information system play an important role.","PeriodicalId":338002,"journal":{"name":"2013 International Conference on Cloud and Service Computing","volume":"51 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134466006","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}
引用次数: 5
Research of Software Size Estimation Method 软件规模估算方法研究
2013 International Conference on Cloud and Service Computing Pub Date : 2013-11-04 DOI: 10.1109/CSC.2013.32
Aihua Ren, Chen Yun
{"title":"Research of Software Size Estimation Method","authors":"Aihua Ren, Chen Yun","doi":"10.1109/CSC.2013.32","DOIUrl":"https://doi.org/10.1109/CSC.2013.32","url":null,"abstract":"Software size estimation laid the data foundation for project planning. Among all the software estimation methods, function point method, COCOMO II, Pert, Delphi and Analogy are widely used. After conducting research on these methods and analyzing the advantages and disadvantages of them, this paper gives advice on how to choose estimation methods.","PeriodicalId":338002,"journal":{"name":"2013 International Conference on Cloud and Service Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129655549","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}
引用次数: 8
Modification of One Forward Secure Ring Signature Scheme Based on Bilinear Groups of Composite Order 一个基于复合阶双线性群的前向安全环签名方案的改进
2013 International Conference on Cloud and Service Computing Pub Date : 2013-11-04 DOI: 10.1109/CSC.2013.27
Zhengjun Cao, Xiangjia Wu, Hanyue Cao
{"title":"Modification of One Forward Secure Ring Signature Scheme Based on Bilinear Groups of Composite Order","authors":"Zhengjun Cao, Xiangjia Wu, Hanyue Cao","doi":"10.1109/CSC.2013.27","DOIUrl":"https://doi.org/10.1109/CSC.2013.27","url":null,"abstract":"We show that the authority in the forward secure ring signature scheme, proposed by Liu et al. (ICICS'2011), can trace out the real signer of a signature/message pair. The weakness is due to that the signature scheme is based on bilinear groups of composite order, instead of the usual groups of prime order. We remark that the usual bilinear groups of prime order are sufficient for the construction. We will present a modification of the scheme and show its security. We also remark that the structure of bilinear groups of a large composite order could make group operation inefficient and lose the advantages of elliptic curve cryptography which gained mainly from smaller parameter size. From the practical point of view, such an algebraic structure is unlikely applicable to cryptographic schemes.","PeriodicalId":338002,"journal":{"name":"2013 International Conference on Cloud and Service Computing","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121052627","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
CMPK: A High Accuracy Microblog User Classification Method for Professional Analysis CMPK:面向专业分析的高精度微博用户分类方法
2013 International Conference on Cloud and Service Computing Pub Date : 2013-11-04 DOI: 10.1109/CSC.2013.28
Ying Peng, Haiquan Wang
{"title":"CMPK: A High Accuracy Microblog User Classification Method for Professional Analysis","authors":"Ying Peng, Haiquan Wang","doi":"10.1109/CSC.2013.28","DOIUrl":"https://doi.org/10.1109/CSC.2013.28","url":null,"abstract":"Analyzing and mining the massive data recorded in microblog in order to discover the characteristics and rules of individual behaviors, group behaviors and interactive behaviors is now the research hotspot of massive data mining and behavioral analysis area. However, the influence of social attributes, such as user's occupation, to his behavior and social relations is always neglected in the existing researches. Concerning this issue, the paper proposed a high accuracy microblog user classification method for professional analysis - CMPK (Classification Method based on Professional lexicon and K-nearest neighbor algorithm), this method uses vector space model combined with the professional lexicon and KNN (K-Nearest Neighbor algorithm) classification algorithm to analyze the industry that the microblog user belongs to based on all kinds of information he put on the network. The experiment proved that the accuracy rate of CMPK is nearly 90% which is high precision.","PeriodicalId":338002,"journal":{"name":"2013 International Conference on Cloud and Service Computing","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116618606","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
Pipeline-Based Parallel Framework for Mass File Processing 基于管道的海量文件处理并行框架
2013 International Conference on Cloud and Service Computing Pub Date : 2013-11-04 DOI: 10.1109/CSC.2013.15
Tao Liu, Yi Liu, Qingquan Wang, Xiangrong Wang, Fei Gao, D. Qian
{"title":"Pipeline-Based Parallel Framework for Mass File Processing","authors":"Tao Liu, Yi Liu, Qingquan Wang, Xiangrong Wang, Fei Gao, D. Qian","doi":"10.1109/CSC.2013.15","DOIUrl":"https://doi.org/10.1109/CSC.2013.15","url":null,"abstract":"Currently, there exists billions of files on the Internet, such as pictures, web pages, audio and video files, etc., and the number is still growing rapidly. These huge amount of files need to be processed by some applications as quickly as possible with parallel processing. With the increasing of cores in processors, parallel programming becomes more complex. The behavior that multiple parallel processes/threads access files simultaneously may interfere with each other and cause extra performance loss. Consequently, this paper proposes a pipeline-based parallel framework for mass file processing, in which file processing is divided into multiple stages to compose a pipeline. Files flow through these stages one by one, and the interferences in file-accessing are avoided. Moreover, the parallel programming can be simplified by means of parallel frameworks and programming interfaces. Experiments with one real-world application and some micro-benchmarks show that the framework can efficiently improve system performance.","PeriodicalId":338002,"journal":{"name":"2013 International Conference on Cloud and Service Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126985992","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
MEFTTD: A Parallel Awareness Scheduler mettd:一个并行感知调度器
2013 International Conference on Cloud and Service Computing Pub Date : 2013-11-04 DOI: 10.1109/CSC.2013.31
Zheng Yuan, B. Li
{"title":"MEFTTD: A Parallel Awareness Scheduler","authors":"Zheng Yuan, B. Li","doi":"10.1109/CSC.2013.31","DOIUrl":"https://doi.org/10.1109/CSC.2013.31","url":null,"abstract":"This paper presents a scheduling algorithm on cluster, named modified earliest finish time with task description (MEFTTD). Unlike other algorithms, MEFTTD needs programmers to describe the attribute of their parallel program. Then, MEFTTD uses these descriptions to optimize scheduling strategy. In this paper, round-robin algorithm (R-R), Heterogeneous Earliest-Finish-Time algorithm (HEFT) and MEFTTD are compared. The overall result demonstrates that MEFTTD can improve scheduling performance dramatically.","PeriodicalId":338002,"journal":{"name":"2013 International Conference on Cloud and Service Computing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134162143","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
Contructing Authentication Web in Cloud Computing 云计算环境下认证Web的构建
2013 International Conference on Cloud and Service Computing Pub Date : 2013-11-04 DOI: 10.1002/sec.1202
Gansen Zhao, Zhongjie Ba, Xinming Wang, Feng Zhang, Changqin Huang, Yong Tang
{"title":"Contructing Authentication Web in Cloud Computing","authors":"Gansen Zhao, Zhongjie Ba, Xinming Wang, Feng Zhang, Changqin Huang, Yong Tang","doi":"10.1002/sec.1202","DOIUrl":"https://doi.org/10.1002/sec.1202","url":null,"abstract":"Cloud computing enables rapid deployment of services on an on-demand basis in large scale. Public clouds are open to all users with identities from various domains, requiring the support of multiple identity providers and hybrid authentication protocols. The complexity of the authentication scenario brings a great burden to service providers. Service providers and users know only a small part of the complicated authentication network. This work explores a system view on the authentication network in cloud, allowing the authentication interaction and the trust relations to be explicitly described and analyzed. A cross-domain single sign-on model is proposed and the implementation details of the authentication architecture and protocol is presented.","PeriodicalId":338002,"journal":{"name":"2013 International Conference on Cloud and Service Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125618608","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}
引用次数: 5
下一页 尾页
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学术官方微信
小红书