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

International Conference on Information Technology and Computer Application Engineering, ITCAE 2014

作者： Wu, Xiao Dong Zeng, Yu Zhu Zhao, C.T. Faculty of Mathematics and Computer Science Quanzhou Normal University China Fujian Provincial Key Laboratory of Data Intensive Computing China Key Laboratory of Intelligent Computing and Information Processing Fujian Province University China

ISBN: (纸本)9781138027176

Hadoop MapReduce has been proven an effective computing model to deal with big data for the last few years. However, one technical challenge facing this framework is how to predict the execution time of an individual job. In this paper, we propose a regression-based method to predict the execution times of Hadoop jobs. The proposed prediction method consists of three phases: learning data sampling, regression analysis and making prediction. Experimental results show that the predicted execution time obtained by our method is close to the actual execution time. © 2015 Taylor & Francis Group, London.

关键词： Regression analysis

来源：评论

学校读者我要写书评

暂无评论

Encoding-Aware data Placement for Efficient Degraded Reads in XOR-Coded Storage Systems

Encoding-Aware Data Placement for Efficient Degraded Reads i...

引用

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

来源：评论

学校读者我要写书评

暂无评论

Automatic salient object segmentation via shape prior based active contour model

引用

ICIC Express Letters, Part B: Applications 2016年第11期7卷 2491-2496页

作者： Gao, Shangbing Zhang, Youdong Zhou, Jun Zheng, Hao The Key Laboratory for Traffic and Transportation Security of Jiangsu Province Faculty of Computer and Software Engineering No. 1 Meicheng Rd. Huai’an223003 China Jiangsu Provincial Key Laboratory for Advanced Manufacturing Technology Huaiyin Institute of Technology No. 1 Meicheng Rd. Huai’an223003 China Key Laboratory of Trusted Cloud Computing and Big Data Analysis Nanjing Xiaozhuang University No. 3601 Hongjing Ave. Jiangning Dist. Nanjing211171 China

In this paper, we propose a novel model for unsupervised segmentation of viewer's attention object from natural images based on localizing region-based active con-tour (LRAC). Firstly, we proposed the saliency detection model via the multi-scale super-pixel. Then, object-level shape prior is extracted combining saliency with object boundary information. Finally, this contour is improved by the edge-preserving to generate the initial contour for our automatic object segmentation system. In contrast with localiz-ing region-based active contours that require considerable user interaction, the proposed method does not require it, i.e., the segmentation task is ful_lled in a fully automatic manner. Extensive experiments results on a large variety of natural images demonstrate that our algorithm consistently outperforms the popular existing salient object segmenta-tion methods, yielding higher precision and better recall rates. © 2016 ICIC International.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

The analysis of big data application mode and security risk

The analysis of big Data application mode and security risk

引用

International Conference on Information Sciences,Machinery,Materials and Energy（ICISMME 2015）

作者： ZENG Tai-sheng Faculty of Mathematics and Computer Science Quanzhou Normal University Fujian Provincial Key Laboratory of Data Intensive Computing Key Laboratory of Intelligent Computing and Information Processing Fujian Province University

ISBN: (纸本)9789462520677

In the current social background,Existing facilities and tools already can not meet the needs of big data in expanding and analysis ***'s data storage and analysis work is achieved under cloud conditions and Hadoop were set *** the conditions for cloud computing,cloud computing applications who have remote data files were not authorized to read its contents,which results in unauthorized manipulation,and it will produce a lot of security risks for large *** this paper,according to the cloud of different modes,Hadoop different stages of the operation,subject to the threat of non- confidence and security to steal big data generated to analyze a variety of privacy,with threat model as an example,it explores ways to address security threats.

关键词： big data security analysis Hadoop

来源：评论

学校读者我要写书评

暂无评论

Price learning based load distribution strategies for demand response management in smart grid

引用

International Journal of Smart Home 2016年第11期10卷 79-94页

