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

arXiv 2025年

作者： Zhang, Wenzhen Cheng, Debo Lu, Guangquan Zhou, Bo Li, Jiaye Zhang, Shichao School of Computer Science and Engineering Guangxi Normal University Guangxi Guilin541004 China Guangxi Key Lab of Multi-Source Information Mining & Security Guangxi Normal University Guangxi Guilin541004 China Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guangxi Guilin541004 China UniSA STEM University of South Australia AdelaideSA5095 Australia Guangxi Collaborative Innovation Center of Modern Sericulture and Silk Hechi University Guangxi Hechi546300 China The State Key Laboratory of Blockchain and Data Security Zhejiang University Zhejiang Hangzhou310027 China

Deep neural networks are highly susceptible to overfitting noisy labels, which leads to degraded performance. Existing methods address this issue by employing manually defined criteria, aiming to achieve optimal partitioning in each iteration to avoid fitting noisy labels while thoroughly learning clean samples. However, this often results in overly complex and difficult-to-train models. To address this issue, we decouple the tasks of avoiding fitting incorrect labels and thoroughly learning clean samples and propose a simple yet highly applicable method called Adaptive label Refinement (ALR). First, inspired by label refurbishment techniques, we update the original hard labels to soft labels using the model’s predictions to reduce the risk of fitting incorrect labels. Then, by introducing the entropy loss, we gradually ‘harden’ the high-confidence soft labels, guiding the model to better learn from clean samples. This approach is simple and efficient, requiring no prior knowledge of noise or auxiliary datasets, making it more accessible compared to Copyright © 2025, The Authors. All rights reserved.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

MacroTrend: A Write-Efficient Cache Algorithm for NVM-Based Read Cache

引用

Journal of Computer Science & Technology 2022年第1期37卷 207-230页

作者： Ning Bao Yun-Peng Chai Xiao Qin Chuan-Wen Wang Key Laboratory of Data Engineering and Knowledge Engineering Ministry of EducationBeijing 100872China School of Information Renmin University of ChinaBeijing 100872China Samuel Ginn College of Engineering Auburn UniversityAlabama 36830U.S.A.

The future storage systems are expected to contain a wide variety of storage media and layers due to the rapid development of NVM(non-volatile memory)*** NVM-based read caches,many kinds of NVM devices cannot stand frequent data updates due to limited write endurance or high energy consumption of ***,traditional cache algorithms have to update cached blocks frequently because it is difficult for them to predict long-term popularity according to such limited information about data blocks,such as only a single value or a queue that reflects frequency or *** this paper,we propose a new MacroTrend(macroscopic trend)prediction method to discover long-term hot blocks through blocks'macro trends illustrated by their access count *** then a new cache replacement algorithm is designed based on the MacroTrend prediction to greatly reduce the write amount while improving the hit *** conduct extensive experiments driven by a series of real-world traces and find that compared with LRU,MacroTrend can reduce the write amounts of NVM cache devices significantly with similar hit ratios,leading to longer NVM lifetime or less energy consumption.

关键词： non-volatile memory(NVM) solid state disk(SSD) cache endurance

来源：评论

学校读者我要写书评

暂无评论

Attributes-based person re-identification via CNNs with coupled clusters loss

引用

Journal of Systems engineering and Electronics 2020年第1期31卷 45-55页

作者： SUN Rui HUANG Qiheng FANGWei ZHANG Xudong Key Laboratory of Knowledge Engineering with Big Data(Ministry of Education) Hefei University of TechnologyHefei 230601China School of Computer and Information Hefei University of TechnologyHefei 230601China

Person re-identification(re-id)involves matching a person across nonoverlapping views,with different poses,illuminations and *** attributes are understandable semantic information to help improve the issues including illumination changes,viewpoint variations and *** paper proposes an end-to-end framework of deep learning for attribute-based person *** the feature representation stage of framework,the improved convolutional neural network(CNN)model is designed to leverage the information contained in automatically detected attributes and learned low-dimensional CNN ***,an attribute classifier is trained on separate data and includes its responses into the training process of our person re-id *** coupled clusters loss function is used in the training stage of the framework,which enhances the discriminability of both types of *** combined features are mapped into the Euclidean *** L2 distance can be used to calculate the distance between any two pedestrians to determine whether they are the *** experiments validate the superiority and advantages of our proposed framework over state-of-the-art competitors on contemporary challenging person re-id datasets.

关键词： person re-identification(re-id) convolutions neural network(CNN) attributes coupled clusters loss(CCL)

来源：评论

学校读者我要写书评

暂无评论

Dual-stream coupling network with wavelet transform for cross-resolution person re-identification

引用

Journal of Systems engineering and Electronics 2023年第3期34卷 682-695页

