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

arXiv 2023年

作者： Zhang, Chunxu Long, Guodong Zhou, Tianyi Yan, Peng Zhang, Zijian Zhang, Chengqi Yang, Bo Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China College of Computer Science and Technology Jilin University China Australian Artificial Intelligence Institute FEIT University of Technology Sydney Australia Computer Science and UMIACS University of Maryland United States

Federated recommendation is a new Internet service architecture that aims to provide privacy-preserving recommendation services in federated settings. Existing solutions are used to combine distributed recommendation algorithms and privacy-preserving mechanisms. Thus it inherently takes the form of heavyweight models at the server and hinders the deployment of on-device intelligent models to end-users. This paper proposes a novel Personalized Federated Recommendation (PFedRec) framework to learn many user-specific lightweight models to be deployed on smart devices rather than a heavyweight model on a server. Moreover, we propose a new dual personalization mechanism to effectively learn fine-grained personalization on both users and items. The overall learning process is formulated into a unified federated optimization framework. Specifically, unlike previous methods that share exactly the same item embeddings across users in a federated system, dual personalization allows mild finetuning of item embeddings for each user to generate user-specific views for item representations which can be integrated into existing federated recommendation methods to gain improvements immediately. Experiments on multiple benchmark datasets have demonstrated the effectiveness of PFedRec and the dual personalization mechanism. Moreover, we provide visualizations and in-depth analysis of the personalization techniques in item embedding, which shed novel insights on the design of recommender systems in federated settings. The code is available. Copyright © 2023, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

JC5A: Service Delay Minimization for Aerial MEC-assisted Industrial Cyber-Physical Systems

arXiv

引用

arXiv 2024年

作者： Sun, Geng Wu, Jiaxu Sun, Zemin He, Long Wang, Jiacheng Niyato, Dusit Jamalipour, Abbas Mao, Shiwen College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore School of Electrical and Computer Engineering The University of Sydney SydneyNSW2006 Australia Department of Electrical and Computer Engineering Auburn University Auburn United States

In the era of the sixth generation (6G) and industrial Internet of Things (IIoT), an industrial cyber-physical system (ICPS) drives the proliferation of sensor devices and computing-intensive tasks. To address the limited resources of IIoT sensor devices, unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) has emerged as a promising solution, providing flexible and cost-effective services in close proximity of IIoT sensor devices (ISDs). However, leveraging aerial MEC to meet the delay-sensitive and computation-intensive requirements of the ISDs could face several challenges, including the limited communication, computation and caching (3C) resources, stringent offloading requirements for 3C services, and constrained on-board energy of UAVs. To address these issues, we first present a collaborative aerial MEC-assisted ICPS architecture by incorporating the computing capabilities of the macro base station (MBS) and UAVs. We then formulate a service delay minimization optimization problem (SDMOP). Since the SDMOP is proved to be an NP-hard problem, we propose a joint computation offloading, caching, communication resource allocation, computation resource allocation, and UAV trajectory control approach (JC5A). Specifically, JC5A consists of a block successive upper bound minimization method of multipliers (BSUMM) for computation offloading and service caching, a convex optimization-based method for communication and computation resource allocation, and a successive convex approximation (SCA)-based method for UAV trajectory control. Moreover, we theoretically prove the convergence and polynomial complexity of JC5A. Simulation results demonstrate that the proposed approach can achieve superior system performance compared to the benchmark approaches and algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

TemporalPaD: a reinforcement-learning framework for temporal feature representation and dimension reduction

arXiv

引用

arXiv 2024年

作者： Mu, Xuechen Huang, Zhenyu Li, Kewei Zhang, Haotian Wang, Xiuli Fan, Yusi Zhang, Kai Zhou, Fengfeng Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun130012 China School of Mathematics Jilin University Jilin Changchun130012 China College of computer Science and Technology Jilin University Jilin Changchun130012 China School of Biology and Engineering Guizhou Medical University Guizhou Guiyang550025 China

