Impact of different interaction behavior on epidemic spreading in time-dependent social networks

We investigate the impact of pairwise and group interactions on the spread of epidemics through an activity-driven model based on time-dependent networks.The effects of pairwise/group interaction proportion and pairwise/group interaction intensity are explored by extensive simulation and theoretical analysis.It is demonstrated that altering the group interaction proportion can either hinder or enhance the spread of epidemics,depending on the relative social intensity of group and pairwise interactions.As the group interaction proportion decreases,the impact of reducing group social intensity diminishes.The ratio of group and pairwise social intensity can affect the effect of group interaction proportion on the scale of infection.A weak heterogeneous activity distribution can raise the epidemic threshold,and reduce the scale of infection.These results benefit the design of epidemic control strategy.

Exploring reservoir computing:Implementation via double stochastic nanowire networks

Neuromorphic computing,inspired by the human brain,uses memristor devices for complex tasks.Recent studies show that self-organizing random nanowires can implement neuromorphic information processing,enabling data analysis.This paper presents a model based on these nanowire networks,with an improved conductance variation profile.We suggest using these networks for temporal information processing via a reservoir computing scheme and propose an efficient data encoding method using voltage pulses.The nanowire network layer generates dynamic behaviors for pulse voltages,allowing time series prediction analysis.Our experiment uses a double stochastic nanowire network architecture for processing multiple input signals,outperforming traditional reservoir computing in terms of fewer nodes,enriched dynamics and improved prediction accuracy.Experimental results confirm the high accuracy of this architecture on multiple real-time series datasets,making neuromorphic nanowire networks promising for physical implementation of reservoir computing.

Modeling and Performance Analysis of UAV-Aided Millimeter Wave Cellular Networks with Stochastic Geometry

UAV-aided cellular networks,millimeter wave(mm-wave) communications and multi-antenna techniques are viewed as promising components of the solution for beyond-5G(B5G) and even 6G communications.By leveraging the power of stochastic geometry,this paper aims at providing an effective framework for modeling and analyzing a UAV-aided heterogeneous cellular network,where the terrestrial base stations(TBSs) and the UAV base stations(UBSs) coexist,and the UBSs are provided with mm-wave and multi-antenna techniques.By modeling the TBSs as a PPP and the UBSs as a Matern hard-core point process of type Ⅱ(MPH-Ⅱ),approximated but accurate analytical results for the average rate of the typical user of both tiers are derived through an approximation method based on the mean interference-to-signal ratio(MISR) gain.The influence of some relevant parameters is discussed in detail,and some insights into the network deployment and optimization are revealed.Numerical results show that some trade-offs are worthy of being considered,such as the antenna array size,the altitude of the UAVs and the power control factor of the UBSs.

Outage Probability Analysis for D2D-Enabled Heterogeneous Cellular Networks with Exclusion Zone:A Stochastic Geometry Approach

Interference management is one of the most important issues in the device-to-device(D2D)-enabled heterogeneous cellular networks(HetCNets)due to the coexistence of massive cellular and D2D devices in which D2D devices reuse the cellular spectrum.To alleviate the interference,an efficient interference management way is to set exclusion zones around the cellular receivers.In this paper,we adopt a stochastic geometry approach to analyze the outage probabilities of cellular and D2D users in the D2D-enabled HetCNets.The main difficulties contain three aspects:1)how to model the location randomness of base stations,cellular and D2D users in practical networks;2)how to capture the randomness and interrelation of cellular and D2D transmissions due to the existence of random exclusion zones;3)how to characterize the different types of interference and their impacts on the outage probabilities of cellular and D2D users.We then run extensive Monte-Carlo simulations which manifest that our theoretical model is very accurate.

Decentralized Semi-Supervised Learning for Stochastic Configuration Networks Based on the Mean Teacher Method

The aim of this paper is to broaden the application of Stochastic Configuration Network (SCN) in the semi-supervised domain by utilizing common unlabeled data in daily life. It can enhance the classification accuracy of decentralized SCN algorithms while effectively protecting user privacy. To this end, we propose a decentralized semi-supervised learning algorithm for SCN, called DMT-SCN, which introduces teacher and student models by combining the idea of consistency regularization to improve the response speed of model iterations. In order to reduce the possible negative impact of unsupervised data on the model, we purposely change the way of adding noise to the unlabeled data. Simulation results show that the algorithm can effectively utilize unlabeled data to improve the classification accuracy of SCN training and is robust under different ground simulation environments.

Analytical and NumericalMethods to Study the MFPT and SR of a Stochastic Tumor-Immune Model

