No description available.

No description available.

No description available.

The Composite design pattern is commonly employed in object-oriented languages to design a system of objects that form a part-whole hierarchical structure with composite objects formed out of primitive objects. The client does not differentiate between a composite object and a primitive object. The composite hierarchy effectively forms a tree-like hierarchical grouping of objects. From a software engineering perspective, there are at least two problems with the Composite pattern. First, it does not maintain a separation of concerns between the structure of the objects in a system and the objects themselves. The objects that comprise the system contain information about their relationship to other objects. This limits the ability of programmers to reuse the system's structural information. Secondly, there is no mechanism for encapsulating the system as a whole. This makes it difficult to specify and reason about global system properties. This thesis presents two tree components that can be used as alternatives to the Composite design pattern in systems that are traditionally implemented with the pattern. Both components are data structures that can contain arbitrary objects and maintain the structure of those objects as an ordered-tree. Since the components encapsulate only the tree structure, they only need to be specified and verified once, and they are available for black-box reuse. The first component is a traversable tree that maintains a conceptual "cursor" position. Methods are provided for inserting and removing objects at the cursor position, and for moving the cursor throughout the tree. The second component extends the traversable tree. A formal specification for each tree component is presented in the Tako language — a Java-like language with alias avoidance that is designed to facilitate specification and verification. A case study is presented that shows how the indexed tree can be used and reasoned about in an application — a text-based adventure game. Finally, a similar application is developed in Java, once using the composite pattern and once using the indexed tree data structure, and object-oriented metrics are given for both systems. / Master of Science

[pt] Este trabalho analisa os Fundos Referenciados ao Dólar no Brasil no período de julho/2000 a junho/2001. Foram especificamente selecionados os fundos disponíveis ao público de varejo. Dentro do tema tratado, foi discutida a questão do cupom cambial brasileiro e das suas variações nos negócios realizados com os ativos disponíveis no mercado - o cupom - sujo - e o cupom - limpo -. O principal objetivo da pesquisa foi o de identificar diferentes grupamentos na população dos fundos estudada. Para tanto, foram analisados os aspectos variáveis mercadológicas e variáveis financeiras para cada fundo. Dentre as variáveis mercadológicas foram tratadas taxa de administração, requisitos de aplicação mínima inicial, patrimônio líquido, regime de negociação de cotas e tipo de cota.No que diz respeito às variáveis financeiras foram identificados e avaliados o benchmark, as relações de desempenho através do Índice de Sharpe e Retorno Diferencial sobre o Sigma e foram feitas comparações entre os indicadores de retorno e risco das cotas em dólar com o cenário do cupom de mercado no período. / [en] The object of this study were the Investment Funds Indexed to the Dollar available to the general investor in the Brazilian market, from July/2000 to June/2001. In order to analyse their behaviour, the study discussed the theoretical background of the return rate curve for dollar related assets in Brazil and how it impacts their negotiations, by producing two different terms - the -clean- rate and the -dirty- rate. The main goal of the research was to find out if the funds could be separated into different clusters. In order to achieve this, two different aspects of the funds were studied - marketing and financial. Their marketing characteristics dealt with fees, minimum investment requirements, relevant day for the NAVPS and NAVPS availability. The financial characteristics were approached by their return and risk, benchmark and performance index analysis - thru the Sharpe Index and the Differential Return over the Sigma. The return and risk obtained for the funds were also compared to the return and risk observed in the domestic curve of the Brazilian risk up to 720 days.

