Searcharxiv⌕ Search

arXiv subjects

Tao Jiang

Publications and source records attributed to Tao Jiang.

At least 325 records · Page 18Linked to original sources
arXiv2017

Gate tunable third-order nonlinear optical response of massless Dirac fermions in graphene

Materials with massless Dirac fermions can possess exceptionally strong and widely tunable optical nonlinearities. Experiments on graphene monolayer have indeed found very large third-order nonlinear responses, but the reported variation of the nonlinear optical coefficient by orders of magnitude is not yet understood. A large part of the difficulty is the lack of information on how doping or chemical potential affects the different nonlinear optical processes. Here we report the first experimental study, in corroboration with theory, on third harmonic generation (THG) and four-wave mixing (FWM) in graphene that has its chemical potential tuned by ion-gel gating. THG was seen to have enhanced by ~30 times when pristine graphene was heavily doped, while difference-frequency FWM appeared just the opposite. The latter was found to have a strong divergence toward degenerate FWM in undoped graphene, leading to a giant third-order nonlinearity. These truly amazing characteristics of graphene come from the possibility to gate-control the chemical potential, which selectively switches on and off one- and multi-photon resonant transitions that coherently contribute to the optical nonlinearity, and therefore can be utilized to develop graphene-based nonlinear optoelectronic devices.

cond-mat.mes-hall↗
arXiv2017

Marine Wireless Big Data: Efficient Transmission, Related Applications, and Challenges

The vast volume of marine wireless sampling data and its continuously explosive growth herald the coming of the era of marine wireless big data. Two challenges imposed by these data are how to fast, reliably, and sustainably deliver them in extremely hostile marine environments and how to apply them after collection. In this article, we first propose an architecture of heterogeneous marine networks that flexibly exploits the existing underwater wireless techniques as a potential solution for fast data transmission. We then investigate the possibilities of and develop the schemes for energy-efficient and reliable undersea transmission without or slightly with data rate reduction. After discussing the data transmission, we summarize the possible applications of the collected big data and particularly focus on the problems of applying these data in sea-surface object detection and marine object recognition. Open issues and challenges that need to be further explored regarding transmission and detection/recognition are also discussed in the article.

cs.IT↗
arXiv2017

Ultra-Dense HetNets Meet Big Data: Green Frameworks, Techniques, and Approaches

Ultra-dense heterogeneous networks (Ud-HetNets) have been put forward to improve the network capacity for next-generation wireless networks. However, counter to the 5G vision, ultra-dense deployment of networks would significantly increase energy consumption and thus decrease network energy efficiency suffering from the conventional worst-case network design philosophy. This problem becomes particularly severe when Ud-HetNets meet big data because of the traditional reactive request-transmit service mode. In view of these, this article first develops a big-data-aware artificial intelligent based framework for energy-efficient operations of Ud-HetNets. Based on the framework, we then identify four promising techniques, namely big data analysis, adaptive base station operation, proactive caching, and interference-aware resource allocation, to reduce energy cost on both large and small scales. We further develop a load-aware stochastic optimization approach to show the potential of our proposed framework and techniques in energy conservation. In a nutshell, we devote to constructing green Ud-HetNets of big data with the abilities of learning and inferring by improving the flexibility of control from worst-case to adaptive design and shifting the manner of services from reactive to proactive modes.

cs.IT↗
arXiv2017

Green Heterogeneous Cloud Radio Access Networks: Potential Techniques, Performance Tradeoffs, and Challenges

As a flexible and scalable architecture, heterogeneous cloud radio access networks (H-CRANs) inject strong vigor into the green evolution of current wireless networks. But the brutal truth is that energy efficiency (EE) improves at the cost of other indexes such as spectral efficiency (SE), fairness, and delay. It is thus important to investigate performance tradeoffs for striking flexible balances between energy-efficient transmission and excellent quality-of-service (QoS) guarantees under this new architecture. In this article, we first propose some potential techniques to energy-efficiently operate H-CRANs by exploiting their features. We then elaborate the initial ideas of modeling three fundamental tradeoffs, namely EE-SE, EE-fairness, and EE-delay tradeoffs, when applying these green techniques, and present open issues and challenges for future investigations. These related results are expected to shed light on green operation of H-CRANs from adaptive resource allocation, intelligent network control, and scalable network planning.

cs.IT↗
arXiv2017

Online Energy Management for a Sustainable Smart Home with an HVAC Load and Random Occupancy

