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

IEEE International Conference on Image processing

作者： Qiang Wang Jiaqing Xu Rongchun Li Peng Qiao Ke Yang Shijie Li Yong Dou National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China School of Computer National University of Defense Technology Changsha China

Image clustering is one of the challenging tasks in machine learning, and has been extensively used in various applications. Recently, various deep clustering methods has been proposed. These methods take a two-stage approach, feature learning and clustering, sequentially or jointly. We observe that these works usually focus on the combination of reconstruction loss and clustering loss, relatively little work has focused on improving the learning representation of the neural network for clustering. In this paper, we propose a deep convolutional embedded clustering algorithm with inception-like block (DCECI). Specifically, an inception-like block with different type of convolution filters are introduced in the symmetric deep convolutional network to preserve the local structure of convolution layers. We simultaneously minimize the reconstruction loss of the convolutional autoencoders with inception-like block and the clustering loss. Experimental results on multiple image datasets exhibit the promising performance of our proposed algorithm compared with other competitive methods.

关键词： Convolutional codes Convolution Clustering algorithms Image reconstruction Decoding Clustering methods Task analysis

来源：评论

学校读者我要写书评

暂无评论

RZKPB: A Privacy-Preserving Blockchain-Based Fair Transaction Method for Sharing Economy

RZKPB: A Privacy-Preserving Blockchain-Based Fair Transactio...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Bin Li Yijie Wang Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Hunan Changsha P.R. China

Emerging blockchain systems have been widely adopted in sharing economy, such as e-commerce, to allow mutually distrustful parties to transact fairly without trusted parties. Most blockchain systems, however, lack transactional privacy protection. All transactions, including trading relationship between pseudonyms and content transacted, are exposed on the blockchain. Although many existing privacy protection methods on the blockchain have been proposed, it is difficult to find a trade-off between keeping speed and protecting privacy of transactions. To address this limitation, we propose a novel privacy-preserving method RZKPB that does not store financial transactions in clear on the blockchain, thus retaining transactional privacy from the public's view. Meanwhile, these transactions are as proofs to solve disputes between trading partners. RZKPB ensures fairness and privacy of transactions between participants without adding a new trusted party and breaking the verifying protocol on the blockchain. We take the e-commerce as an example in sharing economy to introduce RZKPB in our paper. Our experimental results show that compared with existing privacy-preserving methods based on the blockchain, RZKPB is more efficient under different settings.

关键词： Privacy Protocols Encryption Distortion

来源：评论

学校读者我要写书评

暂无评论

FPPB: A Fast and Privacy-Preserving Method Based on the Permissioned Blockchain for Fair Transactions in Sharing Economy

FPPB: A Fast and Privacy-Preserving Method Based on the Perm...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Bin Li Yijie Wang Peichang Shi Huan Chen Li Cheng Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha Hunan P.R. China

Blockchain is a distributed system with efficient transaction recording and has been widely adopted in sharing economy. Although many existing privacy-preserving methods on the blockchain have been proposed, finding a trade-off between keeping speed and preserving privacy of transactions remain challenging. To address this limitation, we propose a novel Fast and Privacy-preserving method based on the Permissioned Blockchain (FPPB) for fair transactions in sharing economy. Without breaking the verifying protocol and bringing additional off-blockchain interactive communication, FPPB protects the privacy and fairness of transactions. Additionally, experiments are implemented in EthereumJ (a Java implementation of the Ethereum protocol) to measure the performance of FPPB. Compared with normal transactions without cryptographic primitives, FPPB only slows down transactions slightly.

关键词： Privacy Cloud computing Encryption Registers Protocols

来源：评论

学校读者我要写书评

暂无评论

Meeting deadlines for approximation processing in MapReduce environments

引用

Frontiers of Information Technology & Electronic Engineering 2017年第11期18卷 1754-1772页

作者： Ming-hao HU Chang-jian WANG Yu-xing PENG National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

To provide timely results for big data analytics, it is crucial to satisfy deadline requirements for MapReduce jobs in today＇s production environments. Much effort has been devoted to the problem of meeting deadlines, and typically there exist two kinds of solutions. The first is to allocate appropriate resources to complete the entire job before the specified time limit, where missed deadlines result because of tight deadline constraints or lack of resources; the second is to run a pre-constructed sample based on deadline constraints, which can satisfy the time requirement but fail to maximize the volumes of processed data. In this paper, we propose a deadline-oriented task scheduling approach, named ＇Dart＇, to address the above problem. Given a specified deadline and restricted resources, Dart uses an iterative estimation method, which is based on both historical data and job running status to precisely estimate the real-time job completion time. Based on the estimated time, Dart uses an approach-revise algorithm to make dynamic scheduling decisions for meeting deadlines while maximizing the amount of processed data and mitigating stragglers. Dart also efficiently handles task failures and data skew, protecting its performance from being harmed. We have validated our approach using workloads from OpenCloud and Facebook on a cluster of 64 virtual machines. The results show that Dart can not only effectively meet the deadline but also process near-maximum volumes of data even with tight deadlines and limited resources.

