Related papers: The On-Line Encyclopedia of Integer Sequences
This article investigates integer sequences that partition the sequence into blocks of various lengths - irregular arrays. The main result of the article is explicit formulas for numbering of irregular arrays. A generalization of Cantor…
This article is a contribution towards an understanding of Open Access (OA) publishing. It proposes an analysis framework of 18 core attributes, divided into the areas of Bibliographic information, Activity metrics, Economics,…
We present OpenGloss, a synthetic encyclopedic dictionary and semantic knowledge graph for English that integrates lexicographic definitions, encyclopedic context, etymological histories, and semantic relationships in a unified resource.…
A program is a finite piece of data that produces a (possibly infinite) sequence of primitive instructions. From scratch we develop a linear notation for sequential, imperative programs, using a familiar class of primitive instructions and…
A coreset (or core-set) of an input set is its small summation, such that solving a problem on the coreset as its input, provably yields the same result as solving the same problem on the original (full) set, for a given family of problems…
A finite non-increasing sequence of positive integers $d = (d_1\geq \cdots\geq d_n)$ is called a degree sequence if there is a graph $G = (V,E)$ with $V = \{v_1,\ldots,v_n\}$ and $deg(v_i)=d_i$ for $i=1,\ldots,n$. In that case we say that…
OpenSesame is a program for generating tabular equations of state (EOS), with capabilities for multiphase EOS construction. In this tutorial, we provide an overview of how to run OpenSesame to construct a multiphase EOS. We discuss some…
Bayesian networks (BNs) are graphical \emph{first-order} probabilistic models that allow for a compact representation of large probability distributions, and for efficient inference, both exact and approximate. We introduce a…
A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new estimation for the upper bound of B_k sequences.
The sequence $A067549$ of The On-Line Encyclopedia of Integer Sequences is defined as $(a_k)_{k \geq 1}$ with $a_k$ being the determinant of the $k \times k$ matrix whose diagonal contains the first $k$ prime numbers and all other elements…
An Intrusion Detection System (IDS) is a software that monitors a single or a network of computers for malicious activities (attacks) that are aimed at stealing or censoring information or corrupting network protocols. Most techniques used…
Traditional search engines on World Wide Web (WWW) focus essentially on relevance ranking at the page level. But this lead to missing innumerable structured information about real-world objects embedded in static Web pages and online Web…
The comma sequence (1, 12, 35, 94, ...) is the lexicographically earliest sequence such that the difference of consecutive terms equals the concatenation of the digits on either side of the comma separating them. The behavior of a…
This article, written in German language, gives a very elementary introduction to infinite sets. It is meant for interested non-mathematicians.
From the simplest point of view, transseries are a new kind of expansion for real-valued functions. But transseries constitute much more than that--they have a very rich (algebraic, combinatorial, analytic) structure. The set of transseries…
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…
Open information extraction (IE) is the task of extracting open-domain assertions from natural language sentences. A key step in open IE is confidence modeling, ranking the extractions based on their estimated quality to adjust precision…
An Ulam sequence U(1,n) is defined as the sequence starting with integers 1,n such that n > 1, and such that every subsequent term is the smallest integer that can be written as the sum of distinct previous terms in exactly one way. This…
In this article I present IEAD, a new interface for astronomical science databases. It is based on a powerful, yet simple, syntax designed to completely abstract the user from the structure of the underlying database. The programming…
Extracting structured and grounded fact triples from raw text is a fundamental task in Information Extraction (IE). Existing IE datasets are typically collected from Wikipedia articles, using hyperlinks to link entities to the Wikidata…