The Mean First-Passage Time (MFPT) and Stochastic Resonance (SR) of a stochastic tumor-immune model withnoise perturbation are discussed in this paper. Firstly, considering environmental perturbation, Gaussian whitenoise and Gaussian colored noise are introduced into a tumor growth model under immune surveillance. Asfollows, the long-time evolution of the tumor characterized by the Stationary Probability Density (SPD) and MFPTis obtained in theory on the basis of the Approximated Fokker-Planck Equation (AFPE). Herein the recurrenceof the tumor from the extinction state to the tumor-present state is more concerned in this paper. A moreefficient algorithmof Back-Propagation Neural Network (BPNN) is utilized in order to testify the correction of thetheoretical SPDandMFPT.With the existence of aweak signal, the functional relationship between Signal-to-NoiseRatio (SNR), noise intensities and correlation time is also studied. Numerical results show that both multiplicativeGaussian colored noise and additive Gaussian white noise can promote the extinction of the tumors, and themultiplicative Gaussian colored noise can lead to the resonance-like peak on MFPT curves, while the increasingintensity of the additiveGaussian white noise results in theminimum of MFPT. In addition, the correlation timesare negatively correlated with MFPT. As for the SNR, we find the intensities of both the Gaussian white noise andthe Gaussian colored noise, as well as their correlation intensity can induce SR. Especially, SNR is monotonouslyincreased in the case ofGaussian white noisewith the change of the correlation time.At last, the optimal parametersin BPNN structure are analyzed for MFPT from three aspects: the penalty factors, the number of neural networklayers and the number of nodes in each layer.

Multi-source coordinated stochastic restoration for SOP in distribution networks with a two-stage algorithm

After suffering from a grid blackout, distributed energy resources(DERs), such as local renewable energy and controllable distributed generators and energy storage can be used to restore loads enhancing the system’s resilience. In this study, a multi-source coordinated load restoration strategy was investigated for a distribution network with soft open points(SOPs). Here, the flexible regulation ability of the SOPs is fully utilized to improve the load restoration level while mitigating voltage deviations. Owing to the uncertainty, a scenario-based stochastic optimization approach was employed,and the load restoration problem was formulated as a mixed-integer nonlinear programming model. A computationally efficient solution algorithm was developed for the model using convex relaxation and linearization methods. The algorithm is organized into a two-stage structure, in which the energy storage system is dispatched in the first stage by solving a relaxed convex problem. In the second stage, an integer programming problem is calculated to acquire the outputs of both SOPs and power resources. A numerical test was conducted on both IEEE 33-bus and IEEE 123-bus systems to validate the effectiveness of the proposed strategy.

Synchronization of stochastic complex networks with time-delayed coupling

Noise and time delay are inevitable in real-world networks. In this article, the framework of master stability function is generalized to stochastic complex networks with time-delayed coupling. The focus is on the effects of noise, time delay,and their inner interactions on the network synchronization. It is found that when there exists time-delayed coupling in the network and noise diffuses through all state variables of nodes, appropriately increasing the noise intensity can effectively improve the network synchronizability;otherwise, noise can be either beneficial or harmful. For stochastic networks, large time delays will lead to desynchronization. These findings provide valuable references for designing optimal complex networks in practical applications.

Inverse stochastic resonance in modular neural network with synaptic plasticity

This work explores the inverse stochastic resonance(ISR) induced by bounded noise and the multiple inverse stochastic resonance induced by time delay by constructing a modular neural network, where the modified Oja’s synaptic learning rule is employed to characterize synaptic plasticity in this network. Meanwhile, the effects of synaptic plasticity on the ISR dynamics are investigated. Through numerical simulations, it is found that the mean firing rate curve under the influence of bounded noise has an inverted bell-like shape, which implies the appearance of ISR. Moreover, synaptic plasticity with smaller learning rate strengthens this ISR phenomenon, while synaptic plasticity with larger learning rate weakens or even destroys it. On the other hand, the mean firing rate curve under the influence of time delay is found to exhibit a decaying oscillatory process, which represents the emergence of multiple ISR. However, the multiple ISR phenomenon gradually weakens until it disappears with increasing noise amplitude. On the same time, synaptic plasticity with smaller learning rate also weakens this multiple ISR phenomenon, while synaptic plasticity with larger learning rate strengthens it. Furthermore, we find that changes of synaptic learning rate can induce the emergence of ISR phenomenon. We hope these obtained results would provide new insights into the study of ISR in neuroscience.

Adaptive Stochastic Synchronization of Uncertain Delayed Neural Networks

