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

A quantum federated learning framework for classical clients

science China(Physics,Mechanics & Astronomy) 2024年第5期67卷 1-10页

作者： Yanqi Song Yusen Wu Shengyao Wu Dandan Li Qiaoyan Wen Sujuan Qin Fei Gao State Key Laboratory of Networking and Switching Technology Beijing University of Posts and TelecommunicationsBeijing 00876China Department of Physics The University of Western AustraliaPerthWA 6009Australia School of Computer Science(National Pilot Software Engineering School) Beijing University of Posts and TelecommunicationsBeijing100876China

Quantum federated learning(QFL)enables collaborative training of a quantum machine learning(QML)model among multiple clients possessing quantum computing capabilities,without the need to share their respective local ***,the limited availability of quantum computing resources poses a challenge for each client to acquire quantum computing *** raises a natural question:Can quantum computing capabilities be deployed on the server instead?In this paper,we propose a QFL framework specifically designed for classical clients,referred to as CC-QFL,in response to this *** each iteration,the collaborative training of the QML model is assisted by the shadow tomography technique,eliminating the need for quantum computing capabilities of ***,the server constructs a classical representation of the QML model and transmits it to the *** clients encode their local data onto observables and use this classical representation to calculate local *** local gradients are then utilized to update the parameters of the QML *** evaluate the effectiveness of our framework through extensive numerical simulations using handwritten digit images from the MNIST *** framework provides valuable insights into QFL,particularly in scenarios where quantum computing resources are scarce.

关键词： client server quantum

来源：评论

学校读者我要写书评

暂无评论

Dual Cross-Stage Partial Learning for Detecting Objects in Dehazed Images 24

Dual Cross-Stage Partial Learning for Detecting Objects in D...

引用

24th IEEE International Conference on Data Mining, ICDM 2024

作者： Zhao, Jinbiao Zhang, Zhao Ren, Jiahuan Zhang, Haijun Zhao, Zhongqiu Wang, Meng School of Computer Science and Information Engineering Hefei University of Technology Hefei China Yunnan Key Laboratory of Software Engineering Yunan China Harbin Institute of Technology Department of Computer Science Shenzhen China

ISBN: (纸本)9798331506681

Performing an object detection task after the restoration of a hazy image, or rather detecting with the network backbone directly, will result in the inclusion of information mixed with dehazing, which tends to interfere with detection performance. To address these issues, we propose a novel framework for detecting objects in dehazed images via Dual Cross-Stage Partial Learning (DCSP). Specifically, we introduce a Cross-Stage Partial (CSP) module for extracting clean feature information after dehazing. Secondly, to enhance data integrity, we employ a skip-input strategy to supplement information related to object detection features that may be lost during the dehazing task, while avoiding the gradient vanishing problem. In addition, CSP is also introduced to facilitate comprehensive learning of multiple feature representations. Finally, to avoid the inclusion of irrelevant dehazing information in detection, we apply a Ground-Truth Flow at detection network (at dark3), for fine feature information calibration. Additionally, we created a synthetic fog dataset to expand the training data for DCSP. Experimental results on both synthetic and real-world datasets demonstrate the effectiveness and accuracy of the proposed method. The code is available at https://***/zhaojinbiao/DCSP. © 2024 IEEE.

关键词： Demulsification

来源：评论

学校读者我要写书评

暂无评论

DIG: Improved DINO for Graffiti Detection

引用

IEEE Transactions on Systems, Man, and Cybernetics: Systems 2025年第5期55卷 3557-3569页

作者： Wang, Bingshu Mao, Qianchen Liu, Aifei Chen, Long Chen, C. L. Philip Northwestern Polytechnical University School of Software Xi’an710129 China Shenzhen University Guangdong Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security Shenzhen518060 China University of Macao Department of Computer and Information Science China South China University of Technology School of Computer Science and Engineering Guangzhou510641 China

