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

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

来源：评论

学校读者我要写书评

暂无评论

Learning Two-Stream CNN for Multi-Modal Age-related Macular Degeneration Categorization

arXiv

引用

arXiv 2020年

作者： Wang, Weisen Li, Xirong Xu, Zhiyan Yu, Weihong Zhao, Jianchun Ding, Dayong Chen, Youxin The MoE Key Lab of Data Engineering and Knowledge Engineering Renmin University of China Beijing100872 China Aimc Lab School of Information Renmin University of China Beijing100872 China Vistel Ai Lab Visionary Intelligence Ltd. Beijing100872 China The Key Lab of Ocular Fundus Disease Chinese Academy of Medical Sciences Dept. of Ophthalmology Peking Union Medical College Hospital Beijing100730 China

This paper tackles automated categorization of Agerelated Macular Degeneration (AMD), a common macular disease among people over 50. Previous research efforts mainly focus on AMD categorization with a single-modal input, let it be a color fundus photograph (CFP) or an OCT B-scan image. By contrast, we consider AMD categorization given a multi-modal input, a direction that is clinically meaningful yet mostly unexplored. Contrary to the prior art that takes a traditional approach of feature extraction plus classifier training that cannot be jointly optimized, we opt for end-to-end multi-modal Convolutional Neural Networks (MM-CNN). Our MM-CNN is instantiated by a two-stream CNN, with spatially-invariant fusion to combine information from the CFP and OCT streams. In order to visually interpret the contribution of the individual modalities to the final prediction, we extend the class activation mapping (CAM) technique to the multi-modal scenario. For effective training of MM-CNN, we develop two data augmentation methods. One is GAN-based CFP/OCT image synthesis, with our novel use of CAMs as conditional input of a high-resolution image-to-image translation GAN. The other method is Loose Pairing, which pairs a CFP image and an OCT image on the basis of their classes instead of eye identities. Experiments on a clinical dataset consisting of 1,094 CFP images and 1,289 OCT images acquired from 1,093 distinct eyes show that the proposed solution obtains better F1 and Accuracy than multiple baselines for multimodal AMD categorization. Code and data are available at https://***/li-xirong/mmc-amd. Copyright © 2020, The Authors. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Nonlinear Cross-Domain Feature Representation Learning Method Based on Dual Constraints

Nonlinear Cross-Domain Feature Representation Learning Metho...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Han Ding Yuhong Zhang Shuai Yang Yaojin Lin 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 China Key Laboratory of Data Science and Intelligence Application Fujian Province University Zhangzhou China

Feature representation learning is a research focus in domain adaptation. Recently, due to the fast training speed, the marginalized Denoising Autoencoder (mDA) as a standing deep learning model has been widely utilized for feature representation learning. However, the training of mDA suffers from the lack of nonlinear relationship and does not explicitly consider the distribution discrepancy between domains. To address these problems, this paper proposes a novel method for feature representation learning, namely Nonlinear cross-domain Feature learning based Dual Constraints (NFDC), which consists of kernelization and dual constraints. Firstly, we introduce kernelization to effectively extract nonlinear relationship in feature representation learning. Secondly, we design dual constraints including Maximum Mean Discrepancy (MMD) and Manifold Regularization (MR) in order to minimize distribution discrepancy during the training process. Experimental results show that our approach is superior to several state-of-the-art methods in domain adaptation tasks.

关键词： Noise reduction Manifolds Training Adaptation models Kernel Deep learning Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Co-training Based on Semi-Supervised Ensemble Classification Approach for Multi-label data Stream

Co-training Based on Semi-Supervised Ensemble Classification...

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Zhe Chu Peipei Li Xuegang Hu Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education AnHui China School of Computer Science and Information Engineering Hefei University of Technology AnHui China

A large amount of data streams in the form of texts and images has been emerging in many real-world applications. These data streams often present the characteristics such as multi-labels, label missing and new class emerging, which makes the existing data stream classification algorithm face the challenges in precision space and time performance. This is because, on the one hand, it is known that data stream classification algorithms are mostly trained on all labeled single-class data, while there are a large amount of unlabeled data and few labeled data due to it is difficult to obtain labels in the real world. On the other hand, many of existing multi-label data stream classification algorithms mostly focused on the classification with all labeled data and without emerging new classes, and there are few semi-supervised methods. Therefore, this paper proposes a semi-supervised ensemble classification algorithm for multi-label data streams based on co-training. Firstly, the algorithm uses the sliding window mechanism to partition the data stream into data chunks. On the former w data chucks, the multi-label semi-supervised classification algorithm COINS based on co-training is used to training a base classifier on each chunk, and then an ensemble model with w COINS classifiers is generated ensemble model to adapt to the environment of data stream with a large number of unlabeled data. Meanwhile, a new class emerging detection mechanism is introduced, and the w+1 data chunk is predicted by the ensemble model to detect whether there is a new class emerging. When a new label is detected, the classifier is retrained on the current data chunk, and the ensemble model is updated. Finally, experimental results on five real data sets show that: as compared with the classical algorithms, the proposed approach can improve the classification accuracy of multi-label data streams with a large number of missing labels and new labels emerging.

