Searcharxiv⌕ Search

arXiv subjects

Xiaoling Wang

Publications and source records attributed to Xiaoling Wang.

61 records · Page 4Linked to original sources

Syndrome-aware Herb Recommendation with Multi-Graph Convolution Network

Herb recommendation plays a crucial role in the therapeutic process of Traditional Chinese Medicine(TCM), which aims to recommend a set of herbs to treat the symptoms of a patient. While several machine learning methods have been developed for herb recommendation, they are limited in modeling only the interactions between herbs and symptoms, and ignoring the intermediate process of syndrome induction. When performing TCM diagnostics, an experienced doctor typically induces syndromes from the patient's symptoms and then suggests herbs based on the induced syndromes. As such, we believe the induction of syndromes, an overall description of the symptoms, is important for herb recommendation and should be properly handled. However, due to the ambiguity and complexity of syndrome induction, most prescriptions lack the explicit ground truth of syndromes. In this paper, we propose a new method that takes the implicit syndrome induction process into account for herb recommendation. Given a set of symptoms to treat, we aim to generate an overall syndrome representation by effectively fusing the embeddings of all the symptoms in the set, to mimic how a doctor induces the syndromes. Towards symptom embedding learning, we additionally construct a symptom-symptom graph from the input prescriptions for capturing the relations between symptoms; we then build graph convolution networks(GCNs) on both symptom-symptom and symptom-herb graphs to learn symptom embedding. Similarly, we construct a herb-herb graph and build GCNs on both herb-herb and symptom-herb graphs to learn herb embedding, which is finally interacted with the syndrome representation to predict the scores of herbs. In this way, more comprehensive representations can be obtained. We conduct extensive experiments on a public TCM dataset, showing significant improvements over state-of-the-art herb recommendation methods.

cs.IR↗

Quantitative Analysis of Particles Segregation

Segregation is a popular phenomenon. It has considerable effects on material performance. To the author's knowledge, there is still no automated objective quantitative indicator for segregation. In order to full fill this task, segregation of particles is analyzed. Edges of the particles are extracted from the digital picture. Then, the whole picture of particles is splintered to small rectangles with the same shape. Statistical index of the edges in each rectangle is calculated. Accordingly, segregation between the indexes corresponding to the rectangles is evaluated. The results show coincident with subjective evaluated results. Further more, it can be implemented as an automated system, which would facilitate the materials quality control mechanism during production process.

cs.CV↗

Generalized Integrated Functional Test for Regional Methylation Rates

Motivation: Methods are needed to test pre-defined genomic regions such as promoters for differential methylation in genome-wide association studies, where the number of samples is limited and the data have large amounts of measurement error. Results: We developed a new statistical test, the generalized integrated functional test (GIFT), which tests for regional differences in methylation based on differences in the functional relationship between methylation percent and location of the CpG sites within a region. In this method, subject-specific functional profiles are first estimated, and the average profile within groups is compared between groups using an ANOVA-like test. Simulations and analyses of data obtained from patients with chronic lymphocytic leukemia indicate that GIFT has good statistical properties and is able to identify promising genomic regions. Further, GIFT is likely to work with multiple different types of experiments since different smoothing functions can be used to estimate the functional relationship between methylation percent and CpG site location. Availability and Implementation: Matlab code for GIFT and sample data are available at http://biostat.gru.edu/~dryu/research.html. Contact: rpodolsk@med.wayne.edu or dryu@gru.edu

q-bio.GN↗

Classification of (n+2)-dimensional n-Lie Algebras

We give a complete classification of (n+2)-dimensional n-Lie algebras over an algebraically closed field of characteristic $2$, and provide a isomorphic criterion theorem of (n+2)-dimensional n-Lie algebras.

math-ph↗

Gradient-based adaptive interpolation in super-resolution image restoration

This paper presents a super-resolution method based on gradient-based adaptive interpolation. In this method, in addition to considering the distance between the interpolated pixel and the neighboring valid pixel, the interpolation coefficients take the local gradient of the original image into account. The smaller the local gradient of a pixel is, the more influence it should have on the interpolated pixel. And the interpolated high resolution image is finally deblurred by the application of wiener filter. Experimental results show that our proposed method not only substantially improves the subjective and objective quality of restored images, especially enhances edges, but also is robust to the registration error and has low computational complexity.

cs.MM↗

Uniformly bounded components of normality

Suppose that $f(z)$ is a transcendental entire function and that the Fatou set $F(f)\neq\emptyset$. Set $$B_1(f):=\sup_{U}\frac{\sup_{z\in U}\log(|z|+3)}{\inf_{w\in U}\log(|w|+3)}$$ and $$B_2(f):=\sup_{U}\frac{\sup_{z\in U}\log\log(|z|+30)}{\inf_{w\in U}\log(|w|+3)},$$ where the supremum $\sup_{U}$ is taken over all components of $F(f)$. If $B_1(f)<\infty$ or $B_2(f)<\infty$, then we say $F(f)$ is strongly uniformly bounded or uniformly bounded respectively. In this article, we will show that, under some conditions, $F(f)$ is (strongly) uniformly bounded.

math.CV↗

Scalable XSLT Evaluation

XSLT is an increasingly popular language for processing XML data. It is widely supported by application platform software. However, little optimization effort has been made inside the current XSLT processing engines. Evaluating a very simple XSLT program on a large XML document with a simple schema may result in extensive usage of memory. In this paper, we present a novel notion of \emph{Streaming Processing Model} (\emph{SPM}) to evaluate a subset of XSLT programs on XML documents, especially large ones. With SPM, an XSLT processor can transform an XML source document to other formats without extra memory buffers required. Therefore, our approach can not only tackle large source documents, but also produce large results. We demonstrate with a performance study the advantages of the SPM approach. Experimental results clearly confirm that SPM improves XSLT evaluation typically 2 to 10 times better than the existing approaches. Moreover, the SPM approach also features high scalability.

cs.DB↗