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

Demand Learning and Cooperative Deployment of UAV Networks

Chinese Journal of Electronics 2022年第3期31卷 408-415页

作者： ZHANG Xiao WANG Xuehe XU Xinping ZHAO Yingchao South-Central University for Nationalities Caritas Institute of Higher Education Sun Yat-sen University & Guangdong Key Laboratory of Big Data Analysis and Processing Nanyang Technological University

Unmanned aerial vehicle(UAV) as a powerful tool has found its applicability in assisting mobile users to deal with computation-intensive and delaysensitive applications(e.g., edge computing, high-speed Internet access, and local caching). However, deployment of UAV-aided mobile services(UMS) faces challenges due to the UAV limitation in wireless coverage and energy storage. Aware of such physical limitations, a future UMS system should be intelligent enough to self-plan trajectories and best offer computational capabilities to mobile users. There are important issues regarding the UAV-user interaction, UAV-UAV cooperation for sustainable service provision, and dynamic UMS pricing. These networking and resource management issues are largely overlooked in the literature and this article presents intelligent solutions for cooperative UMS deployment and operation. Mobile users' locations are generally private information and changing over time. How to learn on-demand users' truthful location reporting is important for determining optimal UAV deployment in serving all the users fairly. After addressing the truthful UAV-user interaction issue via game theory, we further study the UAV network sustainability for UMS provision by minimizing the energy consumption cost during deployment and seeking UAV-UAV cooperation. Finally, for profit-maximizing purpose, we analyze the cooperative UAVs' deployment, capacity allocation, and dynamic service pricing.

关键词： UAV network sustainability UMS provision local caching path planning delay-sensitive applications future UMS system UAV-UAV cooperation Internet access wireless coverage mobile robots energy storage optimal UAV deployment Internet control engineering computing autonomous aerial vehicles unmanned aerial vehicle dynamic service pricing learning (artificial intelligence) game theory mobile computing UAV-aided mobile services edge computing UMS deployment sustainable service provision resource allocation UAV-user interaction issue on-demand users resource management issues dynamic UMS pricing computation-intensive applications

来源：评论

学校读者我要写书评

暂无评论

TreeVI: Reparameterizable Tree-structured Variational Inference for Instance-level Correlation Capturing 38

TreeVI: Reparameterizable Tree-structured Variational Infere...

引用

38th Conference on Neural Information processing Systems, NeurIPS 2024

作者： Xiao, Junxi Su, Qinliang School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China

Mean-field variational inference (VI) is computationally scalable, but its highly-demanding independence requirement hinders it from being applied to wider scenarios. Although many VI methods that take correlation into account have been proposed, these methods generally are not scalable enough to capture the correlation among data instances, which often arises in applications involving graphs or explicit constraints among instances. In this paper, we developed the Tree-structured Variational Inference (TreeVI)2, which uses a tree to capture the correlation among latent variables in the posterior. We show that samples from the tree-structured posterior can be reparameterized efficiently and parallelly, making its training cost just 2 or 3 times that of VI under the mean-field assumption. To capture correlation with more complicated structure, the TreeVI is further extended to the multiple-tree case. Furthermore, we show that the underlying tree structure can be automatically learned from training data. With experiments on synthetic datasets, constrained clustering, user matching and link prediction, we demonstrate the efficacy of TreeVI in capturing instance-level correlation in posteriors and enhancing the performance of downstream applications. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Iterated Local Search Algorithm for the Heterogeneous Fixed Multi-compartment Vehicle Routing Problem

引用

IAENG International Journal of Applied Mathematics 2025年第5期55卷 1084-1091页

作者： Ma, Hengrui Hou, Yan-e Xu, Haizhe Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng475004 China

This paper addresses the multi-compartment vehicle routing problem with heterogeneous fleets with maximum number limitations. To solve this problem, we propose an iterated local search algorithm integrating with multiple strategies to find a solution with minimum total cost. The proposed algorithm starts by generating an initial solution using a cheapest insertion heuristic. Then, a load adjustment strategy is applied to transfer customers from larger vehicle to smaller one. Four neighborhood operators such as relocation, 2-opt, exchange and or-opt, are applied sequentially to refine the solution, allowing for vehicle type adjustments during the local search process. Additionally, a perturbation mechanism based on destroy-and-repair principle is introduced to explore a wider search space. Meanwhile, an acceptance strategy based on route load variance is designed to permit the acceptance of suboptimal solutions. Finally, the best global solution undergoes further optimization through a vehicle assignment strategy to improve vehicle allocation. Experimental results on benchmark instances demonstrate that the proposed algorithm outperforms existing methods. © (2025), (International Association of Engineers). All rights reserved.

