Results 11 to 20 of about 731,305 (291)
Efficient Counting with Optimal Resilience [PDF]
In the synchronous c-counting problem, we are given a synchronous system of n nodes, where up to f of the nodes may be Byzantine, that is, have arbitrary faulty behaviour. The task is to have all of the correct nodes count modulo c in unison in a self-stabilising manner: regardless of the initial state of the system and the faulty nodes' behavior ...
Christoph Lenzen 0001, Joel Rybicki
openaire +12 more sources
An efficient counting network [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Busch, Costas +3 more
openaire +3 more sources
Efficient Counting of Network Motifs [PDF]
Counting network motifs has an important role in studying a wide range of complex networks. However, when the network size is large, as in the case of Internet Topology and WWW graphs counting the number of motifs becomes prohibitive. Devising efficient motif counting algorithms thus becomes an important goal.
Dror Marcus, Yuval Shavitt
openaire +1 more source
Efficiency Evaluation of Software Faults Correction Based on Queuing Simulation
Fault-counting data are collected in the testing process of software development. However, the data are not used for evaluating the efficiency of fault correction activities because the information on the fault detection and correction times of each ...
Yuka Minamino +3 more
doaj +1 more source
An analytical method was developed for the rapid determination of 226Ra in water through liquid scintillation counting. The separation and purification of 226Ra from water were performed by co-precipitation using barium sulfate as the carrier; the direct
YIN Liangliang +4 more
doaj +1 more source
X-ray photon counting spectral imaging (x-CSI) determines a detected photon’s energy by comparing the charge it induces with several thresholds, counting how many times each is crossed (the standard method, STD).
Oliver L. P. Pickford Scienti +1 more
doaj +1 more source
Simple and Efficient Bilayer Cross Counting [PDF]
Summary: We consider the problem of counting the interior edge crossings when a bipartite graph \(G = (V,E)\) with node set \(V\) and edge set \(E\) is drawn such that the nodes of the two shores of the bipartition are drawn as distinct points on two parallel lines and the edges as straight line segments.
Wilhelm Barth +2 more
openaire +3 more sources
An automatic high throughput colony counter based on Unet++ segmentation model
Objective: To improve the detection efficiency of the aerobic plate counter, to meet the requirements of quality management system of the inspection and testing institutions and the application of laboratory LIMS system.
SHEN Ying +4 more
doaj +1 more source
Direct Cell Counting Using Macro-Scale Smartphone Images of Cell Aggregates
The field of bioengineering depends on technologies for stable cell culture. Conventionally, every process involved in cell culture has been performed manually, so the culture efficiency and stability can vary between trials or depending on the ...
Chikahiro Imashiro +5 more
doaj +1 more source
Efficient counting of degree sequences [PDF]
Novel dynamic programming algorithms to count the set $D(n)$ of zero-free degree sequences of length $n$, the set $D_c(n)$ of degree sequences of connected graphs on $n$ vertices and the set $D_b(n)$ of degree sequences of biconnected graphs on $n$ vertices exactly are presented.
openaire +2 more sources

