Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ruijia Li

dblp:210/3691 · DBLP profile ↗
← Back
18ranked-venue papers
8as first author
14since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 8 · 6 first-author · 7 since 2021Computer networks · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 since 2021Human-computer interaction and ubiquitous computing · 2 · 1 first-author · 2 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Human-computer interaction and pervasive computing
1 paper
Collaborative and social computing · 30% Learning and educational technologies · 23% User interface design and tools · 23%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
User interface design and tools
design tools
1.012026
Thinking in Graphs with CoMAP: A Shared Visual Workspace for Designing Project-Based Learning · CHI 2026
Human-AI interaction
human-AI collaboration
1.012026
Thinking in Graphs with CoMAP: A Shared Visual Workspace for Designing Project-Based Learning · CHI 2026
Learning and educational technologies › active learning
project-based learning
1.012026
Thinking in Graphs with CoMAP: A Shared Visual Workspace for Designing Project-Based Learning · CHI 2026
Collaborative and social computing › groupware
shared visual workspace
1.012026
Thinking in Graphs with CoMAP: A Shared Visual Workspace for Designing Project-Based Learning · CHI 2026
Collaborative and social computing
distributed cognition
0.312026
Thinking in Graphs with CoMAP: A Shared Visual Workspace for Designing Project-Based Learning · CHI 2026

Methods — techniques the papers use, named apart from their topics

