Researcher profile

Tao Zhang

Tao Zhang contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author

95works

0followers

43topics

4close collaborators

Actions

Decide how to stay connected

Follow researcher0

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

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

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.

preprint2026arXiv

A new super integrable hierarchy and a generalized super-AKNS hierarchy

In this paper, we investigate a non-isospectral problem on the loop algebra of the Lie superalgebra osp(1,6), and construct an super integrable system using the supertrace identity. The resulting super integrable system can be reduced to the super-AKNS hierarchy under certain conditions. By reconsidering a new (2 + 1)-dimensional non-isospectral problem with spectral matrices satisfying these conditions, we obtain a (2+1)-dimensional generalization of the superAKNS hierarchy.

preprint2026arXiv

Differentially Private Subspace Fine-Tuning for Large Language Models

Fine-tuning large language models on downstream tasks is crucial for realizing their cross-domain potential but often relies on sensitive data, raising privacy concerns. Differential privacy (DP) offers rigorous privacy guarantees and has been widely adopted in fine-tuning; however, naively injecting noise across the high-dimensional parameter space creates perturbations with large norms, degrading performance and destabilizing training. To address this issue, we propose DP-SFT, a two-stage subspace fine-tuning method that substantially reduces noise magnitude while preserving formal DP guarantees. Our intuition is that, during fine-tuning, significant parameter updates lie within a low-dimensional, task-specific subspace, while other directions change minimally. Hence, we only inject DP noise into this subspace to protect privacy without perturbing irrelevant parameters. In phase one, we identify the subspace by analyzing principal gradient directions to capture task-specific update signals. In phase two, we project full gradients onto this subspace, add DP noise, and map the perturbed gradients back to the original parameter space for model updates, markedly lowering noise impact. Experiments on multiple datasets demonstrate that DP-SFT enhances accuracy and stability under rigorous DP constraints, accelerates convergence, and achieves substantial gains over DP fine-tuning baselines.

preprint2026arXiv

GPS-Synchronized Monitoring of Core-collapse Supernova Bursts with PandaX-4T via Coherent Elastic Neutrino Nuclear Scattering

The landmark detection of neutrinos from SN1987A marked the dawn of neutrino astrophysics. The neutrino burst provided essential insights into fundamental properties of neutrinos, and served as key probes of stellar evolution and supernova dynamics. The recent advancement in coherent elastic neutrino-nucleus scattering enables the detection of core-collapse supernova burst neutrinos using tonne-scale liquid xenon detectors originally designed for dark matter direct detection. Leveraging this capability, we developed and deployed an online supernova monitoring system for the PandaX-4T experiment. This system features a GPS module with millisecond-level timing precision, a low false-alarm rate, and high sensitivity to galactic core-collapse supernova explosion events. The methodology is robust, directly scalable, and planned for implementation in the next-generation PandaX-20T experiment.

preprint2026arXiv

Learning to Dock: Geometric Deep Learning for Predicting Supramolecular Host-Guest Complexes

Predicting non-covalent host-guest recognition remains challenging due to the complex interplay of electrostatics, dispersion, and steric effects, and the limited transferability of existing docking approaches to synthetic supramolecular systems. Here we present DeepHostGuest, a geometric deep-learning framework that learns generalizable recognition principles directly from experimentally resolved host-guest structures. Hosts are encoded as electrostatic surfaces and guests as molecular graphs, enabling transferable learning across diverse supramolecular systems. DeepHostGuest achieves high-accuracy predictions (RMSD $\leq 2$ Angstrom for 80.8% of test cases), substantially outperforming classical docking without case-specific tuning. Notably, the method generalizes beyond its training domain to crystalline sponge systems, accurately capturing the binding of large amphiphilic molecules within metal-organic cages. Beyond predicting binding conformations, the structures generated by DeepHostGuest serve as a reliable basis for accurate binding free-energy calculations. Density Functional Theory (DFT)-calculated affinities correlate well with experiment, enabling structure-property relationships across 876 host-guest complexes spanning 34 host families. Interpretable feature analysis reveals that binding strength arises from a cooperative interplay of host polarity, guest hydrophobicity, and geometric complementarity, with distinct design regimes across supramolecular classes. Together, these results establish data-driven molecular recognition as a practical route to predictive supramolecular design, enabling high-throughput virtual screening and rational optimization of functional host-guest systems.

preprint2026arXiv

Report of the 5th PVUW Challenge: Towards More Diverse Modalities in Pixel-Level Understanding

This report summarizes the objectives, datasets, and top-performing methodologies of the 2026 Pixel-level Video Understanding in the Wild (PVUW) Challenge, hosted at CVPR 2026, which evaluates state-of-the-art models under highly unconstrained conditions. To provide a comprehensive assessment, the 2026 edition features three specialized tracks: the MOSE track for tracking objects within densely cluttered and severely occluded scenarios; the MeViS-Text track for localizing targets via motion-focused linguistic expressions; and the newly inaugurated MeViS-Audio track, which pioneers acoustic-driven object segmentation. By introducing previously unreleased challenging data and analyzing the cutting-edge, multimodal solutions submitted by participants, this report highlights the community's latest technical advancements and charts promising future directions for robust video scene comprehension.

preprint2026arXiv

Residual-PAC Privacy: Automatic Privacy Control Beyond the Gaussian Barrier

The Probably Approximately Correct (PAC) Privacy framework [46] provides a powerful instance-based methodology to preserve privacy in complex data-driven systems. Existing PAC Privacy algorithms (we call them Auto-PAC) rely on a Gaussian mutual information upper bound. However, we show that the upper bound obtained by these algorithms is tight if and only if the perturbed mechanism output is jointly Gaussian with independent Gaussian noise. We propose two approaches for addressing this issue. First, we introduce two tractable post-processing methods for Auto-PAC, based on Donsker-Varadhan representation and sliced Wasserstein distances. However, the result still leaves wasted privacy budget. To address this issue more fundamentally, we introduce Residual-PAC (R-PAC) Privacy, an f-divergence-based measure to quantify privacy that remains after adversarial inference. To implement R-PAC Privacy in practice, we propose a Stackelberg Residual-PAC (SR-PAC) privatization mechanism, a game-theoretic framework that selects optimal noise distributions through convex bilevel optimization. Our approach achieves efficient privacy budget utilization for arbitrary data distributions and naturally composes when multiple mechanisms access the dataset. Our experiments demonstrate that SR-PAC consistently obtains a better privacy-utility tradeoff than both PAC and differential privacy baselines.

preprint2025arXiv

Tunable Hybrid-Mode Coupler Enabling Strong Interactions between Transmons at Centimeter-Scale Distance

The transmon, a fabrication-friendly superconducting qubit, remains a leading candidate for scalable quantum computing. Recent advances in tunable couplers have accelerated progress toward high-performance quantum processors. However, extending coherent interactions beyond millimeter scales to enhance quantum connectivity presents a critical challenge. Here, we introduce a hybrid-mode coupler exploiting resonator-transmon hybridization to simultaneously engineer the two lowest-frequency mode, enabling high-contrast coupling between centimeter-scale transmons. For a 1-cm coupler, our framework predicts flux-tunable $XX$ and $ZZ$ coupling strengths reaching 23 MHz and 100 MHz, with modulation contrasts exceeding $10^2$ and $10^4$, respectively, demonstrating quantitative agreement with an effective two-channel model. This work provides an efficient pathway to mitigate the inherent connectivity constraints imposed by short-range interactions, enabling transmon-based architectures compatible with hardware-efficient quantum tasks.

preprint2025arXiv

Unaligned RGB Guided Hyperspectral Image Super-Resolution with Spatial-Spectral Concordance

Hyperspectral images super-resolution aims to improve the spatial resolution, yet its performance is often limited at high-resolution ratios. The recent adoption of high-resolution reference images for super-resolution is driven by the poor spatial detail found in low-resolution HSIs, presenting it as a favorable method. However, these approaches cannot effectively utilize information from the reference image, due to the inaccuracy of alignment and its inadequate interaction between alignment and fusion modules. In this paper, we introduce a Spatial-Spectral Concordance Hyperspectral Super-Resolution (SSC-HSR) framework for unaligned reference RGB guided HSI SR to address the issues of inaccurate alignment and poor interactivity of the previous approaches. Specifically, to ensure spatial concordance, i.e., align images more accurately across resolutions and refine textures, we construct a Two-Stage Image Alignment with a synthetic generation pipeline in the image alignment module, where the fine-tuned optical flow model can produce a more accurate optical flow in the first stage and warp model can refine damaged textures in the second stage. To enhance the interaction between alignment and fusion modules and ensure spectral concordance during reconstruction, we propose a Feature Aggregation module and an Attention Fusion module. In the feature aggregation module, we introduce an Iterative Deformable Feature Aggregation block to achieve significant feature matching and texture aggregation with the fusion multi-scale results guidance, iteratively generating learnable offset. Besides, we introduce two basic spectral-wise attention blocks in the attention fusion module to model the inter-spectra interactions. Extensive experiments on three natural or remote-sensing datasets show that our method outperforms state-of-the-art approaches on both quantitative and qualitative evaluations.

preprint2024arXiv

Training and Serving System of Foundation Models: A Comprehensive Survey

Foundation models (e.g., ChatGPT, DALL-E, PengCheng Mind, PanGu-$Σ$) have demonstrated extraordinary performance in key technological areas, such as natural language processing and visual recognition, and have become the mainstream trend of artificial general intelligence. This has led more and more major technology giants to dedicate significant human and financial resources to actively develop their foundation model systems, which drives continuous growth of these models' parameters. As a result, the training and serving of these models have posed significant challenges, including substantial computing power, memory consumption, bandwidth demands, etc. Therefore, employing efficient training and serving strategies becomes particularly crucial. Many researchers have actively explored and proposed effective methods. So, a comprehensive survey of them is essential for system developers and researchers. This paper extensively explores the methods employed in training and serving foundation models from various perspectives. It provides a detailed categorization of these state-of-the-art methods, including finer aspects such as network, computing, and storage. Additionally, the paper summarizes the challenges and presents a perspective on the future development direction of foundation model systems. Through comprehensive discussion and analysis, it hopes to provide a solid theoretical basis and practical guidance for future research and applications, promoting continuous innovation and development in foundation model systems.

preprint2023arXiv

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$.

preprint2023arXiv

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.

preprint2023arXiv

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.

preprint2023arXiv

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.

preprint2023arXiv

On lattice tilings of $\mathbb{Z}^{n}$ by limited magnitude error balls $\mathcal{B}(n,2,1,1)$

Limited magnitude error model has applications in flash memory. In this model, a perfect code is equivalent to a tiling of $\mathbb{Z}^n$ by limited magnitude error balls. In this paper, we give a complete classification of lattice tilings of $\mathbb{Z}^n$ by limited magnitude error balls $\mathcal{B}(n,2,1,1)$.

preprint2022arXiv

A Gaseous Time Projection Chamber with Micromegas Readout for Low Radioactive Material Screening

Low radioactive material screening is becoming essential for rare event search experiments, such as neutrinoless double beta decay and dark matter searches in underground laboratories. A gaseous time projection chamber (TPC) can be used for such purposes with large active areas and high efficiency. A gaseous TPC with a Micromegas readout plane of approximately 20$\times$20 cm$^2$ is successfully constructed for surface alpha contamination measurements. We have characterized the energy resolution, gain stability, and tracking capability with calibration sources. With the unique track-related background suppression cuts of the gaseous TPC, we have established that the alpha background rate of the TPC is 0.13$\pm$0.03 $μ$Bq/cm$^2$, comparable to the leading commercial solutions.

preprint2022arXiv

