The aetiology of autoimmune disease is a complex interplay between genetics, environment and immunological regulation. Our understanding of the genetic aspects of autoimmunity has increased with recent findings from Genome Wide Association Studies (GWAS). There is now a movement towards meta-analyses of GWA studies in order to increase the number of genetic loci detected. There are also efforts to detect common genetic risk factors amongst groups of diseases that potentially share common aetiopathogenic pathways. Animal models have formed the basis of many genetic discoveries and the domestic dog presents a spontaneous model for many diseases, including autoimmunity. Through man’s efforts to create specific breeds, the dog has acquired a genomic architecture consisting of long haplotype blocks and extensive linkage disequilibrium. This means that a GWAS can be conducted in dog breeds with fewer samples and fewer markers than an equivalent study in humans, reducing costs, cohort collection times, and data handling/storage considerations. Successful canine GWA studies are now starting to be published. Building upon this success, the findings from GWA studies in three canine autoimmune diseases (across six different breeds), with equivalent human pathologies, are presented. Dogs with diabetes mellitus (similar to latent autoimmune diabetes of adulthood in man), lymphocytic thyroiditis (similar to Hashimoto’s thyroiditis), and anal furunculosis (similar to perianal Crohn’s disease) were compared to control dogs to identify genetic susceptibility loci underlying disease. Follow-up genotyping of the top hits from the GWAS analyses were conducted to replicate findings and to better characterise the diseases across a number of dog breeds. Typing of MHC class II genes, important in the immune response, was also undertaken in canine diabetes mellitus and canine lymphocytic thyroiditis. In anal furunculosis, high-throughput, next-generation sequencing was utilised to identify novel mutations and fine-map associations at discovered loci. Several genes were identified in all of these canine autoimmune diseases, many with good candidate function. Some of these genes indicated common genetic susceptibility loci and pathways between canine autoimmune diseases. Breed-specific genetic effects underlying canine diabetes mellitus and canine lymphocytic thyroiditis were identified, which has implications for disease diagnosis and clinical management. Novel loci for investigation in the corresponding human disease studies have been identified and future work will begin to genetically link the conditions in dog and man.

No description available.

