arXiv subjects

Zhenyu Xu

Publications and source records attributed to Zhenyu Xu.

At least 37 records · Page 2Linked to original sources

arXiv2025

CodeVision: Detecting LLM-Generated Code Using 2D Token Probability Maps and Vision Models

The rise of large language models (LLMs) like ChatGPT has significantly improved automated code generation, enhancing software development efficiency. However, this introduces challenges in academia, particularly in distinguishing between human-written and LLM-generated code, which complicates issues of academic integrity. Existing detection methods, such as pre-trained models and watermarking, face limitations in adaptability and computational efficiency. In this paper, we propose a novel detection method using 2D token probability maps combined with vision models, preserving spatial code structures such as indentation and brackets. By transforming code into log probability matrices and applying vision models like Vision Transformers (ViT) and ResNet, we capture both content and structure for more accurate detection. Our method shows robustness across multiple programming languages and improves upon traditional detectors, offering a scalable and computationally efficient solution for identifying LLM-generated code.

cs.SE↗

arXiv2024

Logic Error Localization in Student Programming Assignments Using Pseudocode and Graph Neural Networks

Pseudocode is extensively used in introductory programming courses to instruct computer science students in algorithm design, utilizing natural language to define algorithmic behaviors. This learning approach enables students to convert pseudocode into source code and execute it to verify their algorithms' correctness. This process typically introduces two types of errors: syntax errors and logic errors. Syntax errors are often accompanied by compiler feedback, which helps students identify incorrect lines. In contrast, logic errors are more challenging because they do not trigger compiler errors and lack immediate diagnostic feedback, making them harder to detect and correct. To address this challenge, we developed a system designed to localize logic errors within student programming assignments at the line level. Our approach utilizes pseudocode as a scaffold to build a code-pseudocode graph, connecting symbols from the source code to their pseudocode counterparts. We then employ a graph neural network to both localize and suggest corrections for logic errors. Additionally, we have devised a method to efficiently gather logic-error-prone programs during the syntax error correction process and compile these into a dataset that includes single and multiple line logic errors, complete with indices of the erroneous lines. Our experimental results are promising, demonstrating a localization accuracy of 99.2% for logic errors within the top-10 suspected lines, highlighting the effectiveness of our approach in enhancing students' coding proficiency and error correction skills.

cs.CY↗

arXiv2024

LecPrompt: A Prompt-based Approach for Logical Error Correction with CodeBERT

Logical errors in programming don't raise compiler alerts, making them hard to detect. These silent errors can disrupt a program's function or cause run-time issues. Their correction requires deep insight into the program's logic, highlighting the importance of automated detection and repair. In this paper, we introduce LecPrompt to localize and repair logical errors, an prompt-based approach that harnesses the capabilities of CodeBERT, a transformer-based large language model trained on code. First, LecPrompt leverages a large language model to calculate perplexity and log probability metrics, pinpointing logical errors at both token and line levels. Through statistical analysis, it identifies tokens and lines that deviate significantly from the expected patterns recognized by large language models, marking them as potential error sources. Second, by framing the logical error correction challenge as a Masked Language Modeling (MLM) task, LecPrompt employs CodeBERT to autoregressively repair the identified error tokens. Finally, the soft-prompt method provides a novel solution in low-cost scenarios, ensuring that the model can be fine-tuned to the specific nuances of the logical error correction task without incurring high computational costs. To evaluate LecPrompt's performance, we created a method to introduce logical errors into correct code and applying this on QuixBugs to produce the QuixBugs-LE dataset. Our evaluations on the QuixBugs-LE dataset for both Python and Java highlight the impressive capabilities of our method, LecPrompt. For Python, LecPrompt achieves a noteworthy 74.58% top-1 token-level repair accuracy and 27.4% program-level repair accuracy. In Java, LecPrompt delivers a 69.23\% top-1 token-level repair accuracy and 24.7% full program-level repair accuracy.

cs.SE↗

arXiv2024

Signal Watermark on Large Language Models

