A simple method for counting bacteria with active electron transport system in water and sediment samples [Translation from: Kiel. Meeresforsch. 31(2) 83-86, 1975]

Description of a simple method for counting bacteria with active electron transport systems in water and sediment samples. Sodium succinate, NADH and NADPH served as electron donors. It is possible to see several sites of electron transport in the larger cells. Especially impressive are the plankton-algae, protozoa, and small metazoa. This is a partial translation of the ”method” section only.

Progress report on fish counting on the Rivers Itchen and Test

This progress report summarises work on NSHEB Mark 10 fish counters which are installed at Woodmill on the River Itchen and Nurseling Mill and Connegar Bridge on the River Test. Counters are evaluated and salmon behaviour regarding the counters examined. The report includes a a list of equipment needed for the efficient running of the project in the future.

Symmetry-extended counting rules for periodic frameworks.

A symmetry-adapted version of the Maxwell rule appropriate to periodic bar-and-joint frameworks is obtained, and is further extended to body-and-joint systems. The treatment deals with bodies and forces that are replicated in every unit cell, and uses the point group isomorphic to the factor group of the space group of the framework. Explicit expressions are found for the numbers and symmetries of detectable mechanisms and states of self-stress in terms of the numbers and symmetries of framework components. This approach allows detection and characterization of mechanisms and states of self-stress in microscopic and macroscopic materials and meta-materials. Illustrative examples are described. The notion of local isostaticity of periodic frameworks is extended to include point-group symmetry.

Full counting statistics of transport through two-channel Coulomb blockade systems

A mesoscopic Coulomb blockade system with two transport channels is studied in terms of full counting statistics. It is found that the shot noise and skewness are crucially affected by the quantum mechanical interference. In particular, the super-Poisson behavior can be induced as a consequence of constructive interference, and can be understood by the formation of effective fast-and-slow transport channels. Dephasing and finite temperature effects are carried out together with physical interpretations.

Real-time counting of single electron tunneling through a T-shaped double quantum dot system

Real-time detection of single electron tunneling through a T-shaped double quantum dot is simulated, based on a Monte Carlo scheme. The double dot is embedded in a dissipative environment and the presence of electrons on the double dot is detected with a nearby quantum point contact. We demonstrate directly the bunching behavior in electron transport, which leads eventually to a super-Poissonian noise. Particularly, in the context of full counting statistics, we investigate the essential difference between the dephasing mechanisms induced by the quantum point contact detection and the coupling to the external phonon bath. A number of intriguing noise features associated with various transport mechanisms are revealed.

a computational proof of complexity of some restricted counting problems

South Central University

On Learning Counting Functions With Queries

We investigate the problem of learning disjunctions of counting functions, which are general cases of parity and modulo functions, with equivalence and membership queries. We prove that, for any prime number p, the class of disjunctions of integer-weighted counting functions with modulus p over the domain Znq (or Zn) for any given integer q ≥ 2 is polynomial time learnable using at most n + 1 equivalence queries, where the hypotheses issued by the learner are disjunctions of at most n counting functions with weights from Zp. The result is obtained through learning linear systems over an arbitrary field. In general a counting function may have a composite modulus. We prove that, for any given integer q ≥ 2, over the domain Zn2, the class of read-once disjunctions of Boolean-weighted counting functions with modulus q is polynomial time learnable with only one equivalence query, and the class of disjunctions of log log n Boolean-weighted counting functions with modulus q is polynomial time learnable. Finally, we present an algorithm for learning graph-based counting functions.