Catalog footprint

What is connected

37works
25topics
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

37 published item(s)

preprint2026arXiv

Beyond Accuracy: Evaluating Strategy Diversity in LLM Mathematical Reasoning

Large language models now achieve high final-answer accuracy on mathematical reasoning benchmarks, but accuracy alone does not capture reasoning flexibility. We introduce a strategy-level evaluation framework instantiated on 80 AMC 10/12 and AIME problems with 217 AoPS-derived reference strategy families. Model outputs are annotated for strategy identity, validity, and correctness using dual-AI coding with human adjudication. Across four frontier models, we find a pronounced decoupling between answer accuracy and strategy diversity. Under a single-solution prompt, all models achieve high accuracy (95%-100%), but under a multiple-strategy prompt they recover substantially fewer strategies than the human reference set. Gemini, DeepSeek, GPT, and Claude generate 184, 152, 151, and 110 distinct valid strategies, respectively, with the largest gaps in Geometry and Number Theory. The models collectively produce 50 benchmark-novel valid strategies, indicating both incomplete coverage of human strategies and some capacity for alternative reasoning. A repeated-run robustness check on 20 problems shows diminishing gains in discovered strategies, with the strongest model recovering only 39 of 55 AoPS-reference strategies (71%) after three runs. These findings position strategy diversity as a complementary dimension for evaluating mathematical reasoning beyond answer correctness.

preprint2022arXiv

Facial Reduction for Symmetry Reduced Semidefinite Doubly Nonnegative Programs

We consider both facial reduction, \FRp, and symmetry reduction, \SRp, techniques for semidefinite programming, \SDPp. We show that the two together fit surprisingly well in an alternating direction method of multipliers, \ADMMp, approach. In fact, this approach allows for simply adding on nonnegativity constraints, and solving the doubly nonnegative, \DNN, relaxation of many classes of hard combinatorial problems. We also show that the singularity degree remains the same after \SRp, and that the \DNN relaxations considered here have singularity degree one, that is reduced to zero after \FRp. The combination of \FR and \SR leads to a significant improvement in both numerical stability and running time for both the \ADMM and interior point approaches. We test our method on various \DNN relaxations of hard combinatorial problems including quadratic assignment problems with sizes of more than $n=500$. This translates to a semidefinite constraint of order $250,000$ and $625\times 10^8$ nonnegative constrained variables, before applying the reduction techniques.

preprint2022arXiv

On the Estimation Bias in Double Q-Learning

Double Q-learning is a classical method for reducing overestimation bias, which is caused by taking maximum estimated values in the Bellman operation. Its variants in the deep Q-learning paradigm have shown great promise in producing reliable value prediction and improving learning performance. However, as shown by prior work, double Q-learning is not fully unbiased and suffers from underestimation bias. In this paper, we show that such underestimation bias may lead to multiple non-optimal fixed points under an approximate Bellman operator. To address the concerns of converging to non-optimal stationary solutions, we propose a simple but effective approach as a partial fix for the underestimation bias in double Q-learning. This approach leverages an approximate dynamic programming to bound the target value. We extensively evaluate our proposed method in the Atari benchmark tasks and demonstrate its significant improvement over baseline algorithms.

preprint2022arXiv

On the Role of Discount Factor in Offline Reinforcement Learning

Offline reinforcement learning (RL) enables effective learning from previously collected data without exploration, which shows great promise in real-world applications when exploration is expensive or even infeasible. The discount factor, $γ$, plays a vital role in improving online RL sample efficiency and estimation accuracy, but the role of the discount factor in offline RL is not well explored. This paper examines two distinct effects of $γ$ in offline RL with theoretical analysis, namely the regularization effect and the pessimism effect. On the one hand, $γ$ is a regulator to trade-off optimality with sample efficiency upon existing offline techniques. On the other hand, lower guidance $γ$ can also be seen as a way of pessimism where we optimize the policy's performance in the worst possible models. We empirically verify the above theoretical observation with tabular MDPs and standard D4RL tasks. The results show that the discount factor plays an essential role in the performance of offline RL algorithms, both under small data regimes upon existing offline methods and in large data regimes without other conservative methods.

preprint2022arXiv

Robust Interior Point Method for Quantum Key Distribution Rate Computation

