Catalog footprint

What is connected

52works
36topics
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

52 published item(s)

preprint2026arXiv

Babel: Jailbreaking Safety Attention via Obfuscation Distribution Optimized Sampling

Despite rigorous safety alignment, Large Language Models (LLMs) remain vulnerable to jailbreak attacks. Existing black-box methods often rely on heuristic templates or exhaustive trials, lacking mechanistic interpretability and query efficiency. In this study, we investigate an intrinsic vulnerability in the safety mechanisms of LLMs, where safety alignment relies on a small set of sparsely distributed attention heads, leaving much of the representational space weakly monitored. We formalize this phenomenon with a mathematical jailbreaking model that characterizes the delicate boundary of effective text obfuscation and analytically explains observed jailbreak behaviors. Guided by this model, we propose Babel, an efficient black-box attack framework that exploits the identified safety gap through systematic obfuscation sampling with iterative, feedback-driven distribution refinement, enabling reliable and high-success jailbreak attacks without access to model internals. Comprehensive evaluations on frontier commercial models demonstrate that Babel achieves state-of-the-art attack success rates and superior query efficiency. Specifically, compared to state-of-the-art methods, Babel increases the attack success rate on GPT-4o from 41.33% to 82.67% and on Claude-3-5-haiku from 38.33% to 78.33% within an average of 40 queries, providing a robust red-teaming methodology for LLMs safety research.

preprint2026arXiv

Dimensional Balance Improves Large Scale Spatiotemporal Prediction Performance

Accurate spatiotemporal pattern analysis is critical in fields such as urban traffic, meteorology, and public health monitoring. However, existing methods face performance bottlenecks, typically yielding only incremental gains and often exhibiting limited cross-domain transferability. We analyze this bottleneck through spatial and temporal entropy measures, which are used as diagnostic indicators of spatiotemporal complexity mismatch rather than as guarantees that entropy alignment alone yields better forecasting. Empirically, larger mismatch is often accompanied by higher prediction uncertainty, especially under a fixed model-capacity budget. Guided by this diagnostic, we propose a scalable, adaptive framework that harmonizes spatial and temporal feature representations. Spatial dimensionality is compressed via low-rank matrix embedding to preserve essential structure, while an extended temporal horizon captures long-range dependencies and mitigates cumulative errors arising from temporal heterogeneity. Extensive experiments on urban traffic, meteorological, and epidemic datasets demonstrate substantial accuracy gains and broad applicability across the evaluated domains, suggesting that the framework is promising for a wide range of spatiotemporal tasks beyond the current study. The code is available on GitHub at https://github.com/ST-Balance/ST-Balance.

preprint2026arXiv

GLM-4.5V and GLM-4.1V-Thinking: Towards Versatile Multimodal Reasoning with Scalable Reinforcement Learning

We present GLM-4.1V-Thinking, GLM-4.5V, and GLM-4.6V, a family of vision-language models (VLMs) designed to advance general-purpose multimodal understanding and reasoning. In this report, we share our key findings in the development of the reasoning-centric training framework. We first develop a capable vision foundation model with significant potential through large-scale pre-training, which arguably sets the upper bound for the final performance. We then propose Reinforcement Learning with Curriculum Sampling (RLCS) to unlock the full potential of the model, leading to comprehensive capability enhancement across a diverse range of tasks, including STEM problem solving, video understanding, content recognition, coding, grounding, GUI-based agents, and long document interpretation. In a comprehensive evaluation across 42 public benchmarks, GLM-4.5V achieves state-of-the-art performance on nearly all tasks among open-source models of similar size, and demonstrates competitive or even superior results compared to closed-source models such as Gemini-2.5-Flash on challenging tasks including Coding and GUI Agents. Meanwhile, the smaller GLM-4.1V-9B-Thinking remains highly competitive-achieving superior results to the much larger Qwen2.5-VL-72B on 29 benchmarks. We open-source both GLM-4.1V-9B-Thinking and GLM-4.5V. We further introduce the GLM-4.6V series, open-source multimodal models with native tool use and a 128K context window. A brief overview is available at https://z.ai/blog/glm-4.6v. Code, models and more information are released at https://github.com/zai-org/GLM-V.

preprint2026arXiv

GLM-5V-Turbo: Toward a Native Foundation Model for Multimodal Agents

We present GLM-5V-Turbo, a step toward native foundation models for multimodal agents. As foundation models are increasingly deployed in real environments, agentic capability depends not only on language reasoning, but also on the ability to perceive, interpret, and act over heterogeneous contexts such as images, videos, webpages, documents, GUIs. GLM-5V-Turbo is built around this objective: multimodal perception is integrated as a core component of reasoning, planning, tool use, and execution, rather than as an auxiliary interface to a language model. This report summarizes the main improvements behind GLM-5V-Turbo across model design, multimodal training, reinforcement learning, toolchain expansion, and integration with agent frameworks. These developments lead to strong performance in multimodal coding, visual tool use, and framework-based agentic tasks, while preserving competitive text-only coding capability. More importantly, our development process offers practical insights for building multimodal agents, highlighting the central role of multimodal perception, hierarchical optimization, and reliable end-to-end verification.

preprint2026arXiv

GSAlign: Geometric and Semantic Alignment Network for Aerial-Ground Person Re-Identification

Aerial-Ground person re-identification (AG-ReID) is an emerging yet challenging task that aims to match pedestrian images captured from drastically different viewpoints, typically from unmanned aerial vehicles (UAVs) and ground-based surveillance cameras. The task poses significant challenges due to extreme viewpoint discrepancies, occlusions, and domain gaps between aerial and ground imagery. While prior works have made progress by learning cross-view representations, they remain limited in handling severe pose variations and spatial misalignment. To address these issues, we propose a Geometric and Semantic Alignment Network (GSAlign) tailored for AG-ReID. GSAlign introduces two key components to jointly tackle geometric distortion and semantic misalignment in aerial-ground matching: a Learnable Thin Plate Spline (LTPS) Module and a Dynamic Alignment Module (DAM). The LTPS module adaptively warps pedestrian features based on a set of learned keypoints, effectively compensating for geometric variations caused by extreme viewpoint changes. In parallel, the DAM estimates visibility-aware representation masks that highlight visible body regions at the semantic level, thereby alleviating the negative impact of occlusions and partial observations in cross-view correspondence. A comprehensive evaluation on CARGO with four matching protocols demonstrates the effectiveness of GSAlign, achieving significant improvements of +18.8\% in mAP and +16.8\% in Rank-1 accuracy over previous state-of-the-art methods on the aerial-ground setting.

preprint2026arXiv

MLB: A Scenario-Driven Benchmark for Evaluating Large Language Models in Clinical Applications