关键词： Local search (optimization)

来源：评论

学校读者我要写书评

暂无评论

YOLO-FNC: An Improved Method for Small Object Detection in Remote Sensing Images Based on YOLOv7

IAENG International Journal of Computer Science

引用

IAENG International Journal of Computer Science 2024年第9期51卷 1281-1290页

作者： Dang, Lanxue Liu, Gang Hou, Yan-e Han, Hongyu Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng475004 China School of Computer and Information Engineering Henan University Kaifeng475004 China School of Computer and Information Engineering Henan University Kaifeng475004 China

The detection algorithms of small objects in remote sensing images is often challenging due to the complex background and limited pixels. This can lead to reduced accuracy in detection and an increased number of missed small objects. So this paper introduces YOLOFNC, an enhanced network based on YOLOv7. To improve the model’s ability to capture features of small objects, an enhanced C3-Faster module based on the C3 module is designed and integrated into the YOLOv7 network. This module helps extract more features related to small objects. Additionally, we employ Normalized Wasserstein Distance (NWD) fusion GIoU as a novel loss function to refine the accuracy of network optimization weights and the small object regression framework. Furthermore, a coordinated attention (CA) mechanism is incorporated at strategic locations in the model to reduce redundant information in the feature layer and prevent the loss of important small object features. we conduct comparison experiments between YOLO-FNC and other commonly used object detection algorithms on DIOR, AITOD, and VisDrone datasets. The experimental results show that YOLO-FNC achieves 84.4% mAP on the DIOR dataset, 35.9% mAP on the AI-TOD dataset, and 52.6% mAP on the VisDrone dataset. Compared to YOLOv7 and other remote sensing object detection models, YOLO-FNC demonstrates better performance in object detection. © (2024), (International Association of Engineers). All Rights Reserved.

关键词： Proximity sensors

来源：评论

学校读者我要写书评

暂无评论

Learning Transition Patterns by Large Language Models for Sequential Recommendation 31

Learning Transition Patterns by Large Language Models for Se...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Zhai, Jianyang Mai, Zi-Feng Zheng, Dongyi Wang, Chang-Dong Zheng, Xiawu Li, Hui Yang, Feidiao Tian, Yonghong Sun Yat-sen University China Pengcheng Laboratory China Guangdong Key Laboratory of Big Data Analysis and Processing China School of Informatics Xiamen University China Peking University China

ISBN: (纸本)9798891761964

Large Language Models (LLMs) have demonstrated powerful performance in sequential recommendation due to their robust language modeling and comprehension capabilities. In such paradigms, the item texts of interaction sequences are formulated as sentences, and LLMs are utilized to learn language representations or directly generate target item texts by incorporating instructions. Despite their promise, these methods solely focus on modeling the mapping from sequential texts to target items, neglecting the relationship between the items in an interaction sequence. This results in a failure to learn the transition patterns between items, which reflect the dynamic change in user preferences and are crucial for predicting the next item. To tackle this issue, we propose a novel framework for mapping the sequential item texts to the sequential item IDs, named ST2SI. Specifically, we first introduce multi-query input and item linear projection (ILP) to model the conditional probability distribution of items. Then, we further propose ID alignment to address misalignment between item texts and item IDs by instruction tuning. Finally, we propose efficient ILP tuning to adapt flexibly to different scenarios, requiring only training a linear layer to achieve competitive performance. Extensive experiments on six real-world datasets show that our approach outperforms the best baselines by 7.33% in NDCG@10, 4.65% in Recall@10, and 8.42% in MRR. © 2025 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

A remote sensing work-flow recommendation algorithm based on logical structure

A remote sensing work-flow recommendation algorithm based on...

引用

2022 International Conference on Signal processing, Computer Networks, and Communications, SPCNC 2022

作者： Zuo, Xianyu Wu, Yaohua Liu, Yang Lin, Yinghao Zhang, Lei Henan Key Laboratory of Big Data Analysis and Processing School of Computer and Information Engineering Henan University Kaifeng475001 China

