Searcharxiv⌕ Search

arXiv subjects

Tao Zhang

Publications and source records attributed to Tao Zhang.

At least 451 records · Page 25Linked to original sources

A First Search for Solar $^8$B Neutrino in the PandaX-4T Experiment using Neutrino-Nucleus Coherent Scattering

A search for interactions from solar $^8$B neutrinos elastically scattering off xenon nuclei using PandaX-4T commissioning data is reported. The energy threshold of this search is further lowered compared with the previous search for dark matter, with various techniques utilized to suppress the background that emerges from data with the lowered threshold. A blind analysis is performed on the data with an effective exposure of 0.48 tonne$\cdot$year, and no significant excess of events is observed. Among results obtained using the neutrino-nucleus coherent scattering, our results give the best constraint on the solar $^8$B neutrino flux. We further provide a more stringent limit on the cross section between dark matter and nucleon in the mass range from 3 to 9 GeV/c$^2$.

hep-ex↗

A topologically-protected interior for three-dimensional confluent cellular collectives

Organoids are in vitro cellular collectives from which brain-like, or gut-like, or kidney-like structures emerge. To make quantitative predictions regarding the morphology and rheology of a cellular collective in its initial stages of development, we construct and study a three-dimensional vertex model. In such a model, the cells are represented as deformable polyhedrons with cells sharing faces such that there are no gaps between them, otherwise known as confluent. In a bulk model with periodic boundary conditions, we find a rigidity transition as a function of the target cell shape index $s_0$ with a critical value $s_0^*=5.39\pm0.01$. For a confluent cellular collective with a finite boundary, and in the presence of lateral extensile and in-plane, radial extensile deformations, we find a significant boundary-bulk effect that is one-cell layer thick. More specifically, for lateral extensile deformations, the cells in the bulk are much less aligned with the direction of the lateral deformation than the cells at the boundary. For in-plane, radial deformations, the cells in the bulk exhibit much less reorientation perpendicular to the radial direction than the cells at the boundary. In other words, for both deformations, the bulk, interior cells are topologically-protected from the deformations, at least over time scales much slower than the timescale for cellular rearrangements and up to reasonable amounts of strain. Our results provide an underlying mechanism for some observed cell shape patterning in organoids. Finally, we discuss the use of a cellular-based approach to designing organoids with new types of morphologies to study the intricate relationship between structure and function at the multi-cellular scale for example.

cond-mat.soft↗

EZInterviewer: To Improve Job Interview Performance with Mock Interview Generator

Interview has been regarded as one of the most crucial step for recruitment. To fully prepare for the interview with the recruiters, job seekers usually practice with mock interviews between each other. However, such a mock interview with peers is generally far away from the real interview experience: the mock interviewers are not guaranteed to be professional and are not likely to behave like a real interviewer. Due to the rapid growth of online recruitment in recent years, recruiters tend to have online interviews, which makes it possible to collect real interview data from real interviewers. In this paper, we propose a novel application named EZInterviewer, which aims to learn from the online interview data and provides mock interview services to the job seekers. The task is challenging in two ways: (1) the interview data are now available but still of low-resource; (2) to generate meaningful and relevant interview dialogs requires thorough understanding of both resumes and job descriptions. To address the low-resource challenge, EZInterviewer is trained on a very small set of interview dialogs. The key idea is to reduce the number of parameters that rely on interview dialogs by disentangling the knowledge selector and dialog generator so that most parameters can be trained with ungrounded dialogs as well as the resume data that are not low-resource. Evaluation results on a real-world job interview dialog dataset indicate that we achieve promising results to generate mock interviews. With the help of EZInterviewer, we hope to make mock interview practice become easier for job seekers.

cs.CL↗

Extending structures for Zinbiel algebras

The extending structures and unified products for Zinbiel algebras are developed. Some special cases of unified products such as crossed products and matched pair of Zinbiel algebras are studied. It is proved that the extending structures can be classified by some non-abelian cohomology theory. One dimensional flag extending structures of Zinbiel algebras are also investigated.

math.RA↗

Extending structures for BiHom-Frobenius algebras