Security proof methods for quantum key distribution, QKD, that are based on the numerical key rate calculation problem, are powerful in principle. However, the practicality of the methods are limited by computational resources and the efficiency and accuracy of the underlying algorithms for convex optimization. We derive a stable reformulation of the convex nonlinear semidefinite programming, SDP, model for the key rate calculation problems. We use this to develop an efficient, accurate algorithm. The stable reformulation is based on novel forms of facial reduction, FR, for both the linear constraints and nonlinear quantum relative entropy objective function. This allows for a Gauss-Newton type interior-point approach that avoids the need for perturbations to obtain strict feasibility, a technique currently used in the literature. The result is high accuracy solutions with theoretically proven lower bounds for the original QKD from the FR stable reformulation. This provides novel contributions for FR for general SDP. We report on empirical results that dramatically improve on speed and accuracy, as well as solving previously intractable problems.

preprint2022arXiv

Universal Critical Behavior of Percolation in Orientationally Ordered Janus Particles and Other Anisotropic Systems

We combine percolation theory and Monte Carlo simulation to study in two dimensions the connectivity of an equilibrium lattice model of interacting Janus disks which self-assemble into an orientationally ordered stripe phase at low temperature. As the patch size is increased or the temperature is lowered, clusters of patch-connected disks grow, and a percolating cluster emerges at a threshold. In the stripe phase, the critical clusters extend longer in the direction parallel to the stripes than in the perpendicular direction, and percolation is thus anisotropic. It is found that the critical behavior of percolation in the Janus system is consistent with that of standard isotropic percolation, when an appropriate spatial rescaling is made. The rescaling procedure can be applied to understand other anisotropic systems, such as the percolation of aligned rigid rods and of the $q$-state Potts model with anisotropic interactions.

preprint2021arXiv

De Sitter braneworld and gravitational waves

We study the braneworld theory constructed by multi scalar fields. The model contains a smooth and infinitely large extra dimension, allowing the background fields propagating in it. We give a de Sitter solution for the four-dimensional cosmology as a good approximation to the early universe inflation. We show that the graviton has a localizable massless mode, and a series of continuous massive modes, separated by a mass gap. There could be a normalizable massive mode, depending on the background solution. The gravitational waves of massless mode evolve the same as the four dimensional theory, while that of the massive modes evolve greatly different from the massless mode.

preprint2021arXiv

Percolation thresholds of randomly rotating patchy particles on Archimedean lattices

We study the percolation of randomly rotating patchy particles on $11$ Archimedean lattices in two dimensions. Each vertex of the lattice is occupied by a particle, and in each model the patch size and number are monodisperse. When there are more than one patches on the surface of a particle, they are symmetrically decorated. As the proportion $χ$ of the particle surface covered by the patches increases, the clusters connected by the patches grow and the system percolates at the threshold $χ_c$. We combine Monte Carlo simulations and the critical polynomial method to give precise estimates of $χ_c$ for disks with one to six patches and spheres with one to two patches on the $11$ lattices. For one-patch particles, we find that the order of $χ_c$ values for particles on different lattices is the same as that of threshold values $p_c$ for site percolation on same lattices, which implies that $χ_c$ for one-patch particles mainly depends on the geometry of lattices. For particles with more patches, symmetry become very important in determining $χ_c$. With the estimates of $χ_c$ for disks with one to six patches, by analyses related to symmetry, we are able to give precise values of $χ_c$ for disks with an arbitrary number of patches on all $11$ lattices. The following rules are found for patchy disks on each of these lattices: (i) as the number of patches $n$ increases, values of $χ_c$ repeat in a periodic way, with the period $n_0$ determined by the symmetry of the lattice; (ii) when $\mod(n,n_0)=0$, the minimum threshold value $χ_{\rm min}$ appears, and the model is equivalent to site percolation with $χ_{\rm min}=p_c$; (iii) disks with $\mod(n,n_0)=m$ and $n_0-m$ ($m<n_0/2$) share the same $χ_c$ value.

preprint2020arXiv

Controlling Cherenkov threshold with nonlocality

Cherenkov radiation is generally believed to be threshold-free in hyperbolic metamaterials owing to the extremely large photonic density of states in classical local framework. While recent advances in nonlocal and quantum effects extend our understanding of light-matter interactions in metallic nanostructures, the influence of nonlocality on threshold-free Cherenkov radiation still remains elusive. Here we theoretically demonstrate that the nonlocality provides an indispensable way to flexibly engineer Cherenkov thresholds in metallodielectric layered structures. Particularly, the nonlocality results in a lower-bound velocity cutoff, whose value is comparable to the electron Fermi velocity. Surprisingly, this lower-bound threshold can be significantly smaller than the classically predicted one if the metamaterial works around epsilon-near-zero frequencies. The capability to control Cherenkov thresholds opens numerous prospects for practical applications of Cherenkov radiation, in particular, for integrated free-electron radiation sources.

