skip to main content

Search for: All records

Creators/Authors contains: "Tao, J."

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. In this paper, we prove bounds for the unique, positive zero of O  G (z) := 1 −O G (z) , where O G ( z ) is the so-called orbit polynomial [1]. The orbit polynomial is based on the multiplic- ity and cardinalities of the vertex orbits of a graph. In [1] , we have shown that the unique, positive zero δ≤1 of O  G (z) can serve as a meaningful measure of graph symmetry. In this paper, we study special graph classes with a specified number of orbits and obtain bounds on the value of δ.
  2. Research on the structural complexity of networks has produced many useful results in graph theory and applied disciplines such as engineering and data analysis. This paper is intended as a further contribution to this area of research. Here we focus on measures designed to compare graphs with respect to symmetry. We do this by means of a novel characteristic of a graph G, namely an ``orbit polynomial.'' A typical term of this univariate polynomial is of the form czn, where c is the number of orbits of size n of the automorphism group of G. Subtracting the orbit polynomial frommore »1 results in another polynomial that has a unique positive root, which can serve as a relative measure of the symmetry of a graph. The magnitude of this root is indicative of symmetry and can thus be used to compare graphs with respect to that property. In what follows, we will prove several inequalities on the unique positive roots of orbit polynomials corresponding to different graphs, thus showing differences in symmetry. In addition, we present numerical results relating to several classes of graphs for the purpose of comparing the new symmetry measure with existing ones. Finally, it is applied to a set of isomers of the chemical compound adamantane C10H16. We believe that the measure can be quite useful for tackling applications in chemistry, bioinformatics, and structure-oriented drug design.« less
  3. Online consumer reviews contain rich yet implicit information regarding consumers’ preferences for specific aspects of products/services. Extracting aspects from online consumer reviews has been recognized as a valuable step in performing fine-grained analytical tasks (e.g. aspect-based sentiment analysis). Extant approaches to aspect extraction are dominated by discrete models. Despite explosive research interests in continuous-space language models in recent years, these models have yet to be explored for the task of extracting product/service aspects from online consumer reviews. In addition, previous continuous-space models for information extraction have largely overlooked the role of semantic information embedded in texts. In this study, wemore »propose an approach of aspect extraction that leverages semantic information from WordNet in conjunction of building continuous-space language models from review texts. The experiment results with online restaurant reviews demonstrate that the WordNet-guided continuous-space language models outperform both discrete models and continuous-space language models without incorporating the semantic information. The research findings have important implications for understanding consumer preferences and improving business performances.« less
  4. A bstract A search for a heavy resonance decaying into a top quark and a W boson in proton-proton collisions at $$ \sqrt{s} $$ s = 13 TeV is presented. The data analyzed were recorded with the CMS detector at the LHC and correspond to an integrated luminosity of 138 fb − 1 . The top quark is reconstructed as a single jet and the W boson, from its decay into an electron or muon and the corresponding neutrino. A top quark tagging technique based on jet clustering with a variable distance parameter and simultaneous jet grooming is used tomore »identify jets from the collimated top quark decay. The results are interpreted in the context of two benchmark models, where the heavy resonance is either an excited bottom quark b ∗ or a vector-like quark B. A statistical combination with an earlier search by the CMS Collaboration in the all-hadronic final state is performed to place upper cross section limits on these two models. The new analysis extends the lower range of resonance mass probed from 1.4 down to 0.7 TeV. For left-handed, right-handed, and vector-like couplings, b ∗ masses up to 3.0, 3.0, and 3.2 TeV are excluded at 95% confidence level, respectively. The observed upper limits represent the most stringent constraints on the b ∗ model to date.« less
    Free, publicly-accessible full text available April 1, 2023
  5. Free, publicly-accessible full text available March 1, 2023
  6. Free, publicly-accessible full text available January 1, 2023
  7. A bstract A search for a heavy resonance decaying to a top quark and a W boson in the fully hadronic final state is presented. The analysis is performed using data from proton-proton collisions at a center-of-mass energy of 13 TeV, corresponding to an integrated luminosity of 137 fb − 1 recorded by the CMS experiment at the LHC. The search is focused on heavy resonances, where the decay products of each top quark or W boson are expected to be reconstructed as a single, large-radius jet with a distinct substructure. The production of an excited bottom quark, b *more », is used as a benchmark when setting limits on the cross section for a heavy resonance decaying to a top quark and a W boson. The hypotheses of b * quarks with left-handed, right-handed, and vector-like chiralities are excluded at 95% confidence level for masses below 2.6, 2.8, and 3.1 TeV, respectively. These are the most stringent limits on the b * quark mass to date, extending the previous best limits by almost a factor of two.« less
    Free, publicly-accessible full text available December 1, 2022