Les code en métrique rang attirent l’attention depuis quelques années en raison de leur application possible au codage réseau linéaire aléatoire (random linear network coding), à la cryptographie à clé publique, au codage espace-temps et aux systèmes de stockage distribué. Une construction de codes algébriques en métrique rang de cardinalité optimale a été introduite par Delsarte, Gabidulin et Roth il y a quelques décennies. Ces codes sont considérés comme l’équivalent des codes de Reed – Solomon et ils sont basés sur l’évaluation de polynômes linéarisés. Ils sont maintenant appelés les codes de Gabidulin. Cette thèse traite des codes en bloc et des codes convolutifs en métrique rang avec l’objectif de développer et d’étudier des algorithmes de décodage efficaces pour ces deux classes de codes. Après une introduction dans le chapitre 1, le chapitre 2 fournit une introduction rapide aux codes en métrique rang et leurs propriétés. Dans le chapitre 3, on considère des approches efficaces pour décoder les codes de Gabidulin. Lapremière partie de ce chapitre traite des algorithmes rapides pour les opérations sur les polynômes linéarisés. La deuxième partie de ce chapitre résume tout d’abord les techniques connues pour le décodage jusqu’à la moitié de la distance rang minimale (bounded minimum distance decoding) des codes de Gabidulin, qui sont basées sur les syndromes et sur la résolution d’une équation clé. Ensuite, nous présentons et nous prouvons un nouvel algorithme efficace pour le décodage jusqu’à la moitié de la distance minimale des codes de Gabidulin. Le chapitre 4 est consacré aux codes de Gabidulin entrelacés et à leur décodage au-delà de la moitié de la distance rang minimale. Dans ce chapitre, nous décrivons d’abord les deux approches connues pour le décodage unique et nous tirons une relation entre eux et leurs probabilités de défaillance. Ensuite, nous présentons un nouvel algorithme de décodage des codes de Gabidulin entrelacés basé sur l’interpolation des polynômes linéarisés. Nous prouvons la justesse de ses deux étapes principales — l’interpolation et la recherche des racines — et montrons que chacune d’elles peut être effectuée en résolvant un système d’équations linéaires. Jusqu’à présent, aucun algorithme de décodage en liste en temps polynomial pour les codes de Gabidulin n’est connu et en fait il n’est même pas clair que cela soit possible. Cela nous a motivé à étudier, dans le chapitre 5, les possibilités du décodage en liste en temps polynomial des codes en métrique rang. Cette analyse est effectuée par le calcul de bornes sur la taille de la liste des codes en métriques rang en général et des codes de Gabidulin en particulier. Étonnamment, les trois nouvelles bornes révèlent toutes un comportement des codes en métrique rang qui est complètement différent de celui des codes en métrique de Hamming. Enfin, dans le chapitre 6, on introduit des codes convolutifs en métrique rang. Ce qui nous motive à considérer ces codes est le codage réseau linéaire aléatoire multi-shot, où le réseau inconnu varie avec le temps et est utilisé plusieurs fois. Les codes convolutifs créent des dépendances entre les utilisations différentes du réseau aun de se adapter aux canaux difficiles. Basé sur des codes en bloc en métrique rang (en particulier les codes de Gabidulin), nous donnons deux constructions explicites des codes convolutifs en métrique rang. Les codes en bloc sous-jacents nous permettent de développer un algorithme de décodage des erreurs et des effacements efficace pour la deuxième construction, qui garantit de corriger toutes les séquences d’erreurs de poids rang jusqu’à la moitié de la distance rang active des lignes. Un résumé et un aperçu des problèmes futurs de recherche sont donnés à la fin de chaque chapitre. Finalement, le chapitre 7 conclut cette thèse. / Rank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowadays called Gabidulin codes. This dissertation considers block and convolutional codes in rank metric with the objective of designing and investigating efficient decoding algorithms for both code classes. After giving a brief introduction to codes in rank metric and their properties, we first derive sub-quadratic-time algorithms for operations with linearized polynomials and state a new bounded minimum distance decoding algorithm for Gabidulin codes. This algorithm directly outputs the linearized evaluation polynomial of the estimated codeword by means of the (fast) linearized Euclidean algorithm. Second, we present a new interpolation-based algorithm for unique and (not necessarily polynomial-time) list decoding of interleaved Gabidulin codes. This algorithm decodes most error patterns of rank greater than half the minimum rank distance by efficiently solving two linear systems of equations. As a third topic, we investigate the possibilities of polynomial-time list decoding of rank-metric codes in general and Gabidulin codes in particular. For this purpose, we derive three bounds on the list size. These bounds show that the behavior of the list size for both, Gabidulin and rank-metric block codes in general, is significantly different from the behavior of Reed–Solomon codes and block codes in Hamming metric, respectively. The bounds imply, amongst others, that there exists no polynomial upper bound on the list size in rank metric as the Johnson bound in Hamming metric, which depends only on the length and the minimum rank distance of the code. Finally, we introduce a special class of convolutional codes in rank metric and propose an efficient decoding algorithm for these codes. These convolutional codes are (partial) unit memory codes, built upon rank-metric block codes. This structure is crucial in the decoding process since we exploit the efficient decoders of the underlying block codes in order to decode the convolutional code.

