• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 114
  • 53
  • 18
  • 17
  • 14
  • 9
  • 7
  • 6
  • 4
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • Tagged with
  • 274
  • 60
  • 31
  • 30
  • 30
  • 21
  • 21
  • 15
  • 15
  • 14
  • 13
  • 13
  • 12
  • 12
  • 12
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
51

Origins and philosophy of the Butler Art Gallery and Labor Museum at Chicago Hull-House

Webb, Guiniviere Marie 11 February 2011 (has links)
Jane Addams influenced the lives of many immigrant Chicagoans through offering a variety of community oriented services including art education programs at the Hull-House. This study examines the origins and philosophy of both the Butler Art Gallery and Labor Museum, and discusses each program’s role for residents, visitors, and guests of Hull-House. In addition to providing a historical basis for Jane Addams as an art educator, this study discusses the techniques for community organization that were utilized by Hull-House residents, including Jane Addams and Ellen Gates Starr. / text
52

Iškilojo apvalaklo taškų sukūrimo atviri algoritmai, jų programavimas bei tyrimas / Open Algorithms of Creating the Convex Hull Points. Programming and Research

Andrejev, Andrej 24 September 2008 (has links)
Šiame darbe yra trumpai aprašomas algoritmas, kuris naudoja nereikalingus skaičiavimus, ieškant iškilojo apvalkalo taškų. Pateikiamas naujas „Artimiausio taško“ algoritmas, kuris iškilojo apvalkalo taškus randa įterpimo būdu. Pateikiamos ir dvi „Artimiausio taško“ algoritmo realizacijos. „Preparata“ bei „Artimiausio taško“ algoritmai, bei „Artimiausio taško“ algoritmo dvi realizacijos realizuojamos skirtingose operacinėse sistemose: Windows ir Linux. Realizavus algoritmus („Preparata“, „Artimiausio taško“) ir dvi „Artimiausio taško“ algoritmo realizacijas, buvo analizuojamas algoritmų atlikimo laikas. / This work shortly describes the algorithms, that uses unnecessary calculations for the search of convex hull points. A new algorithm called “Nearest point” is presented in this work. This algorithm founds the points of convex hull by using the method of insertion. Two realisations of the “Nearest point” realisation are presented in the current work.. The “Preparata” algorithm, the “Nearest point” algorithm, and two realisations of the “Nearest point” algorithm were build both for Windows and Linux operating systems. After the realisation of the algorithms (“Preparata” and “Nearest point”) and two versions of the “Nearest point”, the action time of them has been analysed.
53

Minimum Perimeter Convex Hull of a Set of Line Segments: An Approximation

Hassanzadeh, Farzad 09 December 2008 (has links)
The problem of finding the convex hull of a set of points in the plane is one of the fundamental and well-studied problems in Computational Geometry. However, for a set of imprecise points, the convex hull problem has not been thoroughly investigated. By imprecise points, we refer to a region in the plane inside which one point may lie. We are particularly interested in finding a minimum perimeter convex hull of a set of imprecise points, where the imprecise points are modelled as line segments. Currently, the best known algorithm that solves the minimum perimeter convex hull problem has an exponential running time in the worst case. It is still unknown whether this problem is NP-hard. We explore several approximation algorithms for this problem. Finally we propose a constant factor approximation algorithm that runs in O(nlogn) time. / Thesis (Master, Computing) -- Queen's University, 2008-11-28 14:47:15.169
54

Algorithms for Collision Hulls and their Applications to Path Planning