作者： Tang, Qiang Xie, Ming-Zhong Yang, Kun Luo, Yuan-Sheng Li, Ping Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha Hunan Province410114 China School of Computer and Communication Engineering Changsha University of Science and Technology Changsha China School of Computer Science and Electronic Engineering University of Essex Colchester United Kingdom

In this paper, a Price learning based Load Distribution Strategy (PLDS) is proposed at first. In PLDS model, Smart Power Service, Utility Company and History Load Curves are included, and by considering both the average electricity consumption cost and the average electricity consumption habit, we proposed a convex optimization model to solve the model. In order to accelerate the convergence of PLDS, a price learning mechanism is proposed, which learns a price curve according to the history price data, and predicts price as a learned price for the next iteration. The optimization cycle of PLDS is one day or 24 hours, and in order to further improve the peak shaving performance, an extended version of PLDS named PLRS (Price learning based Load Redistribution Strategy) is proposed, whose optimization cycle length is 1 hour. The optimization models of PLDS and PLRS are the same, and the differences between them are the optimization cycle and the constraint conditions. In the simulation, we compared the convergence performance, peaking shaving performance and total cost among PLDS, PLRS and other strategy ODC in reference [11], and we found that the convergence performances of PLDS and PLRS are both better than that of ODC. The peak shaving performance of PLRS is better than that of ODC in the long term, and the total cost of PLRS is very close to that of ODC. © 2016 SERSC.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Simulate Human Saccadic Scan-Paths in Target Searching

引用

International Journal of Intelligence Science 2016年第1期6卷 1-9页

作者： Lijuan Duan Jun Miao David M. W. Powers Jili Gu Laiyun Qing Beijing Key Laboratory of Trusted Computing Beijing Key Laboratory on Integration and Analysis of Large-Scale Stream Data College of Computer Science and Technology Beijing University of Technology Beijing China National Engineering Laboratory for Critical Technologies of Information Security Classified Protection Beijing China Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences(CAS) Institute of Computing Technology CAS Beijing China School of Computer Science Engineering & Maths Flinders University of South Australia Adelaide South Australia Beijing Samsung Telecom R&D Center Beijing China University of Chinese Academy of Sciences Beijing China

Human saccade is a dynamic process of information pursuit. There are many methods using either global context or local context cues to model human saccadic scan-paths. In contrast to them, this paper introduces a model for gaze movement control using both global and local cues. To test the performance of this model, an experiment is done to collect human eye movement data by using an SMI iVIEW X Hi-Speed eye tracker with a sampling rate of 1250 Hz. The experiment used a two-by-four mixed design with the location of the targets and the four initial positions. We compare the saccadic scan-paths generated by the proposed model against human eye movement data on a face benchmark dataset. Experimental results demonstrate that the simulated scan-paths by the proposed model are similar to human saccades in term of the fixation order, Hausdorff distance, and prediction accuracy for both static fixation locations and dynamic scan-paths.

关键词： Saccadic Scan-Paths Eye Movement Fixation Locations Dynamic Scan-Paths

来源：评论

学校读者我要写书评

暂无评论

Enhancing Time Series Clustering by Incorporating Multiple Distance Measures with Semi-Supervised Learning

引用

Journal of Computer Science & Technology 2015年第4期30卷 859-873页

作者：周竞朱山风黄晓地张彦春 School of Computer Science Fudan University Shanghai 200433 China Shanghai Key Laboratory of Intelligent Information Processing Fudan University Shanghai 200433 China School of Computing and Mathematics Charles Sturt University Albury NSW 2640 Australia School of Engineering and Science Victoria University Melbourne Victoria 8001 Australia Shanghai Key Laboratory of Data Science Fudan University Shanghai 201203 China

Time series clustering is widely applied in various areas. Existing researches focus mainly on distance measures between two time series, such as dynamic time warping （DTW） based methods, edit-distance based methods, and shapelets-based methods. In this work, we experimentally demonstrate, for the first time, that no single distance measure performs significantly better than others on clustering datasets of time series where spectral clustering is used. As such, a question arises as to how to choose an appropriate measure for a given dataset of time series. To answer this question, we propose an integration scheme that incorporates multiple distance measures using semi-supervised clustering. Our approach is able to integrate all the measures by extracting valuable underlying information for the clustering. To the best of our knowledge, this work demonstrates for the first time that the semi-supervised clustering method based on constraints is able to enhance time series clustering by combining multiple distance measures. Having tested on clustering various time series datasets, we show that our method outperforms individual measures, as well as typical integration approaches.

