相关论文: Voynich Manuscript or Book of Dunstan coding and d…

The record of the beginning of the most widespread legal system in the world is contained in millions of pages of handwritten text. Most of the records of the first centuries of the Anglo-American legal system are hand-written in a highly…

The Winograd Schema Challenge is both a commonsense reasoning and natural language understanding challenge, introduced as an alternative to the Turing test. A Winograd schema is a pair of sentences differing in one or two words with a…

Recognition of handwritten Roman characters and numerals has been extensively studied in the last few decades and its accuracy reached to a satisfactory state. But the same cannot be said while talking about the Devanagari script which is…

We explain how the prototype automatic chess problem composer, Chesthetica, successfully composed a rare and interesting chess problem using the new Digital Synaptic Neural Substrate (DSNS) computational creativity approach. This problem…

This book is a detailed introduction to the theory of finite type (Vassiliev) knot invariants, with a stress on its combinatorial aspects. It is intended to serve both as a textbook for readers with no or little background in this area, and…

This paper is a review of the book "Knots" by Alexei Sossinsky. The review includes a short personal history of knot theory at the end of the twentieth century.

Ancient manuscripts are the primary source of ancient linguistic corpora. However, many ancient manuscripts exhibit duplications due to unintentional repeated publication or deliberate forgery. The Dead Sea Scrolls, for example, include…

Document Visual Question Answering (VQA) aims to understand visually-rich documents to answer questions in natural language, which is an emerging research topic for both Natural Language Processing and Computer Vision. In this work, we…

This is a retyped version of an unpublished manuscript from 1993. It contains proofs of two conjectures of Colliot-Th\'el\`ene, Sansuc and Swinnerton-Dyer on the arithmetic of intersections of two quadrics in the case where the variety…

In this paper, we develop machine learning techniques to identify unknown printers in early modern (c.~1500--1800) English printed books. Specifically, we focus on matching uniquely damaged character type-imprints in anonymously printed…

Interest in the mathematical structure of poetry dates back to at least the 19th century: after retiring from his mathematics position, J. J. Sylvester wrote a book on prosody called $\textit{The Laws of Verse}$. Today there is interest in…

Honey Encryption is an approach to encrypt the messages using low min-entropy keys, such as weak passwords, OTPs, PINs, credit card numbers. The ciphertext is produces, when decrypted with any number of incorrect keys, produces…

A C-program DIANA (DIagram ANAlyser) for the automatic Feynman diagram evaluation is presented. It consists of two parts: the analyzer of diagrams and the interpreter of a special text manipulating language. This language is used to create…

Source coding with a side information "vending machine" is a recently proposed framework in which the statistical relationship between the side information and the source, instead of being given and fixed as in the classical Wyner-Ziv…

Cuneiform writing, an old art style, allows us to see into the past. Aside from Egyptian hieroglyphs, the cuneiform script is one of the oldest writing systems. Many historians place Hebrew's origins in antiquity. For example, we used the…

In this paper, we propose a new dense retrieval model which learns diverse document representations with deep query interactions. Our model encodes each document with a set of generated pseudo-queries to get query-informed, multi-view…

This is a typeset version of Alan Turing's Second World War research paper \textit{The Applications of Probability to Cryptography}. A companion paper \textit{Paper on Statistics of Repetitions} is also available in typeset form from arXiv…

We found a solution of the star puzzle (a path on a chessboard from c5 to d4 in 14 straight strokes) in 14 queen moves, which has been claimed by the author as impossible.

Chiasmus, a debated literary device in Biblical texts, has captivated mystics while sparking ongoing scholarly discussion. In this paper, we introduce the first computational approach to systematically detect chiasmus within Biblical…

Watson-Crick (WK) finite automata work on a Watson-Crick tape representing a DNA molecule. They have two reading heads. In 5'->3' WK automata, the heads move and read the input in opposite physical directions. In this paper, we consider…