A barcode is the representation of data including some information related to goods, offered for sale, which frequently appears in on-line fashion images. Detecting and decoding barcode has a variety of applications in the on-line marketplace. However, the existing method has limitation in detecting barcode in some backgrounds such as Tassels, strips, and texture in fashion images. So, our work focuses on identifying the barcode region and distinguishing a barcode from its patterns that are similar to it. We accomplish this by adding a post-processing technique after morphological operations. We also apply a Convolutional Neural Network (CNN) to solve this typical object detection problem. A comparison of the performance between our algorithm and a previous method will be given in our results. For decoding part, a package including current common types of decoding scheme is used in our work to decode the detected barcode. In addition, we add a pre-processing transformation step to process skewed barcode images in order to improve the probability of decoding success.

Esta dissertação de mestrado apresenta um banco de figuras e palavras. O banco objetiva servir para a aumentar a validade e precisão dos instrumentos de avaliação, bem como a eficácia dos materiais instrucionais para desenvolvimento de linguagem. Este banco contém 971 entradas lexicais. Cada entrada contém uma figura e seu correspondente nome escrito. A figura é analisada em termos de grau de univocidade (grau de concordância na nomeação). O nome da figura é analisado separadamente em três formas: palavra escrita visível, palavra falada audível, e palavra falada visível (lida orofacialmente). Palavras escritas visíveis são compostas de grafemas. São analisadas em termos de seu grau de familiaridade e reconhecibilidade (grau em que pode ser lida via rota lexical) e decodificabilidade (grau em que pode ser lida pela rota perilexical ou fonológica). Palavras ouvidas audíveis são compostas de fonemas. São analisadas em termos do grau de cifrabilidade (grau de facilidade com que podem ser escritas via rota perilexical). Palavras faladas vistas são compostas de fanerolaliemas. São analisadas em termos do grau de legibilidade orofacial (grau em que podem ser compreendidas apenas pela visão), audibilizabilidade (grau em que a imagem auditiva dos fonemas pode ser evocada por fanerolaliemas durante a leitura orofacial visual), e cifrabilidade (grau de facilidade com que podem ser escritas via rota perilexical). O banco é composto de 971 entradas lexicais, cada qual composta de uma figura (à esquerda) e de vários dados pertinentes ao seu nome correspondente (à direita). O lado direito da entrada é composto de seis campos. O Campo 1 fornece o o nome da figura escrito em dois alfabetos: alfabeto romano e alfabeto fonético internacional. Ele também fornece a categoria semântica à qual pertence a palavra. O Campo 2 fornece o número da figura (para indexar todas as 971 figuras do banco). O Campo 3 fornece a univocidade da figura numa escala de 0-100 pontos separadamente para crianças de 2, 3, 4, 5, 6 7-10 anos de idade, bem como para adultos. O Campo 4 fornece a palavra escrita visível tal como analisada em termos de seu grau de familiaridade ou reconhecibilidade (grau em que pode ser lida via rota lexical) numa escala de 1-9 pontos, separadamente para crianças de 5º ano, 4º ano, 3º ano, 2º ano, e 1º ano. Nessa escala, 5 corresponde à média, 6 a 1 erro-padrão (EP) acima da média, 7 a 2 EP acima da média e assim por diante até 9; ao passo que 4 corresponde 1 EP abaixo da média, 3 a 2 EP abaixo da média, e assim por diante até 1. O Campo 5 é composto de quatro linhas, cada qual dividida em quatro colunas. A Linha 1 fornece o grau de decifrabilidade (grau com que pode ser lida pela rota perilexical) da palavra escrita visível, numa escala de 0-1. A Linha 2 fornece o grau de cifrabilidade da palavra ouvida (grau com que pode ser escrita pela rota perilexical), numa escala de 0-1. A Linha 3 fornece o grau de audibilizabilidade da palavra falada lida orofacialmente (grau com que sequência de fanerolaliemas pode ser convertida em sequência de fonemas), numa escala de 0-1. A Linha 3 fornece o grau de cifrabilidade da palavra falada lida orofacialmente (grau com que sequência de fanerolaliemas pode ser convertida em sequência de grafemas), numa escala de 0-1. Cada palavra é dividida em suas colunas. cada coluna fornece os dados referentes à linha em questão em uma de quatro formas diferentes. Nas Colunas 1 e 2, dados consistem na média das razões independente da incidência. Nas Colunas 3 e 4, dados consistem na média das razões ponderada por incidência diferencial. Nas Colunas 1 e 3 os dados consistem na média das razões independentemente da tonicidade da fala (seja ouvida ou vista) na pronúncia. Nas Colunas 2 e 4, os dados consistem na média das razões ponderada pela tonicidade diferencial da fala (seja ouvida ou vista) na pronúncia. Por exemplo, a Linha 1 fornece o grau de decifrabilidade grafema-fonema da palavra escrita visível. Na Coluna 1 decoficabilidade é calculada como mera média de razões independente da incidência ou tonicidade. Na Coluna 2 decodificabilidade é calculada como média das razões independente da incidência mas ponderasa pela tonicidade. Na Coluna 3 decodificabilidade é calculada como média de razões ponderadas em termos de incidência mas independente de tonicidade. Na Coluna 4 decodificabilidade é calculada como média de razões ponderadas em termos de incidência e de tonicidade. O Campo 6 fornece o grau de legibilidade orofacial da fala vista, numa escala de 0-1. O grau de legibilidade orofacial é apresentado em quatro formas. Nas Colunas 1 e 2 ela se encontra calculada segundo o modelo Dória; nas Colunas 3 e 4 ela se encontra calculada segundo o modelo Fonético-Articulatório. Nas Colunas 1 e 3 ela é calculada independentemente da tonicidade da pronúncia; nas Colunas 2 e 4 ela é calculada de modo ponderado pela tonicidade diferencial da pronúncia / This master\'s thesis presents a new sourcebook aimed at increasing the validity and precision of language assessment tools, as well as the efficacy of instructional materials for language development. The sourcebook contains 971 lexical entries. Each entry contains a picture and its corresponding written name. The picture is analyzed in terms of its degree of univocity (i.e., picture naming agreement). The picture name is analyzed separately in three forms: visual written word, auditory spoken word, and visual spoken word (i.e., speechreading). Visual written word is made of graphemes. It is analyzed in terms of its degree of both: familiarity or recognizability (i.e., the degree to which it is suitable to be read via lexical reading route) and decodibility (i.e., the degree to which it is suitable to be read via perilexical reading route). Auditory spoken word is made of phonemes. It is analyzed in terms of its degree of encodibility (i.e., the degree to which it may be suitable for writing or spelling via perilexical spelling route). Visual spoken word is made of visemes. It is analyzed in terms of its degree of: speechreadability (i.e., the degree to which it may be understood via visual speechreading), audibilizability (i.e., the degree to which the auditory imagery of phonemes can be evoked by mouthshapes or visemes during speechreading), and encodibility (i.e., the degree to which it is suitable to be written or spelled correctly via perilexical route). The sourcebook is made of 971 lexical entries. Each entry is made of a picture (on the left) and several data pertaining to its corresponding name (on the right). The right side of the entry is made of six areas. The first area provides the picture name as it is written in both alphabets: the Roman alphabet (orthographic form) and the International Phonetic Alphabet. It also provides the semantic category to which the word belongs. The second area provides the picture number (for indexing all the 971 pictures of the sourcebook). The third area provides the picture univocity in a 0-100 scale for children aged: 2 years, 3 years, 4 years, 5 years, 6 years, 7 to 10 years, as well as for adults. The fourth area provides the visual written word as it is analyzed in terms of its degree of familiarity or recognizability (i.e., the degree to which the written word is suitable to be read via lexical reading route) in a 1-9 point scale, for children from 5th grade, 4th grade, 3rd grade, 2nd grade, and 1st grade. In such a scale, 5 corresponds to the mean, 6 is the mean plus 1 standard error, 7 is the mean plus 2 standard errors and so forth until 9, whereas 4 corresponds to the mean minus 1 standard error, 3 corresponds to the mean minus 2 standard errors and so forth until 1, which corresponds to the mean minus 4 standar erros. The fifth area is made of four lines. Each line is divided into four columns. The first line provides the visual written word degree of decodibility (i.e., the degree to which it is suitable to be read via perilexical reading route) in a 0-1 scale. The second line provides the auditory spoken word degree of encodibility (i.e., the degree to which it may be suitable for writing or spelling via perilexical spelling route) in a 0-1 scale. The third line provides the visual spoken word degree of audibilizability (i.e., the degree to which the auditory imagery of phonemes can be evoked by mouthshapes or visemes during speechreading) in a 0-1 scale. The fouth line provides the visual spoken word degree of encodibility (i.e., the degree to which it is suitable to be written or spelled correctly via perilexical route) in a 0-1 scale. Each line is divided into four columns. Each column presents the data pertaining to the line in question in 1 of 4 different forms. In the first and second columns the data consist of the mean of the ratios regardless of incidence. In the third and fourth columns the data consist of the mean of the ratios weighted by differencial incidence. In the first and third columns the data consist of the mean of the ratios regardless of tonicity of speech (either auditory or visual) in pronunciation. In the second and fourth columns the data consist of the mean of the ratios weighted by differencial tonicity of speech (either auditory or visual) in pronunciation. For instance the first line provides the visual written word degree of decodibility (i.e., grapheme to phoneme decoding). In the first column decodibility is calculated as a mere mean of the ratios regardless of either incidence or tonicity. In the second column decodibility is calculated as a mean of the ratios regardless of incidence but weighted in terms of tonicity. In the third column decodibility is calculated as a mean of the ratios weighted in terms of incidence but regardless of tonicity. In the fourth column it is calculated as a mean of the ratios weighted in terms of both incidence and tonicity. The sixth area provides the visual spoken word degree of speechreadability (i.e., the degree to which it may be understood via visual speechreading) in a 0-1 scale. The speechreadability is presented in 1 of 4 different forms. In the first and second columns, the speechreadability is calculated according to Doria\'s model. In the third and fourth columns it is calculated according to a phonetic model. In the first column and third columns it is calculated regardless of tonicity in pronunciation. In the second and fourth columns it is calculated in a way that is weighted by the differencial tonicity in pronunciation

