No description available.

The reliable construction of VLSI integrated circuits (ICs) requires that the ICs be tested after fabrication. An alternative to performing external testing is to create ICs that can test themselves with a built-in self-test (BIST) mode. Unfortunately the problem of embedding a self-test operating mode to the functional design is difficult for two reasons. (1) The creation of test sets that effectively test digital circuits requires the solution of several intractable problems. (2) The hardware resources dedicated to self-test are usually constrained. Modifications to the Logic III hardware description language and a new computer-aided design (CAD) tool, 1g3, are presented in this dissertation as an environment that allows BIST embedding to be created and evaluated. The major premise behind this work is that BIST design can be treated in a similar fashion as functional design, and that the designer can address the constraints of a BIST mode at the same time as the functional constraints. The modified language, called Logic III(UVic), allows BIST embeddings to be specified by an embedding module which describes how the circuit's memory elements are realized. This dissertation presents a library of embedding modules that realize several of the most common BIST architectures. Case studies using this environment are presented for an ALU, CORDIC, GCD, and string matching circuits. A BIST mode with almost 100% single stuck-at fault coverage is realized for each circuit. This shows that the CAD environment can be used to create self-testing circuits. In addition to aiding users in embedding BIST functionality, the 1g3 tool can be used to evaluate specific BIST architectures. Properties of BIST test pattern generators are presented that are used in analyzing the effectiveness of the generators for delay-fault testing. A novel approach based on creating a deterministic finite automaton that recognizes the fault-free responses is presented. / Graduate

Orientador: Plamen Emilov Kochloukov / Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica / Made available in DSpace on 2018-08-10T10:59:05Z (GMT). No. of bitstreams: 1 SantuloJunior_EdneiAparecido_D.pdf: 675335 bytes, checksum: ff19aaa47432de596122e88eeede9a05 (MD5) Previous issue date: 2007 / Resumo: Kemer classificou, a menos de PI-equivalência, todas as álgebras T-primas no caso de caracterísitica zero e, em seu importante Teorema sobre o Produto Tensorial (TPT), demonstrou que o produto tensorial entre duas álgebras T-primas (ainda sobre corpos de característica zero) resulta igualmente numa álgebra T-prima. Neste trabalho é fornecida uma generalização para o último caso do TPT utilizando identidades graduadas. Além disso, é estudada a existência de mergulhos nas álgebras que aparecem no TPT. Mais especificamente, são encontradas condições necessárias e suficientes para a existência de um mergulho graduado de uma álgebra que satisfaz todas as identidades graduadas da álgebra de matrizes cujas entradas pertencem à álgebra de Grassmann em uma álgebra de matrizes cujas entradas se encontram numa álgebra supercomutativa com unidade, quando todas essas álgebras são consideradas sobre corpos infinitos de característica diferente de dois. Por fim, são fornecidas bases de identidades graduadas para os T-ideais graduados da nésima potência tensorial da' álgebra de Grassmann, das álgebras de matrizes cuja ordem é uma potência de dois, e do produto tensorial de quaisquer duas dentre as álgebras previamente citadas. A partir destas deduz-se o TPT no caso em que a ordem das álgebras de matrizes é uma potência de dois / Abstract: Kemer classified, up to PI-equivalence, the T-prime algebras in the case of characteristic zero, and in his celebrated Tenso r Product Theorem (TPT) he showed that the tensor product of two T-prime algebras considered over a field of characteristic zero, is another T-prime algebra. In this work, a generalization for the last case of the TPT is given using graded identities. The existence of embeddings into the algebras cited on the TPT is also studied. More specifically, necessary and sufficient conditions for the existence of a graded embedding of an algebra satisfying all graded polynomial identities for the matrix algebra with entries in the Grassmann algebra, into a matrix algebra with entries in a supercommutative algebra with unity are found when these algebras are taken over fields of characteristic different from two. Graded identities that generate the graded T-ideals of the n-th tensor power of the Grassmann algebra, of the matrix algebras cited in Kemer's TPT (whose order is a power of two) and of the tensor product between any two of those algebras are provided. As a consequence, Kemer's TPT is derived from those results in the special case when the order of the matrices in the matrix algebras under consideration, is a powers of two / Doutorado / Algebra / Doutor em Matemática

The fundamental theorem of algebra (FTA) is an important theorem in algebra. This theorem asserts that the complex field is algebracially closed. This thesis will include historical research of proofs of the fundamental theorem of algebra and provide information about the first proof given by Gauss of the theorem and the time when it was proved.

Many concrete problems, ranging from Portfolio selection to Water resource management, may be cast into a multiobjective programming framework. The simplistic way of superseding blindly conflictual goals by one objective function let no chance to the model but to churn out meaningless outcomes. Hence interest of discussing ways for tackling Multiobjective Programming Problems. More than this, in many real-life situations, uncertainty and imprecision are in the state of affairs. In this dissertation we discuss ways for solving Multiobjective Programming Problems with fixed and fuzzy coefficients. No preference, a priori, a posteriori, interactive and metaheuristic methods are discussed for the deterministic case. As far as the fuzzy case is concerned, two approaches based respectively on possibility measures and on Embedding Theorem for fuzzy numbers are described. A case study is also carried out for the sake of illustration. We end up with some concluding remarks along with lines for further development, in this field. / Operations Research / M. Sc. (Operations Research)

Many concrete problems, ranging from Portfolio selection to Water resource management, may be cast into a multiobjective programming framework. The simplistic way of superseding blindly conflictual goals by one objective function let no chance to the model but to churn out meaningless outcomes. Hence interest of discussing ways for tackling Multiobjective Programming Problems. More than this, in many real-life situations, uncertainty and imprecision are in the state of affairs. In this dissertation we discuss ways for solving Multiobjective Programming Problems with fixed and fuzzy coefficients. No preference, a priori, a posteriori, interactive and metaheuristic methods are discussed for the deterministic case. As far as the fuzzy case is concerned, two approaches based respectively on possibility measures and on Embedding Theorem for fuzzy numbers are described. A case study is also carried out for the sake of illustration. We end up with some concluding remarks along with lines for further development, in this field. / Operations Research / M. Sc. (Operations Research)