We aim for composing algorithmic music in an interactive way with multiple participants. To this end we have developed an interpreter for a sublanguage of the non-strict functional programming language Haskell that allows the modification of a program during its execution. Our system can be used both for musical live-coding and for demonstration and education of functional programming.

By using the extended Sturm-Liouville theorem for symmetric functions, we introduce the following differential equation ( ) 0 ) ( ) 2 ) 1 ( 1 ( ) ( 1 2 ) ( 2 2 2 = Φ − − + + + Φ′ − + − − Φ ′ ′ x x x m a x m x x x n n m n n m n γ β α , in which ) 1 2 2 2 ( 2 + − + − = m a s s β ; ) 1 )( 1 2 ( 2 ) 1 2 2 2 ( 2 + − + + − + − + = m a r r m a s s γ and ( ) ) ) 1 ( 1 )( 2 / ) 1 ( ( 2 2 n n m s r s mn ...

In this work we experimentally examine the forensic soundness of the use of forensic bootable CD/DVDs as forensic examination environments. Several Linux distributions with bootable CD/DVDs which are marketed as forensic examination environments are used to perform a forensic analysis of a captured computer system. Before and after the bootable CD/DVD examination, the computer system's hard dis...

mathematical sciences publishers i l i li t t r s s s s c c c a e a i al ie e li e h n pub h t ti l i li r m m s s s s c c c a e a i al ie e li e i l i li t t r s s s s c c c a e a i al ie e li e h n pub h t ti l i li r m m s s s s c c c a e a i al ie e li e mathematical sciences publishers i l i li t t r s s s s c c c a e a i al ie e li e i l i li i l i li t t r s s s s c c c a e a i al ie e l...

Caching is undoubtedly one of the most popular solution that easily scales up with a world-wide deployment of resources. Records in Domain Name System (DNS) caches are kept for a pre-set duration (time-to-live or TTL) to avoid becoming outdated. Modern caches are those that set locally the TTL regardless of what authoritative servers say. In this paper, we introduce analytic models to study the...

Detecting loops in data networks usually involves counting down a hop limit or caching data at each hop to detect a cycle. Using a hop limit means that the origin of a packet must know the maximum distance a packet could travel without loops. It also means a loop is not detected until it travels that maximum distance, even if that is many loops. Caching a packet signature at each hop, such as a...