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

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

来源：评论

学校读者我要写书评

暂无评论

Quantum Pseudorandom Scramblers 22nd

Quantum Pseudorandom Scramblers

引用

22nd Theory of Cryptography Conference, TCC 2024

作者： Lu, Chuhan Qin, Minglong Song, Fang Yao, Penghui Zhao, Mingnan Computer Science Department Portland State University Portland United States State Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China Hefei National Laboratory Hefei230088 China

ISBN: (纸本)9783031780165

Quantum pseudorandom state generators (PRSGs) have stimulated exciting developments in recent years. A PRSG, on a fixed initial (e.g., all-zero) state, produces an output state that is computationally indistinguishable from a Haar random state. However, pseudorandomness of the output state is not guaranteed on other initial states. In fact, known PRSG constructions provably fail on some initial states. In this work, we propose and construct quantum Pseudorandom State Scramblers (PRSSs), which can produce a pseudorandom state on an arbitrary initial state. In the information-theoretical setting, we obtain a scrambler which maps an arbitrary initial state to a distribution of quantum states that is close to Haar random in total variation distance. As a result, our scrambler exhibits a dispersing property. Loosely, it can span an ϵ-net of the state space. This significantly strengthens what standard PRSGs can induce, as they may only concentrate on a small region of the state space provided that the average output state approximates a Haar random state. Our PRSS construction develops a parallel extension of the famous Kac’s walk, and we show that it mixes exponentially faster than the standard Kac’s walk. This constitutes the core of our proof. We also describe a few applications of PRSSs. While our PRSS construction assumes a post-quantum one-way function, PRSSs are potentially a weaker primitive and can be separated from one-way functions in a relativized world similar to standard PRSGs. © International Association for Cryptologic Research 2025.

关键词： Distribution functions

来源：评论

学校读者我要写书评

暂无评论

Consensus in Second-Order Discrete-Time MAS With Distinct and Multiple Coupling Matrices 10

Consensus in Second-Order Discrete-Time MAS With Distinct an...

引用

10th International Conference on systems and Informatics, ICSAI 2024

作者： Sun, Chenggong Liu, Xiwei Tongji University Department of Computer Science and Technology Shanghai201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China

ISBN: (纸本)9798331510138

In this paper, we explore and establish several necessary and sufficient conditions that are instrumental in achieving consensus within second-order discrete-time multi-agent systems (SDMAS). Different with previous research, this study addresses the more intricate scenario where the velocity coupling matrix is distinct from the position coupling matrix. We introduce a novel eigenvector condition tailored to this challenge. Furthermore, in response to the burgeoning interest in multiweighted networks, this study is extended to SDMAS with multiple weights. We employ a technique, that rearranges the order of variables, to effectively simplify the analysis of multiweighted networks by transforming them into single-weighted equivalents. The efficacy of our method is substantiated through three numerical examples, which illustrate the practical value in elucidating consensus dynamics within SDMAS featuring diverse coupling matrices. © 2024 IEEE.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Knowledge-guided Network Pruning for EEG-based Emotion Recognition

Knowledge-guided Network Pruning for EEG-based Emotion Recog...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Rao, Wenjie Zhong, Sheng-Hua Zhang, Zhi Liu, Yan Shenzhen University Guangdong Laboratory of Artificial Intelligence and Digital Economy College of Computer Science and Software Shenzhen China Hong Kong Polytechnic University Department of Computer Science Hong Kong

ISBN: (纸本)9798350337488

With the development of deep learning in EEG-related tasks, the complexity of learning models has gradually increased. These complex models often result in long inference times, high energy consumption, and an increased risk of overfitting. Therefore, model compression has become an important consideration. Although some EEG models have used lightweight techniques, such as separable convolution, no existing work has directly attempted to compress EEG models to reduce their complexity. In this paper, we integrate neuroscience knowledge into EEG model pruning recovery, and innovatively propose two loss functions in the learning process, the knowledge-guided region-wise loss that enforces the classification evidence consistent with the importance of the prefrontal lobe, and the knowledge-guided sample-wise loss that constrains the learning process by distinguishing the importance of different samples. © 2023 IEEE.

关键词： EEG-based emotion recognition knowledge-guided network pruning model compression

来源：评论

学校读者我要写书评

暂无评论

Effective and Imperceptible Adversarial Textual Attack Via Multi-objectivization

引用

ACM Transactions on Evolutionary Learning and Optimization 2024年第3期4卷 1-23页

作者： Liu, Shengcai Lu, Ning Hong, Wenjing Qian, Chao Tang, Ke Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen College of Engineering South Tower 1088 Xueyuan Avenue Guangdong Shenzhen518055 China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong999077 Hong Kong National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen 10F Zhizhen Building Canghai Campus 3688 Nanhai Avenue Guangdong Shenzhen China National Key Laboratory for Novel Software Technology School of Artificial Intelligence Nanjing University Nanjing International College Area Xianlin Campus 163 Xianlin Avenue Jiangsu Nanjing China

