arXiv subjects

Jie Gao

Publications and source records attributed to Jie Gao.

At least 163 records · Page 9Linked to original sources

arXiv2022

Investigation of spin rotators in CEPC at the Z-pole

Longitudinal polarization is an important design aspect of the future 100 km-scale Circular Electron Position Collider (CEPC). Spin rotators are needed in CEPC collider rings to make the beam polarization along the longitudinal direction at the interaction points (IPs). This paper focuses on the design of spin rotators for CEPC at Z-pole (45.6 GeV). The design of spin rotators in CEPC at Z-pole is based on solenoid magnets and horizontal bending magnets sections. The coupling of transverse motion introduced by solenoids is compensated with quadrupole lenses. Adjustments have been made to the layout to implement the spin rotators into the collider rings.Longitudinal polarized beam can be achieved at the IPs with the spin rotators. High degree of polarization is attainable, while the effect of spin rotators on orbital motion is acceptable. The detailed simulation results will be presented.A solenoid-based spin rotator configuration is designed and integrated into the CEPC collider ring lattice. According to the simulation results, the polarization requirements can be satisfied.

physics.acc-ph↗

arXiv2022

Social Network Community Detection Based on Textual Content Similarity and Sentimental Tendency

Shared travel has gradually become one of the hot topics discussed on social networking platforms such as Micro Blog. In a timely manner, deeper network community detection on the evaluation content of shared travel in social networks can effectively conduct research and analysis on the public opinion orientation related to shared travel, which has great application prospects. The existing community detection algorithms generally measure the similarity of nodes in the network from the perspective of spatial distance. This paper proposes a Community detection algorithm based on Textual content Similarity and sentimental Tendency (CTST), considering the network structure and node attributes at the same time. The content similarity and sentimental tendency of network community users are taken as node attributes, and on this basis, an undirected weighted network is constructed for community detection. This paper conducts experiments with actual data and analyzes the experimental results. It is found that the modularity of the community detection results is high and the effect is good.

cs.SI↗

arXiv2022

Optimal Local Bayesian Differential Privacy over Markov Chains

In the literature of data privacy, differential privacy is the most popular model. An algorithm is differentially private if its outputs with and without any individual's data are indistinguishable. In this paper, we focus on data generated from a Markov chain and argue that Bayesian differential privacy (BDP) offers more meaningful guarantees in this context. Our main theoretical contribution is providing a mechanism for achieving BDP when data is drawn from a binary Markov chain. We improve on the state-of-the-art BDP mechanism and show that our mechanism provides the optimal noise-privacy tradeoffs for any local mechanism up to negligible factors. We also briefly discuss a non-local mechanism which adds correlated noise. Lastly, we perform experiments on synthetic data that detail when DP is insufficient, and experiments on real data to show that our privacy guarantees are robust to underlying distributions that are not simple Markov chains.

cs.CR↗

arXiv2022

CEPC Cost Model Study and Circumference Optimization

The CEPC is a proposed high luminosity Higgs/Z factory, with the potential to be upgraded to top factory at center-of-mass energy of 360GeV. We perform an optimization study on the circumference of CEPC. We calculate the instant luminosity, the construction and operation cost for different circumferences. With respect to the total cost and average cost per particle, we conclude that the optimal circumference for the CEPC Higgs operation is 80 km. Taking into account of the Z pole operation, the potential high-energy upgrade of CEPC (top factory), the optimal circumference increased to 100 km. The long future proton-proton upgrade of CEPC (SPPC) also favors a larger circumference, and we conclude that 100 km is the global optimized circumference for this facility.

physics.acc-ph↗

arXiv2022

Injection induced by coaxial laser interference in laser wakefield accelerators

