Search arXiv⌕ Search

arXiv subjects

Tao Zhang

Publications and source records attributed to Tao Zhang.

At least 649 records · Page 36Linked to original sources

ROSF: Leveraging Information Retrieval and Supervised Learning for Recommending Code Snippets

When implementing unfamiliar programming tasks, developers commonly search code examples and learn usage patterns of APIs from the code examples or reuse them by copy-pasting and modifying. For providing high-quality code examples, previous studies present several methods to recommend code snippets mainly based on information retrieval. In this paper, to provide better recommendation results, we propose ROSF, Recommending cOde Snippets with multi-aspect Features, a novel method combining both information retrieval and supervised learning. In our method, we recommend Top-Kcode snippets for a givenfree-form query based on two stages, i.e., coarse-grained searching and fine-grained re-ranking. First, we generate a code snippet candidate set by searching a code snippet corpus using an information retrieval method. Second, we predict probability values of the code snippets for different relevance scores in the candidate set by the learned prediction model from a training set, re-rank these candidate code snippets according to the probability values, and recommend the final results to developers. We conduct several experiments to evaluate our method in a large-scale corpus containing 921,713 real-world code snippets. The results show that ROSF is an effective method for code snippets recommendation and outperforms the-state-of-the-art methods by 20%-41% in Precision and 13%-33% in NDCG

cs.SE↗

Spin-Dependent Weakly-Interacting-Massive-Particle--Nucleon Cross Section Limits from First Data of PandaX-II Experiment

New constraints are presented on the spin-dependent WIMP-nucleon interaction from the PandaX-II experiment, using a data set corresponding to a total exposure of 3.3$\times10^4$ kg-days. Assuming a standard axial-vector spin-dependent WIMP interaction with $^{129}$Xe and $^{131}$Xe nuclei, the most stringent upper limits on WIMP-neutron cross sections for WIMPs with masses above 10 GeV/c$^{2}$ are set in all dark matter direct detection experiments. The minimum upper limit of $4.1\times 10^{-41}$ cm$^2$ at 90\% confidence level is obtained for a WIMP mass of 40 GeV/c$^{2}$. This represents more than a factor of two improvement on the best available limits at this and higher masses. These improved cross-section limits provide more stringent constraints on the effective WIMP-proton and WIMP-neutron couplings.

hep-ex↗

PandaX-III: Searching for Neutrinoless Double Beta Decay with High Pressure $^{136}$Xe Gas Time Projection Chambers

Searching for the Neutrinoless Double Beta Decay (NLDBD) is now regarded as the topmost promising technique to explore the nature of neutrinos after the discovery of neutrino masses in oscillation experiments. PandaX-III (Particle And Astrophysical Xenon Experiment III) will search for the NLDBD of $^{136}$Xe at the China Jin Ping underground Laboratory (CJPL). In the first phase of the experiment, a high pressure gas Time Projection Chamber (TPC) will contain 200 kg, 90% $^{136}$Xe enriched gas operated at 10 bar. Fine pitch micro-pattern gas detector (Microbulk Micromegas) will be used at both ends of the TPC for the charge readout with a cathode in the middle. Charge signals can be used to reconstruct tracks of NLDBD events and provide good energy and spatial resolution. The detector will be immersed in a large water tank to ensure $\sim$5 m of water shielding in all directions. The second phase, a ton-scale experiment, will consist of five TPCs in the same water tank, with improved energy resolution and better control over backgrounds.

physics.ins-det↗

Maximum Distance Separable Codes for $b$-Symbol Read Channels

Recently, Yaakobi et al. introduced codes for $b$-symbol read channels, where the read operation is performed as a consecutive sequence of $b>2$ symbols. In this paper, we establish a Singleton-type bound on $b$-symbol codes. Codes meeting the Singleton-type bound are called maximum distance separable (MDS) codes, and they are optimal in the sense they attain the maximal minimum $b$-distance. Based on projective geometry and constacyclic codes, we construct new families of linear MDS $b$-symbol codes over finite fields. And in some sense, we completely determine the existence of linear MDS $b$-symbol codes over finite fields for certain parameters.

cs.IT↗

Low Background Stainless Steel for the Pressure Vessel in the PandaX-II Dark Matter Experiment

We report on the custom produced low radiation background stainless steel and the welding rod for the PandaX experiment, one of the deep underground experiments to search for dark matter and neutrinoless double beta decay using xenon. The anthropogenic 60 Co concentration in these samples is at the range of 1 mBq/kg or lower. We also discuss the radioactivity of nuclear-grade stainless steel from TISCO which has a similar background rate. The PandaX-II pressure vessel was thus fabricated using the stainless steel from CISRI and TISCO. Based on the analysis of the radioactivity data, we also made discussions on potential candidate for low background metal materials for future pressure vessel development.

