Source author record

Kang Yang

Kang Yang appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

20works
19topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

20 published item(s)

preprint2026arXiv

AdaptEval: A Benchmark for Evaluating Large Language Models on Code Snippet Adaptation

Recent advancements in large language models (LLMs) have automated various software engineering tasks, with benchmarks emerging to evaluate their capabilities. However, for adaptation, a critical activity during code reuse, there is no benchmark to assess LLMs' performance, leaving their practical utility in this area unclear. To fill this gap, we propose AdaptEval, a benchmark designed to evaluate LLMs on code snippet adaptation. Unlike existing benchmarks, AdaptEval incorporates the following three distinctive features: First, Practical Context. Tasks in AdaptEval are derived from developers' practices, preserving rich contextual information from Stack Overflow and GitHub communities. Second, Multi-granularity Annotation. Each task is annotated with requirements at both task and adaptation levels, supporting the evaluation of LLMs across diverse adaptation scenarios. Third, Fine-grained Evaluation. AdaptEval includes a two-tier testing framework combining adaptation-level and function-level tests, which enables evaluating LLMs' performance across various individual adaptations. Based on AdaptEval, we conduct the first empirical study to evaluate six instruction-tuned LLMs and especially three reasoning LLMs on code snippet adaptation. Experimental results demonstrate that AdaptEval enables the assessment of LLMs' adaptation capabilities from various perspectives. It also provides critical insights into their current limitations, particularly their struggle to follow explicit instructions. We hope AdaptEval can facilitate further investigation and enhancement of LLMs' capabilities in code snippet adaptation, supporting their real-world applications.

preprint2026arXiv

Benchmarking Spatiotemporal Reasoning in LLMs and Reasoning Models: Capabilities and Challenges

Spatiotemporal reasoning plays a key role in Cyber-Physical Systems (CPS). Despite advances in Large Language Models (LLMs) and Large Reasoning Models (LRMs), their capacity to reason about complex spatiotemporal signals remains underexplored. This paper proposes a hierarchical SpatioTemporal reAsoning benchmaRK, STARK, to systematically evaluate LLMs across three levels of reasoning complexity: state estimation (e.g., predicting field variables, localizing and tracking events in space and time), spatiotemporal reasoning over states (e.g., inferring spatial-temporal relationships), and world-knowledge-aware reasoning that integrates contextual and domain knowledge (e.g., intent prediction, landmark-aware navigation). We curate 26 distinct spatiotemporal tasks with diverse sensor modalities, comprising 14,552 challenges where models answer directly or by Python Code Interpreter. Evaluating 3 LRMs and 8 LLMs, we find LLMs achieve limited success in tasks requiring geometric reasoning (e.g., multilateration or triangulation), particularly as complexity increases. Surprisingly, LRMs show robust performance across tasks with various levels of difficulty, often competing or surpassing traditional first-principle-based methods. Our results show that in reasoning tasks requiring world knowledge, the performance gap between LLMs and LRMs narrows, with some LLMs even surpassing LRMs. However, the LRM o3 model continues to achieve leading performance across all evaluated tasks, a result attributed primarily to the larger size of the reasoning models. STARK motivates future innovations in model architectures and reasoning paradigms for intelligent CPS by providing a structured framework to identify limitations in the spatiotemporal reasoning of LLMs and LRMs.

preprint2026arXiv

BOLT: Online Lightweight Adaptation for Preparation-Free Heterogeneous Cooperative Perception

