Institution profile

University of Glasgow

Academic institutioneurope · gb
Official website
Research library646linked papers
Opportunities0open roles
Selected work

Representative Papers

Exploring the Perspectives of Social VR-Aware Non-Parent Adults and Parents on Children's Use of Social Virtual Reality

Apr 17, 2024Proc. ACM Hum. Comput. Interact.

This study investigates the age-appropriateness and safety risks of social virtual reality (VR) for children under 13, focusing on perceptual disparities between parents and non-parent adults regarding age restrictions, supervision willingness, and protective measures. A mixed-methods approach was employed: an online survey (N=149, including 79 parents) augmented with qualitative thematic analysis and statistical modeling. Contrary to expectations, results reveal a counterintuitive inverse relationship—higher parental VR familiarity correlates with greater willingness to relax age thresholds or reduce supervisory intensity. High-risk scenarios frequently reported include peer harassment, unwanted physical or interpersonal contact, and excessive self-disclosure. Based on these findings, we propose a four-dimensional child safety enhancement framework: *proactive control*, *real-time monitoring*, *post-incident traceability*, and *collaborative digital literacy education*. We further derive empirically grounded, tiered intervention guidelines for platform developers and caregiver households.

3 citationsRead paper

Special Delivery: Programming with Mailbox Types

Jun 22, 2023Proc. ACM Program. Lang.

Actor models (e.g., Erlang/Elixir) avoid shared-memory concurrency issues but remain prone to protocol violations and deadlocks due to asynchronous, unidirectional message passing. To address this, we propose the first behavioral type system supporting *mailbox types*, and design Pat—a novel actor-based programming language grounded in this system. Our contributions are threefold: (1) the first integration of mailbox types into a practical programming language; (2) a cooperative context algorithm based on quasi-linear types and reverse bidirectional type inference, ensuring both decidability and completeness; and (3) a precise semantic model of asynchronous communication, combining shuffle-regular expression semantics with a process-calculus–to–language semantic translation technique. We implement a prototype type checker and evaluate it on industrial factory automation scenarios and the Savina benchmark suite, demonstrating high-fidelity modeling of real-world actor communication patterns and effective detection of protocol errors.

3 citationsRead paper

Stable Matching with Deviators and Conformists

Jan 26, 2026

This study addresses a novel model in stable matching where agents are partitioned into deviators—those who may strategically deviate from prescribed behavior—and conformists, who adhere strictly to the matching protocol. The work formally introduces this deviator-conformist framework and investigates the existence of matchings that are either free of deviator-blocking pairs or admit only a bounded number of such blocks. Through rigorous computational complexity analysis and problem reductions, the authors establish that the general problem is NP-complete, thereby extending beyond the tractability boundary of classical stable matching. Nevertheless, they identify several special cases that are solvable in polynomial time or fixed-parameter tractable, offering new algorithmic foundations for designing matching mechanisms in multi-agent systems.

2 citationsRead paper

A Minimax Perspective on Almost-Stable Matchings

Jan 20, 2026

In real-world settings, perfectly stable matchings are often unattainable, making the fair distribution of instability a critical concern. This work proposes a novel notion of approximate stability from a minimax perspective, aiming to minimize the maximum number of blocking pairs incident to any individual, thereby ensuring fairness for the worst-off participant. The study investigates this concept within both the Stable Marriage and Stable Roommates frameworks, combining computational complexity analysis, polynomial-time algorithms, integer programming, and approximation techniques. Key contributions include proving that the problem remains NP-complete even when each agent is allowed to belong to at most one blocking pair, designing efficient algorithms for instances where preference lists have length at most two, and providing effective approximation and integer programming formulations for practical computation.

2 citationsRead paper

Render-of-Thought: Rendering Textual Chain-of-Thought as Images for Visual Latent Reasoning

Jan 21, 2026

This work addresses the limitations of traditional Chain-of-Thought (CoT) reasoning—namely its verbosity, high computational cost, and lack of effective supervision over intermediate steps, which hinder interpretability. The authors propose the Render-of-Thought (RoT) framework, which, for the first time, renders CoT reasoning steps into images and leverages off-the-shelf visual language models (VLMs) by utilizing their visual encoders as semantic anchors to align textual and visual embeddings. This approach explicitly externalizes implicit reasoning, making it traceable and interpretable. Notably, RoT requires no additional pretraining and operates in a plug-and-play manner. Experiments demonstrate that RoT achieves 3–4× token compression and significant inference acceleration on mathematical and logical reasoning tasks while maintaining performance comparable to existing methods.

1 citationsRead paper
Recent publications

Latest Papers