关键词： data models Training Streaming media Adaptation models Partitioning algorithms Correlation knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

Research on Government Information Sharing Model Using Blockchain Technology

Research on Government Information Sharing Model Using Block...

引用

IEEE International Symposium on Information (IT) in Medicine and Education, ITME

作者： Yiwei Zhang Sanhong Deng Yue Zhang Jia Kong School of Information Management Nanjing University Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing China Nanjing University Nanjing China

Research Purpose: The distributed, traceable and security of blockchain technology are applicable to the construction of new government information resource models, which could eliminate the barn effect and trust in government information sharing, as well as promoting the transformation of government affairs from management to service, it is also of great significance to the sharing of government information and construction of service-oriented e-government. Propose Methods: By analyzing the current problems of government information sharing, combined with literature research, this paper proposes the theoretical framework and advantages of blockchain technology applied to government information management and sharing, expounds the blockchain-based solution, it also constructs a government information sharing model based on blockchain, and gives implementation strategies at the technical and management levels. Results and Conclusion: The government information sharing model based on the blockchain solution and the transparency of government information can be used as a research framework for information interaction analysis between the government and users. It can also promote the construction and development of information sharing for Chinese government, as well as providing unified information sharing solution at the departmental and regional levels for e-government.

关键词： Blockchain Information management Security Electronic government Information services data engineering

来源：评论

学校读者我要写书评

暂无评论

On dynamic time division duplex transmissions for small cell networks

arXiv

引用

arXiv 2020年

作者： Ding, Ming López-Pérez, David Xue, Ruiqi Vasilakos, Athanasios V. Chen, Wen Data 61 Australia Bell Labs Alcatel- Lucent Ireland Shanghai Jiao Tong University China Department of Computer Science Electrical and Space Engineering Lule17University of Technology Sweden Shanghai Key Lab of Navigation and Location Based Services Shanghai Jiao Tong University School of Electronic Engineering and Automation Guilin University of Electronic Technology China

Motivated by the promising benefits of dynamic Time Division Duplex (TDD), in this paper, we use a unified framework to investigate both the technical issues of applying dynamic TDD in homogeneous small cell networks (HomSCNs), and the feasibility of introducing dynamic TDD into heterogeneous networks (HetNets). First, HomSCNs are analyzed, and a small cell BS scheduler that dynamically and independently schedules DL and UL subframes is presented, such that load balancing between the DL and the UL traffic can be achieved. Moreover, the effectiveness of various inter-link interference mitigation (ILIM) schemes as well as their combinations, is systematically investigated and compared. Besides, the interesting possibility of partial interference cancellation (IC) is also explored. Second, based on the proposed schemes, the joint operation of dynamic TDD together with cell range expansion (CRE) and almost blank subframe (ABS) in HetNets is studied. In this regard, scheduling polices in small cells and an algorithm to derive the appropriate macrocell traffic off-load and ABS duty cycle under dynamic TDD operation are proposed. Moreover, the full IC and the partial IC schemes are investigated for dynamic TDD in HetNets. The user equipment (UE) packet throughput performance of the proposed/discussed schemes is benchmarked using system-level simulations. Copyright © 2020, The Authors. All rights reserved.

关键词： Heterogeneous networks

来源：评论

学校读者我要写书评

暂无评论

Machine Memory Intelligence: Inspired by Human Memory Mechanisms

引用

engineering 2025年

作者： Qinghua Zheng Huan Liu Xiaoqing Zhang Caixia Yan Xiangyong Cao Tieliang Gong Yong-Jin Liu Bin Shi Zhen Peng Xiaocen Fan Ying Cai Jun Liu School of Computer Science and Technology Xi’an Jiaotong University Xi’an 710049 China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an 710049 China Translational Research Institute of Brain and Brain-Like Intelligence Shanghai Fourth People’s Hospital Shanghai 200434 China School of Medicine Tongji University Shanghai 200092 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Department of Computer Science Iowa State University Ames IA 50011 USA