A busca de palavras em uma grande coleção de documentos é um problema muito recorrente nos dias de hoje, como a própria utilização dos conhecidos \"motores de busca\" revela. Para que as buscas sejam realizadas em tempo que independa do tamanho da coleção, é necessário que a coleção seja indexada uma única vez. O tamanho destes índices é tipicamente linear no tamanho da coleção de documentos. A compressão de dados é outro recurso bastante utilizado para lidar com o tamanho sempre crescente da coleção de documentos. A intenção deste estudo é aliar a indexação utilizada nas buscas à compressão de dados, verificando alternativas às soluções já propostas e visando melhorias no tempo de resposta das buscas e no consumo de memória utilizada nos índices. A análise das estruturas de índice com os algoritmos de compressão mostra que arquivo invertido por blocos em conjuntos com compressão Huffman por palavras é uma ótima opção para sistemas com restrição de consumo de memória, pois proporciona acesso aleatório e busca comprimida. Neste trabalho também são propostas novas codificações livres de prefixo a fim de melhorar a compressão obtida e capaz de gerar códigos auto-sincronizados, ou seja, com acesso aleatório realmente viável. A vantagem destas novas codificações é que elas eliminam a necessidade de gerar a árvore de codificação Huffman através dos mapeamentos propostos, o que se traduz em economia de memória, codificação mais compacta e menor tempo de processamento. Os resultados obtidos mostram redução de 7% e 9% do tamanho dos arquivos comprimidos com tempos de compressão e descompressão melhores e menor consumo de memória. / Pattern matching over a big document collection is a very recurrent problem nowadays, as the growing use of the search engines reveal. In order to accomplish the search in a period of time independent from the collection size, it is necessary to index the collecion only one time. The index size is typically linear in the size of document collection. Data compression is another powerful resource to manage the ever growing size of the document collection. The objective in this assignment is to ally the indexed search to data compression, verifying alternatives to the current solutions, seeking improvement in search time and memory usage. The analysis on the index structures and compression algorithms indicates that joining the block inverted les with Huffman word-based compression is an interesting solution because it provides random access and compressed search. New prefix free codes are proposed in this assignment in order to enhance the compression and facilitate the generation of self-sinchronized codes, furthermore, with a truly viable random access. The advantage in this new codes is that they eliminate the need of generating the Huffman-code tree through the proposed mappings, which stands for economy of memory, compact encoding and shorter processing time. The results demonstrate gains of 7% and 9% in the compressed le size, with better compression and decompression times and lower memory consumption.

In this paper we introduce a new class library to model transformations of parallel algorithms. SYMPAD serves as a basis to develop automated tools and methods to generate efficient implementations of such algorithms. The paper gives an overview over the general structure, as well as features of the library. We further describe the fundamental design process that is controlled by our developed methods.

A busca de palavras em uma grande coleção de documentos é um problema muito recorrente nos dias de hoje, como a própria utilização dos conhecidos \"motores de busca\" revela. Para que as buscas sejam realizadas em tempo que independa do tamanho da coleção, é necessário que a coleção seja indexada uma única vez. O tamanho destes índices é tipicamente linear no tamanho da coleção de documentos. A compressão de dados é outro recurso bastante utilizado para lidar com o tamanho sempre crescente da coleção de documentos. A intenção deste estudo é aliar a indexação utilizada nas buscas à compressão de dados, verificando alternativas às soluções já propostas e visando melhorias no tempo de resposta das buscas e no consumo de memória utilizada nos índices. A análise das estruturas de índice com os algoritmos de compressão mostra que arquivo invertido por blocos em conjuntos com compressão Huffman por palavras é uma ótima opção para sistemas com restrição de consumo de memória, pois proporciona acesso aleatório e busca comprimida. Neste trabalho também são propostas novas codificações livres de prefixo a fim de melhorar a compressão obtida e capaz de gerar códigos auto-sincronizados, ou seja, com acesso aleatório realmente viável. A vantagem destas novas codificações é que elas eliminam a necessidade de gerar a árvore de codificação Huffman através dos mapeamentos propostos, o que se traduz em economia de memória, codificação mais compacta e menor tempo de processamento. Os resultados obtidos mostram redução de 7% e 9% do tamanho dos arquivos comprimidos com tempos de compressão e descompressão melhores e menor consumo de memória. / Pattern matching over a big document collection is a very recurrent problem nowadays, as the growing use of the search engines reveal. In order to accomplish the search in a period of time independent from the collection size, it is necessary to index the collecion only one time. The index size is typically linear in the size of document collection. Data compression is another powerful resource to manage the ever growing size of the document collection. The objective in this assignment is to ally the indexed search to data compression, verifying alternatives to the current solutions, seeking improvement in search time and memory usage. The analysis on the index structures and compression algorithms indicates that joining the block inverted les with Huffman word-based compression is an interesting solution because it provides random access and compressed search. New prefix free codes are proposed in this assignment in order to enhance the compression and facilitate the generation of self-sinchronized codes, furthermore, with a truly viable random access. The advantage in this new codes is that they eliminate the need of generating the Huffman-code tree through the proposed mappings, which stands for economy of memory, compact encoding and shorter processing time. The results demonstrate gains of 7% and 9% in the compressed le size, with better compression and decompression times and lower memory consumption.

