arXiv subjects

Nan Zhang

Publications and source records attributed to Nan Zhang.

198 records · Page 11Linked to original sources

arXiv2015

The combination of directional outputs and single-mode operation in circular microdisk with broken PT symmetry

Monochromaticity and directionality are two key characteristics of lasers. However, the combination of directional emission and single-mode operation is quite challenging, especially for the on-chip devices. Here we propose a microdisk laser with single-mode operation and directional emissions by exploiting the recent developments associated with parity-time (PT) symmetry. This is accomplished by introducing one-dimensional periodic gain and loss into a circular microdisk, which induces a coupling between whispering gallery modes with different radial numbers. The lowest threshold mode is selected at the positions with least initial wavelength difference. And the directional emissions are formed by the introduction of additional grating vectors by the periodic distribution of gain and loss regions. We believe this research will impact the practical applications of on-chip microdisk lasers.

physics.optics↗

arXiv2015

Experimental demonstration of PT-symmetric stripe lasers

Recently, the coexistence of parity-time (PT) symmetric laser and absorber has gained tremendous research attention. While the PT symmetric absorber has been observed in microwave metamaterials, the experimental demonstration of PT symmetric laser is still absent. Here we experimentally study PT-symmetric laser absorber in stripe waveguide. Using the concept of PT symmetry to exploit the light amplification and absorption, PT-symmetric laser absorbers have been successfully obtained. Different from the single-mode PT symmetric lasers, the PT-symmetric stripe lasers have been experimentally confirmed by comparing the relative wavelength positions and mode spacing under different pumping conditions. When the waveguide is half pumped, the mode spacing is doubled and the lasing wavelengths shift to the center of every two initial lasing modes. All these observations are consistent with the theoretical predictions and confirm the PT-symmetry breaking well.

physics.optics↗

arXiv2015

Aggregate Estimations over Location Based Services

Location based services (LBS) have become very popular in recent years. They range from map services (e.g., Google Maps) that store geographic locations of points of interests, to online social networks (e.g., WeChat, Sina Weibo, FourSquare) that leverage user geographic locations to enable various recommendation functions. The public query interfaces of these services may be abstractly modeled as a kNN interface over a database of two dimensional points on a plane: given an arbitrary query point, the system returns the k points in the database that are nearest to the query point. In this paper we consider the problem of obtaining approximate estimates of SUM and COUNT aggregates by only querying such databases via their restrictive public interfaces. We distinguish between interfaces that return location information of the returned tuples (e.g., Google Maps), and interfaces that do not return location information (e.g., Sina Weibo). For both types of interfaces, we develop aggregate estimation algorithms that are based on novel techniques for precisely computing or approximately estimating the Voronoi cell of tuples. We discuss a comprehensive set of real-world experiments for testing our algorithms, including experiments on Google Maps, WeChat, and Sina Weibo.

cs.DB↗

arXiv2015

Leveraging History for Faster Sampling of Online Social Networks

How to enable efficient analytics over such data has been an increasingly important research problem. Given the sheer size of such social networks, many existing studies resort to sampling techniques that draw random nodes from an online social network through its restrictive web/API interface. Almost all of them use the exact same underlying technique of random walk - a Markov Chain Monte Carlo based method which iteratively transits from one node to its random neighbor. Random walk fits naturally with this problem because, for most online social networks, the only query we can issue through the interface is to retrieve the neighbors of a given node (i.e., no access to the full graph topology). A problem with random walks, however, is the "burn-in" period which requires a large number of transitions/queries before the sampling distribution converges to a stationary value that enables the drawing of samples in a statistically valid manner. In this paper, we consider a novel problem of speeding up the fundamental design of random walks (i.e., reducing the number of queries it requires) without changing the stationary distribution it achieves - thereby enabling a more efficient "drop-in" replacement for existing sampling-based analytics techniques over online social networks. Our main idea is to leverage the history of random walks to construct a higher-ordered Markov chain. We develop two algorithms, Circulated Neighbors and Groupby Neighbors Random Walk (CNRW and GNRW) and prove that, no matter what the social network topology is, CNRW and GNRW offer better efficiency than baseline random walks while achieving the same stationary distribution. We demonstrate through extensive experiments on real-world social networks and synthetic graphs the superiority of our techniques over the existing ones.