graph-based collaboration · 1.0
YearPublicationVenuePosition
2026 SLOW: Strategic Logical-Inference Open Workspace for Cognitive Adaptation in AI Tutoring
Yuang Wei, Ruijia Li, Bo Jiang 0016
AIED (1)2
2026 Thinking in Graphs with CoMAP: A Shared Visual Workspace for Designing Project-Based Learning
abstract
Designing project-based learning (PBL) demands managing highly interdependent components, a task that both traditional linear tools and purely conversational AI struggle with. Traditional tools fail to capture the non-linear nature of creative design, while conversational systems lack the persistent, shared context necessary for reflective collaboration. Grounded in theories of distributed cognition, we introduce CoMAP, a system that embodies a graph-based collaboration paradigm. By providing a shared visual workspace with dual-modality AI support, CoMAP transforms the human-AI relationship from a prompt-and-response loop into a transparent and equitable partnership. Our study with 30 educators shows CoMAP significantly improves teachers’ design expression, divergent thinking, and iterative practice compared to a dialogue-only baseline. These findings demonstrate how a nonlinear, artifact-centric approach can foster trust, reduce cognitive load, and support educators to take control of their creative process. Our contributions are available at: https://comap2025.github.io/.
Ruijia Li, Bo Jiang 0016
CHI1
2026 Sparse Multi-label feature selection via label rotation learning
Ruijia Li, Yingcang Ma, Hong Chen 0015, Qing Wan
Appl. Intell.1
2026 MIARS: Mutual information-guided feature selection with angle reconstruction and semantic alignment for multi-label learning
Ruijia Li, Hong Chen 0015, Yingcang Ma, Feiping Nie 0001, Yixiao Huang 0007
Knowl. Based Syst.1
2025 Futile Waiting: A Memory Exhaustion DoS Attack on DNS Resolvers
Zijiao Zhang, Ruijia Li, Qunpeng Lei, Buwei Wang, Chenglong Fan
ICC3
2025 Cross-Modal Collaborative Recovery: Breaking Multimodal Unlearnable Examples Protection
abstract
With the rapid development of multimodal machine learning, data security has become a critical bottleneck constraining multimodal artificial intelligence advancement. Multimodal unlearnable examples, as an emerging data protection paradigm, prevent unauthorized model training by disrupting cross-modal semantic consistency through adversarial perturbations and trigger identifiers. However, existing multimodal protection mechanisms suffer from significant robustness deficiencies and security vulnerabilities. This paper conducts a systematic security evaluation of multimodal unlearnable examples and proposes a Cross-Modal Collaborative Recovery (CMCR) attack framework. CMCR integrates Joint Conditional Diffusion Purification for image denoising, Adaptive Text Purification for trigger removal, and Visual Cross-modal BART for cross-modal reconstruction. Experiments demonstrate that CMCR successfully restores image-text retrieval performance to levels approaching clean data across different model architectures, achieving an average recovery rate of 89.0%. Our results reveal that current multimodal unlearnable examples have security vulnerabilities and insufficient robustness against coordinated cross-modal attacks.
Ruijia Li, Zijiao Zhang, Ximin Huang, Hongwei Hu, Xining Gao
TrustCom1
2025 Coordinate descent for top-k multi-label feature selection with pseudo-label learning and manifold learning
Ruijia Li, Yingcang Ma, Hong Chen 0015, Xiaofei Yang 0004, Zhiwei Xing
Neurocomputing1
2025 Q-value-based experience replay in reinforcement learning
Zihong Zhang, Ruijia Li
Knowl. Based Syst.2
2023 A clustering algorithm based on density decreased chain for data with arbitrary shapes and densities
Ruijia Li, Zhiling Cai
Appl. Intell.1
2023 Learning unified anchor graph based on affinity relationships with strong consensus for multi-view spectral clustering
Zhiling Cai, Ruijia Li
Multim. Syst.2
2022 Image Method Based 6G Channel Modeling for IIoT and Mobility Scenarios
abstract
Industrial Internet of things (IIoT) is a typical application scenario in the sixth generation (6G) mobile networks. IIoT scenarios involve dense multipath components (MPCs) and nonnegligible scattering components caused by many moving objects. In this paper, image method (IM) is applied and extended to analyze the channel properties of IIoT. Directive model is modified to adapt to IM. The moving patterns of objects are defined and their snapshots are established along the time axis. Multiple-input multiple-output (MIMO) is supported as it is widely applied in IIoT. A smart warehouse scenario equipped with moving handcars is selected to analyze the channel of IIoT scenario. Parameters such as azimuth angle, elevation angle, angular spread, power, and delay spread of received rays are calculated and compared with those generated by quasi-deterministic (Q-D) model traditionally used in IM. Maximum and minimum Doppler shifts, received power, and delay spread are calculated along the time axis to analyze the influence of mobility to channel properties. The results show that directive model generates scattering components more realistically compared with Q-D model, and that the channel properties may experience sudden changes due to the line-of-sight (LoS) component being obstructed.
Tianyi Liao, Tianyi Zhai, Ruijia Li, Jialing Huang, Yinghua Wang, Jie Huang 0004, Cheng-Xiang Wang 0001
VTC Fall4
2022 Consolidation of structure of high noise data by a new noise index and reinforcement learning
Tianyi Huang, Zhiling Cai, Ruijia Li, Shiping Wang, William Zhu 0001
Inf. Sci.3
2022 Saliency: a new selection criterion of important architectures in neural architecture search
Zhiling Cai, Ruijia Li, William Zhu 0001
Neural Comput. Appl.3
2021 Anchor: The achieved goal to replace the subgoal for hierarchical reinforcement learning
Ruijia Li, Zhiling Cai, Tianyi Huang, William Zhu 0001
Knowl. Based Syst.1
2020 Joint Optimization of Latency Monitoring and Traffic Scheduling in Software Defined Heterogeneous Networks
Xu Zhang 0017, Weigang Hou, Lei Guo 0005, Qihan Zhang, Pengxing Guo, Ruijia Li
Mob. Networks Appl.6
2019 Local gap density for clustering high-dimensional data with varying densities
Ruijia Li, Xiaofei Yang 0011, Xiaolong Qin, William Zhu 0001
Knowl. Based Syst.1
2017 Joint Optimization of Latency Monitoring and Traffic Scheduling in Software Defined Heterogeneous Networks
Xu Zhang 0017, Weigang Hou, Lei Guo 0005, Qihan Zhang, Pengxing Guo, Ruijia Li
QSHINE7
2004 Computation reduction for motion estimation in MPEG-4 video encoder
abstract
In this paper, computation reduction algorithm of motion estimation is developed for MPEG4 video encoders. Our focus is on the computation reduction for block based integer and half pixel search. A method is proposed to reduce the search points and computation with little extra tradeoff and small quality downgrade. In MPEG4, the motion estimation is mainly composed of three major parts: 1) The Macroblock based integer pixel search. 2) The block based integer pixel search. 3) The half pixel search. The Macroblock based integer pixel search usually consumes the most computation power. Therefore many fast search algorithms are employed instead of the full search. In contrast, as to 2), 3), since the search range is quite small, usually the full search method is used. With many novel algorithms the computation requirements in 1) decrease greatly. Hence, the percentage of 2) and 3) are increasing and come to an important position for computation reduction. The method proposed in this paper jointly considered the ME, DCT and quantization. It takes advantage of the idea in both MB and block layer. The computation reduction is obvious from experiment. Because the full search algorithm is still in use, the quality downgrade is little compared to the old computation reduction algorithms.
Chunxi Chen, Ruijia Li
VCIP2