We review some existing methods for the computation of first order moments on
junction trees using Shafer-Shenoy algorithm. First, we consider the problem of
first order moments computation as vertices problem in junction trees. In this
way, the problem is solved using the memory space of an order of the junction
tree edge-set cardinality. After that, we consider two algorithms,
Lauritzen-Nilsson algorithm, and Mau\'a et al.
Message passing over factor graph can be considered as generalization of many
well known algorithms for efficient marginalization of multivariate function. A
specific instance of the algorithm is obtained by choosing an appropriate
commutative semiring for the range of the function to be marginalized. Some
examples are Viterbi algorithm, obtained on max-product semiring and
forward-backward algorithm obtained on sum-product semiring. In this paper,
Entropy Message Passing algorithm (EMP) is developed. It operates over entropy
semiring, previously introduced in automata theory.
Based on the fractional $q$-integral with the parametric lower limit of
integration, we define fractional $q$-derivative of Riemann-Liouville and
Caputo type. The properties are studied separately as well as relations between
them. Also, we discuss properties of compositions of these operators.
Based on the fractional $q$-integral with the parametric lower limit of
integration, we define fractional $q$-derivative of Riemann-Liouville and
Caputo type. The properties are studied separately as well as relations between
them. Also, we discuss properties of compositions of these operators.