cs.SI↗

arXiv2015

End-fire injection of guided light into optical microcavity

Coupling light into microdisk plays a key role in a number of applications such as resonant filters and optical sensors. While several approaches have successfully coupled light into microdisk efficiently, most of them suffer from the ultrahigh sensitivity to the environmental vibration. Here we demonstrate a robust mechanism, which is termed as end-fire injection. By connecting an input waveguide to a circular microdisk directly, the mechanism shows that light can be efficiently coupled into optical microcavity. The coupling efficiency can be as high as 0.75 when the input signals are on resonances. Our numerical results reveal that the high coupling efficiency is attributed to the constructive interference between the whispering gallery modes and the input signals. We have also shown that the end-fire injection can be further extended to the long-lived resonances with low refractive index such as n = 1.45. We believe our results will shed light on the applications of optical microcavities.

physics.optics↗

arXiv2015

Inversed Vernier effect based single-mode laser emission in coupled microdisks

Recently, on-chip single-mode laser emission has attracted considerable research attention due to its wide applications. While most of single-mode lasers in coupled microdisks or microrings have been qualitatively explained by either Vernier effect or inversed Vernier effect, none of them have been experimentally confirmed. Here, we studied the mechanism for single-mode operation in coupled microdisks. We found that the mode numbers had been significantly reduced to nearly single-mode within a large pumping power range from threshold to gain saturation. The detail laser spectra showed that the largest gain and the first lasing peak were mainly generated by one disk and the laser intensity was proportional to the frequency detuning. The corresponding theoretical analysis showed that the experimental observations were dominated by internal coupling within one cavity, which was similar to the recently explored inversed Vernier effect in two coupled microrings. We believe our finding will be important for understanding the previous experimental findings and the development of on-chip single-mode laser.

physics.optics↗

arXiv2015

Rank-Based Inference over Web Databases

In recent years, there has been much research in Ranked Retrieval model in structured databases, especially those in web databases. With this model, a search query returns top-k tuples according to not just exact matches of selection conditions, but a suitable ranking function. This paper studies a novel problem on the privacy implications of database ranking. The motivation is a novel yet serious privacy leakage we found on real-world web databases which is caused by the ranking function design. Many such databases feature private attributes - e.g., a social network allows users to specify certain attributes as only visible to him/herself, but not to others. While these websites generally respect the privacy settings by not directly displaying private attribute values in search query answers, many of them nevertheless take into account such private attributes in the ranking function design. The conventional belief might be that tuple ranks alone are not enough to reveal the private attribute values. Our investigation, however, shows that this is not the case in reality. To address the problem, we introduce a taxonomy of the problem space with two dimensions, (1) the type of query interface and (2) the capability of adversaries. For each subspace, we develop a novel technique which either guarantees the successful inference of private attributes, or does so for a significant portion of real-world tuples. We demonstrate the effectiveness and efficiency of our techniques through theoretical analysis, extensive experiments over real-world datasets, as well as successful online attacks over websites with tens to hundreds of millions of users - e.g., Amazon Goodreads and Renren.com.

cs.DB↗

arXiv2014

Lifshitz effects on holographic $p$-wave superfluid

In the probe limit, we numerically build a holographic $p$-wave superfluid model in the four-dimensional Lifshitz black hole coupled to a Maxwell-complex vector field. We observe the rich phase structure and find that the Lifshitz dynamical exponent $z$ contributes evidently to the effective mass of the matter field and dimension of the gravitational background. Concretely, we obtain the Cave of Winds appeared only in the five-dimensional anti-de Sitter~(AdS) spacetime, and the increasing $z$ hinders not only the condensate but also the appearance of the first-order phase transition. Furthermore, our results agree with the Ginzburg-Landau results near the critical temperature. In addition, the previous AdS superfluid model is generalized to the Lifshitz spacetime.

hep-th↗

arXiv2014

Walk, Not Wait: Faster Sampling Over Online Social Networks