The proliferation of Large Language Models (LLMs) presents transformative potential for healthcare, yet practical deployment is hindered by the absence of frameworks that assess real-world clinical utility. Existing benchmarks test static knowledge, failing to capture the dynamic, application-oriented capabilities required in clinical practice. To bridge this gap, we introduce a Medical LLM Benchmark MLB, a comprehensive benchmark evaluating LLMs on both foundational knowledge and scenario-based reasoning. MLB is structured around five core dimensions: Medical Knowledge (MedKQA), Safety and Ethics (MedSE), Medical Record Understanding (MedRU), Smart Services (SmartServ), and Smart Healthcare (SmartCare). The benchmark integrates 22 datasets (17 newly curated) from diverse Chinese clinical sources, covering 64 clinical specialties. Its design features a rigorous curation pipeline involving 300 licensed physicians. Besides, we provide a scalable evaluation methodology, centered on a specialized judge model trained via Supervised Fine-Tuning (SFT) on expert annotations. Our comprehensive evaluation of 10 leading models reveals a critical translational gap: while the top-ranked model, Kimi-K2-Instruct (77.3% accuracy overall), excels in structured tasks like information extraction (87.8% accuracy in MedRU), performance plummets in patient-facing scenarios (61.3% in SmartServ). Moreover, the exceptional safety score (90.6% in MedSE) of the much smaller Baichuan-M2-32B highlights that targeted training is equally critical. Our specialized judge model, trained via SFT on a 19k expert-annotated medical dataset, achieves 92.1% accuracy, an F1-score of 94.37%, and a Cohen's Kappa of 81.3% for human-AI consistency, validating a reproducible and expert-aligned evaluation protocol. MLB thus provides a rigorous framework to guide the development of clinically viable LLMs.

preprint2022arXiv

Anti-Forgery: Towards a Stealthy and Robust DeepFake Disruption Attack via Adversarial Perceptual-aware Perturbations

DeepFake is becoming a real risk to society and brings potential threats to both individual privacy and political security due to the DeepFaked multimedia are realistic and convincing. However, the popular DeepFake passive detection is an ex-post forensics countermeasure and failed in blocking the disinformation spreading in advance. To address this limitation, researchers study the proactive defense techniques by adding adversarial noises into the source data to disrupt the DeepFake manipulation. However, the existing studies on proactive DeepFake defense via injecting adversarial noises are not robust, which could be easily bypassed by employing simple image reconstruction revealed in a recent study MagDR. In this paper, we investigate the vulnerability of the existing forgery techniques and propose a novel \emph{anti-forgery} technique that helps users protect the shared facial images from attackers who are capable of applying the popular forgery techniques. Our proposed method generates perceptual-aware perturbations in an incessant manner which is vastly different from the prior studies by adding adversarial noises that is sparse. Experimental results reveal that our perceptual-aware perturbations are robust to diverse image transformations, especially the competitive evasion technique, MagDR via image reconstruction. Our findings potentially open up a new research direction towards thorough understanding and investigation of perceptual-aware adversarial attack for protecting facial images against DeepFakes in a proactive and robust manner. We open-source our tool to foster future research. Code is available at https://github.com/AbstractTeen/AntiForgery/.

preprint2022arXiv

Decomposition of Matrix Product States into Shallow Quantum Circuits

The rapid pace of recent advancements in numerical computation, notably the rise of GPU and TPU hardware accelerators, have allowed tensor network (TN) algorithms to scale to even larger quantum simulation problems, and to be employed more broadly for solving machine learning tasks. The "quantum-inspired" nature of TNs permits them to be mapped to parametrized quantum circuits (PQCs), a fact which has inspired recent proposals for enhancing the performance of TN algorithms using near-term quantum devices, as well as enabling joint quantum-classical training frameworks which benefit from the distinct strengths of TN and PQC models. However, the success of any such methods depends on efficient and accurate methods for approximating TN states using realistic quantum circuits, something which remains an unresolved question. In this work, we compare a range of novel and previously-developed algorithmic protocols for decomposing matrix product states (MPS) of arbitrary bond dimensions into low-depth quantum circuits consisting of stacked linear layers of two-qubit unitaries. These protocols are formed from different combinations of a preexisting analytical decomposition scheme with constrained optimization of circuit unitaries, and all possess efficient classical runtimes. Our experimental results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods, with even greater benefits seen in the setting of limited computational resources. Given these promising results, we expect our proposed decomposition protocol to form a useful ingredient within any joint application of TNs and PQCs, in turn further unlocking the rich and complementary benefits of classical and quantum computation.

preprint2022arXiv

Embedded Point Iteration Based Recursive Algorithm for Online Identification of Nonlinear Regression Models

This paper presents a novel online identification algorithm for nonlinear regression models. The online identification problem is challenging due to the presence of nonlinear structure in the models. Previous works usually ignore the special structure of nonlinear regression models, in which the parameters can be partitioned into a linear part and a nonlinear part. In this paper, we develop an efficient recursive algorithm for nonlinear regression models based on analyzing the equivalent form of variable projection (VP) algorithm. By introducing the embedded point iteration (EPI) step, the proposed recursive algorithm can properly exploit the coupling relationship of linear parameters and nonlinear parameters. In addition, we theoretically prove that the proposed algorithm is mean-square bounded. Numerical experiments on synthetic data and real-world time series verify the high efficiency and robustness of the proposed algorithm.

preprint2022arXiv

ERASE: Energy Efficient Task Mapping and Resource Management for Work Stealing Runtimes

Parallel applications often rely on work stealing schedulers in combination with fine-grained tasking to achieve high performance and scalability. However, reducing the total energy consumption in the context of work stealing runtimes is still challenging, particularly when using asymmetric architectures with different types of CPU cores. A common approach for energy savings involves dynamic voltage and frequency scaling (DVFS) wherein throttling is carried out based on factors like task parallelism, stealing relations and task criticality. This paper makes the following observations: (i) leveraging DVFS on a per-task basis is impractical when using fine-grained tasking and in environments with cluster/chip-level DVFS; (ii) task moldability, wherein a single task can execute on multiple threads/cores via work-sharing, can help to reduce energy consumption; and (iii) mismatch between tasks and assigned resources (i.e.~core type and number of cores) can detrimentally impact energy consumption. In this paper, we propose ERASE (EneRgy Aware SchedulEr), an intra-application task scheduler on top of work stealing runtimes that aims to reduce the total energy consumption of parallel applications. It achieves energy savings by guiding scheduling decisions based on per-task energy consumption predictions of different resource configurations. In addition, ERASE is capable of adapting to both given static frequency settings and externally controlled DVFS. Overall, ERASE achieves up to 31% energy savings and improves performance by 44% on average, compared to the state-of-the-art DVFS-based schedulers.

preprint2022arXiv

Fast Sinkhorn II: Collinear Triangular Matrix and Linear Time Accurate Computation of Optimal Transport

