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

Equalizer zero-determinant strategy in discounted repeated Stackelberg asymmetric game

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhaoyang, Cheng Guanpu, Chen Yiguang, Hong Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing100190 China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing100049 China School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden Department of Control Science and Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai210201 China

This paper focuses on the performance of equalizer zero-determinant (ZD) strategies in discounted repeated Stackerberg asymmetric games. In the leader-follower adversarial scenario, the strong Stackelberg equilibrium (SSE) deriving from the opponents’ best response (BR), is technically the optimal strategy for the leader. However, computing an SSE strategy may be difficult since it needs to solve a mixed-integer program and has exponential complexity in the number of states. To this end, we propose to adopt an equalizer ZD strategy, which can unilaterally restrict the opponent’s expected utility. We first study the existence of an equalizer ZD strategy with one-to-one situations, and analyze an upper bound of its performance with the baseline SSE strategy. Then we turn to multi-player models, where there exists one player adopting an equalizer ZD strategy. We give bounds of the sum of opponents’ utilities, and compare it with the SSE strategy. Finally, we give simulations on unmanned aerial vehicles (UAVs) and the moving target defense (MTD) to verify the effectiveness of our approach. Copyright © 2023, The Authors. All rights reserved.

关键词： Equalizers

COph100: A comprehensive fundus image registration dataset from infants constituting the "RIDIRP" database

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Hu, Yan Gong, Mingdao Qiu, Zhongxi Liu, Jiabao Shen, Hongli Yuan, Mingzhen Zhang, Xiaoqing Li, Heng Lu, Hai Liu, Jiang Research Institute of Trustworthy Autonomous Systems Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China Beijing Tongren Eye Center Beijing Tongren Hospital Capital Medical University Beijing Ophthalmology and Visual Sciences Key Laboratory Beijing China Center for High Performance Computing and Shenzhen Key Laboratory of Intelligent Bioinformatics Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China

Retinal image registration is vital for diagnostic therapeutic applications within the field of ophthalmology. Existing public datasets, focusing on adult retinal pathologies with high-quality images, have limited number of image pairs and neglect clinical challenges. To address this gap, we introduce COph100, a novel and challenging dataset known as the Comprehensive Ophthalmology Retinal Image Registration dataset for infants with a wide range of image quality issues constituting the public "RIDIRP" database1. COph100 consists of 100 eyes, each with 2 to 9 examination sessions, amounting to a total of 491 image pairs carefully selected from the publicly available dataset. We manually labeled the corresponding ground truth image points and provided automatic vessel segmentation masks for each image. We have assessed COph100 in terms of image quality and registration outcomes using state-of-the-art algorithms. This resource enables a robust comparison of retinal registration methodologies and aids in the analysis of disease progression in infants, thereby deepening our understanding of pediatric ophthalmic conditions. Copyright © 2025, The Authors. All rights reserved.

关键词： Image registration

Enhancing 6G-Satellite Network Integration with Artificial Intelligence: A Future Communication Paradigm

学校读者我要写书评

暂无评论

Enhancing 6G-Satellite Network Integration with Artificial I...

Learning and Technology Conference (L&T)

作者： Ibrahim Salah Aziza I. Hussein Mostafa Wageh Lotfy Mohamed Mourad Mabrook Control and Computer Department College of Engineering Almaaqal University Basrah Iraq College of Engineering Energy and Technology Research Center Effat University Saudi Arabia Dept. of Process Control Technology Faculty of Technology and Education Beni-Suef University Beni-Suef Egypt Space Communication Dept. Faculty of Navigation Science & Space Technology Beni-Suef University Beni-Suef Egypt

ISBN: (数字)9798331532215

ISBN: (纸本)9798331532222

The integration of 6G networks and satellite communications is set to revolutionize global connectivity, offering seamless coverage across terrestrial and non-terrestrial environments. Artificial Intelligence (AI) is essential for improving this integration, addressing challenges such as dynamic resource management, latency reduction, and network optimization. AI techniques like machine learning, deep learning, and reinforcement learning offer innovative solutions to handle the complexities of 6G-satellite networks. These advancements promise to significantly improve network efficiency, enhance data transmission reliability, and ensure seamless connectivity across different areas. Potential use cases include smart cities, autonomous vehicles, and Internet of Things (IoT) applications, where AI-driven 6G-satellite integration will be crucial. The proposed AI-enhanced 6G-satellite framework not only addresses current challenges but also lays the groundwork for a resilient, scalable, and globally interconnected communication infrastructure, offering a promising future.

关键词： 6G mobile communication Wireless communication Smart cities Resource management Reliability Internet of Things Stakeholders Artificial intelligence Vehicle dynamics Satellite communications

