行動二維條碼在日、韓的發展應用已相當成熟，過去台灣推行二維條碼時期由於手機的支援以及QR code的應用都尚未成熟，使得二維條碼在台灣並不普及。近年智慧型手機的發展逐漸普及，將能大幅提昇二維條碼更多元的應用，不僅是傳遞資訊給使用者，甚至結合了地圖導航、行銷及購票等功能。 本研究透過科技接受模式（Technology Acceptance Model, TAM）結合社會影響、促進條件、知曉型知識、操作型知識、知覺價格等影響台灣使用者意願之因素，透過問卷調查並經由結構方程模式進行驗證，分析台灣使用者的接受模式與影響因素的重要性，並給予政府、電信業者及商家在推行QR code應用上的建議。 本研究結果顯示「社會影響」及「促進條件」為最主要影響「使用意願」之因素，其次為「知覺易用性」及「知覺有用性」，「知曉型知識」與「操作型知識」則會影響「知覺易用性」及「知覺有用性」並間接影響到使用意願，台灣民眾希望使用的二維條碼服務前三名依序為取得商店及旅遊資訊、優惠卷下載、快速名片與電話輸入。因此行動業者再推行二維條碼時可考慮從社會媒體、智慧型手機的支援著手，並提供旅遊資訊及優惠卷等相關應用。 / The development and application of QR code is quite advanced in Japan and Korea; in contrast, at the time when QR code was introduced in Taiwan, lack of mobile phone support and the and the limited applications of QR code meant that it was not immediately popularized in Taiwan. In recent years, the growing popularity of smart phones has enhanced the various applications of QR code, not only providing the information to the user, but also performing navigation, marketing and ticketing functions, to name a few. This study is based on the Technology Acceptance Model, with Social Influence, Facilitating Conditions, Awareness Knowledge, Operation Knowledge and Price as the usage factors, and by verifying the structural modeling through public surveys and analyzing the importance of the Acceptance Model and other influences of users in Taiwan as the driving factors in incorporating QR code applications in the government, telecommunication carrier and business spheres. The study results indicate that Social Influences and Facilitating Conditions are major influencing factors of Intention to Use, followed by the Perceived Ease of Use and Perceived Usefulness; the Awareness Knowledge and Operation Knowledge affect the Perceived Ease of Use and Perceived Usefulness, and indirectly affect the Intention to Use. The top three QR code services that users in Taiwan are interested in relate to information about shops and tourist points of interest, coupon downloading and the fast input of business cards. Therefore, support of the continued development of public media and smart phones, the provision of tourism information and coupons along with other applications of QR code would be factors for consideration by a telecommunication carrier proposing to integrate QR code in its services.

Cette thèse essaie d'apporter une solution au problème de l'automatisation de la production des générateurs de code. Elle propose une méthode formelle de génération basée sur une séparation nette entre les algorithmes de génération et les données relatives a la machine cible. Réservation d'un système capable de créer, a partir d'une description de la machine cible, un générateur de code basé sur cette méthode

From July 1, 1934, to November 1, 1968, the Production Code Administration (PCA) oversaw the creation of American motion pictures, in order to improve Hollywood’s moral standing. To assist in this endeavor, the studios produced film adaptations of classic literature, such as the plays of William Shakespeare. In the first two years of the Code’s inception, two Shakespearean films were produced by major studios: A Midsummer Night’s Dream (1935) and Romeo and Juliet (1936). But were these classic adaptations able to avoid the censorship that other films endured? With the use of archived collections, film viewings, and an in-depth analysis of the plays, multiple versions of the scripts, and other available surviving documents, I was able to see how these productions were affected by the enforcement of film censorship and what it said about the position of Shakespeare’s work in society. A Midsummer Night’s Dream tended to use self-regulation, so as to avoid the censorship of the PCA. However, the film did not escape without some required changes. In spite of the filmmakers’ efforts, there were a few textual changes and the fairy costumes required revisions to meet the PCA’s standards. In the case of Romeo and Juliet, the PCA was far more involved in all stages of the film’s production. There were many documented text changes and even a case in which the censors objected to how the actors and director executed a scene on film. The motion picture was created as if it were of the greatest importance by all involved. And, as it were, the existing archives paint a picture of a production that was a sort of battleground in a sociopolitical war between the censors and the filmmakers. As both films arrived on the international stage, this sociopolitical campaigning did not end. During international distribution, the films were each accepted, rejected, and forced to endure further censorship, in order to become acceptable for public screening. This censorship often relayed a message about the location’s societal views and its contrast to American society.

