Muestra como mejorar el servicio prestado por Microtec, garantizando la disponibilidad del hardware y software que se utiliza en el dictado de los cursos haciendo que se interactue con el sistema de matricula para reconocer y permitir el acceso al alumno a través de las computadoras del laboratorio de FIA - DATA a los programas que requiera según su especialidad.

Commutative Gröbner bases theory is well known and widely used. In this thesis, we will discuss thoroughly its generalization to noncommutative polynomial ring <em>k</em><<em>X</em>> which is also an associative free algebra. We introduce some results on monomial orders due to John Lawrence and the author. We show that a noncommutative monomial order is a well order while a one-sided noncommutative monomial order may not be. Then we discuss the generalization of polynomial reductions, S-polynomials and the characterizations of noncommutative Gröbner bases. Some results due to Mora are also discussed, such as the generalized Buchberger's algorithm and the solvability of ideal membership problem for homogeneous ideals. At last, we introduce Newman's diamond lemma and Bergman's diamond lemma and show their relations with Gröbner bases theory.

In this paper, we present a structural video for video retrieval with fractal orthogonal bases composed of the five steps: video summarization (extract key-frames from video), normalized group cuts (classify key-frames), temporal graph (according to key-frames time in video), transformation of a directed graph into string (the process of transformation is one-to-one mapping), and comparison of string similarity (contain of sting architecture and content), to establish the framework of the video contents. With the above-mentioned information, the structure of the video and its complementary knowledge can be built up according to main line and branch line. Therefore, users can not only browse the video efficiently but also focus on the structure what they are interest. In order to construct the fundamental system, we employ distortion metric that extract key-frames from video and classify key-frames according to normalized group cuts that shot are linked together based on their content. After constructing the relation graph, the graph is transformed into string that has enriched structure. The result clusters form a directed graph and a shortest path algorithm is proposed to find main structure of video. In string similarity, it divides into string architecture and content. In string architecture, we adopt edit distance in main structure and recursive branch line. After comparison of string similarity in architecture, it gets the high similarity string comparing with fractal orthogonal bases that guarantee the similar index has the similar image the characteristic union support vector clustering. The results demonstrate that our system can achieve better performance and information coverage.

Thesis (Ph. D.)--University of Oregon, 2000. / Typescript. Includes vita and abstract. Includes bibliographical references (leaves 92-93). Also available for download via the World Wide Web; free to University of Oregon users.

Rapport de recherche bibliographique DESS : Réseaux d'information et document électronique : Villeurbanne, ENSSIB : 2002.

Thèse doctorat : Informatique : Rennes 1 : 2006. / Bibliogr. p. 109-118.

Reproduction de : Thèse de doctorat : informatique : Grenoble, INPG : 1986. / Titre provenant de l'écran-titre. Bibliogr. p. [159]-163.

Reproduction de : Thèse de doctorat : Systèmes industriels : Toulouse, INPT : 2008. / Titre provenant de l'écran-titre. Bibliogr. 150 réf.

Thesis (Ph. D.)--University of Missouri-Columbia, 2001. / Typescript. Vita. Includes bibliographical references. Also available on the Internet.

Thesis (Ph. D.)--University of Missouri-Columbia, 2001. / Typescript. Vita. Includes bibliographical references. Also available on the Internet.