BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Yuxin Wang

Yuxin Wang contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
Computer VisionArtificial IntelligenceComputation and Languagequant-phcond-mat.mtrl-scicond-mat.supr-conSoftware EngineeringMachine Learningphysics.atom-phphysics.comp-phphysics.opticscond-mat.mes-hallcond-mat.quant-gascond-mat.str-elhep-lathep-thmath.DGmath.OCphysics.data-anphysics.ins-detProgramming Languages

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
27works
0followers
21topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

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

Published work

27 published item(s)

preprint2026arXiv

ABC-Bench: Benchmarking Agentic Backend Coding in Real-World Development

The evolution of Large Language Models (LLMs) into autonomous agents has expanded the scope of AI coding from localized code generation to complex, repository-level, and execution-driven problem solving. However, current benchmarks predominantly evaluate code logic in static contexts, neglecting the dynamic, full-process requirements of real-world engineering, particularly in backend development which demands rigorous environment configuration and service deployment. To address this gap, we introduce ABC-Bench, a benchmark explicitly designed to evaluate agentic backend coding within a realistic, executable workflow. Using a scalable automated pipeline, we curated 224 practical tasks spanning 8 languages and 19 frameworks from open-source repositories. Distinct from previous evaluations, ABC-Bench require the agents to manage the entire development lifecycle from repository exploration to instantiating containerized services and pass the external end-to-end API tests. Our extensive evaluation reveals that even state-of-the-art models struggle to deliver reliable performance on these holistic tasks, highlighting a substantial disparity between current model capabilities and the demands of practical backend engineering. Our code is available at https://github.com/OpenMOSS/ABC-Bench.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Adaptive Experimentation for Censored Survival Outcomes

Adaptive experimentation enables efficient estimation of causal effects, but existing methods are not designed for survival data with censoring, where event times are only partially observed (e.g., overall survival in cancer trials but with dropout). In this paper, we develop a novel framework for adaptive experimentation to estimate causal effects under right censoring. For this, we derive the semiparametric efficiency bound for the average survival effect curve as a function of the treatment allocation policy and thereby obtain a closed-form efficiency-optimal allocation policy. The policy generalizes classical Neyman allocation to survival settings by prioritizing patient strata where both event and censoring dynamics induce high uncertainty. Building on this, we propose the Adaptive Survival Estimator (ASE), an adaptive framework that learns the allocation policy and estimates the average survival effect curve sequentially. Our framework has three main benefits: (i) it accommodates arbitrary machine learning models for nuisance estimation; (ii) it is guided by a closed-form efficiency-optimal allocation policy; and (iii) it admits strong theoretical guarantees, including asymptotic normality via a martingale central limit theorem. We demonstrate our framework across various numerical experiments to show consistent efficiency gains over uniform randomization and censoring-agnostic baselines.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Compact, Large-Scale Photonic Neurons by Modulation-and-Weight Microring Resonators

Neuromorphic photonics promises sub-nanosecond latency, ultrawide bandwidth, and high parallelism, but practical scalability is constrained by fabrication tolerances, spectral alignment, and tuning energy. Here, we present a large-scale, compact, and reconfigurable photonic neuron in which each microring performs modulation and weighting simultaneously. By exploiting both carrier and thermal tuning within a single device, this architecture reduces footprint, relaxes spectral alignment requirements to just two optical components, and yields a steep transfer response that lowers tuning energy. The proposed neuron supports multiple operating configurations, allowing its dynamical behavior to be adapted to different computational tasks. In particular, a short electrical feedback path enables recurrent operation, providing tunable short- and long-term memory for temporal processing. Using a 10-microring resonator array, we demonstrate both spatial and temporal computing, including a 3$\times$3 convolution for image processing with an error of $<$5\% and high-frequency financial time-series prediction. Each modulation-weighting element occupies 80$\times$45 \SI{}{\micro\meter^2} and consumes an average of \SI{0.186}{\milli\watt}, corresponding to a compute density of \SI{4.67}{TOPS/s/\milli\meter^2}. Excluding electronic power, the on-chip tuning efficiency reaches approximately \SI{105}{TOPs/\watt}, which is comparable to state-of-the-art implementations. These results indicate that modulation-and-weighting microring resonator banks provide a scalable building block for large-scale neuromorphic photonic systems, offering a favorable combination of compact footprint, low power consumption, and functional flexibility.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Multi-hop Reasoning via Early Knowledge Alignment

