In 2015 the term Progressive Web Application was coined to describe applications that are getting the advantage of all Progressive App features. Some of the essential features are offline support, app-like interface, secure connection, etc. Since then, case studies from PWA’s implementation showed optimistic promises for improving web page performance, time spent on site, user engagement, etc. The goal of this report is to analyze some of the effects of PWA. This work will investigate the browser compatibility of PWA’s features, compare and analyze performance and memory consumption effect of PWA’s features compared to Regular WebApp. Results showed a lot of the features of PWA are still not sup-ported by some major browsers. Performance benchmark showed that required https connection for PWA is slowing down all of the PWA’s performance metrics on the first visit. On a repeat visit, some of the PWA features like speed index is outperforming the Regular Web App. Memory consumption on PWA increased more than 2 times the size of RWA. The conclusion is that even if some features are not directly supported by browsers, they still might have workaround solutions. PWA is slower than regular web app if https on your web server is not optimized. Different browsers have different memory limitations for PWA caches. You should implement https and PWA features only if you have HTTP/2 support on your web server, otherwise, performance can decrease.

In this thesis we explore the the theory and history behind RNA alignment. Normal sequence alignments as studied by computer scientists can be completed in O(n2) time in the naive case. The process involves taking two input sequences and finding the list of edits that can transform one sequence into the other. This process is applied to biology in many forms, such as the creation of multiple alignments and the search of genomic sequences. When you take into account the RNA sequence structure the problem becomes even harder. Multiple RNA structure alignment is particularly challenging because covarying mutations make sequence information alone insufficient. Existing tools for multiple RNA alignments first generate pair-wise RNA structure alignments and then build the multiple alignment using only the sequence information. Here we present PMFastR, an algorithm which iteratively uses a sequence-structure alignment procedure to build a multiple RNA structure alignment. PMFastR also has low memory consumption allowing for the alignment of large sequences such as 16S and 23S rRNA. Specifically, we reduce the memory consumption to ∼O(band2 ∗ m) where band is the banding size. Other solutions are ∼ O(n2 ∗ m) where n and m are the lengths of the target and query respectively. The algorithm also provides a method to utilize a multi-core environment. We present results on benchmark data sets from BRAliBase, which shows PMFastR outperforms other state-of-the-art programs. Furthermore, we regenerate 607 Rfam seed alignments and show that our automated process creates similar multiple alignments to the manually-curated Rfam seed alignments. While these methods can also be applied directly to genome sequence search, the abundance of new multiple species genome alignments presents a new area for exploration. Many multiple alignments of whole genomes are available and these alignments keep growing in size. These alignments can provide more information to the searcher than just a single sequence. Using the methodology from sequence-structure alignment we developed AlnAlign, which searches an entire genome alignment using RNA sequence structure. While programs have been readily available to align alignments, this is the first to our knowledge that is specifically designed for RNA sequences. This algorithm is presented only in theory and is yet to be tested.