关键词： time series analysis clustering dynamic programming information search and retrieval

来源：评论

学校读者我要写书评

暂无评论

Neighborhood collaborative classifiers

Neighborhood collaborative classifiers

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Suping Xu Xibei Yang Eric C. C. Tsang Eric A. Mantey Intelligent Information Processing Key Laboratory of Shanxi Province Shanxi University Taiyuan China School of Computer Science and Engineering Jiangsu University of Science and Technology Zhenjiang China Key Laboratory of Oceanographic Big Data Mining & Application of Zhejiang Province Zhejiang Ocean University Zhoushan China School of Economics and Management Nanjing University of Science and Technology Nanjing China Faculty of Information Technology Macau University of Science and Technology Macau China

ISBN: (纸本)9781509003914

In neighborhood rough set model, the majority rule based neighborhood classifier (NC) is easy to be misjudged with the increasing of the size of information granules. To remedy this deficiency, we propose a neighborhood collaborative classifier (NCC) based on the idea of collaborative representation based classification (CRC). NCC first performs feature selection with neighborhood rough set, and then instead of solving the classification problem by the majority rule, NCC solves a similar problem with collaborative representation among the neighbors of each unseen sample. Experiments on UCI data sets demonstrate that: 1) Our NCC achieves satisfactory performance in larger neighborhood information granules when compared with NC; 2) NCC reduces the size of dictionary when compared with CRC.

关键词： Collaboration Rough sets Training Cybernetics Numerical models Error analysis Measurement

来源：评论

学校读者我要写书评

暂无评论

A MapReduce Optimization Method on Hadoop Cluster

A MapReduce Optimization Method on Hadoop Cluster

引用

International Conference on Industrial Informatics - computing Technology, intelligent Technology, Industrial Information Integration

作者： Xiaodong Wu Faculty of Mathematics and Computer Science Quanzhou Normal University Fujian Provincial Key Laboratory of Data Intensive Computing Key Laboratory of Intelligent Computing and Information Processing Fujian Province University

ISBN: (纸本)9781467383134

The MapReduce parallel and distributed computing framework has been widely applied in both academia and industry. MapReduce applications are divided into two steps: Map and Reduce. Then, the input data is divided into splits, which can be concurrently processed, and the amount of the splits determines the number of map tasks. In this paper, we present a regression-based method to compute the number of Map tasks as well as Reduce tasks such that the performance of the MapReduce application can be improved. The regression analysis is used to predict the executing time of MapReduce applications. Experimental results show that the proposed optimization method can effectively reduce the execution time of the applications.

关键词： MapReduce Hadoop Optimization Polynomial Regression

来源：评论

学校读者我要写书评

暂无评论

Parallel knowledge acquisition algorithm for big data using MapReduce

Parallel knowledge acquisition algorithm for big data using ...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Jin Qian Min Xia Ping Lv Jiangsu Key Laboratory of Big Data Analysis Technology/B-DAT Nanjing University of Information Science & Technology Nanjing China Key Laboratory of Cloud Computing and Intelligent Information Processing of Changzhou City Jiangsu University of Technology Changzhou China

ISBN: (纸本)9781467372220

With the rapid growth of data volume, knowledge acquisition for big data has become a new challenge. To address this issue, the hierarchical decision table is defined and implemented in this work. The properties of different hierarchical decision tables are discussed under the different granularity of conditional attributes. A novel knowledge acquisition algorithm for big data using MapReduce is proposed. Experimental results demonstrate that the proposed algorithm is able to deal with big data and mine hierarchical decision rules under the different granularity.

关键词： big data Hierarchical Rough Set Knowledge Acquisition MapReduce big data Information Extraction Decision tables

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：