A Learning System for Motion Planning of Free-Float Dual-Arm Space Manipulator towards Non-Cooperative Object

Recent years have seen the emergence of non-cooperative objects in space, like failed satellites and space junk. These objects are usually operated or collected by free-float dual-arm space manipulators. Thanks to eliminating the difficulties of modeling and manual parameter-tuning, reinforcement learning (RL) methods have shown a more promising sign in the trajectory planning of space manipulators. Although previous studies demonstrate their effectiveness, they cannot be applied in tracking dynamic targets with unknown rotation (non-cooperative objects). In this paper, we proposed a learning system for motion planning of free-float dual-arm space manipulator (FFDASM) towards non-cooperative objects. Specifically, our method consists of two modules. Module I realizes the multi-target trajectory planning for two end-effectors within a large target space. Next, Module II takes as input the point clouds of the non-cooperative object to estimate the motional property, and then can predict the position of target points on an non-cooperative object. We leveraged the combination of Module I and Module II to track target points on a spinning object with unknown regularity successfully. Furthermore, the experiments also demonstrate the scalability and generalization of our learning system.

preprint2022arXiv

A Miniature 3-DoF Flexible Parallel Robotic Wrist Using NiTi Wires for Gastrointestinal Endoscopic Surgery

Gastrointestinal endoscopic surgery (GES) has high requirements for instruments' size and distal dexterity, because of the narrow endoscopic channel and long, tortuous human gastrointestinal tract. This paper utilized Nickel-Titanium (NiTi) wires to develop a miniature 3-DoF (pitch-yaw-translation) flexible parallel robotic wrist (FPRW). Additionally, we assembled an electric knife on the wrist's connection interface and then teleoperated it to perform an endoscopic submucosal dissection (ESD) on porcine stomachs. The effective performance in each ESD workflow proves that the designed FPRW has sufficient workspace, high distal dexterity, and high positioning accuracy.

preprint2022arXiv

A Search for the Cosmic Ray Boosted Sub-GeV Dark Matter at the PandaX-II Experiment

We report a novel search for the cosmic ray boosted dark matter using the 100~tonne$\cdot$day full data set of the PandaX-II detector located at the China Jinping Underground Laboratory. With the extra energy gained from the cosmic rays, sub-GeV dark matter particles can produce visible recoil signals in the detector. The diurnal modulations in rate and energy spectrum are utilized to further enhance the signal sensitivity. Our result excludes the dark matter-nucleon elastic scattering cross section between 10$^{-31}$cm$^{2}$ and 10$^{-28}$cm$^{2}$ for a dark matter masses from 0.1 MeV/$c^2$ to 0.1 GeV/$c^2$, with a large parameter space previously unexplored by experimental collaborations.

preprint2022arXiv

A search for two-component Majorana dark matter in a simplified model using the full exposure data of PandaX-II experiment

In the two-component Majorana dark matter model, one dark matter particle can scatter off the target nuclei, and turn into a slightly heavier component. In the framework of a simplified model with a vector boson mediator, both the tree-level and loop-level processes contribute to the signal in direct detection experiment. In this paper, we report the search results for such dark matter from PandaX-II experiment, using total data of the full 100.7 tonne$\cdot$day exposure. No significant excess is observed, so strong constraints on the combined parameter space of mediator mass and dark matter mass are derived. With the complementary search results from collider experiments, a large range of parameter space can be excluded.

preprint2022arXiv

Alternating direction method of multipliers for convex programming: a lift-and-permute scheme

A lift-and-permute scheme of alternating direction method of multipliers (ADMM) is proposed for linearly constrained convex programming. It contains not only the newly developed balanced augmented Lagrangian method and its dual-primal variation, but also the proximal ADMM and Douglas-Rachford splitting algorithm. It helps to propose accelerated algorithms with worst-case $O(1/k^2)$ convergence rates in the case that the objective function to be minimized is strongly convex.

preprint2022arXiv

Bayesian Promised Persuasion: Dynamic Forward-Looking Multiagent Delegation with Informational Burning

This work studies a dynamic mechanism design problem in which a principal delegates decision makings to a group of privately-informed agents without the monetary transfer or burning. We consider that the principal privately possesses complete knowledge about the state transitions and study how she can use her private observation to support the incentive compatibility of the delegation via informational burning, a process we refer to as the looking-forward persuasion. The delegation mechanism is formulated in which the agents form belief hierarchies due to the persuasion and play a dynamic Bayesian game. We propose a novel randomized mechanism, known as Bayesian promised delegation (BPD), in which the periodic incentive compatibility is guaranteed by persuasions and promises of future delegations. We show that the BPD can achieve the same optimal social welfare as the original mechanism in stationary Markov perfect Bayesian equilibria. A revelation-principle-like design regime is established to show that the persuasion with belief hierarchies can be fully characterized by correlating the randomization of the agents' local BPD mechanisms with the persuasion as a direct recommendation of the future promises.

preprint2022arXiv

Braided Hom-Lie bialgebras

We introduce the new concept of braided Hom-Lie bialgebras which is a generalization of Sommerhäuser-Majid's braided Lie bialgebras and Yau's Hom-Lie bialgebras. Using this concept we give the unified product construction for Hom-Lie bialgebras which can be seen as a Hom-Lie version of Bespalov-Drabant's cocycle cross product bialgebras. Some special cases of unified products such as crossed product and matched pair of braided Hom-Lie bialgebras are investigated. As an application, we solve the Agore-Militaru extending problem for Hom-Lie bialgebras by using some non-abelian cohomology theory. Furthermore, one dimensional flag extending structures for Hom-Lie bialgebras are also investigated.

preprint2022arXiv

Challenges and Opportunities in Multi-device Speech Processing

We review current solutions and technical challenges for automatic speech recognition, keyword spotting, device arbitration, speech enhancement, and source localization in multidevice home environments to provide context for the INTERSPEECH 2022 special session, "Challenges and opportunities for signal processing and machine learning for multiple smart devices". We also identify the datasets needed to support these research areas. Based on the review and our research experience in the multi-device domain, we conclude with an outlook on the future evolution

preprint2022arXiv

Characterization of Pedestal Burst Instabilities during I-mode to H-mode Transition in the EAST Tokamak

Quasi-periodic Pedestal Burst Instabilities (PBIs), featuring alternative turbulence suppression and bursts, have been clearly identified by various edge diagnostics during I-mode to H-mode transition in the EAST Tokamak. The radial distribution of the phase perturbation caused by PBI shows that PBI is localized in the pedestal. Prior to each PBI, a significant increase of density gradient close to the pedestal top can be clearly distinguished, then the turbulence burst is generated, accompanied by the relaxation of the density profile, and then induces an outward particle flux. The relative density perturbation caused by PBIs is about $6 \sim 8\%$. Statistic analyses show that the pedestal normalized density gradient triggering the first PBI has a threshold value, mostly in the range of $22 \sim 24$, suggesting that a PBI triggering instability could be driven by the density gradient. And the pedestal normalized density gradient triggering the last PBI is about $30 \sim 40$ and seems to increase with the loss power and the chord-averaged density. In addition, the frequency of PBI is likely to be inversely proportional to the chord-averaged density and the loss power. These results suggest that PBIs and the density gradient prompt increase prior to PBIs can be considered as the precursor for controlling I-H transition.

preprint2022arXiv

CREAM: Weakly Supervised Object Localization via Class RE-Activation Mapping

Weakly Supervised Object Localization (WSOL) aims to localize objects with image-level supervision. Existing works mainly rely on Class Activation Mapping (CAM) derived from a classification model. However, CAM-based methods usually focus on the most discriminative parts of an object (i.e., incomplete localization problem). In this paper, we empirically prove that this problem is associated with the mixup of the activation values between less discriminative foreground regions and the background. To address it, we propose Class RE-Activation Mapping (CREAM), a novel clustering-based approach to boost the activation values of the integral object regions. To this end, we introduce class-specific foreground and background context embeddings as cluster centroids. A CAM-guided momentum preservation strategy is developed to learn the context embeddings during training. At the inference stage, the re-activation mapping is formulated as a parameter estimation problem under Gaussian Mixture Model, which can be solved by deriving an unsupervised Expectation-Maximization based soft-clustering algorithm. By simply integrating CREAM into various WSOL approaches, our method significantly improves their performance. CREAM achieves the state-of-the-art performance on CUB, ILSVRC and OpenImages benchmark datasets. Code will be available at https://github.com/Jazzcharles/CREAM.

preprint2022arXiv

Deep Reinforcement Learning for Online Routing of Unmanned Aerial Vehicles with Wireless Power Transfer

The unmanned aerial vehicle (UAV) plays an vital role in various applications such as delivery, military mission, disaster rescue, communication, etc., due to its flexibility and versatility. This paper proposes a deep reinforcement learning method to solve the UAV online routing problem with wireless power transfer, which can charge the UAV remotely without wires, thus extending the capability of the battery-limited UAV. Our study considers the power consumption of the UAV and the wireless charging process. Unlike the previous works, we solve the problem by a designed deep neural network. The model is trained using a deep reinforcement learning method offline, and is used to optimize the UAV routing problem online. On small and large scale instances, the proposed model runs from four times to 500 times faster than Google OR-tools, the state-of-the-art combinatorial optimization solver, with identical solution quality. It also outperforms different types of heuristic and local search methods in terms of both run-time and optimality. In addition, once the model is trained, it can scale to new generated problem instances with arbitrary topology that are not seen during training. The proposed method is practically applicable when the problem scale is large and the response time is crucial.

preprint2022arXiv

Design and Operation of the PandaX-4T High Speed Ultra-high Purity Xenon Recuperation System

In order to recuperate the ultra-high purity xenon from PandaX-4T dark matter detector to high-pressure gas cylinders in emergency or at the end-of-run situation, a high speed ultra-high purity xenon recuperation system is designed and developed. This system includes a diaphragm pump, the heat management system, the main recuperation pipeline, the reflux pipeline, the auxiliary recuperation pipeline and the automatic control system. The liquid xenon in the detector is vaporized by the heat management system, and the gaseous xenon is compressed to 6 MPa at the flow rate of 200 standard litres per minute (SLPM) using the diaphragm compressor. The high-pressure xenon is filled into 128 gas cylinders via the main recuperation pipeline. During the recuperation, the low pressure and temperature conditions of 2 ~ 3 atmospheres and 178 ~ 186.5 K in PandaX-4T dark matter detector are kept by the cooperation of the main recuperation pipeline, reflux pipeline and the auxiliary recuperation pipeline to guarantee the safety, and the purity of the recuperated xenon gas is measured to ensure no contamination happened. The development of the high speed ultra-high purity xenon recuperation system is important for the operation of large-scale dark matter detectors with the requirements of strict temperature and pressure environment and low background.

preprint2022arXiv

E2EC: An End-to-End Contour-based Method for High-Quality High-Speed Instance Segmentation

Contour-based instance segmentation methods have developed rapidly recently but feature rough and hand-crafted front-end contour initialization, which restricts the model performance, and an empirical and fixed backend predicted-label vertex pairing, which contributes to the learning difficulty. In this paper, we introduce a novel contour-based method, named E2EC, for high-quality instance segmentation. Firstly, E2EC applies a novel learnable contour initialization architecture instead of hand-crafted contour initialization. This consists of a contour initialization module for constructing more explicit learning goals and a global contour deformation module for taking advantage of all of the vertices' features better. Secondly, we propose a novel label sampling scheme, named multi-direction alignment, to reduce the learning difficulty. Thirdly, to improve the quality of the boundary details, we dynamically match the most appropriate predicted-ground truth vertex pairs and propose the corresponding loss function named dynamic matching loss. The experiments showed that E2EC can achieve a state-of-the-art performance on the KITTI INStance (KINS) dataset, the Semantic Boundaries Dataset (SBD), the Cityscapes and the COCO dataset. E2EC is also efficient for use in real-time applications, with an inference speed of 36 fps for 512*512 images on an NVIDIA A6000 GPU. Code will be released at https://github.com/zhang-tao-whu/e2ec.