Submitted by Odilio Hilario Moreira Júnior (odilio@espm.br) on 2016-11-28T12:55:24Z No. of bitstreams: 1 Lucas de Vasconcelos Teixeira.pdf: 30069920 bytes, checksum: 7e644d5de1b68f899254e06965368c86 (MD5) / Approved for entry into archive by Odilio Hilario Moreira Júnior (odilio@espm.br) on 2016-11-28T12:55:48Z (GMT) No. of bitstreams: 1 Lucas de Vasconcelos Teixeira.pdf: 30069920 bytes, checksum: 7e644d5de1b68f899254e06965368c86 (MD5) / Approved for entry into archive by Debora Cristina Bonfim Aquarone (deborabonfim@espm.br) on 2016-11-28T12:56:32Z (GMT) No. of bitstreams: 1 Lucas de Vasconcelos Teixeira.pdf: 30069920 bytes, checksum: 7e644d5de1b68f899254e06965368c86 (MD5) / Made available in DSpace on 2016-11-28T12:57:38Z (GMT). No. of bitstreams: 1 Lucas de Vasconcelos Teixeira.pdf: 30069920 bytes, checksum: 7e644d5de1b68f899254e06965368c86 (MD5) Previous issue date: 2016-03-17 / The theme of this academic research is the Cafés, as communicational environments of sociability and consumption of memories and experiences. Its theoretical object is the consumption of memories and experiences, spatialities and temporalities of Cafés in the city of São Paulo, while the empirical objects are Café Girondino and Coffee Lab, which allow us to observe a variety of cultural scenes involving the universe of coffee. The general objective of this study is to examine the phenomenon of cultural scenes in the city of São Paulo, originated from the consumption of memories and experiences in communicational spaces and sociability, as observed at the Cafés mentioned above. One of its specific objectives is to analyze to what extend Café Girondino, nowadays, operates as a space organized by communicative strategies, enabling to revisiting memories and histories that took place at the beginning of modernity in the city of São Paulo, mainly at the end of the XIX century and the beginning of the following century. In addition to that, to identify how Coffee Lab disseminates the culture of specialty coffees, counting on a pedagogy of consumption, and becomes an obligatory destination for coffee lovers. Furthermore, we aim to problematize similarities and differences involving these cultural scenes including here the consumption of memories and experiences in these two Cafés. The guiding issue is to understand how these cultural scenes rise and structure with the consumption of memories and experiences in these iconic Cafés in the city of São Paulo. The corpus of this study includes the physical spaces of both Cafés, their objects, interviews and courses. For a deeper investigation into these communicational environments, we employed the flânerie methodology, as proposed by McLaren (2000), grounded on bibliographical and documentary researches. Among the theoretical references, authors as Will Straw, Norval Baitello, Mary Douglas and Baron Isherwood, Walter Benjamin, Iúri Lótman, Maurice Halbwachs, Pierre Nora, Mike Featherstone, Mônica Nunes, Cláudia Pereira, Vander Casaqui, Ana Luiza Martins and Nicolau Sevcenko, not to mention other thinkers that have contributed to our discussions. The results show there is a media strategy in these spaces, and the symbolic meaning that brings reasoning and value to consumptions is the fruit of sociabilities that go beyond market studies, characterizing these cultural scenes as a symptomatic phenomenon. / Esta pesquisa tem como tema os Cafés como ambiências comunicacionais de sociabilidade e de consumo de memórias e experiências. O objeto teórico diz respeito ao consumo de memórias e experiências, de espacialidades e temporalidades em cafeterias paulistanas, enquanto que os objetos empíricos são o Café Girondino e o Coffee Lab, que permitem observar variadas cenas culturais envolvendo o universo do café. O objetivo geral é examinar o fenômeno das cenas culturais paulistanas originadas do consumo de memórias e experiências em espaços comunicacionais e de sociabilidade, como nas referidas cafeterias. Os objetivos específicos são: analisar em que medida o atual Café Girondino opera como um espaço que se organiza através de estratégias comunicativas que proporcionam revisitar memórias e histórias do início da modernidade paulistana, mais precisamente do final do século XIX e início do seguinte; identificar as formas pelas quais o Coffee Lab dissemina a cultura dos cafés especiais por meio de uma pedagogia do consumo e se converte em destino obrigatório para os apreciadores da bebida; problematizar as semelhanças e diferenças entre as cenas culturais e também entre os consumos de memórias e experiências nas duas cafeterias. A questão que norteou a pesquisa pretende responder de que modo são constituídas as cenas culturais que se articulam em torno do consumo de memórias e experiências nestas cafeterias paulistanas icônicas. O corpus de pesquisa inclui os espaços físicos de ambas as cafeterias, seus objetos, entrevistas e cursos. Para melhor explorar estas ambiências comunicacionais, utilizamos a flânerie de McLaren (2000) como a metodologia aplicada, alicerçada por pesquisas bibliográfica e documental. O referencial teórico inclui autores como Will Straw, Norval Baitello, Mary Douglas e Baron Isherwood, Walter Benjamin, Iúri Lótman, Maurice Halbwachs, Pierre Nora, Mike Featherstone, Mônica Nunes, Cláudia Pereira, Vander Casaqui, Ana Luiza Martins e Nicolau Sevcenko, entre outros pensadores que contribuem para as discussões. Os resultados indicam que há uma estratégia midiática de construção desses espaços ao mesmo tempo em que as apropriações que dão sentido e valor ao que é consumido são fruto de sociabilidades que ultrapassam o que é mercadologicamente planejado, sendo as cenas culturais seu fenômeno sintomático.

Random sampling is a well-known technique for approximate processing of large datasets. We introduce a set of algorithms for incremental maintenance of large random samples on secondary storage. We show that the sample maintenance cost can be reduced by refreshing the sample in a deferred manner. We introduce a novel type of log file which follows the intuition that only a “sample” of the operations on the base data has to be considered to maintain a random sample in a statistically correct way. Additionally, we develop a deferred refresh algorithm which updates the sample by using fast sequential disk access only, and which does not require any main memory. We conducted an extensive set of experiments and found, that our algorithms reduce maintenance cost by several orders of magnitude.

This study evaluates the performance of Kotlin and Java on Android Runtime using four benchmarks from the Computer Language Benchmarks Game suite, for which a total of 12 benchmark implementations are studied. The metrics used to evaluate the performance includes runtime, memory consumption, garbage collection, boxing of primitives as well as bytecode n-grams. To benchmark the languages, a benchmark application has been developed intended to run on an Android phone. The results indicate that Kotlin is slower than Java for all studied benchmarks by a varying factor. Furthermore, the use of idiomatic Kotlin features and constructs results in additional heap pressure and the need of boxed primitives. Other interesting results indicate the existence of an underlying garbage collection overhead when reclaiming Kotlin objects compared to Java. Furthermore, Kotlin produces larger and more varied bytecode than Java for a majority of the benchmarks. / Denna studie utvärderar prestandan mellan Kotlin och Java på Android Runtime genom 12 implementationer av fyra benchmarks från The Computer Language Benchmarks Game. De mätvärden som använts för att utvärdera prestandan inkluderar körtid, minnesanvändning, garbage collection, boxing av primitiver samt bytekod n-grams. För att benchmarka språken har en benchmarkapplikation tagits fram för Android. Resultaten visar att Kotlin är långsammare än Java för samtliga benchmarks. Vidare resulterar användandet av idiomatiska Kotlin-funktioner i ökad minnesanvänding samt behovet att representera primitiver som klasser. Andra intressanta resultat inkluderar existensen av en overhead för garbage collectorn för frigörandet av objekt som allokerats av Kotlin jämfört med Java. Vidare producerar Kotlin större bytekodfiler och uppvisar mer varierad bytekod än Java för en majoritet av de benchmarks som studerats.