In our previous work [arXiv:2202.10042], the complexity of Sinkhorn iteration is reduced from $O(N^2)$ to the optimal $O(N)$ by leveraging the special structure of the kernel matrix. In this paper, we explore the special structure of kernel matrices by defining and utilizing the properties of the Lower-ColLinear Triangular Matrix (L-CoLT matrix) and Upper-ColLinear Triangular Matrix (U-CoLT matrix). We prove that (1) L/U-CoLT matrix-vector multiplications can be carried out in $O(N)$ operations; (2) both families of matrices are closed under the Hadamard product and matrix scaling. These properties help to alleviate two key difficulties for reducing the complexity of the Inexact Proximal point method (IPOT), and allow us to significantly reduce the number of iterations to $O(N)$. This yields the Fast Sinkhorn II (FS-2) algorithm for accurate computation of optimal transport with low algorithm complexity and fast convergence. Numerical experiments are presented to show the effectiveness and efficiency of our approach.

preprint2022arXiv

Fluid laminarization in protein-based high internal phase emulsions process

Protein-based high internal phase emulsions (HIPEs) have gained tremendous attention in diverse fields, but their mechanism in the emulsification process remains elusive. In this article, HIPEs were stabilized directly by food-grade proteins, depending on a self-organized process featuring a fluid laminarization. We elucidated that the emulsification with the rotor-stator mixer is a typical non-equilibrium process. The crucial factor for the process is related to the irreversible energy dissipation, while the internal phase volume fraction is the threshold determining the laminarization. The feasible explanation speculated that the transition corresponds to the dissipative structure, i.e., compressive droplets, arising from the spatiotemporal self-organization, to dissipate the turbulent kinetic energy. We found a new paradigm of dissipative structure, comprehending such structure in the HIPEs emulsification process, which is expected to pave the way for its industrial-scale production with the virtue of low-cost proteins.

preprint2022arXiv

HyTGraph: GPU-Accelerated Graph Processing with Hybrid Transfer Management

Processing large graphs with memory-limited GPU needs to resolve issues of host-GPU data transfer, which is a key performance bottleneck. Existing GPU-accelerated graph processing frameworks reduce the data transfers by managing the active subgraph transfer at runtime. Some frameworks adopt explicit transfer management approaches based on explicit memory copy with filter or compaction. In contrast, others adopt implicit transfer management approaches based on on-demand access with zero-copy or unified-memory. Having made intensive analysis, we find that as the active vertices evolve, the performance of the two approaches varies in different workloads. Due to heavy redundant data transfers, high CPU compaction overhead, or low bandwidth utilization, adopting a single approach often results in suboptimal performance. In this work, we propose a hybrid transfer management approach to take the merits of both the two approaches at runtime, with an objective to achieve the shortest execution time in each iteration. Based on the hybrid approach, we present HytGraph, a GPU-accelerated graph processing framework, which is empowered by a set of effective task scheduling optimizations to improve the performance. Our experimental results on real-world and synthesized graphs demonstrate that HyTGraph achieves up to 10.27X speedup over existing GPU-accelerated graph processing systems including Grus, Subway, and EMOGI.

preprint2022arXiv

S-type stars discovered in Medium-Resolution Spectra of LAMOST DR9

In this paper, we report on 606 S-type stars identified from Data Release 9 of the LAMOST medium-resolution spectroscopic (MRS) survey, and 539 of them are reported for the first time. The discovery of these stars is a three-step process, i.e., selecting with the ZrO band indices greater than 0.25, excluding non-S-type stars with the iterative Support Vector Machine method, and finally retaining stars with absolute bolometric magnitude larger than -7.1. The 606 stars are consistent with the distribution of known S-type stars in the color-magnitude diagram. We estimated the C/Os using the [C/Fe] and [O/Fe] provided by APOGEE and the MARCS model for S-type stars, respectively, and the results of the two methods show that C/Os of all stars are larger than 0.5. Both the locations on the color-magnitude diagram and C/Os further verify the nature of our S-type sample. Investigating the effect of TiO and atmospheric parameters on ZrO with the sample, we found that log g has a more significant impact on ZrO than Teff and [Fe/H], and both TiO and log g may negatively correlate with ZrO. According to the criterion of Tian et al. (2020), a total of 238 binary candidates were found by the zero-point-calibrated radial velocities from the officially released catalog of LAMOST MRS and the catalog of Zhang et al. (2021). A catalog of these 606 S-type stars is available from the following link https://doi.org/10.12149/101097.

preprint2022arXiv

The Quadratic Wasserstein Metric With Squaring Scaling For Seismic Velocity Inversion

The quadratic Wasserstein metric has shown its power in measuring the difference between probability densities, which benefits optimization objective function with better convexity and is insensitive to data noise. Nevertheless, it is always an important question to make the seismic signals suitable for comparison using the quadratic Wasserstein metric. The squaring scaling is worth exploring since it guarantees the convexity caused by data shift. However, as mentioned in [Commun. Inf. Syst., 2019, 19:95-145], the squaring scaling may lose uniqueness and result in more local minima to the misfit function. In our previous work [J. Comput. Phys., 2018, 373:188-209], the quadratic Wasserstein metric with squaring scaling was successfully applied to the earthquake location problem. But it only discussed the inverse problem with few degrees of freedom. In this work, we will present a more in-depth study on the combination of squaring scaling technique and the quadratic Wasserstein metric. By discarding some inapplicable data, picking seismic phases, and developing a new normalization method, we successfully invert the seismic velocity structure based on the squaring scaling technique and the quadratic Wasserstein metric. The numerical experiments suggest that this newly proposed method is an efficient approach to obtain more accurate inversion results.

preprint2022arXiv

Thick branes with inner structure in mimetic $f(R)$ gravity

In this paper, we study the structure and gravitational resonances of thick branes generated by a mimetic scalar field in $f(R)$ gravity. We obtain several typical thick brane solutions for $f(R)=R+αR^2$. To study their stability, we analyze the tensor perturbation of the metric. It is shown that any thick brane model with $df/dR>0$ is stable and the graviton zero mode can be localized on the brane for each solution, which indicates that the four-dimensional Newtonian gravity can be restored. The effect of the parameter $α$ on the gravitational resonances is studied. As a brane splits into multi sub-branes, the effective potential of the tensor perturbation will have an abundant inner structure with multi-wells, and this will lead to new phenomena of the gravitational resonances.

preprint2022arXiv

Trajectory Prediction with Graph-based Dual-scale Context Fusion

