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

SSRN 2025年

作者： Yang, Lihua Wang, Fang Lin, Weizhao Zhang, Wei Xiao, Yang Tan, Zhipeng Li, Jiaxin Lu, Kai College of Computer Science and Technology National University of Defense Technology Yanwachi Street Changsha410073 China Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China Huazhong University of Science and Technology Luoyu Road Wuhan430074 China

With the widespread adoption of flash memory, the Flash Friendly File System (F2FS) designed to flash memory characteristics has become widely-used in large data centers. However, F2FS encounters from significant cleaning overheads due to its logging scheme writes. We observe that warm data in F2FS account for a substantial proportion, at least 80%. Nevertheless, the mixed storage of warm data with varying hotness exacerbates segment cleaning challenges. To address this issue, we propose a scheme called M2H, which involves a fine-grained management of warm data hotness identified by the K-means clustering algorithm. M2H determines hotness by considering factors such as file block update distance, most recently used distance, and workload characteristics. M2H facilitates {M}ulti-log delayed writing and {M}odified segment cleaning based on {H}otness. To reduce costs associated with distinguishing data hotness at the file block level, we employ Mini Batch K-means and refer to this variant as M2H_MBK. Moreover, for servers equipped with GPUs, the clustering process can be offloaded to the GPU, known as M2H_GPU. We conduct a comprehensive comparison of traditional F2FS, M2H, M2H_MBK, and M2H_GPU on a real platform. Results show that compared to traditional F2FS, M2H_GPU reduces the number of segment cleanings by 54.41% to 97.93%. © 2025, The Authors. All rights reserved.

关键词： Flash memory

来源：评论

学校读者我要写书评

暂无评论

A Triangular Stable Node Network based on Self-supervised Learning for personalized prediction

A Triangular Stable Node Network based on Self-supervised Le...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Liu, Qing Gao, Qian Fan, Jun Zhang, Zhiqiang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Qilu University of Technology Shandong Academy of Sciences Jinan250014 China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology Shandong Academy of Sciences Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan250014 China China Telecom Digital Intelligence Techonology Co Ltd. No.1999 Shunhua road Shandong Jinan250101 China

ISBN: (纸本)9798350368741

In recent years, research has illuminated the potency of implicit data processing in enhancing user preferences. Nevertheless, barriers remain in breaking through the constraints of implicit information. This study aims to bridge this gap by firstly constructing a triangular stable node network model, tailored to manage implicit information with precision. Recognizing the challenge of pinpointing novel structures within large-scale graphs, we propose SLTSNN-a triangular stable node network based on self-supervised learning for personalized prediction. SLTSNN innovates by maximizing mutual information between graph-level and patch-level representations, while augmenting graph representations through extended enhanced representations. Additionally, it incorporates triangular data associations and introduces a triangular allocation attention network, which emphasizes strongly correlated preference features among similar users. Furthermore, SLTSNN employs contrastive learning to maximize mutual information between graph vectors and hidden representations, distinguishing between high-order global and local representations. The model's effectiveness in enhancing user preferences and capturing new graph structures is evidenced by its performance on hit rate and normalized discounted cumulative gain metrics across three datasets. © 2025 IEEE.

关键词： graph contrastive learning graph neural networks recommender systems self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Efficient and Privacy-Preserving Weighted Nearby-Fit Spatial keyword Query in Cloud

引用

IEEE Internet of Things Journal 2025年

作者： Sun, Lili Lu, Rongxing Zheng, Yandong Zhang, Yonggang Tao, Yi Jilin University College of Computer Science and Technology Changchun130012 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun130012 China University of New Brunswick Faculty of Computer Science FrederictonNBE3B 5A3 Canada Xidian University State Key Laboratory of Integrated Services Networks Xi'an710071 China Jilin University College of Software Changchun130012 China