In this paper, we introduce a novel, general purpose, technique for faster sampling of nodes over an online social network. Specifically, unlike traditional random walk which wait for the convergence of sampling distribution to a predetermined target distribution - a waiting process that incurs a high query cost - we develop WALK-ESTIMATE, which starts with a much shorter random walk, and then proactively estimate the sampling probability for the node taken before using acceptance-rejection sampling to adjust the sampling probability to the predetermined target distribution. We present a novel backward random walk technique which provides provably unbiased estimations for the sampling probability, and demonstrate the superiority of WALK-ESTIMATE over traditional random walks through theoretical analysis and extensive experiments over real world online social networks.

cs.SI↗

arXiv2014

Lifshitz Scaling Effects on Holographic Superconductors

Via numerical and analytical methods, the effects of the Lifshitz dynamical exponent $z$ on holographic superconductors are studied in some detail, including $s$ wave and $p$ wave models. Working in the probe limit, we find that the behaviors of holographic models indeed depend on concrete value of $z$. We obtain the condensation and conductivity in both Lifshitz black hole and soliton backgrounds with general $z$. For both $s$ wave and $p$ wave models in the black hole backgrounds, as $z$ increases, the phase transition becomes more difficult and the growth of conductivity is suppressed. For the Lifshitz soliton backgrounds, when $z$ increases ($z=1,~2,~3$), the critical chemical potential decreases in the $s$ wave cases but increases in the $p$ wave cases. For $p$ wave models in both Lifshitz black hole and soliton backgrounds, the anisotropy between the AC conductivity in different spatial directions is suppressed when $z$ increases. The analytical results uphold the numerical results.

hep-th↗

arXiv2014

Aggregate Estimation Over Dynamic Hidden Web Databases

Many databases on the web are "hidden" behind (i.e., accessible only through) their restrictive, form-like, search interfaces. Recent studies have shown that it is possible to estimate aggregate query answers over such hidden web databases by issuing a small number of carefully designed search queries through the restrictive web interface. A problem with these existing work, however, is that they all assume the underlying database to be static, while most real-world web databases (e.g., Amazon, eBay) are frequently updated. In this paper, we study the novel problem of estimating/tracking aggregates over dynamic hidden web databases while adhering to the stringent query-cost limitation they enforce (e.g., at most 1,000 search queries per day). Theoretical analysis and extensive real-world experiments demonstrate the effectiveness of our proposed algorithms and their superiority over baseline solutions (e.g., the repeated execution of algorithms designed for static web databases).

cs.DB↗

arXiv2012

Faster Random Walks By Rewiring Online Social Networks On-The-Fly

Many online social networks feature restrictive web interfaces which only allow the query of a user's local neighborhood through the interface. To enable analytics over such an online social network through its restrictive web interface, many recent efforts reuse the existing Markov Chain Monte Carlo methods such as random walks to sample the social network and support analytics based on the samples. The problem with such an approach, however, is the large amount of queries often required (i.e., a long "mixing time") for a random walk to reach a desired (stationary) sampling distribution. In this paper, we consider a novel problem of enabling a faster random walk over online social networks by "rewiring" the social network on-the-fly. Specifically, we develop Modified TOpology (MTO)-Sampler which, by using only information exposed by the restrictive web interface, constructs a "virtual" overlay topology of the social network while performing a random walk, and ensures that the random walk follows the modified overlay topology rather than the original one. We show that MTO-Sampler not only provably enhances the efficiency of sampling, but also achieves significant savings on query cost over real-world online social networks such as Google Plus, Epinion etc.

cs.SI↗

arXiv2012

Digging Deeper into Deep Web Databases by Breaking Through the Top-k Barrier

A large number of web databases are only accessible through proprietary form-like interfaces which require users to query the system by entering desired values for a few attributes. A key restriction enforced by such an interface is the top-k output constraint - i.e., when there are a large number of matching tuples, only a few (top-k) of them are preferentially selected and returned by the website, often according to a proprietary ranking function. Since most web database owners set k to be a small value, the top-k output constraint prevents many interesting third-party (e.g., mashup) services from being developed over real-world web databases. In this paper we consider the novel problem of "digging deeper" into such web databases. Our main contribution is the meta-algorithm GetNext that can retrieve the next ranked tuple from the hidden web database using only the restrictive interface of a web database without any prior knowledge of its ranking function. This algorithm can then be called iteratively to retrieve as many top ranked tuples as necessary. We develop principled and efficient algorithms that are based on generating and executing multiple reformulated queries and inferring the next ranked tuple from their returned results. We provide theoretical analysis of our algorithms, as well as extensive experimental results over synthetic and real-world databases that illustrate the effectiveness of our techniques.

