𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast, dataflow-oriented preprocessor for cluster counting

✍ Scribed by Markus Imhof

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
304 KB
Volume
360
Category
Article
ISSN
0168-9002

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Counting Boundary Paths for Oriented Per
Counting Boundary Paths for Oriented Percolation Clusters
✍ Paul Balister; BΓ©la BollobΓ‘s; Alan Stacey πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 301 KB

We shall use analytic methods to prove bounds on the analogue of the connective constant for the oriented percolation on β€«ήšβ€¬ 2 .

A fast cluster counting algorithm for pe
A fast cluster counting algorithm for percolation on and off lattices
✍ E. Stoll πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 343 KB

A fast counting algorithm is used to enumerate the clusters for determining their statistics, for investigation the percolation behavior of the largest cluster and for calculating the fractai dimensions D. The algorithm is suitable for parallel processing. It can be expanded for off-lattice systems,

A fast one-chip event-preprocessor and s
A fast one-chip event-preprocessor and sequencer for the Simbol-X Low Energy Detector
✍ T. Schanz; C. Tenzer; D. Maier; E. Kendziorra; A. Santangelo πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 200 KB

We present an FPGA-based digital camera electronics consisting of an Event-Preprocessor (EPP) for on-board data preprocessing and a related Sequencer (SEQ) to generate the necessary signals to control the readout of the detector. The device has been originally designed for the Simbol-X low energy de