Catalog footprint

What is connected

62works
48topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

62 published item(s)

preprint2026arXiv

Mistletoe: Stealthy Acceleration-Collapse Attacks on Speculative Decoding

Speculative decoding has become a widely adopted technique for accelerating large language model (LLM) inference by drafting multiple candidate tokens and verifying them with a target model in parallel. Its efficiency, however, critically depends on the average accepted length $τ$, i.e., how many draft tokens survive each verification step. In this work, we identify a new mechanism-level vulnerability in model-based speculative decoding: the drafter is trained to approximate the target model distribution, but this approximation is inevitably imperfect. Such a drafter-target mismatch creates a hidden attack surface where small perturbations can preserve the target model's visible behavior while substantially reducing draft-token acceptability. We propose Mistletoe, a stealthy acceleration-collapse attack against speculative decoding. Mistletoe directly targets the acceptance mechanism of speculative decoding. It jointly optimizes a degradation objective that decreases drafter-target agreement and a semantic-preservation objective that constrains the target model's output distribution. To resolve the conflict between these objectives, we introduce a null-space projection mechanism, where degradation gradients are projected away from the local semantic-preserving direction, suppressing draft acceptance while minimizing semantic drift. Experiments on various speculative decoding systems show that Mistletoe substantially reduces average accepted length $τ$, collapses speedup, and lowers averaged token throughput, while preserving output quality and perplexity. Our work highlights that speculative decoding introduces a mechanism-level attack surface beyond existing output robustness, calling for more robust designs of LLM acceleration systems.

preprint2023arXiv

A Novel Estimation Method for Temperature of Magnetic Nanoparticles Dominated by Brownian Relaxation Based on Magnetic Particle Spectroscopy

This paper presents a novel method for estimating the temperature of magnetic nanoparticles (MNPs) based on AC magnetization harmonics of MNPs dominated by Brownian relaxation. The difference in the AC magnetization response and magnetization harmonic between the Fokker-Planck equation and the Langevin function was analyzed, and we studied the relationship between the magnetization harmonic and the key factors, such as Brownian relaxation time, temperature, magnetic field strength, core size and hydrodynamic size of MNPs, excitation frequency, and so on. We proposed a compensation function for AC magnetization harmonic with consideration of the key factors and the difference between the Fokker-Planck equation and the Langevin function. Then a temperature estimation model based on the compensation function and the Langevin function was established. By employing the least squares algorithm, the temperature was successfully calculated. The experimental results show that the temperature error is less than 0.035 K in the temperature range from 310 K to 320 K. The temperature estimation model is expected to improve the performance of the magnetic nanoparticle thermometer and be applied to magnetic nanoparticle-mediated hyperthermia.

preprint2022arXiv

A microstructure estimation Transformer inspired by sparse representation for diffusion MRI

Diffusion magnetic resonance imaging (dMRI) is an important tool in characterizing tissue microstructure based on biophysical models, which are complex and highly non-linear. Resolving microstructures with optimization techniques is prone to estimation errors and requires dense sampling in the q-space. Deep learning based approaches have been proposed to overcome these limitations. Motivated by the superior performance of the Transformer, in this work, we present a learning-based framework based on Transformer, namely, a Microstructure Estimation Transformer with Sparse Coding (METSC) for dMRI-based microstructure estimation with downsampled q-space data. To take advantage of the Transformer while addressing its limitation in large training data requirements, we explicitly introduce an inductive bias - model bias into the Transformer using a sparse coding technique to facilitate the training process. Thus, the METSC is composed with three stages, an embedding stage, a sparse representation stage, and a mapping stage. The embedding stage is a Transformer-based structure that encodes the signal to ensure the voxel is represented effectively. In the sparse representation stage, a dictionary is constructed by solving a sparse reconstruction problem that unfolds the Iterative Hard Thresholding (IHT) process. The mapping stage is essentially a decoder that computes the microstructural parameters from the output of the second stage, based on the weighted sum of normalized dictionary coefficients where the weights are also learned. We tested our framework on two dMRI models with downsampled q-space data, including the intravoxel incoherent motion (IVIM) model and the neurite orientation dispersion and density imaging (NODDI) model. The proposed method achieved up to 11.25 folds of acceleration in scan time and outperformed the other state-of-the-art learning-based methods.

preprint2022arXiv

Complex analysis of divergent perturbation theory at finite temperature

We investigate the convergence properties of finite-temperature perturbation theory by considering the mathematical structure of thermodynamic potentials using complex analysis. We discover that zeros of the partition function lead to poles in the internal energy and logarithmic singularities in the Helmholtz free energy which create divergent expansions in the canonical ensemble. Analysing these zeros reveals that the radius of convergence increases for higher temperatures. In contrast, when the reference state is degenerate, these poles in the internal energy create a zero radius of convergence in the zero-temperature limit. Finally, by showing that the poles in the internal energy reduce to exceptional points in the zero-temperature limit, we unify the two main mathematical representations of quantum phase transitions.

preprint2022arXiv

TransGrasp: Grasp Pose Estimation of a Category of Objects by Transferring Grasps from Only One Labeled Instance

Grasp pose estimation is an important issue for robots to interact with the real world. However, most of existing methods require exact 3D object models available beforehand or a large amount of grasp annotations for training. To avoid these problems, we propose TransGrasp, a category-level grasp pose estimation method that predicts grasp poses of a category of objects by labeling only one object instance. Specifically, we perform grasp pose transfer across a category of objects based on their shape correspondences and propose a grasp pose refinement module to further fine-tune grasp pose of grippers so as to ensure successful grasps. Experiments demonstrate the effectiveness of our method on achieving high-quality grasps with the transferred grasp poses. Our code is available at https://github.com/yanjh97/TransGrasp.

preprint2022arXiv

Using Natural Sentences for Understanding Biases in Language Models

Evaluation of biases in language models is often limited to synthetically generated datasets. This dependence traces back to the need for a prompt-style dataset to trigger specific behaviors of language models. In this paper, we address this gap by creating a prompt dataset with respect to occupations collected from real-world natural sentences present in Wikipedia. We aim to understand the differences between using template-based prompts and natural sentence prompts when studying gender-occupation biases in language models. We find bias evaluations are very sensitive to the design choices of template prompts, and we propose using natural sentence prompts for systematic evaluations to step away from design choices that could introduce bias in the observations.

