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

arXiv 2025年

作者： Yu, Hanzhi Liu, Yuchen Yang, Zhaohui Sun, Haijian Chen, Mingzhe Department of Electrical and Computer Engineering Frost Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States Department of Computer Science North Carolina State University RaleighNC27695 United States College of Information Science and Electronic Engineering Zhejiang University Hangzhou310027 China School of Electrical and Computer Engineering University of Georgia AthensGA30602 United States

In this paper, we investigate an accurate synchronization between a physical network and its digital network twin (DNT), which serves as a virtual representation of the physical network. The considered network includes a set of base stations (BSs) that must allocate its limited spectrum resources to serve a set of users while also transmitting its partially observed physical network information to a cloud server to generate the DNT. Since the DNT can predict the physical network status based on its historical status, the BSs may not need to send their physical network information at each time slot, allowing them to conserve spectrum resources to serve the users. However, if the DNT does not receive the physical network information of the BSs over a large time period, the DNT’s accuracy in representing the physical network may degrade. To this end, each BS must decide when to send the physical network information to the cloud server to update the DNT, while also determining the spectrum resource allocation policy for both DNT synchronization and serving the users. We formulate this resource allocation task as an optimization problem, aiming to maximize the total data rate of all users while minimizing the asynchronization between the physical network and the DNT. The formulated problem is challenging to solve by traditional optimization methods, as each BS can only observe a partial physical network, making it difficult to find an optimal spectrum allocation strategy for the entire network. To address this problem, we propose a method based on the gated recurrent units (GRUs) and the value decomposition network (VDN). The GRU component allows the DNT to predict future status using the historical data, effectively updating itself when the BSs do not transmit the physical network information. The VDN algorithm enables each BS to learn the relationship between its local observation and the team reward of all BSs, allowing it to collaborate with others in determining whe

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

One-Time Rewritable Blockchain with Traitor Tracing and Bilateral Access Control

One-Time Rewritable Blockchain with Traitor Tracing and Bila...

引用

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Lifeng Guo Huide Lei Wei-Chuen Yau School of Computer and Information Technology Shanxi University Taiyuan China School of Computing and Data Science Xiamen University Malaysia Sepang Selangor Malaysia

One of the solutions for rewriting blockchain data is to replace the standard hash function with a chameleon hash function. This enables users with the trapdoor to generate hash collision for rewriting operation. However, such rewritable blockchain solution may allow users to have unlimited rewriting permissions. This is undesirable as rewritable blockchains should still maintain a certain degree of immutability. In this paper, we propose a fine-grained one-time rewritable blockchain scheme that supports traitor tracing and bilateral access control. The proposed solution is the first that combines one-time chameleon hash function and traceable attribute-based encryption to realize one-time rewriting blockchain at the same time tracking for malicious users who leak the private key. Furthermore, our solution offers bilateral access control by integrating with fog computing. We also verify the performance of the proposed scheme with experimental analysis.

关键词： Access control Hash functions Privacy Runtime data security Blockchains Encryption

来源：评论

学校读者我要写书评

暂无评论

Cooperative Air-Ground Instant Delivery by UAVs and Crowdsourced Taxis

Cooperative Air-Ground Instant Delivery by UAVs and Crowdsou...

引用

International Conference on data Engineering

作者： Junhui Gao Qianru Wang Xin Zhang Juan Shi Xiang Zhao Qingye Han Yan Pan School of Computer Science Northwestern Polytechnical University School of Computer Science and Technology Xidian University National Key Laboratory of Information Systems Engineering National University of Defense Technology Air Force Engineering University Laboratory for Big Data and Decision National University of Defense Technology School of Management Science and Real Estate Chongqing University National Key Laboratory of Parallel and Distributed Computing National University of Defense Technology

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Instant delivery has become a fundamental service in people's daily lives. Different from the traditional express service, the instant delivery has a strict shipping time constraint after being ordered. However, the labor shortage makes it challenging to realize efficient instant delivery. To tackle the problem, researchers have studied to introduce vehicles (i.e., taxis) or Unmanned Aerial Vehicles (UAVs or drones) into instant delivery tasks. Unfortunately, the delivery detour of taxis and the limited battery of UAVs make it hard to meet the rapidly increasing instant delivery demands. Under this circumstance, this paper proposes an air-ground cooperative instant delivery paradigm to maximize the delivery performance and meanwhile minimize the negative effects on the taxi passengers. Specifically, a data-driven delivery potential-demands-aware cooperative strategy is designed to improve the overall delivery performance of both UAVs and taxis as well as the taxi passengers' experience. The experimental results show that the proposed method improves the delivery number by 30.1% and 114.5% compared to the taxi-based and UAV-based instant delivery respectively, and shortens the delivery time by 35.7% compared to the taxi-based instant delivery.

