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

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Xu, Bo Qiao, Xuening Zhang, Xiaokun Wan, Jiahui Liu, Xinyue Zong, Linlin Lin, Hongfei Dalian University of Technology School of Computer Science Dalian China Dalian University of Technology School of Software Dalian China

ISBN: (纸本)9798350386226

Generative conversational agents, driven by large language models, have gained widespread popularity. However, a significant drawback lies in their tendency to produce uncontrollable and unpredictable contents, thereby increasing the risk of generating malevolent responses that potentially exacerbate users' mental health issues. Although existing research on malevolence detection in dialogues addressed the modeling of interaction patterns in dialogues, the implicitly expressed emotion and user-specific context are often neglected. Addressing this gap, we propose a hypergraph-enhanced context modeling approach for detecting malevolence in mental health counseling dialogues. Our approach harnesses the emotion reasoning capabilities of large language models to generate implicit emotional prompts. Employing hypergraph neural networks, our approach effectively integrates emotional context, user-specific context, and interactive context, fusing them into high-order semantic representations using hypergraph convolution. Experimental results on two benchmark datasets, MDRDC and Dialogue Safety, demonstrate the superiority of our model over state-of-the-art baseline models, particularly in complex contextual scenarios. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

MOALF-UAV-MEC: Adaptive Multi-Objective Optimization for UAV-Assisted Mobile Edge Computing in Dynamic IoT Environments

引用

IEEE Internet of Things Journal 2025年第12期12卷 20736-20756页

作者： Al-Bakhrani, Ali A. Li, Mingchu Obaidat, Mohammad S. Amran, Gehad Abdullah Dalian University of Technology School of Software Dalian116024 China Albaydha University Al Bayda Yemen Jiangxi Normal University School of Computer and Information Engineering Jiangxi China School of Software Technology Dalian University of Technology Nanchang Dalian China University of Science and Technology School of Computer and Communication Engineering Beijing100083 China SRM University School of Computing Department of Computational Intelligence TN Kattankulathur603203 India The Amity University School of Engineering UP Noida201301 India Dalian University of Technology Department of Management Science and Engineering Dalian116024 China

The proliferation of Internet of Things (IoT) devices and computation-intensive applications has led to unprecedented demands on network resources and computing capabilities. This paper presents MOALF-UAV-MEC, a novel Multi-Objective Adaptive Learning Framework for UAV-Assisted Mobile Edge Computing (MEC) tailored for dynamic IoT environments. The framework integrates Multi-Objective Reinforcement Learning (MORL), Model Predictive Control (MPC), Adaptive Particle Swarm Optimization (APSO), and Lyapunov Optimization to optimize UAV trajectories, dynamic resource allocation, and system stability. MOALF-UAV-MEC addresses critical challenges in UAV-assisted MEC, including multi-objective optimization, adaptive resource allocation, energy efficiency, scalability, and quality of service guarantees. Our approach employs a unique burst mode feature for UAVs, enabling temporary performance boosts in high-demand situations. Extensive simulations demonstrate the framework's efficiency in enhancing task completion rates, energy efficiency, and long-term system sustainability. Results show a task completion rate of 94.50%, significantly outperforming existing approaches, with an average of 1,890 completed tasks per UAV and a load balancing efficiency of 96%. The framework exhibits robust adaptive behavior, achieving a 38% reduction in UAV route optimization and a 55% increase in task completion during high-load periods. This research contributes to the advancement of edge computing in IoT environments, offering a scalable and adaptive solution for deploying computational resources in areas with limited infrastructure, during temporary events, or in emergency situations. © 2014 IEEE.

关键词： Model predictive control

来源：评论

学校读者我要写书评

暂无评论

ViF-SD2E: a robust weakly-supervised framework for neural decoding

引用

Neural Computing and Applications 2025年第9期37卷 6645-6661页

作者： Feng, Jingyi Luo, Yong Song, Shuang Hu, Han National Engineering Research Center for Multimedia Software School of Computer Science Wuhan University Wuhan430072 China School of Information and Electronics Beijing Institute of Technology Beijing100081 China

