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

ALOR: Adaptive layout optimization of raft groups for heterogeneous distributed key-value stores 1

15th IFIP International Conference on Network and Parallel Computing, NPC 2018

作者： Wang, Yangyang Chai, Yunpeng Wang, Xin Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing China School of Information Renmin University of China Beijing China College of Intelligence and Computing Tianjin University Tianjin China

ISBN: (数字)9783030056773

ISBN: (纸本)9783030056766

Many distributed key-value storage systems employ the simple and effective Raft protocol to ensure data consistency. They usually assume a homogeneous node hardware configuration for the underlying cluster and thus adopt even data distribution schemes. However, today’s distributed systems tend to be heterogeneous in nodes’ I/O devices due to the regular worn I/O device replacement and the emergence of expensive new storage media (e.g., non-volatile memory). In this paper, we propose a new data layout scheme called Adaptive Layout Optimization of Raft groups (ALOR), considering the hardware heterogeneity of the cluster. ALOR aims to optimize the data layout of Raft groups to achieve a better practical load balance, which leads to higher performance. ALOR consists of two components: leader migration in Raft groups and skewed data layout based on cold data migration. We conducted experiments on a practical heterogeneous cluster, and the results indicate that, on average, ALOR improves throughput by 36.89%, reduces latency and 99th percentile tail latency by 24.54% and 21.32%, respectively. © IFIP International Federation for Information Processing 2018.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Dense residual network: Enhancing global dense feature flow for character recognition

arXiv

引用

arXiv 2020年

作者： Zhang, Zhao Tang, Zemin Wang, Yang Zhang, Zheng Zhan, Choujun Zha, Zhengjun Wang, Meng School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei230009 China School of Computer Science and Technology Soochow University Suzhou215006 China Shenzhen China School of Computer South China Normal University Guangzhou510631 China Deparmtment of Computer Science and Technology University of Science and Technology of China Hefei China

Deep Convolutional Neural Networks (CNNs), such as Dense Convolutional Network (DenseNet), have achieved great success for image representation learning by capturing deep hierarchical features. However, most existing network architectures of simply stacking the convolutional layers fail to enable them to fully discover local and global feature information between layers. In this paper, we mainly investigate how to enhance the local and global feature learning abilities of DenseNet by fully exploiting the hierarchical features from all convolutional layers. Technically, we propose an effective convolutional deep model termed Dense Residual Network (DRN) for the task of optical character recognition. To define DRN, we propose a refined residual dense block (r-RDB) to retain the ability of local feature fusion and local residual learning of original RDB, which can reduce the computing efforts of inner layers at the same time. After fully capturing local residual dense features, we utilize the sum operation and several r-RDBs to construct a new block termed global dense block (GDB) by imitating the construction of dense blocks to adaptively learn global dense residual features in a holistic way. Finally, we use two convolutional layers to design a down-sampling block to reduce the global feature size and extract more informative deeper features. Extensive results show that our DRN can deliver enhanced results, compared with other related deep models. Copyright © 2020, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Endurable SSD-Based Read Cache for Improving the Performance of Selective Restore from Deduplication Systems

引用

Journal of Computer Science & Technology 2018年第1期33卷 58-78页

作者： Jian Liu Yun-Peng Chai Xiao Qin Yao-Hong Liu Division of Computer Science and Engineering Louisiana State University Baton Rouge LA 70803 U.S.A. Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education of China Beijing 100872 China School of Information Renmin University of China Beijing 100872 China Shelby Center for Engineering Technology Department of Computer Science and Software Engineering Samuel Ginn College of Engineering Auburn University Auburn AL 368~9-53~7 U.S.A.

Deduplication has been commonly used in both enterprise storage systems and cloud storage. To overcome the performance challenge for the selective restore operations of deduplication systems, solid-state-drive-based （i.e., SSD-based） re^d cache cm, be deployed for speeding up by caching popular restore contents dynamically. Unfortunately, frequent data updates induced by classical cache schemes （e.g., LRU and LFU） significantly shorten SSDs＇ lifetime while slowing down I/O processes in SSDs. To address this problem, we propose a new solution -- LOP-Cache to greatly improve tile write durability of SSDs as well as I/O performance by enlarging the proportion of long-term popular （LOP） data among data written into SSD-based cache. LOP-Cache keeps LOP data in the SSD cache for a long time period to decrease the number of cache replacements. Furthermore, it prevents unpopular or unnecessary data in deduplication containers from being written into the SSD cache. We implemented LOP-Cache in a prototype deduplication system to evaluate its pertbrmance. Our experimental results indicate that LOP-Cache shortens the latency of selective restore by an average of 37.3% at the cost of a small SSD-based cache with only 5.56% capacity of the deduplicated data. Importantly, LOP-Cache improves SSDs＇ lifetime by a factor of 9.77. The evidence shows that LOP-Cache offers a cost-efficient SSD-based read cache solution to boost performance of selective restore for deduplication systems.

关键词： data deduplication solid state drive （SSD） flash cache endurance

来源：评论

