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

Understanding adversarial attacks on observations in deep reinforcement learning

science China(information sciences) 2024年第5期67卷 69-83页

作者： You QIAOBEN Chengyang YING Xinning ZHOU Hang SU Jun ZHU Bo ZHANG Department of Computer Science and Technology Beijing National Research Center for Information Science and Technology Tsinghua-Bosch Joint Center for Machine Learning Institute for Artificial Intelligence Tsinghua University Peng Cheng Laboratory

Deep reinforcement learning models are vulnerable to adversarial attacks that can decrease the cumulative expected reward of a victim by manipulating its observations. Despite the efficiency of previous optimization-based methods for generating adversarial noise in supervised learning, such methods might not achieve the lowest cumulative reward since they do not generally explore the environmental ***, a framework is provided to better understand the existing methods by reformulating the problem of adversarial attacks on reinforcement learning in the function space. The reformulation approach adopted herein generates an optimal adversary in the function space of targeted attacks, repelling them via a generic two-stage framework. In the first stage, a deceptive policy is trained by hacking the environment and discovering a set of trajectories routing to the lowest reward or the worst-case performance. Next, the adversary misleads the victim to imitate the deceptive policy by perturbing the observations. Compared to existing approaches, it is theoretically shown that our adversary is strong under an appropriate noise level. Extensive experiments demonstrate the superiority of the proposed method in terms of efficiency and effectiveness, achieving state-of-the-art performance in both Atari and MuJoCo environments.

关键词： deep learning reinforcement learning adversarial robustness adversarial attack

来源：评论

学校读者我要写书评

暂无评论

Minimizing Carbon Emissions in Container Shipping Using quantum-Inspired Approaches

Minimizing Carbon Emissions in Container Shipping Using Quan...

引用

2024 International Symposium on Intelligent Signal Processing and Communication Systems, ISPACS 2024

作者： Ou, Chia-Ho Liu, Shi-Yu She, Huai-Zhong Hong, Wen-Hao Kao, De-Lun Chen, Chih-Yu Siangprasertkij, Krittin Department of Computer Science and Information Engineering National Pingtung University Pingtung Taiwan Quantum Information Center Chung Yuan Christian University Taoyuan Taiwan International School of Engineering Faculty of Engineering Chulalongkorn University Bangkok Thailand

ISBN: (纸本)9798350389210

International trade heavily relies on shipping, yet container mobility and its varying demand create imbalances in container stocks, this results in frequent scheduling of empty containers by shipping companies, leading to unnecessary voyages that adversely impact marine ecosystems and exacerbate global warming. This study applies quantum and digital annealing to optimize empty container scheduling, aiming to minimize the carbon emissions resulting from the scheduling of empty containers to mitigate damage to marine ecosystems and the effects of global warming. Comparing to Simulated Annealing, Compal Quantix, and D-Wave Hybrid, Fujitsu DA3 stands out for its superior performance in both calculating the optimal solution and reducing computation time. © 2024 IEEE.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Cluster-preserving sampling algorithm for large-scale graphs

引用

science China(information sciences) 2023年第1期66卷 60-76页

作者： Jianpeng ZHANG Hongchang CHEN Dingjiu YU Yulong PEI Yingjun DENG National Digital Switching System E&T Research Center Information Engineering University Network Systems Department of the Strategic Support Force School of Computer Science and Technology Eindhoven University of Technology Center for Applied Mathematics Tianjin University

Graph sampling is a very effective method to deal with scalability issues when analyzing largescale graphs. Lots of sampling algorithms have been proposed, and sampling qualities have been quantified using explicit properties(e.g., degree distribution) of the sample. However, the existing sampling techniques are inadequate for the current sampling task: sampling the clustering structure, which is a crucial property of the current networks. In this paper, using different expansion strategies, two novel top-leader sampling methods(i.e., TLS-e and TLS-i) are proposed to obtain representative samples, and they are capable of effectively preserving the clustering structure. The rationale behind them is to select top-leader nodes of most clusters into the sample and then heuristically incorporate peripheral nodes into the sample using specific expansion strategies. Extensive experiments are conducted to investigate how well sampling techniques preserve the clustering structure of graphs. Our empirical results show that the proposed sampling algorithms can preserve the population's clustering structure well and provide feasible solutions to sample the clustering structure from large-scale graphs.

