Related papers: Almost associative operations generating a minimal…
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
Binary code clone analysis is an important technique which has a wide range of applications in software engineering (e.g., plagiarism detection, bug detection). The main challenge of the topic lies in the semantics-equivalent code…
We conduct cluster analysis on a class of locally asymptotically self-similar stochastic processes, which includes multifractional Brownian motion as a representative. When the true number of clusters is supposed to be known, a new…
Nearest-neighbor spin correlations are considered near the surface of a semi-infinite spin-$\frac12$ Heisenberg antiferromagnet on a simple cubic lattice. In the spin-wave approximation, the excitation spectrum of this model involves bulk…
We prove collective versions of semi-duality theorems for sets of almost (limitedly, order) L-weakly compact operators.
In recent work of the authors the notion of a derivation being approximately semi-inner arose as a tool for investigating (approximate) amenability questions for Banach algebras. Here we investigate this property in its own right, together…
Approximate Bayesian computation (ABC) is commonly used for parameter estimation and model comparison for intractable simulator-based models whose likelihood function cannot be evaluated. In this paper we instead investigate the feasibility…
Various versions of the classical definitions of (one- and twosided) almost periodicity for functions on groups with values in a uniform space are formulated and their equivalence is shown.
A strict interpretation of connectionism mandates complex networks of simple components. The question here is, is this simplicity to be interpreted in absolute terms? I conjecture that absolute simplicity might not be an essential attribute…
Binary code similarity detection is to detect the similarity of code at binary (assembly) level without source code. Existing works have their limitations when dealing with mutated binary code generated by different compiling options. In…
Compressed bitmap indexes are used to speed up simple aggregate queries in databases. Indeed, set operations like intersections, unions and complements can be represented as logical operations (AND,OR,NOT) that are ideally suited for…
The aim of this paper is to present the main constructions of the substructures of an almost groupoid and to discuss their basic properties. The definitions and properties concerning these new algebraic constructions extend to almost…
A complete characterization of the similarity between two operator-valued multishifts with invertible operator weights is obtained purely in terms of operator weights. This generalizes several existing results of the unitary equivalence of…
In this paper we introduce an equivalence relation on the classes of almost periodic functions of a real or complex variable which is used to refine Bochner's result that characterizes these spaces of functions. In fact, with respect to the…
If a function $f$, acting on a Euclidean space $\mathbb{R}^n$, is "almost" orthogonally additive in the sense that $f(x+y)=f(x)+f(y)$ for all $(x,y)\in\bot\setminus Z$, where $Z$ is a "negligible" subset of the $(2n-1)$-dimensional manifold…
The goal of this paper is to describe the application of quasi-likelihood estimating equations for spatially correlated binary data. In this paper, a logistic function is used to model the marginal probability of binary responses in terms…
A specific family of point processes are introduced that allow to select samples for the purpose of estimating the mean or the integral of a function of a real variable. These processes, called quasi-systematic processes, depend on a tuning…
Graph signals are functions of the underlying graph. When the edge-weight between a pair of nodes is high, the corresponding signals generally have a higher correlation. As a result, the signals can be represented in terms of a graph-based…
The aim of this paper is to extend the approximate quasi-interpolation on a uniform grid by dilated shifts of a smooth and rapidly decaying function on a uniform grid to scattered data quasi-interpolation. It is shown that high order…
In this paper we show that the negative sample distance covariance function is a quasi-concave set function of samples of random variables that are not statistically independent. We use these properties to propose greedy algorithms to…