preprint2021arXiv

Likelihood landscape and maximum likelihood estimation for the discrete orbit recovery model

We study the non-convex optimization landscape for maximum likelihood estimation in the discrete orbit recovery model with Gaussian noise. This model is motivated by applications in molecular microscopy and image processing, where each measurement of an unknown object is subject to an independent random rotation from a rotational group. Equivalently, it is a Gaussian mixture model where the mixture centers belong to a group orbit. We show that fundamental properties of the likelihood landscape depend on the signal-to-noise ratio and the group structure. At low noise, this landscape is "benign" for any discrete group, possessing no spurious local optima and only strict saddle points. At high noise, this landscape may develop spurious local optima, depending on the specific group. We discuss several positive and negative examples, and provide a general condition that ensures a globally benign landscape. For cyclic permutations of coordinates on $\mathbb{R}^d$ (multi-reference alignment), there may be spurious local optima when $d \geq 6$, and we establish a correspondence between these local optima and those of a surrogate function of the phase variables in the Fourier domain. We show that the Fisher information matrix transitions from resembling that of a single Gaussian in low noise to having a graded eigenvalue structure in high noise, which is determined by the graded algebra of invariant polynomials under the group action. In a local neighborhood of the true object, the likelihood landscape is strongly convex in a reparametrized system of variables given by a transcendence basis of this polynomial algebra. We discuss implications for optimization algorithms, including slow convergence of expectation-maximization, and possible advantages of momentum-based acceleration and variable reparametrization for first- and second-order descent methods.

preprint2020arXiv

Multi-Agent Deep Reinforcement Learning for HVAC Control in Commercial Buildings

In commercial buildings, about 40%-50% of the total electricity consumption is attributed to Heating, Ventilation, and Air Conditioning (HVAC) systems, which places an economic burden on building operators. In this paper, we intend to minimize the energy cost of an HVAC system in a multi-zone commercial building under dynamic pricing with the consideration of random zone occupancy, thermal comfort, and indoor air quality comfort. Due to the existence of unknown thermal dynamics models, parameter uncertainties (e.g., outdoor temperature, electricity price, and number of occupants), spatially and temporally coupled constraints associated with indoor temperature and CO2 concentration, a large discrete solution space, and a non-convex and non-separable objective function, it is very challenging to achieve the above aim. To this end, the above energy cost minimization problem is reformulated as a Markov game. Then, an HVAC control algorithm is proposed to solve the Markov game based on multi-agent deep reinforcement learning with attention mechanism. The proposed algorithm does not require any prior knowledge of uncertain parameters and can operate without knowing building thermal dynamics models. Simulation results based on real-world traces show the effectiveness, robustness and scalability of the proposed algorithm.

preprint2020arXiv

Multi-objective Ranking via Constrained Optimization

In this paper, we introduce an Augmented Lagrangian based method to incorporate the multiple objectives (MO) in a search ranking algorithm. Optimizing MOs is an essential and realistic requirement for building ranking models in production. The proposed method formulates MO in constrained optimization and solves the problem in the popular Boosting framework -- a novel contribution of our work. Furthermore, we propose a procedure to set up all optimization parameters in the problem. The experimental results show that the method successfully achieves MO criteria much more efficiently than existing methods.

preprint2020arXiv

On a class of new nonlocal traffic flow models with look-ahead rules

This paper presents a new class of one-dimensional (1D) traffic models with look-ahead rules that take into account of two effects: nonlocal slow-down effect and right-skewed non-concave asymmetry in the fundamental diagram. The proposed 1D cellular automata (CA) models with the Arrhenius type look-ahead interactions implement stochastic rules for cars' movement following the configuration of the traffic ahead of each car. In particular, we take two different look-ahead rules: one is based on the distance from the car under consideration to the car in front of it; the other one depends on the car density ahead. Both rules feature a novel idea of multiple moves, which plays a key role in recovering the non-concave flux in the macroscopic dynamics. Through a semi-discrete mesoscopic stochastic process, we derive the coarse-grained macroscopic dynamics of the CA model. We also design a numerical scheme to simulate the proposed CA models with an efficient list-based kinetic Monte Carlo (KMC) algorithm. Our results show that the fluxes of the KMC simulations agree with the coarse-grained macroscopic averaged fluxes for the different look-ahead rules under various parameter settings.

preprint2020arXiv

Potential quality improvement of stochastic optical localization nanoscopy images obtained by frame by frame localization algorithms

A data movie of stochastic optical localization nanoscopy contains spatial and temporal correlations, both providing information of emitter locations. The majority of localization algorithms in the literature estimate emitter locations by frame-by-frame localization (FFL), which exploit only the spatial correlation and leave the temporal correlation into the FFL nanoscopy images. The temporal correlation contained in the FFL images, if exploited, can improve the localization accuracy and the image quality. In this paper, we analyze the properties of the FFL images in terms of root mean square minimum distance (RMSMD) and root mean square error (RMSE). It is shown that RMSMD and RMSE can be potentially reduced by a maximum fold equal to the square root of the average number of activations per emitter. Analyzed and revealed are also several statistical properties of RMSMD and RMSE and their relationship with respect to a large number of data frames, bias and variance of localization errors, small localization errors, sample drift, and the worst FFL image. Numerical examples are taken and the results confirm the prediction of analysis. The ideas about how to develop an algorithm to exploit the temporal correlation of FFL images are also briefly discussed. The results suggest development of two kinds of localization algorithms: the algorithms that can exploit the temporal correlation of FFL images and the unbiased localization algorithms.

preprint2020arXiv

Principal components in linear mixed models with general bulk