Recent advancements in feature representation and dimension reduction have highlighted their crucial role in enhancing the efficacy of predictive modeling. This work introduces TemporalPaD, a novel end-to-end deep learning framework designed for temporal pattern datasets. TemporalPaD integrates reinforcement learning (RL) with neural networks to achieve concurrent feature representation and feature reduction. The framework consists of three cooperative modules: a Policy Module, a Representation Module, and a Classification Module, structured based on the Actor-Critic (AC) framework. The Policy Module, responsible for dimensionality reduction through RL, functions as the actor, while the Representation Module for feature extraction and the Classification Module collectively serve as the critic. We comprehensively evaluate TemporalPaD using 29 UCI datasets, a well-known benchmark for validating feature reduction algorithms, through 10 independent tests and 10-fold cross-validation. Additionally, given that TemporalPaD is specifically designed for time series data, we apply it to a real-world DNA classification problem involving enhancer category and enhancer strength. The results demonstrate that TemporalPaD is an efficient and effective framework for achieving feature reduction, applicable to both structured data and sequence datasets. The source code of the proposed TemporalPaD is freely available as supplementary material to this article and at http://***/supp/. © 2024, CC BY-NC-ND.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Data-Efficient CLIP-Powered Dual-Branch Networks for Source-Free Unsupervised Domain Adaptation

arXiv

引用

arXiv 2024年

作者： Li, Yongguang Cao, Yueqi Li, Jindong Wang, Qi Wang, Shengsheng College of Software Jilin University Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China School of Artificial Intelligence Jilin University Changchun130012 China Engineering Research Center of Knowledge-Driven Human-Machine Intelligence Ministry of Education Jilin University Changchun130012 China

Source-free Unsupervised Domain Adaptation (SF-UDA) aims to transfer a model’s performance from a labeled source domain to an unlabeled target domain without direct access to source samples, addressing critical data privacy concerns. However, most existing SF-UDA approaches assume the availability of abundant source domain samples, which is often impractical due to the high cost of data annotation. To address the dual challenges of limited source data and privacy concerns, we introduce a data-efficient, CLIP-powered dual-branch network (CDBN). This architecture consists of a cross-domain feature transfer branch and a target-specific feature learning branch, leveraging high-confidence target domain samples to transfer text features of source domain categories while learning target-specific soft prompts. By fusing the outputs of both branches, our approach not only effectively transfers source domain category semantic information to the target domain but also reduces the negative impacts of noise and domain gaps during target training. Furthermore, we propose an unsupervised optimization strategy driven by accurate classification and diversity, preserving the classification capability learned from the source domain while generating more confident and diverse predictions in the target domain. CDBN achieves near state-of-the-art performance with far fewer source domain samples than existing methods across 31 transfer tasks on seven datasets. © 2024, CC BY.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Improving Generalization of Neural Vehicle Routing Problem Solvers Through the Lens of Model Architecture

arXiv

引用

arXiv 2024年

作者： Xiao, Yubin Wang, Di Wu, Xuan Wu, Yuesong Li, Boyang Du, Wei Wang, Liupu Zhou, You Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly Nanyang Technological University 639956 Singapore WeBank-NTU Joint Research Institute on Fintech Nanyang Technological University 639956 Singapore College of Computing and Data Science Nanyang Technological University 639956 Singapore

Neural models produce promising results when solving Vehicle Routing Problems (VRPs), but may often fall short in generalization. Recent attempts to enhance model generalization often incur unnecessarily large training cost or cannot be directly applied to other models solving different VRP variants. To address these issues, we take a novel perspective on model architecture in this study. Specifically, we propose a plug-and-play Entropy-based Scaling Factor (ESF) and a Distribution-Specific (DS) decoder to enhance the size and distribution generalization, respectively. ESF adjusts the attention weight pattern of the model towards familiar ones discovered during training when solving VRPs of varying sizes. The DS decoder explicitly models VRPs of multiple training distribution patterns through multiple auxiliary light decoders, expanding the model representation space to encompass a broader range of distributional scenarios. We conduct extensive experiments on both synthetic and widely recognized real-world benchmarking datasets and compare the performance with seven baseline models. The results demonstrate the effectiveness of using ESF and DS decoder to obtain a more generalizable model and showcase their applicability to solve different VRP variants, i.e., travelling salesman problem and capacitated VRP. Notably, our proposed generic components require minimal computational resources, and can be effortlessly integrated into conventional generalization strategies to further elevate model generalization. Copyright © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Short Tail:taming tail latency for erasure-code-based in-memory systems

引用

