Source author record

Qingyun Wang

Qingyun Wang 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

15works
16topics
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

15 published item(s)

preprint2026arXiv

When to Think, When to Speak: Learning Disclosure Policies for LLM Reasoning

In single-stream autoregressive interfaces, the same tokens both update the model state and constitute an irreversible public commitment. This coupling creates a silence tax: additional deliberation postpones the first task-relevant content, while naive early streaming risks premature commitments that bias subsequent generations. We introduce Side-by-Side (SxS) Interleaved Reasoning, which makes disclosure timing a controllable decision within standard autoregressive generation. SxS interleaves partial disclosures with continued private reasoning in the same context, but releases content only when it is supported by the reasoning so far. To learn such pacing without incentivizing filler, we construct entailment-aligned interleaved trajectories by matching answer prefixes to supporting reasoning prefixes, then train with SFT to acquire the dual-action semantics and RL to recover reasoning performance under the new format. Across two Qwen3 architectures/scales (MoE Qwen3-30B-A3B, dense Qwen3-4B) and both in-domain (AIME25) and out-of-domain (GPQA-Diamond) benchmarks, SxS improves accuracy--content-latency Pareto trade-offs under token-level proxies such as inter-update waiting.

preprint2022arXiv

A Survey of Knowledge-Enhanced Text Generation

The goal of text generation is to make machines express in human language. It is one of the most important yet challenging tasks in natural language processing (NLP). Since 2014, various neural encoder-decoder models pioneered by Seq2Seq have been proposed to achieve the goal by learning to map input text to output text. However, the input text alone often provides limited knowledge to generate the desired output, so the performance of text generation is still far from satisfaction in many real-world scenarios. To address this issue, researchers have considered incorporating various forms of knowledge beyond the input text into the generation models. This research direction is known as knowledge-enhanced text generation. In this survey, we present a comprehensive review of the research on knowledge enhanced text generation over the past five years. The main content includes two parts: (i) general methods and architectures for integrating knowledge into text generation; (ii) specific techniques and applications according to different forms of knowledge data. This survey can have broad audiences, researchers and practitioners, in academia and industry.

preprint2022arXiv

Discernibility of topological variations for networked LTI systems based on observed output trajectories

In this paper, the possibility of detecting topological variations by observing output trajectories from networked linear time-invariant systems is investigated, where the network topology can be general, but the nodes have identical higher-dimensional dynamics. A necessary and sufficient condition on the discernibility of topological variations is derived, in terms of the eigenspaces of the original and the modified network configuarations. By taking the specific network structures into consideration, some lower-dimensional conditions are derived, which reveal how the network topologies, sensor locations, node-system dynamics and output, as well as inner interactions altogether affect the discernibility. Furthermore, the output discernibility of topological changes for networked multi-agent systems is revisited, showing that some criterion reported in the literature does not hold. Consequently, a modified necessary and sufficient condition is established. The effectiveness of the results is demonstrated through several examples.

preprint2021arXiv

Electroweak Symmetry Non-Restoration from Dark Matter

Restoration of the electroweak symmetry at temperatures around the Higgs mass is linked to tight phenomenological constraints on many baryogenesis scenarios. A potential remedy can be found in mechanisms of electroweak symmetry non-restoration (SNR), in which symmetry breaking is extended to higher temperatures due to new states with couplings to the Standard Model. Here we show that, in the presence of a second Higgs doublet, SNR can be realized with only a handful of new fermions which can be identified as viable dark matter candidates consistent with all current observational constraints. The competing requirements on this class of models allow for SNR at temperatures up to $\sim$TeV, and imply the presence of sub-TeV new physics with sizable interactions with the Standard Model. As a result this scenario is highly testable with signals in reach of next-generation collider and dark matter direct detection experiments.

preprint2020arXiv

Stability of rotation relations in $C^*$-algebras

