arXiv subjects

Kang Yang

Publications and source records attributed to Kang Yang.

105 records · Page 6Linked to original sources

arXiv2018

Sparse-View CT Reconstruction via Convolutional Sparse Coding

Traditional dictionary learning based CT reconstruction methods are patch-based and the features learned with these methods often contain shifted versions of the same features. To deal with these problems, the convolutional sparse coding (CSC) has been proposed and introduced into various applications. In this paper, inspired by the successful applications of CSC in the field of signal processing, we propose a novel sparse-view CT reconstruction method based on CSC with gradient regularization on feature maps. By directly working on whole image, which need not to divide the image into overlapped patches like dictionary learning based methods, the proposed method can maintain more details and avoid the artifacts caused by patch aggregation. Experimental results demonstrate that the proposed method has better performance than several existing algorithms in both qualitative and quantitative aspects.

physics.med-ph↗

arXiv2018

Competing Fractional Quantum Hall and Electron Solid Phases in Graphene

We report experimental observation of the reentrant integer quantum Hall effect in graphene, appearing in the N$=$2 Landau level. Similar to high-mobility GaAs/AlGaAs heterostructures, the effect is due to a competition between incompressible fractional quantum Hall states, and electron solid phases. The tunability of graphene allows us to measure the $B$-$T$ phase diagram of the electron-solid phase. The hierarchy of reentrant states suggest spin and valley degrees of freedom play a role in determining the ground state energy. We find that the melting temperature scales with magnetic field, and construct a phase diagram of the electron liquid-solid transition.

cond-mat.mes-hall↗

arXiv2018

Hamiltonian theory for Quantum Hall systems in a tilted magnetic field: robustness of activation gaps

We use the Hamiltonian theory developed by Shankar and Murthy to study a quantum Hall system in a tilted magnetic field. With a finite width of the system in the $z$ direction, the parallel component of the magnetic field introduces anisotropy into the effective two-dimensional interactions. The effects of such anisotropy can be effectively captured by the recently proposed generalized pseudo-potentials. We find that the off-diagonal components of the pseudo-potentials lead to mixing of composite fermions Landau levels, which is a perturbation to the picture of $p$ filled Landau levels in composite-fermion theory. By changing the internal geometry of the composite fermions, such a perturbation can be minimized and one can find the corresponding activation gaps for different tilting angles, and we calculate the associated optimal metric. Our results show that the activation gap is remarkably robust against the in-plane magnetic field in the lowest Landau level.

cond-mat.str-el↗

arXiv2018

A discrete unified gas-kinetic scheme for immiscible two-phase flows

In this work, we extend the discrete unified gas-kinetic scheme (DUGKS) [Guo et al., Phys. Rev. E 88, 033305 (2013)] to continue two-phase flows. In the framework of DUGKS, two kinetic model equations are used to solve the quasi-incompressible phase-field governing equations [Yang et al., Phys. Rev.E 93, 043303 (2016)]. One is for the Chan-Hilliard (CH) equation and the other is for the Navier-Stokes equations. The DUGKS can correctly recover the quasi-incompressible phase-field governing equations through the Chapman-Enskog analysis. Unlike previous phase-field-based LB models, the Courant-Friedricks-Lewy condition in DUGKS is ajustable which can increase numerical stability. Furthermore, with the finite-volume formulation the model can be easily implemented on non-uniform meshes which can improve numerical precision. The proposed model is validated by simulating a stationary drop, layered Poiseuille flow, rising bubble and Rayleigh-Taylor instability and comparing with the quasi-incompressible lattice Boltzmann method (LBM). Numerical results show that the method can track the interface with high accuracy and stability. The model is also capable of dealing with a wider range of viscosity and density ratios than the quasi-incompressible lattice Boltzmann model. The present model is a promising tool for numerical simulation of two-phase flows.

physics.comp-ph↗

arXiv2017

Non-jumping Numbers for 5-Uniform Hypergraphs

Let $\ell$ and $r$ be integers. A real number $α\in [0,1)$ is a jump for $r$ if for any $\varepsilon > 0$ and any integer $m,\ m \geq r$, any $r$-uniform graph with $n > n_0(\varepsilon,m)$ vertices and at least α+ \varepsilon)\binom{n}{r}$ edges contains a subgraph with $m$ vertices and at least $(α+c)\binom{m}{r}$ edges, where $c=c(α)$ does not depend on $\varepsilon$ and $m$. It follows from a theorem of Erdős, Stone and Simonovits that every $α\in [0,1)$ is a jump for $r=2$. Erdős asked whether the same is true for $r \geq 3$. However, Frankl and Rödl gave a negative answer by showing that $1-\frac{1}{\ell^{r-1}}$ is not a jump for $r$ if $r \geq 3$ and $\ell >2r$. Peng gave more sequences of non-jumping numbers for $r=4$ and $r\geq 3$. However, there are also a lot of unknowns on determining whether a number is a jump for $r \geq 3$. Following a similar approach as that of Frankl and Rödl, we give several sequences of non-jumping numbers for $r=5$, and extend one of the results to every $r \geq 5$, which generalize the above results.