We study the principal components of covariance estimators in multivariate mixed-effects linear models. We show that, in high dimensions, the principal eigenvalues and eigenvectors may exhibit bias and aliasing effects that are not present in low-dimensional settings. We derive the first-order limits of the principal eigenvalue locations and eigenvector projections in a high-dimensional asymptotic framework, allowing for general population spectral distributions for the random effects and extending previous results from a more restrictive spiked model. Our analysis uses free probability techniques, and we develop two general tools of independent interest-- strong asymptotic freeness of GOE and deterministic matrices and a free deterministic equivalent approximation for bilinear forms of resolvents.

preprint2019arXiv

Sem-LSD: A Learning-based Semantic Line Segment Detector

In this paper, we introduces a new type of line-shaped image representation, named semantic line segment (Sem-LS) and focus on solving its detection problem. Sem-LS contains high-level semantics and is a compact scene representation where only visually salient line segments with stable semantics are preserved. Combined with high-level semantics, Sem-LS is more robust under cluttered environment compared with existing line-shaped representations. The compactness of Sem-LS facilitates its use in large-scale applications, such as city-scale SLAM (simultaneously localization and mapping) and LCD (loop closure detection). Sem-LS detection is a challenging task due to its significantly different appearance from existing learning-based image representations such as wireframes and objects. For further investigation, we first label Sem-LS on two well-known datasets, KITTI and KAIST URBAN, as new benchmarks. Then, we propose a learning-based Sem-LS detector (Sem-LSD) and devise new module as well as metrics to address unique challenges in Sem-LS detection. Experimental results have shown both the efficacy and efficiency of Sem-LSD. Finally, the effectiveness of the proposed Sem-LS is supported by two experiments on detector repeatability and a city-scale LCD problem. Labeled datasets and code will be released shortly.

preprint2016arXiv

Elementary symmetric polynomials in Stanley--Reisner face ring

Let $P$ be a simple polytope of dimension $n$ with $m$ facets. In this paper we pay our attention on those elementary symmetric polynomials in the Stanley--Reisner face ring of $P$ and study how the decomposability of the $n$-th elementary symmetric polynomial influences on the combinatorics of $P$ and the topology and geometry of toric spaces over $P$. We give algebraic criterions of detecting the decomposability of $P$ and determining when $P$ is $n$-colorable in terms of the $n$-th elementary symmetric polynomial. In addition, we define the Stanley--Reisner {\em exterior} face ring $\mathcal{E}(K_P)$ of $P$, which is non-commutative in the case of ${\Bbb Z}$ coefficients, where $K_P$ is the boundary complex of dual of $P$. Then we obtain a criterion for the (real) Buchstaber invariant of $P$ to be $m-n$ in terms of the $n$-th elementary symmetric polynomial in $\mathcal{E}(K_P)$. Our results as above can directly associate with the topology and geometry of toric spaces over $P$. In particular, we show that the decomposability of the $n$-th elementary symmetric polynomial in $\mathcal{E}(K_P)$ with ${\Bbb Z}$ coefficients can detect the existence of the almost complex structures of quasitoric manifolds over $P$, and if the (real) Buchstaber invariant of $P$ is $m-n$, then there exists an essential relation between the $n$-th equivariant characteristic class of the (real) moment-angle manifold over $P$ in $\mathcal{E}(K_P)$ and the characteristic functions of $P$.

preprint2016arXiv

Matrix models for multilevel Heckman-Opdam and multivariate Bessel measures

We study multilevel matrix ensembles at general beta by identifying them with a class of processes defined via the branching rules for multivariate Bessel and Heckman-Opdam hypergeometric functions. For beta = 1, 2, we express the joint multilevel density of the eigenvalues of a generalized beta-Wishart matrix as a multivariate Bessel ensemble, generalizing a result of Dieker-Warren. In the null case, we prove the conjecture of Borodin-Gorin that the joint multilevel density of the beta-Jacobi ensemble is given by a principally specialized Heckman-Opdam measure.

preprint2016arXiv

Measurement of the transfer function for a spoke cavity of C-ADS Injector I

The spoke cavities mounted in the China Accelerator Driven sub-critical System (C-ADS) have high quality factor(Q) and very small bandwidth, making them very sensitive to mechanical perturbations whether external or self-induced. The transfer function is used to characterize the response of the cavity eigen frequency to the perturbations. This paper describes a method to measure the transfer function of a spoke cavity. The measured Lorentz transfer function shows there are 206 Hz and 311 Hz mechanical eigenmodes excited by Lorentz force in the cavity of C-ADS, and the measured piezo fast tuner transfer function shows there are 12 mechanical eigenmodes from 0 to 500 Hz. According to these results, some effective measures have been taken to weaken the influence from helium pressure fluctuation, avoid mechanical resonances and improve the reliability of RF system.

preprint2016arXiv

The polynomial representation of the type $A_{n - 1}$ rational Cherednik algebra in characteristic $p \mid n$

We study the polynomial representation of the rational Cherednik algebra of type $A_{n-1}$ with generic parameter in characteristic $p$ for $p \mid n$. We give explicit formulas for generators for the maximal proper graded submodule, show that they cut out a complete intersection, and thus compute the Hilbert series of the irreducible quotient. Our methods are motivated by taking characteristic $p$ analogues of existing characteristic $0$ results.

preprint2016arXiv

Traces of intertwiners for quantum affine algebras and difference equations (after Etingof-Schiffmann-Varchenko)

We modify and give complete proofs for the results of Etingof-Schiffmann-Varchenko on traces of intertwiners of untwisted quantum affine algebras in the opposite coproduct and the standard grading. More precisely, we show that certain normalized generalized traces for $U_q(\hat{\mathfrak{g}})$ solve four commuting systems of q-difference equations: the Macdonald-Ruijsenaars, dual Macdonald-Ruijsenaars, q-KZB, and dual q-KZB equations. In addition, we show a symmetry property for these renormalized trace functions. Our modifications are motivated by their appearance in recent work of the author.

preprint2016arXiv

Tuner control system of spoke012 SRF cavity for C-ADS injector I at IHEP

A new tuner control system of spoke superconducting radio frequency (SRF) cavity has been developed and applied to cryomodule I (CM1) of C-ADS injector I at IHEP. We have successfully implemented the tuner controllerfor the first time and achieved a cavity tuning phase error of 0.7degrees (about 4 Hz peak to peak) in the presence of electromechanical coupled resonance. This paper will present the preliminary experimental results based on the new tuner controller under proton beam commissioning.

