Searcharxiv⌕ Search

arXiv subjects

Wei Yang

Publications and source records attributed to Wei Yang.

At least 487 records · Page 27Linked to original sources

Discriminatively Trained And-Or Graph Models for Object Shape Detection

In this paper, we investigate a novel reconfigurable part-based model, namely And-Or graph model, to recognize object shapes in images. Our proposed model consists of four layers: leaf-nodes at the bottom are local classifiers for detecting contour fragments; or-nodes above the leaf-nodes function as the switches to activate their child leaf-nodes, making the model reconfigurable during inference; and-nodes in a higher layer capture holistic shape deformations; one root-node on the top, which is also an or-node, activates one of its child and-nodes to deal with large global variations (e.g. different poses and views). We propose a novel structural optimization algorithm to discriminatively train the And-Or model from weakly annotated data. This algorithm iteratively determines the model structures (e.g. the nodes and their layouts) along with the parameter learning. On several challenging datasets, our model demonstrates the effectiveness to perform robust shape-based object detection against background clutter and outperforms the other state-of-the-art approaches. We also release a new shape database with annotations, which includes more than 1500 challenging shape instances, for recognition and detection.

cs.CV↗

Diversity versus Multiplexing at Finite Blocklength

A finite blocklenth analysis of the diversity-multiplexing tradeoff is presented, based on nonasymptotic bounds on the maximum channel coding rate of multiple-antenna block-memoryless Rayleigh-fading channels.The bounds in this paper allow one to numerically assess for which packet size, number of antennas, and degree of channel selectivity, diversity-exploiting schemes are close to optimal, and when instead the available spatial degrees of freedom should be used to provide spatial multiplexing. This finite blocklength view on the diversity-multiplexing tradeoff provides insights on the design of delay-sensitive ultra-reliable communication links.

cs.IT↗

Observation of an intrinsic bandgap and Landau level renormalization in graphene/boron-nitride heterostructures

Van der Waals heterostructures formed by assembling different two-dimensional atomic crystals into stacks can lead to many new phenomena and device functionalities. In particular, graphene/boron-nitride heterostructures have emerged as a very promising system for band engineering of graphene. However, the intrinsic value and origin of the bandgap in such heterostructures remain unresolved. Here we report the observation of an intrinsic bandgap in epitaxial graphene/boron-nitride heterostructures with zero crystallographic alignment angle. Magneto-optical spectroscopy provides a direct probe of the Landau level transitions in this system and reveals a bandgap of ~ 38 meV (440 K). Moreover, the Landau level transitions are characterized by effective Fermi velocities with a critical dependence on specific transitions and magnetic field. These findings highlight the important role of many body interactions in determining the fundamental properties of graphene heterostructures.

cond-mat.mes-hall↗

Gate-dependent Pseudospin Mixing in Graphene/Boron Nitride Moire Superlattices

Electrons in graphene are described by relativistic Dirac-Weyl spinors with a two-component pseudospin1-12. The unique pseudospin structure of Dirac electrons leads to emerging phenomena such as the massless Dirac cone2, anomalous quantum Hall effect2, 3, and Klein tunneling4, 5 in graphene. The capability to manipulate electron pseudospin is highly desirable for novel graphene electronics, and it requires precise control to differentiate the two graphene sub-lattices at atomic level. Graphene/boron nitride (graphene/BN) Moire superlattice, where a fast sub-lattice oscillation due to B-N atoms is superimposed on the slow Moire period, provides an attractive approach to engineer the electron pseudospin in graphene13-18. This unusual Moire superlattice leads to a spinor potential with unusual hybridization of electron pseudospins, which can be probed directly through infrared spectroscopy because optical transitions are very sensitive to excited state wavefunctions. Here, we perform micro-infrared spectroscopy on graphene/BN heterostructure and demonstrate that the Moire superlattice potential is dominated by a pseudospin-mixing component analogous to a spatially varying pseudomagnetic field. In addition, we show that the spinor potential depends sensitively on the gate-induced carrier concentration in graphene, indicating a strong renormalization of the spinor potential from electron-electron interactions. Our study offers deeper understanding of graphene pseudospin structure under spinor Moire potential, as well as exciting opportunities to control pseudospin in two-dimensional heterostructures for novel electronic and photonic nanodevices.

