We describe two combinatorial problems in the theory of automorphism groups of compact Riemann surfaces of genus two or greater: enumerate the topological actions of a finite group on surfaces and determine the set of genera of surfaces admitting such a group action, called the genus spectrum. We illustrate results...
We describe a series of novel computational models, CERENKOV (Computational Elucidation of the REgulatory NonKOding Variome) and its successors CERENKOV2, CERENKOV3, and Convolutional CERENKOV3, for discriminating regulatory single nucleotide polymorphisms (rSNPs) from non-regulatory SNPs within non-coding genetic loci. The CERENKOV models are designed for recognizing rSNPs in the context of...
Explainable Artificial Intelligence (XAI) systems aim to improve users’ understanding of AI but rarely consider the inclusivity aspects of XAI. Without inclusive approaches, improving explanations might not work well for everyone. This study investigates leveraging users’ diverse problem-solving styles as an inclusive strategy to fix an XAI prototype, with the...
Variation in data is abundant and ubiquitous in real-world applications. Managing variation in databases is, however, difficult and has been extensively studied by the database community. Schema evolution, data integration, and database versioning are examples of well-studied forms of database variation with effective context-specific solutions. However, variation appears in different...
Our goal is to build a system to model the RNA sequences that reveals their structural information by using efficient dynamic programming algorithms and deep learning approaches. We aim to 1) achieve linear-time for RNA secondary structure prediction based on existing minimum free energy models; 2) utilize deep neural networks...
Secure Computation is a powerful tool that enables a set of parties to jointly compute any function over their private inputs, without a trusted third party. Private Set Intersection is a specific case of two-party Secure Computation, where Alice (with private set X) and Bob (with private set Y) specifically...
End-user programmers often struggle to create programs that run quickly and effectively, which can be a major deterrent in completing their tasks as desired. Current research has primarily focused on catching user mistakes, such as errors or misused formulas. However, end users deal with issues other than just correctness. In...