Carry investing on the yield curve

M Martens, P Beekhuizen, J Duyvesteyn… - Financial Analysts …, 2019 - Taylor & Francis
Bond carry is the expected return on a bond when the yield curve does not change. The
curve carry strategy within each country constructs buckets based on bond maturities on a …

Uncovering trend rules

P Beekhuizen, WG Hallerbach - Available at SSRN 2604942, 2015 - papers.ssrn.com
Trend rules are widely used to infer whether financial markets show an upward or downward
trend. By taking suitable long or short positions, one can profit from a continuation of these …

Reduction of a polling network to a single node

P Beekhuizen, D Denteneer, J Resing - Queueing Systems, 2008 - Springer
We consider a discrete-time tree network of polling servers where all packets are routed to
the same node (called node 0), from which they leave the network. All packets have unit size …

Performance analysis of small non-uniform packet switches

P Beekhuizen, J Resing - Performance Evaluation, 2009 - Elsevier
… If we assume that p i j > 0 for all i and j , the Markov chain is aperiodic and … p i j . For instance,
from intermediate state ( 0 , 1 , 0 , 3 ) , we go to state ( 2 , 1 , 3 , 3 ) with probability p 12 p 33 …

Analysis of a tandem network model of a single-router Network-on-Chip

P Beekhuizen, D Denteneer, I Adan - Annals of operations research, 2008 - Springer
… observation that limp↓0 q(p) represents the service rate if all flits arrive at an empty switch.
In order to derive a good approximation to q(p) for all p, we will interpolate between the two …

Performance analysis of networks on chips

P Beekhuizen - 2010 - research.tue.nl
Modules on a chip (such as processors and memories) are traditionally connected through
a single link, called a bus. As chips become more complex and the number of modules on a …

Approximation of discrete-time polling systems via structured Markov chains

P Beekhuizen, JAC Resing - Proceedings of the Fourth International …, 2009 - dl.acm.org
… queue according to the routing matrix P, and again if this … moves according to the routing
matrix P, until it moves to one … Such behaviour cannot occur in our model because P(i, i)=0. …

An analytical study of network coding in the presence of real-time messages

M Aoun, P Beekhuizen… - 2010 IEEE International …, 2010 - ieeexplore.ieee.org
… We start by finding the probabilities P(success|L = a, N = b) that a packet of type-1 arriving
to the system when it is in state (L = a, N = b) is served by the router server and completes its …

End-to-end delays in polling tree networks

P Beekhuizen, TJJ Denteneer, JAC Resing - 3rd International ICST …, 2010 - eudl.eu
P-matrix. Then all rows of P are identical, apart from being shifted. Because, in addition, Xj
… Similarly, if the P-matrix is not circulant but can be written in circulant form, it can also be …

Packet skipping and network coding for delay-sensitive network communication

M Aoun, P Beekhuizen, A Argyriou, D Denteneer… - Performance …, 2012 - Elsevier
We provide an analytical study of the impact of packet skipping and opportunistic network
coding on the timely communication of messages through a single network element. In a first …