Motion prediction for traffic participants is essential for a safe and robust automated driving system, especially in cluttered urban environments. However, it is highly challenging due to the complex road topology as well as the uncertain intentions of the other agents. In this paper, we present a graph-based trajectory prediction network named the Dual Scale Predictor (DSP), which encodes both the static and dynamical driving context in a hierarchical manner. Different from methods based on a rasterized map or sparse lane graph, we consider the driving context as a graph with two layers, focusing on both geometrical and topological features. Graph neural networks (GNNs) are applied to extract features with different levels of granularity, and features are subsequently aggregated with attention-based inter-layer networks, realizing better local-global feature fusion. Following the recent goal-driven trajectory prediction pipeline, goal candidates with high likelihood for the target agent are extracted, and predicted trajectories are generated conditioned on these goals. Thanks to the proposed dual-scale context fusion network, our DSP is able to generate accurate and human-like multi-modal trajectories. We evaluate the proposed method on the large-scale Argoverse motion forecasting benchmark, and it achieves promising results, outperforming the recent state-of-the-art methods.

preprint2021arXiv

Auditory Attention Decoding from EEG using Convolutional Recurrent Neural Network

The auditory attention decoding (AAD) approach was proposed to determine the identity of the attended talker in a multi-talker scenario by analyzing electroencephalography (EEG) data. Although the linear model-based method has been widely used in AAD, the linear assumption was considered oversimplified and the decoding accuracy remained lower for shorter decoding windows. Recently, nonlinear models based on deep neural networks (DNN) have been proposed to solve this problem. However, these models did not fully utilize both the spatial and temporal features of EEG, and the interpretability of DNN models was rarely investigated. In this paper, we proposed novel convolutional recurrent neural network (CRNN) based regression model and classification model, and compared them with both the linear model and the state-of-the-art DNN models. Results showed that, our proposed CRNN-based classification model outperformed others for shorter decoding windows (around 90% for 2 s and 5 s). Although worse than classification models, the decoding accuracy of the proposed CRNN-based regression model was about 5% greater than other regression models. The interpretability of DNN models was also investigated by visualizing layers' weight.

preprint2021arXiv

Eye-gaze Estimation with HEOG and Neck EMG using Deep Neural Networks

Hearing-impaired listeners usually have troubles attending target talker in multi-talker scenes, even with hearing aids (HAs). The problem can be solved with eye-gaze steering HAs, which requires listeners eye-gazing on the target. In a situation where head rotates, eye-gaze is subject to both behaviors of saccade and head rotation. However, existing methods of eye-gaze estimation did not work reliably, since the listener's strategy of eye-gaze varies and measurements of the two behaviors were not properly combined. Besides, existing methods were based on hand-craft features, which could overlook some important information. In this paper, a head-fixed and a head-free experiments were conducted. We used horizontal electrooculography (HEOG) and neck electromyography (NEMG), which separately measured saccade and head rotation to commonly estimate eye-gaze. Besides traditional classifier and hand-craft features, deep neural networks (DNN) were introduced to automatically extract features from intact waveforms. Evaluation results showed that when the input was HEOG with inertial measurement unit, the best performance of our proposed DNN classifiers achieved 93.3%; and when HEOG was with NEMG together, the accuracy reached 72.6%, higher than that with HEOG (about 71.0%) or NEMG (about 35.7%) alone. These results indicated the feasibility to estimate eye-gaze with HEOG and NEMG.

preprint2020arXiv

An Adaptive Performance-oriented Scheduler for Static and Dynamic Heterogeneity

With the emergence of heterogeneous hardware paving the way for the post-Moore era, it is of high importance to adapt the runtime scheduling to the platform's heterogeneity. To enhance adaptive and responsive scheduling, we introduce a Performance Trace Table (PTT) into XiTAO, a framework for elastic scheduling of mixed-mode parallelism. The PTT is an extensible and dynamic lightweight manifest of the per-core latency that can be used to guide the scheduling of both critical and non-critical tasks. By understanding the per-task latency, the PTT can infer task performance, intra-application interference as well as inter-application interference. We run random Direct Acyclic Graphs (DAGs) of different workload categories as a benchmark on NVIDIA Jetson TX2 chip, achieving up to 3.25x speedup over a standard work-stealing scheduler. To exemplify scheduling adaption to interference, we run DAGs with high parallelism and analyze the scheduler's response to interference from a background process on an Intel Haswell (2650v3) multicore workstation. We also showcase the XiTAO's scheduling performance by porting the VGG-16 image classification framework based on Convolutional Neural Networks (CNN).

preprint2020arXiv

Bayesian Auctions with Efficient Queries

Generating good revenue is one of the most important problems in Bayesian auction design, and many (approximately) optimal dominant-strategy incentive compatible (DSIC) Bayesian mechanisms have been constructed for various auction settings. However, most existing studies do not consider the complexity for the seller to carry out the mechanism. It is assumed that the seller knows "each single bit" of the distributions and is able to optimize perfectly based on the entire distributions. Unfortunately, this is a strong assumption and may not hold in reality: for example, when the value distributions have exponentially large supports or do not have succinct representations. In this work we consider, for the first time, the query complexity of Bayesian mechanisms. We only allow the seller to have limited oracle accesses to the players' value distributions, via quantile queries and value queries. For a large class of auction settings, we prove logarithmic lower-bounds for the query complexity for any DSIC Bayesian mechanism to be of any constant approximation to the optimal revenue. For single-item auctions and multi-item auctions with unit-demand or additive valuation functions, we prove tight upper-bounds via efficient query schemes, without requiring the distributions to be regular or have monotone hazard rate. Thus, in those auction settings the seller needs to access much less than the full distributions in order to achieve approximately optimal revenue.

preprint2020arXiv

Efficient Uncertainty-aware Decision-making for Automated Driving Using Guided Branching

Decision-making in dense traffic scenarios is challenging for automated vehicles (AVs) due to potentially stochastic behaviors of other traffic participants and perception uncertainties (e.g., tracking noise and prediction errors, etc.). Although the partially observable Markov decision process (POMDP) provides a systematic way to incorporate these uncertainties, it quickly becomes computationally intractable when scaled to the real-world large-size problem. In this paper, we present an efficient uncertainty-aware decision-making (EUDM) framework, which generates long-term lateral and longitudinal behaviors in complex driving environments in real-time. The computation complexity is controlled to an appropriate level by two novel techniques, namely, the domain-specific closed-loop policy tree (DCP-Tree) structure and conditional focused branching (CFB) mechanism. The key idea is utilizing domain-specific expert knowledge to guide the branching in both action and intention space. The proposed framework is validated using both onboard sensing data captured by a real vehicle and an interactive multi-agent simulation platform. We also release the code of our framework to accommodate benchmarking.

preprint2020arXiv

Review of data analysis in vision inspection of power lines with an in-depth discussion of deep learning technology