Most existing heterogeneous cooperative perception methods depend on prior preparation like offline joint training or tailored collaborator-model adaptation. Such preprocessing is, however, generally impractical in real scenarios, as agents are usually independently trained by different developers and meet occasionally online. This work investigates \emph{preparation-free heterogeneous cooperative perception}, where agents use independently trained single-agent detectors without any pre-deployment coordination. We find direct cross-agent fusion under this setting greatly underperforms ego-only perception. We present BOLT, a lightweight plug-and-play module that adapts neighboring features online via ego-as-teacher distillation, requiring only ego predictions without ground-truth labels. BOLT leverages high-confidence ego perception features to guide cross-agent feature-domain alignment, while enabling neighbors to contribute features in the ego's low-confidence regions. With only 0.9M trainable parameters, BOLT improves AP@50 by up to 32.3 points over vanilla unadapted fusion in the preparation-free setting. It consistently outperforms ego-only results on DAIR-V2X and OPV2V, across different encoder pairs and fusion strategies. Code: https://github.com/sidiangongyuan/BOLT.

preprint2026arXiv

Coding in a Bubble? Evaluating LLMs in Resolving Context Adaptation Bugs During Code Adaptation

Code adaptation is a fundamental but challenging task in software development, requiring developers to modify existing code for new contexts. A key challenge is to resolve Context Adaptation Bugs (CtxBugs), which occurs when code correct in its original context violates constraints in the target environment. Unlike isolated bugs, CtxBugs cannot be resolved through local fixes and require cross-context reasoning to identify semantic mismatches. Overlooking them may lead to critical failures in adaptation. Although Large Language Models (LLMs) show great potential in automating code-related tasks, their ability to resolve CtxBugs remains a significant and unexplored obstacle to their practical use in code adaptation. To bridge this gap, we propose CtxBugGen, a novel framework for generating CtxBugs to evaluate LLMs. Its core idea is to leverage LLMs' tendency to generate plausible but context-free code when contextual constraints are absent. The framework generates CtxBugs through a four-step process to ensure their relevance and validity: (1) Adaptation Task Selection, (2) Task-specific Perturbation,(3) LLM-based Variant Generation and (4) CtxBugs Identification. Based on the benchmark constructed by CtxBugGen, we conduct an empirical study with four state-of-the-art LLMs. Our results reveal their unsatisfactory performance in CtxBug resolution. The best performing LLM, Kimi-K2, achieves 55.93% on Pass@1 and resolves just 52.47% of CtxBugs. The presence of CtxBugs degrades LLMs' adaptation performance by up to 30%. Failure analysis indicates that LLMs often overlook CtxBugs and replicate them in their outputs. Our study highlights a critical weakness in LLMs' cross-context reasoning and emphasize the need for new methods to enhance their context awareness for reliable code adaptation.

preprint2026arXiv

On the (In-)Security of the Shuffling Defense in the Transformer Secure Inference

For Transformer models, cryptographically secure inference ensures that the client learns only the final output, while the server learns nothing about the client's input. However, securely computing nonlinear layers remains a major efficiency bottleneck due to the substantial communication rounds and data transmission required. To address this issue, prior works reveal intermediate activations to the client, allowing nonlinear operations to be computed in plaintext. Although this approach significantly improves efficiency, exposing activations enables adversaries to extract model weights. To mitigate this risk, existing works employ a shuffling defense that reveals only randomly permuted activations to the client. In this work, we show that the shuffling defense is not as robust as previously claimed. We propose an attack that aligns differently shuffled activations to a common permutation and subsequently exploits them to extract model weights. Experiments on Pythia-70m and GPT-2 demonstrate that the proposed attack can align shuffled activations with mean squared errors ranging from $10^{-9}$ to $10^{-6}$. With a query cost of approximately \$1, the adversary can recover model weights with L1-norm differences ranging from $10^{-4}$ to $10^{-2}$ compared to the oracle weights.

preprint2026arXiv

Stable boundary modes for fragile topology from spontaneous PT-symmetry breaking