Príons são patógenos infecciosos que causam um grupo de doenças neurodegenerativas fatais. A proteína normal, PrP celular, denominada PrPC, é convertida em PrPSc, isoforma anormal e patogênica de PrP, através de um processo no qual uma porção de -hélice da estrutura é reenovelada em folhas . A conversão de PrPC em PrPSc ocorre por um mecanismo auto-catalítico. Para um melhor entendimento do mecanismo de propagação dos príons, têm sido propostos vários modelos matemáticos. Nesse trabalho, estudamos o tempo de incubação de algumas doenças causadas por príons: Encefalopatia Espongiforme Bovina (BSE), ou mal da vaca louca; doença variante de Creutzfeldt-Jakob (vCJD), que afeta humanos, através da exposição ao agente de BSE; e Scrapie murina, uma infecção priônica experimental em camundongos. A distribuição de probabilidades da duração do período de incubação foi suposta ser lognormal, modelo este extensamente aceito em doenças infecciosas. Os objetivos desse trabalho foram esclarecer aspectos obscuros sobre a cinética de replicação priônica e o mecanismo de toxicidade das doenças priônicas, através de comparação dos resultados de simulações computacionais com os perfis de distribuição de tempos de incubação de BSE, vCJD e Scrapie murina. Foram realizadas simulações computacionais, utilizando o Método Monte Carlo Dinâmico (MCD) e o modelo Difusão Limitada à Agregação. Primeiramente, estudamos o modelo de Eigen (1996), através de simulações computacionais usando o MCD, para verificar quais termos são importantes para a cinética priônica. De posse desse resultado, partimos então para o estudo sobre a toxicidade das doenças priônicas, usando o modelo DLA e o método MCD: considerando que PrPC se converte em PrPSc quando existe contato (auto-catálise); e PrPCs são livres e podem se movimentar por uma rede, enquanto PrPScs, ou agregados de PrPScs são fixos. Confirmamos a suspeita de Eigen de que o termo mais importante nas equações de cinética priônica é o termo de Michaelis-Menten, ou termo auto-catalítico. Os resultados obtidos através das simulações MCD e modelo DLA foram comparados com os perfis de distribuições de tempos dessas doenças (BSE, vCJD e Scrapie murina). Conseguimos o ajuste de diferentes perfis de distribuição de tempos de incubação para algumas doenças priônicas, lognormal para BSE e vCJD, e lognormal com segundo pico para Scrapie murina. A auto-catálise é o mecanismo mais importante na cinética priônica, a conversão espontânea de PrPC em PrPSc pode ser negligenciada. A partir do modelo DLA, fica reforçada a hipótese de que para BSE e vCJD, doenças priônicas de ocorrência natural, a toxicidade é causada, principalmente, pela formação das placas amilóides. Para Scrapie murina, uma infecção experimentalmente induzida, a toxicidade é, possivelmente, causada por dois mecanismos: formação das placas amilóides e depleção de PrPC. Apenas com a mudança dos parâmetros iniciais e finais, conseguimos ajustar as distribuições de tempos de incubação das três doenças priônicas estudadas, apesar de o modelo ser bastante simples. A lognormalidade, de acordo com o modelo, é resultado do processo difusivo. As concentrações de PrPC devem ser baixas, menores que 1% e o número de PrPScs deve ser menor que 10 para que a lognormalidade ocorra sem a depleção de PrPC. / Prions are infectious agents responsible for a group of fatal neurodegenerative disorders. A pathogenic isoform of the prion protein (PrPSc) generated by a posttranslational process involving the conversion of alpha helices into beta sheets of the normal cellular prion protein (PrPC) is believed to be the main component of these infectious agents. The conversion of a normal PrPC into an abnormal isoform PrPSc, kinetically follows through an autocatalytic process. For better understanding of this kind of abnormal protein propagation, many analytical models have been proposed. Thus, we studied, using the Monte Carlo method, the distribution of the incubation periods in some of these neurodegenerative disorders, such as: bovine spongiform encephalopathy well known as mad cow disease (BSE), Variant Creutzfeldt Jakob disease (vCJD) and murine scrapie, an experimental murine prionic disease. The distribution of the incubation times of these diseases were considered lognormal. The aim of this study was to investigate some aspects of toxicity and replication of the prionic diseases, by comparing the results of computational simulations with the incubation times of BSE, vCJD and murine scrapie, previously established. Computational simulations, using a Dynamical Monte Carlo method (DMC) and the diffusion limited aggregation model (DLA), were worked out. At first, we evaluate the Eigen model through computational simulations using the DMC to verify the essential parameters in the kinetic of the prionic diseases. Following the results, we studied the toxicity of the prionic diseases using the DMC and the DLA model; by considering that PrPC converting in PrPSc just when exists contact (autocatalysis) and free PrPCs are allowed to diffuse randomly to their nearest neighbour sites in a square lattice, while isolated PrPScs or aggregate of PrPScs are fixed. Confirming the Eigen suspicion, the most important parameter in the equation of the prionic kinetic is the Michaelis Menten term (or the autocatalytic term). The results obtained through simulations using DMC and DLA model were compared with the time distribution profiles of the prionic diseases already established (BSE, vCJD and murine Scrapie). We get the fitting in different profiles of the distribution of the incubation periods (lognormal to BSE and vCJD and lognormal with a second peak to murine scrapie). It is concluded that autocatalysis is an essential mechanism for the prionic kinetics and the spontaneous conversion of PrPC in PrPSc can be neglected. Starting from the DLA model, is reinforced that the hypothesis for BSE and vCJD, prionic diseases of natural occurrence, the toxicity is caused, mainly, by the formation of amyloid plaques. For Scrapie murina, an experimentally induced infection, the toxicity is, possibly, caused by two mechanisms: formation of amyloid plaques and depletion of PrPC. Just with the change of the initial and final parameters, we fitted all studied prionic diseases, in spite of the model to be quite simple. The lognormality from the model, is resulting of a diffusive process. Concentrations of PrPC should be low, smaller than 1% and the number of PrPScs should be smaller than 10 for the lognormality take place without the depletion of PrPC.