Graffiti detection is essential in historic building protection and urban neighborhood management. Graffiti detection has made significant progress in recent years based on the development of deep learning. However, small-scale graffiti, interference from the background, and the false detection of word parts in graffiti make it a challenging problem. This article proposes a Transformer-based high-precision graffiti detection method, namely DIG. Precisely, it consists of three modules: 1) Spatial query selection (SQS), scale-aware IoU loss (SIL);2) Denoising Task with binary contrastive denoising (BCDN);and 3) IoU-guided box denoising (IBD) modules. To detect small-scale graffiti, this paper proposes SIL to help the loss function to perceive small-scale graffiti and large-scale graffiti fairly. To reduce the false detection of word parts, this article presents the SQS module, which integrates spatial information into the query selection process of the Encoder to filter out falsely detected bounding boxes within the graffiti. To reduce the interference from the background, this article introduces a denoising task with BCDN and IBD modules, improving the model’s ability to distinguish graffiti from the background and accurately select appropriate bounding boxes. A large number of experimental results on the STORM dataset show that our method achieves state-of-the-art results with an AP50 of 87.9%. Moreover, DIG achieved competitive results on the FineFM dataset for mask detection. This indicates that DIG can also be conveniently transferred to detect other scenarios. © 2013 IEEE.

关键词： Historic preservation

来源：评论

学校读者我要写书评

暂无评论

FCA-based θ-iceberg core decomposition in graphs

引用

Journal of Ambient Intelligence and Humanized Computing 2024年第2期15卷 1423-1428页

作者： Hao, Fei Xinchang, Khamphaphone Park, Doo-Soon Key Laboratory of Modern Teaching Technology Ministry of Education Xi’an China School of Computer Science Shaanxi Normal University Xi’an710119 China Department of Computer Science and Engineering Soonchunhyang University Asan31538 Korea Republic of Department of Computer Software Engineering Soonchunhyang University Asan31538 Korea Republic of

