For him and for her : En analys på genusperspektiv i parfymreklam

Arbetet är en analys på parfymreklam ur genusperspektiv. En analys på hur man i stillbild och annonsreklam framställer kvinnor och män och hur man designar reklamerna för att rikta sig åt vardera målgruppen. Jag har analyserat vad som skiljer dem åt, och försökt ta reda på varför man gör en genusskildring och hur reklamplaneringsprocessen är uppbyggd. Syftet med mitt examensarbete är att lyfta fram problematiken kring könsneutral reklam då det handlar om målgruppskildring. Min teori är att det till och med kan vara nödvändigt att skilja könen åt då det kommer till stillbildsreklam istället för att göra mer könsneutrala reklamer som ofta är noterat och önskat idag. För att utgöra vilka punkter och principer som följs och används, använde jag mig av fakta om marknadsföringsmetoder och reklambildsplanering. I analysen använde jag mig av traditionell bildanalysmetod för att finna ett metodistiskt analysresultat inom visuell kommunikation och jag byggde upp ett verktyg av de mest essentiella punkterna inom reklamframställning och dens fullföljande av syfte. Verktyget använde jag i en analys ur marknadsföringsperspektiv och slutligen jämförde jag resultaten för att lyfta fram problematiken med totalt könsneutrala reklamer i målgruppssammanhang. Jag använde även olika böcker inom visuell kommunikation och däribland Reklameffekter, som innehöll utmätningar ur en marknadsundersökning som författarna, Ulf Dahlqvist och Magnus Linde gjort (2002).My thesis consists of an analysis of gender perspective in perfume advertise-ment. It is an analysis of how we portray men and women in print advertisement and how we design the advertisements to engage each of the target groups. I have analyzed the aspects that differentiate the advertisements and tried to find out why a gender dif-ferentiation is made and how the planning process of the advertisement is established. The purpose of my thesis is to highlight the issues with gender neutral advertisement when it comes to engaging different target groups. My theory is that it may even be necessary to discern the two genders in print advertisement instead of making more gender neutral advertisements which are a hot topic today. To distinguish which as-pects and principles are followed and frequently used, I used facts about marketing methods and advertisement planning. In my analysis I used the traditional picture anal-ysis method to find a methodical result in visual communication and I also made a tool of the most essential aspects of the creative advertisement process, and the fulfilling of its purpose. I additionally used the tool to analyze from a marketing perspective and lastly I compared the results to highlight the issues of the gender neutral advertisements in the context of the target groups. I also used books about visual communication and one of them was “Reklameffekter”, which contained information about

Compressed Full-Text Indexes for Highly Repetitive Collections

