Note:

No description available.

No description available.

No description available.

The purpose of this study was to determine the linear accelerations, angular rates, and angular accelerations of the center of gravity of the head during daily activities and to determine the effect of angular terms on the linear accelerations. A total of 700 experiments were conducted with 18 subjects performing 13 different tasks. Resultant maxima were 93.6 m/s² for linear acceleration, 931.3 rad/s for angular acceleration and 9.03 rad/s for angular rate. Comparisons by gender were statistically significant in 21.9% of cases. Qualitatively, subject effort appeared to be the most important factor. Average error was strongly influenced by the type of motion in each event, ranging from -3.1% to 115.2% when converting from mouthpiece resultant accelerations to center of gravity acceleration. Error increases as angular rates and accelerations increase. Mouthpiece array accelerations are statistically significantly different than center of gravity accelerations in 86.3% of comparisons. Array designs from the literature are significantly different than center of gravity accelerations with equal frequency to the mouthpiece. Peak accelerations from Allen et al 1994 may require correction of up to 2G and 80% to obtain center of gravity accelerations. Angular terms must be accounted for even at daily activity levels. / Master of Science

This thesis is an exploration of relationships made between angular elements for the purpose of discovering the spatial results that those explorations create. The media used to develop this thesis are two dimensional linear compositions, three dimensional modeling, and photography. / Master of Architecture

No description available.

This paper investigates the cost-tradeoffs of implementing a test data compression technique previously presented in [Lee 06] which uses a small non-linear decoder combined with a linear decompressor to achieve greater test data compressions. The non-linear decoder is a sequential non-linear decompressor that exploits bit-wise and pattern-wise correlations in test vectors. This paper further emphasizes the design and implementation side of the proposed test data compressor. The linear decompressor used in this design is a Linear Feedback Shift Register (LFSR) which after choosing the right seed has the ability to produce the correct care bit values while filling the don’t care value bits with pseudo-random values. Experimental results show that using the presented compression scheme here significantly improves the overall compression. Area and power results are presented for the experiments carried out on the given design. / text

Orientador: Alexandre César Rodrigues da Silva / Banca: Luis Antonio F. de Oliveira / Banca: Marcos Aurélio Batista / Resumo: A geração eficiente de implicantes primos é um fator importante na fase de cobertura dos mintermos em métodos de minimização de funções booleanas. Este trabalho apresenta uma versão aprimorada do método denominado de Clause-Column Table, utilizado na geração de implicantes primos. Neste novo algoritmo adicionou-se o teorema da adjacência e um novo critério de parada. Estas modificações evitaram a geração de termos nulos e iterações desnecessárias que ocorriam no algoritmo original. O algoritmo original e o aprimorado foram implementados em linguagem C e comparados. O método Clause-Column Table Aprimorado também foi comparado com o método Quine-McCluskey e Expander. Os resultados comprovaram que a versão aprimorada gera menos iterações que a versão original, e que na maioria das funções analisadas evitou-se a geração de termos nulos. Ao comparar com o método de Quine-McCluskey e o Expander comprovou-se que o método Clause-Column Table Aprimorado é superior na geração dos implicantes primos, pois em alguns casos elimina aqueles que não são necessários para a cobertura da função. De posse dos implicantes primos o problema de cobertura dos mintermos foi formulado como um problema de programação linear inteira 0 e 1, em que a solução se abre a todos os avanços ocorridos na área de programação linear visando a obtenção de uma solução mínima / Abstract: Efficient generation of prime implicants is an important factor in the coverage phase of minterms in minimization's methods of Boolean functions. This research presents an improved version of the method called Clause-Column Table, used to generate prime implicants. In this new algorithm was added to the adjacency theorem and a new stopping criterion. These modifications prevented the generation of null terms and unnecessary iterations that occurred in the original algorithm. The original and improved algorithms were implemented in C language and compared. The Clause-Column Table Improved method was compared with the Expander and Quine-McCluskey method. The results proved that the improved version generates fewer iterations than the original version, and that in most functions analyzed it was avoided the generation of null terms. Comparing Quine-McCluskey method and the Expander it was proved that the Clause-Column Table Enhanced method is superior in the generation of prime implicants, since in some cases eliminates those who are not required to cover the function. In ownership of the prime implicants the cover problem of minterms was formulated as an integer linear programming problem of 0 and 1, where the solution is open to all advances in the area of linear programming in order to obtain a minimal solution / Mestre

Orientador: Carina Alves / Banca: Marta Cilene Gadotti / Banca: Cintya Wink de Oliveira Benedito / Resumo: Este trabalho aborda conceitos básicos de Álgebra Linear e suas aplicações no desenvolvimento da Teoria de Códigos Corretores de Erros. O uso desta ferramenta matemática simpli ca a geração e a decodi cação dos códigos lineares. Destacamos também a importância de se trabalhar com este tema na educação básica / Abstract: The present work addresses basic concepts of Linear Algebra and its applications in the development of the Theory of Error Correcting Codes. The use of this mathematical tool simpli es the generation and decoding of linear codes. This dissertation also highlights the importance of working with this subject in high school / Mestre