Searcharxiv⌕ Search

arXiv subjects

Chen Wang

Publications and source records attributed to Chen Wang.

At least 775 records · Page 43Linked to original sources

Numerical Approach to the Evolution of the Spin-boson Systems and its Application on the Buck-Sukumar Model

We present a systematic numerical iteration approach to study the evolution properties of the spin-boson systems, which works well in whole coupling regime. This approach involves the evaluation of a set of coefficients for the formal expansion of the time-dependent Schrödinger equation $\vert t\rangle=e^{-i\hat{H}t}\vert t=0\rangle$ by expanding the initial state $\vert t=0\rangle$ in Fock space. The main advantage of this method is that this set of coefficients is unique for the Hamiltonian studied, which allows one to calculate the time evolution based on the different initial states. To complement our numerical calculations, the method is applied to the Buck-Sukumar model. Furthermore, we pointed out that, when the ground state energy of the model is unbounded and no ground state exists in a certain parameter space, the unstable time evolution of the physical quantities is the natural results. Furthermore, we test the performance of the numerical method to the Hamiltonian that use anti-Hermitian terms for modeling open quantum systems.

quant-ph↗

Non-volatile ferroelectric memory effect in ultrathin α-In2Se3

Recent experiments on layered α-In2Se3 have confirmed its room-temperature ferroelectricity under ambient condition. This observation renders α-In2Se3 an excellent platform for developing two-dimensional (2D) layered-material based electronics with nonvolatile functionality. In this letter, we demonstrate non-volatile memory effect in a hybrid 2D ferroelectric field effect transistor (FeFET) made of ultrathin α-In2Se3 and graphene. The resistance of graphene channel in the FeFET is tunable and retentive due to the electrostatic doping, which stems from the electric polarization of the ferroelectric α-In2Se3. The electronic logic bit can be represented and stored with different orientations of electric dipoles in the top-gate ferroelectric. The 2D FeFET can be randomly re-written over more than $10^5$ cycles without losing the non-volatility. Our approach demonstrates a protype of re-writable non-volatile memory with ferroelectricity in van de Waals 2D materials.

cond-mat.mtrl-sci↗

Microwave-Activated Controlled-Z Gate for Fixed-Frequency Fluxonium Qubits

The superconducting fluxonium circuit is an artificial atom with a strongly anharmonic spectrum: when biased at a half flux quantum, the lowest qubit transition is an order of magnitude smaller in frequency than those to higher levels. Similar to conventional atomic systems, such a frequency separation between the computational and noncomputational subspaces allows independent optimizations of the qubit coherence and two-qubit interactions. Here we describe a controlled-Z gate for two fluxoniums connected either capacitively or inductively, with qubit transitions fixed near 500 MHz. The gate is activated by a microwave drive at a resonance involving the second excited state. We estimate intrinsic gate fidelities over 99.9% with gate times below 100 ns.

quant-ph↗

General formation control for multi-agent systems with double-integrator dynamics

We study the general formation problem for a group of mobile agents in a plane, in which the agents are required to maintain a distribution pattern, as well as to rotate around or remain static relative to a static/moving target. The prescribed distribution pattern is a class of general formations that the distances between neighboring agents or the distances from each agent to the target do not need to be equal. Each agent is modeled as a double integrator and can merely perceive the relative information of the target and its neighbors. A distributed control law is designed using the limit-cycle based idea to solve the problem. One merit of the controller is that it can be implemented by each agent in its Frenet-Serret frame so that only local information is utilized without knowing global information. Theoretical analysis is provided of the equilibrium of the N-agent system and of the convergence of its converging part. Numerical simulations are given to show the effectiveness and performance of the proposed controller.

math.OC↗

KV-match: A Subsequence Matching Approach Supporting Normalization and Time Warping [Extended Version]

The volume of time series data has exploded due to the popularity of new applications, such as data center management and IoT. Subsequence matching is a fundamental task in mining time series data. All index-based approaches only consider raw subsequence matching (RSM) and do not support subsequence normalization. UCR Suite can deal with normalized subsequence match problem (NSM), but it needs to scan full time series. In this paper, we propose a novel problem, named constrained normalized subsequence matching problem (cNSM), which adds some constraints to NSM problem. The cNSM problem provides a knob to flexibly control the degree of offset shifting and amplitude scaling, which enables users to build the index to process the query. We propose a new index structure, KV-index, and the matching algorithm, KV-match. With a single index, our approach can support both RSM and cNSM problems under either ED or DTW distance. KV-index is a key-value structure, which can be easily implemented on local files or HBase tables. To support the query of arbitrary lengths, we extend KV-match to KV-match$_{DP}$, which utilizes multiple varied-length indexes to process the query. We conduct extensive experiments on synthetic and real-world datasets. The results verify the effectiveness and efficiency of our approach.