作者： SUN Rui YANG Zi ZHAO Zhenghui ZHANG Xudong Key Laboratory of Knowledge Engineering with Big Data(Ministry of Education) Hefei University of TechnologyHefei 230601China School of Computer and Information Hefei University of TechnologyHefei 230601China

Person re-identification is a prevalent technology deployed on intelligent *** have been remarkable achievements in person re-identification methods based on the assumption that all person images have a sufficiently high resolution,yet such models are not applicable to the open *** real world,the changing distance between pedestrians and the camera renders the resolution of pedestrians captured by the camera *** low-resolution(LR)images in the query set are matched with high-resolution(HR)images in the gallery set,it degrades the performance of the pedestrian matching task due to the absent pedestrian critical information in LR *** address the above issues,we present a dualstream coupling network with wavelet transform(DSCWT)for the cross-resolution person re-identification ***,we use the multi-resolution analysis principle of wavelet transform to separately process the low-frequency and high-frequency regions of LR images,which is applied to restore the lost detail information of LR ***,we devise a residual knowledge constrained loss function that transfers knowledge between the two streams of LR images and HR images for accessing pedestrian invariant features at various *** qualitative and quantitative experiments across four benchmark datasets verify the superiority of the proposed approach.

关键词： cross-resolution feature invariant learning person re-identification residual knowledge transfer wavelet transform

来源：评论

学校读者我要写书评

暂无评论

In-memory join algorithms on GPUs for large-data 21

In-memory join algorithms on GPUs for large-data

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Guo, Chengxin Chen, Hong Key Lab of Data Engineering and Knowledge Engineering of Ministry of Education School of Information Renmin University of China Beijing China

ISBN: (纸本)9781728120584

In traditional databases, join is one of the most computationally expensive operations in query processing. During the past years, GPU has been adopted to improve the performance of join processing because of the features of massive parallelism and high memory bandwidth. Limited by the capacity of GPU memory and the absence of virtual memory management, however, handling the relations that exceed the capacity of the GPU memory is a challenge for GPU-based join algorithms. Because of the high computing throughput provided by GPUs and the low bandwidth of data communication between the CPUs and the GPUs, data have to be partitioned to fit the features of GPUs and to reduce the cost of data transmission. Furthermore, a series of novel techniques have been developed on the GPUs, which can benefit the join algorithms. In this work, we focus on the optimizing of processing join operator on large relations and propose the designs of in-memory hash join and sort-merge join on GPUs. We present the data partition method on the GPUs implemented with a pipeline mechanism. Furthermore, the shuffle instructions and the CUDA streams are applied in our algorithms to best utilize the GPUs. Experimental results indicate that our hash join algorithm delivers up to 1.51X and 1.24X speedup over the state-of-the-art hash join algorithm on CPUs on NVIDIA GTX1080ti-Pascal GPU and TitanV-Volta GPU respectively. For sort-merge join, our algorithm achieves up to 3.52X and 2.21X improvements on the same GPUs respectively compared to the baselines on CPUs. © 2019 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Parallel hybrid join algorithm on GPU 21

Parallel hybrid join algorithm on GPU

引用

作者： Guo, Chengxin Chen, Hong Zhang, Feng Li, Cuiping Key Lab of Data Engineering and Knowledge Engineering Ministry of Education School of Information Renmin University of China Beijing China

ISBN: (纸本)9781728120584

In data analytics applications, join is a general and time consuming operation. Optimizing join algorithms can benefit the query processing significantly. The emerging of GPUs provides a massive parallelism solution for improving the performance of the join operation. The hash join (HJ) and sort merge join (SMJ), which are two widely used join algorithms, have been proved effective for efficient join processing on the GPUs. Both algorithms have their own advantages and drawbacks, offering the chance of combining the advantages of HJ and SMJ on GPUs. In processing join operation on GPUs, data need to be transmitted between the CPU and the GPU due to the discrete GPU memory design, which causes performance degradation because of the high PCIe data transfer overhead. As GPUs are becoming more powerful than before, the performance gap between data transmission and GPU execution increases, which makes it even harder to implement an efficient join on GPUs. In this paper, we focus on the optimization of join algorithms on GPUs. We propose the Parallel Hybrid Join algorithm on GPUs(PHYJ) to combine the advantages of HJ and SMJ, and overlap the data communication and GPU execution with a pipeline mechanism. In our evaluation, the PHYJ shows up to 1.72X and 1.55X speedup over the up-to-date HJ and SMJ algorithms respectively on a NVIDIA GTX 1080ti-Pascal GPU. On the TitanV-Volta GPU, up to 1.54X and 1.42X improvements can be achieved over the baseline HJ and SMJ algorithms respectively. © 2019 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

FlexTable: Using a Dynamic Relation Model to Store RDF data

FlexTable: Using a Dynamic Relation Model to Store RDF Data

引用

15th International Conference on database Systems for Advanced Applications