This research is a case study which sought to investigate the educational implication of code switching in a multilingual school in Matatiele. Since the dawn of democracy in South Africa, the language policy has sought to promote multilingualism and also honours the cultural diversity existing in this country. It is against this background that the study was conducted. The present study also sought to investigate the occurrences and nature of code switching in the classroom context. In South Africa, the Language in Education Policy prescribes that English as Language of Learning and Teaching be practiced from Grade 4 upwards, alongside home languages. At school, it seems that teachers are not empowered regarding the approach towards code switching. The study investigates whether the use of code switching in a classroom context is in line with the Language in Education Policy. It also looks at the implications of trilingual instruction (which is the use of three languages) in content subjects in the classroom. Functions of code switching were examined as well. This empirical research study used qualitative research methods. Qualitative research provided the study with insight into code switching in the educational context. This study encompassed specific techniques for collecting data, mainly observations. Notes were also of some assistance and were jotted down while observation was underway to supplement what could not be captured by the video, such as emotion and feelings. The study concluded that code switching plays a significant role in an English as Second Language (ESL) classroom context. / Linguistics and Modern Languages / M. A. (Linguistics)

Submitted by Alison Vanceto (alison-vanceto@hotmail.com) on 2017-02-07T10:21:15Z No. of bitstreams: 1 DissBFA.pdf: 12687971 bytes, checksum: 19789fb95e5c01987f5067e083d04248 (MD5) / Approved for entry into archive by Camila Passos (camilapassos@ufscar.br) on 2017-02-08T12:04:07Z (GMT) No. of bitstreams: 1 DissBFA.pdf: 12687971 bytes, checksum: 19789fb95e5c01987f5067e083d04248 (MD5) / Approved for entry into archive by Camila Passos (camilapassos@ufscar.br) on 2017-02-08T12:08:22Z (GMT) No. of bitstreams: 1 DissBFA.pdf: 12687971 bytes, checksum: 19789fb95e5c01987f5067e083d04248 (MD5) / Made available in DSpace on 2017-02-08T12:09:45Z (GMT). No. of bitstreams: 1 DissBFA.pdf: 12687971 bytes, checksum: 19789fb95e5c01987f5067e083d04248 (MD5) Previous issue date: 2016-03-08 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / Model-Driven Development (MDD) is proposed to reduce the semantic gap between problem and solution/implementation domains. Some tools are used, and the code generator is commonly used in this context. These generators are often implemented using templates. A Reference Implementation (RI) favoring the development/ maintenance of software facilitates this implementation’s types. However, RI requires a code migration process which consists in artifacts’ synchronization, and it is responsible for 20% to 25% of the time spent on development. The literature has no describe automatic solutions, but the group that this reaserch was included has develop tools that automate this process and reduce the time spent on some tasks. But each task has a different performance in relation to time spent, so automation of some tasks can be disadvantageous. Few reports describe such tasks and which ones are capable of automatic code migration. The aim of this study is to investigate the maintain and evolution process to identify and describe the types of maintain and evolution tasks that are essentially. Based on this study, a method (MME-MDD) that drives the developer during that proccess to guide the developer during the realization of each task, with the aim to maximize the benefits of this approach. The MME-MDD was validated by a case study and a empirical study and the method showed effective in most of tasks. In addition, studies show that using the proposed method brought a gain in the quality of the source code. / O MDD (Model-Driven Development) tem como proposta a redução da distância semântica entre os domínios problema e solução/implementação. Para isso, são utilizadas algumas ferramentas, sendo o gerador de código comumente usado neste contexto. Os geradores de código são frequentemente implementados com a utilização de templates. Para facilitar este tipo de implementação, usualmente é empregado uma Implementação de Referência (IR), favorecendo a evolução/ manutenção do software. Contudo, a IR traz a necessidade do processo de migração de código, que consiste na sincronização entre o seu código-fonte e os templates, sendo que este é responsável por 20 a 25% do tempo gasto no desenvolvimento. Na literatura não há relatos de solução automatizada, mas o grupo no qual esta pesquisa se insere vem desenvolvendo ferramentas que automatizam este processo e reduzem o tempo aplicado em algumas tarefas testadas. Porém, cada tarefa tem um desempenho diferente em relação ao tempo gasto e, portanto, a automação de algumas tarefas pode ser desvantajosa. Existem poucos relatos na literatura descrevendo tais tarefas e quais são os passos necessários para realizá-las. O objetivo deste estudo foi a investigação do processo de manutenção e evolução de sistemas baseados em MDD com a finalidade de identificar e descrever os tipos de tarefas de manutenção e evolução. Com base nesse estudo, foi elaborado o método MMEMDD que conduz o desenvolvedor durante o processo de manutenção e evolução de sistemas, visando guiar o desenvolvedor durante a realização de cada um dos tipos de tarefas, com o intuito de maximizar os benefícios da utilização dessa abordagem. O método foi validado por meio de um estudo de caso e um estudo experimental, sendo que o método se mostrou efetivo em grande parte das tarefas testadas. Além disso, os estudos apontaram que a utilização do método proposto trouxe ganho na qualidade do código-fonte.