preprint2015arXiv

A new integral formula for Heckman-Opdam hypergeometric functions

We provide Harish-Chandra type formulas for the multivariate Bessel functions and Heckman-Opdam hypergeometric functions as representation-valued integrals over dressing orbits. Our expression is the quasi-classical limit of the realization of Macdonald polynomials as traces of intertwiners of quantum groups given by Etingof-Kirillov Jr. Integration over the Liouville tori of the Gelfand-Tsetlin integrable system and adjunction for higher Calogero-Moser Hamiltonians recovers and gives a new proof of the integral realization over Gelfand-Tsetlin polytopes which appeared in the recent work of Borodin-Gorin on the beta-Jacobi corners ensemble.

preprint2015arXiv

Analyzing TCP Throughput Stability and Predictability with Implications for Adaptive Video Streaming

Recent work suggests that TCP throughput stability and predictability within a video viewing session can inform the design of better video bitrate adaptation algorithms. Despite a rich tradition of Internet measurement, however, our understanding of throughput stability and predictability is quite limited. To bridge this gap, we present a measurement study of throughput stability using a large-scale dataset from a video service provider. Drawing on this analysis, we propose a simple-but-effective prediction mechanism based on a hidden Markov model and demonstrate that it outperforms other approaches. We also show the practical implications in improving the user experience of adaptive video streaming.

preprint2015arXiv

DDA: Cross-Session Throughput Prediction with Applications to Video Bitrate Selection

User experience of video streaming could be greatly improved by selecting a high-yet-sustainable initial video bitrate, and it is therefore critical to accurately predict throughput before a video session starts. Inspired by previous studies that show similarity among throughput of similar sessions (e.g., those sharing same bottleneck link), we argue for a cross-session prediction approach, where throughput measured on other sessions is used to predict the throughput of a new session. In this paper, we study the challenges of cross-session throughput prediction, develop an accurate throughput predictor called DDA, and evaluate the performance of the predictor with real-world datasets. We show that DDA can predict throughput more accurately than simple predictors and conventional machine learning algorithms; e.g., DDA's 80%ile prediction error of DDA is > 50% lower than other algorithms. We also show that this improved accuracy enables video players to select a higher sustainable initial bitrate; e.g., compared to initial bitrate without prediction, DDA leads to 4x higher average bitrate.

preprint2015arXiv

DeepID3: Face Recognition with Very Deep Neural Networks

The state-of-the-art of face recognition has been significantly advanced by the emergence of deep learning. Very deep neural networks recently achieved great success on general object recognition because of their superb learning capacity. This motivates us to investigate their effectiveness on face recognition. This paper proposes two very deep neural network architectures, referred to as DeepID3, for face recognition. These two architectures are rebuilt from stacked convolution and inception layers proposed in VGG net and GoogLeNet to make them suitable to face recognition. Joint face identification-verification supervisory signals are added to both intermediate and final feature extraction layers during training. An ensemble of the proposed two architectures achieves 99.53% LFW face verification accuracy and 96.0% LFW rank-1 face identification accuracy, respectively. A further discussion of LFW face verification result is given in the end.

preprint2015arXiv

Design of a 325MHz Half Wave Resonator prototype at IHEP

A 325MHz beta=0.14 superconducting half wave resonator(HWR) prototype has been developed at the Institute of High Energy Physics(IHEP), which can be applied in continuous wave (CW) high beam proton accelerators. In this paper, the electromagnetic (EM) design, multipacting simulation, mechanical optimization, and fabrication are introduced in details. In vertical test at 4.2K, the cavity reached Eacc=7MV/m with Q0=1.4*10^9 and Eacc=15.9MV/m with Q0=4.3*10^8.

preprint2015arXiv

Detection of a superconducting phase in a two-atom layer of hexagonal Ga film grown on semiconducting GaN(0001)

The recent observation of superconducting state at atomic scale has motivated the pursuit of exotic condensed phases in two-dimensional (2D) systems. Here we report on a superconducting phase in two-monolayer crystalline Ga films epitaxially grown on wide band-gap semiconductor GaN(0001). This phase exhibits a hexagonal structure and only 0.552 nm in thickness, nevertheless, brings about a superconducting transition temperature Tc as high as 5.4 K, confirmed by in situ scanning tunneling spectroscopy, and ex situ electrical magneto-transport and magnetization measurements. The anisotropy of critical magnetic field and Berezinski-Kosterlitz-Thouless-like transition are observed, typical for the 2D superconductivity. Our results demonstrate a novel platform for exploring atomic-scale 2D superconductor, with great potential for understanding of the interface superconductivity.

preprint2015arXiv

From random walks to distances on unweighted graphs

Large unweighted directed graphs are commonly used to capture relations between entities. A fundamental problem in the analysis of such networks is to properly define the similarity or dissimilarity between any two vertices. Despite the significance of this problem, statistical characterization of the proposed metrics has been limited. We introduce and develop a class of techniques for analyzing random walks on graphs using stochastic calculus. Using these techniques we generalize results on the degeneracy of hitting times and analyze a metric based on the Laplace transformed hitting time (LTHT). The metric serves as a natural, provably well-behaved alternative to the expected hitting time. We establish a general correspondence between hitting times of the Brownian motion and analogous hitting times on the graph. We show that the LTHT is consistent with respect to the underlying metric of a geometric graph, preserves clustering tendency, and remains robust against random addition of non-geometric edges. Tests on simulated and real-world data show that the LTHT matches theoretical predictions and outperforms alternatives.

preprint2015arXiv

Improved Algorithms for Exact and Approximate Boolean Matrix Decomposition

