The thesis analyzes and interprets selected landscape motifs corresponding with biblical symbols in the first three collections of poetry of catholic author Václav Renč. The aim of this thesis is to give an opinion on my hypothesis that biblical symbol is a competent way of interpretation Bremond's pure poetry, and to evaluate the competence of Renč's poetry belonging to the concept of pure poetry. Also defining the limits of pure poetry through a comparison with the fourth Renč's collection which already shows significant changes in it's poetics. The theoretical part is focused on contemporary and modern literary-scientific views on Václav Renč's work, on the concept of poetry provided by Bremond, his reception in our backround and the role of the symbol in pure poetry. The thesis methodologically works with the symbol in connection with Zdeněk Mathauser's theory of a circle symbol that best corresponds with Bremond's understanding of poetry and is considered as the essential base of the theory of pure poetry. The practical part discusses the crucial landscape symbols (earth, flower and fruit, bush and tree) in single collections based on biblical interpretation and then describes their transformation in each of them. The conclusion of the confrontation with the next and at the same time the...

Cette thèse s'articule autour de la détection de similarités globales et locales dans les structures protéiques. Premièrement les structures sont comparées, mesurées en termes de distance métrique dans un but de classification supervisée. Cette classification des domaines structuraux au sein de classifications hiérarchiques se fait par le biais de dominances et d'apprentissages permettant d'assigner plus rapidement et de manière exacte de nouveaux domaines. Deuxièmement, nous proposons une méthode de manière de traduire un problème biologique dans les formalisme des graphes. Puis nous résolvons ce problème via le parcours de ces graphes pour extraire les différentes sous-structures similaires. Cette méthode repose sur des notions de compatibilités entre éléments des structures ainsi que des critères de distances entre éléments. Ces techniques sont capables de détecter des événements tels que des permutations circulaires, des charnières (flexibilité) et des répétitions de motifs structuraux. Finalement nous proposons une nouvelle approche dans l'analyse fine de structures afin de faciliter la recherche de régions divergentes entre structures 3D fortement similaires. / This thesis focusses on local and global similarities and divergences inside protein structures. First, structures are scored, with criteria of similarity and distance in order to provide a supervised classification. This structural domain classification inside existing hierarchical databases is possible by using dominances and learning. These methods allow to assign new domains with accuracy and exactly. Second we focusses on local similarities and proposed a method of protein comparison modelisation inside graphs. Graph traversal allows to find protein similar substructures. This method is based on compatibility between elements and criterion of distances. We can use it and detect events such that circular permutations, hinges and structural motif repeats. Finally we propose a new approach of accurate protein structure analysis that focused on divergences between similar structures.

Nous présentons dans cette thèse un système de correction automatique d'annotations (tags) fournies par des utilisateurs qui téléversent des vidéos sur des sites de partage de documents multimédia sur Internet. La plupart des systèmes d'annotation automatique existants se servent principalement de l'information textuelle fournie en plus de la vidéo par les utilisateurs et apprennent un grand nombre de "classifieurs" pour étiqueter une nouvelle vidéo. Cependant, les annotations fournies par les utilisateurs sont souvent incomplètes et incorrectes. En effet, un utilisateur peut vouloir augmenter artificiellement le nombre de "vues" d'une vidéo en rajoutant des tags non pertinents. Dans cette thèse, nous limitons l'utilisation de cette information textuelle contestable et nous n'apprenons pas de modèle pour propager des annotations entre vidéos. Nous proposons de comparer directement le contenu visuel des vidéos par différents ensembles d'attributs comme les sacs de mots visuels basés sur des descripteurs SIFT ou des motifs fréquents construits à partir de ces sacs. Nous proposons ensuite une stratégie originale de correction des annotations basées sur la fréquence des annotations des vidéos visuellement proches de la vidéo que nous cherchons à corriger. Nous avons également proposé des stratégies d'évaluation et des jeux de données pour évaluer notre approche. Nos expériences montrent que notre système peut effectivement améliorer la qualité des annotations fournies et que les motifs fréquents construits à partir des sacs de motifs fréquents sont des attributs visuels pertinents / This thesis presents a new system for video auto tagging which aims at correcting the tags provided by users for videos uploaded on the Internet. Most existing auto-tagging systems rely mainly on the textual information and learn a great number of classifiers (on per possible tag) to tag new videos. However, the existing user-provided video annotations are often incorrect and incomplete. Indeed, users uploading videos might often want to rapidly increase their video’s number-of-view by tagging them with popular tags which are irrelevant to the video. They can also forget an obvious tag which might greatly help an indexing process. In this thesis, we limit the use this questionable textual information and do not build a supervised model to perform the tag propagation. We propose to compare directly the visual content of the videos described by different sets of features such as SIFT-based Bag-Of-visual-Words or frequent patterns built from them. We then propose an original tag correction strategy based on the frequency of the tags in the visual neighborhood of the videos. We have also introduced a number of strategies and datasets to evaluate our system. The experiments show that our method can effectively improve the existing tags and that frequent patterns build from Bag-Of-visual-Words are useful to construct accurate visual features