Zane Smith Unknown Date (has links)
The potential benefits that automation could bring to a wide variety of real-world tasks are numerous and well recognised. There has been significant research undertaken into automation in general, but for real-time automation of complex systems (involving complex geometries and dynamics) the problem is far from a solved one. One of the key tasks in a surface mining operation is that of using shovels or excavators to load material onto haul trucks for transportation. Since it is such a crucial task to a number of production cycles, it is a clear area where the productivity and safety benefits of automation could have a large impact. A number of projects are being undertaken concurrently to move towards first partial, and then full, automation of this mining subsystem. This thesis focusses on the collision avoidance problem, specifically on forming a collision hull that distinguishes between intersecting and non-intersecting configurations of two objects. Techniques from computer graphics are leveraged to develop a data structure that stores and organises relevant information about real-world systems for motion-planning tasks, ensuring that the necessary data is available and in a form suited to the task at hand. The Minkowski Sum operation, which can be used fairly directly to form the collision hull of two convex objects under translation, is extended to develop an operation to form the exact collision hull of two arbitrary objects to determine the applicability of such a scheme to complex systems in real-time. A level of detail solution is then proposed, where the Minkowski Hull of bounding hierarchies allows unnecessary parts of the hull to be calculated only in a coarse manner, thus offsetting a lot of the computational cost for any given test. This approach is investigated for both translational motion and joint-space motion. Collision detection is not collision avoidance, and so the algorithms developed in the thesis are tested in a number of applications, to demonstrate their suitability to the collision avoidance task. The applications (discrete collision prediction, visibility graph path planning, and the formulation of a Model Predictive Controller) are restricted versions of the true problems with some simplifying assumptions, but they show the algorithms to be capable both in their execution speed and the information that they provide.
55

Euprepina Hull, 1971 : revisão das espécies e análise cladística(Diptera, Bombyliidae, Bombyliinae)

Lamas , Carlos José Einicker 12 December 1996 (has links)
Submitted by Alberto Vieira (martins_vieira@ibest.com.br) on 2018-06-15T18:12:33Z No. of bitstreams: 1 273293.pdf: 5778615 bytes, checksum: a5f708246e92379da03f32074b596734 (MD5) / Made available in DSpace on 2018-06-15T18:12:33Z (GMT). No. of bitstreams: 1 273293.pdf: 5778615 bytes, checksum: a5f708246e92379da03f32074b596734 (MD5) Previous issue date: 1996-12-12 / CAPES / Esta dissertação apresenta os resultados de estudos taxonômicos em Euprepina Hull, 1971 (Diptera, Bombyliidae, Bombyliinae ), gênero neotropical, que abrange nove espécies. São feitas redescrições de oito espécies: E. nuda Hull, 1971, E. amabilis (Wulp, 1881 ), E. beckeri Lamas & Couri, no prelo, E. bicincta (Wiedemann, 1830), E. caminaria (Wiedemann, 1830), E. knutsoni Hull, 1971, E. maracajula Hull, 1971 e E. truxalia Hull, 1971, com ilustrações da terminália masculina, espermateca e labelo; duas sinonímias (E. bicincta Hull, 1971 = E. bicincta (Wiedemann, 1830) e E. shannoni Hull, 1971 = E. nuda Hull, 1971); uma chave para identificação das espécies e um cladograma resultante da análise cladística realizada para as oito espécies estudadas. E. goyaz Hull, 1971, não foi incluída neste estudo, pois não foi possível examinar exemplares desta espécie. O cladograma foi obtido através de uma matriz contendo 19 caracteres, submetida a análise no programa PAUP 3.1.1 (SWOFFORD, 1993). Os caracteres foram polarizados seguindo o método de comparação... / This dissertation presents the results of taxonomic studies on Euprepina Hull, 1971 (Diptera, Bombyliidae, Bombyliinae) a neotropical genus that includes nine species. Redescriptions of eight species: E. nuda Hull, 1971, E. amabilis (Wulp, 1881 ), E. beckeri Lamas & Couri, in press, E. bicincta (Wiedemann, 1830), E. caminaria (Wiedemann, 1830), E. knutsoni Hull, 1971, E. maracajula Hull, 1971 and E. truxalia Hull, 1971, with illustrations of male terminalia, spermathecae and labellum; two synonymies(E. bicincta Hull, 1971 = E. bicincta (Wiedemann, 1830) and E. shannoni Hull, 1971 = E. nuda Hull, 1971), a key to species and a cladogram are presented. E. goyaz Hull, 1971, was not included in this study, because none specimen of this species was examined. The cladogram was obtained from cladistic analysis of the eigth studied species, based on a data matrix with 19 characters and using the program PAUP 3.1.1 (SWOFFORD, 1991). Character states were polarized following outgroup analysis...
56

Segmentação de sentenças manuscritas através de redes neurais artificiais

