Optimal prediction and the Klein-Gordon equation

The method of optimal prediction is applied to calculate the future means of solutions to the Klein-Gordon equation. It is shown that in an appropriate probability space, the difference between the average of all solutions that satisfy certain constraints at time t=0, and the average computed by an approximate method, is small with high probability.Comment: 18 page

Inverse eigenvalue problems for Jacobi matrices

AbstractIt is proved that a real symmetric tridiagonal matrix with positive codiagonal elements is uniquely determined by its eigenvalues and the eigenvalues of the largest leading principal submatrix, and can be constructed from these data. The matrix depends continuously on the data, but because of rounding errors the investigated algorithm might in practice break down for large matrices

An ERP study of anaphor resolution with focused and non-focused antecedents

The goal of this study is to better understand when (and why) the combination of semantic overlap between antecedent and anaphor and antecedent focus leads to difficulty in anaphor processing. To investigate these questions, three ERP experiments manipulating semantic overlap and focus compared the ERPs from the onset of the anaphor as well as from the onset of the last word in the sentence containing the anaphor. Our results suggest that although the focus status of an antecedent and the semantic overlap between the antecedent and anaphor are important, these factors are not the only significant contributors to online anaphor resolution. Factors such as readers‘ expectations about thematic shifts also influence the processing. We consider our results in relation to two accounts of anaphor resolution, the Informational Load Hypothesis (Almor, 1999; Almor & Eimas, 2008) and JANUS (Garnham & Cowles, 2008)