preprint2020arXiv

Critical polynomials in the nonplanar and continuum percolation models

Exact or precise thresholds have been intensively studied since the introduction of the percolation model. Recently the critical polynomial $P_{\rm B}(p,L)$ was introduced for planar-lattice percolation models, where $p$ is the occupation probability and $L$ is the linear system size. The solution of $P_{\rm B} = 0$ can reproduce all known exact thresholds and leads to unprecedented estimates for thresholds of unsolved planar-lattice models. In two dimensions, assuming the universality of $P_{\rm B}$, we use it to study a nonplanar lattice model, i.e., the equivalent-neighbor lattice bond percolation, and the continuum percolation of identical penetrable disks, by Monte Carlo simulations and finite-size scaling analysis. It is found that, in comparison with other quantities, $P_{\rm B}$ suffers much less from finite-size corrections. As a result, we obtain a series of high-precision thresholds $p_c(z)$ as a function of coordination number $z$ for equivalent-neighbor percolation with $z$ up to O$(10^5)$, and clearly confirm the asymptotic behavior $zp_c-1 \sim 1/\sqrt{z}$ for $z \rightarrow \infty$. For the continuum percolation model, we surprisingly observe that the finite-size correction in $P_{\rm B}$ is unobservable within uncertainty O$(10^{-5})$ as long as $L \geq 3$. The estimated threshold number density of disks is $ρ_c = 1.436 325 05(10)$, slightly below the most recent result $ρ_c = 1.436 325 45(8)$ of Mertens and Moore obtained by other means. Our work suggests that the critical polynomial method can be a powerful tool for studying nonplanar and continuum systems in statistical mechanics.

preprint2020arXiv

GraftNet: An Engineering Implementation of CNN for Fine-grained Multi-label Task

Multi-label networks with branches are proved to perform well in both accuracy and speed, but lacks flexibility in providing dynamic extension onto new labels due to the low efficiency of re-work on annotating and training. For multi-label classification task, to cover new labels we need to annotate not only newly collected images, but also the previous whole dataset to check presence of these new labels. Also training on whole re-annotated dataset costs much time. In order to recognize new labels more effectively and accurately, we propose GraftNet, which is a customizable tree-like network with its trunk pretrained with a dynamic graph for generic feature extraction, and branches separately trained on sub-datasets with single label to improve accuracy. GraftNet could reduce cost, increase flexibility, and incrementally handle new labels. Experimental results show that it has good performance on our human attributes recognition task, which is fine-grained multi-label classification.

preprint2020arXiv

Linker-mediated self-assembly of mobile DNA-coated colloids

Developing construction methods of materials tailored for given applications with absolute control over building block placement poses an immense challenge. DNA-coated colloids offer the possibility of realising programmable self-assembly, which, in principle, can assemble almost any structure in equilibrium, but remains challenging experimentally. Here, we propose an innovative system of linker-mediated mobile DNA-coated colloids (mDNACCs), in which mDNACCs are bridged by the free DNA linkers in solution, whose two single-stranded DNA tails can bind with specific single-stranded DNA receptors of complementary sequence coated on colloids. We formulate a mean-field theory efficiently calculating the effective interaction between mDNACCs, where the entropy of DNA linkers plays a nontrivial role. Particularly, when the binding between free DNA linkers in solution and the corresponding receptors on mDNACCs is strong, the linker-mediated colloidal interaction is determined by the linker entropy depending on the linker concentration.

preprint2020arXiv

Self-controlled growth of highly uniform Ge/Si hut wires for scalable qubit devices

Semiconductor nanowires have been playing a crucial role in the development of nanoscale devices for the realization of spin qubits, Majorana fermions, single photon emitters, nanoprocessors, etc. The monolithic growth of site-controlled nanowires is a prerequisite towards the next generation of devices that will require addressability and scalability. Here, combining top-down nanofabrication and bottom-up self-assembly, we report on the growth of Ge wires on pre-patterned Si (001) substrates with controllable position, distance, length and structure. This is achieved by a novel growth process which uses a SiGe strain-relaxation template and can be generalized to other material combinations. Transport measurements show an electrically tunable spin-orbit coupling, with a spin-orbit length similar to that of III-V materials. Also, capacitive coupling between closely spaced wires is observed, which underlines their potential as a host for implementing two qubit gates. The reported results open a path towards scalable qubit devices with Si compatibility.

preprint2020arXiv

Stochastic inversion of Gaussian random media using transverse coherence functions for reflected waves