cond-mat.mes-hall↗

Quasi-Static Multiple-Antenna Fading Channels at Finite Blocklength

This paper investigates the maximal achievable rate for a given blocklength and error probability over quasi-static multiple-input multiple-output (MIMO) fading channels, with and without channel state information (CSI) at the transmitter and/or the receiver. The principal finding is that outage capacity, despite being an asymptotic quantity, is a sharp proxy for the finite-blocklength fundamental limits of slow-fading channels. Specifically, the channel dispersion is shown to be zero regardless of whether the fading realizations are available at both transmitter and receiver, at only one of them, or at neither of them. These results follow from analytically tractable converse and achievability bounds. Numerical evaluation of these bounds verifies that zero dispersion may indeed imply fast convergence to the outage capacity as the blocklength increases. In the example of a particular $1 \times 2$ single-input multiple-output (SIMO) Rician fading channel, the blocklength required to achieve $90\%$ of capacity is about an order of magnitude smaller compared to the blocklength required for an AWGN channel with the same capacity. For this specific scenario, the coding/decoding schemes adopted in the LTE-Advanced standard are benchmarked against the finite-blocklength achievability and converse bounds.

cs.IT↗

The Implications from Benchmarking Three Big Data Systems

Along with today's data explosion and application diversification, a variety of hardware platforms for big data are emerging, attracting interests from both industry and academia. The existing hardware platforms represent a wide range of implementation approaches, and different hardware platforms have different strengths. In this paper, we conduct comprehensive evaluations on three representative big data systems: Intel Xeon, Atom (low power processors), and many-core Tilera using BigDataBench - a big data benchmark suite. Then we explore the relative performance of the three implementation approaches by running BigDataBench, and provide strong guidance for the big data systems construction. Through our experiments, we have inferred that a big data system based on specific hardware has different performance in the context of different applications and data volumes. When we construct a system, we should take into account not only the performance or energy consumption of the pure hardware, but also the characteristics of applications running on them. Data scale, application type and complexity should be considered comprehensively when researchers or architects plan to choose fundamental components for their big data systems.

cs.DC↗

PS-TRUST: Provably Secure Solution for Truthful Double Spectrum Auctions

Truthful spectrum auctions have been extensively studied in recent years. Truthfulness makes bidders bid their true valuations, simplifying greatly the analysis of auctions. However, revealing one's true valuation causes severe privacy disclosure to the auctioneer and other bidders. To make things worse, previous work on secure spectrum auctions does not provide adequate security. In this paper, based on TRUST, we propose PS-TRUST, a provably secure solution for truthful double spectrum auctions. Besides maintaining the properties of truthfulness and special spectrum reuse of TRUST, PS-TRUST achieves provable security against semi-honest adversaries in the sense of cryptography. Specifically, PS-TRUST reveals nothing about the bids to anyone in the auction, except the auction result. To the best of our knowledge, PS-TRUST is the first provably secure solution for spectrum auctions. Furthermore, experimental results show that the computation and communication overhead of PS-TRUST is modest, and its practical applications are feasible.

cs.CR↗

SL(n,R)-Toda Black Holes

We consider D-dimensional Einstein gravity coupled to (n-1) U(1) vector fields and (n-2) dilatonic scalars. We find that for some appropriate exponential dilaton couplings of the field strengths, the equations of motion for the static charged ansatz can be reduced to a set of one-dimensional SL(n,R) Toda equations. This allows us to obtain a general class of explicit black holes with mass and (n-1) independent charges. The near-horizon geometry in the extremal limit is AdS_2 x S^{D-2}. The n=2 case gives the Reissner-Nordstrom solution, and the n=3 example includes the Kaluza-Klein dyon. We study the global structure and the black hole thermodynamics and obtain the universal entropy product formula. We also discuss the characteristics of extremal multi-charge black holes that have positive, zero or negative binding energies.

