• Refine Query
• Source
• Publication year
• to
• Language
• 27
• 13
• 13
• 5
• 3
• 1
• 1
• 1
• Tagged with
• 70
• 16
• 16
• 16
• 11
• 10
• 9
• 8
• 8
• 8
• 7
• 7
• 7
• 7
• 7
• The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

#### Computing leakage current distributions and determination of minimum leakage vectors for combinational designs

Gulati, Kanupriya 16 August 2006 (has links)
Analyzing circuit leakage and minimizing leakage during the standby mode of oper- ation of a circuit are important problems faced during contemporary circuit design. Analysis of the leakage profiles of an implementation would enable a designer to select between several implementations in a leakage optimal way. Once such an im- plementation is selected, minimizing leakage during standby operation (by finding the minimum leakage state over all input vector states) allows further power reduc- tions. However, both these problems are NP-hard. Since leakage power is currently approaching about half the total circuit power, these two problems are of prime rel- evance. This thesis addresses these NP-hard problems. An Algebraic Decision Diagram (ADD) based approach to determine and implicitly represent the leakage value for all input vectors of a combinational circuit is presented. In its exact form, this technique can compute the leakage value of each input vector, by storing these leakage values implicitly in an ADD structure. To broaden the applicability of this technique, an approximate version of the algorithm is presented as well. The approximation is done by limiting the total number of discriminant nodes in any ADD. It is experimentally demonstrated that these approximate techniques produce results with quantifiable errors. In particular, it is shown that limiting the number of discriminants to a value between 12 and 16 is practical, allowing for good accuracy and lowered memory utilization. In addition, a heuristic approach to determine the input vector which minimizes leakage for a combinational design is presented. Approximate signal probabilities of internal nodes are used as a guide in finding the minimum leakage vector. Probabilistic heuristics are used to select the next gate to be processed, as well as to select the best state of the selected gate. A fast satisfiability solver is employed to ensure the consistency of the assignments that are made in this process. Experimental results indicate that this method has very low run-times, with excellent accuracy, compared to existing approaches.
2

#### Fast Discovery of Illegal State Cubes for Sequential Equivalence Checking

Hanle, Donald 12 May 2011 (has links)
Sequential Equivalence checking has been and still is a challenging problem. Verifying two circuits that are structurally different but logically the same is very important and has many applications. Critical to the success of sequential equivalence checking is the determination of a sufficient portion of illegal states such that the two designs are equivalent outside of the illegal states. This work proposes a low-cost method to discover a subset of the illegal state space of a circuit by simulating and grouping some state variables to determine if any missing patterns are present. This thesis discusses the selection of simulated inputs, the grouping of flip-flops and what the missing patterns represent. Then all missing patterns are considered which are illegal state cubes and represent and compact them using BDDs. A BDD implementation was created to compact these illegal states more efficiently. Discussion is then done on the parameters of the BDD implementation design which can be used more efficiently given the situation. These illegal state cubes are considered to be implications which can be used to constrain a SAT solver. Results are then presented which show how effective these constraints are to proving equivalency using the SAT solver. Finally, the future work is discussed of discovering the illegal state space either faster or more completely. / Master of Science
3

#### Méthodes de sous-domaines pour le système de Stokes / Substructuring methods for Stokes