学校读者我要写书评

暂无评论

Automated vision inspection of rail surface cracks: A double-layer data driven framework 48

Automated vision inspection of rail surface cracks: A double...

引用

48th International Conference on Computers and Industrial engineering, CIE 2018

作者： Zhuang, Li Wang, Long Zhang, Zijun School of Data Science City University of Hong Kong Hong Kong Beijing100083 China Beijing Key Laboratory of Knowledge Engineering for Materials Science Beijing100083 China

A double-layer data-driven framework for the automated vision inspection of the rail surface cracks is proposed in this paper. Based on images of rails, the proposed framework is capable to detect the location of cracks firstly and next automatically obtain the boundary of cracks via a feature-based linear iterative crack aggregation (FLICA). Extended Haar-like features are applied to develop significant features for identifying cracks in images. Built on extended Haar-like features, a cascading classifier ensemble integrating three single cascading classifiers with a major voting scheme is proposed to decide the presence of cracks in the image. Each single cascading classifier is composed of a sequence of stage classifiers trained by the LogitBoost algorithm. A scalable sliding window carrying the cascading classifier ensemble is applied to scan images of rail tracks, which is identified by the Otsu’s method, and detect cracks. After completing the crack registration in the first layer, the FLICA is developed to discover boundaries of cracks. The effectiveness of the proposed data-driven framework for identifying rail surface cracks is validated with the rail images provided by the China Railway Corporation and Hong Kong Mass Transit Railway (MRT). Six benchmarking methods, the Otsu’s method, mean shift, the visual detection system, the geometrical approach, fully convolutional networks and the U-net, are utilized to prove advantages of the proposed framework. Results of the validation and comparative analyses demonstrate that the proposed framework is most effective in the rail surface crack detection. © 2018, Curran Associates Inc. All rights reserved.

关键词： Crack detection

来源：评论

学校读者我要写书评

暂无评论

An Optimization-Based Truth Discovery Method with Claim Relation

An Optimization-Based Truth Discovery Method with Claim Rela...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Jiazhu Xia Ying He Yuxin Jin Xianyu Bao Gongqing Wu Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Shenzhen Academy of Inspection and Quarantine Shenzhen China

With the advent of the era of big data, the information from multi-sources often conflicts due to that errors and fake information are inevitable. Therefore, how to obtain the most trustworthy or true information (i.e. truth) people need gradually becomes a troublesome problem. In order to meet this challenge, a novel hot technology named truth discovery that can infer the truth and estimate the reliability of the source without supervision has attracted more and more attention. However, most existing truth discovery methods only consider that the information is either same or different rather than the fine-grained relation between them, such as inclusion, support, mutual exclusion, etc. Actually, this situation frequently exists in real-world applications. To tackle the aforementioned issue, we propose a novel truth discovery method named OTDCR in this paper, which can handle the fine-grained relation between the information and infer the truth more effectively through modeling the relation. In addition, a novel method of processing abnormal values is applied to the preprocessing of truth discovery, which is specially designed for categorical data with the relation. Experiments in real dataset show our method is more effective than several outstanding methods.

关键词： Task analysis knowledge engineering Big data Crowdsourcing Reliability engineering Meteorology

来源：评论

学校读者我要写书评

暂无评论

Ensemble Classification Method Based on Truth Discovery

Ensemble Classification Method Based on Truth Discovery

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Yuxin Jin Ze Yang Ying He Xianyu Bao Gongqing Wu Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Shenzhen Academy of Inspection and Quarantine Shenzhen China

Classification is a hot topic in such fields as machine learning and data mining. The traditional approach of machine learning is to find a classifier closest to the real classification function, while ensemble classification is to integrate the results of base classifiers, then make an overall prediction. Compared to using a single classifier, ensemble classification can significantly improve the generalization of the learning system in most cases. However, the existing ensemble classification methods rarely consider the weight of the classifier, and there are few methods to consider updating the weights dynamically. In this paper, we are inspired by the idea of truth discovery and propose a new ensemble classification method based on the truth discovery (named ECTD). As far as we know, we are the first to apply the idea of truth discovery in the field of ensemble learning. Experimental results demonstrate that the proposed method performs well in ensemble classification.

关键词： Reliability Machine learning Classification algorithms Task analysis Buildings Computational modeling knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

Consensus with Voting Theory in Blockchain Environments

Consensus with Voting Theory in Blockchain Environments

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Lei Li Yongkang Jiang Guanfeng Liu Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Computing Department Macquarie University Sydney Australia

A blockchain can be taken as a decentralized and distributed public database. In order to achieve data consistency of the system nodes, the execution of a consensus algorithm is necessary and required in the case of decentralized environments. Simply speaking, the consensus is that every node agrees on some record in the blockchain. There are many kinds of consensus algorithms in blockchain environments, and each consensus algorithm has its own proper application scenario. Here we firstly analysis and compare various popular consensus algorithms in blockchain environments, and then as voting theory has systematically studied the decision-making in a group, the traditional methods of voting theory is summarized and listed, including (Position) scoring rules, Copeland, Maximin, Ranked pairs, Voting trees, Bucklin, Plurality with runoff, Single transferable vote, Baldwin rule, and Nanson rule. Finally, we introduce the voting methods from voting theory to consensus algorithms in the blockchain to improve its performance.