The transverse coherence functions (TCFs) of phase and amplitude fluctuations of a seismic wave are powerful to estimate the spatial distribution, length scales, and strength of random heterogeneities. However, TCFs have been formulated for transmitted waves only, not for reflected waves. In this paper, we derive reflection TCFs for Gaussian random media. Furthermore, we propose to invert for Gaussian random media using the reflection TCFs based on the grid search. We validate the new reflection TCF formulas using 2D finite-difference numerical experiments. The numerical example also illustrates the feasibility and efficiency of the inversion. The stochastic inversion using reflected waves can be used in both exploration and global seismology.

preprint2020arXiv

Stochasticity and heterogeneity in the transmission dynamics of SARS-CoV-2

SARS-CoV-2 causing COVID-19 disease has moved rapidly around the globe, infecting millions and killing hundreds of thousands. The basic reproduction number, which has been widely used and misused to characterize the transmissibility of the virus, hides the fact that transmission is stochastic, is dominated by a small number of individuals, and is driven by super-spreading events (SSEs). The distinct transmission features, such as high stochasticity under low prevalence, and the central role played by SSEs on transmission dynamics, should not be overlooked. Many explosive SSEs have occurred in indoor settings stoking the pandemic and shaping its spread, such as long-term care facilities, prisons, meat-packing plants, fish factories, cruise ships, family gatherings, parties and night clubs. These SSEs demonstrate the urgent need to understand routes of transmission, while posing an opportunity that outbreak can be effectively contained with targeted interventions to eliminate SSEs. Here, we describe the potential types of SSEs, how they influence transmission, and give recommendations for control of SARS-CoV-2.

preprint2020arXiv

Surface Dyakonov-Cherenkov Radiation

Recent advances in engineered material technologies (e.g., photonic crystals, metamaterials, plasmonics, etc) provide valuable tools to control Cherenkov radiation. In all these approaches, however, the designed materials interact only with the particle velocity to affect Cherenkov radiation, while the influence of the particle trajectory is generally negligible. Here, we report on surface Dyakonov-Cherenkov radiation, i.e. the emission of directional Dyakonov surface waves from a swift charged particle moving atop a birefringent crystal. This new type of Cherenkov radiation is highly susceptible to both the particle velocity and trajectory, e.g. we observe a sharp radiation enhancement when the particle trajectory falls in the vicinity of a particular direction. Moreover, close to the Cherenkov threshold, such a radiation enhancement can be orders of magnitude higher than that obtained in traditional Cherenkov detectors. These distinct properties allow us to determine simultaneously the magnitude and direction of particle velocities on a compact platform. The surface Dyakonov-Cherenkov radiation studied in this work not only adds a new degree of freedom for particle identification, but also provides an all-dielectric route to construct compact Cherenkov detectors with enhanced sensitivity.

preprint2020arXiv

The linearization problem of a binary quadratic problem and its applications

We provide several applications of the linearization problem of a binary quadratic problem. We propose a new lower bounding strategy, called the linearization-based scheme, that is based on a simple certificate for a quadratic function to be non-negative on the feasible set. Each linearization-based bound requires a set of linearizable matrices as an input. We prove that the Generalized Gilmore-Lawler bounding scheme for binary quadratic problems provides linearization-based bounds. Moreover, we show that the bound obtained from the first level reformulation linearization technique is also a type of linearization-based bound, which enables us to provide a comparison among mentioned bounds. However, the strongest linearization-based bound is the one that uses the full characterization of the set of linearizable matrices. Finally, we present a polynomial-time algorithm for the linearization problem of the quadratic shortest path problem on directed acyclic graphs. Our algorithm gives a complete characterization of the set of linearizable matrices for the quadratic shortest path problem.

preprint2018arXiv

Ultra-compact graphene plasmonic photodetector with the bandwidth over 110GHz

Graphene-based photodetectors, taking advantage of high carrier mobility and broadband absorption in graphene, have recently experienced rapid development. However, their performances with respect to the responsivity and bandwidth are still limited by either weak light-graphene interaction or large resistance-capacitance product. Here, we demonstrate a waveguide coupled integrated graphene plasmonic photodetector on the silicon-on-insulator platform. Benefiting from plasmonic enhanced graphene-light interactions and subwavelength confinement of the optical energy, we present a small-footprint graphene-plasmonic photodetector with bandwidth beyond 110GHz and intrinsic responsivity of 360mA/W. Attributed to the unique electronic bandstructure of graphene and its ultra-broadband absorption, the operational wavelength range extending beyond mid-infrared, and possibly further, can be anticipated. Our results show that the combination of graphene with plasmonic devices has great potential to realize ultra-compact and high-speed optoelectronic devices for graphene-based optical interconnects.

