This paper presents novel tree-based search algorithms that exploit the SIMD instructions found in virtually all modern processors. The algorithms are a natural extension of binary search: While binary search performs one comparison at each iteration, thereby cutting the search space in two halves, our algorithms perform k comparisons at a time and thus cut the search space into k pieces. On traditional processors, this so-called k-ary search procedure is not beneficial because the cost increase per iteration offsets the cost reduction due to the reduced number of iterations. On modern processors, however, multiple scalar operations can be executed simultaneously, which makes k-ary search attractive. In this paper, we provide two different search algorithms that differ in terms of efficiency and memory access patterns. Both algorithms are first described in a platform independent way and then evaluated on various state-of-the-art processors. Our experiments suggest that k-ary search provides significant performance improvements (factor two and more) on most platforms.

International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada / Shaped Offset Quadrature Phase Shift Keying (SOQPSK) has the advantages of low sidelobes and high detection probability; however, its main lobe has a fixed width set by the number of constellation points. By slightly modifying the modulation scheme, the four constellation points of quadrature shift keying can be changed to M constellation points where M is a power of 2. After this change, the power spectral density (PSD) retains low sidelobes, and the desirable property of being able to detect the signal by integrating over two symbol periods is retained.

This thesis has two distinguish parts. The first part concerns the study of n-ary algebras. A n-ary algebra is a vector space with a multiplication on n arguments. Classically the multiplications are binary, but the use of ternary multiplication in theoretical physic like for Nambu brackets led mathematicians to investigate these type of algebras. Two classes of n-ary algebras are fundamental: the associative n-ary algebras and the Lie n-ary algebras. We are interested by both classes. Concerning the associative n-ary algebras we are mostly interested in 3-ary partially associative 3-ary algebras, that is, algebras whose multiplication satisfies ((xyz)tu)+(x(yzt)u)+(xy(ztu))=0. This type is interesting because the previous woks on this subject was not distinguish the even and odd cases. We show in this thesis that the case n=3 can not be treated as the even cases. We investigate in detail the free partially associative 3-ary algebra on k generators. This algebra is graded and we compute the dimensions of the 7 first components. In the general case, we give a spanning set such as the sub family of non zero vector is a basis. The main consequences are the free partially associative 3-ary algebra is solvable. In the free commutative partially associative 3-ary algebra any product on 9 elements is trivial. The operad for partially associative 3-ary algebra do not satisfy the Koszul property. Then we study n-ary products on the tensors. The simplest example is given by a internal product of non square matrices. We can define a 3-ary product by taking A . ^tB . C. We show that we have to generalize a bit the definition of partial associativity for n-ary algebras. We then introduce the products -partially associative where  is a permutation of the symmetric group of degree n. Concerning the n-ary algebras, two classes have been defined: Filipov algebras (also called recently Lie-Nambu algebras) and some more general class, the n-Lie algebras. Filipov algebras are very important in the study of the mechanic of Nambu-Poisson, and is a particular case of the other. So to define an approach of Maurer-Cartan type, that is, define a scalar cohomology, we consider in this work Fillipov as n-Lie algebras and develop such a calculus in the n-Lie algebras frame work. We also give some classifications of n-ary nilpotent algebras. The last chapter of this part concerns my work in Master on the Poisson algebras on polynomials. We present link with the Lie algebras is clear. Thus we extend our study to Poisson algebras which associated Lie algebra is rigid and we apply these results to the enveloping algebras of rigid Lie algebras. The second part concerns intervals arithmetic. The interval arithmetic is used in a lot of problems concerning robotic, localization of parameters, and sensibility of inputs. The classical operations of intervals are based of the rule : the result of an operation of interval is the minimal interval containing all the result of this operation on the real elements of the concerned intervals. But these operations imply many problems because the product is not distributive with respect the addition. In particular it is very difficult to translate in the set of intervals an algebraic functions of a real variable. We propose here an original model based on an embedding of the set of intervals on an associative algebra. Working in this algebra, it is easy to see that the problem of non distributivity disappears, and the problem of transferring real function in the set of intervals becomes natural. As application, we study matrices of intervals and we solve the problem of reduction of intervals matrices (diagonalization, eigenvalues, and eigenvectors).

