arXiv subjects

Yue Ma

Publications and source records attributed to Yue Ma.

At least 145 records · Page 8Linked to original sources

arXiv2023

Coupling undetected sensing modes by quantum erasure

The effect known as ``induced coherence without induced emission'' has spawned a field dedicated to imaging with undetected photons (IUP), where photons from two distinct photon-pair sources interfere if their outputs are made indistinguishable. The indistinguishability is commonly achieved in two setups. Induced coherence IUP (IC-IUP) has only the idler photons from the first source passing through the second, whilst nonlinear interferometry (NI-IUP) has both signal and idler photons from the first source passing through the second and can be simpler to implement. In both cases, changes in the idler path between sources can be detected by measuring the interference fringes in the signal path in a way that allows image information to be moved between different wavelengths. Here we model and implement a novel setup that uses a polarization state quantum eraser approach to move continuously between IC-IUP and NI-IUP operation. We find excellent agreement between experiment and theory in the low-gain or quantum regime. The system also provides a new route for optimizing IUP interference by using controllable quantum erasure to balance the interferometer.

quant-ph↗

arXiv2023

Conflating point of interest (POI) data: A systematic review of matching methods

Point of interest (POI) data provide digital representations of places in the real world, and have been increasingly used to understand human-place interactions, support urban management, and build smart cities. Many POI datasets have been developed, which often have different geographic coverages, attribute focuses, and data quality. From time to time, researchers may need to conflate two or more POI datasets in order to build a better representation of the places in the study areas. While various POI conflation methods have been developed, there lacks a systematic review, and consequently, it is difficult for researchers new to POI conflation to quickly grasp and use these existing methods. This paper fills such a gap. Following the protocol of Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA), we conduct a systematic review by searching through three bibliographic databases using reproducible syntax to identify related studies. We then focus on a main step of POI conflation, i.e., POI matching, and systematically summarize and categorize the identified methods. Current limitations and future opportunities are discussed afterwards. We hope that this review can provide some guidance for researchers interested in conflating POI datasets for their research.

cs.CY↗

arXiv2023

The degree threshold for covering with all the connected $3$-graphs with $3$ edges

Given two $r$-uniform hypergraphs $F$ and $H$, we say that $H$ has an $F$-covering if every vertex in $H$ is contained in a copy of $F$. Let $c_{i}(n,F)$ be the least integer such that every $n$-vertex $r$-graph $H$ with $δ_{i}(H)>c_i(n,F)$ has an $F$-covering. Falgas-Ravry, Markstöm and Zhao (Combin. Probab. Comput., 2021) asymptotically determined $c_1(n,K_{4}^{(3)-})$, where $K_{4}^{(3)-}$ is obtained by deleting an edge from the complete $3$-graph on $4$ vertices. Later, Tang, Ma and Hou (arXiv, 2022) asymptotically determined $c_1(n,C_{6}^{(3)})$, where $C_{6}^{(3)}$ is the linear triangle, i.e. $C_{6}^{(3)}=([6],\{123,345,561\})$. In this paper, we determine $c_1(n,F_5)$ asymptotically, where $F_5$ is the generalized triangle, i.e. $F_5=([5],\{123,124,345\})$. We also determine the exact values of $c_1(n,F)$, where $F$ is any connected $3$-graphs with $3$ edges and $F\notin\{K_4^{(3)-}, C_{6}^{(3)}, F_5\}$.

math.CO↗

arXiv2023

Graphs without rainbow cliques of orders four and five

Let $\mathcal{G}_n^k=\{G_1,G_2,\ldots,G_k\}$ be a multiset of graphs on vertex set $[n]$ and let $F$ be a fixed graph with edge set $F=\{e_1, e_2,\ldots, e_m\}$ and $k\ge m$. We say ${\mathcal{G}_n^k}$ is rainbow $F$-free if there is no $\{i_1, i_2,\ldots, i_{m}\}\subseteq[k]$ satisfying $e_j\in G_{i_j}$ for every $j\in[m]$. Let $\ex_k(n,F)$ be the maximum $\sum_{i=1}^{k}|G_i|$ among all the rainbow $F$-free multisets ${\mathcal{G}_n^k}$. Keevash, Saks, Sudakov, and Verstraëte (2004) determined the exact value of $\ex_k(n, K_r)$ when $n$ is sufficiently large and proposed the conjecture that the results remain true when $n\ge Cr^2$ for some constant $C$. Recently, Frankl (2022) confirmed the conjecture for $r=3$ and all possible values of $n$. In this paper, we determine the exact value of $\ex_k(n, K_r)$ for $n\ge r-1$ when $r=4$ and $5$, i.e. the conjecture of Keevash, Saks, Sudakov, and Verstraëte is true for $r\in\{4,5\}$.