Complex networking analysis is a powerful technique for understanding both complex networks and big graphs in ubiquitous computing. Particularly, there are several novel metrics, such as k-clique and k-core are proposed in order to study the relative importance of nodes in complex networks. Among of those metrics, k-core analysis is an effective approach for simplifying graphical structure. However, the relation between k and the scale of networks is not explored in most existing literature. Toward this end, this paper formulate a new research problem, θ-Iceberg Core decomposition in graphs, which is able to incorporate a parameter θ (0 © Springer-Verlag GmbH Germany, part of Springer Nature 2017.

关键词： Formal concept analysis

来源：评论

学校读者我要写书评

暂无评论

Color Image Steganalysis Algorithm Based on Quaternion Convolutional Neural Network 30th

Color Image Steganalysis Algorithm Based on Quaternion Convo...

引用

30th International Conference on Computational and Experimental Engineering and sciences, ICCES 2024

作者： Xu, Meng Wang, Jinwei State Key Laboratory of Mathematical Engineering and Advanced Computing Henan450001 China Department of Computer and Software Nanjing University of Information Science and Technology Nanjing210044 China

ISBN: (纸本)9783031687747

Most of the images on the Internet are color images, and steganalysis of color images is a very critical issue in the field of steganalysis. The current proposed color image steganalysis features mainly rely on manual design, and the steganalysis features do not fully consider the internal connections between the three channels of color images. Most steganalyzers based on deep learning are also designed for grayscale images. In recent years, the continuous introduction of advanced steganography techniques for color images has also brought more severe challenges to the steganography analysis of color images. Quaternions are a tool that can effectively represent color images, and utilizing quaternion transformations can fully exploit the correlation between color image channels. Combining quaternion theory with convolutional neural networks, this paper proposed a color image steganalysis algorithm based on quaternion convolutional neural networks. Firstly, the image is represented by quaternion, and then input into the quaternion convolutional neural network. The convolution kernel in the network is composed of quaternions, and then perform convolution and pooling. The experimental results have demonstrated the significant effectiveness of the proposed network. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Reward Maximization for Disaster Zone Monitoring with Heterogeneous UAVs

引用

IEEE/ACM Transactions on Networking 2024年第1期32卷 890-903页

作者： Xu, Wenzheng Wang, Chengxi Xie, Hongbin Liang, Weifa Dai, Haipeng Xu, Zichuan Wang, Ziming Guo, Bing Das, Sajal K. Sichuan University College of Computer Science Chengdu610065 China City University of Hong Kong Department of Computer Science Hong Kong Hong Kong Nanjing University Department of Computer Science and Technology Nanjing210023 China Dalian University of Technology School of Software Dalian116024 China Sichuan University Key Laboratory of Birth Defects and Related Maternal and Child Diseases West China Second Hospital College of Computer Science Chengdu610066 China Missouri University of Science and Technology Department of Computer Science RollaMO65409 United States

In this paper, we study the deployment of K heterogeneous UAVs to monitor Points of Interest (PoIs) in a disaster zone, where a PoI may represent a school building or an office building, in which people are trapped. A UAV can take images/videos of PoIs and send its collected information back to a nearby rescue station for decision-making. Unlike most existing studies that focused on only homogeneous UAVs, we here study the scheduling of K heterogeneous UAVs, where different UAVs have different energy capacities and functionalities that lead to different monitoring qualities (monitoring rewards) of each PoI. For example, one type of UAVs can take only visual images while the other type of UAVs can take both visual and thermal infrared images. In this paper, we investigate a problem of scheduling K heterogeneous UAVs to monitor PoIs so that the sum of monitoring rewards received by all UAVs is maximized, subject to energy capacity on each UAV. We propose the very first 13 -approximation algorithm for this scheduling problem. We also evaluate the performance of the proposed algorithm, using real parameters of commercial UAVs. Experimental results show that the performance of the proposed algorithm is promising, which is improved by 25%, compared with existing algorithms. © 1993-2012 IEEE.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Speech Recognition Method Based on Deep Learning of Artificial Intelligence: An example of BLSTM-CTC model 2023

Speech Recognition Method Based on Deep Learning of Artifici...

引用

5th International Symposium on Signal Processing Systems, SSPS 2023

作者： Chen, Kangyu Peng, Zhiyuan Department of Computer Science The University of Hong Kong Hong Kong State Key Laboratory for Novel Software Technology Nanjing University China

ISBN: (纸本)9798400700040

Under the influence of information, network and intelligent high-speed development situation, China's intelligent technology and other aspects have made great progress and achievements, derived a lot of advanced artificial intelligence technology, machine learning technology and deep learning technology, etc., to promote the development of intelligence and information in major fields. Artificial intelligence deep learning is the fusion of artificial intelligence technology and machine learning technology, which lays the foundation for the reform and innovation of artificial voice intelligent recognition technology and intelligent robot technology. So in order to improve the application level of intelligent speech recognition technology, it is necessary to continuously optimize the speech recognition method based on AI deep learning. In this regard, according to the relevant literature, this paper addresses the problem that phoneme features of varying duration are generated during the propagation of speech signals, and these features affect the correct rate of speech recognition, and the phoneme features of different lengths are standardized based on the deep learning research mentioned in this paper with BLSTM-CTC as an example. By evaluating the model on the Thchs30 and ST-CMDS datasets, the results show that the MCFN-based BLSTM-CTC speech recognition model has a reduced recognition word error rate compared with the traditional speech recognition model. © 2023 ACM.

关键词： Speech recognition

来源：评论

学校读者我要写书评

暂无评论

GridDroid--An Effective and Efficient Approach for Android Repackaging Detection Based on Runtime Graphical User Interface

引用

Journal of computer science & technology 2022年第1期37卷 147-181页

作者： Jun Ma Qing-Wei Sun Chang Xu Xian-Ping Tao State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China Department of Computer Science and Technology Nanjing UniversityNanjing 210023China Huatai Securities Co. Ltd.Nanjing 210019China

Repackaging brings serious threats to Android *** birthmark techniques are typically applied to detect repackaged *** based on apps'runtime graphical user interfaces(GUI)are effective,especially for obfuscated or encrypted ***,existing studies are time-consuming and not suitable for handling apps in large *** this paper,we propose an effective yet efficient dynamic GUI birthmark for Android ***,we run an app with automatically generated GUI events and dump its layout after each *** divide each dumped layout into a grid,count in each grid cell the vertices of boundary rectangles corresponding to widgets within the layout,and generate a feature vector to encode the *** layouts are merged at runtime,and finally we obtain a graph as the birthmark of the *** a pair of apps to be compared,we build a weighted bipartite graph from their birthmarks and apply a modified version of the maximum-weight-bipartite-matching algorithm to determine whether they form a repackaging pair(RP)or *** implement the proposed technique in a prototype,GridDroid,and apply it to detect RPs in three datasets involving 527 *** reports only six false negatives and seven false positives,and it takes GridDroid merely 20 microseconds on average to compare a pair of birthmarks.

关键词： Android apps dynamic software birthmark graphical user interface(GUI) repackaging detection

来源：评论

学校读者我要写书评

暂无评论

On the Fine-Grained Query Complexity of Symmetric Functions 34

On the Fine-Grained Query Complexity of Symmetric Functions

引用

34th International Symposium on Algorithms and Computation, ISAAC 2023

作者： Podder, Supartha Yao, Penghui Ye, Zekun Department of Computer Science Stony Brook University New YorkNY United States State Key Laboratory for Novel Software Technology Nanjing University China Hefei National Laboratory China State Key Laboratory for Novel Software Technology Nanjing University China

ISBN: (纸本)9783959772891

Watrous conjectured that the randomized and quantum query complexities of symmetric functions are polynomially equivalent, which was resolved by Ambainis and Aaronson [1], and was later improved in [15, 12]. This paper explores a fine-grained version of the Watrous conjecture, including the randomized and quantum algorithms with success probabilities arbitrarily close to 1/2. Our contributions include the following: 1. An analysis of the optimal success probability of quantum and randomized query algorithms of two fundamental partial symmetric Boolean functions given a fixed number of queries. We prove that for any quantum algorithm computing these two functions using T queries, there exist randomized algorithms using poly(T) queries that achieve the same success probability as the quantum algorithm, even if the success probability is arbitrarily close to 1/2. These two classes of functions are instrumental in analyzing general symmetric functions. 2. We establish that for any total symmetric Boolean function f, if a quantum algorithm uses T queries to compute f with success probability 1/2 + β, then there exists a randomized algorithm using O(T2) queries to compute f with success probability 1/2 + Ω (δβ2) on a 1 − δ fraction of inputs, where β, δ can be arbitrarily small positive values. As a corollary, we prove a randomized version of Aaronson-Ambainis Conjecture [1] for total symmetric Boolean functions in the regime where the success probability of algorithms can be arbitrarily close to 1/2. 3. We present polynomial equivalences for several fundamental complexity measures of partial symmetric Boolean functions. Specifically, we first prove that for certain partial symmetric Boolean functions, quantum query complexity is at most quadratic in approximate degree for any error arbitrarily close to 1/2. Next, we show exact quantum query complexity is at most quadratic in degree. Additionally, we give the tight bounds of several complexity measures, indicating their p

关键词： Quantum theory

来源：评论

学校读者我要写书评

暂无评论

Joint Mobile Edge Caching and Pricing: A Mean-Field Game Approach 40

Joint Mobile Edge Caching and Pricing: A Mean-Field Game App...

引用

40th IEEE International Conference on Data Engineering, ICDE 2024

作者： Xu, Yin Zhang, Xichong Xiao, Mingjun Wu, Jie Liu, An Zhang, Sheng School of Computer Science and Technology University of Science and Technology of China Hefei China Suzhou Institute for Advanced Research University of Science and Technology of China Suzhou China Temple University Department of Computer and Information Sciences Philadelphia United States School of Computer Science and Technology Soochow University Suzhou China Nanjing University State Key Laboratory for Novel Software Technology Nanjing China

ISBN: (纸本)9798350317152

In this paper, we investigate the competitive content placement problem in Mobile Edge Caching (MEC) systems, where Edge Data Providers (EDPs) cache appropriate contents and trade them with requesters at a suitable price. Most of the existing works ignore the complicated strategic and economic interplay between content caching, pricing, and content sharing. Therefore, we propose a joint Mean-Field Game framework for mobile edge Caching and Pricing (MFG-CP) in large-scale dynamic MEC systems, which can facilitate distributed optimal decision-making based on the mean-field game theory. Specifi-cally, we first formulate the competitive content placement issue among EDPs as a non-cooperative stochastic differential game. To significantly reduce the communication and computation complexity, we further devise a mean-field model to approximate the collective impact of all EDPs on caching, trading, and sharing, by which each EDP can quickly estimate some unknown information without considerable interactions. Then, we develop a distributed best response scheme based on iterative learning, enabling each EDP to solely customize its optimal caching strategy and pricing policy. Besides, we theoretically prove the existence of a unique MFG equilibrium. Finally, trace-driven simulations demonstrate the effectiveness of MFG-CP compared with some baselines. © 2024 IEEE.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：