Access Control as Verified Parse Constraints
研究解决了安全网关中因实现错误导致的访问控制问题，通过使用经验证的解析约束和SMT求解器一次性验证所有策略，确保了固定端点集下策略执行的正确性。
0 citationsRead paper
Selected work
Representative Papers
QGB-W$k$NN: Quantum Granular-Ball Learning for Robust Classification
Nearest-neighbor classification is widely used in machine learning, yet existing methods often suffer from low computational efficiency and limited robustness in noisy environments. To jointly address these challenges, this paper proposes an efficient and reliable weighted $K$-nearest neighbor classification framework based on quantum granular balls, termed QGB-W$k$NN. The proposed framework improves computational efficiency by integrating quantum-enhanced granular-ball representation with hierarchical nearest-neighbor search, while enhancing classification reliability through a purity-aware weighted decision mechanism. Specifically, quantum-kernel granular balls are constructed to reduce retrieval redundancy and strengthen nonlinear feature representation under limited quantum resources. A granular-ball purity-guided HNSW optimization strategy is developed to exploit structural reliability for hierarchical graph construction during neighbor retrieval, alleviating the local optimality issue caused by conventional random layering. Finally, a weighted voting mechanism jointly incorporating granular-ball similarity and purity is introduced to produce more reliable classification decisions in noisy environments. Extensive experiments on benchmark datasets demonstrate that QGB-W$k$NN achieves competitive classification accuracy while exhibiting favorable Pareto trade-offs between classification performance and computational cost. Moreover, the proposed framework consistently improves robustness under various noisy conditions, suggesting that reliability-aware quantum granular-ball learning provides a promising paradigm for efficient and robust nearest-neighbor classification.
0 citationsRead paper
Granular-Ball Quantum Clustering for Resource-Efficient and Robust Learning
Quantum clustering aims to exploit quantum feature representations to uncover complex data structures beyond conventional Euclidean geometry. Yet this sample-level kernel construction requires O(n^2) quantum circuit executions for n data points, creating a major bottleneck under near-term quantum resource constraints. Prior solutions fail to resolve this efficiency-accuracy dilemma: classical granular-ball clustering reduces sample complexity but relies on Euclidean metrics that cannot capture quantum correlations, while existing quantum compression schemes prioritize efficiency over structural preservation, degrading performance on non-convex or noisy data. Here we propose Granular-Ball Quantum Clustering (GBQC), a framework that tightly couples granular-ball structural abstraction with quantum feature learning. GBQC first compresses raw data into compact, representative granular balls via a PCA-guided splitting strategy, reducing kernel evaluations by 80% compared to full-sample methods. A quantum cohesion mechanism then filters noisy granules in Hilbert space to improve clustering robustness. Extensive experiments on synthetic, noisy, overlapping, and real-world datasets demonstrate that GBQC consistently achieves superior clustering accuracy and robustness compared with representative classical and quantum clustering methods. Meanwhile, the proposed granular-ball compression significantly reduces quantum kernel evaluations and computational overhead, enabling quantum clustering experiments on larger datasets within parameterized quantum learning frameworks. These results suggest that granular-ball representations serve not only as a compression mechanism to reduce quantum computational costs but also as an effective structural abstraction mechanism that improves clustering quality by eliminating redundant and structurally ambiguous learning units.
0 citationsRead paper
CoLa-ICD: A Knowledge-Enhanced Framework for Long-Tail Automated Medical Coding
本文提出CoLa-ICD框架，通过增强知识、建模相关代码依赖关系及学习标签语义与临床证据间更强对齐来解决长尾自动医疗编码问题。
0 citationsRead paper
Wiktionary as a Crowdsourced Lexicon for English Dialects
This study evaluates the ethical implications and empirical validity of Wiktionary as a crowdsourced resource for English dialectology. Employing a two-stage analytical framework that integrates georeferenced social media corpus validation with lexical coverage comparisons, the research systematically assesses its real-world performance. Results demonstrate that Wiktionary matches or surpasses the Oxford English Dictionary in regional variant coverage, exhibiting a 0.883 correlation with New Zealand English word-formation patterns and confirming strong alignment with authentic usage data. Beyond establishing the advantages of crowdsourced lexicography for dialect documentation, this work elucidates macro-level methodological challenges inherent in evaluating such resources, thereby proposing a novel paradigm for digital lexicography.
0 citationsRead paper
Recent publications
Latest Papers
Access Control as Verified Parse Constraints
研究解决了安全网关中因实现错误导致的访问控制问题，通过使用经验证的解析约束和SMT求解器一次性验证所有策略，确保了固定端点集下策略执行的正确性。
0 citationsRead paper
QGB-W$k$NN: Quantum Granular-Ball Learning for Robust Classification
Nearest-neighbor classification is widely used in machine learning, yet existing methods often suffer from low computational efficiency and limited robustness in noisy environments. To jointly address these challenges, this paper proposes an efficient and reliable weighted $K$-nearest neighbor classification framework based on quantum granular balls, termed QGB-W$k$NN. The proposed framework improves computational efficiency by integrating quantum-enhanced granular-ball representation with hierarchical nearest-neighbor search, while enhancing classification reliability through a purity-aware weighted decision mechanism. Specifically, quantum-kernel granular balls are constructed to reduce retrieval redundancy and strengthen nonlinear feature representation under limited quantum resources. A granular-ball purity-guided HNSW optimization strategy is developed to exploit structural reliability for hierarchical graph construction during neighbor retrieval, alleviating the local optimality issue caused by conventional random layering. Finally, a weighted voting mechanism jointly incorporating granular-ball similarity and purity is introduced to produce more reliable classification decisions in noisy environments. Extensive experiments on benchmark datasets demonstrate that QGB-W$k$NN achieves competitive classification accuracy while exhibiting favorable Pareto trade-offs between classification performance and computational cost. Moreover, the proposed framework consistently improves robustness under various noisy conditions, suggesting that reliability-aware quantum granular-ball learning provides a promising paradigm for efficient and robust nearest-neighbor classification.
0 citationsRead paper
Granular-Ball Quantum Clustering for Resource-Efficient and Robust Learning
Quantum clustering aims to exploit quantum feature representations to uncover complex data structures beyond conventional Euclidean geometry. Yet this sample-level kernel construction requires O(n^2) quantum circuit executions for n data points, creating a major bottleneck under near-term quantum resource constraints. Prior solutions fail to resolve this efficiency-accuracy dilemma: classical granular-ball clustering reduces sample complexity but relies on Euclidean metrics that cannot capture quantum correlations, while existing quantum compression schemes prioritize efficiency over structural preservation, degrading performance on non-convex or noisy data. Here we propose Granular-Ball Quantum Clustering (GBQC), a framework that tightly couples granular-ball structural abstraction with quantum feature learning. GBQC first compresses raw data into compact, representative granular balls via a PCA-guided splitting strategy, reducing kernel evaluations by 80% compared to full-sample methods. A quantum cohesion mechanism then filters noisy granules in Hilbert space to improve clustering robustness. Extensive experiments on synthetic, noisy, overlapping, and real-world datasets demonstrate that GBQC consistently achieves superior clustering accuracy and robustness compared with representative classical and quantum clustering methods. Meanwhile, the proposed granular-ball compression significantly reduces quantum kernel evaluations and computational overhead, enabling quantum clustering experiments on larger datasets within parameterized quantum learning frameworks. These results suggest that granular-ball representations serve not only as a compression mechanism to reduce quantum computational costs but also as an effective structural abstraction mechanism that improves clustering quality by eliminating redundant and structurally ambiguous learning units.
0 citationsRead paper
CoLa-ICD: A Knowledge-Enhanced Framework for Long-Tail Automated Medical Coding
本文提出CoLa-ICD框架，通过增强知识、建模相关代码依赖关系及学习标签语义与临床证据间更强对齐来解决长尾自动医疗编码问题。
0 citationsRead paper
Wiktionary as a Crowdsourced Lexicon for English Dialects
This study evaluates the ethical implications and empirical validity of Wiktionary as a crowdsourced resource for English dialectology. Employing a two-stage analytical framework that integrates georeferenced social media corpus validation with lexical coverage comparisons, the research systematically assesses its real-world performance. Results demonstrate that Wiktionary matches or surpasses the Oxford English Dictionary in regional variant coverage, exhibiting a 0.883 correlation with New Zealand English word-formation patterns and confirming strong alignment with authentic usage data. Beyond establishing the advantages of crowdsourced lexicography for dialect documentation, this work elucidates macro-level methodological challenges inherent in evaluating such resources, thereby proposing a novel paradigm for digital lexicography.
0 citationsRead paper