Cette thèse établit l'inventaire exhaustif des synagogues de Casablanca en service, celles qui sont fermées ou encore celles disparues et dont on n'a plus de traces, ainsi que celui des objets rituels qu'elles renferment. L'implantation de ces lieux de culte constitue également une source d'informations sur la communauté juive Casablancaise et sur la mobilité de sa population entre 1911 et 2013. Casablanca, musée à ciel ouvert, a été influencée par des courants artistiques importés par l'Occident, tels que le Bauhaus, le style Art Nouveau, l'Art déco, des éléments gothiques ... associés à l'influence locale, aux courants internes au Maroc et à l'architecture coloniale. Adoptés par les familles juives de Casablanca, ces courants architecturaux vont finalement être appliqués à l'archtecture des synagogues, à leur mobilier et aux objets de culte. / This thesis is an exhaustive inventory of Casablanca synagogues (based on, closed or missing) and ritual objects they contain. The etablishment of these places of worship provide also information on the jewish community of this city as well as the mobility of its population between 1911 and 2013. Casablanca, open-air museum, was influenced by artistic currents imported by colonization, such as the bauhaus, Art nouveau style, Art Déco, gothics elements ... mixed with local influence and architecture imported from the other cities of Morocco, as well as colonial architecture. Those architectural movements will penetrate private houses including jewish families of Casablanca to finally get into the synagogues and influence their architecture, furniture and liturgical objects.

Le contentieux administratif de la séparation des Eglises et de l’Etat sous la IIIe République est un objet ancien de curiosité doctrinale. Un renouvellement de l’approche traditionnelle était cependant possible. Alors que les études classiques insistent sur l’apport du Conseil d’Etat à la réussite de la Séparation et à la protection des libertés de conscience et des cultes, il est envisageable d’étudier la jurisprudence sous l’angle des interactions entre les institutions républicaines et le contrôle juridictionnel de l’administration. Soumise à cette problématique, l’oeuvre du Conseil d’Etat permet une approche monografique de l’histoire de la juridiction administrative républicaine révélant les influences réciproques entre le juge administratif et les institutions républicaines. Dans le cas du contentieux de la Séparation, la jurisprudence administrative a ainsi joué un rôle décisif dans la mise en oeuvre et l’approfondissement des grands principes de la loi du 9 décembre 1905, contribuant à donner une consistance à la notion juridique de laïcité de l’Etat. Dans le même temps, et spécialement dans le cadre du contentieux de la police des cultes, le contexte politique et juridique de la Séparation a contribué à la construction du recours pour excès de pouvoir républicain. Cet apport s’est manisfesté par la modernisation des techniques de contrôle juridictionnel et par un encadrement plus étroit du pouvoir discrétionnaire de l’autorité de police. En abordant ces deux aspects du contentieux de la Séparation, cette étude voudrait éclairer la transformation d’une justice administrative d’inspiration impériale en une justice administrative démocratique et républicaine. / Law scolars are traditionnally interested in the implementation of the separation of church and state by the administrative courts during the Third Republic. However, a renewal of the classic understanding was possible. While classic studies focus on the contribution of the Conseil d’Etat to the success of the Séparation and the protection of freedom of thought and religion, it is conceivable to study administrative case law from the angle of interactions between republican institutions and judicial review of administration. This methodological framework allows to underline mutual influences between the judiciary and republican institutions in the history of the administrative jurisdiction. Thus, as the Séparation is concerned, case law has played a strategic part in the implementation and enrichment of the principles established by the 9 december 1905 Act, therefore contributing to provide substance to the legal concept of laïcité de l’Etat. In the same time, and especially concerning the case law relating to the administrative regulation of expressions of religious beliefs in the public space, the political and legal context of the Séparation has had a decisive influence on the construction of the republican recours pour excès de pouvoir. This contribution consisted in a modernization of the judicial review techniques and a more accurate control of discretionary powers of the administrative authority. Through the study of the two main aspects of administrative case law relating to the Séparation, this research would like to enlighten the transformation of the traditional imperial-type administrative jurisdiction into a democratic and republican one.