ISBN: (纸本)9781510664616

With the development of remote sensing products towards the direction of civilianization and popularization, work-flow customization plays an important role in the production of remote sensing products. The traditional customized work-flow model has large time cost, complex operation and high requirements for professional knowledge. The work-flow recommendation system can improve the construction efficiency of remote sensing work-flow to some extent and assist users to design high-quality remote sensing work-flow models. However, most of the existing remote sensing work-flow modeling methods ignore the logical structure characteristics of the work-flow, leading to large errors in the calculation results of similarity. Difficult to make work-flow recommendations effectively. Therefore, this paper proposes a customized recommendation algorithm for remote sensing work-flow based on logical structure. By focusing on logical structure, the reliability of similarity calculation between work-flow is improved, so as to find similar work-flow to help users recommend the next modeling node. Firstly, the work-flow model needs to be preprocessed: the user converts the constructed work-flow model into a process structure tree by using Petri net workflow, and uses the path table generation algorithm based on logical structure to convert the model information into data information and store it in the database for subsequent data processing;Then the flow data in the flow tree set was converted into a path table according to certain rules, and then the longest common subsequence similarity of each data in the path table was calculated to obtain the similarity calculation results based on the logical structure characteristics, the most similar work-flow in the work-flow library is found and the recommendation is made for the user. The method proposed in this paper is evaluated experimentally on the real data set, in terms of recall, precision and F1-score, which shows that the method

关键词： Remote sensing

来源：评论

学校读者我要写书评

暂无评论

AMHF-TP:Multifunctional therapeutic peptides prediction based on multi-granularity hierarchical features

引用

Quantitative Biology 2025年第1期13卷 127-141页

作者： Shouheng Tuo YanLing Zhu Jiangkun Lin Jiewei Jiang School of Computer Science and Technology Xi’an University of Posts and TelecommunicationsXi’anChina Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’anChina Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’anChina School of Electronic Engineering Xi’an University of Posts and TelecommunicationsXi’anChina

Multifunctional therapeutic peptides(MFTP)hold immense potential in diverse therapeutic contexts,yet their prediction and identification remain challenging due to the limitations of traditional methodologies,such as extensive training durations,limited sample sizes,and inadequate generalization *** address these issues,we present AMHF-TP,an advanced method for MFTP recognition that utilizes attention mechanisms and multi-granularity hierarchical features to enhance *** AMHF-TP is composed of four key components:a migration learning module that leverages pretrained models to extract atomic compositional features of MFTP sequences;a convolutional neural network and selfattention module that refine feature extraction from amino acid sequences and their secondary structures;a hypergraph module that constructs a hypergraph for complex similarity representation between MFTP sequences;and a hierarchical feature extraction module that integrates multimodal peptide sequence *** with leading methods,the proposed AMHF-TP demonstrates superior precision,accuracy,and coverage,underscoring its effectiveness and robustness in MFTP *** comparative analysis of separate hierarchical models and the combined model,as well as with five contemporary models,reveals AMHFTP’s exceptional performance and stability in recognition tasks.

关键词： deep learning hypergraph multifunctional therapeutic peptides multi-granularity hierarchical features

来源：评论

学校读者我要写书评

暂无评论

Edge Computing Task Scheduling with Joint Blockchain and Task Caching in Industrial Internet

引用

Computers, Materials & Continua 2023年第4期75卷 2101-2117页

作者： Yanping Chen Xuyang Bai Xiaomin Jin Zhongmin Wang Fengwei Wang Li Ling School of Computer Science and Technology Xi’an University of Posts and TelecommunicationsXi’an710121China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an710121China Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’anShaanxi710121China ZTE Corporation Shenzhen51805China