This thesis studies problems related to compressed full-text indexes. A full-text index is a data structure for indexing textual (sequence) data, so that the occurrences of any query string in the data can be found efficiently. While most full-text indexes require much more space than the sequences they index, recent compressed indexes have overcome this limitation. These compressed indexes combine a compressed representation of the index with some extra information that allows decompressing any part of the data efficiently. This way, they provide similar functionality as the uncompressed indexes, while using only slightly more space than the compressed data. The efficiency of data compression is usually measured in terms of entropy. While entropy-based estimates predict the compressed size of most texts accurately, they fail with highly repetitive collections of texts. Examples of such collections include different versions of a document and the genomes of a number of individuals from the same population. While the entropy of a highly repetitive collection is usually similar to that of a text of the same kind, the collection can often be compressed much better than the entropy-based estimate. Most compressed full-text indexes are based on the Burrows-Wheeler transform (BWT). Originally intended for data compression, the BWT has deep connections with full-text indexes such as the suffix tree and the suffix array. With some additional information, these indexes can be simulated with the Burrows-Wheeler transform. The first contribution of this thesis is the first BWT-based index that can compress highly repetitive collections efficiently. Compressed indexes allow us to handle much larger data sets than the corresponding uncompressed indexes. To take full advantage of this, we need algorithms for constructing the compressed index directly, instead of first constructing an uncompressed index and then compressing it. The second contribution of this thesis is an algorithm for merging the BWT-based indexes of two text collections. By using this algorithm, we can derive better space-efficient construction algorithms for BWT-based indexes. The basic BWT-based indexes provide similar functionality as the suffix array. With some additional structures, the functionality can be extended to that of the suffix tree. One of the structures is an array storing the lengths of the longest common prefixes of lexicographically adjacent suffixes of the text. The third contribution of this thesis is a space-efficient algorithm for constructing this array, and a new compressed representation of the array. In the case of individual genomes, the highly repetitive collection can be considered a sample from a larger collection. This collection consists of a reference sequence and a set of possible differences from the reference, so that each sequence contains a subset of the differences. The fourth contribution of this thesis is a BWT-based index that extrapolates the larger collection from the sample and indexes it.Tässä väitöskirjassa käsitellään tiivistettyjä kokotekstihakemistoja tekstimuotoisille aineistoille. Kokotekstihakemistot ovat tietorakenteita, jotka mahdollistavat mielivaltaisten hahmojen esiintymien löytämisen tekstistä tehokkaasti. Perinteiset kokotekstihakemistot, kuten loppuosapuut ja -taulukot, vievät moninkertaisesti tilaa itse aineistoon nähden. Viime aikoina on kuitenkin kehitetty tiivistettyjä hakemistorakenteita, jotka tarjoavat vastaavan toiminnallisuuden alkuperäistä tekstiä pienemmässä tilassa. Tämä on mahdollistanut aikaisempaa suurempien aineistojen käsittelyn. Tekstin tiivistyvyyttä mitataan yleensä suhteessa sen entropiaan. Vaikka entropiaan perustuvat arviot ovat useimmilla aineistoilla varsin tarkkoja, aliarvioivat ne vahvasti toisteisien aineistojen tiivistyvyyttä. Esimerkkejä tällaisista aineistoista ovat kokoelmat saman populaation yksilöiden genomeita tai saman dokumentin eri versioita. Siinä missä tällaisen kokoelman entropia suhteessa aineiston kokoon on vastaava kuin yksittäisellä samaa tyyppiä olevalla tekstillä, tiivistyy kokoelma yleensä huomattavasti paremmin kuin entropian perusteella voisi odottaa. Useimmat tiivistetyt kokotekstihakemistot perustuvat Burrows-Wheeler-muunnokseen (BWT), joka kehitettiin alun perin tekstimuotoisten aineistojen tiivistämiseen. Pian kuitenkin havaittiin, että koska BWT muistuttaa rakenteeltaan loppuosapuuta ja -taulukkoa, voidaan sitä käyttää niissä tehtävien hakujen simulointiin. Tässä väitöskirjassa esitetään ensimmäinen BWT-pohjainen kokotekstihakemisto, joka pystyy tiivistämään vahvasti toisteiset aineistot tehokkaasti. Tiivistettyjen tietorakenteiden käyttö mahdollistaa suurempien aineistoiden käsittelemisen kuin tavallisia tietorakenteita käytettäessä. Tämä etu kuitenkin menetetään, jos tiivistetty tietorakenne muodostetaan luomalla ensin vastaava tavallinen tietorakenne ja tiivistämällä se. Tässä väitöskirjassa esitetään aikaisempaa vähemmän muistia käyttäviä algoritmeja BWT-pohjaisten kokotekstihakemistojen muodostamiseen. Kokoelma yksilöiden genomeita voidaan käsittää otokseksi suuremmasta kokoelmasta, joka koostuu populaation kaikkien yksilöiden sekä niiden hypoteettisten jälkeläisten genomeista. Tällainen kokoelma voidaan esittää äärellisenä automaattina, joka muodostuu referenssigenomista ja yksilöiden genomeissa esiintyvistä poikkeamista referenssistä. Tässä väitöskirjassa esitetään BWT-pohjaisten kokotekstihakemistojen yleistys, joka mahdollistaa tällaisten automaattien indeksoinnin

What to Gain from Trade Show Information - an Empirical Study

Trade show is generally considered to be an effective marketing tool for products and services, but it also has an important role as information-sharing platform between trade show participants. This study examines what kind of value trade show information has for the companies attending a B2B trade show. In this study, the value of trade show information was measured by using the Return On Trade Show Information – model (RTSI) developed by Bettis-Outland, Cromartie, Johnston and Borders (2010). Using this framework, it was studied how information acquistion, dissemination and use, as well as quality of information impact on the tangible and intangible outcomes of trade show participation. In addition, the RTSI model was developed further and objective setting for information was included in the model. Quantitative methods were used to carry out the research. The data for this study was collected through an online questionnaire targeted to both exhibitors and visitors of a B2B trade show. The survey was sent out to 3550 trade show attendees of which 450 completed the questionnaire resulting a total response rate of 12,9 %. Two multiple regression models were used to analyze the data. The findings of this study show that information acquisition, dissemination and use have all significant impact on information value. These findings are in line with previous research on RTSI. In addition, this study has been able to demonstrate that quality of information has positive relationship with information value. Also, the objective setting was found to have significant impact on tangible and intangible outcomes of trade show participation

Strategic learning : a route to competitive advantage?

fi=vertaisarvioitu|en=peerReviewed

Silvicultural Result of One-Grip Harvester Operation

A new method for measuring the silvicultural result of thinning is presented in the study. The measuring method was based on rectangular sample plots measured parallel to strip roads. An individual sample plot consisted of eight zones, each 30 m2 in area. Due to its considerable importance in Finland, the one-grip harvester operation was the harvesting system examined. The research material was collected from 15 stands amounting to a total area of 14.7 ha. The post-harvesting inventory provided good information on the removed and standing trees, their size and distribution. The number and distribution of standing and removed trees were according to Finnish thinning instructions, and thinning was typical low thinning, in which smaller trees and trees of low quality are removed. The average tree damage percentage, 4.6, is acceptable. However, the proportion of damage varied from 1.1% to 9.1% with different operators. The damage was highest during the summer. Small, superficial damage was typical. The average strip road width was 4.8 m, the distance between strip roads 19.8 m and the rut depth 0.6 cm. The economic consequences of the damage was estimated using a calculation model. The model estimates the losses caused by strip roads, tree and soil damage. The economic consequences of harvesting damage during the rotation period was 1158 FIM (1 U$ = 5.60 FIM). Strip roads make a significant contribution to the amount of costs. Due to the high variation in the harvesting quality, both the continuing supervision of the silvicultural thinning result and the training of machine operators are necessary. Thinning spruce stands during the sap period should be avoided due to the high risk of tree damage, and decay following damage. Generally, it is possible to obtain a good silvicultural thinning result with one-grip harvester operation

