The offence of blasphemy and its implications is one of the critical issues in Pakistan today. This research examines the historical setting and gradual amendment of blasphemy laws and their impact on religious communities in Pakistan. The law of blasphemy belongs to two historical periods. First, the era when the country was under military rule by the British during the colonial period: they originally framed Chapter XV of Offences Relating to Religion of the Indian Penal Code (IPC) in 1860. Secondly, its application in an independent subcontinent gradually moved from its original intention in Pakistan after 1947. In 1980s Pakistan, both the intentions of this law and its penalties were significantly altered, becoming the law which people now known as the law of blasphemy. Since the law was amended, it has made people in all religious communities, particularly minorities, critically vulnerable to malicious or unfounded accusation and has been interpreted and applied to varying effects. This historical review shows how Pakistan, though claiming to be secular and to protect all religions and communities, has actually become an exclusively Islamic country. Amending Chapter XV of Offences Relating to Religion was one of the important steps to Islamise Pakistan. This research considers a range of legal, political and constitutional questions concerning the law of blasphemy and religious communities both in pre and post-colonial periods, exploring how the law and religious communities have been and are affected by politics and legislation. In so doing, it will appraise politically significant religious laws, values and activities.

Nous nous intéressons au développement prouvé de composants formels pour un générateur de code pré-qualifié. Ce dernier produit un code séquentiel (C et Ada) pour des modèles d'entrée qui combinent les flots de données et de contrôle et qui présentent des possibilités d'exécution concurrente (Simulink/Stateflow et Scicos). Le développement prouvé permet de réduire le coût des tests et d'augmenter l'assurance des outils développés avec cette approche vis-à-vis de la qualification. Les phases de spécification, de développement et de vérification des outils développés sont effectuées avec l'assistant de preuve Coq. Ce dernier permet d'extraire le contenu calculatoire des composants en préservant les propriétés prouvées en Coq. Ce code extrait est ensuite intégré dans une chaîne complète de développement (chaîne de GeneAuto). Nous présentons un cadre formel, inspiré de l'analyse statique, qui s'appuie sur la sémantique abstraite et qui est instanciable sur plusieurs composants du générateur de code. Nous nous basons sur les ensembles partiellement ordonnés et sur le calcul de point fixe pour définir le cadre et effectuer les différentes analyses des composants du générateur de code. Ce cadre formel comporte toutes les preuves communes aux composants et indépendantes des analyses effectuées. Deux composants sont étudiés : l'ordonnanceur et le typeur des modèles d'entrée. / We are interested in the proved development of formal components for a pre-qualified code generator. This produces a sequential code (C and Ada) for input models that combine data and control flows, with potential concurrent execution (Simulink/Stateflow and Scicos). The proved development reduces test cost and increases insurance of components developed with this approach regarding the qualification. Phases of specification, development and verification of the developed components are done with the Coq proof assistant. This allows to extract the computational content of the components preserving the properties proved in Coq. The extracted code is then integrated into the complete development tool-chain (GeneAuto tool-chain). We present a formal framework, inspired from static analysis, based on the abstract semantics which is instantiable to several components of the code generator. We rely on partially ordered sets and fixed-point to define de formal framework and to perform the various analysis of components of the code generator. This formal framework includes all proofs common to the components and independent from the performed analyses. Two components are studied : the scheduler and the type checker of input models.

