Related papers: Theoretical Count of Function Points for Non-Measu…
Let $k$ be a finite field extension of the function field $\bfF_p(T)$ and $\bar{k}$ its algebraic closure. We count points in projective space $\Bbb P ^{n-1}(\bar{k})$ with given height and of fixed degree $d$ over the field $k$. If…
Cover's function counting theorem is a milestone in the theory of artificial neural networks. It provides an answer to the fundamental question of determining how many binary assignments (dichotomies) of $p$ points in $n$ dimensions can be…
For any pair of bounded observables $A$ and $B$ with pure point spectra, we construct an associated "joint observable" which gives rise to a notion of a joint (projective) measurement of $A$ and $B$, and which conforms to the intuition that…
In this Letter we investigate the concept of quantum work and its measurability from the viewpoint of quantum measurement theory. Very often, quantum work and fluctuation theorems are discussed in the framework of projective two-point…
Unfair metrical task systems are a generalization of online metrical task systems. In this paper we introduce new techniques to combine algorithms for unfair metrical task systems and apply these techniques to obtain improved randomized…
This paper considers the problem of multi-sample nonparametric comparison of counting processes with panel count data, which arise naturally when recurrent events are considered. Such data frequently occur in medical follow-up studies and…
Data on count processes arise in a variety of applications, including longitudinal, spatial and imaging studies measuring count responses. The literature on statistical models for dependent count data is dominated by models built from…
Cost functions provide a framework for constructions of sets Turing below the halting problem that are close to computable. We carry out a systematic study of cost functions. We relate their algebraic properties to their expressive…
The aim of online monitoring is to issue an alarm as soon as there is significant evidence in the collected observations to suggest that the underlying data generating mechanism has changed. This work is concerned with open-end,…
Measurements are shown to be processes designed to return figures: they are effective. This effectivity allows for a formalization as Turing machines, which can be described employing computation theory. Inspired in the halting problem we…
The concept of measurability of functions on a charge space is generalised for functions taking values in a uniform space. Several existing forms of measurability generalise naturally in this context, and new forms of measurability are…
We present the concept of the \emph{information efficiency of functions} as a technique to understand the interaction between information and computation. Based on these results we identify a new class of objects that we call…
We propose a definition of quantum computable functions as mappings between superpositions of natural numbers to probability distributions of natural numbers. Each function is obtained as a limit of an infinite computation of a quantum…
There are so many models in the literature that it is difficult for practitioners to decide which combinations are likely to be effective for a new task. This paper attempts to address this question by capturing relationships among…
The ideal probabilistic forecast for a random variable $Y$ based on an information set $\mathcal{F}$ is the conditional distribution of $Y$ given $\mathcal{F}$. In the context of point forecasts aiming to specify a functional $T$ such as…
The object of this lecture is to propose a series of conjectures and problems in different fields of analysis. They have been formulated with the aim of introducing some innovative methods in the study of classical topics, as open mappings,…
Functionals are an important research subject in Mathematics and Computer Science as well as a challenge in Information Technologies where the current programming paradigm states that only symbolic computations are possible on higher order…
The Function point analysis (FPA) method is the preferred scheme of estimation for project managers to determine the size, effort, schedule, resource loading and other such parameters. The FPA method by International Function Point Users…
In this paper we present a new object counting method that is intended for counting similarly sized and mostly round objects. Unlike many other algorithms of the same purpose, the proposed method does not rely on identifying every object,…
Model counting is the task of computing the number of assignments to variables V that satisfy a given propositional theory F. Model counting is an essential tool in probabilistic reasoning. In this paper, we introduce the problem of model…