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

Reliable Distributed Systems

作者： Zhirong Shen Patrick P.C. Lee Jiwu Shu Wenzhong Guo College of Mathematics and Computer Science Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China Department of Computer Science and Engineering The Chinese University of Hong Kong Department of Computer Science and Technology Tsinghua University Key Laboratory of Spatial Data Mining and Information Sharing Minstry of Education Fuzhou China

ISBN: (纸本)9781509035144

Erasure coding has been increasingly used by distributed storage systems to maintain fault tolerance with low storage redundancy. However, how to enhance the performance of degraded reads in erasure-coded storage has been a critical issue. We revisit this problem from two different perspectives that are neglected by existing studies: data placement and encoding rules. To this end, we propose an encoding-aware data placement (EDP) approach that aims to reduce the number of I/Os in degraded reads during a single failure for general XOR-based erasure codes. EDP carefully places sequential data based on the encoding rules of the given erasure code. Trace-driven evaluation results show that compared to two baseline data placement methods, EDP reduces up to 37.4% of read data on the most loaded disk and shortens up to 15.4% of read time.

关键词： Encoding Distributed databases Layout Fault tolerant systems Redundancy Computer science

来源：评论

学校读者我要写书评

暂无评论

Color Image Segmentation Based on Modified Kuramoto Model

引用

Procedia Computer science 2016年 88卷 245-258页

作者： Xiaojie Liu Yuanhua Qiao Xianghui Chen Jun Miao Lijuan Duan College of Applied Sciences Beijing University of Technology Beijing 100124 China Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing 100190 China College of Computer Science and Technology Beijing University of Technology Beijing 100124 China

A new approach for color image segmentation is proposed based on Kuramoto model in this paper. Firstly, the classic Kuramoto model which describes a global coupled oscillator network is changed to be one that is locally coupled to simulate the neuron activity in visual cortex and to describe the influence for phase changing by external stimuli. Secondly, a rebuilt method of coupled neuron activities is proposed by introducing and computing instantaneous frequency. Three oscillating curves corresponding to the pixel values of R, G, B for color image are formed by the coupled network and are added up to produce the superposition of oscillation. Finally, color images are segmented according to the synchronization of the oscillating superposition by extracting and checking the frequency of the oscillating curves. The performance is compared with that from other representative segmentation approaches.

关键词： Kuramoto model Neural Network Color image segmentation

来源：评论

学校读者我要写书评

暂无评论

REVERSIBLE DATA HIDING IN ENCRYPTED IMAGE BASED ON BLOCK HISTOGRAM SHIFTING

REVERSIBLE DATA HIDING IN ENCRYPTED IMAGE BASED ON BLOCK HIS...

引用

IEEE International Conference on Acoustics, Speech and Signal processing

作者： Zhaoxia Yin Andrew Abel Xinpeng Zhang Bin Luo School of Communication and Information Engineering Shanghai University Shanghai 200072 P.R. China. Computing Science and Mathematics University of Stirling. Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei 230601 P.R. China.

ISBN: (纸本)9781479999897

Since there is good potential for practical applications such as encrypted image authentication, content owner identification and privacy protection, reversible data hiding in encrypted image (RDHEI) has attracted increasing attention in recent years. In this paper, we propose and evaluate a new separable RDHEI framework. Additional data can be embedded into a cipher image previously encrypted using Josephus traversal and a stream cipher. A block histogram shifting (BHS) approach using self-hidden peak pixels is adopted to perform reversible data embedding. Depending on the keys held, legal receivers can extract only the embedded data with the data hiding key, or, they can decrypt an image very similar to the original with the decryption key. They can extract both the embedded data and recover the original image error-free if both keys are available. The results demonstrate that higher embedding payload, better quality of decrypted-marked image and error-free image recovery are achieved.

关键词： Signal processing in encrypted domain (SPED) Reversible data hiding in encrypted images (RDHEI) Privacy protection Hidden data images Keys Keys Cays Imagery (Psychotherapy) embedding Image Error-free operations Locks

来源：评论

学校读者我要写书评

暂无评论

Online hot event discovery based on Association Link Network

Online hot event discovery based on Association Link Network

引用

作者： Liu, Yang Luo, Xiangfeng Xuan, Junyu School of Computer Engineering and Science Shanghai University China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Science Beijing China