In the modern digital landscape, integrating geographic locations and textual descriptions within a geo-textual dataset enhances location-based services (LBS) via spatial keyword queries, as these queries combine spatial and textual information to deliver more precise and personalized results. Additionally, the advent of cloud computing allows data owners to outsource data management and services to the cloud, boosting scalability but introducing efficiency challenges due to complex encryption. Although many schemes have been proposed for spatial keyword queries on encrypted geo-textual data, none supports matching a query keyword set with the keyword sets of multiple objects, a common query type in LBS. Imagine a user seeking to rent a house close to his/her workplace, with easy access to conveniences like supermarkets. By using nearby-fit spatial keyword queries, we can match the desired house with a house-type target object and its nearby amenities, offering more practical and flexible recommendations than traditional spatial keyword queries. Hence, in this paper, we introduce an efficient and privacy-preserving scheme called the Privacy-preserving Weighted Nearby-fit Spatial keyword (PWNSK) query scheme. First, we design a target-oriented spatial keyword (TOSK) tree for data organization and a TOSK tree based WNSK query algorithm for efficient pruning by simultaneously utilizing locations, keywords, and distances from nearby objects to target objects. For privacy, we develop several protocols, including one for polynomial coefficient re-encoding, based on polynomial coefficient encoding and fully homomorphic encryption. Building on these protocols, we introduce our PWNSK scheme. A thorough security analysis confirms its robustness, while extensive experiments also showcase its effectiveness. © 2014 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Unsupervised feature selection with evolutionary sparsity

引用

Neural Networks 2025年 189卷 107512页

作者： Zhou, Shixuan Xiang, Yi Huang, Han Huang, Pei Peng, Chaoda Yang, Xiaowei Song, Peng School of Software Engineering South China University of Technology Guangzhou510006 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Ministry of Education Guangzhou510006 China Guangdong Engineering Center for Large Model and GenAI Technology Guangzhou510006 China School of Information Science Guangdong University of Finance and Economics Guangzhou510006 China School of Mathematics and Informatics South China Agricultural University Guangzhou510006 China School of Computer and Control Engineering Yantai University Yantai264005 China

The 2,0-norm is playing an increasingly important role in unsupervised feature selection. However, existing algorithm for optimization problem with 2,0-norm constraint has two problems: First, they cannot automatically determine the sparsity, also known as the number of key features. Second, they have the risk of converging towards local optima, therefore selecting trivial (less informative) features. To address these problems, this paper proposes an unsupervised feature selection method with evolutionary sparsity (EVSP), which integrates the feature selection process with a sparse projection matrix and population search mechanisms into a unified unsupervised feature selection framework. Specifically, the level of sparsity is encoded as population individuals, and subsequently, a multi-objective evolutionary algorithm based on binary encoding is introduced to recursively determine the optimal level of sparsity, thus unsupervisedly guiding the learning of an optimal row-sparse projection matrix. Moreover, by utilizing the feature weights learned through sparse projection, a two-stage strategy called the mutation-repair operator is designed to steer the evolution of the population, aiming to generate high-quality candidate solutions. Comprehensive experiments on eleven benchmark datasets, with a maximum dimensionality of 10304 features and a maximum size of 9298 samples, demonstrate that the proposed EVSP method can effectively determine the optimal sparsity level, significantly outperforming several state-of-the-art methods. © 2025 Elsevier Ltd

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Recording Architecture for Three-Dimensional Magnetic Recording

arXiv

引用

arXiv 2025年

作者： Jian, Yugen Luo, Ke Chen, Jincai Fong, Xuanyao Wuhan National Laboratory for Optoelectronics Huazhong University of Science and Technology Wuhan430074 China Department of Electrical and Computer Engineering National University of Singapore Singapore117583 Singapore School of Computer of Science and Technology Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China Wuhan430074 China

Three-dimensional magnetic recording (3DMR) is a highly promising approach to achieving ultra-large data storage capacity in hard disk drives. One of the greatest challenges for 3DMR lies in performing sequential and correct writing of bits into the multi-layer recording medium. In this work, we have proposed a hierarchical recording architecture based on layered heat-assisted writing with a multi-head array. The feasibility of the architecture is validated in a dual-layer 3DMR system with FePt-based thin films via micromagnetic simulation. Our results reveal the magnetization reversal mechanism of the grains, ultimately attaining appreciable switching probability and medium signal-to-noise ratio (SNR) for each layer. In particular, an optimal head-to-head distance is identified as the one that maximizes the medium SNR. Optimizing the system’s noise resistance will improve the overall SNR and allow for a smaller optimal head-to-head distance, which can pave the way for scaling 3DMR to more recording layers. Copyright © 2025, The Authors. All rights reserved.