The widespread popularity of unmanned aerial vehicles enables an immense amount of power lines inspection data to be collected. How to employ massive inspection data especially the visible images to maintain the reliability, safety, and sustainability of power transmission is a pressing issue. To date, substantial works have been conducted on the analysis of power lines inspection data. With the aim of providing a comprehensive overview for researchers who are interested in developing a deep-learning-based analysis system for power lines inspection data, this paper conducts a thorough review of the current literature and identifies the challenges for future research. Following the typical procedure of inspection data analysis, we categorize current works in this area into component detection and fault diagnosis. For each aspect, the techniques and methodologies adopted in the literature are summarized. Some valuable information is also included such as data description and method performance. Further, an in-depth discussion of existing deep-learning-related analysis methods in power lines inspection is proposed. Finally, we conclude the paper with several research trends for the future of this area, such as data quality problems, small object detection, embedded application, and evaluation baseline.

preprint2020arXiv

Spectral-change enhancement with prior SNR for the hearing impaired

A previous signal processing algorithm that aimed to enhance spectral changes (SCE) over time showed benefit for hearing-impaired (HI) listeners to recognize speech in background noise. In this work, the previous SCE was manipulated to perform on target-dominant segments, rather than treating all frames equally. Instantaneous signal-to-noise ratios (SNRs) were calculated to determine whether the segments should be processed. Initially, the ideal SNR calculated by the knowledge of premixed signals was introduced to the previous SCE algorithm (SCE-iSNR). Speech intelligibility (SI) and clarity preference were measured for 12 HI listeners in steady speech-spectrum noise (SSN) and six-talk speech (STS) maskers, respectively. The results showed the SCE-iSNR algorithm improved SI significantly for both maskers at high signal-to-masker ratios (SMRs) and for STS masker at low SMRs, while processing effect on speech quality was small. Secondly, the estimated SNR obtained from real mixtures was used, resulting in another SCE-eSNR. SI and subjective rating on naturalness and speech quality were tested for 7 HI subjects. The SCE-eSNR algorithm showed improved SI for SSN masker at high SMRs and for STS masker at low SMRs, as well as better naturalness and speech quality for STS masker. The limitations of applying the algorithms are discussed.

preprint2020arXiv

Strong field frustrated double ionization of argon atoms

Using a three-dimensional semiclassical method, we theoretically investigate frustrated double ionization (FDI) of Ar atoms subjected to strong laser fields. The double-hump photoelectron momentum distribution generated from FDI observed in a recent experiment [S. Larimian et al., Phys. Rev. Research 2, 013021 (2020)] is reproduced by our simulation. We confirm that the observed spectrum is due to recollision. The laser intensity dependence of FDI is investigated. We reveal that the doubly excited states of Ar atoms and excited states of Ar+ are the dominant pathways for producing FDI at relatively low and high intensities, respectively. Our work demonstrates that at modest intensities, FDI is a general strong-field physical process accompanied with nonsequential double ionization and it is an important consequence of recollision.

preprint2020arXiv

The effect of Coulomb field on laser-induced ultrafast imaging methods

By performing a joint theoretical and experimental investigation on the high-order above-threshold ionization (HATI) spectrum, the dominant role of the 3rd-return-recollision trajectories in the region near the cutoff due to the ionic Coulomb field is identified. This invalidates the key assumption adopted in the conventional laser-induced electron diffraction (LIED) approach that the 1st-returnrecollision trajectories dominate the spectrum according to strong field approximation (SFA). Our results show that the incident (return) electron beams produced by the 1st and 3rd returns possess distinct characteristics of beam energy, beam diameter and temporal evolution law due to the influence of Coulomb field, and therefore the extracted results in the LIED will be altered if the significance of the 3rd-return-recollision trajectories is properly considered in the analysis. Such Coulomb field effect should be taken into account in all kinds of laser-induced imaging schemes based on recollision.

preprint2020arXiv

The Laplacian spectrum, Kirchhoff index and complexity of the linear heptagonal networks

Let $H_n$ be the linear heptagonal networks with $2n$ heptagons. We study the structure properties and the eigenvalues of the linear heptagonal networks. According to the Laplacian polynomial of $H_n$, we utilize the decomposition theorem. Thus, the Laplacian spectrum of $H_n$ is created by eigenvalues of a pair of matrices: $L_A$ and $L_S$ of order number $5n+1$ and $4n+1$, respectively. On the basis of the roots and coefficients of their characteristic polynomials of $L_A$ and $L_S$, we not only get the explicit forms of Kirchhoff index, but also corresponding total complexity of $H_n$.

preprint2020arXiv

Towards a Verified Model of the Algorand Consensus Protocol in Coq

The Algorand blockchain is a secure and decentralized public ledger based on pure proof of stake rather than proof of work. At its core it is a novel consensus protocol with exactly one block certified in each round: that is, the protocol guarantees that the blockchain does not fork. In this paper, we report on our effort to model and formally verify the Algorand consensus protocol in the Coq proof assistant. Similar to previous consensus protocol verification efforts, we model the protocol as a state transition system and reason over reachable global states. However, in contrast to previous work, our model explicitly incorporates timing issues (e.g., timeouts and network delays) and adversarial actions, reflecting a more realistic environment faced by a public blockchain. Thus far, we have proved asynchronous safety of the protocol: two different blocks cannot be certified in the same round, even when the adversary has complete control of message delivery in the network. We believe that our model is sufficiently general and other relevant properties of the protocol such as liveness can be proved for the same model.

preprint2020arXiv

Weak cosmic censorship conjecture for Kerr-Taub-NUT black hole with test scalar field and particle

Motivated by the recent researches of black holes with NUT charge, we investigate the validity of the weak cosmic censorship conjecture for Kerr-Taub-NUT black hole with a test massive scalar field and a test particle, respectively. For the scalar field scattering gedanken experiment, we consider an infinitesimal time interval process. The result shows that both extremal and near-extremal Kerr-Taub-NUT black holes cannot be over-spun. For the test particle thought experiment, the study suggests that extremal Kerr-Taub-NUT black hole cannot be over-spun; while near-extremal Kerr-Taub-NUT black hole can be over-spun. By comparing the two methods, the results indicate the time interval for particles crossing the black hole horizon might be important for consideration of the weak cosmic censorship conjecture.

preprint2019arXiv

Hybrid Purification and Sampling Approach for Thermal Quantum Systems

We propose an algorithm which combines the beneficial aspects of two different methods for studying finite-temperature quantum systems with tensor networks. One approach is the ancilla method, which gives high-precision results but scales poorly at low temperatures. The other method is the minimally entangled typical thermal state (METTS) sampling algorithm which scales better than the ancilla method at low temperatures and can be parallelized, but requires many samples to converge to a precise result. Our proposed hybrid of these two methods purifies physical sites in a small central spatial region with partner ancilla sites, sampling the remaining sites using the METTS algorithm. Observables measured within the purified cluster have much lower sample variance than in the METTS approach, while sampling the sites outside the cluster reduces their entanglement and the computational cost of the algorithm. The sampling steps of the algorithm remain straightforwardly parallelizable. The hybrid approach also solves an important technical issue with METTS that makes it difficult to benefit from quantum number conservation. By studying S=1 Heisenberg ladder systems, we find the hybrid method converges more quickly than both the ancilla and METTS algorithms at intermediate temperatures and for systems with higher entanglement.

