Searcharxiv⌕ Search

arXiv subjects

Lin Wang

Publications and source records attributed to Lin Wang.

At least 487 records · Page 27Linked to original sources

LazyCtrl: Scalable Network Control for Cloud Data Centers

The advent of software defined networking enables flexible, reliable and feature-rich control planes for data center networks. However, the tight coupling of centralized control and complete visibility leads to a wide range of issues among which scalability has risen to prominence. To address this, we present LazyCtrl, a novel hybrid control plane design for data center networks where network control is carried out by distributed control mechanisms inside independent groups of switches while complemented with a global controller. Our design is motivated by the observation that data center traffic is usually highly skewed and thus edge switches can be grouped according to traffic locality. LazyCtrl aims at bringing laziness to the global controller by dynamically devolving most of the control tasks to independent switch groups to process frequent intra-group events near datapaths while handling rare inter-group or other specified events by the controller. We implement LazyCtrl and build a prototype based on Open vSwich and Floodlight. Trace-driven experiments on our prototype show that an effective switch grouping is easy to maintain in multi-tenant clouds and the central controller can be significantly shielded by staying lazy, with its workload reduced by up to 82%.

cs.NI↗

Pseudo-goldstino and electroweakinos via VBF processes at LHC

The multi-sector SUSY breaking predicts pseudo-goldstino which can couple to the visible sector more strongly than the ordinary gavitino and thus induce the decays of the lightest neutralino and chargino (collectively called electroweakinos) inside the detector. In this note we study the electroweakino pair productions via vector boson fusion (VBF) processes followed by decays to pseudo-goldstino at the LHC. Our Monte Carlo simulations show that at the 14 TeV LHC with 3000 fb^{-1} luminosity the dominant production channel pp->chargino+neutralino+2 jets can have a statistical significance above 2-sigma while other production channels are not accessible.

hep-ph↗

Injectivity w.r.t. Distribution of Elements in the Compressed Sequences Derived from Primitive Sequences over $Z/p^eZ$

Let $p\geq3$ be a prime and $e\geq2$ an integer. Let $σ(x)$ be a primitive polynomial of degree $n$ over $Z/p^eZ$ and $G'(σ(x),p^e)$ the set of primitive linear recurring sequences generated by $σ(x)$. A compressing map $φ$ on $Z/p^eZ$ naturally induces a map $\hatφ$ on $G'(σ(x),p^e)$. For a subset $D$ of the image of $φ$,$\hatφ$ is called to be injective w.r.t. $D$-uniformity if the distribution of elements of $D$ in the compressed sequence implies all information of the original primitive sequence. In this correspondence, for at least $1-2(p-1)/(p^n-1)$ of primitive polynomials of degree $n$, a clear criterion on $φ$ is obtained to decide whether $\hatφ$ is injective w.r.t. $D$-uniformity, and the majority of maps on $Z/p^eZ$ induce injective maps on $G'(σ(x),p^e)$. Furthermore, a sufficient condition on $φ$ is given to ensure injectivity of $\hatφ$ w.r.t. $D$-uniformity. It follows from the sufficient condition that if $σ(x)$ is strongly primitive and the compressing map $φ(x)=f(x_{e-1})$, where $f(x_{e-1})$ is a permutation polynomial over $\mathbb{F}_{p}$, then $\hatφ$ is injective w.r.t. $D$-uniformity for $\emptyset\neq D\subset\mathbb{F}_{p}$. Moreover, we give three specific families of compressing maps which induce injective maps on $G'(σ(x),p^e)$.

cs.IT↗

Global Spatio-temporal Patterns of Influenza in the Post-pandemic Era

We study the global spatio-temporal patterns of influenza dynamics. This is achieved by analysing and modelling weekly laboratory confirmed cases of influenza A and B from 138 countries between January 2006 and May 2014. The data were obtained from FluNet, the surveillance network compiled by the the World Health Organization. We report a pattern of {\it skip-and-resurgence} behavior between the years 2011 and 2013 for influenza H1N1/09, the strain responsible for the 2009 pandemic, in Europe and Eastern Asia. In particular, the expected H1N1/09 epidemic outbreak in 2011 failed to occur (or"skipped") in many countries across the globe, although an outbreak occurred in the following year. We also report a pattern of {\it well-synchronized} 2010 winter wave of H1N1/09 in the Northern Hemisphere countries, and a pattern of replacement of strain H1N1/77 by H1N1/09 between the 2009 and 2012 influenza seasons. Using both a statistical and a mechanistic mathematical model, and through fitting the data of 108 countries (108 countries in a statistical model and 10 large populations with a mechanistic model), we discuss the mechanisms that are likely to generate these events taking into account the role of multi-strain dynamics. A basic understanding of these patterns has important public health implications and scientific significance.

