arXiv subjects
Publications and source records attributed to Qing Yang.
We present partially penalized immersed finite element methods for solving parabolic interface problems on Cartesian meshes. Typical semi-discrete and fully discrete schemes are discussed. Error estimates in an energy norm are derived. Numerical examples are provided to support theoretical analysis.
In this paper, we derive a priori error estimates for a class of interior penalty discontinuous Galerkin (DG) methods using immersed finite element (IFE) functions for a classic second-order elliptic interface problem. The error estimation shows that these methods can converge optimally in a mesh-dependent energy norm. The combination of IFEs and DG formulation in these methods allows local mesh refinement in the Cartesian mesh structure for interface problems. Numerical results are provided to demonstrate the convergence and local mesh refinement features of these DG-IFE methods.
The Petrov type I condition for the solutions of vacuum Einstein equations in both of the non-relativistic and relativistic hydrodynamic expansions is checked. We show that it holds up to the third order of the non-relativistic hydrodynamic expansion parameter, but it is violated at the fourth order even if we choose a general frame. On the other hand, it is found that the condition holds at least up to the second order of the derivative expansion parameter. Turn the logic around, through imposing the Petrov type I condition and Hamiltonian constraint on a finite cutoff surface, we show that the stress tensor of the relativistic fluid can be recovered with correct first order and second order transport coefficients dual to the solutions of vacuum Einstein equations.
Recently the Petrov type I condition is introduced to reduce the degrees of freedom in the extrinsic curvature of a timelike hypersurface to the degrees of freedom in the dual Rindler fluid in Einstein gravity. In this paper we show that the Petrov type I condition holds for the solutions of vacuum Einstein-Gauss-Bonnet gravity up to the second order in the relativistic hydrodynamic expansion. On the other hand, if imposing the Petrov type I condition and Hamiltonian constraint on a finite cutoff hypersurface, the stress tensor of the relativistic Rindler fluid in vacuum Einstein-Gauss-Bonnet gravity can be recovered with correct first order and second order transport coefficients.
Recently Lysov and Strominger [arXiv:1104.5502] showed that imposing Petrov type I condition on a $(p+1)$-dimensional timelike hypersurface embedded in a $(p+2)$-dimensional vacuum Einstein gravity reduces the degrees of freedom in the extrinsic curvature of the hypersurface to that of a fluid on the hypersurface, and that the leading-order Einstein constraint equations in terms of the mean curvature of the embedding give the incompressible Navier-Stokes equations of the dual fluid. In this paper we show that the non-relativistic fluid dual to vacuum Einstein gravity does not satisfy the Petrov type I condition at next order, unless additional constraint such as the irrotational condition is added. In addition, we show that this procedure can be inversed to derive the non-relativistic hydrodynamics with higher order corrections through imposing the Petrov type I condition, and that some second order transport coefficients can be extracted, but the dual "Petrov type I fluid" does not match the dual fluid constructed from the geometry of vacuum Einstein gravity in the non-relativistic limit. We discuss the procedure both on the finite cutoff surface via the non-relativistic hydrodynamic expansion and on the highly accelerated surface via the near horizon expansion.
This paper investigates the decoding process of asynchronous convolutional-coded physical-layer network coding (PNC) systems. Specifically, we put forth a layered decoding framework for convolutional-coded PNC consisting of three layers: symbol realignment layer, codeword realignment layer, and joint channel-decoding network coding (Jt-CNC) decoding layer. Our framework can deal with phase asynchrony and symbol arrival-time asynchrony between the signals simultaneously transmitted by multiple sources. A salient feature of this framework is that it can handle both fractional and integral symbol offsets; previously proposed PNC decoding algorithms (e.g., XOR-CD and reduced-state Viterbi algorithms) can only deal with fractional symbol offset. Moreover, the Jt-CNC algorithm, based on belief propagation (BP), is BER-optimal for synchronous PNC and near optimal for asynchronous PNC. Extending beyond convolutional codes, we further generalize the Jt-CNC decoding algorithm for all cyclic codes. Our simulation shows that Jt-CNC outperforms the previously proposed XOR-CD algorithm and reduced-state Viterbi algorithm by 2dB for synchronous PNC. For phase-asynchronous PNC, Jt-CNC is 4dB better than the other two algorithms. Importantly, for real wireless environment testing, we have also implemented our decoding algorithm in a PNC system built on the USRP software radio platform. Our experiment shows that the proposed Jt-CNC decoder works well in practice.
We demonstrate a dynamic surface plasmonic modulation of graphene-nanowire hybrid structures in visible light range, which was thought to be a tough task for graphene based field effect transistor modulator previously. Static modulation depth of as high as 0.07 dB/μm has been achieved experimentally. Carefully simulation indicates the strongly focused electromagnetic field and dramatically enhanced electric field at the interface between a silver NW and a graphene sheet are key roles for bringing the optical response of the device to the visible range. Furthermore, the modulation behaviors near the Dirac point of monolayer graphene and the singularity of gap-induced bilayer graphene are investigated.
Operator entanglement of two-qubit joint unitary operations is revisited. Schmidt number is an important attribute of a two-qubit unitary operation, and may have connection with the entanglement measure of the unitary operator. We found the entanglement measure of two-qubit unitary operators is classified by the Schmidt number of the unitary operators. The exact relation between the operator entanglement and the parameters of the unitary operator is clarified too.
Nonlocality swapping of bipartite binary correlated boxes can be realized by a \emph{coupler} ($χ$) in nonsignaling models. By studying the swapping process we find that the previous bipartite coupler can be applied to the swapping of two multipartite boxes, and then generate a multipartite box with more users than that of any of the boxes before swapping. Here quantum bound still appears in the scheme. The bipartite coupler also can be applied to a hybrid scheme of generating a multipartite extremal box from many PR boxes. As the analogue of multipartite entanglement swapping, we generalize the nonlocality swapping of bipartite binary boxes to multipartite binary boxes by using a multipartite coupler $χ_{N}$, and get the probability of success by connecting the coupler to the generalized Svetlichny inequality. The multipartite coupler acting on many multipartite boxes makes multipartite nonlocality swapping be a more efficient device to manipulate nonlocality between many users. The results show that Tsirelson's bound for quantum nonlocality emerges only when two of the $n$ boxes involved in the coupler process are noisy ones.
This paper describes the solution method taken by LeBuSiShu team for track1 in ACM KDD CUP 2011 contest (resulting in the 5th place). We identified two main challenges: the unique item taxonomy characteristics as well as the large data set size.To handle the item taxonomy, we present a novel method called Matrix Factorization Item Taxonomy Regularization (MFITR). MFITR obtained the 2nd best prediction result out of more then ten implemented algorithms. For rapidly computing multiple solutions of various algorithms, we have implemented an open source parallel collaborative filtering library on top of the GraphLab machine learning framework. We report some preliminary performance results obtained using the BlackLight supercomputer.
Two noninteracting atoms, initially entangled in Bell states, are coupled to a one-mode cavity. Based on the reduced non-perturbative quantum master equation, the entanglement evolution of the two atoms with decay is investigated beyond rotating-wave approximation. It is shown that the counter-rotating wave terms have great influence on the disentanglement behavior. The phenomenon of entanglement sudden death and entanglement sudden birth will occur.
Hypervolume indicator is a commonly accepted quality measure for comparing Pareto approximation set generated by multi-objective optimizers. The best known algorithm to calculate it for $n$ points in $d$-dimensional space has a run time of $O(n^{d/2})$ with special data structures. This paper presents a recursive, vertex-splitting algorithm for calculating the hypervolume indicator of a set of $n$ non-comparable points in $d>2$ dimensions. It splits out multiple child hyper-cuboids which can not be dominated by a splitting reference point. In special, the splitting reference point is carefully chosen to minimize the number of points in the child hyper-cuboids. The complexity analysis shows that the proposed algorithm achieves $O((\frac{d}{2})^n)$ time and $O(dn^2)$ space complexity in the worst case.
Quantum oracles play key roles in the studies of quantum computation and quantum information. But implementing quantum oracles efficiently with universal quantum gates is a hard work. Motivated by genetic programming, this paper proposes a novel approach to evolve quantum oracles with a hybrid quantum-inspired evolutionary algorithm. The approach codes quantum circuits with numerical values and combines the cost and correctness of quantum circuits into the fitness function. To speed up the calculation of matrix multiplication in the evaluation of individuals, a fast algorithm of matrix multiplication with Kronecker product is also presented. The experiments show the validity and the effects of some parameters of the presented approach. And some characteristics of the novel approach are discussed too.