No description available.

We consider optimal design for changepoint problems with particular attention paid to situations where the only possible change is in the mean. Optimal design for changepoint problems has only been addressed in an unpublished doctoral thesis, and in only one journal article, which was in a frequentist setting. The simplest situation we consider is that of a stochastic process that may undergo a, change at an unknown instant in some interval. The experimenter can take n measurements and is faced with one or more of the following optimal design problems: Where should these n observations be taken in order to best test for a change somewhere in the interval? Where should the observations be taken in order to best test for a change in a specified subinterval? Assuming that a change will take place, where should the observations be taken so that that one may best estimate the before-change mean as well as the after-change mean? We take a Bayesian approach, with a risk based on squared error loss, as a design criterion function for estimation, and a risk based on generalized 0-1 loss, for testing. We also use the Spezzaferri design criterion function for model discrimination, as an alternative criterion function for testing. By insisting that all observations are at least a minimum distance apart in order to ensure rough independence, we find the optimal design for all three problems. We ascertain the optimal designs by writing the design criterion functions as functions of the design measure, rather than of the designs themselves. We then use the geometric form of the design measure space and the concavity of the criterion function to find the optimal design measure. There is a straightforward correspondence between the set of design measures and the set of designs. Our approach is similar in spirit, although rather different in detail, from that introduced by Kiefer. In addition, we consider design for estimation of the changepoint itself, and optimal designs for the multipath changepoint problem. We demonstrate why the former problem most likely has a prior-dependent solution while the latter problems, in their most general settings, are complicated by the lack of concavity of the design criterion function. / Nous considérons, dans cette dissertation, les plans d'expérience bayésiens optimauxpour les problèmes de point de rupture avec changement d'espérance. Un cas de pointde rupture avec changement d'espérance à une seule trajectoire se présente lorsqu'uneséquence de données est prélevée le long d'un axe temporelle (ou son équivalent) etque leur espérance change de valeur. Ce changement, s'il survient, se produit à unendroit sur l'axe inconnu de l'expérimentateur. Cet endroit est appelé "point derupture". Le fait que la position du point de rupture soit inconnue rend les tests etl'inférence difficiles dans les situations de point de rupture à une seule trajectoire.

Thesis (Ph. D.)--George Mason University, 2007. / Title from PDF t.p. (viewed Jan. 22, 2008). Thesis director: KC Chang. Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Information Technology. Vita: p. 117. Includes bibliographical references (p. 108-116). Also available in print.

Thesis (Ph.D.)--Baylor University, 2007. / Includes bibliographical references (p. 84-87).

Thesis (Ph.D.) -- McMaster University, 1999. / Includes bibliographical references (leaves 76-79). Also available via World Wide Web.

Thesis (M.S.)--University of North Carolina Wilmington, 2007. / Includes bibliographical references (leaves: 24-25)

Thesis (M.Sc.). / Written for the School of Computer Science. Title from title page of PDF (viewed 2008/01/15). Includes bibliographical references.

Thesis (M.Sc.). / Written for the School of Computer Science. Title from title page of PDF (viewed 2008/05/30). Includes bibliographical references.

Thesis (M.Sc.). / Written for the School of Computer Science. Title from title page of PDF (viewed 2008/12/09). Includes bibliographical references.

Thesis (Ph.D.)--George Mason University, 2008. / Vita: p. 249. Thesis director: Farrokh Alemi. Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computational Sciences and Informatics. Title from PDF t.p. (viewed Mar. 16, 2009). Includes bibliographical references (p. 238-248). Also issued in print.