preprint2017arXiv

Irreversible Markov chain Monte Carlo algorithm for self-avoiding walk

We formulate an irreversible Markov chain Monte Carlo algorithm for the self-avoiding walk (SAW), which violates the detailed balance condition and satisfies the balance condition. Its performance improves significantly compared to that of the Berretti-Sokal algorithm, which is a variant of the Metropolis-Hastings method. The gained efficiency increases with the spatial dimension (D), from approximately $10$ times in 2D to approximately $40$ times in 5D. We simulate the SAW on a 5D hypercubic lattice with periodic boundary conditions, for a system with a linear size up to $L=128$, and confirm that as for the 5D Ising model, the finite-size scaling of the SAW is governed by renormalized exponents $ν^*=2/d$ and $γ/ν^*=d/2$. The critical point is determined, which is approximately $8$ times more precise than the best available estimate.

preprint2016arXiv

No-enclave percolation corresponds to holes in the cluster backbone

The no-enclave percolation (NEP) model introduced recently by Sheinman et al. can be mapped to a problem of holes within a standard percolation backbone, and numerical measurements of these holes gives the size-distribution exponent $τ= 1.82(1)$ of the NEP model. An argument is given that $τ=1 + d_B/2 \approx 1.822$ where $d_B$ is the backbone dimension. On the other hand, a model of simple holes within a percolation cluster implies $τ= 1 + d_f/2 = 187/96 \approx 1.948$, where $d_f$ is the fractal dimension of the cluster, and this value is consistent with Sheinman et al.'s experimental results of gel collapse which gives $τ= 1.91(6)$. Both models yield a discontinuous maximum hole size at $p_c$, signifying explosive percolation behavior. At $p_c$, the largest hole fills exactly half the system, due to symmetry. Extensive numerical simulations confirm our results.

preprint2015arXiv

Effective electro-optical modulation with high extinction ratio by a graphene-silicon microring resonator

Graphene opens up for novel optoelectronic applications thanks to its high carrier mobility, ultra-large absorption bandwidth, and extremely fast material response. In particular, the opportunity to control optoelectronic properties through tuning of Fermi level enables electro-optical modulation, optical-optical switching, and other optoelectronics applications. However, achieving a high modulation depth remains a challenge because of the modest graphene-light interaction in the graphene-silicon devices, typically, utilizing only a monolayer or few layers of graphene. Here, we comprehensively study the interaction between graphene and a microring resonator, and its influence on the optical modulation depth. We demonstrate graphene-silicon microring devices showing a high modulation depth of 12.5 dB with a relatively low bias voltage of 8.8 V. On-off electro-optical switching with an extinction ratio of 3.8 dB is successfully demonstrated by applying a square-waveform with a 4 V peak-to-peak voltage.

preprint2015arXiv

First-Take-All: Temporal Order-Preserving Hashing for 3D Action Videos

With the prevalence of the commodity depth cameras, the new paradigm of user interfaces based on 3D motion capturing and recognition have dramatically changed the way of interactions between human and computers. Human action recognition, as one of the key components in these devices, plays an important role to guarantee the quality of user experience. Although the model-driven methods have achieved huge success, they cannot provide a scalable solution for efficiently storing, retrieving and recognizing actions in the large-scale applications. These models are also vulnerable to the temporal translation and warping, as well as the variations in motion scales and execution rates. To address these challenges, we propose to treat the 3D human action recognition as a video-level hashing problem and propose a novel First-Take-All (FTA) Hashing algorithm capable of hashing the entire video into hash codes of fixed length. We demonstrate that this FTA algorithm produces a compact representation of the video invariant to the above mentioned variations, through which action recognition can be solved by an efficient nearest neighbor search by the Hamming distance between the FTA hash codes. Experiments on the public 3D human action datasets shows that the FTA algorithm can reach a recognition accuracy higher than 80%, with about 15 bits per frame considering there are 65 frames per video over the datasets.

preprint2015arXiv

InAR:Inverse Augmented Reality

Augmented reality is the art to seamlessly fuse virtual objects into real ones. In this short note, we address the opposite problem, the inverse augmented reality, that is, given a perfectly augmented reality scene where human is unable to distinguish real objects from virtual ones, how the machine could help do the job. We show by structure from motion (SFM), a simple 3D reconstruction technique from images in computer vision, the real and virtual objects can be easily separated in the reconstructed 3D scene.

