Weight Try-Once-Discard Protocol-Based L_2 L_infinity State Estimation for Markovian Jumping Neural Networks with Partially Known Transition Probabilities

It was the L_2 L_infinity performance index that for the first time is initiated into the discussion on state estimation of delayed MJNNs with with partially known transition probabilities, which provides a more general promotion for the estimation error.The WTOD protocol is adopted to dispatch the sensor nodes so as to effectively alleviate the updating frequency of output signals. The hybrid effects of the time delays, Markov chain, and protocol parameters are apparently reflected in the co-designed estimator which can be solved by a combination of comprehensive matrix inequalities

On State Estimation for Discrete Time-Delayed Memristive Neural Networks Under the WTOD Protocol: A Resilient Set-Membership Approach

In this article, a resilient set-membership approach is put forward to deal with the state estimation problem for a sort of discrete-time memristive neural networks (DMNNs) with hybrid time delays under the weighted try-once-discard protocol (WTODP). The WTODP is utilized to mitigate unnecessary network congestion occurring in the channel between DMNNs and the state estimator. In order to ensure resilience against possible realization errors, the estimator gain is permitted to undergo some norm-bounded parameter drifts. Our objective is to design a resilient set-membership estimator (RSME) that is capable of resisting gain variations and unknown-but-bounded noises by confining the estimation error to certain ellipsoidal regions. By resorting to the recursive matrix inequality technique, sufficient conditions are acquired for the existence of the expected RSME and, subsequently, an optimization problem is formalized by minimizing the constraint ellipsoid (with respect to the estimation error) under WTODP. Finally, numerical simulation is carried out to validate the usefulness of RSME.10.13039/501100001809-National Natural Science Foundation of China (Grant Number: 61873058, 61873148 and 61933007); AHPU Youth Top-Notch Talent Support Program of China (Grant Number: 2018BJRC009); Natural Science Foundation of Universities in Anhui Province of China (Grant Number: gxyqZD2019053); Heilongjiang Postdoctoral Sustentation Fund of China (Grant Number: LBH-Z19048); Royal Society of the U.K.; Alexander von Humboldt Foundation of Germany

Multi-sensor multi-rate fusion estimation for networked systems: Advances and perspectives

National Natural Science Foundation of China under Grants 62103095, 61873058, 61873148 and 61933007; AHPU Youth Top-notch Talent Support Program of China under Grant 2018BJRC009; Natural Science Foundation of Anhui Province of China under Grant 2108085MA07; Royal Society of the UK; Alexander von Humboldt Foundation of Germany

Energy-to-Peak State Estimation With Intermittent Measurement Outliers: The Single-Output Case

National Natural Science Foundation of China (Grant Number: 61703245, 61873148, 61933007 and 61873058); China Postdoctoral Science Foundation (Grant Number: 2018T110702); Postdoctoral Special Innovation Foundation of Shandong province of China (Grant Number: 201701015); Natural Science Foundation of Heilongjiang Province of China (Grant Number: ZD2019F001); European Unions Horizon 2020 Research and Innovation Programme (Grant Number: 820776 (INTEGRADDE)); Royal Society of the U.K.; Alexander von Humboldt Foundation of Germany

H∞ State Estimation for BAM Neural Networks With Binary Mode Switching and Distributed Leakage Delays Under Periodic Scheduling Protocol

Research and Development Office Ministry of Education Kingdom of Saudi Arabia (Grant Number: HIQI-2-2019); National Natural Science Foundation of China (Grant Number: 61903254)

Scalable consensus filtering for uncertain systems over sensor networks with Round-Robin protocol

Alexander von Humboldt Foundation of Germany; China Postdoctoral Science Foundation. Grant Number: 2017M621242,2020T130092; Fundamental Research Funds for Provincial Undergraduate Universities of Heilongjiang Province of China. Grant Number: 2018QNL-05, KYCXTD201802; National Natural Science Foundation of China. Grant Number: 61873058, 61873148, 61933007, 62073070; Natural Science Foundation of Heilongjiang Province of China. Grant Number: F2018005; PetroChina Innovation Foundation. Grant Number: 2018D-5007-0302

Empower parameterized generative adversarial networks using a novel particle swarm optimizer: algorithms and applications

Copyright © The Author(s) 2021. In this paper, a novel parameterized generative adversarial network (GAN) is proposed where the parameters are introduced to enhance the performance of image segmentation. The developed algorithm is applied to the image-based crack detection problem on the thermal data obtained through the non-destructive testing process. A new regularization term, which contains three tunable hyperparameters, embedded into the objective function of the GAN in order to improve the contrast ratio of certain areas of the image so as to benefit the crack detection process. To automate the selection of the optimal hyperparameters of the GAN, a new particle swarm optimization (PSO) algorithm is put forward where a neighborhood-based velocity updating strategy is developed for the purpose of thoroughly exploring the problem space. The proposed PSO-based GAN algorithm is shown to 1) work well in detecting cracks on the thermal data generated by the eddy current pulsed thermography technique; and 2) outperforms other conventional GAN algorithms.This research work was funded by Institutional Fund Projects under grant no. (IFPIP-221-135-1442). Therefore, the authors gratefully acknowledge technical and fnancial support from the Ministry of Education and King Abdulaziz University, Jeddah, Saudi Arabia. This work was also supported in part by the National Natural Science Foundation of China under Grants 61873148, 61933007 and 61903065, the China Postdoctoral Science Foundation under Grant 2018M643441, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