hep-th↗

Inspection and crime prevention: an evolutionary perspective

In this paper, we analyse inspection games with an evolutionary perspective. In our evolutionary inspection game with a large population, each individual is not a rational payoff maximiser, but periodically updates his strategy if he perceives that other individuals' strategies are more successful than his own, namely strategies are subject to the evolutionary pressure. We develop this game into a few directions. Firstly, social norms are incorporated into the game and we analyse how social norms may influence individuals' propensity to engage in criminal behaviour. Secondly, a forward-looking inspector is considered, namely, the inspector chooses the level of law enforcement whilst taking into account the effect that this choice will have on future crime rates. Finally, the game is extended to the one with continuous strategy spaces.

math.OC↗

Near-Optimal Truthful Auction Mechanisms in Secondary Spectrum Markets

In this work, we study spectrum auction problem where each request from secondary users has spatial, temporal, and spectral features. With the requests of secondary users and the reserve price of the primary user, our goal is to design truthful mechanisms that will either maximize the social efficiency or maximize the revenue of the primary user. As the optimal conflict-free spectrum allocation problem is NP-hard, in this work, we design near optimal spectrum allocation mechanisms separately based on the following techniques: derandomized allocation from integer programming formulation, its linear programming (LP) relaxation, and the dual of the LP. We theoretically prove that 1) our near optimal allocation methods are bid monotone, which implys truthful auction mechanisms; and 2) our near optimal allocation methods can achieve a social efficiency or a revenue that is at least $1-\frac{1}{e}$ times of the optimal respectively. At last, we conduct extensive simulations to study the performances (social efficiency, revenue) of the proposed methods, and the simulation results corroborate our theoretical analysis.

cs.NI↗

Quasi-Static SIMO Fading Channels at Finite Blocklength

We investigate the maximal achievable rate for a given blocklength and error probability over quasi-static single-input multiple-output (SIMO) fading channels. Under mild conditions on the channel gains, it is shown that the channel dispersion is zero regardless of whether the fading realizations are available at the transmitter and/or the receiver. The result follows from computationally and analytically tractable converse and achievability bounds. Through numerical evaluation, we verify that, in some scenarios, zero dispersion indeed entails fast convergence to outage capacity as the blocklength increases. In the example of a particular 1*2 SIMO Rician channel, the blocklength required to achieve 90% of capacity is about an order of magnitude smaller compared to the blocklength required for an AWGN channel with the same capacity.

cs.IT↗

A Galerkin approximation scheme for the mean correction in a mean-reversion stochastic differential equation

This paper is concerned with the following Markovian stochastic differential equation of mean-reversion type \[ dR_t= (θ+σα(R_t, t))R_t dt +σR_t dB_t \] with an initial value $R_0=r_0\in\mathbb{R}$, where $θ\in\mathbb{R}$ and $σ>0$ are constants, and the mean correction function $α:\mathbb{R}\times[0,\infty)\to α(x,t)\in\mathbb{R}$ is twice continuously differentiable in $x$ and continuously differentiable in $t$. We first derive that under the assumption of path independence of the density process of Girsanov transformation for the above stochastic differential equation, the mean correction function $α$ satisfies a non-linear partial differential equation which is known as the viscous Burgers equation. We then develop a Galerkin type approximation scheme for the function $α$ by utilizing truncation of discretised Fourier transformation to the viscous Burgers equation.

q-fin.PR↗

Capacity Pre-Log of Noncoherent SIMO Channels via Hironaka's Theorem

