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

Asymptotic properties of distributed social sampling algorithm

学校读者我要写书评

暂无评论

science China(Information sciences) 2020年第1期63卷 152-166页

作者： Qian LIU Xingkang HE Haitao FANG The Key Laboratory of Systems and Control Academy of Mathematics and Systems ScienceChinese Academy of Sciences School of Mathematical Sciences University of Chinese Academy of Sciences ACCESS Linnaeus Centre School of Electrical Engineering and Computer ScienceKTH Royal Institute of Technology

Social sampling is a novel randomized message passing protocol inspired by social communication for opinion formation in social networks. In a typical social sampling algorithm, each agent holds a sample from the empirical distribution of social opinions at initial time, and it collaborates with other agents in a distributed manner to estimate the initial empirical distribution by randomly sampling a message from current distribution estimate. In this paper, we focus on analyzing the theoretical properties of the distributed social sampling algorithm over random networks. First, we provide a framework based on stochastic approximation to study the asymptotic properties of the algorithm. Then, under mild conditions, we prove that the estimates of all agents converge to a common random distribution, which is composed of the initial empirical distribution and the accumulation of quantized error. Besides, by tuning algorithm parameters, we prove the strong consistency, namely, the distribution estimates of agents almost surely converge to the initial empirical distribution. Furthermore, the asymptotic normality of estimation error generated by distributed social sample algorithm is addressed. Finally, we provide a numerical simulation to validate the theoretical results of this paper.

关键词： social networks opinion formation social sampling stochastic approximation random networks asymptotic normality

Differential Privacy-based Avatar Update in Cooperative Intelligent Transportation System Metaverse 10

学校读者我要写书评

暂无评论

Differential Privacy-based Avatar Update in Cooperative Inte...

10th International Conference on computer and Communications, ICCC 2024

作者： Khan, Salabat Luo, Fei Khan, Mansoor Ullah, Insaf Amin, Farhan Ullah, Shamsher Rahim, Mussadiq Abdul School of Computer and Enformation Engineering Qilu Institute of Technology Jinan China School of Computing and Information Technology Great Bay University Dongguan China School of Intelligent Manufacturing and Control Engineering Qilu Institute of Technology Jinan China Institute for Analytics and Data Science University of Essex ColchesterCO4 3SQ United Kingdom School of Computer Science and Engineering Yeungnam University Korea Republic of Shenzhen University National Engineering Laboratory for Big Data Shenzhen China Dhahran31261 Saudi Arabia

Metaverse is the next generation and the successor to the Internet. Various sectors allocated capital to adapt the metaverse due to its inherent importance. Cooperative Intelligent Transportation Systems (C-ITS) is one of the important sectors that can benefit from metaverse adaptation and integration. The C-ITS and metaverse integration give rise to new use cases and cyber attacks. However, traditional Pseudonym Certificate (PCert) authentication based on Vehicular Public Key Infrastructure (VPKI) cannot meet the new use cases and thwart cyber attacks. We present a Differential Privacy (DP)-based PCert and avatar update model to ensure the privacy of end-devices (e.g., vehicles) in the C-ITS metaverse. The proposed DP-based model adds noise to avatar attributes (e.g., color, behavior) to prevent avatar linkage during the PCert update process. Our method ensures that PCerts and avatars cannot be linked to end-devices and the previous PCerts and avatars. We simulate the DP-based method to investigate it in terms of privacy, latency, color distortion, and adversarial success rate, and the results show that DP-based is effective and practical for avatar updates. © 2024 IEEE.

关键词： Advanced driver assistance systems

Distributed Event-Triggered Bandit Convex Optimization with Time-Varying Constraints

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Kunpeng Yi, Xinlei Wen, Guanghui Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China The Laboratory for Information and Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States The Department of Mathematics Southeast University Nanjing210096 China The Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers the distributed bandit convex optimization problem with time-varying inequality constraints over a network of agents, where the goal is to minimize network regret and cumulative constraint violation. Existing distributed online algorithms require that each agent broadcasts its decision to its neighbors at each iteration. To better utilize the limited communication resources, we propose a distributed event-triggered online primal-dual algorithm with two-point bandit feedback. Under several classes of appropriately chosen decreasing parameter sequences and non-increasing event-triggered threshold sequences, we establish dynamic network regret and network cumulative constraint violation bounds. These bounds are comparable to the results achieved by distributed event-triggered online algorithms with full-information feedback. Finally, a numerical example is provided to verify the theoretical results. Copyright © 2024, The Authors. All rights reserved.

关键词： Convex optimization

Wind Power Forecasting Methods Based on Deep Learning:A Survey

学校读者我要写书评

暂无评论

computer Modeling in engineering & sciences 2020年第1期122卷 273-301页

作者： Xing Deng Haijian Shao Chunlong Hu Dengbiao Jiang Yingtao Jiang School of Computer Science Jiangsu University of Science and TechnologyZhenjiangChina School of Automation Key Laboratory of Measurement and Control for CSEMinistry of EducationSoutheast UniversityNanjingChina Department of Electrical and Computer Engineering University of NevadaLas VegasUSA

