2015 IEEE Symposium on Computers and Communication (ISCC)最新文献_第5页

Towards making accessible human-interaction proofs more secure and usable 使可访问的人机交互证明更加安全和可用

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405581

Hakan Ezgi Kiziloz, K. Bicakci

引用次数: 3

Is it really worth to peer at IXPs? A comparative study 窥探ixp真的值得吗?比较研究

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405551

M. D. Bartolomeo, G. Battista, Roberto di Lallo, Claudio Squarcella

引用次数: 10

Distributed sensor network for vehicles with prior right detection 基于优先权检测的分布式传感器网络

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405514

Róbert Zalman, J. Kapitulík, Michal Kochlán

引用次数: 2

Offline first fit scheduling in smart grids 智能电网的离线优先调度

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405605

Anshu Ranjan, P. Khargonekar, S. Sahni

引用次数: 11

Efficient and privacy-preserving search in multi-source personal health record clouds 在多源个人健康记录云中高效且保护隐私的搜索

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405612

Xin Yao, Yaping Lin, Qin Liu, Shuai Long

{"title":"Efficient and privacy-preserving search in multi-source personal health record clouds","authors":"Xin Yao, Yaping Lin, Qin Liu, Shuai Long","doi":"10.1109/ISCC.2015.7405612","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405612","url":null,"abstract":"Personal Health Record (PHR) systems have been widely used to manage individuals' medical history. Meanwhile, with a rapid growth of the volume of PHRs, individuals outsource PHR systems to the cloud to facilitate management. In this paper, we consider a multi-source cloud-based PHR environment, where hospitals as the data providers are authorized to upload an individual's medical data to the cloud. In this environment, a data provider builds an index as an Multi-Dimensional B-tree from an individual's medical data for fast lookup, and encrypts both the index and data before uploading, to preserve data privacy. To achieve efficient and privacy-preserving query on the encrypted medical data in cloud computing, we propose a Multi-source Encrypted Indexes Merging (MEIM) mechanism, where the indexes encrypted with a novel Multi-source Order-Preserving Symmetric Encryption (MOPSE) solution can be effectively merged by the cloud. The main merit of MEIM is that an individual only needs to issue one encrypted query to efficiently retrieve the PHRs of her interests, even if the indexes are encrypted under different symmetric keys. We prove that the query processing with MEIM for data user is n times faster than the tradition OPSE, where n denotes the number of data providers.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122007860","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}

引用次数: 10

Discovery of services in smart cities of mobile social users 发现智慧城市中移动社交用户的服务

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405518

M. Girolami, S. Chessa, E. Ferro

引用次数: 7

A failure prediction approach based on cloud theory and hidden Markov model in networked computing systems 基于云理论和隐马尔可夫模型的网络计算系统故障预测方法

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405567

Weiwei Zheng, Zhili Wang, Haoqiu Huang, Luoming Meng, Xue-song Qiu

{"title":"A failure prediction approach based on cloud theory and hidden Markov model in networked computing systems","authors":"Weiwei Zheng, Zhili Wang, Haoqiu Huang, Luoming Meng, Xue-song Qiu","doi":"10.1109/ISCC.2015.7405567","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405567","url":null,"abstract":"Due to off-the-shelf hardware and software applications integrated with distinct manufactures are widely used, networked computing systems incur high risk of failures and exceptions. Failures play a crucial role and must be timely handled to ensure system survivability and reliability. This paper focuses on on-line failure prediction for networked computing systems using system runtime data. We propose a failure prediction approach based on cloud theory (CT) and hidden Markov model (HMM). This approach expands the HMM, training with the CT. Additionally, we define the parameter ω as the correlations between various indices and failures, taking account of multiple runtime indices in networked computing systems. And we use multiple dimensions to describe failure prediction in detail, by extending parameters in HMM. In order to reduce computing cost in model training phase, we exploit the likelihood and membership degree computing algorithms in CT, instead of traditional HMM algorithms. Finally, the results from our simulations show the feasibilities and effectiveness of our approach. The experiments show that the execution time of the proposed failure prediction is reduced in terms of promised prediction performance.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"341 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113998482","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

Geo-localized content replication for Vehicular Ad-hoc Networks 车载自组织网络的地理本地化内容复制

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405555

Fabrício A. Silva, A. Boukerche, T. R. Silva, L. B. Ruiz, A. Loureiro

引用次数: 1

Change data capture in NoSQL databases: A functional and performance comparison NoSQL数据库中的更改数据捕获:功能和性能比较

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405574

Felipe Mathias Schmidt, C. Geyer, A. E. S. Filho, S. Deßloch, Yongchao Hu

{"title":"Change data capture in NoSQL databases: A functional and performance comparison","authors":"Felipe Mathias Schmidt, C. Geyer, A. E. S. Filho, S. Deßloch, Yongchao Hu","doi":"10.1109/ISCC.2015.7405574","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405574","url":null,"abstract":"Requirements for data storage and processing have reached new levels, with applications relying on the analysis of large amounts of data in order to support everyday life services to end users. Since the costs of maintaining and managing databases are significant, change data capture (CDC) techniques can be used to determine which parts of a data source have changed, and thus assist in the management of large volumes of data in data warehouses. In this paper we investigate a number of CDC techniques suitable for NoSQL databases. CDC techniques can be used to track modifications in a source database, which later can be made available to a target database. Our base system and testbed are based on Apache Cassandra, which is a NoSQL database that offers high performance and scalability. Cassandra is combined with a MapReduce framework, which is used to implement the logic of each CDC technique and is suitable for highly distributed and parallel computing. This paper also presents both a functional comparison of the different CDC techniques, as well as a performance evaluation in a real testbed.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128647907","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

Game-theoretic based scheduling for demand-side management in 5G smart grids 基于博弈论的5G智能电网需求侧管理调度

2015 IEEE Symposium on Computers and Communication (ISCC) Pub Date : 2015-07-06 DOI: 10.1109/ISCC.2015.7405446

Firooz B. Saghezchi, Fatemeh B. Saghezchi, Alberto Nascimento, Jonathan Rodriguez

{"title":"Game-theoretic based scheduling for demand-side management in 5G smart grids","authors":"Firooz B. Saghezchi, Fatemeh B. Saghezchi, Alberto Nascimento, Jonathan Rodriguez","doi":"10.1109/ISCC.2015.7405446","DOIUrl":"https://doi.org/10.1109/ISCC.2015.7405446","url":null,"abstract":"This paper addresses a game-theoretic based distributed appliance scheduling approach for demand-side management in smart grid. The game is played by a utility company and its subscribed residential users. The company monitors electricity demand online, manipulates the price of electricity for different hours to shape users' consumption pattern, and advertises it through Smart Grid infrastructure. Monitoring the electricity price in the market, users independently react by optimally scheduling their shiftable appliances to minimise their electricity expenses. We study day-ahead and quadratic pricing tariffs and discuss the best strategic response of users to each of these strategies that achieves Nash Equilibrium. The game serves as a distributed optimisation tool to minimise load variation in the grid. That is, even if users selfishly minimise their electricity expenses, they will automatically contribute to minimise peak-to-average ratio (PAR) of the aggregate demand, too. Simulation results confirm that adopting quadratic pricing tariff by company and quadratic programming scheduling by users is a Pareto-optimal strategy profile that can achieve a drastic PAR shaving while cutting users electricity expenses by half.","PeriodicalId":186097,"journal":{"name":"2015 IEEE Symposium on Computers and Communication (ISCC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116714342","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}

引用次数: 9