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

Fully Decentralized Design of Initialization-free Distributed Network Size Estimation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Lee, Donggil Kim, Taekyoo Lee, Seungjoon Shim, Hyungbo Center for Intelligent and Interactive Robotics Korea Institute of Science and Technology Seoul02792 Korea Republic of The Train Control and Communication Team Korea Railroad Research Institute Uiwang16105 Korea Republic of NAVER Labs Seongnam13161 Korea Republic of ASRI Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of

In this paper, we propose a distributed scheme for estimating the network size, which refers to the total number of agents in a network. By leveraging a synchronization technique for multi-agent systems, we devise an agent dynamics that ensures convergence to an equilibrium point located near the network size regardless of its initial condition. Our approach is based on an assumption that each agent has a unique identifier, and an estimation algorithm for obtaining the largest identifier value. By adopting this approach, we successfully implement the agent dynamics in a fully decentralized manner, ensuring accurate network size estimation even when some agents join or leave the network. © 2024, CC BY-NC-ND.

关键词： Multi agent systems

Competitive Perimeter Defense of Conical Environments

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Bajaj, Shivam Torng, Eric Bopardikar, Shaunak D. Moll, Alexander Von Weintraub, Isaac Garcia, Eloy Casbeer, David W. the Department of Electrical and Computer Engineering Michigan State University United States the Department of Computer Science and Engineering Michigan State University United States Control Science Center Air Force Research Laboratory

We consider a perimeter defense problem in a planar conical environment in which a single vehicle, having a finite capture radius, aims to defend a concentric perimeter from mobile intruders. The intruders are arbitrarily released at the circumference of the environment and they move radially toward the perimeter with fixed speed. We present a competitive analysis approach to this problem by measuring the performance of multiple online algorithms for the vehicle against arbitrary inputs, relative to an optimal offline algorithm that has information about entire input sequence in advance. In particular, we establish two necessary conditions on the parameter space to guarantee (i) finite competitiveness of any algorithm and (ii) a competitive ratio of at least 2 for any algorithm. We then design and analyze three online algorithms and characterize parameter regimes in which they have finite competitive ratios. Specifically, our first two algorithms are provably 1, and 2-competitive, respectively, whereas our third algorithm exhibits different competitive ratios in different regimes of problem parameters. Finally, we provide a numerical plot in the parameter space to reveal additional insights into the relative performance of our algorithms. © 2021, CC BY.

关键词： Network security

Radiomics model based on computed tomography images for prediction of radiation-induced optic neuropathy following radiotherapy of brain and head and neck tumors

学校读者我要写书评

暂无评论

Heliyon 2025年第1期11卷 e41409页

作者： Nafchi, Elham Raiesi Fadavi, Pedram Amiri, Sepideh Cheraghi, Susan Garousi, Maryam Nabavi, Mansoureh Daneshi, Iman Gomar, Marzieh Molaie, Malihe Nouraeinejad, Ali Department of Radiation Sciences Faculty of Allied Medicine Iran University of Medical Sciences Tehran Iran Department of Radiation Oncology School of Medicine Iran University of Medical Science Tehran Iran Department of Information Technology Faculty of Electrical and Computer Engineering University of Tehran Tehran Iran Radiation Biology Research Center Iran University of Medical Sciences Tehran Iran Radiation Oncology Research Center (RORC) Cancer Institute Tehran University of Medical Sciences Tehran Iran Department of Clinical Oncology Haft-e-Tir Hospital Iran University of Medical Science Tehran Iran Control and Intelligent Processing Center of Excellence School of Electrical and Computer Engineering College of Engineering University of Tehran Tehran Iran Department of Optometry and Vision Science School of Rehabilitation Tehran University of Medical Science Tehran Iran

