To see the other types of publications on this topic, follow the link: Counting.
Dissertations / Theses on the topic 'Counting'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Counting.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Magkakis, Andreas Gkompel. "Counting, modular counting and graph homomorphisms." Thesis, University of Oxford, 2016. https://ora.ox.ac.uk/objects/uuid:42be90cd-75b5-43ec-ad2e-5d513420bdc0.
Full textAbstract:
A homomorphism from a graph G to a graph H is a function from V (G) to V (H) that preserves edges. Many combinatorial structures that arise in mathematics and in computer science can be represented naturally as graph homomorphisms and as weighted sums of graph homomorphisms. In this thesis we study the complexity of various problems related to graph homomorphisms.
2
Webb, Kerri. "Counting Bases." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1120.
Full textAbstract:
A theorem of Edmonds characterizes when a pair of matroids has a common basis. Enumerating the common bases of a pair of matroid is a much harder problem, and includes the #P-complete problem of counting the number of perfect matchings in a bipartite graph. We focus on the problem of counting the common bases in pairs of regular matroids, and describe a class called Pfaffian matroid pairs for which this enumeration problem can be solved. We prove that when a pair of regular matroids is non-Pfaffian, there is a set of common bases which certifies this, and that the number of bases in the certificate is linear in the size of the ground set of the matroids. When both matroids in a pair are series-parallel, we prove that determining if the pair is Pfaffian is equivalent to finding an edge signing in an associated graph, and in the case that the pair is non-Pfaffian, we obtain a characterization of this associated graph. Pfaffian bipartite graphs are a class of graphs for which the number of perfect matchings can be determined; we show that the class of series-parallel Pfaffian matroid pairs is an extension of the class of Pfaffian bipartite graphs.
Edmonds proved that the polytope generated by the common bases of a pair of matroids is equal to the intersection of the polytopes generated by the bases for each matroid in the pair. We consider when a similar property holds for the binary space, and give an excluded minor characterization of when the binary space generated by the common bases of two matroids can not be determined from the binary spaces for the individual matroids. As a result towards a description of the lattice of common bases for a pair of matroids, we show that the lattices for the individual matroids determine when all common bases of a pair of matroids intersect a subset of the ground set with fixed cardinality.
3
Rawlins, Isabel Bethan. "Counting planes." Thesis, Rhodes University, 2013. http://hdl.handle.net/10962/d1001816.
Full textAbstract:
This collection of prose-poems and flash fiction, together with a few short stories, shows how romantic relationships colour our perspectives on the world. The collection has echoes throughout of speakers' voices, theme, imagery and tone. There is a narrative logic too, but working on a subtle level of echo and resonance
4
Kroesen, M. Siri Amrit. "Counting Vessels." PDXScholar, 1996. https://pdxscholar.library.pdx.edu/open_access_etds/5258.
Full textAbstract:
The discussion and illustration of how paintings function as thresholds is examined in the thesis report and the thesis exhibition, Threshold implies the passage of how an artist approaches the processes of seeing. The painting is the entry point, a place of connection of artist and viewer, a record of human experience transforming individual, interdependent and universal knowledge. Issues of the human body's relationship to vessels, and the metaphor that is integrated in relationship of space and proximity is explored. The significance of symbols and signs and the interplay of historical and personal imagery are examined through the precepts of Feminist Theory. The historical influences are paleolithic and are cross referenced from Japan to India. Other direct influences of the fertility form of the pelvic region of the female frame represents the abstracted appearance, signifying the human body's ability to possess and regenerate its essence. The work and its discussion of this symbol reflect specifically the use of the vessel form synthesizing the anatomical reference of uterus, the regenerative region of the female body. The uterus as symbol is to imply a conscious internal (and external) perception that is relative to ideas of human containn1ent. The paintings are concerned with utility bottles transforming a sense of transition metaphorically from earth to air, opaque to transparent. The object of painting as a threshold for visceral knowledge and an opportunity for the knowledge is explored through the proximity of objects. Usage of materials creates a personal dialogue. Merging specific experiences into visual documents, the content and the symbols create parallels of the vessel to the body as forms that hold. The realization that the distance of objects establishing their relationship, and the philosophical importance of the vessels and the bodys void are symbolically represented in both the written word and the painted image.
5
Magnusson, Tobias. "Counting Class Numbers." Thesis, KTH, Matematik (Avd.), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-223643.
Full textAbstract:
The following thesis contains an extensive account of the theory of class groups. First the form class group is introduced through equivalence classes of certain integral binary quadratic forms with a given discriminant. The sets of classes is then turned into a group through an operation referred to as "composition''. Then the ideal class group is introduced through classes of fractional ideals in the ring of integers of quadratic fields with a given discriminant. It is then shown that for negative fundamental discriminants, the ideal class group and form class group are isomorphic. Some concrete computations are then done, after which some of the most central conjectures concerning the average behaviour of class groups with discriminant less than $X$ -- the Cohen-Lenstra heuristics -- are stated and motivated. The thesis ends with a sketch of a proof by Bob Hough of a strong result related to a special case of the Cohen-Lenstra heuristics.Följande mastersuppsats innehåller en utförlig redogörelse av klassgruppsteori. Först introduceras formklassgruppen genom ekvivalensklasser av en typ av binära kvadratiska former med heltalskoefficienter och en given diskriminant. Mängden av klasser görs sedan till en grupp genom en operation som kallas "komposition''. Därefter introduceras idealklassgruppen genom klasser av kvotideal i heltalsringen till kvadratiska talkroppar med given diskriminant. Det visas sedan att formklassgruppen och idealklassgruppen är isomorfa för negativa fundamentala diskriminanter. Några konkreta beräkningar görs sedan, efter vilka en av de mest centrala förmodandena gällande det genomsnittliga beteendet av klassgrupper med diskriminant mindre än $X$ -- Cohen-Lenstra heuristiken -- formuleras och motiveras. Uppsatsen avslutas med en skiss av ett bevis av Bob Hough av ett starkt resultat relaterat till ett specialfall av Cohen-Lenstra heuristiken.
6
Young, Benjamin. "Counting coloured boxes." Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/731.
Full textAbstract:
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 partition function for the Donaldson-Thomas theory of a non-commutative resolution of the conifold singularity {x₁x₂ - x₃x₄ = 0}⊂ C⁴. The proof does not require algebraic geometry; it uses a modified version of the domino (or dimer) shuffling algorithm of Elkies, Kuperberg, Larsen and Propp.
In the second paper, we derive two multivariate generating functions for three-dimensional Young diagrams (also called plane partitions). The variables correspond to a colouring of the boxes according to a finite abelian subgroup G of SO(3). These generating functions turn out to be orbifold Donaldson-Thomas partition functions for the orbifold [C³/G]. We need only the vertex operator methods of Okounkov-Reshetikhin-Vafa for the easy case G = Zn; to handle the considerably more difficult case G = Z₂ x Z₂, we will also use a refinement of the author's recent q-enumeration of pyramid partitions.
In the appendix, written by Jim Bryan, we relate the diagram generating functions to the Donaldson-Thomas partition functions of the orbifold [C³/G]. We find a relationship between the Donaldson-Thomas partition functions of the orbifold and its G-Hilbert scheme resolution. We formulate a crepant resolution conjecture for the Donaldson-Thomas theory of local orbifolds satisfying the Hard Lefschetz condition.
7
Dalal, Ketan. "Counting the onion." Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=80247.
Full textAbstract:
Iteratively computing and discarding a set of convex hulls creates a structure known as an "onion". In this thesis, we show that the expected number of layers of a convex hull onion for n uniformly and independently distributed points in a disk is theta( n23 ). Additionally, we show that in general the bound is theta( n2d+1 ) for points distributed in a d-dimensional ball. Further, we show that this bound holds more generally for any fixed, bounded, full-dimensional shape with a non-empty interior. The results of this thesis were published in Random Structures and Algorithms (2004) [1].
8
Pakapongpun, Apisit. "Functorial orbit counting." Thesis, University of East Anglia, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.520419.
Full text
9
DIAS, PRISCILA MARQUES. "PEOPLE COUNTING SYSTEM." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2005. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=7232@1.
Full textAbstract:
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICOAtualmente, a preocupação com segurança vem crescendo dia após dia. Vários trabalhos abordando o desenvolvimento de sistemas de supervisão já foram realizados. Esta dissertação propõe um método automático capaz de determinar o número de pessoas em uma área monitorada por uma câmera de vídeo, assim como detectar mudanças na imagem potencialmente causadas por atitudes ilícitas. Uma aplicação típica seria a segurança de galpões durante a noite, em finais de semana ou em qualquer momento onde o acesso de pessoas é permitido, mas o movimento de cargas não. Mais precisamente, a intenção é detectar se uma pessoa que está passando pelo ambiente carrega consigo um objeto pertencente ao local ou deixa um objeto no local, quando apenas o movimento de pessoas é admitido na área. Além disto, o sistema determina o número de pessoas na cena. O método consiste na aplicação de quatro etapas em seqüências de vídeo: a) separação de fundo / primeiro plano, b) atualização dinâmica da estimativa de fundo, c) localização / contagem de pessoas, e d) detecção de atitudes suspeitas. Os algoritmos de separação de fundo / primeiro plano e de estimativa de fundo toleram variações pequenas de iluminação e efeitos de sombra. Já a contagem / localização de pessoas explora informações de cor e coerência de movimento. Soluções para atender estes aspectos são encontradas na literatura, porém nenhuma delas atende todos eles juntos. O método foi avaliado por experimentos realizados através de um protótipo e apresentou resultados encorajadores.
There is worldwide an increasing concern about security issues. A great deal of efforts have been undertaken in order to provide surveillance systems. This work proposes an automatic method to determine the number of people moving in an area monitored by a video camera, as well as to detect image changes, which are potentially due to illicit attitudes. A typical application is the security of warehouses during the night, on weekends or at any time when people access is allowed but no load movement is admissible. Specifically it focuses on detecting when a person passing by the environment carries any object belonging to the background away or leaves any object in the background, while only people movement is allowed in the area. Besides it estimates the number of people on scene. The method consists of performing four main tasks on video sequences: a) background and foreground separation, b) background estimative dynamic update, c) people location and counting, and d) suspicious attitudes detection. The proposed background and foreground separation and background estimative update algorithms deal with illumination fluctuation and shade effects. People location and counting explores colour information and motion coherence. Solutions meeting these requirements are proposed in the literature, but no one deals with all of them together. The method has been validated by experiments carried out on a prototype and produced encouraging results.
10
McGregor, Grant D. "B counting at BABAR." Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/1611.
Full textAbstract:
In this thesis we examine the method of counting BB events produced in the BaBar experiment. The original method was proposed in 2000, but improvements to track reconstruction and our understanding of the detector since that date make it appropriate to revisit the B Counting method.
We propose a new set of cuts designed to minimize the sensitivity to time-varying backgrounds. We find the new method counts BB events with an associated systematic uncertainty of ±0.6%.
11
Breukelaar, John W. C. "Timing, counting and cerebellum." Thesis, University of Canterbury. Psychology, 1998. http://hdl.handle.net/10092/6008.
Full textAbstract:
The present thesis employed psychophysical choice procedures to examine the role of the cerebellum in interval timing in Wistar rats within the context of W. H. Meck and R. M. Church's (1983) mode control model of timing and counting. Three competing hypotheses were examined: That the cerebellum functions as 1) an independent milliseconds timer; 2) part of an extended timing system where it contributes to scalar variance; and 3) part of an extended timing system where it contributes to constant rather than scalar variance. Counting was also evaluated as a way to examine a specific source of constant variance in timing. A review of the mode control model and sources of variance in counting and timing, together with consideration of the generalised Weber function, concluded that a single set of processes could accommodate performance across the milliseconds and seconds range timing as well as counting.
Lesions to the cerebellar hemispheres but not the cerebellar vermis produced some deficits in a millisecond discrimination task (200 to 800 ms) but discriminations in the seconds range (2 to 8 s) were unaffected by either type of lesion. In contrast, comparative lesions to nucleus accumbens produced deficits in both time ranges. Cerebellar hemisphere lesions but not vermal lesions also produced deficits in numerical discrimination. These findings suggest that damage to the cerebellar hemispheres influences a source of constant variability, because constant variability is a prominent source of error during millisecond timing but is masked by other sources of variability when tinting longer durations (> 2 s). The deficits in numerical discrimination suggest that switch processes, a specific source of constant variance described by the mode control model, are disrupted by damage to the cerebellar hemispheres.
Prior to the lesion work, an extensive examination was also made of timing and numerical performance to establish that intact rats could discriminate the numerosity of trial unique signals which obviate concerns about non-numerical confounds. This work provided an unequivocal demonstration that rats can count sequential events, but they do so according to H. Davis and J.
Memmott's (1983) "last resort" hypothesis.
12
Phan, Quoc-Sang. "Model Counting Modulo Theories." Thesis, Queen Mary, University of London, 2015. http://qmro.qmul.ac.uk/xmlui/handle/123456789/15130.
Full textAbstract:
This thesis is concerned with the quantitative assessment of security in software. More specifically, it tackles the problem of efficient computation of channel capacity, the maximum amount of confidential information leaked by software, measured in Shannon entropy or R²nyi's min-entropy. Most approaches to computing channel capacity are either efficient and return only (possibly very loose) upper bounds, or alternatively are inefficient but precise; few target realistic programs. In this thesis, we present a novel approach to the problem by reducing it to a model counting problem on first-order logic, which we name Model Counting Modulo Theories or #SMT for brevity. For quantitative security, our contribution is twofold. First, on the theoretical side we establish the connections between measuring confidentiality leaks and fundamental verification algorithms like Symbolic Execution, SMT solvers and DPLL. Second, exploiting these connections, we develop novel #SMT-based techniques to compute channel capacity, which achieve both accuracy and efficiency. These techniques are scalable to real-world programs, and illustrative case studies include C programs from Linux kernel, a Java program from a European project and anonymity protocols. For formal verification, our contribution is also twofold. First, we introduce and study a new research problem, namely #SMT, which has other potential applications beyond computing channel capacity, such as returning multiple-counterexamples for Bounded Model Checking or automated test generation. Second, we propose an alternative approach for Bounded Model Checking using classical Symbolic Execution, which can be parallelised to leverage modern multi-core and distributed architecture. For software engineering, our first contribution is to demonstrate the correspondence between the algorithm of Symbolic Execution and the DPLL(T ) algorithm used in state-of-the-art SMT solvers. This correspondence could be leveraged to improve Symbolic Execution for automated test generation. Finally, we show the relation between computing channel capacity and reliability analysis in software.
13
FREIRE, JULIANA ABRANTES. "COUNTING ALTERNATING SIGN MATRICES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2005. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=6411@1.
Full textAbstract:
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIORDurante vinte anos, ficou em aberto uma conjectura de Mills, Robbins e Rumsey para a contagem de Alternating Sign Matrices (Matrizes de Sinais Alternados). Zeilberger demonstrou a validade das fórmulas em meados da década de 90. Esse texto apresenta outra demonstração, atribuída a Kuperberg, que emprega técnicas de física estatística (Gelo Quadrado). São apresentadas também formulações alternativas que fazem uso de produtos tensoriais matriciais.
For twenty years, a conjecture by Mills, Robbins and Rumsey on the counting of Alternating Sign Matrices remained open. Zeilberger proved the formulas in the mid-90`s. This text presents another proof, attributed to Kuperberg, which uses techniques of statistical physics (square ice). Alternative formulations are also shown, making use of matrix tensor products.
14
Lischau, Carol. ""Counting Out The Harvest"." Thesis, University of North Texas, 2016. https://digital.library.unt.edu/ark:/67531/metadc862729/.
Full textAbstract:
"Counting Out The Harvest" is a collection of poems exploring intimate encounters. The poems reflect on encounters with memories, family, and the natural and cosmic worlds. In one of the poems, "Red-Throated Anole," the speaker works desperately to save a small dying lizard. In "Ice Storm, Post-Divorce," the speaker attempts to decipher a cluster of ladybugs taking refuge in her room. In the title poem, a couple wonders patiently if their crop will eventually grow. In each of these poems there is a present longing for the construction of a meaningful identity by means of the encounter, but the intersection between speaker and world falls short of satisfaction, whether the faultiness lies in the body's inability to find full sustenance, or in the ever-changing fluidity of memory to find stability. But the poems progress from pressing against this difficulty toward finding a contented resignation to the world's cyclical order. The final line of the manuscript, "disrobe a layer to begin again," indicates an arrival at satisfaction, which is found ultimately in continuation.
15
Sliačan, Jakub. "Packing and counting permutations." Thesis, Open University, 2018. http://oro.open.ac.uk/55735/.
Full textAbstract:
A permutation class is a set of permutations closed under taking subpermutations. We study two aspects of permutation classes: enumeration and packing. Our work on enumeration consists of two campaigns. First, we enumerate all juxtaposition classes of the form “Av(abc) next to Av(xy)”, where abc and xy are permutations of lengths three and two, respectively. We represent elements from such a juxtaposition class by Dyck paths decorated with sequences of points. Context-free grammars are then used to enumerate these decorated Dyck paths. Second, we classify as algebraic the generating functions of 1×m permutation grid classes where one cell is context-free and the remaining cells are monotone. We rely on properties of combinatorial specifications of context-free classes and use operators to express juxtapositions. Repeated application of operators resolves cases for m > 2. We provide examples to re-prove known results and give new ones. Our methods are algorithmic and could be implemented on a PC. Our work on packing consolidates current knowledge about packing densities of 4-point permutations. We also improve the lower bounds for the packing densities of 1324 and 1342 and provide rigorous upper bounds for the packing densities of 1324, 1342, and 2413. All our bounds are within 10-4 of the true packing densities. Together with the known bounds, we have a fairly complete picture of 4-point packing densities. Additionally, we obtain several bounds (lower and upper) for permutations of length at least five. Our main tool for the upper bounds is the framework of flag algebras introduced by Razborov in 2007. We also present Permpack — a flag algebra package for permutations.
16
Birkedal, Ole Andre Blom. "Counting Points on Elliptic Curves." Thesis, Norwegian University of Science and Technology, Department of Mathematical Sciences, 2010. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-10018.
Full textAbstract:
In this paper we present the first efficient point counting algorithm due to Schoof, before giving a significant improvement due to Elkies. In the final section I give Satoh's algorithm which is even faster and has paved the way for the field of $p$-adic point counting.
17
Annan, J. D. "The complexity of counting problems." Thesis, University of Oxford, 1994. http://ora.ox.ac.uk/objects/uuid:52070098-14fa-4cf1-ae6e-9f9ce6a626d8.
Full text
18
Stangoe, Victoria Sarah. "Orbit counting far from hyperbolicity." Thesis, University of East Anglia, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.410099.
Full text
19
Gillespie, Colin Stevenson. "Counting statistics of stochastic processes." Thesis, University of Strathclyde, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.273432.
Full text
20
Mir, Jamil Akhtar. "Electron counting using proportional counters." Thesis, University of Leicester, 1992. http://hdl.handle.net/2381/35733.
Full textAbstract:
The X-ray energy resolution achieved by conventional charge signal measurements using a gas proportional counter is determined by statistical fluctuations in the primary number of electrons and in the charge multiplication process. Conventional X-ray energy resolution thus increases as (E)-1/2 where E is the X-ray energy. The proportional counter, therefore, gives a very unsatisfactory X-ray energy resolution for X-ray energies below 1 keV. By eliminating the statistical fluctuations due to the charge multiplication, it is possible to improve the X-ray energy resolution by a factor of 2 over that achieved by conventional charge signal measurements. The implementation of this concept requires an 100% detection efficiency for the electrons present in the primary clusters. The present work is based on electron counting method which uses the charge signals due to single electrons avalanching at the anode wire. The main aim of this work was to determine the maximum possible electron counting efficiency. This required a detailed examination of the parameters relevant to the operation of an electron counting system. An experimental chamber consisting of a uniform field drift tube and a coaxial proportional counter was constructed. Experimental work was carried out to determine electron loss mechanisms such as electron loss by capture, electron loss below the discriminator threshold of the electron counting electronics and electron loss due to the finite resolving time of the electron counting electronics. This involved the measurements of electron mobility and electron lifetime at very low drift fields (Ed/p 0.02 V/cm Torr) for a number of different counter gas mixtures. Single electron response was also examined for these counter gas mixtures at a wide range of charge gains. It was found possible to achieve 89.0% electron counting efficiency at 1.49 keV using A-CH4(50%). The corresponding X-ray energy resolution was found to be 19.5%FWHM, compared to 28.0%FWHM achieved by the conventional charge signal measurements.
21
Rosenfield, Jake L. "Bikei Cohomology and Counting Invariants." Scholarship @ Claremont, 2016. http://scholarship.claremont.edu/cmc_theses/1349.
Full textAbstract:
This paper gives a brief introduction into the fundaments of knot theory: introducing knot diagrams, knot invariants, and two techniques to determine whether or not two knots are ambient isotopic. After discussing the basics of knot theory an algebraic coloring of knots knows as a bikei is introduced. The algebraic structure as well as the various axioms that define a bikei are defined. Furthermore, an extension between the Alexander polynomial of a knot and the Alexander Bikei is made. The remainder of the paper is devoted to reintroducing a modified homology and cohomology theory for involutory biquandles known as bikei, first introduced in [18]. The bikei 2-cocycles can be utilized to enhance the counting invariant for unoriented knots and links as well as unoriented and non-orienteable knotted surfaces in R4.
22
Gupta, Sanjay. "Determinism, nondeterminism, alternation, and counting /." The Ohio State University, 1993. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487848891515021.
Full text
23
McCaul, Courtney Ann. "Dot Counting Test cross-validation." Thesis, Alliant International University, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10249120.
Full textAbstract:
The purpose of this study was to determine the reliability and validity of the Dot Counting Test as a measure of feigned cognitive performance. Archival neuropsychological test data from a “real world” sample of 147 credible and 328 non-credible patients were compared. The Dot Counting Test E-score cutoff of ≥ 17 continued to show excellent specificity (93%). However, sensitivity dropped from approximately 74% documented in 2002 to 51% in the current sample. When the cutoff was lowered to ≥ 15, adequate specificity was maintained (90%) and sensitivity rose to (61%). However, a third of credible patients with borderline IQ failed the test using the Dot Counting Test E-cutoff score, indicating cautious use of the test with individuals who likely have borderline intelligence.
24
Kindermann, Markus. "Electron counting statistics in nanostructures /." [S. l.] : [s. n.], 2003. http://catalogue.bnf.fr/ark:/12148/cb39298961f.
Full text
25
Sallay, John. "Automatic People Counting and Matching." DigitalCommons@USU, 2009. https://digitalcommons.usu.edu/etd/499.
Full textAbstract:
This thesis explores software algorithm for implementing a people counting and matching system to be used on a bus. A special camera is used, known as a texel camera, that generates depth and color information for a scene. This added information greatly facilitates both the tasks of matching and counting. Although people counting is a relatively mature field, there are several situations in which current technologies are not able to count correctly. Several of these difficult situations are tested with 82% counting accuracy. The idea of matching people on a bus is also developed. The goal is not to identify a specific person on a bus, but to find the time that a specific person is on the bus, and what bus stops were used. There are several aspects of this matching problem that differentiate it from other classification tasks that have been researched. In this thesis, multiple measurements are used to classify a person and sequence estimation techniques explored. The techniques developed classify with 92% accuracy, even with a relatively large number of people on a bus.
26
Choi, John. "Counting Vertices in Isohedral Tilings." Scholarship @ Claremont, 2012. https://scholarship.claremont.edu/hmc_theses/28.
Full textAbstract:
An isohedral tiling is a tiling of congruent polygons that are also transitive, which is to say the configuration of degrees of vertices around each face is identical. Regular tessellations, or tilings of congruent regular polygons, are a special case of isohedral tilings. Viewing these tilings as graphs in planes, both Euclidean and non-Euclidean, it is possible to pose various problems of enumeration on the respective graphs. In this paper, we investigate some near-regular isohedral tilings of triangles and quadrilaterals in the hyperbolic plane. For these tilings we enumerate vertices as classified by number of edges in the shortest path to a given origin, by combinatorially deriving their respective generating functions.
27
Ronzani, Massimiliano. "Instanton counting on compact manifolds." Doctoral thesis, SISSA, 2016. http://hdl.handle.net/20.500.11767/3582.
Full textAbstract:
In this thesis we analyze supersymmetric gauge theories on compact manifolds and their relation with representation theory of infinite Lie algebras associated to conformal field theories, and with the computation of geometric invariants and superconformal indices.
The thesis contains the work done by the candidate during the doctorate programme at SISSA under the supervision of A. Tanzini and G. Bonelli.
• in Chapter 2, we consider N = 2 supersymmetric gauge theories on four manifolds admitting an isometry. Generalized Killing spinor equations are derived from the consistency of supersymmetry algebrae and solved in the case of four manifolds admitting a U(1) isometry. This is used to explicitly compute the supersymmetric path integral on S2 × S2 via equivariant localization. The building blocks of the resulting partition function are shown to contain the three point functions and the conformal blocks of Liouville Gravity.
• in Chapter 3, we provide a contour integral formula for the exact partition function of N = 2 supersymmetric U(N) gauge theories on compact toric four-manifolds by means of supersymmetric localisation. We perform the explicit evaluation of the contour integral for U(2) N = 2∗ theory on P2 for all instanton numbers. In the zero mass case, corresponding to the N = 4 supersymmetric gauge theory, we obtain the generating function of the Euler characteristics of instanton moduli spaces in terms of mock-modular forms. In the decoupling limit of infinite mass we find that the generating function of local and surface observables computes equivariant Donaldson invariants, thus proving in this case a long-standing conjecture by N. Nekrasov. In the case of vanishing first Chern class the resulting equivariant Donaldson polynomials are new.
• in Chapter 4, we explore N = (1, 0) superconformal six-dimensional theories arising from M5 branes probing a transverse Ak singularity. Upon circle compactification to five dimensions, we describe this system with a dual pq-web of five-branes and propose the spectrum of basic five-dimensional instanton operators driving global symmetry enhancement. For a single M5 brane, we find that the exact partition function of the 5d quiver gauge theory matches the 6d (1, 0) index, which we compute by letter counting. We finally show which relations among vertex correlators of qW algebrae are implied by the S-duality of the pq-web.
28
Montejano, Cantoral Amanda. "Colored combinatorial structures: homomorphisms and counting." Doctoral thesis, Universitat Politècnica de Catalunya, 2009. http://hdl.handle.net/10803/32031.
Full textAbstract:
A partir del problema de los cuatro colores se inicia el estudio de coloraciones en grafos; teoría que ha existido ya por más de 150 años, y se ocupa del problema fundamental de partir un conjunto en clases de acuerdo con ciertas reglas. Con esta modesta base, dicha teoría se sitúa en un punto central de las matemáticas discretas con una gran cantidad de generalizaciones y aplicaciones contemporáneas. En esta tesis, centramos nuestro interés en dos áreas muy activas de investigación, que provienen de problemas en coloraciones: la teoría de Homomorfismos, y la teoría de Ramsey. La teoría de homomorfismos se ocupa del estudio de los morfismos naturales entre objetos pertenecientes a clases de estructuras combinatorias. El número cromático de un grafo simple G, se puede definir, en este contexto, como el orden mínimo de un grafo completo que admita un homomorfismo desde G. Por esta razón, la teoría de homomorfismos se ha estudiado extensamente como generalización de la teoría de coloraciones. Una excelente referencia en este tema es el libro de Hell y Nesetril {Graphs and homomorphisms, Oxf. Univ. Press, 2004}. La teoría de Ramsey estudia la existencia de ciertos patrones de color en estructuras coloreadas. A partir de los teoremas de Ramsey, Hilbert, Schur y van der Waerden, dicha teoría se ha desarrollado como una bella y amplia área de la combinatoria, donde se usan una gran variedad de técnicas provenientes de diversas ramas de la matemática, y cuyos resultados forman una parte muy importante de la teoría de grafos y la combinatoria en general. Una buena referencia en esta área es el libro de Langman y Robertson {Ramsey Theory on the Integers, Stud. Math. Lib. 24, AMS, 2003}. El trabajo en esta tesis está organizado en dos partes. La primera, se ocupa del estudio de homomorfismos de grafos mixtos coloreados, que son grafos con vértices unidos tanto por arcos coloreados como por aristas coloreadas. El número cromático de un grafo mixto coloreado G, se define como el mínimo orden do otro grafo mixto coloreado H, con la propiedad de que existe un homomorfismo (que preserva colores) de G en H. Estas nociones fueron introducidas por Nesetril y Raspaud en {Colored homomorphisms of colored mixed graphs, J. C. T. Ser. B 80 (2000)}. Generalizando algunos resultados de grafos orientados, estudiamos el número cromático mixto coloreado de las siguientes clases de grafos: caminos, árboles, grafos con número cromático acíclico acotado, k-árboles parciales, grafos planos, grafos outerplanos y grafos escasos en aristas. Motivados por la conjetura de la dicotomía en sistemas relacionales, nos interesamos en el estudio de la clases de grafos 2-coloreados en aristas y su relación con los grafos orientados. La segunda parte de la tesis se ubica dentro de la teoría de Ramsey aritmética. Estudiamos la existencia y enumeración de estructuras coloreadas, sobre todo monocromáticas y heterocromáticas, en coloraciones de grupos abelianos. Las estructuras que consideramos son soluciones de sistemas de ecuaciones en grupos, siendo los ejemplos más importantes las progresiones aritméticas y las ternas de Schur. En esta parte damos una descripción estructural de aquellas coloraciones en grupos abelianos que no contengan progresiones aritmeticas heterocromáticas de tamaño 3. Dicha descripción prueba una conjetura de Jungic et al. {Rainbow Ramsey Theory. Integers: E. J. C. N. T. 5(2) A9. (2005)} concerniente al tamaño de la clase cromática mas pequeña en dichas coloraciones de grupos cíclicos.Starting with the four color problem, the theory of graph coloring has existed for more than 150 years. It deals with the fundamental problem of partitioning a set of objects into classes according to certain rules. From this modest beginning, the theory has become central in discrete mathematics, with many contemporary generalizations and applications. In this thesis, our particular interest is in two very active areas of research which have emerged from coloring problems: Graph Homomorphism Theory and Arithmetic Ramsey Theory. Graph Homomorphism Theory can be described as the study of classes of combinatorial structures under natural morphisms. The chromatic number of a simple graph G can be stated, in this context, as the smallest complete graph to which G admits a homomorphism. Thus Graph Homomorphism Theory has been extensively studied as a generalization of colorings. An excellent reference in the subject is the book by Hell and Nesetril {Graphs and homomorphisms, Oxf. Univ. Press, 2004}. Ramsey Theory studies the existence of particular color patterns in colored structures. Starting with the Theorems of Ramsey, Hilbert, Schur and van der Waerden, the theory has developed as a wide and beautiful area of combinatorics, in which a great variety of techniques are used from many branches of mathematics. Many of the classical results in the area are arithmetic versions of the theory and we are interested in this particular branch of Ramsey Theory. A good reference in the area is the book of Langman and Robertson {Ramsey Theory on the Integers, Stud. Math. Lib. 24, AMS, 2003}. This thesis is organized in two parts. The first part deals with the study of homomorphisms in the class of colored mixed graphs, which are graphs with vertices linked by both colored arcs and colored edges. The chromatic number of such a graph G is defined as the smallest order of a colored mixed graph H such that there exists a (color preserving) homomorphism from G to H. These notions were introduced by Nesetril and Raspaud in {Colored homomorphisms of colored mixed graphs, J. C. T. Ser. B 80 (2000)}. Generalizing known results for the class of oriented graphs we study the colored mixed chromatic number of paths, trees, graphs with bounded acyclic chromatic number, graphs of bounded treewidth, planar graphs, outerplanar graphs and sparse graphs. In particular we give the exact chormatic number of planar graphs and of partial 2-trees with appropriately large girth. Motivated by the dichotomy conjecture for relational structures we focuss on the class of 2-edge colored graphs and study its relationship with the class of oriented graphs. In particular we consider the characterization of cores and of duality pairs in this class. The second part of the thesis is related to Arithmetic Ramsey Theory. We consider the existence and the enumeration of colored structures, mainly monochromatic or rainbow structures, in colorings of finite groups. The structures under consideration can be described as solutions of systems of equations in the group, the main examples being arithmetic progressions and Schur triples. We give a structural description of those colorings in abelian groups which do not contain 3-term arithmetic progressions with its members having pairwise distinct colors. This structural description proves a conjecture of Jungic et al. {Rainbow Ramsey Theory. Integers: E. J. C. N. T. 5(2) A9. (2005)} on the size of the smallest chromatic class of such colorings in cyclic groups.
29
Norlin, Börje. "Photon Counting X-ray Detector Systems." Licentiate thesis, Mid Sweden University, Department of Information Technology and Media, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-41.
Full textAbstract:
This licentiate thesis concerns the development and characterisation of X-ray imaging detector systems. “Colour” X-ray imaging opens up new perspectives within the fields of medical X-ray diagnosis and also in industrial X-ray quality control. The difference in absorption for different “colours” can be used to discern materials in the object. For instance, this information might be used to identify diseases such as brittle-bone disease. The “colour” of the X-rays can be identified if the detector system can process each X-ray photon individually. Such a detector system is called a “single photon processing” system or, less precise, a “photon counting system”.
With modern technology it is possible to construct photon counting detector systems that can resolve details to a level of approximately 50 µm. However with such small pixels a problem will occur. In a semiconductor detector each absorbed X-ray photon creates a cloud of charge which contributes to the picture achieved. For high photon energies the size of the charge cloud is comparable to 50 µm and might be distributed between several pixels in the picture. Charge sharing is a key problem since, not only is the resolution degenerated, but it also destroys the “colour” information in the picture.
The problem involving charge sharing which limits “colour” X-ray imaging is discussed in this thesis. Image quality, detector effectiveness and “colour correctness” are studied on pixellated detectors from the MEDIPIX collaboration. Characterisation measurements and simulations are compared to be able to understand the physical processes that take place in the detector. Simulations can show pointers for the future development of photon counting X-ray systems. Charge sharing can be suppressed by introducing 3D-detector structures or by developing readout systems which can correct the crosstalk between pixels.
30
Liese, Jeffrey Edward. "Counting patterns in permutations and words." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2008. http://wwwlib.umi.com/cr/ucsd/fullcit?p3307363.
Full textAbstract:
Thesis (Ph. D.)--University of California, San Diego, 2008.Title from first page of PDF file (viewed July 22, 2008). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 182-183).
31
Röttger, Christian Gottfried Johannes. "Counting problems in algebraic number theory." Thesis, University of East Anglia, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.327407.
Full text
32
Lilley, I. "Quench correction in liquid scintillation counting." Thesis, Nottingham Trent University, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.376969.
Full text
33
Dean, J. C. J. "Colloid systems in liquid scintillation counting." Thesis, University of Salford, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.381855.
Full text
34
HERRERA, LUIS ERNESTO YNOQUIO. "HIGH RESOLUTION PHOTON COUNTING OPTICAL REFLECTOMETRY." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2015. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=27673@1.
Full textAbstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIROCOORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
FUNDAÇÃO DE APOIO À PESQUISA DO ESTADO DO RIO DE JANEIRO
PROGRAMA DE EXCELENCIA ACADEMICA
BOLSA NOTA 10
Neste trabalho são apresentados dois reflectômetros ópticos por contagem de fótons no domínio do tempo para o monitoramento de fibras ópticas. O primeiro foi projetado para obter faixas dinâmicas altas. Demonstrou-se a sua capacidade de sintonização no monitoramento de redes passivas WDM-PON durante o tráfego de dados. 32 dB de faixa dinâmica com 6 m de resolução foram atingidos. O segundo reflectômetro foi projetado para atingir resoluções ultra altas. As aplicações neste caso, além do monitoramento de uma rede TDM-PON de curto alcance, foram na caracterização de redes de Bragg dispersivas e na descrição e modelagem de um fenômeno não reportado antes na literatura, chamado nesta tese de reflexão por curvatura. Foi demonstrada uma resolução menor que 3 cm com faixa dinâmica maior que 14.0 dB.
This thesis presents the development of two photon counting optical time domain reflectometers for fiber optic links monitoring. The first one was focused on high dynamic range. It is demonstrated its tunable capability for a WDM-PON in-service monitoring. 32 dB on dynamic range and a two-point resolution of 6 m is achieved. The second reflectometer was design to accomplish an ultra high resolution. The monitoring of a short TDM-PON is performed. Moreover, due to its high resolution, a chirped fiber Bragg grating is characterized and a non previous reported phenomena, the bend reflection, is shaped and described. It is demonstrated 3 cm two-point resolution and more than 14 dB on dynamic range.
35
Warbuton, Ryan Ellis. "Infrared time-correlated single-photon counting." Thesis, Heriot-Watt University, 2008. http://hdl.handle.net/10399/2259.
Full textAbstract:
This Thesis investigates near infrared ( ~ 1550 nm) time-correlated singlephoton counting, studying the single-photon detectors and some of the potential application areas. Custom designed and fabricated InGaAs/InP single-photon avalanche diode detectors were characterised. Our devices yielded single-photon detection efficiencies of ~10 %, timing jitter of 200 ps, and noise equivalent power comparable to the best commercially available avalanche photodiodes operated in Geiger-mode. The afterpulsing phenomenon which limits the maximum count rate of InGaAs/InP single-photon avalanche diodes has been investigated in detail and activation energies calculated for the traps that cause this problem. This was found to be ~250 meV for all the devices tested, despite their differing structures and growth conditions, and points to the InP multiplication region as the likely location of the traps. Ways of reducing the effects caused by the afterpulsing phenomenon were investigated and sub-Geiger mode operation was studied in detail. This approach enabled freerunning, afterpulsing-free operation at room temperature of an InGaAs/InP singlephoton avalanche diode detector for the first time. Finally, time-of-flight photon counting laser ranging was performed using both singlephoton avalanche diodes and superconducting nanowire single-photon detectors. The use of the latter resulted in a surface to surface depth resolution of 4 mm being achieved at low average laser power at an eye-safe wavelength of 1550 nm.
36
BOTLER, Léo Happ. "An IOT architecture for counting people." Universidade Federal de Pernambuco, 2017. https://repositorio.ufpe.br/handle/123456789/25234.
Full textAbstract:
Submitted by Pedro Barros (pedro.silvabarros@ufpe.br) on 2018-07-25T18:14:54Z
No. of bitstreams: 2
license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5)
DISSERTAÇÃO Léo Happ Botler.pdf: 11089344 bytes, checksum: 86a0a174c2ae1305daee53b383a906db (MD5)Approved for entry into archive by Alice Araujo (alice.caraujo@ufpe.br) on 2018-07-27T16:56:44Z (GMT) No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) DISSERTAÇÃO Léo Happ Botler.pdf: 11089344 bytes, checksum: 86a0a174c2ae1305daee53b383a906db (MD5)
Made available in DSpace on 2018-07-27T16:56:44Z (GMT). No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) DISSERTAÇÃO Léo Happ Botler.pdf: 11089344 bytes, checksum: 86a0a174c2ae1305daee53b383a906db (MD5) Previous issue date: 2017-03-02
CNPq
Knowing whether a room is occupied or not is crucial for improving electrical energy efficiency. For instance, if a given room is empty there is usually no need for the lights to be turned on. Usually in small spaces such as elevator halls, a Passive Infrared (PIR) sensor is used together with the lighting, but as it lacks accuracy, people often are left in the dark after a few minutes. Another factor that deteriorates energy efficiency is that these sensors are seldom connected to a network, limiting the application scenarios to simple tasks, such as controlling lamps. The same data could be used to improve other services such as adjusting the temperature of an air conditioner, which usually has a high impact on energy costs in countries with warm weather. In the present dissertation a wireless device capable of counting people in a room is implemented using Infrared (IR) Light Emitting Diode (LED)s. The implemented device is analyzed regarding energy consumption, cost, error count and installation time. It is also compared to other existing solutions. An architecture for interfacing this device with the Internet of Things (IoT) is provided as well as some of its applications in real scenarios. The results show that the architecture provided as well as the device implemented are useful in the presented scenarios, presenting a distance range of up to 30cm, a false negatives percentual error around 4% and an energy consumption of 1.519W.
Saber se um cômodo está ocupado ou não é crucial para melhorar a eficiência de energia elétrica. Por exemplo, se um quarto está desocupado, geralmente, não há necessidade de as lâmpadas estarem ligadas. Geralmente, em ambientes pequenos como em halls de elevador, um sensor Infravermelho Passivo (PIR) é usado em conjunto com as lâmpadas, mas como estes sensores não são precisos, as pessoas são frequentemente deixadas no escuro após alguns minutos. Outro fator que prejudica a eficiência energética é que raramente estes sensores estão conectados a uma rede, limitando os cenários de aplicação a tarefas simples, como controlar lâmpadas, enquanto os dados do sensor poderiam ser utilizados para melhorar outros serviços, como ajustar a temperatura de um aparelho de ar condicionado, que geralmente tem um alto impacto nas contas de energia, em países quentes. Nesta dissertação, um dispositivo sem fio capaz de contar pessoas em um quarto é implementado utilizando Diodos Emissores de Luz (LED)s Infravermelhos (IR). O dispositivo implementado é analisado nos seguintes aspectos: consumo de energia, custo, contagem de erros e tempo de instalação. Este também é comparado a outras soluções existentes. Uma arquitetura para fazer a interface entre este dispositivo e a Internet das Coisas (IoT) é fornecida, assim como alguns cenários em que esta pode ser aplicada. Os resultados mostram que a arquitetura, assim como o dispositivo implementado são úteis nos cenários apresentados, apresentando um alcance de 30cm, um percentual de erros do tipo falso negativo da ordem de 4% e um consumo de energia de 1.519W.
37
McCartney, Kelsie Lynn. "A New Method of Knot Counting." Marietta College Honors Theses / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=marhonors1244842761.
Full text
38
Nagarajan, Vivek Krishna. "Fluorescence Assisted Portable Cell Counting System." University of Akron / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=akron1376577419.
Full text
39
Snyder, Eric P. Snyder. "Counting and Other Forms of Measurement." The Ohio State University, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=osu1462366471.
Full text
40
Chen, Hui. "Counting representations of deformed preprojective algebras." Diss., Kansas State University, 2017. http://hdl.handle.net/2097/35559.
Full textAbstract:
Doctor of PhilosophyDepartment of Mathematics
Zongzhu Lin
For any given quiver [Gamma], there is a preprojective algebra and deformed preprojective algebras associated to it. If the ground field is of characteristic 0, then there are no finite dimensional representations of deformed preprojective algebras with special weight 1. However, if the ground field is of characteristic p, there are many dimension vectors with nonempty representation spaces of that deformed preprojective algebras. In this thesis, we study the representation category of deformed preprojective algebra with weight 1 over field of characteristic p > 0. The motivation is to count the number of rational points of the numbers X[subscript [lambda]] =[mu]⁻¹([lambda]) of moment maps at the special weights [lambda] [element of] K[superscript x] over finite fields, and to study the relations of the Zeta functions of these algebraic varieties X[subscript [lambda]] which are defined over integers to Betti numbers of the manifolds X[subscript [lambda]](C). The first step toward counting is to study the categories of representations of the deformed preprojective algebras [Pi][superscript [lambda]]. The main results of this thesis contain two types of quivers. First result shows that over finite field, the category of finite dimensional representations of deformed preprojective algebras [Pi]¹ associated to type A quiver with weight 1 is closely related to the category of finite dimensional representations of the preprojective algebra associated to two different type A quivers. Moreover, we also give the relations between their Zeta functions. The second result shows that over algebraically closed field of characteristic p > 0, the category of finite dimensional representations of deformed preprojective algebras [Pi]¹ associated to Jordan quiver with weight 1 has a close relationship with the category of finite dimensional representations of preprojective algebra associated to Jordan quiver.
41
Hoens, T. Ryan. "Counting and sampling paths in graphs /." Online version of thesis, 2008. http://hdl.handle.net/1850/7545.
Full text
42
ADEY, KYM LLEWELLYN. "PRESCHOOLER UNDERSTANDING OF PRINCIPLES GOVERNING COUNTING." Diss., The University of Arizona, 1987. http://hdl.handle.net/10150/184106.
Full textAbstract:
This dissertation sought to explore dimensions of preschooler conceptual awareness of the principles of counting. The study derived its focus from the research of Rochel Gelman and, in particular, the principles of counting she purports are implicitly understood by young children. Their frequent inability to manifest this awareness in their counting performances is explained as resulting from their susceptibility to task demands. This study explores this position by seeking to facilitate performance in order that conceptual understanding might be more apparent. The sample for this study consisted of 40 children (20 aged 3 years 3 months-3 years 9 months; 20 aged 4 years 3 months-4 years 9 months) selected randomly from a cross section of preschool and day-care centers in Adelaide, South Australia. Phase 1 of the study explored the impact of a procedure which allowed for children to receive both visual and tactile feedback on their counting behavior on array sizes ranging from 2 to 19. The results show conclusively that this self-monitoring technique significantly improved counting performances for both age groups. In doing so it lends support to the Gelman hypothesis that conceptual awareness of the 'how-to' count principles can be masked by task demands. Phase 2 of the study looked at the complex 'order-irrelevance' principle. The results suggest that preschoolers understand that items can be counted in any order before they appreciate that this has no impact on cardinal value. The extreme susceptibility of preschoolers to variations in task demands necessitates further exploration of design and analysis parameters.
43
Leo, Adam, and Johan Carleklev. "Counting and detecting people with radars. : The comparison of three radars in relation to their people counting ability." Thesis, Jönköping University, JTH, Avdelningen för datateknik och informatik, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-54591.
Full textAbstract:
People counting and human detection systems have during the last decade been developed using many different sensors; from video cameras to radars. While video cameras function much like the human eyes and yield data relatable to humans, it might be prone to privacy regulations. Therefore, sensors not affected by these privacy regulations have been used to develop people counting systems. In this thesis, radar sensors are examined in their people counting ability. The radars in question are: InnoSent iSYS5005, RFbeam K-LD7, and Acconeer XM112. An investigation of the three different radars as well as different geometries is carried out in order to find the most suitable radar and the optimal positioning for people counting. This thesis follows the principle of Design Science Research, where a controlled experiment was conducted in order to answer the research questions. We look at accuracy and precision together with other variables to determine which radar and what geometry is the most promising. In the end, we find that the iSYS5005 has the most promising result. However, the results were not as promising as one could have hoped, showing an overall poor performance. We argue that this is because the radar regularly loses track of objects, lowering the overall accuracy and precision. Which in turn lowers the overall performance of the sensors. Therefore, we mean that this shows the importance of post processing algorithms to interpret the data. We propose a tardiness probability algorithm which we believe could fix many of the issues the unprocessed data has.
44
Hassler, Fabian. "Wave-packet approach to full counting statistics /." Zürich : ETH, 2009. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=18218.
Full text
45
Bhatnagar, Nayantara. "Annealing and Tempering for Sampling and Counting." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/16323.
Full textAbstract:
The Markov Chain Monte Carlo (MCMC) method has been widely used in practice since the 1950's in areas such as biology, statistics, and physics. However, it is only in the last few decades that powerful techniques for obtaining rigorous performance guarantees with respect to the running time have been developed. Today, with only a few notable exceptions, most known algorithms for approximately uniform sampling and approximate counting rely on the MCMC method. This thesis focuses on algorithms that use MCMC combined with an algorithm from optimization called simulated annealing, for sampling and counting problems.
Annealing is a heuristic for finding the global optimum of a function over a large search space. It has recently emerged as a powerful technique used in conjunction with the MCMC method for sampling problems, for example in the estimation of the permanent and in algorithms for computing the volume of a convex body. We examine other applications of annealing to sampling problems as well as scenarios when it fails to converge in polynomial time.
We consider the problem of randomly generating 0-1 contingency tables. This is a well-studied problem in statistics, as well as the theory of random graphs, since it is also equivalent to generating a random bipartite graph with a prescribed degree sequence. Previously, the only algorithm known for all degree sequences was by reduction to approximating the permanent of a 0-1 matrix. We give a direct and more efficient combinatorial algorithm which relies on simulated annealing.
Simulated tempering is a variant of annealing used for sampling in which a temperature parameter is randomly raised or lowered during the simulation. The idea is that by extending the state space of the Markov chain to a polynomial number of progressively smoother distributions, parameterized by temperature, the chain could cross bottlenecks in the original space which cause slow mixing. We show that simulated tempering mixes torpidly for the 3-state ferromagnetic Potts model on the complete graph. Moreover, we disprove the conventional belief that tempering can slow fixed temperature algorithms by at most a polynomial in the number of temperatures and show that it can converge at a rate that is slower by at least an exponential factor.
46
Ziegler, Konstantin [Verfasser]. "Counting classes of special polynomials / Konstantin Ziegler." Bonn : Universitäts- und Landesbibliothek Bonn, 2015. http://d-nb.info/1077289596/34.
Full text
47
Dahlman, Nils. "Evaluation of Photon-Counting Spectral Breast Tomosynthesis." Thesis, KTH, Medicinsk avbildning, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-32051.
Full textAbstract:
The superposition of anatomical structures often greatly impedes detectability in conventional mammography. Spectral imaging and tomosynthesis are two promising methods used for suppression of the anatomical background. The aim of this thesis is to compare and evaluate the benefits of tomosynthesis and spectral imaging, both in combination and separately. A computer model for signal and noise transfer in tomosynthesis was developed and combined with an existing model for spectral imaging. Measurements were performed to validate the models. An ideal-observer detectability index incorporating anatomical noise was used as a figure of merit to compare the different modalities. For detection of a contrast-enhanced tumor in a breast with high anatomical background, the optimum performance for spectral tomosynthesis was found at a tomo-angle of 10 degrees. The improvement was in the order of a factor 10 compared to non-energy-resolved tomosynthesis with the same angular extent. This was supported by clinical results.
48
Kadkhodamohammadi, Abdolrahim. "Counting Sertoli Cells in Thin Testicular Tissue." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-175237.
Full textAbstract:
This master thesis develops a novel system to model the tubular structure in thin sections of testicular tissue and count the Sertoli cells. A three-phase method is proposed to model the tubular structure in microscopic images of the tissue, the model is deployed to detect the cells. In the first phase, the germ-mass, which represents the inside layer of tubules, are detected. All cells are detected by radial symmetry transform and then the graph cut algorithm is used to separate the germ cells. Each region covered by a compact set of germ cells is considered as the germ-mass. In the second phase, all bright areas in the image are detected and used to adjust the germ-mass regions. In the last phase, all edges that are line-like are identified and straight lines are fitted to the edges. The lines are later connected to compensate for the broken parts of the tubules' boundaries. The closest cells to the germ-mass are chosen as the Sertoli cell candidates. The approximate boundary of tubules and the angle between the candidate cells are used to detect the Sertoli cells. Our experimental results show that our system is able to detect the tubule and the Sertoli cells with reasonable accuracy. If the method can not find enough edges to approximate the tubule's boundary, detecting Sertoli cells is complicated; the system can report those situations to the experts. Since we use the symmetry attribute of the cells to detect them, the method is quite robust against noise, artifacts, and non-uniform illumination. The method is able to capture all tubules, even tubules that do not have any bright region in the middle (lumen). To the best of my knowledge, no one has proposed a method to model tubular structure without lumen. The border approximation method can work well even for tubules that are partially in the image. It should be mentioned that the proposed method could be applied to model any tubular structure with one or more cells types.
49
Leung, Yiu-cho. "Counting combinatorial structures in recursively constructible graphs /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?CSED%202007%20LEUNG.
Full text
50
Sundriyal, Suresh. "Counting points on elliptic curves over Zp /." Online version of thesis, 2008. http://hdl.handle.net/1850/7929.
Full text