As Large Language Models (LLMs) become increasingly sophisticated, they raise significant security concerns, including the creation of fake news and academic misuse. Most detectors for identifying model-generated text are limited by their reliance on variance in perplexity and burstiness, and they require substantial computational resources. In this paper, we proposed a watermarking method embedding a specific watermark into the text during its generation by LLMs, based on a pre-defined signal pattern. This technique not only ensures the watermark's invisibility to humans but also maintains the quality and grammatical integrity of model-generated text. We utilize LLMs and Fast Fourier Transform (FFT) for token probability computation and detection of the signal watermark. The unique application of signal processing principles within the realm of text generation by LLMs allows for subtle yet effective embedding of watermarks, which do not compromise the quality or coherence of the generated text. Our method has been empirically validated across multiple LLMs, consistently maintaining high detection accuracy, even with variations in temperature settings during text generation. In the experiment of distinguishing between human-written and watermarked text, our method achieved an AUROC score of 0.97, significantly outperforming existing methods like GPTZero, which scored 0.64. The watermark's resilience to various attacking scenarios further confirms its robustness, addressing significant challenges in model-generated text authentication.

cs.CR↗

arXiv2024

FreqMark: Frequency-Based Watermark for Sentence-Level Detection of LLM-Generated Text

The increasing use of Large Language Models (LLMs) for generating highly coherent and contextually relevant text introduces new risks, including misuse for unethical purposes such as disinformation or academic dishonesty. To address these challenges, we propose FreqMark, a novel watermarking technique that embeds detectable frequency-based watermarks in LLM-generated text during the token sampling process. The method leverages periodic signals to guide token selection, creating a watermark that can be detected with Short-Time Fourier Transform (STFT) analysis. This approach enables accurate identification of LLM-generated content, even in mixed-text scenarios with both human-authored and LLM-generated segments. Our experiments demonstrate the robustness and precision of FreqMark, showing strong detection capabilities against various attack scenarios such as paraphrasing and token substitution. Results show that FreqMark achieves an AUC improvement of up to 0.98, significantly outperforming existing detection methods.

cs.CL↗

arXiv2024

Anomalous Enhancement of the Electrocatalytic Hydrogen Evolution Reaction in AuPt Nanoclusters

Energy- and resource-efficient electrocatalytic water splitting is of paramount importance to enable sustainable hydrogen production. The best bulk catalyst for the hydrogen evolution reaction (HER), i.e., platinum, is one of the scarcest elements on Earth. The use of raw material for HER can be dramatically reduced by utilizing nanoclusters. In addition, nanoalloying can further improve the performance of these nanoclusters. In this paper, we present results for HER on nanometer-sized ligand-free AuPt nanoclusters grafted on carbon nanotubes. These results demonstrate excellent monodispersity and a significant reduction of the overpotential for the electrocatalytic HER. We utilize atomistic machine learning techniques to elucidate the atomic-scale origin of the synergistic effect between Pt and Au. We show that the presence of surface Au atoms, known to be poor HER catalysts, in a Pt(core)/AuPt(shell) nanocluster structure, drives an anomalous enhancement of the inherently high catalytic activity of Pt atoms.

physics.chem-ph↗

arXiv2024

Single-Atom Verification of the Optimal Trade-Off between Speed and Cost in Shortcuts to Adiabaticity

The approach of shortcuts to adiabaticity enables the effective execution of adiabatic dynamics in quantum information processing with enhanced speed. Owing to the inherent trade-off between dynamical speed and the cost associated with the transitionless driving field, executing arbitrarily fast operations becomes impractical. To understand the accurate interplay between speed and energetic cost in this process, we propose theoretically and verify experimentally a new trade-off, which is characterized by a tightly optimized bound within $s$-parameterized phase spaces. Our experiment is carried out in a single ultracold $^{40}$Ca$^{+}$ ion trapped in a harmonic potential. By exactly operating the quantum states of the ion, we execute the Landau-Zener model as an example, where the quantum speed limit as well as the cost are governed by the spectral gap. We witness that our proposed trade-off is indeed tight in scenarios involving both initially eigenstates and initially thermal equilibrium states. Our work helps understanding the fundamental constraints in shortcuts to adiabaticity and illuminates the potential of under-utilized phase spaces that have been traditionally overlooked.

