271 |
Studie návrhu vhodného tvaru membránových konstrukcí / Study of design of a suitable shape of membrane structuresKocina, Karel January 2012 (has links)
This diploma thesis deals with methods for design of membrane structure shape. Main purpose is to analyze topology designs by Formfinder and Rhinoceros in RFEM and compare results. Test a possibility of designing shape by software RFEM.
|
272 |
Analýza diagramů byznys procesů / Analysis of Business Process DiagramsLudvík, Martin January 2009 (has links)
The aim of Analysis of Business Process Diagrams is to create procedure that is able to find typical patterns in business process diagrams. Besides, it is necessary to design and implement application, which will be able to find and mark selected workflow patterns. This analysis is based on XML document, in which a business process diagram is stored. Important thing is to keep the ability to extend the number of patterns, which can be find out in a diagram. Also, it is important to solve some special situations, i.e. overlapping of patterns.
|
273 |
Detekce odpovídajících si bodů ve dvou fotografiích / Detection of Corresponding Points in ImagesKomosný, Petr January 2009 (has links)
This thesis is interested in detection of corresponding points in images, which display the same object, eventually some of important elements and synchronizing these images. The aim of this thesis is to find, study and choose suitable algorithm for detecting interesting points in image. This algorithm will be apply at couple of images and in these images will find couples of corresponding points across these images. Functional output of this thesis will be application which will realize choosen interesting points detector, algorithm for finding correspondencies of regions and their synchronizing and joint them to one output image.
|
274 |
Directed Graph Analysis: Algorithms and ApplicationsSun, Jiankai January 2019 (has links)
No description available.
|
275 |
[pt] ALGORITMOS DE SENSORIAMENTO COMPRESSIVO PARA ESTIMAÇÃO DE DIREÇÃO COM ARRANJOS LINEARES NÃO-UNIFORMES / [en] COMPRESSED SENSING ALGORITHMS FOR DIRECTION OF ARRIVAL ESTIMATION WITH NON-UNIFORM LINEAR ARRAYSWESLEY SOUZA LEITE 18 September 2020 (has links)
[pt] O problema de estimação de direção (DoA) de chegada é um importante tópico de pesquisa em áreas como radar, sonar, sismologia, vigilância eletrônica e comunicações sem fio. Este trabalho teve como principal
resultado o desenvolvimento de um novo algoritmo que combina o método da máxima verossimilhança (ML) estocástica com o algoritmo ganancioso de busca ortogonal (OMP), comumente empregado em recuperação esparsa com Sensoriamento Compressivo (CS). Muito embora técnicas ML sejam consideradas ótimas em termos de erro médio quadrático, atingindo o limitante inferior de Cramér-Rao (CRLB), o menor limitante inferior para a variância do estimador, estas técnicas demandam de modo significante, às vezes inexequível, os recursos computacionais. Por outro lado, a partir de uma variante esparsa da equação de aquisição de dados, o problema de encontrar a solução mais esparsa possível de sistemas de equações subdeterminados com o algoritmo OMP tem sido empregado de modo satisfatório para encontrar as estimativas de direção, porém com muitas oportunidades de melhoria em casos com cenários sujeitos a condições severas. Por exemplo, cenários com acoplamento eletromagnético (EM), baixa razão sinal-ruído (SNR) e um número limitado de amostras temporais disponíveis. O estimador de direção proposto, baseado em coarranjo diferença, denominado OMP com Máxima Verossimilhança Baseado em Lista (LBML-OMP), apresentou uma melhora significativa no processo de estimação em comparação com técnicas tradicionais e modernas, tais como: OMP, Técnica de Limiar Iterativa (IHT) e Classificação de Múltiplos Sinais Espacialmente Suavizados (SS-MUSIC). A técnica proposta utiliza uma lista de candidatos gerada a partir da solução do algoritmo OMP original e decide pelo melhor a partir de uma busca limitada utilizando o estimador ML estocástico, o que justifica seu uso em cenários práticos. Para a amostragem dos sinais no ambiente, arranjos lineares não-uniformes clássicos e modernos foram empregados, tais como Arranjos Aninhados de Segunda Ordem (NAQ2), Arranjos Aninhados de Segunda Ordem Aperfeiçoados (SNAQ2), Arranjos de Redundância Mínima (MRA) e Arranjos Coprimos (CPA). Além disso, a estimação foi realizada considerando-se o efeito do acoplamento EM e ruído. Ainda, um novo modelo para estimação de direção em coarranjo diferença foi desenvolvido. Este modelo considera o número de amostras temporais finitas
(não-assintótico) e mostrou melhora significativa quando do seu emprego no processo de estimação de direção de todos os algoritmos considerados, não apenas o LBML-OMP, evidenciando fontes secundárias de erro no modelo original estabelecido. De forma a complementar o trabalho, um algoritmo de atenuação de ruído chamado OMP aleatorizado (RandOMP) foi utilizado para aumentar a precisão da estimação em cenários com condições de ruído severas. Neste sentido, as contribuições deste trabalho estão relacionadas
principalmente ao desenvolvimento de um novo algoritmo e um novo modelo de transformação em coarranjo diferença de modo a melhorar as estimativas de direção das fontes com arranjos lineares não-uniformes. Além disso, enfatiza-se o emprego de diferentes geometrias para as simulações, tornando-se evidente o impacto da posição dos sensores nas curvas de raiz quadrada do erro médio quadrático (RMSE). / [en] The Direction of Arrival (DoA) estimation or Direction Finding (DF) is a relevant topic for research in areas such as radar, sonar, seismology, electronic surveillance, and wireless communications. This thesis devises a new algorithm that combines a stochastic Maximum Likelihood (ML) method with the widely-known Orthogonal Matching Pursuit (OMP) greedy algorithm, commonly used in sparse recovery with Compressive Sensing (CS). Even though ML techniques are known to be optimal in the mean-squared error sense, achieving the Cramér-Rao Lower Bound (CRLB), the tighter lower bound on estimator variance, they demand a significant, sometimes infeasible, amount of computational resources. On the other hand, departing from a sparsified variant of the data acquisition equation, the problem of finding the sparsest solution of underdetermined systems of equations with OMP has been employed successfully to find the DoA estimates, but with many opportunities for improvement in cases of challenging scenarios. For instance, scenarios with electromagnetic (EM) coupling, low signal-to-noise ratio (SNR), and a limited number of available snapshots (time samples). The proposed difference coarray DoA estimator termed List-Based Maximum Likelihood OMP (LBML-OMP) has shown substantial improvements over traditional and
modern techniques, such as OMP, Iterative Hard Thresholding (IHT), and Spatial Smoothing Multiple Signal Classification (SS-MUSIC). It uses a list of candidates generated from the OMP solution and decides for the best based on a limited search using the stochastic ML rule. Thus, it does not perform a grid search with the ML estimator, and this justifies its use in practical scenarios. For the sensing of space-time field, classic and modern non-uniform linear arrays are employed, such as 2-nd Order Nested Array (NAQ2), 2-nd
Order Super Nested Array (SNAQ2), Minimum Redundancy Array (MRA), Minimum Hole Array (MHA), and Coprime Array (CPA). Additionally, the estimation is performed under the assumption of EM coupling and noise as disturbing side effects. Furthermore, a new model for difference coarray DoA estimation is developed. It accounts for the finite number of snapshots and has shown to increase the estimation accuracy for all the algorithms, not only LBML-OMP, evidencing secondary sources of error for the difference coarray transformation. To complement the work, a denoising algorithm called Randomized OMP (RandOMP) was applied to successfully increase the estimation accuracy for difference coarray estimators in scenarios with severe noisy conditions. The contributions of this work relate mainly to the development of a new algorithm and a new difference coarray transformation to improve the DoA estimation accuracy with non-uniform linear arrays. Also, it should be noticed the employment of different geometries for the numerical experiments, making evident the impact of the array sensors positions in the root mean square error (RMSE) curves.
|
276 |
L’accès lexical chez les enfants francophones avec et sans difficultés d'accès lexical en contexte de narrationBourassa Bédard, Vincent 11 1900 (has links)
Les difficultés d’accès lexical, aussi appelées trouble d’accès lexical, se manifestent par une incapacité fréquente à retrouver le mot voulu pour s’exprimer. Bien que les difficultés d’accès lexical soient couramment rapportées chez les enfants vus en orthophonie, celles-ci bénéficient de peu de recherches en orthophonie. Les recherches auprès des enfants francophones ou ayant recours à des tâches discursives, comme la narration, sont encore plus rares. Cette thèse visait, dans un premier temps, à mettre à l’essai l’analyse de l’accès lexical en discours du Test of Word Finding in Discourse (German, 1991) auprès des enfants francophones d’âge scolaire. Dans un deuxième temps, cette thèse avait pour objectif 1) de mieux comprendre à quelle étape de la production de la parole se situent les difficultés d’accès lexical et 2) de déterminer quelles tâches, parmi celles les plus fréquemment utilisées pour évaluer l’accès lexical, permettent de distinguer des enfants avec et sans difficultés d’accès lexical.
Pour répondre à ces objectifs, trois études distinctes ont été développées. Deux études auprès d’enfants francophones participant à des tâches de narration suggéraient que nos participant·e·s produisaient plus de manifestations pouvant être associées à des difficultés d’accès lexical, appelées caractéristiques d’accès lexical (répétitions, révisions, etc.), que celleux de l’échantillon de normalisation du Test of Word Finding in Discourse (German, 1991). Nos résultats suggèrent que la fréquence des caractéristiques d’accès lexical peut être associée au genre de l’enfant, à la langue parlée et au type de tâche (narration vs description d’images). Les résultats de la troisième étude, réalisée auprès d’enfants avec et sans difficultés d’accès lexical, suggèrent qu’en général, les difficultés d’AL impliquent un déficit sémantique, soit à développer des représentations sémantiques précises sur les mots appris. Cela rendrait ensuite ardu l’accès à ces mots. Lorsque les enfants avec difficultés d’accès lexical sont catégorisés en profils de difficultés, un profil de difficultés sémantiques et phonologiques émerge, de même que des profils intermédiaires, sans être spécifiques à des difficultés sémantiques ou phonologiques. Ces résultats concordent avec une autre étude faisant usage des analyses par profils, mais ne concordent pas avec la majorité de la littérature qui propose de catégoriser les enfants avec difficultés d’accès lexical en profils sémantiques et phonologiques.
Concernant l’identification de difficultés d’accès lexical, nos résultats suggèrent qu’un questionnaire de dépistage des difficultés d’accès lexical, une tâche de définitions de mots et une tâche de dénomination sont prometteurs. Bien qu’il existe des différences significatives entre les enfants avec et sans difficultés d’accès lexical en discours, nous recommandons d’utiliser le discours pour permettre de décrire les impacts des difficultés d’accès lexical plutôt que de statuer sur leur présence. D’autres études sont nécessaires, surtout impliquant le discours, étant donnés les défis de l’évaluation en discours. / Word-finding difficulties are best described as a frequent inability to find the target words to express oneself. Although word-finding difficulties are commonly reported in children receiving speech and language services, research on these difficulties is sparse. Research with French-speaking children or including narrative tasks is even rarer. French-speaking children and for narration. This thesis aimed to test the use of the Test of Word Finding in Discourse’s analysis of word-finding behaviours with French-speaking school-aged children. This thesis also aimed 1) to better understand at which stage of speech production word-finding difficulties may arise and 2) to determine which task, among the ones frequently used to assess word-finding difficulties, can best distinguish children with and without word-finding difficulties.
To this end, three distinct studies were developed. Two studies of French-speaking children participating in a narrative task suggest that our participants produce more word-finding behaviours (repetitions, word reformulations, etc.) than those from the Test of Word Finding in Discourse’s (German, 1991) normalization sample. Our results suggest that the frequency of word-finding behaviours could be associated with a child’s gender or language spoken as well as the type of task (narration vs picture description). The third study, conducted with children with and without word-finding difficulties, suggests that, in general, word-finding difficulties involve a semantic deficit, that is, difficulties developing precise semantic representations when learning new words. This would then make it hard for the child to retrieve these words. When children with word-finding difficulties were categorized into word-finding difficulties profiles, one with both semantic and phonological difficulties emerged, as well as intermediary profiles that were not specific to semantic or phonological difficulties. These results agree with another study of word-finding profiles, but not with the majority of the literature that proposes that children with word-finding difficulties can be categorized into semantic and phonological profiles.
Regarding the identification of word-finding difficulties, our results indicate that a screening questionnaire for word-finding difficulties, a word definition task and a naming task are all promising tools. Although there were significant differences between children with and without word-finding difficulties in discourse, we recommend using discourse measures to describe the impacts of word-finding difficulties rather than to identify word-finding difficulties. Further studies are needed, especially ones involving discourse measures, given the challenges in using discourse in speech-language pathology.
|
277 |
Vzdělávání odsouzených ve výkonu trestu odnětí svobody ve Věznici Vinařice a jejich motivace a postoje ke vzdělávání / Education of Prisoners Serving Their Term in the Vinařice Prison and Their Motivation and Attitude to EducationVrátná, Andrea January 2022 (has links)
The diploma thesis deals with the issue of education of the prisoners serving their term in the Vinařice prison. The theoretical part focuses on a brief introduction into the issue of imprisonment in the Czech Republic and penitentiary education in relation to the education of prisoners. It describes the educational and employment possibilities for those serving their term, where it presents current possibilities of education and employment of prisoners and their chances on the job market. The thesis then focuses on the description of the Vinařice prison, their work with prisoners, the sections for prisoners inside the prison and their educational and employment possibilities for prisoners. Following this the thesis describes the activity of the vocational school that operates in the Vinařice prison. It talks in detail about the specifics of education in this school, the school's educational programs, the characteristics of the students and the current employment rate of the graduates from the programs in category E. The practical part of the thesis focuses on a questionnaire survey designed to discover, what is the students' motivation for education and what are the students' attitudes towards individual subjects offered in the vocational school's programs in the Vinařice prison. Based on a...
|
278 |
Finding Where I Am: A Collection of Creative Nonfiction - Creative thesisLloyd, Jana 18 March 2005 (has links) (PDF)
This thesis is a collection of five pieces of creative nonfiction written over the academic years 2003—2005. Creative nonfiction is a genre that, in some form or another, has always existed, though trends in form and style are constantly in flux. Based on the experiences of the actual author, creative nonfiction seeks to present the journey of a mind at work, in a style that is candid, quirky, and insightful. It seeks to persuade its reader by establishing a likeable and trusted narrator; by relating interesting facts that teach the reader something about the subject at hand; and by appealing to the reader's emotions, especially through techniques of metaphor and figurative language typically employed by writers of fiction, poetry, and drama. Thus, it utilizes the three main tools of rhetoric laid down by that great orator of yore, Aristotle; namely, ethos, logos, and pathos.
Rather than exploring one subject in-depth, as is typical of a thesis, this work explores a number of different topics, as is typical of creative nonfiction. The topics include my physical quirks, especially a congenital defect that prevents me from smelling; my volunteer experiences at the Provo, Utah Boys and Girls Club; the traditions of fishing and storytelling in my family; and my burgeoning interest in family history, which was stimulated by a trip to Pine Valley, Utah—a small, rural town in southwestern Utah where some of my early Mormon ancestors settled. The pieces are united more by form than by content, as well as by having been filtered through a single consciousness. Mostly, they are supposed to be enjoyable reading.
|
279 |
A Flexible Infrastructure for Multi-Agent SystemsSorensen, Gerrit Addison N 02 July 2005 (has links) (PDF)
Multi-Agent coordination and control has been studied for a long time, but has recently gained more interest because of technology improvements allowing smaller, more versatile robots and other types of agents. To facilitate multi-agent experiments between heterogeneous agents, including robots and UAVs, we have created a test-bed with both simulation and hardware capabilities. This thesis discusses the creation of this unique, versatile test-bed for multi-agent experiments, also a unique graph creation algorithm, and some experimental results obtained using the test-bed.
|
280 |
Analysis, Implementation and Evaluation of Direction Finding Algorithms using GPU Computing / Analys, implementering och utvärdering av riktningsbestämningsalgoritmer på GPUAndersdotter, Regina January 2022 (has links)
Direction Finding (DF) algorithms are used by the Swedish Defence Research Agency (FOI) in the context of electronic warfare against radio. Parallelizing these algorithms using a Graphics Processing Unit (GPU) might improve performance, and thereby increase military support capabilities. This thesis selects the DF algorithms Correlative Interferometer (CORR), Multiple Signal Classification (MUSIC) and Weighted Subspace Fitting (WSF), and examines to what extent GPU implementation of these algorithms is suitable, by analysing, implementing and evaluating. Firstly, six general criteria for GPU suitability are formulated. Then the three algorithms are analyzed with regard to these criteria, giving that MUSIC and WSF are both 58% suitable, closely followed by CORR on 50% suitability. MUSIC is selected for implementation, and an open source implementation is extended to three versions: a multicore CPU version, a GPU version (with Eigenvalue Decomposition (EVD) and pseudo spectrum calculation performed on the GPU), and a MIXED version (with only pseudo spectrum calculation on the GPU). These versions are then evaluated for angle resolutions between 1° and 0.025°, and CUDA block sizes between 8 and 1024. It is found that the GPU version is faster than the CPU version for angle resolutions above 0.1°, and the largest measured speedup is 1.4 times. The block size has no large impact on the total runtime. In conclusion, the overall results indicate that it is not entirely suitable, yet somewhat beneficial for large angle resolutions, to implement MUSIC using GPU computing.
|
Page generated in 0.0468 seconds