Thesis (M.A. Sc.)--University of Toronto, 2004. / Adviser: J.D. DeLaurier.

No description available.

Offshore wind has proved to be one of the most reliable and clean energy sources over the last few years. The industry has experienced a significant growth, with an increase of 101% only in 2017 compared to 2016. This raises the importance of the need for more secure power supply systems, which can be used for controlling the offshore farms during disconnections from the main grid. Nowadays, diesel generators are being used to feed auxiliary services of the offshore wind turbines in situations of emergency. However, as the marine renewable energy industry evolves, tidal energy parks have the potential to replace diesel generators and provide a more sustainable and eco-friendly solution for a long-term auxiliary power system. Moreover, they have the potential to produce extra power, which can be either stored for future use or linked directly to distribution. This report demonstrates a technical, financial and environmental assessment of a potential tidal park within an offshore wind park. Comparison with alternative sources for emergency power supply is also performed. Three alternative locations with high wind speeds and large tidal resource around the UK coast and four different groups of tidal devices are evaluated and compared for the implementation of this solution with the use of ArcGIS maps and other accessible marine data. The Aberdeen wind farm and the tidal kites are selected for further investigation and cost analysis. Seven tidal kites with average power 700 kW and rated power 3.5 MW can provide adequate power to the offshore wind farm for three months without grid connection, whereas they can also provide excess of energy on daily basis when grid disconnection does not occur. The total cost for the project would be approximately 301.6 MSEK. Due to the current renewable energy market, the project is not feasible without high investment risks. However, this study should be evaluated again in the near future when the cost of the tidal device will be further decreased. / Havsbaserad vind har visat sig vara en av de mest tillförlitliga och rena energikällorna under senare år. Inom denna industri har en betydande tillväxt skett, med en ökning med 101% år 2017 jämfört med 2016. Detta relaterar till behovet av säkra elförsörjningssystem, som kan användas för att styra havsbaserade vindraftverksparker under urkoppling från huvudnätet. Numera används dieselgeneratorer som reservkälla till havsvindkraftverk i nödsituationer. Men när den marina förnybara energiindustrin utvecklas, har tidvattenkraftverk potential att ersätta dieselgeneratorer och ge ett mer hållbar och miljövänlig långtidslösning. Dessutom har de potential att producera extra el, som antingen kan lagras för framtida användning eller kopplas direkt till distributionsnätet. Denna rapport erbjuder en teknisk, finansiell och miljömässig bedömning av en potentiell tidvattenkraftverkspark kopplad till en havsvindpark. Jämförelse med alternativa källor för strömförsörjning genomförs också. Tre alternativa platser med hög vindstyrka och stora tidvattenresurser längs Storbritanniens kust och fyra olika grupper av tidvattenanordningar utvärderas och jämförs med hjälp av kartor och andra tillgängliga marina data. Aberdeen vindkraftpark och tidvattendrakar väljs för ytterligare undersökning och kostnadsanalys. Sju tidvattendrakar med genomsnittlig effekt på 700 kW och nominell effekt 3,5 MW kan ge tillräckligt med el till havsvindkraftverk i tre månader utan nätförbindelse, medan de också kan ge överflöd av energi dagligen när strömavbrott inte förekommer. Den totala kostnaden för projektet skulle vara cirka 301,6 MSEK. På grund av läget idag på elmarknaden för förnybar energi, är projektet inte genomförbart utan höga investeringsrisker. Men den här studien bör utvärderas igen inom en snar framtid när kostnaden för tidvattenanordningen har minskat.

An experiential thesis, this document begins at dawn, travels through storms and calm air and ends at night in Argentina. It details the circumstances and influences leading to my thesis exhibition at the Anderson Gallery, including an artist’s statement told through a creative reading of Ray Bradbury’s “All Summer in a Day” and the excitement I found in an out-of-print text on scuba diving.