The field of adversarial textual attack has significantly grown over the past few years, where the commonly considered objective is to craft adversarial examples (AEs) that can successfully fool the target model. However, the imperceptibility of attacks, which is also essential for practical attackers, is often left out by previous studies. In consequence, the crafted AEs tend to have obvious structural and semantic differences from the original human-written text, making them easily perceptible. In this work, we advocate leveraging multi-objectivization to address such an issue. Specifically, we reformulate the problem of crafting AEs as a multi-objective optimization problem, where the attack imperceptibility is considered as an auxiliary objective. Then, we propose a simple yet effective evolutionary algorithm, dubbed HydraText, to solve this problem. HydraText can be effectively applied to both score-based and decision-based attack settings. Exhaustive experiments involving 44,237 instances demonstrate that HydraText consistently achieves competitive attack success rates and better attack imperceptibility than the recently proposed attack approaches. A human evaluation study also shows that the AEs crafted by HydraText are more indistinguishable from human-written text. Finally, these AEs exhibit good transferability and can bring notable robustness improvement to the target model by adversarial training. © 2024 Copyright held by the owner/author(s).

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Collaborative Service Provisioning for UAV-Assisted Mobile Edge Computing

引用

Chinese Journal of Electronics 2024年第6期33卷 1504-1514页

作者： Yuben QU Zhenhua WEI Zhen QIN Tao WU Jinghao MA Haipeng DAI Chao DONG The Key Laboratory of Dynamic Cognitive System of Electromagnetic Spectrum Space Ministry of Industry and Information Technology Colllege of Electronic and Information Engineering Nanjing University of Aeronautics and Astronautics Xi'an Research Institute of High Technology Department of Information and Communication Noncommissioned Officer Academy of PAP National University of Defense Technology Department of Computer Science and Technology Nanjing University

Unmanned aerial vehicle(UAV)-assisted mobile edge computing(MEC), as a way of coping with delaysensitive and computing-intensive tasks, is considered to be a key technology to solving the challenges of terrestrial MEC networks. In this work, we study the problem of collaborative service provisioning(CSP) for UAV-assisted MEC. Specifically, taking into account the task latency and other resource constraints, this paper investigates how to minimize the total energy consumption of all terrestrial user equipments, by jointly optimizing computing resource allocation, task offloading, UAV trajectory, and service placement. The CSP problem is a non-convex mixed integer nonlinear programming problem, owing to the complex coupling of mixed integral variables and non-convexity of CSP. To address the CSP problem, this paper proposes an alternating optimization-based solution with the convergence guarantee as follows. We iteratively deal with the joint service placement and task offloading subproblem, and UAV movement trajectory subproblem, by branch and bound and successive convex approximation, respectively,while the closed form of the optimal computation resource allocation can be efficiently obtained. Extensive simulations validate the effectiveness of the proposed algorithm compared to three baselines.

关键词： Energy consumption Multi-access edge computing Collaboration Programming Autonomous aerial vehicles Minimization Trajectory Resource management Optimization Convergence

来源：评论

学校读者我要写书评

暂无评论

K-Banhatti Sombor Invariants of Certain computer Networks

引用

computers, Materials & Continua 2022年第10期73卷 15-31页

作者： Khalid Hamid Muhammad Waseem Iqbal Abaid Ur Rehman Virk Muhammad Usman Ashraf Ahmed Mohammed Alghamdi Adel A.Bahaddad Khalid Ali Almarhabi Department of Computer Science Superior UniversityLahore54000Pakistan Department of Software Engineering Superior UniversityLahore54000Pakistan Department of Mathematics University of SialkotSialkot51013Pakistan Department of Computer Science GC Women UniversitySialkot53310Pakistan Department of Software Engineering College of Computer Science and EngineeringUniversity of Jeddah21493Saudi Arabia Department of Information System Faculty of Computing and Information TechnologyKing Abdulaziz UniversityJeddah21589Saudi Arabia Department of Computer Science College of Computing in Al-QunfudahUmm Al-Qura UniversityMakkah24381Saudi Arabia

Any number that can be uniquely determined by a graph is called a graph *** the last twenty years’countless mathematical graph invariants have been characterized and utilized for correlation ***,no reliable examination has been embraced to decide,how much these invariants are related with a network graph or molecular *** this paper,it will discuss three different variants of bridge networks with good potential of prediction in the field of computer science,mathematics,chemistry,pharmacy,informatics and biology in context with physical and chemical structures and networks,because k-banhatti sombor invariants are freshly presented and have numerous prediction qualities for different variants of bridge graphs or *** study solved the topology of a bridge graph/networks of three different types with two invariants KBanhatti Sombor Indices and its reduced *** deduced results can be used for the modeling of computer networks like Local area network(LAN),Metropolitan area network(MAN),and Wide area network(WAN),backbone of internet and other networks/structures of computers,power generation,bio-informatics and chemical compounds synthesis.