For channel estimation without data-induced interference in data-dependent superimposed training (DDST) scheme, the data sequence is shifted by subtracting a data-dependent sequence before added to training sequence at transmitter. The distorted term causes the data identification problem (DIP) at the receiver. In this thesis, we propose two precoding schemes based on previous work. To maintain low peak-to-average power ratio (PAPR), the precoding matrix is restricted to a diagonal matrix. The first scheme is proposed to enlarge the minimum distance between the closest codewords, termed as efficient diagonal scheme. Conditions to make sure the precoding matrix is efficient for M-ary phase shift keying (MPSK) and M-ary quadrature amplitude modulation (MQAM) modulation are listed in this paper. The second scheme pursues a lowest complexity at receiver which means the amount of searching set is reduced. It is a trade-off between the better bit error rate (BER) performance and a lower complexity at receiver. The simulation results show that PAPR have been improved and the DIP is solved in both schemes.

A lot has changed since that day on December 17, 1903 when the Wright brothers made the first powered manned flight. Even though the concepts behind flying are unaltered, appearance of stat-of-the-art modern aircrafts has undergone a massive evolution. This is mainly owed to our deeper understanding of how to harness and optimize the interaction between fluid flows and aircraft bodies. Flow passing over wings and different junctions on an aircraft faces numerous local features, for instance, acceleration or deceleration, laminar or turbulent state, and interacting boundary layers. In our study we aim to characterize some of these flow features and their physical roles. Primarily, stability characteristics of flow over a wing subject to a negative pressure gradient are studied. This is a common condition for flows over swept wings. Part of the current numerical study conforms to existing experimental studies where a passive control mechanism has been tested to delay laminarturbulent transition. The same flow type has also been considered to study the receptivity of three-dimensional boundary layers to freestream turbulence. The work entails investigation of effects of low-level freestream turbulence on crossflow instability, as well as interaction with micron-sized surface roughness elements. Another common three-dimensional flow feature arises as a resultof stream-lines passing through a junction, the so-calledcorner-flow. For instance, thisflow can be formed in the junction between the wing and fuselage on aplane.A series of direct numerical simulations using linear Navier-Stokes equationshave been performed to determine the optimal initial perturbation. Optimalrefers to perturbations which can gain the maximum energy from the flow overa period of time. In other words this method seeks to determine theworst-casescenario in terms of perturbation growth. Here, power-iterationtechnique hasbeen applied to the Navier-Stokes equations and their adjoint to determine theoptimal initial perturbation. Recent advances in super-computers have enabled advance computational methods to increasingly contribute to design of aircrafts, in particular for turbulent flows with regions of separation. In this work we investigate theturbulentflow on an infinite wing at a moderate chord Reynolds number of Re= 400,000 using a well resolved direct numerical simulation. A conventional NACA4412 has been chosen for this work. The turbulent flow is characterizedusing statistical analysis and following time history data in regions with interesting flow features. In the later part of this work, direct numerical simulation has been chosen as a tool to mainly investigate the effect of freestream turbulence on the transition mechanism of flow from laminar to turbulent around a turbine blade. / <p>QC 20151125</p>

