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

arXiv 2023年

作者： Li, Jiahui Sun, Geng Duan, Lingjie Wu, Qingqing The College of Computer Science and Technology Jilin University Changchun130012 China Pillar of Engineering Systems and Design Singapore University of Technology and Design Singapore487372 Singapore Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China The Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China

Unmanned aerial vehicle (UAV) network is a promising technology for assisting Internet-of-Things (IoT), where a UAV can use its limited service coverage to harvest and disseminate data from IoT devices with low transmission abilities. The existing UAV-assisted data harvesting and dissemination schemes largely require UAVs to frequently fly between the IoTs and access points, resulting in extra energy and time costs. To reduce both energy and time costs, a key way is to enhance the transmission performance of IoT and UAVs. In this work, we introduce collaborative beamforming into IoTs and UAVs simultaneously to achieve energy and time-efficient data harvesting and dissemination from multiple IoT clusters to remote base stations (BSs). Except for reducing these costs, another non-ignorable threat lies in the existence of the potential eavesdroppers, whereas the handling of eavesdroppers often increases the energy and time costs, resulting in a conflict with the minimization of the costs. Moreover, the importance of these goals may vary relatively in different applications. Thus, we formulate a multi-objective optimization problem (MOP) to simultaneously minimize the mission completion time, signal strength towards the eavesdropper, and total energy cost of the UAVs. We prove that the formulated MOP is an NP-hard, mixed-variable optimization, and large-scale optimization problem. Thus, we propose a swarm intelligence-based algorithm to find a set of candidate solutions with different trade-offs which can meet various requirements in a low computational complexity. We also show that swarm intelligence methods need to enhance solution initialization, solution update, and algorithm parameter update phases when dealing with mixed-variable optimization and large-scale problems. Simulation results demonstrate the proposed algorithm outperforms state-of-the-art swarm intelligence algorithms and also show that the proposed method can reduce time and energy costs significantly

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Machine learning in diagnosis of coronary artery disease

引用

Chinese Medical Journal 2021年第4期134卷 401-403页

作者： Hao Ling Zi-Yuan Guo Un-Lin Tan Ren-Chu Guan Jing-Bo Chen Chun-Li Department of Cardiology the Second Hospital of Jilin UniversityChangchunJilin 130012China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and TechnologyJilin UniversityChangchunJilin 130012China

Cardiovascular diseases continue to be the foremost cause of death among both males and females worldwide.[1]Coronary artery disease(CAD)represents a major subtype of cardiovascular *** evidence has highlighted a worldwide increase in incidence of CAD clinical manifestations regardless of geographical region.[2]Despite a steady decline in CAD mortality in western countries over the past few decades,approximately one-third of the population suffering from CAD will succumb to the *** and accurate diagnostic decisions are crucial for patients with CAD and aid in guidance for effective treatment.

关键词： CAD diagnosis continue

来源：评论

学校读者我要写书评

暂无评论

A Novel Distributed Differential Privacy Preserving Based on Random Forest in Data Centers 9th

A Novel Distributed Differential Privacy Preserving Based on...

引用

9th International Conference on Information Technology and Quantitative Management, ITQM 2022

作者： Wang, Xi Fan, Weibei He, Jing Chi, Chi-Hung Suzhou Institute of Industrial Technology Suzhou215006 China College of Computer Nanjing University of Posts and Telecommunications Nanjing210003 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China Department of Neuroscience University of Oxford OxfordOX1 3QR United Kingdom School of Computer Nanyang Technological University Nanyang Avenue 639798 Singapore

Traditional privacy-preserving technologies have been unable to provide adequate protection and are vulnerable to background knowledge. MapReduce is parallel distributed computing model which has the advantages of good scalability and high fault tolerance. In this paper, we design a differential privacy protection based on MapReduce for the security problems faced in the distributed environment. Firstly, we propose a random forest algorithm DPMRRF that satisfies differential privacy under the MapReduce framework. Secondly, we use the MapReduce framework in the Hadoop platform to make the classification results satisfy differential privacy by adding random noise values to the leaf nodes. Finally, through the design of the feature selection scheme combined with the index mechanism, three different privacy budget allocation methods are adopted, namely, equal distribution, equal distribution and equal distribution. Experiments show that the algorithm has better classification accuracy while ensuring data availability. The proposed algorithm effectively improves the classification accuracy and operating efficiency, and greatly reduces the amount of computation. © 2022 The Authors. Published by Elsevier B.V.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Deep Feature-Based Text Clustering and Its Explanation

Deep Feature-Based Text Clustering and Its Explanation

引用

International Conference on Data engineering

作者： Renchu Guan Hao Zhang Yanchun Liang Fausto Giunchiglia Lan Huang Xiaoyue Feng Key Laboratory for Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun China DISI University of Trento Trento Italy