preprint2015arXiv

Short-range correlations in percolation at criticality

We derive the critical nearest-neighbor connectivity $g_n$ as $3/4$, $3(7-9p_c^{tri})/[4(5-4p_c^{tri})]$, and $3(2+7p_c^{tri})/[4(5-p_c^{tri})]$ for bond percolation on the square, honeycomb and triangular lattice respectively, where $p_c^{tri}=2\sin(π/18)$ is the percolation threshold for the triangular lattice; and confirm these values via Monte Carlo simulations. On the square lattice, we also numerically determine the critical next-nearest-neighbor connectivity as $g_{nn}=0.687\;500\;0(2)$, which confirms a conjecture by Mitra and Nienhuis in J. Stat. Mech. P10006 (2004), implying the exact value $g_{nn}=11/16$. We also determine the connectivity on a free surface as $g_n^{surf}=0.625\;000\;1(13)$ and conjecture that this value is exactly equal to $5/8$. In addition, we find that at criticality, the connectivities depend on the linear finite size L as $\sim L^{y_t-d}$, and the associated specific-heat-like quantities $C_n$ and $C_{nn}$ scale as $\sim L^{2y_t-d} \ln (L/L_0)$, where $d$ is the lattice dimensionality, $y_t=1/ν$ the thermal renormalization exponent, and $L_0$ a non-universal constant. We provide an explanation of this logarithmic factor in the theoretical framework reported recently by Vasseur et al. in J. Stat. Mech. L07001 (2012).

preprint2015arXiv

Universal Critical Wrapping Probabilities in the Canonical Ensemble

Universal dimensionless quantities, such as Binder ratios and wrapping probabilities, play an important role in the study of critical phenomena. We study the finite-size scaling behavior of the wrapping probability for the Potts model in the random-cluster representation, under the constraint that the total number of occupied bonds is fixed, so that the canonical ensemble applies. We derive that, in the limit $L \rightarrow \infty$, the critical values of the wrapping probability are different from those of the unconstrained model, i.e. the model in the grand-canonical ensemble, but still universal, for systems with $2y_t - d > 0$ where $y_t = 1/ν$ is the thermal renormalization exponent and $d$ is the spatial dimension. Similar modifications apply to other dimensionless quantities, such as Binder ratios. For systems with $2y_t-d \le 0$, these quantities share same critical universal values in the two ensembles. It is also derived that new finite-size corrections are induced. These findings apply more generally to systems in the canonical ensemble, e.g. the dilute Potts model with a fixed total number of vacancies. Finally, we formulate an efficient cluster-type algorithm for the canonical ensemble, and confirm these predictions by extensive simulations.

preprint2014arXiv

Fano resonance control in a photonic crystal structure and its application to ultrafast switching

Fano resonances appear in quantum mechanical as well as classical systems as a result of the interference between two paths: one involving a discrete resonance and the other a continuum. Compared to a conventional resonance, characterized by a Lorentzian spectral response, the characteristic asymmetric and sharp spectral response of a Fano resonance is suggested to enable photonic switches and sensors with superior characteristics. While experimental demonstrations of the appearance of Fano resonances have been made in both plasmonic and photonic-crystal structures, the control of these resonances is experimentally challenging, often involving the coupling of near-resonant cavities. Here, we experimentally demonstrate two simple structures that allow surprisingly robust control of the Fano spectrum. One structure relies on controlling the amplitude of one of the paths and the other uses symmetry breaking. Short-pulse dynamic measurements show that besides drastically increasing the switching contrast, the transmission dynamics itself is strongly affected by the nature of the resonance. The influence of slow-recovery tails implied by a long carrier lifetime can thus be reduced using a Fano resonance due to a hitherto unrecognized reshaping effect of the nonlinear Fano transfer function. For the first time, we present a system application of a Fano structure, demonstrating its advantages by the experimental realization of 10 Gbit/s all-optical modulation with bit-error-ratios on the order of 10$^{-7}$ for input powers less than 1 mW. These results represent a significant improvement compared to the use of a conventional Lorentzian resonance.

preprint2014arXiv

Nonreciprocal transmission in a photonic-crystal Fano structure enabled by symmetry breaking