quant-ph↗

arXiv2024

Decoherence rate in random Lindblad dynamics

Open quantum systems undergo decoherence, which is responsible for the transition from quantum to classical behavior. The time scale in which decoherence takes place can be analyzed using upper limits to its rate. We examine the dynamics of open chaotic quantum systems governed by random Lindblad operators sourced from Gaussian and Ginibre ensembles with Wigner-Dyson symmetry classes. In these systems, the ensemble-averaged purity decays monotonically as a function of time. This decay is governed by the decoherence rate, which is upper-bounded by the dimension of their Hilbert space and is independent of the ensemble symmetry. These findings hold upon mixing different ensembles, indicating the universal character of the decoherence rate limit. Moreover, our findings reveal that open chaotic quantum systems governed by random Lindbladians tend to exhibit the most rapid decoherence, regardless of the initial state. This phenomenon is associated with the concentration of the decoherence rate near its upper bound. Our work identifies primary features of decoherence in dissipative quantum chaos, with applications ranging from quantum foundations to high-energy physics and quantum technologies.

quant-ph↗

arXiv2024

A New Method in Facial Registration in Clinics Based on Structure Light Images

Background and Objective: In neurosurgery, fusing clinical images and depth images that can improve the information and details is beneficial to surgery. We found that the registration of face depth images was invalid frequently using existing methods. To abundant traditional image methods with depth information, a method in registering with depth images and traditional clinical images was investigated. Methods: We used the dlib library, a C++ library that could be used in face recognition, and recognized the key points on faces from the structure light camera and CT image. The two key point clouds were registered for coarse registration by the ICP method. Fine registration was finished after coarse registration by the ICP method. Results: RMSE after coarse and fine registration is as low as 0.995913 mm. Compared with traditional methods, it also takes less time. Conclusions: The new method successfully registered the facial depth image from structure light images and CT with a low error, and that would be promising and efficient in clinical application of neurosurgery.

cs.CV↗

arXiv2023

Can Large Language Models Be Good Companions? An LLM-Based Eyewear System with Conversational Common Ground

Developing chatbots as personal companions has long been a goal of artificial intelligence researchers. Recent advances in Large Language Models (LLMs) have delivered a practical solution for endowing chatbots with anthropomorphic language capabilities. However, it takes more than LLMs to enable chatbots that can act as companions. Humans use their understanding of individual personalities to drive conversations. Chatbots also require this capability to enable human-like companionship. They should act based on personalized, real-time, and time-evolving knowledge of their owner. We define such essential knowledge as the \textit{common ground} between chatbots and their owners, and we propose to build a common-ground-aware dialogue system from an LLM-based module, named \textit{OS-1}, to enable chatbot companionship. Hosted by eyewear, OS-1 can sense the visual and audio signals the user receives and extract real-time contextual semantics. Those semantics are categorized and recorded to formulate historical contexts from which the user's profile is distilled and evolves over time, i.e., OS-1 gradually learns about its user. OS-1 combines knowledge from real-time semantics, historical contexts, and user-specific profiles to produce a common-ground-aware prompt input into the LLM module. The LLM's output is converted to audio, spoken to the wearer when appropriate.We conduct laboratory and in-field studies to assess OS-1's ability to build common ground between the chatbot and its user. The technical feasibility and capabilities of the system are also evaluated. OS-1, with its common-ground awareness, can significantly improve user satisfaction and potentially lead to downstream tasks such as personal emotional support and assistance.

cs.HC↗

arXiv2023

Quantum speed limits in arbitrary phase spaces

Quantum speed limits (QSLs) provide an upper bound for the speed of evolution of quantum states in any physical process. Based on the Stratonovich-Weyl correspondence, we derive a universal QSL bound in arbitrary phase spaces that is applicable for both continuous variable systems and finite-dimensional discrete quantum systems. This QSL bound allows the determination of speed limit bounds in specific phase spaces that are tighter than those in Wigner phase space or Hilbert space under the same metric, as illustrated by several typical examples, e.g., a single-mode free field and $N$-level quantum systems in phase spaces. This QSL bound also provides an experimentally realizable way to examine the speed limit in phase spaces relevant to applications in quantum information and quantum optics.

