Tsukuba Expo ‘85 is huge, interesting, and fun. The Japanese pavilions are plush and well-organized, and contain some impressive artificial intelligence demonstrations. The U.S. pavilion is an embarrassment. Tsukuba Expo ‘85 opened on March 17,1985, to enormous publicity. The New York Times reported that “the budget for the fair is more than $2 billion, and individual companies have spent large...

Introduction This paper arises from a programme of research among food sector SMEs in the North West of England. The research project included both qualitative and qualitative phases and its primary focus was on the growth and development needs of the sample firms. The first part of the title derives from the focus on growth and, more specifically, strategies for growth relative to the four qua...

ABSTRACT A new paradigm of Coulter counting is developed using electrohydrodynamic liquid jets in lieu of solid state pores as the sensing aperture. The electrohydrodynamic jet was successfully used to detect micron-sized particles through resistive pulse sensing. Similar to conventional Coulter counting, the relative current change is proportional to the particle-tojet volume ratio. Compared t...

MRIM research group has participated in two tasks (ad-hoc image-based retrieval and case-based retrieval) of the ImageCLEF2012 Medical Retrieval track. In our contribution, we study the frequency shift problem that happens when using concepts instead of words as indexing terms. The main goal of our experiments is to check the validity of our new counting strategy of concepts (Relative Count), w...

In this paper, we present a general methodology to solve a wide variety of classical lattice path counting problems in a uniform way. These counting problems are related to Dyck paths, Motzkin paths and some generalizations. The methodology uses weighted automata, equations of ordinary generating functions and continued fractions. This new methodology is called Counting Automata Methodology. It...

In this article we provide new explicit Chebyshev’s bounds for the prime counting function ψ(x). The proof relies on two new arguments: smoothing the prime counting function which allows to generalize the previous approaches, and a new explicit zero density estimate for the zeros of the Riemann zeta function.

The class of counting processes constitutes a significant part of applied probability. The classic counting processes include Poisson processes, nonhomogeneous Poisson processes, and renewal processes. More sophisticated counting processes, including Markov renewal processes, Markov modulated Poisson processes, age-dependent counting processes, and the like, have been developed for accommodatin...