We find the capacity pre-log of a temporally correlated Rayleigh block-fading SIMO channel in the noncoherent setting. It is well known that for block-length L and rank of the channel covariance matrix equal to Q, the capacity pre-log in the SISO case is given by 1-Q/L. Here, Q/L can be interpreted as the pre-log penalty incurred by channel uncertainty. Our main result reveals that, by adding only one receive antenna, this penalty can be reduced to 1/L and can, hence, be made to vanish in the large-L limit, even if Q/L remains constant as L goes to infinity. Intuitively, even though the SISO channels between the transmit antenna and the two receive antennas are statistically independent, the transmit signal induces enough statistical dependence between the corresponding receive signals for the second receive antenna to be able to resolve the uncertainty associated with the first receive antenna's channel and thereby make the overall system appear coherent. The proof of our main theorem is based on a deep result from algebraic geometry known as Hironaka's Theorem on the Resolution of Singularities.

cs.IT↗

Electron correlation and spin-orbit coupling effects in US3 and USe3

A systematic density functional theory (DFT)+U study is conducted to investigate the electron correlation and spin-orbit coupling (SOC) effects in US3 and USe3. Our calculations reveal that inclusion of the U term is essential to get energy band gaps for them, indicating the strong correlation effects for uranium 5f electrons. Taking consideration of the SOC effect results in small reduction on the electronic band gaps of US3 and USe3, but largely changes the energy band shapes around the Fermi energy. As a result, US3 has a direct band gap while USe3 has an indirect one. Our calculations predict that both US3 and USe3 are antiferromagnetic insulators, in agreement with corresponding experimental results. Based on our DFT+U calculations, we systematically present the ground-state electronic, mechanical, and Raman properties for US3 and USe3.

cond-mat.str-el↗

On the Capacity of Large-MIMO Block-Fading Channels

We characterize the capacity of Rayleigh block-fading multiple-input multiple-output (MIMO) channels in the noncoherent setting where transmitter and receiver have no a priori knowledge of the realizations of the fading channel. We prove that unitary space-time modulation (USTM) is not capacity-achieving in the high signal-to-noise ratio (SNR) regime when the total number of antennas exceeds the coherence time of the fading channel (expressed in multiples of the symbol duration), a situation that is relevant for MIMO systems with large antenna arrays (large-MIMO systems). This result settles a conjecture by Zheng & Tse (2002) in the affirmative. The capacity-achieving input signal, which we refer to as Beta-variate space-time modulation (BSTM), turns out to be the product of a unitary isotropically distributed random matrix, and a diagonal matrix whose nonzero entries are distributed as the square-root of the eigenvalues of a Beta-distributed random matrix of appropriate size. Numerical results illustrate that using BSTM instead of USTM in large-MIMO systems yields a rate gain as large as 13% for SNR values of practical interest.

cs.IT↗

Diversity versus Channel Knowledge at Finite Block-Length

We study the maximal achievable rate R*(n, ε) for a given block-length n and block error probability εover Rayleigh block-fading channels in the noncoherent setting and in the finite block-length regime. Our results show that for a given block-length and error probability, R*(n, ε) is not monotonic in the channel's coherence time, but there exists a rate maximizing coherence time that optimally trades between diversity and cost of estimating the channel.

cs.IT↗

More than Word Frequencies: Authorship Attribution via Natural Frequency Zoned Word Distribution Analysis

With such increasing popularity and availability of digital text data, authorships of digital texts can not be taken for granted due to the ease of copying and parsing. This paper presents a new text style analysis called natural frequency zoned word distribution analysis (NFZ-WDA), and then a basic authorship attribution scheme and an open authorship attribution scheme for digital texts based on the analysis. NFZ-WDA is based on the observation that all authors leave distinct intrinsic word usage traces on texts written by them and these intrinsic styles can be identified and employed to analyze the authorship. The intrinsic word usage styles can be estimated through the analysis of word distribution within a text, which is more than normal word frequency analysis and can be expressed as: which groups of words are used in the text; how frequently does each group of words occur; how are the occurrences of each group of words distributed in the text. Next, the basic authorship attribution scheme and the open authorship attribution scheme provide solutions for both closed and open authorship attribution problems. Through analysis and extensive experimental studies, this paper demonstrates the efficiency of the proposed method for authorship attribution.

cs.CL↗