In this paper, we investigate the problem of minimizing the sum of energy cost and thermal discomfort cost in a long-term time horizon for a sustainable smart home with a Heating, Ventilation, and Air Conditioning (HVAC) load. Specifically, we first formulate a stochastic program to minimize the time average expected total cost with the consideration of uncertainties in electricity price, outdoor temperature, renewable generation output, electrical demand, the most comfortable temperature level, and home occupancy state. Then, we propose an online energy management algorithm based on the framework of Lyapunov optimization techniques without the need to predict any system parameters. The key idea of the proposed algorithm is to construct and stabilize four queues associated with indoor temperature, electric vehicle charging, and energy storage. Moreover, we theoretically analyze the feasibility and performance guarantee of the proposed algorithm. Extensive simulations based on real-world traces show the effectiveness of the proposed algorithm.

eess.SY↗
arXiv2017

Fog-Assisted Operational Cost Reduction for Cloud Data Centers

In this paper, we intend to reduce the operational cost of cloud data centers with the help of fog devices, which can avoid the revenue loss due to wide-area network propagation delay and save network bandwidth cost by serving nearby cloud users. Since fog devices may not be owned by a cloud service provider, they should be compensated for serving the requests of cloud users. When taking economical compensation into consideration, the optimal number of requests processed locally by each fog device should be decided. As a result, existing load balancing schemes developed for cloud data centers can not be applied directly and it is very necessary to redesign a cost-ware load balancing algorithm for the fog-cloud system. To achieve the above aim, we first formulate a fog-assisted operational cost minimization problem for the cloud service provider. Then, we design a parallel and distributed load balancing algorithm with low computational complexity based on Proximal Jacobian Alternating Direction Method of Multipliers (PJ-ADMM). Finally, extensive simulation results show the effectiveness of the proposed algorithm.

cs.DC↗
arXiv2017

UrbanFACET: Visually Profiling Cities from Mobile Device Recorded Movement Data of Millions of City Residents

Cities are living systems where urban infrastructures and their functions are defined and evolved due to population behaviors. Profiling the cities and functional regions has been an important topic in urban design and planning. This paper studies a unique big data set which includes daily movement data of tens of millions of city residents, and develop a visual analytics system, namely UrbanFACET, to discover and visualize the dynamical profiles of multiple cities and their residents. This big user movement data set, acquired from mobile users' agnostic check-ins at thousands of phone APPs, is well utilized in an integrative study and visualization together with urban structure (e.g., road network) and POI (Point of Interest) distributions. In particular, we novelly develop a set of information-theory based metrics to characterize the mobility patterns of city areas and groups of residents. These multifaceted metrics including Fluidity, vibrAncy, Commutation, divErsity, and densiTy (FACET) which categorize and manifest hidden urban functions and behaviors. UrbanFACET system further allows users to visually analyze and compare the metrics over different areas and cities in metropolitan scales. The system is evaluated through both case studies on several big and heavily populated cities, and user studies involving real-world users.

cs.SI↗
arXiv2017

Supersaturation of Even Linear Cycles in Linear Hypergraphs

A classic result of Erdős and, independently, of Bondy and Simonovits says that the maximum number of edges in an $n$-vertex graph not containing $C_{2k}$, the cycle of length $2k$, is $O( n^{1+1/k})$. Simonovits established a corresponding supersaturation result for $C_{2k}$'s, showing that there exist positive constants $C,c$ depending only on $k$ such that every $n$-vertex graph $G$ with $e(G)\geq Cn^{1+1/k}$ contains at least $c\left(\frac{e(G)}{v(G)}\right)^{2k}$ many copies of $C_{2k}$, this number of copies tightly achieved by the random graph (up to a multiplicative constant). In this paper, we extend Simonovits' result to a supersaturation result of $r$-uniform linear cycles of even length in $r$-uniform linear hypergraphs. Our proof is self-contained and includes the $r=2$ case. As an auxiliary tool, we develop a reduction lemma from general host graphs to almost-regular host graphs that can be used for other supersaturation problems, and may therefore be of independent interest.

math.CO↗
arXiv2017

Radiative control of dark excitons at room temperature by nano-optical antenna-tip induced Purcell effect

Excitons, Coulomb-bound electron and hole pairs, are elementary photo-excitations in semiconductors, that can couple directly to light through radiative relaxation. In contrast to these bright excitons, dark excitons X$\rm{_D}$ with anti-parallel electron spin polarization exist, with generally forbidden radiative emission. Because of their associated long lifetimes, these dark excitons are appealing candidates for quantum computing and opto-electronic devices. However, optical read-out and control of X$\rm{_D}$ states have remained a major challenge due to their decoupling from light. Here, we present a novel tip-enhanced nano-optical approach to precisely switch and programmably modulate the X$\rm{_D}$ emission even at room temperature. Using monolayer two-dimensional transition metal dichalcogenide (TMD) WSe$\rm{_2}$ on a gold film as model system, we demonstrate ${\sim} 6 \times 10^5$-fold enhancement in dark exciton photoluminescence quantum yield. This is achieved by the unique coupling of the nano-optical antenna-tip to the dark exciton \textit{out-of-plane} optical dipole moment, with an extraordinary Purcell factor of $\ge 2 \times 10^3$ of the tip-sample nano-cavity. Compared to the necessity of cryogenic temperatures and high magnetic fields in conventional approaches, our work provides a new way to harness excitonic properties in low-dimensional semiconductors and new strategies for quantum opto-electronic devices.

