检索结果-内蒙古大学图书馆

IEEE International Conference on High Performance computing and Communications (HPCC)

作者： Wenbin Jiang Yiming Chen Hai Jin Bin Luo Ye Chi Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781479989386

Recently, convolutional networks have achieved great successes in the field of computer vision. In order to improve the efficiency of convolutional networks, large amount of solutions focusing on training algorithms and parallelism strategies have been proposed. In this paper, a novel algorithm based on look-up table is proposed to speed up convolutional networks with small filters by applying GPU. By transforming multiplication operations in the convolution computation to some table-based summation operations, the overhead of convolution computation can be reduced largely. The process of creating table and looking up table is very appropriate for parallelization on GPU. Experiment results show that the proposed approaches can improve the speed of convolution computation by 20%-30%, compared with state-of-the-art existing works.

关键词： Convolution Graphics processing units Training Computational modeling Filtering algorithms Kernel Digital filters

来源：评论

学校读者我要写书评

暂无评论

Cost-Effective Hybrid Replacement Strategy for SSD in Web Cache

Cost-Effective Hybrid Replacement Strategy for SSD in Web Ca...

引用

IEEE International Conference on Ubiquitous computing and Communications

作者： Qu Li Xiaofei Liao Hai Jin Li Lin Xia Xie Qiongjie Yao Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781509001552

The increasing popularity of photo sharing in social networking service (SNS) complicates the challenge of storing and transmitting large photo data for SNS providers. Distributed web caches are generally used by SNS providers to improve data transmission performance effectively. Two critical factors affect the efficiency of web caches: storage media and replacement algorithms. Solid-state drive (SSD) is often used in web caches due to its good performance. Random write performance and SSD endurance are directly affected by the characteristic of write amplification;this characteristic is also related to replacement algorithms. The least recently used (LRU) algorithm effectively computes cache hit ratio but induces severe write amplification. First in first out (FIFO) method minimizes write amplification, whereas a weak hit ratio increases bandwidth consumption. In this paper, we present a hybrid replacement strategy, namely, F-SkLRU. This strategy facilitates a good trade-off between performance and the cost of web cache. F-SkLRU takes advantage of sequential writing to reduce SSD wear. This strategy also consolidates multiple factors to improve hit ratio. Simulation results show that F-SkLRU can reduce bandwidth consumption by 14.11% to 23.4% in comparison with that of FIFO and LRU. The proposed strategy can also reduce the cost of SSD by up to 300% more than LRU can in extreme situations.

关键词： Web cache Bandwidth SSD Write amplification

来源：评论

学校读者我要写书评

暂无评论

PSG： a two-layer graph model for document summarization

引用

Frontiers of computer science 2014年第1期8卷 119-130页

作者： Heng CHEN Hai JIN Feng ZHAO Service Computing Technology and System Lab & Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

Graph model has been widely applied in docu- ment summarization by using sentence as the graph node, and the similarity between sentences as the edge. In this paper, a novel graph model for document summarization is presented, that not only sentences relevance but also phrases relevance information included in sentences are utilized. In a word, we construct a phrase-sentence two-layer graph structure model （PSG） to summarize document（s） . We use this model for generic document summarization and query-focused sum- marization. The experimental results show that our model greatly outperforms existing work.

关键词： relationship graph Markov random walk doc-ument summarization

来源：评论

学校读者我要写书评

暂无评论

A Map-reduce Method for Training Autoencoders on Xeon Phi

A Map-reduce Method for Training Autoencoders on Xeon Phi

引用

IEEE International Conference on Ubiquitous computing and Communications

作者： Qiongjie Yao Xiaofei Liao Hai Jin Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781509001552

The stacked autoencoder is a deep learning model that consists of multiple autoencoders. This model has been widely applied in numerous machine learning applications. A significant amount of effort has been made to increase the size of the deep learning model with respect to the size of the training dataset and the parameter of the model to improve performance. However, training a large deep learning model is highly time consuming. Recent studies have applied the CPU cluster with thousands of machines as well as the single GPU or the GPU cluster, to train large scale deep learning models. As a high-performance coprocessor like GPU, the Xeon Phi can be an alternative tool for training large scale deep learning models on a single machine. The Xeon Phi can be recognized as a small cluster which features about 60 cores, and each core supports four hardware threads. Massive parallelism offsets the low computing capacity of every core, but challenges an efficient parallel autoencoders design. In this paper, we analyze the training algorithm of autoencoders based on the matrix operation and point out the thread oversubscription problem, which results in performance degradation. Based on the observation, we propose our map-reduce implementation of autoencoders on the Xeon Phi coprocessor. Our basic idea is to parallelize multiple autoencoder model replicas with bulk synchronous parallel (BSP) communication model where the parameters are updated after the computations of all replicas are completed. Each thread is responsible for one model replica, and all replicas work together on the same mini-batch. This data parallelism method is suitable for training autoencoders on the Xeon Phi, and can extend to asynchronous parallel training method without thread oversubscription. In our experiment the speedup is four times higher than that of sequential implementation. Enlarging the size of the autoencoder model, our method still gets stable speedup.