关键词： MapReduce Approximation jobs Deadline Task scheduling Straggler mitigation

来源：评论

学校读者我要写书评

暂无评论

Sample dropout for audio scene classification using multi-scale dense connected convolutional neural network

arXiv

引用

arXiv 2018年

作者： Feng, Dawei Xu, Kele Mi, Haibo Liao, Feifan Zhou, Yan Science and Technology on Parallel and Distributed Laboratory School of Computer National University of Defense Technology Changsha410073 China School of Information and Communication National University of Defense Technology Wuhan430010 China

Acoustic scene classification is an intricate problem for a machine. As an emerging field of research, deep Convolutional Neural Networks (CNN) achieve convincing results. In this paper, we explore the use of multi-scale Dense connected convolutional neural network (DenseNet) for the classification task, with the goal to improve the clas-sification performance as multi-scale features can be extracted from the time-frequency representation of the audio signal. On the other hand, most of previous CNN-based audio scene classification approaches aim to improve the classification accuracy, by employing different regularization techniques, such as the dropout of hidden units and data augmentation, to reduce overfitting. It is widely known that outliers in the training set have a high negative inuence on the trained model, and culling the outliers may improve the classification performance, while it is often under-explored in previous studies. In this paper, inspired by the silence removal in the speech signal processing, a novel sample dropout approach is proposed, which aims to remove outliers in the training dataset. Using the DCASE 2017 audio scene classification datasets, the experimental results demonstrates the proposed multi-scale DenseNet providing a su-perior performance than the traditional single-scale DenseNet, while the sample dropout method can further improve the classification robustness of multi-scale DenseNet. Copyright © 2018, The Authors. All rights reserved.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

Collaborative deep learning across multiple data centers

arXiv

引用

arXiv 2018年

作者： Xu, Kele Mi, Haibo Feng, Dawei Wang, Huaimin Chen, Chuan Zheng, Zibin Lan, Xu National Key Laboratory of Parallel and Distributed Processing Changsha China College of Computer National University of Defense Technology Changsha China School of Data and Computer Science Sun Yat-Sen University Guangzhou China Queen Mary University of London London United Kingdom

Valuable training data is often owned by independent organizations and located in multiple data centers. Most deep learning approaches require to centralize the multi-datacenter data for performance purpose. In practice, however, it is often infeasible to transfer all data to a centralized data center due to not only bandwidth limitation but also the constraints of privacy regulations. Model averaging is a conventional choice for data parallelized training, but its ineffectiveness is claimed by previous studies as deep neural networks are often non-convex. In this paper, we argue that model averaging can be effective in the decentralized environment by using two strategies, namely, the cyclical learning rate and the increased number of epochs for local model training. With the two strategies, we show that model averaging can provide competitive performance in the decentralized mode compared to the data-centralized one. In a practical environment with multiple data centers, we conduct extensive experiments using state-of-the-art deep network architectures on different types of data. Results demonstrate the effectiveness and robustness of the proposed method. Copyright © 2018, The Authors. All rights reserved.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

VirtMan:design and implementation of a fast booting system for homogeneous virtual machines in iVCE

引用

Frontiers of Information Technology & Electronic Engineering 2016年第2期17卷 110-121页

作者： Zi-yang LI Yi-ming ZHANG Dong-sheng LI Peng-fei ZHANG Xi-cheng LU National Laboratory for Parallel and Distributed Processing School of ComputerNational University of Defense Technology

Internet-based virtual computing environment （iVCE） has been proposed to combine data centers and other kinds of computing resources on the Internet to provide efficient and economical services. Virtual machines （VMs） have been widely used in iVCE to isolate different users/jobs and ensure trustworthiness, but traditionally VMs require a long period of time for booting, which cannot meet the requirement of iVCE＇s large-scale and highly dynamic applications. To address this problem, in this paper we design and implement VirtMan, a fast booting system for a large number of virtual machines in iVCE. VirtMan uses the Linux Small computer System Interface （SCSI） target to remotely mount to the source image in a scalable hierarchy, and leverages the homogeneity of a set of VMs to transfer only necessary image data at runtime. We have implemented VirtMan both as a standalone system and for OpenStack. In our 100-server testbed, VirtMan boots up 1000 VMs （with a 15 CB image of Windows Server 2008） on 100 physical servers in less than 120 s, which is three orders of magnitude lower than current public clouds.

