<p>Kraven på dagens trådlösa förbindelser kommer hela tiden att öka och med detta följer även högre krav på nya produkter som kan tillgodose de ökade kraven. För att göra processen från idé till produkt snabbare krävs enkla verktyg för att snabbt kunna gå från den formulerade standarden till en hårdvaruprototyp. Detta arbete har använt sig av ett av dessa verktyg som idag finns tillgängliga, Xilinx System Generator for DSP 1.1, för att ta fram sändare och mottagare för en del av den trådlösa standarden IEEE 802.11a. Arbetet ger en beskrivning av hur sändare och mottagare är uppbyggda samt även synpunkter på System Generator och beskrivningar av problem som uppstod under arbetet. </p> / <p>The demands on todays wireless communications will continue to increase and with this follows a demand for shorter and shorter development times for the products that are going to satisfy this demand. To accomplish this shorter development time simple tools for going from the formulated standard to a hardware prototype is needed. This work uses one of these tools today available, Xilinx System Generator for DSP 1.1, to develop a transmitter and a reciever for a part of the wireless standard IEEE 802.11a. The work gives a description of the building blocks of the transmitter and the reciever but also some views on System Generator and descriptions of problems that were encountered during the work.</p>

An interactive narrative is a form of digital entertainment in which players can create or influence a dramatic storyline through actions, typically by assuming the role of a character in a fictional virtual world. The interactive narrative systems usually employ a drama manager (DM), an omniscient background agent that monitors the fictional world and determines what will happen next in the players' story experience. Prevailing approaches to drama management choose successive story plot points based on a set of criteria given by the game designers. In other words, the DM is a surrogate for the game designers. In this dissertation, I create a data-driven personalized drama manager that takes into consideration players' preferences. The personalized drama manager is capable of (1) modeling the players' preference over successive plot points from the players' feedback; (2) guiding the players towards selected plot points without sacrificing players' agency; (3) choosing target successive plot points that simultaneously increase the player's story preference ratings and the probability of the players selecting the plot points. To address the first problem, I develop a collaborative filtering algorithm that takes into account the specific sequence (or history) of experienced plot points when modeling players' preferences for future plot points. Unlike the traditional collaborative filtering algorithms that make one-shot recommendations of complete story artifacts (e.g., books, movies), the collaborative filtering algorithm I develop is a sequential recommendation algorithm that makes every successive recommendation based on all previous recommendations. To address the second problem, I create a multi-option branching story graph that allows multiple options to point to each plot point. The personalized DM working in the multi-option branching story graph can influence the players to make choices that coincide with the trajectories selected by the DM, while gives the players the full agency to make any selection that leads to any plot point in their own judgement. To address the third problem, the personalized DM models the probability that the players transitioning to each full-length stories and selects target stories that achieve the highest expected preference ratings at every branching point in the story space. The personalized DM is implemented in an interactive narrative system built with choose-your-own-adventure stories. Human study results show that the personalized DM can achieve significantly higher preference ratings than non-personalized DMs or DMs with pre-defined player types, while preserve the players' sense of agency.

This thesis focuses on the logical design of binary adders. It covers topics extending from cardinal numbers to carry skip optimization. The conventional adder designs are described in detail, including: carry completion, ripple carry, carry select, carry skip, conditional sum, and carry lookahead. We show that the method of parallel prefix analysis can be used to unify the conventional adder designs under one parameterized model. The parallel prefix model also produces other useful configurations, and can be used with carry operator variations that are associative. Parallel prefix adder parameters include group sizes, tree shape, and device sizes. We also introduce a general algorithm for group size optimization. Code for this algorithm is available on the World Wide Web. Finally, the thesis shows the derivation for some carry operator variations including those originally given by Majerski and Ling. / text

