Searcharxiv⌕ Search

arXiv subjects

Min Song

Publications and source records attributed to Min Song.

33 records · Page 2Linked to original sources

Topic Segmentation Model Focusing on Local Context

Topic segmentation is important in understanding scientific documents since it can not only provide better readability but also facilitate downstream tasks such as information retrieval and question answering by creating appropriate sections or paragraphs. In the topic segmentation task, topic coherence is critical in predicting segmentation boundaries. Most of the existing models have tried to exploit as many contexts as possible to extract useful topic-related information. However, additional context does not always bring promising results, because the local context between sentences becomes incoherent despite more sentences being supplemented. To alleviate this issue, we propose siamese sentence embedding layers which process two input sentences independently to get appropriate amount of information without being hampered by excessive information. Also, we adopt multi-task learning techniques including Same Topic Prediction (STP), Topic Classification (TC) and Next Sentence Prediction (NSP). When these three classification layers are combined in a multi-task manner, they can make up for each other's limitations, improving performance in all three tasks. We experiment different combinations of the three layers and report how each layer affects other layers in the same combination as well as the overall segmentation performance. The model we proposed achieves the state-of-the-art result in the WikiSection dataset.

cs.CL↗

Over-the-Air Federated Learning with Enhanced Privacy

Federated learning (FL) has emerged as a promising learning paradigm in which only local model parameters (gradients) are shared. Private user data never leaves the local devices thus preserving data privacy. However, recent research has shown that even when local data is never shared by a user, exchanging model parameters without protection can also leak private information. Moreover, in wireless systems, the frequent transmission of model parameters can cause tremendous bandwidth consumption and network congestion when the model is large. To address this problem, we propose a new FL framework with efficient over-the-air parameter aggregation and strong privacy protection of both user data and models. We achieve this by introducing pairwise cancellable random artificial noises (PCR-ANs) on end devices. As compared to existing over-the-air computation (AirComp) based FL schemes, our design provides stronger privacy protection. We analytically show the secrecy capacity and the convergence rate of the proposed wireless FL aggregation algorithm.

cs.CR↗

Pandemics are catalysts of scientific novelty: Evidence from COVID-19

Scientific novelty drives the efforts to invent new vaccines and solutions during the pandemic. First-time collaboration and international collaboration are two pivotal channels to expand teams' search activities for a broader scope of resources required to address the global challenge, which might facilitate the generation of novel ideas. Our analysis of 98,981 coronavirus papers suggests that scientific novelty measured by the BioBERT model that is pre-trained on 29 million PubMed articles, and first-time collaboration increased after the outbreak of COVID-19, and international collaboration witnessed a sudden decrease. During COVID-19, papers with more first-time collaboration were found to be more novel and international collaboration did not hamper novelty as it had done in the normal periods. The findings suggest the necessity of reaching out for distant resources and the importance of maintaining a collaborative scientific community beyond nationalism during a pandemic.

cs.DL↗

The Pace of Artificial Intelligence Innovations: Speed, Talent, and Trial-and-Error

Innovations in artificial intelligence (AI) are occurring at speeds faster than ever witnessed before. However, few studies have managed to measure or depict this increasing velocity of innovations in the field of AI. In this paper, we combine data on AI from arXiv and Semantic Scholar to explore the pace of AI innovations from three perspectives: AI publications, AI players, and AI updates (trial and error). A research framework and three novel indicators, Average Time Interval (ATI), Innovation Speed (IS) and Update Speed (US), are proposed to measure the pace of innovations in the field of AI. The results show that: (1) in 2019, more than 3 AI preprints were submitted to arXiv per hour, over 148 times faster than in 1994. Furthermore, there was one deep learning-related preprint submitted to arXiv every 0.87 hours in 2019, over 1,064 times faster than in 1994. (2) For AI players, 5.26 new researchers entered into the field of AI each hour in 2019, more than 175 times faster than in the 1990s. (3) As for AI updates (trial and error), one updated AI preprint was submitted to arXiv every 41 days, with around 33% of AI preprints having been updated at least twice in 2019. In addition, as reported in 2019, it took, on average, only around 0.2 year for AI preprints to receive their first citations, which is 5 times faster than 2000-2007. This swift pace in AI illustrates the increase in popularity of AI innovation. The systematic and fine-grained analysis of the AI field enabled to portrait the pace of AI innovation and demonstrated that the proposed approach can be adopted to understand other fast-growing fields such as cancer research and nano science.

cs.DL↗

Building a PubMed knowledge graph