Nanostructures that feature nonreciprocal light transmission are highly desirable building blocks for realizing photonic integrated circuits. Here, a simple and ultra-compact photonic-crystal structure, where a waveguide is coupled to a single nanocavity, is proposed and experimentally demonstrated, showing very efficient optical diode functionality. The key novelty of the structure is the use of a Fano resonance in combination with spatial symmetry breaking and cavity enhanced material nonlinearities to realize non-reciprocal propagation effects at ultra-low power and with a good wavelength tunability. The nonlinearity of the device relies on ultrafast carrier dynamics, rather than the thermal effects usually considered, allowing the demonstration of nonreciprocal operation at a bit-rate of 10 Gbit/s with a low energy consumption of 4.5 fJ/bit.

preprint2013arXiv

Combine Umbrella Sampling with Integrated Tempering Method for Efficient and Accurate Calculation of Free Energy Changes of Complex Energy Surface

Umbrella sampling is an efficient method for the calculation of free energy changes of a system along well-defined reaction coordinates. However, when multiple parallel channels along the reaction coordinate or hidden barriers in directions perpendicular to the reaction coordinate exist, it is difficult for conventional umbrella sampling methods to generate sufficient sampling within limited simulation time. Here we propose an efficient approach to combine umbrella sampling with the integrated tempering sampling method. The umbrella sampling method is applied to conformational degrees of freedom which possess significant barriers and are chemically more relevant. The integrated tempering sampling method is employed to facilitate the sampling of other degrees of freedom in which statistically non-negligible barriers may exist. The combined method is applied to two model systems and show significantly improved sampling efficiencies as compared to standalone conventional umbrella sampling or integrated tempering sampling approaches. Therefore, the combined approach will become a very efficient method in the simulation of biomolecular processes which often involve sampling of complex rugged energy landscapes.

preprint2013arXiv

Percolation in the canonical ensemble

We study the bond percolation problem under the constraint that the total number of occupied bonds is fixed, so that the canonical ensemble applies. We show via an analytical approach that at criticality, the constraint can induce new finite-size corrections with exponent y_{can}=2y_t-d both in energy-like and magnetic quantities, where y_t=1/ν is the thermal renormalization exponent and d is the spatial dimension. Furthermore, we find that while most of universal parameters remain unchanged, some universal amplitudes, like the excess cluster number, can be modified and become non-universal. We confirm these predictions by extensive Monte Carlo simulations of the two-dimensional percolation problem which has y_{can}=-1/2.

preprint2013arXiv

Probe and Adapt: Rate Adaptation for HTTP Video Streaming At Scale

Today, the technology for video streaming over the Internet is converging towards a paradigm named HTTP-based adaptive streaming (HAS). HAS comes with two unique flavors. First, by riding on top of HTTP/TCP, it leverages the network-friendly TCP to achieve firewall/NATS traversal and bandwidth sharing. Second, by pre-encoding and storing the video in a number of discrete bitrate levels, it introduces video bitrate adaptivity in a scalable way that the video encoding is excluded from the closed-loop adaptation. A conventional wisdom is that the TCP throughput observed by a HAS client indicates the available network bandwidth, thus can be used as a reliable reference for the video bitrate selection. We argue that this no longer holds true when HAS becomes a substantial fraction of the Internet traffic. We show that when multiple HAS clients compete at a network bottleneck, the presence of competing clients and the discrete nature of the video bitrates would together create confusion for a client to correctly perceive its fair-share bandwidth. Through analysis and real experiments, we demonstrate that this fundamental limitation would lead to, for example, video rate oscillation that negatively impacts the video watching experiences. We therefore argue that it is necessary to implement at the application layer a "probe-and-adapt" mechanism for HAS video rate adaptation, which is akin but orthogonal to the transport-layer network rate adaptation achieved by TCP. We present PANDA -- a client-side rate adaptation algorithm for HAS -- as an embodiment of this idea. Our testbed results show that compared to conventional algorithms, PANDA is able to reduce the instability of video rate by 60%, at a given risk of buffer underrun.

preprint2012arXiv

High-precision Absolute Distance Measurements over a Long Range Based on Two Optoelectronic Oscillators

Absolute distance measurement (ADM) over a long range has been studied intensely over the last several decades, due to its important applications in large-scale manufacturing and outer space explorations [1-5]. Traditional absolute distance measurements utilize detection of time-of-flight information, detection of phase shift, or a combination of the two [6-17]. In this paper, we present a novel scheme for high-precision ADM over a long range based on frequency detection by using two optoelectronic oscillators (OEO) to convert distance information to frequency information. By taking advantage of accumulative magnification theory, the absolute error of the measured distance is magnified by about 2*10E5 times, which makes the precision of the measured distance significantly improved. In our experiments, the maximum error is 1.5 um at the emulated ~6 km distance, including the drift error of about 1 um in the air path due to the change in environmental conditions. In addition, the measurable distance using this scheme could be further extended. The highest relative measurement precision is 2*10E10 in our current system while the actual relative measurement precision of our experimental system is limited by the variation of atmospheric conditions and is about 4*10E9.

