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

arXiv 2025年

作者： Sun, Geng Ma, Weilong Li, Jiahui Sun, Zemin Wang, Jiacheng Niyato, Dusit 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 College of Software Jilin University Changchun130012 China Department of Electrical and Computer Engineering Auburn University AuburnAL36849-5201 United States

The low-altitude economy (LAE), driven by unmanned aerial vehicles (UAVs) and other aircraft, has revolutionized fields such as transportation, agriculture, and environmental monitoring. In the upcoming six-generation (6G) era, UAV-assisted mobile edge computing (MEC) is particularly crucial in challenging environments such as mountainous or disaster-stricken areas. The computation task offloading problem is one of the key issues in UAV-assisted MEC, primarily addressing the trade-off between minimizing the task delay and the energy consumption of the UAV. In this paper, we consider a UAV-assisted MEC system where the UAV carries the edge servers to facilitate task offloading for ground devices (GDs), and formulate a calculation delay and energy consumption multi-objective optimization problem (CDECMOP) to simultaneously improve the performance and reduce the cost of the system. Then, by modeling the formulated problem as a multi-objective Markov decision process (MOMDP), we propose a multi-objective deep reinforcement learning (DRL) algorithm within an evolutionary framework to dynamically adjust the weights and obtain non-dominated policies. Moreover, to ensure stable convergence and improve performance, we incorporate a target distribution learning (TDL) algorithm. Simulation results demonstrate that the proposed algorithm can better balance multiple optimization objectives and obtain superior non-dominated solutions compared to other methods. Copyright © 2025, The Authors. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

M3oE: Multi-Domain Multi-Task Mixture-of-Experts Recommendation Framework

arXiv

引用

arXiv 2024年

作者： Zhang, Zijian Cai, Qingpeng Liu, Ziru Hu, Lantao Liu, Shuchang Zhao, Xiangyu Liu, Qidong Jiang, Peng Yu, Jiaao Zhang, Chunxu Zhao, Hongwei Gai, Kun Jilin University City University of Hong Kong Jilin China Kuaishou Technology Beijing China City University of Hong Kong Hong Kong Xi’an Jiaotong University City University of Hong Kong Xi’an China Jilin University Jilin China Beijing China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China

Multi-domain recommendation and multi-task recommendation have demonstrated their effectiveness in leveraging common information from different domains and objectives for comprehensive user modeling. Nonetheless, the practical recommendation usually faces multiple domains and tasks simultaneously, which cannot be well-addressed by current methods. To this end, we introduce M3oE, an adaptive Multi-domain Multi-task Mixture-of-Experts recommendation framework. M3oE integrates multi-domain information, maps knowledge across domains and tasks, and optimizes multiple objectives. We leverage three mixture-of-experts modules to learn common, domain-aspect, and task-aspect user preferences respectively to address the complex dependencies among multiple domains and tasks in a disentangled manner. Additionally, we design a two-level fusion mechanism for precise control over feature extraction and fusion across diverse domains and tasks. The framework’s adaptability is further enhanced by applying AutoML technique, which allows dynamic structure optimization. To the best of the authors’ knowledge, our M3oE is the first effort to solve multi-domain multi-task recommendation self-adaptively. Extensive experiments on two benchmark datasets against diverse baselines demonstrate M3oE’s superior performance. The implementation code is available to ensure reproducibility1 Copyright © 2024, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

CellMirror: Deciphering Cell Populations from Spatial Transcriptomics Data by Interpretable Contrastive Learning 1

CellMirror: Deciphering Cell Populations from Spatial Transc...

引用

1st IEEE International Conference on Medical Artificial Intelligence, MedAI 2023

作者： Xia, Junjie Cui, Jiangnan Huang, Zhenyu Zhang, Shuangquan Yao, Fang Zhang, Yijian Zuo, Chunman Institute of Artificial Intelligence Donghua University Department of Applied Mathematics Shanghai China College of Computer Science and Technology Jilin University Changchun China School of Cyber Science and Engineering Nanjing University of Science and Technology Nanjing China Institute of Maternal and Child Medicine Southern Medical University Affiliated Shenzhen Maternity and Child Healthcare Hospital Shenzhen China Xinhua Hospital Affiliated Shanghai Jiao Tong University of Medicine Department of General Surgery Shanghai China Institute of Artificial Institute Donghua University Shanghai China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun China

