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

arXiv 2024年

作者： Liu, Saichao Sun, Geng Li, Jiahui Liang, Shuang Wu, Qingqing Wang, Pengfei Niyato, Dusit The 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 The College of Computing and Data Science Nanyang Technological University 639798 Singapore The School of Information Science and Technology Northeast Normal University Changchun130117 China The Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China The School of Computer Science and Technology Dalian University of Technology Dalian116024 China

In this paper, we investigate an unmanned aerial vehicle (UAV)-assistant air-to-ground communication system, where multiple UAVs form a UAV-enabled virtual antenna array (UVAA) to communicate with remote base stations by utilizing collaborative beamforming. To improve the work efficiency of the UVAA, we formulate a UAV-enabled collaborative beamforming multi-objective optimization problem (UCBMOP) to simultaneously maximize the transmission rate of the UVAA and minimize the energy consumption of all UAVs by optimizing the positions and excitation current weights of all UAVs. This problem is challenging because these two optimization objectives conflict with each other, and they are non-concave to the optimization variables. Moreover, the system is dynamic, and the cooperation among UAVs is complex, making traditional methods take much time to compute the optimization solution for a single task. In addition, as the task changes, the previously obtained solution will become obsolete and invalid. To handle these issues, we leverage the multi-agent deep reinforcement learning (MADRL) to address the UCBMOP. Specifically, we use the heterogeneous-agent trust region policy optimization (HATRPO) as the basic framework, and then propose an improved HATRPO algorithm, namely HATRPO-UCB, where three techniques are introduced to enhance the performance. Simulation results demonstrate that the proposed algorithm can learn a better strategy compared with other methods. Moreover, extensive experiments also demonstrate the effectiveness of the proposed techniques. Copyright © 2024, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

CPSketch: A ‘Couple’ Sketch-based Heavy Flow Detection Method

引用

Journal of Network and Computer Applications 2025年

作者： Renpin Yao Yang Cao Yunhe Cui Yi Chen Chun Guo Guowei Shen Engineering Research Center of Text Computing & Cognitive Intelligence Guizhou University College of Computer Science and Technology Guizhou University State Key Laboratory of Public Big Data Guizhou University

One of the core challenges in network measurement for large-scale networks is the accurate and efficient identification of heavy flows. This task has grown increasingly complex due to limited memory resources and the dynamic nature of network traffic patterns. Most current heavy flow detection methods fail to fully consider the mutual collisions between large flows and their sparse distribution, which are caused by the combined effects of hash collisions and the heavy-tailed distribution of network traffic, resulting in an inefficient use of limited memory resources. Additionally, existing approaches uniformly treat all flows. As a result, when the network contains many small flows, heavy flows are frequently and erroneously replaced. To address these issues, we propose CPSketch, a novel method that combines sketch with ‘couple’ buckets to enhance heavy flows detection accuracy. CPSketch optimizes memory utilization by leveraging cold buckets to store more heavy flows. Specifically, it accurately estimates flow sizes by monitoring the number of matched packets for candidate flows in real-time. For small flows, CPSketch rapidly identifies and evicts them based on flow ratios. For other flows, CPSketch calculates replacement probabilities using multidimensional statistical information. To protect heavy flows that have been incorrectly evicted, CPSketch employs a global hash function to provide additional storage opportunities and dynamically constructs couple buckets for these heavy flows. Moreover, CPSketch extends the selection range for minimum flows by leveraging couple buckets in the flow replacement policy, effectively mitigating the impact of hash limitations and improving memory efficiency. Experimental results from trace-driven simulations and Open vSwitch (OVS) tests demonstrate that CPSketch outperforms existing methods in accuracy, even under constrained memory and high traffic loads. It achieves improvements of up to 14.74% in F1-score while reducing the

关键词：

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous influence of individuals’ behavior on mask efficacy in gathering environments

引用

Frontiers of engineering Management 2022年第4期9卷 550-562页

