相关论文: Introduction to the declination function for gerry…
A calculator program has been written to give confidence intervals on branching ratios for rare decay modes (or similar quantities) calculated from the number of events observed, the acceptance factor, the background estimate and the…
Sortition is the practice of delegating public decision-making to randomly selected panels. Recently, it has gained momentum worldwide through its use in citizens' assemblies, sparking growing interest within the computer science community.…
A number system coding for the permutations generated by cyclic shift is described. The system allows to find the rank of a permutation given how it has been generated, and to determine a permutation given its rank. It defines a code…
In this paper, we introduce a new method for calculating fractional integrals and differentials. The method involves an equation that we have obtained from infinite applied integration by parts. The equation works for special class of…
The classical deflection function is a valuable computational tool to investigate reaction mechanisms. It provides, at a glance, detailed information about how the reaction is affected by changes in reactant properties (impact parameter)…
The policy gradient theorem describes the gradient of the expected discounted return with respect to an agent's policy parameters. However, most policy gradient methods drop the discount factor from the state distribution and therefore do…
An electoral spoiler is usually defined as a losing candidate whose removal would affect the outcome by changing the winner. So far, spoiler effects have been analyzed primarily for single-winner electoral systems. We consider this subject…
A vector partition function is the number of ways to write a vector as a non-negative integer-coefficient sum of the elements of a finite set of vectors $\Delta$. We present a new algorithm for computing closed-form formulas for vector…
The objective of this paper is to improve the customary definition of redundancy by providing quantitative measures in its place, which we coin upper and lower redundancies, that match better with an intuitive understanding of redundancy…
We investigate the possibilities to calculate vector partition functions by means of iterated partial fraction decomposition, as suggested by Beck (2004). Particularly, for an important type of families of rational functions, we describe an…
If several independent algorithms for a computer-calculated quantity exist, then one can expect their results (which differ because of numerical errors) to follow approximately Gaussian distribution. The mean of this distribution,…
In min-min optimization or max-min optimization, one has to compute the gradient of a function defined as a minimum. In most cases, the minimum has no closed-form, and an approximation is obtained via an iterative algorithm. There are two…
We propose a simple estimator that allows to calculate the absolute value of a system's partition function from a finite sampling of its canonical ensemble. The estimator utilizes a volume correction term to compensate the effect that the…
We implemented a gradient-based algorithm for transition state search which uses Gaussian process regression. Besides a description of the algorithm, we provide a method to find the starting point for the optimization if only the reactant…
A descent of a labeled acyclic digraph is a directed edge $x\to y$ with $x>y$. In this paper, we find a recurrence for the number of labeled acyclic digraphs with a given number of descents.
In this brief semi-expository article we present a few efficient techniques for calculating and proving determinantal identities. Several stimulating examples of different flavor and applications are spread across the pages which we hope…
In this paper, a new method of detection of election fraud is proposed. This method is based on the calculation of the ratio of two standard normal random variables; estimation of parameters of obtained sample and comparison of these…
This paper considers policy search in continuous state-action reinforcement learning problems. Typically, one computes search directions using a classic expression for the policy gradient called the Policy Gradient Theorem, which decomposes…
We propose here a proof of existence of a minimizer of a segmentation functional based on a priori information on target shapes, and formulated with level sets. The existence of a minimizer is very important, because it guarantees the…
We introduce and motivate generative modeling as a central task for machine learning and provide a critical view of the algorithms which have been proposed for solving this task. We overview how generative modeling can be defined…