arXiv subjects
Publications and source records attributed to Kun Cheng.
We show that testing Bell inequalities in $W^\pm$ pair systems by measuring their angular correlation suffers from the ambiguity in kinetical reconstruction of the di-lepton decay mode. We further propose a new set of Bell observables based on the measurement of the linear polarization of the $W$ bosons, providing a realistic observable to test Bell inequalities in $W^\pm$ pair systems for the first time.
The direct growth of III-V semiconductors on silicon holds tremendous potential for photonics applications. However, the inherent differences in their properties lead to defects in the epitaxial layer, including threading dislocations (TDs), antiphase boundaries (APBs), and thermal cracks, significantly impacting device performance. Current processes struggle to suppress these defects simultaneously, necessitating the development of methods to inhibit TDs and APBs in a thin buffer on silicon. This study introduces a GaSb buffer layer during GaAs epitaxy on a silicon (001) substrate. This approach successfully suppresses defect formation by promoting the formation of interfacial misfit dislocation (IMF) arrays at both the AlSb/Si and GaAs/GaSb interfaces. The resulting GaAs layer exhibits a step-flow surface with a rough mean square of approximately 3.8 nm and a full width at half maximum of 158 arcsec. Remarkably, the growth is achieved without any observable interfacial intermixing. Building on this platform, InAs/GaAs quantum dots (QDs) are grown with a density of 3.8E10/cm2, emitting at a wavelength of 1288 nm. This breakthrough holds immense promise for developing high-quality GaAs films with reduced defect densities on silicon for O band lasers, laying the foundation for the mass production of silicon-based integrated circuits.
The remarkable prowess of diffusion models in image generation has spurred efforts to extend their application beyond generative tasks. However, a persistent challenge exists in lacking a unified approach to apply diffusion models to visual perception tasks with diverse semantic granularity requirements. Our purpose is to establish a unified visual perception framework, capitalizing on the potential synergies between generative and discriminative models. In this paper, we propose Vermouth, a simple yet effective framework comprising a pre-trained Stable Diffusion (SD) model containing rich generative priors, a unified head (U-head) capable of integrating hierarchical representations, and an adapted expert providing discriminative priors. Comprehensive investigations unveil potential characteristics of Vermouth, such as varying granularity of perception concealed in latent variables at distinct time steps and various U-net stages. We emphasize that there is no necessity for incorporating a heavyweight or intricate decoder to transform diffusion models into potent representation learners. Extensive comparative evaluations against tailored discriminative models showcase the efficacy of our approach on zero-shot sketch-based image retrieval (ZS-SBIR), few-shot classification, and open-vocabulary semantic segmentation tasks. The promising results demonstrate the potential of diffusion models as formidable learners, establishing their significance in furnishing informative and robust visual representations.
The quartic Higgs-gauge-boson coupling $g_{hhWW}$ is sensitive to the electroweak symmetry breaking mechanism, however, it is challenging to be measured at the large hadron collider. We show that the coupling can be well probed at future lepton colliders through di-Higgs boson production via the vector boson fusion channel. We perform a detailed simulation of $\ell^+\ell^-\to ν\barνhh\to 4b\,+ \!\!\not{\!\! E}_T$ with parton showering effects at $e^+e^-$, $μ^+μ^-$ and $e^-μ^+$ colliders. We find that the regions of $g_{hhWW}/g_{hhWW}^{\rm SM}<0.86$ and $g_{hhWW}/g_{hhWW}^{\rm SM}>1.32$ can be discovered at the $5σ$ confidence level at the 10 TeV $μ^+ μ^-$ collider with an integrated luminosity of 3 ab$^{-1}$.
In this paper, we prove the equivalent conditions of complete moment convergence of the maximum for partial weighted sums of independent, identically distributed random variables under sublinear expectations space. As applications, the Baum-Katz type results for the maximum for partial weighted sums of independent, identically distributed random variables are established under sublinear expectations space. The results obtained in the article are the extensions of the equivalent conditions of complete moment convergence of the maximum under classical linear expectation space.
It is possible that there is another scalar hiding behind the known 125 GeV Higgs boson. If the hidden scalar exhibits a CP property different from the Higgs boson, it can be exposed in the di-Higgs production at the high-luminosity large hadron collider and future colliders.
We present VideoReTalking, a new system to edit the faces of a real-world talking head video according to input audio, producing a high-quality and lip-syncing output video even with a different emotion. Our system disentangles this objective into three sequential tasks: (1) face video generation with a canonical expression; (2) audio-driven lip-sync; and (3) face enhancement for improving photo-realism. Given a talking-head video, we first modify the expression of each frame according to the same expression template using the expression editing network, resulting in a video with the canonical expression. This video, together with the given audio, is then fed into the lip-sync network to generate a lip-syncing video. Finally, we improve the photo-realism of the synthesized faces through an identity-aware face enhancement network and post-processing. We use learning-based approaches for all three steps and all our modules can be tackled in a sequential pipeline without any user intervention. Furthermore, our system is a generic approach that does not need to be retrained to a specific person. Evaluations on two widely-used datasets and in-the-wild examples demonstrate the superiority of our framework over other state-of-the-art methods in terms of lip-sync accuracy and visual quality.
In recent years, the optical 4f system has drawn much attention in building high-speed and ultra-low-power optical neural networks (ONNs). Most optical systems suffer from the misalignment of the optical devices during installment. The performance of ONN based on the optical 4f system (4f-ONN) is considered sensitive to the misalignment in the optical path introduced. In order to comprehensively investigate the influence caused by the misalignment, we proposed a method for estimating the performance of a 4f-ONN in response to various misalignment in the context of the image classification task.The misalignment in numerical simulation is estimated by manipulating the optical intensity distributions in the fourth focus plane in the 4f system. Followed by a series of physical experiments to validate the simulation results. Using our method to test the impact of misalignment of 4f system on the classification accuracy of two popular image classification datasets, MNIST and Quickdraw16. On both datasets, we found that the performances of 4f-ONN generally degraded dramatically as the positioning error increased. Different positioning error tolerance in the misalignment orientations was observed over the two datasets. Classification performance could be preserved by positioning errors up to 200 microns in a specific direction.
Let $\{Y_i,-\infty<i<\infty\}$ be a doubly infinite sequence of identically distributed, negatively dependent random variables under sub-linear expectations, $\{a_i,-\infty<i<\infty\}$ be an absolutely summable sequence of real numbers. In this article, we study complete convergence and Marcinkiewicz-Zygmund strog law of large numbers for the partial sums of moving average processes $\{X_n=\sum_{i=-\infty}^{\infty}a_{i}Y_{i+n},n\ge 1\}$ based on the sequence $\{Y_i,-\infty<i<\infty\}$ of identically distributed, negatively dependent random variables under sub-linear expectations, complementing the result of [Chen, et al., 2009. Limiting behaviour of moving average processes under $φ$-mixing assumption. Statist. Probab. Lett. 79, 105-111].
Using a geometric description of 2HDM, we classify CP invariants into three independent sectors such as scalar potential, Yukawa interaction and CKM matrix. Thermal effective potential of 2HDM is calculated in a basis invariant way. It is shown that the CP violation in Yukawa interactions can contribute to effective potential at one loop level but the CP phase in the CKM matrix cannot leak to effective potential at all orders. In the 2HDM with a softly broken Z_2 symmetry, the leading thermal correction tends to restore the CP symmetry at high temperature.
We investigate the complete $p$-th moment convergence for weighted sums of independent, identically distributed random variables under sublinear expectations space. Using moment inequality and truncation methods, we prove the equivalent conditions of complete $p$-th moment convergence of weighted sums of independent, identically distributed random variables under sublinear expectations space, which complement the corresponding results obtained in Guo and Shan (2020).
The complete convergence for weighted sums of sequences of independent, identically distributed random variables under sublinear expectations space was studied. By moment inequality and truncation methods, we establish the equivalent conditions of complete convergence for weighted sums of sequences of independent, identically distributed random variables under sublinear expectations space. The results extend the corresponding results obtained by Guo (2012) to those for sequences of independent, identically distributed random variables under sublinear expectations space.
We prove that moderate deviations for empirical measures for countable nonhomogeneous Markov chains hold under the assumption of uniform convergence of transition probability matrices for countable nonhomogeneous Markov chains in Cesàro sense.
Autonomous driving vehicles (ADVs) are implemented with rich software functions and equipped with many sensors, which in turn brings broad attack surface. Moreover, the execution environment of ADVs is often open and complex. Hence, ADVs are always at risk of safety and security threats. This paper proposes a fast method called Multi-IF, using multiple invocation features of system calls to detect anomalies in self-driving systems. Since self-driving functions take most of the computation resources and upgrade frequently, Multi-IF is designed to work under such resource constraints and support frequent updates. Given the collected sequences of system calls, the combination of different syntax patterns is used to analyze and construct feature vectors of those sequences. By taking the feature vectors as inputs, one-class support vector machine is adopted to determine whether the current sequence of system calls is abnormal, which is trained with the feature vectors from the normal sequences. The evaluations on both simulated and real data prove that the proposed method is effective in identifying the abnormal behavior after minutes of feature extraction and training. Further comparisons with the existing methods on the ADFA-LD data set also validate that the proposed approach achieves a higher accuracy with less time overhead.
Due to the broad attack surface and the lack of runtime protection, potential safety and security threats hinder the real-life adoption of autonomous vehicles. Although efforts have been made to mitigate some specific attacks, there are few works on the protection of the self-driving system. This paper presents a decentralized self-protection framework called Guardauto to protect the self-driving system against runtime threats. First, Guardauto proposes an isolation model to decouple the self-driving system and isolate its components with a set of partitions. Second, Guardauto provides self-protection mechanisms for each target component, which combines different methods to monitor the target execution and plan adaption actions accordingly. Third, Guardauto provides cooperation among local self-protection mechanisms to identify the root-cause component in the case of cascading failures affecting multiple components. A prototype has been implemented and evaluated on the open-source autonomous driving system Autoware. Results show that Guardauto could effectively mitigate runtime failures and attacks, and protect the control system with acceptable performance overhead.
Existing person video generation methods either lack the flexibility in controlling both the appearance and motion, or fail to preserve detailed appearance and temporal consistency. In this paper, we tackle the problem of motion transfer for generating person videos, which provides controls on both the appearance and the motion. Specifically, we transfer the motion of one person in a target video to another person in a source video, while preserving the appearance of the source person. Besides only relying on one source frame as the existing state-of-the-art methods, our proposed method integrates information from multiple source frames based on a spatio-temporal attention mechanism to preserve rich appearance details. In addition to a spatial discriminator employed for encouraging the frame-level fidelity, a multi-range temporal discriminator is adopted to enforce the generated video to resemble temporal dynamics of a real video in various time ranges. A challenging real-world dataset, which contains about 500 dancing video clips with complex and unpredictable motions, is collected for the training and testing. Extensive experiments show that the proposed method can produce more photo-realistic and temporally consistent person videos than previous methods. As our method decomposes the syntheses of the foreground and background into two branches, a flexible background substitution application can also be achieved.
Gliomas are the most common primary brain malignancies, with different degrees of aggressiveness, variable prognosis and various heterogeneous histologic sub-regions, i.e., peritumoral edematous/invaded tissue, necrotic core, active and non-enhancing core. This intrinsic heterogeneity is also portrayed in their radio-phenotype, as their sub-regions are depicted by varying intensity profiles disseminated across multi-parametric magnetic resonance imaging (mpMRI) scans, reflecting varying biological properties. Their heterogeneous shape, extent, and location are some of the factors that make these tumors difficult to resect, and in some cases inoperable. The amount of resected tumor is a factor also considered in longitudinal scans, when evaluating the apparent tumor for potential diagnosis of progression. Furthermore, there is mounting evidence that accurate segmentation of the various tumor sub-regions can offer the basis for quantitative image analysis towards prediction of patient overall survival. This study assesses the state-of-the-art machine learning (ML) methods used for brain tumor image analysis in mpMRI scans, during the last seven instances of the International Brain Tumor Segmentation (BraTS) challenge, i.e., 2012-2018. Specifically, we focus on i) evaluating segmentations of the various glioma sub-regions in pre-operative mpMRI scans, ii) assessing potential tumor progression by virtue of longitudinal growth of tumor sub-regions, beyond use of the RECIST/RANO criteria, and iii) predicting the overall survival from pre-operative mpMRI scans of patients that underwent gross total resection. Finally, we investigate the challenge of identifying the best ML algorithms for each of these tasks, considering that apart from being diverse on each instance of the challenge, the multi-institutional mpMRI BraTS dataset has also been a continuously evolving/growing dataset.
In this paper, we report an encoding and decoding method for irregular-quasic-cyclic low-density parity-check (IR-QC-LDPC) codes with multi rates. The algorithm is applicable to parity-check matrices which have dual-diagonal parity structure. The decoding adopts normalized min-sum algorithm(NMSA). The whole verification of encoding and decoding algorithm are simulated with MATLAB, if initial bit error ratio is 6% , the code rate of 2/3 is selected, and if the initial bit error ratio is 1.04%, the code rate of 5/6 is selected. We migrate the algorithm from MATLAB to Field Program Gate Array(FPGA) and implement this algorithm based on FPGA. Based on FPGA the throughput of encoding is 183.36Mbps while the average decoding throughput is 27.85Mbps with the initial bit error ratio is 6%.