作者： Haochen SUN Xiaofan LIU Zhanwei DU Ye WU Haifeng ZHANG Xiaoke XU College of Information and Communication Engineering Dalian Minzu UniversityDalian 116600China Web Mining Laboratory Department of Media and CommunicationCity University of Hong KongHong KongChina WHO Collaborating Centre for Infectious Disease Epidemiology and Control School of Public HealthLi Ka Shing Faculty of MedicineThe University of Hong KongHong KongChina Laboratory of Data Discovery for Health Hong Kong Science and Technology ParkHong KongChina Computational Communication Research Center Beijing Normal University(Zhuhai)Zhuhai 519087China School of Journalism and Communication Beijing Normal UniversityBeijing 100875China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical ScienceAnhui UniversityHefei 230601China

Wearing masks is an easy way to operate and popular measure for preventing *** masks can slow down the spread of viruses,their efficacy in gathering environments involving heterogeneous person-to-person contacts remains ***,we aim to investigate the epidemic prevention effect of masks in different real-life gathering *** study uses four real interpersonal contact datasets to construct four empirical networks to represent four gathering *** transmission of COVID-19 is simulated using the Monte Carlo simulation *** heterogeneity of individuals can cause mask efficacy in a specific gathering environment to be different from the baseline efficacy in general ***,the heterogeneity of gathering environments causes the epidemic prevention effect of masks to *** masks can greatly reduce the probability of clustered epidemics and the infection scale in primary schools,high schools,and ***,the use of masks alone in primary schools and hospitals cannot control *** high schools with social distancing between classes and in workplaces where the interpersonal contact is relatively sparse,masks can meet the need for *** the heterogeneity of individual behavior,if individuals who are more active in terms of interpersonal contact are prioritized for mask-wearing,the epidemic prevention effect of masks can be ***,asymptomatic infection has varying effects on the prevention effect of masks in different *** effect can be weakened or eliminated by increasing the usage rate of masks in high schools and ***,the effect on primary schools and hospitals cannot be *** study contributes to the accurate evaluation of mask efficacy in various gathering environments to provide scientific guidance for epidemic prevention.

关键词： COVID-19 masks behavioral heterogeneity asymptomatic infection

来源：评论

学校读者我要写书评

暂无评论

Federated Digital Twin Construction via Distributed Sensing: A Game-Theoretic Online Optimization with Overlapping Coalitions

arXiv

引用

arXiv 2025年

作者： Chen, Ruoyang Yi, Changyan Zhou, Fuhui Kang, Jiawen Wu, Yuan Niyato, Dusit College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing211106 China College of Electronic and Information Engineering Nanjing University of Astronautics and Aeronautics Nanjing210016 China School of Automation Guangdong University of Technology Guangzhou510006 China State Key Laboratory of Internet of Things for Smart City University of Macau China Department of Computer and Information Science University of Macau China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore

In this paper, we propose a novel federated framework for constructing the digital twin (DT) model, referring to a living and self-evolving visualization model empowered by artificial intelligence, enabled by distributed sensing under edge-cloud collaboration. In this framework, the DT model to be built at the cloud is regarded as a global one being split into and integrating from multiple functional components, i.e., partial-DTs, created at various edge servers (ESs) using feature data collected by associated sensors. Considering time-varying DT evolutions and heterogeneities among partial-DTs, we formulate an online problem that jointly and dynamically optimizes partial-DT assignments from the cloud to ESs, ES-sensor associations for partial-DT creation, and as well as computation and communication resource allocations for global-DT integration. The problem aims to maximize the constructed DT’s model quality while minimizing all induced costs, including energy consumption and configuration costs, in long runs. To this end, we first transform the original problem into an equivalent hierarchical game with an upper-layer two-sided matching game and a lower-layer overlapping coalition formation game. After analyzing these games in detail, we apply the Gale-Shapley algorithm and particularly develop a switch rules-based overlapping coalition formation algorithm to obtain short-term equilibria of upper-layer and lower-layer subgames, respectively. Then, we design a deep reinforcement learning-based solution, called DMO, to extend the result into a long-term equilibrium of the hierarchical game, thereby producing the solution to the original problem. Simulations show the effectiveness of the introduced framework, and demonstrate the superiority of the proposed solution over counterparts. Copyright © 2025, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

SED-MVS: Segmentation-Driven and Edge-Aligned Deformation Multi-View Stereo with Depth Restoration and Occlusion Constraint