En Kabylie, société de tradition patriarcale à domination masculine, les femmes ont recouru pendant des siècles à une multitude de pratiques détournées, décrites dans la littérature comme des « contre-pouvoirs » (Lacoste-Dujardin, 1985, 2008). À travers nombre de processus, elles semblent avoir de tout temps défié l’autorité dominante par le recours à des pratiques magiques, par une adaptation aux normes et valeurs de la société, mais surtout par la subtilité et la maîtrise de l’art de la parole. L’injure féminine, en tant qu’acte de langage, fait également partie des stratégies qu’utilisent les femmes kabyles afin d’exercer leur pouvoir de manière indirecte sur la société dominante, autrement dit, sur les hommes.La plupart des recherches qui se sont penchées sur la question de l’injure en Kabylie ont été menées par des anthropologues qui l’abordent dans son aspect ritualisé (Aït-Ferroukh, 1999 ; Rabia, 1988) ou par des linguistes dont les réflexions portent essentiellement sur le critère sémantique envisagé en rapport avec la vision du monde et la société (Mebtouche-Nejai 2012). Dans la perspective anthropologique qui m’intéresse, l’injure sera appréhendée comme un ensemble d’actes sociaux porteurs de conséquences (Laforêt et Vincent, 2004), plutôt que comme une catégorie de parole dépréciative, d’où la nécessité de prendre en compte sa valeur pragmatique dans la dimension du tort causé ou subi ou effet injure (Larguèche 1983, 1993, 2004, 2009) qui est nécessaire à sa compréhension.En m’appuyant sur les spécificités typologiques de l’injure féminine, je tenterai de montrer, dans une optique essentiellement pragmatique, comment dans une société à domination masculine où la parole est codifiée, l’injure, en tant que transgression langagière, permet aux femmes d’exercer leur pouvoir de manière indirecte. L’examen de ces procédés permettra de cerner les enjeux du pouvoir féminin et de voir dans quelle mesure l’injure peut être utilisée comme contre-pouvoir. / In Kabylia, a society with a male-domination patriarchal tradition, women have employed for many centuries a set of indirect practices, defined in the literature as « counter-powers » (Lacoste-Dujardin, 1985, 2008). Through several processes, they looked as they have always defied the dominant authority by exercising magical practices, adapting to the norms and values of society, but also, by their mastery and subtle use of the art of speech. Female term of abuse, as an act of language, is one of the strategies used by kabyle women to exert their power in an indirect manner on the dominant society, constituted by the men.Most of the research work that focused on the issue of insults in Kabylia has been conducted by anthropologists who analyzed it in its ritualized aspect (Aït-Ferroukh, 1999, Rabia, 1988) or by linguists whose reflections were conducted essentially on the semantic criterion in relation with the worldview and society (Mebtouche-Nejai, 2012). In the anthropological perspective that interests me, the insult will be apprehended as a set of social acts with consequences (Laforêt and Vincent, 2004), rather than as a category of deprecating speech, hence the need to take into account its pragmatic value in the dimension of the harm caused or suffered or the insulting effect (Larguèche, 1983, 1993, 2004, 2009) which is necessary for its comprehension.Based on the typological specifics of female insults, I will try to show, from an essentially pragmatic perspective, in a male-dominating society where the speech is codified, how the insult, as a linguistic transgression, allows women to exert their power indirectly. Examining these processes will help to identify the stakes of feminine power and to see at what extent the insult can be used as a counter-power.

