Relevant bibliographies by topics / Counting

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Counting'

Author: Grafiati
Published: 4 June 2021
Last updated: 29 July 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Counting"

1

Best, Joel. "Counting Counties." Contexts 6, no. 3 (August 2007): 22. http://dx.doi.org/10.1525/ctx.2007.6.3.22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Maclellan, Effie. "Counting all, counting on, counting up, counting down." Education 3-13 23, no. 3 (October 1995): 17–21. http://dx.doi.org/10.1080/03004279585200261.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Diers, Donna. "Counting Nurses, Nurses Counting." AJN, American Journal of Nursing 112, no. 1 (January 2012): 11. http://dx.doi.org/10.1097/01.naj.0000410343.88286.0e.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cartlidge, Edwin. "Counting weapons – without counting." Physics World 27, no. 08 (August 2014): 11. http://dx.doi.org/10.1088/2058-7058/27/08/23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Perry, Barbara. "Counting – and Countering – Hate Crime in Europe." European Journal of Crime, Criminal Law and Criminal Justice 18, no. 4 (2010): 349–67. http://dx.doi.org/10.1163/157181710x12816005399195.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Guillery, R. W. "On counting and counting errors." Journal of Comparative Neurology 447, no. 1 (April 8, 2002): 1–7. http://dx.doi.org/10.1002/cne.10221.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Goetsch, Douglas. "Counting." Iowa Review 27, no. 2 (July 1997): 51–53. http://dx.doi.org/10.17077/0021-065x.4880.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Mellick, Jill. "Counting." Jung Journal 3, no. 1 (January 2009): 7–9. http://dx.doi.org/10.1525/jung.2009.3.1.7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Winship, A. E. "Counting." Journal of Education 52, no. 20 (November 1990): 330. http://dx.doi.org/10.1177/002205749005202008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dodd, J. "Countering the counting problem: a reply to Holton." Analysis 56, no. 4 (October 1, 1996): 239–45. http://dx.doi.org/10.1093/analys/56.4.239.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Counting"

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 text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
2

Webb, Kerri. "Counting Bases." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1120.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
3

Rawlins, Isabel Bethan. "Counting planes." Thesis, Rhodes University, 2013. http://hdl.handle.net/10962/d1001816.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
4

Kroesen, M. Siri Amrit. "Counting Vessels." PDXScholar, 1996. https://pdxscholar.library.pdx.edu/open_access_etds/5258.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
5

Magnusson, Tobias. "Counting Class Numbers." Thesis, KTH, Matematik (Avd.), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-223643.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
6

Young, Benjamin. "Counting coloured boxes." Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/731.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
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 text
Abstract:
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].
APA, Harvard, Vancouver, ISO, and other styles
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
APA, Harvard, Vancouver, ISO, and other styles
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 text
Abstract:
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
Atualmente, 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.
APA, Harvard, Vancouver, ISO, and other styles
10

McGregor, Grant D. "B counting at BABAR." Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/1611.

Full text
Abstract:
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%.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Counting"

1

Turtledove, Harry. Counting up, counting down. New York: Del Ray, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Fité, Josep M. Counting. Parsippany, N.J: Silver Press, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Savran, Stacy. Counting. New York, NY: Kidsbooks, Inc., 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Walpole, Brenda. Counting. Milwaukee: Gareth Stevens Pub., 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Burgess, Lynne. Counting. Oxford: Heinemann, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Satchwell, John. Counting. Pleasant Hill, Calif: Discovery Toys, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Donna, Preis, ed. Counting. Lincolnwood, Ill: Publications International, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Guan, Tay Eng, ed. Counting. River Edge, NJ: World Scientific, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

(Firm), Pixar, and Walt Disney Pictures, eds. Counting. New York: Random House Children's Books, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

ill, Siede George, and Preis Donna ill, eds. Counting. Lincolnwood, Ill: Publications International, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Counting"

1

Hausner, Melvin. "Counting." In Elementary Probability Theory, 37–79. Boston, MA: Springer US, 1995. http://dx.doi.org/10.1007/978-1-4615-1753-5_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wallis, W. D. "Counting." In Mathematics in the Real World, 19–31. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-8529-2_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Searcóid, Mícheál Ó. "Counting." In Springer Undergraduate Mathematics Series, 41–56. London: Springer London, 2002. http://dx.doi.org/10.1007/978-1-4471-0179-6_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Nešetřil, Jaroslav, and Patrice Ossona de Mendez. "Counting." In Algorithms and Combinatorics, 277–97. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-27875-4_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pedersen, Steen. "Counting." In From Calculus to Analysis, 69–75. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-13641-7_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Booth, Dexter J. "Counting." In Foundation Discrete Mathematics for Computing, 108–47. Boston, MA: Springer US, 1995. http://dx.doi.org/10.1007/978-1-4899-7114-2_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gordon, Hugh. "Counting." In Discrete Probability, 17–40. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1966-8_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Dai, Ron. "Counting." In Learn Java with Math, 131–46. Berkeley, CA: Apress, 2019. http://dx.doi.org/10.1007/978-1-4842-5209-3_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wallis, W. D. "Counting." In A Beginner’s Guide to Finite Mathematics, 45–69. Boston, MA: Birkhäuser Boston, 2004. http://dx.doi.org/10.1007/978-1-4757-3814-8_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wallis, W. D. "Counting." In A Beginner's Guide to Finite Mathematics, 53–80. Boston: Birkhäuser Boston, 2012. http://dx.doi.org/10.1007/978-0-8176-8319-1_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Counting"