Toulougoussou, Ange Barthélemy 19 December 2014 (has links)
L'objectif de cette thèse est de développer une méthode de décomposition de domaine pour la résolution du système de Stokes discrétisé avec les éléments finis mixtes stables où la pression est continue comme Hood-Taylor et Mini. La nouvelle méthode résulte dela combinaison de FETI qui est appliquée à la vitesse et de BDD qui est appliquée à la pression sans découpler les inconnues. Elle hérite et découple les projecteurs grossiers associés à FETI et à BDD. La méthodologie débouche sur un système linéaire symétrique,semi-défini positif que nous avons résolu par la méthode du gradient conjugué projeté préconditionné. La méthode contient deux préconditionneurs grossiers creux et des préconditionneurs locaux exacts qui assurent son extensibilié, sa robustesse et son efficacité. L'introduction de projecteurs locaux construits à partir des modes de pression des sousdomaines étend la méthode aux éléments finis mixtes discontinues en pression et rend le problème grossier de BDD facultatif même en présence de la pression aux interfaces.Nous avons aisément appliqué la méthode à l'élasticité incompressible et quasi-incompressible et elle peut s'étendre de la même façon au cadre plus général des systèmes de point-selle issus des problèmes de minimisation sous contraintes grâce à sa nature algébrique. / The purpose of this thesis is to develop a domain decomposition method suitable tosolve the Stokes system discretized with stable mixte finite elements where pressure is continuous such as Hood-Taylor and Mini. The new method arises from the combinaison of FETI applied to the velocity and BDD applied to the pressure without decoupling the unknowns. It inherits and decouples the coarse projectors included in FETI and BDD. The methodology leads to a symmetric, positive semi-definite linear system that we solveby projected preconditioned conjugate gradient. The method contains two sparse coarse preconditionners and exact local preconditionners that ensure its scalability, its robustness and its efficiency. We use local projectors constructed from the constant pressure modes of the subdomains that enable an extension to mixte finite elements with discontinuous pressure and that make the coarse problem of BDD optional even in the presence of pressure on the interfaces. We have easily applied the method to incompressibleand almost incompressible elasticity and it can be extended the same way to other saddle-point systems arising from minimization problems under constraints due to its algebraic property.
4

#### Remoção eletroquímica dos inseticidas organofosforados metil paration e clorpirifós utilizando eletrodos de diamante dopado com boro / Electrochemical removal of organophosphates insecticides methyl parathion and clorpyrifos using boron-doped diamond electrodes

Suellen Aparecida Alves 13 August 2014 (has links)
5

#### Application of Decision Diagrams for Information Storage and Retrieval

Komaragiri, Vivek Chakravarthy 11 May 2002 (has links)
Technology is improving at an amazing pace and one reason for this advancement is because of unprecedented growth in the field of Information Technology and also in Digital Integrated Circuit technology over the past few decades. The size of a typical modern database is in the order of high ends of gigabytes and even terabytes. Researchers were successful in designing complex databases but there is still lot of activity on effectively making use of this stored information. There have been significant advancements in the field of "Logic optimization" and also in "Information storage and retrieval" but there has been very little transfer of these methods. The purpose of this study is to investigate the use of powerful Computer Aided Design (CAD) techniques for efficient information storage and retrieval. In the work presented in this thesis, it is shown that Decision Diagrams can be used for efficient data storage and information retrieval. An efficient technique is proposed for each of the two key areas of research in Database systems known as "Query Optimization" and "Datamining". Encouraging results are obtained indicating that using hardware techniques for information processing can be a new approach for solving these problems. An SQL query is represented using a hardware data structure known as an AND/OR graph and an SQL parser is interfaced with AND/OR package to achieve query optimization. Optimization using AND/OR graphs works only in the Boolean domain and to make the process of query optimization more complete it has to be investigated in Multivalued domain. The possibility of using MDD as a data structure to represent the query in the multi valued domain is discussed and a synthesis technique is developed to synthesize Multi Valued Logic Networks using MDD. Another useful data structure known as BDD can be used to store the large transaction files used in datamining applications very effectively.
6

#### Disordered Eating Behavior Among United States Military Personnel

Ferrell, Emily Lauren 03 May 2019 (has links)
No description available.
7

#### Satisfiability Advancements Enabled by State Machines

Weaver, Sean A. January 2012 (has links)
No description available.
8

#### Em direção a um ambiente de desenvolvimento de software orientado por comportamento

BARBOSA NETO, Alvaro Magnum 22 May 2015 (has links)
9