Neural decoding plays a vital role in the interaction between the brain and the outside world. Our task in this paper is to decode the movement track of a finger directly based on the neural data. Existing neural decoding solutions primarily perform some preprocessing operations on neural data before feeding them into existing models (such as LSTM) for decoding. However, these solutions either are prone to overfitting or cannot well exploit the spatial and temporal information. In our previous observations, there is a symmetrical phenomenon between the unsupervised decoded trajectory and the ground truth trajectory within the activity space. This precisely motivates us to propose (or derive) a robust weakly-supervised framework (or model structure), called ViF-SD2E, for neural decoding. In particular, it consists of a space-division (SD) module and an exploration–exploitation (2E) strategy, to effectively exploit both the spatial information of the outside world and the temporal information of neural activity, where the SD2E output is analogized with the weak 0/1 vision feedback (ViF) label for training. Extensive experiments demonstrate the effectiveness of our method, which can sometimes be comparable to supervised counterparts. Therefore, we redirect our attention to the information (hidden in data) ViF-SD2E conveys to us. In other words, we believe that the advantage of ViF-SD2E lies in the fact that its processing steps are objectively determined by the inherent attributes (i.e., symmetry) of the neural data, or rather, the model structure is fixed. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Space division multiple access

来源：评论

学校读者我要写书评

暂无评论

Deterministic and Universal Truthful Mechanism for Fair Matching 18th

Deterministic and Universal Truthful Mechanism for Fair Ma...

引用

18th International Joint Conference on Theoretical computer Science-Frontier of Algorithmic Wisdom, IJTCS-FAW 2024

作者： Xu, Hao Zhang, Jinshan Wang, Feng School of Computer Science Wuhan University Wuhan China School of Software Technology Zhejiang University Ningbo China

ISBN: (纸本)9789819777518

This study addresses the bipartite graph weight maximum matching problem with a focus on achieving fairness. We introduce a deterministic truthful mechanism and a universal truthful mechanism tailored for fair matching, striving for an asymptotically lexicographically optimal solution. To tackle this, we employ a transformation function that reduces the original problem to a weight maximum matching problem, alongside an iterative algorithm based on TMHA and RTMHA (TMHA means Truthful Matroid House Allocation and RTMHA means Random Truthful Mechanism for Matroid House Allocation [18], they are both extensions of serial dictatorship and random serial dictatorship to cases where agents have ties.). Our approach yields an approximation ratio of at most 2 for deterministic truthful mechanisms and at most 1.58 for universally truthful mechanisms, while also requiring polynomial time complexity. By offering a balanced solution, our method contributes to equitable outcomes in matching scenarios. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Trajectory Privacy-preserving Method Combined with Prediction Perturbation in LBS

Journal of Network Intelligence

引用

Journal of Network Intelligence 2023年第2期8卷 559-585页

作者： Wang, Hui Song, Lei Shen, Zi-Hao Liu, Pei-Qian Liu, Kun School of Software Henan Polytechnic University Jiaozuo454000 China School of Computer and Technology Henan Polytechnic University Jiaozuo454000 China

Location-based service are widely used in the continuous query, making the protection of users’ location and trajectory privacy a hot topic. Differential privacy, the mainstream privacy protection method, is widely used in location-based service, but there are many problems with it: the privacy level of location points is improperly assigned, the additional noise is independent, and it does not meet the user’s demand in terms of trajectory availability. For this reason, we propose a trajectory privacy-preserving method combined with prediction perturbation in this paper. First, according to the topological relationship between geospatial points, a chain hash table is constructed to calculate privacy levels on the map;Secondly, to prevent attackers from noise filtering against independent noise, a noise sequence satisfying sequence indistinguishability is generated by combining the autocorrelation information of the user’s trajectories. At the same time, the noise ra-dius is reduced to avoid the noise location is far from the real location;Finally, a dummy location selection algorithm is proposed in combination with a Markov prediction model. It uses the genetic algorithm to filter the dummy location set, and utilizes the detection function to check the availability of the filtered perturbed site, to judge whether to use the location instead of the differentially private perturbed location. In addition, the number of user interactions with LBS is reduced by caching the query results of the fake location set. Through security analysis and experimental validation, this paper further demonstrates the effectiveness of the proposed method on privacy protection effect and service quality. © 2016, Taiwan Ubiquitous Information CO LTD.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

