SearcharxivSearch

arXiv subjects

Hong Yu

Publications and source records attributed to Hong Yu.

At least 163 records · Page 9Linked to original sources

DNN Filter Bank Cepstral Coefficients for Spoofing Detection

With the development of speech synthesis techniques, automatic speaker verification systems face the serious challenge of spoofing attack. In order to improve the reliability of speaker verification systems, we develop a new filter bank based cepstral feature, deep neural network filter bank cepstral coefficients (DNN-FBCC), to distinguish between natural and spoofed speech. The deep neural network filter bank is automatically generated by training a filter bank neural network (FBNN) using natural and synthetic speech. By adding restrictions on the training rules, the learned weight matrix of FBNN is band-limited and sorted by frequency, similar to the normal filter bank. Unlike the manually designed filter bank, the learned filter bank has different filter shapes in different channels, which can capture the differences between natural and synthetic speech more effectively. The experimental results on the ASVspoof {2015} database show that the Gaussian mixture model maximum-likelihood (GMM-ML) classifier trained by the new feature performs better than the state-of-the-art linear frequency cepstral coefficients (LFCC) based classifier, especially on detecting unknown attacks.

cs.SD

Neural Semantic Encoders

We present a memory augmented neural network for natural language understanding: Neural Semantic Encoders. NSE is equipped with a novel memory update rule and has a variable sized encoding memory that evolves over time and maintains the understanding of input sequences through read}, compose and write operations. NSE can also access multiple and shared memories. In this paper, we demonstrated the effectiveness and the flexibility of NSE on five different natural language tasks: natural language inference, question answering, sentence classification, document sentiment analysis and machine translation where NSE achieved state-of-the-art performance when evaluated on publically available benchmarks. For example, our shared-memory model showed an encouraging result on neural machine translation, improving an attention-based baseline by approximately 1.0 BLEU.

cs.LG

Ranking medical jargon in electronic health record notes by adapted distant supervision

Objective: Allowing patients to access their own electronic health record (EHR) notes through online patient portals has the potential to improve patient-centered care. However, medical jargon, which abounds in EHR notes, has been shown to be a barrier for patient EHR comprehension. Existing knowledge bases that link medical jargon to lay terms or definitions play an important role in alleviating this problem but have low coverage of medical jargon in EHRs. We developed a data-driven approach that mines EHRs to identify and rank medical jargon based on its importance to patients, to support the building of EHR-centric lay language resources. Methods: We developed an innovative adapted distant supervision (ADS) model based on support vector machines to rank medical jargon from EHRs. For distant supervision, we utilized the open-access, collaborative consumer health vocabulary, a large, publicly available resource that links lay terms to medical jargon. We explored both knowledge-based features from the Unified Medical Language System and distributed word representations learned from unlabeled large corpora. We evaluated the ADS model using physician-identified important medical terms. Results: Our ADS model significantly surpassed two state-of-the-art automatic term recognition methods, TF*IDF and C-Value, yielding 0.810 ROC-AUC versus 0.710 and 0.667, respectively. Our model identified 10K important medical jargon terms after ranking over 100K candidate terms mined from over 7,500 EHR narratives. Conclusion: Our work is an important step towards enriching lexical resources that link medical jargon to lay terms/definitions to support patient EHR comprehension. The identified medical jargon terms and their rankings are available upon request.

cs.CL

Learning to Rank Scientific Documents from the Crowd

Finding related published articles is an important task in any science, but with the explosion of new work in the biomedical domain it has become especially challenging. Most existing methodologies use text similarity metrics to identify whether two articles are related or not. However biomedical knowledge discovery is hypothesis-driven. The most related articles may not be ones with the highest text similarities. In this study, we first develop an innovative crowd-sourcing approach to build an expert-annotated document-ranking corpus. Using this corpus as the gold standard, we then evaluate the approaches of using text similarity to rank the relatedness of articles. Finally, we develop and evaluate a new supervised model to automatically rank related scientific articles. Our results show that authors' ranking differ significantly from rankings by text-similarity-based models. By training a learning-to-rank model on a subset of the annotated corpus, we found the best supervised learning-to-rank model (SVM-Rank) significantly surpassed state-of-the-art baseline systems.

