This paper aims to study the empirical Bayes estimation of the parameter of ЭРланга distribution under a weighted squared error loss function. Bayes estimator is firstly to derive based on pivot method. Then empirical Bayes estimator of unknown parameter is constructed in a priori unknown circumstances. The asymptotically optimal property of this empirical Bayes estimator is also discussed. It ...

The Minimum Description Length principle for online sequence estimation/prediction in a proper learning setup is studied. If the underlying model class is discrete, then the total expected square loss is a particularly interesting performance measure: (a) this quantity is finitely bounded, implying convergence with probability one, and (b) it additionally specifies the convergence speed. For MD...

Multiple testing has been widely adopted for genome-wide studies such as microarray experiments. For effective gene selection in these genome-wide studies, the optimal discovery procedure (ODP), which maximizes the number of expected true positives for each fixed number of expected false positives, was developed as a multiple testing extension of the most powerful test for a single hypothesis b...

F. Tito Arecchi Emeritus of Physics-Università di Firenze and INO-CNR –Firenze Abstract We discuss the two moments of human cognition, namely, apprehension (A),whereby a coherent perception emerges from the recruitment of neuronal groups, and judgment(B),that entails the comparison of two apprehensions acquired at different times, coded in a suitable language and retrieved by memory. (B) entail...

We previously reported that continuous intravenous (IV) administration of nicorandil (NIC) inhibits QT dispersion (QTd). However, no prior study has evaluated the efficacy of NIC when administered orally to acute myocardial infarction (AMI) patients following continuous IV administration. Thirty patients with anteroseptal infarction in whom revascularization was performed successfully within 6 ...

Euclid’s algorithm gives the greatest common divisor (gcd) of two integers, gcd(a, b) = max{d ∈ Z | d|a, d|b} If for simplicity we define gcd(0, 0) = 0, we have a function gcd : Z× Z −→ N with the following properties: Lemma 1 For any a, b, c, q ∈ Z we have: (i) gcd(a, b) = gcd(b, a). (ii) gcd(a,−b) = gcd(a, b). (iii) gcd(a, 0) = |a|. (iv) gcd(a− qb, b) = gcd(a, b). Proof. Trivial; for (iv) use...