Sampled longest common prefix array

When augmented with the longest common prefix (LCP) array and some other structures, the suffix array can solve many string processing problems in optimal time and space. A compressed representation of the LCP array is also one of the main building blocks in many compressed suffix tree proposals. In this paper, we describe a new compressed LCP representation: the sampled LCP array. We show that when used with a compressed suffix array (CSA), the sampled LCP array often offers better time/space trade-offs than the existing alternatives. We also show how to construct the compressed representations of the LCP array directly from a CS

Statistical models for inferring the structure and history of populations from genetic data

Population genetics has enjoyed a long and rich tradition of applying mathematical, computational and statistical methods. The connection between these fields has deepened in the last few decades as advances in genotyping technology have led to an exponential increase in the amount of genetic data allowing fundamental questions involving the nature of genetic variation to be asked. The massive quantities of data have necessitated the development of new mathematical and statistical models along with computational techniques to provide answers to these questions. In this work we address two problems in population genetics by constructing statistical models and analyzing their performance with simulated and real data. The first one concerns the identification of genetic structure in natural populations from molecular data, which is an important aspect in many fields of applied science, including genetic association mapping and conservation biology. We frame it as a problem of clustering and classification and utilize background information to achieve a higher accuracy, when the genetic data is sparse. We develop a computationally efficient method for taking advantage of geographical sampling locations of the individuals. The method is based on the assumption that the spatial structure of the populations correlates strongly with the genetic structure, which has been proven reasonable for human populations. In the assignment of individuals into known populations, we also show how improvements in the efficiency of the inference can be obtained by considering all of the individuals jointly. The result is derived in the context of classification, which is major field of study in machine learning and statistics, making it applicable in a wide range of situations outside population genetics. The other problem involves the reconstruction of evolutionary processes that have resulted in the structure present in current populations. The genetic variation between populations is caused to large extent by genetic drift, which corresponds to random fluctuations in the distribution of a genetic type due to demographic processes. Depending on the genetic marker under study, mutation has only a minor or even negligible role, in contrast with traditional phylogenetic methods, where mutational processes dominate as the time scales are longer. We follow the change in the relative frequencies of different genetic types in populations by deriving approximations to widely used models in population genetics. The direct modeling of population level properties allows the method to be applied data sets harboring thousands of samples, as demonstrated by the analysis of global population structure of Streptococcus pneumoniae.Populaatiogenetiikka tutkii perinnöllisen vaihtelun esiintymistä ja muutosta populaatioissa, jotka ovat samaan lajiin kuuluvien yksilöiden muodostamia yhteisöjä. Keskeisen osa populaatiogenetiikan kehityksessä on ollut matemaattisilla, tilastollisilla ja laskennallisilla menetelmillä. Tämä yhteys on vahvistunut viime aikoina samalla kun uudet sekvensointimenetelmät ovat johtaneet geneettisten aineistojen määrän räjähdysmäiseen kasvuun. Geneettisen materiaalin selvittämisen helppous on luonut tarpeen kehittää uusia laskennallisia menetelmiä, joilla pystytään tehokkaasti tutkimaan perinnöllisen vaihtelun luonnetta populaatioissa. Väitöskirjassa luodaan tilastollisia malleja vastaamaan kahteen populaatiogenetiikassa esiin nousevaan kysymykseen. Ensimmäinen näistä koskee luonnonpopulaatioiden geneettisen rakenteen oppimista, joka on tärkeä osa monilla eri tieteen osa-alueille. Ongelma muotoillaan käyttäen tilastotieteessä ja koneoppimisessa laajasti tutkittuja ryhmittelyn ja luokittelun käsitteitä. Työssä kehitetään laskennallisesti tehokkaita menetelmiä muun saatavilla olevan informaation, kuten yksilöiden maantieteellisten havaintopaikkojen, hyödyntämiseen geneettisen aineiston ohella. Toinen ongelma liittyy niiden historiallisten prosessien selvittämiseen, jotka ovat johtaneet nykyiseen geneettiseen rakenteeseen havaituissa populaatioissa. Geneettinen vaihtelu läheisten populaatioiden välillä on usein seurausta eri perintötekijöiden satunnaisesta sekoittumisesta, kun taas mutaatioiden luomilla uusilla muodoilla on pieni tai merkityksetön rooli. Väitöskirjassa johdetaan tätä satunnaisvaihtelua kuvaaville malleille approksimaatioita, jotka mahdollistavat tuhansia yksilöitä kattavien aineistojen analyysin