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 18094 for “"explicit"”.
-
Explicit parallel programming
… and readability). A new language called Explicit Parallel Programming (EPP), attempts to provide this quality by separating the responsibility for the execution of run time actions from the responsibility for deciding the order in which they occur. The ordering of a parallel algorithm is …
-
Explicit data graph compilation
… research we develop the first compiler for an Explicit Data Graph Execution (EDGE) architecture and show how to solve the new challenge of compiling to a block-based architecture. In EDGE architectures, the compiler is responsible for partitioning the program into a sequence of structured …
-
Scala with Explicit Nulls
… to the Scala type system that makes nullability explicit in the types. This allows us to turn runtime errors into compile-time errors. I have implemented this design for explicit nulls as a fork of the Dotty (Scala 3) compiler. I evaluate the design by migrating a number of Scala libraries to use …
-
Explicit Multidimensional Solitary Waves
In this paper we construct explicit examples of solutions to certain nonlinear wave equations. These semilinear equations are the simplest equations known to possess localized solitary waves in more that one spatial dimension. We construct explicit localized standing wave solutions, which generate …
-
Probabilistic Explicit Topic Modeling
… thesis introduces two methods for probabilistic explicit topic modeling that address these issues: Latent Dirichlet Allocation with Static Topic-Word Distributions (LDA-STWD), and Explicit Dirichlet Allocation (EDA). LDA-STWD directly substitutes precomputed counts for LDA topic-word counts, …
-
Explicit results on primes
[Please see thesis for abstract.]
-
Explicit web search result diversification
… Based upon this premise, we propose xQuAD---Explicit Query Aspect Diversification, a novel probabilistic framework for search result diversification. In particular, the xQuAD framework naturally models several dimensions of the search result diversification problem in a principled yet …
-
Explicit Formulae and Trace Formulae
… by an observation of D. Hejhal, we show that the explicit formulae of A. Weil for sums over zeroes of Hecke L-functions, via the Maass-Selberg relation, occur in the continuous spectral terms in the Selberg trace formula over various number fields. In Part I, we discuss the relevant parts of the …
-
Topics in explicit number theory
… four chapters. In Chapters 2 and 3, we obtain explicit bounds for the number of non-trivial zeros of the Riemann zeta function and Dedekind zeta functions, which improve previous results of Trudgian. This improvement is based on ideas from previous works of Bennett et al., Kadiri and Ng and …
-
Explicit characterization of bandgap references
… Conspicuously absent in the literature are explicit relationships between the output voltage and temperature of bandgap references. Temperature characteristics of bipolar junction transistors (BJT's) are developed to explicitly characterize the I-V relationship of BJT's. Based on this …
-
FOND planning via explicit search
… the existing works presents a FOND planner that explicitly searches a space of policies to find a solution policy. In this thesis, we present a range of contributions for FOND planning: (1) an A*-based search algorithm for FOND planning, which we call A* with Non-Determinism (AND* for short) that …
-
Explicit Mertens' theorems for number fields
… 1.1.3. The most important ingredient is an explicit estimate for the ideal-counting function. This explicit estimate is of independent interest too, because it generalises the widely useful floor function into the number fields setting. Therefore, we update the latest explicit estimate for …
-
Explicit two-source extractors and more
… of the main contributions of this thesis is an explicit 2-source extractor for min-entropy log^C n, for some constant C. Other results in this thesis include improved ways of extracting random bits from various other sources of randomness, as well as stronger notions of randomness extraction. …
-
An explicit description of Pieri inclusions.
… studied by Weyman in his thesis and described explicitly by Olver. More recently, these maps have appeared in the work of Eisenbud, Fløstad, and Weyman and of Sam and Weyman to compute pure free resolutions for classical groups. We give a new closed form, non-recursive description of Pieri …
-
Dynamic explicit surface meshes and applications
Explicit surface tracking encompasses the discretization of moving surfaces in 3D with triangle meshes. This thesis presents key contributions towards making explicit surface tracking tractable. I first deal with the topology change problem (the merging and splitting of mesh surfaces), introducing …
-
Implicit and explicit memory in preschoolers
Explicit memory refers to conscious or deliberate recollection of recent events and experiences, whereas implicit memory is revealed when the same events and experiences affect performance in the absence of conscious recollection. It is well known that implicit and explicit memory develop …
-
Transitioning to Explicit Nulls in Scala
… a potential null pointer exception. Scala's explicit nulls system removes this hazard at the type level: the null type is no longer a subtype of the reference types, and a nullable value must be declared as a union of its base type with null. The change is sound, but it is also global, and it …
-
The complexity of explicit construction problems
<p>Explicit constructions of pseudorandom objects play a central role in theoretical computer science. Unfortunately, for many properties of interest, while a randomly chosen object would satisfy them with high probability, deterministically constructing such objects remains notoriously …
-
Implicit and explicit communication in experiments
… third chapter explores the effects of minimal, explicit communication in a repeated game with frequent actions and imperfect monitoring.Several general conclusions can be drawn from the work presented below. The first is that the sort of implicit, rational communication that economic theory …
-
Explicit and Iterative LQG Controller Design
… presents two new LQG controller designs, namely, explicit and iterative designs. For the explicit design, the explicit solutions to the corresponding Riccati equations of controller design for large structures with collocated rate sensors and actuators are derived. Numerically solving the Riccati …
Page 1 of 905