Deploying task caching at edge servers has become an effectiveway to handle compute-intensive and latency-sensitive tasks on the industrialinternet. However, how to select the task scheduling location to reduce taskdelay and cost while ensuring the data security and reliable communicationof edge computing remains a challenge. To solve this problem, this paperestablishes a task scheduling model with joint blockchain and task cachingin the industrial internet and designs a novel blockchain-assisted cachingmechanism to enhance system security. In this paper, the task schedulingproblem, which couples the task scheduling decision, task caching decision,and blockchain reward, is formulated as the minimum weighted cost problemunder delay constraints. This is a mixed integer nonlinear problem, which isproved to be nonconvex and NP-hard. To solve the optimal solution, thispaper proposes a task scheduling strategy algorithm based on an improvedgenetic algorithm (IGA-TSPA) by improving the genetic algorithm initializationand mutation operations to reduce the size of the initial solutionspace and enhance the optimal solution convergence speed. In addition,an Improved Least Frequently Used algorithm is proposed to improve thecontent hit rate. Simulation results show that IGA-TSPA has a faster optimalsolution-solving ability and shorter running time compared with the existingedge computing scheduling algorithms. The established task scheduling modelnot only saves 62.19% of system overhead consumption in comparison withlocal computing but also has great significance in protecting data security,reducing task processing delay, and reducing system cost.

关键词： Edge computing task scheduling blockchain task caching industrial security

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Fingerprint Recognition via Federated Adaptive Domain Generalization

引用

Computers, Materials & Continua 2025年第3期82卷 5035-5055页

作者： Yonghang Yan Xin Xie Hengyi Ren Ying Cao Hongwei Chang Henan Key Laboratory of Big Data Analysis and Processing Computer and Information EngineeringHenan UniversityKaifeng475004China College of Information Science and Technology Nanjing Forestry UniversityNanjing210037China Henan Branch China Life Insurance Co.Ltd.Zhengzhou450000China

Fingerprint features,as unique and stable biometric identifiers,are crucial for identity ***,traditional centralized methods of processing these sensitive data linked to personal identity pose significant privacy risks,potentially leading to user data *** Learning allows multiple clients to collaboratively train and optimize models without sharing raw data,effectively addressing privacy and security ***,variations in fingerprint data due to factors such as region,ethnicity,sensor quality,and environmental conditions result in significant heterogeneity across *** heterogeneity adversely impacts the generalization ability of the global model,limiting its performance across diverse *** address these challenges,we propose an Adaptive Federated Fingerprint Recognition algorithm(AFFR)based on Federated *** algorithm incorporates a generalization adjustment mechanism that evaluates the generalization gap between the local models and the global model,adaptively adjusting aggregation weights to mitigate the impact of heterogeneity caused by differences in data quality and feature ***,a noise mechanism is embedded in client-side training to reduce the risk of fingerprint data leakage arising from weight disclosures during model *** conducted on three public datasets demonstrate that AFFR significantly enhances model accuracy while ensuring robust privacy protection,showcasing its strong application potential and competitiveness in heterogeneous data environments.

关键词： Fingerprint recognition privacy protection federated learning adaptive weight adjustment

来源：评论

学校读者我要写书评

暂无评论

Hyperbolic lorentz attention for synthetic lethality prediction 3

Hyperbolic lorentz attention for synthetic lethality predict...

引用

3rd International Conference on Biomedical and Intelligent Systems, IC-BIS 2024

作者： Zhang, Ge Chen, Yitong Kou, Xuye Zhang, Zhou School of Computer and Information Engineering Henan University Kaifeng475004 China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng475004 China

ISBN: (纸本)9781510681279

Synthetic lethal interactions are critical genetic interactions that have been discovered for identifying new drug targets and potential cancer drug combination strategies. As a targeted approach to selectively kill cancer cells, it has attracted great attention in the field of cancer treatment. However, with the rapid growth of high-throughput data, effective identification of synthetic lethal interactions remains challenging. Although many graph topology methods focus on predicting SL interactions, heterogeneous graphs that exist in the real world tend to be scale-free, where the number of high-order neighbor nodes of high-degree nodes grows exponentially. The graph embedding method based on Euclidean space may not be able to effectively capture the internal hierarchical structure of the scale-free network, and there is not enough space to accommodate the nodes, making the node embedding highly distorted, which greatly limits the modeling ability. In this paper, we propose a model named HLASL based on the hyperbolic Lorentz attention mechanism, it ensures that the learned node features follow a Lorentz manifold. Specifically, in hyperbolic space, we use Lorentzian manifolds to encode heterogeneous information from KGs and information about synthetic lethality. In addition, we introduce the Lorenz knowledge graph attention mechanism to distinguish the weights of different information from the hyperbolic space to optimize gene embedding. Experiments on two datasets show that HLASL outperforms several state-of-the-art baseline methods in synthetic lethality prediction. © 2024 SPIE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：