Retrieval-Augmented Generation (RAG) has emerged as a powerful paradigm for Large Language Models (LLMs) to address knowledge-intensive queries requiring domain-specific or up-to-date information. To handle complex multi-hop questions that are challenging for single-step retrieval, iterative RAG approaches incorporating reinforcement learning have been proposed. However, existing iterative RAG systems typically plan to decompose questions without leveraging information about the available retrieval corpus, leading to inefficient retrieval and reasoning chains that cascade into suboptimal performance. In this paper, we introduce Early Knowledge Alignment (EKA), a simple but effective module that aligns LLMs with retrieval set before planning in iterative RAG systems with contextually relevant retrieved knowledge. Extensive experiments on six standard RAG datasets demonstrate that by establishing a stronger reasoning foundation, EKA significantly improves retrieval precision, reduces cascading errors, and enhances both performance and efficiency. Our analysis from an entropy perspective demonstrate that incorporating early knowledge reduces unnecessary exploration during the reasoning process, enabling the model to focus more effectively on relevant information subsets. Moreover, EKA proves effective as a versatile, training-free inference strategy that scales seamlessly to large models. Generalization tests across diverse datasets and retrieval corpora confirm the robustness of our approach. Overall, EKA advances the state-of-the-art in iterative RAG systems while illuminating the critical interplay between structured reasoning and efficient exploration in reinforcement learning-augmented frameworks. The code is released at \href{https://github.com/yxzwang/EarlyKnowledgeAlignment}{Github}.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Stream-R1: Reliability-Perplexity Aware Reward Distillation for Streaming Video Generation

Distillation-based acceleration has become foundational for making autoregressive streaming video diffusion models practical, with distribution matching distillation (DMD) as the de facto choice. Existing methods, however, train the student to match the teacher's output indiscriminately, treating every rollout, frame, and pixel as equally reliable supervision. We argue that this caps distilled quality, since it overlooks two complementary axes of variance in DMD supervision: Inter-Reliability across student rollouts whose supervision varies in reliability, and Intra-Perplexity across spatial regions and temporal frames that contribute unequally to where quality can still be improved. The objective thus conflates two questions under a uniform weight: whether to learn from each rollout, and where to concentrate optimization within it. To address this, we propose Stream-R1, a Reliability-Perplexity Aware Reward Distillation framework that adaptively reweights the distillation objective at both rollout and spatiotemporal-element levels through a single shared reward-guided mechanism. At the Inter-Reliability level, Stream-R1 rescales each rollout's loss by an exponential of a pretrained video reward score, so that rollouts with reliable supervision dominate optimization. At the Intra-Perplexity level, it back-propagates the same reward model to extract per-pixel gradient saliency, which is factored into spatial and temporal weights that concentrate optimization pressure on regions and frames where refinement yields the largest expected gain. An adaptive balancing mechanism prevents any single quality axis from dominating across visual quality, motion quality, and text alignment. Stream-R1 attains consistent improvements on all three dimensions over distillation baselines on standard streaming video generation benchmarks, without architectural modification or additional inference cost.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Stream-T1: Test-Time Scaling for Streaming Video Generation

While Test-Time Scaling (TTS) offers a promising direction to enhance video generation without the surging costs of training, current test-time video generation methods based on diffusion models suffer from exorbitant candidate exploration costs and lack temporal guidance. To address these structural bottlenecks, we propose shifting the focus to streaming video generation. We identify that its chunk-level synthesis and few denoising steps are intrinsically suited for TTS, significantly lowering computational overhead while enabling fine-grained temporal control. Driven by this insight, we introduced Stream-T1, a pioneering comprehensive TTS framework exclusively tailored for streaming video generation. Specifically, Stream-T1 is composed of three units: (1) Stream -Scaled Noise Propagation, which actively refines the initial latent noise of the generating chunk using historically proven, high-quality previous chunk noise, effectively establishes temporal dependency and utilizing the historical Gaussian prior to guide the current generation; (2) Stream -Scaled Reward Pruning, which comprehensively evaluates generated candidates to strike an optimal balance between local spatial aesthetics and global temporal coherence by integrating immediate short-term assessments with sliding-window-based long-term evaluations; (3) Stream-Scaled Memory Sinking, which dynamically routes the context evicted from KV-cache into distinct updating pathways guided by the reward feedback, ensuring that previously generated visual information effectively anchors and guides the subsequent video stream. Evaluated on both 5s and 30s comprehensive video benchmarks, Stream-T1 demonstrates profound superiority, significantly improving temporal consistency, motion smoothness, and frame-level visual quality.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Terminal-Bench: Benchmarking Agents on Hard, Realistic Tasks in Command Line Interfaces

AI agents may soon become capable of autonomously completing valuable, long-horizon tasks in diverse domains. Current benchmarks either do not measure real-world tasks, or are not sufficiently difficult to meaningfully measure frontier models. To this end, we present Terminal-Bench 2.0: a carefully curated hard benchmark composed of 89 tasks in computer terminal environments inspired by problems from real workflows. Each task features a unique environment, human-written solution, and comprehensive tests for verification. We show that frontier models and agents score less than 65\% on the benchmark and conduct an error analysis to identify areas for model and agent improvement. We publish the dataset and evaluation harness to assist developers and researchers in future work at https://www.tbench.ai/ .

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Unlocking Dense Metric Depth Estimation in VLMs

Vision-Language Models (VLMs) excel at 2D tasks such as grounding and captioning, yet remain limited in 3D understanding. A key limitation is their text-only supervision paradigm, which under-constrains fine-grained visual perception and prevents the recovery of dense geometry. Prior methods either distill geometry from external vision models, introducing error accumulation, or enable direct prediction with inefficient per-pixel query or coarse token-level outputs. In this paper, we propose DepthVLM, a simple yet effective framework that transforms a single VLM into a native dense geometry predictor while preserving its multimodal capability. By attaching a lightweight depth head to the LLM backbone and training under a unified vision-text supervision paradigm with a two-stage schedule, DepthVLM generates full-resolution depth maps alongside language outputs in a single forward pass. We further introduce a unified indoor-outdoor metric depth benchmark in a VLM-compatible format. Experiments show that DepthVLM significantly outperforms existing VLMs with higher inference efficiency, surpasses leading pure vision models, and improves complex 3D spatial reasoning, moving toward a truly unified foundation model. All code and checkpoints will be publicly released.

0 citations0 reviewsNo code linkedOpen access
preprint2023arXiv

Fundamentals of crystalline Hopf insulators

Three-dimensional, crystalline Hopf insulators are generic members of unitary Wigner-Dyson class, which can break all global discrete symmetries and point group symmetries. In the absence of first Chern number for any two-dimensional plane of Brillouin zone, the Hopf invariant $N_H \in \mathbb{Z}$. But in the presence of Chern number $N_H \in \mathbb{Z}_{2q}$, where $q$ is the greatest common divisor of Chern numbers for $xy$, $yz$, and $xz$ planes of Brillouin zone. How does $N_H$ affect topological quantization of isotropic, magneto-electric coefficient? We answer this question with calculations of Witten effect for a test, magnetic monopole. Furthermore, we construct $N$-band tight-binding models of Hopf insulators and demonstrate their topological stability against spectral flattening.

0 citations0 reviewsNo code linkedOpen access
preprint2023arXiv

GAR: Generalized Autoregression for Multi-Fidelity Fusion

In many scientific research and engineering applications where repeated simulations of complex systems are conducted, a surrogate is commonly adopted to quickly estimate the whole system. To reduce the expensive cost of generating training examples, it has become a promising approach to combine the results of low-fidelity (fast but inaccurate) and high-fidelity (slow but accurate) simulations. Despite the fast developments of multi-fidelity fusion techniques, most existing methods require particular data structures and do not scale well to high-dimensional output. To resolve these issues, we generalize the classic autoregression (AR), which is wildly used due to its simplicity, robustness, accuracy, and tractability, and propose generalized autoregression (GAR) using tensor formulation and latent features. GAR can deal with arbitrary dimensional outputs and arbitrary multifidelity data structure to satisfy the demand of multi-fidelity fusion for complex problems; it admits a fully tractable likelihood and posterior requiring no approximate inference and scales well to high-dimensional problems. Furthermore, we prove the autokrigeability theorem based on GAR in the multi-fidelity case and develop CIGAR, a simplified GAR with the exact predictive mean accuracy with computation reduction by a factor of d 3, where d is the dimensionality of the output. The empirical assessment includes many canonical PDEs and real scientific examples and demonstrates that the proposed method consistently outperforms the SOTA methods with a large margin (up to 6x improvement in RMSE) with only a couple high-fidelity training samples.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

A new quasi-one-dimensional superconductor parent compound NaMn$_6$Bi$_5$ with lower antiferromagnetic transition temperatures

Mn-based superconductor is rare and recently reported in quasi-one-dimensional KMn$_6$Bi$_5$ with [Mn$_6$Bi$_5$]-columns under high pressure. Here we report the synthesis, magnetic properties, electrical resistivity, and specific heat capacity of the newly-discovered quasi-one-dimensional NaMn$_6$Bi$_5$ single crystal. Compared with other AMn$_6$Bi$_5$ (A = K, Rb, and Cs), NaMn$_6$Bi$_5$ has larger intra-column Bi-Bi bond length, which may result in the two decoupled antiferromagnetic transitions at 47.3 K and 52.3 K. The relatively lower antiferromagnetic transition temperatures make NaMn$_6$Bi$_5$ a more suitable platform to explore Mn-based superconductors. Anisotropic resistivity and non-Fermi liquid behavior at low temperature are observed. Heat capacity measurement reveals that NaMn$_6$Bi$_5$ has similar Debye temperature with those of AMn$_6$Bi$_5$ (A = K and Rb), whereas the Sommerfeld coefficient is unusually large. Using first-principles calculations, the quite different density of states and an unusual enhancement near the Fermi level are observed for NaMn$_6$Bi$_5$, when compared with those of other AMn$_6$Bi$_5$ (A = K, Rb, and Cs) compounds.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

CPRAL: Collaborative Panoptic-Regional Active Learning for Semantic Segmentation

Acquiring the most representative examples via active learning (AL) can benefit many data-dependent computer vision tasks by minimizing efforts of image-level or pixel-wise annotations. In this paper, we propose a novel Collaborative Panoptic-Regional Active Learning framework (CPRAL) to address the semantic segmentation task. For a small batch of images initially sampled with pixel-wise annotations, we employ panoptic information to initially select unlabeled samples. Considering the class imbalance in the segmentation dataset, we import a Regional Gaussian Attention module (RGA) to achieve semantics-biased selection. The subset is highlighted by vote entropy and then attended by Gaussian kernels to maximize the biased regions. We also propose a Contextual Labels Extension (CLE) to boost regional annotations with contextual attention guidance. With the collaboration of semantics-agnostic panoptic matching and regionbiased selection and extension, our CPRAL can strike a balance between labeling efforts and performance and compromise the semantics distribution. We perform extensive experiments on Cityscapes and BDD10K datasets and show that CPRAL outperforms the cutting-edge methods with impressive results and less labeling proportion.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Emergence of superconducting dome in insulating ZrNx films via nitrogen manipulation

Reproducing the electronic phase diagram of strongly correlated high-transition-temperature (high-Tc) superconductors in materials other than Cu-, Fe-, and Ni-based compounds has been a challenging task. Only very recently, a few material systems have partially achieved this goal by band engineering. In this work, we combine film growth, charge transport, magnetometry, Terahertz Spectroscopy, Raman scattering, and Scanning Transmission Electron Microscopy to investigate superconductivity and the normal state of ZrNx, which reveals a phase diagram that bears extraordinary similarities to those of high-Tc superconductors. Remarkably, even though superconductivity of ZrNx can be characterized within the Bardeen-Cooper-Schrieffer paradigm and its normal state can be understood within the Fermi liquid framework, by tunning the N chemical concentration, we observe the evolution of a superconducting dome in the close vicinity of a strongly insulating state and a normal state resistivity mimics its counterpart of the high-Tc superconductors.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Experimental Test of Contextuality based on State Discrimination with a Single Qubit

Exploring quantum phenomena beyond predictions of any classical model has fundamental importance to understand the boundary of classical and quantum descriptions of nature. As a typical property that a quantum system behaves distinctively from a classical counterpart, contextuality has been studied extensively and verified experimentally in systems composed of at least three levels (qutrit). Here we extend the scope of experimental test of contextuality to a minimal quantum system of only two states (qubit) by implementing the minimum error state discrimination on a single $^{171}$Yb$^+$ ion. We observe a substantial violation of a no-go inequality derived by assuming non-contextuality, and firmly conclude that the measured results of state discrimination cannot be reconciled with any non-contextual description. We also quantify the contextual advantage of state discrimination and the tolerance against quantum noises.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Flipping of antiferromagnetic to superconducting states in pressurized quasi-one-dimensional manganese-based compounds

One of the universal features of unconventional superconductors is that the superconducting (SC) state is developed in the proximity of an antiferromagnetic (AFM) state. Understanding the interplay between these two states is one of the key issues to uncover the underlying physics of unconventional SC mechanism. Here, we report a pressure-induced flipping of the AFM state to SC state in the quasi-one-dimensional AMn6Bi5 (A = K, Rb, and Cs) compounds. We find that at a critical pressure the AFM state suddenly disappears at a finite temperature and a SC state simultaneously emerges at a lower temperature without detectable structural changes. Intriguingly, all members of the family present the AFM-SC transition at almost the same critical pressures (Pc), though their ambient-pressure unit-cell volumes vary substantially. Our theoretical calculations indicate that the increasing weight of dxz orbital electrons near Fermi energy under the pressure may be the origin of the flipping. These results reveal a diversity of competing nature between the AFM and SC states among the 3d-transition-metal compounds.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Inductive Knowledge Graph Reasoning for Multi-batch Emerging Entities

Over the years, reasoning over knowledge graphs (KGs), which aims to infer new conclusions from known facts, has mostly focused on static KGs. The unceasing growth of knowledge in real life raises the necessity to enable the inductive reasoning ability on expanding KGs. Existing inductive work assumes that new entities all emerge once in a batch, which oversimplifies the real scenario that new entities continually appear. This study dives into a more realistic and challenging setting where new entities emerge in multiple batches. We propose a walk-based inductive reasoning model to tackle the new setting. Specifically, a graph convolutional network with adaptive relation aggregation is designed to encode and update entities using their neighboring relations. To capture the varying neighbor importance, we employ a query-aware feedback attention mechanism during the aggregation. Furthermore, to alleviate the sparse link problem of new entities, we propose a link augmentation strategy to add trustworthy facts into KGs. We construct three new datasets for simulating this multi-batch emergence scenario. The experimental results show that our proposed model outperforms state-of-the-art embedding-based, walk-based and rule-based models on inductive KG reasoning.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Progressive Glass Segmentation

Glass is very common in the real world. Influenced by the uncertainty about the glass region and the varying complex scenes behind the glass, the existence of glass poses severe challenges to many computer vision tasks, making glass segmentation as an important computer vision task. Glass does not have its own visual appearances but only transmit/reflect the appearances of its surroundings, making it fundamentally different from other common objects. To address such a challenging task, existing methods typically explore and combine useful cues from different levels of features in the deep network. As there exists a characteristic gap between level-different features, i.e., deep layer features embed more high-level semantics and are better at locating the target objects while shallow layer features have larger spatial sizes and keep richer and more detailed low-level information, fusing these features naively thus would lead to a sub-optimal solution. In this paper, we approach the effective features fusion towards accurate glass segmentation in two steps. First, we attempt to bridge the characteristic gap between different levels of features by developing a Discriminability Enhancement (DE) module which enables level-specific features to be a more discriminative representation, alleviating the features incompatibility for fusion. Second, we design a Focus-and-Exploration Based Fusion (FEBF) module to richly excavate useful information in the fusion process by highlighting the common and exploring the difference between level-different features.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Screening promising CsV3Sb5-like kagome materials from systematic first-principles evaluation

CsV3Sb5 kagome lattice holds the promise for manifesting electron correlation, topology and superconducting. However, by far only three CsV3Sb5-like kagome materials have been experimentally spotted. In this work, we enlarge this family of materials to 1386 compounds via element species substitution, and the further screening process suggests that 28 promising candidates have superior thermodynamic stability, hence they are highly likely to be synthesized. Moreover, these compounds possess several identical electronic structures, and can be categorized into five non-magnetic and three magnetic groups accordingly. It is our hope that this work can greatly expand the viable phase space of the CsV3Sb5-like materials for investigating or tuning the novel quantum phenomena in kagome lattice.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Information retrieval and eigenstates coalescence in a non-Hermitian quantum system with anti-$\mathcal{PT}$ symmetry

Non-Hermitian systems with parity-time reversal ($\mathcal{PT}$) or anti-$\mathcal{PT}$ symmetry have attracted a wide range of interest owing to their unique characteristics and counterintuitive phenomena. One of the most extraordinary features is the presence of an exception point (EP), across which a phase transition with spontaneously broken $\mathcal{PT}$ symmetry takes place. We implement a Floquet Hamiltonian of a single qubit with anti-$\mathcal{PT}$ symmetry by periodically driving a dissipative quantum system of a single trapped ion. With stroboscopic emission and quantum state tomography, we obtain the time evolution of density matrix for an arbitrary initial state, and directly demonstrate information retrieval, eigenstates coalescence, and topological energy spectra as unique features of non-Hermitian systems.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Multi-scale Information Assembly for Image Matting

Image matting is a long-standing problem in computer graphics and vision, mostly identified as the accurate estimation of the foreground in input images. We argue that the foreground objects can be represented by different-level information, including the central bodies, large-grained boundaries, refined details, etc. Based on this observation, in this paper, we propose a multi-scale information assembly framework (MSIA-matte) to pull out high-quality alpha mattes from single RGB images. Technically speaking, given an input image, we extract advanced semantics as our subject content and retain initial CNN features to encode different-level foreground expression, then combine them by our well-designed information assembly strategy. Extensive experiments can prove the effectiveness of the proposed MSIA-matte, and we can achieve state-of-the-art performance compared to most existing matting networks.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

A Survey of Deep Learning Techniques for Neural Machine Translation

In recent years, natural language processing (NLP) has got great development with deep learning techniques. In the sub-field of machine translation, a new approach named Neural Machine Translation (NMT) has emerged and got massive attention from both academia and industry. However, with a significant number of researches proposed in the past several years, there is little work in investigating the development process of this new technology trend. This literature survey traces back the origin and principal development timeline of NMT, investigates the important branches, categorizes different research orientations, and discusses some future research trends in this field.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

CheckDP: An Automated and Integrated Approach for Proving Differential Privacy or Finding Precise Counterexamples

We propose CheckDP, the first automated and integrated approach for proving or disproving claims that a mechanism is differentially private. CheckDP can find counterexamples for mechanisms with subtle bugs for which prior counterexample generators have failed. Furthermore, it was able to \emph{automatically} generate proofs for correct mechanisms for which no formal verification was reported before. CheckDP is built on static program analysis, allowing it to be more efficient and more precise in catching infrequent events than existing counterexample generators (which run mechanisms hundreds of thousands of times to estimate their output distribution). Moreover, its sound approach also allows automatic verification of correct mechanisms. When evaluated on standard benchmarks and newer privacy mechanisms, CheckDP generates proofs (for correct mechanisms) and counterexamples (for incorrect mechanisms) within 70 seconds without any false positives or false negatives.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

ContourNet: Taking a Further Step toward Accurate Arbitrary-shaped Scene Text Detection

Scene text detection has witnessed rapid development in recent years. However, there still exists two main challenges: 1) many methods suffer from false positives in their text representations; 2) the large scale variance of scene texts makes it hard for network to learn samples. In this paper, we propose the ContourNet, which effectively handles these two problems taking a further step toward accurate arbitrary-shaped text detection. At first, a scale-insensitive Adaptive Region Proposal Network (Adaptive-RPN) is proposed to generate text proposals by only focusing on the Intersection over Union (IoU) values between predicted and ground-truth bounding boxes. Then a novel Local Orthogonal Texture-aware Module (LOTM) models the local texture information of proposal features in two orthogonal directions and represents text region with a set of contour points. Considering that the strong unidirectional or weakly orthogonal activation is usually caused by the monotonous texture characteristic of false-positive patterns (e.g. streaks.), our method effectively suppresses these false positives by only outputting predictions with high response value in both orthogonal directions. This gives more accurate description of text regions. Extensive experiments on three challenging datasets (Total-Text, CTW1500 and ICDAR2015) verify that our method achieves the state-of-the-art performance. Code is available at https://github.com/wangyuxin87/ContourNet.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Domain Priori Knowledge based Integrated Solution Design for Internet of Services

