By using Euler-Maclaurin's summation formula and the way of real analysis, a more accurate multipleHilbert-type inequality and the equivalent form are given. We also prove that the same constantfactor in the equivalent inequalities is the best possible.

The length of equal minimal and maximal blocks has eected on logarithm-scale logarithm against sequential function on variance and bias of de-trended uctuation analysis, by using Quasi Monte Carlo(QMC) simulation and Cholesky decompositions, minimal block couple and maximal are founded which are minimum the summation of mean error square in Horest power.

Abstract. By multidimensional matrix inversion, combined with an Ar extension of Jackson’s 8φ7 summation formula by Milne, a new multivariable 8φ7 summation is derived. By a polynomial argument this 8φ7 summation is transformed to another multivariable 8φ7 summation which, by taking a suitable limit, is reduced to a new multivariable extension of the nonterminating 6φ5 summation. The latter is ...

We give elementary derivations of some classical summation formulae for bilateral (basic) hypergeometric series. In particular, we apply Gauß’ 2F1 summation and elementary series manipulations to give a simple proof of Dougall’s 2H2 summation. Similarly, we apply Rogers’ nonterminating 6φ5 summation and elementary series manipulations to give a simple proof of Bailey’s very-well-poised 6ψ6 summ...

by using euler-maclaurin's summation formula and the way of real analysis, a more accurate multiplehilbert-type inequality and the equivalent form are given. we also prove that the same constantfactor in the equivalent inequalities is the best possible.

The process of predicting news stories popularity from several news sources has become a challenge of great importance for both news producers and readers. In this paper, we investigate methods for automatically predicting the number of clicks on a news story during one hour. Our approach is a combination of additive regression and bagging applied over a M5P regression tree using a logarithmic ...

If G = (V, E, σ) is a finite signed graph, a function f : V → {−1, 0, 1} is a minusdominating function (MDF) of G if f(u) +summation over all vertices v∈N(u) of σ(uv)f(v) ≥ 1 for all u ∈ V . In this paper we characterize signed paths and cycles admitting an MDF.