Search arXivSearch

arXiv · 2609.03918

Grounding GUI Design in Computational Psychology

Abstract

Creating visually appealing user interfaces often requires extensive manual iteration. We propose an approach that applies answer set programming (ASP) to automatically generate and optimize UI layouts while satisfying design objectives such as grid alignment, grouping, color harmony, and whitespace, along with designer-specified preferences. Our method encodes constraints on element properties and relative positioning, producing layouts that balance functional and aesthetic goals. We evaluate this approach in three studies. Across two user studies, participants rated layouts generated with the full ASP model higher than both random designs and those based on simple heuristics. Designers reported that ASP-generated layouts supported early-stage sketching and exploration.

Explore related subjects

Keep this discovery

BibTeXRIS

Xianni Wang, Javier Romero Davila, Saku Sourulahti, Torsten Schaub, Jussi P. P. Jokinen. 2026-09-03. Grounding GUI Design in Computational Psychology. https://arxiv.org/abs/2609.03918

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

GRAND-HC: Graph-Refined Author Name Disambiguation

From-Scratch Name Disambiguation (SND) groups papers sharing an ambiguous name into clusters of distinct real-world authors. Existing methods suffer from two critical limitations: (1) inherent long-tailed author distribution biases representation learning, causing over-merging of tail authors; (2) existing cluster number estimation methods are unreliable for long paper sequences, hindering large-scale deployment. We propose \textbf{GRAND-HC}, a complete end-to-end SND framework. We construct a heterogeneous paper graph via co-author, co-organization, and co-venue relations, using a graph attention network as the embedding backbone. \textbf{Harmony Contrastive Learning (HCL)} dynamically reweights training loss to suppress overfitting to prolific authors, learning discriminative embeddings. A \textbf{Graph-Refined Distance Matrix (GRDM)} leverages graph topology to optimize pairwise distances, further preventing tail author over-merging. Meanwhile, a lightweight \textbf{Paper Compression Module (PCM)} achieves accurate cluster number estimation across varying scales. Finally, Hierarchical Agglomerative Clustering outputs the final clusters. Extensive experiments demonstrate state-of-the-art macro F1 performance. GRAND-HC has been deployed in a billion-scale academic database. Source code: https://github.com/baokou-fw2/GRAND-HC.

cs.IR

FocusAdapt: Context-aware Adaptive Focus Assistance in Diminished Reality

Diminished Reality (DR) can reduce visual clutter by removing irrelevant objects. However, removing all task-irrelevant objects may eliminate useful contextual information and reduce situational awareness. We present FocusAdapt, a context-aware DR system that predicts object-level distraction by integrating visual saliency, semantic relevance, and gaze behavior. Based on findings from a formative study, FocusAdapt selectively diminishes highly distracting objects while preserving useful context, enabling adaptive focus assistance during procedural tasks.

cs.HC

TSExplorer: An interactive data annotation and exploration tool for time-series data

We present TSExplorer, a cross-platform tool for interactive annotation and exploration of time-series data. The tool enables users to inspect high-dimensional datasets through multiple complementary 2D visualizations derived from high-dimensional feature representations. TSExplorer is designed as a general-purpose research tool supporting a wide range of workflows, including exploratory data analysis, annotation of unlabeled or partially-labeled datasets, comparison of feature representations, and post-hoc inspection and refinement of existing labels with interactive visual feedback.

cs.HC