cs.DB↗

Jiamusi Pulsar Observations: II. Scintillations of 10 Pulsars

Context. Pulsars scintillate. Dynamic spectra show brightness variation of pulsars in the time and frequency domain. Secondary spectra demonstrate the distribution of fluctuation power in the dynamic spectra. Aims. Dynamic spectra strongly depend on observational frequencies, but were often observed at frequencies lower than 1.5 GHz. Scintillation observations at higher frequencies help to constrain the turbulence feature of the interstellar medium over a wide frequency range and can detect the scintillations of more distant pulsars. Methods. Ten pulsars were observed at 2250 MHz (S-band) with the Jiamusi 66 m telescope to study their scintillations. Their dynamic spectra were first obtained, from which the decorrelation bandwidths and time scales of diffractive scintillation were then derived by autocorrelation. Secondary spectra were calculated by forming the Fourier power spectra of the dynamic spectra. Results. Most of the newly obtained dynamic spectra are at the highest frequency or have the longest time span of any published data for these pulsars. For PSRs B0540+23, B2324+60 and B2351+61, these were the first dynamic spectra ever reported. The frequencydependence of scintillation parameters indicates that the intervening medium can rarely be ideally turbulent with a Kolmogorov spectrum. The thin screen model worked well at S-band for the scintillation of PSR B1933+16. Parabolic arcs were detected in the secondary spectra of three pulsars, PSRs B0355+54, B0540+23 and B2154+40, all of which were asymmetrically distributed. The inverted arclets of PSR B0355+54 were seen to evolve along the main parabola within a continuous observing session of 12 hours, from which the angular velocity of the pulsar was estimated that was consistent with the measurement by very long baseline interferometry (VLBI).

astro-ph.HE↗

Supercongruences concerning truncated hypergeometric series

Let $n\geq 3$ be an integer and $p$ be a prime with $p\equiv 1\pmod{n}$. In this paper, we show that $${}_nF_{n-1}\bigg[\begin{matrix} \frac{n-1}{n}&\frac{n-1}{n}&\ldots&\frac{n-1}{n}\\ &1&\ldots&1\end{matrix}\bigg | \, 1\bigg]_{p-1}\equiv -Γ_p\bigg(\frac{1}{n}\bigg)^n\pmod{p^3}, $$ where the truncated hypergeometric series $$_nF_{n-1} \bigg[\begin{matrix} x_1&x_2&\ldots&x_n\\ &y_1&\cdots&y_{n-1}\end{matrix}\bigg | \, z\bigg]_m=\sum_{k=0}^{m}\frac{z^k}{k!}\prod_{j=0}^{k-1}\frac{(x_1+j)\cdots(x_{n}+j)}{(y_1+j)\cdots(y_{n-1}+j)} $$ and $Γ_p$ denotes the $p$-adic gamma function. This confirms a conjecture of Deines, Fuselier, Long, Swisher and Tu. Furthermore, under the same assumptions, we also prove that $$p^n\cdot {}_{n+1} F_n \bigg[ \begin{matrix} 1 &1 &\ldots &1\\ &\frac{n+1}{n} &\ldots &\frac{n+1}{n} \end{matrix}\bigg | \, 1\bigg]_{p-1} \equiv -Γ_p \Bigl(\frac{1}{n} \Bigr)^n \quad(\mathrm{mod}\ {p^3}),$$ which solves another conjecture of Deines, Fuselier, Long, Swisher and Tu.

math.NT↗

Mechanisms of Ultrafast Charge Separation in a PTB7/Monolayer MoS2 van der Waals Heterojunction

Mixed-dimensional van der Waals heterojunctions comprising polymer and twodimensional (2D) semiconductors have many characteristics of an ideal charge separation interface for optoelectronic and photonic applications. However, the photoelectron dynamics at polymer- 2D semiconductor heterojunction interfaces are currently not sufficiently understood to guide the optimization of devices for these applications. This manuscript is a report of a systematic exploration of the time-dependent photophysical processes that occur upon photoexcitation of a type-II heterojunction between the polymer PTB7 and monolayer MoS2. In particular, photoinduced electron transfer from PTB7 to electronically hot states of MoS2 occurs in less than 250 fs. This process is followed by a slower (1-5 ps) exciton diffusion-limited electron transfer from PTB7 to MoS2 with a yield of 58%, and a sub-3-ps photoinduced hole transfer from MoS2 to PTB7. The equilibrium between excitons and polaron pairs in PTB7 determines the charge separation yield, whereas the 3-4 ns lifetime of photogenerated carriers is limited by MoS2 defects. Overall, this work elucidates the mechanisms of ultrafast charge carrier dynamics at PTB7-MoS2 interfaces, which will inform ongoing efforts to exploit polymer-2D semiconductor heterojunctions for photovoltaic and photodetector applications.