preprint2019arXiv

Quantum dynamics of atomic Rydberg excitation in strong laser fields

Neutral atoms have been observed to survive intense laser pulses in high Rydberg states with surprisingly large probability. Only with this Rydberg-state excitation (RSE) included is the picture of intense-laser-atom interaction complete. Various mechanisms have been proposed to explain the underlying physics. However, neither one can explain all the features observed in experiments and in time-dependent Schrödinger equation (TDSE) simulations. Here we propose a fully quantum-mechanical model based on the strong-field approximation (SFA). It well reproduces the intensity dependence of RSE obtained by the TDSE, which exhibits a series of modulated peaks. They are due to recapture of the liberated electron and the fact that the pertinent probability strongly depends on the position and the parity of the Rydberg state. We also present measurements of RSE in xenon at 800 nm, which display the peak structure consistent with the calculations.

preprint2019arXiv

Understanding two-photon double ionization of helium from the perspective of the characteristic time of dynamic transitions

By using the B-spline numerical method, we investigate a two-photon double-ionization (TPDI) process of helium in a high-frequency laser field with its frequency ranging from 1.6~a.u. to 3.0~a.u. and the pulse duration ranging from 75 to 160~attoseconds. We found that there exists a characteristic time $t_{c}$ for a TPDI process, such that the pattern of energy distribution of two ionized electrons presents a peak or two, depending respectively on whether the pulse duration is shorter or longer than $t_{c}$. Especially, as the pulse duration is larger than $t_c$, the TPDI spectrum shows a double-peak structure which is attributed to the fact that most of the electron-electron Coulomb interaction energy is acquired by single electron during their oscillation around the nucleus before the two electrons leave. Additionally, if the photon energy is less than the ionization energy of He$^{+}$, $t_{c}$ is not a fixed value, and it increases as the photon energy decreases; while if the energy of a photon is greater than the ionization energy of He$^{+}$, $t_{c}$ is fixed at about 105 attoseconds. We further found that, for a helium-like ion in its ground state, the characteristic time for the case of the photon energy larger than the ionization energy of the second electron has a key relation with the Coulomb interaction energy $\overline{V}_{12}$ between the two electrons, which can be expressed as $t_{c}\overline{V}_{12}=4.192$, a type of quantum mechanical uncertainty relation between time and energy. In addition, this relation can be attributed to the existence of a minimal evolution time from the ground state to a double ionization state with two electrons carrying different energies. These results may shed light on deeper understanding of many-electron quantum dynamical processes.

preprint2016arXiv

A new earthquake location method based on the waveform inversion

In this paper, a new earthquake location method based on the waveform inversion is proposed. As is known to all, the waveform misfit function is very sensitive to the phase shift between the synthetic waveform signal and the real waveform signal. Thus, the convergence domain of the conventional waveform based earthquake location methods is very small. In present study, by introducing and solving a simple sub-optimization problem, we greatly expand the convergence domain of the waveform based earthquake location method. According to a large number of numerical experiments, the new method expands the range of convergence by several tens of times. This allows us to locate the earthquake accurately even from some relatively bad initial values.

preprint2016arXiv

Momentum mapping of continuum electron wave packet interference

We analyze the two-dimensional photoelectrons momentum distribution of Ar atom ionized by midinfrared laser pulses and mainly concentrate on the energy range below 2Up. By using a generalized quantum trajectory Monte Carlo (GQTMC) simulation and comparing with the numerical solution of time-dependent Schrodinger equation (TDSE), we show that in the deep tunneling regime, the rescattered electron trajectories plays unimportant role and the interplay between the intracycle and inter-cycle results in a ring-like interference pattern. The ring-like interference pattern will mask the holographic interference structure in the low longitudinal momentum region. When the nonadiabatic tunneling contributes significantly to ionization, i.e., the Keldysh parameter 1, the contribution of the rescattered electron trajectories become large, thus holographic interference pattern can be clearly observed. Our results help paving the way for gaining physical insight into ultrafast electron dynamic process with attosecond temporal resolution.

preprint2016arXiv

On Isomorphisms of Vertex-transitive Graphs

The isomorphism problem of Cayley graphs has been well studied in the literature, such as characterizations of CI (DCI)-graphs and CI (DCI)-groups. In this paper, we generalize these to vertex-transitive graphs and establish parallel results. Some interesting vertex-transitive graphs are given, including a first example of connected symmetric non-Cayley non-GI-graph. Also, we initiate the study for GI and DGI-groups, defined analogously to the concept of CI and DCI-groups.

preprint2016arXiv

Self-consistent spin-wave analysis of the 1/3 magnetization plateau in the kagome antiferromagnet

We propose a modified spin-wave theory to study the 1/3 magnetization plateau of the antiferromagnetic Heisenberg model on the kagome lattice. By the self-consistent inclusion of quantum corrections, the 1/3 plateau is stabilized over a broad range of magnetic fields for all spin quantum numbers, S. The values of the critical magnetic fields and the widths of the magnetization plateaus are fully consistent with recent numerical results from exact diagonalization and infinite projected entangled paired states.

preprint2016arXiv

Unraveling nonadiabatic ionization and Coulomb potential effects in strong-field photoelectron holography

Strong field photoelectron holography has been proposed as a means for interrogating the spatial and temporal information of electrons and ions in a dynamic system. After ionization, part of the electron wave packet may directly go to the detector (the reference wave), while another part may be driven back to the ion where it scatters off (the signal wave). The interference hologram of the two waves may be used to retrieve the target information. However, unlike conventional optical holography, the propagations of electron wave packets are affected by the Coulomb potential as well as by the laser field. In addition, electrons are emitted over the whole laser pulse duration, thus multiple interferences may occur. In this work, we used a generalized quantum-trajectory Monte Carlo method to investigate the effect of Coulomb potential and the nonadiabatic subcycle ionization on the photoelectron hologram. We showed that photoelectron hologram can be well described only when the nonadiabatic effect in ionization is accounted for, and Coulomb potential can be neglected only in the tunnel ionization regime. Our results help establishing photoelectron holography for probing spatial and dynamic properties of atoms and molecules.

preprint2015arXiv

Chemical Freeze-out Parameters via a Non-perturbative QCD Approach