preprint2012arXiv

The fundamental Diagram of Pedestrian Model with Slow Reaction

The slow-to-start models are a classical cellular automata model in simulating vehicle traffic. However, to our knowledge, the slow-to-start effect has not considered in modeling pedestrian dynamic. We verify the similar behavior between pedestrian and vehicle, and propose an new lattice gas (LG) model called the slow reaction (SR) model to describe the pedestrian's delayed reaction in single-file movement. We simulate and reproduce the Seyfried's field experiments at the research centre Julich, and use its empirical data to validate our SR model. We compare the SR model with the standard LG model. We test different probability of slow reaction ps in SR model and found the simulation data of ps=0.3 fit the empirical data best. The RMS error of mean velocity of SR model is smaller than that of standard LG model. In the range of ps=0.1~0.3, our fundamental diagram between velocity and density by simulation coincides with field experiments. The distribution of individual velocity in fundamental diagram in SR model agrees with the empirical data better than that of standard LG model. In addition, we observe the stop-and-go waves and phase separation in pedestrian flow by simulation. We reproduced the phenomena of uneven distribution of interspaces by SR model while the standard LG model did not implement. The SR model can reproduce the evolution of spatio-temporal structures of pedestrian flow with higher fidelity to Seyfried's experiments than the standard LG model.

preprint2011arXiv

Quantum Stress: Density Functional Theory Formulation and Physical Manifestation

The concept of "quantum stress (QS)" is introduced and formulated within density functional theory (DFT), to elucidate extrinsic electronic effects on the stress state of solids and thin films in the absence of lattice strain. A formal expression of QS (σ^Q) is derived in relation to deformation potential of electronic states (Ξ) and variation of electron density (Δn), σ^Q = ΞΔn, as a quantum analog of classical Hook's law. Two distinct QS manifestations are demonstrated quantitatively by DFT calculations: (1) in the form of bulk stress induced by charge carriers; and (2) in the form of surface stress induced by quantum confinement. Implications of QS in some physical phenomena are discussed to underlie its importance.

preprint2010arXiv

Modeling vaccination campaigns and the Fall/Winter 2009 activity of the new A(H1N1) influenza in the Northern Hemisphere

The unfolding of pandemic influenza A(H1N1) for Fall 2009 in the Northern Hemisphere is still uncertain. Plans for vaccination campaigns and vaccine trials are underway, with the first batches expected to be available early October. Several studies point to the possibility of an anticipated pandemic peak that could undermine the effectiveness of vaccination strategies. Here we use a structured global epidemic and mobility metapopulation model to assess the effectiveness of massive vaccination campaigns for the Fall/Winter 2009. Mitigation effects are explored depending on the interplay between the predicted pandemic evolution and the expected delivery of vaccines. The model is calibrated using recent estimates on the transmissibility of the new A(H1N1) influenza. Results show that if additional intervention strategies were not used to delay the time of pandemic peak, vaccination may not be able to considerably reduce the cumulative number of cases, even when the mass vaccination campaign is started as early as mid-October. Prioritized vaccination would be crucial in slowing down the pandemic evolution and reducing its burden.

preprint2009arXiv

Multiscale mobility networks and the large scale spreading of infectious diseases

Among the realistic ingredients to be considered in the computational modeling of infectious diseases, human mobility represents a crucial challenge both on the theoretical side and in view of the limited availability of empirical data. In order to study the interplay between small-scale commuting flows and long-range airline traffic in shaping the spatio-temporal pattern of a global epidemic we i) analyze mobility data from 29 countries around the world and find a gravity model able to provide a global description of commuting patterns up to 300 kms; ii) integrate in a worldwide structured metapopulation epidemic model a time-scale separation technique for evaluating the force of infection due to multiscale mobility processes in the disease dynamics. Commuting flows are found, on average, to be one order of magnitude larger than airline flows. However, their introduction into the worldwide model shows that the large scale pattern of the simulated epidemic exhibits only small variations with respect to the baseline case where only airline traffic is considered. The presence of short range mobility increases however the synchronization of subpopulations in close proximity and affects the epidemic behavior at the periphery of the airline transportation infrastructure. The present approach outlines the possibility for the definition of layered computational approaches where different modeling assumptions and granularities can be used consistently in a unifying multi-scale framework.