Orientador : Carmen Zink Bolognini / Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Estudos da Linguagem / Made available in DSpace on 2018-08-19T13:24:36Z (GMT). No. of bitstreams: 1 Rosa_Marli_D.pdf: 1281168 bytes, checksum: 3406072aea332c5f85cec08d43d81822 (MD5) Previous issue date: 2011 / Resumo: A presente tese de doutorado consiste de um estudo qualitativo de natureza interdisciplinar, ancorado na teoria da Análise do Discurso Materialista e com contribuições decisivas de trabalhos das Artes e Humanidades (em especial da História, Antropologia, Sociologia da Cultura e Música). O objetivo central do trabalho foi investigar as condições de produção e as representações de Brasil presentes em três letras de canções que abordam essa temática: "Aquarela do Brasil" (1939), de Ari Barroso; "País Tropical" (1968), de Jorge Ben; e "Que país é este" (1978/1987), de Renato Russo. Tais obras foram compostas e veiculadas em momentos políticos e culturais de grande importância para a compreensão do Brasil atual e de nossa história ao longo do Século XX, em momentos cujos temas mais recorrentes giravam em torno da (re)construção ou (in)viabilidade de projetos nacionalistas e de modernização para o país. O trabalho foi organizado da seguinte forma: na introdução temos o delineamento e o percurso da pesquisa, com o afunilamento do tema, objetivos, justificativas, corpus de pesquisa e aparato teórico-metodológico; no primeiro capítulo, temos uma exposição sobre a relação entre música e política, com destaque para o papel da música na construção do nacionalismo, além das representações de Brasil em Casa- Grande & Senzala, de Gilberto Freyre, e Raízes do Brasil, de Sérgio Buarque de Holanda; os capítulos 2, 3 e 4 referem-se ao trabalho de análise com cada uma das três canções do corpus, respectivamente; e, fechando o trabalho, temos as considerações finais, a bibliografia consultada e um anexo com as letras das canções. Como contribuição desse estudo está a importância de compreendermos o papel do funcionamento discursivo de canções de música popular na constituição identitária do povo brasileiro. Essa importância se dá na medida em que a MPB desempenhou, ao longo do Século XX, um papel crucial na constituição do que hoje se entende por "Nação Brasileira" / Abstract: This doctoral dissertation consists of a qualitative study with an interdisciplinary approach, based on the theory of the materialist discourse analysis with key contributions from works developed by authors from Arts and Humanities (mainly in the fields of History, Anthropology, Sociology of Culture and Music). The main objective of this study was to investigate the conditions of production and the representations of Brazil in three songs that address this theme: "Brazil" ("Aquarela do Brasil") by Ary Barroso, "País Tropical" by Jorge Ben, and "Que País É Este" by Renato Russo. These songs were composed and launched in political and cultural moments of great importance for the understanding of contemporaneous Brazil and its history throughout the twentieth century, when the most frequent political issues were related to the (re)construction and (in)viability of nationalist and modernization projects for the country. The dissertation was organized as follows: in the introduction it is presented the first steps taken and choices made in order to have a theme focus and to develop the study, besides the objectives, justification, corpus and theoretical background. In the first chapter, it is presented the relationship between music and politics, with an emphasis on the role of music in the construction of nationalism, besides the representations of Brazil in The masters and the slaves, by Gilberto Freyre, and Raízes do Brasil, by Sérgio Buarque de Holanda. Chapters 2, 3 and 4 refer to the work of analysis with each of the three songs, respectively. Finally, it is presented the final considerations, the bibliography and an appendix with the lyrics. This study aims to contribute to the understanding of the discursive meaning construction of some very known Brazilian songs and its role in the development of an identity for the Brazilian people. This importance relies on the very presence and importance that Brazilian songs had over the twentieth century, with an eminent role in the formation of what today is portrayed as the "Brazilian nation" / Doutorado / Lingua Materna / Doutor em Linguística Aplicada