ISBN: (纸本)9798350358780

Spatial transcriptomics (ST) has enabled us elucidating tumor microenvironments, however, the technological limitations without single-cell resolution severely hinder its application. Here, we propose CellMirror, an interpretable contrastive learning model to decipher heterogeneous cell populations in ST data by single-cell RNA-sequencing (scRNA-seq) data. Specifically, CellMirror learns the disentangled shared (representing biological variations in both data) and salient features (specific to ST data) by two contrastive variational encoders, while constructing the relations between genes and features by a shared linear decoder. In various cancer samples, CellMirror outperforms other tools in learning common features for label transfer, and interpretation of features. Particularly, in breast cancer studies, CellMirror detects finer domains in ST data missed by other methods, and is robust to dissect cell populations in ST data using independent scRNA-seq data. These results demonstrate applications of CellMirror in interpreting the complex tumor structure in ST data by integrating scRNA-seq data. © 2023 IEEE.

关键词： Data integration

来源：评论

学校读者我要写书评

暂无评论

Learning Semantic Textual Similarity via Topic-informed Discrete Latent Variables

arXiv

引用

arXiv 2022年

作者： Yu, Erxin Du, Lan Jin, Yuan Wei, Zhepei Chang, Yi School of Artificial Intelligence Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University China International Center of Future Science Jilin University China Faculty of Information Technology Monash University Australia

Recently, discrete latent variable models have received a surge of interest in both Natural Language Processing (NLP) and Computer Vision (CV), attributed to their comparable performance to the continuous counterparts in representation learning, while being more interpretable in their predictions. In this paper, we develop a topic-informed discrete latent variable model for semantic textual similarity, which learns a shared latent space for sentence-pair representation via vector quantization. Compared with previous models limited to local semantic contexts, our model can explore richer semantic information via topic modeling. We further boost the performance of semantic similarity by injecting the quantized representation into a transformer-based language model with a well-designed semantic-driven attention mechanism. We demonstrate, through extensive experiments across various English language datasets, that our model is able to surpass several strong neural baselines in semantic textual similarity tasks. © 2022, CC0.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

引用

Journal of Advanced Research 2025年

作者： Li, Kewei Wu, Yuqian Li, Yinheng Guo, Yutong Kong, Yanwen 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 Changchun 130012 China School of Software Jilin University Jilin Changchun 130012 China School of Life Sciences Jilin University Jilin Changchun 130012 China Department of Computer Science Columbia University 116th and Broadway New York City 10027 NY United States School of Artificial Intelligence Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun 130012 China School of Biology and Engineering Guizhou Medical University Guizhou Guiyang 550025 China School of Computer Engineering Changchun University of Engineering Jilin Changchun 130103 China Changchun Wenli High School Jilin Changchun 130062 China