Submitted by admin tede (tede@pucgoias.edu.br) on 2017-06-28T13:20:09Z No. of bitstreams: 1 KÉLIA MARGARIDA BARROS FREIRE.pdf: 2376286 bytes, checksum: 59c7ba5d89ca07d45590e5f866950733 (MD5) / Made available in DSpace on 2017-06-28T13:20:09Z (GMT). No. of bitstreams: 1 KÉLIA MARGARIDA BARROS FREIRE.pdf: 2376286 bytes, checksum: 59c7ba5d89ca07d45590e5f866950733 (MD5) Previous issue date: 2017-03-15 / After the opening of diverse branches of Genetics Science, and the decoding of human and animal (bovine) genome, our production animals are being evaluated by molecular markers, which read the genome and translate it in four letters: AT-CG. The variations are analyzed as monomorphic and polymorphic regions. The aim of this research was to evaluate the “polymorphisms of the gene DGAT1 and its relation to the external sciatic bi opening and the scrotal circumference”. 109 animals have been analyzed, n= 73 Nelores bovines and n= 36 with no determined breed (NDB), with the age adjusted to 550 days, owned by breeders from the state of Goiás. In the morphometric data analysis through the test T of Student, comparing the groups Nelores PO and Bovine NDB, The analysis of morphometric data through the test T of Student comparing the groups Nelore PO and Bovine NDB does not indicate that the identified differences are substantially important to the variables ABi and CE (p ≤ 0,0001). In the genomic analysis, the test Chi-square was not relevant (p ≥ 0,05), revealing, this, that the groups of Nelore PO and of animals of NDB do not differ when it comes to the obtained genotypic and allelic frequencies. In this situation, we have observed so far variations in the allelic and genotypic frequencies for the sampled animals and the three SNP used in the study: rs471462296, rs456245081 and rs438495570. The genotype of the sampled bovines did not affect the evaluated characteristics, revealing there are, this, other genetic and non-genetic effects which affect the characteristics studied in Nelore, which deserve to be investigated. / Com o desenvolvimento dos vários ramos da Ciência Genética e a decodificação do genoma humano e animal (bovinos), nossos animais de produção estão sendo avaliados por marcadores moleculares, que fazem a leitura do genoma e o traduz em quatro letras: AT-CG. As variações são analisadas como regiões monomórficas e polimórficas. O objetivo desta pesquisa foi avaliar os “Polimorfismos do Gene DGAT1 e sua relação com a abertura bi isquiática externa (ABI) e o circunferência escrotal (CE)”. Foram analisados 109 bovinos, sendo73 bovinos daraça Nelore (PO) e36 bovinos sem raça definida (SRD), com idade ajustada para 550 dias, pertencentes a diferentes criadores do Estado de Goiás. A análise dos dados morfométricos pelo teste T de Student, comparando os grupos Nelore PO e bovinos SRD, não indica que as diferenças encontradas são substantivamente importantes para as variáveis ABI e CE (p ≤ 0,0001).Na análise genômica, o teste do Qui-quadrado não foi significativo (p ≥ 0,05), revelando, portanto, que os grupos de Nelore PO e de animais SRD não diferem quanto às frequências genotípicas e alélicas encontradas. Nessa situação, não foram observados até o momento variações na frequência alélica e genotípica para os animais amostrados e para os três SNPs usados no estudo: rs471462296, rs456245081 e rs438495570. O genótipo dos bovinos amostrados não apresentou influência sobre as características avaliadas, existindo, portanto, outros efeitos genéticos e não genéticos que afetam as características estudadas em Nelore, as quais merecem ser investigadas.

