Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Paul Trow"'
Autor:
Byron C. Wallace, Issa J. Dahabreh, Thomas A. Trikalinos, Joseph Lau, Paul Trow, Christopher H. Schmid
Publikováno v:
Journal of Statistical Software, Vol 49, Iss 5 (2012)
The R environment provides a natural platform for developing new statistical methods due to the mathematical expressiveness of the language, the large number of existing libraries, and the active developer community. One drawback to R, however, is th
Externí odkaz:
https://doaj.org/article/56e50fbc7c9a46969eeeb2c4926a8523
Autor:
Paul Trow
Publikováno v:
Evening Standard. 6/4/2020, p11. 1p.
Autor:
Arunava Chakravartty, Yan Sun, Viswanath Devanarayan, Paul Trow, Saptarshi Chatterjee, Lu Tian, Xin Huang
Publikováno v:
Statistics in Medicine. 36:1414-1428
Causal mechanism of relationship between the clinical outcome (efficacy or safety endpoints) and putative biomarkers, clinical baseline, and related predictors is usually unknown and must be deduced empirically from experimental data. Such relationsh
Autor:
Anthony Quas, Paul Trow
Publikováno v:
Israel Journal of Mathematics. 124:333-365
A group shift is a proper closed shift-invariant subgroup ofG ℤ 2 whereG is a finite group. We consider a class of group shifts in whichG is a finite field and show that mixing is a necessary and sufficient condition on such a group shift for all c
Autor:
Anthony Quas, Paul Trow
Publikováno v:
Ergodic Theory and Dynamical Systems. 20:859-874
We show that every shift of finite type $X$ with positive entropy has proper subshifts of finite type with entropy strictly smaller than the entropy of $X$, but with entropy arbitrarily close to the entropy of $X$. Consequently, $X$ contains an infin
Autor:
Paul Trow
Publikováno v:
Monatshefte f�r Mathematik. 125:327-342
We define a class of factor maps between sofic shifts, called lifting maps, which generalize the closing maps. We show that an irreducible sofic shiftS has only finitely manyS-conjugacy classes of minimal left (or right) lifting covers. The number of
Autor:
Paul Trow
Publikováno v:
Monatshefte f�r Mathematik. 125:165-172
We describe all possible decompositions of a finite-to-one factor map θ: ∑A→S, from an irreducible shift of finite type onto a sofic shift, into two maps θ=γϕ, such that the range of ϕ is a shift of finite type, and γ is bi-closing. We also
Autor:
Paul Trow
Publikováno v:
Israel Journal of Mathematics. 91:129-155
We examine the question of when a finite-to-one factor map θ: ∑A →S, from a shift of finite type onto a sofic shift, can be decomposed as a left closing map (onto a shift of finite type) followed by a right closing map (or vice versa). We give a
Autor:
Christopher H. Schmid, Byron C. Wallace, Issa J Dahabreh, Joseph Lau, Thomas A Trikalinos, Paul Trow
Publikováno v:
Journal of Statistical Software; Vol 49 (2012); 1-15
Journal of Statistical Software, Vol 49, Iss 5 (2012)
Journal of Statistical Software, Vol 49, Iss 5 (2012)
The R environment provides a natural platform for developing new statistical methods due to the mathematical expressiveness of the language, the large number of existing libraries, and the active developer community. One drawback to R, however, is th
Autor:
Susan G. Williams, Paul Trow
Publikováno v:
Ergodic Theory and Dynamical Systems. 13:213-224
We give constraints on the existence of factor maps between sofic shifts. These constraints yield examples of sofic shifts of entropy lognwhich do not factor onto the fulln-shift. We also show that any prime which divides the degree of an endomorphis