Source author record

Jianping Wang

Jianping 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

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

18 published item(s)

preprint2026arXiv

DSA-Tokenizer: Disentangled Semantic-Acoustic Tokenization via Flow Matching-based Hierarchical Fusion

Speech tokenizers serve as the cornerstone of discrete Speech Large Language Models (Speech LLMs). Existing tokenizers either prioritize semantic encoding, fuse semantic content with acoustic style inseparably, or achieve incomplete semantic-acoustic disentanglement. To achieve better disentanglement, we propose DSA-Tokenizer, which explicitly disentangles speech into discrete semantic and acoustic tokens via distinct optimization constraints. Specifically, semantic tokens are supervised by ASR to capture linguistic content, while acoustic tokens focus on mel-spectrograms restoration to encode style. To eliminate rigid length constraints between the two sequences, we introduce a hierarchical Flow-Matching decoder that further improve speech generation quality. Furthermore, We employ a joint reconstruction-recombination training strategy to enforce this separation. DSA-Tokenizer enables high fidelity reconstruction and flexible recombination through robust disentanglement, facilitating controllable generation in speech LLMs. Our analysis highlights disentangled tokenization as a pivotal paradigm for future speech modeling. Audio samples are avaialble at https://anonymous.4open.science/w/DSA_Tokenizer_demo/. The code and model will be made publicly available after the paper has been accepted.

preprint2026arXiv

One World, Dual Timeline: Decoupled Spatio-Temporal Gaussian Scene Graph for 4D Cooperative Driving Reconstruction

Reconstructing dynamic scenes from Vehicle-to-Infrastructure Cooperative Autonomous Driving (VICAD) data is fundamentally complicated by temporal asynchrony: vehicle and infrastructure cameras operate on independent clocks, capturing the same dynamic agent such as cars and pedestrians at different physical times. Existing Gaussian Scene Graph methods implicitly assume synchronized observations and assign a single pose per agent per frame, which is an assumption that breaks in cooperative settings, where the resulting gradient conflicts cause severe ghosting on dynamic agents. We identify this as a representation-level failure, not an optimization artifact: we prove that any single-timeline formulation incurs an irreducible photometric loss scaling quadratically with agent velocity and cross-source time offset. To resolve this, we propose Dust (DecoUpled Spatio-Temporal) Gaussian Scene Graph for 4D Cooperative Driving Reconstruction. DUST Gaussian Scene Graph shares a canonical Gaussian set per agent for appearance consistency, while maintaining decouple pose trajectories aligned to each source's true capture timestamps. We prove that this decoupling enables the pose-gradient kernel block-diagonal, eliminating cross-source interference entirely. To make Dust practical, we further introduce a static anchor-based pose correction pipeline that corrects spatio misalignment between vehicle and infrastructure annotations, and a pose-regularized joint optimization scheme that prevents trajectory jitter and drift during early training. On 26 sequences from V2X-Seq, DUST achieves state-of-the-art performance, improving dynamic-area PSNR by 3.2 dB over the strongest baseline and reducing Fréchet Video Distance by 37.7%, with keeping robustness under larger temporal asynchrony.

preprint2026arXiv

Orion-RAG: Path-Aligned Hybrid Retrieval for Graphless Data

Retrieval-Augmented Generation (RAG) has proven effective for knowledge synthesis, yet it encounters significant challenges in practical scenarios where data is inherently discrete and fragmented. In most environments, information is distributed across isolated files like reports and logs that lack explicit links. Standard search engines process files independently, ignoring the connections between them. Furthermore, manually building Knowledge Graphs is impractical for such vast data. To bridge this gap, we present Orion-RAG. Our core insight is simple yet effective: we do not need heavy algorithms to organize this data. Instead, we use a low-complexity strategy to extract lightweight paths that naturally link related concepts. We demonstrate that this streamlined approach suffices to transform fragmented documents into semi-structured data, enabling the system to link information across different files effectively. Extensive experiments demonstrate that Orion-RAG consistently outperforms mainstream frameworks across diverse domains, supporting real-time updates and explicit Human-in-the-Loop verification with high cost-efficiency. Experiments on FinanceBench demonstrate superior precision with a 25.2% relative improvement over strong baselines.

