Reproduction de : Thèse d'exercice : Médecine vétérinaire : Toulouse 3 : 2008. / Titre provenant de l'écran titre. Bibliogr. p. 53-64.

The analysis of searching optimization tasks and methods at work have been performed, rules of constructing simplex, its motion rules have been presented. The methods of simplex search analysis have been investigated; simplex search methods compared to other optimization methods. The analysis of statistical characteristics of rectangular simplex search was made using multiple Markov chains. Double Markov chains describing properties of rectangular simplex search in the climbing stage were designed, simplex search statistical characteristics calculating methodic was created. Theoretical statistical characteristics – probabilities of search steps, mathematical expectancy of shift of the simplex center towards the aim – which let us evaluate the velocity of rectangular simplex search in the climbing stage and reveal its features were obtained. Rectangular simplex search with two and three controlled variables was analyzed experimentally. Theoretical characteristics are confirmed by the results of modeling the search. The task of filter structure synthesis was solved using simplex search method. The results and conclusions of the research can be used in creating new algorithms of simplex search.

This thesis details a method of enumerating bases of hyperplane arrangements up to symmetries. I consider here automorphisms, geometric symmetries which leave the set of all points contained in the arrangement setwise invariant. The algorithm for basis enumeration described in this thesis is a backtracking search over the adjacency graph implied on the bases by minimum-ratio simplex pivots, pruning at bases symmetric to those already seen. This work extends Bremner, Sikiri c, and Sch urmann's method for basis enumeration of polyhedra up to symmetries, including a new pivoting rule for nding adjacent bases in arrangements, a method of computing automorphisms of arrangements which extends the method of Bremner et al. for computing automorphisms of polyhedra, and some associated changes to optimizations used in the previous work. I include results of tests on ACEnet clusters showing an order of magnitude speedup from the use of C++ in my implementation, an up to 3x speedup with a 6-core parallel variant of the algorithm, and positive results from other optimizations.

No description available.

Thesis (Ph.D.) -- McMaster University, 1998. / Includes bibliographical references (leaves 195-230). Also available via World Wide Web.

Thesis (Ph.D.)--McMaster University (Canada), 1996. / Source: Dissertation Abstracts International, Volume: 57-10, Section: B, page: 6096. Adviser: J. P. Capone.

Diss. (sammanfattning) Göteborg : Göteborgs universitet, 2006. / Härtill 4 uppsatser.

Thesis (Ph. D.)--School of Pharmacy and Dept. of Chemistry. University of Missouri--Kansas City, 2007. / "A dissertation in pharmaceutical sciences and chemistry." Advisor: Ashim K. Mitra. Typescript. Vita. Description based on contents viewed July 16, 2008; title from "catalog record" of the print edition. Includes bibliographical references (leaves 173-182). Online version of the print edition.

Thèse (Ph. D.)--Université Laval, 2007. / Titre de l'écran-titre (visionné le 5 mai 2008). Bibliogr.

Thèse (M.Sc.)--Université Laval, 2001. / Bibliogr.: f. 86-96. Publié aussi en version électronique.