By analyzing the calculated baryon number susceptibility ratios ${χ_{1}^{B}}/{χ_{2}^{B}}$ and ${χ_{3}^{B}}/{χ_{1}^{B}}$ in two-flavor system via the Dyson-Schwinger equation approach of QCD, we determine the chemical freeze-out temperature and baryon chemical potential in cases of both thermodynamic limit and finite size. We calculate the center-of-mass energy dependence of the ${χ_{4}^{B}}/{χ_{2}^{B}}\, (κσ^{2})$ at the freeze-out line and find an excellent agreement with experimental data in $\sqrt{S_{NN}^{}} \geq 19.6\,$GeV region when taking into account the finite size effect. Our calculations indicate that the $κσ^{2}$ exhibits a non-monotonic behavior in lower collision energy region.

preprint2015arXiv

Long-range self-interacting dark matter in the Sun

We investigate the implications of the long-rang self-interaction on both the self-capture and the annihilation of the self-interacting dark matter (SIDM) trapped in the Sun. Our discussion is based on a specific SIDM model in which DM particles self-interact via a light scalar mediator, or Yukawa potential, in the context of quantum mechanics. Within this framework, we calculate the self-capture rate across a broad region of parameter space. While the self-capture rate can be obtained separately in the Born regime with perturbative method, and the classical limits with the Rutherford formula, our calculation covers the gap between in a non-perturbative fashion. Besides, the phenomelogy of both the Sommerfeld-enhanced s- and p-wave annihilation of the solar SIDM is also involved in our discussion. Moreover, by combining the analysis of the Super-Kamiokande (SK) data and the observed DM relic density, we constrain the nuclear capture rate of the DM particles in the presence of the dark Yukawa potential. The consequence of the long-range dark force on probing the solar SIDM turns out to be significant if the force-carrier is much lighter than the DM particle, and a quantitative analysis is provided.

preprint2015arXiv

Shear-Exfoliated Phosphorene for Rechargeable Nanoscale Battery

Discovery of atomically thin black phosphorus (called phosphorene) holds promise to be used as an alternative two-dimensional material to graphene and transition metal dichalcogenides especially as an anode material for lithium-ion batteries (LIBs). However, at present bulk black phosphorus (BP) still suffers from rapid capacity fading that results in poor rechargeable performance. Here, for the first time, we use in situ transmission electron microscopy (TEM) to construct nanoscale phosphorene LIBs and visualize the capacity fading mechanism in thick multilayer phosphorene by real time capturing delithiation-induced structural decomposition that reduces electrical conductivity and thus causes irreversibility of lithiated Li3P phase. We further demonstrate that few-layer phosphorene successfully circumvents the structural decomposition and holds superior structural restorability, even subjected to multi-cycle lithiation/delithiation processes and concomitant huge volume expansion. This finding affords new experimental insights into thickness-dependent lithium diffusion kinetics in phosphorene. Additionally, a scalable liquid-phase shear exfoliation route has been developed to produce high-quality ultrathin (monolayer or few-layer) phosphorene, only by a high-speed shear mixer or even a household kitchen blender with the shear rate threshold, which will pave the way for potential large-scale applications in LIBs once the rechargeable phosphorene nanoscale batteries can be transferred to industrialized enlargement in the future.

preprint2015arXiv

Unsupervised Cross-Domain Recognition by Identifying Compact Joint Subspaces

This paper introduces a new method to solve the cross-domain recognition problem. Different from the traditional domain adaption methods which rely on a global domain shift for all classes between source and target domain, the proposed method is more flexible to capture individual class variations across domains. By adopting a natural and widely used assumption -- "the data samples from the same class should lay on a low-dimensional subspace, even if they come from different domains", the proposed method circumvents the limitation of the global domain shift, and solves the cross-domain recognition by finding the compact joint subspaces of source and target domain. Specifically, given labeled samples in source domain, we construct subspaces for each of the classes. Then we construct subspaces in the target domain, called anchor subspaces, by collecting unlabeled samples that are close to each other and highly likely all fall into the same class. The corresponding class label is then assigned by minimizing a cost function which reflects the overlap and topological structure consistency between subspaces across source and target domains, and within anchor subspaces, respectively.We further combine the anchor subspaces to corresponding source subspaces to construct the compact joint subspaces. Subsequently, one-vs-rest SVM classifiers are trained in the compact joint subspaces and applied to unlabeled data in the target domain. We evaluate the proposed method on two widely used datasets: object recognition dataset for computer vision tasks, and sentiment classification dataset for natural language processing tasks. Comparison results demonstrate that the proposed method outperforms the comparison methods on both datasets.

preprint2014arXiv

Transferring MBE-grown topological insulator films to arbitrary substrates and Metal-insulator transition via Dirac gap

Mechanical exfoliation of bulk crystals has been widely used to obtain thin topological insulator (TI) flakes for device fabrication. However, such a process produces only micro-sized flakes that are highly irregular in shape and thickness. In this work, we developed a process to transfer the entire area of TI Bi2Se3 thin films grown epitaxially on Al2O3 and SiO2 to arbitrary substrates, maintaining their pristine morphology and crystallinity. Transport measurements show that these transferred films have lower carrier concentrations and comparable or higher mobilities than before the transfer. Furthermore, using this process we demonstrated a clear metal-insulator transition in an ultrathin Bi2Se3 film by gate-tuning its Fermi level into the hybridization gap formed at the Dirac point. The ability to transfer large area TI films to any substrate will facilitate fabrication of TI heterostructure devices, which will help explore exotic phenomena such as Majorana fermions and topological magnetoelectricity.

preprint2014arXiv

Truthful Multi-unit Procurements with Budgets

We study procurement games where each seller supplies multiple units of his item, with a cost per unit known only to him. The buyer can purchase any number of units from each seller, values different combinations of the items differently, and has a budget for his total payment. For a special class of procurement games, the {\em bounded knapsack} problem, we show that no universally truthful budget-feasible mechanism can approximate the optimal value of the buyer within $\ln n$, where $n$ is the total number of units of all items available. We then construct a polynomial-time mechanism that gives a $4(1+\ln n)$-approximation for procurement games with {\em concave additive valuations}, which include bounded knapsack as a special case. Our mechanism is thus optimal up to a constant factor. Moreover, for the bounded knapsack problem, given the well-known FPTAS, our results imply there is a provable gap between the optimization domain and the mechanism design domain. Finally, for procurement games with {\em sub-additive valuations}, we construct a universally truthful budget-feasible mechanism that gives an $O(\frac{\log^2 n}{\log \log n})$-approximation in polynomial time with a demand oracle.

preprint2013arXiv

Alignment-dependent fluorescence emission induced by tunnel ionization of carbon dioxide from lower-lying orbitals