physics.ins-det↗

Material Screening with HPGe Counting Station for PandaX Experiment

A gamma counting station based on high-purity germanium (HPGe) detector was set up for the material screening of the PandaX dark matter experiments in the China Jinping Underground Laboratory. Low background gamma rate of 2.6 counts/min within the energy range of 20 to 2700 keV is achieved due to the well-designed passive shield. The sentivities of the HPGe detetector reach mBq/kg level for isotopes like K, U, Th, and even better for Co and Cs, resulted from the low-background rate and the high relative detection efficiency of 175%. The structure and performance of the counting station are described in this article. Detailed counting results for the radioactivity in materials used by the PandaX dark-matter experiment are presented. The upgrading plan of the counting station is also discussed.

physics.ins-det↗

Dark Matter Results from First 98.7-day Data of PandaX-II Experiment

We report the WIMP dark matter search results using the first physics-run data of the PandaX-II 500 kg liquid xenon dual-phase time-projection chamber, operating at the China JinPing Underground Laboratory. No dark matter candidate is identified above background. In combination with the data set during the commissioning run, with a total exposure of 3.3$\times10^4$ kg-day,the most stringent limit to the spin-independent interaction between the ordinary and WIMP dark matter is set for a range of dark matter mass between 3.5 and 1000 GeV/c$^2$. The best upper limit on the scattering cross section is found $2.5\times 10^{-46}$ cm$^2$ for the WIMP mass 40 GeV/c$^2$ at 90% confidence level.

hep-ex↗

Bootstrapping Face Detection with Hard Negative Examples

Recently significant performance improvement in face detection was made possible by deeply trained convolutional networks. In this report, a novel approach for training state-of-the-art face detector is described. The key is to exploit the idea of hard negative mining and iteratively update the Faster R-CNN based face detector with the hard negatives harvested from a large set of background examples. We demonstrate that our face detector outperforms state-of-the-art detectors on the FDDB dataset, which is the de facto standard for evaluating face detection algorithms.

cs.CV↗

Simulating user learning in authoritative technology adoption: An agent based model for council-led smart meter deployment planning in the UK

How do technology users effectively transit from having zero knowledge about a technology to making the best use of it after an authoritative technology adoption? This post-adoption user learning has received little research attention in technology management literature. In this paper we investigate user learning in authoritative technology adoption by developing an agent-based model using the case of council-led smart meter deployment in the UK City of Leeds. Energy consumers gain experience of using smart meters based on the learning curve in behavioural learning. With the agent-based model we carry out experiments to validate the model and test different energy interventions that local authorities can use to facilitate energy consumers' learning and maintain their continuous use of the technology. Our results show that the easier energy consumers become experienced, the more energy-efficient they are and the more energy saving they can achieve; encouraging energy consumers' contacts via various informational means can facilitate their learning; and developing and maintaining their positive attitude toward smart metering can enable them to use the technology continuously. Contributions and energy policy/intervention implications are discussed in this paper.

cs.AI↗

Modelling Office Energy Consumption: An Agent Based Approach

In this paper, we develop an agent-based model which integrates four important elements, i.e. organisational energy management policies/regulations, energy management technologies, electric appliances and equipment, and human behaviour, based on a case study, to simulate the energy consumption in office buildings. With the model, we test the effectiveness of different energy management strategies, and solve practical office energy consumption problems. This paper theoretically contributes to an integration of four elements involved in the complex organisational issue of office energy consumption, and practically contributes to an application of agent-based approach for office building energy consumption study.

cs.AI↗

Some new results on permutation polynomials over finite fields

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of trinomial complete permutation polynomials are presented, one of which confirms a conjecture proposed by Wu et al. (Sci. China Math., to appear. Doi: 10.1007/s11425-014-4964-2). Furthermore, we give two classes of trinomial permutation polynomials, and make some progress on a conjecture about the differential uniformity of power permutation polynomials proposed by Blondeau et al. (Int. J. Inf. Coding Theory, 2010, 1, pp. 149-170).

cs.IT↗

New Constructions of MDS Symbol-Pair Codes