Purpose: We aimed to build a machine learning-based model to predict radiation-induced optic neuropathy in patients who had treated head and neck cancers with radiotherapy. Materials and methods: To measure radiation-induced optic neuropathy, the visual evoked potential values were obtained in both case and control groups and compared. Radiomics features were extracted from the area segmented which included the right and left optic nerves and chiasm. We integrated CT image features with dosimetric and clinical data subsequently, ranked 5 supervised ML models Bernoulli Naive Bayes, Decision Tree, Gradient Boosting Decision Trees, K-Nearest Neighbor, and Random Forest on 4 input datasets to predict radiation-induced visual complications classifiers by implementing 5-fold cross-validation. The F1 score, accuracy, sensitivity, specificity, and area under the ROC curve were compared to access prediction capability. Results: radiation-induced optic neuropathy affected 31 % of the patients. 856 radiomic characteristics were extracted and selected from each segmented area. Decision Tree and Random Forest with the highest AUC (97 % and 95 % respectively) among the five classifiers were the most powerful algorithms to predict radiation-induced optic neuropathy. Chiasm with higher sensitivity and precision was able to predict radiation-induced optic neuropathy better than right or left optic nerve or combination of all radiomic features. Conclusion: We found that combination of radiomic, dosimetric, and clinical factors can predict radiation-induced optic neuropathy after radiation treatment with high accuracy. To acquire more reliable results, it is recommended to conduct visual evoked potential tests before and after radiation therapy, with multiple follow-up courses and more patients. © 2024 The Authors

关键词： Computed tomography Machine learning Radiation-induced optic neuropathy Radiomics Visual evoked potential

Adaptive Block Elevation Mapping for Large-scale Scene

学校读者我要写书评

暂无评论

Adaptive Block Elevation Mapping for Large-scale Scene

IEEE International Conference on Robotics and Biomimetics

作者： Yang Zhou Shiqiang Zhu Huang Huang Yuehua Li Jason Gu Research Center for Intelligent Robotics Research Institute of Interdisciplinary Innovation Zhejiang Laboratory Hangzhou China Zhejiang Engineering Research Center for Intelligent Robotics Hangzhou China Beijing Institute of Control Engineering Beijing China Beijing Research Institute of Zhejiang Laboratory Beijing China Department of Electrical and Computer Engineering Dalhousie University Halifax NS Canada

ISBN: (纸本)9781665481106

Dense map that contains the surrounding geometry and vision information of a robot is widely used for path planning, navigation, obstacle avoidance and other applications. Considering the performance of the processing unit mounted on the robot is limited, mapping algorithm has to make compromise by sacrificing speed and precision. It will be more challenging when the dense mapping scene is very large because the memory consumption will be greatly increased and the map is difficult to be extended if beyonding the initial map. To suppress the negative impact from the increased map scale, we proposed a novel block mapping approach to generate the dense map in large scale of scene. In this work, the elevation map is selected as the base dense map. The entire elevation map is segmented into numerous block maps of which size is much smaller than that of the entire map. The present moment of lidar and vision measurements are used to generate the local elevation map. The local elevation map is used to update block maps which are adaptively generated along the motion trajectory. A memory-disk interaction mechanism, which the block maps will be loaded to memory or saved to local disk when needed, is introduced. Our block mapping approach is tested on the KITTI datasets, and the results demonstrate that the mapping approach can stably operate in a large scale of scene with a much smaller consumption of memory.

关键词： Geometry Laser radar Navigation Motion segmentation Memory management Robot sensing systems Trajectory

Output consensus control for linear port-Hamiltonian systems

学校读者我要写书评

暂无评论

IFAC-PapersOnLine 2022年第30期55卷 230-235页

作者： Shuai Feng Yu Kawano Michele Cucuzzella Jacquelien M.A. Scherpen School of Automation Nanjing University of Science and Technology Nanjing 210094 China Graduate School of Advanced Science and Engineering Hiroshima University Higashi-Hiroshima 739-8527 Japan Department of Electrical Computer and Biomedical Engineering University of Pavia 27100 Pavia PV Italy Jan C. Willems Center for Systems and Control ENTEG Faculty of Science and Engineering University of Groningen 9747 AG Groningen the Netherlands

