2014 IEEE 17th International Conference on Computational Science and Engineering最新文献

筛选
英文 中文
Multiple Secret Key Sharing Based on the Network Coding Technique for an Open Cloud DRM Service Provider 基于网络编码技术的开放云DRM服务提供商多密钥共享
Wiroon Sriborrirux, Panuwat Promsiri, Apirath Limmanee
{"title":"Multiple Secret Key Sharing Based on the Network Coding Technique for an Open Cloud DRM Service Provider","authors":"Wiroon Sriborrirux, Panuwat Promsiri, Apirath Limmanee","doi":"10.1109/CSE.2014.191","DOIUrl":"https://doi.org/10.1109/CSE.2014.191","url":null,"abstract":"In this paper, we present an open cloud DRM service provider to protect the digital content's copyright. The proposed architecture enables the service providers to use an on-the fly DRM technique with digital signature and symmetric-key encryption. Unlike other similar works, our system does not keep the encrypted digital content but lets the content creators do so in their own cloud storage. Moreover, the key used for symmetric encryption are managed in an extremely secure way by means of the key fission engine and the key fusion engine. The ideas behind the two engines are taken from the works in secure network coding and secret sharing. Although the use of secret sharing and secure network coding for the storage of digital content is proposed in some other works, this paper is the first one employing those ideas only for key management while letting the content be stored in the owner's cloud storage. In addition, we implement an Android SDK for e-Book readers to be compatible with our proposed open cloud DRM service provider. The experimental results demonstrate that our proposal is feasible for the real e-Book market, especially for individual businesses.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116232705","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
Security Enhanced Anonymous Remote User Authentication and Key Agreement for Cloud Computing 云计算安全增强匿名远程用户认证与密钥协议
Zheming Dong, Lei Zhang, Jiangtao Li
{"title":"Security Enhanced Anonymous Remote User Authentication and Key Agreement for Cloud Computing","authors":"Zheming Dong, Lei Zhang, Jiangtao Li","doi":"10.1109/CSE.2014.320","DOIUrl":"https://doi.org/10.1109/CSE.2014.320","url":null,"abstract":"Cloud computing is a new pattern of computing paradigm which enables the users to transfer their work to the cloud. The tremendous storage and computing resources provided by the cloud liberate the users from the shortage of local resources. However, as the adoption of cloud computing is emerging rapidly, the security and privacy issues are still significant challenges. In a cloud environment, a user accesses to the cloud server through open networks. Thus a variety of attacks can be launched if a secure channel is not established. Furthermore, user's sensitive personal information may be revealed if user's identity is exposed to an attacker. Therefore, user anonymity is also an important concern in cloud environment. In this paper, we first show several weaknesses of a recent anonymous remote user authentication and key agreement protocol for cloud computing, then we propose a new one. Our new protocol enables a user and a cloud server to authenticate each other anonymously and establish a secure channel between them. Thus, only the user and the cloud server may learn the messages exchanged and no entity except themselves can learn the real identities of the message senders.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116660876","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}
引用次数: 11
IOMRA - A High Efficiency Frequent Itemset Mining Algorithm Based on the MapReduce Computation Model 基于MapReduce计算模型的高效频繁项集挖掘算法IOMRA
Sheng-Hui Liu, Shi-Jia Liu, Shi-Xuan Chen, Kun-Ming Yu
{"title":"IOMRA - A High Efficiency Frequent Itemset Mining Algorithm Based on the MapReduce Computation Model","authors":"Sheng-Hui Liu, Shi-Jia Liu, Shi-Xuan Chen, Kun-Ming Yu","doi":"10.1109/CSE.2014.247","DOIUrl":"https://doi.org/10.1109/CSE.2014.247","url":null,"abstract":"The goal of Frequent Item set Mining (FIM) is to find the biggest number of frequently used subsets from a big transaction database. In previous studies, using the advantage of multicore computing, the execution time of an Apriori algorithm was sharply decreased: when the size of a data set was more than TBs and a single host had been unable to afford a large number of operations by using a number of computers connected into a super computer to speed up execution as being the obvious solution. Some parallel Apriori algorithms, based on the MapReduce framework, have been proposed. However, with these algorithms, memory would be quickly exhausted and communication cost would rise sharply. This would greatly reduce execution efficiency. In this paper, we present an improved reformative Apriori algorithm that uses the length of each transaction to determine the size of the maximum merge candidate item sets. By reducing the production of low frequency item sets in Map function, memory exhaustion is ameliorated, greatly improving execution efficiency.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117109840","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
Dynamic and Adaptive Topology-Aware Load Balancing for Grids 网格的动态和自适应拓扑感知负载均衡
Haitham Barkallah, M. Gzara, H. Ben-Abdallah
{"title":"Dynamic and Adaptive Topology-Aware Load Balancing for Grids","authors":"Haitham Barkallah, M. Gzara, H. Ben-Abdallah","doi":"10.1109/CSE.2014.309","DOIUrl":"https://doi.org/10.1109/CSE.2014.309","url":null,"abstract":"Jobs scheduling and load balancing functionalities are crucial for best Grid performance and utilization. In this paper, we present a dynamic and adaptive polyhedron topology-aware Grid load balancing method which we called Tun Grid. Its main objective is the extreme decentralization of the scheduling and the load balancing processes at the lowest processing and networking cost. It ensures load balancing through an adaptive local neighborhood propagation strategy of overload. Tun Grid was experimented using the Grid Sim simulator and compared to other methods. Experimental results are presented and discussed.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116860844","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
A Recursive Algorithm for General Hash Chain Traversal 一般哈希链遍历的递归算法
Yi-Wen Peng, Wei-Mei Chen
{"title":"A Recursive Algorithm for General Hash Chain Traversal","authors":"Yi-Wen Peng, Wei-Mei Chen","doi":"10.1109/CSE.2014.228","DOIUrl":"https://doi.org/10.1109/CSE.2014.228","url":null,"abstract":"A hash chain is a popular tool for improving the efficiency of several cryptographic applications. In spite of the computation efficiency of one-way function, the performance issue is a challenging research topic for chains with long length in resource-constrained environments. We propose a recursive algorithm of hash chain traversal for arbitrary length n with [log2n] storage cells and the computational costs of our solution are less than 12 n log2 n hash function evaluations.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115259209","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
A Novel Prediction Method for Analog Circuits Based on Gaussian White Noise Estimation 一种基于高斯白噪声估计的模拟电路预测方法
Jingyu Zhou, Shulin Tian, B. Long, Chenglin Yang
{"title":"A Novel Prediction Method for Analog Circuits Based on Gaussian White Noise Estimation","authors":"Jingyu Zhou, Shulin Tian, B. Long, Chenglin Yang","doi":"10.1109/CSE.2014.52","DOIUrl":"https://doi.org/10.1109/CSE.2014.52","url":null,"abstract":"Research on prediction about analog circuits is rarely conducted, and the only methods are prognosis of few special features extracted from output without guarantee of integrity and rationality of prognostic information, which hence influences prognostic precision. In this paper, a novel prediction method for analog circuits is proposed. In this method, time domain output waveforms in initial state and components degradation state are extracted at first, then white noise estimation is conducted to estimate the change between waveforms according to principles of noise estimation based on Kalman filter so as to obtain more reasonable fault indicators from more complete information, thereafter, a novel degradation tendency model of analog circuits is constructed according to newly obtained fault indicators, model adaption is conducted to the new model through particle filter, and prognostic method is conducted to remaining useful performance of analog circuits. Finally, experimental verification is conducted to the above conclusion.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115537356","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 Safe-Region Approach to k-RNN Queries in Directed Road Network 有向路网k-RNN查询的安全区域方法
Kamil Zeberga, Hyung-Ju Cho, Tae-Sun Chung
{"title":"A Safe-Region Approach to k-RNN Queries in Directed Road Network","authors":"Kamil Zeberga, Hyung-Ju Cho, Tae-Sun Chung","doi":"10.1109/CSE.2014.167","DOIUrl":"https://doi.org/10.1109/CSE.2014.167","url":null,"abstract":"In road networks, k-Range Nearest Neighbor (kRNN) queries locate the k-nearest neighbors for every point on the road segments that are within a given query region, based on the network distance. This is an important task, because the user's location information may not be accurate, furthermore, users may be unwilling to reveal their exact location for privacy reasons. Therefore, in this specific situation, evaluating the query result at each point and communicating with the server will create a significant communication burden for the client. We propose an efficient approach that computes a safe segment region for each inside road segment, such that the client is not required to evaluate the query answer returned by the LBS (location-based server) within the safe region. In addition, our safe region-based query processing algorithm is designed for a directed road network, where each road network has a particular orientation. In contrast, previous kRNN research produced algorithms that operated only in undirected road networks.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123620726","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
HD: A Cache Storage Strategy Based on Hierarchical Division in Content-centric Networking 内容中心网络中基于分层划分的高速缓存存储策略
Zongming Feng, Jun Yu Li, Haibo Wu, Jiang Zhi
{"title":"HD: A Cache Storage Strategy Based on Hierarchical Division in Content-centric Networking","authors":"Zongming Feng, Jun Yu Li, Haibo Wu, Jiang Zhi","doi":"10.1109/CSE.2014.123","DOIUrl":"https://doi.org/10.1109/CSE.2014.123","url":null,"abstract":"As a promising direction of future Internet, Content-Centric Network (CCN) has attracted world-wide attention. In-network caching is an important feature of CCN network, which has significant impacts on the performance of content transmission. Existing researches on in-network caching either have no regard for the collaboration or need giant additional overhead for global optimization. This paper proposes a hierarchical division-based cache storage strategy, called HD, which allows the contents can be cached in different nodes by grouping contents into different hierarchies. HD aims to reduce propagation delay and server load by light-weight collaboration mechanisms that allows the popular contents could be cached along the path with certain a probability. The performance of HD scheme was evaluated by comparing with the well-known schemes through simulation. The experimental results indicate that HD strategy can save up to 30.77% hop reduction ratio, 44.93% average cache hit ratio and 11.88% server hit ratio while the parameter α of Zipf distribution is increasing.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123382294","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
NM2H: Design and Implementation of NoSQL Extension for HDFS Metadata Management NM2H: HDFS元数据管理NoSQL扩展的设计与实现
Ruini Xue, Z. Guan, Shengli Gao, Lixiang Ao
{"title":"NM2H: Design and Implementation of NoSQL Extension for HDFS Metadata Management","authors":"Ruini Xue, Z. Guan, Shengli Gao, Lixiang Ao","doi":"10.1109/CSE.2014.246","DOIUrl":"https://doi.org/10.1109/CSE.2014.246","url":null,"abstract":"As a distributed MapReduce framework, Hadoop has been widely adopted in big data processing, in which HDFS (Hadoop Distributed File System) is mostly used for data storage. Though the single master architecture of HDFS simplifies the design and implementation, it suffers from issues such as SPOF (Single Point Of Failure) and scalability, which further may become performance bottleneck. To address these problems, this paper proposes NM2H, a NoSQL based metadata management approach for HDFS. NM2H separates the storage and query of metadata in contrast to the traditional architecture which mixed them up, and manages to keep the interfaces among the metadata service, Data Nodes and clients unchanged through a novel mapping mechanism between the original metadata structures to NoSQL documents. Therefore, the new approach can not only take advantages of NoSQL's better scalability and fault tolerance, but also deliver transparency to client applications, in which way existing programs can run on the new architecture without any modification. The prototype of NM2H was designed and implemented with widely adopted NoSQL system MongoDB. Extensive performance evaluation was conducted and the experimental results indicated the improvement of NM2H, while the overhead introduced was acceptable.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128388433","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
Distance Based Energy Efficient Clustering Method in Wireless Sensor Networks 基于距离的无线传感器网络能量高效聚类方法
Hyunduk Kim, Chulki Kim, Jae-Hun Kim, M. Seo, Seok Lee, Taikjin Lee
{"title":"Distance Based Energy Efficient Clustering Method in Wireless Sensor Networks","authors":"Hyunduk Kim, Chulki Kim, Jae-Hun Kim, M. Seo, Seok Lee, Taikjin Lee","doi":"10.1109/CSE.2014.184","DOIUrl":"https://doi.org/10.1109/CSE.2014.184","url":null,"abstract":"In the past decade, various hierarchical clustering methods have been proposed in order to efficiently minimize the energy consumption of sensor nodes. The energy consumption of such clustering methods heavily depends on the size of clusters and the number of member nodes. Existing methods form clusters by considering the distance between the sink node and each node. However, if clusters are formed based only on the distance, the numbers of nodes in clusters are not uniformly distributed, resulting in unbalanced cluster structures. To address the problem, we propose a method to build the optimal clusters by adjusting the size of clusters and number of nodes that are included, according to the distance between a sink node and normal nodes.","PeriodicalId":258990,"journal":{"name":"2014 IEEE 17th International Conference on Computational Science and Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128781897","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
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学术官方微信