cs.IR

Building an Evaluation Scale using Item Response Theory

Evaluation of NLP methods requires testing against a previously vetted gold-standard test set and reporting standard metrics (accuracy/precision/recall/F1). The current assumption is that all items in a given test set are equal with regards to difficulty and discriminating power. We propose Item Response Theory (IRT) from psychometrics as an alternative means for gold-standard test-set generation and NLP system evaluation. IRT is able to describe characteristics of individual items - their difficulty and discriminating power - and can account for these characteristics in its estimation of human intelligence or ability for an NLP task. In this paper, we demonstrate IRT by generating a gold-standard test set for Recognizing Textual Entailment. By collecting a large number of human responses and fitting our IRT model, we show that our IRT model compares NLP systems with the performance in a human population and is able to provide more insight into system performance than standard evaluation metrics. We show that a high accuracy score does not always imply a high IRT score, which depends on the item characteristics and the response pattern.

cs.CL

Structured prediction models for RNN based sequence labeling in clinical text

Sequence labeling is a widely used method for named entity recognition and information extraction from unstructured natural language data. In clinical domain one major application of sequence labeling involves extraction of medical entities such as medication, indication, and side-effects from Electronic Health Record narratives. Sequence labeling in this domain, presents its own set of challenges and objectives. In this work we experimented with various CRF based structured learning models with Recurrent Neural Networks. We extend the previously studied LSTM-CRF models with explicit modeling of pairwise potentials. We also propose an approximate version of skip-chain CRF inference with RNN potentials. We use these methodologies for structured prediction in order to improve the exact phrase detection of various medical entities.

cs.CL

Bidirectional Recurrent Neural Networks for Medical Event Detection in Electronic Health Records

Sequence labeling for extraction of medical events and their attributes from unstructured text in Electronic Health Record (EHR) notes is a key step towards semantic understanding of EHRs. It has important applications in health informatics including pharmacovigilance and drug surveillance. The state of the art supervised machine learning models in this domain are based on Conditional Random Fields (CRFs) with features calculated from fixed context windows. In this application, we explored various recurrent neural network frameworks and show that they significantly outperformed the CRF models.

cs.CL

Learning for Biomedical Information Extraction: Methodological Review of Recent Advances

Biomedical information extraction (BioIE) is important to many applications, including clinical decision support, integrative biology, and pharmacovigilance, and therefore it has been an active research. Unlike existing reviews covering a holistic view on BioIE, this review focuses on mainly recent advances in learning based approaches, by systematically summarizing them into different aspects of methodological development. In addition, we dive into open information extraction and deep learning, two emerging and influential techniques and envision next generation of BioIE.

cs.CL

Fourier-transform Ghost Imaging with Hard X-rays

Knowledge gained through X-ray crystallography fostered structural determination of materials and greatly facilitated the development of modern science and technology in the past century. Atomic details of sample structures is achievable by X-ray crystallography, however, it is only applied to crystalline structures. Imaging techniques based on X-ray coherent diffraction or zone plates are capable of resolving the internal structure of non-crystalline materials at nanoscales, but it is still a challenge to achieve atomic resolution. Here we demonstrate a novel lensless Fourier-transform ghost imaging method with pseudo-thermal hard X-rays by measuring the second-order intensity correlation function of the light. We show that high resolution Fourier-transform diffraction pattern of a complex amplitude sample can be achieved at Fresnel region and the amplitude and phase distributions of a sample in spatial domain can be retrieved successfully. The method of lensless X-ray Fourier-transform ghost imaging extends X-ray crystallography to non-crystalline samples, and its spatial resolution is limited only by the wavelength of the X-ray, thus atomic resolution should be routinely obtainable. Since highly coherent X-ray source is not required, comparing to conventional X-ray coherent diffraction imaging, the method can be implemented with laboratory X-ray sources, and it also provides a potential solution for lensless diffraction imaging with fermions, such as neutron and electron where the intensive coherent source usually is not available.

physics.optics

Heuristic algorithms for finding distribution reducts in probabilistic rough set model