math.CO↗

arXiv2023

Low Energy Electronic Recoils and Single Electron Detection with a Liquid Xenon Proportional Scintillation Counter

Liquid xenon (LXe) is a well-studied detector medium to search for rare events in dark matter and neutrino physics. Two-phase xenon time projection chambers (TPCs) can detect electronic and nuclear recoils with energy down to kilo-electron volts (keV). In this paper, we characterize the response of a single-phase liquid xenon proportional scintillation counter (LXePSC), which produces electroluminescence directly in the liquid, to detect electronic recoils at low energies. Our design uses a thin (10 - 25 $μ$m diameter), central anode wire in a cylindrical LXe target where ionization electrons, created from radiation particles, drift radially towards the anode, and electroluminescence is produced. Both the primary scintillation (S1) and electroluminescence (S2) are detected by photomultiplier tubes (PMTs) surrounding the LXe target. Up to 17 photons are produced per electron, obtained with a 10 $μ$m diameter anode wire, allowing for the highly efficient detection of electronic recoils from beta decays of a tritium source down to roughly 1 keV. Single electrons, from photo-emission of the cathode wires, are observed at a gain of 1.8 photoelectrons (PE) per electron. The delayed signals following the S2 signals are dominated by single-photon-like hits, without evidence for electron signals observed in the two-phase xenon TPCs. We discuss the potential application of such a LXePSC for reactor neutrino detection via Coherent Elastic Neutrino Nucleus Scattering (CE$ν$NS).

physics.ins-det↗

arXiv2023

Boundary Blending: Reconsidering the Design of Multi-View Visualizations

Multiple-view visualizations (MVs) have been widely used for visual analysis. Each view shows some part of the data in a usable way, and together multiple views enable a holistic understanding of the data under investigation. For example, an analyst may check a social network graph, a map of sensitive locations, a table of transaction records, and a collection of reports to identify suspicious activities. While each view is designed to preserve its own visual context with visible borders or perceivable spatial distance from others, the key to solving real-world analysis problems often requires "breaking" such boundaries, and further integrating and synthesizing the data scattered across multiple views. This calls for blending the boundaries in MVs, instead of simply breaking them, which brings key questions: what are possible boundaries in MVs, and what are design options that can support the boundary blending in MVs? To answer these questions, we present three boundaries in MVs: 1) data boundary, 2) representation boundary, and 3) semantic boundary, corresponding to three major aspects regarding the usage of MVs: encoded information, visual representation, and interpretation. Then, we discuss four design strategies (highlighting, linking, embedding, and extending) and their pros and cons for supporting boundary blending in MVs. We conclude our discussion with future research opportunities.

cs.HC↗

arXiv2023

Efficient Computation of General Modules for ALC Ontologies (Extended Version)

We present a method for extracting general modules for ontologies formulated in the description logic ALC. A module for an ontology is an ideally substantially smaller ontology that preserves all entailments for a user-specified set of terms. As such, it has applications such as ontology reuse and ontology analysis. Different from classical modules, general modules may use axioms not explicitly present in the input ontology, which allows for additional conciseness. So far, general modules have only been investigated for lightweight description logics. We present the first work that considers the more expressive description logic ALC. In particular, our contribution is a new method based on uniform interpolation supported by some new theoretical results. Our evaluation indicates that our general modules are often smaller than classical modules and uniform interpolants computed by the state-of-the-art, and compared with uniform interpolants, can be computed in a significantly shorter time. Moreover, our method can be used for, and in fact improves, the computation of uniform interpolants and classical modules.

cs.AI↗

arXiv2023

Non-Pauli errors can be efficiently sampled in qudit surface codes

Surface codes are the most promising candidates for fault-tolerant quantum computation. Single qudit errors are typically modelled as Pauli operators, to which general errors are converted via randomizing methods. In this Letter, we quantify remaining correlations after syndrome measurement for a qudit 2D surface code subject to non-Pauli errors. Using belief propagation and percolation theory, we relate correlations to loops on the lattice. Below the error correction threshold, remaining correlations are sparse and locally constrained. Syndromes for qudit surface codes are therefore efficiently samplable for non-Pauli errors, independent of the exact forms of the error and decoder.

quant-ph↗

arXiv2023

Eliminating Thermal IR Background Noise by Imaging with Undetected Photons

