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 1113 for “"Counting"”.
-
Counting coloured boxes
This thesis consists of the manuscripts of two research papers. In the first paper, we verify a recent conjecture of Kenyon/Szendroi by computing the generating function for pyramid partitions. Pyramid partitions are closely related to Aztec Diamonds; their generating function turns out to be the …
-
Packing and Counting Permutations
A permutation class is a set of permutations closed under taking subpermutations. We study two aspects of permutation classes: enumeration and packing. <br></br><br></br> Our work on enumeration consists of two campaigns. First, we enumerate all juxtaposition classes of the form “Av(abc) next to …
-
Counting with convolutional neural networks
In this work, we tackle the question: Can neural networks count? More precisely, given an input image with a certain number of objects, can a neural network tell how many are there? To study this, we create a synthetic dataset consisting of black and white images with variable numbers of white …
-
Counting surfaces in 3-manifolds
Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2025-08-01
-
Counting animals in ecological images
In the field of ecology, counting of animals to estimate population size and prey abundance is important for the conservation of wildlife. This involves analyzing large volumes of image, video or audio data and manual counting. Automating the process of counting animals would be invaluable to …
-
Counting nonequilibrium quasiparticles in a superconductor
Superconductivity is based on the Cooper pairing of electrons, which enables flow of electrical current without resistance, expulsion of magnetic fields in the Meissner effect, as well as electrical circuits obeying the rules of quantum mechanics. Such superconducting circuits are currently under …
-
Point Counting On Genus 2 Curves
For cryptographic purposes, counting points on the jacobian variety of a given hyperelliptic curve is of great importance. There has been several approaches to obtain the cardinality of such a group, specially for hyperelliptic curves of genus 2. The best known algorithm for counting points on …
-
Analyzing Halstead's counting rules in COBOL
Call number: LD2668 .R4 CMSC 1988 H86
-
Analyzing Halstead's counting rules in COBOL
Call number: LD2668 .R4 CMSC 1988 H86
-
Card counting meets hidden Markov models
… The aim of this research is to develop a winning counting strategy for Woolworth Blackjack and then attempt to improve upon the counting strategy with a HMM using well-established HMM analysis tools. A secondary goal is to understand when to use counting strategies and when to use HMM's.'
-
The Medicine Wheel for Carbohydrate Counting
… tool “The Medicine Wheel for Carbohydrate Counting.” This web-based educational tool reflects Native American culture and values, primarily of the Native Americans of the Northern Plains. In-depth interviews from ten adult Native Americans with a diagnosis of diabetes were interviewed of …
-
Extremal problems on counting combinatorial structures
… optimization theory. In this thesis, we focus on counting and coloring problems in this field. The complete balanced bipartite graph on $n$ vertices has $\floor{n^2/4}$ edges. Since all of its subgraphs are triangle-free, the number of (labeled) triangle-free graphs on $n$ vertices is at least …
-
Automatic Particle Counting Using An Acoustic Transducer
… By measuring the height of the signal and counting the number of pulses the sizes and quantities of particles could thus be determined. The microscope and the OPC techniques have their limitations. The microscope technique is a post contamination assessment technique and the OPC is costly, …
-
Counting supercuspidal representations of p-adic groups
Let F be a non-archimedean local �eld with residual characteristic p ~= 2. In this thesis we will deduce a formula for the number of irreducible supercuspidal representations of GLN(F), N C 1, with !�($F ) = 1 and level less than or equal to k. Following Blasco, we construct all irreducible …
-
Counting and Averaging Problems in Graph Theory
Paul Gunther (1966), proved the following result: Given a continuous function f on a compact surface M of constant curvature -1 and its periodic lift g to the universal covering, the hyperbolic plane, then the averages of the lift g over increasing spheres converge to the average of the function f …
-
Analytic Computation of the Prime -Counting Function
Our work resolves many issues left untreated in the original paper by Lagarias and Odlyzko and makes several original contributions---some of which have applications in other areas. In this dissertation we: (1) introduce a kernel function which appears to be more effective than the one suggested by …
-
Cuts and partitions: solving, counting, and enumerating
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-12-04 without embargo terms
Page 1 of 56