Related papers: A Note on Kaldi's PLDA Implementation
Recently, we have proposed a new diffusive representation for fractional derivatives and, based on this representation, suggested an algorithm for their numerical computation. From the construction of the algorithm, it is immediately…
We consider general subordination and obtain the formula of the subordinated predictable compensator. An example of application is given.
We extend the {\lambda}-calculus with constructs suitable for relational and functional-logic programming: non-deterministic choice, fresh variable introduction, and unification of expressions. In order to be able to unify…
This short article contains the construction of a construction that generalizes the concept of the derivative of a function of one variable, using the theory of filters. The paper presents a new concept, demonstrates that it really…
The objective of this paper is to present an approximation formula for the Katugampola fractional integral, that allows us to solve fractional problems with dependence on this type of fractional operator. The formula only depends on…
There is a result related to the average number of the $(\delta, \eta)$-LLL bases in dimension $n$ in theoretical sense but the formula seems to be complicated and computing in high dimension takes a long time. In practical sense, we…
We present a short review of the evolution of the methodology of the Method of simplest equation for obtaining exact particular solutions of nonlinear partial differential equations (NPDEs) and the recent extension of a version of this…
The advantages of tabled evaluation regarding program termination and reduction of complexity are well known --as are the significant implementation, portability, and maintenance efforts that some proposals (especially those based on…
An astonishingly simple analytical frequency approximation formula for a class of strongly nonlinear oscillators is derived and applied to various example systems yielding useful quick estimates.
In this note we give some remarks and improvements on a recent paper of us [3] about an optimization problem for the $p-$Laplace operator that were motivated by some discussion the authors had with Prof. Cianchi.
Calculi with control operators have been studied to reason about control in programming languages and to interpret the computational content of classical proofs. To make these calculi into a real programming language, one should also…
The aim of this paper is to derive on the basis of the Euler's formula several analytical relations which hold for certain classes of planar graphs and which can be useful in algorithmic graph theory.
In various subjects, there exist compact and consistent relationships between input and output parameters. Discovering the relationships, or namely compact laws, in a data set is of great interest in many fields, such as physics, chemistry,…
This paper is a contribution to the search for efficient and high-level mathematical tools to specify and reason about (abstract) programming languages or calculi. Generalising the reduction monads of Ahrens et al., we introduce transition…
We provide a proof of strong normalisation for lambda+, a recently introduced, explicitly typed, non-deterministic lambda-calculus where isomorphic propositions are identified. Such a proof is a non-trivial adaptation of the reducibility…
In this Note, we start off with the primary representation of e and from there present an elementary short proof for the Wallis formula for $\pi$.
Juba recently proposed a formulation of learning abductive reasoning from examples, in which both the relative plausibility of various explanations, as well as which explanations are valid, are learned directly from data. The main…
In this paper we present a semantics for a linear algebraic lambda-calculus based on realizability. This semantics characterizes a notion of unitarity in the system, answering a long standing issue. We derive from the semantics a set of…
Studies in thermodynamics often require the reduction of some first or second order partial derivatives in terms of a smaller basic set. A simple algorithm to perform such a reduction is presented here, together with a review of earlier…
Since its establishment, propositional dynamic logic (PDL) has been a subject of intensive academic research and frequent use in the industry. We have studied the complexity of some PDL problems and in this paper, we show results for some…