preprint2022arXiv

End-to-end Alexa Device Arbitration

We introduce a variant of the speaker localization problem, which we call device arbitration. In the device arbitration problem, a user utters a keyword that is detected by multiple distributed microphone arrays (smart home devices), and we want to determine which device was closest to the user. Rather than solving the full localization problem, we propose an end-to-end machine learning system. This system learns a feature embedding that is computed independently on each device. The embeddings from each device are then aggregated together to produce the final arbitration decision. We use a large-scale room simulation to generate training and evaluation data, and compare our system against a signal processing baseline.

preprint2022arXiv

End-to-End Quality-of-Service Assurance with Autonomous Systems: 5G/6G Case Study

Providing differentiated services to meet the unique requirements of different use cases is a major goal of the fifth generation (5G) telecommunication networks and will be even more critical for future 6G systems. Fulfilling this goal requires the ability to assure quality of service (QoS) end to end (E2E), which remains a challenge. A key factor that makes E2E QoS assurance difficult in a telecommunication system is that access networks (ANs) and core networks (CNs) manage their resources autonomously. So far, few results have been available that can ensure E2E QoS over autonomously managed ANs and CNs. Existing techniques rely predominately on each subsystem to meet static local QoS budgets with no recourse in case any subsystem fails to meet its local budgets and, hence will have difficulty delivering E2E assurance. Moreover, most existing distributed optimization techniques that can be applied to assure E2E QoS over autonomous subsystems require the subsystems to exchange sensitive information such as their local decision variables. This paper presents a novel framework and a distributed algorithm that can enable ANs and CNs to autonomously "cooperate" with each other to dynamically negotiate their local QoS budgets and to collectively meet E2E QoS goals by sharing only their estimates of the global constraint functions, without disclosing their local decision variables. We prove that this new distributed algorithm converges to an optimal solution almost surely, and also present numerical results to demonstrate that the convergence occurs quickly even with measurement noise.

preprint2022arXiv

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.

preprint2022arXiv

Federated Learning Challenges and Opportunities: An Outlook

Federated learning (FL) has been developed as a promising framework to leverage the resources of edge devices, enhance customers' privacy, comply with regulations, and reduce development costs. Although many methods and applications have been developed for FL, several critical challenges for practical FL systems remain unaddressed. This paper provides an outlook on FL development, categorized into five emerging directions of FL, namely algorithm foundation, personalization, hardware and security constraints, lifelong learning, and nonstandard data. Our unique perspectives are backed by practical observations from large-scale federated systems for edge devices.

preprint2022arXiv

Hybridization of evolutionary algorithm and deep reinforcement learning for multi-objective orienteering optimization

Multi-objective orienteering problems (MO-OPs) are classical multi-objective routing problems and have received a lot of attention in the past decades. This study seeks to solve MO-OPs through a problem-decomposition framework, that is, a MO-OP is decomposed into a multi-objective knapsack problem (MOKP) and a travelling salesman problem (TSP). The MOKP and TSP are then solved by a multi-objective evolutionary algorithm (MOEA) and a deep reinforcement learning (DRL) method, respectively. While the MOEA module is for selecting cities, the DRL module is for planning a Hamiltonian path for these cities. An iterative use of these two modules drives the population towards the Pareto front of MO-OPs. The effectiveness of the proposed method is compared against NSGA-II and NSGA-III on various types of MO-OP instances. Experimental results show that our method exhibits the best performance on almost all the test instances, and has shown strong generalization ability.

preprint2022arXiv

Incentive Design for Large Congestion Games: Publicness-Specific Bayes Correlated Wardrop Equilibrium (Extended Abstract)

The travel costs of the players (travelers) in anonymous congestion games depend on their choices of routes and also on the states of the transportation network such as incidents, weather, and road work. In this extended abstract, we consider an incomplete-information environment in which the realizations of the states are unobserved by the travelers. We study how a planner can incentivize the travelers to behave in her favor by strategically designing what and how the travelers get informed about the realizations of the states.

preprint2022arXiv

InfoAT: Improving Adversarial Training Using the Information Bottleneck Principle

Adversarial training (AT) has shown excellent high performance in defending against adversarial examples. Recent studies demonstrate that examples are not equally important to the final robustness of models during AT, that is, the so-called hard examples that can be attacked easily exhibit more influence than robust examples on the final robustness. Therefore, guaranteeing the robustness of hard examples is crucial for improving the final robustness of the model. However, defining effective heuristics to search for hard examples is still difficult. In this article, inspired by the information bottleneck (IB) principle, we uncover that an example with high mutual information of the input and its associated latent representation is more likely to be attacked. Based on this observation, we propose a novel and effective adversarial training method (InfoAT). InfoAT is encouraged to find examples with high mutual information and exploit them efficiently to improve the final robustness of models. Experimental results show that InfoAT achieves the best robustness among different datasets and models in comparison with several state-of-the-art methods.

preprint2022arXiv

kDecay: Just adding k-decay items on Learning-Rate Schedule to improve Neural Networks

Recent work has shown that optimizing the Learning Rate (LR) schedule can be a very accurate and efficient way to train deep neural networks. We observe that the rate of change (ROC) of LR has correlation with the training process, but how to use this relationship to control the training to achieve the purpose of improving accuracy? We propose a new method, k-decay, just add an extra item to the commonly used and easy LR schedule(exp, cosine and polynomial), is effectively improves the performance of these schedule, also better than the state-of-the-art algorithms of LR shcedule such as SGDR, CLR and AutoLRS. In the k-decay, by adjusting the hyper-parameter $k$, to generate different LR schedule, when k increases, the performance is improved. We evaluate the k-decay method on CIFAR And ImageNet datasets with different neural networks (ResNet, Wide ResNet). Our experiments show that this method can improve on most of them. The accuracy has been improved by 1.08\% on the CIFAR-10 dataset and by 2.07 \% on the CIFAR-100 dataset. On the ImageNet, accuracy is improved by 1.25\%. Our method is not only a general method to be applied other LR Shcedule, but also has no additional computational cost.

preprint2022arXiv

Leveraging Search History for Improving Person-Job Fit

As the core technique of online recruitment platforms, person-job fit can improve hiring efficiency by accurately matching job positions with qualified candidates. However, existing studies mainly focus on the recommendation scenario, while neglecting another important channel for linking positions with job seekers, i.e. search. Intuitively, search history contains rich user behavior in job seeking, reflecting important evidence for job intention of users. In this paper, we present a novel Search History enhanced Person-Job Fit model, named as SHPJF. To utilize both text content from jobs/resumes and search histories from users, we propose two components with different purposes. For text matching component, we design a BERT-based text encoder for capturing the semantic interaction between resumes and job descriptions. For intention modeling component, we design two kinds of intention modeling approaches based on the Transformer architecture, either based on the click sequence or query text sequence. To capture underlying job intentions, we further propose an intention clustering technique to identify and summarize the major intentions from search logs. Extensive experiments on a large real-world recruitment dataset have demonstrated the effectiveness of our approach.

preprint2022arXiv

Low Radioactive Material Screening and Background Control for the PandaX-4T Experiment

PandaX-4T is a ton-scale dark matter direct detection experiment using a dual-phase TPC technique at the China Jinping Underground Laboratory. Various ultra-low background technologies have been developed and applied to material screening for PandaX-4T, including HPGe gamma spectroscopy, ICP-MS, NAA, radon emanation measurement system, krypton assay station, and alpha detection system. Low background materials were selected to assemble the detector. Surface treatment procedures were investigated to further suppress radioactive background. Combining measured results and Monte Carlo simulation, the total material background rates of PandaX-4T in the energy region of 1-25 keV$\rm{}_{ee}$ are estimated to be (9.9 $\pm$ 1.9) $\times \ 10^{-3}$ mDRU for electron recoil and (2.8 $\pm$ 0.6) $\times \ 10^{-4}$ mDRU for nuclear recoil. In addition, $^{nat}$Kr in the detector is estimated to be <8 ppt.

preprint2022arXiv

Modeling Two-Way Selection Preference for Person-Job Fit

Person-job fit is the core technique of online recruitment platforms, which can improve the efficiency of recruitment by accurately matching the job positions with the job seekers. Existing works mainly focus on modeling the unidirectional process or overall matching. However, recruitment is a two-way selection process, which means that both candidate and employer involved in the interaction should meet the expectation of each other, instead of unilateral satisfaction. In this paper, we propose a dual-perspective graph representation learning approach to model directed interactions between candidates and jobs. To model the two-way selection preference from the dual-perspective of job seekers and employers, we incorporate two different nodes for each candidate (or job) and characterize both successful matching and failed matching via a unified dual-perspective interaction graph. To learn dual-perspective node representations effectively, we design an effective optimization algorithm, which involves a quadruple-based loss and a dual-perspective contrastive learning loss. Extensive experiments on three large real-world recruitment datasets have shown the effectiveness of our approach.

preprint2022arXiv

Multi-layer VI-GNSS Global Positioning Framework with Numerical Solution aided MAP Initialization

Motivated by the goal of achieving long-term drift-free camera pose estimation in complex scenarios, we propose a global positioning framework fusing visual, inertial and Global Navigation Satellite System (GNSS) measurements in multiple layers. Different from previous loosely- and tightly- coupled methods, the proposed multi-layer fusion allows us to delicately correct the drift of visual odometry and keep reliable positioning while GNSS degrades. In particular, local motion estimation is conducted in the inner-layer, solving the problem of scale drift and inaccurate bias estimation in visual odometry by fusing the velocity of GNSS, pre-integration of Inertial Measurement Unit (IMU) and camera measurement in a tightly-coupled way. The global localization is achieved in the outer-layer, where the local motion is further fused with GNSS position and course in a long-term period in a loosely-coupled way. Furthermore, a dedicated initialization method is proposed to guarantee fast and accurate estimation for all state variables and parameters. We give exhaustive tests of the proposed framework on indoor and outdoor public datasets. The mean localization error is reduced up to 63%, with a promotion of 69% in initialization accuracy compared with state-of-the-art works. We have applied the algorithm to Augmented Reality (AR) navigation, crowd sourcing high-precision map update and other large-scale applications.

preprint2022arXiv

Neutron-induced nuclear recoil background in the PandaX-4T experiment

Neutron-induced nuclear recoil background is critical to the dark matter searches in the PandaX-4T liquid xenon experiment. This paper studies the feature of neutron background in liquid xenon and evaluates their contribution in the single scattering nuclear recoil events through three methods. The first method is fully Monte Carlo simulation based. The last two are data-driven methods that also use the multiple scattering signals and high energy signals in the data, respectively. In the PandaX-4T commissioning data with an exposure of 0.63 tonne-year, all these methods give a consistent result that there are $1.15\pm0.57$ neutron-induced background in dark matter signal region within an approximated nuclear recoil energy window between 5 and 100 keV.

preprint2022arXiv

Patient-Specific Game-Based Transfer Method for Parkinson's Disease Severity Prediction