Príons são patógenos infecciosos que causam um grupo de doenças neurodegenerativas fatais. A proteína normal, PrP celular, denominada PrPC, é convertida em PrPSc, isoforma anormal e patogênica de PrP, através de um processo no qual uma porção de -hélice da estrutura é reenovelada em folhas . A conversão de PrPC em PrPSc ocorre por um mecanismo auto-catalítico. Para um melhor entendimento do mecanismo de propagação dos príons, têm sido propostos vários modelos matemáticos. Nesse trabalho, estudamos o tempo de incubação de algumas doenças causadas por príons: Encefalopatia Espongiforme Bovina (BSE), ou mal da vaca louca; doença variante de Creutzfeldt-Jakob (vCJD), que afeta humanos, através da exposição ao agente de BSE; e Scrapie murina, uma infecção priônica experimental em camundongos. A distribuição de probabilidades da duração do período de incubação foi suposta ser lognormal, modelo este extensamente aceito em doenças infecciosas. Os objetivos desse trabalho foram esclarecer aspectos obscuros sobre a cinética de replicação priônica e o mecanismo de toxicidade das doenças priônicas, através de comparação dos resultados de simulações computacionais com os perfis de distribuição de tempos de incubação de BSE, vCJD e Scrapie murina. Foram realizadas simulações computacionais, utilizando o Método Monte Carlo Dinâmico (MCD) e o modelo Difusão Limitada à Agregação. Primeiramente, estudamos o modelo de Eigen (1996), através de simulações computacionais usando o MCD, para verificar quais termos são importantes para a cinética priônica. De posse desse resultado, partimos então para o estudo sobre a toxicidade das doenças priônicas, usando o modelo DLA e o método MCD: considerando que PrPC se converte em PrPSc quando existe contato (auto-catálise); e PrPCs são livres e podem se movimentar por uma rede, enquanto PrPScs, ou agregados de PrPScs são fixos. Confirmamos a suspeita de Eigen de que o termo mais importante nas equações de cinética priônica é o termo de Michaelis-Menten, ou termo auto-catalítico. Os resultados obtidos através das simulações MCD e modelo DLA foram comparados com os perfis de distribuições de tempos dessas doenças (BSE, vCJD e Scrapie murina). Conseguimos o ajuste de diferentes perfis de distribuição de tempos de incubação para algumas doenças priônicas, lognormal para BSE e vCJD, e lognormal com segundo pico para Scrapie murina. A auto-catálise é o mecanismo mais importante na cinética priônica, a conversão espontânea de PrPC em PrPSc pode ser negligenciada. A partir do modelo DLA, fica reforçada a hipótese de que para BSE e vCJD, doenças priônicas de ocorrência natural, a toxicidade é causada, principalmente, pela formação das placas amilóides. Para Scrapie murina, uma infecção experimentalmente induzida, a toxicidade é, possivelmente, causada por dois mecanismos: formação das placas amilóides e depleção de PrPC. Apenas com a mudança dos parâmetros iniciais e finais, conseguimos ajustar as distribuições de tempos de incubação das três doenças priônicas estudadas, apesar de o modelo ser bastante simples. A lognormalidade, de acordo com o modelo, é resultado do processo difusivo. As concentrações de PrPC devem ser baixas, menores que 1% e o número de PrPScs deve ser menor que 10 para que a lognormalidade ocorra sem a depleção de PrPC. / Prions are infectious agents responsible for a group of fatal neurodegenerative disorders. A pathogenic isoform of the prion protein (PrPSc) generated by a posttranslational process involving the conversion of alpha helices into beta sheets of the normal cellular prion protein (PrPC) is believed to be the main component of these infectious agents. The conversion of a normal PrPC into an abnormal isoform PrPSc, kinetically follows through an autocatalytic process. For better understanding of this kind of abnormal protein propagation, many analytical models have been proposed. Thus, we studied, using the Monte Carlo method, the distribution of the incubation periods in some of these neurodegenerative disorders, such as: bovine spongiform encephalopathy well known as mad cow disease (BSE), Variant Creutzfeldt Jakob disease (vCJD) and murine scrapie, an experimental murine prionic disease. The distribution of the incubation times of these diseases were considered lognormal. The aim of this study was to investigate some aspects of toxicity and replication of the prionic diseases, by comparing the results of computational simulations with the incubation times of BSE, vCJD and murine scrapie, previously established. Computational simulations, using a Dynamical Monte Carlo method (DMC) and the diffusion limited aggregation model (DLA), were worked out. At first, we evaluate the Eigen model through computational simulations using the DMC to verify the essential parameters in the kinetic of the prionic diseases. Following the results, we studied the toxicity of the prionic diseases using the DMC and the DLA model; by considering that PrPC converting in PrPSc just when exists contact (autocatalysis) and free PrPCs are allowed to diffuse randomly to their nearest neighbour sites in a square lattice, while isolated PrPScs or aggregate of PrPScs are fixed. Confirming the Eigen suspicion, the most important parameter in the equation of the prionic kinetic is the Michaelis Menten term (or the autocatalytic term). The results obtained through simulations using DMC and DLA model were compared with the time distribution profiles of the prionic diseases already established (BSE, vCJD and murine Scrapie). We get the fitting in different profiles of the distribution of the incubation periods (lognormal to BSE and vCJD and lognormal with a second peak to murine scrapie). It is concluded that autocatalysis is an essential mechanism for the prionic kinetics and the spontaneous conversion of PrPC in PrPSc can be neglected. Starting from the DLA model, is reinforced that the hypothesis for BSE and vCJD, prionic diseases of natural occurrence, the toxicity is caused, mainly, by the formation of amyloid plaques. For Scrapie murina, an experimentally induced infection, the toxicity is, possibly, caused by two mechanisms: formation of amyloid plaques and depletion of PrPC. Just with the change of the initial and final parameters, we fitted all studied prionic diseases, in spite of the model to be quite simple. The lognormality from the model, is resulting of a diffusive process. Concentrations of PrPC should be low, smaller than 1% and the number of PrPScs should be smaller than 10 for the lognormality take place without the depletion of PrPC.