作者： Wang, Yan Du, Xiaoyong Lu, Jiaheng Wang, Xiaofang Key Labs of Data Engineering and Knowledge Engineering Ministry of Education China Information School Renmin University of China China

ISBN: (纸本)9783642120251

Efficient management of RDF data is an important factor in realizing the Semantic Web vision. The existing approaches store RDF data based on triples instead of a relation model. In this paper, we propose a system called FlexTable, where all triples of an instance are coalesced into one tuple and all tuples are stored in relation schemas. The main technical challenge is how to partition all the triples into several tables, i.e. it is needed to design an effective and dynamic schema structure to store RDF triples. To deal with this challenge, we firstly propose a schema evolution method called LBA, which is based on a lattice structure to automatically evolve schemas while new triples are inserted. Secondly, we propose a novel page layout with an interpreted storage format to reduce the physical adjustment cost during schema evolution. Finally we perform comprehensive experiments on two practical RDF data sets to demonstrate that FlexTable is superior to the state-of-the-art approaches.

关键词： FlexTable RDF data dynamic relational model Lattice

来源：评论

学校读者我要写书评

暂无评论

Polynomial-Time Assignment-Based Cell Association with Generic Utility Functions

引用

China Communications 2022年第9期19卷 214-228页

作者： Lusheng Wang Chao Fang Hai Lin Min Peng Caihong Kai Key Laboratory of Knowledge Engineering with Big Data Ministry of Education.School of Computer Science and Information EngineeringHefei University of TechnologyHefei 230601China Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education.School of Cyber Science and EngineeringWuhan UniversityWuhan 430072China

Cell association is a significant research issue in future mobile communication systems due to the unacceptably large computational time of traditional *** article proposes a polynomial-time cell association scheme which not only completes the association in polynomial time but also fits for a generic optimization objective *** the one hand,traditional cell association as a non-deterministic polynomial(NP)hard problem with a generic utility function is heuristically transformed into a 2-dimensional assignment optimization and solved by a certain polynomial-time algorithm,which significantly saves computational *** the other hand,the scheme jointly considers utility maximization and load balancing among multiple base stations(BSs)by maintaining an experience pool storing a set of weighting factor values and their corresponding *** an association optimization is required,a suitable weighting factor value is taken from the pool to calculate a long square utility matrix and a certain polynomial-time algorithm will be applied for the *** with several representative schemes,the proposed scheme achieves large system capacity and high fairness within a relatively short computational time.

关键词： mobile communication system 2-dimensional assignment problem hungarian algorithm fairness cell association

来源：评论

学校读者我要写书评

暂无评论

Distance-based feature selection from probabilistic data

Distance-based feature selection from probabilistic data

引用

14th International Conference on Web-Age Information Management, WAIM 2013

作者： Zhao, Tingting Pei, Bin Zhao, Suyun Chen, Hong Li, Cuiping Key Lab of Data Engineering and Knowledge Engineering Ministry of Education China Department of Computer Science Renmin University of China China

ISBN: (纸本)9783642385612

Feature selection is a powerful tool of dimension reduction from datasets. In the last decade, more and more researchers have paid attentions on feature selection. Further, some researchers begin to focus on feature selection from probabilistic datasets. However, in the existing method of feature selection from probabilistic data, the distance hidden in probabilistic data is neglected. In this paper, we design a new distance measure to select informative feature from probabilistic databases, in which both the distance and randomness in the data are considered. And then, we propose a feature selection algorithm based on the new distance and develop two accelerative algorithms to boost the computation. Furthermore, we introduce a parameter into the distance to reduce the sensitivity to noise. Finally, the experimental results verify the effectiveness of our algorithms. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Random processes

来源：评论

学校读者我要写书评

暂无评论

Research and analysis of psychological data based on machine learning methods

引用

International Journal of Wireless and Mobile Computing 2022年第1期22卷 1-8页

作者： Chen, Guangshun Lv, Wei Ma, Junwei Liang, Yanchun Zhuhai Lab. of Key Lab. of Symbol Computation and Knowledge Engineering of Ministry of Education Zhuhai College of Jilin University Jilin Zhuhai China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Jilin Changchun China

The integration of psychology and computer science has become the mainstream contemporary research method on psychological data. Weibo, China's largest open platform for communication and information sharing between users, has many emotional contents hidden in its data. According to the current trend, the Weibo data are segmented by machine learning to obtain a psychological portrait of Weibo users. This design uses Long and Short-Term Memory (LSTM) networks and Convolutional Neural Networks (CNNs) to perform sentiment classification on Weibo data. The classification results are analysed using word frequency analysis and the Latent Dirichlet Allocation (LDA) model to obtain portraits of Weibo users' sentiment and an analysis of the results. The results are displayed in the form of word clouds. According to the clustering results of the word clouds, the main factors affecting different polar emotions can be analysed. © 2022 Inderscience Enterprises Ltd.. All rights reserved.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：