math.CO↗

arXiv2017

The principle of the mutual energy

Advanced potential solution of Maxwell equations isn't often accepted. We have proven if without advanced potential, it is not possible to satisfy the Maxwell equations. We also shown that it is not the Poynting vector related energy current transferring energy in the space and it is the mutual energy really did that. A important result of the mutual energy theorem is that the advanced potential can suck energy from the transmitter. This energy is equal to the energy received at the receiver. Hence a transmitter can not send any energy out without the receiver. For two remote objects, the energy is transferred only can by the mutual energy of a retarded potential from the source together with an advanced potential from the sink. If the sucked energy is discrete, the summation of mutual energy current of the infinite background atoms or currents, which can be seen as receivers, is a random process. This means that the photon energy sent by the transmitter is actually grabbed by the receiver. Hence the photon from very beginning knows their destination. This receiver send advanced potential to the transmitter. This explanation also avoided the wave function collapse. The retarded potential first reached the receiver, cause the current in the receiver, the current of receiver send a advanced potential to the transmitter with a reversed time, in the same time, a photon minus-time-instantly runs from receiver to transmitter. In our normal feeling, the photon is still runs from the transmitter to the receiver with a positive time. How to transfer superluminal signal using advanced potential is also discussed.Maxwell equations as principle of the theory of the electromagnetic fields is replaced by the mutual energy principle.

physics.class-ph↗

arXiv2017

Simple Floquet-Wannier-Stark-Andreev viewpoint and emergence of low-energy scales in a voltage-biased three-terminal Josephson junction

A three-terminal Josephson junction consists of three superconductors coupled coherently to a small nonsuperconducting island, such as a diffusive metal, a single or double quantum dot. A specific resonant single quantum dot three-terminal Josephson junction $(S_a,S_b,S_c)$ biased with voltages $(V,-V,0)$ is considered, but the conclusions hold more generally for resonant semi-conducting quantum wire set-ups. A simple physical picture of the steady state is developed, using Floquet theory. It is shown that the equilibrium Andreev bound states (for $V=0$) evolve into nonequilibrium Floquet-Wannier-Stark-Andreev (FWS-Andreev) ladders of resonances (for $V\ne 0$). These resonances acquire a finite width due to multiple Andreev reflection (MAR) processes. We also consider the effect of an extrinsic line-width broadening on the quantum dot, introduced through a Dynes phenomenological parameter. The DC-quartet current manifests a cross-over between the extrinsic relaxation dominated regime at low voltage to an intrinsic relaxation due to MAR processes at higher voltage. Finally, we study the coupling between the two FWS-Andreev ladders due to Landau-Zener-Stückelberg transitions, and its effect on the cross-over in the relaxation mechanism. Three important low-energy scales are identified, and a perspective is to relate those low-energy scales to a recent noise cross-correlation experiment [Y. Cohen {\it et al.}, arXiv:1606.08436].

cond-mat.mes-hall↗

arXiv2016

The mutual energy current interpretation for quantum mechanics

Quantum physics has the probability interpretation. From the knowledge of light, we know that wave is always spread out, and hence the electron wave should also spread out. That means the electron wave beam should like the light wave beam become diverged from the source. When the electron is received by an atom we thought the wave collapse. The place to collapse is depends on the probability calculated from the square of absolute value of the wave function. The recent new discovery tell us that the light is not just wave, it is a combination of waves, retarded potential and advanced potential. These two potentials together produce the mutual energy current or referred as M-current. Another light energy current is P-current related to Poynting vector. We found P-current doesn't carry any energy for light. The contribution of P-current to energy transfer can be omitted. The light energy is transferred only by M-current. The beam of M-current doesn't like the beam of P-current which is diverged from the source, instead, the M-current beam first diverges from a source and then converged to a sink. Since the M-current at the place to be received is localized at one electron, the concept of wave function collapse is needless. The probability results of light is because that we have use P-current to roughly calculate the M-current. We thought if Schrödinger knew today's light theory, he would for sure also build his wave theory for quantum mechanics similar to the new light theory with M-current. Hence we claim that the M-current theory is not only suitable to the light but also can be applied to the quantum physics. This means all particles are M-current. The M-current is composed of not only the retarded wave, but also the advanced wave. M-current is an inner product of a retarded and an advanced waves.