关键词： Hard disk storage

来源：评论

学校读者我要写书评

暂无评论

Partial Label Learning via Conditional-Label-Aware Disambiguation

引用

Journal of Computer Science & Technology 2021年第3期36卷 590-605页

作者： Peng Ni Su-Yun Zhao Zhi-Gang Dai Hong Chen Cui-Ping Li Key Laboratory of Data Engineering and Knowledge Engineering(Renmin University of China) Ministry of Education Beijing 100087China School of Information Renmin University of ChinaBeijing 100087China

Partial label learning is a weakly supervised learning framework in which each instance is associated with multiple candidate labels,among which only one is the ground-truth *** paper proposes a unified formulation that employs proper label constraints for training models while simultaneously performing *** existing partial label learning approaches that only leverage similarities in the feature space without utilizing label constraints,our pseudo-labeling process leverages similarities and differences in the feature space using the same candidate label constraints and then disambiguates noise *** experiments on artificial and real-world partial label datasets show that our approach significantly outperforms state-of-the-art counterparts on classification prediction.

关键词： disambiguation partial label learning similarity and dissimilarity weak supervision

来源：评论

学校读者我要写书评

暂无评论

Efficient Model Store and Reuse in an OLML database System

引用

Journal of Computer Science & Technology 2021年第4期36卷 792-805页

作者： Jian-Wei Cui Wei Lu Xin Zhao Xiao-Yong Du Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Renmin University of China Beijing 100872China School of Information Renmin University of ChinaBeijing 100872China

Deep learning has shown significant improvements on various machine learning tasks by introducing a wide spectrum of neural network ***,for these neural network models,it is necessary to label a tremendous amount of training data,which is prohibitively expensive in *** this paper,we propose OnLine Machine Learning(OLML)database which stores trained models and reuses these models in a new training task to achieve a better training effect with a small amount of training *** efficient model reuse algorithm AdaReuse is developed in the OLML ***,AdaReuse firstly estimates the reuse potential of trained models from domain relatedness and model quality,through which a group of trained models with high reuse potential for the training task could be selected ***,multi selected models will be trained iteratively to encourage diverse models,with which a better training effect could be achieved by *** evaluate AdaReuse on two types of natural language processing(NLP)tasks,and the results show AdaReuse could improve the training effect significantly compared with models training from scratch when the training data is *** on AdaReuse,we implement an OLML database prototype system which could accept a training task as an SQL-like query and automatically generate a training plan by selecting and reusing trained *** studies are conducted to illustrate the OLML database could properly store the trained models,and reuse the trained models efficiently in new training tasks.

关键词： model selection model reuse OnLine Machine Learning(OLML)database

来源：评论

学校读者我要写书评

暂无评论

Sandy desertification in the Belt and Road Initiative drylands during 2000–2020: Assessment under the Land Degradation Neutrality framework

引用

Ecological Indicators 2025年 175卷

作者： Zheng, Zhijia Dong, Yue Zhan, Hao Yu, Jinsongdi Key Laboratory of Spatial Data Mining and Information Sharing of Ministry of Education National & Local Joint Engineering Research Center of Satellite Geospatial Information Technology Fuzhou University Fuzhou350108 China The Academy of Digital China Fuzhou University Fuzhou350108 China

Sandy desertification currently poses a severe environmental challenge, hindering the socio-economic development of Belt and Road Initiative (BRI) drylands. However, due to incomplete evaluation systems and unclear driving mechanisms, research on sandy desertification in the BRI drylands remains limited. To address this issue, this study followed the Land Degradation Neutrality (LDN) framework and constructed a new index, called sandy desertification assessment index (SDAI). Based on SDAI, this study assessed the status, evolution, and driving mechanisms of sandy desertification during 2000–2020. The findings are as follows: (1) The year 2006 was identified as the turning point for light and moderate sandy desertification land, whereafter the areas of light sandy desertification increased while the areas of moderate sandy desertification decreased. (2) The transformation patterns of sandy desertification levels were similar in two decades (i.e., 2000–2010 and 2010–2020), with slight differences in conversion areas. (3) The changing trends exhibit regional variability. Notably, reversal was predominantly observed in China, Mongolia, and India, whereas intensification was concentrated in Central Asia. (4) Various factors exerted differing influences on sandy desertification, with annual cumulative precipitation, human footprint, and gross domestic product (GDP) being particularly significant. This study will provide crucial guidance for formulating prevention and control strategies in the BRI drylands. © 2025 The Authors