q-bio.PE↗

High quality sandwiched black phosphorus heterostructure and its quantum oscillations

Two-dimensional (2D) materials, such as graphene and transition metal dichalcogenides have attracted great attention because of the rich physics and potential applications in next-generation nano-sized electronic devices. Recently, atomically thin black phosphorus (BP) has become a new member of the 2D materials family with high theoretical mobility and tunable bandgap structure. However, degradation of properties under atmospheric conditions and high-density charge traps in BP have largely limited its mobility (~400 cm2/Vs at room temperature) and thus restricted its future applications. Here, we report the fabrication of stable BN-BP-BN heterostructures by encapsulating atomically thin BP between hexagonal boron nitride (BN) layers to realize ultraclean BN-BP interfaces which allow a record-high field-effect mobility ~1350 cm2/Vs at room temperature and on-off ratios over 10^5. At low temperatures, the mobility reaches ~2700 cm2/Vs and quantum oscillations in BP 2D hole gas are observed at low magnetic fields. Importantly, the BN-BP-BN heterostructure can effectively avoid the quality degradation of BP in ambient condition.

cond-mat.mtrl-sci↗

Detection of Interlayer Interaction in Few-layer Graphene through Landau Level Spectroscopy

We demonstrate that surface relaxation, which is insignificant in trilayer graphene, starts to manifest in Bernal-stacked tetralayer graphene. Bernal-stacked few-layer graphene has been investigated by analyzing its Landau level spectra through quantum capacitance measurements. We find that in trilayer graphene, the interlayer interaction parameters were similar to that of graphite. However, in tetralayer graphene, the hopping parameters between the bulk and surface bilayers are quite different. This shows a direct evidence for the surface relaxation phenomena. In spite of the fact that the Van der Waals interaction between the carbon layers is thought to be insignificant, we suggest that the interlayer interaction is an important factor in explaining the observed results and the symmetry-breaking effects in graphene sublattice are not negligible.

cond-mat.mtrl-sci↗

The Roles of a Quantum Channel on a Quantum State

When a quantum state undergoes a quantum channel, the state will be inevitably influenced. In general, the fidelity of the state is reduced, so is the entanglement if the sub- systems go through the channel. However, the influence on the coherence of the state is quite different. Here we present some state-independent quantities to describe to what degree the fidelity, the entanglement and the coherence of the state are influenced. As applications, we consider some quantum channels on a qubit and find that the infidelity ability monotonically depends on the decay rate, but in usual the decoherence ability is not the case and strongly depends on the channel.

quant-ph↗

Anomalous compressibility behavior of chromium monoaresenide under high pressure

CrAs was firstly observed possessing the bulk superconductivity (Tc~2 K) under high pressure (0.8 GPa) in the very recent work (Wei Wu, et al. Nature Communications 5, 5508 (2014)). To explore the correlation between the structure and the superconductivity, the high-pressure structure evolution of CrAs was investigated using angle dispersive X-ray diffraction (XRD) method with small steps of ~0.1 GPa in a diamond anvil cell (DAC) up to 1.8 GPa. In the pressure range covered by our current experiment, the structure of CrAs keeps stable. However, the lattice parameters exhibit anomalous compression behaviors. With the pressure increasing, the lattice parameters a and c both show a process of first increasing and then decreasing, and the lattice parameter b goes through a quick contract at 0.35 GPa, which suggests a pressure-induced isostructural phase transition occurs in CrAs around this pressure point. Above the phase transition pressure, the axial compressibilities of CrAs present remarkable anisotropy. The compressibilities along the a- and c-axis are about an order of magnitude smaller than that along the b-axis, which is closely related to the different stacking modes in CrAs6 octahedron along different crystallographic axes. A schematic band model was used for addressing above anomalous compression behavior in CrAs.

cond-mat.str-el↗

A Multi-length Bunches Design for Electron Storage Rings with Odd Buckets

A scheme with two superconducting RF cavities (sc-cavities) is designed to upgrade electron storage rings with odd buckets into multi-length bunches. In this paper, Hefei Light Source II (HLS II) is given as an example for odd buckets. In accordance with 45 buckets, which is multiples of 3, three different length of bunches generated simultaneously is proposed in the presently applied user optics. The final result is to, without low-alpha optics, fill HLS II with long bunches of 50 ps length, medium bunches of 23 ps and short bunches of 6 ps. Each third buckets can be filled with short bunches, of which the current limit is up to 6.6 mA, more than 60 times the value of low-alpha mode. Moreover, particles tracking about beam dynamics performed by ELEGANT and calculations about beam instabilities are presented in this paper.