In this paper, we study output consensus of coupled linear port-Hamiltonian systems on graphs in the presence of constant disturbances, where couplings are allowed to be both static and dynamic. Utilizing port-Hamiltonian structures, we present dynamic controllers achieving output consensus where the consensus values are determined by the disturbances. Finally, the utility of the proposed controller is illustrated by applying it to current sharing of DC microgrids.

关键词： port-Hamiltonian systems networked systems output consensus

Fractional cyber-neural systems - a brief survey

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Reed, Emily Chatterjee, Sarthak Ramos, Guilherme Bogdan, Paul Pequito, Sérgio Ming Hsieh Department of Electrical and Computer Engineering University of Southern California Los AngelesCA United States Department of Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute TroyNY United States Department of Electrical and Computer Engineering Faculty of Engineering University of Porto Portugal Delft Center for Systems and Control Delft University of Technology Delft Netherlands

Neurotechnology has made great strides in the last 20 years. However, we still have a long way to go to commercialize many of these technologies as we lack a unified framework to study cyber-neural systems (CNS) that bring the hardware, software, and the neural system together. Dynamical systems play a key role in developing these technologies as they capture different aspects of the brain and provide insight into their function. Converging evidence suggests that fractional-order dynamical systems are advantageous in modeling neural systems because of their compact representation and accuracy in capturing the long-range memory exhibited in neural behavior. In this brief survey, we provide an overview of fractional CNS that entails fractional-order systems in the context of CNS. In particular, we introduce basic definitions required for the analysis and synthesis of fractional CNS, encompassing system identification, state estimation, and closed-loop control. Additionally, we provide an illustration of some applications in the context of CNS and draw some possible future research directions. Ultimately, advancements in these three areas will be critical in developing the next generation of CNS, which will, ultimately, improve people’s quality of life. Copyright © 2021, The Authors. All rights reserved.

关键词： Surveys

Interpreting Industrial IoT Data Streams Through Fuzzy Querying With Hysteretic Fuzzy Sets on Apache Kafka

学校读者我要写书评

暂无评论

IEEE Transactions on Fuzzy Systems 2024年第8期32卷 4671-4684页

作者： Bożena Małysiak-Mrozek Bartłomiej Ryba Marek Molęda Che-Lun Hung Witold Pedrycz Weiping Ding Dariusz Mrozek Department of Distributed Systems and Informatic Devices Silesian University of Technology Gliwice Poland Department of Applied Informatics Silesian University of Technology Gliwice Poland Institute of Biomedical Informatics National Yang Ming Chiao Tung University Taipei City Taiwan Department of Electrical and Computer Engineering University of Alberta Edmonton AB Canada Department of Measurements and Control Systems Silesian University of Technology Gliwice Poland Research Center of Performance and Productivity Analysis Istinye University Istanbul Türkiye School of Artificial Intelligence and Computer Science Nantong University Nantong China Faculty of Data Science City University of Macau Macau China

In industrial settings, querying data streams from Internet of Things (IoT) devices benefits from utilizing elastic criteria to enhance the interpretability of the current state of the monitored environment. Fuzzy sets provide this elasticity, enabling the aggregation and representation of similar values in a human-comprehensible manner. However, many sensor signals exhibit temporal oscillations, leading to varying interpretations of the signal based on its current trend (rising or falling). This hysteresis in signal (and subsequently of the production device) interpretation inspired us to introduce this phenomenon into data stream processing, resulting in the novel concept of hysteretic fuzzy sets. This article demonstrates how fuzzy searching and grouping can be applied to IoT sensor signals in flexible Big Data stream processing on Apache Kafka. We illustrate the impact of data stream querying with KSQL queries involving fuzzy sets (encompassing fuzzy filtering of data stream events, fuzzy transformation of data stream attributes, fuzzy grouping, and joining) on the flexibility of executed operations and computational resources utilized by the Kafka processing engine. Finally, our experiments with hysteretic fuzzy sets while analyzing sensor signals in power plants demonstrate that this novel approach effectively reduces the number of alarms while monitoring the state of the production machine.