Motivated by the application of high-density data storage technologies, symbol-pair codes are proposed to protect against pair-errors in symbol-pair channels, whose outputs are overlapping pairs of symbols. The research of symbol-pair codes with the largest minimum pair-distance is interesting since such codes have the best possible error-correcting capability. A symbol-pair code attaining the maximal minimum pair-distance is called a maximum distance separable (MDS) symbol-pair code. In this paper, we focus on constructing linear MDS symbol-pair codes over the finite field $\mathbb{F}_{q}$. We show that a linear MDS symbol-pair code over $\mathbb{F}_{q}$ with pair-distance $5$ exists if and only if the length $n$ ranges from $5$ to $q^2+q+1$. As for codes with pair-distance $6$, length ranging from $6$ to $q^{2}+1$, we construct linear MDS symbol-pair codes by using a configuration called ovoid in projective geometry. With the help of elliptic curves, we present a construction of linear MDS symbol-pair codes for any pair-distance $d+2$ with length $n$ satisfying $7\le d+2\leq n\le q+\lfloor 2\sqrt{q}\rfloor+δ(q)-3$, where $δ(q)=0$ or $1$.

cs.IT↗

Dark Matter Search Results from the Commissioning Run of PandaX-II

We present the results of a search for WIMPs from the commissioning run of the PandaX-II experiment located at the China Jinping underground Laboratory. A WIMP search data set with an exposure of 306$\times$19.1 kg-day was taken, while its dominant $^{85}$Kr background was used as the electron recoil calibration. No WIMP candidates are identified, and a 90\% upper limit is set on the spin-independent elastic WIMP-nucleon cross section with a lowest excluded cross section of 2.97$\times$10$^{-45}$~cm$^2$ at a WIMP mass of 44.7~GeV/c$^2$.

hep-ex↗

Dynamic Privacy For Distributed Machine Learning Over Network

Privacy-preserving distributed machine learning becomes increasingly important due to the recent rapid growth of data. This paper focuses on a class of regularized empirical risk minimization (ERM) machine learning problems, and develops two methods to provide differential privacy to distributed learning algorithms over a network. We first decentralize the learning algorithm using the alternating direction method of multipliers (ADMM), and propose the methods of dual variable perturbation and primal variable perturbation to provide dynamic differential privacy. The two mechanisms lead to algorithms that can provide privacy guarantees under mild conditions of the convexity and differentiability of the loss function and the regularizer. We study the performance of the algorithms, and show that the dual variable perturbation outperforms its primal counterpart. To design an optimal privacy mechanisms, we analyze the fundamental tradeoff between privacy and accuracy, and provide guidelines to choose privacy parameters. Numerical experiments using customer information database are performed to corroborate the results on privacy and utility tradeoffs and design.

cs.LG↗

Series solutions to the cauchy problem for partial differential equations

The method of separation of variables can be used to solve many separable linear partial differential equations (LPDEs). Moreover, variable separation solutions usually are some trigonometric series. In the paper, base on some ideas of this method, we introduce a new technique to solve the Cauchy problem for some LPDEs with the initial conditions consisting of some trigonometric series, power series and exponential series. Then many LPDEs which are not separable are solved, such as some second order elliptic equations, Stokes equations and so on. In addition, the solutions of them can be expressed by trigonometric series, power series or exponential series. Moreover, by using power amd exponential series and an iterative method, we can solve many LPDEs and nonlinear PDEs for the first time.

math.AP↗

Series solutions to the 3D cauchy problem for some incompressible Navier-Stokes and Euler Equations

We utilize undetermined coefficient method and an iterative method to construct the series solutions of the 3D Cauchy problem for a class of incompressible Navier-Stokes and Euler Equations. Then we can turn the Navier-Stokes Equations (Euler Equations) into the Cauchy problem for finitely (infinitely) many ordinary differential equations. We get the finite series solution of the Navier-Stokes Equations. By using some combinatorial identities techniques, we prove that the sum of the solutions to these ordinary differential equations is an infinite series solution of the Euler Equations in some cases.

math.AP↗

Invertible binary matrix with maximum number of $2$-by-$2$ invertible submatrices

The problem is related to all-or-nothing transforms (AONT) suggested by Rivest as a preprocessing for encrypting data with a block cipher. Since then there have been various applications of AONTs in cryptography and security. D'Arco, Esfahani and Stinson posed the problem on the constructions of binary matrices for which the desired properties of an AONT hold with the maximum probability. That is, for given integers $t\le s$, what is the maximum number of $t$-by-$t$ invertible submatrices in a binary matrix of order $s$? For the case $t=2$, let $R_2(s)$ denote the maximal proportion of 2-by-2 invertible submatrices. D'Arco, Esfahani and Stinson conjectured that the limit is between 0.492 and 0.625. We completely solve the case $t=2$ by showing that $\lim_{s\rightarrow\infty}R_2(s)=0.5$.

cs.IT↗