Accurate wind power forecasting in wind farm can effectively reduce the enormous impact on grid operation safety when high permeability intermittent power supply is connected to the power *** to provide reference strategies for relevant researchers as well as practical applications,this paper attempts to provide the literature investigation and methods analysis of deep learning,enforcement learning and transfer learning in wind speed and wind power forecasting ***,wind speed and wind power forecasting around a wind farm requires the calculation of the next moment of the definite state,which is usually achieved based on the state of the atmosphere that encompasses nearby atmospheric pressure,temperature,roughness,and *** an effective method of high-dimensional feature extraction,deep neural network can theoretically deal with arbitrary nonlinear transformation through proper structural design,such as adding noise to outputs,evolutionary learning used to optimize hidden layer weights,optimize the objective function so as to save information that can improve the output accuracy while filter out the irrelevant or less affected information for *** establishment of high-precision wind speed and wind power forecasting models is always a challenge due to the randomness,instantaneity and seasonal characteristics.

关键词： Deep learning reinforcement learning transfer learning wind power forecasting

The OPS-SAT benchmark for detecting anomalies in satellite telemetry

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ruszczak, Bogdan Kotowski, Krzysztof Evans, David Nalepa, Jakub Faculty of Electrical Engineering Automatic Control and Informatics Department of Informatics Opole University of Technology Prószkowska Str. 76 Opole45-758 Poland Faculty of Automatic Control Electronics and Computer Science Department of Algorithmics and Software Silesian University of Technology Akademicka Str. 16 Gliwice44-100 Poland KP Labs Bojkowska Str. 37J Gliwice44-100 Poland European Space Agency ESOC Robert-Bosch-Str. 5 Darmstadt64293 Germany

Detecting anomalous events in satellite telemetry is a critical task in space operations. This task, however, is extremely time-consuming, error-prone and human dependent, thus automated data-driven anomaly detection algorithms have been emerging at a steady pace. However, there are no publicly available datasets of real satellite telemetry accompanied with the ground-truth annotations that could be used to train and verify anomaly detection supervised models. In this article, we address this research gap and introduce the AI-ready benchmark dataset (OPSSAT-AD) containing the telemetry data acquired on board OPS-SAT—a CubeSat mission which has been operated by the European Space Agency which has come to an end during the night of 22–23 May 2024 (CEST). The dataset is accompanied with the baseline results obtained using 30 supervised and unsupervised classic and deep machine learning algorithms for anomaly detection. They were trained and validated using the training-test dataset split introduced in this work, and we present a suggested set of quality metrics which should be always calculated to confront the new algorithms for anomaly detection while exploiting OPSSAT-AD. We believe that this work may become an important step toward building a fair, reproducible and objective validation procedure that can be used to quantify the capabilities of the emerging anomaly detection techniques in an unbiased and fully transparent way. © 2024, CC BY.

关键词： Anomaly detection

LESSON: Multi-Label Adversarial False Data Injection Attack for Deep Learning Locational Detection

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Tian, Jiwei Shen, Chao Wang, Buhong Xia, Xiaofang Zhang, Meng Lin, Chenhao Li, Qian Ministry of Education Key Laboratory for Intelligent Networks and Network Security School of Cyber Science and Engineering Xi’an Jiaotong University Xi’an China Air Traffic Control and Navigation College Air Force Engineering University Xi’an China Information and Navigation College Air Force Engineering University Xi’an China School of Computer Science and Technology Xidian University Xi’an China

—Deep learning methods can not only detect false data injection attacks (FDIA) but also locate attacks of FDIA. Although adversarial false data injection attacks (AFDIA) based on deep learning vulnerabilities have been studied in the field of single-label FDIA detection, the adversarial attack and defense against multi-label FDIA locational detection are still not involved. To bridge this gap, this paper first explores the multi-label adversarial example attacks against multi-label FDIA locational detectors and proposes a general multi-label adversarial attack framework, namely muLti-labEl adverSarial falSe data injectiON attack (LESSON). The proposed LESSON attack framework includes three key designs, namely Perturbing State Variables, Tailored Loss Function Design, and Change of Variables, which can help find suitable multi-label adversarial perturbations within the physical constraints to circumvent both Bad Data Detection (BDD) and Neural Attack Location (NAL). Four typical LESSON attacks based on the proposed framework and two dimensions of attack objectives are examined, and the experimental results demonstrate the effectiveness of the proposed attack framework, posing serious and pressing security concerns in smart grids. © 2024, CC BY.

关键词： Location

Bone Marrow Cell Segmentation Based on Improved U-Net 1

学校读者我要写书评

暂无评论

6th International Conference on Data Mining and Big Data, DMBD 2021

