Institution profile

Minjiang University

Academic institutionasia · cn
Official website
Research library6linked papers
Opportunities0open roles
Selected work

Representative Papers

Stochasticity Is Not the Hard Part: Reduction and Complexity in Instructional Sequencing over Prerequisite DAGs

Aug 05, 2026

This study addresses the problem of finding the optimal teaching sequence that minimizes learning cost in scenarios with prerequisite dependencies. The problem is modeled as a stochastic shortest path problem, and we propose an exact reduction based on lattice theory that transforms it into a deterministic shortest path problem, revealing that the computational difficulty stems not from stochasticity but from the combinatorial complexity inherent in the dependency structure. We theoretically prove the problem to be NP-hard; however, by leveraging dynamic programming, A* search, and feedback arc set reductions, we identify a “doubly simple” regime in real-world course data where A* efficiently solves instances with state-space size linear in the number of concepts. A computable diagnostic metric, \( m\Delta \), further enables practical assessment of instance hardness.

0 citationsRead paper

Glass Surface Segmentation with an RGB-D Camera via Weighted Feature Fusion for Service Robots

Aug 03, 2025

Service robots face significant challenges in segmenting glass surfaces using RGB-D cameras in real-world scenarios due to glass transparency, strong reflections, and occlusions. To address these issues, this paper proposes a Weighted Feature Fusion (WFF) module that enables dynamic, adaptive fusion of RGB and depth features; the module is plug-and-play and compatible with multiple mainstream segmentation backbones. Furthermore, we introduce MJU-Glass—the first real-world glass segmentation dataset collected *in situ* by service robots—filling a critical gap in publicly available glass segmentation data. Integrating WFF into architectures such as PSPNet yields substantial improvements in segmentation robustness without compromising computational efficiency: boundary IoU increases by 7.49%, and mean IoU also improves significantly, thereby effectively reducing robot collision risk during navigation and interaction.

0 citationsRead paper
Recent publications

Latest Papers

Stochasticity Is Not the Hard Part: Reduction and Complexity in Instructional Sequencing over Prerequisite DAGs

Aug 05, 2026

This study addresses the problem of finding the optimal teaching sequence that minimizes learning cost in scenarios with prerequisite dependencies. The problem is modeled as a stochastic shortest path problem, and we propose an exact reduction based on lattice theory that transforms it into a deterministic shortest path problem, revealing that the computational difficulty stems not from stochasticity but from the combinatorial complexity inherent in the dependency structure. We theoretically prove the problem to be NP-hard; however, by leveraging dynamic programming, A* search, and feedback arc set reductions, we identify a “doubly simple” regime in real-world course data where A* efficiently solves instances with state-space size linear in the number of concepts. A computable diagnostic metric, \( m\Delta \), further enables practical assessment of instance hardness.

0 citationsRead paper

Glass Surface Segmentation with an RGB-D Camera via Weighted Feature Fusion for Service Robots

Aug 03, 2025

Service robots face significant challenges in segmenting glass surfaces using RGB-D cameras in real-world scenarios due to glass transparency, strong reflections, and occlusions. To address these issues, this paper proposes a Weighted Feature Fusion (WFF) module that enables dynamic, adaptive fusion of RGB and depth features; the module is plug-and-play and compatible with multiple mainstream segmentation backbones. Furthermore, we introduce MJU-Glass—the first real-world glass segmentation dataset collected *in situ* by service robots—filling a critical gap in publicly available glass segmentation data. Integrating WFF into architectures such as PSPNet yields substantial improvements in segmentation robustness without compromising computational efficiency: boundary IoU increases by 7.49%, and mean IoU also improves significantly, thereby effectively reducing robot collision risk during navigation and interaction.

0 citationsRead paper