Characterizing the app recommendation relationships in the iOS app store: a complex network's perspective

引用

Science China(Information Sciences) 2025年第4期68卷 284-299页

作者： Gang HUANG Fuqi LIN Yun MA Haoyu WANG Qingxiang WANG Gareth TYSON Xuanzhe LIU Key Lab of High Confidence Software Technologies (Peking University) Ministry of Education School of Computer Science Peking University Institute for Artificial Intelligence Peking University School of Cyber Science and Engineering Huazhong University of Science and Technology Alibaba Group Hong Kong University of Science and Technology (Guangzhou)

Mobile apps have become widely adopted in our daily lives. To facilitate app discovery, most app markets provide recommendations for users, which may significantly impact how apps are accessed. However, little has been known about the underlying relationships and how they reflect(or affect) user behaviors. To fill this gap, we characterize the app recommendation relationships in the i OS app store from the perspective of the complex network. We collect a dataset containing over 1.3 million apps and 50 million app recommendations. This dataset enables us to construct a complex network that captures app recommendation relationships. Through this, we explore the recommendation relationships between mobile apps and how these relationships reflect or affect user behavior patterns. The insights gained from our research can be valuable for understanding typical user behaviors and identifying potential policy-violating apps.

关键词： mobile app recommendation complex network user behavior policy-violating app

来源：评论

学校读者我要写书评

暂无评论

E±cient Construction of Practical Python Call Graphs with Entity Knowledge Base

引用

International Journal of software Engineering and Knowledge Engineering 2024年第7期34卷 999-1024页

作者： Cao, Yulu Chen, Lin Chen, Zhifei Zhong, Jiacheng Zhang, Xiaowei Wang, Linzhang State Key Laboratory for Novel Software Technology Nanjing University Jiangsu Nanjing China School of Computer Science and Engineering Nanjing University of Science and Technology Jiangsu Nanjing China

Call graphs facilitate various tasks in software engineering. However, for the dynamic language Python, the complex language features and external library dependencies pose enormous challenges for building the call graphs of real projects. Some program analysis techniques used for call graph construction in other languages are impractical for Python. In this paper, we present STAR, a practical technique for the construction of Python static call graphs. We reformulate call graph construction as an entity identification task. STAR leverages inter-module summary and cross-project dependencies to construct a fine-grained entity knowledge base to identify the possible nodes and edges of the call graph in the code, and then construct the call graph. Our evaluation of three benchmarks shows that (1) STAR improves recall in three benchmarks compared to three baseline tools. Especially, STAR improves the recall of reachable nodes and reachable edges compared with the state-of-the-art tool by 11.3% and 9.8%, respectively;(2) STAR achieves comparable performance as three baseline tools in execution time and memory usage and is more efficient in large projects;(3) STAR can be effectively used for the task of detecting vulnerability propagation with real-world cases. We expect our results will attract more exploration of practical methods and improve the application of Python call graphs. © World Scientific Publishing Company.

关键词： Python

来源：评论

学校读者我要写书评

暂无评论

Improved Double Deep Q Network-Based Task Scheduling Algorithm in Edge Computing for Makespan Optimization

引用

Tsinghua Science and technology 2024年第3期29卷 806-817页

作者： Lei Zeng Qi Liu Shigen Shen Xiaodong Liu School of Computer Science Nanjing University of Information Science and TechnologyNanjing 210044China School of Software Nanjing University of Information Science and TechnologyNanjing 210044China School of Information Engineering Huzhou UniversityHuzhou 313000China School of Computing Edinburgh Napier UniversityEdinburghEH105DTUK

Edge computing nodes undertake an increasing number of tasks with the rise of business ***,how to efficiently allocate large-scale and dynamic workloads to edge computing resources has become a critical *** study proposes an edge task scheduling approach based on an improved Double Deep Q Network(DQN),which is adopted to separate the calculations of target Q values and the selection of the action in two networks.A new reward function is designed,and a control unit is added to the experience replay unit of the *** management of experience data are also modified to fully utilize its value and improve learning *** learning agents usually learn from an ignorant state,which is *** such,this study proposes a novel particle swarm optimization algorithm with an improved fitness function,which can generate optimal solutions for task *** optimized solutions are provided for the agent to pre-train network parameters to obtain a better cognition *** proposed algorithm is compared with six other methods in simulation *** show that the proposed algorithm outperforms other benchmark methods regarding makespan.