physics.acc-ph↗

Weak KAM theory for general Hamilton-Jacobi equations III: the variational principle under Osgood conditions

We consider the following evolutionary Hamilton-Jacobi equation with initial condition: \begin{equation*} \begin{cases} \partial_tu(x,t)+H(x,u(x,t),\partial_xu(x,t))=0,\\ u(x,0)=ϕ(x), \end{cases} \end{equation*} where $ϕ(x)\in C(M,\mathbb{R})$. Under some assumptions on the convexity of $H(x,u,p)$ with respect to $p$ and the Osgood growth of $H(x,u,p)$ with respect to $u$, we establish an implicitly variational principle and provide an intrinsic relation between viscosity solutions and certain minimal characteristics. Moreover, we obtain a representation formula of the viscosity solution of the evolutionary Hamilton-Jacobi equation.

math.AP↗

Weak KAM theory for general Hamilton-Jacobi equations II: the fundamental solution under Lipschitz conditions

We consider the following evolutionary Hamilton-Jacobi equation with initial condition: \begin{equation*} \begin{cases} \partial_tu(x,t)+H(x,u(x,t),\partial_xu(x,t))=0,\\ u(x,0)=ϕ(x), \end{cases} \end{equation*} where $ϕ(x)\in C(M,\mathbb{R})$. Under some assumptions on the convexity of $H(x,u,p)$ with respect to $p$ and the uniform Lipschitz of $H(x,u,p)$ with respect to $u$, we establish a variational principle and provide an intrinsic relation between viscosity solutions and certain minimal characteristics. By introducing an implicitly defined {\it fundamental solution}, we obtain a variational representation formula of the viscosity solution of the evolutionary Hamilton-Jacobi equation. Moreover, we discuss the large time behavior of the viscosity solution of the evolutionary Hamilton-Jacobi equation and provide a dynamical representation formula of the viscosity solution of the stationary Hamilton-Jacobi equation with strictly increasing $H(x,u,p)$ with respect to $u$.

math.AP↗

Weak KAM theory for general Hamilton-Jacobi equations I: the solution semigroup under proper conditions

We consider the following evolutionary Hamilton-Jacobi equation with initial condition: \begin{equation*} \begin{cases} \partial_tu(x,t)+H(x,u(x,t),\partial_xu(x,t))=0,\\ u(x,0)=ϕ(x). \end{cases} \end{equation*} Under some assumptions on $H(x,u,p)$ with respect to $p$ and $u$, we provide a variational principle on the evolutionary Hamilton-Jacobi equation. By introducing an implicitly defined solution semigroup, we extend Fathi's weak KAM theory to certain more general cases, in which $H$ explicitly depends on the unknown function $u$. As an application, we show the viscosity solution of the evolutionary Hamilton-Jacobi equation with initial condition tends asymptotically to the weak KAM solution of the following stationary Hamilton-Jacobi equation: \begin{equation*} H(x,u(x),\partial_xu(x))=0. \end{equation*}.

math.AP↗

Probing the Electron States and Metal-Insulator Transition Mechanisms in Atomically Thin MoS2 Based on Vertical Heterostructures

The metal-insulator transition (MIT) is one of the remarkable electrical transport properties of atomically thin molybdenum disulphide (MoS2). Although the theory of electron-electron interactions has been used in modeling the MIT phenomena in MoS2, the underlying mechanism and detailed MIT process still remain largely unexplored. Here, we demonstrate that the vertical metal-insulator-semiconductor (MIS) heterostructures built from atomically thin MoS2 (monolayers and multilayers) are ideal capacitor structures for probing the electron states in MoS2. The vertical configuration of MIS heterostructures offers the added advantage of eliminating the influence of large impedance at the band tails and allows the observation of fully excited electron states near the surface of MoS2 over a wide excitation frequency (100 Hz-1 MHz) and temperature range (2 K- 300 K). By combining capacitance and transport measurements, we have observed a percolation-type MIT, driven by density inhomogeneities of electron states, in the vertical heterostructures built from monolayer and multilayer MoS2. In addition, the valence band of thin MoS2 layers and their intrinsic properties such as thickness-dependence screening abilities and band gap widths can be easily accessed and precisely determined through the vertical heterostructures.

cond-mat.mtrl-sci↗

Pseudo-goldstino and electroweak gauginos at the LHC

