Related papers: "A Handbook of Integer Sequences" Fifty Years Late…
The plethora of digitalised historical document datasets released in recent years has rekindled interest in advancing the field of handwriting pattern recognition. In the same vein, a recently published data set, known as ARDIS, presents…
The paperfolding sequences form an uncountable class of infinite sequences over the alphabet $\{ -1, 1 \}$ that describe the sequence of folds arising from iterated folding of a piece of paper, followed by unfolding. In this note we observe…
Since scripts were proposed in the 1970's as an inferencing mechanism for AI and natural language processing programs, there have been few attempts to build a database of scripts. This paper describes a database and lexicon of scripts that…
As the world moves towards being increasingly dependent on computers and automation, building secure applications, systems and networks are some of the main challenges faced in the current decade. The number of threats that individuals and…
Inversion sequences of length $n$ are integer sequences $e_1,\ldots ,e_n$ with $0\le e_i<i$ for all $i$, which are in bijection with the permutations of length $n$. In this paper, we classify all Wilf equivalence classes of pattern-avoiding…
Inversion sequences are integer sequences $e=e_{1}e_{2}\dots e_{n}$ such that $0\leq e_{i}<i$ for each $i$. The study of patterns in inversion sequences was initiated by Corteel--Martinez--Savage--Weselcouch and Mansour--Shattuck in the…
We classify all of the groups with twelve or fewer subgroups. This paper is the proof of the entries in a submission to the Online Encyclopedia of Integer Sequences.
Given a finite nonempty sequence S of integers, write it as XY^k, where Y^k is a power of greatest exponent that is a suffix of S: this k is the curling number of S. The Curling Number Conjecture is that if one starts with any initial…
The order-preserving encryption (OPE) problem was initially formulated by the database community in 2004 soon after the paradigm database-as-a-service (DaaS) was coined in 2002. Over the past two decades, OPE has drawn tremendous research…
Let $f(n,k)$ be the largest number of positive integers not exceeding $n$ from which one cannot select $k+1$ pairwise coprime integers, and let $E(n,k)$ be the set of positive integers which do not exceed $n$ and can be divided by at least…
Index structures are a building block of query processing and computer science in general. Since the dawn of computer technology there have been index structures. And since then, a myriad of index structures are being invented and published…
The resolution of intelligence tests, in particular numerical sequences, has been of great interest in the evaluation of AI systems. We present a new computational model called KitBit that uses a reduced set of algorithms and their…
This survey focuses on intrusion detection systems (IDS) that leverage host-based data sources for detecting attacks on enterprise network. The host-based IDS (HIDS) literature is organized by the input data source, presenting targeted…
This paper introduces a comprehensive database for research and investigation on the effects of inheritance on handwriting. A database has been created that can be used to answer questions such as: Is there a genetic component to…
The sequence A000975 in OEIS can be defined by $A_1=1$, $A_{n+1}=2A_n$ if $n$ is odd, and $A_{n+1}=2A_n+1$ if $n$ is even. This sequence satisfies other recurrence relations, admits some closed formulas, and is known to enumerate several…
The Archive Query Log (AQL) is a previously unused, comprehensive query log collected at the Internet Archive over the last 25 years. Its first version includes 356 million queries, 166 million search result pages, and 1.7 billion search…
Describing and analysing learner behaviour using sequential data and analysis is becoming more and more popular in Learning Analytics. Nevertheless, we found a variety of definitions of learning sequences, as well as choices regarding data…
Park et al. [1] reported a decline in the disruptiveness of scientific and technological knowledge over time. Their main finding is based on the computation of CD indices, a measure of disruption in citation networks [2], across almost 45…
We show that the number of members of S_n avoiding any one of five specific triples of 4-letter patterns is given by sequence A111279 in OEIS, which is known to count weak sorting permutations. By numerical evidence, there are no other…
The Ulam sequence is defined as $a_1 =1, a_2 = 2$ and $a_n$ being the smallest integer that can be written as the sum of two distinct earlier elements in a unique way. This gives $$1, 2, 3, 4, 6, 8, 11, 13, 16, 18, 26, 28, 36, 38, 47,…