To see the other types of publications on this topic, follow the link: Jobin.
Dissertations / Theses on the topic 'Jobin'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Jobin.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Béland, Mario. "Louis Jobin (1845-1928) et le marché de la sculpture au Québec." Doctoral thesis, Université Laval, 1991. http://hdl.handle.net/20.500.11794/33470.
Full textAbstract:
Mario Béland : LOUIS JOBIN (1845-1928) ET LE MARCHÉ DE LA SCULPTURE AU QUÉBEC Le sculpteur Louis Jobin est une figure marquante de 1'histoire de l'art ancien du Québec. Après avoir été 11 apprenti de François-Xavier Berlinguet à Québec et de William Boulton à New York, Jobin ouvrit sa première boutique à Montréal en 1870, boutique qu'il quitta cinq ans plus tard pour se fixer dans la Vieille Capitale. À la suite de 1'incendie de son atelier en 1896, le sculpteur alla finalement s'installer à Sainte-Anne-de-Beaupré où il travailla jusqu'à sa retraite en 1925. Cette longue carrière lui a permis de réaliser un millier d1 oeuvres qui sont disséminées un peu partout sur le continent nord-américain. Sa production statuaire s'avère non seulement la plus considérable de 1'époque mais constitue également un jalon fondamental dans 1'évolution de la sculpture québécoise. En effet, en raison des impératifs du marché, des contraintes de la concurrence et des innovations liées à 11 industrialisation, Jobin a dû s'adapter tout au long de sa carrière, passant progressivement d'une production diversifiée à un champ d'action très spécialisé, la statuaire religieuse de grand format destinée à 11 extérieur des édifices. S'appuyant sur une méthodologie propre à 1 'histoire de l'art ancien du Québec, notre problématique visait à identifier et à analyser les incidences du marché de la sculpture au Québec sur 1 'itinéraire et la production de Louis Jobin. Les grandes étapes et les tournants de la carrière du sculpteur furent effectivement tributaires des impératifs du marché ainsi que des contraintes de la concurrence et de 1 'industrialisation. Par le biais d'une démarche synchronique, nous avons cherché à dégager et à comparer les traits spécifiques de la production de 11 artiste durant les principales phases de sa carrière, et cela en relation avec les mécanismes complexes du marché de la sculpture. Surbordonnées aux règles de l'offre et de la demande, les oeuvres du sculpteur devaient répondre aux besoins et aux goûts particuliers de sa clientèle en matière de sujets, de modèles, d'usages, de fonctions et de destinations. Ces diverses exigences conditionnèrent de multiples façons 1'aspect matériel et visuel des oeuvres sculptées, tant au plan iconographique que décoratif, déterminant certains choix quant au format, au revêtement et à la finition. Ainsi avons-nous tenté de démontrer que 1'oeuvre de Jobin a progressivement évolué d'une production très diversifiée vers une production très spécialisée. Alors que, durant sa formation et ses débuts à Montréal, le sculpteur avait réalisé des pièces de mobilier, des sculptures ornementales, des figures de proue, des enseignes, des statues et des reliefs à caractère religieux, il en vint, à la fin de son séjour à Sainte-Anne, à façonner essentiellement des statues religieuses destinées à 11 extérieur des édifices. Le plus souvent de grandes dimensions et recouvertes de métal, ces oeuvres comprennent, parmi les plus représentatives, nombre de monuments au Sacré-Coeur et des groupes du Calvaire. Tout en tenant compte de 11 apport de divers auteurs dont Hayward, Potvin et Barbeau, la présente thèse devrait contribuer à renouveler d'une part la perception de la carrière et de la production de 11 artiste et à éclairer, d'autre part, le contexte socio-économique dans lequel évoluaient les sculpteurs québécois à la fin du XIXe et au début du XXe siècle.Montréal Trigonix inc. 2018
2
Almutairi, Reham. "Performance Evaluations of Two Join Methods: Join Core and Join Indices." OpenSIUC, 2017. https://opensiuc.lib.siu.edu/theses/2226.
Full textAbstract:
Traditional join algorithms can be categorized into three groups: hash-based join, sort-merge join, and nested-loop join. Many variations of these algorithms have been proposed during the last few decades to improve the performance. In this paper, we have compared between two of the most efficient join methods: Join indices and Join Core. Join indices generate index tables that contain tuples identifiers for matched tuples. It scans each input relation only once, the join index once, and scans temporary files twice. On the other hand, Join Core is a data structure created to facilitate complex join queries promptly. With the Join Core, join queries can be handled quickly without performing costly join operations. Also, no intermediate results need to be retrieved during the runtime. Consequently, join queries can be answered rapidly. We implement the multi-way Jive-join version of the Join indices, using Java and TPC-H benchmark datasets. Our experimental result shows that even multi-way Jive-join method has better memory utilization, it takes a long time to process queries since it requires generating output files and temporary files before generating the final results. However, our results show that processing queries with Multi-way Jive-join is faster than using MySQL.
3
Hamdi, Mohammed. "Answering Join Queries Instantly." OpenSIUC, 2018. https://opensiuc.lib.siu.edu/dissertations/1510.
Full textAbstract:
This research presents an innovative way to process queries without having to perform expensive join and set operations. We propose to store the equi-join relationships of tuples on mass storage devices, such as disks, to facilitate query processing. The equi-join relationships are captured, grouped, and stored as various tables on disks, which are collectively called the Join Core. Queries involving arbitrary legitimate sequences of equi-joins, semi-joins, outer-joins, anti-joins, unions, differences, and intersections can all be answered quickly by merely merging these tables. Without having to performing joins, memory consumptions are dramatically reduced. The Join Core can also be updated dynamically. Preliminary experimental results showed that all test queries began to generate results instantly, and many completed instantly too. The proposed methodology can be very useful for queries with complex joins of large relations, and can be even more advantageous to distributed query processing, as there are fewer or even no relations or intermediate results needed to be retrieved, generated or transferred over the networks.
4
Araujo, Guillén Marcelo, Mendoza Leyla Gladys Loza, Barzola Gianella Yeseli Rivero, and Alama Ernesto André Torres. "Sexshop “Join&Enjoy”." Bachelor's thesis, Universidad Peruana de Ciencias Aplicadas (UPC), 2020. http://hdl.handle.net/10757/652907.
Full textAbstract:
Al encontrarnos en entorno cuyos gustos y preferencias de las personas tienen a ser diversos, existe una amplia oferta de productos en el mercado que satisfacen necesidades específicas de los consumidores. Ante ello, los accesorios sexuales conforman productos con crecimiento en su demanda, ya que cada vez más personas se encuentran dispuestas a interactuar con artículos sexuales, los cuales permitan evitar la monotonía y que, a su vez, otorguen un mayor nivel de satisfacción.
El objetivo de la presente investigación es atender la demanda de artículos sexuales en el mercado de Lima Metropolitana, a partir de una plataforma virtual que permita que los consumidores puedan acceder a diferentes productos de su agrado, de una forma interactiva y confiable, en la cual se puedan sentir libres de elegir y experimentar diversos productos existentes en el mercado. La propuesta de negocio de la presente investigación no solo se basa en la oferta de artículos sexuales para un segmento determinado, sino que busca como principal objetivo el poder crear una plataforma que, además de ofrecer productos de interés, logre también interactuar con el cliente, de modo que este pueda encontrar en nuestro negocio un espacio en el cual mantenerse informado acerca del uso de los productos, tips de ayuda y todo tipo de información que permita romper tabúes acerca del uso de ciertos artículos.
A continuación, se presentan los detalles acerca de nuestro modelo de negocio aplicable en Lima Metropolitana.Being in a society whose tastes and preferences of people have to be diverse, there is a wide range of products on the market that meet the specific needs of consumers. Given this, sexual accessories are products with growth in demand, as more and more people are willing to interact with sexual items, which avoid monotony and, in turn, provide a higher level of satisfaction. The aim of this research is to meet the demand for sexual items in the Metropolitan Lima market, based on a virtual platform that allows consumers to access different products of their liking, in an interactive and reliable way, in which They can feel free to choose and experience various products existing in the market. The business proposal of this research is not only based on the offer of sexual items for a specific segment, but seeks as the main objective to create a platform that, in addition to offering products of interest, also interact with the customer, so that he can find in our business a space in which to keep informed about the use of products, help tips and all kinds of information that allows breaking taboos about the use of certain items. Below, we present the details about our applicable business model in Metropolitan Lima.
Trabajo de investigación
5
Henderson, Michael. "Multi-way hash join effectiveness." Thesis, University of British Columbia, 2013. http://hdl.handle.net/2429/44680.
Full textAbstract:
In database systems most join algorithms are binary and will only operate on two inputs at a time. In order to join more than two input relations a database system will use the results of a binary join of two of the inputs in a second join. This way any number of input relations can be combined into a single output. There is additional cost to having multiple joins as the results of each intermediate join must be cached and processed.
Recent research into joins on more than two inputs, called multi-way joins, has shown that the intermediate partitioning steps of a traditional hash join based query plan can be avoided. This decreases the amount of disk based input and output (I/Os) that the join query will require which is desirable since disk I/O is one of the slowest parts of a join.
This thesis studies the advantages and disadvantages of implementing and using different multi-way join algorithms and their relative performance compared to traditional hash joins. Specifically, this work compares dynamic hash join with three multi-way join algorithms, Hash Teams, Generalized Hash Teams and SHARP. The results of the experiments show that in some limited cases these multi-way hash joins can provide a significant advantage over the traditional hash join but in many cases they can perform worse. Since the cases where these multi-way joins have better performance is so limited and their algorithms are much more complex, it does not make sense to implement Hash Teams or Generalized Hash Teams in production database management systems. SHARP provides enough of a performance advantage that it makes sense to implement it in a database system used for data warehousing.
6
Liu, Kaiyang. "Efficient structural join processing algorithms /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?COMP%202005%20LIU.
Full text
7
Evangelista, Neusa Liberato. "Join operators for asymmetric media." Universidade de Fortaleza, 2016. http://dspace.unifor.br/handle/tede/99890.
Full textAbstract:
Made available in DSpace on 2019-03-30T00:02:22Z (GMT). No. of bitstreams: 0
Previous issue date: 2016-12-02Nowadays the use of Solid State Drive (SSD) is a reality for storing large databases. SSDs are capable to provide random access times up to three orders of magnitude faster than magnetic Hard Disk Drives (HDDs) and Input/Output operations Per Second (IOPS) rates over 100 times faster than 15K RPM HDDs. Nonetheless, SSD, as other Storage Class Memory (SCM) devices, presents time asymmetry for executing read/write operations, which poses challenges on the database technology. This is because existing Database Management Systems (DBMS) have been designed by assuming that databases are stored on devices in which read/write operations are executed in the same amount of time. Thus, this research claims that to take full pro¿t from SCM properties, components of DBMS should be aware of read/write asymmetry in SCM. It is well known that the join operation is the query operator which requires the highest amount of accesses (read/write operations) to the secondary memory. This dissertation presents new join algorithms, called Bt-Join and Dict-Join. The key goal of these algorithms is to reduce the amount of write operations during the execution of any join operation R ¿¿ S. By making less writes, we intend to extend the lifetime of SCM media and by requiring less main memory space, improve the response time of novel join algorithms. Bt-Join and Dict-Join were empirically evaluated. The results show that the proposed join operators can be at least 30% faster than FlashJoin for the most of queries which compose the experiments. FlashJoin is a well-known join operator proposed to be deployed in SSDs. Keywords: Databases, Storage Class Memory, Query Operator, Join Algorithm, Material ization Strategies, Join index.
Atualmente o uso de dispositivos de estado sólido (solid state drives - SSDs) é uma realidade para armazenamento de grandes bases de dados. SSDs são capazes de prover velocidades de IOPS três ordens de magnitude maiores que as velocidades dos discos rígidos (hard disk drives ¿ HDD). Apesar disso, SSDs apresentam assimetria no tempo de execução das operações de leitura/escrita, o que gera desa¿os para a tecnologia dos bancos de dados. Isto porque os sistemas gerenciadores de bancos de dados (SGBD) foram projetados sob a premissa de que os dados são armazenados em dispositivos nos quais as operações de leitura/escrita são executadas na mesma velocidade (tempos de execução idênticos). Então, esta pesquisa defende que, para tirar total proveito das propriedades do SSD, componentes do SGBD devem ser cientes da assimetria entre leitura/escrita em SSDs. É sabido que a operação de junção é o operador de consulta que requer a maior quantidade de acessos (operações de leitura/escrita) à memória secundária. Esta dissertação apresenta novos algoritmos de junção, chamados Bt-Join e Dict-Join. O objetivo principal destes algoritmos é reduzir a quantidade de operações de escrita durante a execução de uma operação de junção. Nosso intento, ao realizar menos escritas, é estender o tempo de vida da mídia SCM e, ao requerer menos espaço de memória, melhorar o tempo de resposta dos novos algoríttmos de junção. Bt-Join e Dict-Join foram avaliados empiricamente. Os resultados mostram que os operadores de junção propostos podem ser no mínimo 30% mais rápidos que o algoritmo FlashJoin para a grande maioria das consultas que compuseram os experimentos. FlashJoin é um operador de junção proposto para ser executado em SSDs. Palavras-chave: Bancos de Dados, Mídias Assimétricas, Operador de Consulta, Algoritmos de Junção, Estratégias de Materizalicação, Join index.
8
Cruz, Gleise Andrade. "De olho na eternidade: a construção do arquivo privado de Antonio Carlos Jobim." reponame:Repositório Institucional do FGV, 2008. http://hdl.handle.net/10438/2153.
Full textAbstract:
Submitted by Suemi Higuchi (suemi.higuchi@fgv.br) on 2008-11-11T14:05:04Z
No. of bitstreams: 1
CPDOC2008GleiseAndradeCruz.pdf: 1829234 bytes, checksum: 794d190a88e7ca5fa2996d6895cebf82 (MD5)Made available in DSpace on 2008-11-11T14:05:05Z (GMT). No. of bitstreams: 1 CPDOC2008GleiseAndradeCruz.pdf: 1829234 bytes, checksum: 794d190a88e7ca5fa2996d6895cebf82 (MD5)
Antonio Carlos Jobim archive as well as his personal archive was collected and arranged to fulfill the desire of a man concerned with his image. This work reveals the history underneath the organization of his private documents. Also, it presents proofs of an autobiographical intent. I approach the construction of Jobim archives at Instituto Antonio Carlos Jobim and I emphasize the sub series Caderno de AnotaÁıes óNotebooksó in the serie Produção Intelectual do Titular; those notebooks can be considered unique documents and they are an important evidence of his daily use and memorial practice. The study of primary sources of this nature allows us to infer the image constructed by Jobim as well as the plans of the guardians of his legacy. The maintenance of his personal and musical archive highlights the composer's purpose of preserving his works to future generations. Jobim¥s musical and personal archives are under his family responsibility at Instituto Antonio Carlos Jobim in Rio de Janeiro.
O arquivo de Antonio Carlos Jobim, assim como todo arquivo pessoal, foi colecionado e mantido para satisfazer o desejo de um homem que sempre se preocupou com sua imagem. Este trabalho demonstra a história da construção e organização desse acervo, além de fortalecer a hipótese de que o arquivo, em sua integridade, configura-se como uma escrita autobiográfica. Abordo a organização arquivística do fundo Antonio Carlos Jobim, dentro do Instituto que leva seu nome, e dou ênfase na subsérie Cadernos de anotações, da série Produção Intelectual do Titular. Esses cadernos são um tipo de documento singular, quer pelo uso que deles fazia o maestro, quer pela sua prática memorial. O estudo destas fontes primárias nos permite inferir a imagem construída pelo próprio titular, e também evidencia o plano dos guardiões dessa memória em perpetuá-la: Jobim decidiu manter um arquivo pessoal com o claro propósito de preservar sua obra e projetá-la para o futuro. Esse cuidado foi transmitido para seus herdeiros, que além das obras musicais, cuidam, hoje, de seu legado arquivístico dentro do Instituto Antonio Carlos Jobim.
9
Poletto, Fabio Guilherme. "Tom Jobim e a modernidade musical brasileira." reponame:Repositório Institucional da UFPR, 2012. http://hdl.handle.net/1884/27912.
Full text
10
Lin, Eileen Tien. "Join processing on a hypercube multicomputer." Diss., Georgia Institute of Technology, 1990. http://hdl.handle.net/1853/8206.
Full text
11
Andersen, Carl Floyd. "Using join networks to compute satisfiability." College Park, Md. : University of Maryland, 2008. http://hdl.handle.net/1903/8146.
Full textAbstract:
Thesis (Ph. D.) -- University of Maryland, College Park, 2008.Thesis research directed by: Dept. of Computer Science. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
12
Vance, Bennet. "Join-order optimization with Cartesian products." Full text open access at:, 1998. http://content.ohsu.edu/u?/etd,586.
Full text
13
Yang, Yin. "Join processing in non-conventional databases /." View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?CSED%202009%20YANG.
Full text
14
Dutchyn, Christopher J. "Dynamic join points : model and interactions." Thesis, University of British Columbia, 2006. http://hdl.handle.net/2429/30859.
Full textAbstract:
By modeling dynamic join points, pointcuts, and advice in a continuation-passing
style interpreter, we provide a fundamental account of these AOP mechanisms. This
account frames interesting type-and-effect properties of the mechanisms, such as the
range of interactions between advised code and advice, and provides a general framework
for describing these aspect interactions.Science, Faculty of
Computer Science, Department of
Graduate
15
Carvalho, Luiz Olmes. "Operadores físicos binários para consultas por similaridade em SGBDR." Universidade de São Paulo, 2018. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-16102018-105516/.
Full textAbstract:
O operador de Junção é um operador importante da Álgebra Relacional que combina os pares de tuplas que atendem a uma dada condição de comparação entre os valores dos atributos de duas relações. Quando a comparação avalia a similaridade entre pares de valores, o operador é chamado Junção por Similaridade. Esse operador tem aplicações em diversos contextos, tais como o suporte de tarefas de mineração e análise de dados em geral, e a detecção de quase-duplicatas, limpeza de dados e casamento de cadeias de caracteres em especial. Dentre os operadores de junção por similaridade existentes, a Junção por Abrangência (range join) é a mais explorada na literatura. Contudo, ela apresenta limitações, tal como a dificuldade para se encontrar um limiar de similaridade adequado. Nesse contexto, a Junção por k-vizinhos mais próximos (knearest neighbor join kNN join) é considerada mais intuitiva, e portanto mais útil que o range join. Entretanto, executar um kNN join é computacionalmente mais caro, o que demanda por abordagens baseadas na técnica de laço aninhado, e as técnicas existentes para a otimização do algoritmo são restritas a um domínio de dados em particular. Visando agilizar e generalizar a execução do kNN join, a primeira contribuição desta tese foi o desenvolvimento do algoritmo QuickNearest, baseado na técnica de divisão e conquista, que é independente do domínio dos dados, independente da função de distância utilizada, e que computa kNNjoins de maneira muito eficiente. Os experimentos realizados apontam que o QuickNearest chega a ser 4 ordens de magnitude mais rápido que os métodos atuais. Além disso, o uso de operadores de junção por similaridade em ambientes relacionais é problemático, principalmente por dois motivos: (i)emgeral o resultado tem cardinalidade muito maior do que o realmente necessário ou esperado pela maioria das aplicações de análise de dados; e (ii) as consultas que os utilizam envolvem também operações de ordenação, embora a ordem seja um conceito não associado à teoria relacional. A segunda contribuição da tese aborda esses dois problemas, tratando os operadores de junção por similaridade existentes como casos particulares de um conjunto mais amplo de operadores binários, para o qual foi definido o conceito de Wide-joins. Os operadores wide-joins recuperam os pares mais similares em geral e incorporam a ordenação como uma operação interna ao processamento, de forma compatível com a teoria relacional e que permite restringir a cardinalidade dos resultados a tuplas de maior interesse para as aplicações. Os experimentos realizados mostram que os wide-joins são rápidos o suficiente para serem usados em aplicações reais, retornam resultados de qualidade melhor do que os métodos concorrentes e são mais adequados para execução num ambiente relacional do que os operadores de junção por similaridade tradicionais.Joins are important Relational Algebra operators. They pair tuples from two relations that meet a given comparison condition between the attribute values. When the evaluation compares the similarity among the values, the operator is called a Similarity Join. This operator has application to a variety of contexts, such as supporting data mining tasks and data analysis in general, and near-duplicate detection, data cleaning and string matching in particular. Among the existing types of similarity joins, the range join is the most explored one in the literature. However, it has several shortcomings, such as the diculty to find adequate similarity thresholds. In such context, the k-nearest neighbors join (kNN join) is considered more intuitive, and therefore more useful than the range join. However, the kNN join execution is computationally well more expensive, thus demanding implementations either based on nested loop techniques, which are generic, or on optimizing techniques but that are specific data given domains. In order to accelerate and generalize kNN join execution, the first contribution of this thesis was the development of the QuickNearest algorithm, based on the divide and conquest approach that is independent of the data domain, independent of the distance function used, and that computes kNN joins very eciently. Experiments performed with the QuickNearest algorithm show that it is up to four orders of magnitude faster than current methods. Nevertheless, using similarity join operators in relational environments remains generally troublesome, due to two main reasons: (i) the result often has a cardinality much larger than what is actually needed or expected by most of the data analysis applications; and (ii) queries that use them almost always also require sorting operations, but order concept is not present in the relational theory. The second contribution of the thesis addresses these two problems through the definition of the concept of Wide-joins, which turns the existing similarity join operators just as particular cases of a more powerful set of binary operators. Awide-join operator retrieves the pairs most similar in general and already incorporates ordering as an internal operation to its processing, what makes it fully compatible with the relational theory. The concept also provides powerful ways to restrict the result cardinality just to tuples really meaningful for the applications. In fact, the experiments have also shown that wide-joins are fast enough to be useful for real applications, they return results of better quality than competing methods, and are more suitable for execution in a relational environment than the traditional similarity join operators.
16
Alqahatni, Zakyah. "Hierarchical Alignment of Tuples in Databases for Fast Join Processing." OpenSIUC, 2019. https://opensiuc.lib.siu.edu/theses/2604.
Full textAbstract:
Data is distributed across interconnected relations in relational databases. Relationships between tuples can be rearranged in distinct relations by matching the values of the join attribute, a process called equi-join operation. Unlike standard attempts to design efficient join algorithms in this thesis, an approach is proposed to align tuples in relation so that joins can be readily and effectively done. We position tuples in their respective relationships, called relations alignment, which has matching join attribute values in the corresponding positions. We also address how to align relations and perform joins on aligned relations. The experiments were conducted in this research to measure and analyze the efficiency of the proposed approach compared to standard MySQL joins.
17
Narne, Kavya. "COMPARISON OF GRAPH DATABASES AND THE JOIN CORE." OpenSIUC, 2016. https://opensiuc.lib.siu.edu/theses/2032.
Full textAbstract:
We are now in an era where the technology has rapidly become democratized. The restrictions of relational databases to address the requirements of contemporary application domains, such as semantic web and social networking, where data has an inherited graph structure underlying in it, leads to the development of new technology called Graph Databases. Graph databases can be defined as those in which data structures for the schema and instances are modelled as graphs and data manipulation is expressed by graph-traversal operations. On the other hand, the Complexity involved in the relational model to process large queries quickly involving complex join operations leads to the development of the Join-Core. The Join Core consists of a set of tables that store the relationships of data. With join core, no relations or intermediate results need to be retrieved, generated, or transferred, only query results need to be transferred over the networks. In this study, an overview and comparison of current graph database models like AllegroGraph, FlockDB, Neo4j, Sones, DEX etc. is presented. The comparison shows that Neo4j is the most popular and highly recommended among all graph databases. Also the experimental results of Join Core against Neo4j graph database shows that join core performance is more efficient that Neo4j when the query has complex join operations involved in it.
18
Bell, Jessica. "UA and Soviets Join to Help Botswana." College of Agriculture, University of Arizona (Tucson, AZ), 1990. http://hdl.handle.net/10150/295676.
Full text
19
Vepa, Jithendra. "Join cost for unit selection speech synthesis." Thesis, University of Edinburgh, 2004. http://hdl.handle.net/1842/1452.
Full textAbstract:
Undoubtedly, state-of-the-art unit selection-based concatenative speech systems produce very high quality synthetic speech. this is due to a large speech database containing many instances of each speech unit, with a varied and natural distribution of prosodic and spectral characteristics. the join cost, which measures how well two units can be joined together is one of the main criteria for selecting appropriate units from this large speech database. The ideal join cost is one that measures percieved discontinuity based on easily measurable spectral properties of the units being joined, inorder to ensure smooth and natural sounding synthetic speech. During first part of my research, I have investigated various spectrally based distance measures for use in computation of the join cost by designing a perceptual listening experiment. A variation to the usual perceptual test paradigm is proposed in this thesis by deliberately including a wide range of qualities of join in polysyllabic words. The test stimuli are obtained using a state-of-the-art unit-selection text-to-speech system: rVoice from Rhetorical Systems Ltd. Three spectral features Mel-frequency cepstral coefficients (MFCC), line spectral frequencies (LSF) and multiple centroid analysis (MCA) parameters and various statistical distances - Euclidean, Kullback-Leibler, Mahalanobis - are used to obtain distance measures. Based on the correlations between perceptual scores and these spectral distances. I proposed new spectral distance measures, which have good correlation with human perception to concatenation discontinuities. The second part of my research concentrates on combining join cost computation and the smoothing operation, which is required to disguise joins, by learning an underlying representation from the acoustic signal. In order to accomplish this task, I have chosen linear dynamic models (LDM), sometimes known as Kalman filters. Three different initialisation schemes are used prior to Expectation-Maximisation (KM) in LDM training. Once the models are trained, the join cost is computed based on the error between model predictions and actual observations. Analytical measures are derived based on the shape of this error plot. These measures and initialisation schemes are compared by computing correlations using the perceptual data. The LDMs are also able to smooth the observations which are then used to synthesise speech. To evaluate the LDM smoothing operation, another listening test is performed where it is compared with the standard methods (simple linear interpolation). I have compared the best three join cost functions, chosen from the first and second parts of my research, subjectively using a listening test in the third part of my research. in this test, I also evaluated different smoothing methods: no smoothing, linear smoothing and smoothing achieved using LDMs.
20
Thomas, Edward Julian. "Stability of join-the-shortest-queue networks." Thesis, University of Cambridge, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.615978.
Full text
21
Lor, Kevin C. "Factors leading Hmong youths to join gangs." Online version, 2003. http://www.uwstout.edu/lib/thesis/2003/2003lorc.pdf.
Full text
22
Wang, Wei. "Structural join : processing algorithms and size estimation /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20WANG.
Full textAbstract:
Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2004.Includes bibliographical references (leaves 107-120). Also available in electronic version. Access restricted to campus users.
23
Patrignani, Marco. "Importing ownership types into the join calculus." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2010. http://amslaurea.unibo.it/1173/.
Full text
24
Calvert, Peter Robert. "Architecture-neutral parallelism via the join calculus." Thesis, University of Cambridge, 2015. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.708900.
Full text
25
Moses, William S. (William Steven). "How should compilers represent fork-join parallelism?" Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113124.
Full textAbstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 49-53).
This thesis explores how fork-join parallelism, as supported by concurrency platforms such as Cilk and OpenMP, can be embedded into a compiler's intermediate representation (IR). Mainstream compilers typically treat parallel linguistic constructs as syntactic sugar for function calls into a parallel runtime. These calls prevent the compiler from performing optimizations across parallel control constructs. Remedying this situation is generally thought to require an extensive reworking of compiler analyses and code transformations to handle parallel semantics. Tapir is a compiler IR that represents logically parallel tasks asymmetrically in the program's control flow graph. Tapir allows the compiler to optimize across parallel control constructs with only minor changes to its existing analyses and code transformations. To prototype Tapir in the LLVM compiler, for example, the Tapir team added or modified about 6000 lines of LLVM's 4-million-line codebase. Tapir enables LLVM's existing compiler optimizations for serial code -- including loop-invariant-code motion, commonsubexpression elimination, and tail-recursion elimination -- to work with parallel control constructs such as spawning and parallel loops. Tapir also supports parallel optimizations such as loop scheduling. This research reported in this thesis represents joint work with Tao B. Schardl and Charles E. Leiserson.
by William S. Moses.
M. Eng.
26
Garzón, Cuervo Fabian Enrique. "Economic motivations to join insurgencies in Colombia." Doctoral thesis, Instituto Superior de Economia e Gestão, 2021. http://hdl.handle.net/10400.5/21655.
Full text
27
Fuentes, Lima Patrícia Helena Rector Mônica. "O imaginário de Antonio Carlos Jobim representações e discursos /." Chapel Hill, N.C. : University of North Carolina at Chapel Hill, 2008. http://dc.lib.unc.edu/u?/etd,1623.
Full textAbstract:
Thesis (Ph. D.)--University of North Carolina at Chapel Hill, 2008.Title from electronic title page (viewed Sep. 16, 2008). "... in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Romance Languages Portuguese." Discipline: Romance Languages; Department/School: Romance Languages.
28
Lima, Ilmar Costa. "Estudo psicoafetivo em detentos do Complexo Penitenciário Anísio Jobim." Universidade Federal do Amazonas, 2012. http://tede.ufam.edu.br/handle/tede/2839.
Full textAbstract:
Made available in DSpace on 2015-04-11T13:59:16Z (GMT). No. of bitstreams: 1
ilmar.pdf: 3890552 bytes, checksum: 4c527d64f6e87e72ce21b60733f61dda (MD5)
Previous issue date: 2012-04-19This study aimed to examine the prevalence of symptoms of depression, anxiety and hopelessness, as well as possible socio-emotional distress, among two hundred fifty-two inmates of the Penitentiary Anisio Jobim in the city of Manaus, capital of Amazonas State, Brazil. Data were collected from the instruments chosen and subsequently used with detainees, namely: 1) Beck Depression Scale, 2) Beck Anxiety Scale; 3) Beck Hopelessness Scale, 4) socio-emotional questionnaire. The results below indicate that depression is present among 25.0% of inmates, while 11.9% had anxiety symptoms, 6.64% indicating positive for symptoms of hopelessness and finally 59.7% had symptoms socio-emotional distress. It was also highlighted in the present study the correlation between socio-emotional distress and symptoms of depression, anxiety and hopelessness, indicating that the absence of family and social support, can lead the detainee to develop these symptoms over time. The data analysis also revealed that the higher the degree of vulnerability to which the prisoner is exposed, the greater the odds of presenting the same symptoms mentioned. Overall, this study allowed us to outline a framework of factors that trigger momentary suffering among inmates and impact the performance of daily activities within the establishment, and show that early identification of these symptoms can contribute to promoting mental health and quality Living among them.
Este estudo teve como objetivo principal averiguar a prevalência de sintomas de depressão, ansiedade e desesperança, bem como, possível sofrimento sócioafetivo, entre duzentos e cinquenta e dois detentos do Complexo Penitenciário Anísio Jobim, na Cidade de Manaus, Capital do Estado do Amazonas, Brasil. Os dados foram coletados dos instrumentos escolhidos e posteriormente utilizados junto aos detentos, a saber: 1) Escala Beck de Depressão; 2) Escala Beck de Ansiedade; 3) escala Beck de Desesperança; 4) Questionário Sócioafetivo. Os resultados apontam abaixo que a depressão encontra-se presente entre 25,0% dos detentos, enquanto que 11,9% apresentam sintomas de ansiedade, 6,64% com indicação positiva para sintomas de desesperança e por fim 59,7% apresentaram sintomas de sofrimento sócioafetivo. Destaque-se ainda no presente estudo a correlação encontrada entre sofrimento sócioafetivo e sintomas de depressão, ansiedade e desesperança, indicando que a ausência de suporte familiar e social, pode levar o detento a desenvolver os referidos sintomas com o passar do tempo. A análise dos dados obtidos revelou ainda, que quanto maior o grau de vulnerabilidade a que o detento está exposto, maiores são as probabilidades do mesmo apresentar os mencionados sintomas. De maneira geral, este estudo permitiu traçar um quadro momentâneo dos fatores que desencadeiam sofrimentos entre os detentos e impactam o desempenho de suas atividades diárias no interior do estabelecimento, bem como mostrar que a identificação antecipada destes sintomas pode contribuir para promoção de saúde mental e qualidade de vida entre os mesmos.
29
Kennedy, W. Brett. "Declustering spatial data for range and join queries." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0004/MQ45949.pdf.
Full text
30
Ge, Shen, and 葛屾. "Advanced analysis and join queries in multidimensional spaces." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hub.hku.hk/bib/B49799332.
Full textAbstract:
Multidimensional data are ubiquitous and their efficient management and analysis is a core database research problem. There are lots of previous works focusing on indexing, analyzing and querying multidimensional data. In this dissertation, three challenging advanced analysis and join problems in multidimensional spaces are proposed and studied, providing efficient solutions to their related applications.
First, the problem of generalized budget constrained optimization query (Gen-BOQ) is studied. In real life, it is often difficult for manufacturers to create new products dominating their competitors, due to some constraints. These constraints can be modeled by constraint functions, and the problem is then to decide the best possible regions in multidimensional spaces where the features of new products could be placed. Using the number of dominating and dominated objects, the profitability of these regions can be evaluated and the best areas are then returned. Although GenBOQ computation is challenging due to its high complexity, an efficient divide-and-conquer based framework is offered for this problem. In addition, an approximation method is proposed, making tradeoffs between the result quality and the query cost.
Next, the efficient evaluation of all top-k queries (ATOPk) in multidimensional spaces is investigated, which compute the top ranked objects for a group of preference functions simultaneously. As an application of such a query, consider an online store, which needs to provide recommendations for a large number of users simultaneously. This problem is somewhat overlooked by past research; in this thesis, batch algorithms are proposed instead of naïvely evaluating top-k queries individually. Similar preferences are grouped together, and two algorithms are proposed, using block indexed nested loops and a view-based thresholding strategy. The optimized view-based threshold algorithm is demonstrated to be consistently the best. Moreover, an all top-k query helps to evaluate other queries relying on the results of multiple top-k queries, such as reverse top-k queries and top-m influential queries proposed in previous works. It is shown that applying the view-based approach to these queries can improve the performance of the current state-of-the-art by orders of magnitude.
Finally, the problem of spatio-textual similarity joins (ST-SJOIN) on multidimensional data is considered. Given both spatial and textual information, ST-SJOIN retrieves pairs of objects which are both spatially close and textually similar. One possible application of this query is friendship recommendation, by matching people who not only live nearby but also share common interests. By combining the state-of-the-art strategies of spatial distance joins and set similarity joins, efficient query processing algorithms are proposed, taking both spatial and textual constraints into account. A batch processing strategy is also introduced to boost the performance, which is also effective for the original textual-only joins. Using synthetic and real datasets, it is shown that the proposed techniques outperform the baseline solutions.published_or_final_version
Computer Science
Doctoral
Doctor of Philosophy
31
Macko, Tibor. "The join construction for free involutions on spheres." Thesis, University of Aberdeen, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.401378.
Full textAbstract:
Given a Poincaré complex X, the set of manifold structures on X x Dk relative to the boundary can be viewed as the k-th homotopy group of a space Ss(X). This space is called the block structure space of X. Free involutions on spheres are in one-to-one correspondence with manifold structures on real projective spaces. There is Wall’s join construction for free involutions on spheres which we generalize to a map between block structure spaces of real projective spaces. More precisely, we define a functor from the category of real finite-dimensional vector spaces with inner product to pointed spaces which to a vector space V assigns the block structure space of the projective space of V. We study this functor from the point of view of orthogonal calculus of functors, we prove that the 6-fold delooping of the first derivative spectrum of this functor is an W-spectrum. The proof uses mainly codimension 1 surgery theory. This results suggests an attractive description of the block structure space of the infinite-dimensional real projective space which is a colimit of block structure spaces of projective spaces of finite-dimensional real vector spaces. The description is via the Taylor tower of orthogonal calculus.
32
Araujo, Eriko Werbet de Oliveira. "Ajax : an adaptive join algorithm for extreme restrictions." Universidade de Fortaleza, 2008. http://dspace.unifor.br/handle/tede/79970.
Full textAbstract:
Made available in DSpace on 2019-03-29T23:12:42Z (GMT). No. of bitstreams: 0
Previous issue date: 2008-10-21In a mobile ad hoc network (MANET), the nodes represent mobile computers in which database systems may reside. Such mobile computers (nodes) are free to move arbitrarily. In such an environment, we may have a collection of autonomous, distributed, heterogeneous and mobile databases (denoted Mobile Database Community or MDBC). Thus, each database user (in a mobile host) can access databases belonging to an MDBC through the MANET. Traditional query processing techniques fail to support the access to databases in an MDBC, since data delivery rate in such an environment becomes unpredictable and mobile hosts may suffer from limited available main memory to process some query operators (e.g., join). To react to those events, this dissertation presents an adaptive join operator, called AJAX, for processing join operations on mobile databases in an MDBC. AJAX ensures: (i) incremental production of results as soon as the data become available; (ii) progress of the query processing even when the delivery of data is blocked, and; (iii) reaction to situations of memory limitation on the execution of operator. Cost estimation and experimental results are presented to evidence that AJAX is an effective solution for processing join operation on mobile databases. Keywords: adaptive query processing, adaptive query operators, mobile databases, distributed systems.
Uma Comunidade de Bancos de Dados Móveis (MDBC) representa uma coleção de bancos de dados móveis e autônomos. Em tal contexto, cada usuário de um sistema de banco de dados participante da comunidade pode acessar os outros bancos de dados através de uma infra-estrutura de comunicação sem fio. A utilização de técnicas tradicionais para processamento de consultas no acesso à banco de dados em uma MDBC tem se mostrado ineficiente devido à imprevisibilidade na taxa de acesso a bancos de dados da comunidade e a limitação de memória disponível nos dispositivos móveis para a execução de certos operadores, como a junção, por exemplo. A imprevisibilidade é provocada por quedas constantes na comunicação entre os membros de uma MDBC (cenário comum em redes sem fio) e limitação de processamento de certas unidades móveis, atrasando a entrega de tuplas. Para reagir a estes eventos, é apresentado neste trabalho um operador de junção para processamento de consultas em bancos de dados móveis, denominado AJAX. O operador proposto garante as seguintes propriedades: (i) produção incremental de resultados à medida que os dados são disponibilizados; (ii) continuidade no processamento da consulta mesmo que a entrega dos dados esteja bloqueada, e; (iii) reação a situações de limitação de memória durante a execução do operador. Palavras-chave: processamento adaptativo de consultas, operadores adaptativos, bancos de dados móveis, sistemas distribuídos.
33
Asiri, Metab Saeed. "RELATION CO-CLUSTERING FOR FAST JOIN QUERY PROCESSING." OpenSIUC, 2017. https://opensiuc.lib.siu.edu/theses/2228.
Full textAbstract:
Relational databases have been utilized in a variety of applications, such as airline reservation systems, healthcare systems, accounting systems, etc. In relational databases, data are spread among interrelated relations. Relationships among tuples in different relations can be reconstructed by matching join attribute values, namely performing the (equi-)join operations. Unfortunately, the join operation is arguably the most important but expensive operation in query processing. Unlike conventional approaches, in this thesis, we propose to reorganize tuples in relations so that joins can be performed easily and efficiently. We attempt to place tuples in different relations that have the matching join attribute values at corresponding positions in their respective relations, called relation co-clustering. In this thesis, we discuss how to co-clustering relations, perform joins on co-clustered relations on Microsoft SQL server 2017.
34
Raigoza, Jaime Antonio. "Temporal Join Processing with Hilbert Curve Space Mapping." NSUWorks, 2013. http://nsuworks.nova.edu/gscis_etd/280.
Full textAbstract:
Management of data with a time dimension increases the overhead of storage and query processing in large database applications especially with the join operation, which is a commonly used and expensive relational operator whose processing is dependent on the size of the input relations. An index-based approach has been shown to improve the processing of a join operation, which in turn, improves the performance of querying historical data. Temporal data consist of tuples associated with a time interval value having a valid life span of different lengths. With join processing on temporal data, since tuples with longer life spans tend to overlap a greater number of joining tuples, they are likely to be accessed more often. The efficient performance of a temporal join depending on index-clustered data is the main theme studied and researched in this work. The presence of intervals having an extended data range in temporal data makes the join evaluation harder because temporal data are intrinsically multidimensional.
Some temporal join processing methods create duplicates of tuples with long life spans to achieve clustering of similar data, which improves the performance on tuples that tend to be accessed more frequently. The proposed Hilbert-Temporal Join (Hilbert-TJ) join algorithm overcomes the need of data duplication by mapping temporal data into Hilbert curve space that is inherently clustered, thus allowing for fast retrieval and storage. A balanced B+ tree index structure was implemented to manage and query the data. The query method identifies data pages containing matching tuples that intersect a multidimensional region. Given that data pages consist of contiguously mapped points on the curve, the query process successively traverses along the curve to determine the next page that intersects the query region by iteratively partitioning the data space. The proposed Adaptive Replacement Cache-Temporal Data (ARC-TD) buffer replacement policy is built upon the Adaptive Replacement Cache (ARC) policy by favoring the cache retention of data pages in proportion to the average life span of the tuples in the buffer. By giving preference to tuples having long life spans, a higher cache hit ratio was evident. The caching priority is also balanced between recently and frequently accessed data.
An evaluation and comparison study of the proposed Hilbert-TJ algorithm determined the relative performance with respect to a nested-loop join, a sort-merge join, and a partition-based join algorithm that use a multiversion B+ tree (MVBT) index. The metrics are based on a comparison between the processing time (disk I/O time plus CPU time), cache hit ratio, and index storage size needed to perform the temporal join. The study was conducted with comparisons in terms of the Least Recently Used (LRU), Least Frequently Used (LFU), ARC, and the new ARC-TD buffer replacement policy. Under the given conditions, the expected outcome was that by reducing data redundancy and considering the longevity of frequently accessed temporal data, better performance was achieved. Additionally, the Hilbert-TJ algorithm offers support to both valid-time and transaction-time data.
35
Rodrigues, Dias de Camargo Joandre. "Analyse du discours musical d’Antônio Carlos Jobim : les spécificités d’une modernité." Thesis, Toulouse 2, 2012. http://www.theses.fr/2012TOU20129/document.
Full textAbstract:
Notre sujet de recherche est le compositeur brésilien Antônio Carlos Jobim. Il est né à Rio de Janeiro dans les années 1920, époque de grandes transformations socioculturelles au Brésil, mais aussi en Europe. Il est un compositeur issu de la musique populaire brésilienne, qui sera l’un de principaux acteurs responsables de transformations de cette musique. Son essence est sa caractéristique savante/populaire qui s’illustre symboliquement dans le concept de « l’anthropophagie ». Notre problématique est liée à la «modernité » dont fait partie Jobim, et à ses effets sur la musique populaire. C’est pourquoi nous avons analysé des compositions et des arrangements de Jobim, ce qui nous a servi à élucider son style, tout comme les diverses influences qu’il a reçues. En tant que compositeur et auteur, nous avons choisi une optique interdisciplinaire pour analyser son langage et son discours musical. Les principales sources d’intérêt de cette recherche sont d’abord, qu’elle traite de la musique savante européenne et brésilienne de la fin du 19e et du début du 20e siècle, de certaines musiques populaires, et de la façon dont elles s’incorporent dans la musique « moderne » brésilienne de Jobim. En effet, le manque de travaux universitaires sur le sujet, en tous cas dans cette optique musicologique, a motivé notre recherche. D’autre part, l’impact de ce compositeur à l’échelle internationale est important car, au-delà de synthétiser une partie de la musique populaire à travers son langage, il va s’inscrire comme un compositeur charnière qui aura marqué son époqueThe subject of my research pertains to the Brazilian composer Antônio Carlos Jobim. As composer and author, I have chosen an interdisciplinary approach, between music and musicology. There is an analysis of his musical language and his musical speech. He was born in Rio de Janeiro in the 1920s, during the period of the big cultural transformations in Brazil, and also in Europe. The main issue is connected to the brazilian popular music and the "modernity" of which Jobim is a representative. He is a composer bound to the brazilian popular music, and will be one of the main actors responsible for the profound evolutionary transformations of this music. My topic is connected with modernity, a specific feature of Jobim, and its impact over popular music. I have therefore analysed Jobim original themes, as well as its arrangements. From this, we have been able to characterize its style, and its influences. I have also chosen an interdisciplinary approach to analyse its musical language. The main interest of this research is that it deals with the erudite music from Europe and Brazil at the end of 19th century and beginning of 20th century, with some popular music and the way that they get intertwined. Indeed, the lack of university research work in this direction has motivated my research. Eventually, this musician appears as a key composer of its time, with a large international impact, in addition to his large synthesis capacity
36
Pianta, Carlo Machado. "A gênese da bossa nova : João Gilberto e Tom Jobim." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2010. http://hdl.handle.net/10183/25411.
Full textAbstract:
Este trabalho estuda a gênese do estilo musical bossa nova a partir da análise das quatro canções de Tom Jobim com letra dele mesmo que integram o repertório dos três primeiros discos de João Gilberto. A análise propriamente dita é precedida de contextualizações e definições. Situa-se a bossa nova como gênero no contexto histórico da canção, estabelecedo-se o recorte específico do trabalho. Procura-se aplicar o conceito de sistema literário, ao estudo da canção, em especial para clarificar o papel relevante das novas tecnologias disponíveis de gravação e radiodifusão na definição da canção popular do século XX. É feita uma análise resumida do que é a canção popular norte-americana, em especial aquilo que convencionou-se de chamar standards. Tendo alguns compositores – Noel Rosa, Pixinguinha, Dorival Caymmi e Ary Barroso – como eixo diacrônico, mostram-se os traços da modernização da música brasileira e, ao mesmo tempo, discutesse a dicotomia tom elevado/tom rebaixado aplicada à essa música. Finalmente, pesquisa-se na análise de Outra vez, Só em teus braços, Este teu olhar e Corcovado, os traços característicos do estilo. Considerando a relevância em cada caso, são analisados: a voz, o violão, a forma, os baixos, a harmonia, as letras e as melodias.This work studies the birth of the bossa nova style from the analysis of the four Tom Jobim‟s songs where he is also the lyricist in the first three albuns of João Gilberto. The analysis itself is preceeded of contextualizations ano definitions. The bossa nova is placed as a genre in the historic context of the “song”. The concept of literary sistem is applied to the study of the song, particularly concernig the role of the new recording and broadcasting tecnologies that appeared in the 20th century. A brief analysis of the american popular song, specially the jazz standards, a historical contextualization of the bossa nova in brazilian popular music and the discussion of the dicotomy between high and low levels of art are included. Whith the analysis of the songs Outra vez, Só em teus braços, Este teu olhar and Corcovado, the main characteristics of the style are pointed. The voice, the guitar, the form, the basses, the harmony the lyrics and the melodies are analysed.
37
Cutt, Bryce. "Improving hash join performance by exploiting intrinsic data skew." Thesis, University of British Columbia, 2009. http://hdl.handle.net/2429/9375.
Full textAbstract:
Large relational databases are a part of all of our lives. The government uses them and almost any store you visit uses them to help process your purchases. Real-world data sets are not uniformly distributed and often contain significant skew. Skew is present in commercial databases where, for example, some items are purchased far more often than others. A relational database must be able to efficiently find related information that it stores. In large databases the most common method used to find related information is a hash join algorithm. Although mitigating the negative effects of skew on hash joins has been studied, no prior work has examined how the statistics present in modern database systems can allow skew to be exploited and used as an advantage to improve the performance of hash joins. This thesis presents Histojoin: a join algorithm that uses statistics to identify data skew and
improve the performance of hash join operations. Experimental results show that for skewed data sets Histojoin performs significantly fewer I/O operations and is faster by 10 to 60% than standard hash join algorithms.
38
Luo, Min. "Perturbation analysis and optimization of fork-join queueing networks." Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/14901.
Full text
39
Poletto, Fabio Guilherme. "Saudade do Brasil: Tom Jobim na cena musical brasileira (1963-1976)." Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/8/8138/tde-27052011-164629/.
Full textAbstract:
Este trabalho é um estudo da obra do compositor Antonio Carlos Jobim e suas intersecções com o cenário musical brasileiro no período de 1963/1976. Seu objetivo é mapear as principais características estéticas da música de Jobim e avaliar suas ressonâncias no cenário cultural do país. Para tanto, examina os fonogramas originais gravados, manuscritos de composições, textos originais, entrevistas e avaliações críticas que circularam na imprensa brasileira no período. A análise destas ressonâncias busca o entendimento da formação de um espaço público de debates, cuja arena musical incorporou discussões sobre a modernização do país, da música popular e suas interfaces com a sociedade. Considera as especificidades da produção musical e as tensões resultantes de sua veiculação pela indústria fonográfica. Avalia o papel das instâncias de crítica cultural e de reconhecimento estético da música popular na formação de um cânone da música brasileira. Avalia a ação do Estado autoritário como indutor de projetos modernizantes, políticas culturais e ao mesmo tempo, como executor de práticas de censura. Em um sentido mais profundo, examina as perspectivas históricas que alimentaram a estética de Tom Jobim, suas leituras do processo de modernização brasileira e a sugestão de um ideal de identidade moderna que sua música ambicionou articular.This is a study of the works of the brazilian composer Tom Jobim and its intersections with brazilian musical scene during the period of 1963/1976. It aims to map the main aesthetic features of Jobims music and to evaluate its resonances in the cultural scene of the country. For this, it examines the original records, manuscripts of compositions, original texts, interviews and critic evaluations that circulated in the brazilian press in that period. The analisis of this resonances seeks the understanding of the formation of a public space of debates, which musical arena incorporated discussions about the modernization of the country, its popular music and its interfaces with society. It considers the specificities of musical production and the resulting tensions of its spread by music industry. It evaluates the role of instances of cultural critic and aesthetic recognition of popular music in the process of formation of the canon of brazilian music. It evaluates the action of an authoritarian national state as prompter of modernizing projects, cultural policies and, at the same time, as executor of censorship practices. In a deeper sense, it examines the historical perspectives that nourished Jobims aesthetic, its interpretations of Brazils modernization proccess and the sugestion of an ideal of modern identity that his music aimed to articulate.
40
Guedes, Ana Carolina de Azevedo. "Sophia Jobim: trajetória e individualidade. Uma experiência singular do feminismo brasileiro." Universidade do Estado do Rio de Janeiro, 2015. http://www.bdtd.uerj.br/tde_busca/arquivo.php?codArquivo=9382.
Full textAbstract:
Coordenação de Aperfeiçoamento de Pessoal de Nível SuperiorConselho Nacional de Desenvolvimento Científico e Tecnológico
Nesta dissertação abordaremos a indumentarista, professora e feminista Sophia Jobim Magno de Carvalho (1904 1968). Sophia Jobim nascida Maria Sofia Pinheiro Machado Jobim, em Avaré em 19 de Setembro de 1904. Fundou em 1947, a primeira sede do Clube Soroptimista no Brasil, em sua casa com Bertha Lutz, ocupando o cargo de presidente durante quatro anos. Em 1949, ocupa o cargo de regente da disciplina de Indumentária e Arte Decorativa na Escola Nacional de Belas-Artes (ENBA). Através desse cargo, Sophia viajava para colecionar peças de diferentes países e apresentá-los nas suas aulas, além de fundar o primeiro museu de indumentária da América Latina, em sua casa, em Santa Teresa RJ, em 1960. Após sua morte por embolia pulmonar, em 1968, seu acervo é totalmente doado ao Museu Histórico Nacional, instituição na qual se graduou no Curso de Museologia, em 1963. Com este trabalho pretendemos trazer à tona uma parcela do material doado por Sophia e evidenciando suas ações como feminista, trazendo para o trabalho a discussão em torno do individuo utilizando como teóricos Georg Simmel e Gilberto Velho. A formação da ENBA, e a cooptação dos intelectuais no Estado Novo são temas a serem mobilizados durante o trabalho, além da sociabilidade como forma de análise do período e do campo por onde Sophia caminhou. Através deste trabalho buscamos proporcionar uma breve visão sobre Sophia Jobim e contribuir aos estudos sobre o feminismo e a individualidade.
This dissertation will focus in the indumentarist, teacher and feminist Sophia JobimMagno de Carvalho (1904 1968). Sophia Jobim was born Maria Sophia Pinheiro Machado, in Avaré, on September, 19, 1904. Founded in 1947, the first headquarters of the Soroptmist Club in Brazil, in your home, with Bertha Lutz, and occupying the position of president for four years. In 1949, she holds the position of conductor of the discipline of History of clothing and decorative art in the Nacional School of Fine Arts. Through this post, Sophia traveled to collect pieces from different countries and present them in their classes, and founded the first museum of Latin America costume at home, in Santa Teresa RJ, on 1960. After her death from pulmonary embolism in 1968, its colletion is entirely donated to the Nacional Historical Museum, the institution where she graduated from the course in museology in 1963. With this work we intended to bring out a portion of the material donated by Sophia showing their actions as feminist, bringing the discussion to work around the individual using theoretical as Georg Simmel and Gilberto Velho. Training and cooptation donates intellectuals in the ENBA, and New State are to be mobilized during work, as well as a form of sociability as a form of analysis of the period and country where Sophia walked. Through this work we provide a brief overview of Sophia Jobim and contribute to studies on feminism and individuality.
41
Ferreira, Tiago Lazzarin. "Da universidade livre à escola oficial: um estudo sobre o imaginário do Centro Tom Jobim." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/48/48134/tde-21012013-155817/.
Full textAbstract:
O presente estudo tem o objetivo de fornecer pistas sobre o imaginário de dois períodos distintos de uma mesma instituição: a antiga Universidade Livre de Música Tom Jobim (ULM) e a atual Escola de Música do Estado de São Paulo Tom Jobim (EMESP). Pretende compreender e caracterizar os fundamentos pedagógicos de um projeto educacional de Música utilizando-se das teorias de Gilbert Durand, Edgar Morin e José Carlos de Paula Carvalho. O interesse se deve à mudança do modelo de ensino livre e acessível a todas as idades para o modelo de ensino oficial acompanhado da padronização do perfil dos estudantes. Por meio da teoria do Imaginário de Durand, pretende-se identificar os mitos relativos às duas propostas de ensino e situá-las no panorama político que as engendrou. A pesquisa se baseou no estudo dos documentos publicados pela gestão da Organização Social Santa Marcelina, Diário Oficial do Estado de São Paulo e nas observações feitas em campo.The present research had as objective to investigate the imaginary of two distinct periods of one same institution: the former Universidade Livre de Música-TomJobim (ULM) and the current Escola de Música do Estado de São Paulo Tom Jobim(EMESP). The aim of this study is to understand and characterize the pedagogical principles of that Music-centered educational project through the theories of Gilbert Durand, Edgar Morinand José Carlos de Paula Carvalho. This interest was awakened by the change (undergone by the institution),from a free education model accessible to all ages, to an official teaching model followed by standardization of students profiles. Through Durands theory of the Imaginary this study seeks to identify miths regarding each of the two educational proposals, and to place them in the respective political scenes that engendered them. Research was based on the study of documents published by (the administration of)the Organização Social Santa Marcelina, study of the Diário Oficial do Estado de São Paulo, and field observations.
42
Vellaiappan, Prathap. "Performance analysis of join size estimation algorithms for XML queries /." Available to subscribers only, 2005. http://proquest.umi.com/pqdweb?did=1184157031&sid=7&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Full text
43
Yu, Qicheng. "An agent-based adaptive join algorithm for building data warehouses." Thesis, London Metropolitan University, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.573407.
Full textAbstract:
Making better business decisions in an efficient way is the key to succeeding in today's competitive world. Organisations seeking to improve their decision-making process can be overwhelmed by the sheer volume and complexity of data available from their various operational information systems. Many organisations have responded to this challenge by employing data warehousing technologies to make full use of the information in their systems and address real-world business problems. As organisations move their operation to the Internet to take the advantages of the new technologies, the data warehouse environments for the organisations become more distributed and dynamic. Meanwhile, applications of a data warehouse have evolved from reporting and decision support systems to mission critical decision making systems, which require data warehouses to combine both historical and current data from operational systems. This presents both challenges and opportunities in the designing and developing of new data warehouse systems for supporting decision-making processes which can deliver the right information, to right people, at the right time, interactively and securely. In typical distributed data warehouse architectures both the logical layer and physical layer of the data warehouse are used to map physical tables in distributed data marts. The physical layer contains historical data materialised in a longer time period while most recent data is only available from the logical layer. To extract knowledge from this data is often expensive, as it usually requires complex queries involving a series of joins and aggregations. Many commercial data warehouse systems place limits on such operations at runtime or sacrifice precision by using approximate replication. The join operation is one of the most expensive operations in query processing as it combines, compares and merges potentially large data sets. Joining large tables could consume a significant amount of the system resources including CPU, disk, buffer and network bandwidth. Consequently join performance has a considerable impact on overall system performance especially in a distributed data warehouse environment. The traditional 'optimise-then-execute' query processing paradigm is inadequate in this case. This thesis investigates the evolution of data warehouses to identify architecture suitable for highly distributed data warehouses and studied the feasibility and effectiveness of utilising software agent technology for distributed information systems. A novel agent- based adaptive join algorithm called AJoin for effective and efficient online join operations in distributed data warehouses has been proposed to seamlessly integrate dynamic integration approach with traditional data warehousing technologies to address the issues arising from distributed and dynamic data warehouse environments. Taking into consideration data warehouse features, AJoin utilises intelligent agents for dynamic optimisation and coordination of join processing at run time. Key aspects of the AJoin algorithm have been implemented and evaluated against other modern adaptive join algorithms. The experimental evaluation results demonstrate that AJoin consistently outperforms other adaptive join algorithms under various distributed and dynamic data warehouse environments in this study. The outcome of this research has been very encouraging. The average performance of AJoin in matching the first 50 tuples has improved as much as 67% and overall join performance has improved more than 35% compared with other join algorithms in a distributed and dynamic data warehouse environment.
44
Ali, Noorazean Mohd. "A state-based join point model and language for AOP." Thesis, Lancaster University, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.658017.
Full textAbstract:
To specify its intention clearly, a pointcut definition must specify the join point where to adapt a crosscutting functionality and the applicability condition of the crosscutting functionality (if any), and to realise modular abstraction of a crosscutting functionality an advice must abstract only the crosscutting functionality. A state-dependent crosscutting concern is an aspect whose applicability of its advice at a matched join point is statedependent, and call graph-based AOP approaches are insufficient for a state-dependent crosscutting concern because they do not allow specification of the state-dependent applicability condition in the pointcut definition. Event-based AOP approaches expose sequences of event executions as join points. Therefore, the state-dependent applicability condition of an aspect's advice can be specified in a pointcut definition by stating the sequence of event executions that brings the base program into the state when the advice is applicable. However, this means the programmer must know the sequence of event executions that brings the base program into the state. This thesis proposes a state-based AOP approach that exposes state and state transition join points that allow a state-dependent applicability condition to be clearly specified in the pointcut definition simply by specifying the state or the state transition when the advice is applicable, as implemented in the proof-of-concepts prototype language, TinyState.
45
Parthasarathy, Sasi Kumar. "A decomposition-based approach to join trigger processing in TriggerMan." [Florida] : State University System of Florida, 1999. http://etd.fcla.edu/etd/uf/1999/amp7404/parthasarathy.pdf.
Full textAbstract:
Thesis (M.S.)--University of Florida, 1999.Title from first page of PDF file. Document formatted into pages; contains vii, 47 p.; also contains graphics. Vita. Includes bibliographical references (p. 44-46).
46
Howes, Christine. "Coordinating in dialogue : using compound contributions to join a party." Thesis, Queen Mary, University of London, 2012. http://qmro.qmul.ac.uk/xmlui/handle/123456789/2486.
Full textAbstract:
Compound contributions (CCs) – dialogue contributions that continue or complete an earlier contribution – are an important and common device conversational participants use to extend their own and each other’s turns. The organisation of these cross-turn structures is one of the defining characteristics of natural dialogue, and cross-person CCs provide the paradigm case of coordination in dialogue. This thesis combines corpus analysis, experiments and theoretical modelling to explore how CCs are used, their effects on coordination and implications for dialogue models. The syntactic and pragmatic distribution of CCs is mapped using corpora of ordinary and task-oriented dialogues. This indicates that the principal factors conditioning the distribution of CCs are pragmatic and that same- and cross-person CCs tend to occur in different contexts. In order to test the impact of CCs on other conversational participants, two experiments are presented. These systematically manipulate, for the first time, the occurrence of CCs in live dialogue using text-based communication. The results suggest that syntax does not directly constrain the interpretation of CCs, and the primary effect of a cross-person CC on third parties is to suggest to them a strong form of coordination or coalition has formed between the people producing the two parts of the CC. A third experiment explores the conditions under which people will produce a completion for a truncated turn. Manipulations of the structural and contextual predictability of the truncated turn show that while syntax provides a resource for the construction of a CC it does not place significant constraints on where the split point may occur. It also shows that people are more likely to produce continuations when they share common ground. An analysis using the Dynamic Syntax framework is proposed, which extends previous work to account for these findings, and limitations and further research possibilities are outlined.
47
Oliveira, Thiago Borges de. "Efficient processing of multiway spatial join queries in distributed systems." Universidade Federal de Goiás, 2017. http://repositorio.bc.ufg.br/tede/handle/tede/8033.
Full textAbstract:
Submitted by Franciele Moreira (francielemoreyra@gmail.com) on 2017-12-12T16:13:05Z
No. of bitstreams: 2
Tese - Thiago Borges de Oliveira - 2017.pdf: 1684209 bytes, checksum: f64b32084ca6b13a58109e4d2cffe541 (MD5)
license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2017-12-13T09:33:57Z (GMT) No. of bitstreams: 2 Tese - Thiago Borges de Oliveira - 2017.pdf: 1684209 bytes, checksum: f64b32084ca6b13a58109e4d2cffe541 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Made available in DSpace on 2017-12-13T09:33:57Z (GMT). No. of bitstreams: 2 Tese - Thiago Borges de Oliveira - 2017.pdf: 1684209 bytes, checksum: f64b32084ca6b13a58109e4d2cffe541 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2017-11-29
Multiway spatial join is an important type of query in spatial data processing, and its efficient execution is a requirement to move spatial data analysis to scalable platforms as has already happened with relational and unstructured data. In this thesis, we provide a set of comprehensive models and methods to efficiently execute multiway spatial join queries in distributed systems. We introduce a cost-based optimizer that is able to select a good execution plan for processing such queries in distributed systems taking into account: the partitioning of data based on the spatial attributes of datasets; the intra-operator level of parallelism, which enables high scalability; and the economy of cluster resources by appropriately scheduling the queries before execution. We propose a cost model based on relevant metadata about the spatial datasets and the data distribution, which identifies the pattern of costs incurred when processing a query in this environment. We formalized the distributed multiway spatial join plan scheduling problem as a bi-objective linear integer model, considering the minimization of both the makespan and the communication cost as objectives. Three methods are proposed to compute schedules based on this model that significantly reduce the resource consumption required to process a query. Although targeting multiway spatial join query scheduling, these methods can be applied to other kinds of problems in distributed systems, notably problems that require both the alignment of data partitions and the assignment of jobs to machines. Additionally, we propose a method to control the usage of resources and increase system throughput in the presence of constraints on the network or processing capacity. The proposed cost-based optimizer was able to select good execution plans for all queries in our experiments, using public datasets with a significant range of sizes and complex spatial objects. We also present an execution engine that is capable of performing the queries with near-linear scalability with respect to execution time.
A multi-junção espacial é um tipo importante de consulta usada no processamento de dados espaciais e sua execução eficiente é um requisito para mover a análise de dados espaciais para plataformas escaláveis, assim como aconteceu com dados relacionais e não estruturados. Nesta tese, propomos um conjunto de modelos e métodos para executar eficientemente consultas de multi-junção espacial em sistemas distribuídos. Apresentamos um otimizador baseado em custos que seleciona um bom plano de execução levando em consideração: o particionamento de dados com base nos atributos espaciais dos datasets; o nível de paralelismo intra-operador que proporciona alta escalabilidade; e o escalonamento das consultas antes da execução que resulta em economia de recursos computacionais. Propomos um modelo de custo baseado em metadados dos datasets e da distribuição de dados, que identifica o padrão de custos incorridos no processamento de uma consulta neste ambiente. Formalizamos o problema de escalonamento de planos de execução da multi-junção espacial distribuída como um modelo linear inteiro bi-objetivo, que minimiza tanto o custo de processamento quanto o custo de comunicação. Propomos três métodos para gerar escalonamentos a partir deste modelo, os quais reduzem significativamente o consumo de recursos no processamento das consultas. Embora projetados para o escalonamento da multi-junção espacial, esses métodos podem também ser aplicados a outros tipos de problemas em sistemas distribuídos, que necessitam do alinhamento de partições de dados e da distribuição de tarefas a máquinas de forma balanceada. Além disso, propomos um método para controlar o uso de recursos e aumentar a vazão do sistema na presença de restrições nas capacidades da rede ou de processamento. O otimizador proposto foi capaz de selecionar bons planos de execução para todas as consultas em nossos experimentos, as quais usaram datasets públicos com uma variedade significativa de tamanhos e de objetos espaciais complexos. Apresentamos também uma máquina de execução, capaz de executar as consultas com escalabilidade próxima de linear em relação ao tempo de execução.
48
Inostroza, Aguilera Milton Galo Patricio. "Safe and practical decoupling of aspects with join point interfaces." Tesis, Universidad de Chile, 2013. http://www.repositorio.uchile.cl/handle/2250/113478.
Full textAbstract:
Magíster en Ciencias, Mención ComputaciónAspect-Oriented Programming (AOP) is an advanced technique for modularizing crosscutting concerns such as profiling, security, monitoring, among others. To do this, AOP introduces a new functional unit called aspect. In current aspect-oriented systems, aspects references to the base code. Those references are fragile and give up important software engineering properties such as modular reasoning and independent evolution of aspects and base code. In this thesis, we introduce a novel abstraction called Join Point Interfaces that, by design, supports modular reasoning and independent evolution by decoupling aspects from base code and by providing a modular type-checking algorithm. Join point interfaces can be used both with implicit announcement through pointcuts, and with explicit announcement by using closure join points. Join point interfaces further offer polymorphic dispatch on join points, with an advice-dispatch semantics akin to multi-methods. In this work, we show how our proposal solves a large number of problems observed in previous, related approaches. We have implemented join point interfaces as an open-source extension to AspectJ. An initial study on existing aspect-oriented programs supports our initial design in general, but also highlights some limitations which we then address by introducing parametric polymor- phism and a more permissive quantification mechanism. As a result, join point interfaces are a safe and practical way of decoupling aspects.
49
Ma, Qin. "Classes concurrentes et appel par filtrage dans le join calcul." Paris 7, 2005. http://www.theses.fr/2005PA077072.
Full text
50
Nguyen, Long Phi M. Eng Massachusetts Institute of Technology. "Exploring learned join algorithm selection in relational database management systems." Thesis, Massachusetts Institute of Technology, 2021. https://hdl.handle.net/1721.1/130706.
Full textAbstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, February, 2021Cataloged from the official PDF of thesis.
Includes bibliographical references (page 81).
Query optimizers, crucial components of relational database management systems, are responsible for generating efficient query execution plans. Despite many advances in the database community over the last few decades, most popular relational database management systems today still use cost-based optimizers that do not always model the underlying data's characteristics accurately. These cost-based optimizers brutally slow down a query if they make even one gross underestimate of a database table's cardinality. In this work, we improve on native cost-based optimizer performance by identifying the most ideal join algorithms for query execution plans in two popular relational database management systems, PostgreSQL and Microsoft SQL. First, we gather baseline query execution times for the entire IMDb Join Order Benchmark under different subsets of usable join algorithms to show that no subset yields high performance across all queries. We then show that it is feasible to use deep reinforcement learning to choose one of these subsets for each query seen and achieve far better performance on the intensive JOB queries. Finally, we introduce the idea of k-edits, showing results that indicate that for some queries, isolating just 1 "bad" join and changing its join algorithm can yield better performance. Our work suggests that reinforcement learning with both coarse and fine decisions shows huge potential for the future of query optimization and relational database management systems.
by Long Phi Nguyen.
M. Eng.
M.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science