shonhiwa13. 132KB Jun 04 2011 12:09:30 AM
Teks penuh
Garis besar
Dokumen terkait
In fact, a neural network of three layers was used, the first layer having n input neurons and the third m output neurons. For the neural network driving the set of input data is
We give a more practical variant of Shanks’ 1954 algorithm for computing the continued fraction of logb a , for integers a > b > 1, using the floor and ceiling functions and
Keywords: binomial coefficient, maximal exponent of a prime dividing an integer, p-ary expansion of integer, Kummer’s theorem.. (Concerned with
In the final section, Section 4 , we give two related sequences σ ( n ) and δ ( n ) which are permutations of the nonnegative integers, and a second downward-sloping sequence which
In this paper we give a unified asymptotic formula for the partial gcd-sum function. 10771127) and National Natural Science Foundation of Shandong Province(Grant No.. This is
We give a greedy algorithm for describing an enumeration of the set of all natural numbers such that the sum of the first n terms of the sequence is divisible by n for each
In discrete time, studies of quantitative convergence rates have been motivated largely by Markov chain Monte Carlo algorithms (see Gelfand and Smith, 1990; Smith and Roberts,
This investigation is motivated by a result we proved recently for the random transposition random walk: the distance from the starting point of the walk has a phase transition from