关键词： Autonomous aerial vehicles data engineering Air to ground communication Trajectory Batteries Time factors Task analysis

来源：评论

学校读者我要写书评

暂无评论

Beam Tracking for High-Speed UAV Via Generative Diffusion Model-Enabled Joint Optimization Approach

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Zhang, Jing Zhang, Chaofeng Feng, Xin Yang, Hongwei Liang, Shuang Sun, Geng Wang, Jiacheng Niyato, Dusit Changchun University of Science and Technology College of Computer Science and Technology Changchun130022 China Jilin University College of Communication Engineering Changchun130012 China Northeast Normal University School of Information Science and Technology Changchun130117 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Jilin University College of Computer Science and Technology Changchun130012 China Nanyang Technological University College of Computing and Data Science 639798 Singapore Nanyang Technological University 639798 Singapore

Beam tracking is crucial for maintaining stable data transmission in unmanned aerial vehicle (UAV) communications. However, a communication link can be disrupted by frequent switching of narrow beams between a base station and a UAV at certain moments. In this study, we propose a position prediction-based beam tracking algorithm with adaptive beam reconstruction (PPBT-AR) for high-speed UAV. Specifically, long short-term memory (LSTM) recurrent neural networks are utilized to predict the nonlinear flight trajectory during high-speed flight. Moreover, we employ the generative diffusion model (GDM) to jointly optimize the beam width and signal strength, thereby reducing the number of beam switches. In addition, we design an adaptive beam reconstruction (ABR) mechanism to mitigate communication interruptions caused by prediction errors. Simulation results demonstrate that the proposed PPBT-AR reduces the number of beam switches by 66.6% and 76.9% in low-speed and high-speed scenarios compared to the traditional phased array beam tracking algorithm, respectively. © 1967-2012 IEEE.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

Parallel Dual-Branch Fusion Network for Epileptic Seizure Prediction

引用

computers in Biology and Medicine 2024年 176卷 108565-108565页

作者： Ma, Hongcheng Wu, Yajing Tang, Yongqiang Chen, Rui Xu, Tao Zhang, Wensheng School of Information and Communication Engineering Hainan University Haikou China State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences Beijing China Shanxi Key Laboratory of Big Data Analysis and Parallel Computing Taiyuan University of Science and Technology Taiyuan China School of Computer Science and Cyber Engineering Guangzhou University Guangzhou China

Epilepsy is a prevalent chronic disorder of the central nervous system. The timely and accurate seizure prediction using the scalp Electroencephalography (EEG) signal can make patients adopt reasonable preventive measures before seizures occur and thus reduce harm to patients. In recent years, deep learning-based methods have made significant progress in solving the problem of epileptic seizure prediction. However, most current methods mainly focus on modeling short- or long-term dependence in EEG, while neglecting to consider both. In this study, we propose a Parallel Dual-Branch Fusion Network (PDBFusNet) which aims to combine the complementary advantages of Convolutional Neural Network (CNN) and Transformer. Specifically, the features of the EEG signal are first extracted using Mel Frequency Cepstral Coefficients (MFCC). Then, the extracted features are delivered into the parallel dual-branches to simultaneously capture the short- and long-term dependencies of EEG signal. Further, regarding the Transformer branch, a novel feature fusion module is developed to enhance the ability of utilizing time, frequency, and channel information. To evaluate our proposal, we perform sufficient experiments on the public epileptic EEG dataset CHB-MIT, where the accuracy, sensitivity, specificity and precision are 95.76%, 95.81%, 95.71% and 95.71%, respectively. PDBFusNet shows superior performance compared to state-of-the-art competitors, which confirms the effectiveness of our proposal. © 2024 Elsevier Ltd

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

Implicit U-KAN2.0: Dynamic, Efficient and Interpretable Medical Image Segmentation

arXiv

引用

arXiv 2025年