A new injection scheme using the interference of two coaxial laser pulses is proposed for generating high quality beams in laser wakefield accelerators. In this scheme, a relatively loosely focused laser pulse drives the plasma wakefield, and a tightly focused laser pulse with similar intensity triggers interference ring pattern which creates onion-like multi sheaths in the plasma wakefield. Due to the wavefront curvature change after the focal position of the tightly focused laser, the innermost sheath of the wakefield expands, which slows down the effective phase velocity of the wakefield and triggers injection of plasma electrons. Particle-in-cell simulations show that high quality electron beams with low energy spread (a few per mill), high charge (hundred picocoulomb) and small emittance (sub millimeter milliradian) at the same time can be generated using moderate laser parameters for properly chosen phase differences between the two lasers.

physics.plasm-ph↗

arXiv2022

The Optimal Beam-loading in Two-bunch Nonlinear Plasma Wakefield Accelerators

Due to the highly nonlinear nature of the beam-loading, it is at present not possible to analytically determine the beam parameters needed in a two-bunch plasma wakefield accelerator for maintaining a low energy spread. Therefore in this paper, by using the Broyden-Fletcher-Goldfarb-Shanno algorithm for the parameter scanning with the code QuickPIC and the polynomial regression together with k-fold cross-validation method, we obtain two fitting formulas for calculating the parameters of tri-Gaussian electron beams when minimizing the energy spread based on the beam-loading effect in a nonlinear plasma wakefield accelerator. One formula allows the optimization of the normalized charge per unit length of a trailing beam to achieve the minimal energy spread, i.e. the optimal beam-loading. The other one directly gives the transformer ratio when the trailing beam achieves the optimal beam-loading. A simple scaling law for charges of drive beams and trailing beams is obtained from the fitting formula, which indicates that the optimal beam-loading is always achieved for a given charge ratio of the two beams when the length and separation of two beams and the plasma density are fixed. The formulas can also help obtain the optimal plasma densities for the maximum accelerated charge and the maximum acceleration efficiency under the optimal beam-loading respectively. These two fitting formulas will significantly enhance the efficiency for designing and optimizing a two-bunch plasma wakefield acceleration stage.

physics.plasm-ph↗

arXiv2022

Subspace Differential Privacy

Many data applications have certain invariant constraints due to practical needs. Data curators who employ differential privacy need to respect such constraints on the sanitized data product as a primary utility requirement. Invariants challenge the formulation, implementation, and interpretation of privacy guarantees. We propose subspace differential privacy, to honestly characterize the dependence of the sanitized output on confidential aspects of the data. We discuss two design frameworks that convert well-known differentially private mechanisms, such as the Gaussian and the Laplace mechanisms, to subspace differentially private ones that respect the invariants specified by the curator. For linear queries, we discuss the design of near-optimal mechanisms that minimize the mean squared error. Subspace differentially private mechanisms rid the need for post-processing due to invariants, preserve transparency and statistical intelligibility of the output, and can be suitable for distributed implementation. We showcase the proposed mechanisms on the 2020 Census Disclosure Avoidance demonstration data, and a spatio-temporal dataset of mobile access point connections on a large university campus.

cs.CR↗

arXiv2022

Time Window Frechet and Metric-Based Edit Distance for Passively Collected Trajectories

The advances of modern localization techniques and the wide spread of mobile devices have provided us great opportunities to collect and mine human mobility trajectories. In this work, we focus on passively collected trajectories, which are sequences of time-stamped locations that mobile entities visit. To analyse such trajectories, a crucial part is a measure of similarity between two trajectories. We propose the time-window Frechet distance, which enforces the maximum temporal separation between points of two trajectories that can be paired in the calculation of the Frechet distance, and the metric-based edit distance which incorporates the underlying metric in the computation of the insertion and deletion costs. Using these measures, we can cluster trajectories to infer group motion patterns. We look at the $k$-gather problem which requires each cluster to have at least $k$ trajectories. We prove that k-gather remains NP-hard under edit distance, metric-based edit distance and Jaccard distance. Finally, we improve over previous results on discrete Frechet distance and show that there is no strongly sub-quadratic time with approximation factor less than $1.61$ in two dimensional setting unless SETH fails.

