Coding livecoding

Livecoding is an artistic programming practice in which an artist's low-level interaction can be observed with sufficiently high fidelity to allow for transcription and analysis. This paper presents the first reported" coding" of livecoding videos. From an identified corpus of videos available on the web, we coded performances of two different livecoding artists, recording both the (textual) programming edit events and the musical effect of these edits.

An observation about circular shortest paths: Dealing with additional constraints using branch and bound

Circular shortest paths represent a powerful methodology for image segmentation. The circularity condition ensures that the contour found by the algorithm is closed, a natural requirement for regular objects. Several implementations have been proposed in the past that either promise closure with high probability or ensure closure strictly, but with a mild computational efficiency handicap. Circularity can be viewed as a priori information that helps recover the correct object contour. Our "observation" is that circularity is only one among many possible constraints that can be imposed on shortest paths to guide them to a desirable solution. In this contribution, we illustrate this opportunity under a volume constraint but the concept is generally applicable. We also describe several adornments to the circular shortest path algorithm that proved useful in applications. © 2011 IEEE.

A communication model and partitioning algorithm for streaming applications for an embedded MPSoC

Energy efficient embedded computing enables new application scenarios in mobile devices like software-defined radio and video processing. The hierarchical multiprocessor considered in this work may contain dozens or hundreds of resource efficient VLIW CPUs. Programming this number of CPU cores is a complex task requiring compiler support. The stream programming paradigm provides beneficial properties that help to support automatic partitioning. This work describes a compiler for streaming applications targeting the self-build hierarchical CoreVA-MPSoC multiprocessor platform. The compiler is supported by a programming model that is tailored to fit the streaming programming paradigm. We present a novel simulated-annealing (SA) based partitioning algorithm, called Smart SA. The overall speedup of Smart SA is 12.84 for an MPSoC with 16 CPU cores compared to a single CPU implementation. Comparison with a state of the art partitioning algorithm shows an average performance improvement of 34.07%.

Automated fit quantification of tibial nail designs during the insertion using computer three-dimensional modelling

Intramedullary nailing is the standard fixation method for displaced diaphyseal fractures of the tibia. An optimal nail design should both facilitate insertion and anatomically fit the bone geometry at its final position in order to reduce the risk of stress fractures and malalignments. Due to the nonexistence of suitable commercial software, we developed a software tool for the automated fit assessment of nail designs. Furthermore, we demonstrated that an optimised nail, which fits better at the final position, is also easier to insert. Three-dimensional models of two nail designs and 20 tibiae were used. The fitting was quantified in terms of surface area, maximum distance, sum of surface areas and sum of maximum distances by which the nail was protruding into the cortex. The software was programmed to insert the nail into the bone model and to quantify the fit at defined increment levels. On average, the misfit during the insertion in terms of the four fitting parameters was smaller for the Expert Tibial Nail Proximal bend (476.3 mm2, 1.5 mm, 2029.8 mm2, 6.5 mm) than the Expert Tibial Nail (736.7 mm2, 2.2 mm, 2491.4 mm2, 8.0 mm). The differences were statistically significant (p ≤ 0.05). The software could be used by nail implant manufacturers for the purpose of implant design validation.

A computer generated model of adenosine receptors rationalising binding and selectivity of receptor ligands

Computer graphic analyses on a broad spectrum of adenosine receptor ligands has shown that both the A1 and A2 adenosine receptors have three binding sites. The spatial relationship of these three binding sites has been defined. Adenosine orientation at A1 and A2 is different.

Creating good lives through computer games

In this chapter we aim to explore how videogames can lead to improvements in wellbeing. Following Keyes (2007) and Huppert and So (2012) we view wellbeing as a multidimensional concept with both hedonic and eudaimonic aspects. In this chapter we take a broad approach in terms of exploring the impact of videogames on the psychological, social, and physical components of wellbeing. We explore how videogames have been shown to have an impact in each of these domains. Although there is a great deal of evidence for the actual and potential positive impacts of videogames, there are many unanswered questions regarding the situations in which there is likely to be an impact of videogame play on wellbeing, as well as the aspects of wellbeing that are likely to be impacted by videogame play. We conclude the chapter by outlining the key questions for future research. Our focus in this chapter is on the positive influences of videogames. We do not explore research on contexts in which negative impacts are possible or subgroups for which videogames could cause harm. However, these questions are obviously important and we see balanced engagement with age-appropriate videogames as a key prerequisite for any of the wellbeing benefits discussed below.

Multi-action recognition via stochastic modelling of optical flow and gradients

In this paper we propose a novel approach to multi-action recognition that performs joint segmentation and classification. This approach models each action using a Gaussian mixture using robust low-dimensional action features. Segmentation is achieved by performing classification on overlapping temporal windows, which are then merged to produce the final result. This approach is considerably less complicated than previous methods which use dynamic programming or computationally expensive hidden Markov models (HMMs). Initial experiments on a stitched version of the KTH dataset show that the proposed approach achieves an accuracy of 78.3%, outperforming a recent HMM-based approach which obtained 71.2%.

Energy efficient home with price sensitive stochastically programmable TCAs

Introduction of dynamic pricing in present retail market, considerably affects customers with an increased cost of energy consumption. Therefore, customers are enforced to control their loads according to price variation. This paper proposes a new technique of Home Energy Management, which helps customers to minimize their cost of energy consumption by appropriately controlling their loads. Thermostatically Controllable Appliances (TCAs) such as air conditioner and water heater are focused in this study, as they consume more than 50% of the total household energy consumption. The control process includes stochastic dynamic programming, which incorporated uncertainties in price and demand variation. It leads to an accurate selection of appliance settings. It is followed by a real time control of selected appliances with its optimal settings. Temperature set points of TCAs are adjusted based on price droop which is a reflection of actual cost of energy consumption. Customer satisfaction is maintained within limits using constraint optimization. It is showed that considerable energy savings is achieved.

Improving robot vision models for object detection through interaction

We propose a method for learning specific object representations that can be applied (and reused) in visual detection and identification tasks. A machine learning technique called Cartesian Genetic Programming (CGP) is used to create these models based on a series of images. Our research investigates how manipulation actions might allow for the development of better visual models and therefore better robot vision. This paper describes how visual object representations can be learned and improved by performing object manipulation actions, such as, poke, push and pick-up with a humanoid robot. The improvement can be measured and allows for the robot to select and perform the `right' action, i.e. the action with the best possible improvement of the detector.