Attribute reduction is one of the most important topics in rough set theory. Heuristic attribute reduction algorithms have been presented to solve the attribute reduction problem. It is generally known that fitness functions play a key role in developing heuristic attribute reduction algorithms. The monotonicity of fitness functions can guarantee the validity of heuristic attribute reduction algorithms. In probabilistic rough set model, distribution reducts can ensure the decision rules derived from the reducts are compatible with those derived from the original decision table. However, there are few studies on developing heuristic attribute reduction algorithms for finding distribution reducts. This is partly due to the fact that there are no monotonic fitness functions that are used to design heuristic attribute reduction algorithms in probabilistic rough set model. The main objective of this paper is to develop heuristic attribute reduction algorithms for finding distribution reducts in probabilistic rough set model. For one thing, two monotonic fitness functions are constructed, from which equivalence definitions of distribution reducts can be obtained. For another, two modified monotonic fitness functions are proposed to evaluate the significance of attributes more effectively. On this basis, two heuristic attribute reduction algorithms for finding distribution reducts are developed based on addition-deletion method and deletion method. In particular, the monotonicity of fitness functions guarantees the rationality of the proposed heuristic attribute reduction algorithms. Results of experimental analysis are included to quantify the effectiveness of the proposed fitness functions and distribution reducts.

cs.AI

A Multiple Access Protocol for Multimedia Transmission over Wireless Networks

This paper develops and evaluates the performance of an advanced multiple access protocol for transmission of full complement of multimedia signals consisting of various combinations of voice, video, data, text and images over wireless networks. The protocol is called Advanced Multiple Access Protocol for Multimedia Transmission (AMAPMT) and is to be used in the Data Link Layer of the protocol stack. The principle of operation of the protocol is presented in a number of logical flow charts. The protocol grants permission to transmit to a source on the basis of a priority scheme that takes into account a time-to-live (TTL) parameter of all the transactions, selectable priorities assigned to all the sources and relevant channel state information (CSI) in this order. Performance of the protocol is evaluated in terms of quality of service parameters like packet loss ratio (PLR), mean packet transfer delay (MPTD) and throughput. Using a simulation model based on an OPNET simulation software package does the evaluation. Under various traffic loads with constant distributions with various mean arrival rates and transaction sizes results obtained show that the performance is improved when this priority scheme is used than when it is not used. The results for AMAPMT are compared with that of the best currently available multiple access protocol called Adaptive Request Channel Multiple Access (ARCMA). AMAPMT protocol out performs ARCMA protocol.

cs.NI

Modular co-evolution of metabolic networks

The architecture of biological networks has been reported to exhibit high level of modularity, and to some extent, topological modules of networks overlap with known functional modules. However, how the modular topology of the molecular network affects the evolution of its member proteins remains unclear. In this work, the functional and evolutionary modularity of Homo sapiens (H. sapiens) metabolic network were investigated from a topological point of view. Network decomposition shows that the metabolic network is organized in a highly modular core-periphery way, in which the core modules are tightly linked together and perform basic metabolism functions, whereas the periphery modules only interact with few modules and accomplish relatively independent and specialized functions. Moreover, over half of the modules exhibit co-evolutionary feature and belong to specific evolutionary ages. Peripheral modules tend to evolve more cohesively and faster than core modules do. The correlation between functional, evolutionary and topological modularity suggests that the evolutionary history and functional requirements of metabolic systems have been imprinted in the architecture of metabolic networks. Such systems level analysis could demonstrate how the evolution of genes may be placed in a genome-scale network context, giving a novel perspective on molecular evolution.

q-bio.MN

The effects of degree correlations on network topologies and robustness

Complex networks have been applied to model numerous interactive nonlinear systems in the real world. Knowledge about network topology is crucial for understanding the function, performance and evolution of complex systems. In the last few years, many network metrics and models have been proposed to illuminate the network topology, dynamics and evolution. Since these network metrics and models derive from a wide range of studies, a systematic study is required to investigate the correlations between them. The present paper explores the effect of degree correlation on the other network metrics through studying an ensemble of graphs where the degree sequence (set of degrees) is fixed. We show that to some extent, the characteristic path length, clustering coefficient, modular extent and robustness of networks are directly influenced by the degree correlation.