cond-mat.mtrl-sci↗
arXiv2017

The uniform local asymptotics of the total net loss process in a new time-dependent bidimensional renewal model

In this paper, we consider a bidimensional renewal risk model with constant force of interest, in which the claim size vector with certain local subexponential marginal distribution and its inter-arrival time are subject to a new time-dependence structure. We obtain the uniform local asymptotics of the total net loss process in the model. Moreover, some specific examples of the joint distribution satisfying the conditions of the dependence structure are given. Finally, in order to illustrate a condition of the above result, a local subexponential distribution is find for the first time that, its local distribution is not almost decreased.

math.PR↗
arXiv2017

Base Station ON-OFF Switching in 5G Wireless Networks: Approaches and Challenges

To achieve the expected 1000x data rates under the exponential growth of traffic demand, a large number of base stations (BS) or access points (AP) will be deployed in the fifth generation (5G) wireless systems, to support high data rate services and to provide seamless coverage. Although such BSs are expected to be small-scale with lower power, the aggregated energy consumption of all BSs would be remarkable, resulting in increased environmental and economic concerns. In existing cellular networks, turning off the under-utilized BSs is an efficient approach to conserve energy while preserving the quality of service (QoS) of mobile users. However, in 5G systems with new physical layer techniques and the highly heterogeneous network architecture, new challenges arise in the design of BS ON-OFF switching strategies. In this article, we begin with a discussion on the inherent technical challenges of BS ON-OFF switching. We then provide a comprehensive review of recent advances on switching mechanisms in different application scenarios. Finally, we present open research problems and conclude the paper.

cs.NI↗
arXiv2017

Distributed Real-Time Energy Management in Data Center Microgrids

Data center operators are typically faced with three significant problems when running their data centers, i.e., rising electricity bills, growing carbon footprints and unexpected power outages. To mitigate these issues, running data centers in microgrids is a good choice since microgrids can enhance the energy efficiency, sustainability and reliability of electrical services. Thus, in this paper, we investigate the problem of energy management for multiple data center microgrids. Specifically, we intend to minimize the long-term operational cost of data center microgrids by taking into account the uncertainties in electricity prices, renewable outputs and data center workloads. We first formulate a stochastic programming problem with the considerations of many factors, e.g., providing heterogeneous service delay guarantees for batch workloads, interactive workload allocation, batch workload shedding, electricity buying/selling, battery charging/discharging efficiency, and the ramping constraints of backup generators. Then, we design a realtime and distributed algorithm for the formulated problem based on Lyapunov optimization technique and a variant of alternating direction method of multipliers (ADMM). Moreover, the performance guarantees provided by the proposed algorithm are analyzed. Extensive simulation results indicate the effectiveness of the proposed algorithm in operational cost reduction for data center microgrids.

cs.DC↗
arXiv2016

Turan numbers of extensions of some sparse hypergraphs via Lagrangians

Given a positive integer $n$ and an $r$-uniform hypergraph (or $r$-graph for short) $F$, the Turan number $ex(n,F)$ of $F$ is the maximum number of edges in an $r$-graph on $n$ vertices that does not contain $F$ as a subgraph. The extension $H^F $ of $F$ is obtained as follows: For each pair of vertices $v_i,v_j$ in $F$ not contained in an edge of $F$, we add a set $B_{ij}$ of $r-2$ new vertices and the edge $\{v_i,v_j\} \cup B_{ij}$, where the $B_{ij}$ 's are pairwise disjoint over all such pairs $\{i,j\}$. Let $K^r_p$ denote the complete $r$-graph on $p$ vertices. For all sufficiently large $n$, we determine the Turan numbers of the extensions of a $3$-uniform $t$-matching, a $3$-uniform linear star of size $t$, and a $4$-uniform linear star of size $t$, respectively. We also show that the unique extremal hypergraphs are balanced blowups of $K^3_{3t-1}, K^3_{2t}$, and $K^4_{3t}$, respectively. Our results generalize the recent result of Hefetz and Keevash [7].

math.CO↗
arXiv2016

Cycles of given lengths in hypergraphs