Esta dissertação de mestrado apresenta um banco de figuras e palavras. O banco objetiva servir para a aumentar a validade e precisão dos instrumentos de avaliação, bem como a eficácia dos materiais instrucionais para desenvolvimento de linguagem. Este banco contém 971 entradas lexicais. Cada entrada contém uma figura e seu correspondente nome escrito. A figura é analisada em termos de grau de univocidade (grau de concordância na nomeação). O nome da figura é analisado separadamente em três formas: palavra escrita visível, palavra falada audível, e palavra falada visível (lida orofacialmente). Palavras escritas visíveis são compostas de grafemas. São analisadas em termos de seu grau de familiaridade e reconhecibilidade (grau em que pode ser lida via rota lexical) e decodificabilidade (grau em que pode ser lida pela rota perilexical ou fonológica). Palavras ouvidas audíveis são compostas de fonemas. São analisadas em termos do grau de cifrabilidade (grau de facilidade com que podem ser escritas via rota perilexical). Palavras faladas vistas são compostas de fanerolaliemas. São analisadas em termos do grau de legibilidade orofacial (grau em que podem ser compreendidas apenas pela visão), audibilizabilidade (grau em que a imagem auditiva dos fonemas pode ser evocada por fanerolaliemas durante a leitura orofacial visual), e cifrabilidade (grau de facilidade com que podem ser escritas via rota perilexical). O banco é composto de 971 entradas lexicais, cada qual composta de uma figura (à esquerda) e de vários dados pertinentes ao seu nome correspondente (à direita). O lado direito da entrada é composto de seis campos. O Campo 1 fornece o o nome da figura escrito em dois alfabetos: alfabeto romano e alfabeto fonético internacional. Ele também fornece a categoria semântica à qual pertence a palavra. O Campo 2 fornece o número da figura (para indexar todas as 971 figuras do banco). O Campo 3 fornece a univocidade da figura numa escala de 0-100 pontos separadamente para crianças de 2, 3, 4, 5, 6 7-10 anos de idade, bem como para adultos. O Campo 4 fornece a palavra escrita visível tal como analisada em termos de seu grau de familiaridade ou reconhecibilidade (grau em que pode ser lida via rota lexical) numa escala de 1-9 pontos, separadamente para crianças de 5º ano, 4º ano, 3º ano, 2º ano, e 1º ano. Nessa escala, 5 corresponde à média, 6 a 1 erro-padrão (EP) acima da média, 7 a 2 EP acima da média e assim por diante até 9; ao passo que 4 corresponde 1 EP abaixo da média, 3 a 2 EP abaixo da média, e assim por diante até 1. O Campo 5 é composto de quatro linhas, cada qual dividida em quatro colunas. A Linha 1 fornece o grau de decifrabilidade (grau com que pode ser lida pela rota perilexical) da palavra escrita visível, numa escala de 0-1. A Linha 2 fornece o grau de cifrabilidade da palavra ouvida (grau com que pode ser escrita pela rota perilexical), numa escala de 0-1. A Linha 3 fornece o grau de audibilizabilidade da palavra falada lida orofacialmente (grau com que sequência de fanerolaliemas pode ser convertida em sequência de fonemas), numa escala de 0-1. A Linha 3 fornece o grau de cifrabilidade da palavra falada lida orofacialmente (grau com que sequência de fanerolaliemas pode ser convertida em sequência de grafemas), numa escala de 0-1. Cada palavra é dividida em suas colunas. cada coluna fornece os dados referentes à linha em questão em uma de quatro formas diferentes. Nas Colunas 1 e 2, dados consistem na média das razões independente da incidência. Nas Colunas 3 e 4, dados consistem na média das razões ponderada por incidência diferencial. Nas Colunas 1 e 3 os dados consistem na média das razões independentemente da tonicidade da fala (seja ouvida ou vista) na pronúncia. Nas Colunas 2 e 4, os dados consistem na média das razões ponderada pela tonicidade diferencial da fala (seja ouvida ou vista) na pronúncia. Por exemplo, a Linha 1 fornece o grau de decifrabilidade grafema-fonema da palavra escrita visível. Na Coluna 1 decoficabilidade é calculada como mera média de razões independente da incidência ou tonicidade. Na Coluna 2 decodificabilidade é calculada como média das razões independente da incidência mas ponderasa pela tonicidade. Na Coluna 3 decodificabilidade é calculada como média de razões ponderadas em termos de incidência mas independente de tonicidade. Na Coluna 4 decodificabilidade é calculada como média de razões ponderadas em termos de incidência e de tonicidade. O Campo 6 fornece o grau de legibilidade orofacial da fala vista, numa escala de 0-1. O grau de legibilidade orofacial é apresentado em quatro formas. Nas Colunas 1 e 2 ela se encontra calculada segundo o modelo Dória; nas Colunas 3 e 4 ela se encontra calculada segundo o modelo Fonético-Articulatório. Nas Colunas 1 e 3 ela é calculada independentemente da tonicidade da pronúncia; nas Colunas 2 e 4 ela é calculada de modo ponderado pela tonicidade diferencial da pronúncia / This master\'s thesis presents a new sourcebook aimed at increasing the validity and precision of language assessment tools, as well as the efficacy of instructional materials for language development. The sourcebook contains 971 lexical entries. Each entry contains a picture and its corresponding written name. The picture is analyzed in terms of its degree of univocity (i.e., picture naming agreement). The picture name is analyzed separately in three forms: visual written word, auditory spoken word, and visual spoken word (i.e., speechreading). Visual written word is made of graphemes. It is analyzed in terms of its degree of both: familiarity or recognizability (i.e., the degree to which it is suitable to be read via lexical reading route) and decodibility (i.e., the degree to which it is suitable to be read via perilexical reading route). Auditory spoken word is made of phonemes. It is analyzed in terms of its degree of encodibility (i.e., the degree to which it may be suitable for writing or spelling via perilexical spelling route). Visual spoken word is made of visemes. It is analyzed in terms of its degree of: speechreadability (i.e., the degree to which it may be understood via visual speechreading), audibilizability (i.e., the degree to which the auditory imagery of phonemes can be evoked by mouthshapes or visemes during speechreading), and encodibility (i.e., the degree to which it is suitable to be written or spelled correctly via perilexical route). The sourcebook is made of 971 lexical entries. Each entry is made of a picture (on the left) and several data pertaining to its corresponding name (on the right). The right side of the entry is made of six areas. The first area provides the picture name as it is written in both alphabets: the Roman alphabet (orthographic form) and the International Phonetic Alphabet. It also provides the semantic category to which the word belongs. The second area provides the picture number (for indexing all the 971 pictures of the sourcebook). The third area provides the picture univocity in a 0-100 scale for children aged: 2 years, 3 years, 4 years, 5 years, 6 years, 7 to 10 years, as well as for adults. The fourth area provides the visual written word as it is analyzed in terms of its degree of familiarity or recognizability (i.e., the degree to which the written word is suitable to be read via lexical reading route) in a 1-9 point scale, for children from 5th grade, 4th grade, 3rd grade, 2nd grade, and 1st grade. In such a scale, 5 corresponds to the mean, 6 is the mean plus 1 standard error, 7 is the mean plus 2 standard errors and so forth until 9, whereas 4 corresponds to the mean minus 1 standard error, 3 corresponds to the mean minus 2 standard errors and so forth until 1, which corresponds to the mean minus 4 standar erros. The fifth area is made of four lines. Each line is divided into four columns. The first line provides the visual written word degree of decodibility (i.e., the degree to which it is suitable to be read via perilexical reading route) in a 0-1 scale. The second line provides the auditory spoken word degree of encodibility (i.e., the degree to which it may be suitable for writing or spelling via perilexical spelling route) in a 0-1 scale. The third line provides the visual spoken word degree of audibilizability (i.e., the degree to which the auditory imagery of phonemes can be evoked by mouthshapes or visemes during speechreading) in a 0-1 scale. The fouth line provides the visual spoken word degree of encodibility (i.e., the degree to which it is suitable to be written or spelled correctly via perilexical route) in a 0-1 scale. Each line is divided into four columns. Each column presents the data pertaining to the line in question in 1 of 4 different forms. In the first and second columns the data consist of the mean of the ratios regardless of incidence. In the third and fourth columns the data consist of the mean of the ratios weighted by differencial incidence. In the first and third columns the data consist of the mean of the ratios regardless of tonicity of speech (either auditory or visual) in pronunciation. In the second and fourth columns the data consist of the mean of the ratios weighted by differencial tonicity of speech (either auditory or visual) in pronunciation. For instance the first line provides the visual written word degree of decodibility (i.e., grapheme to phoneme decoding). In the first column decodibility is calculated as a mere mean of the ratios regardless of either incidence or tonicity. In the second column decodibility is calculated as a mean of the ratios regardless of incidence but weighted in terms of tonicity. In the third column decodibility is calculated as a mean of the ratios weighted in terms of incidence but regardless of tonicity. In the fourth column it is calculated as a mean of the ratios weighted in terms of both incidence and tonicity. The sixth area provides the visual spoken word degree of speechreadability (i.e., the degree to which it may be understood via visual speechreading) in a 0-1 scale. The speechreadability is presented in 1 of 4 different forms. In the first and second columns, the speechreadability is calculated according to Doria\'s model. In the third and fourth columns it is calculated according to a phonetic model. In the first column and third columns it is calculated regardless of tonicity in pronunciation. In the second and fourth columns it is calculated in a way that is weighted by the differencial tonicity in pronunciation