We introduce the concept of braided BiHom-Frobenius algebras and give the cocycle bicrossproduct construction for BiHom-Frobenius algebras. We find that the extending problem for BiHom-Frobenius algebras can be classified by non-abelian cohomology theory.

math.RA↗

Cohomology and crossed modules extension of Hom-Leibniz-Rinehart algebras

In this paper, we introduce the concept of crossed module for Hom-Leibniz-Rinehart algebras. We study the cohomology and extension theory of Hom-Leibniz-Rinehart algebras. It is proved that there is one-to-one correspondence between equivalence classes of abelian extensions of Hom-Leibniz-Rinehart algebras and the elements of second cohomology group. Furthermore, we prove that there is a natural map from $α$-crossed modules extension of Hom-Leibniz-Rinehart algebras to the third cohomology group of Hom-Leibniz-Rinehart algebras.

math.RA↗

On linear diameter perfect Lee codes with diameter 6

In 1968, Golomb and Welch conjectured that there is no perfect Lee codes with radius $r\ge2$ and dimension $n\ge3$. A diameter perfect code is a natural generalization of the perfect code. In 2011, Etzion (IEEE Trans. Inform. Theory, 57(11): 7473--7481, 2011) proposed the following problem: Are there diameter perfect Lee (DPL, for short) codes with diameter greater than four besides the $DPL(3,6)$ code? Later, Horak and AlBdaiwi (IEEE Trans. Inform. Theory, 58(8): 5490--5499, 2012) conjectured that there are no $DPL(n,d)$ codes for dimension $n\ge3$ and diameter $d>4$ except for $(n,d)=(3,6)$. In this paper, we give a counterexample to this conjecture. Moreover, we prove that for $n\ge3$, there is a linear $DPL(n,6)$ code if and only if $n=3,11$.

math.CO↗

Performance analysis for OFDM-based multi-carrier continuous-variable quantum key distribution with arbitrary modulation protocol

Multi-carrier continuous-variable quantum key distribution (CV-QKD) is considered to be a promising way to boost the secret key rate (SKR) over the existing single-carrier CV-QKD scheme. However, the extra excess noise induced in the imperfect multi-carrier quantum state preparation process of N subcarriers will limit the performance of the system. Here, a systematic modulation noise model is proposed for the multi-carrier CV-QKD based on the orthogonal frequency division multiplexing (OFDM). Subsequently, the performance of multi-carrier CV-QKD with arbitrary modulation protocol (e.g. QPSK, 256QAM and Gaussian modulation protocol) can be quantitatively evaluated by combining the security analysis method of the single-carrier CV-QKD. Under practical system parameters, the simulation results show that the SKR of the multi-carrier CV-QKD can still be significantly improved by increasing the carrier number N even with imperfect practical modulations. Specifically, the total SKR of multi-carrier CV-QKD can be optimized by carefully choosing N. The proposed model provides a feasible theoretical framework for the future multi-carrier CV-QKD experimental implementation.

quant-ph↗

Measurement of Double Beta Decay Half-life of $^{136}$Xe with the PandaX-4T Detector

Precise measurement of two-neutrino double beta decay (DBD) half-life is an important step for the searches of Majorana neutrinos with neutrinoless double beta decay. We report the measurement of DBD half-life of $^{136}$Xe using the PandaX-4T dual-phase Time Projection Chamber (TPC) with 3.7-tonne natural xenon and the first 94.9-day physics data release. The background model in the fiducial volume is well constrained in situ by events in the outer active region. With a $^{136}$Xe exposure of 15.5 kg-year, we establish the half-life as $2.27 \pm 0.03 (stat.)\pm 0.10 (syst.)\times 10^{21}$ years. This is the first DBD half-life measurement with natural xenon and demonstrates the physics capability of a large-scale liquid xenon TPC in the field of rare event searches.

nucl-ex↗

Graph Analysis in Decentralized Online Social Networks with Fine-Grained Privacy Protection