Dysphonia is one of the early symptoms of Parkinson's disease (PD). Most existing methods use feature selection methods to find the optimal subset of voice features for all PD patients. Few have considered the heterogeneity between patients, which implies the need to provide specific prediction models for different patients. However, building the specific model faces the challenge of small sample size, which makes it lack generalization ability. Instance transfer is an effective way to solve this problem. Therefore, this paper proposes a patient-specific game-based transfer (PSGT) method for PD severity prediction. First, a selection mechanism is used to select PD patients with similar disease trends to the target patient from the source domain, which greatly reduces the risk of negative transfer. Then, the contribution of the transferred subjects and their instances to the disease estimation of the target subject is fairly evaluated by the Shapley value, which improves the interpretability of the method. Next, the proportion of valid instances in the transferred subjects is determined, and the instances with higher contribution are transferred to further reduce the difference between the transferred instance subset and the target subject. Finally, the selected subset of instances is added to the training set of the target subject, and the extended data is fed into the random forest to improve the performance of the method. Parkinson's telemonitoring dataset is used to evaluate the feasibility and effectiveness. Experiment results show that the PSGT has better performance in both prediction error and stability over compared methods.

preprint2022arXiv

RRL:Regional Rotation Layer in Convolutional Neural Networks

Convolutional Neural Networks (CNNs) perform very well in image classification and object detection in recent years, but even the most advanced models have limited rotation invariance. Known solutions include the enhancement of training data and the increase of rotation invariance by globally merging the rotation equivariant features. These methods either increase the workload of training or increase the number of model parameters. To address this problem, this paper proposes a module that can be inserted into the existing networks, and directly incorporates the rotation invariance into the feature extraction layers of the CNNs. This module does not have learnable parameters and will not increase the complexity of the model. At the same time, only by training the upright data, it can perform well on the rotated testing set. These advantages will be suitable for fields such as biomedicine and astronomy where it is difficult to obtain upright samples or the target has no directionality. Evaluate our module with LeNet-5, ResNet-18 and tiny-yolov3, we get impressive results.

preprint2022arXiv

Scale-Invariant Adversarial Attack for Evaluating and Enhancing Adversarial Defenses

Efficient and effective attacks are crucial for reliable evaluation of defenses, and also for developing robust models. Projected Gradient Descent (PGD) attack has been demonstrated to be one of the most successful adversarial attacks. However, the effect of the standard PGD attack can be easily weakened by rescaling the logits, while the original decision of every input will not be changed. To mitigate this issue, in this paper, we propose Scale-Invariant Adversarial Attack (SI-PGD), which utilizes the angle between the features in the penultimate layer and the weights in the softmax layer to guide the generation of adversaries. The cosine angle matrix is used to learn angularly discriminative representation and will not be changed with the rescaling of logits, thus making SI-PGD attack to be stable and effective. We evaluate our attack against multiple defenses and show improved performance when compared with existing attacks. Further, we propose Scale-Invariant (SI) adversarial defense mechanism based on the cosine angle matrix, which can be embedded into the popular adversarial defenses. The experimental results show the defense method with our SI mechanism achieves state-of-the-art performance among multi-step and single-step defenses.

preprint2022arXiv

Self-Aware Personalized Federated Learning

In the context of personalized federated learning (FL), the critical challenge is to balance local model improvement and global model tuning when the personal and global objectives may not be exactly aligned. Inspired by Bayesian hierarchical models, we develop a self-aware personalized FL method where each client can automatically balance the training of its local personal model and the global model that implicitly contributes to other clients' training. Such a balance is derived from the inter-client and intra-client uncertainty quantification. A larger inter-client variation implies more personalization is needed. Correspondingly, our method uses uncertainty-driven local training steps and aggregation rule instead of conventional local fine-tuning and sample size-based aggregation. With experimental studies on synthetic data, Amazon Alexa audio data, and public datasets such as MNIST, FEMNIST, CIFAR10, and Sent140, we show that our proposed method can achieve significantly improved personalization performance compared with the existing counterparts.

preprint2022arXiv

STBPU: A Reasonably Secure Branch Prediction Unit

Modern processors have suffered a deluge of threats exploiting branch instruction collisions inside the branch prediction unit (BPU), from eavesdropping on secret-related branch operations to triggering malicious speculative executions. Protecting branch predictors tends to be challenging from both security and performance perspectives. For example, partitioning or flushing BPU can stop certain collision-based exploits but only to a limited extent. Meanwhile, such mitigations negatively affect branch prediction accuracy and further CPU performance. This paper proposes Secret Token Branch Prediction Unit (STBPU), a secure BPU design to defend against collision-based transient execution attacks and BPU side channels while incurring minimal performance overhead. STBPU resolves the challenges above by customizing data representation inside BPU for each software entity requiring isolation. In addition, to prevent an attacker from using brute force techniques to trigger malicious branch instruction collisions, STBPU actively monitors the prediction-related events and preemptively changes BPU data representation.

preprint2022arXiv

Study of background from accidental coincidence signals in the PandaX-II experiment

The PandaX-II experiment employed a 580kg liquid xenon detector to search for the interactions between dark matter particles and the target xenon atoms. The accidental coincidences of isolated signals result in a dangerous background which mimic the signature of the dark matter. We performed a detailed study on the accidental coincidence background in PandaX-II, including the possible origin of the isolated signals, the background level and corresponding background suppression method. With a boosted-decision-tree algorithm, the accidental coincidence background is reduced by 70% in the dark matter signal region, thus the sensitivity of dark matter search at PandaX-II is improved.

preprint2022arXiv

SuperMVS: Non-Uniform Cost Volume For High-Resolution Multi-View Stereo

Different from most state-of-the-art~(SOTA) algorithms that use static and uniform sampling methods with a lot of hypothesis planes to get fine depth sampling. In this paper, we propose a free-moving hypothesis plane method for dynamic and non-uniform sampling in a wide depth range to build the cost volume, which not only greatly reduces the number of planes but also finers sampling, for both of reducing computational cost and improving accuracy, named Non-Uniform Cost Volume. We present the SuperMVS network to implement Multi-View Stereo with Non-Uniform Cost Volume. SuperMVS is a coarse-to-fine framework with four cascade stages. It can output higher resolution and accurate depth map. Our SuperMVS achieves the SOTA results with low memory, low runtime, and fewer planes on the DTU datasets and Tanks \& Temples dataset.

preprint2022arXiv

Task Offloading with Multi-Tier Computing Resources in Next Generation Wireless Networks

With the development of next-generation wireless networks, the Internet of Things (IoT) is evolving towards the intelligent IoT (iIoT), where intelligent applications usually have stringent delay and jitter requirements. In order to provide low-latency services to heterogeneous users in the emerging iIoT, multi-tier computing was proposed by effectively combining edge computing and fog computing. More specifically, multi-tier computing systems compensate for cloud computing through task offloading and dispersing computing tasks to multi-tier nodes along the continuum from the cloud to things. In this paper, we investigate key techniques and directions for wireless communications and resource allocation approaches to enable task offloading in multi-tier computing systems. A multi-tier computing model, with its main functionality and optimization methods, is presented in details. We hope that this paper will serve as a valuable reference and guide to the theoretical, algorithmic, and systematic opportunities of multi-tier computing towards next-generation wireless networks.

preprint2022arXiv

The Inverse Problem of Linear-Quadratic Differential Games: When is a Control Strategies Profile Nash?

This paper aims to formulate and study the inverse problem of non-cooperative linear quadratic games: Given a profile of control strategies, find cost parameters for which this profile of control strategies is Nash. We formulate the problem as a leader-followers problem, where a leader aims to implant a desired profile of control strategies among selfish players. In this paper, we leverage frequency-domain techniques to develop a necessary and sufficient condition on the existence of cost parameters for a given profile of stabilizing control strategies to be Nash under a given linear system. The necessary and sufficient condition includes the circle criterion for each player and a rank condition related to the transfer function of each player. The condition provides an analytical method to check the existence of such cost parameters, while previous studies need to solve a convex feasibility problem numerically to answer the same question. We develop an identity in frequency-domain representation to characterize the cost parameters, which we refer to as the Kalman equation. The Kalman equation reduces redundancy in the time-domain analysis that involves solving a convex feasibility problem. Using the Kalman equation, we also show the leader can enforce the same Nash profile by applying penalties on the shared state instead of penalizing the player for other players' actions to avoid the impression of unfairness.

preprint2022arXiv

Unified products for Zinbiel 2-algebras

The extending structures problem for Zinbiel 2-algebras is studied. We introduce the concept of unified products for Zinbiel 2-algebras. Some special cases of unified products such as crossed product and matched pair of Zinbiel 2-algebras are investigated. It is proved that the extending problem for Zinbiel 2-algebras can be classified by some non-abelian cohomology theory.

preprint2021arXiv

Correlated Data in Differential Privacy: Definition and Analysis

Differential privacy is a rigorous mathematical framework for evaluating and protecting data privacy. In most existing studies, there is a vulnerable assumption that records in a dataset are independent when differential privacy is applied. However, in real-world datasets, records are likely to be correlated, which may lead to unexpected data leakage. In this survey, we investigate the issue of privacy loss due to data correlation under differential privacy models. Roughly, we classify existing literature into three lines: 1) using parameters to describe data correlation in differential privacy, 2) using models to describe data correlation in differential privacy, and 3) describing data correlation based on the framework of Pufferfish. Firstly, a detailed example is given to illustrate the issue of privacy leakage on correlated data in real scenes. Then our main work is to analyze and compare these methods, and evaluate situations that these diverse studies are applied. Finally, we propose some future challenges on correlated differential privacy.

preprint2021arXiv

Crossed modules for Hom-Lie antialgebras

In this paper, we introduced the concept of crossed module for Hom-Lie antialgebras. It is proved that the category of crossed modules for Hom-Lie antialgebras and the category of $Cat^1$-Hom-Lie antialgebras are equivalent to each other. The relationship between the crossed module extension of Hom-Lie antialgebras and the third cohomology group are investigated.

preprint2021arXiv

Dark Matter Search Results from the PandaX-4T Commissioning Run

We report the first dark matter search results using the commissioning data from PandaX-4T. Using a time projection chamber with 3.7-tonne of liquid xenon target and an exposure of 0.63 tonne$\cdot$year, 1058 candidate events are identified within an approximate nuclear recoil energy window between 5 and 100 keV. No significant excess over background is observed. Our data set a stringent limit to the dark matter-nucleon spin-independent interactions, with a lowest excluded cross section (90% C.L.) of $3.8\times10^{-47} $cm$^2$ at a dark matter mass of 30 GeV/$c^2$.

preprint2021arXiv

Excited-state spectroscopy of spin defects in hexagonal boron nitride

We used optically detected magnetic resonance (ODMR) technique to directly probe electron-spin resonance transitions in the excited state of negatively-charged boron vacancy (VB-) defects in hexagonal boron nitride (hBN) at room temperature. The data showed that the excited state has a zero-field splitting of ~ 2.1 GHz, a g factor similar to the ground state and two types of hyperfine splitting ~ 90 MHz and ~ 18.8 MHz respectively. Pulsed ODMR experiments were conducted to further verify observed resonant peaks corresponding to spin transitions in the excited state. In addition, negative peaks in photoluminescence and ODMR contrast as a function of magnetic field magnitude and angle at level anti-crossing were observed and explained by coherent spin precession and anisotropic relaxation. This work provided significant insights for studying the structure of VB- excited states, which might be used for quantum information processing and nanoscale quantum sensing.

preprint2021arXiv

Generative Partial Visual-Tactile Fused Object Clustering