关键词： graph sampling clustering structure top-leader nodes expansion strategies large-scale graphs

来源：评论

学校读者我要写书评

暂无评论

Single-shot preparation of hypergraph product codes via dimension jump

arXiv

引用

arXiv 2024年

作者： Hong, Yifan Joint Quantum Institute Joint Center for Quantum Information and Computer Science NIST University of Maryland College ParkMD20742 United States

quantum error correction is a fundamental primitive of fault-tolerant quantum computing. But in order for error correction to proceed, one must first prepare the codespace of the underlying error-correcting code. A popular method for encoding quantum low-density parity-check codes is transversal initialization, where one begins in a product state and measures a set of stabilizer generators. In the presence of measurement errors however, this procedure is generically not fault-tolerant, and so one typically needs to repeat the measurements many times, resulting in a deep initialization circuit. We present a protocol that prepares the codespace of constant-rate hypergraph product codes in constant depth with O(√n) spatial overhead, and we show that the protocol is robust even in the presence of measurement errors. Our construction is inspired by dimension-jumping in topological codes and leverages two properties that arise from the homological product of codes. We provide some improvements to lower the spatial overhead and discuss applications to fault-tolerant architectures. © 2024, CC BY.

关键词： quantum computers

来源：评论

学校读者我要写书评

暂无评论

Optimizing Resource Allocation Framework for Multi-Cloud Environment

引用

computers, Materials & Continua 2023年第5期75卷 4119-4136页

作者： Tahir Alyas Taher M.Ghazal Badria Sulaiman Alfurhood Ghassan F.Issa Osama Ali Thawabeh Qaiser Abbas Department of Computer Science Lahore Garrison UniversityLahore54000Pakistan School of Information Technology Skyline University CollegeUniversity City Sharjah1797SharjahUAE Center for Cyber Security Faculty of Information Science and TechnologyUniversiti Kebansaan Malaysia(UKM)43600BangiSelangorMalaysia Department of Computer Sciences College of Computer and Information SciencesPrincess Nourah bint Abdulrahman UniversityRiyadh11564Saudi Arabia Skyline University College University City Sharjah1797SharjahUAE Faculty of Computer and Information Systems Islamic University of Madinah Madinah42351Saudi Arabia

Cloud computingmakes dynamic resource provisioning more *** a functioning service is crucial,and changes are made when particular criteria are *** research explores the decentralized multi-cloud environment for allocating resources and ensuring the Quality of Service(QoS),estimating the required resources,and modifying allotted resources depending on workload and parallelism due to *** allocation is a complex challenge due to the versatile service providers and resource *** engagement of different service and resource providers needs a cooperation strategy for a sustainable quality of *** objective of a coherent and rational resource allocation is to attain the quality of *** also includes identifying critical parameters to develop a resource allocation mechanism.A framework is proposed based on the specified parameters to formulate a resource allocation process in a decentralized multi-cloud *** three main parameters of the proposed framework are data accessibility,optimization,and *** an optimization technique,these three segments are further divided into subsets for resource allocation and long-term service *** CloudSim simulator has been used to validate the suggested *** experiments have been conducted to find the best configurations suited for enhancing collaboration and resource allocation to achieve sustained *** results support the suggested structure for a decentralized multi-cloud environment and the parameters that have been determined.

关键词： Multi-cloud query optimization cloud resources allocation modelling virtualization

来源：评论

学校读者我要写书评

暂无评论

Lightweight Authenticated Key Agreement Protocol for Smart Power Grid Systems Using PUF

IEEE Open Journal of the Communications Society

引用

IEEE Open Journal of the Communications Society 2024年 5卷 3568-3580页

