10 April 2018 in IEEE Transactions on Cybernetics
This paper addresses the finite-time H∞ filtering for a class of nonlinear singular nonhomogeneous Markov jump systems by T-S fuzzy approximation approach, where the transition probabilities (TPs) are time-varying and unknown. First, by considering a stochastic Lyapunov functional and rendering the time-varying TPs inside a polytope, a sufficient condition on singular stochastic H∞ finite-time boundedness (SSH∞FTB) for the filtering error systems is given. Then, by using the matrix inequality decoupling technique, a novel linear matrix inequality (LMI) condition on the existence of the finite-time H∞ fuzzy filter is presented. The fuzzy filter is developed in terms of LMIs ensuring the filtering error system is SSH∞FTB. Compared with the previous ones, the proposed design method in this paper has more freedom, leading to less conservative results. A tunnel diode circuit is provided to illustrate the effectiveness and advantage of the design approach proposed in this paper.
1 June 2019 in Fuzzy Sets and Systems
9 January 2024 in IEEE Transactions on Automatic Control
This paper investigates the differentially private bipartite consensus problem over signed networks. To solve this problem, a new algorithm is proposed by adding noises with time-varying variances to the cooperative-competitive interactive information. In order to achieve the privacy protection, the variances of the added noises are allowed to increase, which are substantially different from the existing works. In addition, the variances of the added noises can be either decaying or constant. By using a time-varying step-size based on the stochastic approximation method, we show that the algorithm converges in mean-square and almost-surely even with increasing privacy noises. We further develop a method to design the step-size and the noise parameter, affording the algorithm to achieve the average bipartite consensus with the desired accuracy and the predefined differential privacy level. Moreover, we give the mean-square and almost-sure convergence rates of the algorithm, and the privacy level with different forms of the privacy noises. We also reveal the trade-off between the accuracy and the privacy, and extend the results to local differential privacy. Finally, a numerical example verifies the theoretical results and demonstrates the algorithm's superiority against existing methods.
1 January 2019 in Signal Processing
1 July 2005 in Communications in Theoretical Physics
By using a new reaction model for light nuclei, the double-differential cross section of n + 14N reactions at En = 14.2 MeV has been analyzed. In the case of n+14N reactions, the reaction mechanism is very complex, there are over one hundred opened partial reaction channels even at incident energy En = 14.2 MeV. In this paper the opened reaction channels are listed in detail. With LUNF code the model calculation is performed to analyze the double-differential cross sections of total outgoing neutron. The calculated results agree fairly with the experimental data. The results indicate that the pre-equilibrium mechanism dominates the whole reaction processes, and the recoil effect in light nuclear reactions is essentially important. 5He emission has been considered, but it is only a small contribution to the double-differential cross section at incident energy En = 14.2 MeV.
20 March 2024 in IEEE Transactions on Automatic Control
Differentially private distributed stochastic optimization has become a hot topic due to the need of privacy protection in distributed stochastic optimization. In this paper, two-time scale stochastic approximation-type algorithms for differentially private distributed stochastic optimization with time-varying sample sizes are proposed using gradient- and output-perturbation methods. For both gradient- and output-perturbation cases, the convergence of the algorithm and differential privacy with a finite cumulative privacy budget $\varepsilon$ for an infinite number of iterations are simultaneously established, which is substantially different from the existing works. By a time-varying sample sizes method, the privacy level is enhanced, and differential privacy with a finite cumulative privacy budget $\varepsilon$ for an infinite number of iterations is established. By properly choosing a Lyapunov function, the algorithm achieves almost sure and mean square convergence even when the added privacy noise has an increasing variance. Furthermore, we rigorously provide the mean square convergence rates of the algorithm and show how the added privacy noise affects the convergence rate of the algorithm. Finally, numerical examples including distributed training on a benchmark machine learning dataset are presented to demonstrate the efficiency and advantages of the algorithms.