cs.CG↗

arXiv2022

Study Overview for Super Proton-Proton Collider

SPPC (Super Proton-Proton Collider) is a discovery machine that is designed for energy frontier research in two decades from now, as the second stage of the CEPC-SPPC project. The main objective is to carry out experiments at 125 TeV in center-of-mass energy in a two-ring collider of 100 km in circumference and 20 T in dipole field. This white paper about SPPC describes the machine related issues, including performance, design overview, design challenges, key technologies and their maturity and required R&D, staged options and upgrades, synergies with other facilities, and environmental impacts.

hep-ex↗

arXiv2022

Logically at Factify 2022: Multimodal Fact Verification

This paper describes our participant system for the multi-modal fact verification (Factify) challenge at AAAI 2022. Despite the recent advance in text based verification techniques and large pre-trained multimodal models cross vision and language, very limited work has been done in applying multimodal techniques to automate fact checking process, particularly considering the increasing prevalence of claims and fake news about images and videos on social media. In our work, the challenge is treated as multimodal entailment task and framed as multi-class classification. Two baseline approaches are proposed and explored including an ensemble model (combining two uni-modal models) and a multi-modal attention network (modeling the interaction between image and text pair from claim and evidence document). We conduct several experiments investigating and benchmarking different SoTA pre-trained transformers and vision models in this work. Our best model is ranked first in leaderboard which obtains a weighted average F-measure of 0.77 on both validation and test set. Exploratory analysis of dataset is also carried out on the Factify data set and uncovers salient patterns and issues (e.g., word overlapping, visual entailment correlation, source bias) that motivates our hypothesis. Finally, we highlight challenges of the task and multimodal dataset for future research.

cs.CV↗

arXiv2022

On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem

We consider the following surveillance problem: Given a set $P$ of $n$ sites in a metric space and a set of $k$ robots with the same maximum speed, compute a patrol schedule of minimum latency for the robots. Here a patrol schedule specifies for each robot an infinite sequence of sites to visit (in the given order) and the latency $L$ of a schedule is the maximum latency of any site, where the latency of a site $s$ is the supremum of the lengths of the time intervals between consecutive visits to $s$. When $k=1$ the problem is equivalent to the travelling salesman problem (TSP) and thus it is NP-hard. We have two main results. We consider cyclic solutions in which the set of sites must be partitioned into $\ell$ groups, for some~$\ell \leq k$, and each group is assigned a subset of the robots that move along the travelling salesman tour of the group at equal distance from each other. Our first main result is that approximating the optimal latency of the class of cyclic solutions can be reduced to approximating the optimal travelling salesman tour on some input, with only a $1+\varepsilon$ factor loss in the approximation factor and an $O\left(\left( k/\varepsilon \right)^k\right)$ factor loss in the runtime, for any $\varepsilon >0$. Our second main result shows that an optimal cyclic solution is a $2(1-1/k)$-approximation of the overall optimal solution. Note that for $k=2$ this implies that an optimal cyclic solution is optimal overall. The results have a number of consequences. For the Euclidean version of the problem, for instance, combining our results with known results on Euclidean TSP, yields a PTAS for approximating an optimal cyclic solution, and it yields a $(2(1-1/k)+\varepsilon)$-approximation of the optimal unrestricted solution. If the conjecture mentioned above is true, then our algorithm is actually a PTAS for the general problem in the Euclidean setting.

cs.CG↗

arXiv2022

Obtaining Approximately Optimal and Diverse Solutions via Dispersion

