arXiv subjects

Chao Li

Publications and source records attributed to Chao Li.

At least 577 records · Page 32Linked to original sources

arXiv2016

New Permutation Trinomials Constructed from Fractional Polynomials

Permutation trinomials over finite fields consititute an active research due to their simple algebraic form, additional extraordinary properties and their wide applications in many areas of science and engineering. In the present paper, six new classes of permutation trinomials over finite fields of even characteristic are constructed from six fractional polynomials. Further, three classes of permutation trinomials over finite fields of characteristic three are raised. Distinct from most of the known permutation trinomials which are with fixed exponents, our results are some general classes of permutation trinomials with one parameter in the exponents. Finally, we propose a few conjectures.

cs.IT↗

arXiv2016

Level raising mod 2 and arbitrary 2-Selmer ranks

We prove a level raising mod $\ell=2$ theorem for elliptic curves over $\mathbb{Q}$. It generalizes theorems of Ribet and Diamond-Taylor and also explains different sign phenomena compared to odd $\ell$. We use it to study the 2-Selmer groups of modular abelian varieties with common mod 2 Galois representation. As an application, we show that the 2-Selmer rank can be arbitrary in level raising families.

math.NT↗

arXiv2016

Suppression of Space Charge Induced Beam Halo in Nonlinear Focusing Channel

An intense non-uniform particle beam exhibits strong emittance growth and halo formation in focusing channels due to nonlinear space charge forces of the beam. This phenomenon limits beam brightness and results in particle losses. The problem is connected with irreversible distortion of phase space volume of the beam in conventional focusing structures due to filamentation in phase space. Emittance growth is accompanied by halo formation in real space, which results in inevitable particle losses. A new approach for solving a self-consistent problem for a matched non-uniform beam in two-dimensional geometry is discussed. The resulting solution is applied to the problem of beam transport, while avoiding emittance growth and halo formation by the use of nonlinear focusing field. Conservation of a beam distribution function is demonstrated analytically and by particle-in-cell simulation for a beam with a realistic beam distribution.

physics.acc-ph↗

arXiv2015

Canonical Polyadic Decomposition with Auxiliary Information for Brain Computer Interface

Physiological signals are often organized in the form of multiple dimensions (e.g., channel, time, task, and 3D voxel), so it is better to preserve original organization structure when processing. Unlike vector-based methods that destroy data structure, Canonical Polyadic Decomposition (CPD) aims to process physiological signals in the form of multi-way array, which considers relationships between dimensions and preserves structure information contained by the physiological signal. Nowadays, CPD is utilized as an unsupervised method for feature extraction in a classification problem. After that, a classifier, such as support vector machine, is required to classify those features. In this manner, classification task is achieved in two isolated steps. We proposed supervised Canonical Polyadic Decomposition by directly incorporating auxiliary label information during decomposition, by which a classification task can be achieved without an extra step of classifier training. The proposed method merges the decomposition and classifier learning together, so it reduces procedure of classification task compared with that of respective decomposition and classification. In order to evaluate the performance of the proposed method, three different kinds of signals, synthetic signal, EEG signal, and MEG signal, were used. The results based on evaluations of synthetic and real signals demonstrated that the proposed method is effective and efficient.

cs.CV↗

arXiv2015

Neutrino Physics with JUNO

