arXiv subjects

Ying Zhang

Publications and source records attributed to Ying Zhang.

At least 487 records · Page 27Linked to original sources

arXiv2019

First Detection of Photons with Energy Beyond 100 TeV from an Astrophysical Source

We report on the highest energy photons from the Crab Nebula observed by the Tibet air shower array with the underground water-Cherenkov-type muon detector array. Based on the criterion of muon number measured in an air shower, we successfully suppress 99.92% of the cosmic-ray background events with energies $E>100$ TeV. As a result, we observed 24 photon-like events with $E>100$ TeV against 5.5 background events, which corresponds to 5.6$σ$ statistical significance. This is the first detection of photons with $E>100$ TeV from an astrophysical source.

astro-ph.HE↗

arXiv2019

Mechanism of Synergistic Effects of Neutron- and Gamma-Ray-Radiated PNP Bipolar Transistors

The synergistic effects of neutron and gamma ray radiated PNP transistors are systematically investigated as functions of the neutron fluence, gamma ray dose, and dose rate. We find that the damages show a `tick'-like dependence on the gamma ray dose after the samples are radiated by neutrons. Two negative synergistic effects are derived, both of which have similar magnitudes as the ionization damage (ID) itself. The first one depends linearly on the gamma ray dose, whose slope depends quadratically on the initial displacement damage (DD) and can be attributed to the healing of neutron-radiation-induced defects in silicon. The second one has an exponential decay with the gamma ray dose, whose amplitude shows a rather strong enhanced low-dose-rate sensitivity (ELDRS) effect and can be attributed to the passivation of neutron-induced defects near the silica/silicon interface by the gamma-ray-generated protons in silica, which can penetrate the silica/silicon interface to passivate the neutron-induced defects in silicon. The simulated results based on the proposed model match the experimental data very well, but differ from previous model, which does not assume annihilation or passivation of the displacement defects. The unraveled defect annealing mechanism is important because it implies that displacement damages can be repaired by gamma ray radiation or proton diffusion, which can have important device applications in the space or other extreme environments.

physics.app-ph↗

arXiv2018

Voiceprint recognition of Parkinson patients based on deep learning

More than 90% of the Parkinson Disease (PD) patients suffer from vocal disorders. Speech impairment is already indicator of PD. This study focuses on PD diagnosis through voiceprint features. In this paper, a method based on Deep Neural Network (DNN) recognition and classification combined with Mini-Batch Gradient Descent (MBGD) is proposed to distinguish PD patients from healthy people using voiceprint features. In order to exact the voiceprint features from patients, Weighted Mel Frequency Cepstrum Coefficients (WMFCC) is applied. The proposed method is tested on experimental data obtained by the voice recordings of three sustained vowels /a/, /o/ and /u/ from participants (48 PD and 20 healthy people). The results show that the proposed method achieves a high accuracy of diagnosis of PD patients from healthy people, than the conventional methods like Support Vector Machine (SVM) and other mentioned in this paper. The accuracy achieved is 89.5%. WMFCC approach can solve the problem that the high-order cepstrum coefficients are small and the features component's representation ability to the audio is weak. MBGD reduces the computational loads of the loss function, and increases the training speed of the system. DNN classifier enhances the classification ability of voiceprint features. Therefore, the above approaches can provide a solid solution for the quick auxiliary diagnosis of PD in early stage.

cs.SD↗

arXiv2018

Device-to-Device Load Balancing for Cellular Networks

Small-cell architecture is widely adopted by cellular network operators to increase network capacity. By reducing the size of cells, operators can pack more (low-power) base stations in an area to better serve the growing demands, without causing extra interference. However, this approach suffers from low spectrum temporal efficiency. When a cell becomes smaller and covers fewer users, its total traffic fluctuates significantly due to insufficient traffic aggregation and exhibiting a large "peak-to-mean" ratio. As operators customarily provision spectrum for peak traffic, large traffic temporal fluctuation inevitably leads to low spectrum temporal efficiency. In this paper, we advocate device-to-device (D2D) load-balancing as a useful mechanism to address the fundamental drawback of small-cell architecture. The idea is to shift traffic from a congested cell to its adjacent under-utilized cells by leveraging inter-cell D2D communication, so that the traffic can be served without using extra spectrum, effectively improving the spectrum temporal efficiency. We provide theoretical modeling and analysis to characterize the benefit of D2D load balancing, in terms of total spectrum requirements of all individual cells. We also derive the corresponding cost, in terms of incurred D2D traffic overhead. We carry out empirical evaluations based on real-world 4G data traces to gauge the benefit and cost of D2D load balancing under practical settings. The results show that D2D load balancing can reduce the spectrum requirement by 25% as compared to the standard scenario without D2D load balancing, at the expense of negligible 0.7% D2D traffic overhead.

cs.NI↗

arXiv2018

A Novel Bin Design Problem and High Performance Algorithm for E-commerce Logistics System

Packing cost accounts for a large part of the e-commerce logistics cost. Mining the patterns of customer orders and designing suitable packing bins help to reduce operating cost. In the classical bin packing problem, a given set of cuboid-shaped items should be packed into bins with given and fixed-sizes (length, width and height) to minimize the number of bins that are used. However, a novel bin design problem is proposed in this paper. The decision variables are the geometric sizes of bins, and the objective is to minimize the total surface area. To solve the problem, a low computational-complexity, high-performance heuristic algorithm based on dynamic programming and depth-first tree search, named DPTS, is developed. Based on real historical data that are collected from logistics scenario, numerical experiments show that the DPTS out-performed 5.8% than the greedy local search (GLS) algorithm in the total cost. What's more, DPTS algorithm requires only about 1/50 times of the computational resources compared to the GLS algorithm. This demonstrates that DPTS algorithm is very efficient in bin design problem and can help logistics companies to make appropriate design.

cs.DS↗

arXiv2018

Stochastic orders for convolution of heterogeneous gamma and negative binomial random variables

Convolutions of independent random variables often arise in a natural way in many applied problems. In this article, we compare convolutions of two sets of gamma (negative binomial) random variables in the convolution order and the usual stochastic order in a unified set-up, when the shape and scale parameters satisfy a partial order called reverse-coupled majorization order. This partial order is an extension of the majorization order from vectors to pairs of vectors which also incorporates the arrangement information. The results established in this article strengthen those known in the literature.

math.PR↗

arXiv2018

Efficient and High-Quality Seeded Graph Matching: Employing High Order Structural Information

Driven by many real applications, we study the problem of seeded graph matching. Given two graphs $G_1 = (V_1, E_1)$ and $G_2 = (V_2, E_2)$, and a small set $S$ of pre-matched node pairs $[u, v]$ where $u \in V_1$ and $v \in V_2$, the problem is to identify a matching between $V_1$ and $V_2$ growing from $S$, such that each pair in the matching corresponds to the same underlying entity. Recent studies on efficient and effective seeded graph matching have drawn a great deal of attention and many popular methods are largely based on exploring the similarity between local structures to identify matching pairs. While these recent techniques work well on random graphs, their accuracy is low over many real networks. Motivated by this, we propose to utilize high order neighboring information to improve the matching accuracy. As a result, a new framework of seeded graph matching is proposed, which employs Personalized PageRank (PPR) to quantify the matching score of each node pair. To further boost the matching accuracy, we propose a novel postponing strategy, which postpones the selection of pairs that have competitors with similar matching scores. We theoretically prove that the postpone strategy indeed significantly improves the matching accuracy. To improve the scalability of matching large graphs, we also propose efficient approximation techniques based on algorithms for computing PPR heavy hitters. Our comprehensive experimental studies on large-scale real datasets demonstrate that, compared with state of the art approaches, our framework not only increases the precision and recall both by a significant margin but also achieves speed-up up to more than one order of magnitude.

cs.DS↗

arXiv2018

On explicit order 1.5 approximations with varying coefficients: the case of super-linear diffusion coefficients

A conjecture appears in \cite{milsteinscheme}, in the form of a remark, where it is stated that it is possible to construct, in a specified way, any high order explicit numerical schemes to approximate the solutions of SDEs with superlinear coefficients. We answer this conjecture affirmatively for the case of order 1.5 approximations and show that the suggested methodology works. Moreover, we explore the case of having Hölder continuous derivatives for the diffusion coefficients.

math.PR↗

arXiv2018

GB-KMV: An Augmented KMV Sketch for Approximate Containment Similarity Search

In this paper, we study the problem of approximate containment similarity search. Given two records Q and X, the containment similarity between Q and X with respect to Q is |Q intersect X|/ |Q|. Given a query record Q and a set of records S, the containment similarity search finds a set of records from S whose containment similarity regarding Q are not less than the given threshold. This problem has many important applications in commercial and scientific fields such as record matching and domain search. Existing solution relies on the asymmetric LSH method by transforming the containment similarity to well-studied Jaccard similarity. In this paper, we use a different framework by transforming the containment similarity to set intersection. We propose a novel augmented KMV sketch technique, namely GB-KMV, which is data-dependent and can achieve a good trade-off between the sketch size and the accuracy. We provide a set of theoretical analysis to underpin the proposed augmented KMV sketch technique, and show that it outperforms the state-of-the-art technique LSH-E in terms of estimation accuracy under practical assumption. Our comprehensive experiments on real-life datasets verify that GB-KMV is superior to LSH-E in terms of the space-accuracy trade-off, time-accuracy trade-off, and the sketch construction time. For instance, with similar estimation accuracy (F-1 score), GB-KMV is over 100 times faster than LSH-E on some real-life dataset.

cs.IR↗

arXiv2018

Pseudopotential multiple-relaxation-time lattice Boltzmann simulation of vapor condensation on vertical subcooled walls

Saturated vapor condensation on the homogeneous and heterogeneous sub-cooled wall under gravity was numerically simulated by the improved pseudo-potential phase-change multiple-relaxation-time lattice Boltzmann (LB) method. Firstly, the phase-change LB method coupling finite different method to solve the energy equation was verified by the D-2 law of the droplets evaporation, which improve the model could precisely realize the numerical simulation of phase change.

physics.flu-dyn↗

arXiv2018

Fashion-Gen: The Generative Fashion Dataset and Challenge

We introduce a new dataset of 293,008 high definition (1360 x 1360 pixels) fashion images paired with item descriptions provided by professional stylists. Each item is photographed from a variety of angles. We provide baseline results on 1) high-resolution image generation, and 2) image generation conditioned on the given text descriptions. We invite the community to improve upon these baselines. In this paper, we also outline the details of a challenge that we are launching based upon this dataset.

stat.ML↗

arXiv2018

An Unstructured Mesh Convergent Reaction-Diffusion Master Equation for Reversible Reactions

The convergent reaction-diffusion master equation (CRDME) was recently developed to provide a lattice particle-based stochastic reaction-diffusion model that is a convergent approximation in the lattice spacing to an underlying spatially-continuous particle dynamics model. The CRDME was designed to be identical to the popular lattice reaction-diffusion master equation (RDME) model for systems with only linear reactions, while overcoming the RDME's loss of bimolecular reaction effects as the lattice spacing is taken to zero. In our original work we developed the CRDME to handle bimolecular association reactions on Cartesian grids. In this work we develop several extensions to the CRDME to facilitate the modeling of cellular processes within realistic biological domains. Foremost, we extend the CRDME to handle reversible bimolecular reactions on unstructured grids. Here we develop a generalized CRDME through discretization of the spatially continuous volume reactivity model, extending the CRDME to encompass a larger variety of particle-particle interactions. Finally, we conclude by examining several numerical examples to demonstrate the convergence and accuracy of the CRDME in approximating the volume reactivity model.

math.NA↗

arXiv2018

Quaternion Convolutional Neural Networks for End-to-End Automatic Speech Recognition

Recently, the connectionist temporal classification (CTC) model coupled with recurrent (RNN) or convolutional neural networks (CNN), made it easier to train speech recognition systems in an end-to-end fashion. However in real-valued models, time frame components such as mel-filter-bank energies and the cepstral coefficients obtained from them, together with their first and second order derivatives, are processed as individual elements, while a natural alternative is to process such components as composed entities. We propose to group such elements in the form of quaternions and to process these quaternions using the established quaternion algebra. Quaternion numbers and quaternion neural networks have shown their efficiency to process multidimensional inputs as entities, to encode internal dependencies, and to solve many tasks with less learning parameters than real-valued models. This paper proposes to integrate multiple feature views in quaternion-valued convolutional neural network (QCNN), to be used for sequence-to-sequence mapping with the CTC model. Promising results are reported using simple QCNNs in phoneme recognition experiments with the TIMIT corpus. More precisely, QCNNs obtain a lower phoneme error rate (PER) with less learning parameters than a competing model based on real-valued CNNs.

cs.SD↗

arXiv2018

Strong Proton-Defect Interaction in Synergistic Irradiation Damage System

We experimentally investigated total ionizing dose (TID) response of the input-stage PNP transitor in an operational amplifier LM324N with various initial displacement damage (IDD). We found that, the damage first decreases and then increases with the total dose, which can be exactly described by a dose-rate-dependent linear generation term, an IDD-dependent linear annealing term, and a dose-rate-dependent exponential annealing term. We demonstrate that, the first two terms are the well-known TID and injection annealing effect, respectively, while the third term stems from the reactions between the TID-induced protons diffusing from silica and the defects generated in silicon, which implies the presence of a unexplored proton-defect interaction between TID and DD effects. Moreover, we find that such an interaction is as strong as the injection annealing. Our work show that, beside the well-known Coulomb interaction of trapping charge in silica with carriers in silicon, a strong proton-defect interaction also plays important role in the synergistic damage.

physics.space-ph↗

arXiv2018

Influence of Earth-Directed Coronal Mass Ejections on the Sun's Shadow Observed by the Tibet-III Air Shower Array

We examine the possible influence of Earth-directed coronal mass ejections (ECMEs) on the Sun's shadow in the 3~TeV cosmic-ray intensity observed by the Tibet-III air shower (AS) array. We confirm a clear solar-cycle variation of the intensity deficit in the Sun's shadow during ten years between 2000 and 2009. This solar-cycle variation is overall reproduced by our Monte Carlo (MC) simulations of the Sun's shadow based on the potential field model of the solar magnetic field averaged over each solar rotation period. We find, however, that the magnitude of the observed intensity deficit in the Sun's shadow is significantly less than that predicted by MC simulations, particularly during the period around solar maximum when a significant number of ECMEs is recorded. The $χ^2$ tests of the agreement between the observations and the MC simulations show that the difference is larger during the periods when the ECMEs occur, and the difference is reduced if the periods of ECMEs are excluded from the analysis. This suggests the first experimental evidence of the ECMEs affecting the Sun's shadow observed in the 3~TeV cosmic-ray intensity.

astro-ph.HE↗

arXiv2018

Medical Concept Embedding with Time-Aware Attention

Embeddings of medical concepts such as medication, procedure and diagnosis codes in Electronic Medical Records (EMRs) are central to healthcare analytics. Previous work on medical concept embedding takes medical concepts and EMRs as words and documents respectively. Nevertheless, such models miss out the temporal nature of EMR data. On the one hand, two consecutive medical concepts do not indicate they are temporally close, but the correlations between them can be revealed by the time gap. On the other hand, the temporal scopes of medical concepts often vary greatly (e.g., \textit{common cold} and \textit{diabetes}). In this paper, we propose to incorporate the temporal information to embed medical codes. Based on the Continuous Bag-of-Words model, we employ the attention mechanism to learn a "soft" time-aware context window for each medical concept. Experiments on public and proprietary datasets through clustering and nearest neighbour search tasks demonstrate the effectiveness of our model, showing that it outperforms five state-of-the-art baselines.

cs.CL↗

arXiv2018

Online Product Quantization

Approximate nearest neighbor (ANN) search has achieved great success in many tasks. However, existing popular methods for ANN search, such as hashing and quantization methods, are designed for static databases only. They cannot handle well the database with data distribution evolving dynamically, due to the high computational effort for retraining the model based on the new database. In this paper, we address the problem by developing an online product quantization (online PQ) model and incrementally updating the quantization codebook that accommodates to the incoming streaming data. Moreover, to further alleviate the issue of large scale computation for the online PQ update, we design two budget constraints for the model to update partial PQ codebook instead of all. We derive a loss bound which guarantees the performance of our online PQ model. Furthermore, we develop an online PQ model over a sliding window with both data insertion and deletion supported, to reflect the real-time behaviour of the data. The experiments demonstrate that our online PQ model is both time-efficient and effective for ANN search in dynamic large scale databases compared with baseline methods and the idea of partial PQ codebook update further reduces the update cost.

cs.CV↗

arXiv2018

IDEL: In-Database Entity Linking with Neural Embeddings

We present a novel architecture, In-Database Entity Linking (IDEL), in which we integrate the analytics-optimized RDBMS MonetDB with neural text mining abilities. Our system design abstracts core tasks of most neural entity linking systems for MonetDB. To the best of our knowledge, this is the first defacto implemented system integrating entity-linking in a database. We leverage the ability of MonetDB to support in-database-analytics with user defined functions (UDFs) implemented in Python. These functions call machine learning libraries for neural text mining, such as TensorFlow. The system achieves zero cost for data shipping and transformation by utilizing MonetDB's ability to embed Python processes in the database kernel and exchange data in NumPy arrays. IDEL represents text and relational data in a joint vector space with neural embeddings and can compensate errors with ambiguous entity representations. For detecting matching entities, we propose a novel similarity function based on joint neural embeddings which are learned via minimizing pairwise contrastive ranking loss. This function utilizes a high dimensional index structures for fast retrieval of matching entities. Our first implementation and experiments using the WebNLG corpus show the effectiveness and the potentials of IDEL.

cs.DB↗