The multi-sector SUSY breaking predicts the existence of pseudo-goldstino, which could couple more strongly to visible fields than ordinary gravitino. Then the lightest neutralino and chargino can decay into a pseudo-goldstino plus a Z-boson, Higgs boson or W-boson. In this note we perform a Monte Carlo simulation for the direct productions of the lightest neutralino and chargino followed by the decays to pseudo-goldstino. Considering scenarios with higgsino-like, bino-like or wino-like lightest neutralino, we find that the signal-to-background ratio at the high luminosity LHC is between 6% and 25% and the statistical significance can be above 5-sigma.

hep-ph↗

Power-efficient Assignment of Virtual Machines to Physical Machines

Motivated by current trends in cloud computing, we study a version of the generalized assignment problem where a set of virtual processors has to be implemented by a set of identical processors. For literature consistency, we say that a set of virtual machines (VMs) is assigned to a set of physical machines (PMs). The optimization criteria is to minimize the power consumed by all the PMs. We term the problem Virtual Machine Assignment (VMA). Crucial differences with previous work include a variable number of PMs, that each VM must be assigned to exactly one PM (i.e., VMs cannot be implemented fractionally), and a minimum power consumption for each active PM. Such infrastructure may be strictly constrained in the number of PMs or in the PMs' capacity, depending on how costly (in terms of power consumption) is to add a new PM to the system or to heavily load some of the existing PMs. Low usage or ample budget yields models where PM capacity and/or the number of PMs may be assumed unbounded for all practical purposes. We study 4 VMA problems depending on whether the capacity or the number of PMs is bounded or not. Specifically, we study hardness and online competitiveness for a variety of cases. To the best of our knowledge, this is the first comprehensive study of the VMA problem for this cost function.

cs.DS↗

Degree mixing in multilayer networks impedes the evolution of cooperation

Traditionally, the evolution of cooperation has been studied on single, isolated networks. Yet a player, especially in human societies, will typically be a member of many different networks, and those networks will play a different role in the evolutionary process. Multilayer networks are therefore rapidly gaining on popularity as the more apt description of a networked society. With this motivation, we here consider 2-layer scale-free networks with all possible combinations of degree mixing, wherein one network layer is used for the accumulation of payoffs and the other is used for strategy updating. We find that breaking the symmetry through assortative mixing in one layer and/or disassortative mixing in the other layer, as well as preserving the symmetry by means of assortative mixing in both layers, impedes the evolution of cooperation. We use degree-dependent distributions of strategies and cluster-size analysis to explain these results, which highlight the importance of hubs and the preservation of symmetry between multilayer networks for the successful resolution of social dilemmas.

physics.soc-ph↗

Energy-Efficient Flow Scheduling and Routing with Hard Deadlines in Data Center Networks

The power consumption of enormous network devices in data centers has emerged as a big concern to data center operators. Despite many traffic-engineering-based solutions, very little attention has been paid on performance-guaranteed energy saving schemes. In this paper, we propose a novel energy-saving model for data center networks by scheduling and routing "deadline-constrained flows" where the transmission of every flow has to be accomplished before a rigorous deadline, being the most critical requirement in production data center networks. Based on speed scaling and power-down energy saving strategies for network devices, we aim to explore the most energy efficient way of scheduling and routing flows on the network, as well as determining the transmission speed for every flow. We consider two general versions of the problem. For the version of only flow scheduling where routes of flows are pre-given, we show that it can be solved polynomially and we develop an optimal combinatorial algorithm for it. For the version of joint flow scheduling and routing, we prove that it is strongly NP-hard and cannot have a Fully Polynomial-Time Approximation Scheme (FPTAS) unless P=NP. Based on a relaxation and randomized rounding technique, we provide an efficient approximation algorithm which can guarantee a provable performance ratio with respect to a polynomial of the total number of flows.

cs.NI↗

A Joint Optimization of Operational Cost and Performance Interference in Cloud Data Centers

Virtual machine (VM) scheduling is an important technique to efficiently operate the computing resources in a data center. Previous work has mainly focused on consolidating VMs to improve resource utilization and thus to optimize energy consumption. However, the interference between collocated VMs is usually ignored, which can result in very worse performance degradation to the applications running in those VMs due to the contention of the shared resources. Based on this observation, we aim at designing efficient VM assignment and scheduling strategies where we consider optimizing both the operational cost of the data center and the performance degradation of running applications and then, we propose a general model which captures the inherent tradeoff between the two contradictory objectives. We present offline and online solutions for this problem by exploiting the spatial and temporal information of VMs where VM scheduling is done by jointly consider the combinations and the life-cycle overlapping of the VMs. Evaluation results show that the proposed methods can generate efficient schedules for VMs, achieving low operational cost while significantly reducing the performance degradation of applications in cloud data centers.

cs.DC↗