arXiv subjects

Ajinkya Kulkarni

Publications and source records attributed to Ajinkya Kulkarni.

23 records · Page 2Linked to original sources

arXiv2023

ClArTTS: An Open-Source Classical Arabic Text-to-Speech Corpus

At present, Text-to-speech (TTS) systems that are trained with high-quality transcribed speech data using end-to-end neural models can generate speech that is intelligible, natural, and closely resembles human speech. These models are trained with relatively large single-speaker professionally recorded audio, typically extracted from audiobooks. Meanwhile, due to the scarcity of freely available speech corpora of this kind, a larger gap exists in Arabic TTS research and development. Most of the existing freely available Arabic speech corpora are not suitable for TTS training as they contain multi-speaker casual speech with variations in recording conditions and quality, whereas the corpus curated for speech synthesis are generally small in size and not suitable for training state-of-the-art end-to-end models. In a move towards filling this gap in resources, we present a speech corpus for Classical Arabic Text-to-Speech (ClArTTS) to support the development of end-to-end TTS systems for Arabic. The speech is extracted from a LibriVox audiobook, which is then processed, segmented, and manually transcribed and annotated. The final ClArTTS corpus contains about 12 hours of speech from a single male speaker sampled at 40100 kHz. In this paper, we describe the process of corpus creation and provide details of corpus statistics and a comparison with existing resources. Furthermore, we develop two TTS systems based on Grad-TTS and Glow-TTS and illustrate the performance of the resulting systems via subjective and objective evaluations. The corpus will be made publicly available at www.clartts.com for research purposes, along with the baseline TTS systems demo.

cs.CL↗

arXiv2022

Merging Ontologies Algebraically

Ontology operations, e.g., aligning and merging, were studied and implemented extensively in different settings, such as, categorical operations, relation algebras, typed graph grammars, with different concerns. However, aligning and merging operations in the settings share some generic properties, e.g., idempotence, commutativity, associativity, and representativity, labeled by (I), (C), (A), and (R), respectively, which are defined on an ontology merging system $(\mathfrak{O},\sim,\merge)$, where $\mathfrak{O}$ is a set of the ontologies concerned, $\sim$ is a binary relation on $\mathfrak{O}$ modeling ontology aligning and $\merge$ is a partial binary operation on $\mathfrak{O}$ modeling ontology merging. Given an ontology repository, a finite set $\mathbb{O}\subseteq \mathfrak{O}$, its merging closure $\widehat{\mathbb{O}}$ is the smallest set of ontologies, which contains the repository and is closed with respect to merging. If (I), (C), (A), and (R) are satisfied, then both $\mathfrak{O}$ and $\widehat{\mathbb{O}}$ are partially ordered naturally by merging, $\widehat{\mathbb{O}}$ is finite and can be computed efficiently, including sorting, selecting, and querying some specific elements, e.g., maximal ontologies and minimal ontologies. We also show that the ontology merging system, given by ontology $V$-alignment pairs and pushouts, satisfies the properties: (I), (C), (A), and (R) so that the merging system is partially ordered and the merging closure of a given repository with respect to pushouts can be computed efficiently.

cs.AI↗

arXiv2022

Effective simulations of interacting active droplets

Droplets form a cornerstone of the spatiotemporal organization of biomolecules in cells. These droplets are controlled using physical processes like chemical reactions and imposed gradients, which are costly to simulate using traditional approaches, like solving the Cahn-Hilliard equation. To overcome this challenge, we here present an alternative, efficient method. The main idea is to focus on the relevant degrees of freedom, like droplet positions and sizes. We derive dynamical equations for these quantities using analytical solutions to simplified situations. We verify our method against fully-resolved simulations and show that it can describe interacting droplets under the influence of chemical reactions and external gradients using only a fraction of the computational costs of traditional methods. Our method can be extended to include other processes in the future and will thus serve as a relevant platform for understanding the dynamics of droplets in cells.

cond-mat.soft↗

arXiv2021

A Topological Invariant for Modular Fusion Categories

The modular data of a modular category $\mathcal{C}$, consisting of the $S$-matrix and the $T$-matrix, is known to be an incomplete invariant of $\mathcal{C}$. More generally, the invariants of framed links and knots defined by a modular category as part of a topological quantum field theory can be viewed as numerical invariants of the category. Among these invariants, we study the invariant defined by the Borromean link colored by three objects. Thus we obtain a tensor that we call $B$. We derive a formula for the Borromean tensor for the twisted Drinfeld doubles of finite groups. Along with $T$, it distinguishes the $p$ non-equivalent modular categories of the form $\mathcal{Z}({\rm Vec}_G^ω)$ for $G$ the non-abelian group $\mathbb{Z}/q\mathbb{Z} \rtimes \mathbb{Z}/p\mathbb{Z}$, which are not distinguished by the modular data.

math.QA↗

arXiv2017

Sparse game changers restore collective motion in panicked human crowds

Using a dynamic variant of the Vicsek model, we show that emergence of a crush from an orderly moving human crowd is a non-equilibrium first order phase transition. We also show that this transition can be reversed by modifying the dynamics of a few people, deemed as game changers. Surprisingly, the optimal placement of these game changers is found to be in regions of maximum local crowd speed. The presence of such game changers is effective owing to the discontinuous nature of the underlying phase transition. Thus our generic approach provides (i) strategies to delay crush formation and (ii) paths to recover from a crush, two aspects that are of paramount importance in maintaining safety of mass gatherings of people.

physics.soc-ph↗