Frontiers of Information Technology & Electronic engineering 2022年第11期23卷 1646-1657页

作者： Yun TENG Zhiyue LI Jing HUANG Guangyan ZHANG College of Computer Science and Technology Jilin UniversityChangchun 130012China Department of Computer Science and Technology Tsinghua UniversityBeijing 100084China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun 130012China Beijing National Research Center for Information Science and Technology(Tsinghua University) Beijing 100084China

In-memory systems with erasure coding(EC)enabled are widely used to achieve high performance and data ***,as the scale of clusters grows,the server-level fail-slow problem is becoming increasingly frequent,which can create long tail *** influence of long tail latency is further amplified in EC-based systems due to the synchronous nature of multiple EC *** this paper,we propose an EC-enabled in-memory storage system called ShortTail,which can achieve consistent performance and low latency for both reads and ***,ShortTail uses a lightweight request monitor to track the performance of each memory node and identify any fail-slow ***,ShortTail selectively performs degraded reads and redirected writes to avoid accessing fail-slow ***,ShortTail posts an adaptive write strategy to reduce write amplification of small *** implement ShortTail on top of Memcached and compare it with two baseline *** experimental results show that ShortTail can reduce the P99 tail latency by up to 63.77%;it also brings significant improvements in the median latency and average latency.

关键词： Erasure code In-memory system Node fail-slow Small write Tail latency

来源：评论

学校读者我要写书评

暂无评论

A Fuzzy Clustering Based Collaborative Filtering Algorithm for Time-Aware POI Recommendation 3

A Fuzzy Clustering Based Collaborative Filtering Algorithm f...

引用

2020 3rd International Conference on Modeling, Simulation and Optimization Technologies and Applications, MSOTA 2020

作者： Yin, Minghao Liu, Yanheng Zhou, Xu Sun, Geng College of Computer Science and Technology Jilin University Changchun Jilin China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin China Center for Computer Fundamental Education Jilin University Changchun Jilin China

Location based social network develops and gets widely concern along with the population and widespread use of mobile. Point of interest(POI) recommendation become one of the most widely application among location-based service. To get better POI recommendation performance, a fuzzy clustering based collaborative filtering algorithm (FCCF) for time-Aware POI recommendation is proposed in this paper. It first constructs the user feature vector from users' check-in behaviours. Individual's check-in behaviour can be under the influence of location region and time slots, so user's feature consists of two parts. One is the vising frequency of each user in different location regions, and the other is the vising frequency of each user in different time slots. Next fuzzy c-means is adopted due to its simplicity to group users according to user feature vector. Then the user similarity computation can be limited in the similar small user groups. In the end, a collaborative filtering algorithm is applied to recommend a number of top-N POIs at a given time for the target user. Some experiments are conducted and the comparative results on Foursquare and Gowalla show that FCCF has higher precision and recall value than the comparative algorithms. © Published under licence by IOP Publishing Ltd.

关键词： Fuzzy clustering

来源：评论

学校读者我要写书评

暂无评论

An Adversarial Complementary Erasing Network for Salient Object Detection in Optical Remote Sensing Images

SSRN

引用

SSRN 2023年

作者： Liang, Yanhua Qin, Guihe Sun, Minghui Qin, Jun Yan, Jie Zhang, Zhonghan College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China School of Computer Science and Technology Changchun University of Science and Technology Changchun130012 China

Salient object detection in optical remote sensing images (RSI-SOD) aims to locate and extract visually discriminative objects or regions, which has attracted more and more attention from the community. The key challenge of RSI-SOD lies in the characteristics of optical RSIs, such as scale diversification of salient objects, irregular edges, and cluttered backgrounds. In this paper, we strive to embrace challenges towards effective and efficient RSI-SOD. To this end, we develop a framework, termed Adversarial Complementary Erasing Network (ACENet), which comprehensively mines discriminative features of different layers from foreground, background, local and global perspectives to perform robust and accurate saliency detection. Specifically, ACENet is a typical encoder-decoder structure that embeds Adversarial Erasing Synthesis Module (AESM) in multi-scale encoding features to fully explore more useful and complete representations. In AESM, we introduce Adversarial Discriminant Information Mining (ADIM) component to facilitate adaptive adjustment between salient features and background, further enabling more representative and strong integrity feature generation. Experimental results on three datasets prove that our ACENet significantly outperforms cutting-edge SOD models both qualitatively and quantitatively with a quick reasoning speed of 76 FPS. Code will be available at https://***/Liangyh18/ACENet. © 2023, The Authors. All rights reserved.

