检索结果-内蒙古大学图书馆

Constant Optimization Driven Database System Testing

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhang, Chi Rigger, Manuel State Key Laboratory for Novel Software Technology School of Computer Science Nanjing University Nanjing China National University of Singapore Singapore

Logic bugs are bugs that can cause database management systems (DBMSs) to silently produce incorrect results for given queries. Such bugs are severe, because they can easily be overlooked by both developers and users, and can cause applications that rely on the DBMSs to malfunction. In this work, we propose Constant-Optimization-Driven Database Testing (CODDTest) as a novel approach for detecting logic bugs in DBMSs. This method draws inspiration from two well-known optimizations in compilers: constant folding and constant propagation. Our key insight is that for a certain database state and query containing a predicate, we can apply constant folding on the predicate by replacing an expression in the predicate with a constant, anticipating that the results of this predicate remain unchanged;any discrepancy indicates a bug in the DBMS. We evaluated CODDTest on five mature and extensively-tested DBMSs–SQLite, MySQL, CockroachDB, DuckDB, and TiDB–and found 45 unique, previously unknown bugs in them. Out of these, 24 are unique logic bugs. Our manual analysis of the state-of-the-art approaches indicates that 11 logic bugs are detectable only by CODDTest. We believe that CODDTest is easy to implement, and can be widely adopted in practice. © 2025, CC BY.

关键词： Database systems

Detecting Duplicate Vulnerability Records Across Databases

学校读者我要写书评

暂无评论

SSRN

SSRN 2025年

作者： Zhu, Kangliang Yang, Wenhua Pan, Minxue Zhou, Yu College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

Vulnerability databases are critical repositories that aggregate information about known security vulnerabilities across various software products. However, the existence of multiple, heterogeneous databases often leads to duplicate vulnerability records, necessitating significant manual effort by maintainers to identify and consolidate these duplicates. This study addresses the challenge of detecting duplicate vulnerabilities across different databases by proposing a combined method that integrates cosine similarity measures with a fine-tuned BERT-based language model. We constructed a comprehensive duplicate vulnerability dataset by analyzing records from prominent databases such as CVE, OSV, and the GitHub Advisory Database. Our method was evaluated against several baseline techniques, including similarity-based and deep learning-based approaches, demonstrating superior performance across multiple metrics, including Hit Rate@N, Mean Reciprocal Rank (MRR), Mean Rank, and Median Rank. Additionally, our method proved effective in practical scenarios involving ongoing database maintenance, showcasing its ability to generalize to unseen data. The findings highlight the potential of integrating traditional similarity measures with advanced language models to enhance the accuracy and efficiency of duplicate vulnerability detection, thereby facilitating more reliable vulnerability management. © 2025, The Authors. All rights reserved.

关键词： Database systems

Multi-View Incongruity Learning for Multimodal Sarcasm Detection 31

学校读者我要写书评

暂无评论

Multi-View Incongruity Learning for Multimodal Sarcasm Detec...

31st International Conference on Computational Linguistics, COLING 2025

作者： Guo, Diandian Cao, Cong Yuan, Fangfang Liu, Yanbing Zeng, Guangjie Yu, Xiaoyan Peng, Hao Yu, Philip S. Institute of Information Engineering Chinese Academy of Sciences China School of Cyber Security University of Chinese Academy of Sciences China State Key Laboratory of Software Development Environment Beihang University China School of Computer Science and Technology Beijing Institute of Technology China Department of Computer Science University of Illinois Chicago United States

ISBN: (纸本)9798891761964

Multimodal sarcasm detection (MSD) is essential for various downstream tasks. Existing MSD methods tend to rely on spurious correlations. These methods often mistakenly prioritize non-essential features yet still make correct predictions, demonstrating poor generalizability beyond training environments. Regarding this phenomenon, this paper undertakes several initiatives. Firstly, we identify two primary causes that lead to the reliance of spurious correlations. Secondly, we address these challenges by proposing a novel method that integrate Multimodal Incongruities via Contrastive Learning (MICL) for multimodal sarcasm detection. Specifically, we first leverage incongruity to drive multi-view learning from three views: token-patch, entity-object, and sentiment. Then, we introduce extensive data augmentation to mitigate the biased learning of the textual modality. Additionally, we construct a test set, SPMSD, which consists potential spurious correlations to evaluate the the model's generalizability. Experimental results demonstrate the superiority of MICL on benchmark datasets, along with the analyses showcasing MICL's advancement in mitigating the effect of spurious correlation. © 2025 Association for Computational Linguistics.

关键词： Contrastive Learning