Abstract
  Title:Systembolaget och unga - En studie om hur Systembolagets reklamfilmers budskap tas emot  Authors: Frida Johnsson, Evelina Josefsson, Minda Landgren  Aim: The aim with this essay is to analyze how the target audience 18-19-year olds, and consumers of Systembolaget, the target audience of 20- 25-year olds, are affected by two specific commercials named “Systrar” and “Bröder” and furthermore examine whether the commercials have a deterrent effect on the audience or not. The questions the essay answers are “How do 18-19-year olds perceive that they are affected by the campaign films?” and “How do 20-25-year olds perceive that they are affected by the campaign films?”. This essay uses the methods qualitative analysis and focus group interviewand is based on the theoryEncoding/Decoding. In conclusion Systembolaget uses emotions to convey their message. To the audiences the commercials are not as deterrent as one might first imagine.   Number of pages: 56 Course: Media and Communication studies C Department: Department of Informatics and Media University: Uppsala University Period: Autumn 2018 Tutor: Per Gunnar Holmlöv Keywords: Ungdomar, Systembolaget, Alkohol, Reklamfilm, Encoding/Decoding, Teman, Koder, Kontext

<p>Denna uppsats är en studie av företaget Felix reklamkampanj ”Var dag”, en reklamkampanj i syfte att stärka Felix varumärke. Syftet med denna uppsats är att komparativt undersöka hur producentledet konstruerar och respondenterna uppfattar kampanjen ”Var dag”. Vidare vill vi undersöka hur kampanjen kan tänkas påverka Felix’s varumärke. Övergripande sett så vill vi undersöka de olika moment och möjliga problem som kan tänkas uppkomma vid varumärkeskommunikation. Frågeställningarna syftar till att finna svar på hur reklamfilmerna kommunicerar Felix varumärke, hur producenten konstruerar kampanjen samt hur respondenterna uppfattar kampanjen. Det material vi har använt oss av för att besvara dessa frågor består av två stycken varumärkesfilmer, kampanjens projektledare Kjell Månsson samt sju respondenter som ingår i kampanjens målgrupp. Den teoretiska utgångspunkten för uppsatsen bestått av teorier behandlande varumärkesuppbyggning, företagsprofilering och image. Innehållsanalysen har vi genomfört med diskursanalys och semiotik. Receptionsanalysen har gjorts genom kvalitativa intervjuer som sedan tolkats genom en receptionsmodell (encoding – decoding). I innehållsanalysen fann vi att Felix söker skapa en diskurs där Felix framstår som en väsentlig del av vardagen. Genom den komparativa undersökningen har vi kommit fram till att det i flera fall råder ett asymmetriskt förhållande mellan hur producenten kodat kampanjen och hur respondenterna avkodat kampanjen. Det vill säga reklamfilmernas framställning av varumärket inte alltid delats av respondenterna, i flera fall så finner vi att respondenterna inte accepterar den profil Felix som kommunicerar.</p>