CARVALHO, César Augusto Mendonça de 31 January 2008 (has links)
Made available in DSpace on 2014-06-12T15:50:57Z (GMT). No. of bitstreams: 1 license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5) Previous issue date: 2008 / O reconhecimento automático de textos manuscritos vem a cada dia ganhando importância tanto no meio científico quanto no comercial. Como exemplos de aplicações, têm-se sistemas bancários onde os campos de valor dos cheques são validados, aplicativos presentes nos correios para leitura de endereço e código postal, e sistemas de indexação de documentos históricos. A segmentação automática do texto em palavras ou caracteres é um dos primeiros passos realizados pelos sistemas de reconhecimento dos textos manuscritos. Portanto, é essencial que seja alcançado um bom desempenho de segmentação para que as etapas posteriores produzam boas taxas de reconhecimento do texto manuscrito. O presente trabalho trata do problema de segmentação de sentenças manuscritas em palavras através de duas abordagens: (i) método baseado na métrica de distância Convex Hull com modificações que objetivam melhorar o desempenho de segmentação; (ii) um novo método baseado em Redes Neurais Artificiais que visa superar problemas existentes em outras técnicas de segmentação, tais como: o uso de heurísticas e limitação de vocabulário. O desempenho dos métodos de segmentação foi avaliado utilizando-se de uma base de dados pública de texto manuscrito. Os resultados experimentais mostram que houve melhora de desempenho das abordagens quando comparadas à abordagem tradicional baseada em distância Convex Hull
57

Monitoramento de deformações e deslocamentos relativos nas estruturas de suporte de plantas de processo modulares em unidades flutuantes de produção de petróleo do tipo FPSO

Pinto, Wagner Mespaque January 2010 (has links)
Dissertação(mestrado) - Universidade Federal do Rio Grande, Programa de Pós-Graduação em Engenharia Oceânica, Escola de Engenharia, 2010. / Submitted by Lilian M. Silva (lilianmadeirasilva@hotmail.com) on 2013-04-23T00:25:38Z No. of bitstreams: 1 Monitoramento de Deformações e Deslocamentos Relativos nas Estruturas de Suporte de Plantas de Processo Modulares em Unidades Flutuantes de Produção de Petróleo do Tipo FPSO.pdf: 3764587 bytes, checksum: 70312a121e0f141c7936b32ac56e47c2 (MD5) / Approved for entry into archive by Bruna Vieira(bruninha_vieira@ibest.com.br) on 2013-06-03T19:38:06Z (GMT) No. of bitstreams: 1 Monitoramento de Deformações e Deslocamentos Relativos nas Estruturas de Suporte de Plantas de Processo Modulares em Unidades Flutuantes de Produção de Petróleo do Tipo FPSO.pdf: 3764587 bytes, checksum: 70312a121e0f141c7936b32ac56e47c2 (MD5) / Made available in DSpace on 2013-06-03T19:38:06Z (GMT). No. of bitstreams: 1 Monitoramento de Deformações e Deslocamentos Relativos nas Estruturas de Suporte de Plantas de Processo Modulares em Unidades Flutuantes de Produção de Petróleo do Tipo FPSO.pdf: 3764587 bytes, checksum: 70312a121e0f141c7936b32ac56e47c2 (MD5) Previous issue date: 2010 / Os projetos mais recentes de plataformas do tipo FPSO da PETROBRAS utilizam plantas modulares sobre cascos convertidos de mais de 300m de comprimento. Os módulos podem atingir 2.000t (peso seco) e mais de 3.000t em operação, sendo suportados em quatro pontos por estruturas chamadas stools. No projeto da P-53, para cada módulo há dois stools deslizantes (os quais permitem deslocamentos longitudinais, paralelos ao eixo da embarcação), e dois fixos (com restrição de movimentos em todas as direções), cada par em transversais distintas. Teoricamente, os stools deslizantes são empregados para evitar que os efeitos das deflexões do casco da plataforma induzam esforços nas estruturas dos módulos. As dúvidas a respeito da eficiência deste mecanismo para essa configuração de suportação de módulos motivaram a realização deste trabalho, cujo objetivo é analisar e compreender o comportamento estrutural dos apoios dos módulos (stools) da plataforma P-53. Para se obter estas respostas, foi desenvolvido um projeto de pesquisa na FURG com apoio da PETROBRAS, o qual mobilizou três pesquisadores e dez bolsistas, durante 3 anos e meio. Um sistema de aquisição de dados foi especialmente implementado, e através deste foram monitoradas deformações e deslocamentos relativos sobre esses stools. No total foram instalados na plataforma 75 sensores (entre extensômetros, transdutores de deslocamento e acelerômetros). Foram realizadas medições durante o assentamento dos módulos sobre a embarcação ainda no estaleiro, e na locação final, submetida às condições ambientais da Bacia de Campos. Nas condições em que foi realizado o monitoramento, não foram registrados deslocamentos relativos entre os stools deslizantes e os pés dos módulos durante todo o período de observação. A não ocorrência de deslizamento pode ser justificada pelo elevado peso dos módulos, alto coeficiente de atrito, e as características das ondas sob as quais a embarcação foi submetida. Nestas condições, a ocorrência de deslocamentos relativos é mais provável para módulos mais leves, e improvável, ou até impossível, para módulos mais pesados. Mesmo assim não foram registrados níveis de deformações que pudessem indicar um incremento relevante de carga sobre as estruturas dos stools e dos módulos. / The most recent PETROBRAS FPSO projects used modular process plants on converted vessels with more than 300m length. The modules may reach 2,000t (dry) and more than 3,000t on operation, being supported by four points on structures called stools. In the P-53 design, there are two sliding stools (that allow longitudinal displacements, parallel to vessel axis), and two fixed stools (that restrict the displacement in all directions), each pair is at different transversal frames on the hull. In theory, the sliding stools are employed to avoid that the hull deflections induce deformation on the module’s structures. The doubts about the efficiency of this apparatus for this support configuration of modules motivated the development of this research, which aim is analyze and understand the structural behavior of the module’s supports. To get these answers, it was developed a research in FURG with support of PETROBRAS, which mobilized three researchers and ten students, during three and a half year. A data acquisition system was specially implemented to attend this goal, through that was monitored strain and relative displacements on these stools. A total of 75 sensors (among them strain gages, displacement transducer and accelerometers) was installed on the platform. It was taken measurements during the installation of the modules upon the hull at the shipyard, and at the final location, under the environmental conditions of Campos Basin. In these conditions where the monitoring was done, no relative displacement among the sliding stools and module’s pads was recorded throughout the observation period. The non-occurrence of sliding can be justified by the high weight of the modules and high coefficient of friction, and by the environmental conditions under that the vessel was subjected. On these conditions, the occurrence of relative displacements is more probable to lighter modules, and improbable, even impossible to heavier ones. Despite that, it was not recorded strain levels that could indicate a relevant load increasing on the structures of modules or stools.
58

