Graph anomaly detection is emerging as a critical technology for addressing increasingly complex and dynamic risk environments. Although unsupervised graph anomaly detection has advanced under the graph representation learning, directly applying these paradigms remains fundamentally misaligned with anomaly detection objectives. In this work, we highlight two key insights: graph neural networks are often suboptimal as feature extractors due to neighborhood aggregation diluting anomaly signals, and reliance on local inconsistency mining is inadequate for comprehensive anomaly detection, as it often fails to identify anomalies hidden within camouflaged communities. Based on these insights, we propose multiscale inconsistency learning for graph anomaly detection (MI-GAD), a novel framework that integrates both local and global anomaly signals. Specifically, individual node representations are projected onto a common hypersphere to ensure uniformity. At the local scale, the graph structure is leveraged for affinity-aware modeling via group discrimination. At the global scale, we introduce node deviation, a metric that distinguishes anomalies by optimizing representation centers. This unified approach enables robust and comprehensive detection of diverse graph anomalies. Experiments on seven real datasets demonstrate that our method consistently outperforms state-of-the-art baselines in both effectiveness and scalability.

This paper explores advancements in automated Question-Answer (QA) extraction using large language models (LLMs), addressing challenges in transforming unstructured text into high-quality, retrievable QA pairs. Traditional approaches, whether through segmented question and answer generation or end-to-end extraction, often struggle with efficiency, dataset limitations, and performance consistency. Leveraging recent progress in LLMs, we constructed a large-scale Chinese QA extraction dataset with 143,846 documents and evaluated multiple fine-tuned models on public and private datasets. Surprisingly, code-based English LLMs outperformed Chinese-specialized models on Chinese text with a lower hallucination rate. Building upon this finding, we enhanced the best-performing code-based model with an expanded Chinese vocabulary, creating Code Llama-M, which achieved better results. Integrating Code Llama-M into our internal assistant, Luo Ying, demonstrated notable user satisfaction gains, affirming its practical impact. Key contributions include: (i) creation of a robust Chinese QA extraction instruction dataset; (ii) evidence of cross-lingual efficacy of code-based LLMs for Chinese QA tasks, further enhanced through Code Llama-M's expanded Chinese vocabulary; and (iii) successful application of the fine-tuned LLM in a live assistant system, enhancing user experience.

The Metric Nearness Problem involves restoring a non-metric matrix to its closest metric-compliant form, addressing issues such as noise, missing values, and data inconsistencies. Ensuring metric properties, particularly the $O(N^3)$ triangle inequality constraints, presents significant computational challenges, especially in large-scale scenarios where traditional methods suffer from high time and space complexity. We propose a novel solution based on the tropical inner product (max-plus operation), which we prove satisfies the triangle inequality for non-negative real matrices. By transforming the problem into a continuous optimization task, our method directly minimizes the distance to the target matrix. This approach not only restores metric properties but also generates metric-preserving embeddings, enabling real-time updates and reducing computational and storage overhead for downstream tasks. Experimental results demonstrate that our method achieves up to 60$\times$ speed improvements over state-of-the-art approaches, and efficiently scales from $1e4 \times 1e4$ to $1e5 \times 1e5$ matrices with significantly lower memory usage.

Integrating multi-omics datasets through data-driven analysis offers a comprehensive understanding of the complex biological processes underlying various diseases, particularly cancer. Graph Neural Networks (GNNs) have recently demonstrated remarkable ability to exploit relational structures in biological data, enabling advances in multi-omics integration for cancer subtype classification. Existing approaches often neglect the intricate coupling between heterogeneous omics, limiting their capacity to resolve subtle cancer subtype heterogeneity critical for precision oncology. To address these limitations, we propose a framework named Graph Transformer for Multi-omics Cancer Subtype Classification (GTMancer). This framework builds upon the GNN optimization problem and extends its application to complex multi-omics data. Specifically, our method leverages contrastive learning to embed multi-omics data into a unified semantic space. We unroll the multiplex graph optimization problem in that unified space and introduce dual sets of attention coefficients to capture structural graph priors both within and among multi-omics data. This approach enables global omics information to guide the refining of the representations of individual omics. Empirical experiments on seven real-world cancer datasets demonstrate that GTMancer outperforms existing state-of-the-art algorithms.