La technique d’acquisition comprimée ou compressed sensing (CS) exploite la compressibilité de différents types d’images pour reconstruire des données sous-échantillonnées sans perte d’informations. Cette technique peut être appliquée à l’IRM pour réduire les temps d’acquisition. CS est basée sur trois composantes majeures : (1) la représentation parcimonieuse du signal dans un domaine de transformation, (2) des mesures incohérentes et (3) une méthode de reconstruction non-linéaire avec une contrainte de parcimonie. Dans la première résultats partie de cette thèse, nous proposons un nouveau modèle de sous-échantillonnage basé sur la théorie de l’agrégation limitée par la diffusion (DLA) et montrons qu’il est plus performant que la méthode de sous-échantillonnage aléatoire. Le modèle de sous-échantillonnage DLA a été utilisé pour implémenter la technique de CS pour l’imagerie haute résolution pondérée T2 et T1 sur un champ magnétique très intense (17.2T). Pour chacune des pondérations, le temps d’acquisition a été réduit de 50% tout en conservant la qualité des images en termes de résolution spatiale, rapport contraste sur bruit et quantification de l’intensité du signal. Les deux nouvelles séquences d’impulsions CS (csRARE et csFLASH) ont été implémentées sur le logiciel commercial ParaVision 5.1. La seconde résultats partie de la thèse est centrée sur l’étude de la dépendance en temps de la diffusivité dans le ganglion abdominal de l’Aplysia Californica. Le ganglion abdominal de l’aplysie a été choisi pour cette étude d’imagerie car l’IRM à haute résolution permet la description anatomique fine du réseau cellulaire (taille des neurones individuels et orientation des axones). Utiliser les tissus neuronaux de l’aplysie pour étudier la relation entre la structure cellulaire et le signal d’IRM de diffusion peut permettre de comprendre cette relation pour des organismes plus complexes. Le signal d’IRM de diffusion (IRMd) a été mesuré à différents temps de diffusion dans le ganglion abdominal et des simulations de la diffusion de l’eau dans des géométries obtenues à partir de la segmentation d’images haute résolution pondérées T2 et l’incorporation d’informations sur la structure cellulaire trouvées dans la littérature ont été réalisées. Pour comparer le signal d’IRMd dans des neurones composés d’une seule cellule avec le signal des simulations numériques, des cellules de grande taille ont été segmentées à partir d’images anatomiques pondérées T2. A l’intérieur des cellules, un noyau à forme irrégulière a été généré manuellement (environ 25-30% en fraction volumique). Les petites cellules ont été modélisées comme des petites sphères avec un petit noyau sphérique concentrique (environ 25% en fraction volumique). Le nerf a été modélisé en combinant des axones (cylindres) de différents diamètres en cohérence avec la littérature. Le signal numérique d’IRMd a été simulé en résolvant l’équation de Bloch-Torrey pour les domaines géométriques décris ci-dessus. En fittant le signal expérimental avec le signal simulé pour différents types de cellules comme les grandes cellules neuronales (diamètre entre 150 et 420 µm), des agrégats de petites cellules neuronales ayant la forme d’un sac (jusqu’à 400 cellule chez l’aplysie adulte dans chaque sac avec une taille cellulaire entre 40 et 100 µm de diamètre), des nerfs (groupes d’axones de forme cylindrique avec un diamètre de moins de 1 à 25 µm) pour une grande gamme de temps de diffusions, nous avons obtenu des estimations du coefficient de diffusion intrinsèque dans le noyau et le cytoplasme (pour les neurones) et le coefficient de diffusion intrinsèque dans les axones (pour les nerfs). Nous avons aussi évalué la pertinence d’utiliser une formule préexistante décrivant la dépendance en temps du coefficient de diffusion pour estimer la taille des cellules. / Compressed sensing (CS) exploits the compressibility of different types of images to reconstruct undersampled data without loss of information. The technique can be applied to MRI to reduce the acquisition times. The CS is based on three major components: (1) sparsity representation of the signal in some transform domain, (2) incoherent measurements, and (3) sparsity-constrained nonlinear reconstruction method. If the total number of points in the image is larger than four times the number of sparse coefficients, then the reconstruction of under sampled data is feasible. In the first results part of this thesis, we propose a new under sampling model based on the diffusion limited aggregation (DLA) theory and show that it performs better than the random variable under sampling method. The DLA under sampling model was used to implement the CS for T2-weighted and T1-weighted high resolution imaging at the ultra-high magnetic field (17.2T). In both cases, the acquisition time was reduced by 50% while maintaining the quality of the images in terms of spatial resolution, contrast to noise ratio, and signal intensity quantification. Both new CS pulse sequences (csRARE and csFLASH) were implemented in ParaVision 5.1 commercial software. The second results part of the thesis is focused on the study of the time-dependent diffusivity in the abdominal ganglion of Aplysia California. The Aplysia abdominal ganglion was chosen in this imaging study because high resolution MR imaging allows the fine anatomical description of the cellular network (size of individual neurons and orientation of axons). Using the Aplysia ganglia to study the relationship between the cellular structure and the diffusion MRI signal can shed light on this relationship for more complex organisms. We measured the dMRI signal at several diffusion times in the abdominal ganglion and performed simulations of water diffusion in geometries obtained after segmenting high resolution T2-weighted images and incorporating known information about the cellular structure from the literature. To match the dMRI signal in the single cell neurons with numerical simulations signal, the large cell outline was segmented from the anatomical T2 weighted image. Inside this cell shape, an irregularly shaped nucleus was manually generated (around 25-30% volume fraction). The small cells were modeled as small spheres with a smaller concentric spherical nucleus (around 25% volume fraction). The nerve was modeled by combining axons (cylinders) of different diameters consistent with the literature. The numerical dMRI signal can be simulated by solving Bloch-Torrey equation under the geometries domain described above. By fitting the experimental signal to the simulated signal for several types of cells such as: large cell neurons (diameter between 150 µm and 420 µm); cluster of small neuron cells gathered in the shape of a bag (up to 400 cells in adult Aplysia in each bag with cell size between 40 µm to 100 µm in diameter); and nerves (group of axons cylindrical shape diameter from less than 1 µm to 25 µm) at a wide range of diffusion times, we obtained estimates of the intrinsic diffusion coefficient in the nucleus and the cytoplasm (for cell neurons) and the intrinsic diffusion coefficient in the axons (for the nerves). We also evaluated the reliability of using an existing formula for the time-dependent diffusion coefficient to estimate cell size.

