Results 261 to 270 of about 3,812,865 (297)

Counting RFID Tags Efficiently and Anonymously

2010 Proceedings IEEE INFOCOM, 2010
Radio Frequency IDentification (RFID) technology has attracted much attention due to its variety of applications, e.g., inventory control and object tracking. One important problem in RFID systems is how to quickly estimate the number of distinct tags without reading each tag individually.
Hao Han, Bo Sheng, Chiu C. Tan 0001, Qun Li 0001, Weizhen Mao, Sanglu Lu   +5 more
openaire   +2 more sources

An efficient filling algorithm for counting regions

Computer Methods and Programs in Biomedicine, 2004
Region filling has many applications in computer graphics and image analysis. Some region filling tasks can be performed by fast scan line filling algorithms. Other region filling tasks require seed filling algorithms which are more general but slower.
Geraets, W.G.M., van Daatselaar, A.N., Verheij, H.G.C.   +2 more
openaire   +6 more sources

Photomultiplier Single Photon Counting Efficiency

Applied Optics, 1973
An RCA C31000F (8853) photomultiplier with a cathode quantum efficiency of 5.5% (for 633-nm light) was found to have a single photon counting efficiency of only 3.3%. The difference is shown to be due to small pulses well below the single electron peak in the output pulse height spectrum. These pulses are usually below the discriminator threshold level
D B Scarl
exaly   +3 more sources

Efficient techniques for k-mer counting

2015 IEEE 5th International Conference on Computational Advances in Bio and Medical Sciences (ICCABS), 2015
A large number of bioinformatics applications require counting of k-length substrings in genetically important long strings. K-mer counting generates the frequencies of each k-length substring in genome sequences. Genome assembly, repeat detection, multiple sequence alignment, error detection, and many other related applications use k-mer counting as a
Abdullah-Al Mamun 0002, Soumitra Pal 0001, Sanguthevar Rajasekaran   +2 more
openaire   +1 more source

Collection and counting efficiency

2017
Standards laboratories can provide a photocathode calibration for quantum efficiency, as a function of wavelength, but their measurements are performed with the photomultiplier operating as a photodiode. Each photoelectron released makes a contribution to the photocathode current but, if it is lost or fails to create secondary electrons at d1, it makes
openaire   +1 more source

An efficient procedure for manual platelet counting

Veterinary Record, 1989
Blood samples were collected by jugular venipuncture from 15 dairy heifers and the blood platelets were counted by manual methods. The platelets were found to be uniformly distributed across the rows, columns and sides of a Neubauer haemocytometer, and it was shown that counting any 10 squares on either side of the haemocytometer and multiplying by a ...
J K, Thibodeaux, J D, Roussel, R W, Adkinson, L L, Goodeaux   +3 more
openaire   +2 more sources

Efficient cyclic weighted reference counting

14th Symposium on Computer Architecture and High Performance Computing, 2002. Proceedings., 2003
Weighted reference counting is a very simple and efficient memory management system for multiprocessor architectures. This paper extends the weighted reference counting algorithm to work efficiently with cyclic data structures.
openaire   +2 more sources

Efficient Colored Orthogonal Range Counting

SIAM Journal on Computing, 2008
Let $P$ be a set of $n$ points in $\mathbb{R}^d$, so that each point is colored by one of $C$ given colors. We present algorithms for preprocessing $P$ into a data structure that efficiently supports queries of the following form: Given an axis-parallel box $Q$, count the number of distinct colors of the points of $P\cap Q$.
Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin   +3 more
openaire   +1 more source

Accurate and Efficient Counting in Dynamic Networks

2014 IEEE 33rd International Symposium on Reliable Distributed Systems, 2014
Dynamic network is the abstraction of networks with frequent topology changes arising from node mobility or other reasons. With the model of dynamic network, fundamental distributed computing problems can be formally studied with rigorous correctness. In this work, we study the counting problem, which plays a significant role in many applications, such
Zhiwei Yang 0004, Weigang Wu, Yishun Chen, Xiaola Lin   +3 more
openaire   +1 more source

Efficient monitoring of autocorrelated Poisson counts

IISE Transactions, 2019
Statistical surveillance for autocorrelated Poisson counts has drawn considerable attention recently.
Jian Li 0023, Qiang Zhou 0002, Dong Ding
openaire   +1 more source