关键词： Virtual machine Fast booting Homogeneity Internet-based virtual computing environment （iVCE）

来源：评论

学校读者我要写书评

暂无评论

CloudDPI: Cloud-based privacy-preserving deep packet inspection via reversible sketch 1

引用

9th International Symposium on Cyberspace Safety and Security, CSS 2017

作者： Li, Jie Su, Jinshu Wang, Xiaofeng Sun, Hao Chen, Shuhui School of Computer National University of Defense Technology Changsha Hunan410073 China National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha Hunan410073 China

ISBN: (数字)9783319694719

ISBN: (纸本)9783319694702

Hardware-based middleboxes are ubiquitous in computer networks, which usually incur high deployment and management expenses. A recently arsing trend aims to address those problems by outsourcing the functions of traditional hardware-based middleboxes to high volume servers in a cloud. This technology is promising but still faces a few challenges. First, the widely adopted data encryption techniques contradict with payload inspection needs of some middleboxes such as DPI and IDS devices. Second, the inspection rules of middleboxes may be commercial properties, thus the middlebox providers want to keep their rules confidential under third-party cloud environments, and this creates hindrances for the cloud to perform outsourced middlebox functions. Third, performance of the outsourced middlebox is an inevitable issue that needs deliberate consideration. In this paper, we propose a cloud-based DPI middlebox implementation which performs payload inspection over encrypted traffic while preserving the privacy of both communication data and inspection rules. Our design employs a modified reversible sketch structure which is used for efficient error-free membership testing, and we utilize unkeyed one-way hash functions instead of complex cryptographic protocols to achieve the privacy preservation requirements. CloudDPI supports a wide range of real-world inspection rules, we conduct evaluations on ClamAV rule set and the experiment results demonstrate the effectiveness of our proposal. © 2017, Springer International Publishing AG.

关键词： Network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Fine-grained checkpoint based on non-volatile memory

引用

Frontiers of Information Technology & Electronic Engineering 2017年第2期18卷 220-234页

作者： Wen-zhe ZHANG Kai LU Mikel LUJAN Xiao-ping WANG Xu ZHOU Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha 410072 China School of Computer The University of Manchester Manchester M13 9PL UK

New non-volatile memory （e.g., phase-change memory） provides fast access, large capacity, byteaddressability, and non-volatility features. These features, fast-byte-persistency, will bring new opportunities to fault tolerance. We propose a fine-grained checkpoint based on non-volatile memory. We extend the current virtual memory manager to manage non-volatile memory, and design a persistent heap with support for fast allocation and checkpointing of persistent objects. To achieve a fine-grained checkpoint, we scatter objects across virtual pages and rely on hardware page-protection to monitor the modifications. In our system, two objects in different virtual pages may reside on the same physical page. Modifying one object would not interfere with the other object. This allows us to monitor and checkpoint objects smaller than 4096 bytes in a fine-grained way. Compared with previous page-grained based checkpoint mechanisms, our new checkpoint method can greatly reduce the data copied at checkpoint time and better leverage the limited bandwidth of non-volatile memory.

关键词： Non-volatile memory Byte-persistency Persistent heap Fine-grained checkpoint

来源：评论

学校读者我要写书评

暂无评论

A Review of Indoor-Outdoor Scene Classification

A Review of Indoor-Outdoor Scene Classification

引用

2017 2nd International Conference on Control, Automation and Artificial Intelligence(CAAI2017)

作者： Zhehang Tong Dianxi Shi Bingzheng Yan Jing Wei National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology

ISBN: (纸本)9781510845541

Indoor-Outdoor scene classification problem have been proposed for almost 20 years and widely applied to general scene classification, image retrieval, image processing and robot application. But there is no consensus on one particular scene classification technique that can solve the Indoor-Outdoor scene classification problem perfectly. As larger image dataset has been developed and machine learning technology especially deep learning based methods achieve remarkable performance in computer vision, we aim to provide guidance and direction for researchers to tackle the Indoor-Outdoor scene classification problem with more powerful and robust solution through concluding the Indoor-Outdoor scene classification approaches which have been proposed in last 20 years. In this paper, we review the Indoor-Outdoor scene classification including feature extraction, classifier and related dataset. Their advantages and disadvantages are discussed. At last we conclude some challenging problems remain unsolved and propose some potential solutions.

关键词： indoor-outdoor scene classification computer vision

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：