Text clustering is a critical step in text data analysis and has been extensively studied by the text mining community. Most existing text clustering algorithms are based on the bag-of-words model, which faces the high-dimensional and sparsity problems and ignores text structural and sequence information. Deep learning-based models such as convolutional neural networks and recurrent neural networks regard texts as sequences but lack supervised signals and explainable results. In this paper, we propose a deep feature-based text clustering (DFTC) framework that incorporates pretrained text encoders into text clustering tasks. This model, which is based on sequence representations, breaks the dependency on supervision. The experimental results show that our model outperforms classic text clustering algorithms on almost all the considered datasets. In addition, the explanation of the clustering results is significant for understanding the principles of the deep learning approach. Our proposed clustering framework includes an explanation module that can help users understand the meaning and quality of the clustering results. Our code is available at https://***/KEAML-JLU/DeepTextClustering.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Prompt Tuning Pushes Farther, Contrastive Learning Pulls Closer: A Two-Stage Approach to Mitigate Social Biases

arXiv

引用

arXiv 2023年

作者： Li, Yingji Du, Mengnan Wang, Xin Wang, Ying College of Computer Science and Technology Jilin University Changchun China Department of Data Science New Jersey Institute of Technology Newark United States School of Artificial Intelligence Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

As the representation capability of Pre-trained Language Models (PLMs) improve, there is growing concern that they will inherit social biases from unprocessed corpora. Most previous debiasing techniques used Counterfactual Data Augmentation (CDA) to balance the training corpus. However, CDA slightly modifies the original corpus, limiting the representation distance between different demographic groups to a narrow range. As a result, the debiasing model easily fits the differences between counterfactual pairs, which affects its debiasing performance with limited text resources. In this paper, we propose an adversarial training-inspired two-stage debiasing model using Contrastive learning with Continuous Prompt Augmentation (named CCPA) to mitigate social biases in PLMs’ encoding. In the first stage, we propose a data augmentation method based on continuous prompt tuning to push farther the representation distance between sample pairs along different demographic groups. In the second stage, we utilize contrastive learning to pull closer the representation distance between the augmented sample pairs and then fine-tune PLMs’ parameters to get debiased encoding. Our approach guides the model to achieve stronger debiasing performance by adding difficulty to the training process. Extensive experiments show that CCPA outperforms baselines in terms of debiasing performance. Meanwhile, experimental results on the GLUE benchmark show that CCPA retains the language modeling capability of PLMs. Copyright © 2023, The Authors. All rights reserved.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Community discovery algorithm and its technical improvement based on link structure–taking web community algorithm as an example

Community discovery algorithm and its technical improvement ...

引用

International Conference on Applications and Techniques in Cyber Intelligence, ATCI 2020

作者： Gao, Rui Yang, Wenzhe Shi, Xiaohu Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University 2699 Qianjin Street Changchun130012 China

ISBN: (纸本)9783030539795

Link analysis is an important way to discover potential web communities. This paper analyzes the characteristics of the Web link structure, and studies the traditional maximum flow algorithm and the maximum flow algorithm based on HITS algorithm for edge capacity allocation. The traditional maximum flow problem, but there are still shortcomings. Based on the analysis of existing link similarity definitions, this paper proposes a new definition of link similarity and topic dissimilarity to better describe the relationship between linked pages, and to measure based on link similarity and topic dissimilarity. The similarity of the pages gives a more reasonable and efficient maximum flow-side capacity allocation scheme. The community discovery of 6 topics shows that the maximum flow algorithm proposed in this paper using the link similarity and topic dissimilarity model to allocate edge capacity can better solve the problems of existing algorithms and significantly improve the quality of the Web community. This paper proposes new methods and ideas for page similarity measurement, and provides new strategies for improving the Web community discovery algorithm based on link analysis. © The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Task Delay and Energy Consumption Minimization for Low-altitude MEC via Evolutionary Multi-objective Deep Reinforcement Learning

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

HVIS: A Human-like Vision and Inference System for Human Motion Prediction 39

HVIS: A Human-like Vision and Inference System for Human Mot...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Lyu, Kedi Chen, Haipeng Liu, Zhenguang Yin, Yifang Lin, Yukang Jiao, Yingying College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China The State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou China Hangzhou High-Tech Zone (Binjiang) Institute of Blockchain and Data Security Hangzhou China Institute for Infocomm Research (I2R) A*STAR Singapore Tsinghua Shenzhen International Graduate School Nanshan District Shenzhen China

ISBN: (纸本)157735897X

Grasping the intricacies of human motion, which involve perceiving spatio-temporal dependence and multi-scale effects, is essential for predicting human motion. While humans inherently possess the requisite skills to navigate this issue, it proves to be markedly more challenging for machines to emulate. To bridge the gap, we propose the Human-like Vision and Inference System (HVIS) for human motion prediction, which is designed to emulate human observation and forecast future movements. HVIS comprises two components: the human-like vision encode (HVE) module and the human-like motion inference (HMI) module. The HVE module mimics and refines the human visual process, incorporating a retina-analog component that captures spatiotemporal information separately to avoid unnecessary crosstalk. Additionally, a visual cortex-analogy component is designed to hierarchically extract and treat complex motion features, focusing on both global and local features of human poses. The HMI is employed to simulate the multi-stage learning model of the human brain. The spontaneous learning network simulates the neuronal fracture generation process for the adversarial generation of future motions. Subsequently, the deliberate learning network is optimized for hard-to-train joints to prevent misleading learning. Experimental results demonstrate that our method achieves new state-of-the-art performance, significantly outperforming existing methods by 19.8% on Human3.6M, 15.7% on CMU Mocap, and 11.1% on G3D. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：