12/07/2024


Remaining useful life (RUL) prediction is a reliable tool for the health management of components. The main concern of RUL prediction is how to accurately predict the RUL under uncertainties. In order to enhance the prediction accuracy under uncertain conditions, the relevance vector machine (RVM) is extended into the probability manifold to compensate for the weakness caused by evidence approximation of the RVM. First, tendency features are selected based on the batch samples. Then, a dynamic multistep regression model is built for well describing the influence of uncertainties. Furthermore, the degradation tendency is estimated to monitor degradation status continuously. As poorly estimated hyperparameters of RVM may result in low prediction accuracy, the established RVM model is extended to the probabilistic manifold for estimating the degradation tendency exactly. The RUL is then prognosticated by the first hitting time (FHT) method based on the estimated degradation tendency. The proposed schemes are illustrated by a case study, which investigated the capacitors' performance degradation in traction systems of high-speed trains.As to unsupervised learning, most discriminative information is encoded in the cluster labels. To obtain the pseudo labels, unsupervised feature selection methods usually utilize spectral clustering to generate them. Nonetheless, two related disadvantages exist accordingly 1) the performance of feature selection highly depends on the constructed Laplacian matrix and 2) the pseudo labels are obtained with mixed signs, while the real ones should be nonnegative. To address this problem, a novel approach for unsupervised feature selection is proposed by extending orthogonal least square discriminant analysis (OLSDA) to the unsupervised case, such that nonnegative pseudo labels can be achieved. Additionally, an orthogonal constraint is imposed on the class indicator to hold the manifold structure. Furthermore, ℓ2,1 regularization is imposed to ensure that the projection matrix is row sparse for efficient feature selection and proved to be equivalent to ℓ2,0 regularization. Finally, extensive experiments on nine benchmark data sets are conducted to demonstrate the effectiveness of the proposed approach.In graph neural networks (GNNs), pooling operators compute local summaries of input graphs to capture their global properties, and they are fundamental for building deep GNNs that learn hierarchical representations. In this work, we propose the Node Decimation Pooling (NDP), a pooling operator for GNNs that generates coarser graphs while preserving the overall graph topology. During training, the GNN learns new node representations and fits them to a pyramid of coarsened graphs, which is computed offline in a preprocessing stage. NDP consists of three steps. First, a node decimation procedure selects the nodes belonging to one side of the partition identified by a spectral algorithm that approximates the MAXCUT solution. Afterward, the selected nodes are connected with Kron reduction to form the coarsened graph. Finally, since the resulting graph is very dense, we apply a sparsification procedure that prunes the adjacency matrix of the coarsened graph to reduce the computational cost in the GNN. Notably, we show that it is possible to remove many edges without significantly altering the graph structure. Experimental results show that NDP is more efficient compared to state-of-the-art graph pooling operators while reaching, at the same time, competitive performance on a significant variety of graph classification tasks.A large number of studies have shown that astrocytes can be combined with the presynaptic terminals and postsynaptic spines of neurons to constitute a triple synapse via an endocannabinoid retrograde messenger to achieve a self-repair ability in the human brain. Inspired by the biological self-repair mechanism of astrocytes, this work proposes a self-repairing neuron network circuit that utilizes a memristor to simulate changes in neurotransmitters when a set threshold is reached. The proposed circuit simulates an astrocyte-neuron network and comprises the following 1) a single-astrocyte-neuron circuit module; 2) an astrocyte-neuron network circuit; 3) a module to detect malfunctions; and 4) a neuron PR (release probability of synaptic transmission) enhancement module. When faults occur in a synapse, the neuron module becomes silent or near silent because of the low PR of the synapses. The circuit can detect faults automatically. The damaged neuron can be repaired by enhancing the PR of other healthy neurons, analogous to the biological repair mechanism of astrocytes. This mechanism helps to repair the damaged circuit. A simulation of the circuit revealed the following 1) as the number of neurons in the circuit increases, the self-repair ability strengthens and 2) as the number of damaged neurons in the astrocyte-neuron network increases, the self-repair ability weakens, and there is a significant degradation in the performance of the circuit. The self-repairing circuit was used for a robot, and it effectively improved the robots' performance and reliability.Although miRNAs can cause widespread changes in expression programs, single miRNAs typically induce mild repression on their targets. Cooperativity among miRNAs is reported as one strategy to overcome this constraint. Expanding the catalog of synergistic miRNAs is critical for understanding gene regulation and for developing miRNA-based therapeutics. In this study, we develop miRCoop to identify synergistic miRNA pairs that have weak or no repression on the target mRNA individually, but when act together induce strong repression. miRCoop uses kernel-based statistical interaction tests, together with miRNA and mRNA target information. We apply our approach to patient data of two different cancer types. In kidney cancer, we identify 66 putative triplets. For 64 of these triplets, there is at least one common transcription factor that potentially regulates all participating RNAs of the triplet, supporting a functional association among them. https://www.selleckchem.com/products/cd38-inhibitor-1.html Furthermore, we find that identified triplets are enriched for certain biological processes that are relevant to kidney cancer.