Resonant Beam Multi-Target DOA Estimation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Guo, Yixuan Jiang, Qingwei Xiong, Mingliang Fang, Wen Liu, Mingqing Zhang, Qingqing Liu, Qingwen Yan, Gang Research Institute for Intelligent Autonomous Systems Tongji University Shanghai201210 China Department of Computer Science and Technology Tongji University Shanghai201804 China College of Electronics and Information Engineering Tongji University Shanghai201804 China LiFi Research and Development Center Department of Engineering University of Cambridge Cambridge United Kingdom School of Information Engineering Zhejiang University of Technology Zhejiang Hangzhou310014 China University of Electronic Science and Technology of China Zhejiang Huzhou313001 China School of Physics Science and Engineering Tongji University Shanghai200092 China

With the increasing demand for internet of things (IoT) applications, especially for location-based services, how to locate passive mobile targets (MTs) with minimal beam control has become a challenge. Resonant beam systems are considered promising IoT technologies with advantages such as beam self-alignment and energy concentration. To establish a resonant system in the radio frequency (RF) band and achieve multi-target localization, this paper designs a multi-target resonant system architecture, allowing a single base station (BS) to independently connect with multiple MTs. By employing a retro-directive array, a multi-channel cyclic model is established to realize one-to-many electromagnetic wave propagation and MT direction-of-arrival (DOA) estimation through echo resonance. Simulation results show that the proposed system supports resonant establishment between the BS and multiple MTs. This helps the BS to still have high DOA estimation accuracy in the face of multiple passive MTs, and can ensure that the DOA error is less than 1◦ within a range of 6 meters at a 50◦ field of view, with higher accuracy than active beamforming localization systems. Copyright © 2024, The Authors. All rights reserved.

关键词： Direction of arrival

SPP-CNN: An Efficient Framework for Network Robustness Prediction

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wu, Chengpei Lou, Yang Wang, Lin Li, Junli Li, Xiang Chen, Guanrong The College of Computer Science Sichuan Normal University Chengdu610066 China The Key Laboratory of System Control and Information Processing Ministry of Education Shanghai200240 China The Department of Computer Science National Yang Ming Chiao Tung University Hsinchu300 Taiwan The Department of Automation Shanghai Jiao Tong University Shanghai200240 China The Institute of Complex Networks and Intelligent Systems Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai201210 China The Department of Control Science and Engineering Tongji University Shanghai200240 China The Department of Electrical Engineering City University of Hong Kong Hong Kong

This paper addresses the robustness of a network to sustain its connectivity and controllability against malicious attacks. This kind of network robustness is typically measured by the time-consuming attack simulation, which returns a sequence of values that record the remaining connectivity and controllability after a sequence of node- or edge-removal attacks. For improvement, this paper develops an efficient framework for network robustness prediction, the spatial pyramid pooling convolutional neural network (SPP-CNN). The new framework installs a spatial pyramid pooling layer between the convolutional and fully-connected layers, overcoming the common mismatch issue in the CNN-based prediction approaches and extending its generalizability. Extensive experiments are carried out by comparing SPP-CNN with three state-of-the-art robustness predictors, namely a CNN-based and two graph neural networks-based frameworks. Synthetic and real-world networks, both directed and undirected, are investigated. Experimental results demonstrate that the proposed SPP-CNN achieves better prediction performances and better generalizability to unknown datasets, with significantly lower time-consumption, than its counterparts. © 2023, CC BY.

关键词： Complex networks

Unified Temporal Erasable Itemset Mining with a Lower-Bound Strategy

学校读者我要写书评

暂无评论

Unified Temporal Erasable Itemset Mining with a Lower-Bound ...

IEEE International Conference on Big Data

作者： Tzung-Pei Hong Jia-Xiang Li Yu-Chuan Tsai Wei-Ming Huang Department of Computer Science and Information Engineering National University of Kaohsiung Department of Computer Science and Engineering National Sun Yat-Sen University Kaohsiung Taiwan Library and Information Center National University of Kaohsiung Kaohsiung Taiwan Department of Electrical and Control China Steel Inc Kaohsiung Taiwan

ISBN: (纸本)9781665480468

Erasable itemset mining has been a valuable mining problem for manufacturers. It can extract less profitable materials from a product dataset and provide managers with good decision-making and a trade-off between cost and profit. However, the traditional erasable itemset mining methods seldom consider the time factor. For time-sensitive industries such as agro-processors, the time range is important in determining which materials are less profitable. Hong et al. first proposed the concept of temporal erasable itemset mining and seven lifespan options. They also proposed a unified temporal erasable (UTE) mining algorithm for getting incomplete temporal erasable itemsets. Howerever, the UTE algorithm does not satisfy the property of downward closure. In this work, we propose an improved algorithm to improve the performance of the UTE algorithm based on a lower-bound strategy and satisfying the property of downward closure. The proposed algorithm uses a hash table to store information that will be reused during the mining process to avoid scanning a dataset multiple times. The designed lower-bound strategy can preserve the downward closure property, narrowing the search space of candidate itemsets. In numerical experiments, we compare the performance using several metrics between the proposed method and the previous work. From the results of experiments, our proposed method outperforms the existing method on various metrics, such as execution time and the number of candidate erasable itemsets.