Graph learning has shown significant advantages in organizing and leveraging complex data, making it promising for numerous real-world applications with heterogeneous information, particularly multi-omics data analysis. Despite its potential in such scenarios, existing methods are still in their infancy, lacking architectural potential and struggling to handle such complex data. In this paper, we propose the Multiplex Mixture of Graph Learners (MMoG) framework. MMoG first conducts fine-grained processing of consensus and unique information, constructing consistent features and multiplex graph structures. Then, a macroscopically shared group of sub-GNNs with diverse orders and architectures synergistically learn representations, providing a foundation for strong interaction between different views. Inspired by the mixture of experts (MoE), each sample in different omics adaptively determines the neighborhood ranges and architectures for information aggregation, while blocking unsuitable sub-GNNs. MMoG treats the complex multi-omics analysis as a multi-view learning problem, and essentially decomposes it into multiple sub-problems, allowing each omics/view to solve intersecting yet unique sub-problem groups. Additionally, we introduce mutual information-driven orthogonal loss and balancing loss to avoid view collapse. Extensive experiments on multi-omics data across multiple cancer types highlight MMoG's superiority.

Graph Neural Networks (GNNs) have become powerful models for both node- and graph-level tasks. While node-level learning focuses on individual nodes and their local structures, graph-level learning encounters challenges in capturing the global properties of graphs. In this paper, we conduct a theoretical and experimental analysis of existing graph-level learning frameworks and find that these frameworks typically adopt a single-view perspective based solely on node degree, which limits their ability to capture comprehensive graph characteristics. To address these issues, we propose a multi-view approach that leverages different types of centrality measures to capture diverse aspects of graph structure. We design an attention-based mechanism to adaptively integrate these multiple views, and use it as a readout function to perform weighted summation of node embeddings, termed as Adaptive Centrality Readout (ACRead). ACRead demonstrates enhanced flexibility and effectiveness when integrated with various GNN architectures, outperforming state-of-the-art readout methods, including KerRead and Set Transformer. Additionally, this multi-view centrality approach can serve as a standalone graph-level learning framework without relying on GNNs, referred to as Adaptive Centrality-based Graph Learning (ACGL), which achieves competitive performance by effectively combining different centrality perspectives.

In recent years, graph-based multi-view learning has received widespread attention for its ability to utilize data dependencies to capture more comprehensive information from ubiquitous multi-view data. However, with the increase in data size and complexity, Euclidean space struggles to capture the hierarchical and exponentially expanding relationships of multi-view data in limited dimensions, leading to embedding distortion and insufficient cross-view alignment and interaction. To this end, we propose a hyperbolic multi-view heat diffusion method. Firstly, we utilize the negative curvature advantage of the hyperbolic space to construct a graph representation for each view separately, so that each view can still retain its hierarchical structure in relatively low dimensions. Then we construct a graph heat diffusion process on hyperbolic manifolds to ensure that each view is locally smoothed and globally aggregated while achieving semantic consistency through virtual views. We show that the method can be interpreted as a Riemannian gradient descent process for collaborative learning on hyperbolic manifolds, which not only effectively fuses multimodal information, but also significantly enhances the interaction and unified representation among different views. Experimental results show that the proposed framework achieves excellent performance in a variety of multi-view scenarios.

With the continuous development of the wind power industry, variable-speed wind turbines (VSWT) are moving towards large-scale, and their applications have been expanded to offshore areas. However, the operating environment of offshore wind farm is even more harsh, and the potential torsional vibration of the drivetrain caused by disturbances in the offshore wind farm may introduce fatigue damage to the VSWT, resulting in unexpected faults that may lead to prolonged shutdown of the VSWT and loss of power generation efficiency. This study proposes a torsional vibration suppression strategy based on unknown input observer and sliding mode control. The proposed suppression strategy provides an appropriate electromagnetic torque compensation for the generator to mitigate disturbances in the whole control system. The effectiveness of the proposed strategy is validated by extensive simulation studies.

In the relevant literature, fuzzy relational inequalities with addition-min composition have been proposed to model the data transmission mechanism in a BitTorrent-like peer-to-peer file-sharing system. In this paper, we present a two-phase approach to find an optimal solution to data transmission that minimizes an associated function while its components are controlled to result in reduced network congestion. Numerical examples are given to illustrate the procedures of the two-phase approach.

In Cognitive Radio Networks (CRNs), a fundamental operation for the secondary users (SUs) is to establish communication through choosing a common available channel at the same time slot, which is referred to as rendezvous. In this paper, we study fast rendezvous for two SUs.