关键词： Deep Learning Autoencoder Xeon Phi Mapreduce BSP

来源：评论

学校读者我要写书评

暂无评论

URMG: Enhanced CBMG-Based Method for Automatically Testing Web Applications in the Cloud

引用

Tsinghua science and technology 2014年第1期19卷 65-75页

作者： Xiaolin Xu Hai Jin Song Wu Lixiang Tang Yihong Wang Services Computing Technology and System Lab and Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology

To satisfy the rapid growth of cloud technologies, a large number of web applications have been developed and deployed, and these applications are being run in clouds. Due to the scalability provided by clouds, a single web application may be concurrently visited by several millions or billions of users. Thus, the testing and performance evaluations of these applications are increasingly important. User model based evaluations can significantly reduce the manual work required, and can enable us to determine the performance of applications under real runtime environments. Hence, it has become one of the most popular evaluation methods in both industry and academia. Significant efforts have focused on building different kinds of models using mining web access logs, such as Markov models and Customer Behavior Model Graph （CBMG）. This paper proposes a new kind of model, named the User Representation Model Graph （URMG）, which is built based on CBMG. It uses an algorithm to refine CBMG and optimizes the evaluations execution process. Based on this model, an automatic testing and evaluation system for web applications is designed, implemented, and deployed in our test cloud, which is able to execute all of the analysis and testing operations using only web access logs. In our system, the error rate caused by random access to applications in the execution phase is also reduced, and the results show that the error rate of the evaluation that depends on URMG is 50% less than that which depends on CBMG.

关键词： cloud web application performance evaluation customer behavior user representation

来源：评论

学校读者我要写书评

暂无评论

An adaptive switching scheme for iterative computing in the cloud

引用

Frontiers of computer science 2014年第6期8卷 872-884页

作者： Yu ZHANG Xiaofei LIAO Hai JIN Li LIN Feng LU Service Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

Delta-based accumulative iterative computation （DAIC） model is currently proposed to support iterative algorithms in a synchronous or an asynchronous way. However, both the synchronous DAIC model and the asynchronous DAIC model only satisfy some given conditions, respectively, and perform poorly under other conditions either for high synchronization cost or for many redundant activations. As a result, the whole performance of both DAIC models suffers from the serious network jitter and load jitter caused by multi- tenancy in the cloud. In this paper, we develop a system, namely Hyblter, to guarantee the performance of iterative algorithms under different conditions. Through an adaptive execution model selection scheme, it can efficiently switch between synchronous and asynchronous DAIC model in order to be adapted to different conditions, always getting the best performance in the cloud. Experimental results show that our approach can improve the performance of current solutions up to 39.0%.

关键词： iterative algorithm computational skew communication skew cloud delta-based accumulative iterative computation

来源：评论

学校读者我要写书评

暂无评论

Ciphertext-Policy Attribute-Based Encryption with Short Keys

引用

Chinese Journal of Electronics 2014年第4期23卷 655-660页

作者： XU Peng TANG Yong JIANG Wenbin JIN Hai ZOU Deqing Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology

Ciphertext-policy attribute-based encryption(CP-ABE)allows a user with some attributes to decrypt the ciphertexts associated with these *** several CP-ABE schemes with the constant size ciphertext were proposed to reduce the communication cost,their master public and secret keys still have the size linear in the total number of *** schemes are unpractical for the attribute-scalable and many-attributes scenario.A new CP-ABE scheme is *** attribute is mapped to a mathematical value by a combination *** master public and secret keys of the proposed CP-ABE scheme have the size linear in the binary size of a hash function’s *** has the comparable performance with existing schemes in the aspects like the time costs of encryption and decryption,the expressiveness of access policy and the provable security.

关键词： Ciphertext-policy attribute-based encryption Expressiveness policy Provable security

来源：评论

学校读者我要写书评

暂无评论

Energy Minimization for Cellular Network Interfaces with Dynamic Link Quality

Energy Minimization for Cellular Network Interfaces with Dyn...