An arbitrary $m\times n$ Boolean matrix $M$ can be decomposed {\em exactly} as $M =U\circ V$, where $U$ (resp. $V$) is an $m\times k$ (resp. $k\times n$) Boolean matrix and $\circ$ denotes the Boolean matrix multiplication operator. We first prove an exact formula for the Boolean matrix $J$ such that $M =M\circ J^T$ holds, where $J$ is maximal in the sense that if any 0 element in $J$ is changed to a 1 then this equality no longer holds. Since minimizing $k$ is NP-hard, we propose two heuristic algorithms for finding suboptimal but good decomposition. We measure the performance (in minimizing $k$) of our algorithms on several real datasets in comparison with other representative heuristic algorithms for Boolean matrix decomposition (BMD). The results on some popular benchmark datasets demonstrate that one of our proposed algorithms performs as well or better on most of them. Our algorithms have a number of other advantages: They are based on exact mathematical formula, which can be interpreted intuitively. They can be used for approximation as well with competitive "coverage." Last but not least, they also run very fast. Due to interpretability issues in data mining, we impose the condition, called the "column use condition," that the columns of the factor matrix $U$ must form a subset of the columns of $M$.

preprint2015arXiv

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%.

preprint2015arXiv

Sparsifying Neural Network Connections for Face Recognition

This paper proposes to learn high-performance deep ConvNets with sparse neural connections, referred to as sparse ConvNets, for face recognition. The sparse ConvNets are learned in an iterative way, each time one additional layer is sparsified and the entire model is re-trained given the initial weights learned in previous iterations. One important finding is that directly training the sparse ConvNet from scratch failed to find good solutions for face recognition, while using a previously learned denser model to properly initialize a sparser model is critical to continue learning effective features for face recognition. This paper also proposes a new neural correlation-based weight selection criterion and empirically verifies its effectiveness in selecting informative connections from previously learned models in each iteration. When taking a moderately sparse structure (26%-76% of weights in the dense model), the proposed sparse ConvNet model significantly improves the face recognition performance of the previous state-of-the-art DeepID2+ models given the same training data, while it keeps the performance of the baseline model with only 12% of the original parameters.

preprint2015arXiv

Teaching a machine to see: unsupervised image segmentation and categorisation using growing neural gas and hierarchical clustering

We present a novel unsupervised learning approach to automatically segment and label images in astronomical surveys. Automation of this procedure will be essential as next-generation surveys enter the petabyte scale: data volumes will exceed the capability of even large crowd-sourced analyses. We demonstrate how a growing neural gas (GNG) can be used to encode the feature space of imaging data. When coupled with a technique called hierarchical clustering, imaging data can be automatically segmented and labelled by organising nodes in the GNG. The key distinction of unsupervised learning is that these labels need not be known prior to training, rather they are determined by the algorithm itself. Importantly, after training a network can be be presented with images it has never 'seen' before and provide consistent categorisation of features. As a proof-of-concept we demonstrate application on data from the Hubble Space Telescope Frontier Fields: images of clusters of galaxies containing a mixture of galaxy types that would easily be recognised and classified by a human inspector. By training the algorithm using one field (Abell 2744) and applying the result to another (MACS0416.1-2403), we show how the algorithm can cleanly separate image features that a human would associate with early and late type galaxies. We suggest that the algorithm has potential as a tool in the automatic analysis and data mining of next-generation imaging and spectral surveys, and could also find application beyond astronomy.

preprint2015arXiv

Thickness dependence of superconductivity and superconductor-insulator transition in ultrathin FeSe films on SrTiO3(001) substrate

Interface-enhanced high-temperature superconductivity in one unit-cell (UC) FeSe film on SrTiO3(001) (STO) substrate has recently attracted much attention in condensed matter physics and material science. Here, by ex situ transport measurements, we report on the superconductivity in FeSe ultra-thin films with different thickness on STO substrate. We find that the onset superconducting transition temperature (Tc) decreases with increasing film thickness of FeSe, which is opposite to the behavior usually observed in traditional superconductor films. By systematic post-annealing of 5 UC FeSe films, we observe an insulator to superconductor transition, which is accompanied with a sign change of the dominated charge carriers from holes to electrons at low temperatures according to the corresponding Hall measurement.

preprint2015arXiv

Traces of intertwiners for quantum affine sl_2 and Felder-Varchenko functions

We show that the traces of $U_q(\widehat{\mathfrak{sl}}_2)$-intertwiners of Etingof-Schiffmann-Varchenko valued in the three-dimensional evaluation representation converge in a certain region of parameters and give a representation-theoretic construction of Felder-Varchenko's hypergeometric solutions to the $q$-KZB heat equation. This gives the first proof that such a trace function converges and resolves the first case of the Etingof-Varchenko conjecture. As applications, we prove a symmetry property for traces of intertwiners and prove Felder-Varchenko's conjecture that their elliptic Macdonald polynomials are related to the affine Macdonald polynomials defined as traces over irreducible integrable $U_q(\widehat{\mathfrak{sl}}_2)$-modules by Etingof-Kirillov Jr. In the trigonometric and classical limits, we recover results of Etingof-Kirillov Jr. and Etingof-Varchenko. Our method relies on an interplay between the method of coherent states applied to the free field realization of the $q$-Wakimoto module of Matsuo, convergence properties given by the theta hypergeometric integrals of Felder-Varchenko, and rationality properties originating from the representation-theoretic definition of the trace function.

preprint2014arXiv

A representation-theoretic proof of the branching rule for Macdonald polynomials

We give a new representation-theoretic proof of the branching rule for Macdonald polynomials using the Etingof-Kirillov Jr. expression for Macdonald polynomials as traces of intertwiners of U_q(gl_n). In the Gelfand-Tsetlin basis, we show that diagonal matrix elements of such intertwiners are given by application of Macdonald's operators to a simple kernel. An essential ingredient in the proof is a map between spherical parts of double affine Hecke algebras of different ranks based upon the Dunkl-Kasatani conjecture.

preprint2014arXiv

CP mixed property of the Higgs-like particle in the decay channel $h\to Z Z^*\to 4l$

Current experiments do not support, as ATLAS and CMS collaborations at the Large Hadron Collider reported, that the Higgs-like resonance discovered in July 2012 is a pure CP-odd state. We examine a general $hZZ$ vertex which contains CP-even and CP-odd couplings, by studying the process $h\to ZZ^*\to l_1^+l_1^-l_2^+l_2^-$ with $l_1,\, l_2= e$ or $μ$, to explore the CP mixed property of the Higgs-like particle. One momentum asymmetry and two angular asymmetries have been analyzed in order to reveal the difference from different CP-couplings. Our study shows that these asymmetries could be interesting observables in the future precise experiments.