关键词： Optical remote sensing

来源：评论

学校读者我要写书评

暂无评论

Generative AI for Deep Reinforcement Learning: Framework, Analysis, and Use Cases

arXiv

引用

arXiv 2024年

作者： Sun, Geng Xie, Wenwen Niyato, Dusit Mei, Fang Kang, Jiawen Du, Hongyang Mao, Shiwen College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore School of Automation Guangdong University of Technology Guangzhou510006 China Department of Electrical and Electronic Engineering The University of Hong Kong 999077 Hong Kong Department of Electrical and Computer Engineering Auburn University Auburn36830 United States

As a form of artificial intelligence (AI) technology based on interactive learning, deep reinforcement learning (DRL) has been widely applied across various fields and has achieved remarkable accomplishments. However, DRL faces certain limitations, including low sample efficiency and poor generalization. Therefore, we present how to leverage generative AI (GAI) to address these issues above and enhance the performance of DRL algorithms in this paper. We first introduce several classic GAI and DRL algorithms and demonstrate the applications of GAI-enhanced DRL algorithms. Then, we discuss how to use GAI to improve DRL algorithms from the data and policy perspectives. Subsequently, we introduce a framework that demonstrates an actual and novel integration of GAI with DRL, i.e., GAI-enhanced DRL. Additionally, we provide a case study of the framework on UAV-assisted integrated near-field/far-field communication to validate the performance of the proposed framework. Moreover, we present several future directions. Finally, the related code is available at: https://***/GAI-enhanced-DRL. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

AMPCliff: quantitative definition and benchmarking of activity cliffs in antimicrobial peptides

arXiv

引用

arXiv 2024年

作者： Li, Kewei Wu, Yuqian Li, Yinheng Guo, Yutong Wang, Yan Liang, Yiyang Fan, Yusi Huang, Lan Zhang, Ruochi Zhou, Fengfeng College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun130012 China School of Software Jilin University Jilin Changchun130012 China School of Life Sciences Jilin University Jilin Changchun130012 China Department of Computer Science Columbia University 116th and Broadway New York CityNY10027 United States School of Artificial Intelligence Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun130012 China School of Biology and Engineering Guizhou Medical University Guizhou Guiyang550025 China School of Computer Engineering Changchun University of Engineering Jilin Changchun130103 China Changchun Wenli High School Jilin Changchun130062 China

Since the mechanism of action of drug molecules in the human body is difficult to reproduce in the in vitro environment, it becomes difficult to reveal the causes of the activity cliff phenomenon of drug molecules. We found out the AC of small molecules has been extensively investigated but limited knowledge is accumulated about the AC phenomenon in peptides with canonical amino acids. Understanding the mechanism of AC in canonical amino acids might help understand the one in drug molecules. This study introduces a quantitative definition and benchmarking framework AMPCliff for the AC phenomenon in antimicrobial peptides (AMPs) composed by canonical amino acids. A comprehensive analysis of the existing AMP dataset reveals a significant prevalence of AC within AMPs. AMPCliff quantifies the activities of AMPs by the MIC, and defines 0.9 as the minimum threshold for the normalized BLOSUM62 similarity score between a pair of aligned peptides with at least two-fold MIC changes. This study establishes a benchmark dataset of paired AMPs in Staphylococcus aureus from the publicly available AMP dataset GRAMPA, and conducts a rigorous procedure to evaluate various AMP AC prediction models, including nine machine learning, four deep learning algorithms, four masked language models, and four generative language models. Our analysis reveals that these models are capable of detecting AMP AC events and the pre-trained protein language model ESM2 demonstrates superior performance across the evaluations. The predictive performance of AMP activity cliffs remains to be further improved, considering that ESM2 with 33 layers only achieves the Spearman correlation coefficient 0.4669 for the regression task of the MIC values on the benchmark dataset. Source code and additional resources are available at https://***/supp/or https://***/Kewei2023/AMPCliff-generation. © 2024, CC BY-NC-SA.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：