A crescente disponibilidade de dados em diferentes domínios tem motivado o desenvolvimento de técnicas para descoberta de conhecimento em grandes volumes de dados complexos. Trabalhos recentes mostram que a busca em dados complexos é um campo de pesquisa importante, já que muitas tarefas de mineração de dados, como classificação, detecção de agrupamentos e descoberta de motifs, dependem de algoritmos de busca ao vizinho mais próximo. Para resolver o problema da busca dos vizinhos mais próximos em domínios complexos muitas abordagens determinísticas têm sido propostas com o objetivo de reduzir os efeitos da maldição da alta dimensionalidade. Por outro lado, algoritmos probabilísticos têm sido pouco explorados. Técnicas recentes relaxam a precisão dos resultados a fim de reduzir o custo computacional da busca. Além disso, em problemas de grande escala, uma solução aproximada com uma análise teórica sólida mostra-se mais adequada que uma solução exata com um modelo teórico fraco. Por outro lado, apesar de muitas soluções exatas e aproximadas de busca e mineração terem sido propostas, o modelo de programação em CPU impõe restrições de desempenho para esses tipos de solução. Uma abordagem para melhorar o tempo de execução de técnicas de recuperação e mineração de dados em várias ordens de magnitude é empregar arquiteturas emergentes de programação paralela, como a arquitetura CUDA. Neste contexto, este trabalho apresenta uma proposta para buscas kNN de alto desempenho baseada numa técnica de hashing e implementações paralelas em CUDA. A técnica proposta é baseada no esquema LSH, ou seja, usa-se projeções em subespac¸os. O LSH é uma solução aproximada e tem a vantagem de permitir consultas de custo sublinear para dados em altas dimensões. Usando implementações massivamente paralelas melhora-se tarefas de mineração de dados. Especificamente, foram desenvolvidos soluções de alto desempenho para algoritmos de descoberta de motifs baseados em implementações paralelas de consultas kNN. As implementações massivamente paralelas em CUDA permitem executar estudos experimentais sobre grandes conjuntos de dados reais e sintéticos. A avaliação de desempenho realizada neste trabalho usando GeForce GTX470 GPU resultou em um aumento de desempenho de até 7 vezes, em média sobre o estado da arte em buscas por similaridade e descoberta de motifs / The increasing availability of data in diverse domains has created a necessity to develop techniques and methods to discover knowledge from huge volumes of complex data, motivating many research works in databases, data mining and information retrieval communities. Recent studies have suggested that searching in complex data is an interesting research field because many data mining tasks such as classification, clustering and motif discovery depend on nearest neighbor search algorithms. Thus, many deterministic approaches have been proposed to solve the nearest neighbor search problem in complex domains, aiming to reduce the effects of the well-known curse of dimensionality. On the other hand, probabilistic algorithms have been slightly explored. Recently, new techniques aim to reduce the computational cost relaxing the quality of the query results. Moreover, in large-scale problems, an approximate solution with a solid theoretical analysis seems to be more appropriate than an exact solution with a weak theoretical model. On the other hand, even though several exact and approximate solutions have been proposed, single CPU architectures impose limits on performance to deliver these kinds of solution. An approach to improve the runtime of data mining and information retrieval techniques by an order-of-magnitude is to employ emerging many-core architectures such as CUDA-enabled GPUs. In this work we present a massively parallel kNN query algorithm based on hashing and CUDA implementation. Our method, based on the LSH scheme, is an approximate method which queries high-dimensional datasets with sub-linear computational time. By using the massively parallel implementation we improve data mining tasks, specifically we create solutions for (soft) realtime time series motif discovery. Experimental studies on large real and synthetic datasets were carried out thanks to the highly CUDA parallel implementation. Our performance evaluation on GeForce GTX 470 GPU resulted in average runtime speedups of up to 7x on the state-of-art of similarity search and motif discovery solutions

