SearcharxivSearch

arXiv subjects

Duanpo Wu

Publications and source records attributed to Duanpo Wu.

5 recordsLinked to original sources

Hypergraph-based Multimodal Retrieval-Augmented Generation with Incremental Refinement

Modern Multimodal Retrieval-Augmented Generation (M-RAG) systems are fundamentally limited by the binary connectivity paradigm of traditional simple graphs, which fails to capture the intricate, high-order correlations among heterogeneous entities, such as the N-ary relationships between a visual chart, its scattered textual descriptions, and underlying numerical data. Furthermore, existing refinement strategies often rely on exhaustive, full-page reconstruction to align cross-modal information, leading to prohibitive computational redundancy and the introduction of contextual noise in long-form document processing. In this paper, we propose Hyper-M2RAG, a novel framework that redefines multimodal document retrieval through High-order Hypergraph Representation Learning. We first formalize the document structure as a Multimodal Hypergraph, utilizing hyperedges as unified semantic containers to encapsulate multi-way associations across text, images, and tables, thereby transcending point-to-point modeling. To mitigate semantic fragmentation caused by physical pagination, we introduce an Anchor-driven Incremental Refinement mechanism. Rather than performing a global sweep, our approach identifies boundary-crossing anchor nodes and reconstructs their local hyper-topology using one-hop neighborhood contexts. This targeted refinement effectively bridges cross-page knowledge gaps with minimal computational footprints. Extensive evaluations on multimodal benchmarking datasets demonstrate that Hyper-M2RAG significantly outperforms state-of-the-art methods in both retrieval precision and generation coherence. Our code is available at https://github.com/ShenAoChen2001/MMHRAG.

cs.AI

Subject-Aware Multi-Granularity Alignment for Zero-Shot EEG-to-Image Retrieval

Decoding visual content from electroencephalography (EEG) is important for understanding neural visual representations and developing non-invasive brain-computer interfaces. Existing approaches mainly improve EEG representation learning and cross-modal alignment while treating pretrained visual representations as fixed supervision targets. However, pretrained vision models organize information hierarchically, with different depths encoding complementary structural and semantic information, and the visual granularity most compatible with EEG may vary across subjects. To address this issue, we propose Subject-Aware Multi-Granularity Alignment (SAMGA), which makes visual-target construction an explicit part of EEG-visual alignment. SAMGA constructs adaptive visual supervision from multiple intermediate representations and models EEG-compatible visual granularity through a global granularity prior with subject-dependent residual calibration, enabling subject-aware training and subject-agnostic inference. Based on the resulting adaptive target, a coarse-to-fine alignment strategy first organizes global cross-modal geometry and then refines instance-level retrieval discrimination. On THINGS-EEG, SAMGA improves Top-1 retrieval accuracy over the strongest competing method by 8.7 percentage points under intra-subject evaluation and 12.0 percentage points under leave-one-subject-out evaluation. These results support a broader view of neural-visual alignment, in which performance depends not only on how neural representations are mapped, but also on what visual representations define their supervision.

cs.CV

Artificial intelligence empowered multi-AGVs in manufacturing systems

AGVs are driverless robotic vehicles that picks up and delivers materials. How to improve the efficiency while preventing deadlocks is the core issue in designing AGV systems. In this paper, we propose an approach to tackle this problem.The proposed approach includes a traditional AGV scheduling algorithm, which aims at solving deadlock problems, and an artificial neural network based component, which predict future tasks of the AGV system, and make decisions on whether to send an AGV to the predicted starting location of the upcoming task,so as to save the time of waiting for an AGV to go to there first when the upcoming task is created. Simulation results show that the proposed method significantly improves the efficiency as against traditional method, up to 20% to 30%.

cs.AI

A Scale-Free Topology Construction Model for Wireless Sensor Networks

A local-area and energy-efficient (LAEE) evolution model for wireless sensor networks is proposed. The process of topology evolution is divided into two phases. In the first phase, nodes are distributed randomly in a fixed region. In the second phase, according to the spatial structure of wireless sensor networks, topology evolution starts from the sink, grows with an energy-efficient preferential attachment rule in the new node's local-area, and stops until all nodes are connected into network. Both analysis and simulation results show that the degree distribution of LAEE follows the power law. This topology construction model has better tolerance against energy depletion or random failure than other non-scale-free WSN topologies.

cs.NI

Dynamic Behavior of Interacting between Epidemics and Cascades on Heterogeneous Networks

Epidemic spreading and cascading failure are two important dynamical processes over complex networks. They have been investigated separately for a long history. But in the real world, these two dynamics sometimes may interact with each other. In this paper, we explore a model combined with SIR epidemic spreading model and local loads sharing cascading failure model. There exists a critical value of tolerance parameter that whether the epidemic with high infection probability can spread out and infect a fraction of the network in this model. When the tolerance parameter is smaller than the critical value, cascading failure cuts off abundant of paths and blocks the spreading of epidemic locally. While the tolerance parameter is larger than the critical value, epidemic spreads out and infects a fraction of the network. A method for estimating the critical value is proposed. In simulation, we verify the effectiveness of this method in Barabási-Albert (BA) networks.

physics.soc-ph