Search arXiv⌕ Search

arXiv subjects

Chao Wang

Publications and source records attributed to Chao Wang.

774 records · Page 43Linked to original sources
arXiv2013

Embedding periodic maps on surfaces into those on $S^3$

Call a periodic map $h$ on the closed orientable surface $Σ_g$ extendable if $h$ extends to a periodic map over the pair $(S^3, Σ_g)$ for possible embeddings $e: Σ_g\to S^3$. We determine the extendabilities for all periodical maps on $Σ_2$. The results involve various orientation preserving/reversing behalves of the periodical maps on the pair $(S^3, Σ_g)$. To do this we first list all periodic maps on $Σ_2$, and indeed we exhibit each of them as a composition of primary and explicit symmetries, like rotations, reflections and antipodal maps, which itself should be an interesting piece. A by-product is that for each even $g$, the maximum order periodic map on $Σ_g$ is extendable, which contrasts sharply to the situation in orientation preserving category.

math.GT↗
arXiv2012

Degrees of Freedom of Multi-hop MIMO Broadcast Networks with Delayed CSIT

We study the sum degrees of freedom (DoF) of a class of multi-layer relay-aided MIMO broadcast networks with delayed channel state information at transmitters (CSIT). In the assumed network a K-antenna source intends to communicate to K single-antenna destinations, with the help of N-2 layers of K full-duplex single-antenna relays. We consider two practical delayed CSIT feedback scenarios. If the source can obtain the CSI feedback signals from all layers, we prove the optimal sum DoF of the network to be K/(1+1/2+...+1/K). If the CSI feedback is only within each hop, we show that when K=2 the optimal sum DoF is 4/3, and when K >= 3 the sum DoF 3/2 is achievable. Our results reveal that the sum DoF performance in the considered class of N-layer MIMO broadcast networks with delayed CSIT may depend not on N, the number of layers in the network, but only on K, the number of antennas/terminals in each layer.

cs.IT↗
arXiv2012

Head Frontal-View Identification Using Extended LLE

Automatic head frontal-view identification is challenging due to appearance variations caused by pose changes, especially without any training samples. In this paper, we present an unsupervised algorithm for identifying frontal view among multiple facial images under various yaw poses (derived from the same person). Our approach is based on Locally Linear Embedding (LLE), with the assumption that with yaw pose being the only variable, the facial images should lie in a smooth and low dimensional manifold. We horizontally flip the facial images and present two K-nearest neighbor protocols for the original images and the flipped images, respectively. In the proposed extended LLE, for any facial image (original or flipped one), we search (1) the Ko nearest neighbors among the original facial images and (2) the Kf nearest neighbors among the flipped facial images to construct the same neighborhood graph. The extended LLE eliminates the differences (because of background, face position and scale in the whole image and some asymmetry of left-right face) between the original facial image and the flipped facial image at the same yaw pose so that the flipped facial images can be used effectively. Our approach does not need any training samples as prior information. The experimental results show that the frontal view of head can be identified reliably around the lowest point of the pose manifold for multiple facial images, especially the cropped facial images (little background and centered face).

cs.CV↗
arXiv2012

Extending finite group actions on surfaces over $S^3$

Let $OE_g$ (resp. $CE_g$ and $AE_g$) and resp. $OE^o_g$ be the maximum order of finite (resp. cyclic and abelian) groups $G$ acting on the closed orientable surfaces $Σ_g$ which extend over $(S^3, Σ_g)$ among all embeddings $Σ_g\to S^3$ and resp. unknotted embeddings $Σ_g\to S^3$. It is known that $OE^o_g\le 12(g-1)$, and we show that $12(g-1)$ is reached for an unknotted embedding $Σ_g \to S^3$ if and only if $g = 2$, 3, 4, 5, 6, 9, 11, 17, 25, 97, 121, 241, 601. Moreover $AE_g$ is $2g+2$; and $CE_g$ is $2g+2$ for even $g$, and $2g-2$ for odd $g$. Efforts are made to see intuitively how these maximal symmetries are embedded into the symmetries of the 3-sphere.

math.GT↗
arXiv2012

Single photon counting imaging system via compressive sensing

An imaging system based on single photon counting and compressive sensing (ISSPCCS) is developed to reconstruct a sparse image in absolute darkness. The single photon avalanche detector and spatial light modulator (SLM) of aluminum micro-mirrors are employed in the imaging system while the convex optimization is used in the reconstruction algorithm. The image of an object in the very dark light can be reconstructed from an under-sampling data set, but with very high SNR and robustness. Compared with the traditional single-pixel camera used a photomultiplier tube (PMT) as the detector, the ISSPCCS realizes photon counting imaging, and the count of photons not only carries fluctuations of light intensity, but also is more intuitive.