The Jiangmen Underground Neutrino Observatory (JUNO), a 20 kton multi-purpose underground liquid scintillator detector, was proposed with the determination of the neutrino mass hierarchy as a primary physics goal. It is also capable of observing neutrinos from terrestrial and extra-terrestrial sources, including supernova burst neutrinos, diffuse supernova neutrino background, geoneutrinos, atmospheric neutrinos, solar neutrinos, as well as exotic searches such as nucleon decays, dark matter, sterile neutrinos, etc. We present the physics motivations and the anticipated performance of the JUNO detector for various proposed measurements. By detecting reactor antineutrinos from two power plants at 53-km distance, JUNO will determine the neutrino mass hierarchy at a 3-4 sigma significance with six years of running. The measurement of antineutrino spectrum will also lead to the precise determination of three out of the six oscillation parameters to an accuracy of better than 1\%. Neutrino burst from a typical core-collapse supernova at 10 kpc would lead to ~5000 inverse-beta-decay events and ~2000 all-flavor neutrino-proton elastic scattering events in JUNO. Detection of DSNB would provide valuable information on the cosmic star-formation rate and the average core-collapsed neutrino energy spectrum. Geo-neutrinos can be detected in JUNO with a rate of ~400 events per year, significantly improving the statistics of existing geoneutrino samples. The JUNO detector is sensitive to several exotic searches, e.g. proton decay via the $p\to K^++\barν$ decay channel. The JUNO detector will provide a unique facility to address many outstanding crucial questions in particle and astrophysics. It holds the great potential for further advancing our quest to understanding the fundamental properties of neutrinos, one of the building blocks of our Universe.

physics.ins-det↗

arXiv2015

A universal expression of near-filed/far-field boundary in stratified structures

The division of the near-field and far-field zones for electromagnetic waves is important for simplifying theoretical calculations and applying far-field results. In this paper, we have studied the far-field asymptotic behaviors of dipole radiations in stratified backgrounds and obtained a universal empirical expression of near-field/far-field (NFFF) boundary. The boundary is mainly affected by lateral waves, which corresponds to branch point contributions in Sommerfeld integrals. In a semispace with a higher refractive index, the NFFF boundary is determined by a dimensional parameter and usually larger than the operating wavelength by at least two orders of magnitude. In a semispace with the lowest refractive index in the structure (usually air), the NFFF boundary is about ten wavelengths. Moreover, different treatments in the asymptotic method are discussed and numerically compared. An equivalence between the field expressions obtained from the asymptotic method and those from reciprocal theorem is demonstrated. Our determination of the NFFF boundary will be useful in the fields such as antenna design, remote sensing, and underwater communication.

physics.optics↗

arXiv2014

A Data- and Workload-Aware Algorithm for Range Queries Under Differential Privacy

We describe a new algorithm for answering a given set of range queries under $ε$-differential privacy which often achieves substantially lower error than competing methods. Our algorithm satisfies differential privacy by adding noise that is adapted to the input data and to the given query set. We first privately learn a partitioning of the domain into buckets that suit the input data well. Then we privately estimate counts for each bucket, doing so in a manner well-suited for the given query set. Since the performance of the algorithm depends on the input database, we evaluate it on a wide range of real datasets, showing that we can achieve the benefits of data-dependence on both "easy" and "hard" databases.

cs.DB↗

arXiv2014

Multi-tensor Completion for Estimating Missing Values in Video Data

Many tensor-based data completion methods aim to solve image and video in-painting problems. But, all methods were only developed for a single dataset. In most of real applications, we can usually obtain more than one dataset to reflect one phenomenon, and all the datasets are mutually related in some sense. Thus one question raised whether such the relationship can improve the performance of data completion or not? In the paper, we proposed a novel and efficient method by exploiting the relationship among datasets for multi-video data completion. Numerical results show that the proposed method significantly improve the performance of video in-painting, particularly in the case of very high missing percentage.

cs.CV↗

arXiv2014

More Constructions of Differentially 4-uniform Permutations on $\gf_{2^{2k}}$

Differentially 4-uniform permutations on $\gf_{2^{2k}}$ with high nonlinearity are often chosen as Substitution boxes in both block and stream ciphers. Recently, Qu et al. introduced a class of functions, which are called preferred functions, to construct a lot of infinite families of such permutations \cite{QTTL}. In this paper, we propose a particular type of Boolean functions to characterize the preferred functions. On the one hand, such Boolean functions can be determined by solving linear equations, and they give rise to a huge number of differentially 4-uniform permutations over $\gf_{2^{2k}}$. Hence they may provide more choices for the design of Substitution boxes. On the other hand, by investigating the number of these Boolean functions, we show that the number of CCZ-inequivalent differentially 4-uniform permutations over $\gf_{2^{2k}}$ grows exponentially when $k$ increases, which gives a positive answer to an open problem proposed in \cite{QTTL}.

cs.IT↗