Two-dimensional topological insulators protected by nonlocal symmetries or with fragile topology usually do not admit robust in-gap edge modes due to the incompatibility between the symmetry and the boundary. Here, we show that in a parity-time (PT) symmetric system robust in-gap topological edge modes can be stably induced by non-Hermitian couplings that spontaneously break the PT symmetry of the eigenstates. The topological edge modes traverse the imaginary spectral gap between a pair of fragile topological bands, which is opened by the presence of the non-Hermitian perturbation. We demonstrate that the net number of resulting in-gap modes is protected by an operator version of anomaly cancellation that extends beyond the Hermitian limit. The results imply that loss and gain can in principle drive fragile topological phenomena to stable topological phenomena.

preprint2022arXiv

Binary Neural Networks as a general-propose compute paradigm for on-device computer vision

For binary neural networks (BNNs) to become the mainstream on-device computer vision algorithm, they must achieve a superior speed-vs-accuracy tradeoff than 8-bit quantization and establish a similar degree of general applicability in vision tasks. To this end, we propose a BNN framework comprising 1) a minimalistic inference scheme for hardware-friendliness, 2) an over-parameterized training scheme for high accuracy, and 3) a simple procedure to adapt to different vision tasks. The resultant framework overtakes 8-bit quantization in the speed-vs-accuracy tradeoff for classification, detection, segmentation, super-resolution and matching: our BNNs not only retain the accuracy levels of their 8-bit baselines but also showcase 1.3-2.4$\times$ faster FPS on mobile CPUs. Similar conclusions can be drawn for prototypical systolic-array-based AI accelerators, where our BNNs promise 2.8-7$\times$ fewer execution cycles than 8-bit and 2.1-2.7$\times$ fewer cycles than alternative BNN designs. These results suggest that the time for large-scale BNN adoption could be upon us.

preprint2022arXiv

PFGDF: Pruning Filter via Gaussian Distribution Feature for Deep Neural Networks Acceleration

Deep learning has achieved impressive results in many areas, but the deployment of edge intelligent devices is still very slow. To solve this problem, we propose a novel compression and acceleration method based on data distribution characteristics for deep neural networks, namely Pruning Filter via Gaussian Distribution Feature (PFGDF). Compared with previous advanced pruning methods, PFGDF compresses the model by filters with insignificance in distribution, regardless of the contribution and sensitivity information of the convolution filter. PFGDF is significantly different from weight sparsification pruning because it does not require the special accelerated library to process the sparse weight matrix and introduces no more extra parameters. The pruning process of PFGDF is automated. Furthermore, the model compressed by PFGDF can restore the same performance as the uncompressed model. We evaluate PFGDF through extensive experiments, on CIFAR-10, PFGDF compresses the convolution filter on VGG-16 by 66.62% with more than 90% parameter reduced, while the inference time is accelerated by 83.73% on Huawei MATE 10.

preprint2022arXiv

Topological Lattice Models with Constant Berry Curvature

Band geometry plays a substantial role in topological lattice models. The Berry curvature, which resembles the effect of magnetic field in reciprocal space, usually fluctuates throughout the Brillouin zone. Motivated by the analogy with Landau levels, constant Berry curvature has been suggested as an ideal condition for realizing fractional Chern insulators. Here we show that while the Berry curvature cannot be made constant in a topological two-band model, lattice models with three or more degrees of freedom per unit cell can support exactly constant Berry curvature. However, contrary to the intuitive expectation, we find that making the Berry curvature constant does not always improve the properties of bosonic fractional Chern insulator states. In fact, we show that an "ideal flatband" cannot have constant Berry curvature, equivalently, we show that the density algebra of Landau levels cannot be realised in any tight-binding lattice system.

preprint2021arXiv

Exceptional Spin Liquids from Couplings to the Environment

We establish the appearance of a qualitatively new type of spin liquid with emergent exceptional points when coupling to the environment. We consider an open system of the Kitaev honeycomb model generically coupled to an external environment. In extended parameter regimes, the Dirac points of the emergent Majorana fermions from the original model are split into exceptional points with Fermi arcs connecting them. In glaring contrast to the original gapless phase of the honeycomb model which requires time-reversal symmetry, this new phase is stable against all perturbations. The system also displays a large sensitivity to boundary conditions resulting from the non-Hermitian skin effect with telltale experimental consequences. Our results point to the emergence of new classes of spin liquids in open systems which might be generically realized due to unavoidable couplings with the environment.