PubMed is an essential resource for the medical domain, but useful concepts are either difficult to extract or are ambiguated, which has significantly hindered knowledge discovery. To address this issue, we constructed a PubMed knowledge graph (PKG) by extracting bio-entities from 29 million PubMed abstracts, disambiguating author names, integrating funding data through the National Institutes of Health (NIH) ExPORTER, collecting affiliation history and educational background of authors from ORCID, and identifying fine-grained affiliation data from MapAffil. Through the integration of the credible multi-source data, we could create connections among the bio-entities, authors, articles, affiliations, and funding. Data validation revealed that the BioBERT deep learning method of bio-entity extraction significantly outperformed the state-of-the-art models based on the F1 score (by 0.51%), with the author name disambiguation (AND) achieving a F1 score of 98.09%. PKG can trigger broader innovations, not only enabling us to measure scholarly impact, knowledge usage, and knowledge transfer, but also assisting us in profiling authors and organizations based on their connections with bio-entities. The PKG is freely available on Figshare (https://figshare.com/s/6327a55355fc2c99f3a2, simplified version that exclude PubMed raw data) and TACC website (http://er.tacc.utexas.edu/datasets/ped, full version).

cs.DL↗

Holographic Complexity Growth Rate in a dual FLRW Universe

In this paper, taking the large $R$ limit and using the complexity-volume duality, we investigate the holographic complexity growth rate of a field state defined on the universe located at an asymptotical AdS boundary in Gauss-Bonnet gravity and massive gravity, respectively. For the Gauss-Bonnet gravity case, its growth behavior of the state mainly presents three kinds of contributions: one, as a finite term viewed as an interaction term, comes from a conserved charge, the second one is from the spatial volume of the universe and the third one relates the curvature of the horizon in the AdS Gauss-Bonnet black hole, where the Gauss-Bonnet effect plays a vital role on such growth rate. For massive gravity case, except the first divergent term still obeying the growth rate of the spatial volume of the Universe, its results reveal the more interesting novel phenomenons: beside the conserved charge $E$, the graviton mass term also provides its effect to the finite term; and the third divergent term is determined by the spatial curvature of its horizon $k$ and graviton mass effect; furthermore, the graviton mass effect can be completely responsible for the second divergent term as a new additional term saturating an area law.

hep-th↗

Visualizing a Field of Research: A Methodology of Systematic Scientometric Reviews

Systematic scientometric reviews, empowered by scientometric and visual analytic techniques, offer opportunities to improve the timeliness, accessibility, and reproducibility of conventional systematic reviews. While increasingly accessible science mapping tools enable end users to visualize the structure and dynamics of a research field, a common bottleneck in the current practice is the construction of a collection of scholarly publications as the input of the subsequent scientometric analysis and visualization. End users often have to face a dilemma in the preparation process: the more they know about a knowledge domain, the easier it is for them to find the relevant data to meet their needs adequately; the little they know, the harder the problem is. What can we do to avoid missing something valuable but beyond our initial description? In this article, we introduce a flexible and generic methodology, cascading citation expansion, to increase the quality of constructing a bibliographic dataset for systematic reviews. Furthermore, the methodology simplifies the conceptualization of globalism and localism in science mapping and unifies them on a consistent and continuous spectrum. We demonstrate an application of the methodology to the research of literature-based discovery and compare five datasets constructed based on three use scenarios, namely a conventional keyword-based search (one dataset), an expansion process starting with a groundbreaking article of the knowledge domain (two datasets), and an expansion process starting with a recently published review article by a prominent expert in the domain (two datasets). The unique coverage of each of the datasets is inspected through network visualization overlays with reference to other datasets in a broad and integrated context.

cs.DL↗

Efficient determination of bespoke optically active nanoparticle distributions

We provide a computational method for quickly determining the correct distribution of optically active nanoparticles for a desired response. This is achieved by simulating the optical response of single nanoparticles and performing a statistical averaging over different sizes. We find good agreement between experiment and theory for the transmission, reflectance and absorption of both an ordered and disordered array. By repeating the simulation for different particle distributions, we show that the method is capable of accurately predicting the correct nanoparticle distribution for a desired optical response. We provide a referential graph for predicting the optical response of different Ag nanoparticle distributions on a glass substrate, which can be extended to other substrate and particle materials, and particle shapes and sizes.

physics.optics↗

AutoSense Model for Word Sense Induction

Word sense induction (WSI), or the task of automatically discovering multiple senses or meanings of a word, has three main challenges: domain adaptability, novel sense detection, and sense granularity flexibility. While current latent variable models are known to solve the first two challenges, they are not flexible to different word sense granularities, which differ very much among words, from aardvark with one sense, to play with over 50 senses. Current models either require hyperparameter tuning or nonparametric induction of the number of senses, which we find both to be ineffective. Thus, we aim to eliminate these requirements and solve the sense granularity problem by proposing AutoSense, a latent variable model based on two observations: (1) senses are represented as a distribution over topics, and (2) senses generate pairings between the target word and its neighboring word. These observations alleviate the problem by (a) throwing garbage senses and (b) additionally inducing fine-grained word senses. Results show great improvements over the state-of-the-art models on popular WSI datasets. We also show that AutoSense is able to learn the appropriate sense granularity of a word. Finally, we apply AutoSense to the unsupervised author name disambiguation task where the sense granularity problem is more evident and show that AutoSense is evidently better than competing models. We share our data and code here: https://github.com/rktamplayo/AutoSense.

cs.CL↗

Convexity Analysis of Optimization Framework of Attitude Determination from Vector Observations

In the past several years, there have been several representative attitude determination methods developed using derivative-based optimization algorithms. Optimization techniques e.g. gradient-descent algorithm (GDA), Gauss-Newton algorithm (GNA), Levenberg-Marquadt algorithm (LMA) suffer from local optimum in real engineering practices. A brief discussion on the convexity of this problem is presented recently \cite{Ahmed2012} stating that the problem is neither convex nor concave. In this paper, we give analytic proofs on this problem. The results reveal that the target loss function is convex in the common practice of quaternion normalization, which leads to non-existence of local optimum.

eess.SY↗

DTER: Schedule Optimal RF Energy Request and Harvest for Internet of Things

We propose a new energy harvesting strategy that uses a dedicated energy source (ES) to optimally replenish energy for radio frequency (RF) energy harvesting powered Internet of Things. Specifically, we develop a two-step dual tunnel energy requesting (DTER) strategy that minimizes the energy consumption on both the energy harvesting device and the ES. Besides the causality and capacity constraints that are investigated in the existing approaches, DTER also takes into account the overhead issue and the nonlinear charge characteristics of an energy storage component to make the proposed strategy practical. Both offline and online scenarios are considered in the second step of DTER. To solve the nonlinear optimization problem of the offline scenario, we convert the design of offline optimal energy requesting problem into a classic shortest path problem and thus a global optimal solution can be obtained through dynamic programming (DP) algorithms. The online suboptimal transmission strategy is developed as well. Simulation study verifies that the online strategy can achieve almost the same energy efficiency as the global optimal solution in the long term.

eess.SP↗

Tunable Fano resonances in heterogenous Al-Ag nanorod dimer

We theoretically investigate the plasmonic coupling in heterogenous Al-Ag nanorod dimer. A pronounced Fano dip is found in the extinction spectrum produced by the destructive interference between the bright dipole mode from a short Al nanorod and the dark quadrupole mode from a long Ag nanorod nearby. This Fano resonance can be widely tuned in both wavelength and amplitude by varying the rod dimensions, the separation distance and the local dielectric environment. The Al-Ag heterogeneous nanorod dimer shows a high sensitivity to the surrounding environment with a local surface plasmon resonance figure of merit of 7.0, which enables its promising applications in plasmonic sensing and detection.

physics.optics↗

Entitymetrics: Measuring the Impact of Entities

This paper proposes entitymetrics to measure the impact of knowledge units. Entitymetrics highlight the importance of entities embedded in scientific literature for further knowledge discovery. In this paper, we use Metformin, a drug for diabetes, as an example to form an entity-entity citation network based on literature related to Metformin. We then calculate the network features and compare the centrality ranks of biological entities with results from Comparative Toxicogenomics Database (CTD). The comparison demonstrates the usefulness of entitymetrics to detect most of the outstanding interactions manually curated in CTD.

cs.DL↗

Real-time Data Collection Scheduling in Multi-hop Wireless Sensor Networks

We study real time periodic query scheduling for data collection in multihop Wireless Sensor Networks (WSNs). Given a set of heterogenous data collection queries in WSNs, each query requires the data from the source sensor nodes to be collected to the control center within a certain end-to-end delay. We first propose almost-tight necessary conditions for a set of different queries to be schedulable by a WSN. We then develop a family of efficient and effective data collection algorithms that can meet the real-time requirement under resource constraints by addressing three tightly coupled tasks: (1) routing tree construction for data collection, (2) link activity scheduling, and (3) packet-level scheduling. Our theoretical analysis for the schedulability of these algorithms show that they can achieve a constant fraction of the maximum schedulable load. For the case of overloaded networks where not all queries can be possibly satisfied, we propose an efficient approximation algorithm to select queries to maximize the total weight of selected schedulable queries. The simulations corroborate our theoretical analysis.

cs.DC↗

On the ruin problem in the renewal risk processes perturbed by diffusion

In this paper, we consider the perturbed renewal risk process. Systems of integro-differential equations for the Gerber-Shiu functions at ruin caused by a claim and oscillation are established, respectively. The explicit Laplase transforms of Gerber-Shiu functions are obtained, while the closed form expressions for the Gerber-Shiu functions are derived when the claim amount distribution is from the rational family. Finally, we present numerical examples intended to illustrate the main results.

math.PR↗