Various types of services, such as web APIs, IoT services, O2O services, and many others, have flooded on the Internet. Interconnections among these services have resulted in a new phenomenon called &#34;Internet of Services&#34; (IoS). By IoS,people don&#39;t need to request multiple services by themselves to fulfill their daily requirements, but it is an IoS platform that is responsible for constructing integrated solutions for them. Since user requirements (URs) are usually coarse-grained and transboundary, IoS platforms have to integrate services from multiple domains to fulfill the requirements. Considering there are too many available services in IoS, a big challenge is how to look for a tradeoff between the construction efficiency and the precision of final solutions. For this challenge, we introduce a framework and a platform for transboundary user requirement oriented solution design in IoS. The main idea is to make use of domain priori knowledge derived from the commonness and similarities among massive historical URs and among historical integrated service solutions(ISSs). Priori knowledge is classified into three types: requirement patterns (RPs), service patterns (SPs), and probabilistic matching matrix (PMM) between RPs and SPs. A UR is modeled in the form of an intention tree (ITree) along with a set of constraints on intention nodes, and then optimal RPs are selected to cover the I-Tree as much as possible. By taking advantage of the PMM, a set of SPs are filtered out and composed together to form the final ISS. Finally, the design of a platform supporting the above process is introduced.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

High-performance frequency stabilization of ultraviolet diode lasers by using dichroic atomic vapor spectroscopy and transfer cavity