<p>Since their rediscovery in 1995, low-density parity-check (LDPC) codes have received wide-spread attention as practical capacity-approaching code candidates. It has been shown that the class of codes can perform arbitrarily close to the channel capacity, and LDPC codes are also used or suggested for a number of important current and future communication standards. However, the problem of implementing an energy-efficient decoder has not yet been solved. Whereas the decoding algorithm is computationally simple, withuncomplicated arithmetic operations and low accuracy requirements, the random structure and irregularity of a theoretically well-defined code does not easily allow efficient VLSI implementations. Thus the LDPC decoding algorithm can be said to be communication-bound rather than computation-bound.</p><p>In this thesis, a modification to the sum-product decoding algorithm called early-decision decoding is suggested. The modification is based on the idea that the values of the bits in a block can be decided individually during decoding. As the sum-product decoding algorithm is a soft-decision decoder, a reliability can be defined for each bit. When the reliability of a bit is above a certain threshold, the bit can be removed from the rest of the decoding process, and thus the internal communication associated with the bit can be removed in subsequent iterations. However, with the early decision modification, an increased error probability is associated. Thus, bounds on the achievable performance as well as methods to detect graph inconsistencies resulting from erroneous decisions are presented. Also, a hybrid decoder achieving a negligible performance penalty compared to the sum-product decoder is presented. With the hybrid decoder, the internal communication is reduced with up to 40% for a rate-1/2 code with a length of 1152 bits, whereas increasing the rate allows significantly higher gains.</p><p>The algorithms have been implemented in a Xilinx Virtex 5 FPGA, and the resulting slice utilization andenergy dissipation have been estimated. However, due to increased logic overhead of the early decision decoder, the slice utilization increases from 14.5% to 21.0%, whereas the logic energy dissipation reduction from 499 pJ to 291 pJ per iteration and bit is offset by the clock distribution power, increased from 141 pJ to 191 pJ per iteration and bit. Still, the early decision decoder shows a net 16% estimated decrease of energy dissipation.</p>