Large models, exemplified by ChatGPT, have reached the pinnacle of contemporary artificial intelligence (AI). However, they are plagued by three inherent drawbacks: excessive training data and computing power consumption, susceptibility to catastrophic forgetting, and a deficiency in logical reasoning capabilities within black-box models. To address these challenges, we draw insights from human memory mechanisms to introduce “machine memory,” which we define as a storage structure formed by encoding external information into a machine-representable and computable format. Centered on machine memory, we propose the brand-new machine memory intelligence (M 2 I) framework, which encompasses representation, learning, and reasoning modules and loops. We explore the key issues and recent advances in the four core aspects of M 2 I, including neural mechanisms, associative representation, continual learning, and collaborative reasoning within machine memory. M 2 I aims to liberate machine intelligence from the confines of data-centric neural networks and fundamentally break through the limitations of existing large models, driving a qualitative leap from weak to strong AI.

关键词： Machine memory intelligence Neural mechanism Associative representation Continual learning Collaborative reasoning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Poisoning attack against estimating from pairwise comparisons

arXiv

引用

arXiv 2021年

作者： Ma, Ke Xu, Qianqian Zeng, Jinshan Cao, Xiaochun Huang, Qingming The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen518055 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer and Information Engineering Jiangxi Normal University Jiangxi Nanchang330022 China Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China The School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Big Data Mining and Knowledge Management The School of Economics and Management University of Chinese Academy of Sciences Beijing100049 China

As pairwise ranking becomes broadly employed for elections, sports competitions, recommendation, information retrieval and so on, attackers have strong motivation and incentives to manipulate or disrupt the ranking list. They could inject malicious comparisons into the training data to fool the target ranking algorithm. Such a technique is called "poisoning attack" in regression and classification tasks. In this paper, to the best of our knowledge, we initiate the first systematic investigation of data poisoning attack on the pairwise ranking algorithms, which can be generally formalized as the dynamic and static games between the ranker and the attacker, and can be modeled as certain kinds of integer programming problems mathematically. To break the computational hurdle of the underlying integer programming problems, we reformulate them into the distributionally robust optimization (DRO) problems, which are computational tractable. Based on such DRO formulations, we propose two efficient poisoning attack algorithms and establish the associated theoretical guarantees including the existence of Nash equilibrium and the generalization ability bounds. The effectiveness of the suggested poisoning attack strategies is demonstrated by a series of toy simulations and several real data experiments. These experimental results show that the proposed methods can significantly reduce the performance of the ranker in the sense that the correlation between the true ranking list and the aggregated results with toxic data can be decreased dramatically. © 2021, CC BY-NC-ND.

关键词： Toys

来源：评论

学校读者我要写书评

暂无评论

Trajectory simplification: An experimental study and quality analysis 44th

Trajectory simplification: An experimental study and quality...

引用

44th International Conference on Very Large data Bases, VLDB 2018

作者： Zhang, Dongxiang Ding, Mengting Yang, Dingy Liu, Yi Fan, Ju Shen, Heng Tao Center for Future Media School of Computer Science and Engineering UESTC China School of Electronics and Information Shanghai Dian Ji University China The Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

The ubiquitousness of GPS sensors in smart-phones, vehicles and wearable devices has enabled the collection of massive volumes of trajectory data from tracing moving objects. Consequently, an unprecedented scale of timestamped GPS data has been generated and posed an urgent demand for an effective storage mechanism for trajectory databases. The mainstream compression technique is called trajectory simplification, that finds a subsequence to approximate the original trajectory and attempts to minimize the information loss under a distance measure. Even though various simplification algorithms have been proposed in the past decades, there still lacks a thorough comparison to cover all the state-of-the-art algorithms and evaluate their quality using datasets in diversified motion patterns. Hence, it still remains a challenge for GPS data collectors to determine a proper algorithm in a concrete application. In addition, almost the entire line of previous methods uses error-based metrics to evaluate the compression quality, while ignoring their usability in supporting spatio-temporal queries on top of the reduced database. To bridge these gaps, we conduct so far the most comprehensive evaluation on trajectory simplification techniques. We compare the performance of 25 algorithms in total using five real datasets in different motion patterns. According to the experimental findings, we present useful guidance for the selection or development of effective trajectory simplification algorithms. © VLDB Endowment 21508097/18/05

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：