cond-mat.mtrl-sci↗

Matching Consecutive Subpatterns Over Streaming Time Series

Pattern matching of streaming time series with lower latency under limited computing resource comes to a critical problem, especially as the growth of Industry 4.0 and Industry Internet of Things. However, against traditional single pattern matching model, a pattern may contain multiple subpatterns representing different physical meanings in the real world. Hence, we formulate a new problem, called "consecutive subpatterns matching", which allows users to specify a pattern containing several consecutive subpatterns with various specified thresholds. We propose a novel representation Equal-Length Block (ELB) together with two efficient implementations, which work very well under all Lp-Norms without false dismissals. Extensive experiments are performed on synthetic and real-world datasets to illustrate that our approach outperforms the brute-force method and MSM, a multi-step filter mechanism over the multi-scaled representation by orders of magnitude.

cs.DB↗

The Definition and Numerical Method of Final Value Problem and Arbitrary Value Problem

Many Engineering Problems could be mathematically described by Final Value Problem, which is the inverse problem of Initial Value Problem. Accordingly, the paper studies the final value problem in the field of ODE problems and analyses the differences and relations between initial and final value problems. The more general new concept of the endpoints-value problem which could describe both initial and final problems is proposed. Further, we extend the concept into inner-interval value problem and arbitrary value problem and point out that both endpoints-value problem and inner-interval value problem are special forms of arbitrary value problem. Particularly, the existence and uniqueness of the solutions of final value problem and inner-interval value problem of first order ordinary differential equation are proved for discrete problems. The numerical calculation formulas of the problems are derived, and for each algorithm, we propose the convergence and stability conditions of them. Furthermore, multivariate and high-order final value problems are further studied, and the condition of fixed delay is also discussed in this paper. At last, the effectiveness of the considered methods is validated by numerical experiment.

math.NA↗

Kernel Cross-Correlator

Cross-correlator plays a significant role in many visual perception tasks, such as object detection and tracking. Beyond the linear cross-correlator, this paper proposes a kernel cross-correlator (KCC) that breaks traditional limitations. First, by introducing the kernel trick, the KCC extends the linear cross-correlation to non-linear space, which is more robust to signal noises and distortions. Second, the connection to the existing works shows that KCC provides a unified solution for correlation filters. Third, KCC is applicable to any kernel function and is not limited to circulant structure on training data, thus it is able to predict affine transformations with customized properties. Last, by leveraging the fast Fourier transform (FFT), KCC eliminates direct calculation of kernel vectors, thus achieves better performance yet still with a reasonable computational cost. Comprehensive experiments on visual tracking and human activity recognition using wearable devices demonstrate its robustness, flexibility, and efficiency. The source codes of both experiments are released at https://github.com/wang-chen/KCC

cs.CV↗

Correlation Flow: Robust Optical Flow Using Kernel Cross-Correlators

Robust velocity and position estimation is crucial for autonomous robot navigation. The optical flow based methods for autonomous navigation have been receiving increasing attentions in tandem with the development of micro unmanned aerial vehicles. This paper proposes a kernel cross-correlator (KCC) based algorithm to determine optical flow using a monocular camera, which is named as correlation flow (CF). Correlation flow is able to provide reliable and accurate velocity estimation and is robust to motion blur. In addition, it can also estimate the altitude velocity and yaw rate, which are not available by traditional methods. Autonomous flight tests on a quadcopter show that correlation flow can provide robust trajectory estimation with very low processing power. The source codes are released based on the ROS framework.

cs.RO↗

Molecular Gas Toward the Gemini OB1 Molecular Cloud Complex II: CO Outflow Candidates with Possible WISE Associations