<p>Vår undersökning behandlar läsinlärning och läsförståelse. Utifrån ett pedagog- och elevperspektiv har vi undersökt begreppet läsförståelse, vad det innebär att kunna läsa och förstå text, vilka förutsättningar det kräver och hur lärandet sker kring detta. Vi har som utgångspunkt för vår undersökning använt oss av olika forskningsperspektiv på läsinlärning samt berört olika läsinlärningsmetoder. Genom kvalitativa intervjuer med pedagoger och elever har vi undersökt deras uppfattningar om hur man lär sig läsa och vad detta innebär för läsförståelsen. Resultaten har gett oss en insikt i att pedagogen bör vara lyhörd och stödja eleven genom olika verktyg, för att hjälpa eleven i läsutvecklingen. Med det menar vi att det underlättar om pedagog och elev är aktiv i läsinlärningen.</p> / <p>Our investigation treats learning by reading and reading comprehension. On the basis of a pedagogues and a pupils perspective we have investigated the concept of reading comprehension, what it means to know how to read and understand a text, which prerequisite it demands and how learning take place around this. As a starting point to our investigation we have use different research perspectives on learning by reading and touching different learning by reading methods. Through qualitative interviews with pedagogues and pupils we have investigate their understanding about how you learn to read by yourself and what it means for your reading comprehension. The results have given us knowledge of that the pedagogue should be sensitive and support the pupil with different tools, because the pedagogue must help the pupil in their reading evolution. We mean that it would facilitate if pedagogue and pupil are active in learning by reading.</p>

<p>New high quality mobile telecommunication services are offered everyday and the demand for higher data rates is continuously increasing. To maximize the uplink throughput in HSPA when transmission is propagated through a dispersive channel causing self-interference, equalizers are used. One interesting solution, where the equalizer and decoder exchange information in an iterative way, for improving the equalizer performance is Turbo equalization.</p><p>In this thesis a literature survey has been performed on Turbo equalization methods and a chosen method has been implemented for the uplink HSPA standard to evaluate the performance in heavily dispersive channels. The selected algorithm has been adapted for multiple receiving antennas, oversampled processing and HARQ retransmissions. The results derived from the computer based link simulations show that the implemented algorithm provide a gain of approximately 0.5 dB when performing up to 7 Turbo equalization iterations. Gains up to 1 dB have been obtained by disabling power control, not using retransmission combining and utilizing a single receiver antenna. The algorithm has also been evaluated considering alternative dispersive channels, Log-MAP decoding, different code rates, number of Turbo equalization iterations and number of Turbo decoding iterations.</p><p>The simulation results do not motivate a real implementation of the chosen algorithm considering the increased computational complexity and small gain achieved in a full featured receiver system. Further studies are needed before concluding the HSPA uplink Turbo equalization approach.</p>