Les Graphes sont des structures mathématiques puissantes constituant un outil de modélisation universel utilisé dans différents domaines de l'informatique, notamment dans le domaine de la reconnaissance de formes. L'appariement de graphes est l'opération principale dans le processus de la reconnaissance de formes à base de graphes. Dans ce contexte, trouver des solutions d'appariement de graphes, garantissant l'optimalité en termes de précision et de temps de calcul est un problème de recherche difficile et d'actualité. Dans cette thèse, nous nous intéressons à la résolution de ce problème dans deux domaines : la reconnaissance de formes 2D et 3D. Premièrement, nous considérons le problème d'appariement de graphes géométriques et ses applications sur la reconnaissance de formes 2D. Dance cette première partie, la reconnaissance des Kites (structures archéologiques) est l'application principale considérée. Nous proposons un "framework" complet basé sur les graphes pour la reconnaissance des Kites dans des images satellites. Dans ce contexte, nous proposons deux contributions. La première est la proposition d'un processus automatique d'extraction et de transformation de Kites a partir d'images réelles en graphes et un processus de génération aléatoire de graphes de Kites synthétiques. En utilisant ces deux processus, nous avons généré un benchmark de graphes de Kites (réels et synthétiques) structuré en 3 niveaux de bruit. La deuxième contribution de cette première partie, est la proposition d'un nouvel algorithme d'appariement pour les graphes géométriques et par conséquent pour les Kites. L'approche proposée combine les invariants de graphes au calcul de l'édition de distance géométrique. Deuxièmement, nous considérons le problème de reconnaissance des formes 3D ou nous nous intéressons à la reconnaissance d'objets déformables représentés par des graphes c.à.d. des tessellations de triangles. Nous proposons une décomposition des tessellations de triangles en un ensemble de sous structures que nous appelons triangle-étoiles. En se basant sur cette décomposition, nous proposons un nouvel algorithme d'appariement de graphes pour mesurer la distance entre les tessellations de triangles. L'algorithme proposé assure un nombre minimum de structures disjointes, offre une meilleure mesure de similarité en couvrant un voisinage plus large et utilise un ensemble de descripteurs qui sont invariants ou au moins tolérants aux déformations les plus courantes. Finalement, nous proposons une approche plus générale de l'appariement de graphes. Cette approche est fondée sur une nouvelle formalisation basée sur le problème de mariage stable. L'approche proposée est optimale en terme de temps d'exécution, c.à.d. la complexité est quadratique O(n2), et flexible en terme d'applicabilité (2D et 3D). Cette approche se base sur une décomposition en sous structures suivie par un appariement de ces structures en utilisant l'algorithme de mariage stable. L'analyse de la complexité des algorithmes proposés et l'ensemble des expérimentations menées sur les bases de graphes des Kites (réelle et synthétique) et d'autres bases de données standards (2D et 3D) attestent l'efficacité, la haute performance et la précision des approches proposées et montrent qu'elles sont extensibles et générales / Graphs are powerful mathematical modeling tools used in various fields of computer science, in particular, in Pattern Recognition. Graph matching is the main operation in Pattern Recognition using graph-based approach. Finding solutions to the problem of graph matching that ensure optimality in terms of accuracy and time complexity is a difficult research challenge and a topical issue. In this thesis, we investigate the resolution of this problem in two fields: 2D and 3D Pattern Recognition. Firstly, we address the problem of geometric graphs matching and its applications on 2D Pattern Recognition. Kite (archaeological structures) recognition in satellite images is the main application considered in this first part. We present a complete graph based framework for Kite recognition on satellite images. We propose mainly two contributions. The first one is an automatic process transforming Kites from real images into graphs and a process of generating randomly synthetic Kite graphs. This allowing to construct a benchmark of Kite graphs (real and synthetic) structured in different level of deformations. The second contribution in this part, is the proposition of a new graph similarity measure adapted to geometric graphs and consequently for Kite graphs. The proposed approach combines graph invariants with a geometric graph edit distance computation. Secondly, we address the problem of deformable 3D objects recognition, represented by graphs, i.e., triangular tessellations. We propose a new decomposition of triangular tessellations into a set of substructures that we call triangle-stars. Based on this new decomposition, we propose a new algorithm of graph matching to measure the distance between triangular tessellations. The proposed algorithm offers a better measure by assuring a minimum number of triangle-stars covering a larger neighbourhood, and uses a set of descriptors which are invariant or at least oblivious under most common deformations. Finally, we propose a more general graph matching approach founded on a new formalization based on the stable marriage problem. The proposed approach is optimal in term of execution time, i.e. the time complexity is quadratic O(n2) and flexible in term of applicability (2D and 3D). The analyze of the time complexity of the proposed algorithms and the extensive experiments conducted on Kite graph data sets (real and synthetic) and standard data sets (2D and 3D) attest the effectiveness, the high performance and accuracy of the proposed approaches and show that the proposed approaches are extensible and quite general

Made available in DSpace on 2016-06-02T20:29:23Z (GMT). No. of bitstreams: 1 5367.pdf: 8650651 bytes, checksum: f63fc85c0b663ccff039904b9585b798 (MD5) Previous issue date: 2013-08-19 / Financiadora de Estudos e Projetos / In this paper we propose a learning process using as a theoretical base called Didactic Engineering. Our proposal is to develop content from the flat geometry of a problem related to kites. Using as a theoretical framework Didactic Engineering Could explain some didactic variables allows us to have some control over the process of teaching and learning. The proposal is aimed at students from sixth grade of elementary school, but an analysis of the potential of working with the kites to develop content of geometry shows that it is possible to make adjustments to work with students from all levels of basic education. / Neste trabalho propomos um processo de ensino usando como base um referencial teórico denominado Engenharia Didática. Nossa proposta consiste em desenvolver conteúdos da geometria plana a partir de um problema relacionado às pipas. Usando como referencial teórico a Engenharia Didática foi possível explicitar algumas variáveis didáticas que nos permite ter certo controle sobre o processo de ensinoaprendizagem. A referida proposta é destinada a alunos de sexto ano do Ensino Fundamental. Mas uma análise sobre as potencialidades de trabalho com as pipas para desenvolver conteúdos da geometria nos mostra que é possível fazer adaptações para se trabalhar com alunos de outros níveis da Educação Básica.