Online hot event discovery has become a flourishing frontier where online document streams are monitored to discover newly occurring events or assigned to previously detected events. However, hot events have the nature to evolve, and their inherent topically related words are also likely to evolve. It makes event discovery a challenging task for traditional-mining approaches. Combining word association and semantic community, Association Link Network (ALN) organizes the loosely distributed associated resources. This paper presents an ALN-based novel online hot event discovery approach. Technically, this approach is enacted around three stages. In the first stage, we extract significant features to represent the content of each document from the online document stream. During the second stage, we classify the online document stream into topically related detected events considering event evolution in the form of ALN. At the third stage, we create an ALN-based event detection algorithm, which is used to timely discover newly occurring hot events. The online datasets used in our empirical studies are acquired from Baidu News, which spans a range of 1315 hot events and 236,300 documents. Experimental results demonstrate the hot events discovery ability with respect to high accuracy, good scalability, and short runtime. © 2015 John Wiley & Sons, Ltd.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Classification Based on Multilayer Extreme Learning Machine for Motor Imagery Task from EEG Signals

引用

Procedia Computer science 2016年 88卷 176-184页

作者： Lijuan Duan Menghu Bao Jun Miao Yanhui Xu Juncheng Chen College of Computer Science and Technology Beijing University of Technology Beijing 100124 China Beijing Key Laboratory of Trusted Computing National Engineering Laboratory for Critical Technologies of Information Security Classified Protection Beijing 100124 China Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing 100190 China Beijing Key Laboratory on Integration and Analysis of Large-scale Stream Data Beijing 100124 China

Classification of motor imagery electroencephalogram (EEG) is one of the most important technologies for BCI. To improve the accuracy, this paper introduces a classification system based on Multilayer Extreme Learning Machine (ML-ELM). In the system, the combination of PCA and LDA is chosen as the method of feature extraction and the ML-ELM is used to classify. The ML-ELM has not only the advantage which ELM has but also better performance than ELM. In the experiment, our method is compared with the methods based on ELM, such as kernel-ELM, Constrained-ELM and V-ELM, and some state-of–the-art methods on the same dataset. The experimental results show that ML-ELM is much more suitable for motor imagery EEG data and has better performance than the others.

关键词： Electroencephalogram Classification Motor Imagery Extreme Learning Machine Multilayer Extreme Learning Machine

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient VM placement algorithms for cloud data center 2nd

Energy-efficient VM placement algorithms for cloud data cent...

引用

2nd International Conference on Cloud computing and Big Data, CloudCom-Asia 2015

作者： Lin, Xiuyan Liu, Zhanghui Guo, Wenzhong Fujian Provincial Key Lab of the Network Computing and Intelligent Information Processing College of Mathematics and Computer Science Fuzhou University Fuzhou350116 China

ISBN: (纸本)9783319284293

Cloud is the computing paradigm which provides computing resource as a service through network. The client can use computing resource in a convenient and on-demand way, just like the water and the electricity we use daily. The mapping between virtual machine and physical machine is the key of the VM scheduling problem. Nowadays we advocate low-carbon life. It calls for the green cloud computing solutions whether protecting the environment or saving the cost of cloud suppliers. The proposed VM placement algorithm is energy-efficient, and considers the multi-dimentional resource constrains, such as CPU, memory, network bandwidth, and so on. The experimental results show that the proposed algorithms not only contribute a lot to energy saving, but also try best to meet the quality of service (QoS). Therefore, we make significant savings in operating cost and make full use of various resources in the cloud data center. The algorithm has promising prospect in application. © Springer International Publishing Switzerland 2015.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

An integratable verifiable secret sharing mechanism

引用

International Journal of Network Security 2016年第4期18卷 617-624页

作者： Liu, Yanjun Chang, Chin-Chen Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University No. 111 Jiulong Rd Hefei230601 China Department of Computer Science and Information Engineering Asia University No. 500 Lioufeng Rd Wufeng Taichung413 Taiwan Department of Information Engineering and Computer Science Feng Chia University No. 100 Wenhwa Rd Seatwen Taichung413 Taiwan