Let $Θ=(θ_{j,k})_{3\times 3}$ be a non-degenerate real skew-symmetric $3\times 3$ matrix, where $θ_{j,k}\in [0,1).$ For any $\varepsilon>0$, we prove that there exists $δ>0$ satisfying the following: if $v_1,v_2,v_3$ are three unitaries in any unital simple separable $C^*$-algebra $A$ with tracial rank at most one, such that $$\|v_kv_j-e^{2πi θ_{j,k}}v_jv_k\|<δ\,\,\,\, \mbox{and}\,\,\,\, \frac{1}{2πi}τ(\log_θ(v_kv_jv_k^*v_j^*))=θ_{j,k}$$ for all $τ\in T(A)$ and $j,k=1,2,3,$ where $\log_θ$ is a continuous branch of logarithm for some real number $θ\in [0, 1)$, then there exists a triple of unitaries $\tilde{v}_1,\tilde{v}_2,\tilde{v}_3\in A$ such that $$\tilde{v}_k\tilde{v}_j=e^{2πiθ_{j,k} }\tilde{v}_j\tilde{v}_k\,\,\,\,\mbox{and}\,\,\,\,\|\tilde{v}_j-v_j\|<\varepsilon,\,\,j,k=1,2,3.$$ The same conclusion holds if $Θ$ is rational or non-degenerate and $A$ is a nuclear purely infinite simple $C^*$-algebra (where the trace condition is vacuous). If $Θ$ is degenerate and $A$ has tracial rank at most one or is nuclear purely infinite simple, we provide some additional injectivity condition to get the above conclusion.

preprint2016arXiv

Classification of certain inductive limit actions of compact groups on AF algebras

Let $A=\underrightarrow{\lim}{A_n}$ be an AF algebra, $G$ be a compact group. We consider inductive limit actions of the form $α=\underrightarrow{\lim}{α_n}$, where $α_n\colon G\curvearrowright A_n$ is an action on the finite dimensional C*-algebra $A_n$ which fixes each matrix summand. If each $α_n$ is inner, such actions are classified by equivariant K-theory by Handelman and Rossmann. However, if the actions $α_n$ are not inner, we show that such actions are not classifiable by equivariant K-theory. We give a complete classification of such actions using twisted equivariant K-theory.

preprint2016arXiv

Tracial Rokhlin property for actions of amenable groups on C* algebras

Tracial Rokhlin property was introduced by Chris Phillips to study the structure of crossed product of actions on simple C*-algebras. It was originally defined for actions of finite groups and group of integers. Matui and Sato generalized it to actions of amenable groups. In this paper, we give a further generalization of Matui and Sato's definition. We shall show that many known results about tracial Rokhlin property could be generalized to actions of amenable groups under this definition. We also show that some natural examples has the (weak) tracial Rokhlin property.

preprint2015arXiv

Research on the fast Fourier transform of image based on GPU

Study of general purpose computation by GPU (Graphics Processing Unit) can improve the image processing capability of micro-computer system. This paper studies the parallelism of the different stages of decimation in time radix 2 FFT algorithm, designs the butterfly and scramble kernels and implements 2D FFT on GPU. The experiment result demonstrates the validity and advantage over general CPU, especially in the condition of large input size. The approach can also be generalized to other transforms alike.

preprint2012arXiv

Complex synchronous behavior in interneuronal networks with delayed inhibitory and fast electrical synapses

Networks of fast-spiking interneurons are crucial for the generation of neural oscillations in the brain. Here we study the synchronous behavior of interneuronal networks that are coupled by delayed inhibitory and fast electrical synapses. We find that both coupling modes play a crucial role by the synchronization of the network. In addition, delayed inhibitory synapses affect the emerging oscillatory patterns. By increasing the inhibitory synaptic delay, we observe a transition from regular to mixed oscillatory patterns at a critical value. We also examine how the unreliability of inhibitory synapses influences the emergence of synchronization and the oscillatory patterns. We find that low levels of reliability tend to destroy synchronization, and moreover, that interneuronal networks with long inhibitory synaptic delays require a minimal level of reliability for the mixed oscillatory pattern to be maintained.

preprint2012arXiv

Multiple firing coherence resonances in excitatory and inhibitory coupled neurons

