Zobrazeno 1 - 10
of 64
pro vyhledávání: '"Robbert Fokkink"'
Publikováno v:
Humanities & Social Sciences Communications, Vol 8, Iss 1, Pp 1-8 (2021)
Abstract Since the 1960s China and India have engaged in a dispute about the demarcation of their shared border. This territorial dispute led to a brief war in 1962, and recurring flare-ups over the following decades, including during the summer of 2
Externí odkaz:
https://doaj.org/article/4ca6e488f14d42d6845cb6d446e2009b
Publikováno v:
Infectious Disease Modelling, Vol 6, Iss , Pp 36-45 (2021)
This paper repurposes the classic insight from network theory that long-distance connections drive disease propagation into a strategy for controlling a second wave of Covid-19. We simulate a scenario in which a lockdown is first imposed on a populat
Externí odkaz:
https://doaj.org/article/147c8949f44b4bd7b4fadcffe5dfc2d4
Publikováno v:
Infectious Disease Modelling
Infectious Disease Modelling, Vol 6, Iss, Pp 36-45 (2021)
Infectious Disease Modelling, 6
Infectious Disease Modelling, Vol 6, Iss, Pp 36-45 (2021)
Infectious Disease Modelling, 6
This paper repurposes the classic insight from network theory that long-distance connections drive disease propagation into a strategy for controlling a second wave of Covid-19. We simulate a scenario in which a lockdown is first imposed on a populat
Autor:
Jan-Tino Brethouwer, Robbert Fokkink, Kevin Greene, Roy Lindelauf, Caroline Tornquist, V. S. Subrahmanian
Publikováno v:
PLoS ONE, 17(11 November)
The China-India border is the longest disputed border in the world. The countries went to war in 1962 and there have been recurring border skirmishes ever since. Reports of Chinese incursions into Indian territory are now a frequent occurrence. This
Publikováno v:
Probability and Mathematical Statistics, 42(1)
Let S and X be independent random variables, assuming values in the set of non-negative integers, and suppose further that both E(S) and E(X) are integers satisfying E(S) ≥ E(X). We establish a sufficient condition for the tail probability P(S ≥
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::485e0fe70612309ef335d8210fc67e86
http://resolver.tudelft.nl/uuid:47bdef5b-7780-4f59-925e-737c53cb9dd1
http://resolver.tudelft.nl/uuid:47bdef5b-7780-4f59-925e-737c53cb9dd1
Publikováno v:
Mathematics of Operations Research. 44:1431-1449
Suppose some objects are hidden in a finite set $S$ of hiding places which must be examined one-by-one. The cost of searching subsets of $S$ is given by a submodular function and the probability that all objects are contained in a subset is given by
Autor:
Robbert Fokkink
Publikováno v:
2019-20 MATRIX Annals ISBN: 9783030624965
A symmetry of a tessellation is an isometry of the plane, or space, preserving the tessellation. What symmetry groups can one get? This is a classical problem in geometry, leading to the wallpaper groups of the plane or crystallographic groups in hig
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3591edf0d9d51ebc7970249eedb68b9f
https://doi.org/10.1007/978-3-030-62497-2_46
https://doi.org/10.1007/978-3-030-62497-2_46
Publikováno v:
Proceedings of the Institution of Mechanical Engineers. Part P, Journal of Sports Engineering and Technology
In a cycling time trial, the rider needs to distribute his power output optimally to minimize the time between start and finish. Mathematically, this is an optimal control problem. Even for a straight and flat course, its solution is non-trivial and
Autor:
Robbert Fokkink, Reem Yassawi
Publikováno v:
Indagationes Mathematicae
Indagationes Mathematicae, Elsevier, 2018, 29 (4), pp.1105-1113. ⟨10.1016/j.indag.2018.05.011⟩
Indagationes Mathematicae, Elsevier, 2018, 29 (4), pp.1105-1113. ⟨10.1016/j.indag.2018.05.011⟩
We prove that topologically isomorphic linear cellular automaton shifts are algebraically isomorphic. Using this, we show that two distinct such shifts cannot be isomorphic. We conclude that the automorphism group of a linear cellular automaton shift
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a24bace5880f1b6a377bfff580b8a6e
https://hal.archives-ouvertes.fr/hal-02093706
https://hal.archives-ouvertes.fr/hal-02093706
Publikováno v:
Israel Journal of Mathematics. 209:803-823
Schweiger introduced the notion of a subtractive algorithm, to classify certain types of multidimensional continued fractions. We study the limit behaviour of one particular subtractive algorithm, which generalises a continued fraction algorithm that