arXiv subjects

Fei Gu

Publications and source records attributed to Fei Gu.

3 recordsLinked to original sources

arXiv2025

The Matthew Effect of AI Programming Assistants: A Hidden Bias in Software Evolution

AI-assisted programming is rapidly reshaping software development, with large language models (LLMs) enabling new paradigms such as vibe coding and agentic coding. While prior works have focused on prompt design and code generation quality, the broader impact of LLM-driven development on the iterative dynamics of software engineering remains underexplored. In this paper, we conduct large-scale experiments on thousands of algorithmic programming tasks and hundreds of framework selection tasks to systematically investigate how AI-assisted programming interacts with the software ecosystem. Our analysis quantifies a substantial performance asymmetry: mainstream languages and frameworks achieve significantly higher success rates than niche ones. This disparity suggests a feedback loop consistent with the Matthew Effect, where data-rich ecosystems gain superior AI support. While not the sole driver of adoption, current models introduce a non-negligible productivity friction for niche technologies, representing a hidden bias in software evolution.

cs.SE↗

arXiv2024

Radio Frequency Interference Detection Using Efficient Multi-Scale Convolutional Attention UNet

Studying the universe through radio telescope observation is crucial. However, radio telescopes capture not only signals from the universe but also various interfering signals, known as Radio Frequency Interference (RFI). The presence of RFI can significantly impact data analysis. Ensuring the accuracy, reliability, and scientific integrity of research findings by detecting and mitigating or eliminating RFI in observational data, presents a persistent challenge in radio astronomy. In this study, we proposed a novel deep learning model called EMSCA-UNet for RFI detection. The model employs multi-scale convolutional operations to extract RFI features of various scale sizes. Additionally, an attention mechanism is utilized to assign different weights to the extracted RFI feature maps, enabling the model to focus on vital features for RFI detection. We evaluated the performance of the model using real data observed from the 40-meter radio telescope at Yunnan Observatory. Furthermore, we compared our results to other models, including U-Net, RFI-Net, and R-Net, using four commonly employed evaluation metrics: precision, recall, F1 score, and IoU. The results demonstrate that our model outperforms the other models on all evaluation metrics, achieving an average improvement of approximately 5\% compared to U-Net. Our model not only enhances the accuracy and comprehensiveness of RFI detection but also provides more detailed edge detection while minimizing the loss of useful signals.

astro-ph.IM↗

arXiv2020

Joint Storage Allocation and Computation Design for Private Edge Computing

In recent years, edge computing (EC) has attracted great attention for its high-speed computing and low-latency characteristics. However, there are many challenges in the implementation of EC. Firstly, user's privacy has been raised as a major concern because the edge devices may be untrustworthy. In the case of Private Edge Computing (PEC), a user wants to compute a matrix multiplication between its local matrix and one of the matrices in a library, which has been redundantly stored in edge devices. When utilizing resources of edge devices, the privacy requires that each edge device cannot know which matrix stored on it is desired by the user for the multiplication. Secondly, edge devices usually have limited communication and storage resources, which makes it impossible for them to store all matrices in the library. In this paper, we consider the limited resources of edge devices and propose an unified framework for PEC. Within the framework, we study two highly-coupled problems, (1) storage allocation, that determines which matrices are stored on each edge device, and (2) computation design, that determines which matrices (or linear combinations of them) in each edge device are selected to participate in the computing process with the privacy consideration. Specifically, we give a general storage allocation scheme and then design two feasible private computation schemes, i.e., General Private Computation (GPC) scheme and Private Coded Computation (PCC) scheme. In particular, GPC can be applied in general case and PCC can only be applied in special cases, while PCC achieves less communication load. We theoretically analyze the proposed computing schemes and compare them with other schemes. Finally, we conduct extensive simulations to show the effectiveness of the proposed schemes.

cs.DC↗