Visual-tactile fused sensing for object clustering has achieved significant progresses recently, since the involvement of tactile modality can effectively improve clustering performance. However, the missing data (i.e., partial data) issues always happen due to occlusion and noises during the data collecting process. This issue is not well solved by most existing partial multi-view clustering methods for the heterogeneous modality challenge. Naively employing these methods would inevitably induce a negative effect and further hurt the performance. To solve the mentioned challenges, we propose a Generative Partial Visual-Tactile Fused (i.e., GPVTF) framework for object clustering. More specifically, we first do partial visual and tactile features extraction from the partial visual and tactile data, respectively, and encode the extracted features in modality-specific feature subspaces. A conditional cross-modal clustering generative adversarial network is then developed to synthesize one modality conditioning on the other modality, which can compensate missing samples and align the visual and tactile modalities naturally by adversarial learning. To the end, two pseudo-label based KL-divergence losses are employed to update the corresponding modality-specific encoders. Extensive comparative experiments on three public visual-tactile datasets prove the effectiveness of our method.

preprint2021arXiv

Improving the Certified Robustness of Neural Networks via Consistency Regularization

A range of defense methods have been proposed to improve the robustness of neural networks on adversarial examples, among which provable defense methods have been demonstrated to be effective to train neural networks that are certifiably robust to the attacker. However, most of these provable defense methods treat all examples equally during training process, which ignore the inconsistent constraint of certified robustness between correctly classified (natural) and misclassified examples. In this paper, we explore this inconsistency caused by misclassified examples and add a novel consistency regularization term to make better use of the misclassified examples. Specifically, we identified that the certified robustness of network can be significantly improved if the constraint of certified robustness on misclassified examples and correctly classified examples is consistent. Motivated by this discovery, we design a new defense regularization term called Misclassification Aware Adversarial Regularization (MAAR), which constrains the output probability distributions of all examples in the certified region of the misclassified example. Experimental results show that our proposed MAAR achieves the best certified robustness and comparable accuracy on CIFAR-10 and MNIST datasets in comparison with several state-of-the-art methods.

preprint2021arXiv

Internal Calibration of the PandaX-II Detector with Radon Gaseous Sources

We have developed a low-energy electron recoil (ER) calibration method with $^{220}$Rn for the PandaX-II detector. $^{220}$Rn, emanated from natural thorium compounds, was fed into the detector through the xenon purification system. From 2017 to 2019, we performed three dedicated calibration campaigns with different radon sources. We studied the detector response to $α$, $β$, and $γ$ particles with focus on low energy ER events. During the runs in 2017 and 2018, the amount of radioactivity of $^{222}$Rn were on the order of 1\% of that of $^{220}$Rn and thorium particulate contamination was negligible, especially in 2018. We also measured the background contribution from $^{214}$Pb for the first time in PandaX-II with the help from a $^{222}$Rn injection. Calibration strategy with $^{220}$Rn and $^{222}$Rn will be implemented in the upcoming PandaX-4T experiment and can be useful for other xenon-based detectors as well.

preprint2021arXiv

JUNO Physics and Detector

The Jiangmen Underground Neutrino Observatory (JUNO) is a 20 kton LS detector at 700-m underground. An excellent energy resolution and a large fiducial volume offer exciting opportunities for addressing many important topics in neutrino and astro-particle physics. With 6 years of data, the neutrino mass ordering can be determined at 3-4 sigma and three oscillation parameters can be measured to a precision of 0.6% or better by detecting reactor antineutrinos. With 10 years of data, DSNB could be observed at 3-sigma; a lower limit of the proton lifetime of 8.34e33 years (90% C.L.) can be set by searching for p->nu_bar K^+; detection of solar neutrinos would shed new light on the solar metallicity problem and examine the vacuum-matter transition region. A core-collapse supernova at 10 kpc would lead to ~5000 IBD and ~2000 (300) all-flavor neutrino-proton (electron) scattering events. Geo-neutrinos can be detected with a rate of ~400 events/year. We also summarize the final design of the JUNO detector and the key R&D achievements. All 20-inch PMTs have been tested. The average photon detection efficiency is 28.9% for the 15,000 MCP PMTs and 28.1% for the 5,000 dynode PMTs, higher than the JUNO requirement of 27%. Together with the >20 m attenuation length of LS, we expect a yield of 1345 p.e. per MeV and an effective energy resolution of 3.02%/\sqrt{E (MeV)}$ in simulations. The underwater electronics is designed to have a loss rate <0.5% in 6 years. With degassing membranes and a micro-bubble system, the radon concentration in the 35-kton water pool could be lowered to <10 mBq/m^3. Acrylic panels of radiopurity <0.5 ppt U/Th are produced. The 20-kton LS will be purified onsite. Singles in the fiducial volume can be controlled to ~10 Hz. The JUNO experiment also features a double calorimeter system with 25,600 3-inch PMTs, a LS testing facility OSIRIS, and a near detector TAO.

preprint2021arXiv

Light yield and field dependence measurement in PandaX-II dual-phase xenon detector

The dual-phase xenon time projection chamber (TPC) is one of the most sensitive detector technology for dark matter direct search, where the energy deposition of incoming particle can be converted into photons and electrons through xenon excitation and ionization. The detector response to signal energy deposition varies significantly with the electric field in liquid xenon. We study the detector's light yield and its dependence on the electric field in the PandaX-II dual-phase detector containing 580~kg liquid xenon in the sensitive volume. From our measurements, the light yield at electric fields from 0~V/cm to 317~V/cm is obtained for energy depositions up to 236~keV.

preprint2021arXiv

On the Equilibrium Elicitation of Markov Games Through Information Design

This work considers a novel information design problem and studies how the craft of payoff-relevant environmental signals solely can influence the behaviors of intelligent agents. The agents' strategic interactions are captured by an incomplete-information Markov game, in which each agent first selects one environmental signal from multiple signal sources as additional payoff-relevant information and then takes an action. There is a rational information designer (designer) who possesses one signal source and aims to control the equilibrium behaviors of the agents by designing the information structure of her signals sent to the agents. An obedient principle is established which states that it is without loss of generality to focus on the direct information design when the information design incentivizes each agent to select the signal sent by the designer, such that the design process avoids the predictions of the agents' strategic selection behaviors. We then introduce the design protocol given a goal of the designer referred to as obedient implementability (OIL) and characterize the OIL in a class of obedient perfect Bayesian Markov Nash equilibria (O-PBME). A new framework for information design is proposed based on an approach of maximizing the optimal slack variables. Finally, we formulate the designer's goal selection problem and characterize it in terms of information design by establishing a relationship between the O-PBME and the Bayesian Markov correlated equilibria, in which we build upon the revelation principle in classic information design in economics. The proposed approach can be applied to elicit desired behaviors of multi-agent systems in competing as well as cooperating settings and be extended to heterogeneous stochastic games in the complete- and the incomplete-information environments.

preprint2021arXiv

Results of Dark Matter Search using the Full PandaX-II Exposure

We report the dark matter search results obtained using the full 132 ton$\cdot$day exposure of the PandaX-II experiment, including all data from March 2016 to August 2018. No significant excess of events is identified above the expected background. Upper limits are set on the spin-independent dark matter-nucleon interactions. The lowest 90% confidence level exclusion on the spin-independent cross section is $2.2\times 10^{-46}$ cm$^2$ at a WIMP mass of 30 GeV/$c^2$.

preprint2021arXiv

Towards Evaluating the Robustness of Deep Diagnostic Models by Adversarial Attack

Deep learning models (with neural networks) have been widely used in challenging tasks such as computer-aided disease diagnosis based on medical images. Recent studies have shown deep diagnostic models may not be robust in the inference process and may pose severe security concerns in clinical practice. Among all the factors that make the model not robust, the most serious one is adversarial examples. The so-called "adversarial example" is a well-designed perturbation that is not easily perceived by humans but results in a false output of deep diagnostic models with high confidence. In this paper, we evaluate the robustness of deep diagnostic models by adversarial attack. Specifically, we have performed two types of adversarial attacks to three deep diagnostic models in both single-label and multi-label classification tasks, and found that these models are not reliable when attacked by adversarial example. We have further explored how adversarial examples attack the models, by analyzing their quantitative classification results, intermediate features, discriminability of features and correlation of estimated labels for both original/clean images and those adversarial ones. We have also designed two new defense methods to handle adversarial examples in deep diagnostic models, i.e., Multi-Perturbations Adversarial Training (MPAdvT) and Misclassification-Aware Adversarial Training (MAAdvT). The experimental results have shown that the use of defense methods can significantly improve the robustness of deep diagnostic models against adversarial attacks.

preprint2021arXiv

Universal central extensions of Hom-Lie antialgebras

We develop a theory of universal central extensions for Hom-Lie antialgebra. It is proved that a Hom-Lie antialgebra admits a universal central extension if and only if it is perfect. Moreover, we show that the kernel of the universal central extension is equal to the second homology group with trivial coefficients.

preprint2020arXiv

A Survey of Model Compression and Acceleration for Deep Neural Networks

Deep neural networks (DNNs) have recently achieved great success in many visual recognition tasks. However, existing deep neural network models are computationally expensive and memory intensive, hindering their deployment in devices with low memory resources or in applications with strict latency requirements. Therefore, a natural thought is to perform model compression and acceleration in deep networks without significantly decreasing the model performance. During the past five years, tremendous progress has been made in this area. In this paper, we review the recent techniques for compacting and accelerating DNN models. In general, these techniques are divided into four categories: parameter pruning and quantization, low-rank factorization, transferred/compact convolutional filters, and knowledge distillation. Methods of parameter pruning and quantization are described first, after that the other techniques are introduced. For each category, we also provide insightful analysis about the performance, related applications, advantages, and drawbacks. Then we go through some very recent successful methods, for example, dynamic capacity networks and stochastic depths networks. After that, we survey the evaluation matrices, the main datasets used for evaluating the model performance, and recent benchmark efforts. Finally, we conclude this paper, discuss remaining the challenges and possible directions for future work.

preprint2020arXiv

Adaptive Trajectory Estimation with Power Limited Steering Model under Perturbation Compensation

Trajectory estimation of maneuvering objects is applied in numerous tasks like navigation, path planning and visual tracking. Many previous works get impressive results in the strictly controlled condition with accurate prior statistics and dedicated dynamic model for certain object. But in challenging conditions without dedicated dynamic model and precise prior statistics, the performance of these methods significantly declines. To solve the problem, a dynamic model called the power-limited steering model (PLS) is proposed to describe the motion of non-cooperative object. It is a natural combination of instantaneous power and instantaneous angular velocity, which relies on the nonlinearity instead of the state switching probability to achieve switching of states. And the renormalization group is introduced to compensate the nonlinear effect of perturbation in PLS model. For robust and efficient trajectory estimation, an adaptive trajectory estimation (AdaTE) algorithm is proposed. By updating the statistics and truncation time online, it corrects the estimation error caused by biased prior statistics and observation drift, while reducing the computational complexity lower than O(n). The experiment of trajectory estimation demonstrates the convergence of AdaTE, and the better robust to the biased prior statistics and the observation drift compared with EKF, UKF and sparse MAP. Other experiments demonstrate through slight modification, AdaTE can also be applied to local navigation in random obstacle environment, and trajectory optimization in visual tracking.

preprint2020arXiv

An Analysis of Scatter Characteristics in X-ray CT Spectral Correction