作者： Zahoor, Amina Mahmood, Khalid Saleem, Muhammad Asad Badar, Hafiz Muhammad Sanaullah Le, Tuan-Vinh Das, Ashok Kumar Department of Computer Science Sahiwal57000 Pakistan National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Douliu64002 Taiwan University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China Emerson University Multan Department of Emerging Computing Technologies Multan61000 Pakistan Fu Jen Catholic University Bachelor's Program of Artificial Intelligence and Information Security New Taipei City24206 Taiwan International Institute of Information Technology Hyderabad Center for Security Theory and Algorithmic Research Hyderabad500032 India

The Smart Power Grid (SPG) is pivotal in orchestrating and managing demand response in contemporary smart cities, leveraging the prowess of information and Communication Technologies (ICTs). Within the immersive SPG environment, the ubiquitous deployment of smart meters stands as a testament to their paramount importance in the realm of vigilant monitoring and oversight. These smart meters are installed on high-tension electricity lines and transmit information about electricity outages and other issues to the utility center. To access services from utility centers, smart meters need to communicate securely over a public channel, even though the network itself is insecure. However, potential attacks from adversaries ( Ad) can exploit this communication. Therefore, protecting this communication is of utmost importance. Several privacy-preserving authentication protocols designed for SPG have been introduced in the literature. Nevertheless, a significant number of these protocols exhibit vulnerabilities to diverse security attacks. This article introduces a lightweight and anonymous authentication protocol specifically designed to address these concerns in the SPG environment. Our protocol ensures both security and efficiency, surpassing other comparable protocols in terms of its lightweight nature. By employing both formal and informal analysis, we showcase the robustness of our protocol against significant attacks while remaining lightweight. The proposed protocol provides added security features and incurs 23.8879% lower computation cost than related protocols. Consequently, our protocol is highly suitable for implementation in the SPG system. © 2020 IEEE.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Enhance Performance of Ad-hoc Search via Prompt Learning 1

引用

28th China Conference on information Retrieval, CCIR 2022

作者： Yang, Shenghao Liu, Yiqun Xie, Xiaohui Zhang, Min Ma, Shaoping Department of Computer Science and Technology Beijing National Research Center for Information Science and Technology Tsinghua University Beijing100084 China

ISBN: (数字)9783031247552

ISBN: (纸本)9783031247545

Recently, pre-trained language models (PTM) have achieved great success on ad hoc search. However, the performance decline in low-resource scenarios demonstrates the capability of PTM has not been inspired fully. As a novel paradigm to apply PTM to downstream tasks, prompt learning is a feasible scheme to boost PTM’s performance by aligning the pre-training task and downstream task. This paper investigates the effectiveness of the standard prompt learning paradigm on the ad hoc search task. Based on various PTMs, two types of prompts are tailored for the ad hoc search task. Overall experimental results on the MS Marco dataset show the credible better performance of our prompt learning method than fine-tuning based methods and another previous prompt learning based model. Experiments conducted in various resource scenarios show the stability of prompt learning. RoBERTa and T5 deliver better results compared to BM25 using 100 training queries utilizing prompt learning, while fine-tuning based methods need more data. Further analysis shows the significance of the uniformity of tasks’ format and adding continuous tokens into training in our prompt learning method. © 2023, Springer Nature Switzerland AG.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Maximizing Resource Efficiency in Cloud Data centers through Knowledge-Based Flower Pollination Algorithm (KB-FPA)

引用

computers, Materials & Continua 2024年第6期79卷 3757-3782页

作者： Nidhika Chauhan Navneet Kaur Kamaljit Singh Saini Sahil Verma Kavita Ruba Abu Khurma Pedro A.Castillo University Institute of Computing Department Chandigarh UniversityPunjab140413India Department of Computer Science and Engineering Chandigarh UniversityPunjab140413India Universidade Federal do Piauí TeresinaPiauí64049-550Brazil MEU Research Unit Faculty of Information TechnologyMiddle East UniversityAmman11831Jordan Applied Science Research Center Applied Science Private UniversityAmman11931Jordan Department of Computer Engineering Automatics and RoboticsUniversity of GranadaGranada18071Spain