preprint2021arXiv

Study on the Data Processing of the IOT Sensor Network Based on Hadoop Cloud Platform and TWLGA Scheduling Algorithm

The Internet of Things (IOT) sensor network is an effective solution for monitoring environment condition. IOT sensor network generates massive data, and the abilities of massive data storage, processing and query become technical challenges. To solve the problem, a Hadoop cloud platform is proposed. With the help of time and workload genetic algorithm (TWLGA), the data processing platform provides the work of one node to share with others, which not only raises efficiency of one single node, but also provides the compatibility support to reduce the possible risk of software and hardware. In the experiment, a Hadoop cluster platform with TWLGA scheduling algorithm is built, and the performance of the platform is tested. The results show that the Hadoop cloud platform is suitable for big data processing of the IOT sensor network.

preprint2020arXiv

Collective excitations of quantum Hall states under tilted magnetic field

We study the neutral excitations of fractional quantum Hall states in electronic systems of finite width where an external anisotropy is introduced by tilting the magnetic field. As in the isotropic case, the neutral collective excitation can be worked out through the conserving method of composite fermions in the Hamiltonian theory because the interaction potential has a natural cutoff due to the quantum well width. We show how such a computation can be carried out perturbatively for an anisotropic interaction. We find that unlike the charge gap, the neutral collective gap is much more sensitive to the tilt and can thus, for certain fractional quantum Hall states, be easily destroyed by the parallel component of the magnetic field. We also discuss the convergence of the collective spectrum to the activation gap in the large-momentum limit.

preprint2020arXiv

Helium Incorporation Stabilized Direct-gap Silicides

The search of direct-gap Si-based semiconductors is of great interest due to the potential application in many technologically relevant fields. This work examines the incorporation of He as a possible route to form a direct band gap in Si. Structure predictions and first-principles calculations have shown that He reacts with Si at high pressure, to form the stable compounds Si2He and Si3He. Both compounds have host-guest structures consisting of a channel-like Si host framework filled with He guest atoms. The Si frameworks in two compounds could be persisted to ambient pressure after removal of He, forming two pure Si allotropes. Both Si-He compounds and both Si allotropes exhibit direct or quasi-direct band gaps of 0.84-1.34 eV, close to the optimal value (~1.3 eV) for solar cell applications. Analysis shows that Si2He with an electric-dipole-transition allowed band gap possesses higher absorption capacity than diamond cubic Si, which makes it to be a promising candidate material for thin-film solar cell.

preprint2016arXiv

The mutual energy current interpretation for quantum mechanics

Quantum physics has the probability interpretation. From the knowledge of light, we know that wave is always spread out, and hence the electron wave should also spread out. That means the electron wave beam should like the light wave beam become diverged from the source. When the electron is received by an atom we thought the wave collapse. The place to collapse is depends on the probability calculated from the square of absolute value of the wave function. The recent new discovery tell us that the light is not just wave, it is a combination of waves, retarded potential and advanced potential. These two potentials together produce the mutual energy current or referred as M-current. Another light energy current is P-current related to Poynting vector. We found P-current doesn't carry any energy for light. The contribution of P-current to energy transfer can be omitted. The light energy is transferred only by M-current. The beam of M-current doesn't like the beam of P-current which is diverged from the source, instead, the M-current beam first diverges from a source and then converged to a sink. Since the M-current at the place to be received is localized at one electron, the concept of wave function collapse is needless. The probability results of light is because that we have use P-current to roughly calculate the M-current. We thought if Schrödinger knew today's light theory, he would for sure also build his wave theory for quantum mechanics similar to the new light theory with M-current. Hence we claim that the M-current theory is not only suitable to the light but also can be applied to the quantum physics. This means all particles are M-current. The M-current is composed of not only the retarded wave, but also the advanced wave. M-current is an inner product of a retarded and an advanced waves.