arXiv

引用

arXiv 2025年

作者： Yuan, Zhenlong Yang, Zhidong Cai, Yujun Wu, Kuangxin Liu, Mufan Zhang, Dapeng Jiang, Hao Li, Zhaoxin Wang, Zhaoqi The Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Australia The Information Technology Department Hunan Police Academy Changsha410100 China Cooperative MediaNet Innovation Center Shanghai Jiao Tong University Shanghai200240 China DSLAB School of Information Science & Engineering Lanzhou University 730000 China Agricultural Information Institute Chinese Academy of Agricultural Sciences Key Laboratory of Agricultural Big Data Ministry of Agriculture and Rural Affairs 100081 China

Recently, patch-deformation methods have exhibited significant effectiveness in multi-view stereo owing to the deformable and expandable patches in reconstructing textureless areas. However, such methods primarily emphasize broadening the receptive field in textureless areas, while neglecting deformation instability caused by easily overlooked edge-skipping, potentially leading to matching distortions. To address this, we propose SED-MVS, which adopts panoptic segmentation and multi-trajectory diffusion strategy for segmentation-driven and edge-aligned patch deformation. Specifically, to prevent unanticipated edge-skipping, we first employ SAM2 for panoptic segmentation as depth-edge guidance to guide patch deformation, followed by multi-trajectory diffusion strategy to ensure patches are comprehensively aligned with depth edges. Moreover, to avoid potential inaccuracy of random initialization, we combine both sparse points from LoFTR and monocular depth map from DepthAnything V2 to restore reliable and realistic depth map for initialization and supervised guidance. Finally, we integrate segmentation image with monocular depth map to exploit inter-instance occlusion relationship, then further regard them as occlusion map to implement two distinct edge constraint, thereby facilitating occlusion-aware patch deformation. Extensive results on ETH3D, Tanks & Temples, BlendedMVS and Strecha datasets validate the state-of-the-art performance and robust generalization capability of our proposed method. Copyright © 2025, The Authors. All rights reserved.

关键词： Restoration

来源：评论

学校读者我要写书评

暂无评论

A Survey on Service Route and Time Prediction in Instant Delivery: Taxonomy, Progress, and Prospects

arXiv

引用

arXiv 2023年

作者： Wen, Haomin Lin, Youfang Wu, Lixia Mao, Xiaowei Cai, Tianyue Hou, Yunfeng Guo, Shengnan Liang, Yuxuan Jin, Guangyin Zhao, Yiji Zimmermann, Roger Ye, Jieping Wan, Huaiyu The Beijing Key Laboratory of Traffic Data Analysis and Mining School of Computer and Information Technology Beijing Jiaotong University Beijing100044 China The Key Laboratory of Intelligent Passenger Service of Civil Aviation CAAC Beijing101318 China The School of Computing National University of Singapore Singapore College of Systems Engineering National University of Defense Technology Changsha China The School of Information Science and Engineering Yunnan University Kunming650091 China The Cainiao Network Hangzhou China The Alibaba Group Hangzhou China INTR Thrust and DSA Thrust The Hong Kong University of Science and Technology Guangzhou China

Instant delivery services, such as food delivery and package delivery, have achieved explosive growth in recent years by providing customers with daily-life convenience. An emerging research area within these services is service Route&Time Prediction (RTP), which aims to estimate the future service route as well as the arrival time of a given worker. As one of the most crucial tasks in those service platforms, RTP stands central to enhancing user satisfaction and trimming operational expenditures on these platforms. Despite a plethora of algorithms developed to date, there is no systematic, comprehensive survey to guide researchers in this domain. To fill this gap, our work presents the first comprehensive survey that methodically categorizes recent advances in service route and time prediction. We start by defining the RTP challenge and then delve into the metrics that are often employed. Following that, we scrutinize the existing RTP methodologies, presenting a novel taxonomy of them. We categorize these methods based on three criteria: (i) type of task, subdivided into only-route prediction, only-time prediction, and joint route&time prediction;(ii) model architecture, which encompasses sequence-based and graph-based models;and (iii) learning paradigm, including Supervised Learning (SL) and Deep Reinforcement Learning (DRL). Conclusively, we highlight the limitations of current research and suggest prospective avenues. We believe that the taxonomy, progress, and prospects introduced in this paper can significantly promote the development of this field. © 2023, CC BY.