arXiv2014

Predictability of road traffic and congestion in urban areas

Mitigating traffic congestion on urban roads, with paramount importance in urban development and reduction of energy consumption and air pollution, depends on our ability to foresee road usage and traffic conditions pertaining to the collective behavior of drivers, raising a significant question: to what degree is road traffic predictable in urban areas? Here we rely on the precise records of daily vehicle mobility based on GPS positioning device installed in taxis to uncover the potential daily predictability of urban traffic patterns. Using the mapping from the degree of congestion on roads into a time series of symbols and measuring its entropy, we find a relatively high daily predictability of traffic conditions despite the absence of any a priori knowledge of drivers' origins and destinations and quite different travel patterns between weekdays and weekends. Moreover, we find a counterintuitive dependence of the predictability on travel speed: the road segment associated with intermediate average travel speed is most difficult to be predicted. We also explore the possibility of recovering the traffic condition of an inaccessible segment from its adjacent segments with respect to limited observability. The highly predictable traffic patterns in spite of the heterogeneity of drivers' behaviors and the variability of their origins and destinations enables development of accurate predictive models for eventually devising practical strategies to mitigate urban road congestion.

physics.soc-ph↗

arXiv2014

Temporal scaling in information propagation

For the study of information propagation, one fundamental problem is uncovering universal laws governing the dynamics of information propagation. This problem, from the microscopic perspective, is formulated as estimating the propagation probability that a piece of information propagates from one individual to another. Such a propagation probability generally depends on two major classes of factors: the intrinsic attractiveness of information and the interactions between individuals. Despite the fact that the temporal effect of attractiveness is widely studied, temporal laws underlying individual interactions remain unclear, causing inaccurate prediction of information propagation on evolving social networks. In this report, we empirically study the dynamics of information propagation, using the dataset from a population-scale social media website. We discover a temporal scaling in information propagation: the probability a message propagates between two individuals decays with the length of time latency since their latest interaction, obeying a power-law rule. Leveraging the scaling law, we further propose a temporal model to estimate future propagation probabilities between individuals, reducing the error rate of information propagation prediction from 6.7% to 2.6% and improving viral marketing with 9.7% incremental customers.

cs.SI↗

arXiv2013

A New Method to Compute the 2-adic Complexity of Binary Sequences

In this paper, a new method is presented to compute the 2-adic complexity of pseudo-random sequences. With this method, the 2-adic complexities of all the known sequences with ideal 2-level autocorrelation are uniformly determined. Results show that their 2-adic complexities equal their periods. In other words, their 2-adic complexities attain the maximum. Moreover, 2-adic complexities of two classes of optimal autocorrelation sequences with period $N\equiv1\mod4$, namely Legendre sequences and Ding-Helleseth-Lam sequences, are investigated. Besides, this method also can be used to compute the linear complexity of binary sequences regarded as sequences over other finite fields.

cs.CR↗

arXiv2013

The overlap of neural selectivity between faces and words: evidences from the N170 adaptation effect

Faces and words both evoke an N170, a strong electrophysiological response that is often used as a marker for the early stages of expert pattern perception. We examine the relationship of neural selectivity between faces and words by using a novel application of cross-category adaptation to the N170. We report a strong asymmetry between N170 adaptation induced by faces and by words. This is the first electrophysiological result showing that neural selectivity to faces encompasses neural selectivity to words, and suggests that the N170 response to faces constitutes a neural marker for versatile representations of familiar visual patterns.

q-bio.NC↗

arXiv2012

Optimal error of query sets under the differentially-private matrix mechanism

A common goal of privacy research is to release synthetic data that satisfies a formal privacy guarantee and can be used by an analyst in place of the original data. To achieve reasonable accuracy, a synthetic data set must be tuned to support a specified set of queries accurately, sacrificing fidelity for other queries. This work considers methods for producing synthetic data under differential privacy and investigates what makes a set of queries "easy" or "hard" to answer. We consider answering sets of linear counting queries using the matrix mechanism, a recent differentially-private mechanism that can reduce error by adding complex correlated noise adapted to a specified workload. Our main result is a novel lower bound on the minimum total error required to simultaneously release answers to a set of workload queries. The bound reveals that the hardness of a query workload is related to the spectral properties of the workload when it is represented in matrix form. The bound is most informative for $(ε,δ)$-differential privacy but also applies to $ε$-differential privacy.