No description available.

Les modulations à phase continue (CPMs) sont des méthodes de modulations robuste à la noncohérence du canal de propagation. Dans un contexte spatial, les CPM sont utilisées dans la chaîne de transmission de télémesure de la fusée. Depuis les années 70, la modulation la plus usitée dans les systèmes de télémesures est la modulation CPFSK continuous phase frequency shift keying filtrée. Historiquement, ce type de modulation est concaténée avec un code ReedSolomon (RS) afin d'améliorer le processus de décodage. Côté récepteur, les séquences CPM non-cohérentes sont démodulées par un détecteur Viterbi à sortie dure et un décodeur RS. Néanmoins, le gain du code RS n'est pas aussi satisfaisant que des techniques de codage moderne capables d'atteindre la limite de Shannon. Actualiser la chaîne de communication avec des codes atteignant la limite de Shannon tels que les codes en graphe creux, implique deremanier l’architecture du récepteur usuel pour un détecteur à sortie souple. Ainsi, on propose dans cette étude d' élaborer un détecteur treillis à sortie souple pour démoduler les séquences CPM non-cohérentes. Dans un deuxième temps, on concevra des schémas de pré-codages améliorant le comportement asymptotique du récepteur non-cohérent et dans une dernière étape on élabora des codes de parité à faible densité (LDPC) approchant la limite de Shannon. / Continuous phase modulations (CPM) are modulation methods robust to the non-coherency of propagation channels. In a space context, CPMs are used in the communication link between the rocket and the base stations. Since the 70's, the most popular telemetry modulation is the filtered continuous phase frequency shift keying (CPFSK). Traditionally, the CPFSK scheme isconcatenated with a Reed-Solomon (RS) code to enhance the decoding process. At the receiver side, the non-coherent CPM sequences are demodulated through a hard Viterbi detector and a RS decoder. However, the RS's coding gain is no more satisfactory when directly compared to modern coding schemes enable to reach the Shannon limit. Updating the communication link to capacity achieving codes, as sparse graph codes, implies to redesign the receiver architecture to soft detector. In that respect, we propose in this study to design a trellis-based soft detector to demodulate non-coherent CPM sequences. In a second part, we will elaborate precoding schemes to improve the asymptotic behaviour of the non-coherent receiver and in a last step we will build low density parity check codes approaching the Shannon limit.

Program checking is indisputably important, especially if originating in formal methods. VeriFIT at FIT BUT uses custom Code Listener (CL) infrastructure modularly interconnecting the front-end, typically a code parser adapter, and the back-end, typically an analyser. Our aim is to offer a former as a compact alternative to existing GCC compiler plug-in. This adapter uses linearized code mediated by sparse library for static analysis of programs in C. According to the experiments with one of the main CL analysers, Predator tool and its tests suite, our product - clsp program - is successful successful in roughly 75% of cases in comparison with the GCC plug-in. Further improvements are expected.