Study on ionization process of molecules in an intense infrared laser field is of paramount interest in strong-field physics and constitutes the foundation of imaging of molecular valence orbitals and attosecond science. We show measurement of alignment-dependent ionization probabilities of the lower-lying orbitals of the molecules by experimentally detecting alignment-dependence of fluorescence emission from tunnel ionized carbon dioxide molecules. The experimental measurements are compared with the theoretical calculations of strong field approximation (SFA) and molecular ADK models. Our results demonstrate the feasibility of an all-optical approach for probing the ionization dynamics of lower-lying orbitals of molecules, which is still difficult to achieve until now by other techniques. Moreover, the deviation between the experimental and theoretical results indicates the incompleteness of current theoretical models for describing strong field ionization of molecules.

preprint2013arXiv

Signature of multi-channel interference in high-order harmonic generation from N2 driven by intense mid-infrared pulses

We investigate the multi-electron dynamics in high-order harmonic generation (HHG) from N2 molecules. Clear spectral minima are observed in the cutoff region at all three mid-infrared wavelengths (i.e., 1300, 1400 and 1500 nm) chosen in our experiment. It is found that the positions of the spectral minima do not depend on the alignment angles of molecules. In addition, the spectral minima shift almost linearly with the increasing laser intensity at all three wavelengths, which provides a strong evidence on the dynamic multi-channel interference origin of these minima. The advantages of observation of dynamic multi-channel interference based on HHG driven by long wavelength lasers are discussed.

preprint2013arXiv

Terrace-like structure in the above-threshold ionization spectrum of an atom in an IR+XUV two-color laser field

Based on the frequency-domain theory, we investigate the above-threshold ionization (ATI) process of an atom in a two-color laser field with infrared (IR) and extreme ultraviolet (XUV) frequencies, where the photon energy of the XUV laser is close to or larger than the atomic ionization threshold. By using the channel analysis, we find that the two laser fields play different roles in an ionization process, where the XUV laser determines the ionization probability by the photon number that the atom absorbs from it, while the IR laser accelerates the ionized electron and hence widens the electron kinetic energy spectrum. As a result, the ATI spectrum presents a terrace-like structure. By using the saddle-point approximation, we obtain a classical formula which can predict the cutoff of each plateau in the terrace-like ATI spectrum. Furthermore, we find that the difference of the heights between two neighboring plateaus in the terrace-like structure of the ATI spectrum increases as the frequency of the XUV laser increases.

preprint2013arXiv

The 130 GeV gamma-ray line and Sommerfeld enhancements

Recently, possible indications of line spectral features in the Fermi-LAT photon spectrum towards the galactic center have been reported. If the distinct line features arise from dark matter (DM) annihilation into $γX (X=γ, Z^{0} or h^{0})$, the corresponding annihilation cross-section is unnaturally large for typical loop-induced radiative processes. On the other hand, it is still too small to be responsible for the observed DM relic density. We show that the mechanism of Sommerfeld enhancement with scalar force-carrier can provide a simple solution to these puzzles. The possibly large Sommerfeld enhancement of the cross-section for s-wave DM annihilation can significantly reduce the required effective couplings between DM and charged particles in typical loop diagrams. The DM particles necessarily annihilate into scalar force-carriers through tree-level p-wave process, which can dominate the total DM annihilation cross-section at freeze out, resulting in the correct thermal relic density, but has subdominant contributions to the DM annihilation today due to velocity suppression. We perform detailed analysis on the effects of p-wave Sommerfeld enhancement on freeze out. The results show that with the constraints from the thermal relic density, the required effective couplings can be reduced by an order of magnitude.

preprint2012arXiv

Slow Light Effect by Photonic Angular Momentum States

We show that the photonic angular momentum states (AMSs) in metamaterials can be utilized to achieve slow light. The photonic AMS possesses a helical phase, the orbital-angular-momentum degree of freedom in photons. Unlike the traditional slow-light schemes in metamaterials by using orthogonal polarizations, the photonic AMSs are dipole forbidden for all polarizations of free-space radiation due to the existence of helical phase. Numerical simulation for a metamaterial design proves the feasibility of this scheme, in which the indirectly excitation of dark photonic AMSs burns some transmission dips in the otherwise high transmission window. With the unique merits of dark photonic AMSs, this slow light scheme can realize a high group index $n_g$ greater than $\sim500$.

preprint2010arXiv

Short Multi-Prover Quantum Proofs for SAT without Entangled Measurements

BellQMA protocols are a subclass of multi-prover quantum Merlin-Arthur protocols in which the verifier is restricted to perform nonadaptive,unentangled measurements on the quantum states received from each Merlin. In this paper, we prove that m-clause 3-SAT instances have BellQMA proofs of satisfiability with constant soundness gap, in which O(sqrt(m)polylog(m)) Merlins each send O(log m) qubits to Arthur. Our result answers a question of Aaronson et al., who gave a protocol with similar parameters that used entangled measurements; the analysis of our protocol is significantly simpler than that of Aaronson et al. Our result also complements recent work of Brandao, Christandl, and Yard, who showed upper bounds on the power of multiprover quantum proofs with unentangled but adaptive (LOCC) measurements.

preprint2009arXiv

Wavelength scaling of high-order harmonic yield from an optically prepared excited state atom

Wavelength scaling law for the yield of high-order harmonic emission is theoretically examined for excited state atoms which are optically prepared by simultaneously exposing to an extreme ultraviolet pulse at the resonant wavelength and an infrared pulse at a variable wavelength in the range of 0.8\mum-2.4\mum. Numerical simulations are performed based on the three-dimensional time-dependent Schrodinger equation (3D TDSE) for Ne and H. We confirm that the harmonic yield follows a λ^-{4-6} scaling with the single fundamental driving laser pulse; whereas for the optically prepared excited state atoms, a λ^-{2-3} scaling for the harmonic yield is revealed.

preprint2008arXiv

The Goldbeter-Koshland switch in the first-order region and its response to dynamic disorder

In their classical work (Proc. Natl. Acad. Sci. USA, 1981, 78:6840-6844), Goldbeter and Koshland mathematically analyzed a reversible covalent modification system which is highly sensitive to the concentration of effectors. Its signal-response curve appears sigmoidal, constituting a biochemical switch. However, the switch behavior only emerges in the "zero-order region", i.e. when the signal molecule concentration is much lower than that of the substrate it modifies. In this work we showed that the switching behavior can also occur under comparable concentrations of signals and substrates, provided that the signal molecules catalyze the modification reaction in cooperation. We also studied the effect of dynamic disorders on the proposed biochemical switch, in which the enzymatic reaction rates, instead of constant, appear as stochastic functions of time. We showed that the system is robust to dynamic disorder at bulk concentration. But if the dynamic disorder is quasi-static, large fluctuations of the switch response behavior may be observed at low concentrations. Such fluctuation is relevant to many biological functions. It can be reduced by either increasing the conformation interconversion rate of the protein, or correlating the enzymatic reaction rates in the network.