Brian Chan Hok-shing. / Thesis (M.A.)--Chinese University of Hong Kong, 1992. / Includes bibliographical references. / Abstract / Acknowledgements / Chapter 1. --- Introduction / Chapter 1.1 --- "Defining ""Code´ؤmixing""" / Chapter 1.2 --- Code-mixing in Hong Kong / Chapter 1.3 --- Aims and Objectives / Chapter 2. --- Syntactic Constraints on CM / Chapter 2.1 --- Language-universal constraints / Chapter 2.1.1 --- The Free Morpheme constraint / Chapter 2.1.2 --- The Equivalence constraint / Chapter 2.1.3 --- The Government constraint / Chapter 2.1.4 --- The Matrix Code Principle / Chapter 2.1.5 --- The Dual Structure Principle / Chapter 2.2 --- Language´ؤspecific constraints / Chapter 2.2.1 --- """Closed-Class"" word constraint" / Chapter 2.2.2 --- "The ""fragment"" constraint" / Chapter 2.2.3 --- "The ""innermost"" constituent constraint" / Chapter 3. --- A Linguistic Description of Cantonese -English code- mixing / Chapter 3.1 --- Data / Chapter 3.2 --- The major patterns and the minor patterns / Chapter 3.3 --- The major patterns: single word cases / Chapter 3.3.1 --- Verb-mixing / Chapter 3.3.2 --- Noun-mixing / Chapter 3.3.3 --- Adjective or adverb-mixing / Chapter 3.3.4 --- Preposition or conjunction-mixing / Chapter 3.4 --- The minor patterns: fragments / Chapter 3.4.1 --- Form and structure / Chapter 3.4.2 --- Cantonese fragments under English phrase structure / Chapter 4. --- Critique of the major constraints and principles / Chapter 4.1 --- The Free Morpheme constraint / Chapter 4.2 --- The Equivalence constraint / Chapter 4.3 --- The Government constraint / Chapter 4.4 --- The Matrix Code principle / Chapter 4.5 --- The Dual Structure principle / Chapter 5. --- Revised constraints / Chapter 5.1 --- The Category Equivalence constraint / Chapter 5.1.1 --- Generalizations from the patterns / Chapter 5.1.2 --- Rationale of the Category Equivalence constraint / Chapter 5.1.3 --- Categorical non-equivalence / Chapter 5.1.4 --- Insufficiency / Chapter 5.2 --- The Bound Morpheme constraint / Chapter 5.3 --- The Specifier constraint / Chapter 6. --- Processes / Chapter 6.1 --- Previous Models / Chapter 6.1.1 --- The Equivalence model / Chapter 6.1.2 --- The Matrix Code model / Chapter 6.1.3 --- The Dual Structure model / Chapter 6.2 --- A revised model / Chapter 6.2.1 --- Assumptions / Chapter 6.2.1.1 --- The Distinction between the matrix code (MC) and the embedded code (EC) / Chapter 6.2.1.2 --- Interface between MC grammar and EC lexicon / Chapter 6.2.1.3 --- "Interface between EC lexicon, EC grammar and MC grammar" / Chapter 6.2.1.4 --- Other interfaces not activated / Chapter 6.3 --- Constraints revisited / Chapter 7. --- The Case of Nonce Borrowing / Chapter 7.1 --- Definitions / Chapter 7.2 --- Objections / Notes / Chapter Appendix: --- A Database of Cantonese-English Code´ؤmixing / Bibliography

How is information processed in the brain? This is one of the main and most challenging questions in Neuroscience. The established hypothesis is that information is encoded in the temporal dynamics of spikes. However, there is growing evidence that continuous signals such as Local Field Potentials (LFP) can play an important role in coding neural information. Recently, Montemurro et al. [2008] reported that the phase-of-firing code, a mechanism previously observed in the hippocampus, is used in the sensory cortices for information encoding. In the phase-of-firing code, the neurons communicate spikes with respect to the phase of continuous signals produced by population activity, such as the LFP. Using information-theoretic measures, it was shown that when the timing of spikes was measured with respect to the phase of the LFP, an extra amount of sensory information was revealed in the responses that was not available from the spike codes alone. On the one hand, it still remains to be established how widespread this novel coding mechanism is. So far it has been verified in a few sensory modalities and it is not clear whether it is a universal coding mechanism. On the other, the estimation of information from continuous signals poses serious challenges from a technical point of view. The main reason is that accurate estimations of information measures require unrealistic amount of experimental data, mostly due to the presence of correlated activity. When these measures are applied to assess the information content in continuous responses, they lead to severe biases in the results, which can affect the conclusions regarding the validity of specific neural codes. The main goal of this Thesis is to explore the universality of the phase-of-firing code by studying it in novel systems, establish the origin of this code, and to develop more effcient numerical methods to accurately quantify information encoded in continuous brain signals. In particular, in this Thesis we investigate the role of continuous signals in sensory modalities where it has not been explored so far. We verified the presence of a phase-of-firing code in both the somatosensory cortex of the rat, and the visual thalamus of mice, thus giving support to the possible universality of this coding mechanism. While the phase-of-firing code found in these systems shares common features with those found in previous studies, we also characterised important differences. In the rat whisker system it was found that high frequency bands of the LFP play a more prominent role than that observed in the visual and auditory cortices of monkeys. This is compatible with the behavioural and mechanical constraints of this system, which require a high discrimination of finely structured temporal information in the stimulus. In the case of the visual thalamus of mice, we found that the phase-of-firing code contributes significantly to the encoding of irradiance information conveyed by melanopsin photoreceptors in the retina. We also investigated the source of the phase-of-firing codes in cortex by modelling the relationship between population spikes and LFP. In particular, we studied the interplay between the effective spatial integration of information resulting from population activity and the temporal memory imprinted in the LFP as a consequence of filtering mechanisms in the neural tissue. We found that most of the information in the LFP comes from a neural neighbourhood of a radius of about 150-350 μm, and a temporal history of 200-300 msec. Finally, we developed novel practical methods for quantifying the information content of continuous signals in the brain, which yield accurate results under realistic experimental conditions. These methods are based on the projection of the statistics of the response space into a lower dimensional manifold. In particular, we modelled continuous neural responses as a hierarchy of Markov models of increasing order, and found that the structure of temporal dependencies of real LFP can be captured by the lowest orders. This helped us put a new light on the previous studies regarding the phase-of-firing code. Altogether, these results contribute an advance both at the level of understanding information coding strategies combining spike and continuous signals, and the required computational methods to quantify accurately information in experimental neural responses.

Chan Yeuk Chi Joyce. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2005. / Includes bibliographical references. / Abstracts in English and Chinese. / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Background --- p.1 / Chapter 1.2 --- Previous Work on Code-switching Speech Recognition --- p.2 / Chapter 1.2.1 --- Keyword Spotting Approach --- p.3 / Chapter 1.2.2 --- Translation Approach --- p.4 / Chapter 1.2.3 --- Language Boundary Detection --- p.6 / Chapter 1.3 --- Motivations of Our Work --- p.7 / Chapter 1.4 --- Methodology --- p.8 / Chapter 1.5 --- Thesis Outline --- p.10 / Chapter 1.6 --- References --- p.11 / Chapter Chapter 2 --- Fundamentals of Large Vocabulary Continuous Speech Recognition for Cantonese and English --- p.14 / Chapter 2.1 --- Basic Theory of Speech Recognition --- p.14 / Chapter 2.1.1 --- Feature Extraction --- p.14 / Chapter 2.1.2 --- Maximum a Posteriori (MAP) Probability --- p.15 / Chapter 2.1.3 --- Hidden Markov Model (HMM) --- p.16 / Chapter 2.1.4 --- Statistical Language Modeling --- p.17 / Chapter 2.1.5 --- Search A lgorithm --- p.18 / Chapter 2.2 --- Word Posterior Probability (WPP) --- p.19 / Chapter 2.3 --- Generalized Word Posterior Probability (GWPP) --- p.23 / Chapter 2.4 --- Characteristics of Cantonese --- p.24 / Chapter 2.4.1 --- Cantonese Phonology --- p.24 / Chapter 2.4.2 --- Variation and Change in Pronunciation --- p.27 / Chapter 2.4.3 --- Syllables and Characters in Cantonese --- p.28 / Chapter 2.4.4 --- Spoken Cantonese vs. Written Chinese --- p.28 / Chapter 2.5 --- Characteristics of English --- p.30 / Chapter 2.5.1 --- English Phonology --- p.30 / Chapter 2.5.2 --- English with Cantonese Accents --- p.31 / Chapter 2.6 --- References --- p.32 / Chapter Chapter 3 --- Code-mixing and Code-switching Speech Recognition --- p.35 / Chapter 3.1 --- Introduction --- p.35 / Chapter 3.2 --- Definition --- p.35 / Chapter 3.2.1 --- Monolingual Speech Recognition --- p.35 / Chapter 3.2.2 --- Multilingual Speech Recognition --- p.35 / Chapter 3.2.3 --- Code-mixing and Code-switching --- p.36 / Chapter 3.3 --- Conversation in Hong Kong --- p.38 / Chapter 3.3.1 --- Language Choice of Hong Kong People --- p.38 / Chapter 3.3.2 --- Reasons for Code-mixing in Hong Kong --- p.40 / Chapter 3.3.3 --- How Does Code-mixing Occur? --- p.41 / Chapter 3.4 --- Difficulties for Code-mixing - Specific to Cantonese-English --- p.44 / Chapter 3.4.1 --- Phonetic Differences --- p.45 / Chapter 3.4.2 --- Phonology difference --- p.48 / Chapter 3.4.3 --- Accent and Borrowing --- p.49 / Chapter 3.4.4 --- Lexicon and Grammar --- p.49 / Chapter 3.4.5 --- Lack of Appropriate Speech Corpus --- p.50 / Chapter 3.5 --- References --- p.50 / Chapter Chapter 4 --- Data Collection --- p.53 / Chapter 4.1 --- Data Collection --- p.53 / Chapter 4.1.1 --- Corpus Design --- p.53 / Chapter 4.1.2 --- Recording Setup --- p.59 / Chapter 4.1.3 --- Post-processing of Speech Data --- p.60 / Chapter 4.2 --- A Baseline Database --- p.61 / Chapter 4.2.1 --- Monolingual Spoken Cantonese Speech Data (CUMIX) --- p.61 / Chapter 4.3 --- References --- p.61 / Chapter Chapter 5 --- System Design and Experimental Setup --- p.63 / Chapter 5.1 --- Overview of the Code-mixing Speech Recognizer --- p.63 / Chapter 5.1.1 --- Bilingual Syllable / Word-based Speech Recognizer --- p.63 / Chapter 5.1.2 --- Language Boundary Detection --- p.64 / Chapter 5.1.3 --- Generalized Word Posterior Probability (GWPP) --- p.65 / Chapter 5.2 --- Acoustic Modeling --- p.66 / Chapter 5.2.1 --- Speech Corpus for Training of Acoustic Models --- p.67 / Chapter 5.2.2 --- Features Extraction --- p.69 / Chapter 5.2.3 --- Variability in the Speech Signal --- p.69 / Chapter 5.2.4 --- Language Dependency of the Acoustic Models --- p.71 / Chapter 5.2.5 --- Pronunciation Dictionary --- p.80 / Chapter 5.2.6 --- The Training Process of Acoustic Models --- p.83 / Chapter 5.2.7 --- Decoding and Evaluation --- p.88 / Chapter 5.3 --- Language Modeling --- p.90 / Chapter 5.3.1 --- N-gram Language Model --- p.91 / Chapter 5.3.2 --- Difficulties in Data Collection --- p.91 / Chapter 5.3.3 --- Text Data for Training Language Model --- p.92 / Chapter 5.3.4 --- Training Tools --- p.95 / Chapter 5.3.5 --- Training Procedure --- p.95 / Chapter 5.3.6 --- Evaluation of the Language Models --- p.98 / Chapter 5.4 --- Language Boundary Detection --- p.99 / Chapter 5.4.1 --- Phone-based LBD --- p.100 / Chapter 5.4.2 --- Syllable-based LBD --- p.104 / Chapter 5.4.3 --- LBD Based on Syllable Lattice --- p.106 / Chapter 5.5 --- "Integration of the Acoustic Model Scores, Language Model Scores and Language Boundary Information" --- p.107 / Chapter 5.5.1 --- Integration of Acoustic Model Scores and Language Boundary Information. --- p.107 / Chapter 5.5.2 --- Integration of Modified Acoustic Model Scores and Language Model Scores --- p.109 / Chapter 5.5.3 --- Evaluation Criterion --- p.111 / Chapter 5.6 --- References --- p.112 / Chapter Chapter 6 --- Results and Analysis --- p.118 / Chapter 6.1 --- Speech Data for Development and Evaluation --- p.118 / Chapter 6.1.1 --- Development Data --- p.118 / Chapter 6.1.2 --- Testing Data --- p.118 / Chapter 6.2 --- Performance of Different Acoustic Units --- p.119 / Chapter 6.2.1 --- Analysis of Results --- p.120 / Chapter 6.3 --- Language Boundary Detection --- p.122 / Chapter 6.3.1 --- Phone-based Language Boundary Detection --- p.123 / Chapter 6.3.2 --- Syllable-based Language Boundary Detection (SYL LB) --- p.127 / Chapter 6.3.3 --- Language Boundary Detection Based on Syllable Lattice (BILINGUAL LBD) --- p.129 / Chapter 6.3.4 --- Observations --- p.129 / Chapter 6.4 --- Evaluation of the Language Models --- p.130 / Chapter 6.4.1 --- Character Perplexity --- p.130 / Chapter 6.4.2 --- Phonetic-to-text Conversion Rate --- p.131 / Chapter 6.4.3 --- Observations --- p.131 / Chapter 6.5 --- Character Error Rate --- p.132 / Chapter 6.5.1 --- Without Language Boundary Information --- p.133 / Chapter 6.5.2 --- With Language Boundary Detector SYL LBD --- p.134 / Chapter 6.5.3 --- With Language Boundary Detector BILINGUAL-LBD --- p.136 / Chapter 6.5.4 --- Observations --- p.138 / Chapter 6.6 --- References --- p.141 / Chapter Chapter 7 --- Conclusions and Suggestions for Future Work --- p.143 / Chapter 7.1 --- Conclusion --- p.143 / Chapter 7.1.1 --- Difficulties and Solutions --- p.144 / Chapter 7.2 --- Suggestions for Future Work --- p.149 / Chapter 7.2.1 --- Acoustic Modeling --- p.149 / Chapter 7.2.2 --- Pronunciation Modeling --- p.149 / Chapter 7.2.3 --- Language Modeling --- p.150 / Chapter 7.2.4 --- Speech Data --- p.150 / Chapter 7.2.5 --- Language Boundary Detection --- p.151 / Chapter 7.3 --- References --- p.151 / Appendix A Code-mixing Utterances in Training Set of CUMIX --- p.152 / Appendix B Code-mixing Utterances in Testing Set of CUMIX --- p.175 / Appendix C Usage of Speech Data in CUMIX --- p.202

The thesis studies the influence of the French Civil Code of 1804 on the civil codes of Quebec (the Civil Code of Lower Canada of 1866), Louisiana (the Civil Code of the State of Louisiana of 1825) and Francophone Switzerland (civil codes of cantons of Vaud of 1821, Valais of 1843-1855, Neuchâtel of 1853-1855, Fribourg of 1834-1850 as well as the French Civil Code as applied in two Swiss territories: the Canton of Geneva and Bernese Jura from 1804 until 1912). The study is focused not only on the reception of the positive law of one country by the positive law of another, but also on the reception of the legal tradition of one society by another. The study focuses on the modifications that the same law undergoes under different social and political conditions that exist within different nations. As it is impossible to examine all the provisions of the codes in question the research focuses only on the reception of the second book of the French Code “Of Property, and the Different Modifications of Ownership”. The study shows that, the reception of the French Civil Code took place in societies that were at different stages of their economic development, with varying political landscape, and with divergent cultural and religious values. In all jurisdictions the reception of the French Code was a creative, well thought-out enterprise that took into account local particularities and interests as well as historical sources of local law. Codifiers were not afraid of rejecting certain provisions of the French law if they found them unsuitable for their society. Nor were they afraid of keeping institutions that were abandoned in France itself if they found them pertinent to their countries.

In the early 1930’s the film business was booming and filled with sex, drugs, and scandal. All of that changed in 1934 with the enforcement of the Hollywood Production Code which effectively cleaned up the business into what most people today remember as classic Hollywood. By analyzing films from the Pre-Code era, and specifically Baby Face (1933), the roots of self-censorship in Hollywood can be traced to their current incarnation in the film business today.

As vulnerabilities become more common the security of applications are coming under increased scrutiny. In regards to Internet security, recent work discovers that many vulnerabilities are caused by TLS library misuse. This misuse is attributed to large and confusing APIs and developer misunderstanding of security generally. Due to these problems there is a desire for simplified TLS libraries and security handling. However, as of yet there is no analysis of how the existing APIs are used, beyond how incorrect usage motivates the need to replace them. We provide an analysis of contemporary usage of OpenSSL across 410 popular secure applications. These insights will inform the security community as it addresses TLS library redesign.

Les fonctions élémentaires sont utilisées dans de nombreux codes de calcul haute performance. Bien que les bibliothèques mathématiques (libm) auxquelles font appel ces codes proposent en général plusieurs variétés d'une même fonction, celles-ci sont figées lors de leur implémentation. Cette caractéristique représente un frein à la performance des programmes qui les utilisent car elles sont conçues pour être polyvalentes au détriment d'optimisations spécifiques. De plus, la duplication de modèles partagés rend la maintenance de ces libms plus difficile et sujette à l'introduction de bugs. Un défi actuel est de proposer des "méta-outils" visant la génération automatique de code performant pour l'évaluation des fonctions élémentaires. Ces outils doivent permettre la réutilisation d'algorithmes efficaces et génériques pour différentes variétés de fonctions ou architectures matérielles. Il devient alors possible de générer des libms optimisées pour des besoins très spécifiques avec du code générateur factorisé, qui facilite sa maintenance. Dans un premier temps, nous proposons un algorithme original permettant de générer des tables sans erreur pour les fonctions trigonométriques et hyperboliques. Puis nous étudions les performances de schémas d'évaluation polynomiale vectorisés, premier pas vers la génération de fonctions vectorisées efficaces. Enfin, nous proposons une méta-implémentation d'un logarithme vectorisé, factorisant la génération de code pour différents formats et architectures. Ces contributions sont compétitives comparées à d'autres solutions, justifiant le développement de tels méta-codes. / Elementary mathematical functions are pervasive in many high performance computing programs. However, although the mathematical libraries (libms), on which these programs rely, generally provide several flavors of the same function, these are fixed at implementation time. Hence this monolithic characteristic of libms is an obstacle for the performance of programs relying on them, because they are designed to be versatile at the expense of specific optimizations. Moreover, the duplication of shared patterns in the source code makes maintaining such code bases more error prone and difficult. A current challenge is to propose "meta-tools" targeting automated high performance code generation for the evaluation of elementary functions. These tools must allow reuse of generic and efficient algorithms for different flavours of functions or hardware architectures. Then, it becomes possible to generate optimized tailored libms with factorized generative code, which eases its maintenance. First, we propose an novel algorithm that allows to generate lookup tables that remove rounding errors for trigonometric and hyperbolic functions. The, we study the performance of vectorized polynomial evaluation schemes, a first step towards the generation of efficient vectorized elementary functions. Finally, we develop a meta-implementation of a vectorized logarithm, which factors code generation for different formats and architectures. Our contributions are shown competitive compared to free or commercial solutions, which is a strong incentive to push for developing this new paradigm.