关键词： Streams Fuzzy sets Internet of Things Big Data Monitoring Production Real-time systems

Observer Attack on Stream Ciphers

学校读者我要写书评

暂无评论

IFAC-PapersOnLine 2022年第30期55卷 13-18页

作者： Ramachandran Anantharaman Virendra Sule Research Center for Supervision Safety and Automatic Control Universitat Politècnica de Catalunya (UPC) Rambla Sant Nebridi 22 08222 Terrassa Spain Department of Electrical and Computer Engineering (IDE) University of Stavanger (UiS) Kristine Bonnevies vei 22 4021 Stavanger Norway

This paper proposes an application of a new observer theory for non-linear systems developed previously to solve the Cryptanalysis problem of a special class of pseudorandom generators which are commonly used in Cryptography. The Cryptanalysis problem addressed here is that of the recovery of internal state of the non-linear dynamic stream generator from the output stream. The proposed methodology is termed as observability attack. It is also shown that for a special class of generators, the computations are of complexity O (D 4 ) in pre-computation and of O(D) for online computation, where D  = σ d i=0 (n i) for this class of stream generators with n states and d the degree of the output function. The attack is technically applicable over general finite fields as well as most dynamic systems arising from models of stream ciphers and appropriate bounds on computation are estimated. From these complexity bounds, it follows that this attack is feasible in realistic cases and gives important estimates of time and memory resources required for Cryptanalysis of a class of stream ciphers.

关键词： Stream ciphers Cryptanalysis Boolean Dynamical Systems Observer Design Koopman Operator

Joint Optimization of Resource Allocation and User Association in Multi-Frequency Cellular Networks Assisted by RIS

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Qiao, Yuanyuan Niu, Yong Han, Zhu Mao, Shiwen He, Ruisi Wang, Ning Zhong, Zhangdui Ai, Bo The State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing100044 China Beijing Engineering Research Center of High-speed Railway Broadband Mobile Communications Beijing Jiaotong University Beijing100044 China The National Mobile Communications Research Laboratory Southeast University Nanjing211189 China The Department of Electrical and Computer Engineering The University of Houston HoustonTX77004 United States The Department of Computer Science and Engineering Kyung Hee University Seoul446-701 Korea Republic of The Department of Electrical and Computer Engineering Auburn University AuburnAL36849-5201 United States The School of Information Engineering Zhengzhou University Zhengzhou450001 China Henan Joint International Research Laboratory of Intelligent Networking and Data Analysis Zhengzhou University Zhengzhou450001 China

Due to the development of communication technology and the rise of user network demand, a reasonable resource allocation for wireless networks is the key to guaranteeing regular operation and improving system performance. Various frequency bands exist in the natural network environment, and heterogeneous cellular network (HCN) has become a hot topic for current research. Meanwhile, Reconfigurable Intelligent Surface (RIS) has become a key technology for developing next-generation wireless networks. By modifying the phase of the incident signal arriving at the RIS surface, RIS can improve the signal quality at the receiver and reduce co-channel interference. In this paper, we develop a RIS-assisted HCN model for a multi-base station (BS) multi-frequency network, which includes 4G, 5G, millimeter wave (mmwave), and terahertz networks, and considers the case of multiple network coverage users, which is more in line with the realistic network characteristics and the concept of 6G networks. We propose the optimization objective of maximizing the system sum rate, which is decomposed into two subproblems, i.e., the user resource allocation and the phase shift optimization problem of RIS components. Due to the NP-hard and coupling relationship, we use the block coordinate descent (BCD) method to alternately optimize the local solutions of the coalition game and the local discrete phase search algorithm to obtain the global solution. In contrast, most previous studies have used the coalition game algorithm to solve the resource allocation problem alone. Simulation results show that the algorithm performs better than the rest of the algorithms, effectively improves the system sum rate, and achieves performance close to the optimal solution of the traversal algorithm with low complexity. Copyright © 2023, The Authors. All rights reserved.

关键词： Resource allocation