Probabilistic-Search and Neighbor-Density Based Doppler-Shift Acquisition in Space Communications

学校读者我要写书评

暂无评论

IEEE Transactions on Communications 2025年

作者： Zhang, Zhaowei Du, Shuai Liu, Lin Liu, Hui Zuo, Jiakuo Miao, Wang Zhao, Haitao Nanjing University of Posts and Telecommunications School of Internet of Things China Nanjing University State Key Laboratory for Novel Software Technology China Jinling Institute of Technology School of Software Engineering China University of Exeter Department of Computer Science United Kingdom

In space communications, the signal's long-distance transmission between a flying transmitter-receiver pair encounters two obstacles: a huge path-loss and a high-speed movement. The huge path-loss results in a low signal-to-noise ratio (SNR) and the high-speed movement brings a dynamic Doppler-shift, thus posing a great challenge for Doppler-shift acquisition. Under the low SNR, the Doppler-shift acquisition has to accumulate many symbols in a long-time period. However, during this period, the dynamic Doppler-shift disperses all these symbols' total energy over a wide range, thus causing the energy dispersion problem. To address this problem, we propose a probabilistic-search and neighbor-density (PSND) scheme, where the probabilistic-search considers the element's amplitude and sacrifices some redundant signal elements for a narrower search-range, while the neighbordensity sums the signal element's all neighbors for a larger signal energy. The PSND scheme includes two algorithms: the Generic PSND and Iterative PSND. The Generic PSND algorithm first selects some search-elements with their probabilities to construct a probabilistic-search-range, then selects some density-elements with their neighbor-elements to derive the neighbor-densities, and finally searches the largest neighbor-density to obtain the acquisition result. Built upon the Generic PSND algorithm above, the Iterative PSND algorithm iteratively updates the searchelements to further strengthen the neighbor-density in a narrower probabilistic-search-range. Moreover, the simulations results have demonstrated our PSND scheme's higher acquisition probability, as compared with the existing schemes. © 1972-2012 IEEE.

关键词： Signal to noise ratio

Improving Multi-Label Contrastive Learning by Leveraging Label Distribution

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Chen, Ning Lyu, Shen-Huan Wu, Tian-Shuang Wang, Yanyan Tang, Bin Key Laboratory of Water Big Data Technology of Ministry of Water Resources College of Computer Science and Software Engineering Hohai University Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

In multi-label learning, leveraging contrastive learning to learn better representations faces a key challenge: selecting positive and negative samples and effectively utilizing label information. Previous studies selected positive and negative samples based on the overlap between labels and used them for label-wise loss balancing. However, these methods suffer from a complex selection process and fail to account for the varying importance of different labels. To address these problems, we propose a novel method that improves multi-label contrastive learning through label distribution. Specifically, when selecting positive and negative samples, we only need to consider whether there is an intersection between labels. To model the relationships between labels, we introduce two methods to recover label distributions from logical labels, based on Radial Basis Function (RBF) and contrastive loss, respectively. We evaluate our method on nine widely used multi-label datasets, including image and vector datasets. The results demonstrate that our method outperforms state-of-the-art methods in six evaluation metrics. Copyright © 2025, The Authors. All rights reserved.

关键词： Contrastive Learning

Enhancing Security and Privacy in Federated Learning Using Low-Dimensional Update Representation and Proximity-Based Defense

学校读者我要写书评

暂无评论

IEEE Transactions on Knowledge and Data Engineering 2025年第6期37卷 3372-3385页

作者： Li, Wenjie Fan, Kai Zhang, Jingyuan Li, Hui Lim, Wei Yang Bryan Yang, Qiang Xidian University State Key Laboratory of Integrated Service Networks School of Cyber Engineering Xi'an710071 China Nanyang Technological University College of Computing and Data Science 639798 Singapore Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong999077 Hong Kong

Federated Learning (FL) is a promising privacy-preserving machine learning paradigm that allows data owners to collaboratively train models while keeping their data localized. Despite its potential, FL faces challenges related to the trustworthiness of both clients and servers, particularly against curious or malicious adversaries. In this paper, we introduce a novel framework named Federated Learning with Low-Dimensional Update Representation and Proximity-Based defense (FLURP), designed to address privacy preservation and resistance to Byzantine attacks in distributed learning environments. FLURP employs $\mathsf {LinfSample}$LinfSample method, enabling clients to compute the $l{ }$l∞ norm across sliding windows of updates, resulting in a Low-Dimensional Update Representation (LUR). Calculating the shared distance matrix among LURs, rather than updates, significantly reduces the overhead of Secure Multi-Party Computation (SMPC) by three orders of magnitude while effectively distinguishing between benign and poisoned updates. Additionally, FLURP integrates a privacy-preserving proximity-based defense mechanism utilizing optimized SMPC protocols to minimize communication rounds. Our experiments demonstrate FLURP's effectiveness in countering Byzantine adversaries with low communication and runtime overhead. FLURP offers a scalable framework for secure and reliable FL in distributed environments, facilitating its application in scenarios requiring robust data management and security. © 1989-2012 IEEE.