关键词： Sandy desertification Belt and Road Initiative Dryland Spatiotemporal distribution Driving factors

来源：评论

学校读者我要写书评

暂无评论

Efficient protocols for heavy hitter identification with local differential privacy

引用

Frontiers of Computer Science 2022年第5期16卷 193-203页

作者： Dan ZHAO Suyun ZHAO Hong CHEN Ruixuan LIU Cuiping LI Wenjuan LIANG Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Renmin University of ChinaBeijing 100872China School of Information Renmin University of ChinaBeijing 100872China

Local differential privacy(LDP),which is a technique that employs unbiased statistical estimations instead of real data,is usually adopted in data collection,as it can protect every user’s privacy and prevent the leakage of sensitive *** segment pairs method(SPM),multiple-channel method(MCM)and prefix extending method(PEM)are three known LDP protocols for heavy hitter identification as well as the frequency oracle(FO)problem with large ***,the low scalability of these three LDP algorithms often limits their ***,communication and computation strongly affect their ***,excessive grouping or sharing of privacy budgets makes the results *** address the abovementioned problems,this study proposes independent channel(IC)and mixed independent channel(MIC),which are efficient LDP protocols for FO with a large *** design a flexible method for splitting a large domain to reduce the number of ***,we employ the false positive rate with interaction to obtain an accurate *** experiments demonstrate that IC outperforms all the existing solutions under the same privacy guarantee while MIC performs well under a small privacy budget with the lowest communication cost.

关键词： local differential privacy frequency oracle heavy hitter

来源：评论

学校读者我要写书评

暂无评论

Improving Parameter Estimation and Defensive Ability of Latent Dirichlet Allocation Model Training Under Rényi Differential Privacy

引用

Journal of Computer Science & Technology 2022年第6期37卷 1382-1397页

作者： Tao Huang Su-Yun Zhao Hong Chen Yi-Xuan Liu Key Laboratory of Data Engineering and Knowledge Engineering(Renmin University of China) Ministry of Education Beijing 100087China School of Information Renmin University of ChinaBeijing 100087China

Latent Dirichlet allocation(LDA)is a topic model widely used for discovering hidden semantics in massive text *** Gibbs sampling(CGS),as a widely-used algorithm for learning the parameters of LDA,has the risk of privacy ***,word count statistics and updates of latent topics in CGS,which are essential for parameter estimation,could be employed by adversaries to conduct effective membership inference attacks(MIAs).Till now,there are two kinds of methods exploited in CGS to defend against MIAs:adding noise to word count statistics and utilizing inherent *** two kinds of methods have their respective *** sampled from the Laplacian distribution sometimes produces negative word count statistics,which render terrible parameter estimation in *** inherent privacy could only provide weak guaranteed privacy when defending against *** is promising to propose an effective framework to obtain accurate parameter estimations with guaranteed differential *** key issue of obtaining accurate parameter estimations when introducing differential privacy in CGS is making good use of the privacy budget such that a precise noise scale is *** is the first time that R′enyi differential privacy(RDP)has been introduced into CGS and we propose RDP-LDA,an effective framework for analyzing the privacy loss of any differentially private ***-LDA could be used to derive a tighter upper bound of privacy loss than the overestimated results of existing differentially private CGS obtained byε-*** RDP-LDA,we propose a novel truncated-Gaussian mechanism that keeps word count statistics *** we propose distribution perturbation which could provide more rigorous guaranteed privacy than utilizing inherent *** validate that our proposed methods produce more accurate parameter estimation under the JS-divergence metric and obtain lower precision and recall when defending against MIAs.

关键词： latent Dirichlet allocation parameter estimation membership inference attack Rényi differential privacy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：