Spectroscopy and imaging in the mid-infrared (2.5 $μ$m $\sim$ $λ$ $\sim$ 25 $μ$m) is bedevilled by the presence of a strong 300 K thermal background at room temperature that makes IR detectors decades noisier than can be readily achieved in the visible. The technique of "imaging with undetected photons" (IUP) exploits the quantum correlations between entangled photon pairs to transfer image information from one spectral region to another, and here we show that it does so in a way that is immune to the thermal background. This means that IUP can be used to perform high speed photon counting measurements across the mid-IR, using uncooled visible detectors that are many times cheaper, faster, and more sensitive than their IR counterparts.

quant-ph↗

arXiv2023

SemanticAC: Semantics-Assisted Framework for Audio Classification

In this paper, we propose SemanticAC, a semantics-assisted framework for Audio Classification to better leverage the semantic information. Unlike conventional audio classification methods that treat class labels as discrete vectors, we employ a language model to extract abundant semantics from labels and optimize the semantic consistency between audio signals and their labels. We verify that simple textual information from labels and advanced pretraining models enable more abundant semantic supervision for better performance. Specifically, we design a text encoder to capture the semantic information from the text extension of labels. Then we map the audio signals to align with the semantics of corresponding class labels via an audio encoder and a similarity calculation module so as to enforce the semantic consistency. Extensive experiments on two audio datasets, ESC-50 and US8K demonstrate that our proposed method consistently outperforms the compared audio classification methods.

cs.SD↗

arXiv2023

Spectral extrema of graphs with bounded clique number and matching number

For a set of graphs $\mathcal{F}$, let $\ex(n,\mathcal{F})$ and $\spex(n,\mathcal{F})$ denote the maximum number of edges and the maximum spectral radius of an $n$-vertex $\mathcal{F}$-free graph, respectively. Nikiforov ({\em LAA}, 2007) gave the spectral version of the Turán Theorem by showing that $\spex(n, K_{k+1})=λ(T_{k}(n))$, where $T_k(n)$ is the $k$-partite Turán graph on $n$ vertices. In the same year, Feng, Yu and Zhang ({\em LAA}) determined the exact value of $\spex(n, M_{s+1})$, where $M_{s+1}$ is a matching with $s+1$ edges. Recently, Alon and Frankl~(arXiv2210.15076) gave the exact value of $\ex(n,\{K_{k+1},M_{s+1}\})$. In this article, we give the spectral version of the result of Alon and Frankl by determining the exact value of $\spex(n,\{K_{k+1},M_{s+1}\})$ when $n$ is large.

math.CO↗

arXiv2022

Generically sharp decay for quasilinear wave equations with null condition

We are interested in the three-dimensional quasilinear wave equations with null condition. Global existence and pointwise decay for this model have been proved in the celebrated works of Klainerman \cite{Klainerman86} and Christodoulou \cite{Christodoulou86} for small smooth initial data. In this work, we illustrate the precise pointwise asymptotic behavior of the solutions for initial data posed on a hyperboloid and show that the decay rate $v^{-1}u^{-1}$ is optimal for a generic set of initial data.

math.AP↗

arXiv2022

Nonlinear stability of self-gravitating massive fields. A wave-Klein-Gordon model

Significant advances were made in recent years on the global evolution problem for self-gravitating massive matter in the small-perturbative regime close to Minkowski spacetime. To study the coupling between a Klein-Gordon equation and Einstein's field equations, we introduced the ``Euclidean-hyperboloidal foliation method'', which is based on the construction of a spacetime foliation adapted to the derivation of sharp decay estimates for wave and Klein-Gordon equations in a curved spacetime. We give here an outline of this method, together with a full proof for a wave-Klein-Gordon model which retains some main challenges arising with the Einstein-matter system.

gr-qc↗

arXiv2022

SimVTP: Simple Video Text Pre-training with Masked Autoencoders

This paper presents SimVTP: a Simple Video-Text Pretraining framework via masked autoencoders. We randomly mask out the spatial-temporal tubes of input video and the word tokens of input text and then feed them into a unified autencoder to reconstruct the missing pixels and words. Our SimVTP has several properties: 1) Thanks to the unified autoencoder, SimVTP reconstructs the masked signal of one modality with the help from another modality, which implicitly learns the cross-modal alignment between video tubes and text tokens. 2) SimVTP not only benefits from a high video masking ratio (e.g. 90%) due to the temporal redundancy of video, but also needs a high text masking ratio (e.g. 75%), which is much higher than BERT (e.g. 15%), to achieve optimal performance. This is because the aid of video modality makes text reconstruction less challenging, which thus needs a higher mask ratio to make the pretext harder for useful feature learning. 3) Equipping SimVTP with video-text contrastive learning (VTC) and video-text matching (VTM), which are two commonly used cross-modal training strategies, could further improve the transferable performance significantly. 4) SimVTP is dataefficent, e.g., pre-training only on 10% data of WebVid-2M, SimVTP achieves surprisingly good results (43.8 R@1) on MSRVTT, which is far above recent state-of-the-art methods pre-trained on both CC3M and WebVid-2M. We transfer our pre-trained model to various downstream tasks and achieve superior performance. The codes and models will be released at https://github.com/mayuelala/SimVTP.