Introduction: Activity cliff (AC) is a phenomenon that a pair of similar molecules differ by a small structural alternation but exhibit a large difference in their biochemical activities. This phenomenon affects various tasks ranging from virtual screening to lead optimization in drug development. The AC of small molecules has been extensively investigated but limited knowledge is accumulated about the AC phenomenon in pharmaceutical peptides with canonical amino acids. Objectives: This study introduces a quantitative definition and benchmarking framework AMPCliff for the AC phenomenon in antimicrobial peptides (AMPs) composed by canonical amino acids. Methods: 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. Results: A comprehensive analysis of the existing AMP dataset reveals a significant prevalence of AC within AMPs. AMPCliff quantifies the activities of AMPs by the metric minimum inhibitory concentration (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. 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 −log(MIC) values on the benchmark dataset. Conclusion: Our findings highlight limitations in current deep learning-based representation models. To more accurately capture the properties of antimicrobial peptides (AMPs), it is ess

关键词： Activity cliff (AC) AMPCliff Antimicrobial peptide (AMP) Benchmark Minimum inhibitory concentration (MIC)

来源：评论

学校读者我要写书评

暂无评论

Interference-Aware Opportunistic Job Placement for Shared Distributed Deep Learning Clusters

SSRN

引用

SSRN 2023年

作者： Li, Hongliang Zhao, Hairui Sun, Ting Li, Xiang Xu, Haixiao Li, Keqin College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering The Ministry of Education Changchun China High Performance Computing Center Jilin University Changchun China Department of Computer Science State University of New York New PaltzNY12561 United States

Distributed deep learning frameworks facilitate large deep learning workloads. These frameworks support sharing one GPU device among multiple jobs to improve resource utilization. Modern deep learning training jobs consume a large amount of GPU memory. Despite that, sharing GPU memory among jobs is still possible because a training job has iterative steps that its memory usage fluctuates over time. However, resource sharing also introduces the risk of job performance degradation. Colocated jobs sharing a GPU device may suffer from different levels of interference, mainly caused by memory oversharing. How to improve resource utilization while maintaining good job performance is a novel challenge for job placement strategies. This paper studies the job placement problem. We propose an opportunistic memory sharing model to describe the time-varying job memory requirements. Based on this model, we introduce an Opportunistic Job Placement Problem (OJPP) for shared GPU clusters that seek job placement configurations using a minimum number of GPU devices and guarantee user-defined performance requirements at the same time. We propose a greedy algorithm and a heuristic algorithm with computational complexities of O(n log n) and O(n2 log n), respectively, to solve the problem. We also propose an online adjustment algorithm with the computational complexity of O(n log n) to perform updates to job placement configurations in runtime. A machine-learning-based interference prediction method is used to prepare accurate interference estimations. Extensive experiments are conducted on a GPU cluster to verify the correctness and effectiveness of our algorithms. Compared with standalone training jobs on dedicated clusters, the proposed approach reduces resource consumption by 46% in a shared cluster, while guaranteeing over 92.97% of the job performance, in terms of average job completion time. © 2023, The Authors. All rights reserved.

关键词： computational complexity

来源：评论

学校读者我要写书评

暂无评论

BARGAIN-MATCH: A Game Theoretical Approach for Resource Allocation and Task Offloading in Vehicular Edge Computing Networks

arXiv

引用

arXiv 2022年

作者： Sun, Zemin Sun, Geng Liu, Yanheng Wang, Jian Cao, Dongpu The 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 The School of Vehicle and Mobility Tsinghua University Beijing China

Vehicular edge computing (VEC) is emerging as a promising architecture of vehicular networks (VNs) by deploying the cloud computing resources at the edge of the VNs. However, efficient resource management and task offloading in the VEC network is challenging. In this work, we first present a hierarchical framework that coordinates the heterogeneity among tasks and servers to improve the resource utilization for servers and service satisfaction for vehicles. Moreover, we formulate a joint resource allocation and task offloading problem (JRATOP), aiming to jointly optimize the intra-VEC server resource allocation and inter-VEC server load-balanced offloading by stimulating the horizontal and vertical collaboration among vehicles, VEC servers, and cloud server. Since the formulated JRATOP is NP-hard, we propose a cooperative resource allocation and task offloading algorithm named BARGAIN-MATCH, which consists of a bargaining-based incentive approach for intra-server resource allocation and a matching method-based horizontal-vertical collaboration approach for inter-server task offloading. Besides, BARGAIN-MATCH is proved to be stable, weak Pareto optimal, and polynomial complex. Simulation results demonstrate that the proposed approach achieves superior system utility and efficiency compared to the other methods, especially when the system workload is heavy. Copyright © 2022, The Authors. All rights reserved.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Weakly supervised prototype topic model with discriminative seed words: Modifying the category prior by self-exploring supervised signals

arXiv

引用

arXiv 2021年

作者： Wang, Bing Wang, Yue Li, Ximing Ouyang, Jihong College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University China

Dataless text classification, i.e., a new paradigm of weakly supervised learning, refers to the task of learning with unlabeled documents and a few predefined representative words of categories, known as seed words. The recent generative dataless methods construct document-specific category priors by using seed word occurrences only, however, such category priors often contain very limited and even noisy supervised signals. To remedy this problem, in this paper we propose a novel formulation of category prior. First, for each document, we consider its label membership degree by not only counting seed word occurrences, but also using a novel prototype scheme, which captures pseudo-nearest neighboring categories. Second, for each label, we consider its frequency prior knowledge of the corpus, which is also a discriminative knowledge for classification. By incorporating the proposed category prior into the previous generative dataless method, we suggest a novel generative dataless method, namely Weakly Supervised Prototype Topic Model (Wsptm). The experimental results on real-world datasets demonstrate that Wsptm outperforms the existing baseline methods. © 2021, CC0.

关键词： Text processing

来源：评论

学校读者我要写书评

暂无评论

Joint Power and 3D Trajectory Optimization for UAV-enabled Wireless Powered Communication Networks with Obstacles

arXiv

引用

arXiv 2023年

作者： Pan, Hongyang Liu, Yanheng Sun, Geng Fan, Junsong Liang, Shuang Yuen, Chau The College of Computer Science and Technology Jilin University Changchun130012 China Pillar Singapore University of Technology and Design 487372 Singapore The Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China The School of Information Science and Technology Northeast Normal University Changchun130024 China

Unmanned aerial vehicle (UAV)-enabled wireless powered communication networks (WPCNs) are promising technologies in 5G/6G wireless communications, while there are several challenges about UAV power allocation and scheduling to enhance the energy utilization efficiency, considering the existence of obstacles. In this work, we consider a UAV-enabled WPCN scenario that a UAV needs to cover the ground wireless devices (WDs). During the coverage process, the UAV needs to collect data from the WDs and charge them simultaneously. To this end, we formulate a joint-UAV power and three-dimensional (3D) trajectory optimization problem (JUPTTOP) to simultaneously increase the total number of the covered WDs, increase the time efficiency, and reduce the total flying distance of UAV so as to improve the energy utilization efficiency in the network. Due to the difficulties and complexities, we decompose it into two sub optimization problems, which are the UAV power allocation optimization problem (UPAOP) and UAV 3D trajectory optimization problem (UTTOP), respectively. Then, we propose an improved non-dominated sorting genetic algorithm-II with K-means initialization operator and Variable dimension mechanism (NSGA-II-KV) for solving the UPAOP. For UTTOP, we first introduce a pretreatment method, and then use an improved particle swarm optimization with Normal distribution initialization, Genetic mechanism, Differential mechanism and Pursuit operator (PSO-NGDP) to deal with this sub optimization problem. Simulation results verify the effectiveness of the proposed strategies under different scales and settings of the networks. Copyright © 2023, The Authors. All rights reserved.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Neural Combinatorial Optimization Algorithms for Solving Vehicle Routing Problems: A Comprehensive Survey with Perspectives

arXiv

引用

arXiv 2024年

作者： Wu, Xuan Wang, Di Wen, Lijie Xiao, Yubin Wu, Chunguo Wu, Yuesong Yu, Chaoyu Maskell, Douglas L. Zhou, You The Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education College of Computer Science and Technology Jilin university Changchun130012 China The Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly Nanyang Technological University 639798 Singapore The School of Software Tsinghua University Beijing100084 China The College of Computing and Data Science Nanyang Technological University 639798 Singapore

Although several surveys on Neural Combinatorial Optimization (NCO) solvers specifically designed to solve Vehicle Routing Problems (VRPs) have been conducted. These existing surveys did not cover the state-of-the-art (SOTA) NCO solvers emerged recently. More importantly, to provide a comprehensive taxonomy of NCO solvers with up-to-date coverage, based on our thorough review of relevant publications and preprints, we divide all NCO solvers into four distinct categories, namely Learning to Construct, Learning to Improve, Learning to Predict-Once, and Learning to Predict-Multiplicity solvers. Subsequently, we present the inadequacies of the SOTA solvers, including poor generalization, incapability to solve large-scale VRPs, inability to address most types of VRP variants simultaneously, and difficulty in comparing these NCO solvers with the conventional Operations Research algorithms. Simultaneously, we propose promising and viable directions to overcome these inadequacies. In addition, we compare the performance of representative NCO solvers from the Reinforcement, Supervised, and Unsupervised Learning paradigms across both small- and large-scale VRPs. Finally, following the proposed taxonomy, we provide an accompanying web page as a live repository for NCO solvers. Through this survey and the live repository, we hope to make the research community of NCO solvers for VRPs more thriving. Copyright © 2024, The Authors. All rights reserved.

关键词： Taxonomies

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：