We present a large scale survey of CO outflows in the Gem OB1 molecular cloud complex and its surroundings using the Purple Mountain Observatory Delingha 13.7 m telescope. A total of 198 outflow candidates were identified over a large area ($\sim$ 58.5 square degrees), of which 193 are newly detected. Approximately 68% (134/198) are associated with the Gem OB1 molecular cloud complex, including clouds GGMC 1, GGMC 2, BFS 52, GGMC 3 and GGMC 4. Other regions studied are: Local Arm (Local Lynds, West Front), Swallow, Horn, and Remote cloud. Outflow candidates in GGMC 1, BFS 52, and Swallow are mainly located at ring-like or filamentary structures. To avoid excessive uncertainty in distant regions ($\gtrsim$ 3.8 kpc), we only estimated the physical parameters for clouds in the Gem OB1 molecular cloud complex and in the Local arm. In those clouds, the total kinetic energy and the energy injection rate of the identified outflow candidates are $\lesssim$ 1% and $\lesssim$ 3% of the turbulent energy and the turbulent dissipation rate of each cloud, indicating that the identified outflow candidates cannot provide enough energy to balance turbulence of their host cloud at the scale of the entire cloud (several pc to dozens of pc). The gravitational binding energy of each cloud is $\gtrsim$ 135 times the total kinetic energy of the identified outflow candidates within the corresponding cloud, indicating that the identified outflow candidates cannot cause major disruptions to the integrity of their host cloud at the scale of the entire cloud.

astro-ph.GA↗

Nonlinear effects for three-terminal heat engine and refrigerator

The three-terminal heat device consisting of a cavity and coupled to a heat bath is established. By tuning the temperatures of the electrodes and the phonon bath, the device can function as a heat engine or a refrigerator. We study the characteristic performance in the linear and nonlinear regime for both setups. It is our focus here to analyze how the efficiency of the heat engine and coefficient of performance of the refrigerator are affected by the nonlinear transport. With such considerations, the maximum efficiency and power are then optimized for various energy levels, temperatures and other parameters.

cond-mat.mes-hall↗

Robust Propensity Score Computation Method based on Machine Learning with Label-corrupted Data

In biostatistics, propensity score is a common approach to analyze the imbalance of covariate and process confounding covariates to eliminate differences between groups. While there are an abundant amount of methods to compute propensity score, a common issue of them is the corrupted labels in the dataset. For example, the data collected from the patients could contain samples that are treated mistakenly, and the computing methods could incorporate them as a misleading information. In this paper, we propose a Machine Learning-based method to handle the problem. Specifically, we utilize the fact that the majority of sample should be labeled with the correct instance and design an approach to first cluster the data with spectral clustering and then sample a new dataset with a distribution processed from the clustering results. The propensity score is computed by Xgboost, and a mathematical justification of our method is provided in this paper. The experimental results illustrate that xgboost propensity scores computing with the data processed by our method could outperform the same method with original data, and the advantages of our method increases as we add some artificial corruptions to the dataset. Meanwhile, the implementation of xgboost to compute propensity score for multiple treatments is also a pioneering work in the area.

stat.ME↗

A CNOT gate between multiphoton qubits encoded in two cavities

Entangling gates between qubits are a crucial component for performing algorithms in quantum computers. However, any quantum algorithm must ultimately operate on error-protected logical qubits encoded in high-dimensional systems. Typically, logical qubits are encoded in multiple two-level systems, but entangling gates operating on such qubits are highly complex and have not yet been demonstrated. Here, we realize a controlled NOT (CNOT) gate between two multiphoton qubits in two microwave cavities. In this approach, we encode a qubit in the high-dimensional space of a single cavity mode, rather than in multiple two-level systems. We couple two such encoded qubits together through a transmon, which is driven by an RF pump to apply the gate within 190 ns. This is two orders of magnitude shorter than the decoherence time of the transmon, enabling a high-fidelity gate operation. These results are an important step towards universal algorithms on error-corrected logical qubits.

quant-ph↗

Fine-grained Pattern Matching Over Streaming Time Series

Pattern matching of streaming time series with lower latency under limited computing resource comes to a critical problem, especially as the growth of Industry 4.0 and Industry Internet of Things. However, against traditional single pattern matching problem, a pattern may contain multiple segments representing different statistical properties or physical meanings for more precise and expressive matching in real world. Hence, we formulate a new problem, called "fine-grained pattern matching", which allows users to specify varied granularities of matching deviation to different segments of a given pattern, and fuzzy regions for adaptive breakpoints determination between consecutive segments. In this paper, we propose a novel two-phase approach. In the pruning phase, we introduce Equal-Length Block (ELB) representation together with Block-Skipping Pruning (BSP) policy, which guarantees low cost feature calculation, effective pruning and no false dismissals. In the post-processing phase, a delta-function is proposed to enable us to conduct exact matching in linear complexity. Extensive experiments are conducted to evaluate on synthetic and real-world datasets, which illustrates that our algorithm outperforms the brute-force method and MSM, a multi-step filter mechanism over the multi-scaled representation.

cs.CV↗