preprint2015arXiv

A lattice Boltzmann method for binary fluids based on mass-conserved quasi-incompressible phase-field theory

In this paper, a lattice Boltzmann equation (LBE) model is proposed for binary fluids based on a quasi-incompressible phase-field model [J. Shen et al, Comm. Comp. Phys. 13, 1045 (2013)]. Compared with the other incompressible LBE models based on the incompressible phase-field theory, the quasi-incompressible model conserves mass locally. A series of numerical simulations are performed to validate the proposed model, and comparisons with an incompressible LBE model [H. Liang et al, Phys. Rev. E 89, 053320 (2014)] are also carried out. It is shown that the proposed model can track the interface accurately, and the predictions by the quasi-incompressible and incompressible models agree qualitatively well as the distribution of chemical potential is uniform, otherwise differ significantly.

preprint2015arXiv

The modified Poynting theorem and the concept of mutual energy

The goal of this article is to derive the reciprocity theorem, mutual energy theorem from Poynting theorem instead of from Maxwell equation. The Poynting theorem is generalized to the modified Poynting theorem. In the modified Poynting theorem the electromagnetic field is superimposition of different electromagnetic fields including the retarded potential and advanced potential, time-offset field. The media epsilon (permittivity) and mu (permeability) can also be different in the different fields. The concept of mutual energy is introduced which is the difference between the total energy and self-energy. Mixed mutual energy theorem is derived. We derive the mutual energy from Fourier domain. We obtain the time-reversed mutual energy theorem and the mutual energy theorem. Then we derive the mutual energy theorem in time-domain. The instantaneous modified mutual energy theorem is derived. Applying time-offset transform and time integral to the instantaneous modified mutual energy theorem, the time-correlation modified mutual energy theorem is obtained. Assume there are two electromagnetic fields one is retarded potential and one is advanced potential, the convolution reciprocity theorem can be derived. Corresponding to the modified time-correlation mutual energy theorem and the time-convolution reciprocity theorem in Fourier domain, there is the modified mutual energy theorem and the Lorentz reciprocity theorem. Hence all mutual energy theorem and the reciprocity theorems are put in one frame of the concept of the mutual energy. 3 new Complementary theorems are derived. The inner product is introduced for two different electromagnetic fields in both time domain and Fourier domain for the application of the wave expansion.

preprint2014arXiv

An extension of Mantel's theorem to random 4-uniform hypergraphs

A sparse version of Mantel's Theorem is that, for sufficiently large $p$, with high probability (w.h.p.), every maximum triangle-free subgraph of $G(n,p)$ is bipartite. DeMarco and Kahn proved this for $p>K \sqrt{\log n/n}$ for some constant $K$, and apart from the value of the constant, this bound is the best possible. Denote by $T_3$ the 3-uniform hypergraph with vertex set $\{a,b,c,d,e\}$ and edge set $\{abc,ade,bde\}$. Frankl and Füredi showed that the maximum 3-uniform hypergraph on $n$ vertices containing no copy of $T_3$ is tripartite for $n> 3000$. For some integer $k$, let $G^k(n,p)$ be the random $k$-uniform hypergraph. Balogh et al. proved that for $p>K \log n/n$ for some constant $K$, every maximum $T_3$-free subhypergraph of $G^3(n,p)$ w.h.p. is tripartite and it does not hold when $p=0.1 \sqrt{\log n}/n$. Denote by $T_4$ the 4-uniform hypergraph with vertex set $\{1,2,3,4,5,6,7\}$ and edge set $\{1234,1235,4567\}$. Pikhurko proved that there is an $n_0$ such that for all $n\ge n_0$, the maximum 4-uniform hypergraph on $n$ vertices containing no copy of $T_4$ is 4-partite. In this paper, we extend this type of extremal problem in random 4-uniform hypergraphs. We show that for some constant $K$ and $p>K \log n/n$, w.h.p. every maximum $T_4$-free subhypergraph of $G^4(n,p)$ is 4-partite.

