In this article, a novel thruster information fusion fault diagnosis method for the deep-sea human occupied vehicle (HOV) is proposed. A deep belief network (DBN) is introduced into the multisensor information fusion model to identify uncertain and unknown, continuously changing fault patterns of the deep-sea HOV thruster. Inputs for the DBN information fusion fault diagnosis model are the control voltage, feedback current, and rotational speed of the deep-sea HOV thruster; and the output is the corresponding fault degree parameter (s), which indicates the pattern and degree of the thruster fault. In order to illustrate the effectiveness of the proposed fault diagnosis method, a pool experiment under different simulated fault cases is conducted in this study. The experimental results have proved that the DBN information fusion fault diagnosis method can not only diagnose the continuously changing, uncertain, and unknown thruster fault but also has higher identification accuracy than the information fusion fault diagnosis methods based on traditional artificial neural networks.We investigate a distributed time-varying formation control problem for an uncertain Euler-Lagrange system. A time-varying optimization-based approach is proposed. Based on this approach, the robots can achieve the expected formation configuration and meanwhile optimize a global objective function using only neighboring and local information. We consider the time-varying optimization where the objective functions can change in real time. In this case, the consensus-based formation tracking control issues and formation containment tracking control issues in the literature can be solved by the proposed approach. By a penalty-based method, the robots' states asymptotically converge to the estimated optimal solution to an equivalent time-varying optimization problem, whose optimal solution can achieve simultaneous formation and optimization. Furthermore, we consider two more general scenarios 1) the local objective functions can have non-neighbor's information and 2) the optimization problems can have inequality constraints.The superiority of deeply learned representations relies on large-scale labeled datasets. However, annotating data are usually expensive or even infeasible in some scenarios. To address this problem, we propose an unsupervised method to leverage instance discrimination and similarity for deep visual representation learning. The method is based on an observation that convolutional neural networks (CNNs) can learn a meaningful visual representation with instancewise classification, in which each instance is treated as an individual class. By this instancewise discriminative learning, instances can reasonably distribute in the representation space, which reveals their similarities. In order to further improve visual representations, we propose a dual-level progressive similar instance selection (DPSIS) method to build a bridge from instance to class by selecting similar instances (neighbors) for each instance (anchor) and treating the anchor and its neighbors as the same class. To be specific, DPSIS adaptively snstrate the effectiveness of our DPSIS. Our codes have been released at https//github.com/hehefan/DPSIS.Co-location pattern mining plays an important role in spatial data mining. With the rapid growth of spatial datasets, the usefulness of co-location patterns is strongly limited by the huge amount of discovered patterns. Although several methods have been proposed to reduce the number of discovered patterns, these statistical algorithms are unable to guarantee that the extracted co-location patterns are user preferred. Therefore, it is crucial to help the decision maker discover his/her preferred co-location patterns via efficient interactive procedures. This article proposes a new interactive approach that enables the user to discover his/her preferred co-location patterns. First, we present a novel and flexible interactive framework to assist the user in discovering his/her preferred co-location patterns. Second, we propose using ontologies to measure the similarity of two co-location patterns. Furthermore, we design a pruning scheme by introducing a pattern filtering model for expressing the user's preference, to reduce the number of the final output. By applying our proposed approach over voluminous sets of co-location patterns, we show that the number of filtered co-location patterns is reduced to several dozen or less and, on average, 80% of the selected co-location patterns are user preferred.The issue of bipartite time-varying formation (BTVF) tracking for linear multiagent systems (MASs) with a leader of unknown input on signed digraphs is investigated. An adaptive nonsmooth protocol is taken in this article that utilizes only the local output feedback information among neighbors and, thus, can avoid employing the eigenvalue information of the Laplacian matrix of the graph. It is proven that if the interaction network of agents containing a spanning tree is structurally balanced, the BTVF tracking can be achieved with a leader of the bounded input via the proposed scheme. This leader-following BTVF includes two time-varying subformations, whose relationship is antagonistic. A convergence analysis of the proposed protocol for MASs is reflected by the Lyapunov method. Finally, the validly numerical simulations are illustrated to show the performance of the proposed schemes.Streaming data provides substantial challenges for data analysis. From a computational standpoint, these challenges arise from constraints related to computer memory and processing speed. Statistically, the challenges relate to constructing procedures that can handle the so-called concept drift--the tendency of future data to have different underlying properties to current and historic data. The issue of handling structure, such as trend and periodicity, remains a difficult problem for streaming estimation. https://www.selleckchem.com/products/crenolanib-cp-868596.html We propose the real-time adaptive component (RAC), a penalized-regression modeling framework that satisfies the computational constraints of streaming data, and provides the capability for dealing with concept drift. At the core of the estimation process are techniques from adaptive filtering. The RAC procedure adopts a specified basis to handle local structure, along with a least absolute shrinkage operator-like penalty procedure to handle over fitting. We enhance the RAC estimation procedure with a streaming anomaly detection capability.