Fatores de transcrição (FT) são proteínas que se ligam em sequências específicas e bem conservadas de nucleotídeos no DNA, denominadas sítios de ligação dos fatores de transcrição (SLFT), localizadas em regiões de regulação gênica conhecidas como módulos cis-reguladores (CRM). Ao reconhecer o SLFT, o fator de transcrição se liga naquele sítio e influencia a transcrição gênica positiva ou negativamente. Existem técnicas experimentais para a identificação dos locais dos SLFTs em um genoma, como footprinting, ChIP-chip ou ChIP-seq. Entretanto, a execução de tais técnicas implica em custos e tempo elevados. Alternativamente, pode-se utilizar as sequências de SLFTs já conhecidas para um determinado fator de transcrição e aplicar técnicas de aprendizado computacional supervisionado para criar um modelo computacional para tal sítio e então realizar a predição computacional no genoma. Entretanto, a maioria das ferramentas computacionais existentes para esse fim considera independência entre as posições entre os nucleotídeos de um sítio - como as baseadas em PWMs (position weight matrix) - o que não é necessariamente verdade. Este projeto teve como objetivo avaliar a utilização de gramáticas regulares estocásticas (GRE) como técnica alternativa às PWMs neste problema, uma vez que GREs são capazes de caracterizar dependências entre posições consecutivas dos sítios. Embora as diferenças de desempenho tenham sido sutis, GREs parecem mesmo ser mais adequadas do que PWMs na presença de valores mais altos de dependência de bases, e PWMs nos demais casos. Por fim, uma ferramenta de predição computacional de SLFTs foi criada baseada tanto em GREs quanto em PWMs. / Transcription factors (FT) are proteins that bind to specific and well-conserved sequences of nucleotides in the DNA, called transcription factor binding sites (TFBS), contained in regions of gene regulation known as cis-regulatory modules (CRM). By recognizing TFBA, the transcription factor binds to that site and positively or negatively influence the gene transcription. There are experimental procedures for the identification of TFBS in a genome such as footprinting, ChIP-chip or ChIP-Seq. However, the implementation of these techniques involves high costs and time. Alternatively, one may utilize the TFBS sequences already known for a particular transcription factor and applying computational supervised learning techniques to create a computational model for that site and then perform the computational prediction in the genome. However, most existing software tools for this purpose considers independence between nucleotide positions in the site - such as those based on PWMs (position weight matrix) - which is not necessarily true. This project aimed to evaluate the use of stochastic regular grammars (SRG) as an alternative technique to PWMs in this problem, since SRGs are able to characterize dependencies between consecutive positions in the sites. Although differences in performance have been subtle, SRGs appear to be more suitable than PWMs in the presence of higher base dependency values, and PWMs in other cases. Finally, a computational TFBS prediction tool was created based on both SRGs and PWMs.

Qu’évoque la motivation ? Comment le droit répressif appréhende-t-il la motivation des décisions de justice ? Le concept de motivation renvoie à plusieurs aspects qui changent son sens suivant le rôle assigné à la fonction juridictionnelle. S’il est compréhensible qu'une seule et unique approche ne s'impose pas, la motivation doit être reconsidérée.Elle est en effet généralement perçue comme un instrument contentieux, l’objectif étant de limiter l’arbitraire du juge. A cette fin, elle appelle un ensemble de règles devant s’imposer au juge. L'examen de ces règles dans le domaine du droit répressif aboutit à un résultat peu satisfaisant. Si la motivation est imposée au juge dans certains cas, elle est en revanche écartée dans d’autres, sans qu’on puisse imposer un critère unique légitimant une telle distinction. La nature objective de son contenu est marquée par des lacunes qui alimentent l’approche subjective de la motivation. C'est lorsqu'il est question de méthode que les contournements sont les plus visibles : la motivation à phrase unique, le copier-coller ou encore la pratique de la motivation pré-rédigée. Au demeurant, le contrôle de la motivation, fut-il exercé par le juge européen, laisse au juge répressif une marge d'appréciation, voire parfois une totale liberté. Du droit de la motivation des décisions pénales, le résultat est finalement contrasté.Ne faut-il pas alors aller plus loin et dépasser cette approche contentieuse de la motivation des décisions pénales ? La réponse est évidemment positive. Pour mieux préserver les intérêts du justiciable, la motivation doit se transformer. Cette transformation se marque par un rapprochement de plus en plus fort entre la motivation et les droits fondamentaux du justiciable. La motivation se révèle en effet être la condition de l'exercice des droits de la défense, en même temps qu’elle s’intègre dans le concept plus large du droit au procès équitable. Dans la dynamique de cette évolution, la motivation -en vue de la compréhension et de l’acceptation de la décision par le justiciable- doit occuper une place centrale. Cela implique d'entrevoir, au-delà des règles imposées au juge de motiver la décision, certaines améliorations afin de parvenir à la reconnaissance d’un véritable droit du justiciable à la motivation de la décision, de sa décision. / What evokes motivation? How criminal law grasps motivation of judicial decisions ?The concept of motivation refers to several aspects that change its meaning depending on the role assigned to the judicial function. While it is understandable that a single approach does not compel, motivation should be reconsidered.Motivation is in fact generally perceived as a litigation instrument for the judge, the main aim being to limit its arbitrary power. To this end, a set of rules are binding on the judge. The review of these rules in the field of criminal law leads to an unsatisfactory result. If motivation is imposed on the judge in certain judicial decisions, it is however rejected in others, and a single criterion justifying such a distinction may not appear relevant. The objective nature of its contents is marked by gaps which feed the subjective approach to the motivation. It is when it is about method that the bypassing is the most visible : the motivation with unique sentence, the copy and paste or the practice of the pre-drafted motivation. Moreover, even exercised by the European Court, control of motivation leaves the criminal judge many appreciation margins, even sometimes a total freedom. Concerning the analysis of the criminal decisions, the right of the motivation ends in a contrasted result.Should we then go further and beyond this litigating approach of motivation? The answer is obviously positive. To better safeguard the interests of citizens, motivation must be transformed. This transformation is marked by an increasing connection between motivation and fundamental human rights. The motivation turns out to be the condition for the exercise of the rights of defense, while it fits into the category of the right to fair trial. In the dynamics of this evolution, the motivation - with the aim of the understanding and of the acceptance of the decision by the citizen - has to occupy a central place. It involves to glimpse, beyond rules compulsory for the judge to motivate the decision, certain improvements in order to achieve the recognition of a genuine right of the defendant for the motivation of the decision, its decision.