关键词： Taxonomies

来源：评论

学校读者我要写书评

暂无评论

Lead-cnn: lightweight enhanced dimension reduction convolutional neural network for brain tumor classification

引用

International Journal of Machine Learning and Cybernetics 2025年 1-20页

作者： Khan, Saif Ur Rehman Asif, Sohaib Bilal, Omair Rehman, Hafeez Ur School of Computer Science and Engineering Central South University 932 Lushan S Rd Yuelu District Hunan Changsha China School of Computing and Data Sciences Oryx Universal College with Liverpool John Moores University Doha Qatar Department of Computer Science National University of Computer and Emerging Sciences Islamabad Pakistan Taizhou Key Laboratory of Minimally Invasive Interventional Therapy & Artificial Intelligence Taizhou Campus of Zhejiang Cancer Hospital Taizhou Cancer Hospital Taizhou317502 China Chinese Academy of Sciences Taizhou317502 China Chinese Academy of Sciences Hangzhou310022 China

In many nations, brain tumors are among the most serious medical conditions affecting both adults and children. Timely and accurate diagnosis is crucial, as the life of a patient may be shortened if brain tumors are not identified promptly. When brain tumors are diagnosed accurately and promptly, patients can receive the appropriate treatment. One of the challenging aspects of dealing with brain tumors is their diversity, making it difficult to categorize them accurately due to their varying characteristics. Deep learning (DL) models have emerged as a valuable tool in classifying brain tumors into distinct groups. However, these models face challenges related to accuracy and computational cost, necessitating advancements in brain image classification. Our primary aim is to develop a lightweight convolutional neural network (CNN) architecture that offers high efficiency, we incorporate a modified dimension reduction block with CNN to detect brain cancers with minimal computational resources while maintaining a high level of accuracy. In this research, we introduce a novel lightweight network called LEAD-CNN, designed specifically for the accurate and reliable identification of brain cancers from magnetic resonance images (MRI). Our approach begins by evaluating the effectiveness of several pre-trained DL models, including ResNet-101, VGG-19, MobileNet-V1, and DenseNet-201, which have been recommended for the classification of medical images. Subsequently, we propose a dimension reduction base CNN architecture with a lightweight design aimed at achieving a low false-negative rate in tumor image classification for patients. To assess the performance of the proposed model, we utilize a benchmark brain MRI dataset (Kaggle) comprising 7023 images, encompassing three different types of brain tumors long with normal brain images. Our experimental results are demonstrating an overall classification accuracy of 98.70%, with an average recall, F1-score, and precision of 98.60%

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Wasserstein Archetypal Analysis

arXiv

引用

arXiv 2022年

作者： Craig, Katy Osting, Braxton Wang, Dong Xu, Yiming Department of Mathematics University of California Santa Barbara Department of Mathematics University of Utah Salt Lake City School of Science and Engineering & Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen Guangdong China Corporate Model Risk Wells Fargo

Archetypal analysis is an unsupervised machine learning method that summarizes data using a convex polytope. In its original formulation, for fixed k, the method finds a convex polytope with k vertices, called archetype points, such that the polytope is contained in the convex hull of the data and the mean squared Euclidean distance between the data and the polytope is minimal. In the present work, we consider an alternative formulation of archetypal analysis based on the Wasserstein metric, which we call Wasserstein archetypal analysis (WAA). In one dimension, there exists a unique solution of WAA [7] and, in two dimensions, we prove existence of a solution, as long as the data distribution is absolutely continuous with respect to Lebesgue measure. We discuss obstacles to extending our result to higher dimensions and general data distributions. We then introduce an appropriate regularization of the problem, via a Rényi entropy, which allows us to obtain existence of solutions of the regularized problem for general data distributions, in arbitrary dimensions. We prove a consistency result for the regularized problem, ensuring that if the data are iid samples from a probability measure, then as the number of samples is increased, a subsequence of the archetype points converges to the archetype points for the limiting data distribution, almost surely. Finally, we develop and implement a gradient-based computational approach for the two-dimensional problem, based on the semi-discrete formulation of the Wasserstein metric. Our analysis is supported by detailed computational *** Codes 62H12, 62H30, 65K10, 49Q22 Copyright © 2022, The Authors. All rights reserved.