Poezja dla dzieci jest to dziedzina twórczości literackiej wyróżniana ze względu na stosunkowo wyrazistą kategorię adresata. Za poezję dla dzieci uznaje się jedynie utwory intencjonalnie kierowane do dzieci. W myśl klasyfikacji historyka literatury J. Cieślikowskiego najbardziej uchwytne są te formy poezji dla dzieci, które mają odpowiedniki w folklorze: kołysanki, wyliczanki, rymowanki itp. Rozwój polskiej poezji dla dzieci charakteryzuje wielość tendencji, ujawniających się w różnych modelach wierszy: od dydaktycznego S. Jachowicza, przez pieśniowy M. Konopnickiej, ludowy J. Porazińskiej, „dziecięcy” K. Iłłakowiczówny, lingwistyczny J. Tuwima i J. Brzechwy, medytacyjny J. Kulmowej, refleksyjny J. Ratajczaka, do kreacyjnego A. Kamieńskiej, W. Chotomskiej i D. Wawiłow. Punktem dojścia jest liryka dziecięcego punktu widzenia. W utworach młodszej generacji poetów wiersze dla dzieci tracą często regularny rytm i rym, na plan pierwszy wysuwa się obraz poetycki, ton refleksyjny oraz zabawa słowami i fabułami utworów. Bajka – to jeden z najczęściej uprawianych gatunków literatury dydaktycznej. Ze względu na walory dydaktyczne (jasno sprecyzowany morał) oraz przystępność formy (niewielka objętość) utwory należące do tego gatunku występują od początku rozwoju literatury dla dzieci po współczesność. W obrębie bajki wyróżnia się zwykle dwa podgatunki: bajka magiczna, czyli baśń i bajka zwierzęca. Za twórcę tej ostatniej uważa się bajkopisarza greckiego Ezopa, pochodzącego z Azji... [toliau žr. visą tekstą] / Poezija vaikams - tai literatūrinės kūrybos sritis, išskirta dėl konkretaus adresato. Vaikų poezija laikomi kūriniai, skirti būtent vaikams. Literatūroje dominuojanti estetinė funkcija vaikų poezijoje modifikuojasi į liaudinę bei didaktinę funkcijas ir įvairias jų atmainas. Labai svarbi funkcija - mažojo adresato kontakto užmezgimas ir palaikymas su pasakotoju. Vaikų poezijoje dažnos eiliuotos epinės formos su pramogine fabula, anekdotu ar eiliuotu dialogu. Pasak literatūros istoriko J. Cieslikovskio, patraukliausios yra tos poezijos vaikams formos, kurios turi atitikmenis folklore: lopšines, skaičiuotės, žaidinimai ir t.t. Vaikų poezija vystėsi nuo paprastų formų, nuo paprastų žaidinimų, kuriomis linksmino ar migdė vaikus, iki vaikiškų skaičiuočių bei dainelių, inspiruotų folkloro, pasakų, pasakaičių - tradicinės liaudies pasakos atmainų, pateiktų miniatiūrų ar eilių forma. Lenkiškos poezijos vaikams raidoje yra įvairių tendencijų, būdingų skirtingiems eilėraščių modeliams: nuo S. Jachovičiaus didaktinio, M. Konopnickos dainingojo, J. Porazinskos liaudiškojo, K. Ilakovičuvnos „vaikiškojo“, J. Tuvimo ir J. Bžechvos lingvistinio, J. Kulmovos meditacinio, J. Ratajčako refleksinio iki A. Kamenskos, V. Chotomskos ir D. Vavilovos originaliųjų. Atspirties taškas lyrika, atitinkanti vaikų pasaulėžiūrą. Jaunesniosios poetų kartos eilėraščiai vaikams dažnai netenka reguliariojo ritmo ir rimo, dėmesys kreipiamas į poetinį vaizdą, refleksinį toną, taip pat žodžių žaismą ir fabulą... [toliau žr. visą tekstą] / Poetry for children is the sphere of literature which is singled out for its clear audience category. The poetry is intended for children. Esthetical function usually prevailing in literature is modified in poetry for children to become didactical. It is important to maintain a relation between the young listener and the narrator. Paradramatical forms, anecdotes, epical forms with attractive narration are met in poetry for children. According to J.Cieslikowski, literature historian, the most acceptable are the forms of poetry which have equivalents in folk: lullabies, counting-out rhymes and e. c. Poetry for children developed from the simplest forms used to entertain or to lull kids, through counting-out rhymes to more complicated: songs inspired by folk, then fables, and finally, rhymed mini-tales intended for kids. Development of Polish poetry for children in characterized by a number of tendencies which appear in different models of poems: starting with didactical poems by S.Jachowicz, through songlike poems by M.Konopnicka, folk poetry by J.Porazinska, “childish” poetry by K.Illakowiczowna, linguistic poetry by J.Tuwim and J.Brzechwa, meditation poetry by J.Kulmowa, reflection poetry by J.Ratajczak, to creational poetry by A.Kamienska, W.Chotomska and D.Wawilow. A lyric of children’s point of view is the destination. Poems by younger generation of poets often miss regular rhythm and rhyme, poetical picture, reflective tone as well as play of words and plots of the... [to full text]