physics.optics↗
arXiv2011

Multiuser Cellular Network

Modern radio communication is faced with a problem about how to distribute restricted frequency to users in a certain space. Since our task is to minimize the number of repeaters, a natural idea is enlarging coverage area. However, coverage has restrictions. First, service area has to be divided economically as repeater's coverage is limited. In this paper, our fundamental method is to adopt seamless cellular network division. Second, underlying physics content in frequency distribution problem is interference between two close frequencies. Consequently, we choose a proper frequency width of 0.1MHz and a relevantly reliable setting to apply one frequency several times. We make a few general assumptions to simplify real situation. For instance, immobile users yield to homogenous distribution; repeaters can receive and transmit information in any given frequency in duplex operation; coverage is mainly decided by antenna height. Two models are built up to solve 1000 users and 10000 users situations respectively. In order to utilize restricted frequency and PL code, three stratified terms - "cell", "cluster", "group" - are introduced to describe the models in detail. Under our analysis, 91 repeaters for 1000 users and 469 repeaters for 10000 users are viable results. Next, to test stability and sensitivity of models, we give total consideration to the variation of sum of users, antenna height, and frequency width and service radius. Evaluation about models is offered qualitatively. Finally, two practical cases are put forward to gain a partial knowledge of mountainous area. The brief method in dealing with mountains is classified discussion in two ideal conditions. It may provide some constructive suggestions to avoid shortcomings or take proper measures in similar locations.

cs.NI↗
arXiv2011

Proceedings 13th International Workshop on Verification of Infinite-State Systems

This volume contains the proceedings of the 13th International Workshop on Verification of Infinite-State Systems (INFINITY 2011). The workshop was held in Taipei, Taiwan on October 10, 2011, as a satellite event to the 9th International Symposium on Automated Technology for Verification and Analysis (ATVA). The INFINITY workshop aims at providing a forum for researchers who are interested in the development of formal methods and algorithmic techniques for the analysis of systems with infinitely many states, and their application in automated verification of complex software and hardware systems.

cs.LO↗
arXiv2011

Looking for packing units of the protein structure

Lattice-model simulations and experiments of some small proteins suggest that folding is essentially controlled by a few conserved contacts. Residues of these conserved contacts form the minimum set of native contacts needed to ensure foldability. Keeping such conserved specific contacts in mind, we examine contacts made by two secondary structure elements of different helices or sheets and look for possible 'packing units' of the protein structure. Two short backbone fragments of width five centred at the C? atoms in contact is called an H-form, which serves as a candidate for the packing units. The structural alignment of protein family members or even across families indicates that there are conservative H-forms which are similar both in their sequences and local geometry, and consistent with the structural alignment. Carrying strong sequence signals, such packing units would provide 3D constraints as a complement of the potential functions for the structure prediction.

q-bio.BM↗
arXiv2011

Imitating emotions instead of strategies in spatial games elevates social welfare

The success of imitation as an evolutionary driving force in spatial games has often been questioned, especially for social dilemmas such as the snowdrift game, where the most profitable may be the mixed phase sustaining both the cooperative as well as the defective strategy. Here we reexamine this assumption by investigating the evolution of cooperation in spatial social dilemma games, where instead of pure strategies players can adopt emotional profiles of their neighbors. For simplicity, the emotional profile of each player is determined by two pivotal factors only, namely how it behaves towards less and how towards more successful neighbors. We find that imitating emotions such as goodwill and envy instead of pure strategies from the more successful players reestablishes imitation as a tour de force for resolving social dilemmas on structured populations without any additional assumptions or strategic complexity.

physics.soc-ph↗
arXiv2010

Cryogenic Sapphire Oscillator using a low-vibration design pulse-tube cryocooler: First results

A Cryogenic Sapphire Oscillator has been implemented at 11.2 GHz using a low-vibration design pulse-tube cryocooler. Compared with a state-of-the-art liquid helium cooled CSO in the same laboratory, the square root Allan variance of their combined fractional frequency instability is $σ_y = 1.4 \times 10^{-15}τ^{-1/2}$ for integration times $1 < τ< 10$ s, dominated by white frequency noise. The minimum $σ_y = 5.3 \times 10^{-16}$ for the two oscillators was reached at $τ= 20$ s. Assuming equal contributions from both CSOs, the single oscillator phase noise $S_ϕ \approx -96 \; dB \; rad^2/Hz$ at 1 Hz offset from the carrier.

physics.ins-det↗
arXiv2010

The singular limit of a haptotaxis model with bistable growth