physics.soc-ph

Hierarchical modularity of nested bow-ties in metabolic networks

The exploration of the structural topology and the organizing principles of genome-based large-scale metabolic networks is essential for studying possible relations between structure and functionality of metabolic networks. Topological analysis of graph models has often been applied to study the structural characteristics of complex metabolic networks.In this work, metabolic networks of 75 organisms were investigated from a topological point of view. Network decomposition of three microbes (Escherichia coli, Aeropyrum pernix and Saccharomyces cerevisiae) shows that almost all of the sub-networks exhibit a highly modularized bow-tie topological pattern similar to that of the global metabolic networks. Moreover, these small bow-ties are hierarchically nested into larger ones and collectively integrated into a large metabolic network, and important features of this modularity are not observed in the random shuffled network. In addition, such a bow-tie pattern appears to be present in certain chemically isolated functional modules and spatially separated modules including carbohydrate metabolism, cytosol and mitochondrion respectively. The highly modularized bow-tie pattern is present at different levels and scales, and in different chemical and spatial modules of metabolic networks, which is likely the result of the evolutionary process rather than a random accident. Identification and analysis of such a pattern is helpful for understanding the design principles and facilitate the modelling of metabolic networks.

q-bio.MN

Complex networks theory for analyzing metabolic networks

One of the main tasks of post-genomic informatics is to systematically investigate all molecules and their interactions within a living cell so as to understand how these molecules and the interactions between them relate to the function of the organism, while networks are appropriate abstract description of all kinds of interactions. In the past few years, great achievement has been made in developing theory of complex networks for revealing the organizing principles that govern the formation and evolution of various complex biological, technological and social networks. This paper reviews the accomplishments in constructing genome-based metabolic networks and describes how the theory of complex networks is applied to analyze metabolic networks.

q-bio.MN

Regarding the axial-vector mesons

The implications of the $f_1(1285)-f_1(1420)$ mixing for the $K_1(^3P_1)-K_1(^1P_1)$ mixing angle is investigated. Based on the $f_1(1285)-f_1(1420)$ mixing angle $\sim 50^\circ$ suggested from the analysis for a substantial body of data concerning the $f_1(1420)$ and $f_1(1285)$, the masses of the $K_1(^3P_1)$ and $K_1(^1P_1)$ are determined to be $\sim 1307.35\pm 0.63$ MeV and $1370.03\pm 9.69$ MeV, respectively, which therefore suggests that the $K_1(^3P_1)-K_1(^1P_1)$ mixing angle is about $\pm (59.55\pm 2.81)^\circ$. Also, it is found that the mass of the $h^\prime_1(^1P_1)$ (mostly of $s\bar{s}$) state is about $1495.18\pm 8.82$ MeV. Comparison of the predicted results and the available experimental information of the $h_1(1380)$ shows that without further confirmation on the $h_1(1380)$, the assignment of the $h_1(1380)$ as the $s\bar{s}$ member of the $^1P_1$ meson nonet may be premature.

hep-ph

A possible assignment for the ground scalar meson nonet

Based on the main assumption that the $a_0(980)$ and $D^\ast_{sJ}(2317)$ belong to the $1 ^3P_0$ $q\bar{q}$ multiplet, in the framework of Regge phenomenology and meson-meson mixing, it is suggested that the $a_0(980)$, $K^\ast_0(1052)$, $f_0(1099)$ and $f_0(530)$ constitute the ground scalar meson nonet, and that the $f_0(1099)$ is composed mostly of $s\bar{s}$ while the $f_0(530)$ is mainly $u\bar{u}+d\bar{d}$. It is supposed that these states would likely correspond to the observed scalar states $a_0(980)$, $κ(900)$, $f_0(980)$ and $f_0(600)/σ$, respectively. The agreement between the present findings and those given by other different approaches is satisfactory.

hep-ph

Meson spectrum in Regge phenomenology

Under the assumption that both light and heavy quarkonia populate approximately linear Regge trajectories with the requirements of additivity of intercepts and inverse slopes, the masses of different meson multiplets are estimated. The predictions derived from the quasi-linear Regge trajectories are in reasonable agreement with those given by many other references.

hep-ph