Analyse de complexité d'enveloppes convexes aléatoires / Complexity analysis of random convex hulls

Thomasse, Rémy 18 December 2015 (has links)
Dans cette thèse, nous donnons de nouveaux résultats sur la taille moyenne d’enveloppes convexes de points choisis dans un convexe. Cette taille est connue lorsque les points sont choisis uniformément (et indépendamment) dans un polytope convexe, ou un convexe suffisamment «lisse» ; ou encore lorsque les points sont choisis indépendamment selon une loi normale centrée. Dans la première partie de cette thèse, nous développons une technique nous permettant de donner de nouveaux résultats lorsque les points sont choisis arbitrairement dans un convexe, puis «bruités» par une perturbation aléatoire. Ce type d’analyse, appelée analyse lissée, a initialement été développée par Spielman et Teng dans leur étude de l’algorithme du simplexe. Pour un ensemble de points arbitraires dans une boule, nous obtenons une borne inférieure et une borne supérieure de cette complexité lissée dans le cas de perturbations uniformes dans une boule en dimension arbitraire, ainsi que dans le cas de perturbations gaussiennes en dimension 2. La taille de l'enveloppe convexe de points choisis uniformément dans un convexe, peut avoir un comportement logarithmique si ce convexe est un polytope ou polynomial s’il est lisse. Nous construisons un convexe produisant un comportement oscillant entre ces deux extrêmes. Dans la dernière partie, nous présentons un algorithme pour engendrer efficacement une enveloppe convexe aléatoire de points choisis uniformément et indépendamment dans un disque sans avoir à engendrer explicitement tous les points. Il a été implémenté en C++ et intégré dans la bibliothèque CGAL. / In this thesis, we give some new results about the average size of convex hulls made of points chosen in a convex body. This size is known when the points are chosen uniformly (and independently) in a convex polytope or in a "smooth" enough convex body. This average size is also known if the points are independently chosen according to a centered Gaussian distribution. In the first part of this thesis, we introduce a technique that will give new results when the points are chosen arbitrarily in a convex body, and then noised by some random perturbations. This kind of analysis, called smoothed analysis, has been initially developed by Spielman and Teng in their study of the simplex algorithm. For an arbitrary set of point in a ball, we obtain a lower and a upper bound for this smoothed complexity, in the case of uniform perturbation in a ball (in arbitrary dimension) and in the case of Gaussian perturbations in dimension 2. The asymptotic behavior of the expected size of the convex hull of uniformly random points in a convex body is polynomial for a "smooth" body and polylogarithmic for a polytope. In the second part, we construct a convex body so that the expected size of the convex hull of points uniformly chosen in that body oscillates between these two behaviors when the number of points increases. In the last part, we present an algorithm to generate efficiently a random convex hull made of points chosen uniformly and independently in a disk. We also compute its average time and space complexity. This algorithm can generate a random convex hull without explicitly generating all the points. It has been implemented in C++ and integrated in the CGAL library.
59