This diploma thesis deals with the social housing policy in the Visegrad countries focused on the age group up to 34 years, socalled the starter housing. The theoretical part is dedicated to the subsidy of housing and specific housing policy instruments in individual countries. In the practical part these instruments are examined in terms of their usability. The main part of the practical part forms the regression analysis. This analysis investigates the dependence of the number of social housing on economic indicators (GDP, rate of unemployment, inflation, the amount of contributions to the social insurance system). The aim of the thesis is the suggestion of recommendations for the Czech Republic to improve the quality of services in the housing sector and the more effective use of the instruments of the state to support social housing of this age group.

After nearly 100 years of particle acceleration, particle accelerator experiments continue providing results within the field of high energy physics. Particle acceleration is used worldwide in practical applications such as radiation therapy and materials science research. Unfortunately, these accelerators are large and expensive. Dielectric Laser Acceleration (DLA) is a promising technique for accelerating particles with high acceleration gradients, without requiring large-scale accelerators. DLA utilizes the electric field of a high energy laser to accelerate electrons in the proximity of a nanostructured dielectric surface.The aim of this project was limited to laser beam routing and imaging techniques for a DLA experiment. The goal was to design the laser beam pathway between the laser and the dielectric sample, and testing a proposed imaging system for aiming the laser. This goal was achieved in a test setup using a low-energy laser. In the main setup including a femtosecond laser, the result indicated lack of focus. For a full experimental setup, a correction of this focus is essential and the beam path would need to be combined with a Scanning Electron Microscope (SEM) as an electron source.