关键词： edge computing task scheduling reinforcement learning makespan Double Deep Q Network(DQN)

来源：评论

学校读者我要写书评

暂无评论

DIEONet:Domain-Invariant Information Extraction and Optimization Network for Visual Place Recognition

引用

computers, Materials & Continua 2025年第3期82卷 5019-5033页

作者： Shaoqi Hou Zebang Qin Chenyu Wu Guangqiang Yin Xinzhong Wang Zhiguo Wang School of Computer Science and Technology Xinjiang UniversityUrumqi830046China School of Information and Software Engineering University of Electronic Science and Technology ofChinaChengdu611731China Institute of Public Security Kash Institute of Electronics and Information IndustryKashi844000China

Visual Place Recognition(VPR)technology aims to use visual information to judge the location of agents,which plays an irreplaceable role in tasks such as loop closure detection and *** is well known that previous VPR algorithms emphasize the extraction and integration of general image features,while ignoring the mining of salient features that play a key role in the discrimination of VPR *** this end,this paper proposes a Domain-invariant Information Extraction and Optimization Network(DIEONet)for *** core of the algorithm is a newly designed Domain-invariant Information Mining Module(DIMM)and a Multi-sample Joint Triplet Loss(MJT Loss).Specifically,DIMM incorporates the interdependence between different spatial regions of the feature map in the cascaded convolutional unit group,which enhances the model’s attention to the domain-invariant static object *** Loss introduces the“joint processing of multiple samples”mechanism into the original triplet loss,and adds a new distance constraint term for“positive and negative”samples,so that the model can avoid falling into local optimum during *** demonstrate the effectiveness of our algorithm by conducting extensive experiments on several authoritative *** particular,the proposed method achieves the best performance on the TokyoTM dataset with a Recall@1 metric of 92.89%.

关键词： Visual place recognition domain-invariant information mining module multi-sample joint triplet loss

来源：评论

学校读者我要写书评

暂无评论

Automatic Positioning of Intelligent Mobile Robot Based on Improved Front-End Scanning Matching

Journal of Network Intelligence

引用

Journal of Network Intelligence 2025年第1期10卷 559-572页

作者： Wang, Hong Wang, Yi-Gui Zhang, Jie Department of Computer and Software Engineering Shandong College of Electronic Technology Jinan250200 China School of Computer Science and Technology Shandong Jianzhu University Jinan250101 China College of Agricultural Science and Technology Yana Royal Polytechnic University Chiang Mai50000 Thailand

Traditional autonomous navigation methods for mobile robots mainly rely on geometric feature-based LiDAR scan-matching algorithms, but in complex environments, this method is often affected due to the presence of moving objects, occlusions, and other interfering factors, resulting in a decrease in positioning accuracy. With the growing demand for robotics applications in logistics, security, exploration and other fields, the need for robust autonomous navigation and high-precision mapping in highly dynamic and complex environments is becoming more and more urgent. To solve this problem, an improved front-end scan matching algorithm based on Frequency Modulated Continuous Wave (FMCW) LiDAR is proposed in this paper. Firstly, by using the target Doppler velocity information provided by the FMCW LiDAR, we design a novel point cloud segmentation algorithm based on velocity clustering, which is able to effectively distinguish between stationary and moving objects, and avoid the dynamic interference affecting the position estimation. Secondly, we introduce the Gaussian Mixture Model Sampling Consistency (GMMSC) algorithm, which is more robust to reject the mis-matched pairs in the scanning matching process and improve the alignment accuracy. Finally, based on the residual high-quality matched pairs, we combine the classical ICP algorithm with the robust kernel function to further enhance the stability of the position estimation in the case of occlusion and local mismatch. The experimental results show that the proposed improved algorithm significantly improves the mapping capability of mobile robots in complex environments compared with the existing techniques. The average relative error of the improved front-end scanning matching algorithm is reduced by 40.6 % compared with the pre-improved one. © 2025, Taiwan Ubiquitous Information CO LTD. All rights reserved.

关键词： Mobile robots

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：