cs.DB↗

arXiv2012

Optimal Algorithms for Crawling a Hidden Database in the Web

A hidden database refers to a dataset that an organization makes accessible on the web by allowing users to issue queries through a search interface. In other words, data acquisition from such a source is not by following static hyper-links. Instead, data are obtained by querying the interface, and reading the result page dynamically generated. This, with other facts such as the interface may answer a query only partially, has prevented hidden databases from being crawled effectively by existing search engines. This paper remedies the problem by giving algorithms to extract all the tuples from a hidden database. Our algorithms are provably efficient, namely, they accomplish the task by performing only a small number of queries, even in the worst case. We also establish theoretical results indicating that these algorithms are asymptotically optimal -- i.e., it is impossible to improve their efficiency by more than a constant factor. The derivation of our upper and lower bound results reveals significant insight into the characteristics of the underlying problem. Extensive experiments confirm the proposed techniques work very well on all the real datasets examined.

cs.DB↗

arXiv2011

Parallel Binomial American Option Pricing with (and without) Transaction Costs

We present a parallel algorithm that computes the ask and bid prices of an American option when proportional transaction costs apply to the trading of the underlying asset. The algorithm computes the prices on recombining binomial trees, and is designed for modern multi-core processors. Although parallel option pricing has been well studied, none of the existing approaches takes transaction costs into consideration. The algorithm that we propose partitions a binomial tree into blocks. In any round of computation a block is further partitioned into regions which are assigned to distinct processors. To minimise load imbalance the assignment of nodes to processors is dynamically adjusted before each new round starts. Synchronisation is required both within a round and between two successive rounds. The parallel speedup of the algorithm is proportional to the number of processors used. The parallel algorithm was implemented in C/C++ via POSIX Threads, and was tested on a machine with 8 processors. In the pricing of an American put option, the parallel speedup against an efficient sequential implementation was 5.26 using 8 processors and 1500 time steps, achieving a parallel efficiency of 65.75%.

cs.DC↗

arXiv2007

Associated production of the scalars and new gauge bosons from a little Higgs model at the LHC

The littlest Higgs model with T-parity ($LHT$ model) predicts the existence of the T-odd scalars ($ϕ^{\pm}$, $ϕ^{0}$, and $ϕ^{p}$). We consider production of these new particles associated with T-odd gauge bosons at the $LHC$. We find that the partonic process $q\bar{q'}\toϕ^{+}B_{H}$ can generate a number of the characteristic signal events with a charged lepton and large missing energy at the $LHC$.

hep-ph↗

arXiv2007

Pair production of the heavy leptons in future high energy linear e^{+}e^{-} colliders

The littlest Higgs model with T-parity predicts the existence of the T-odd particles, which can only be produced in pair. We consider pair production of the T-odd leptons in future high energy linear $e^{+}e^{-}$ collider ($ILC$). Our numerical results show that, as long as the T-odd leptons are not too heavy, they can be copiously produced and their possible signals might be detected via the processes $e^{+}e^{-}\to \bar{L}_{i}L_{j}$ in future $ILC$ experiments.

hep-ph↗

arXiv2006

Effects of the littlest Higgs model with T-parity on Higgs boson production at high energy $e^{+}e^{-}$ colliders

The Higgs boson production processes $e^{+}e^{-}\to ZH$, $e^{+}e^{-}\to \bar{ν_{e}}ν_{e}H$, and $e^{+}e^{-}\to t\bar{t}H$ are very important for studying Higgs boson properties and further testing new physics beyond the standard model($SM$) in the high energy linear $e^{+}e^{-}$ collider($ILC$). We estimate the contributions of the littlest Higgs model with T-parity($LHT$ model) to these processes and find that the $LHT$ model can generate significantly corrections to the production cross sections of these processes. We expect the possible signals of the $LHT$ model can be detected via these processes in the future $ILC$ experiments.

hep-ph↗