Zobrazeno 1 - 10
of 80
pro vyhledávání: '"Leopold Flatto"'
Autor:
Leopold Flatto
Publikováno v:
High Frequency. 2:169-174
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25c5e870120c2c8cf9f21bcca57d6deb
https://doi.org/10.1002/hf2.10048
https://doi.org/10.1002/hf2.10048
Autor:
Jeffrey C. Lagarias, Leopold Flatto
Publikováno v:
Nonlinearity. 13:1055-1071
The tent map tβ:[0,1]→[0,1] with parameter 1 < β≤2 is defined by This paper derives formulae for its dynamical zeta and lap-counting functions which exhibit the renormalization structure of such maps. It relates these functions to the centrally
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8bb4e060b66ee19eda00a8a76790ebd6
https://doi.org/10.1088/0951-7715/13/4/304
https://doi.org/10.1088/0951-7715/13/4/304
Publikováno v:
Algorithmica. 22:448-476
Starting at time 0, unit-length intervals arrive and are placed on the positive real line by a unit-intensity Poisson process in two dimensions; the probability of an interval arriving in the time interval [t,t+\( \Delta \)t] with its left endpoint i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5de5c012a7cc39a37b83cd9403c8b17
https://doi.org/10.1007/pl00009233
https://doi.org/10.1007/pl00009233
Autor:
Leopold Flatto, Jeffrey C. Lagarias
Publikováno v:
Ergodic Theory and Dynamical Systems. 17:369-403
Linear mod one transformations are those maps of the unit interval given by $f_{\beta,\alpha}(x)=\beta x+\alpha$ (mod 1), with $\beta>1$ and $0\le\alpha 2$, and this paper determines $N_{\beta,\alpha}$ in the remaining cases where $1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6f7634e422a7ca589b1e2b1f5899797
https://doi.org/10.1017/s0143385797069812
https://doi.org/10.1017/s0143385797069812
Autor:
Jeffrey C. Lagarias, Leopold Flatto
Publikováno v:
Ergodic Theory and Dynamical Systems. 17:123-146
Linear mod one transformations are those maps of the unit interval given by $f_{\beta,\alpha}(x)=\beta x+\alpha$ (mod 1), with $\beta>1$ and $0\le\alpha2$. Finally, we give the criterion that $N_{\beta,\alpha}=1$ if and only if for all $n\ge 1$ the m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d0c946fbe3b0439f59a046d3688b855
https://doi.org/10.1017/s0143385797069691
https://doi.org/10.1017/s0143385797069691
Autor:
Leopold Flatto, Jeffrey C. Lagarias
Publikováno v:
Ergodic Theory and Dynamical Systems. 16:451-491
Linear mod one transformations are the maps of the unit interval given by fβα(x) = βx + α (mod 1), with β > 1 and 0 ≤ α < 1. The lap-counting function is the function where the lap number Ln essentially counts the number of monotonic pieces o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b2a4210c3a77fd5976f19a980048a5eb
https://doi.org/10.1017/s0143385700008920
https://doi.org/10.1017/s0143385700008920
Publikováno v:
Communications in Statistics. Stochastic Models. 12:215-243
A basic multiprocessor version of the makespan scheduling problem requires that n tasks be scheduled on m identical processors so as to minimize the latest task finishing time. In the standard probability model considered here, the task durations are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b9715f38a48a9a433ea01c4f91c3a43
https://doi.org/10.1080/15326349608807382
https://doi.org/10.1080/15326349608807382
Publikováno v:
Acta Arithmetica. 70:125-147
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::333ef00a1ade87a7b5e27e1a9720454b
https://doi.org/10.4064/aa-70-2-125-147
https://doi.org/10.4064/aa-70-2-125-147
Publikováno v:
SIAM Journal on Computing. 22:650-659
This paper provides an examination of an abstract moving-server system that models several computer applications, including software debugging and accessing compressed data. In this model, the server moves on the unit interval $[0,1]$, serving reques
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8192e916cdf4f1b40a44022c5ef88240
https://doi.org/10.1137/0222043
https://doi.org/10.1137/0222043
Publikováno v:
Acta Informatica. 30:409-423
Computer users with very long computations run the risk of losing work because of machine failures. Such losses can often be reduced by scheduling saves on secure storage devices of work successfully done. In the model studied here, the user leaves t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd4229ab61e2989b8cb0e58468b3768b
https://doi.org/10.1007/bf01210593
https://doi.org/10.1007/bf01210593