X-ray scatter remains a major physics challenge in volumetric computed tomography (CT), whose physical and statistical behaviors have been commonly leveraged in order to eliminate its impact on CT image quality. In this work, we conduct an in-depth derivation of how the scatter distribution and scatter to primary ratio (SPR) will change during the spectral correction, leading to an interesting finding on the property of scatter: when applying the spectral correction before scatter is removed, the impact of SPR on a CT projection will be scaled by the first derivative of the mapping function; while the scatter distribution in the transmission domain will be scaled by the product of the first derivative of the mapping function and a natural exponential of the projection difference before and after the mapping. Such a characterization of scatter's behavior provides an analytic approach of compensating for the SPR as well as approximating the change of scatter distribution after spectral correction, even though both of them might be significantly distorted as the linearization mapping function in spectral correction could vary a lot from one detector pixel to another. We conduct an evaluation of SPR compensations on a Catphan phantom and an anthropomorphic chest phantom to validate the characteristics of scatter. In addition, this scatter property is also directly adopted into CT imaging using a spectral modulator with flying focal spot technology (SMFFS) as an example to demonstrate its potential in practical applications.

preprint2020arXiv

Cable Loop Calibration System for Jiangmen Underground Neutrino Observatory

A cable loop source calibration system is developed for the Jiangmen Underground Neutrino Observatory, a 20 kton spherical liquid scintillator neutrino experiment. This system is capable of deploying radioactive sources into different positions of the detector in a vertical plane with a few-cm position accuracy. The design and the performance of the prototype are reported in this paper.

preprint2020arXiv

Channel Compression: Rethinking Information Redundancy among Channels in CNN Architecture

Model compression and acceleration are attracting increasing attentions due to the demand for embedded devices and mobile applications. Research on efficient convolutional neural networks (CNNs) aims at removing feature redundancy by decomposing or optimizing the convolutional calculation. In this work, feature redundancy is assumed to exist among channels in CNN architectures, which provides some leeway to boost calculation efficiency. Aiming at channel compression, a novel convolutional construction named compact convolution is proposed to embrace the progress in spatial convolution, channel grouping and pooling operation. Specifically, the depth-wise separable convolution and the point-wise interchannel operation are utilized to efficiently extract features. Different from the existing channel compression method which usually introduces considerable learnable weights, the proposed compact convolution can reduce feature redundancy with no extra parameters. With the point-wise interchannel operation, compact convolutions implicitly squeeze the channel dimension of feature maps. To explore the rules on reducing channel redundancy in neural networks, the comparison is made among different point-wise interchannel operations. Moreover, compact convolutions are extended to tackle with multiple tasks, such as acoustic scene classification, sound event detection and image classification. The extensive experiments demonstrate that our compact convolution not only exhibits high effectiveness in several multimedia tasks, but also can be efficiently implemented by benefiting from parallel computation.

preprint2020arXiv

Color isomorphic even cycles and a related Ramsey problem

In this paper, we first study a new extremal problem recently posed by Conlon and Tyomkyn~(arXiv: 2002.00921). Given a graph $H$ and an integer $k\geqslant 2$, let $f_{k}(n,H)$ be the smallest number of colors $c$ such that there exists a proper edge-coloring of the complete graph $K_{n}$ with $c$ colors containing no $k$ vertex-disjoint color-isomorphic copies of $H$. Using algebraic properties of polynomials over finite fields, we give an explicit proper edge-coloring of $K_{n}$ and show that $f_{k}(n, C_{4})=Θ(n)$ when $k\geqslant 3$ and $n\rightarrow\infty$. The methods we used in the edge-coloring may be of some independent interest. We also consider a related generalized Ramsey problem. For given graphs $G$ and $H,$ let $r(G,H,q)$ be the minimum number of edge-colors (not necessarily proper) of $G$, such that the edges of every copy of $H\subseteq G$ together receive at least $q$ distinct colors. Establishing the relation to the Turán number of specified bipartite graphs, we obtain some general lower bounds for $r(K_{n,n},K_{s,t},q)$ with a broad range of $q$.

preprint2020arXiv

Deep Reinforcement Learning for Multi-objective Optimization

This study proposes an end-to-end framework for solving multi-objective optimization problems (MOPs) using Deep Reinforcement Learning (DRL), that we call DRL-MOA. The idea of decomposition is adopted to decompose the MOP into a set of scalar optimization subproblems. Then each subproblem is modelled as a neural network. Model parameters of all the subproblems are optimized collaboratively according to a neighborhood-based parameter-transfer strategy and the DRL training algorithm. Pareto optimal solutions can be directly obtained through the trained neural network models. In specific, the multi-objective travelling salesman problem (MOTSP) is solved in this work using the DRL-MOA method by modelling the subproblem as a Pointer Network. Extensive experiments have been conducted to study the DRL-MOA and various benchmark methods are compared with it. It is found that, once the trained model is available, it can scale to newly encountered problems with no need of re-training the model. The solutions can be directly obtained by a simple forward calculation of the neural network; thereby, no iteration is required and the MOP can be always solved in a reasonable time. The proposed method provides a new way of solving the MOP by means of DRL. It has shown a set of new characteristics, e.g., strong generalization ability and fast solving speed in comparison with the existing methods for multi-objective optimizations. Experimental results show the effectiveness and competitiveness of the proposed method in terms of model performance and running time.

preprint2020arXiv

Differentially Private Collaborative Intrusion Detection Systems For VANETs

Vehicular ad hoc network (VANET) is an enabling technology in modern transportation systems for providing safety and valuable information, and yet vulnerable to a number of attacks from passive eavesdropping to active interfering. Intrusion detection systems (IDSs) are important devices that can mitigate the threats by detecting malicious behaviors. Furthermore, the collaborations among vehicles in VANETs can improve the detection accuracy by communicating their experiences between nodes. To this end, distributed machine learning is a suitable framework for the design of scalable and implementable collaborative detection algorithms over VANETs. One fundamental barrier to collaborative learning is the privacy concern as nodes exchange data among them. A malicious node can obtain sensitive information of other nodes by inferring from the observed data. In this paper, we propose a privacy-preserving machine-learning based collaborative IDS (PML-CIDS) for VANETs. The proposed algorithm employs the alternating direction method of multipliers (ADMM) to a class of empirical risk minimization (ERM) problems and trains a classifier to detect the intrusions in the VANETs. We use the differential privacy to capture the privacy notation of the PML-CIDS and propose a method of dual variable perturbation to provide dynamic differential privacy. We analyze theoretical performance and characterize the fundamental tradeoff between the security and privacy of the PML-CIDS. We also conduct numerical experiments using the NSL-KDD dataset to corroborate the results on the detection accuracy, security-privacy tradeoffs, and design.

preprint2020arXiv

Fairness Constraints in Semi-supervised Learning

Fairness in machine learning has received considerable attention. However, most studies on fair learning focus on either supervised learning or unsupervised learning. Very few consider semi-supervised settings. Yet, in reality, most machine learning tasks rely on large datasets that contain both labeled and unlabeled data. One of key issues with fair learning is the balance between fairness and accuracy. Previous studies arguing that increasing the size of the training set can have a better trade-off. We believe that increasing the training set with unlabeled data may achieve the similar result. Hence, we develop a framework for fair semi-supervised learning, which is formulated as an optimization problem. This includes classifier loss to optimize accuracy, label propagation loss to optimize unlabled data prediction, and fairness constraints over labeled and unlabeled data to optimize the fairness level. The framework is conducted in logistic regression and support vector machines under the fairness metrics of disparate impact and disparate mistreatment. We theoretically analyze the source of discrimination in semi-supervised learning via bias, variance and noise decomposition. Extensive experiments show that our method is able to achieve fair semi-supervised learning, and reach a better trade-off between accuracy and fairness than fair supervised learning.

preprint2020arXiv

Feasibility and physics potential of detecting $^8$B solar neutrinos at JUNO

The Jiangmen Underground Neutrino Observatory~(JUNO) features a 20~kt multi-purpose underground liquid scintillator sphere as its main detector. Some of JUNO's features make it an excellent experiment for $^8$B solar neutrino measurements, such as its low-energy threshold, its high energy resolution compared to water Cherenkov detectors, and its much large target mass compared to previous liquid scintillator detectors. In this paper we present a comprehensive assessment of JUNO's potential for detecting $^8$B solar neutrinos via the neutrino-electron elastic scattering process. A reduced 2~MeV threshold on the recoil electron energy is found to be achievable assuming the intrinsic radioactive background $^{238}$U and $^{232}$Th in the liquid scintillator can be controlled to 10$^{-17}$~g/g. With ten years of data taking, about 60,000 signal and 30,000 background events are expected. This large sample will enable an examination of the distortion of the recoil electron spectrum that is dominated by the neutrino flavor transformation in the dense solar matter, which will shed new light on the tension between the measured electron spectra and the predictions of the standard three-flavor neutrino oscillation framework. If $Δm^{2}_{21}=4.8\times10^{-5}~(7.5\times10^{-5})$~eV$^{2}$, JUNO can provide evidence of neutrino oscillation in the Earth at the about 3$σ$~(2$σ$) level by measuring the non-zero signal rate variation with respect to the solar zenith angle. Moveover, JUNO can simultaneously measure $Δm^2_{21}$ using $^8$B solar neutrinos to a precision of 20\% or better depending on the central value and to sub-percent precision using reactor antineutrinos. A comparison of these two measurements from the same detector will help elucidate the current tension between the value of $Δm^2_{21}$ reported by solar neutrino experiments and the KamLAND experiment.

preprint2020arXiv

Feature Location Benchmark for Decomposing and Reusing Android Apps

Software reuse enables developers to reuse architecture, programs and other software artifacts. Realizing a systematical reuse in software brings a large amount of benefits for stakeholders, including lower maintenance efforts, lower development costs, and time to market. Unfortunately, currently implementing a framework for large-scale software reuse in Android apps is still a huge problem, regarding the complexity of the task and lacking of practical technical support from either tools or domain experts. Therefore, proposing a feature location benchmark for apps will help developers either optimize their feature location techniques or reuse the assets created in the benchmark for reusing. In this paper, we release a feature location benchmark, which can be used for those developers, who intend to compose software product lines (SPL) and release reuse in apps. The benchmark not only contributes to the research community for reuse research, but also helps participants in industry for optimizing their architecture and enhancing modularity. In addition, we also develop an Android Studio plugin named caIDE for developers to view and operate on the benchmark.

preprint2020arXiv

Gridless Super-Resolution Sparse Recovery for Non-sidelooking STAP using Reweighted Atomic Norm Minimization

Sparse recovery Space-time Adaptive Processing (STAP) can reduce the requirements of clutter samples, and suppress clutter effectively using limited training samples for airborne radar. The whole angle-Doppler plane is discretized into small grid points uniformly in presently available sparse recovery STAP methods, however, the clutter ridge is not located exactly on the pre-discretized grid points in non-sidelooking STAP radar. The off-grid effect degrades the performance of STAP significantly. In this paper, a gridless sparse recovery STAP method is proposed based on reweighted atomic norm minimization, in which the clutter spectrum is precisely estimated in continuous angle-Doppler plane without resolution limit. Numerical results show that the proposed method provides an improved performance to the sparse recovery STAP methods with discretized dictionaries and STAP method utilizing atomic norm minimization.

preprint2020arXiv

Implementability of Honest Multi-Agent Sequential Decision-Making with Dynamic Population

We study the design of decision-making mechanism for resource allocations over a multi-agent system in a dynamic environment. Agents' privately observed preference over resources evolves over time and the population is dynamic due to the adoption of stopping rules. The proposed model designs the rules of encounter for agents participating in the dynamic mechanism by specifying an allocation rule and three payment rules to elicit agents' coupled decision makings of honest preference reporting and optimal stopping over multiple periods. The mechanism provides a special posted-price payment rule that depends only on each agent's realized stopping time to directly influence the population dynamics. This letter focuses on the theoretical implementability of the rules in perfect Bayesian Nash equilibrium and characterizes necessary and sufficient conditions to guarantee agents' honest equilibrium behaviors over periods. We provide the design principles to construct the payments in terms of the allocation rules and identify the restrictions of the designer's ability to influence the population dynamics. The established conditions make the designer's problem of finding multiple rules to determine an optimal allocation rule.