cs.DB↗

arXiv2012

A Theory of Pricing Private Data

Personal data has value to both its owner and to institutions who would like to analyze it. Privacy mechanisms protect the owner's data while releasing to analysts noisy versions of aggregate query results. But such strict protections of individual's data have not yet found wide use in practice. Instead, Internet companies, for example, commonly provide free services in return for valuable sensitive information from users, which they exploit and sometimes sell to third parties. As the awareness of the value of the personal data increases, so has the drive to compensate the end user for her private information. The idea of monetizing private data can improve over the narrower view of hiding private data, since it empowers individuals to control their data through financial means. In this paper we propose a theoretical framework for assigning prices to noisy query answers, as a function of their accuracy, and for dividing the price amongst data owners who deserve compensation for their loss of privacy. Our framework adopts and extends key principles from both differential privacy and query pricing in data markets. We identify essential properties of the price function and micro-payments, and characterize valid solutions.

cs.CR↗

arXiv2012

A comparison of 3D particle, fluid and hybrid simulations for negative streamers

In the high field region at the head of a discharge streamer, the electron energy distribution develops a long tail. In negative streamers, these electrons can run away and contribute to energetic processes such as terrestrial gamma-ray and electron flashes. Moreover, electron density fluctuations can accelerate streamer branching. To track energies and locations of single electrons in relevant regions, we have developed a 3D hybrid model that couples a particle model in the region of high fields and low electron densities with a fluid model in the rest of the domain. Here we validate our 3D hybrid model on a 3D (super-)particle model for negative streamers in overvolted gaps, and we show that it almost reaches the computational efficiency of a 3D fluid model. We also show that the extended fluid model approximates the particle and the hybrid model well until stochastic fluctuations become important, while the classical fluid model underestimates velocities and ionization densities. We compare density fluctuations and the onset of branching between the models, and we compare the front velocities with an analytical approximation.

physics.plasm-ph↗

arXiv2012

Operator entanglement of two-qubit joint unitary operations revisited: Schmidt number approach

Operator entanglement of two-qubit joint unitary operations is revisited. Schmidt number is an important attribute of a two-qubit unitary operation, and may have connection with the entanglement measure of the unitary operator. We found the entanglement measure of two-qubit unitary operators is classified by the Schmidt number of the unitary operators. The exact relation between the operator entanglement and the parameters of the unitary operator is clarified too.

quant-ph↗

arXiv2012

Nonlocality Distillation for High-Dimensional System

The intriguing and powerful capability of nonlocality in communication field ignites the research of the nonlocality distillation. The first protocol presented in Ref[Phys. Rev. Lett. 102, 120401] shows that the nonlocality of bipartite binary-input and binary-output nonsignaling correlated boxes could be amplified by 'wiring' two copies of weaker-nonlocality boxes. Several optimized distillation protocols were presented later for bipartite binary-input and binary-output nonsignaling correlated boxes. In this paper, we focus on the bipartite binary-input and multi-nary-output nonsignaling correlated boxes---high-dimensional boxes, and design comparators-based protocols to achieve the distillation of high-dimensional nonlocality. The results show that the high-dimensional nonlocality can be distilled in different ways, and we find that the efficiencies of the protocols are influenced not only by the wirings but also by the classes the initial nonlocality boxes belongs to. Here, the initial nonlcalities may have the same violation of the high-dimensional Bell-type inequality, but they can fall into different classes, which shows that the value of the violation of the high-dimensional Bell-type inequality is not the only representation of nonlocality, and the combination manner(classes) in the expression of the correlated boxes is another important nonlocal representation too. The current protocols are compatible with the previous two-dimensional nonlocality distillation protocols, but our protocols are more powerful and universal than previous ones in the sense that the current protocols can be applied to the system with any dimension rather than the only two-dimension system in the previous protocols.

quant-ph↗