Le premier sujet d'étude est l'application des méthodes de dynamique de gaz sur réseau en champ moyen à l'électrochimie, en particulier à l'électrocristallisation.<br /><br />Le présent modèle, issu de la physique statistique, utilise des équations cinétiques microscopiques en champ moyen, pour décrire l'évolution des cinq espèces en présence~: métal, cation, anion, solvant et espèce électronique. En établissant ces équations à partir de considérations microscopiques, nous cherchons à modéliser la croissance de structures arborescentes sur la cathode, en tenant compte des effets d'anisotropie cristalline et de la mobilité des espèces, du potentiel appliqué et du taux de transfert électronique.<br /><br />Pour valider le modèle numériquement, nous commençons par étudier des systèmes unidimensionnels simplifiés, puis montrons qu'il est possible d'obtenir des croissances arborescentes bidimensionnelles.<br /><br />Le deuxième sujet est une approche analytique de la DLA dans un modèle plus limité de croissance d'aiguilles, par la méthode classique de transformation conforme. Le point nouveau est de modifier le modèle, en supposant que la croissance est discrète et probabiliste. Ceci permet d'obtenir une équation discrète de Fokker-Planck sur la probabilité de trouver au temps t une distribution donnée des longueurs d'aiguilles.<br /><br />En supposant un scénario de croissance hiérarchique, avec doublements de période successifs, on retrouve analytiquement la distribution d'aiguilles en fonction de la hauteur, prévue numériquement par des études antérieures.