There has been a long-standing interest in computing diverse solutions to optimization problems. Motivated by reallocation of governmental institutions in Sweden, in 1995 J. Krarup posed the problem of finding $k$ edge-disjoint Hamiltonian Circuits of minimum total weight, called the peripatetic salesman problem (PSP). Since then researchers have investigated the complexity of finding diverse solutions to spanning trees, paths, vertex covers, matchings, and more. Unlike the PSP that has a constraint on the total weight of the solutions, recent work has involved finding diverse solutions that are all optimal. However, sometimes the space of exact solutions may be too small to achieve sufficient diversity. Motivated by this, we initiate the study of obtaining sufficiently-diverse, yet approximately-optimal solutions to optimization problems. Formally, given an integer $k$, an approximation factor $c$, and an instance $I$ of an optimization problem, we aim to obtain a set of $k$ solutions to $I$ that a) are all $c$ approximately-optimal for $I$ and b) maximize the diversity of the $k$ solutions. Finding such solutions, therefore, requires a better understanding of the global landscape of the optimization function. We show that, given any metric on the space of solutions, and the diversity measure as the sum of pairwise distances between solutions, this problem can be solved by combining ideas from dispersion and multicriteria optimization. We first provide a general reduction to an associated budget-constrained optimization (BCO) problem, where one objective function is to be maximized (minimized) subject to a bound on the second objective function. We then prove that bi-approximations to the BCO can be used to give bi-approximations to the diverse approximately optimal solutions problem with a little overhead.

cs.DS↗

arXiv2022

From 996 to 007: Challenges of Working from Home During the Epidemic in China

During the COVID-19 epidemic in China, millions of workers in tech companies had to start working from home (WFH). The change was sudden, unexpected and companies were not ready for it. Additionally, it was also the first time that WFH was experienced on such a large scale. We used the opportunity to describe the effect of WFH at scale for a sustained period of time. As the lockdown was easing, we conducted semi-structured interviews with 12 participants from China working in tech companies. While at first, WFH was reported as a pleasant experience with advantages, e.g. flexible schedule, more time with family, over time, this evolved into a rather negative experience where workers start working all day, every day and feel a higher workload despite the actual workload being reduced. We discuss these results and how they could apply for other extreme circumstances and to help improve WFH in general.

cs.CY↗

arXiv2021

Redefining the Quantum Supremacy Baseline With a New Generation Sunway Supercomputer

A major milestone in the era of noisy intermediate scale quantum computers is \textit{quantum supremacy} [Nature \textbf{574}, 505 (2019)] claimed on the Sycamore quantum processor of $53$ qubits, which can perform a random circuit sampling task within $200$ seconds while the same task is estimated to require a runtime of $10,000$ years on Summit. This record has been renewed with two recent experiments on the Zuchongzhi $2.0$ ($56$ qubits) and Zuchongzhi $2.1$ ($60$ qubits) quantum processors. On the other front of quantum supremacy comparison, there has also been continuous improvements on both the classical simulation algorithm as well as the underlying hardware. And a fair justification of the computational advantages for those quantum supremacy experiments would require to practically simulate the same problems on current top supercomputers, which is still in lack. Here we report the full-scale simulations of these problems on new generation Sunway supercomputer, based on a customized tensor network contraction algorithm. Our benchmark shows that the most challenging sampling task performed on Sycamore can be accomplished within $1$ week, thus collapsing the quantum supremacy claim of Sycamore. Additionally, we show that the XEB fidelities of the \textit{quantum supremacy circuits} with up to $14$ cycles can be verified in minutes, which also provides strong consistency check for quantum supremacy experiments. Our results redefine quantum supremacy baseline using the new generation Sunway supercomputer.

quant-ph↗

arXiv2021

Co-evolution of Opinion and Social Tie Dynamics Towards Structural Balance