This paper considers adaptive synchronization of uncertain neural networks with time delays and stochastic perturbation. A general adaptive controller is designed to deal with the difficulties deduced by uncertain parameters and stochastic perturbations, in which the controller is less conservative and optimal since its control gains can be automatically adjusted according to some designed update laws. Based on Lyapunov stability theory and Barbalat lemma, sufficient condition is obtained for synchronization of delayed neural networks by strict mathematical proof. Moreover, the obtained results of this paper are more general than most existing results of certainly neural networks with or without stochastic disturbances. Finally, numerical simulations are presented to substantiate our theoretical results.

Deep Neural Network Architecture Search via Decomposition-Based Multi-Objective Stochastic Fractal Search

Deep neural networks often outperform classical machine learning algorithms in solving real-world problems.However,designing better networks usually requires domain expertise and consumes significant time and com-puting resources.Moreover,when the task changes,the original network architecture becomes outdated and requires redesigning.Thus,Neural Architecture Search(NAS)has gained attention as an effective approach to automatically generate optimal network architectures.Most NAS methods mainly focus on achieving high performance while ignoring architectural complexity.A myriad of research has revealed that network performance and structural complexity are often positively correlated.Nevertheless,complex network structures will bring enormous computing resources.To cope with this,we formulate the neural architecture search task as a multi-objective optimization problem,where an optimal architecture is learned by minimizing the classification error rate and the number of network parameters simultaneously.And then a decomposition-based multi-objective stochastic fractal search method is proposed to solve it.In view of the discrete property of the NAS problem,we discretize the stochastic fractal search step size so that the network architecture can be optimized more effectively.Additionally,two distinct update methods are employed in step size update stage to enhance the global and local search abilities adaptively.Furthermore,an information exchange mechanism between architectures is raised to accelerate the convergence process and improve the efficiency of the algorithm.Experimental studies show that the proposed algorithm has competitive performance comparable to many existing manual and automatic deep neural network generation approaches,which achieved a parameter-less and high-precision architecture with low-cost on each of the six benchmark datasets.

TWO-DIMENSIONAL STOCHASTIC AIRFOIL OPTIMIZATION DESIGN METHOD BASED ON NEURAL NETWORKS

To avoid the aerodynamic performance loss of airfoil at non-design state which often appears in single point design optimization, and to improve the adaptability to the uncertain factors in actual flight environment, a two-dimensional stochastic airfoil optimization design method based on neural networks is presented. To provide highly efficient and credible analysis, four BP neural networks are built as surrogate models to predict the airfoil aerodynamic coefficients and geometry parameter. These networks are combined with the probability density function obeying normal distribution and the genetic algorithm, thus forming an optimization design method. Using the method, for GA（W）-2 airfoil, a stochastic optimization is implemented in a two-dimensional flight area about Mach number and angle of attack. Compared with original airfoil and single point optimization design airfoil, results show that the two-dimensional stochastic method can improve the performance in a specific flight area, and increase the airfoil adaptability to the stochastic changes of multiple flight parameters.

Performance Evaluation for SDN Deployment: an Approach Based on Stochastic Network Calculus

The Open Flow implementations(SDNs) have been deployed increasingly on varieties of networks in research institutions as well as commercial institutions. To develop an Open Flow implementation, it is required to understand the performance of the network. A few benchmark tools(e.g., Cbench and OFlops) can be used to measure the network performance, while these tools take considerable time to simulate traffic behaviors and generate the required results,therefore extending the development time. In this paper, we present an analytical model, which is based on stochastic network calculus theory, for evaluating the performance of switch to controller.The previous studies show that stochastic network calculus can provide realistic emulation of real network traffic behaviors. Our model is evaluated by using both simulation tool and realistic testbed.The results show the stochastic network calculus based analysis model can realistically measure the network performance of the end-to-end properties between controller and switch.

Delay-aided stochastic multiresonances on scale-free FitzHugh-Nagumo neuronal networks

The stochastic resonance in paced time-delayed scale-free FitzHugh--Nagumo （FHN） neuronal networks is investigated. We show that an intermediate intensity of additive noise is able to optimally assist the pacemaker in imposing its rhythm on the whole ensemble. Furthermore, we reveal that appropriately tuned delays can induce stochastic multiresonances, appearing at every integer multiple of the pacemaker＇s oscillation period. We conclude that fine-tuned delay lengths and locally acting pacemakers are vital for ensuring optimal conditions for stochastic resonance on complex neuronal networks.

Passivity analysis for uncertain stochastic neural networks with discrete interval and distributed time-varying delays