This thesis presents performance evaluation and a field validation study of a time and temperature indexed autoregressive with exogenous (4-3-5 ARX) building thermal load prediction model with an aim to integrate the model with actual predictive control systems. The 4-3-5 ARX model is very simple and computationally efficient with relatively high prediction accuracy compared to the existing sophisticated prediction models, such as artificial neural network prediction models. However, performance evaluation and field validation of the model are essential steps before implementing the model in actual practice. The performance of the model was evaluated under different climate conditions as well as under modeling uncertainty. A field validation study was carried out for three buildings at Mississippi State University. The results demonstrate that the 4-3-5 ARX model can predict building thermal loads in an accurate manner most of the times, indicating that the model can be readily implemented in predictive control systems.

Compte tenu de la forte croissance du trafic aérien aussi bien dans les pays émergents que dans les pays développés soutenue durant ces dernières décennies, la satisfaction des exigences relatives à la sécurité et à l’environnement nécessite le développement de nouveaux systèmes de guidage. L’objectif principal de cette thèse est de contribuer à la synthèse d’une nouvelle génération de lois de guidage pour les avions de transport présentant de meilleures performances en terme de suivi de trajectoire. Il s’agit en particulier d’évaluer la faisabilité et les performances d’un système de guidage utilisant un référentiel spatial. Avant de présenter les principales approches utilisées pour le développement de lois de commande pour les systèmes de pilotage et de guidage automatiques et la génération de directives de guidage par le système de gestion du vol, la dynamique du vol d’un avion de transport est modélisée en prenant en compte d’une manière explicite les composantes du vent. Ensuite, l’intérêt de l’application de la commande adaptative dans le domaine de la conduite automatique du vol est discuté et une loi de commande adaptative pour le suivi de pente est proposée. Les principales techniques de commande non linéaires reconnues d’intérêt pour le suivi de trajectoire sont alors analysées. Finalement, une loi de commande référencée dans l’espace pour le guidage vertical d’un avion de transport est développée et est comparée avec l’approche temporelle classique. L’objectif est de réduire les erreurs de poursuite et mieux répondre aux contraintes de temps de passage en certains points de l’espace ainsi qu’à une possible contrainte de temps d’arrivée / Safety and environmental considerations in air transportation urge today for the development of new guidance systems with improved accuracy for spatial and temporal trajectory tracking.The main objectives of this thesis dissertation is to contribute to the synthesis of a new generation of nonlinear guidance control laws for transportation aircraft presenting enhanced trajectory tracking performances and to explore the feasibility and performances of a flight guidance system developed within a space-indexed reference with the aim of reducing tracking errors and ensuring the satisfaction of overfly time constraints as well as final arrival time constraint. Before presenting the main approaches for the design of control laws for autopilots and auto-guidance systems devoted to transport aircraft and the way current Flight Management Systems generates guidance directives, flight dynamics of transportation aircraft, including explicitly the wind components, are presented. Then, the interest for adaptive flight control is discussed and a self contained adaptive flight path tracking control for various flight conditions taking into account automatically the possible aerodynamic and thrust parametric changes is proposed. Then, the main recognized nonlinear control approaches suitable for trajectory tracking are analyzed. Finally an original vertical space-indexed guidance control law devoted to aircraft trajectory tracking is developed and compared with the classical time-indexed approach