Graph analysts cannot directly obtain the global structure in decentralized social networks, and analyzing such a network requires collecting local views of the social graph from individual users. Since the edges between users may reveal sensitive social interactions in the local view, applying differential privacy in the data collection process is often desirable, which provides strong and rigorous privacy guarantees. In practical decentralized social graphs, different edges have different privacy requirements due to the distinct sensitivity levels. However, the existing differentially private analysis of social graphs provide the same protection for all edges. To address this issue, this work proposes a fine-grained privacy notion as well as novel algorithms for private graph analysis. We first design a fine-grained relationship differential privacy (FGR-DP) notion for social graph analysis, which enforces different protections for the edges with distinct privacy requirements. Then, we design algorithms for triangle counting and k-stars counting, respectively, which can accurately estimate subgraph counts given fine-grained protection for social edges. We also analyze upper bounds on the estimation error, including k-stars and triangle counts, and show their superior performance compared with the state-of-the-arts. Finally, we perform extensive experiments on two real social graph datasets and demonstrate that the proposed mechanisms satisfying FGR-DP have better utility than the state-of-the-art mechanisms due to the finer-grained protection.

cs.CR↗

Coevolutionary Framework for Generalized Multimodal Multi-objective Optimization

Most multimodal multi-objective evolutionary algorithms (MMEAs) aim to find all global Pareto optimal sets (PSs) for a multimodal multi-objective optimization problem (MMOP). However, in real-world problems, decision makers (DMs) may be also interested in local PSs. Also, searching for both global and local PSs is more general in view of dealing with MMOPs, which can be seen as a generalized MMOP. In addition, the state-of-the-art MMEAs exhibit poor convergence on high-dimension MMOPs. To address the above two issues, in this study, a novel coevolutionary framework termed CoMMEA for multimodal multi-objective optimization is proposed to better obtain both global and local PSs, and simultaneously, to improve the convergence performance in dealing with high-dimension MMOPs. Specifically, the CoMMEA introduces two archives to the search process, and coevolves them simultaneously through effective knowledge transfer. The convergence archive assists the CoMMEA to quickly approaching the Pareto optimal front (PF). The knowledge of the converged solutions is then transferred to the diversity archive which utilizes the local convergence indicator and the $ε$-dominance-based method to obtain global and local PSs effectively. Experimental results show that CoMMEA is competitive compared to seven state-of-the-art MMEAs on fifty-four complex MMOPs.

cs.NE↗

Extending structures for left-symmetric bialgebras

We introduce the concept of braided left-symmetric bialgebras and construct cocycle bicrossproduct left-symmetric bialgebras. As an application, we solve the extending problem for left-symmetric bialgebras by using some non-abelian cohomology theory.

math.RA↗

Do Pre-trained Language Models Indeed Understand Software Engineering Tasks?

Artificial intelligence (AI) for software engineering (SE) tasks has recently achieved promising performance. In this paper, we investigate to what extent the pre-trained language model truly understands those SE tasks such as code search, code summarization, etc. We conduct a comprehensive empirical study on a board set of AI for SE (AI4SE) tasks by feeding them with variant inputs: 1) with various masking rates and 2) with sufficient input subset method. Then, the trained models are evaluated on different SE tasks, including code search, code summarization, and duplicate bug report detection. Our experimental results show that pre-trained language models are insensitive to the given input, thus they achieve similar performance in these three SE tasks. We refer to this phenomenon as overinterpretation, where a model confidently makes a decision without salient features, or where a model finds some irrelevant relationships between the final decision and the dataset. Our study investigates two approaches to mitigate the overinterpretation phenomenon: whole word mask strategy and ensembling. To the best of our knowledge, we are the first to reveal this overinterpretation phenomenon to the AI4SE community, which is an important reminder for researchers to design the input for the models and calls for necessary future work in understanding and implementing AI4SE tasks.

cs.SE↗

Geo-MOEA: A Multi-Objective Evolutionary Algorithm with Geo-obfuscation for Mobile Crowdsourcing Workers