Achieving high computation efficiency, in terms of Cycles per Instruction (CPI), for high-performance computing kernels is an interesting and challenging research area. Dense Linear Algebra (DLA) computation is a representative high-performance computing ap- plication, which is used, for example, in LU and QR factorizations. Unfortunately, mod- ern off-the-shelf microprocessors fall significantly short of achieving theoretical lower bound in CPI for high performance computing applications. In this thesis, we perform an in-depth analysis of the available parallelisms and propose suitable algorithmic and architectural variation to significantly improve the computation efficiency. There are two standard approaches for improving the computation effficiency, first, to perform application-specific architecture customization and second, to do algorithmic tuning. In the same manner, we first perform a graph-based analysis of selected DLA kernels. From the various forms of parallelism, thus identified, we design a custom processing element for improving the CPI. The processing elements are used as building blocks for a commercially available Coarse-Grained Reconfigurable Architecture (CGRA). By per- forming detailed experiments on a synthesized CGRA implementation, we demonstrate that our proposed algorithmic and architectural variations are able to achieve lower CPI compared to off-the-shelf microprocessors. We also benchmark against state-of-the-art custom implementations to report higher energy-performance-area product. DLA computations are encountered in many engineering and scientific computing ap- plications ranging from Computational Fluid Dynamics (CFD) to Eigenvalue problem. Traditionally, these applications are written in highly tuned High Performance Comput- ing (HPC) software packages like Linear Algebra Package (LAPACK), and/or Scalable Linear Algebra Package (ScaLAPACK). The basic building block for these packages is Ba- sic Linear Algebra Subprograms (BLAS). Algorithms pertaining LAPACK/ScaLAPACK are written in-terms of BLAS to achieve high throughput. Despite extensive intellectual efforts in development and tuning of these packages, there still exists a scope for fur- ther tuning in this packages. In this thesis, we revisit most prominent and widely used compute bound algorithms like GMM for further exploitation of Instruction Level Parallelism (ILP). We further look into LU and QR factorizations for generalizations and exhibit higher ILP in these algorithms. We first accelerate sequential performance of the algorithms in BLAS and LAPACK and then focus on the parallel realization of these algorithms. Major contributions in the algorithmic tuning in this thesis are as follows: Algorithms: We present graph based analysis of General Matrix Multiplication (GMM) and discuss different types of parallelisms available in GMM We present analysis of Givens Rotation based QR factorization where we improve GR and derive Column-wise GR (CGR) that can annihilate multiple elements of a column of a matrix simultaneously. We show that the multiplications in CGR are lower than GR We generalize CGR further and derive Generalized GR (GGR) that can annihilate multiple elements of the columns of a matrix simultaneously. We show that the parallelism exhibited by GGR is much higher than GR and Householder Transform (HT) We extend generalizations to Square root Free GR (also knows as Fast Givens Rotation) and Square root and Division Free GR (SDFG) and derive Column-wise Fast Givens, and Column-wise SDFG . We also extend generalization for complex matrices and derive Complex Column-wise Givens Rotation Coarse-grained Recon gurable Architectures (CGRAs) have gained popularity in the last decade due to their power and area efficiency. Furthermore, CGRAs like REDEFINE also exhibit support for domain customizations. REDEFINE is an array of Tiles where each Tile consists of a Compute Element and a Router. The Routers are responsible for on-chip communication, while Compute Elements in the REDEFINE can be domain customized to accelerate the applications pertaining to the domain of interest. In this thesis, we consider REDEFINE base architecture as a starting point and we design Processing Element (PE) that can execute algorithms in BLAS and LAPACK efficiently. We perform several architectural enhancements in the PE to approach lower bound of the CPI. For parallel realization of BLAS and LAPACK, we attach this PE to the Router of REDEFINE. We achieve better area and power performance compared to the yesteryear customized architecture for DLA. Major contributions in architecture in this thesis are as follows: Architecture: We present design of a PE for acceleration of GMM which is a Level-3 BLAS operation We methodically enhance the PE with different features for improvement in the performance of GMM For efficient realization of Linear Algebra Package (LAPACK), we use PE that can efficiently execute GMM and show better performance For further acceleration of LU and QR factorizations in LAPACK, we identify macro operations encountered in LU and QR factorizations, and realize them on a reconfigurable data-path resulting in 25-30% lower run-time