Ultraviolet (UV) diode lasers are widely used in many photonics applications. But their frequency stabilization schemes are not as mature as frequency-doubling lasers, mainly due to some limitations in the UV spectral region. Here we developed a high-performance UV frequency stabilization technique implemented directly on UV diode lasers by combining the dichroic atomic vapor laser lock and the resonant transfer cavity lock. As an example, we demonstrate a stable locking with frequency standard deviations of approximately 200 KHz and 300 KHz for 399nm and 370nm diode lasers in 20 minutes. We achieve a long-term frequency drift of no more than 1 MHz for the target 370nm laser within an hour, which was further verified with fluorescence counts rates of a single trapped $^{171}$Yb$^+$ ion. We also find strong linear correlations between lock points and environmental factors such as temperature and atmospheric pressure.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Precision measurements with cold atoms and trapped ions

Recent progresses on quantum control of cold atoms and trapped ions in both the scientific and technological aspects greatly advance the applications in precision measurement. Thanks to the exceptional controllability and versatility of these massive quantum systems, unprecedented sensitivity has been achieved in clocks, magnetometers and interferometers based on cold atoms and ions. Besides, these systems also feature many characteristics that can be employed to facilitate the applications in different scenarios. In this review, we briefly introduce the principles of optical clocks, cold atom magnetometers and atom interferometers used for precision measurement of time, magnetic field, and inertial forces. The main content is then devoted to summarize some recent experimental and theoretical progresses in these three applications, with special attention being paid to the new designs and possibilities towards better performance. The purpose of this review is by no means to give a complete overview of all important works in this fast developing field, but to draw a rough sketch about the frontiers and show the fascinating future lying ahead.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Torsion Discriminance for Stability of Linear Time-Invariant Systems

This paper proposes a new approach to describe the stability of linear time-invariant systems via the torsion $τ(t)$ of the state trajectory. For a system $\dot{r}(t)=Ar(t)$ where $A$ is invertible, we show that (1) if there exists a measurable set $E_1$ with positive Lebesgue measure, such that $r(0)\in E_1$ implies that $\lim\limits_{t\to+\infty}τ(t)\neq0$ or $\lim\limits_{t\to+\infty}τ(t)$ does not exist, then the zero solution of the system is stable; (2) if there exists a measurable set $E_2$ with positive Lebesgue measure, such that $r(0)\in E_2$ implies that $\lim\limits_{t\to+\infty}τ(t)=+\infty$, then the zero solution of the system is asymptotically stable. Furthermore, we establish a relationship between the $i$th curvature $(i=1,2,\cdots)$ of the trajectory and the stability of the zero solution when $A$ is similar to a real diagonal matrix.

0 citations0 reviewsNo code linkedOpen access