关键词： Measurement Industries Costs Itemsets Databases Decision making Big Data

Incremental Fuzzy Utility Mining with Tree Structure

学校读者我要写书评

暂无评论

Incremental Fuzzy Utility Mining with Tree Structure

IEEE International Conference on Big Data

作者： Tzung-Pei Hong Wei-Teng Hung Wei-Ming Huang Yu-Chuan Tsai Department of Computer Science and Information Engineering National University of Kaohsiung Department of Computer Science and Engineering National Sun Yat-Sen University Kaohsiung Taiwan Department of Electrical and Control China Steel Inc Kaohsiung Taiwan Library and Information Center National University of Kaohsiung Kaohsiung Taiwan

ISBN: (纸本)9781665480468

High-utility-itemset mining, extended from frequent-itemset mining, considers external utilities of items in quantitative databases to obtain the itemsets with high utility. To easily understand those patterns with high utility values, fuzzy utility mining adopts fuzzy sets to increase the readability of the derived utility itemsets. However, real-world databases are usually dynamic. New transactions may be intermittently added, and the corresponding mined patterns must be updated to keep correct knowledge. In this paper, we propose an incremental method based on our previously proposed batch-processing fuzzy utility tree-based mining algorithm. The proposed approach adopts the fast-update (FUP) strategy. It considers newly coming data to readjust the head table and the tree structure, which generate desired itemsets in two phases. The experimental results reveal that the proposed algorithm outperforms the tree-based batch mining method.

关键词： Fuzzy sets Databases Itemsets Heuristic algorithms Big Data Data mining

Robust control of Unknown Switched Linear Systems from Noisy Data

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Liu, Wenjie Li, Yifei Sun, Jian Wang, Gang Chen, Jie National Key Lab of Autonomous Intelligent Unmanned Systems School of Automation Beijing Institute of Technology Beijing100081 China Beijing Institute of Technology Chongqing Innovation Center Chonqing401120 China Department of Control Science and Engineering Tongji University Shanghai201804 China

This paper investigates the problem of data-driven stabilization for linear discrete-time switched systems with unknown switching dynamics. In the absence of noise, a data-based state feedback stabilizing controller can be obtained by solving a semi-definite program (SDP) on-the-fly, which automatically adapts to the changes of switching dynamics. However, when noise is present, the persistency of excitation condition based on the closed-loop data may be undermined, rendering the SDP infeasible. To address this issue, an auxiliary function-based switching control law is proposed, which only requires intermittent SDP solutions when its feasibility is guaranteed. By analyzing the relationship between the controller and the system switching times, it is shown that the proposed controller guarantees input-to-state practical stability (ISpS) of the closed-loop switched linear system, provided that the noise is bounded and the dynamics switches slowly enough. Two numerical examples are presented to verify the effectiveness of the proposed controller. © 2023, CC BY.

关键词： controllers

Non-convex potential games for finding global solutions to sensor network localization

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Xu, Gehui Chen, Guanpu Hong, Yiguang Fidan, Baris Parisini, Thomas Johansson, Karl H. Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing China Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden Department of Control Science and Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201210 China Department of Mechanical and Mechatronics Engineering University of Waterloo WaterlooONN2L 3G1 Canada Department of Electrical and Electronic Engineering Imperial College London LondonSW7 2AZ United Kingdom Department of Engineering and Architecture University of Trieste Trieste34127 Italy

Sensor network localization (SNL) problems require determining the physical coordinates of all sensors in a network. This process relies on the global coordinates of anchors and the available measurements between non-anchor and anchor nodes. Attributed to the intrinsic non-convexity, obtaining a globally optimal solution to SNL is challenging, as well as implementing corresponding algorithms. In this paper, we formulate a non-convex multi-player potential game for a generic SNL problem to investigate the identification condition of the global Nash equilibrium (NE) therein, where the global NE represents the global solution of SNL. We employ canonical duality theory to transform the non-convex game into a complementary dual problem. Then we develop a conjugation-based algorithm to compute the stationary points of the complementary dual problem. On this basis, we show an identification condition of the global NE: the stationary point of the proposed algorithm satisfies a duality relation. Finally, simulation results are provided to validate the effectiveness of the theoretical results. Copyright © 2023, The Authors. All rights reserved.

关键词： Sensor networks