1

Ocampo Giraldo, Luis A., Aleksey E. Bolotnikov, Giuseppe S. Camarda, Yonggang Cui, Gianluigi De Geronimo, Rubi Gul, Jack Fried, et al. "Achieving subpixel resolution with time-correlated transient signals in pixelated CdZnTe gamma-ray sensors using a focused laser beam (Conference Presentation)." In Photon Counting Applications, edited by Ralph B. James, Ivan Prochazka, and Roman Sobolewski. SPIE, 2017. http://dx.doi.org/10.1117/12.2264615.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ejrnaes, Mikkel, Loredana Parlato, Alessandro Gaggero, Francesco Mattioli, Roberto Leoni, Giampiero Pepe, and Roberto Cristiano. "SNSPD with parallel nanowires (Conference Presentation)." In Photon Counting Applications, edited by Ralph B. James, Ivan Prochazka, and Roman Sobolewski. SPIE, 2017. http://dx.doi.org/10.1117/12.2267490.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gong, Wei, Kebin Liu, Xin Miao, Qiang Ma, Zheng Yang, and Yunhao Liu. "Informative counting." In the fourteenth ACM international symposium. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2491288.2491299.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Laroussinie, Francois, Antoine Meyer, and Eudes Petonnet. "Counting LTL." In 2010 17th International Symposium on Temporal Representation and Reasoning (TIME). IEEE, 2010. http://dx.doi.org/10.1109/time.2010.20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Li, Ping. "Compressed Counting." In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009. http://dx.doi.org/10.1137/1.9781611973068.46.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bressan, Marco, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, and Alessandro Panconesi. "Counting Graphlets." In WSDM 2017: Tenth ACM International Conference on Web Search and Data Mining. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3018661.3018732.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Richter, Philipp, Georgios Smaragdakis, David Plonka, and Arthur Berger. "Beyond Counting." In IMC 2016: Internet Measurement Conference. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2987443.2987473.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Riggle, Jason. "Counting rankings." In the Tenth Meeting of ACL Special Interest Group. Morristown, NJ, USA: Association for Computational Linguistics, 2008. http://dx.doi.org/10.3115/1626324.1626329.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gong, Wei, Yunhao Liu, Amiya Nayak, and Cheng Wang. "Wise counting." In the 15th ACM international symposium. New York, New York, USA: ACM Press, 2014. http://dx.doi.org/10.1145/2632951.2632963.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Moran, Shlomo, Gadi Taubenfeld, and Irit Yadin. "Concurrent counting." In the eleventh annual ACM symposium. New York, New York, USA: ACM Press, 1992. http://dx.doi.org/10.1145/135419.135434.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Counting"

1

Geist, William H. Multiplicity Counting. Office of Scientific and Technical Information (OSTI), December 2015. http://dx.doi.org/10.2172/1227250.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kowalski, Amanda. Counting Defiers. Cambridge, MA: National Bureau of Economic Research, March 2019. http://dx.doi.org/10.3386/w25671.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kowalski, Amanda. Counting defiers. The IFS, March 2019. http://dx.doi.org/10.1920/wp.cem.2019.12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kowalski, Amanda. Counting defiers. The IFS, March 2019. http://dx.doi.org/10.1920/wp.cem.2019.1219.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Aspnes, James, Maurice Herlihy, and Nir Shavit. Counting Networks. Fort Belvoir, VA: Defense Technical Information Center, June 1991. http://dx.doi.org/10.21236/ada237475.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kroesen, M. Counting Vessels. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.7131.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mclean, Thomas Donaldson. Counting Room Equipment. Office of Scientific and Technical Information (OSTI), July 2018. http://dx.doi.org/10.2172/1458968.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Geist, William H., and Peter A. Samti. Neutron counting exercises. Office of Scientific and Technical Information (OSTI), April 2011. http://dx.doi.org/10.2172/1057641.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Chou, Daniel. Counting AI Research. Center for Security and Emerging Technology, July 2022. http://dx.doi.org/10.51593/20220010.

Full text
Abstract:
Tracking the output of a country’s researchers can inform assessments of its innovativeness or assist in evaluating the impact of certain funding initiatives. However, measuring research output is not as straightforward as it may seem. Using a detailed analysis that includes Chinese-language research publications, this data brief reveals that China's lead in artificial intelligence research output is greater than many English-language sources suggest.
APA, Harvard, Vancouver, ISO, and other styles
10

Singh, Anjali. Ultimate Guide to Automated Cell Counter: Plus Purchasing Tips. ConductScience, June 2022. http://dx.doi.org/10.55157/cs20220614.

Full text
Abstract:
An automated cell counter is a machine that uses either image analysis or electrical impedance principles to count cells automatically. The electrical impedance principle involves measuring changes in electrical resistance as cells pass through an aperture, while the light-scattering principle observes how cells scatter light when exposed to it. There are four main types of automated cell counting methods: Coulter Counter, Image Analysis Method, Flow Cytometry, and Stereological Cell Counting. Each method has its benefits and limitations, offering faster and more objective cell counting compared to manual methods, but also facing challenges like cost and potential counting inaccuracies. To use an automated cell counter, samples are prepared by pipetting cell suspension onto counting slide chambers, and the machine then provides a total cell count per ml.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Counting' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography