Levinborup8555

By using the Lyapunov stability theory, stability analysis of the proposed robust optimal integral sliding-mode control strategy is performed. Finally, the collaborative simulation platform based on the Carsim and MATLAB/Simulink is developed. The simulation results illustrate the advantage of the proposed robust optimal control strategy for the suspension system.This article analyzes the problem of the sliding-mode control (SMC) design for discrete-time piecewise nonhomogeneous Markov jump nonlinear systems (MJNSs) subject to an external disturbance with time-varying transition probabilities (TPs). A discrete-time asynchronous integral sliding surface is constructed, which yields matched-nonlinearity-free sliding-mode dynamics (SMDs). Then, by using the mode-dependent Lyapunov function technique, a sufficient condition is established for ensuring the stochastic stability of SMD with extended dissipation. The solution to designing controller gains is obtained. Moreover, an SMC law and an adaptive law are, respectively, derived for driving the system trajectories to move into a predetermined sliding-mode region with specified precision. Finally, the feasibility and effectiveness of the new design are verified and demonstrated by a simulation example.A striking discovery in the field of network science is that the majority of real networked systems have some universal structural properties. In general, they are simultaneously sparse, scale-free, small-world, and loopy. In this article, we investigate the second-order consensus of dynamic networks with such universal structures subject to white noise at vertices. We focus on the network coherence HSO characterized in terms of the H₂-norm of the vertex systems, which measures the mean deviation of vertex states from their average value. We first study numerically the coherence of some representative real-world networks. We find that their coherence HSO scales sublinearly with the vertex number N. U0126 mouse We then study analytically HSO for a class of iteratively growing networks--pseudofractal scale-free webs (PSFWs), and obtain an exact solution to HSO, which also increases sublinearly in N, with an exponent much smaller than 1. To explain the reasons for this sublinear behavior, we finally study HSO for Sierpinśki gaskets, for which HSO grows superlinearly in N, with a power exponent much larger than 1. Sierpinśki gaskets have the same number of vertices and edges as the PSFWs but do not display the scale-free and small-world properties. We thus conclude that the scale-free, small-world, and loopy topologies are jointly responsible for the observed sublinear scaling of HSO.Hyperspectral images (HSIs) are inevitably contaminated by the mixed noise (such as Gaussian noise, impulse noise, deadlines, and stripes), which could influence the subsequent processing accuracy. Generally, HSI restoration can be transformed into the low-rank matrix recovery (LRMR). In the LRMR, the nuclear norm is widely used to substitute the matrix rank, but its effectiveness is still worth improving. Besides, the l0-norm cannot capture the sparse noise's structured sparsity property. To handle these issues, the adaptive rank and structured sparsity corrections (ARSSC) are presented for HSI restoration. The ARSSC introduces two convex regularizers, that is 1) the rank correction (RC) and 2) the structured sparsity correction (SSC), to, respectively, approximate the matrix rank and the l2,0-norm. The RC and the SSC can adaptively offset the penalization of large entries from the nuclear norm and the l2,1-norm, respectively, where the larger the entry, the greater its offset. Therefore, the proposed ARSSC achieves a tighter approximation of the noise-free HSI low-rank structure and promotes the structured sparsity of sparse noise. An efficient alternative direction method of multipliers (ADMM) algorithm is applied to solve the resulting convex optimization problem. The superiority of the ARSSC in terms of the mixed noise removal and spatial-spectral structure information preserving, is demonstrated by several experimental results both on simulated and real datasets, compared with other state-of-the-art HSI restoration approaches.Multiview clustering has aroused increasing attention in recent years since real-world data are always comprised of multiple features or views. Despite the existing clustering methods having achieved promising performance, there still remain some challenges to be solved 1) most existing methods are unscalable to large-scale datasets due to the high computational burden of eigendecomposition or graph construction and 2) most methods learn latent representations and cluster structures separately. Such a two-step learning scheme neglects the correlation between the two learning stages and may obtain a suboptimal clustering result. To address these challenges, a pseudo-label guided collective matrix factorization (PLCMF) method that jointly learns latent representations and cluster structures is proposed in this article. The proposed PLCMF first performs clustering on each view separately to obtain pseudo-labels that reflect the intraview similarities of each view. Then, it adds a pseudo-label constraint on collective matrix factorization to learn unified latent representations, which preserve the intraview and interview similarities simultaneously. Finally, it intuitively incorporates latent representation learning and cluster structure learning into a joint framework to directly obtain clustering results. Besides, the weight of each view is learned adaptively according to data distribution in the joint framework. In particular, the joint learning problem can be solved with an efficient iterative updating method with linear complexity. Extensive experiments on six benchmark datasets indicate the superiority of the proposed method over state-of-the-art multiview clustering methods in both clustering accuracy and computational efficiency.Due to the complexity of myocardial infarction (MI) waveform, most traditional automatic diagnosis models rarely detect it, while those able to detect MI often require high computing and storage capacity, rendering them unsuitable for portable devices. Therefore, in order for convenient real-time MI detection, it is essential to design lightweight models suitable for resource-limited portable devices. This paper proposes a novel multi-channel lightweight model (ML-Net), that provides a new solution for portable detection devices with limited resources. In ML-Net, each electrocardiogram (ECG) lead is assigned an independent channel, ensuring data independence and preserve the ECG characteristics of different angles represented by different leads. Moreover, convolution kernels of heterogeneous sizes are utilized to achieve accurate classification with only a small amount of lead data. Extensive experiments over actual ECG data from the PTB diagnostic database are conducted to evaluate ML-Net. The results show that ML-Net outperforms comparable schemes in diagnosing MI, and it requires lower computational cost and less memory, so that portable devices can be more widely used in the field of Internet of Medical Things(IoMT).