The impact of inhibitory and excitatory synapses in delay-coupled Hodgkin--Huxley neurons that are driven by noise is studied. If both synaptic types are used for coupling, appropriately tuned delays in the inhibition feedback induce multiple firing coherence resonances at sufficiently strong coupling strengths, thus giving rise to tongues of coherency in the corresponding delay-strength parameter plane. If only inhibitory synapses are used, however, appropriately tuned delays also give rise to multiresonant responses, yet the successive delays warranting an optimal coherence of excitations obey different relations with regards to the inherent time scales of neuronal dynamics. This leads to denser coherence resonance patterns in the delay-strength parameter plane. The robustness of these findings to the introduction of delay in the excitatory feedback, to noise, and to the number of coupled neurons is determined. Mechanisms underlying our observations are revealed, and it is suggested that the regularity of spiking across neuronal networks can be optimized in an unexpectedly rich variety of ways, depending on the type of coupling and the duration of delays.

preprint2012arXiv

Tracial Rokhlin property and non-commutative dimensions

Tracial Rokhlin property was introduced by Phillips to prove various structure theorems for crossed product. But it is defined for actions on simple C*-algebras only. This paper consists of two major parts: In section 2 and 3, we study the permanence properties and give a complete classification of tracial Rokhlin property for product-type actions; In section 4 and 5, we introduce the weak tracial Rokhlin property for actions on non-simple C*-algebras. We prove that when the action has the weak tracial Rokhlin property and the crossed product is simple, the properties on $A$ of having tracial rank $\leq k$, or real rank 0, or stable rank 1, can be inherited by the crossed product.

preprint2011arXiv

Synthesizing attractors of Hindmarsh-Rose neuronal systems

In this paper a periodic parameter switching scheme is applied to the Hindmarsh-Rose neuronal system to synthesize certain attractors. Results show numerically, via computer graphic simulations, that the obtained synthesized attractor belongs to the class of all admissible attractors for the Hindmarsh-Rose neuronal system and matches the averaged attractor obtained with the control parameter replaced with the averaged switched parameter values. This feature allows us to imagine that living beings are able to maintain vital behavior while the control parameter switches so that their dynamical behavior is suitable for the given environment.

preprint2010arXiv

Synchronous bursts on scale-free neuronal networks with attractive and repulsive coupling

This paper investigates the dependence of synchronization transitions of bursting oscillations on the information transmission delay over scale-free neuronal networks with attractive and repulsive coupling. It is shown that for both types of coupling, the delay always plays a subtle role in either promoting or impairing synchronization. In particular, depending on the inherent oscillation period of individual neurons, regions of irregular and regular propagating excitatory fronts appear intermittently as the delay increases. These delay-induced synchronization transitions are manifested as well-expressed minima in the measure for spatiotemporal synchrony. For attractive coupling, the minima appear at every integer multiple of the average oscillation period, while for the repulsive coupling, they appear at every odd multiple of the half of the average oscillation period. The obtained results are robust to the variations of the dynamics of individual neurons, the system size, and the neuronal firing type. Hence, they can be used to characterize attractively or repulsively coupled scale-free neuronal networks with delays.

preprint2007arXiv

Performance Analysis for Multichannel Reception of OOFSK Signaling

In this paper, the error performance of on-off frequency shift keying (OOFSK) modulation over fading channels is analyzed when the receiver is equipped with multiple antennas. The analysis is conducted in two cases: the coherent scenario where the fading is perfectly known at the receiver, and the noncoherent scenario where neither the receiver nor the transmitter knows the fading coefficients. For both cases, the maximum a posteriori probability (MAP) detection rule is derived and analytical probability of error expressions are obtained. The effect of fading correlation among the receiver antennas is also studied. Simulation results indicate that for sufficiently low duty cycle values, lower probability of error values with respect to FSK signaling are achieved. Equivalently, when compared to FSK modulation, OOFSK with low duty cycle requires less energy to achieve the same probability of error, which renders this modulation a more energy efficient transmission technique.