The rapid development of mobile Internet and sharing economy brings the prosperity of Spatial Crowdsourcing (SC). SC applications assign various tasks according to reported location information of task's requesters and outsourced workers (such as DiDi, MeiTuan and Uber). However, SC-servers are often untrustworthy and the exposure of users' locations raises privacy concerns. In this paper, we design a framework called Geo-MOEA (Multi-Objective Evolutionary Algorithm with Geo-obfuscation) to protect location privacy of workers involved on SC platform in mobile networks environment. We propose an adaptive regionalized obfuscation approach with inference error bounds based on geo-indistinguishability (a strong notion of differential privacy), which is suitable for the context of large-scale location data and task allocations. This enables each worker to report a pseudo-location that is adaptively generated with a personalized inference error threshold. Moreover, as a popular computational intelligence method, MOEA is introduced to optimize the trade-off between SC service availability and privacy protection while ensuring theoretically the most general condition on protection location sets for larger search space. Finally, the experimental results on two public datasets show that our Geo-MOEA approach achieves up to 20% reduction in service quality loss while guaranteeing differential and geo-distortion location privacy.

cs.CR↗

BuildMapper: A Fully Learnable Framework for Vectorized Building Contour Extraction

Deep learning based methods have significantly boosted the study of automatic building extraction from remote sensing images. However, delineating vectorized and regular building contours like a human does remains very challenging, due to the difficulty of the methodology, the diversity of building structures, and the imperfect imaging conditions. In this paper, we propose the first end-to-end learnable building contour extraction framework, named BuildMapper, which can directly and efficiently delineate building polygons just as a human does. BuildMapper consists of two main components: 1) a contour initialization module that generates initial building contours; and 2) a contour evolution module that performs both contour vertex deformation and reduction, which removes the need for complex empirical post-processing used in existing methods. In both components, we provide new ideas, including a learnable contour initialization method to replace the empirical methods, dynamic predicted and ground truth vertex pairing for the static vertex correspondence problem, and a lightweight encoder for vertex information extraction and aggregation, which benefit a general contour-based method; and a well-designed vertex classification head for building corner vertices detection, which casts light on direct structured building contour extraction. We also built a suitable large-scale building dataset, the WHU-Mix (vector) building dataset, to benefit the study of contour-based building extraction methods. The extensive experiments conducted on the WHU-Mix (vector) dataset, the WHU dataset, and the CrowdAI dataset verified that BuildMapper can achieve a state-of-the-art performance, with a higher mask average precision (AP) and boundary AP than both segmentation-based and contour-based methods.

cs.CV↗

Braided anti-flexible bialgebras

We introduce the concept of braided anti-flexible bialgebra and construct cocycle bicrossproduct anti-flexible bialgebras. As an application, we solve the extending problem for anti-flexible bialgebras by using some non-abelian cohomology theory.

math.RA↗

A group ring approach to Fuglede's conjecture in cyclic groups

Fuglede's conjecture states that a subset $Ω\subseteq\mathbb{R}^{n}$ of positive and finite Lebesgue measure is a spectral set if and only if it tiles $\mathbb{R}^{n}$ by translation. The conjecture does not hold in both directions for $\mathbb{R}^n$, $n\ge3$. However, this conjecture remains open in $\mathbb{R}$ and $\mathbb{R}^2$. Cyclic groups play important roles in the study of Fuglede's conjecture in $\mathbb{R}$. In this paper, we introduce a new tool to study the spectral sets in cyclic groups. In particular, we prove that Fuglede's conjecture holds in $\mathbb{Z}_{p^{n}qr}$.

math.CO↗

A Unified Positive-Unlabeled Learning Framework for Document-Level Relation Extraction with Different Levels of Labeling

Document-level relation extraction (RE) aims to identify relations between entities across multiple sentences. Most previous methods focused on document-level RE under full supervision. However, in real-world scenario, it is expensive and difficult to completely label all relations in a document because the number of entity pairs in document-level RE grows quadratically with the number of entities. To solve the common incomplete labeling problem, we propose a unified positive-unlabeled learning framework - shift and squared ranking loss positive-unlabeled (SSR-PU) learning. We use positive-unlabeled (PU) learning on document-level RE for the first time. Considering that labeled data of a dataset may lead to prior shift of unlabeled data, we introduce a PU learning under prior shift of training data. Also, using none-class score as an adaptive threshold, we propose squared ranking loss and prove its Bayesian consistency with multi-label ranking metrics. Extensive experiments demonstrate that our method achieves an improvement of about 14 F1 points relative to the previous baseline with incomplete labeling. In addition, it outperforms previous state-of-the-art results under both fully supervised and extremely unlabeled settings as well.

cs.CL↗