In this paper, we develop a method for studying cycle lengths in hypergraphs. Our method is built on earlier ones used in [21,22,18]. However, instead of utilizing the well-known lemma of Bondy and Simonovits [4] that most existing methods do, we develop a new and very simple lemma in its place. One useful feature of the new lemma is its adaptiveness for the hypergraph setting. Using this new method, we prove a conjecture of Verstraëte [37] that for $r\ge 3$, every $r$-uniform hypergraph with average degree $Ω(k^{r-1})$ contains Berge cycles of $k$ consecutive lengths. This is sharp up to the constant factor. As a key step and a result of independent interest, we prove that every $r$-uniform linear hypergraph with average degree at least $7r(k+1)$ contains Berge cycles of $k$ consecutive lengths. In both of these results, we have additional control on the lengths of the cycles, which therefore also gives us bounds on the Turán numbers of Berge cycles (for even and odd cycles simultaneously). In relation to our main results, we obtain further improvements on the Turán numbers of Berge cycles and the Zarankiewicz numbers of even cycles. We will also discuss some potential further applications of our method.

math.CO↗
arXiv2016

Novel 16-QAM and 64-QAM Near-Complementary Sequences with Low PMEPR in OFDM Systems

In this paper, we firstly propose a novel construction of $16$-quadrature amplitude modulation (QAM) near-complementary sequences with low peak-to-mean envelope power ratio (PMEPR) in orthogonal frequency division multiplexing (OFDM) systems. The proposed $16$-QAM near-complementary sequences can be constructed by utilizing novel nonlinear offsets, where the length of the sequences is $n=2^m$. The family size of the newly constructed $16$-QAM near-complementary sequences is $8\times (\frac{m!}{2})\times 4^{m+1}$, and the PMEPR of these sequences is proven to satisfy ${\textrm{PMEPR}}\leq 2.4$. Thus, the proposed construction can generate a number of $16$-QAM near-complementary sequences with low PMEPR, resulting in the improvement of the code rate in OFDM systems. Furthermore, we also propose a novel construction of $64$-QAM near-complementary sequences with low PMEPR, which is the first proven construction of $64$-QAM near-complementary sequences. The PMEPRs of two types of the proposed $64$-QAM near-complementary sequences are proven to satisfy that ${\textrm{PMEPR}}\leq 3.62$ or ${\textrm{PMEPR}}\leq 2.48$, respectively. The family size of the newly constructed $64$-QAM near-complementary sequences is $64\times (\frac{m!}{2})\times 4^{m+1}$.

cs.IT↗
arXiv2016

Perturbation-Assisted PAPR Reduction for Large-Scale MIMO-OFDM Systems via ADMM

We consider the problem of peak-to-average power ratio (PAPR) reduction for orthogonal frequency-division multiplexing (OFDM) based large-scale multiple-input multipleoutput (MIMO) systems. A novel perturbation-assisted scheme is developed to reduce the PAPRs of the transmitted signals by exploiting the redundant degrees-of-freedom (DoFs) inherent in the large-scale antenna array. Specifically, we introduce artificial perturbation signals to the frequency-domain precoded signals, with the aim of reducing the PAPRs of their time-domain counterpart signals. Meanwhile, the additive perturbation signal associated with each tone is constrained to lie in the null-space of its associated channel matrix, such that it does not cause any multi-user inference or out-of-band radiations. Such a problem is formulated as a convex optimization problem, and an efficient algorithm is developed by resorting to the variable splitting and alterative direction method of multipliers (ADMM) techniques. Simulation results show that the proposed method has a fast convergence rate and achieves substantial PAPR reduction within only tens of iterations. In addition, unlike other precoding-based PAPR reduction methods, our proposed method which introduces perturbation signals to the precoded signals is independent of the precoding stage and thus could be more suitable for practical systems.

cs.IT↗
arXiv2016

Uplink Spectral Efficiency Analysis of Decoupled Access in Multiuser MIMO Communications

In a heterogeneous network consisting of macro base stations (MBSs) and small base stations (SBSs), the traditional cell association policy, i.e., coupled access (CA), is far from optimal, due to the significant difference between the coverage and transmit powers of MBSs and SBSs. Hence, users may choose to associate with different types of BSs in downlink (DL) and uplink (UL), i.e., decoupled access (DA), to enhance spectral efficiency. In this paper, DA in multiuser MIMO communications is investigated in terms of UL spectral efficiency. Firstly, we obtain the UL association probabilities. In contrast to the CA scenario, association probabilities for DA scenario only depend on the densities of BSs. Hence, DA allows UL and DL to be totally independent. Secondly, we derive lower bounds on the spectral efficiency. The lower bounds show that, different from CA, the UL spectral efficiency for DA scenario is irrelative with the transmit powers of BSs, which implies DA allows users to associate with any BSs that can achieve the highest UL spectral efficiency. Finally, the spectral efficiencies for DA and CA scenarios are compared via simulation results, where it can be concluded that the spectral efficiency in multiuser MIMO systems is improved by DA.

cs.IT↗