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 5029 for “"Schemes"”.
-
Border Basis Schemes
… the concepts and properties of border basis schemes. In Chapter 4 we transfer the smoothness criterion (see [Huib05]) for the point (0,...,0) in a Hilbert scheme of points to the monomial point of the border basis scheme by employing the tools from border basis theory. In Chapter 5 we explain …
-
Torsors over Simplicial Schemes
… of this theory of torsors over simplicial schemes. Finally, using the work of Vistoli, we prove that, working over the complex numbers, the map from the Chow groups of the etale classifying space of the projective linear group PGL_p to the Chow groups of the Nisnevich classifying space of …
-
Robust Updated MPC Schemes
… multistep MPC. We compare the MPC schemes and confirm our theoretical results through numerical examples. We also examine the control performance and computing complexity requirements of the schemes and analyze their potential and suitability to be implemented on embedded systems …
-
Fusions of association schemes
… by Bose and Mesner in 1959, association schemes have gained significant importance in algebraic combinatorics. An important breakthrough was achieved by Delsarte’s PhD thesis where he proved that many problems from coding theory, combinatorial design theory and statistics can be treated …
-
Davidson and Conceptual Schemes
… of the claim that there could be conceptual schemes which are different from our own. He argues that conceptual schemes different to our own must be untranslatable into our own language, and further that the idea of untranslatable languages does not make sense. By considering three variants …
-
Modeling urban energy supply schemes
… planners and designers evaluate and compare schemes to satisfy the electric, heating, and cooling demands of urban areas. Current simulation tools tend to focus on either the demand- or supply-side aspect of the energy challenges cities face. Additionally, these tools are often overly …
-
Thresholdizing lattice based encryption schemes
In this thesis, we examine a variety of constructions based on secret sharing techniques applied on lattice-based cryptographic primitives constructed from the learning with erros (LWE) assumption. Using secret sharing techniques from [BGG⁺17], we show how to construct paradigms of threshold …
-
Authentication Schemes' Impact on Working Memory
<p>Authentication is the process by which a computing system validates a user’s identity. Although this process is necessary for system security, users view authentication as a frequent disruption to their primary tasks. During this disruption, primary task information must be actively maintained …
-
Volumes of line bundles on schemes
… is always the case on generically reduced proper schemes over arbitrary fields. We show that volumes are limits in two classes of schemes that are not necessarily generically reduced: codimension one subschemes of projective varieties such that their components of maximal dimension contain normal …
-
Splitting schemes for nonlinear parabolic problems
… which all analyse different aspects of splitting schemes when applied to nonlinear parabolic problems. These numerical methods are frequently used when a problem has a natural decomposition into two or more parts, as the computational cost may then be significantly decreased compared to other …
-
On the Witt groups of schemes
… consider two questions about the Witt groups of schemes: the first is the question of finite generation of the shifted Witt groups of a smooth variety over a finite field; the second is the Gersten conjecture. Regarding the first, we prove that the shifted Witt groups of curves and surfaces are …
-
Classification of Ideal Secret Sharing Schemes
Secret sharing schemes were introduced independently by Shamir and Blakley in 1979 and are now widely used in many cryptographic protocols. They are ideal for storing information that is highly sensitive and highly important. In a secret sharing scheme, each user is given a piece of information …
-
Hyper-Kaehler fibrations and Hilbert schemes
In this thesis, I consider hyper-Kähler manifolds of complex dimension 4 which are fibrations. It is known that the fibers are abelian varieties and the base is P2. We assume that the general fiber is isomorphic to a product of two elliptic curves. We are able to relate this class of hyper-Kähler …
-
Labeling Schemes for Improving Cilksan Performance
… optimization. In this thesis, I propose labeling schemes as a method of circumventing many of the expensive operations in Cilksan, an implementation of the SP-bags algorithm. The proposed labeling schemes give strands of a parallel program labels during the execution of Cilksan, allowing Cilksan …
-
Evaluation of somewhat homomorphic encryption schemes
… research focus in fully homomorphic encryption schemes, many real-world applications require a scheme to be only "somewhat" homomorphic. Somewhat homomorphic encryption (SWHE) schemes, which support a limited number of homomorphic operations before encountering a decryption failure, are much …
-
Voter verifiability in homomorphic election schemes
… David Chaum and Andrew Neff have proposed mixnet schemes that do provide this assurance, but little research has been done that combines voter verification with homomorphic encryption. This thesis proposes adding voter verification to an existing multi-candidate election scheme (Baudron et al.) …
-
Parallel computation : synchronization, scheduling, and schemes.
Thesis. 1979. Ph.D.--Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Page 1 of 252