The problem of passivity analysis is investigated for uncertain stochastic neural networks with discrete interval and distributed time-varying delays.The parameter uncertainties are assumed to be norm bounded and the delay is assumed to be time-varying and belongs to a given interval,which means that the lower and upper bounds of interval time-varying delays are available.By constructing proper Lyapunov-Krasovskii functional and employing a combination of the free-weighting matrix method and stochastic analysis technique,new delay-dependent passivity conditions are derived in terms of linear matrix inequalities（LMIs）.Finally,numerical examples are given to show the less conservatism of the proposed conditions.

Stochastic synchronization for time-varying complex dynamical networks

This paper studies the stochastic synchronization problem for time-varying complex dynamical networks. This model is totally different from some existing network models. Based on the Lyapunov stability theory, inequality techniques, and the properties of the Weiner process, some controllers and adaptive laws are designed to ensure achieving stochastic synchronization of a complex dynamical network model. A sufficient synchronization condition is given to ensure that the proposed network model is mean-square stable. Theoretical analysis and numerical simulation fully verify the main results.

Robust control for a class of nonlinear networked systems with stochastic communication delays via sliding mode conception

This paper deals with the robust control problem for a class of uncertain nonlinear networked systems with stochastic communication delays via sliding mode conception （SMC）. A sequence of variables obeying Bernoulli distribution are employed to model the randomly occurring communication delays which could be different for different state variables. A discrete switching function that is different from those in the existing literature is first proposed. Then, expressed as the feasibility of a linear matrix inequality （LMI） with an equality constraint, sufficient conditions are derived in order to ensure the globally mean-square asymptotic stability of the system dynamics on the sliding surface. A discrete-time SMC controller is then synthesized to guarantee the discrete-time sliding mode reaching condition with the specified sliding surface. Finally, a simulation example is given to show the effectiveness of the proposed method.

Neural-Network-Based Control for Discrete-Time Nonlinear Systems with Input Saturation Under Stochastic Communication Protocol

In this paper,an adaptive dynamic programming(ADP)strategy is investigated for discrete-time nonlinear systems with unknown nonlinear dynamics subject to input saturation.To save the communication resources between the controller and the actuators,stochastic communication protocols(SCPs)are adopted to schedule the control signal,and therefore the closed-loop system is essentially a protocol-induced switching system.A neural network(NN)-based identifier with a robust term is exploited for approximating the unknown nonlinear system,and a set of switch-based updating rules with an additional tunable parameter of NN weights are developed with the help of the gradient descent.By virtue of a novel Lyapunov function,a sufficient condition is proposed to achieve the stability of both system identification errors and the update dynamics of NN weights.Then,a value iterative ADP algorithm in an offline way is proposed to solve the optimal control of protocol-induced switching systems with saturation constraints,and the convergence is profoundly discussed in light of mathematical induction.Furthermore,an actor-critic NN scheme is developed to approximate the control law and the proposed performance index function in the framework of ADP,and the stability of the closed-loop system is analyzed in view of the Lyapunov theory.Finally,the numerical simulation results are presented to demonstrate the effectiveness of the proposed control scheme.

Data driven particle size estimation of hematite grinding process using stochastic configuration network with robust technique

As a production quality index of hematite grinding process,particle size(PS)is hard to be measured in real time.To achieve the PS estimation,this paper proposes a novel data driven model of PS using stochastic configuration network(SCN)with robust technique,namely,robust SCN(RSCN).Firstly,this paper proves the universal approximation property of RSCN with weighted least squares technique.Secondly,three robust algorithms are presented by employing M-estimation with Huber loss function,M-estimation with interquartile range(IQR)and nonparametric kernel density estimation(NKDE)function respectively to set the penalty weight.Comparison experiments are first carried out based on the UCI standard data sets to verify the effectiveness of these methods,and then the data-driven PS model based on the robust algorithms are established and verified.Experimental results show that the RSCN has an excellent performance for the PS estimation.

End-to-End Latency Evaluation of the Sat5G Network Based on Stochastic Network Calculus

Simultaneous use of heterogeneous radio access technologies to increase the performance of real-time,reliability and capacity is an inherent feature of satellite-5G integrated network(Sat5G).However,there is still a lack of theoretical characterization of whether the network can satisfy the end-to-end transmission performance for latency-sensitive service.To this end,we build a tandem model considering the connection relationship between the various components in Sat5G network architecture,and give an end-to-end latency calculation function based on this model.By introducing stochastic network calculus,we derive the relationship between the end-to-end latency bound and the violation probability considering the traffic characteristics of multimedia.Numerical results demonstrate the impact of different burst states and different service rates on this relationship,which means the higher the burst of arrival traffic and the higher the average rate of arrival traffic,the greater the probability of end-to-end latency violation.The results will provide valuable guidelines for the traffic control and cache management in Sat5G network.