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.
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 textWebb, Kerri. "Counting Bases." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1120.
Full textRawlins, Isabel Bethan. "Counting planes." Thesis, Rhodes University, 2013. http://hdl.handle.net/10962/d1001816.
Full textKroesen, M. Siri Amrit. "Counting Vessels." PDXScholar, 1996. https://pdxscholar.library.pdx.edu/open_access_etds/5258.
Full textMagnusson, Tobias. "Counting Class Numbers." Thesis, KTH, Matematik (Avd.), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-223643.
Full textFö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.
Young, Benjamin. "Counting coloured boxes." Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/731.
Full textDalal, Ketan. "Counting the onion." Thesis, McGill University, 2004. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=80247.
Full textPakapongpun, Apisit. "Functorial orbit counting." Thesis, University of East Anglia, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.520419.
Full textDIAS, 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 textAtualmente, 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.
McGregor, Grant D. "B counting at BABAR." Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/1611.
Full textBreukelaar, John W. C. "Timing, counting and cerebellum." Thesis, University of Canterbury. Psychology, 1998. http://hdl.handle.net/10092/6008.
Full textPhan, Quoc-Sang. "Model Counting Modulo Theories." Thesis, Queen Mary, University of London, 2015. http://qmro.qmul.ac.uk/xmlui/handle/123456789/15130.
Full textFREIRE, 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 textDurante 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.
Lischau, Carol. ""Counting Out The Harvest"." Thesis, University of North Texas, 2016. https://digital.library.unt.edu/ark:/67531/metadc862729/.
Full textSliačan, Jakub. "Packing and counting permutations." Thesis, Open University, 2018. http://oro.open.ac.uk/55735/.
Full textBirkedal, 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 textIn 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.
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 textStangoe, 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 textGillespie, Colin Stevenson. "Counting statistics of stochastic processes." Thesis, University of Strathclyde, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.273432.
Full textMir, Jamil Akhtar. "Electron counting using proportional counters." Thesis, University of Leicester, 1992. http://hdl.handle.net/2381/35733.
Full textRosenfield, Jake L. "Bikei Cohomology and Counting Invariants." Scholarship @ Claremont, 2016. http://scholarship.claremont.edu/cmc_theses/1349.
Full textGupta, Sanjay. "Determinism, nondeterminism, alternation, and counting /." The Ohio State University, 1993. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487848891515021.
Full textMcCaul, Courtney Ann. "Dot Counting Test cross-validation." Thesis, Alliant International University, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10249120.
Full textThe 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.
Kindermann, Markus. "Electron counting statistics in nanostructures /." [S. l.] : [s. n.], 2003. http://catalogue.bnf.fr/ark:/12148/cb39298961f.
Full textSallay, John. "Automatic People Counting and Matching." DigitalCommons@USU, 2009. https://digitalcommons.usu.edu/etd/499.
Full textChoi, John. "Counting Vertices in Isohedral Tilings." Scholarship @ Claremont, 2012. https://scholarship.claremont.edu/hmc_theses/28.
Full textRonzani, Massimiliano. "Instanton counting on compact manifolds." Doctoral thesis, SISSA, 2016. http://hdl.handle.net/20.500.11767/3582.
Full textMontejano, Cantoral Amanda. "Colored combinatorial structures: homomorphisms and counting." Doctoral thesis, Universitat Politècnica de Catalunya, 2009. http://hdl.handle.net/10803/32031.
Full textStarting 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.
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 textThis 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.
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 textTitle from first page of PDF file (viewed July 22, 2008). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 182-183).
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 textLilley, I. "Quench correction in liquid scintillation counting." Thesis, Nottingham Trent University, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.376969.
Full textDean, 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 textHERRERA, 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 textCOORDENAÇÃ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.
Warbuton, Ryan Ellis. "Infrared time-correlated single-photon counting." Thesis, Heriot-Watt University, 2008. http://hdl.handle.net/10399/2259.
Full textBOTLER, Léo Happ. "An IOT architecture for counting people." Universidade Federal de Pernambuco, 2017. https://repositorio.ufpe.br/handle/123456789/25234.
Full textApproved 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.
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 textNagarajan, Vivek Krishna. "Fluorescence Assisted Portable Cell Counting System." University of Akron / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=akron1376577419.
Full textSnyder, Eric P. Snyder. "Counting and Other Forms of Measurement." The Ohio State University, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=osu1462366471.
Full textChen, Hui. "Counting representations of deformed preprojective algebras." Diss., Kansas State University, 2017. http://hdl.handle.net/2097/35559.
Full textDepartment 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.
Hoens, T. Ryan. "Counting and sampling paths in graphs /." Online version of thesis, 2008. http://hdl.handle.net/1850/7545.
Full textADEY, KYM LLEWELLYN. "PRESCHOOLER UNDERSTANDING OF PRINCIPLES GOVERNING COUNTING." Diss., The University of Arizona, 1987. http://hdl.handle.net/10150/184106.
Full textLeo, 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 textHassler, Fabian. "Wave-packet approach to full counting statistics /." Zürich : ETH, 2009. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=18218.
Full textBhatnagar, Nayantara. "Annealing and Tempering for Sampling and Counting." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/16323.
Full textZiegler, Konstantin [Verfasser]. "Counting classes of special polynomials / Konstantin Ziegler." Bonn : Universitäts- und Landesbibliothek Bonn, 2015. http://d-nb.info/1077289596/34.
Full textDahlman, 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 textKadkhodamohammadi, 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 textLeung, 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 textSundriyal, Suresh. "Counting points on elliptic curves over Zp /." Online version of thesis, 2008. http://hdl.handle.net/1850/7929.
Full text