作者： Cheng, Chun-Wun Zhao, Yining Cheng, Yanqi Montoya, Javier Schönlieb, Carola-Bibiane Aviles-Rivero, Angelica I. Department of Applied Mathematics and Theoretical Physics University of Cambridge United Kingdom Siebel School of Computing and Data Science University of Illinois Urbana-Champaign United States Lucerne School of Computer Science and Information Technology Lucerne University of Applied Sciences and Arts United States Yau Mathematical Sciences Center Tsinghua University China

Image segmentation is a fundamental task in both image analysis and medical applications. State-of-the-art methods predominantly rely on encoder-decoder architectures with a U-shaped design, commonly referred to as U-Net. Recent advancements integrating transformers and MLPs improve performance but still face key limitations, such as poor interpretability, difficulty handling intrinsic noise, and constrained expressiveness due to discrete layer structures, often lacking a solid theoretical *** this work, we introduce Implicit U-KAN 2.0, a novel U-Net variant that adopts a two-phase encoder-decoder structure. In the SONO phase, we use a second-order neural ordinary differential equation (NODEs), called the SONO block, for a more efficient, expressive, and theoretically grounded modeling approach. In the SONO-MultiKAN phase, we integrate the second-order NODEs and MultiKAN layer as the core computational block to enhance interpretability and representation power. Our contributions are threefold. First, U-KAN 2.0 is an implicit deep neural network incorporating MultiKAN and second order NODEs, improving interpretability and performance while reducing computational costs. Second, we provide a theoretical analysis demonstrating that the approximation ability of the MultiKAN block is independent of the input dimension. Third, we conduct extensive experiments on a variety of 2D and a single 3D dataset, demonstrating that our model consistently outperforms existing segmentation networks. Copyright © 2025, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

A Local Regression-Based SLA-Aware Energy-Efficient Virtual Machine Consolidation Algorithm in data Centers

A Local Regression-Based SLA-Aware Energy-Efficient Virtual ...

引用

International Conference on Big data computing and Communications (BIGCOM)

作者： Xiaodong Wu Ronghai Wang Guoxin Lin School of Mathmatics and Computer Science Quanzhou Normal University Fujian Provincial Key Laboratory of Data-Intensive Computing Key Laboratory of Intelligent Computing and Information Processing Fujian Province University Fujian Provincial Big Data Research Institute of Intelligent Manufacturing Quanzhou China

Virtual Machine Consolidation (VMC) is an effective means to improve the resource utilization and reduce energy consumption of data centers. However, the VMC optimization that only considers energy consumption may lead to SLA (Service-Level Agreements) violations and thus fail to guarantee the QoS (Quality of Service) provided. Therefore, it is necessary to consider both energy saving and SLA violations in the process of VMC. In this paper, we propose an energy and SLA-aware VMC algorithm that considers both energy saving and SLA violation optimization in data centers. The proposed algorithm uses the local regression method to predict the utilization of virtual machines, based on which it determines whether the host will be overloaded, so as to make the decision of virtual machine migrations. The proposed VMC algorithm is evaluated with CloudSim toolkit. Simulation results demonstrate that our algorithm has good energy saving performance and can effectively reduce SLA violation in cloud data center. Considering energy consumption and SLA violation, the ESV can be reduced by 7.57% on average and 16.36% at most compared with other algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GM-DF: Generalized Multi-Scenario Deepfake Detection

arXiv

引用

arXiv 2024年

作者： Lai, Yingxin Yu, Zitong Yang, Jing Li, Bin Kang, Xiangui Shen, Linlin The School of Computing and Information Technology Great Bay University Dongguan523000 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen University Shenzhen518060 China The Guangdong Key Laboratory of Information Security The School of Computer Science and Engineering Sun Yat-sen University Guangzhou510080 China Computer Vision Institute School of Computer Science & Software Engineering Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Key Laboratory of Intelligent Information Processing National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China