We consider a model for haptotaxis with bistable growth and study its singular limit. This yiels an interface motion where the normal velocity of the interface depends on the mean curvature and on some nonlocal haptotaxis term. We prove the result for general initial data after establishing a result about generation of interface in a small time.

math.AP↗
arXiv2010

A Beale-Kato-Majda Blow-up criterion for the 3-D compressible Navier-Stokes equations

We prove a blow-up criterion in terms of the upper bound of the density for the strong solution to the 3-D compressible Navier-Stokes equations. The initial vacuum is allowed. The main ingredient of the proof is \textit{a priori} estimate for an important quantity under the assumption that the density is upper bounded, whose divergence can be viewed as the effective viscous flux.

math.AP↗
arXiv2009

Cooperative Multiplexing: Toward Higher Spectral Efficiency in Multi-antenna Relay Networks

Previous work on cooperative communications has concentrated primarily on the diversity benefits of such techniques. This paper, instead, considers the multiplexing benefits of cooperative communications. First, a new interpretation on the fundamental tradeoff between the transmission rate and outage probability in multi-antenna relay networks is given. It follows that multiplexing gains can be obtained at any finite SNR, in full-duplex multi-antenna relay networks. Thus relaying can offer not only stronger link reliability, but also higher spectral efficiency. Specifically, the decode-and-forward protocol is applied and networks that have one source, one destination, and multiple relays are considered. A receive power gain at the relays, which captures the network large scale fading characteristics, is also considered. It is shown that this power gain can significantly affect the system diversity-multiplexing tradeoff for any finite SNR value. Several relaying protocols are proposed and are shown to offer nearly the same outage probability as if the transmit antennas at the source and the relay(s) were co-located, given certain SNR and receive power gains at the relays. Thus a higher multiplexing gain than that of the direct link can be obtained if the destination has more antennas than the source. Much of the analysis in the paper is valid for arbitrary channel fading statistics. These results point to a view of relay networks as a means for providing higher spectral efficiency, rather than only link reliability.

cs.IT↗
arXiv2009

Scalar Mesons and glueballs in $Dp-Dq$ hard-wall models

We investigate light scalar mesons and glueballs in the $Dp-Dq$ hard-wall models, including $D3-Dq$, $D4-Dq$, and $D6-Dq$ systems. It is found that only in the $D4-D6$ and $D4-D8$ hard wall models, the predicted masses of the ${\bar q} q$ scalar meson $f_0$, scalar glueball are consistent with their experimental or lattice results. This indicates that $D4-D6$ and $D4-D8$ hard-wall models are favorite candidates of the realistic holographic QCD model.

hep-ph↗
arXiv2008

Superposition-Coded Concurrent Decode-and-Forward Relaying

In this paper, a superposition-coded concurrent decode-and-forward (DF) relaying protocol is presented. A specific scenario, where the inter-relay channel is sufficiently strong, is considered. Assuming perfect source-relay transmissions, the proposed scheme further improves the diversity performance of previously proposed repetition-coded concurrent DF relaying, in which the advantage of the inter-relay interference is not fully extracted.

cs.IT↗
arXiv2007

Recovering Multiplexing Loss Through Successive Relaying Using Repetition Coding

In this paper, a transmission protocol is studied for a two relay wireless network in which simple repetition coding is applied at the relays. Information-theoretic achievable rates for this transmission scheme are given, and a space-time V-BLAST signalling and detection method that can approach them is developed. It is shown through the diversity multiplexing tradeoff analysis that this transmission scheme can recover the multiplexing loss of the half-duplex relay network, while retaining some diversity gain. This scheme is also compared with conventional transmission protocols that exploit only the diversity of the network at the cost of a multiplexing loss. It is shown that the new transmission protocol offers significant performance advantages over conventional protocols, especially when the interference between the two relays is sufficiently strong.

cs.IT↗
arXiv2007

Reconstructing the Nonlinear Filter Function of LILI-128 Stream Cipher Based on Complexity

In this letter we assert that we have reconstructed the nonlinear filter function of LILI-128 stream cipher on IBM notebook PC using MATLAB. Our reconstruction need approximately 2^12~2^13 and the attack consumes 5825.016 sec (using tic and toc sentences of MATLAB) or 5825.016/3600=1.6181hours. We got the expression of the nonlinear filter function fd of Lili-128 which has 46 items from liner items to nonlinear items based on complexity, the phase space reconstruction, Clustering and nonlinear prediction. We have verified our reconstruction result correctness by simulating the overview of Lili-128 keystream generators using our getting fd and implement designers reference module of the Lili-128 stream cipher, and two methods produce the same synchronous keystream sequence on same initial state, so that our research work proves that the nonlinear filter function of LILI-128 stream cipher is successfully reconstructed.

cs.CR↗