Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

2026

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 26341 - 26346 of 26346

Full-Text Articles in Entire DC Network

Gui Test Migration Via Abstraction And Concretization, Yakun Zhang, Chen Liu, Xiaofei Xie, Yun Lin, Jin Song Dong, Dan Hao, Lu Zhang Jan 2026

Gui Test Migration Via Abstraction And Concretization, Yakun Zhang, Chen Liu, Xiaofei Xie, Yun Lin, Jin Song Dong, Dan Hao, Lu Zhang

Research Collection School Of Computing and Information Systems

GUI test migration aims to produce test cases with events and assertions to test specific functionalities of a target app. Existing migration approaches typically focus on the widget-mapping paradigm that maps widgets from source apps to target apps. However, since different apps may implement the same functionality in different ways, direct mapping may result in incomplete or buggy test cases, thus significantly impacting the effectiveness of testing the target functionality and the practical applicability of migration approaches.In this article, we propose a new migration paradigm (i.e., the abstraction-concretization paradigm) that first abstracts the test logic for the target functionality and …

Go to article

Learning-Based Graph Shrinking For Quantum Optimization Of Constrained Combinatorial Problems, Monit Sharma, Hoong Chuin Lau Jan 2026

Learning-Based Graph Shrinking For Quantum Optimization Of Constrained Combinatorial Problems, Monit Sharma, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Graph shrinking has recently emerged as a powerful preprocessing technique for hybrid classical–quantum optimization, enabling variable and constraint reduction before quantum solving. Conventional approaches rely on Semi-Definite Programming (SDP) relaxations to compute vertex correlations, but these methods suffer from high computational overhead, instance-specific tuning, and limited generalizability. In this work, we replace the handcrafted SDP correlation stage with a reinforcement learning (RL) based correlation estimator, trained to predict merge quality directly from graph structure. We reformulate the graph shrinking process as a Markov Decision Process (MDP), design a Graph Neural Network (GNN) policy to guide vertex merging, and integrate the …

Go to article

Security-Enhanced Decentralized Conditional Privacy-Preserving Authentication In Vanets, Suqin Luo, Xinghua Li, Yinbin Miao, Xuelin Cao, Zhan Zhang, Yunwei Wang, Deng R.H. Jan 2026

Security-Enhanced Decentralized Conditional Privacy-Preserving Authentication In Vanets, Suqin Luo, Xinghua Li, Yinbin Miao, Xuelin Cao, Zhan Zhang, Yunwei Wang, Deng R.H.

Research Collection School Of Computing and Information Systems

To ensure the legitimacy of communicators while ad dressing the privacy concerns of vehicles in vehicular ad-hoc networks (VANETs), conditional privacy-preserving authentication (CPPA) schemes have been proposed. Given that existing schemes suffer from single point of failure due to centralized authorities, several distributed CPPA schemes have been proposed. However, these schemes all ignore the tight cementation between system secret keys and the authority, which could be a serious threat to system security, that the compromised authority may leak the system secret key. To address these issues, we propose a security enhanced decentralized conditional privacy-preserving authentication (DCPPA) scheme. DCPPA first introduces …

Go to article

Tempo: Training-Time Equilibration Of Modalities For Per-Sample Optimization In Multimodal Sentiment, Yi Zhao, Erik Cambria, Xiaosong E, Xianxun Zhu Jan 2026

Tempo: Training-Time Equilibration Of Modalities For Per-Sample Optimization In Multimodal Sentiment, Yi Zhao, Erik Cambria, Xiaosong E, Xianxun Zhu

Research Collection School Of Computing and Information Systems

Multimodal sentiment models often become over-reliant on the “easiest” modality (typically text), leading to three coupled sub-problems: (i) representation-level dominance, where weaker modalities contribute little to the fused representation; (ii) optimization-level dominance, where the strongest modality drives most gradient updates and suppresses learning in others; and (iii) robustness degradation, where audio or vision fail under noise or missing inputs at test time. We present TEMPO, a plug-and-play training framework that mitigates these issues by rebalancing learning pressure across modalities while leaving inference unchanged. For each mini-batch, TEMPO estimates relative modality strength and applies two synchronized, training-only controls: selective forward attenuation …

Go to article

Purified Zero-Shot Sketch-Based Image Retrieval, Yang Zhou, Jingru Yang, Jin Wang, Kaixiang Huang, Guodong Lu, Shengfeng He Jan 2026

Purified Zero-Shot Sketch-Based Image Retrieval, Yang Zhou, Jingru Yang, Jin Wang, Kaixiang Huang, Guodong Lu, Shengfeng He

Research Collection School Of Computing and Information Systems

Sketches, as a new solution in multimedia systems that can replace natural language, are characterized by sparse visual cues such as simple strokes that differ significantly from natural images containing complex elements such as background, foreground, and texture. This misalignment poses substantial challenges for zero-shot sketch-based image retrieval (ZS-SBIR). Prior approaches match sketches to full images and tend to overlook redundant elements in natural images, leading to model distraction and semantic ambiguity. To address this issue, we introduce a distraction-agnostic framework, purified cross-domain matching (PuXIM), which operates on a straightforward principle: masking and matching. We devise a visual-cross-linguistic (VxL) sampler …

Go to article

Nondeterministic Polynomial-Time Problem Challenge: An Ever-Scaling Reasoning Benchmark For Llms, Chang Yang, Ruiyu Wang, Junzhe Jiang, Qi Jiang, Qinggang Zhang, Yanchen Deng, Shuxin Li, Shuyue Hu, Bo Li, Florian T. Pokorny, Xiao Huang, Xinrun Wang Jan 2026

Nondeterministic Polynomial-Time Problem Challenge: An Ever-Scaling Reasoning Benchmark For Llms, Chang Yang, Ruiyu Wang, Junzhe Jiang, Qi Jiang, Qinggang Zhang, Yanchen Deng, Shuxin Li, Shuyue Hu, Bo Li, Florian T. Pokorny, Xiao Huang, Xinrun Wang

Research Collection School Of Computing and Information Systems

Reasoning is the fundamental capability of large language models (LLMs). Due to the rapid progress of LLMs, there are two main issues of current benchmarks: i) these benchmarks can be crushed in a short time (less than 1 year), and ii) these benchmarks may be easily hacked. To handle these issues, we propose the ever-scalingness for building the benchmarks which are scaling over complexity against crushing, instance against hacking and exploitation, oversight for easy verification, and coverage for real-world relevance. This paper presents Nondeterministic Polynomial-time Problem Challenge (NPPC), an ever-scaling reasoning benchmark for LLMs. Specifically, the NPPC has three main …

Go to article

First Prev