Search arXivSearch

arXiv subjects

Jingwei Ye

Publications and source records attributed to Jingwei Ye.

3 recordsLinked to original sources

LogICL: Demonstration Retrieval to Bridge the Semantic Gap in Cross-Domain Log Anomaly Detection

Effective log anomaly detection is critical to sustaining reliability in large-scale IT infrastructures. Transformer-based language models have advanced the field but require substantial computational resources and labeled data, exacerbating the cold-start problem in target domains with scarce logs. Cross-domain methods alleviate data scarcity by leveraging source-domain logs, but their reliance on surface lexical similarity limits generalization when structural and terminological differences obscure semantic equivalence. We propose LogICL, a demonstration-retrieval framework for cross-domain log anomaly detection. During training, LogICL constructs a sparse delta matrix by measuring the signed change in a frozen LLM's prediction error between zero-shot and one-shot inference for selected query-demonstration pairs. This outcome-level feedback supervises a lightweight encoder through a demonstration-utility loss, while maximum mean discrepancy and supervised contrastive losses promote domain alignment and anomaly discrimination. At inference, the encoder retrieves similarity-based anchors and expands them with candidates having the highest scores aggregated over precomputed positive delta relations. Thus, LogICL retrieves high-utility demonstrations without candidate-wise LLM evaluation and provides them to a frozen LLM for in-context anomaly prediction. Experiments on few-shot and target-domain zero-shot transfer benchmarks demonstrate strong performance across heterogeneous log systems. In the few-shot setting, LogICL outperforms Random-ICL and kNN-ICL in three of four transfers under the fixed split, while the benefit remains setting-dependent. Further analysis shows that LogICL can identify demonstrations with positive predictive utility despite low surface lexical similarity, helping bridge the semantic gap across logging systems.

cs.SE

MACAA: Belief-Revision Multi-Agent Reasoning for Code Authorship Verification

Code authorship attribution (CAA) supports software forensics, plagiarism detection, and intellectual property protection. However, existing supervised CAA approaches suffer from scarce training data and closed-world assumptions: they require sufficient labeled code from fixed candidate-author sets, making training difficult in low-data cases and predictions unreliable for open-world test pairs with unseen samples, or heterogeneous code pairs. Large language models remove task-specific training, but direct prompting depends on costly expert-designed prompts, can hallucinate over complex heterogeneous code pairs, and rarely yields auditable evidence traces. We propose MACAA, a belief-revision-based multi-agent framework for training-free code authorship verification. MACAA comprises a Coordinator and four Expert Agents analyzing layout, lexical, syntactic, and programming-pattern evidence. The Coordinator gathers expert signals for expansion, discounts unreliable evidence through contraction, and resolves conflicts through revision to preserve belief consistency, replacing direct LLM judgment with auditable hypothesis refinement. MACAA achieves 89.15\% F1 on same-language benchmarks and 80.00\% on mixed cross-language pairs, outperforming the baselines overall in both same-language and cross-language evaluations.

cs.SE

A Trust-Centric Privacy-Preserving Blockchain for Dynamic Spectrum Management in IoT Networks

In this paper, we propose a trust-centric privacy-preserving blockchain for dynamic spectrum access in IoT networks. To be specific, we propose a trust evaluation mechanism to evaluate the trustworthiness of sensing nodes and design a Proof-of-Trust (PoT) consensus mechanism to build a scalable blockchain with high transaction-per-second (TPS). Moreover, a privacy protection scheme is proposed to protect sensors' real-time geolocatioin information when they upload sensing data to the blockchain. Two smart contracts are designed to make the whole procedure (spectrum sensing, spectrum auction, and spectrum allocation) run automatically. Simulation results demonstrate the expected computation cost of the PoT consensus algorithm for reliable sensing nodes is low, and the cooperative sensing performance is improved with the help of trust value evaluation mechanism.In addition, incentivization and security are also analyzed, which show that our design not only can encourage nodes' participation, but also resist to many kinds of attacks which are frequently encountered in trust-based blockchain systems.

cs.CR