Threshold secret sharing (SS), also denoted as (t, n) SS, has been used extensively in the area of information se- curity, such as for group authentication, cloud storage schemes, secure parallel communication and wireless mul- tipath routing protocols. However, a (t, n) SS cannot de- tect any deceptions among the dealer and shareholders. Veriable secret sharing (VSS) overcomes the weakness of (t, n) SS in such a way that it is able to detect cheaters by verifying the validity of shares or the correctness of the recovered secret under the condition that both shares and the secret are not compromised. Recently, two non- interactive VSSs based on Asmuth-Bloom's SS were pro- posed by Harn et al. and Liu et al., respectively. Both VSSs require shareholders to examine the range of values of some integers related to the secret before recovering the secret, which is a time-consuming operation. In this paper, we propose a novel integratable VSS mechanism that integrates the concepts of the generalized Chinese remainder theorem (GCRT), Shamir's SS and Asmuth- Bloom's SS. Our proposed VSS can verify that the secret reconstructed by any t or more shareholders is the same as the one that the dealer has generated. Analysis shows that our proposed VSS can provide perfect secrecy and better efficiency.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Image authentication and self-recovery scheme based on the rehashing model

引用

Journal of information Hiding and Multimedia Signal processing 2016年第3期7卷 460-474页

作者： Lyu, Wan-Li Chang, Chin-Chen Wang, Feng Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei230039 China Department of Information Engineering and Computer Science Feng Chia University 100 Wenhwa Rd. Seatwen Taichung40724 Taiwan Department of Computer Science and Information Engineering Asia University Taichung41354 Taiwan Department of Mathematics and Physics Fujian University of Technology FuzhouFujian350108 China

An effective image tamper localization and self-recovery scheme that uses the rehashing model is proposed in this paper. The aim of the proposed scheme was to reduce the failure rate in detecting image tamper areas and achieve high rates of successful detection. To achieve this aim, the proposed scheme uses a set of hash functions which are called the rehashing model, gained an optimal decreasing collision method to detect tamper areas With an improved and accurate tamper detection rate, the tampered image can be recovered more accurately. The quality of the proposed scheme was tested with gray and color images. The experimental results indicated that the proposed scheme has good performance in locating tamper locations and allows image recovery with an acceptable visual quality up to 50% of the image content tampered. © 2016.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

An improved performance metric for multiobjective evolutionary algorithms with user preferences

An improved performance metric for multiobjective evolutiona...

引用

IEEE Congress on Evolutionary Computation, CEC 2015

作者： Yu, Guo Zheng, Jinhua Li, Xiaodong School of Information Engineering Xiangtan University Hunan China Key Laboratory of Intelligent Computing Information Processing of Ministry of Education China School of Computer Science and IT RMIT University Melbourne Australia

ISBN: (纸本)9781479974924

This paper proposes an improved performance metric for multiobjective evolutionary algorithms with user preferences. This metric uses the idea of decomposition to transform the preference information into m+1 points on a constructed preference-based hyperplane, then calculates the Euclidean distances and the angles between the obtained solutions by algorithms and those obtained m+1 points, respectively. By means of these distances and angles, the proposed metric can evaluate effectively both the convergence and diversity of the obtained solution set, with consideration of the preference information. This makes easier and allows meaningful comparisons between different multiobjective evolutionary algorithms using preference information. © 2015 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Multi-path SDN route selection subject to multi-constraints 3

Multi-path SDN route selection subject to multi-constraints

引用

3rd International Conference on Cyberspace Technology, CCT 2015

作者： Pan, Qingfeng Zheng, Xianghan College of Mathematics and Computer Science Fuzhou University Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350108 China

ISBN: (纸本)9781785610899

Multi-constrained optimal routing problem and disjoint path selection are NP-hard problem. The conventional single-path and single constraint routing can not meet people's needs. The reliability of network data transmission and packet loss rate can be decreased when the route or the transmission fails. To solve the problems, we need to study the routing path selection strategies. This paper optimizes the routing path that meets the QoS constraints under the SDN pre planning routing, and proposes a routing mechanism that can solve problems in polynomial time. Firstly, the paper combined with Clustering and Gauss algorithm to simulate the network simulation, obtain the initial experimental data. It can reflect the network status more accurately. Secondly, simplify the multi-objectives based on the AHP, It reduces the complexity of the problem and meets QoS requirements. Finally, select the disjoint communication paths and backup paths with the heuristic algorithms in order to balance the load of network and improve the transmission reliability. The selection mechanism can improve the efficiency of data transmission, and the survival of network communication.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：