preprint2014arXiv

Crossover between Weak Antilocalization and Weak Localization of Bulk States in Ultrathin Bi2Se3 Films

We report transport studies on the 5 nm thick Bi2Se3 topological insulator films which are grown via molecular beam epitaxy technique. The angle-resolved photoemission spectroscopy data show that the Fermi level of the system lies in the bulk conduction band above the Dirac point, suggesting important contribution of bulk states to the transport results. In particular, the crossover from weak antilocalization to weak localization in the bulk states is observed in the parallel magnetic field measurements up to 50 Tesla. The measured magneto-resistance exhibits interesting anisotropy with respect to the orientation of B// and I, signifying intrinsic spin-orbit coupling in the Bi2Se3 films. Our work directly shows the crossover of quantum interference effect in the bulk states from weak antilocalization to weak localization. It presents an important step toward a better understanding of the existing three-dimensional topological insulators and the potential applications of nano-scale topological insulator devices.

preprint2014arXiv

Deep Learning Face Representation by Joint Identification-Verification

The key challenge of face recognition is to develop effective feature representations for reducing intra-personal variations while enlarging inter-personal differences. In this paper, we show that it can be well solved with deep learning and using both face identification and verification signals as supervision. The Deep IDentification-verification features (DeepID2) are learned with carefully designed deep convolutional networks. The face identification task increases the inter-personal variations by drawing DeepID2 extracted from different identities apart, while the face verification task reduces the intra-personal variations by pulling DeepID2 extracted from the same identity together, both of which are essential to face recognition. The learned DeepID2 features can be well generalized to new identities unseen in the training data. On the challenging LFW dataset, 99.15% face verification accuracy is achieved. Compared with the best deep learning result on LFW, the error rate has been significantly reduced by 67%.

preprint2014arXiv

Deeply learned face representations are sparse, selective, and robust

This paper designs a high-performance deep convolutional network (DeepID2+) for face recognition. It is learned with the identification-verification supervisory signal. By increasing the dimension of hidden representations and adding supervision to early convolutional layers, DeepID2+ achieves new state-of-the-art on LFW and YouTube Faces benchmarks. Through empirical studies, we have discovered three properties of its deep neural activations critical for the high performance: sparsity, selectiveness and robustness. (1) It is observed that neural activations are moderately sparse. Moderate sparsity maximizes the discriminative power of the deep net as well as the distance between images. It is surprising that DeepID2+ still can achieve high recognition accuracy even after the neural responses are binarized. (2) Its neurons in higher layers are highly selective to identities and identity-related attributes. We can identify different subsets of neurons which are either constantly excited or inhibited when different identities or attributes are present. Although DeepID2+ is not taught to distinguish attributes during training, it has implicitly learned such high-level concepts. (3) It is much more robust to occlusions, although occlusion patterns are not included in the training set.

preprint2014arXiv

Design and test of frequency tuner for CAEP high power THz free-electron laser

Peking University is developing a 1.3 GHz superconducting accelerating section for China Academy of Engineering Physics (CAEP) high power THz free-electron laser. A compact fast/slow tuner has developed by Institute of High Energy Physics (IHEP) for the accelerating section, to control Lorentz detuning, beam loading effect, compensate for microphonics and liquid Helium pressure fluctuations. The tuner design, warm test and cold test of the first prototype are presented.

preprint2014arXiv

High temperature superconducting FeSe films on SrTiO3 substrates

Interface enhanced superconductivity at two dimensional limit has become one of most intriguing research directions in condensed matter physics. Here, we report the superconducting properties of ultra-thin FeSe films with the thickness of one unit cell (1-UC) grown on conductive and insulating SrTiO3 (STO) substrates. For the 1-UC FeSe on conductive STO substrate (Nb-STO), the magnetization versus temperature (M-T) measurement shows a diamagnetic signal at 85 K, suggesting the possibility of superconductivity appears at this high temperature. For the FeSe films on insulating STO substrate, systematic transport measurements were carried out and the sheet resistance of FeSe films exhibits Arrhenius TAFF behavior with a crossover from a single-vortex pinning region to a collective creep region. More intriguing, sign reversal of Hall resistance with temperature is observed, demonstrating a crossover from hole conduction to electron conduction above Tc in 1-UC FeSe films.

preprint2014arXiv

Metric recovery from directed unweighted graphs

We analyze directed, unweighted graphs obtained from $x_i\in \mathbb{R}^d$ by connecting vertex $i$ to $j$ iff $|x_i - x_j| < ε(x_i)$. Examples of such graphs include $k$-nearest neighbor graphs, where $ε(x_i)$ varies from point to point, and, arguably, many real world graphs such as co-purchasing graphs. We ask whether we can recover the underlying Euclidean metric $ε(x_i)$ and the associated density $p(x_i)$ given only the directed graph and $d$. We show that consistent recovery is possible up to isometric scaling when the vertex degree is at least $ω(n^{2/(2+d)}\log(n)^{d/(d+2)})$. Our estimator is based on a careful characterization of a random walk over the directed graph and the associated continuum limit. As an algorithm, it resembles the PageRank centrality metric. We demonstrate empirically that the estimator performs well on simulated examples as well as on real-world co-purchasing graphs even with a small number of points and degree scaling as low as $\log(n)$.

preprint2013arXiv

Demonstration of surface transport in a hybrid Bi2Se3/Bi2Te3 heterostructure