preprint2020arXiv

New lower bounds for the Turán density of $PG_{m}(q)$

Let $\mathcal{H}$ be an $r$-uniform hypergraph. The Turán number $\text{ex}(n,\mathcal{H})$ is the maximum number of edges in an $n$-vertex $\mathcal{H}$-free $r$-uniform hypergraph. The Turán density of $\mathcal{H}$ is defined by \[π(\mathcal{H})=\lim_{n\rightarrow\infty}\frac{\text{ex}(n,\mathcal{H})}{\binom{n}{r}}.\] In this paper, we consider the Turán density of projective geometries. We give two new constructions of $PG_{m}(q)$-free hypergraphs which improve some results given by Keevash (J. Combin. Theory Ser. A, 111: 289--309, 2005). Based on an upper bound of blocking sets of $PG_m(q)$, we give a new general lower bound for the Turán density of $PG_{m}(q)$. By a detailed analysis of the structures of complete arcs in $PG_2(q)$, we also get better lower bounds for the Turán density of $PG_2(q)$ with $q=3,\ 4,\ 5,\ 7,\ 8$.

preprint2020arXiv

Omni-Lie Color Algebras and Lie Color 2-Algebras

The notions of Lie color 2-algebras and 2-term color L-infty-algebras over a group-graded vector space are introduced and studied. It is proved that the category of Lie color 2-algebras and the category of 2-term color L1-algebras are equivalent. We construct Lie color 2-algebras from omni-Lie color algebras and Leibniz color algebras. Some example of $Z^2_2$ -graded Lie color 2-algebras are given.

preprint2020arXiv

On Hom-Lie antialgebra

In this paper, we introduced the notion of Hom-Lie antialgebras. The representations and cohomology theory of Hom-Lie antialgebras are investigated. We prove that the equivalent classes of abelian extensions of Hom-Lie antialgebras are in one-to-one correspondence to elements of the second cohomology group. We also prove that 1-parameter infinitesimal deformation of a Hom-Lie antialgebra are characterized by 2-cocycles of this Hom-Lie antialgebra with adjoint representation in itself. The notion of Nijenhuis operators of Hom-Lie antialgebra is introduced to describe trivial deformations.

preprint2020arXiv

On the Turán number of 1-subdivision of $K_{3,t}$