Made available in DSpace on 2014-06-11T19:32:47Z (GMT). No. of bitstreams: 0 Previous issue date: 2006Bitstream added on 2014-06-13T20:04:16Z : No. of bitstreams: 1 silva_lcc_dr_ararafcl.pdf: 920427 bytes, checksum: 9c06cb746295d749e8021e454512da12 (MD5) / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / A derivação é apresentada pelas gramáticas tradicionais como uma lista de prefixos e sufixos, divididos em gregos e latinos, com seus significados e acompanhados de exemplos. Com essa limitação no estudo da derivação, não são apresentadas as possíveis combinações das unidades lexicais com os prefixos, nem tampouco é admitido que, para se formar um derivado prefixado, é preciso que a base a que se junta o prefixo aceite a significação que lhe será impressa. Outra falha ocorre nos dicionários que se limitam a definir as entradas lexicais não contextualizadas dificultando o entendimento do significado da unidade derivada, pois nem sempre é possível entender sua formação visto que o prefixo pode admitir significados diferentes e somente o contexto pode precisar esse significado. Desta forma, o processo de formação de palavras tradicionalmente atrbuído à morfologia deve envolver também outros níveis da língua: sintaxe, semântica e pragmática. Uma vez considerados esses níveis é possível estabelecer paradigmas que sistematizem a formação de palavras considerando o significado do derivado contextualizando e os semas contidos na base. Este trabalho teve como objetivo identificar o paradigma derivacional dos verbos formados por prefixos latinos de movimento, o tipo de base a que se anexam os prefixos, as classes gramticais que entram na formação do derivado e o dignificado contextual do prefixo na unidade lexical analisando o valor semântico do derivado, bem como as interferências pragmáticas. Cnclui-se que, analisando o derivado sob a perspectiva morfológica, semântica, sintática e pragmática, é possível estabelecer um paradigma do sistema prefixal da língua considerando o aspecto diacrônico dos prefixos, os semas das unidades lexicais, agrupando as unidades que apresentam semas comuns e o comportamento pragmético da unidade derivada. / The derivation is presented by the traditional grammars as a list of prefixes and suffices, divided into Greek and Latin, with their meanings and accompained by examples. With this limitation in the study of the derivation, possible combinations of the lexical units with the prefixes are not presented. In addition, it is not admitted that, in order to from a derived prefix it is necessary that the base to which the prefix joins, accepts its new signification. Another failure occurs in dictionaries that only define the non-contextualized lexical entries, making it difficult to understand the meaning of the derived unit, as it is not always possible to undestand its formation, since the prefix can admit different meanings and only the context may clarify this meaning. Therefore, the formation process of words, traditionally ascribed to morphology, may also involve other levels of the language: syntax, semantics and pragmatics. Once considered these sectors, it is possible to establish that systematize the formation of words, considering the meaning of the contextualized derived and the semes contaimed in the base. This paper has had the aim to identiflay the derivational paradigm of the verbs formed by Latin prefixes of movement, the kind of base to which the prefixes attach, the grammatical classes that enter in the formation of the derived and the contextual meaning of the prefix in the lexical unit, analyzing the semantic value of the derived, as well as the pragmatic interferences. It was concluded that, analysing the derived under the morphological, semantic, and pragmatic perspectives, it is possoble to establish a paradigm of the prefix system of the language considering the diachronic aspect of the prefixes, the semes of the lexical units, joing the units that present common semes and the pragmatic behavior of the derived unit.

Presented thesis deals with the word-formation processes involved in creating new verbs in presen-day Italian. These processes are mainly derivational, namely prefixation, suffixation, conversion, including parasynthesis and back-formation, these two create mostly verbs. Compound verbs are rare in Italian and the number of verbal loanwords is low as well. The first part of the thesis describes these processes from theoretical point of view. The second part presents the descriptive analysis of 330 verbs created between 1976-2001. These verbs were extracted from the eletronic version of Dizionario Italiano Sabatini-Coletti and they were categorized by the process involved in their creation. The productivity of each process and then affixes was also studied.