quant-ph↗

arXiv2023

Non-Hermitian Hamiltonian Deformations in Quantum Mechanics

The construction of exactly-solvable models has recently been advanced by considering integrable $T\bar{T}$ deformations and related Hamiltonian deformations in quantum mechanics. We introduce a broader class of non-Hermitian Hamiltonian deformations in a nonrelativistic setting, to account for the description of a large class of open quantum systems, which includes, e.g., arbitrary Markovian evolutions conditioned to the absence of quantum jumps. We relate the time evolution operator and the time-evolving density matrix in the undeformed and deformed theories in terms of integral transforms with a specific kernel. Non-Hermitian Hamiltonian deformations naturally arise in the description of energy diffusion that emerges in quantum systems from time-keeping errors in a real clock used to track time evolution. We show that the latter can be related to an inverse $T\bar{T}$ deformation with a purely imaginary deformation parameter. In this case, the integral transforms take a particularly simple form when the initial state is a coherent Gibbs state or a thermofield double state, as we illustrate by characterizing the purity, Rényi entropies, logarithmic negativity, and the spectral form factor. As the dissipative evolution of a quantum system can be conveniently described in Liouville space, we further discuss the spectral properties of the Liouvillians, i.e., the dynamical generators associated with the deformed theories. As an application, we discuss the interplay between decoherence and quantum chaos in non-Hermitian deformations of random matrix Hamiltonians and the Sachdev-Ye-Kitaev model.

hep-th↗

arXiv2022

Plasmonic and metamaterial biosensors: A game-changer for virus detection

One of the most important processes in the fight against current and future pandemics is the rapid diagnosis and initiation of treatment of viruses in humans. In these times, the development of high-sensitivity tests and diagnostic kits is an important research area. Plasmonic platforms, which control light in subwavelength volumes, have opened up exciting prospects for biosensing applications. Their significant sensitivity and selectivity allow for the non-invasive and rapid detection of viruses. In particular, plasmonic-assisted virus detection platforms can be achieved by various approaches, including propagating surface and localized plasmon resonances, as well as surface-enhanced Raman spectroscopy. In this review, we discuss both the fundamental principles governing a plasmonic biosensor and prospects for achieving improved sensor performance. We highlight several nanostructure schemes to combat virus-related diseases. We also examine technological limitations and challenges of plasmonic-based biosensing, such as reducing the overall cost and handling of complex biological samples. Finally, we provide a future prospective for opportunities to improve plasmonic-based approaches to increase their impact on global health issues.

physics.optics↗

arXiv2022

Spectral Filtering Induced by Non-Hermitian Evolution with Balanced Gain and Loss: Enhancing Quantum Chaos

The dynamical signatures of quantum chaos in an isolated system are captured by the spectral form factor, which exhibits as a function of time a dip, a ramp, and a plateau, with the ramp being governed by the correlations in the level spacing distribution. While decoherence generally suppresses these dynamical signatures, the nonlinear non-Hermitian evolution with balanced gain and loss (BGL) in an energy-dephasing scenario can enhance manifestations of quantum chaos. In the Sachdev-Ye-Kitaev model and random matrix Hamiltonians, BGL increases the span of the ramp, lowering the dip as well as the value of the plateau, providing an experimentally realizable physical mechanism for spectral filtering. The chaos enhancement due to BGL is optimal over a family of filter functions that can be engineered with fluctuating Hamiltonians.

quant-ph↗

arXiv2022

Probing quantum chaos in multipartite systems

Understanding the emergence of quantum chaos in multipartite systems is challenging in the presence of interactions. We show that the contribution of the subsystems to the global behavior can be revealed by probing the full counting statistics of the local, total, and interaction energies. As in the spectral form factor, signatures of quantum chaos in the time domain dictate a dip-ramp-plateau structure in the characteristic function, i.e., the Fourier transform of the eigenvalue distribution. With this approach, we explore the fate of chaos in interacting subsystems that are locally maximally chaotic. Global quantum chaos can be suppressed at strong coupling, as illustrated with coupled copies of random-matrix Hamiltonians and of the Sachdev-Ye-Kitaev model. Our method is amenable to experimental implementation using single-qubit interferometry.