Karel Toman started as a vagabond and anarchist poet, and accordingly the subjects of his lyrics were liberty, loneliness, need, and alienness. Turning away from his anarchistic way of life, the subjects changed, too: the war, the Czech land, the earth became new themes of his poems. In both stages, biblical motifs played a significant role.

Magister Scientiae (Medical Bioscience) - MSc(MBS) / Background: Despite the effort of scientific research on HIV therapies and to reduce the rate of HIV infection, AIDS remains one of the major causes of death in the world and mostly in sub-Saharan Africa. To date, neither a cure nor an HIV vaccine had been found and the disease can only be managed by using High Active Antiretroviral Therapy (HAART) if detected early. The need for an effective early diagnostic and non-toxic treatment has brought about the necessity for the discovery of additional HIV diagnostic methods and treatment regimens to lower mortality rates. Antimicrobial Peptides (AMPs) are components of the first line of defense of prokaryotes and eukaryotes and have been proven to be promising therapeutic agents against HIV. Methods: With the utility of computational biology, this work proposes the use of profile search methods combined with structural modeling to identify putative AMPs with diagnostic and anti-HIV activity. Firstly, experimentally validated anti-HIV AMPs were retrieved from various publicly available AMP databases, APD, CAMP, Bactibase and UniProtKB and classified according to super-families. Hidden Markov Model (HMMER) and Gap Local Alignment of Motifs (GLAM2) profiles were built for each super-family of anti- HIV AMPs. Putative anti-HIV AMPs were identified after scanning genome sequence databases using the trained models, retrieved AMPs, and ranked based on their E-values. The 3-D structures of the 10 peptides that were ranked highest were predicted using 1-TASSER. These peptides were docked against various HIV proteins using PatchDock and putative AMPs showing the highest affinity and having the correct orientation to the HIV -1 proteins gp120 and p24 were selected for future work to establish their function in HIV therapy and diagnosis. Results: The results of the in silica analysis showed that the constructed models using the HMMER algorithm had better performances compare to that of the models built by the GLAM2 algorithm. Furthermore, the former tool has a better statistical and probability explanation compared to the latter tool. Thus only the HMMER scanning results were considered for further study. Out of 1059 species scanned by the HMMER models, 30 putative anti-HIV AMPs were identified from genome scans with the family-specific profile models after the elimination of duplicate peptides. Docking analysis of putative AMPs against HIV proteins showed that from the 10 best performing anti-HIV AMPs with the highest E-scores, molecules 1,3, 8, and 10 firmly bind the gp120 binding pocket at the VIN2 domain and the point of interaction between gp120 and T cells, with the 1st and 3rd highest scoring anti-HIV AMPs having the highest binding affinities. However, all 10 putative anti-HIV AMPs bind to the N-terminal domain of p24 with large surface interaction, rather than the C-terminal. Conclusion: The in silica approach has made it possible to construct computational models having high performances, and which enabled the identification of putative anti-HIV peptides from genome sequence scans. The in silica validation of these putative peptides through docking studies has shown that some of these AMPs may be involved in HIV/AIDS therapeutics and diagnostics. The molecular validation of these findings will be the way forward for the development of an early diagnostic tool and as a consequence initiate early treatment. This will prevent the invasion of the immune system by blocking the VIN2 domain and thus designing of a successful vaccine with broad neutralizing activity against this domain.