关键词： Federated learning

MPIC: Position-Independent Multimodal Context Caching System for Efficient MLLM Serving

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhao, Shiju Hu, Junhao Huang, Rongxiao Zheng, Jiaqi Chen, Guihai State Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China School of Computer Science Peking University Peking China

The context caching technique is employed to accelerate the Multimodal Large Language Model (MLLM) inference by prevailing serving platforms currently. However, this approach merely reuses the key-Value (KV) cache of the initial sequence of prompt, resulting in full KV cache recomputation even if the prefix differs slightly. This becomes particularly inefficient in the context of interleaved text and images, as well as multimodal retrieval-augmented generation. This paper proposes position-independent caching as a more effective approach for multimodal information management. We have designed and implemented a caching system, named MPIC, to address both system-level and algorithm-level challenges. MPIC stores the KV cache on local or remote disks when receiving multimodal data, and calculates and loads the KV cache in parallel during inference. To mitigate accuracy degradation, we have incorporated integrated reuse and recompute mechanisms within the system. The experimental results demonstrate that MPIC can achieve up to 54% reduction in response time compared to existing context caching systems, while maintaining negligible or no accuracy loss. © 2025, CC BY.

关键词： Modeling languages

Compressing Model with Few Class-Imbalance Samples: An Out-of-Distribution Expedition

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Wu, Tian-Shuang Lyu, Shen-Huan Chen, Ning Qu, Zhihao Ye, Baoliu Key Laboratory of Water Big Data Technology Ministry of Water Resources College of Computer Science and Software Engineering Hohai University Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

In recent years, as a compromise between privacy and performance, few-sample model compression has been widely adopted to deal with limited data resulting from privacy and security concerns. However, when the number of available samples is extremely limited, class imbalance becomes a common and tricky problem. Achieving an equal number of samples across all classes is often costly and impractical in real-world applications, and previous studies on few-sample model compression have mostly ignored this significant issue. Our experiments comprehensively demonstrate that class imbalance negatively affects the overall performance of few-sample model compression methods. To address this problem, we propose a novel and adaptive framework named OOD-Enhanced Few-Sample Model Compression (OE-FSMC). This framework integrates easily accessible out-of-distribution (OOD) data into both the compression and fine-tuning processes, effectively rebalancing the training distribution. We also incorporate a joint distillation loss and a regularization term to reduce the risk of the model overfitting to the OOD data. Extensive experiments on multiple benchmark datasets show that our framework can be seamlessly incorporated into existing few-sample model compression methods, effectively mitigating the accuracy degradation caused by class imbalance. Copyright © 2025, The Authors. All rights reserved.

关键词： Differential privacy

3D Gaussian Splatting: Survey, Technologies, Challenges, and Opportunities

学校读者我要写书评

暂无评论

IEEE Transactions on Circuits and Systems for Video technology 2025年

作者： Bao, Yanqi Ding, Tianyu Huo, Jing Liu, Yaoli Li, Yuxin Li, Wenbin Gao, Yang Luo, Jiebo Nanjing University State Key Laboratory for Novel Software Technology 210023 China Microsoft Corporation Applied Sciences Group Redmond United States University of Rochester Department of Computer Science United States

3D Gaussian Splatting (3DGS) has emerged as a prominent technique with the potential to become a mainstream method for 3D representations. It can effectively transform multi-view images into explicit 3D Gaussian through efficient training, and achieve real-time rendering of novel views. This survey aims to analyze existing 3DGS-related works from multiple intersecting perspectives, including related tasks, technologies, challenges, and opportunities. The primary objective is to provide newcomers with a rapid understanding of the field and to assist researchers in methodically organizing existing technologies and challenges. Specifically, we delve into the optimization, application, and extension of 3DGS, categorizing them based on their focuses or motivations. Additionally, we summarize and classify nine types of technical modules and corresponding improvements identified in existing works. Based on these analyses, we further examine the common challenges and technologies across various tasks, proposing potential research opportunities. © 1991-2012 IEEE.

关键词： 3D modeling