cs.CV↗

arXiv2022

The degree and codegree threshold for linear triangle covering in 3-graphs

Given two $k$-uniform hypergraphs $F$ and $G$, we say that $G$ has an $F$-covering if every vertex in $G$ is contained in a copy of $F$. For $1\le i \le k-1$, let $c_i(n,F)$ be the least integer such that every $n$-vertex $k$-uniform hypergraph $G$ with $δ_i(G)> c_i(n,F)$ has an $F$-covering. The covering problem has been systematically studied by Falgas-Ravry and Zhao [Codegree thresholds for covering 3-uniform hypergraphs, SIAM J. Discrete Math., 2016]. Last year, Falgas-Ravry, Markström, and Zhao [Triangle-degrees in graphs and tetrahedron coverings in 3-graphs, Combinatorics, Probability and Computing, 2021] asymptotically determined $c_1(n, F)$ when $F$ is the generalized triangle. In this note, we give the exact value of $c_2(n, F)$ and asymptotically determine $c_1(n, F)$ when $F$ is the linear triangle $C_6^3$, where $C_6^3$ is the 3-uniform hypergraph with vertex set $\{v_1,v_2,v_3,v_4,v_5,v_6\}$ and edge set $\{v_1v_2v_3,v_3v_4v_5,v_5v_6v_1\}$.

math.CO↗

arXiv2022

Enhanced nonlinear interferometry via seeding

We analyse a nonlinear interferometer, also known as an SU(1,1) interferometer, in the presence of internal losses and inefficient detectors. To overcome these limitations, we consider the effect of seeding one of the interferometer input modes with either a number state or a coherent state. We derive analytical expressions for the interference visibility, contrast, phase sensitivity, and signal-to-noise ratio, and show a significant enhancement in all these quantities as a function of the seeding photon number. For example, we predict that, even in the presence of substantial losses and highly inefficient detectors, we can achieve the same quantum-limited phase sensitivity of an unseeded nonlinear interferometer by seeding with a few tens of photons. Furthermore, we observe no difference between a number or a coherent seeding state when the interferometer operates in the low-gain regime, which enables seeding with an attenuated laser. Our results expand the nonlinear interferometry capabilities in the field of quantum imaging, metrology, and spectroscopy under realistic experimental conditions.

quant-ph↗

arXiv2022

Einstein-Klein-Gordon spacetimes in the harmonic near-Minkowski regime

We study the initial value problem for the Einstein-Klein-Gordon system and establish the global nonlinear stability of massive matter in the near-Minkowski regime when the initial geometry is a perturbation of an asymptotically flat, spacelike hypersurface in Minkowski spacetime and the metric enjoys the harmonic decay 1/r (in term of a suitable distance function r at spatial infinity). Our analysis encompasses matter fields that have small energy norm and solely enjoys a slow decay at spacelike infinity. Our proof is based on the Euclidean-hyperboloidal foliation method recently introduced by the authors, and distinguishes between the decay along asymptotically hyperbolic slices and the decay along asymptotically Euclidean slices. We carefully analyze the decay of metric component at the harmonic level 1/r, especially the metric component in the direction of the light cone. In presence of such a slow-decaying matter field, we establish a global existence theory for the Einstein equations expressed as a coupled system of nonlinear wave and Klein-Gordon equations.

gr-qc↗

arXiv2022

Toward Systematic Considerations of Missingness in Visual Analytics

Data-driven decision making has been a common task in today's big data era, from simple choices such as finding a fast way to drive home, to complex decisions on medical treatment. It is often supported by visual analytics. For various reasons (e.g., system failure, interrupted network, intentional information hiding, or bias), visual analytics for sensemaking of data involves missingness (e.g., data loss and incomplete analysis), which impacts human decisions. For example, missing data can cost a business millions of dollars, and failing to recognize key evidence can put an innocent person in jail. Being aware of missingness is critical to avoid such catastrophes. To fulfill this, as an initial step, we consider missingness in visual analytics from two aspects: data-centric and human-centric. The former emphasizes missingness in three data-related categories: data composition, data relationship, and data usage. The latter focuses on the human-perceived missingness at three levels: observed-level, inferred-level, and ignored-level. Based on them, we discuss possible roles of visualizations for handling missingness, and conclude our discussion with future research opportunities.

cs.HC↗