For a graph $H$, the 1-subdivision of $H$, denoted by $H'$, is the graph obtained by replacing the edges of $H$ by internally disjoint paths of length 2. Recently, Conlon, Janzer and Lee (arXiv: 1903.10631) asked the following question: For any integer $s\ge2$, estimate the smallest $t$ such that $\textup{ex}(n,K_{s,t}')=Ω(n^{\frac{3}{2}-\frac{1}{2s}})$. In this paper, we consider the case $s=3$. More precisely, we provide an explicit construction giving \begin{align*} \text{ex}(n,K_{3,30}')=Ω(n^{\frac{4}{3}}), \end{align*} which reduces the estimation for the smallest value of $t$ from a magnitude of $10^{56}$ to the number $30$. The construction is algebraic, which is based on some equations over finite fields.

preprint2020arXiv

Optimal Sampling for Generalized Linear Models under Measurement Constraints

Under "measurement constraints," responses are expensive to measure and initially unavailable on most of records in the dataset, but the covariates are available for the entire dataset. Our goal is to sample a relatively small portion of the dataset where the expensive responses will be measured and the resultant sampling estimator is statistically efficient. Measurement constraints require the sampling probabilities can only depend on a very small set of the responses. A sampling procedure that uses responses at most only on a small pilot sample will be called "response-free." We propose a response-free sampling procedure \mbox{(OSUMC)} for generalized linear models (GLMs). Using the A-optimality criterion, i.e., the trace of the asymptotic variance, the resultant estimator is statistically efficient within a class of sampling estimators. We establish the unconditional asymptotic distribution of a general class of response-free sampling estimators. This result is novel compared with the existing conditional results obtained by conditioning on both covariates and responses. Under our unconditional framework, the subsamples are no longer independent and new martingale techniques are developed for our asymptotic theory. We further derive the A-optimal response-free sampling distribution. Since this distribution depends on population level quantities, we propose the Optimal Sampling Under Measurement Constraints (OSUMC) algorithm to approximate the theoretical optimal sampling. Finally, we conduct an intensive empirical study to demonstrate the advantages of OSUMC algorithm over existing methods in both statistical and computational perspectives.

preprint2020arXiv

Optimal Two-Sided Market Mechanism Design for Large-Scale Data Sharing and Trading in Massive IoT Networks

The development of the Internet of Things (IoT) generates a significant amount of data that contains valuable knowledge for system operations and business opportunities. Since the data is the property of the IoT data owners, the access to the data requires permission from the data owners, which gives rise to a potential market opportunity for the IoT data sharing and trading to create economic values and market opportunities for both data owners and buyers. In this work, we leverage optimal mechanism design theory to develop a monopolist matching platform for data trading over massive IoT networks. The proposed mechanism is composed of a pair of matching and payment rules for each side of the market. We analyze the incentive compatibility of the market and characterize the optimal mechanism with a class of cut-off matching rules for both welfare-maximization and revenue-maximization mechanisms and study three matching behaviors including complete-matched, bottom-eliminated, and top-reserved.

preprint2020arXiv

Re-weighting and 1-Point RANSAC-Based PnP Solution to Handle Outliers

The ability to handle outliers is essential for performing the perspective-n-point (PnP) approach in practical applications, but conventional RANSAC+P3P or P4P methods have high time complexities. We propose a fast PnP solution named R1PPnP to handle outliers by utilizing a soft re-weighting mechanism and the 1-point RANSAC scheme. We first present a PnP algorithm, which serves as the core of R1PPnP, for solving the PnP problem in outlier-free situations. The core algorithm is an optimal process minimizing an objective function conducted with a random control point. Then, to reduce the impact of outliers, we propose a reprojection error-based re-weighting method and integrate it into the core algorithm. Finally, we employ the 1-point RANSAC scheme to try different control points. Experiments with synthetic and real-world data demonstrate that R1PPnP is faster than RANSAC+P3P or P4P methods especially when the percentage of outliers is large, and is accurate. Besides, comparisons with outlier-free synthetic data show that R1PPnP is among the most accurate and fast PnP solutions, which usually serve as the final refinement step of RANSAC+P3P or P4P. Compared with REPPnP, which is the state-of-the-art PnP algorithm with an explicit outliers-handling mechanism, R1PPnP is slower but does not suffer from the percentage of outliers limitation as REPPnP.

preprint2020arXiv

Robust Initial Alignment for SINS/DVL Based on Reconstructed Observation Vectors

Misalignment angle will result in a considerable error for the integration of Doppler Velocity Log (DVL) and of Strapdown Inertial Navigation System (SINS). In this paper, a robust initial alignment method for SINS/DVL is proposed to solve a practical applicable issue, which is that the outputs of DVL are often corrupted by the outliers. Firstly, the alignment principle for SINS/DVL is summarized. Secondly, based on the principle of this alignment method, the apparent velocity model is investigated, and the parameters expression of the apparent velocity model are derived detailed. Using the apparent velocity model, the unknown parameters of the apparent velocity model are estimated by the developed Robust Kalman Filter (RKF), then the reconstructed observation vector, where the outliers are detected and isolated, is reconstructed by the estimated parameters. Based on the reconstructed observation vectors, the initial attitude is determined. Finally, the simulation and field tests are carried out to verify the performance of the proposed method. The test results are shown that the proposed method can detect and isolate the outliers effectively and get better performance than the previous work.

preprint2020arXiv

Some tight lower bounds for Turán problems via constructions of multi-hypergraphs

Recently, several hypergraph Turán problems were solved by the powerful random algebraic method. However, the random algebraic method usually requires some parameters to be very large, hence we are concerned about how these Turán numbers depend on such large parameters of the forbidden hypergraphs. In this paper, we determine the dependence on such specified large constant for several hypergraph Turán problems. More specifically, for complete $r$-partite $r$-uniform hypergraphs, we show that if $s_{r}$ is sufficiently larger than $s_{1},s_{2},\ldots,s_{r-1},$ then $$\textup{ex}_{r}(n,K_{s_{1},s_{2},\ldots,s_{r}}^{(r)})=Θ(s_{r}^{\frac{1}{s_{1}s_{2}\cdots s_{r-1}}}n^{r-\frac{1}{s_{1}s_{2}\cdots s_{r-1}}}).$$ For complete bipartite $r$-uniform hypergraphs, we prove that if $s$ is sufficiently larger than $t,$ we have $$\textup{ex}_{r}(n,K_{s,t}^{(r)})=Θ(s^{\frac{1}{t}}n^{r-\frac{1}{t}}).$$ In particular, our results imply that the famous Kővári--Sós--Turán's upper bound $\textup{ex}(n,K_{s,t})=O(t^{\frac{1}{s}}n^{2-\frac{1}{s}})$ has the correct dependence on large $t$. The main approach is to construct random multi-hypergraph via a variant of random algebraic method.

preprint2020arXiv

STAN: Towards Describing Bytecodes of Smart Contract

More than eight million smart contracts have been deployed into Ethereum, which is the most popular blockchain that supports smart contract. However, less than 1% of deployed smart contracts are open-source, and it is difficult for users to understand the functionality and internal mechanism of those closed-source contracts. Although a few decompilers for smart contracts have been recently proposed, it is still not easy for users to grasp the semantic information of the contract, not to mention the potential misleading due to decompilation errors. In this paper, we propose the first system named STAN to generate descriptions for the bytecodes of smart contracts to help users comprehend them. In particular, for each interface in a smart contract, STAN can generate four categories of descriptions, including functionality description, usage description, behavior description, and payment description, by leveraging symbolic execution and NLP (Natural Language Processing) techniques. Extensive experiments show that STAN can generate adequate, accurate, and readable descriptions for contract's bytecodes, which have practical value for users.

preprint2020arXiv

TAO Conceptual Design Report: A Precision Measurement of the Reactor Antineutrino Spectrum with Sub-percent Energy Resolution

The Taishan Antineutrino Observatory (TAO, also known as JUNO-TAO) is a satellite experiment of the Jiangmen Underground Neutrino Observatory (JUNO). A ton-level liquid scintillator detector will be placed at about 30 m from a core of the Taishan Nuclear Power Plant. The reactor antineutrino spectrum will be measured with sub-percent energy resolution, to provide a reference spectrum for future reactor neutrino experiments, and to provide a benchmark measurement to test nuclear databases. A spherical acrylic vessel containing 2.8 ton gadolinium-doped liquid scintillator will be viewed by 10 m^2 Silicon Photomultipliers (SiPMs) of >50% photon detection efficiency with almost full coverage. The photoelectron yield is about 4500 per MeV, an order higher than any existing large-scale liquid scintillator detectors. The detector operates at -50 degree C to lower the dark noise of SiPMs to an acceptable level. The detector will measure about 2000 reactor antineutrinos per day, and is designed to be well shielded from cosmogenic backgrounds and ambient radioactivities to have about 10% background-to-signal ratio. The experiment is expected to start operation in 2022.

preprint2019arXiv

Bubble formation due to capillary instability during evaporation of a porous medium

We show that during evaporation of a pore network, liquid can refill the gas occupied pores, snapping off a gas bubble, which then moves to a stable configuration. This phenomenon is induced by the capillary instability due to the wettability heterogeneity of the pore network and has a much smaller time scale as compared to the evaporation process. The capillary instability induced liquid refilling and bubble movement are explained in detail based on the analysis of the images obtained from the visualization experiment. The capillary valve effect, which hinders the movement of the gas-liquid interface and is induced by the sudden geometrical expansion between small and large pores, can be suppressed by the residual liquid in the large pore. For better understanding of the capillary instability induced gas-liquid two-phase transport during evaporation, a novel pore network model is developed, which considers not only the capillary and viscous forces but also the inertial forces that are seldom taken into account in the previous models. The pore network modeling results are in good agreement with the experimental data, demonstrating the effectiveness of the developed pore network model, which opens up a new route for better understanding of the role of inertial forces in two-phase transport in porous media.

preprint2019arXiv

Pore network model of evaporation in porous media with continuous and discontinuous corner films

During evaporation in porous media, two types of corner films are distinguished. A continuous corner film is connected to the bulk liquid, while a discontinuous one is not. To disclose their effects on evaporation in porous media, a pore network model with both continuous and discontinuous corner films is developed, which considers the capillary and viscous forces as well as the effects of corner films on the threshold pressures of pores. The capillary valve effect induced by the sudden geometrical expansion between the small and large pores is also taken into account in the model. The developed pore network model agrees well with the evaporation experiment with a quasi 2D micro model porous medium, in terms of not only the variation of the liquid saturation in each pore but also the variation of the total evaporation rate. The pore network models that neglect the corner films or the liquid viscosity are also compared with the experiment so as to shed light on the roles of the corner films. The continuous corner films, which contribute to sustain the high evaporation rate, can be interrupted to be the discontinuous ones not only by the gas invasion into pores but also by the capillary scissors effect due to the local convex topology of the solid matrix.

preprint2019arXiv

Searching for Neutrino-less Double Beta Decay of $^{136}$Xe with PandaX-II Liquid Xenon Detector

We report the Neutrino-less Double Beta Decay (NLDBD) search results from PandaX-II dual-phase liquid xenon time projection chamber. The total live time used in this analysis is 403.1 days from June 2016 to August 2018. With NLDBD-optimized event selection criteria, we obtain a fiducial mass of 219 kg of natural xenon. The accumulated xenon exposure is 242 kg$\cdot$yr, or equivalently 22.2 kg$\cdot$yr of $^{136}$Xe exposure. At the region around $^{136}$Xe decay Q-value of 2458 keV, the energy resolution of PandaX-II is 4.2%. We find no evidence of NLDBD in PandaX-II and establish a lower limit for decay half-life of 2.4 $ \times 10^{23} $ yr at the 90% confidence level, which corresponds to an effective Majorana neutrino mass $m_{ββ} < (1.3 - 3.5)$ eV. This is the first NLDBD result reported from a dual-phase xenon experiment.

preprint2019arXiv

Stabilizing effect of enhanced resistivity on peeling-ballooning instabilities on EAST

Previous stability analysis of NSTX equilibrium with lithium-conditioning demonstrates that the enhanced resistivity due to the increased effective charge number Zeff (i.e. increased impurity level) can provide a stabilizing effect on low-n edge localized modes (Banerjee et al 2017 Nucl. Fusion 24 054501). This paper extends the resistivity stabilizing effect to the intermediate-n peeling-ballooning (PB) instabilities with the linear stability analysis of EAST high-confinement mode equilibria in NIMROD two-fluid calculations. However, the resistivity stabilizing effect on PB instabilities in the EAST tokamak appears weaker than that found in NSTX. This work may give better insight into the physical mechanism behind the beneficial effects of impurity on the pedestal stability.

preprint2018arXiv

Reconfiguration of Brain Network between Resting-state and Oddball Paradigm

The oddball paradigm is widely applied to the investigation of multiple cognitive functions. Prior studies have explored the cortical oscillation and power spectral differing from the resting-state conduction to oddball paradigm, but whether brain networks existing the significant difference is still unclear. Our study addressed how the brain reconfigures its architecture from a resting-state condition (i.e., baseline) to P300 stimulus task in the visual oddball paradigm. In this study, electroencephalogram (EEG) datasets were collected from 24 postgraduate students, who were required to only mentally count the number of target stimulus; afterwards the functional EEG networks constructed in different frequency bands were compared between baseline and oddball task conditions to evaluate the reconfiguration of functional network in the brain. Compared to the baseline, our results showed the significantly (p < 0.05) enhanced delta/theta EEG connectivity and decreased alpha default mode network in the progress of brain reconfiguration to the P300 task. Furthermore, the reconfigured coupling strengths were demonstrated to relate to P300 amplitudes, which were then regarded as input features to train a classifier to differentiate the high and low P300 amplitudes groups with an accuracy of 77.78%. The findings of our study help us to understand the changes of functional brain connectivity from resting-state to oddball stimulus task, and the reconfigured network pattern has the potential for the selection of good subjects for P300-based brain- computer interface.

preprint2015arXiv

Representations and cohomologies of Hom-Lie-Yamaguti algebras with applications

The representation and cohomology theory of Hom-Lie-Yamaguti algebras is introduced. As an application, we study deformation and extension of Hom-Lie-Yamaguti algebras. It proved that a 1-parameter infinitesimal deformation of a Hom-Lie-Yamaguti algebra $T$ corresponds to a Hom-Lie-Yamaguti algebra of deformation type and a (2,3)-cocycle of $T$ with coefficients in the adjoint representation. We also prove that abelian extensions of Hom-Lie-Yamaguti algebras are classified by the (2,3)-cohomology group.

preprint2014arXiv

A Proof of Radford's Biproduct Theorem by Using Braided Diagrams

We give a proof of the Radford's Biproduct Theorem in S. Montgomery's book [Hopf Algebras and Their Actions on Rings, CBMS 82, AMS,1993.] by using Majid's braided diagrams method and Yu.Bespalov and V. Lyubashenko's "t-angles.sty" package.

Tao Zhang

Quick read

Decide how to stay connected

How to connect with this researcher

Open a focused conversation when the fit is right

See the researcher in context

Building this graph slice

95 published item(s)

A new super integrable hierarchy and a generalized super-AKNS hierarchy

Differentially Private Subspace Fine-Tuning for Large Language Models

GPS-Synchronized Monitoring of Core-collapse Supernova Bursts with PandaX-4T via Coherent Elastic Neutrino Nuclear Scattering

Learning to Dock: Geometric Deep Learning for Predicting Supramolecular Host-Guest Complexes

Report of the 5th PVUW Challenge: Towards More Diverse Modalities in Pixel-Level Understanding

Residual-PAC Privacy: Automatic Privacy Control Beyond the Gaussian Barrier

Tunable Hybrid-Mode Coupler Enabling Strong Interactions between Transmons at Centimeter-Scale Distance

Unaligned RGB Guided Hyperspectral Image Super-Resolution with Spatial-Spectral Concordance

Training and Serving System of Foundation Models: A Comprehensive Survey

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

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

Extending structures for Zinbiel algebras

EZInterviewer: To Improve Job Interview Performance with Mock Interview Generator

On lattice tilings of $\mathbb{Z}^{n}$ by limited magnitude error balls $\mathcal{B}(n,2,1,1)$

A Gaseous Time Projection Chamber with Micromegas Readout for Low Radioactive Material Screening

A Learning System for Motion Planning of Free-Float Dual-Arm Space Manipulator towards Non-Cooperative Object

A Miniature 3-DoF Flexible Parallel Robotic Wrist Using NiTi Wires for Gastrointestinal Endoscopic Surgery

A Search for the Cosmic Ray Boosted Sub-GeV Dark Matter at the PandaX-II Experiment

A search for two-component Majorana dark matter in a simplified model using the full exposure data of PandaX-II experiment

Alternating direction method of multipliers for convex programming: a lift-and-permute scheme

Bayesian Promised Persuasion: Dynamic Forward-Looking Multiagent Delegation with Informational Burning

Braided Hom-Lie bialgebras

Challenges and Opportunities in Multi-device Speech Processing

Characterization of Pedestal Burst Instabilities during I-mode to H-mode Transition in the EAST Tokamak

CREAM: Weakly Supervised Object Localization via Class RE-Activation Mapping

Deep Reinforcement Learning for Online Routing of Unmanned Aerial Vehicles with Wireless Power Transfer

Design and Operation of the PandaX-4T High Speed Ultra-high Purity Xenon Recuperation System

E2EC: An End-to-End Contour-based Method for High-Quality High-Speed Instance Segmentation

End-to-end Alexa Device Arbitration

End-to-End Quality-of-Service Assurance with Autonomous Systems: 5G/6G Case Study

Extending structures for BiHom-Frobenius algebras

Federated Learning Challenges and Opportunities: An Outlook

Hybridization of evolutionary algorithm and deep reinforcement learning for multi-objective orienteering optimization

Incentive Design for Large Congestion Games: Publicness-Specific Bayes Correlated Wardrop Equilibrium (Extended Abstract)

InfoAT: Improving Adversarial Training Using the Information Bottleneck Principle

kDecay: Just adding k-decay items on Learning-Rate Schedule to improve Neural Networks

Leveraging Search History for Improving Person-Job Fit

Low Radioactive Material Screening and Background Control for the PandaX-4T Experiment

Modeling Two-Way Selection Preference for Person-Job Fit

Multi-layer VI-GNSS Global Positioning Framework with Numerical Solution aided MAP Initialization

Neutron-induced nuclear recoil background in the PandaX-4T experiment

Patient-Specific Game-Based Transfer Method for Parkinson&#39;s Disease Severity Prediction

RRL:Regional Rotation Layer in Convolutional Neural Networks

Scale-Invariant Adversarial Attack for Evaluating and Enhancing Adversarial Defenses

Self-Aware Personalized Federated Learning

STBPU: A Reasonably Secure Branch Prediction Unit

Study of background from accidental coincidence signals in the PandaX-II experiment

SuperMVS: Non-Uniform Cost Volume For High-Resolution Multi-View Stereo

Task Offloading with Multi-Tier Computing Resources in Next Generation Wireless Networks

The Inverse Problem of Linear-Quadratic Differential Games: When is a Control Strategies Profile Nash?

Unified products for Zinbiel 2-algebras

Correlated Data in Differential Privacy: Definition and Analysis

Crossed modules for Hom-Lie antialgebras

Dark Matter Search Results from the PandaX-4T Commissioning Run

Excited-state spectroscopy of spin defects in hexagonal boron nitride

Generative Partial Visual-Tactile Fused Object Clustering

Improving the Certified Robustness of Neural Networks via Consistency Regularization

Internal Calibration of the PandaX-II Detector with Radon Gaseous Sources

JUNO Physics and Detector

Light yield and field dependence measurement in PandaX-II dual-phase xenon detector

On the Equilibrium Elicitation of Markov Games Through Information Design

Results of Dark Matter Search using the Full PandaX-II Exposure

Towards Evaluating the Robustness of Deep Diagnostic Models by Adversarial Attack

Universal central extensions of Hom-Lie antialgebras

A Survey of Model Compression and Acceleration for Deep Neural Networks

Adaptive Trajectory Estimation with Power Limited Steering Model under Perturbation Compensation

An Analysis of Scatter Characteristics in X-ray CT Spectral Correction

Cable Loop Calibration System for Jiangmen Underground Neutrino Observatory

Channel Compression: Rethinking Information Redundancy among Channels in CNN Architecture

Color isomorphic even cycles and a related Ramsey problem

Deep Reinforcement Learning for Multi-objective Optimization

Differentially Private Collaborative Intrusion Detection Systems For VANETs

Patient-Specific Game-Based Transfer Method for Parkinson's Disease Severity Prediction

A Proof of Radford's Biproduct Theorem by Using Braided Diagrams