In spite of much work on topological insulators (TIs), systematic experiments for TI/TI heterostructures remain absent. We grow a high quality heterostructure containing single quintuple layer (QL) of Bi2Se3 on 19 QLs of Bi2Te3 and compare its transport properties with 20 QLs Bi2Se3 and 20 QLs Bi2Te3. All three films are grown on insulating sapphire (0001) substrates by molecular beam epitaxy (MBE). In situ angle-resolved photoemission spectroscopy (ARPES) provides direct evidence that the surface state of 1 QL Bi2Se3 / 19 QLs Bi2Te3 heterostructure is similar to the surface state of the 20 QLs Bi2Se3 and different with that of the 20 QLs Bi2Te3. In ex situ transport measurements, the observed linear magnetoresistance (MR) and weak antilocalization (WAL) of the hybrid heterostructure are similar to that of the pure Bi2Se3 film and not the Bi2Te3 film. This suggests that the single Bi2Se3 QL layer on top of 19 QLs Bi2Te3 dominates its transport properties.

preprint2013arXiv

Direct observation of high temperature superconductivity in one-unit-cell FeSe films

Heterostructure based interface engineering has been proved an effective method for finding new superconducting systems and raising superconductivity transition temperature (TC). In previous work on one unit-cell (UC) thick FeSe films on SrTiO3 (STO) substrate, a superconducting-like energy gap as large as 20 meV, was revealed by in situ scanning tunneling microscopy/spectroscopy (STM/STS). Angle resolved photoemission spectroscopy (ARPES) further revealed a nearly isotropic gap of above 15 meV, which closes at a temperature of ~ 65 K. If this transition is indeed the superconducting transition, then the 1-UC FeSe represents the thinnest high TC superconductor discovered so far. However, up to date direct transport measurement of the 1-UC FeSe films has not been reported, mainly because growth of large scale 1-UC FeSe films is challenging and the 1-UC FeSe films are too thin to survive in atmosphere. In this work, we successfully prepared 1-UC FeSe films on insulating STO substrates with non-superconducting FeTe protection layers. By direct transport and magnetic measurements, we provide definitive evidence for high temperature superconductivity in the 1-UC FeSe films with an onset TC above 40 K and a extremely large critical current density JC ~ 1.7*106 A/cm2 at 2 K. Our work may pave the way to enhancing and tailoring superconductivity by interface engineering.

preprint2013arXiv

Electronic transport properties of topological insulator films and low dimensional superconductors

In this review, we present a summary of some recent experiments on topological insulators (TIs) and superconducting nanowires and films. Electron-electron interaction (EEI), weak anti-localization (WAL) and anisotropic magneto-resistance (AMR) effect found in TI films by transport measurements are reported. Then, transport properties of superconducting films, bridges and nanowires and proximity effect in non-superconducting nanowires are described. Finally, the interplay between TIs and superconductors (SCs) is also discussed.

preprint2013arXiv

Higgs decays to $γ$ and invisible particles in the standard model

Using the Higgs boson mass $m_h=125$ GeV, the radiative Higgs decays $h\rightarrowγν_l\barν_l$ with $ν_l = ν_e,\,ν_μ$ and $ν_τ$ are analyzed in the standard model. Our calculation shows that the inclusive width of these processes, i.e., the sum of $Γ(h\toγν_l\barν_l)$ for ${ν_l=ν_e,ν_μ,ν_τ}$, is $1.41$ keV, which is about $15\%$ of $Γ(h\toγγ)$. Therefore, the observation of these channels in the future precise experiments may provide us some useful information on the Higgs physics both in the standard model and in its possible extensions.

preprint2013arXiv

Higgs decays to gamma l+ l- in the standard model

The radiative Higgs decays h -> gamma l+l- with l=e,mu and tau are analyzed in the standard model using m_h=125 GeV. Both tree and one-loop diagrams for the processes are evaluated. In addition to their decay rates and dilepton invariant mass distributions, we focus on the forward-back asymmetries in these modes. Our calculation shows that the forward-backward asymmetries in h -> gamma e+e- and h -> gamma mu+mu- could be up to 10^{-2} while in the tau+tau- final state, these asymmetries are below 1%. Thus the forward-backward asymmetries in h -> gamma l+l- might be interesting observables in the future precise experiments both to test our understanding of Higgs physics in the standard model and to probe the novel Higgs dynamics in new physics scenarios.

preprint2012arXiv

Efficient Natural Evolution Strategies

Efficient Natural Evolution Strategies (eNES) is a novel alternative to conventional evolutionary algorithms, using the natural gradient to adapt the mutation distribution. Unlike previous methods based on natural gradients, eNES uses a fast algorithm to calculate the inverse of the exact Fisher information matrix, thus increasing both robustness and performance of its evolution gradient estimation, even in higher dimensions. Additional novel aspects of eNES include optimal fitness baselines and importance mixing (a procedure for updating the population with very few fitness evaluations). The algorithm yields competitive results on both unimodal and multimodal benchmarks.

preprint2012arXiv

Gravitational Corrections to $Φ^{4}$ Theory with Spontaneously Broken Symmetry

We consider a complex scalar $Φ^4 $ theory with spontaneously broken global U(1) symmetry, minimally coupling to perturbatively quantized Einstein gravity which is treated as an effective theory at the energy well below the Planck scale. Both the lowest order pure real scalar correction and the gravitational correction to the renormalization of the Higgs sector in this model have been investigated. Our results show that the gravitational correction renders the renormalization of the Higgs sector in this model inconsistent while the pure real scalar correction to it leads to a compatible renormalization.

preprint2012arXiv

Improving the Asymptotic Performance of Markov Chain Monte-Carlo by Inserting Vortices

We present a new way of converting a reversible finite Markov chain into a non-reversible one, with a theoretical guarantee that the asymptotic variance of the MCMC estimator based on the non-reversible chain is reduced. The method is applicable to any reversible chain whose states are not connected through a tree, and can be interpreted graphically as inserting vortices into the state transition graph. Our result confirms that non-reversible chains are fundamentally better than reversible ones in terms of asymptotic performance, and suggests interesting directions for further improving MCMC.

preprint2012arXiv

On Cellular Automata Models of Traffic Flow with Look-Ahead Potential

We study the statistical properties of a cellular automata model of traffic flow with the look-ahead potential. The model defines stochastic rules for the movement of cars on a lattice. We analyze the underlying statistical assumptions needed for the derivation of the coarse-grained model and demonstrate that it is possible to relax some of them to obtain an improved coarse-grained ODE model. We also demonstrate that spatial correlations play a crucial role in the presence of the look-ahead potential and propose a simple empirical correction to account for the spatial dependence between neighboring cells.