关键词： Blockchain Consensus algorithm Bitcoin Voting knowledge engineering Computer science Decision making

来源：评论

学校读者我要写书评

暂无评论

CitationAS： A Tool of Automatic Survey Generation Based on Citation Content

引用

Journal of data and Information Science 2018年第2期3卷 20-37页

作者： jie wang chengzhi zhang mengying zhang sanhong deng School of Information Management Nanjing University Nanjing 210023 China Department of Information Management Nanjing University of Science and Technology Nanjing 210094 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing University Nanjing 210023 China

Purpose： This study aims to build an automatic survey generation tool, named CitationAS, based on citation content as represented by the set of citing sentences in the original ***/methodology/approach： Firstly, we apply LDA to analyse topic distribution of citation content. Secondly, in CitationAS, we use bisecting K-means, Lingo and STC to cluster retrieved citation content. Then Word2Vec, Word Net and combination of them are applied to generate cluster labels. Next, we employ TF-IDF, MMR, as well as considering sentence location information, to extract important sentences, which are used to generate surveys. Finally, we adopt manual evaluation for the generated ***： In experiments, we choose 20 high-frequency phrases as search terms. Results show that Lingo-Word2Vec, STC-Word Net and bisecting K-means-Word2Vec have better clustering effects. In 5 points evaluation system, survey quality scores obtained by designing methods are close to 3, indicating surveys are within acceptable limits. When considering sentence location information, survey quality will be improved. Combination of Lingo, Word2Vec, TF-IDF or MMR can acquire higher survey *** limitations： The manual evaluation method may have a certain subjectivity. We use a simple linear function to combine Word2Vec and Word Net that may not bring out their strengths. The generated surveys may not contain some newly created knowledge of some articles which may concentrate on sentences with no *** implications： CitationAS tool can automatically generate a comprehensive, detailed and accurate survey according to user’s search terms. It can also help researchers learn about research status in a certain ***/value： Citaiton AS tool is of practicability. It merges cluster labels from semantic level to improve clustering results. The tool also considers sentence location information when calculating sentence score by TF-IDF and MMR.

关键词： Automatic survey system Citation content Clustering algorithms Labelgeneration approaches Sentence extraction methods

来源：评论

学校读者我要写书评

暂无评论

The Second-order h-type Indicators for Identifying Top Units

引用

data and Information Management 2018年第1期2卷 49-56页

作者： Ye, Fred Y. Bornmann, Lutz School of Information Management Nanjing University 210023 Nanjing China Jiangsu Key Laboratory of Data Engineering and Knowledge Service 210023 Nanjing China Administrative Headquarters of the Max Planck Society Division for Science and Innovation Studies Hofgartenstr. 8 D-80539 Munich Germany

The second-order h-type indicators are suggested to identify top units in scientometrics. Basically, the re-ranking of h-type series leads to the second-order h-type indicator. The second-order h-type indicators provide an interesting and natural method to identify top units, yielding fixed h-top. Differentiating from the series of artificially defined highly cited percentile classes, the h-top contributes a natural definite top in the series of highly cited classes. When studying theoretically, the second-order h-index concerns 3% of the h-top whereas the first-order h-index refers to 10% of the h-core. The ratio of the first- and second-order h-index, hT/h, is 30%. When studying empirically, the ratio of the first- and second-order h-index, hT/h, is © 2018 © 2018 Fred Y. Ye, Lutz Bornmann, published by Sciendo

关键词： Indexing (of information)

来源：评论

学校读者我要写书评

暂无评论

Single Object Tracking for Dynamic Programming based on Fine-grained Network

引用

Journal of Physics: Conference Series 2020年第1期1576卷

作者： Jianguo Jiang Kaiyuan Jin Jingjing Wu Meibin Qi Qian Wang Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei 230601 China

Single target tracking has always been a key and challenging research field in computer vision. Currently, an increasing number of researchers are focusing on extracting better tracking features and designing the best tracker. This paper proposes a new single target tracking network that uses fine-grained features and dynamic programming (DPFNet). In order to extract superior features, we added an attention module to the regression network enabling us to extract finer-grained and discriminative features to achieve regression. Besides, we did observe that different objects have varying moving rates; for different moving targets, the magnitude of the changes in target position within two adjacent frames is not the same either. Although an area search of 4 times the target's size can be applied to most objects, targets with large position changes may appear in other image areas outside the search area and the target would not be located as a result. Aiming at solving this problem, when designing the tracker, this paper analyzes some of the indicators for predicting the location and uses the analysis results to determine whether the search area is appropriate, so as to dynamically adjust the extent of the search area thereby significantly improving the tracking function. In other words, the size of the search area can be dynamically recalibrated for different images. Subsequent experiments prove that the method put forward in this paper achieves State-of-the-Art results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：