关键词： Multivariant analysis

来源：评论

学校读者我要写书评

暂无评论

Has My Release Disobeyed Semantic Versioning? Static Detection Based on Semantic Differencing

arXiv

引用

arXiv 2022年

作者： Zhang, Lyuye Liu, Chengwei Xu, Zhengzi Chen, Sen Fan, Lingling Chen, Bihuan Liu, Yang School of Computer Science and Engineering Nanyang Technological University Singapore Singapore College of Intelligence and Computing Tianjin University Tianjin China College of Cyber Science Nankai University Tianjin China School of Computer Science Shanghai Key Laboratory of Data Science Fudan University Shanghai China

To enhance the compatibility in the version control of Java Thirdparty Libraries (TPLs), Maven adopts Semantic Versioning (SemVer) to standardize the underlying meaning of versions, but users could still confront abnormal execution and crash after upgrades even if compilation and linkage succeed. It is caused by semantic breaking (SemB) issues, such that APIs directly used by users have identical signatures but inconsistent semantics across upgrades. To strengthen compliance with SemVer rules, developers and users should be alerted of such issues. Unfortunately, it is challenging to detect them statically, because semantic changes in the internal methods of APIs are difficult to capture. Dynamic testing can confirmingly uncover some, but it is limited by inadequate coverage. To detect SemB issues over compatible upgrades (Patch and Minor) by SemVer rules, we conduct an empirical study on 180 SemB issues to understand the root causes, inspired by which, we propose Sembid (Semantic Breaking Issue Detector) to statically detect such issues of TPLs for developers and users. Since APIs are directly used by users, Sembid detects and reports SemB issues based on APIs. For a pair of APIs, Sembid walks through the call chains originating from the API to locate breaking changes by measuring semantic diff. Then, Sembid checks if the breaking changes can affect API's output along call chains. The evaluation showed Sembid achieved 90.26% recall and 81.29% precision and outperformed other API checkers on SemB API detection. We also revealed Sembid detected over 3 times more SemB APIs with better coverage than unit tests, the commonly used solution. Furthermore, we carried out an empirical study on 1, 629, 589 APIs from 546 version pairs of top Java libraries and found there were 2∼4 times more SemB APIs than those with signature-based issues. Due to various version release strategies, 33.83% of Patch version pairs and 64.42% of Minor version pairs had at least one API affected by

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Vertical Federated Learning: Challenges, Methodologies and Experiments

arXiv

引用

arXiv 2022年

作者： Wei, Kang Li, Jun Ma, Chuan Ding, Ming Wei, Sha Wu, Fan Chen, Guihai Ranbaduge, Thilina School of Electrical and Optical Engineering Nanjing University of Science and Technology Nanjing210094 China Ministry of Education China Data61 CSIRO SydneyNSW2015 Australia Beijing100191 China The Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai200240 China The State Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China

Recently, federated learning (FL) has emerged as a promising distributed machine learning (ML) technology, owing to the advancing computational and sensing capacities of end-user devices, as well as the increasing concerns on users' privacy. As a special architecture in FL, vertical FL (VFL) is capable of constructing a hyper ML model by embracing sub-models from different types of clients. These sub-models are trained locally by vertically partitioned data with distinct attributes. Therefore, the design of VFL is fundamentally different from that of conventional FL, raising new and unique research issues. In this paper, we aim to discuss key challenges in VFL with effective solutions, and conduct experiments on real-life datasets to shed light on these issues. Specifically, we first propose a general framework on VFL, and highlight the key differences between VFL and conventional FL. Then, we discuss research challenges rooted in VFL systems from four aspects, i.e., security and privacy risks, expensive computation and communication costs, possible structural damage caused by model splitting, and system heterogeneity. Afterwards, we develop solutions to addressing the aforementioned challenges, and conduct extensive experiments to showcase the effectiveness of the proposed solutions. Copyright © 2022, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：