We prove that, for the uniform distribution over all sets X of m (that is a fixed integer) non-empty words whose sum of lengths is n, DX , one of the usual deterministic automata r...
This paper describes our experiences in the design and implementation of a network for security training exercises, and one such exercise. The network described herein is flexible...
Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missing...
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
We start by describing all the varieties of loops Q that can be defined by autotopisms x, x Q, where x is a composition of two triples, each of which becomes an autotopism when th...