let g be a graph with p vertices and q edges and a = {0, 1, 2, . . . , [q/2]}. a vertex labeling f : v (g) → a induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. for a ∈ a, let vf (a) be the number of vertices v with f(v) = a. a graph g is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in a, |vf (a) − vf (b)| ≤ 1 and the in...

The Stream Control Transmission Protocol (SCTP) was developed to support the transfer of telephony signaling over IP networks. One of the ambitions when designing SCTP was to offer a robust transfer of traffic between hosts. For this reason SCTP was designed to support multihoming, which gives the possibility to set up several paths between the same hosts in the same session. If the primary pat...

The novella Coraline follows a young girl as she rescues her parents from an alternate reality. In his short story, author Neil Gaiman covers scarcely one week of Coraline’s life. Still, the descriptions of Coraline’s experiences and thoughts can engage Carl Jung’s psychological theories of personality structure and individuation. In particular, I will analyze how Coraline’s character illustrat...

Provisioners capture items both for delivery and for self-feeding. In doing so, they may travel directly to and from a single location, visit several patches on each excursion from a delivery point, or alternate excursions to different destinations. Prey suitable for self-feeding versus delivery have differing attributes, which means that they are often best sought in different places. Visiting...

MOTIVATION Pathway Hunter Tool (PHT), is a fast, robust and user-friendly tool to analyse the shortest paths in metabolic pathways. The user can perform shortest path analysis for one or more organisms or can build virtual organisms (networks) using enzymes. Using PHT, the user can also calculate the average shortest path (Jungnickel, 2002 Graphs, Network and Algorithm. Springer-Verlag, Berlin)...