Related papers: A virtual substitution of Brouwer choice sequence
Motivated by real-world machine learning applications, we consider a statistical classification task in a sequential setting where test samples arrive sequentially. In addition, the generating distributions are unknown and only a set of…
In contrast to other constructivist schools, for Brouwer, the notion of "constructive object" is not restricted to be presented as `words' in some finite alphabet of symbols, and choice sequences which are non-predetermined and unfinished…
This paper considers a network of infinite-server queues with the special feature that, triggered by specific events, the network population vector may undergo a linear transformation (a `multiplicative transition'). For this model we…
A sequence function alternative representation of state machines.
This is the third paper in a series devoted to enumerating the prime alternating knots and links. This paper establishes a method for enumerating the prime alternating links. It is shown that one may choose any prime alternating link…
We present an extension of the in-place BWT algorithm of Crochemore et al. [8] that enables the construction of the Lyndon array using O(1) extra space. Our approach incrementally maintains the lexicographic ranks of the suffixes during the…
A superpermutation is a sequence that contains every permutation of $n$ distinct symbols as a contiguous substring. For instance, a valid example for three symbols is a sequence that contains all six permutations. This paper introduces a…
We introduce the multiplexing of a crossing, replacing a classical crossing of a virtual link diagram with multiple crossings which is a mixture of classical and virtual. For integers $m_{i}$ $(i=1,\ldots,n)$ and an ordered $n$-component…
In this article we extend the elegant in-place Burrows-Wheeler transform (BWT) algorithm proposed by Crochemore et al. (Crochemore et al., 2015). Our extension is twofold: we first show how to compute simultaneously the longest common…
Following an idea due to Euler, we evaluate the alternating sums of powers of consrcutive integers.
Given a countable alphabet and a sountable set pf preset frequency, we construct a sequence where each letter appears with the preaasigned frequency.
Citizens' assemblies are an increasingly influential form of deliberative democracy, where randomly selected people discuss policy questions. The legitimacy of these assemblies hinges on their representation of the broader population, but…
In recent years, computer simulations are playing a fundamental role in unveiling some of the most intriguing features of prime numbers. In this work, we define an algorithm for a deterministic walk through a two-dimensional grid that we…
This note describes a constructive heuristic to select frequencies of interest within the context of reduced-order modelling by interpolation. The approach is described here through the Loewner framework. Numerical illustrations highlight…
Quantification is well known to be a major obstacle in the construction of a probabilistic network, especially when relying on human experts for this purpose. The construction of a qualitative probabilistic network has been proposed as an…
Based on Euclid's algorithm, we find a kind of special sequences which play an interesting role in the study of primes. We call them W Sequences. They not only ties up the distribution of primes in short interval but also enables us to give…
Quite often, verification tasks for distributed systems are accomplished via counter abstractions. Such abstractions can sometimes be justified via simulations and bisimulations. In this work, we supply logical foundations to this practice,…
The notion of the Fibonacci cobweb poset from [1] has been naturally extended to any admissible sequence $F$ in [2] where it was also recognized that the celebrated prefab notion of Bender and Goldman [3] - (see also [4,5]) - admits such an…
Given a pair of multivariate time-series data of the same length and dimensions, an approach is proposed to select variables and time intervals where the two series are significantly different. In applications where one time series is an…
The goal of confidence-set learning in the binary classification setting is to construct two sets, each with a specific probability guarantee to cover a class. An observation outside the overlap of the two sets is deemed to be from one of…