✦ LIBER ✦

Number of cycles distribution in circulating systems

✍ Scribed by Uzi Mann; E.J. Crosby; Michael Rubinovitch

Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 388 KB
Volume: 29
Category: Article
ISSN: 0009-2509
DOI: 10.1016/0009-2509(74)80193-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycle time distribution in circulating s

Cycle time distribution in circulating systems

✍ Uzi Mann; E.J. Crosby 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 388 KB

The cycle time distribution (CTD) within closed, continuously circulating systems is defined and related to the residence time distributions of flow regions which make up such systems. Examules of the an&cation of the CTD are noted and experimental methods for determining CTDs for va;ious systems-&e

On the distribution and number of limit

On the distribution and number of limit cycles for quadratic systems with two foci

✍ Zhang Pingguang 📂 Article 📅 2002 🏛 SP Birkhäuser Verlag Basel 🌐 English ⚖ 239 KB

Distribution of the number of nonappeari

Distribution of the number of nonappearing lengths of cycles in a random mapping

✍ A. S. Ambrosimov 📂 Article 📅 1978 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 166 KB

On the Number of Cycles of p-adic Dynami

On the Number of Cycles of p-adic Dynamical Systems

✍ Andrei Khrennikov; Marcus Nilsson 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 148 KB

We found the asymptotics, p Ä , for the number of cycles for iteration of monomial functions in the fields of p-adic numbers. This asymptotics is closely connected with classical results on the distribution of prime numbers.

The number of edges in a maximum cycle—d

The number of edges in a maximum cycle—distributed graph

✍ Yongbing Shi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 288 KB

Shi, Y., The number of edges in a maximum cycle-distributed graph, Discrete Mathematics 104 (1992) 205-209. Let f(n) (f\*(n)) be the maximum possible number of edges in a graph (2-connected simple graph) on n vertices in which no two cycles prove that, for every integer n > 3, f(n) 3 n + k + [i( [~(

On actuators number in distributed syste

On actuators number in distributed systems

✍ A. El Jai; H. Hamzaoui 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 283 KB

The aim of this brief paper is to give original results regarding inputs for abstract distributed parameter systems. More precisely we show that if we increase the number of actuators exciting a system, the transfer cost functional will be cheaper. Until now this intuitive result has only been notic