引用

International Conference on computer Communications and Networks (ICCCN)

作者： Xiao Lei Zaiyang Tang Peng Li Hai Jin Song Guo Xiaofei Liao Feng Lu Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Aizu Daigaku Aizuwakamatsu Fukushima JP School of Computer Science and Engineering The University of Aizu Japan

It has been recognized that cellular network interfaces are not energy efficient because of tail energy after each transmission. Although many research efforts have been made to reduce tail energy, they ignore the dynamic of link quality caused by user mobility or network congestion, which would lead to limited improvement without quality-of-experience guarantee. In this paper, we study to minimize energy consumption of the cellular network interface with a sequence of download/upload requests. Given accurate estimation of achievable link rate, we design a dynamic-programming (DP) based algorithm to obtain the optimal solution. Without the knowledge of dynamic link quality and future requests, an online algorithm is proposed to approximate the optimal solution. Finally, we conduct extensive simulations using real traces to evaluate the performance of our proposals, and the results show that 29% energy can be saved by using our algorithm under typical network settings.

关键词： Heuristic algorithms Energy consumption Algorithm design and analysis Network interfaces Bandwidth Minimization Data communication

来源：评论

学校读者我要写书评

暂无评论

A Secured Scheme for Geographical Distance Computation over Encrypted Cloud Data

A Secured Scheme for Geographical Distance Computation over ...

引用

International Conference on computer science and Network technology

作者： Zaid Ameen Abduljabbar Hai Jin Ayad Ibrahim Aqeel Noori Mohammed Abdulridha Hussain Zaid Alaa Hussien Deqing Zou Salah H. Abbdal Cluster and Grid Computing Lab Services Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China University of Basrah Basrah Iraq

ISBN: (纸本)9781467381741

Popular service providers, such as Google and Amazon, have turned their vast resources into a cloud computing model and enforced their businesses to run applications on the servers of such new model. To ensure security and privacy in this environments, customers have to encrypt their data before uploading them into the cloud servers. Unfortunately, modern unbreakable encryption methods are inadequate because they do not have the ability to execute database queries on the encrypted data. In this paper, we address the problem of how to calculate the geographical distance over an encrypted dataset. Specifically, the data owner, Alice, sends her encrypted dataset of geographical locations into the cloud server. At any time, Bob would like to check the proximity of his submitted query from the locations of Alice. Our proposed scheme enables the untrusted server to perform such task without compromising the privacy of either the dataset of Alice or the query of Bob. Among various distance metrics, we employ the efficient principle of approximate matching to obtain the proximity between query and data locations. Furthermore, we use the inner product similarity to formalize such principle for similarity measurement. Several experiments have been conducted to investigate the overhead and the efficiency of the proposed scheme.

关键词： Cloud computing Privacy preserving Geographical distance Cloud computing Servers distance metric approximate match Dataset CLOUDS Clouds data querying similar measure Uploading Privacy cryptography Geographical Locations

来源：评论

学校读者我要写书评

暂无评论

Scheme for Ensuring Data Security on Cloud Data Storage in a Semi-trusted Third Party Auditor

Scheme for Ensuring Data Security on Cloud Data Storage in a...

引用

International Conference on computer science and Network technology

作者： Zaid Alaa Hussien Hai Jin Zaid Ameen Abduljabbar Mohammed Abdulridha Hussain Salah H. Abbdal Deqing Zou Cluster and Grid Computing Lab Big Data Technology and System Lab Services Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9781467381741

Cloud computing is a promising information technology service that allocates and reallocates resources when a client requires virtual data storage and network facility at any time and place. Cloud computing provides large data storage and management services at the lowest cost. Thus, it is crucial for many organizations and clients who seek such services. Data security and integrity are necessary and play important roles. However, these two issues are facing significant challenges. Therefore, a robust scheme is required to ensure security and privacy while transmitting or storing data in the cloud storage environment. We propose an efficient and robust scheme to ensure data security in a semi-trusted third party auditor. Our scheme adopts an advanced encryption standard to support data owner privacy, a cryptography hash function to maintain data owner integrity, and elliptic curve cryptography to ensure data confidentiality, correctness, and security when transmitting data over unsecure channels. A security analysis confirms that our scheme can withstand man-in-the-middle attack and provides data correctness.

关键词： Cloud storage data security elliptic curve cryptography hash function integrity semi-trusted third party auditor Data Security Elliptic curve cryptography cryptography Cloud computing computer information security Data Storage Scheme auditor Third party customers Management services Transmitting Data

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：