physics.gen-ph↗

arXiv2015

Image Reconstruction Image reconstruction by using local inverse for full field of view

The iterative refinement method (IRM) has been very successfully applied in many different fields for examples the modern quantum chemical calculation and CT image reconstruction. It is proved that the refinement method can create an exact inverse from an approximate inverse with a few iterations. The IRM has been used in CT image reconstruction to lower the radiation dose. The IRM utilize the errors between the original measured data and the recalculated data to correct the reconstructed images. However if it is not smooth inside the object, there often is an over-correction along the boundary of the organs in the reconstructed images. The over-correction increase the noises especially on the edges inside the image. One solution to reduce the above mentioned noises is using some kind of filters. Filtering the noise before/after/between the image reconstruction processing. However filtering the noises also means reduce the resolution of the reconstructed images. The filtered image is often applied to the image automation for examples image segmentation or image registration but diagnosis. For diagnosis, doctor would prefer the original images without filtering process. In the time these authors of this manuscript did the work of interior image reconstruction with local inverse method, they noticed that the local inverse method does not only reduced the truncation artifacts but also reduced the artifacts and noise introduced from filtered back-projection method without truncation. This discovery lead them to develop the sub-regional iterative refinement (SIRM) image reconstruction method. The SIRM did good job to reduce the artifacts and noises in the reconstructed images. The SIRM divide the image to many small sub-regions. To each small sub-region the principle of local inverse method is applied.

physics.med-ph↗

arXiv2015

A lattice Boltzmann method for binary fluids based on mass-conserved quasi-incompressible phase-field theory

In this paper, a lattice Boltzmann equation (LBE) model is proposed for binary fluids based on a quasi-incompressible phase-field model [J. Shen et al, Comm. Comp. Phys. 13, 1045 (2013)]. Compared with the other incompressible LBE models based on the incompressible phase-field theory, the quasi-incompressible model conserves mass locally. A series of numerical simulations are performed to validate the proposed model, and comparisons with an incompressible LBE model [H. Liang et al, Phys. Rev. E 89, 053320 (2014)] are also carried out. It is shown that the proposed model can track the interface accurately, and the predictions by the quasi-incompressible and incompressible models agree qualitatively well as the distribution of chemical potential is uniform, otherwise differ significantly.

physics.flu-dyn↗

arXiv2015

The modified Poynting theorem and the concept of mutual energy

The goal of this article is to derive the reciprocity theorem, mutual energy theorem from Poynting theorem instead of from Maxwell equation. The Poynting theorem is generalized to the modified Poynting theorem. In the modified Poynting theorem the electromagnetic field is superimposition of different electromagnetic fields including the retarded potential and advanced potential, time-offset field. The media epsilon (permittivity) and mu (permeability) can also be different in the different fields. The concept of mutual energy is introduced which is the difference between the total energy and self-energy. Mixed mutual energy theorem is derived. We derive the mutual energy from Fourier domain. We obtain the time-reversed mutual energy theorem and the mutual energy theorem. Then we derive the mutual energy theorem in time-domain. The instantaneous modified mutual energy theorem is derived. Applying time-offset transform and time integral to the instantaneous modified mutual energy theorem, the time-correlation modified mutual energy theorem is obtained. Assume there are two electromagnetic fields one is retarded potential and one is advanced potential, the convolution reciprocity theorem can be derived. Corresponding to the modified time-correlation mutual energy theorem and the time-convolution reciprocity theorem in Fourier domain, there is the modified mutual energy theorem and the Lorentz reciprocity theorem. Hence all mutual energy theorem and the reciprocity theorems are put in one frame of the concept of the mutual energy. 3 new Complementary theorems are derived. The inner product is introduced for two different electromagnetic fields in both time domain and Fourier domain for the application of the wave expansion.

physics.gen-ph↗

arXiv2014

An extension of Mantel's theorem to random 4-uniform hypergraphs