This work from the field of pragmatics introduces the application of the concept of speech acts (see J. L. Austin, J. Searle) to the literary sample of 15 chosen dialogues i.e. 1122 sentences from the novel Pride and Prejudice by the classical English author Jane Austen. It introduces an eight-member modified classification of speech acts: representatives, assertives, directives, connissives, expressives, interrogatives, requestives and daclarations. There are eight literary characters included in the research together with marginally Charlotte Lucas, who use speech acts to express their communicative intentions. The main heroine Elizabeth occurring in 12 dialogues uses mostly representatives, assertives and expressives. The remaining three dialogues involve Mrs Bennet and her husband Mr Bennet. Jane Austen's language is very rich and complex, with frequent occurrence of politeness turns of phrase. Some mixed and multiple categories also add to this complexity (there are 55.8% of simple ones; 39.1% of double, 4.6% of triple, quadruple only 0.5 % of the 969 sentences counted). This work also contains some comments on stylistic analysis featuring selected interesting literary and pragmatic aspects of the dialogical samples.

This master thesis deals with testing network prefix translation algorithm in IPv6. It tests existing implementation. This implementations are compared with each other. Some implementations end with error compilation. There are two options how to deal with this problem, it might be repaired or the port to the new kernel is created. Performance is tested with Spirent hardware packet generator.

The speed of computer network is increasing. One of the basic tasks which has to be solved by the network devices is longest prefix match. Many algorithms are able to solve this task but it's necessary to solve it very fast because of increasing transfer speed and the routing standard IPv6. This standard has longer addresses and it's necessary to search prefixes in much bigger sets. The thesis describes present algorithms that solve the problem. These are confronted with new algorithm HashTreeBitmap which is also described in the work. On the tests is documented that this algorithm is able to cope with high demands which are placed on it.

With the ever growing forwarding tables of the internet and the large amount of traffic that flows through them, efficient algorithms to handle search are needed. One of these algorithms is the Multibit trie (prefix tree). The Multibit trie is a search trie that looks at several bits at a time, which is called a stride, to reduce the memory accesses for the algorithm. It is assumed that the trade-off for this is that the memory consumption will increase. To test this claim an implementation in python was written and two data sets with different sizes were used to build the Multibit trie. The two data sets that were used was the NY and the MAE-WEST data set. Search tests for different stride values were performed on the two data sets to get measurement of the average amount of memory accesses and the number of nodes were measured on different stride values. The results were that stride values 2 and 3 had less average memory accesses and less nodes than stride value 1. Stride value 6 had a significantly larger increase in nodes compared to its smaller stride values. It was concluded that stride value 2 and 3 did not follow the claim that the memory consumption does increase with larger stride values for these data sets. On these two data set no benefit was found for using stride value 1 compared to stride value 2 and 3. Furthermore stride value 6 was found to have a large increase in memory consumption for a minimal decrease in memory accesses.

With the availability of large main memory capacities, in-memory index structures have become an important component of modern data management platforms. Current research even suggests index-based query processing as an alternative or supplement for traditional tuple-at-a-time processing models. However, while simple sequential scan operations can fully exploit the high bandwidth provided by main memory, indexes are mainly latency bound and spend most of their time waiting for memory accesses. Considering current hardware trends, the problem of high memory latency is further exacerbated as modern shared-memory multiprocessors with non-uniform memory access (NUMA) become increasingly common. On those NUMA platforms, the execution time of index operations is dominated by memory access latency that increases dramatically when accessing memory on remote sockets. Therefore, good index performance can only be achieved through careful optimization of the index structure to the given topology. BUZZARD is a NUMA-aware in-memory indexing system. Using adaptive data partitioning techniques, BUZZARD distributes a prefix-tree-based index across the NUMA system and hands off incoming requests to worker threads located on each partition's respective NUMA node. This approach reduces the number of remote memory accesses to a minimum and improves cache utilization. In addition, all indexes inside BUZZARD are only accessed by their respective owner, eliminating the need for synchronization primitives like compare-and-swap.