preprint2013arXiv

Graphs with $4$-rainbow index $3$ and $n-1$

Let $G$ be a nontrivial connected graph with an edge-coloring $c:E(G)\rightarrow \{1,2,\ldots,q\},$ $q\in \mathbb{N}$, where adjacent edges may be colored the same. A tree $T$ in $G$ is called a $rainbow~tree$ if no two edges of $T$ receive the same color. For a vertex set $S\subseteq V(G)$, a tree that connects $S$ in $G$ is called an {\it $S$-tree}. The minimum number of colors that are needed in an edge-coloring of $G$ such that there is a rainbow $S$-tree for every $k$-set $S$ of $V(G)$ is called the {\it $k$-rainbow index} of $G$, denoted by $rx_k(G)$. Notice that an lower bound and an upper bound of the $k$-rainbow index of a graph with order $n$ is $k-1$ and $n-1$, respectively. Chartrand et al. got that the $k$-rainbow index of a tree with order $n$ is $n-1$ and the $k$-rainbow index of a unicyclic graph with order $n$ is $n-1$ or $n-2$. Li and Sun raised the open problem of characterizing the graphs of order $n$ with $rx_k(G)=n-1$ for $k\geq 3$. In early papers we characterized the graphs of order $n$ with 3-rainbow index 2 and $n-1$. In this paper, we focus on $k=4$, and characterize the graphs of order $n$ with 4-rainbow index 3 and $n-1$, respectively.

preprint2013arXiv

Graphs with 3-rainbow index $n-1$ and $n-2$

Let $G$ be a nontrivial connected graph with an edge-coloring $c:E(G)\rightarrow \{1,2,\ldots,q\},$ $q\in \mathbb{N}$, where adjacent edges may be colored the same. A tree $T$ in $G$ is a $rainbow tree$ if no two edges of $T$ receive the same color. For a vertex set $S\subseteq V(G)$, the tree connecting $S$ in $G$ is called an $S$-tree. The minimum number of colors that are needed in an edge-coloring of $G$ such that there is a rainbow $S$-tree for each $k$-set $S$ of $V(G)$ is called the $k$-rainbow index of $G$, denoted by $rx_k(G)$. In \cite{Zhang}, they got that the $k$-rainbow index of a tree is $n-1$ and the $k$-rainbow index of a unicyclic graph is $n-1$ or $n-2$. So there is an intriguing problem: Characterize graphs with the $k$-rainbow index $n-1$ and $n-2$. In this paper, we focus on $k=3$, and characterize the graphs whose 3-rainbow index is $n-1$ and $n-2$, respectively.

preprint2013arXiv

The 3-rainbow index of a graph

Let $G$ be a nontrivial connected graph with an edge-coloring $c: E(G)\rightarrow \{1,2,...,q\},$ $q \in \mathbb{N}$, where adjacent edges may be colored the same. A tree $T$ in $G$ is a $rainbow tree$ if no two edges of $T$ receive the same color. For a vertex subset $S\subseteq V(G)$, a tree that connects $S$ in $G$ is called an $S$-tree. The minimum number of colors that are needed in an edge-coloring of $G$ such that there is a rainbow $S$-tree for each $k$-subset $S$ of $V(G)$ is called $k$-rainbow index, denoted by $rx_k(G)$. In this paper, we first determine the graphs whose 3-rainbow index equals 2, $m,$ $m-1$, $m-2$, respectively. We also obtain the exact values of $rx_3(G)$ for regular complete bipartite and multipartite graphs and wheel graphs. Finally, we give a sharp upper bound for $rx_3(G)$ of 2-connected graphs and 2-edge connected graphs, and graphs whose $rx_3(G)$ attains the upper bound are characterized.