preprint2012arXiv

Superconductivity in single crystalline Pb nanowires contacted by normal metal electrodes

The transport properties of superconducting single crystal Pb nanowires of 55 nm and 70 nm diameter are studied by standard four electrodes method. Resistance-temperature (R-T) scans and magneto-resistance (R-H) measurements show a series of resistance steps with increasing temperature and magnetic field as the wires are brought toward the normal state. The resistance-current (R-I) scans at different temperature and magnetic field show that the increase in R with I is punctuated with sharp steps at specific current values. We interpret these steps as consequence of phase slip centers (PSCs) in the superconducting wires enhanced by the presence of the normal Pt electrodes.

preprint2011arXiv

A Linear Time Natural Evolution Strategy for Non-Separable Functions

We present a novel Natural Evolution Strategy (NES) variant, the Rank-One NES (R1-NES), which uses a low rank approximation of the search distribution covariance matrix. The algorithm allows computation of the natural gradient with cost linear in the dimensionality of the parameter space, and excels in solving high-dimensional non-separable problems, including the best result to date on the Rosenbrock function (512 dimensions).

preprint2011arXiv

Axiomatic Attribution for Multilinear Functions

We study the attribution problem, that is, the problem of attributing a change in the value of a characteristic function to its independent variables. We make three contributions. First, we propose a formalization of the problem based on a standard cost sharing model. Second, we show that there is a unique attribution method that satisfies Dummy, Additivity, Conditional Nonnegativity, Affine Scale Invariance, and Anonymity for all characteristic functions that are the sum of a multilinear function and an additive function. We term this the Aumann-Shapley-Shubik method. Conversely, we show that such a uniqueness result does not hold for characteristic functions outside this class. Third, we study multilinear characteristic functions in detail; we describe a computationally efficient implementation of the Aumann-Shapley-Shubik method and discuss practical applications to pay-per-click advertising and portfolio analysis.

preprint2011arXiv

Effect of Exchange-type Zero-bias Anomaly on Single Electron Tunnelling of Au Nanoparticles

Using cryogenic scanning tunnelling microscopy and scanning tunnelling spectroscopy we measured single electron tunnelling of isolated Au nanoparticles with 1.4 nm in radius. We observe that a gap ΔV ~ 2e/C (C is the capacitance of the Au particle) around zero bias in the tunnelling conductance spectrum, followed by a series of discrete single electron tunnelling peaks with voltage widths of EC ~ e/C at both negative and positive bias. Experimental data are well explained by taking into account the effect of exchange interaction of electrons on the single electron tunnelling of Au nanoparticles. A tunnelling peak near zero-bias was suppressed by the exchange-type zero-bias anomaly, which results in the gap ΔV ~ 2EC.

preprint2011arXiv

Natural Evolution Strategies

This paper presents Natural Evolution Strategies (NES), a recent family of algorithms that constitute a more principled approach to black-box optimization than established evolutionary algorithms. NES maintains a parameterized distribution on the set of solution candidates, and the natural gradient is used to update the distribution's parameters in the direction of higher expected fitness. We introduce a collection of techniques that address issues of convergence, robustness, sample complexity, computational complexity and sensitivity to hyperparameters. This paper explores a number of implementations of the NES family, ranging from general-purpose multi-variate normal distributions to heavy-tailed and separable distributions tailored towards global optimization and search in high dimensional spaces, respectively. Experimental results show best published performance on various standard benchmarks, as well as competitive performance on others.

preprint2011arXiv

Observation of Landau level-like quantizations at 77 K along a strained-induced graphene ridge

Recent studies show that the electronic structures of graphene can be modified by strain and it was predicted that strain in graphene can induce peaks in the local density of states (LDOS) mimicking Landau levels (LLs) generated in the presence of a large magnetic field. Here we report scanning tunnelling spectroscopy (STS) observation of nine strain-induced peaks in LDOS at 77 K along a graphene ridge created when the graphene layer was cleaved from a sample of highly oriented pyrolytic graphite (HOPG). The energies of these peaks follow the progression of LLs of massless 'Dirac fermions' (DFs) in a magnetic field of 230 T. The results presented here suggest a possible route to realize zero-field quantum Hall-like effects at 77 K.

preprint2008arXiv

A Family of Likelihood Ascent Search Multiuser Detectors: an Upper Bound of Bit Error Rate and a Lower Bound of Asymptotic Multiuser Efficiency

In this paper, the bit error performance of a family of likelihood ascent search (LAS) multiuser detectors is analyzed. An upper bound on the BER of any LAS detector is obtained by bounding the fixed point region with the worst initial detector. The concept of indecomposable errors developed by Verdu is applied to tighten the upper bound. In a special instance, the upper bound is reduced to that for all the local maximum likelihood detectors. The upper bound is comparable with that of the optimum detector obtained by Verdu. A lower bound on the asymptotic multiuser efficiency (AME) is then obtained. It is shown that there are nontrivial CDMA channels such that a LAS detector can achieve unit AME regardless of user number. The AME lower bound provides a means for further seeking a good set of spreading sequences and power distribution for spectral and power efficient CDMA.

preprint2008arXiv

Spectral efficiency and optimal medium access control of random access systems over large random spreading CDMA

This paper analyzes the spectral efficiency as a function of medium access control (MAC) for large random spreading CDMA random access systems that employ a linear receiver. It is shown that located at higher than the physical layer, MAC along with spreading and power allocation can effectively perform spectral efficiency maximization and near-far mitigation.

preprint1994arXiv

Calculation of Gromov-Witten invariants for $ CP^{3},CP^{4}$,and $Gr(2,4)$

Using the associativity relations of the topological Sigma Models with target spaces, $CP^3, CP^4$ and $Gr(2,4)$ , we derive recursion relations of their correlation and evaluate them up to certain order in the expansion over the instantons. The expansion coeffieients are regarded as the number of rational curves in $CP^3, CP^4$ and $Gr(2,4)$ which intersect various types of submanifolds corresponding to the choice of BRST invariant operators in the correlation functions.