Weinreichdehn5993

This article is concerned with the finite-time containment control problem for nonlinear multiagent systems, in which the states are not available for control design and the control input contains time delay. Fuzzy-logic systems (FLSs) are used to approximate the unknown nonlinear functions and a novel distributed fuzzy state observer is proposed to obtain the unmeasured states. Under the framework of cooperative control and finite-time Lyapunov function theory, an observer-based adaptive fuzzy finite-time output-feedback containment control scheme is developed via the adaptive backstepping control design algorithm and integral compensator technique. The proposed adaptive fuzzy containment control method can ensure that the closed-loop system is stable and all followers can converge to the convex hull built by the leaders in finite time. A simulation example is provided to confirm the effectiveness of the proposed control method.High accuracy of text classification can be achieved through simultaneous learning of multiple information, such as sequence information and word importance. In this article, a kind of flat neural networks called the broad learning system (BLS) is employed to derive two novel learning methods for text classification, including recurrent BLS (R-BLS) and long short-term memory (LSTM)-like architecture gated BLS (G-BLS). The proposed two methods possess three advantages 1) higher accuracy due to the simultaneous learning of multiple information, even compared to deep LSTM that extracts deeper but single information only; 2) significantly faster training time due to the noniterative learning in BLS, compared to LSTM; and 3) easy integration with other discriminant information for further improvement. The proposed methods have been evaluated over 13 real-world datasets from various types of text classification. From the experimental results, the proposed methods achieve higher accuracies than LSTM while taking significantly less training time on most evaluated datasets, especially when the LSTM is in deep architecture. Compared to R-BLS, G-BLS has an extra forget gate to control the flow of information (similar to LSTM) to further improve the accuracy on text classification so that G-BLS is more effective while R-BLS is more efficient.In this article, a data-driven design scheme of undetectable false data-injection attacks against cyber-physical systems is proposed first, with the aid of the subspace identification technique. Then, the impacts of undetectable false data-injection attacks are evaluated by solving a constrained optimization problem, with the constraints of undetectability and energy limitation considered. Moreover, the detection of designed data-driven false data-injection attacks is investigated via the coding theory. Finally, the simulations on the model of a flight vehicle are illustrated to verify the effectiveness of the proposed methods.Recently, deep convolutional neural networks have achieved significant success in salient object detection. However, existing state-of-the-art methods require high-end GPUs to achieve real-time performance, which makes it hard to adapt to low cost or portable devices. Although generic network architectures have been proposed to speed up inference on mobile devices, they are tailored to the task of image classification or semantic segmentation, and struggle to capture intrachannel and interchannel correlations that are essential for contrast modeling in salient object detection. Motivated by the above observations, we design a new deep-learning algorithm for fast salient object detection. The proposed algorithm for the first time achieves competitive accuracy and high inference efficiency simultaneously with a single CPU thread. Specifically, we propose a novel depthwise nonlocal module (DNL), which implicitly models contrast via harvesting intrachannel and interchannel correlations in a self-attention manner. In addition, we introduce a depthwise nonlocal network architecture that incorporates both DNLs module and inverted residual blocks. The experimental results show that our proposed network attains very competitive accuracy on a wide range of salient object detection datasets while achieving state-of-the-art efficiency among all existing deep-learning-based algorithms.Many Pareto-based multiobjective evolutionary algorithms require ranking the solutions of the population in each iteration according to the dominance principle, which can become a costly operation particularly in the case of dealing with many-objective optimization problems. In this article, we present a new efficient algorithm for computing the nondominated sorting procedure, called merge nondominated sorting (MNDS), which has a best computational complexity of O(Nłog N) and a worst computational complexity of O(MN²), with N being the population size and M being the number of objectives. Our approach is based on the computation of the dominance set, that is, for each solution, the set of solutions that dominate it, by taking advantage of the characteristics of the merge sort algorithm. We compare MNDS against six well-known techniques that can be considered as the state-of-the-art. The results indicate that the MNDS algorithm outperforms the other techniques in terms of the number of comparisons as well as the total running time.Data classification is usually challenged by the difficulty and/or high cost in collecting sufficient labeled data, and unavoidability of data missing. Besides, most of the existing algorithms belong to centralized processing, in which all of the training data must be stored and processed at a fusion center. But in many real applications, data are distributed over multiple nodes, and cannot be centralized to one node for processing due to various reasons. Considering this, in this article, we focus on the problem of distributed classification of missing data with a small proportion of labeled data samples, and develop a distributed semi-supervised missing-data classification (dS²MDC) algorithm. The proposed algorithm is a distributed joint subspace/classifier learning, that is, a latent subspace representation for missing feature imputation is learned jointly with the training of nonlinear classifiers modeled by the χ² kernel using a semi-supervised learning strategy. Theoretical performance analysis and simulations on several datasets clearly validate the effectiveness of the proposed dS²MDC algorithm from different perspectives.Discrete manufacturing systems are characterized by dynamics and uncertainty of operations and behavior due to exceptions in production-logistics synchronization. To deal with this problem, a self-adaptive collaborative control (SCC) mode is proposed for smart production-logistics systems to enhance the capability of intelligence, flexibility, and resilience. By leveraging cyber-physical systems (CPSs) and industrial Internet of Things (IIoT), real-time status data are collected and processed to perform decision making and optimization. Hybrid automata is used to model the dynamic behavior of physical manufacturing resources, such as machines and vehicles in shop floors. Three levels of collaborative control granularity, including nodal SCC, local SCC, and global SCC, are introduced to address different degrees of exceptions. selleck Collaborative optimization problems are solved using analytical target cascading (ATC). A proof of concept simulation based on a Chinese aero-engine manufacturer validates the applicability and efficiency of the proposed method, showing reductions in waiting time, makespan, and energy consumption with reasonable computational time. This article potentially enables manufacturers to implement CPS and IIoT in manufacturing environments and build up smart, flexible, and resilient production-logistics systems.Mobile gait analysis using wearable inertial measurement units (IMUs) provides valuable insights for the assessment of movement impairments in different neurological and musculoskeletal diseases, for example Parkinson's disease (PD). The increase in data volume due to arising long-term monitoring requires valid, robust and efficient analysis pipelines. In many studies an upstream detection of gait is therefore applied. However, current methods do not provide a robust way to successfully reject non-gait signals. Therefore, we developed a novel algorithm for the detection of gait from continuous inertial data of sensors worn at the feet. The algorithm is focused not only on a high sensitivity but also a high specificity for gait. Sliding windows of IMU signals recorded from the feet of PD patients were processed in the frequency domain. Gait was detected if the frequency spectrum contained specific patterns of harmonic frequencies. The approach was trained and evaluated on 150 clinical measurements containing standardized gait and cyclic movement tests. The detection reached as sensitivity of 0.98 and a specificity of 0.96 for the best sensor configuration (angular rate around the medio-lateral axis). On an independent validation data set including 203 unsupervised, semi-standardized gait tests, the algorithm achieved a sensitivity of 0.97. Our algorithm for the detection of gait from continuous IMU signals works reliably and showed promising results for the application in the context of free-living and non-standardized monitoring scenarios.Non-negative Matrix Factorization (NMF) is a dimensionality reduction approach for learning a parts-based and linear representation of non-negative data. It has attracted more attention because of that. In practice, NMF not only neglects the manifold structure of data samples, but also overlooks the priori label information of different classes. In this paper, a novel matrix decomposition method called Hyper-graph regularized Constrained Non-negative Matrix Factorization (HCNMF) is proposed for selecting differentially expressed genes and tumor sample classification. The advantage of hyper-graph learning is to capture local spatial information in high dimensional data. This method incorporates a hyper-graph regularization constraint to consider the higher order data sample relationships. The application of hyper-graph theory can effectively find pathogenic genes in cancer datasets. Besides, the label information is further incorporated in the objective function to improve the discriminative ability of the decomposition matrix. Supervised learning with label information greatly improves the classification effect. We also provide the iterative update rules and convergence proofs for the optimization problems of HCNMF. Experiments under The Cancer Genome Atlas (TCGA) datasets confirm the superiority of HCNMF algorithm compared with other representative algorithms through a set of evaluations.Stain virtualization is an application with growing interest in digital pathology allowing simulation of stained tissue images thus saving lab and tissue resources. Thanks to the success of Generative Adversarial Networks (GANs) and the progress of unsupervised learning, unsupervised style transfer GANs have been successfully used to generate realistic, clinically meaningful and interpretable images. The large size of high resolution Whole Slide Images (WSIs) presents an additional computational challenge. This makes tilewise processing necessary during training and inference of deep learning networks. Instance normalization has a substantial positive effect in style transfer GAN applications but with tilewise inference, it has the tendency to cause a tiling artifact in reconstructed WSIs. In this paper we propose a novel perceptual embedding consistency (PEC) loss forcing the network to learn color, contrast and brightness invariant features in the latent space and hence substantially reducing the aforementioned tiling artifact.