Edinburgh : Young J. Pentland, 1895.

Paris : V. Masson, 1867.

Detroit, Mich. : G.S. Davis, 1891.

London : Longmans, Green, 1902.

London : H.K. Lewis, 1883.

Paris : G. Carre, 1895.

Genova : G. Bonaudo, 1812.

Paris : Masson, 1870.

Officials say a high school baseball coach and his wife were electrocuted while installing a new scoreboard at a Florida baseball field to replace one that had been destroyed by Hurricane Michael.

South Dakota lawmakers have rejected a bill that would have allowed science teachers to discuss strengths and weaknesses of evolutionary and climate change theories.

The legislature sent a proposal last week to Gov. Jim Justice's desk to shutter the state's advisory education and the arts department, leaving the Gayle Manchin and her staff in the lurch.

The justices agreed to decide whether the Eighth Amendment requires a trial court to find that a juvenile is permanently incorrigible before imposing a sentence of life without parole.

In remote regions of rural Alaska, both schools and the students themselves have to work harder to put together an education that meets students' needs.

While thousands of students in wildfire-ravaged Northern California resumed classes last week, thousands of others in Alaska stayed home after a 7.0 magnitude earthquake struck Nov. 30.

An Alaskan high school exchange program works to promote understanding between the state's urban centers and its remote Native Villages and communities.

London : Printed by Mary Clark, and are to be sold by John Clark, at Mercers Chappel at the Lower End of Cheapside, MDCLXXVIII. [1678]

[Rome?] : [publisher not identified], [1807?]

[Dresden? Leipzig?] : Verlag und Eigentum von A.E. Payne, [1848?] (Printed by H. Boulton)

[Manchester] : [James Mudd], [between 1800 and 1899]

London (No. 18 & 19 Southampton Place, Euston Square, New Road) : Published ... by the proprietors [E. & W. Finden], May 1, 1839.

[London?] : Cassell & Company Limited, [between 1800 and 1899]

[Rome?]

Si stampano in Roma (alla Pace ; all'insegna di Parigi) : per Giovan Jacomo Rossi, [1641?]

2003.

A Paris : chez Mondhare, [between 1760 and 1792]

London : James Nisbet & Co., MDCCCLXXX [1880]

London : [Published not identified], 1874.

[Place of publication not identified] : [Publisher not identified], 1895.

[London] : Waterlow Bros. & Layton, Limited, [1893]

(Edin.r [Edinburgh] : Printed by A. Mc.Glashon), [1842]

Capitals forward Evgeny Kuznetsov doesn't consider his series-winning goal against the Penguins in 2018 is the biggest goal of his life.

A small group of science teachers in Missouri is using the coronavirus as a teachable moment that's aligned to the Next Generation Science Standards.

2017

Glasgow : Beatson Institute for Cancer Research, 2008-

Rockville, Maryland : National Institute on Drug Abuse, 1977.

New York : Experimental Manpower Laboratory at Mobilization for Youth, Inc., [1971]

Eunji Lim.

Source: Electronic Journal of Statistics, Volume 14, Number 1, 2053--2097.

Abstract:
We study the asymptotic behavior of the least squares estimators when the model is possibly misspecified. We consider the setting where we wish to estimate an unknown function $f_{*}:(0,1)^{d} ightarrow mathbb{R}$ from observations $(X,Y),(X_{1},Y_{1}),cdots ,(X_{n},Y_{n})$; our estimator $hat{g}_{n}$ is the minimizer of $sum _{i=1}^{n}(Y_{i}-g(X_{i}))^{2}/n$ over $gin mathcal{G}$ for some set of functions $mathcal{G}$. We provide sufficient conditions on the metric entropy of $mathcal{G}$, under which $hat{g}_{n}$ converges to $g_{*}$ as $n ightarrow infty $, where $g_{*}$ is the minimizer of $|g-f_{*}| riangleq mathbb{E}(g(X)-f_{*}(X))^{2}$ over $gin mathcal{G}$. As corollaries of our theorem, we establish $|hat{g}_{n}-g_{*}| ightarrow 0$ as $n ightarrow infty $ when $mathcal{G}$ is the set of monotone functions or the set of convex functions. We also make a connection between the convergence rate of $|hat{g}_{n}-g_{*}|$ and the metric entropy of $mathcal{G}$. As special cases of our finding, we compute the convergence rate of $|hat{g}_{n}-g_{*}|^{2}$ when $mathcal{G}$ is the set of bounded monotone functions or the set of bounded convex functions.

Gregor Pasemann, Wilhelm Stannat.

Source: Electronic Journal of Statistics, Volume 14, Number 1, 547--579.

Abstract:
A parameter estimation problem for a class of semilinear stochastic evolution equations is considered. Conditions for consistency and asymptotic normality are given in terms of growth and continuity properties of the nonlinear part. Emphasis is put on the case of stochastic reaction-diffusion systems. Robustness results for statistical inference under model uncertainty are provided.

Sihai Dave Zhao, Yet Tien Nguyen.

Source: Electronic Journal of Statistics, Volume 14, Number 1, 110--142.

Abstract:
It is frequently of interest to identify simultaneous signals, defined as features that exhibit statistical significance across each of several independent experiments. For example, genes that are consistently differentially expressed across experiments in different animal species can reveal evolutionarily conserved biological mechanisms. However, in some problems the test statistics corresponding to these features can have complicated or unknown null distributions. This paper proposes a novel nonparametric false discovery rate control procedure that can identify simultaneous signals even without knowing these null distributions. The method is shown, theoretically and in simulations, to asymptotically control the false discovery rate. It was also used to identify genes that were both differentially expressed and proximal to differentially accessible chromatin in the brains of mice exposed to a conspecific intruder. The proposed method is available in the R package github.com/sdzhao/ssa.

Guanyang Wang.

Source: Electronic Journal of Statistics, Volume 14, Number 1, 1690--1706.

Abstract:
Uniform sampling of binary matrix with fixed margins is an important and difficult problem in statistics, computer science, ecology and so on. The well-known swap algorithm would be inefficient when the size of the matrix becomes large or when the matrix is too sparse/dense. Here we propose the Rectangle Loop algorithm, a Markov chain Monte Carlo algorithm to sample binary matrices with fixed margins uniformly. Theoretically the Rectangle Loop algorithm is better than the swap algorithm in Peskun’s order. Empirically studies also demonstrates the Rectangle Loop algorithm is remarkablely more efficient than the swap algorithm.