The exponential growth of streaming multi-modal data presents critical challenges for cross-modal retrieval: distribution shifts, modality gap, and scarce labels. Semi-supervised online cross-modal hashing has gained increasing interest due to its ability to encode complex streaming data and update hash functions simultaneously. Nevertheless, existing methods can hardly generate high-quality unsupervised hash codes, which fundamentally limits diversity and flexibility during the retrieval process. To this end, we propose a novel method named Prototype Evolution Online Cross-modal Hashing (PEOCH). By driving prototype evolution with semi-supervised streaming data, precise and stable hash codes are generated for both labeled and unlabeled data. Specifically, two prototype updates with stability guarantee are conducted: labeled samples push semantic knowledge into the supervised prototypes, while unlabeled samples perform clustering to generate unsupervised prototypes. Simultaneously, a co-optimization mechanism is designed to ensure the prototypes continuously evolve and preserve the consistency of the entire streaming data. Besides, an elasticity regularizer integrates discriminability and smoothness constraints, improving the reliability of prototypes. Extensive experiments on three benchmark datasets demonstrate that PEOCH outperforms state-of-the-art methods, achieving an average improvement of 6.7% in mAP@all across various retrieval tasks.

Real-time monitoring and analysis of sensitive areas in high-speed railway (HSR) are crucial for ensuring the safe and smooth operation of high-speed trains. To address the problem of frequent missing and false alarms caused by anomaly data in HSR monitoring system, this study proposes an innovative network framework: Intelligent detection network of HSR anomaly monitoring data (HSRA-Net). The framework comprises of two modules: the data augmentation module and the anomaly detection module. The data augmentation module designs multiple alternative generative adversarial networks for sample augmentation. To achieve the end-to-end classification, the anomaly detection module improves the residual network by creating a deep residual shrinkage network with self-attention (DRSN-SA). An online monitoring system was installed and operated continuously for several years on a high-speed turnout of a continuous beam bridge to validate the proposed framework. The collected data includes displacement, stress, and temperature. The proposed framework has demonstrated excellent performance, generalizability, and deployability through sufficient model comparison. It can accurately and efficiently diagnose anomalies in the operation of the monitoring system. This study is of great significance for improving the anomaly detection task of the HSR monitoring system.

MOTIVATION: Threading is one of the most effective methods for protein structure prediction. In recent years, the increasing accuracy in protein contact map prediction opens a new avenue to improve the performance of threading algorithms. Several preliminary studies suggest that with predicted contacts, the performance of threading algorithms can be improved greatly. There is still much room to explore to make better use of predicted contacts. RESULTS: We have developed a new contact-assisted threading algorithm named CATHER using both conventional sequential profiles and contact map predicted by a deep learning-based algorithm. Benchmark tests on an independent test set and the CASP12 targets demonstrated that CATHER made significant improvement over other methods which only use either sequential profile or predicted contact map. Our method was ranked at the Top 10 among all 39 participated server groups on the 32 free modeling targets in the blind tests of the CASP13 experiment. These data suggest that it is promising to push forward the threading algorithms by using predicted contacts. AVAILABILITY AND IMPLEMENTATION: http://yanglab.nankai.edu.cn/CATHER/. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.