Art as parodic practice

Perhaps because of the pervasive sampling, remixing, rehashing and promiscuous citational blending in postmodernity, where quote marks dissolve, parody has come to be seen as a somewhat archaic concept, pertaining to cultures more stably codified and hierarchically ordered, rather than subject to the fluctuations of global markets and phantasmagoric projections affecting the flow of investment moneys. Given the anxiogenic nature of postmodernity under its various guises, willed as hypermodernityand metamodernity or supermodernity, the ideologeme ‘parody’ might be seen as nostalgic symptom in the wake of the ‘grand narratives’ (Lyotard 1984 [1979]) – a rehearsed post-apocalyptic nostalgia for a world of neo-feudalism and fiefdoms, where the seasonal lifting of prohibition for carnival brought on the ‘allowed fool’ (Shakespeare 2006) for parody’s brief upending of the hierarchical order, when high became low, mouth met anus, and wise became mad, even within the Pater Noster of the Holy Mass. (Bakhtin 1980: 78). How the revisitation of parody might illuminate contemporary cultural politics is a driving question behind this collection, a questionmade more urgent by recent global developments of terror.

Robot coordination for energy-balanced matching and sequence dispatch of robots to events

Given a set of events and a set of robots, the dispatch problem is to allocate one robot for each event to visit it. In a single round, each robot may be allowed to visit only one event (matching dispatch), or several events in a sequence (sequence dispatch). In a distributed setting, each event is discovered by a sensor and reported to a robot. Here, we present novel algorithms aimed at overcoming the shortcomings of several existing solutions. We propose pairwise distance based matching algorithm (PDM) to eliminate long edges by pairwise exchanges between matching pairs. Our sequence dispatch algorithm (SQD) iteratively finds the closest event-robot pair, includes the event in dispatch schedule of the selected robot and updates its position accordingly. When event-robot distances are multiplied by robot resistance (inverse of the remaining energy), the corresponding energy-balanced variants are obtained. We also present generalizations which handle multiple visits and timing constraints. Our localized algorithm MAD is based on information mesh infrastructure and local auctions within the robot network for obtaining the optimal dispatch schedule for each robot. The simulations conducted confirm the advantages of our algorithms over other existing solutions in terms of average robot-event distance and lifetime.

A cavalcade of erasures: an educational audio-visual presentation

Dirk de Bruyn has been creating film works for over 35 years; mostly in the hand-made, 'direct animation' mode. He also performs live with multiple projections of his films in a highly embodied mode of expanded cinema performance. His work is renowned for its intricate, suggestive layering of sound and image, and use of sumptuous, blooming fields of colour.An active participant in our PyR16, Dirk will be discussing his conceptual work, his meticulous creative process, and his particular relationship with the materials, light, space and time both on film and stage, illustrating with some examples.We'll conclude with a Q&A session with the attendants.