preprint2022arXiv

AoI-Constrained Bandit: Information Gathering over Unreliable Channels with Age Guarantees

Age-of-Information (AoI) is an application layer metric that has been widely adopted to quantify the information freshness of each information source. However, few works address the impact of probabilistic transmission failures on satisfying the harsh AoI requirement of each source, which is of critical importance in a great number of wireless-powered real-time applications. In this paper, we investigate the transmission scheduling problem of maximizing throughput over wireless channels under different time-average AoI requirements for heterogeneous information sources. When the channel reliability for each source is known as prior, the global optimal transmission scheduling policy is proposed. Moreover, when channel reliabilities are unknown, it is modeled as an AoI-constrained Multi-Armed Bandit (MAB) problem. Then a learning algorithm that meets the AoI requirement with probability 1 and incurs up to O(K\sqrt{T\log T}) accumulated regret is proposed, where K is the number of arms/information sources, and T is the time horizon. Numerical results show that the accumulated regret of our learning algorithm is strictly bounded by K\sqrt{T\log T} and outperforms the AoI-constraint-aware baseline, and the AoI requirement of every source is robustly satisfied.

preprint2022arXiv

Attacking Black-box Recommendations via Copying Cross-domain User Profiles

Recently, recommender systems that aim to suggest personalized lists of items for users to interact with online have drawn a lot of attention. In fact, many of these state-of-the-art techniques have been deep learning based. Recent studies have shown that these deep learning models (in particular for recommendation systems) are vulnerable to attacks, such as data poisoning, which generates users to promote a selected set of items. However, more recently, defense strategies have been developed to detect these generated users with fake profiles. Thus, advanced injection attacks of creating more `realistic' user profiles to promote a set of items is still a key challenge in the domain of deep learning based recommender systems. In this work, we present our framework CopyAttack, which is a reinforcement learning based black-box attack method that harnesses real users from a source domain by copying their profiles into the target domain with the goal of promoting a subset of items. CopyAttack is constructed to both efficiently and effectively learn policy gradient networks that first select, and then further refine/craft, user profiles from the source domain to ultimately copy into the target domain. CopyAttack's goal is to maximize the hit ratio of the targeted items in the Top-$k$ recommendation list of the users in the target domain. We have conducted experiments on two real-world datasets and have empirically verified the effectiveness of our proposed framework and furthermore performed a thorough model analysis.

preprint2022arXiv

Interference Mitigation for FMCW Radar With Sparse and Low-Rank Hankel Matrix Decomposition

In this paper, the interference mitigation for Frequency Modulated Continuous Wave (FMCW) radar system with a dechirping receiver is investigated. After dechirping operation, the scattered signals from targets result in beat signals, i.e., the sum of complex exponentials while the interferences lead to chirp-like short pulses. Taking advantage of these different time and frequency features between the useful signals and the interferences, the interference mitigation is formulated as an optimization problem: a sparse and low-rank decomposition of a Hankel matrix constructed by lifting the measurements. Then, an iterative optimization algorithm is proposed to tackle it by exploiting the Alternating Direction of Multipliers (ADMM) scheme. Compared to the existing methods, the proposed approach does not need to detect the interference and also improves the estimation accuracy of the separated useful signals. Both numerical simulations with point-like targets and experiment results with distributed targets (i.e., raindrops) are presented to demonstrate and verify its performance. The results show that the proposed approach is generally applicable for interference mitigation in both stationary and moving target scenarios.

preprint2021arXiv

CFAR-Based Interference Mitigation for FMCW Automotive Radar Systems

In this paper, constant false alarm rate (CFAR) detector-based approaches are proposed for interference mitigation of Frequency modulated continuous wave (FMCW) radars. The proposed methods exploit the fact that after dechirping and low-pass filtering operations the targets' beat signals of FMCW radars are composed of exponential sinusoidal components while interferences exhibit short chirp waves within a sweep. The spectra of interferences in the time-frequency ($t$-$f$) domain are detected by employing a 1-D CFAR detector along each frequency bin and then the detected map is dilated as a mask for interference suppression. They are applicable to the scenarios in the presence of multiple interferences. Compared to the existing methods, the proposed methods reduce the power loss of useful signals and are very computationally efficient. Their interference mitigation performances are demonstrated through both numerical simulations and experimental results.

preprint2021arXiv

Global solutions of a doubly tactic resource consumption model with logistic source

We study a doubly tactic resource consumption model \bess \left\{\begin{array}{lll} u_t=\tr u-\nabla\cd(u\nabla w),\\[1mm] v_t=\tr v-\nabla\cd(v\nabla u)+v(1-v^{β-1}),\\[1mm] w_t=\tr w-(u+v)w-w+r \end{array}\right. \eess in a smooth bounded domain $\oo\in\R^2$ with homogeneous Neumann boundary conditions, where $r\in C^1(\barΩ\times[0,\infty))\cap L^\infty(Ω\times(0,\infty))$ is a given nonnegative function fulfilling \bess \int_t^{t+1}\ii|\nn\sqrt{r}|^2<\yy\ \ \ \ \ \ for\ all\ t>0. \eess It is shown that, firstly, if $β>2$, then the corresponding Neumann initial-boundary problem admits a global bounded classical solution. Secondly, when $β=2$, the Neumann initial-boundary problem admits a global generalized solution.

preprint2020arXiv

PLVER: Joint Stable Allocation and Content Replication for Edge-assisted Live Video Delivery

The live streaming services have gained extreme popularity in recent years. Due to the spiky traffic patterns of live videos, utilizing the distributed edge servers to improve viewers' quality of experience (QoE) has become a common practice nowadays. Nevertheless, current client-driven content caching mechanism does not support caching beforehand from the cloud to the edge, resulting in considerable cache missing in live video delivery. State-of-the-art research generally sacrifices the liveness of delivered videos in order to deal with the above problem. In this paper, by jointly considering the features of live videos and edge servers, we propose PLVER, a proactive live video push scheme to resolve the cache miss problem in live video delivery. Specifically, PLVER first conducts a one-tomultiple stable allocation between edge clusters and user groups, to balance the load of live traffic over the edge servers. Then it adopts proactive video replication algorithms to speed up the video replication among the edge servers. We conduct extensive trace-driven evaluations, covering 0.3 million Twitch viewers and more than 300 Twitch channels. The results demonstrate that with PLVER, edge servers can carry 28% and 82% more traffic than the auction-based replication method and the caching on requested time method, respectively.

preprint2016arXiv

The role of electron and phonon temperatures in the helicity-independent all-optical switching of GdFeCo

Ultrafast optical heating of the electrons in ferrimagnetic metals can result in all-optical switching (AOS) of the magnetization. Here we report quantitative measurements of the temperature rise of GdFeCo thin films during helicity-independent AOS. Critical switching fluences are obtained as a function of the initial temperature of the sample and for laser pulse durations from 55 fs to 15 ps. We conclude that non-equilibrium phenomena are necessary for helicity-independent AOS, although the peak electron temperature does not play a critical role. Pump-probe time-resolved experiments show that the switching time increases as the pulse duration increases, with 10 ps pulses resulting in switching times of ~sim 13 ps. These results raise new questions about the fundamental mechanism of helicity-independent AOS.

preprint2014arXiv

Theory of strain tunning exction coupling in self-assembled InAs/GaAs quantum dots

We derive analytically the change of exciton fine structure splitting (FSS) under the external stresses in the self-assembled InAs/GaAs quantum dots using the Bir-Pikus model. We find that the FSS change is mainly due to the strain induced valence bands mixing and valence-conduction band coupling. The exciton polarization angle under strain are determined by the argument of the electron-hole off-diagonal exchange integrals. The theory agrees well with the empirical pseudopotential calculations.

preprint2014arXiv

Towards scalable entangled photon sources with self-assembled InAs/GaAs quantum dots

Biexciton cascade process in self-assembled quantum dots (QDs) provides an ideal system for deterministic entangled photon pair source, which is essential in quantum information science. The entangled photon pairs have recently be realized in experiments after eliminating the FSS of exciton using a number of different methods. However, so far the QDs entangled photon sources are not scalable, because the wavelengths of the QDs are different from dot to dot. Here we propose a wavelength tunable entangled photon emitter on a three dimensional stressor, in which the FSS and exciton energy can be tuned independently, allowing photon entanglement between dissimilar QDs. We confirm these results by using atomistic pseudopotential calculations. This provides a first step towards future realization of scalable entangled photon generators for quantum information applications.

preprint2013arXiv

Power Penalty Due to First-order PMD in Optical OFDM/QAM and FBMC/OQAM Transmission System

Polarization mode dispersion (PMD) is a challenge for high-data-rate optical-communication systems. More researches are desirable for impairments that is induced by PMD in high-speed optical orthogonal frequency division multiplexing (OFDM) transmission system. In this paper, an approximately analytical method for evaluating the power penalty due to first-order PMD in optical OFDM with quadrature amplitude modulation (OFDM/QAM) and filter bank based multi-carrier with offset quadrature amplitude modulation (FBMC/OQAM) transmission system is presented. The simulation results show that, compared with the single carrier with quadrature phase shift keying(SC-QPSK), both the OFDM/QAM and the FBMC/OQAM can decrease the power penalty caused by PMD by half. Furthermore, the FBMC/OQAM shows better power penalty immunity than the OFDM/QAM under the influence of first order PMD.

preprint2012arXiv

Conquer the fine structure splitting of excitons in self-assembled InAs/GaAs quantum dots via combined stresses

Eliminating the fine structure splitting (FSS) of excitons in self-assembled quantum dots (QDs) is essential to the generation of high quality entangled photon pairs. It has been shown that the FSS has a lower bound under uniaxial stress. In this letter, we show that the FSS of excitons in a general self-assembled InGaAs/GaAs QD can be fully suppressed via combined stresses along the [110] and [010] directions. The result is confirmed by atomic empirical pseudopotential calculations. For all the QDs we studied, the FSS can be tuned to be vanishingly small ($<$ 0.1 $μ$eV), which is sufficient small for high quality entangled photon emission.

preprint2012arXiv

Service Composition in Service-Oriented Wireless Sensor Networks with Persistent Queries

Service-oriented wireless sensor network(WSN) has been recently proposed as an architecture to rapidly develop applications in WSNs. In WSNs, a query task may require a set of services and may be carried out repetitively with a given frequency during its lifetime. A service composition solution shall be provided for each execution of such a persistent query task. Due to the energy saving strategy, some sensors may be scheduled to be in sleep mode periodically. Thus, a service composition solution may not always be valid during the lifetime of a persistent query. When a query task needs to be conducted over a new service composition solution, a routing update procedure is involved which consumes energy. In this paper, we study service composition design which minimizes the number of service composition solutions during the lifetime of a persistent query. We also aim to minimize the total service composition cost when the minimum number of required service composition solutions is derived. A greedy algorithm and a dynamic programming algorithm are proposed to complete these two objectives respectively. The optimality of both algorithms provides the service composition solutions for a persistent query with minimum energy consumption.

preprint2012arXiv

Temperature Dependent Empirical Pseudopotential Theory For Self-Assembled Quantum Dots

We develop a temperature dependent empirical pseudopotential theory to study the electronic and optical properties of self-assembled quantum dots (QDs) at finite temperature. The theory takes the effects of both lattice expansion and lattice vibration into account. We apply the theory to the InAs/GaAs QDs. For the unstrained InAs/GaAs heterostructure, the conduction band offset increases whereas the valence band offset decreases with increasing of the temperature, and there is a type-I to type-II transition at approximately 135 K. Yet, for InAs/GaAs QDs, the holes are still localized in the QDs even at room temperature, because the large lattice mismatch between InAs and GaAs greatly enhances the valence band offset. The single particle energy levels in the QDs show strong temperature dependence due to the change of confinement potentials. Because of the changes of the band offsets, the electron wave functions confined in QDs increase by about 1 - 5%, whereas the hole wave functions decrease by about 30 - 40% when the temperature increases from 0 to 300 K. The calculated recombination energies of exciton, biexciton and charged excitons show red shifts with increasing of the temperature, which are in excellent agreement with available experimental data.