Le problème d’´équivalence de code joue un rôle important dans la théorie de code et la cryptographie basée sur le code. Cela est dû à son importance dans la classification des codes ainsi que dans la construction et la cryptanalyse des cryptosystèmes à base de codes. Il est également lié à un problème ouvert d’isomorphisme de graphes, un problème bien connu dans le domaine de la théorie de la complexité. Nous prouvons pour les codes ayant un hull trivial qu’il existe une réduction polynomiale de l’équivalence par permutation de codes à l’isomorphisme de graphes. Cela montre que cette sous-classe d’équivalence de permutation n’est pas plus dure que l’isomorphisme de graphes. Nous introduisons une nouvelle méthode pour résoudre le problème d’équivalence de code. Nous développons des approches algébriques pour résoudre le problème dans ses deux versions : en permutation et en diagonale. Nous construisons un système algébrique en établissant des relations entre les matrices génératrices et les matrices de parité des codes équivalents. Nous nous retrouvons avecun système plusieurs variables d’équations linéaires et quadratiques qui peut être résolu en utilisant des outils algébriques tels que les bases de Groebner et les techniques associées. Il est possible en théorie de résoudre l’équivalence de code avec des techniques utilisant des bases de Groebner. Cependant, le calcul en pratique devient complexe à mesure que la longueur du code augmente. Nous avons introduit plusieurs améliorations telles que la linéarisation par bloc et l’action de Frobenius. En utilisant ces techniques, nous identifions de nombreux cas où le problème d’équivalence de permutation peut être résolu efficacement. Notre méthode d’équivalence diagonale résout efficacement le problème dans les corps de petites tailles, à savoir F3 et F4. L’augmentation de la taille du corps entraîne une augmentation du nombre de variables dans notre système algébrique, ce qui le rend difficile à résoudre. Nous nous intéressons enfin au problème d’isomorphisme de graphes en considérant un système algébrique quadratique pour l’isomorphisme de graphes. Pour des instances tirées aléatoirement, le système possède des propriétés intéressantes en termes de rang de la partie linéaire et du nombre de variables. Nousrésolvons efficacement le problème d’isomorphisme de graphes pour des graphes aléatoires avec un grand nombre de sommets, et également pour certains graphes réguliers tels que ceux de Petersen, Cubical et Wagner.123 / Code equivalence problem plays an important role in coding theory and code based cryptography.That is due to its significance in classification of codes and also construction and cryptanalysis of code based cryptosystems. It is also related to the long standing problem of graph isomorphism, a well-known problem in the world of complexity theory. We introduce new method for solving code equivalence problem. We develop algebraic approaches to solve the problem in its permutation and diagonal versions. We build algebraic system by establishing relations between generator matrices and parity check matrices of the equivalent codes. We end up with system of multivariables of linear and quadratic equations which can be solved using algebraic tools such as Groebner basis and related techniques. By using Groebner basis techniques we can solve the code equivalence but the computation becomes complex as the length of the code increases. We introduced several improvements such as block linearization and Frobenius action. Using these techniques we identify many cases where permutation equivalence problem can be solved efficiently. Our method for diagonal equivalence solves the problem efficiently in small fields, namely F3 and F4. The increase in the field size results in an increase in the number of variables in our algebraic system which makes it difficult to solve. We introduce a new reduction from permutation code equivalence when the hull is trivial to graph isomorphism. This shows that this subclass of permutation equivalence is not harder than graph isomorphism.Using this reduction we obtain an algebraic system for graph isomorphism with interesting properties in terms of the rank of the linear part and the number of variables. We solve the graph isomorphism problem efficiently for random graphs with large number of vertices and also for some regular graphs such as Petersen, Cubical and Wagner Graphs.

In many multilingual communities around the world, speakers need to choose, often at an unconscious level, which language to use in their interactions with other members of the community. One of the choices that bilingual speakers often make is to code switch; that is, speakers switch back and forth between languages (or varieties of the same language), even within the same utterance. This article reviews the major theoretical approaches that have been proposed to answer the question of why bilingual speakers choose to code switch.