Les ontologies sont devenues incontournables pour définir des vocabulaires standardisés ainsi qu'une représentation partagée d'un domaine d'intérêt. La notion de Ressource Termino-Ontologique (RTO) permet d'associer une partie terminologique et/ou linguistique aux ontologies afin d'établir une distinction claire entre la manifestation linguistique (le terme) et la notion qu'elle dénote (le concept). Les RTOs sont actuellement au cœur de nombreuses méthodes, outils et applications de l'Ingénierie des Connaissances (IC), discipline de l'Intelligence Artificielle permettant en particulier de développer des méthodes et des outils de capitalisation de connaissances.L'objectif de cette thèse, qui s'inscrit dans les problématiques de l'IC, est de capitaliser des données expérimentales issues de documents textuels (articles scientifiques, rapports de projet, etc.) afin de pouvoir les réutiliser dans des outils d'aide à la décision. Nous avons d'abord défini la notion de relation n-aire permettant de relier plusieurs arguments et l'avons modélisée dans une nouvelle RTO, baptisée naRyQ. Cette notion de relation n-aire nous a permis de modéliser des mesures expérimentales (e.g. diffusivité de l'oxygène dans un aliment, perméabilité à l'oxygène d'un emballage, broyage d'une biomasse, etc.) réalisées sur différents objets d'études (produit alimentaire, emballage, procédé de transformation, etc.). Afin d'implémenter la plateforme de capitalisation, nommée @Web, nous avons modélisé la RTO naRyQ en OWL/SKOS et défini l'ensemble des contraintes de cohérence qu'elle doit respecter. Enfin, une RTO étant amenée à évoluer pour répondre aux besoins de changement, nous avons proposé une méthode de gestion de l'évolution de cette RTO qui permet de maintenir sa cohérence de manière préventive. Cette méthode est implémentée dans le plug-in Protégé, nommé DynarOnto. / This PhD thesis in Artificial Intelligence deals with knowledge engineering. Ontology, which can be defined as a controlled vocabulary allowing a community to share a common representation of a given area, is one of the key elements of knowledge engineering. Our framework is the capitalization of experimental data extracted from scientific documents (scientific articles, project reports, etc.), in order to feed decision support systems. The capitalization is guided by an ontological and terminological resource (OTR). An OTR associates an ontology with a terminological and/or a linguistic part in order to establish a clear distinction between the term and the notion it denotes (the concept). Experimental data can be represented by n-ary relations linking arguments of the experimentation, i.e. experimental measurements (e.g. oxygen diffusivity in food, oxygen permeability in packaging, biomass grinding, etc.), with studied objects (food, packaging, transformation process, etc.). We have defined the n-ary relation concept and a nary Relation between Quantitative experimental data OTR, called naRyQ. Our modeling relies on OWL2-DL and SKOS, W3C languages. Moreover, we have studied the evolution of such an OTR, extending the existing works taking into account i) the specificity of our OTR which deals with interdependent concepts and ii) its language representation. For that, we have proposed a preventive ontology evolution methodology defining elementary and composed changes based on a set of consistency constraints defined for our naRyQ OTR. Our contributions are implemented in two systems : our naRyQ OTR is nowadays the core of the existing capitalization system @Web and our evolution method is implemented in a Protégé plug-in called DynarOnto.

La quantité d'information disponible dans le domaine biomédical ne cesse d'augmenter. Pour que cette information soit facilement utilisable par les experts d'un domaine, il est nécessaire de l'extraire et de la structurer. Pour avoir des données structurées, il convient de détecter les relations existantes entre les entités dans les textes. Nos recherches se sont focalisées sur la question de l'extraction de relations complexes représentant des résultats expérimentaux, et sur la détection et la catégorisation de relations binaires entre des entités biomédicales. Nous nous sommes intéressée aux résultats expérimentaux présentés dans les articles scientifiques. Nous appelons résultat expérimental, un résultat quantitatif obtenu suite à une expérience et mis en relation avec les informations permettant de décrire cette expérience. Ces résultats sont importants pour les experts en biologie, par exemple pour faire de la modélisation. Dans le domaine de la physiologie rénale, une base de données a été créée pour centraliser ces résultats d'expérimentation, mais l'alimentation de la base est manuelle et de ce fait longue. Nous proposons une solution pour extraire automatiquement des articles scientifiques les connaissances pertinentes pour la base de données, c'est-à-dire des résultats expérimentaux que nous représentons par une relation n-aire. La méthode procède en deux étapes : extraction automatique des documents et proposition de celles-ci pour validation ou modification par l'expert via une interface. Nous avons également proposé une méthode à base d'apprentissage automatique pour l'extraction et la classification de relations binaires en domaine de spécialité. Nous nous sommes intéressée aux caractéristiques et variétés d'expressions des relations, et à la prise en compte de ces caractéristiques dans un système à base d'apprentissage. Nous avons étudié la prise en compte de la structure syntaxique de la phrase et la simplification de phrases dirigée pour la tâche d'extraction de relations. Nous avons en particulier développé une méthode de simplification à base d'apprentissage automatique, qui utilise en cascade plusieurs classifieurs. / The amount of available scientific literature is constantly growing. If the experts of a domain want to easily access this information, it must be extracted and structured. To obtain structured data, both entities and relations of the texts must be detected. Our research is about the problem of complex relation extraction which represent experimental results, and detection and classification of binary relations between biomedical entities. We are interested in experimental results presented in scientific papers. An experimental result is a quantitative result obtained by an experimentation and linked with information that describes this experimentation. These results are important for biology experts, for example for doing modelization. In the domain of renal physiology, a database was created to centralize these experimental results, but the base is manually populated, therefore the population takes a long time. We propose a solution to automatically extract relevant knowledge for the database from the scientific papers, that is experimental results which are represented by a n-ary relation. The method proceeds in two steps: automatic extraction from documents and proposal of information extracted for approval or modification by the experts via an interface. We also proposed a method based on machine learning for extraction and classification of binary relations in specialized domains. We focused on the variations of the expression of relations, and how to represent them in a machine learning system. We studied the way to take into account syntactic structure of the sentence and the sentence simplification guided by the task of relation extraction. In particular, we developed a simplification method based on machine learning, which uses a series of classifiers.