Existing face forgery detection usually follows the paradigm of training models in a single domain, which leads to limited generalization capacity when unseen scenarios and unknown attacks occur. In this paper, we elaborately investigate the generalization capacity of deepfake detection models when jointly trained on multiple face forgery detection datasets. We first find a rapid degradation of detection accuracy when models are directly trained on combined datasets due to the discrepancy across collection scenarios and generation methods. To address the above issue, a Generalized Multi-Scenario Deepfake Detection framework (GM-DF) is proposed to serve multiple real-world scenarios by a unified model. First, we propose a hybrid expert modeling approach for domain-specific real/forgery feature extraction. Besides, as for the commonality representation, we use CLIP to extract the common features for better aligning visual and textual features across domains. Meanwhile, we introduce a masked image reconstruction mechanism to force models to capture rich forged details. Finally, we supervise the models via a domain-aware meta-learning strategy to further enhance their generalization capacities. Specifically, we design a novel domain alignment loss to strongly align the distributions of the meta-test domains and meta-train domains. Thus, the updated models are able to represent both specific and common real/forgery features across multiple datasets. In consideration of the lack of study of multi-dataset training, we establish a new benchmark leveraging multi-source data to fairly evaluate the models' generalization capacity on unseen scenarios. Both qualitative and quantitative experiments on five datasets conducted on traditional protocols as well as the proposed benchmark demonstrate the effectiveness of our approach. The codes will be available on https://***/laiyingxin2/GM-DF. Copyright © 2024, The Authors. All rights reserved.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Focus on Local: Finding Reliable Discriminative Regions for Visual Place Recognition

arXiv

引用

arXiv 2025年

作者： Wang, Changwei Chen, Shunpeng Song, Yukun Xu, Rongtao Zhang, Zherui Zhang, Jiguang Yang, Haoran Zhang, Yu Fu, Kexue Du, Shide Xu, Zhiwei Gao, Longxiang Guo, Li Xu, Shibiao Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology Shandong Academy of Sciences China School of Artificial Intelligence Beijing University of Posts and Telecommunications China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science China MAIS Institute of Automation Chinese Academy of Sciences China Tongji University China College of Computer and Data Science Fuzhou University China Shandong University China

Visual Place Recognition (VPR) is aimed at predicting the location of a query image by referencing a database of geotagged images. For VPR task, often fewer discriminative local regions in an image produce important effects while mundane background regions do not contribute or even cause perceptual aliasing because of easy overlap. However, existing methods lack precisely modeling and full exploitation of these discriminative regions. In this paper, we propose the Focus on Local (FoL) approach to stimulate the performance of image retrieval and re-ranking in VPR simultaneously by mining and exploiting reliable discriminative local regions in images and introducing pseudo-correlation supervision. First, we design two losses, Extraction-Aggregation Spatial Alignment Loss (SAL) and Foreground-Background Contrast Enhancement Loss (CEL), to explicitly model reliable discriminative local regions and use them to guide the generation of global representations and efficient re-ranking. Second, we introduce a weakly-supervised local feature training strategy based on pseudo-correspondences obtained from aggregating global features to alleviate the lack of local correspondences ground truth for the VPR task. Third, we suggest an efficient re-ranking pipeline that is efficiently and precisely based on discriminative region guidance. Finally, experimental results show that our FoL achieves the state-of-the-art on multiple VPR benchmarks in both image retrieval and re-ranking stages and also significantly outperforms existing two-stage VPR methods in terms of computational efficiency. Copyright © 2025, The Authors. All rights reserved.

关键词： Photointerpretation

来源：评论

学校读者我要写书评

暂无评论

The Analysis for the Traffic Risks in Barcelona before and after the COVID-19 Based on Deep Learning 2

The Analysis for the Traffic Risks in Barcelona before and a...

引用

2nd International Seminar on Artificial Intelligence, Networking and information Technology, AINIT 2021

作者： Shao, Yinghui Zhang, Enkai Han, Ziheng School of Computing Wuhun China Guizhou University College of Large Data and Information Engineering Guizhou China Harbin Engineering University College of Computer Science and Technology Harbin China

ISBN: (纸本)9781665412964

Big Traffic data [1] is cross-border multi-source data for multiple industries, but traffic roads have brought significant economic and social benefits, the number of traffic accidents and casualties is on the rise. Among them, traffic accidents are related to many factors, such as weather and population density. The data set used in this article is open source in Barcelona. The Random Forest algorithm is used to screen essential risk factors, establish a traffic risk prediction model, and compare traffic risks before and after COVID-19. It is concluded that the outbreak of the new crown virus -19-19 has a great impact on people's travel and transportation. Finally, the R square of the model established by Random Forest is 0.9. The K-means clustering algorithm is used to determine the location of the accident handling centre. Moreover, the scope of each accident risk management centre can cover more than 85 percent of traffic accident sites from 2016 to 2020. © 2021 IEEE.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：