Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 144 for “"Modulo"”.
-
Involutory matrices, modulo m
Given the prime power factorization of a positive integer m, a method for calculating the number of all distinct n x n - involutory matrices (mod m) is derived. This is done by first developing a method for the construction and enumeration of involutory matrices (mod P<sup>α</sup>), without …
-
Optimization Modulo Theories with OptiMathSAT
… and Automated Reasoning (AR), Satisfiability Modulo Theories (SMT) is an important discipline that allows for dealing with industrial-level decision problems. Optimization Modulo Theories (OMT) extends Satisfiability Modulo Theories with the ability to express, and optimize, objective …
-
Modulo Scheduling with isomorphic control transformations
This dissertation addresses the complexities involved with scheduling in the presence of conditional branches. This is a particularly important problem for processors that execute multiple operations per cycle and are not fully utilized by local scheduling techniques. Since conditional branches …
-
Security-by-Contract using Automata Modulo Theory
… thesis describes a formalism, called Automata Modulo Theory, that allows us to have model of what programs do in more precise details thus giving semantics to certification. Automata Modulo Theory allows us to define very expressive policies with infinite cases while keeping the task of …
-
Verification of Hybrid Systems using Satisfiability Modulo Theories
… of hybrid systems using Satisfiability Modulo Theories (SMT). SMT is an established technique that has been used successfully in many verification approaches, targeted for both hardware and software systems. The use of SMT to verify hybrid systems has been limited, due to the restricted …
-
Behavior of partition values modulo powers of primes
… are eventually self-similar when viewed reduced modulo powers of <italic>l</italic>, in effect generalizing Ramanujan's congruences for every power of every prime <italic>l &ge 5</italic>. Boylan and the author extend this work by closely examining the structure of modules of modular forms …
-
Modulo Scheduling for Control-Intensive General-Purpose Programs
… prior to scheduling improves the performance of modulo scheduled loops and is, in fact, necessary to allow modulo scheduling to surpass the performance of acyclic scheduling for control-intensive general-purpose programs. Modulo scheduling has the following advantages over the acyclic scheduling …
-
Group Representations Over Integers Modulo a Prime Power
Made available in DSpace on 2014-12-09T22:17:38Z (GMT). No. of bitstreams: 1 6801764.pdf: 1448098 bytes, checksum: 62f175e854b32519095eb27773c884de (MD5) Previous issue date: 1967
-
Strength reduction of integer division and modulo operations
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.
-
A study of homological invariants modulo an exact zero divisor
Let Q be a commutative local ring and R a quotient ring of Q by an ideal generated by an exact zero divisor. We use differential graded structures to describe a construction that produces a minimal free resolution of an R-module from the free resolution of the same module, considered as a Q-module, …
-
The Modulo: Bridging Community and Individuality in Multi-Family Housing
Modular construction, a method where building components are prefabricated off-site and then transported as completed modules, is generally employed to save time and cost in the building industry. Despite its default as a repetitive component, it holds potential to address both individuality and …
-
Uma heurística gulosa para Modulo Scheduling em arquiteturas reconfiguráveis em tempo de execução
Atualmente, a quantidade de dados gerados pelas aplicações vem crescendo mais rapidamente do que a lei de Moore. Arquiteturas reconfiguráveis de grão grosso também chamadas de CGRA (Coarse Grained Reconfigurable Architecture), tem sido propostas para tentar tratar esse grande fluxo de dados, …
-
Toward high-level synthesis of reliable circuits through low-cost modulo shadow datapaths
… in the mod-b space, where b is the base of our modulo residue, for each main computation. We leverage the binding and scheduling flexibility of high-level synthesis to detect control errors through diverse binding and minimize area cost through intelligent checkpoint scheduling and modulo-b …
-
Stochastic satisfiability modulo theories : a symbolic technique for the analysis of probabilistic hybrid systems
… Logik namens Stochastic Satisfiability Modulo Theories (SSMT) aufbauen. Aufgrund ihrer Ausdrucksstärke lässt sich die schrittbeschränkte Dynamik probabilistischer hybrider Systeme durch SSMT Formeln beschreiben. Um eine automatische Analyseprozedur zu erzielen, befasst sich ein …
-
Correlations of sequences modulo one and statistics of geometrical objects associated to visible points
… we study the topic of distribution of sequences modulo one. In particular, we look at the spacing distributions between members of rational valued sequences modulo one. We come up with examples of many such sequences which behave as randomly chosen numbers from the unit interval. These include …
-
Robust and reliable hardware accelerator design through high-level synthesis
… solution for post-deployment error detection is modulo-3 shadow datapaths: performing lightweight shadow computations in modulo-3 space for each main computation. We leverage the binding and scheduling flexibility of high-level synthesis to detect control errors through diverse binding and …
-
The Algorithmic Solution of Simultaneous Diophantine Equations
… method works by determining a set of solutions modulo a prime P, raising each of these solutions to a set of P solutions modulo p2, and then determining a solution modulo p6 for each of the solutions modulo p2. These solutions modulo p6 lie on a lattice which is then reduced using a suitable …
-
Contributions to Ramanujan's continued fractions, class invariants, partition identities and modular equations
… proof of Ramanujan's famous partition identity modulo 5 (see (1.1)). This proof is an improvement of W. N. Bailey's proof given in 1952. We also establish a new proof of Ramanujan's partition identity modulo 7.
-
Prime and Quasi-Prime Number Races
… numbers that are the product of two odd primes modulo 4. We then consider what ""percentage"" of the time that the residue class 1 leads the residue class 3 in this ""quasi-prime"" race modulo 4."
Page 1 of 8