Ce mémoire comporte deux parties distinctes. La première partie concerne une étude d'algèbres n-aires. Une algèbre n-aire est un espace vectoriel sur lequel est définie une multiplication sur n arguments. Classiquement les multiplications sont binaires, mais depuis l'utilisation en physique théorique de multiplications ternaires, comme les produits de Nambu, de nombreux travaux mathématiques se sont focalisés sur ce type d'algèbres. Deux classes d'algèbres n-aires sont essentielles: les algèbres n-aires associatives et les algèbres n-aires de Lie. Nous nous intéressons aux deux classes. Concernant les algèbres n-aires associatives, on s'intéresse surtout aux algèbres 3-aires partiellement associatives, c'est-à-dire dont la multiplication vérifie l'identité ((xyz)tu)+(x(yzt)u)+(xy(ztu))=0 Ce cas est intéressant car les travaux connus concernant ce type d'algèbres ne distinguent pas les cas n pair et n-impair. On montre dans cette thèse que le cas n=3 ne peut pas être traité comme si n était pair. On étudie en détail l'algèbre libre 3-aire partiellement associative sur un espace vectoriel de dimension finie. Cette algèbre est graduée et on calcule précisément les dimensions des 7 premières composantes. On donne dans le cas général un système de générateurs ayant la propriété qu'une base est donnée par la sous famille des éléments non nuls. Les principales conséquences sont L'algèbre libre 3-aire partiellement associative est résoluble. L'algèbre libre commutative 3-aire partiellement associative est telle que tout produit concernant 9 éléments est nul. L'opérade quadratique correspondant aux algèbres 3-aires partiellement associatives ne vérifient pas la propriété de Koszul. On s'intéresse ensuite à l'étude des produits n-aires sur les tenseurs. L'exemple le plus simple est celui d'un produit interne sur des matrices non carrées. Nous pouvons définir le produit 3aire donné par A . ^tB . C. On montre qu'il est nécessaire de généraliser un peu la définition de partielle associativité. Nous introduisons donc les produits -partiellement associatifs où  est une permutation de degré p. Concernant les algèbres de Lie n-aires, deux classes d'algèbres ont été définies: les algèbres de Fillipov (aussi appelées depuis peu les algèbres de Lie-Nambu) et les algèbres n-Lie. Cette dernière notion est très générale. Cette dernière notion, très important dans l'étude de la mécanique de Nambu-Poisson, est un cas particulier de la première. Mais pour définir une approche du type Maurer-Cartan, c'est-à-dire définir une cohomologie scalaire, nous considérons dans ce travail les algèbres de Fillipov comme des algèbres n-Lie et développons un tel calcul dans le cadre des algèbres n-Lie. On s'intéresse également à la classification des algèbres n-aires nilpotentes. Le dernier chapitre de cette partie est un peu à part et reflète un travail poursuivant mon mémoire de Master. Il concerne les algèbres de Poisson sur l'algèbre des polynômes. On commence à présenter le crochet de Poisson sous forme duale en utilisant des équations de Pfaff. On utilise cette approche pour classer les structures de Poisson non homogènes sur l’algèbre des polynômes à trois variables . Le lien avec les algèbres de Lie est clair. Du coup on étend notre étude aux algèbres de Poisson dont l'algèbre de Lie sous jacent est rigide et on applique les résultats aux algèbres enveloppantes des algèbres de Lie rigides. La partie 2 concerne l'arithmétique des intervalles. Cette étude a été faite suite à une rencontre avec une société d'ingénierie travaillant sur des problèmes de contrôle de paramètres, de problème inverse (dans quels domaines doivent évoluer les paramètres d'un robot pour que le robot ait un comportement défini). [...] / This thesis has two distinguish parts. The first part concerns the study of n-ary algebras. A n-ary algebra is a vector space with a multiplication on n arguments. Classically the multiplications are binary, but the use of ternary multiplication in theoretical physic like for Nambu brackets led mathematicians to investigate these type of algebras. Two classes of n-ary algebras are fundamental: the associative n-ary algebras and the Lie n-ary algebras. We are interested by both classes. Concerning the associative n-ary algebras we are mostly interested in 3-ary partially associative 3-ary algebras, that is, algebras whose multiplication satisfies ((xyz)tu)+(x(yzt)u)+(xy(ztu))=0. This type is interesting because the previous woks on this subject was not distinguish the even and odd cases. We show in this thesis that the case n=3 can not be treated as the even cases. We investigate in detail the free partially associative 3-ary algebra on k generators. This algebra is graded and we compute the dimensions of the 7 first components. In the general case, we give a spanning set such as the sub family of non zero vector is a basis. The main consequences are the free partially associative 3-ary algebra is solvable. In the free commutative partially associative 3-ary algebra any product on 9 elements is trivial. The operad for partially associative 3-ary algebra do not satisfy the Koszul property. Then we study n-ary products on the tensors. The simplest example is given by a internal product of non square matrices. We can define a 3-ary product by taking A . ^tB . C. We show that we have to generalize a bit the definition of partial associativity for n-ary algebras. We then introduce the products -partially associative where  is a permutation of the symmetric group of degree n. Concerning the n-ary algebras, two classes have been defined: Filipov algebras (also called recently Lie-Nambu algebras) and some more general class, the n-Lie algebras. Filipov algebras are very important in the study of the mechanic of Nambu-Poisson, and is a particular case of the other. So to define an approach of Maurer-Cartan type, that is, define a scalar cohomology, we consider in this work Fillipov as n-Lie algebras and develop such a calculus in the n-Lie algebras frame work. We also give some classifications of n-ary nilpotent algebras. The last chapter of this part concerns my work in Master on the Poisson algebras on polynomials. We present link with the Lie algebras is clear. Thus we extend our study to Poisson algebras which associated Lie algebra is rigid and we apply these results to the enveloping algebras of rigid Lie algebras. The second part concerns intervals arithmetic. The interval arithmetic is used in a lot of problems concerning robotic, localization of parameters, and sensibility of inputs. The classical operations of intervals are based of the rule : the result of an operation of interval is the minimal interval containing all the result of this operation on the real elements of the concerned intervals. But these operations imply many problems because the product is not distributive with respect the addition. In particular it is very difficult to translate in the set of intervals an algebraic functions of a real variable. We propose here an original model based on an embedding of the set of intervals on an associative algebra. Working in this algebra, it is easy to see that the problem of non distributivity disappears, and the problem of transferring real function in the set of intervals becomes natural. As application, we study matrices of intervals and we solve the problem of reduction of intervals matrices (diagonalization, eigenvalues, and eigenvectors).

In this thesis, two key issues regarding M-ary orthogonal signaling systems, namely channel estimation and symbol timing recovery are investigated. Kasami codes, which are also called quasi orthogonal codes, are used for transmission of the information in place of orthogonal waveforms. In order to achieve symbol synchronization, a timing recovery scheme based on the Maximum Likelihood (ML) estimation of timing offset is proposed and the effects of proposed structure over the receiver performance are examined by using computer simulations. Moreover, the receiver performance of M-ary orthogonal signals transmitted over multipath fading channel is investigated. Least Square (LS) approach, based on the transmission of known training sequence, is used to estimate the channel impulse response. In addition to this, frame synchronization is employed at the receiver to extract the timing information by determining the start time of the received symbols. Computer simulations related to the proposed receiver structure are carried out in order to observe how the system performance is affected under multipath fading channel. Parameter selection guides regarding a good performance are also provided.