作者： Jin, Lingmin Yu, Zhaochai Fan, Haoyi Teng, Shenghua Li, Zuoyong College of Electronic and Information Engineering Shandong University of Science and Technology Qingdao266590 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Control Engineering Minjiang University Fuzhou350121 China School of Information Engineering Zhengzhou University Zhengzhou450001 China

ISBN: (数字)9789811674761

ISBN: (纸本)9789811674754

automatic segmentation of bone marrow cells plays an important role in the diagnosis of many blood diseases such as anemia and leukemia. Due to the complex morphology and wide variety of bone marrow cells, their segmentation is still a challenging task. To improve the accuracy of bone marrow cell segmentation, we propose an end-to-end U-shaped network based on the pyramid residual convolution and the attention mechanism. Specifically, the standard convolution and dilated convolution are combined as its feature encoder, which designs a pyramid residual convolution block to extract multi-scale features. Then, the attention gating mechanism is introduced into each skip connection module for fusing the shallow and deep information. Finally, the proposed method combines convolution and deconvolution for feature decoding to achieve the final segmentation of bone marrow cells. Experiments with quantitative and qualitative comparisons are carried out on a self-built bone marrow smear dataset. Experimental results demonstrate the superiority of the proposed method over several state-of-the-art methods. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Image segmentation

The Meta Distribution of SINR in UAV-Assisted Cellular Networks

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Shi, Minwei Yang, Kai Niyato, Dusit Yuan, Hang Zhou, He Xu, Zhan The School of Information and Electronics Beijing Institute of Technology Beijing100081 China The School of Cyberspace Science and Technology Beijing Institute of Technology Beijing100081 China The School of Computer Science and Engineering Nanyang Technological University 639798 Singapore The Key Laboratory of Modern Measurement and Control Technology Beijing Information Science and Technology University Beijing100101 China The School of Information and Communication Engineering Beijing Information Science and Technology University Beijing100101 China

Mounting compact and lightweight base stations on unmanned aerial vehicles (UAVs) is a cost-effective and flexible solution to provide seamless coverage on the existing terrestrial networks. While the coverage probability in UAV-assisted cellular networks has been widely investigated, it provides only the first-order statistic of signal-to-interference-plus-noise ratio (SINR). In this paper, to analyze high-order statistics of SINR and characterize the disparity among individual links, we provide a meta distribution (MD)-based analytical framework for UAV-assisted cellular networks, in which the probabilistic line-of-sight channel and realistic antenna pattern are taken into account for air-to-ground transmissions. To accurately characterize the interference from UAVs, we relax the widely applied uniform off-boresight angle (OBA) assumption and derive the exact distribution of OBA. Using stochastic geometry, for both steerable and vertical antenna scenarios, we obtain mathematical expressions for the moments of condition success probability, the SINR MD, and the mean local delay. Moreover, we study the asymptotic behavior of the moments as network density approaches infinity. Numerical results validate the tightness of the theoretical results and show that the uniform OBA assumption underestimates the network performance, especially in the regime of moderate altitude of UAV. We also show that when UAVs are equipped with steerable antennas, the network coverage and user fairness can be optimized simultaneously by carefully adjusting the UAV parameters. Copyright © 2023, The Authors. All rights reserved.

关键词： Directional patterns (antenna)

Multi-kernel Correntropy-based Orientation Estimation of IMUs: Gradient Descent Methods

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Li, Shilei Li, Lijing Shi, Dawei Lou, Yunjiang Shi, Ling The Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology Hong Kong The School of Information and Control Engineering China University of Mining and Technology China The School of Automation Beijing Institute of Technology China The State Key Laboratory of Robotics and System School of Mechanical Engineering and Automation Harbin Institute of Technology Shenzhen Shenzhen518055 China

This paper presents two computationally efficient algorithms for the orientation estimation of inertial measurement units (IMUs): the multi-kernel correntropy-based gradient descent (CGD) and the multi-kernel correntropy-based decoupled orientation estimation (CDOE). Traditional methods, such as gradient descent (GD) and decoupled orientation estimation (DOE), rely on the least square (LS) criterion in algorithm derivation, making them vulnerable to external acceleration and magnetic interference. To address this issue, we first demonstrate that the multi-kernel correntropy loss (MKCL) is an optimal objective function under the maximum likelihood estimation (MLE) framework when the noise follows a specific type of heavy-tailed distribution. Then, we provide some important properties of the MKCL as a cost function. By replacing the LS cost with the MKCL, we develop the CGD and CDOE algorithms. We evaluate the effectiveness of our proposed methods by comparing them with existing algorithms in various situations. Experimental results indicate that our proposed methods (CGD and CDOE) outperform their conventional counterparts (GD and DOE), especially when faced with external acceleration and magnetic disturbances. Furthermore, the new algorithms demonstrate significantly lower computational complexity than Kalman filter-based approaches, making them suitable for applications with low-cost microprocessors. Copyright © 2023, The Authors. All rights reserved.

关键词： Maximum likelihood estimation