On Resampling Schemes for Uniform Polytopes

Qi, Weinan January 2017 (has links)
The convex hull of a sample is used to approximate the support of the underlying distribution. This approximation has many practical implications in real life. For example, approximating the boundary of a finite set is used by many authors in environmental studies and medical research. To approximate the functionals of convex hulls, asymptotic theory plays a crucial role. Unfortunately, the asymptotic results are mostly very complicated. To address this complication, we suggest a consistent bootstrapping scheme for certain cases. Our resampling technique is used for both semi-parametric and non-parametric cases. Let X1,X2,...,Xn be a sequence of i.i.d. random points uniformly distributed on an unknown convex set. Our bootstrapping scheme relies on resampling uniformly from the convex hull of X1,X2,...,Xn. In this thesis, we study the asymptotic consistency of certain functionals of convex hulls. In particular, we apply our bootstrapping technique to the Hausdorff distance between the actual convex set and its estimator. We also provide a conjecture for the application of our bootstrapping scheme to Gaussian polytopes. Moreover, some other relevant consistency results for the regular bootstrap are developed.
60

Stronger together : the Hull House Woman’s Club and public health activism

Schwalm, Megan Lee 01 December 2016 (has links)
Jane Addams and Ellen Gates Starr opened Hull House, Chicago’s first settlement house, in 1889 as a means of confronting poverty, poor housing conditions, disease, discouragement, and other ills that flourished in the predominately immigrant Halstead neighborhood. Because Hull House volunteers lived at the House, in the center of the community, they were well-equipped to respond knowledgeably to the neighborhood conditions. Hull House residents worked for reform in areas such as education, labor, juvenile protection, immigration, welfare, housing, and suffrage and they provided the community with a plethora of activities and services during the Progressive Era. As the community expressed their needs, Hull House volunteers responded to them. This dissertation provides evidence that social activism did not just take the form of political engagement and occupational health efforts but that it also included disease and illness prevention efforts. An examination of activist work of the Hull House Woman’s Club helps create an understanding of the intersection of activism and disease and illness prevention, and how activists used strategies to improve the health and wellbeing of people at the turn of the century. Specifically, three groups of women—the neighborhood women, the club women, and public health knowledge-holders—came together to address public health issues in the Nineteenth Ward. Each of these three groups played an integral role in the success of Hull House public health activism; it was their coming together that enabled them to create such powerful change. This dissertation specifically examines the women’s efforts in 1894 to improve garbage collection and sanitation and their 1902 efforts to eliminate typhoid in their neighborhood. This dissertation argues that, despite a lack of formal public health education or training, Woman’s Club members utilized local knowledge to improve health conditions in the Nineteenth Ward in Chicago. Woman’s Club activists acquired public health knowledge and developed activist strategies and techniques inductively, through trial and error, as they were carrying out their activist work. This dissertation helps fill in the historical gaps by exploring the strategies Hull House volunteers used to prevent disease and illness prevention.

Page generated in 0.0467 seconds