A sparse version of Mantel's Theorem is that, for sufficiently large $p$, with high probability (w.h.p.), every maximum triangle-free subgraph of $G(n,p)$ is bipartite. DeMarco and Kahn proved this for $p>K \sqrt{\log n/n}$ for some constant $K$, and apart from the value of the constant, this bound is the best possible. Denote by $T_3$ the 3-uniform hypergraph with vertex set $\{a,b,c,d,e\}$ and edge set $\{abc,ade,bde\}$. Frankl and Füredi showed that the maximum 3-uniform hypergraph on $n$ vertices containing no copy of $T_3$ is tripartite for $n> 3000$. For some integer $k$, let $G^k(n,p)$ be the random $k$-uniform hypergraph. Balogh et al. proved that for $p>K \log n/n$ for some constant $K$, every maximum $T_3$-free subhypergraph of $G^3(n,p)$ w.h.p. is tripartite and it does not hold when $p=0.1 \sqrt{\log n}/n$. Denote by $T_4$ the 4-uniform hypergraph with vertex set $\{1,2,3,4,5,6,7\}$ and edge set $\{1234,1235,4567\}$. Pikhurko proved that there is an $n_0$ such that for all $n\ge n_0$, the maximum 4-uniform hypergraph on $n$ vertices containing no copy of $T_4$ is 4-partite. In this paper, we extend this type of extremal problem in random 4-uniform hypergraphs. We show that for some constant $K$ and $p>K \log n/n$, w.h.p. every maximum $T_4$-free subhypergraph of $G^4(n,p)$ is 4-partite.

math.CO↗

arXiv2013

Graphs with $4$-rainbow index $3$ and $n-1$

Let $G$ be a nontrivial connected graph with an edge-coloring $c:E(G)\rightarrow \{1,2,\ldots,q\},$ $q\in \mathbb{N}$, where adjacent edges may be colored the same. A tree $T$ in $G$ is called a $rainbow~tree$ if no two edges of $T$ receive the same color. For a vertex set $S\subseteq V(G)$, a tree that connects $S$ in $G$ is called an {\it $S$-tree}. The minimum number of colors that are needed in an edge-coloring of $G$ such that there is a rainbow $S$-tree for every $k$-set $S$ of $V(G)$ is called the {\it $k$-rainbow index} of $G$, denoted by $rx_k(G)$. Notice that an lower bound and an upper bound of the $k$-rainbow index of a graph with order $n$ is $k-1$ and $n-1$, respectively. Chartrand et al. got that the $k$-rainbow index of a tree with order $n$ is $n-1$ and the $k$-rainbow index of a unicyclic graph with order $n$ is $n-1$ or $n-2$. Li and Sun raised the open problem of characterizing the graphs of order $n$ with $rx_k(G)=n-1$ for $k\geq 3$. In early papers we characterized the graphs of order $n$ with 3-rainbow index 2 and $n-1$. In this paper, we focus on $k=4$, and characterize the graphs of order $n$ with 4-rainbow index 3 and $n-1$, respectively.

math.CO↗

arXiv2013

Graphs with 3-rainbow index $n-1$ and $n-2$

Let $G$ be a nontrivial connected graph with an edge-coloring $c:E(G)\rightarrow \{1,2,\ldots,q\},$ $q\in \mathbb{N}$, where adjacent edges may be colored the same. A tree $T$ in $G$ is a $rainbow tree$ if no two edges of $T$ receive the same color. For a vertex set $S\subseteq V(G)$, the tree connecting $S$ in $G$ is called an $S$-tree. The minimum number of colors that are needed in an edge-coloring of $G$ such that there is a rainbow $S$-tree for each $k$-set $S$ of $V(G)$ is called the $k$-rainbow index of $G$, denoted by $rx_k(G)$. In \cite{Zhang}, they got that the $k$-rainbow index of a tree is $n-1$ and the $k$-rainbow index of a unicyclic graph is $n-1$ or $n-2$. So there is an intriguing problem: Characterize graphs with the $k$-rainbow index $n-1$ and $n-2$. In this paper, we focus on $k=3$, and characterize the graphs whose 3-rainbow index is $n-1$ and $n-2$, respectively.

math.CO↗

arXiv2013

The 3-rainbow index of a graph

Let $G$ be a nontrivial connected graph with an edge-coloring $c: E(G)\rightarrow \{1,2,...,q\},$ $q \in \mathbb{N}$, where adjacent edges may be colored the same. A tree $T$ in $G$ is a $rainbow tree$ if no two edges of $T$ receive the same color. For a vertex subset $S\subseteq V(G)$, a tree that connects $S$ in $G$ is called an $S$-tree. The minimum number of colors that are needed in an edge-coloring of $G$ such that there is a rainbow $S$-tree for each $k$-subset $S$ of $V(G)$ is called $k$-rainbow index, denoted by $rx_k(G)$. In this paper, we first determine the graphs whose 3-rainbow index equals 2, $m,$ $m-1$, $m-2$, respectively. We also obtain the exact values of $rx_3(G)$ for regular complete bipartite and multipartite graphs and wheel graphs. Finally, we give a sharp upper bound for $rx_3(G)$ of 2-connected graphs and 2-edge connected graphs, and graphs whose $rx_3(G)$ attains the upper bound are characterized.

math.CO↗