Στο Κεφάλαιο 1 δίνουμε τις έννοιες της ομοιομορφίας και του ομοιόμορφου χώρου. Προσδιορίζεται η σχέση ομοιόμορφων και τοπολογικών χώρων. Αποδεικνύεται ότι ο μονοσήμαντα ορισμένος τοπολογικός χώρος που προσδιορίζει ένας ομοιόμορφος χώρος είναι Tychonoff και ότι κάθε χώρος Tychonoff προσδιορίζεται (όχι μονοσήμαντα) από έναν ομοιόμορφο χώρο. Μελετώνται ιδιότητες των ομοιόμορφων χώρων και παραθέτονται παραδείγματα αυτών. Στο Κεφάλαιο 2 ορίζονται και μελετώνται οι ομοιομόρφως συνεχείς απεικονίσεις και διάφορες ιδιότητες των ομοιόμορφων χώρων. Στο κεφάλαιο 3 ορίζονται και μελετώνται ολικά φραγμένοι, πλήρεις και συμπαγείς ομοιόμορφοι χώροι. Στο Κεφάλαιο 4 δίνονται εφαρμογές των ομοιόμορφων χώρων σε χώρους συναρτήσεων. / -

Thesis (M.Sc. (Mathematics)) - Rhodes University, 2008.

Zugl.: Dortmund, Techn. Univ., Diss., 2007

Thesis (Ph. D.)--University of Wisconsin--Madison, 1970. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.

Using a pseudo-bisymmetric enriched cl-premonoid as the underlying lattice, we examine different categories of lattice-valued spaces. Lattice-valued topological spaces, uniform spaces and limit spaces are described, and we produce a new definition of stratified lattice-valued uniform convergence spaces in this generalised lattice context. We show that the category of stratified L-uniform convergence spaces is topological, and that the forgetful functor preserves initial constructions for the underlying stratified L-limit space. For the case of L a complete Heyting algebra, it is shown that the category of stratified L-uniform convergence spaces is cartesian closed.

No description available.

Given a graph that defines a triangulation of a simply connected surface, it is possible to associate a radius with each vertex so that the vertices represent centers of circles, and the edges denote patterns of tangency. Such a configuration of circles is called a circle packing. We shall give evidence for the existence and uniqueness of circle packings generated by such graphs, as well as an explanation of the algorithms used to find and output a circle packing on the complex plane and hyperbolic disc. / Master of Science

(l,m)-uniform混和超級圖的色譜一定是是連續的, 利用一個技巧讓所有l大於二的(l,m)-uniform混和超級圖都存在一組C-edges 和 D-edges, 使得光譜不連續.最後提供一個演算法, 讓所有l和m 都大於二的(l,m)-uniform混和超級圖, 也存在一組 C-edges 和 D-edges, 使得光譜不連續. 這樣我們就已經討論完所有(l,m)-uniform混和超級圖( l , m 都要大於等於 2), 其光譜是否存在著有不連續的可能. / In this thesis, we study all existences of gap in every kind of (l,m)-uniform mixed hypergraph, where n > 1 and m > 1. We have to divide the topic into three parts: (2,m)-uniform mixed hypergraph where m > 1, (l,2)-uniform mixed hypergraph where l > 2, and (l,m)-uniform mixed hypergraph where l > 2 and m > 2.

No description available.

Student Number : 0006329K - MSc(Eng) Dissertation - School of Electrical and Information Engineering - Faculty of Engineering and the Built Environment / Geometric optimisations are presented for the UTD in SuperNEC which is a commercial electromagnetic software package. Path finding optimisations rapidly find propagation paths of electromagnetic waves by using back face culling to determine the visible plates of polyhedral structures and by using reflection and diffraction zones which use image theory and the law of diffraction to determine illuminated spatial regions. An octree reduces the number of intersections during the shadow tests. Numerical results show that overall the optimisations halve the run time of the software for models which consist of plates and cylinders. The path finding optimisations do not scale with model size, are limited to plates and introduce errors. The mean absolute error due to the path finding optimisations is on average 0:02 dB for first order rays and 0:17 dB for second order rays. The octree optimisation scales with model size, can be used with any geometry and any type of ray and does not cause errors.