In this paper, we propose co-evolution models for both dynamics of opinions (people's view on a particular topic) and dynamics of social appraisals (the approval or disapproval towards each other). Opinion dynamics and dynamics of signed networks, respectively, have been extensively studied. We propose a co-evolution model, where each vertex $i$ in the network has a current opinion vector $v_i$ and each edge $(i,j)$ has a weight $w_{ij}$ that models the relationship between $i,j$. The system evolves as the opinions and edge weights are updated over time by the following rules, Opinion Dynamics and Appraisal Dynamics. We are interested in characterizing the long-time behavior of the dynamic model -- i.e., whether edge weights evolve to have stable signs (positive or negative) and structural balance (the multiplication of weights on any triangle is non-negative). Our main theoretical result solves the above dynamic system with time-evolving opinions $V(t)=[v1(t),\cdots,vn(t)]$ and social tie weights $W(t)=[w_{ij}(t)]_{n\times n}$. For a generic initial opinion vector $V(0)$ and weight matrix $W(0)$, one of the two phenomena must occur at the limit. The first one is that both sign stability and structural balance (for any triangle with individual $i,j,k$, $w_{ij}w_{jk}w_{ki}\geq0$) occur. In the special case that $V(0)$ is an eigenvector of $W(0)$, we are able to obtain the explicit solution to the co-evolution equation and give exact estimates on the blowup time and rate convergence. The second one is that all the opinions converge to $0$, i.e., $\lim_{t\rightarrow \infty}|V(t)|=0$.

cs.SI↗

arXiv2021

Scissor-cross ionization injection in laser wakefield accelerators

We propose to use a frequency doubled pulse colliding with the driving pulse at an acute angle to trigger ionization injection in a laser wakefield accelerator. This scheme effectively reduces the duration that injection occurs, thus high injection quality is obtained. Three-dimensional particle-in-cell simulations show that electron beams with energy of ~500 MeV, charge of ~40 pC, energy spread of ~1% and normalized emittance of a few millimeter milliradian can be produced by ~100 TW laser pulses. By adjusting the angle between the two pulses, the intensity of the trigger pulse and the gas dope ratio, the charge and energy spread of the electron beam can be controlled.

physics.acc-ph↗

arXiv2021

Enhancing Knowledge Tracing via Adversarial Training

We study the problem of knowledge tracing (KT) where the goal is to trace the students' knowledge mastery over time so as to make predictions on their future performance. Owing to the good representation capacity of deep neural networks (DNNs), recent advances on KT have increasingly concentrated on exploring DNNs to improve the performance of KT. However, we empirically reveal that the DNNs based KT models may run the risk of overfitting, especially on small datasets, leading to limited generalization. In this paper, by leveraging the current advances in adversarial training (AT), we propose an efficient AT based KT method (ATKT) to enhance KT model's generalization and thus push the limit of KT. Specifically, we first construct adversarial perturbations and add them on the original interaction embeddings as adversarial examples. The original and adversarial examples are further used to jointly train the KT model, forcing it is not only to be robust to the adversarial examples, but also to enhance the generalization over the original ones. To better implement AT, we then present an efficient attentive-LSTM model as KT backbone, where the key is a proposed knowledge hidden state attention module that adaptively aggregates information from previous knowledge hidden states while simultaneously highlighting the importance of current knowledge hidden state to make a more accurate prediction. Extensive experiments on four public benchmark datasets demonstrate that our ATKT achieves new state-of-the-art performance. Code is available at: \color{blue} {\url{https://github.com/xiaopengguo/ATKT}}.

cs.CY↗

arXiv2021

Physics-informed generative neural network: an application to troposphere temperature prediction

The troposphere is one of the atmospheric layers where most weather phenomena occur. Temperature variations in the troposphere, especially at 500 hPa, a typical level of the middle troposphere, are significant indicators of future weather changes. Numerical weather prediction is effective for temperature prediction, but its computational complexity hinders a timely response. This paper proposes a novel temperature prediction approach in framework ofphysics-informed deep learning. The new model, called PGnet, builds upon a generative neural network with a mask matrix. The mask is designed to distinguish the low-quality predicted regions generated by the first physical stage. The generative neural network takes the mask as prior for the second-stage refined predictions. A mask-loss and a jump pattern strategy are developed to train the generative neural network without accumulating errors during making time-series predictions. Experiments on ERA5 demonstrate that PGnet can generate more refined temperature predictions than the state-of-the-art.

cs.LG↗