Survey on time-delay approach to networked control

This paper provides a survey on time-delay approach to networked control systems (NCSs). The survey begins from a brief summary on fundamental network-induced issues in NCSs and the main approaches to the modelling of NCSs. In particular, a comprehensive introduction to time-delay approach to sampled-data and networked control is provided. Then, recent results on time-delay approach to event-triggered control are recalled. The survey highlights time-delay approach developed to modelling, analysis and synthesis of NCSs, under communication constraints, with a particular focus on Round-Robin, Try-once-discard and stochastic protocols. The time-delay approach allows communication delays to be larger than the sampling intervals in the presence of scheduling protocols. Moreover, some results on networked control of distributed parameter systems are surveyed. Finally, conclusions and some future research directions are briefly addressed

Interconnect technologies for very large spiking neural networks

In the scope of this thesis, a neural event communication architecture has been developed for use in an accelerated neuromorphic computing system and with a packet-based high performance interconnection network. Existing neuromorphic computing systems mostly use highly customised interconnection networks, directly routing single spike events to their destination. In contrast, the approach of this thesis uses a general purpose packet-based interconnection network and accumulates multiple spike events at the source node into larger network packets destined to common destinations. This is required to optimise the payload efficiency, given relatively large packet headers as compared to the size of neural spike events. Theoretical considerations are made about the efficiency of different event aggregation strategies. Thereby, important factors are the number of occurring event network-destinations and their relative frequency, as well as the number of available accumulation buffers. Based on the concept of Markov Chains, an analytical method is developed and used to evaluate these aggregation strategies. Additionally, some of these strategies are stochastically simulated in order to verify the analytical method and evaluate them beyond its applicability. Based on the results of this analysis, an optimisation strategy is proposed for the mapping of neural populations onto interconnected neuromorphic chips, as well as the joint assignment of event network-destinations to a set of accumulation buffers. During this thesis, such an event communication architecture has been implemented on the communication FPGAs in the BrainScaleS-2 accelerated neuromorphic computing system. Thereby, its usability can be scaled beyond single chip setups. For this, the EXTOLL network technology is used to transport and route the aggregated neural event packets with high bandwidth and low latency. At the FPGA, a network bandwidth of up to 12 Gbit/s is usable at a maximum payload efficiency of 94 %. The latency has been measured in the scope of this thesis to a range between 1.6 μs and 2.3 μs across the network between two neuron circuits on separate chips. This latency is thereby mostly dominated by the path from the neuromorphic chip across the communication FPGA into the network and back on the receiving side. As the EXTOLL network hardware itself is clocked at a much higher frequency than the FPGAs, the latency is expected to scale in the order of only approximately 75 ns for each additional hop through the network. For being able to globally interpret the arrival timestamps that are transmitted with every spike event, the system time counters on the FPGAs are synchronised across the network. For this, the global interrupt mechanism implemented in the EXTOLL hardware is characterised and used within this thesis. With this, a synchronisation accuracy of ±40ns could be measured. At the end of this thesis, the successful emulation of a neural signal propagation model, distributed across two BrainScaleS-2 chips and FPGAs is demonstrated using the implemented event communication architecture and the described synchronisation mechanism

Differentiable channel pruning guided via attention mechanism: a novel neural network pruning approach

Copyright © The Author(s) 2023. Neural network pruning offers great prospects for facilitating the deployment of deep neural networks on computational resource limited devices. Neural architecture search (NAS) provides an efficient way to automatically seek appropriate neural architecture design for compressed model. It is observed that, for existing NAS-based pruning methods, there is usually a lack of layer information when searching the optimal neural architecture. In this paper, we propose a new NAS approach, namely, differentiable channel pruning method guided via attention mechanism (DCP-A), where the adopted attention mechanism is able to provide layer information to guide the optimization of the pruning policy. The training process is differentiable with Gumbel-softmax sampling, while parameters are optimized under a two-stage training procedure. The neural network block with the shortcut is dedicatedly designed, which is of help to prune the network not only on its width but also on its depth. Extensive experiments are performed to verify the applicability and superiority of the proposed method. Detailed analysis with visualization of the pruned model architecture shows that our proposed DCP-A learns explainable pruning policies.The Deanship of Scientific Research (DSR) at King Abdulaziz University (KAU), Jeddah, Saudi Arabia has funded this project, under grant no. (RG-2-611-43). This work was supported in part by the European Union’s Horizon 2020 Research and Innovation Programme under Grant 820776 (INTEGRADDE), the Royal Society of the UK, and the Alexander von Humboldt Foundation of German