quant-ph↗

arXiv2021

VisDrone-CC2020: The Vision Meets Drone Crowd Counting Challenge Results

Crowd counting on the drone platform is an interesting topic in computer vision, which brings new challenges such as small object inference, background clutter and wide viewpoint. However, there are few algorithms focusing on crowd counting on the drone-captured data due to the lack of comprehensive datasets. To this end, we collect a large-scale dataset and organize the Vision Meets Drone Crowd Counting Challenge (VisDrone-CC2020) in conjunction with the 16th European Conference on Computer Vision (ECCV 2020) to promote the developments in the related fields. The collected dataset is formed by $3,360$ images, including $2,460$ images for training, and $900$ images for testing. Specifically, we manually annotate persons with points in each video frame. There are $14$ algorithms from $15$ institutes submitted to the VisDrone-CC2020 Challenge. We provide a detailed analysis of the evaluation results and conclude the challenge. More information can be found at the website: \url{http://www.aiskyeye.com/}.

cs.CV↗

arXiv2021

A High-Performance, Reconfigurable, Fully Integrated Time-Domain Reflectometry Architecture Using Digital I/Os

Time-domain reflectometry (TDR) is an established means of measuring impedance inhomogeneity of a variety of waveguides, providing critical data necessary to characterize and optimize the performance of high-bandwidth computational and communication systems. However, TDR systems with both the high spatial resolution (sub-cm) and voltage resolution (sub-$\muV$) required to evaluate high-performance waveguides are physically large and often cost-prohibitive, severely limiting their utility as testing platforms and greatly limiting their use in characterizing and trouble-shooting fielded hardware. Consequently, there exists a growing technical need for an electronically simple, portable, and low-cost TDR technology. The receiver of a TDR system plays a key role in recording reflection waveforms; thus, such a receiver must have high analog bandwidth, high sampling rate, and high-voltage resolution. However, these requirements are difficult to meet using low-cost analog-to-digital converters (ADCs). This article describes a new TDR architecture, namely, jitter-based APC (JAPC), which obviates the need for external components based on an alternative concept, analog-to-probability conversion (APC) that was recently proposed. These results demonstrate that a fully reconfigurable and highly integrated TDR (iTDR) can be implemented on a field-programmable gate array (FPGA) chip without using any external circuit components. Empirical evaluation of the system was conducted using an HDMI cable as the device under test (DUT), and the resulting impedance inhomogeneity pattern (IIP) of the DUT was extracted with spatial and voltage resolutions of 5 cm and 80 $\muV$, respectively. These results demonstrate the feasibility of using the prototypical JAPC-based iTDR for real-world waveguide characterization applications

eess.SP↗

arXiv2021

PHI-MVS: Plane Hypothesis Inference Multi-view Stereo for Large-Scale Scene Reconstruction

PatchMatch based Multi-view Stereo (MVS) algorithms have achieved great success in large-scale scene reconstruction tasks. However, reconstruction of texture-less planes often fails as similarity measurement methods may become ineffective on these regions. Thus, a new plane hypothesis inference strategy is proposed to handle the above issue. The procedure consists of two steps: First, multiple plane hypotheses are generated using filtered initial depth maps on regions that are not successfully recovered; Second, depth hypotheses are selected using Markov Random Field (MRF). The strategy can significantly improve the completeness of reconstruction results with only acceptable computing time increasing. Besides, a new acceleration scheme similar to dilated convolution can speed up the depth map estimating process with only a slight influence on the reconstruction. We integrated the above ideas into a new MVS pipeline, Plane Hypothesis Inference Multi-view Stereo (PHI-MVS). The result of PHI-MVS is validated on ETH3D public benchmarks, and it demonstrates competing performance against the state-of-the-art.

cs.CV↗