关键词： Bridge networks invariants k-banhatti sombor indices maple network graph molecular graph

来源：评论

学校读者我要写书评

暂无评论

Towards an effective method of ReDoS detection for non-backtracking engines 24

Towards an effective method of ReDoS detection for non-backt...

引用

Proceedings of the 33rd USENIX Conference on Security Symposium

作者： Weihao Su Hong Huang Rongchen Li Haiming Chen Tingjian Ge Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences and University of Chinese Academy of Sciences Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Miner School of Computer & Information Sciences University of Massachusetts Lowell

ISBN: (纸本)9781939133441

Regular expressions (regexes) are a fundamental concept across the fields of computer science. However, they can also induce the Regular expression Denial of Service (Re-DoS) attacks, which are a class of denial of service attacks, caused by super-linear worst-case matching time. Due to the severity and prevalence of ReDoS attacks, the detection of ReDoS-vulnerable regexes in software is thus vital. Although various ReDoS detection approaches have been proposed, these methods have focused mainly on backtracking regex engines, leaving the problem of ReDoS vulnerability detection on non-backtracking regex engines largely *** address the above challenges, in this paper, we first systematically analyze the major causes that could contribute to ReDoS vulnerabilities on non-backtracking regex engines. We then propose a novel type of ReDoS attack strings that builds on the concept of simple strings. Next we propose EVILSTRGEN, a tool for generating attack strings for ReDoS-vulnerable regexes on non-backtracking engines. It is based on a novel incremental determinisation algorithm with heuristic strategies to lazily find the k-simple strings without explicit construction of finite automata. We evaluate EVILSTRGEN against six state-of-the-art approaches on a broad range of publicly available datasets containing 736,535 unique regexes. The results illustrate the significant efficacy of our tool. We also apply our tool to 85 intensively-tested projects, and have identified 34 unrevealed ReDoS vulnerabilities.

关键词：

来源：评论

学校读者我要写书评

暂无评论

RAT: A Refactoring-Aware Tool for Tracking Code History 24

RAT: A Refactoring-Aware Tool for Tracking Code History

引用

46th International Conference on software Engineering: Companion, ICSE-Companion 2024

作者： Niu, Feifei Shao, Junqian Xu, Chaofan Mayr-Dorn, Christoph Assunção, Wesley K. G. Huang, Liguo Li, Chuanyi Ge, Jidong Luo, Bin Egyed, Alexander State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Institute for Software Systems Engineering Johannes Kepler University Linz Austria Department of Computer Science North Carolina State University North Carolina United States Department of Computer Science and Engineering Southern Methodist University DallasTX United States

ISBN: (纸本)9798400705021

History of code elements is essential for software maintenance tasks. However, code refactoring is one of the main causes that makes obtaining a consistent view on code evolution difficult as renaming or moving source code elements break such history. To this end, this paper presents RAT, a refactoring-aware tool for keeping track of code elements evolution across time, not just in terms of revisions but also in terms of refactoring. This is the first tool that enables fine-grained code element traceability of the whole repository. Empirical evaluation of leveraging our tool in three bug localization techniques relying on code history shows significant improvement in localization accuracy. Based on our findings, we believe that many of the state-of-the-art approaches using past source code data would benefit from our tool. Demo Tool: https://***/feifeiniu-se/RAT-Demo. Demo Video: https://***/VI-xwUaIPp4. © 2024 IEEE computer Society. All rights reserved.

关键词： Rats

来源：评论

学校读者我要写书评

暂无评论

A Review of Semantic-Based Reasoning Framework for Context-Aware Mobile-Crowdsourcing 13

A Review of Semantic-Based Reasoning Framework for Context-A...

引用

13th International Conference on Information Technology in Asia, CITA 2023

作者： Abdulsalam, Nana Hauwa Muhammad, Sufri Mohamed, Raihani Universiti Putra Malaysia Department of Software Engineering and Information System Selangor Serdang43400 Malaysia Universiti Putra Malaysia Department of Computer Science Selangor Serdang43400 Malaysia

ISBN: (纸本)9798350326208

Technology has increased the interest and demand for pervasive systems which require contextual information to function at optimal capacity. There have been numbers of research in context-aware systems that has limited focused on the semantic-based approach in the crowdsourcing domain. Thus, it promotes challenges in the context and service acquisition and representation for reasoning control mechanism. This paper aims to review semantic-based reasoning framework with a focus on the mobile crowdsourcing domain. Different domains acquire different contextual information, either extrinsic or intrinsic. The review of the frameworks has help to formulate a process framework that applied semantic approach that has the important component for context-aware reasoning process. The framework can be used in the context-aware mobile crowdsourcing domain or can be generalized to other domain to aid reasoning control. Its advantage over other crowdsourcing frameworks which is focuses not only on context and service acquisition but also the representation on the acquired information. © 2023 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：