Cloud computing is a dynamic and rapidly evolving field,where the demand for resources fluctuates *** paper delves into the imperative need for adaptability in the allocation of resources to applications and services within cloud computing *** motivation stems from the pressing issue of accommodating fluctuating levels of user demand *** adhering to the proposed resource allocation method,we aim to achieve a substantial reduction in energy *** reduction hinges on the precise and efficient allocation of resources to the tasks that require those most,aligning with the broader goal of sustainable and eco-friendly cloud computing *** enhance the resource allocation process,we introduce a novel knowledge-based optimization *** this study,we rigorously evaluate its efficacy by comparing it to existing algorithms,including the Flower Pollination Algorithm(FPA),Spark Lion Whale Optimization(SLWO),and Firefly *** findings reveal that our proposed algorithm,Knowledge Based Flower Pollination Algorithm(KB-FPA),consistently outperforms these conventional methods in both resource allocation efficiency and energy consumption *** paper underscores the profound significance of resource allocation in the realm of cloud *** addressing the critical issue of adaptability and energy efficiency,it lays the groundwork for a more sustainable future in cloud computing *** contribution to the field lies in the introduction of a new resource allocation strategy,offering the potential for significantly improved efficiency and sustainability within cloud computing infrastructures.

关键词： Cloud computing resource allocation energy consumption optimization algorithm flower pollination algorithm

来源：评论

学校读者我要写书评

暂无评论

quantum advantage and lower bounds in parallel query complexity

arXiv

引用

arXiv 2024年

作者： Carolan, Joseph Gilani, Amin Shiraz Vempati, Mahathi Department of Computer Science University of Maryland United States Institute for Advanced Computer Studies University of Maryland United States Joint Center for Quantum Information and Computer Science University of Maryland United States

It is well known that quantum, randomized and deterministic (sequential) query complexities are polynomially related for total boolean functions. We find that significantly larger separations between the parallel generalizations of these measures are possible. In particular, (1) We employ the cheatsheet framework to obtain an unbounded parallel quantum query advantage over its randomized analogue for a total function, falsifying a conjecture of [Jeffery et al. 2017]. (2) We strengthen (1) by constructing a total function which exhibits an unbounded parallel quantum query advantage despite having no sequential advantage, suggesting that genuine quantum advantage could occur entirely due to parallelism. (3) We construct a total function that exhibits a polynomial separation between 2-round quantum and randomized query complexities, contrasting a result of [Montanaro. 2010] that there is at most a constant separation for 1-round (nonadaptive) algorithms. (4) We develop a new technique for deriving parallel quantum lower bounds from sequential upper bounds. We employ this technique to give lower bounds for Boolean symmetric functions and read-once formulas, ruling out large parallel query advantages for them. We also provide separations between randomized and deterministic parallel query complexities analogous to items (1)-(3). © 2024, CC BY.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

Generative Image Steganography Based on Latent Space Vector Coding and Diffusion Model 1

引用

2nd International Conference on Artificial Intelligence Security and Privacy, AIS and P 2024

作者： Liu, Weisong Yang, Jianfeng Huang, Jiewen El-Latif, Ahmed A. Abd Zhou, Zhili School of Artificial Intelligence Guangzhou University Guangzhou China School of Computer Science and Cyber Engineering Guangzhou University Guangzhou China EIAS Data Science Lab College of Computer and Information Sciences and Center of Excellence in Quantum and Intelligent Computing Prince Sultan University Riyadh11586 Saudi Arabia

ISBN: (数字)9789819611485

ISBN: (纸本)9789819611478

Image steganography is a technology that embed secret information within a cover image to obtain a stego-image for covert communication. The transmission of undetectable stego-images via social media can facilitate secure and efficient covert communication. Recently, the generative image steganography has achieved promising performance with the rapid development of generative models. However, existing generative image steganography suffers from issues, i.e., the low quality of the generated stego-image and the limited hiding capacity. To address these issues, this paper proposes a generative image steganography scheme based on latent space vector coding and diffusion model. It consists of an optimized diffusion denoising network, the latent space vector coding mapping network, and the information extraction network. In this scheme, the secret information is encoded as a latent space vector, which is then transformed in the input diffusion model to generate the stego-image. Experimental results demonstrate that this scheme achieves superior performance compared with existing generative image steganography methods. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：