Liminal Lines:work for euphonium and live electronics

This is the first in series of works that explores the edges of musical styles, in particular the musical language associated with the brass band traditions and the relationship between this performance genre and the work of experimental electronic composition.

FRP reinforcement of timber structures

Timber engineering has advanced over recent decades to offer an alternative to traditional materials and methods. The bonding of fibre reinforced plastics (FRP) with adhesives to timber structures for repair and strengthening has many advantages. However, the lack of established design rules has strongly restrained the use of FRP strengthening in many situations, where these could be a preferable option to most traditional techniques. A significant body of research has been carried out in recent years on the performance of FRP reinforced timber and engineered wood products. This paper gives a State of the Art summary of material formulations, application areas, design approaches and quality control issues for practical engineers to introduce on-site bonding of FRP to timber as a new way in design for structural repair and rehabilitation.

Fluorescent Logic Systems for Sensing and Molecular Computation: Structure-Activity Relationships in Edge-Detection

Molecular logic-based computation continues to throw up new applications in sensing and switching, the newest of which is the edge detection of objects. The scope of this phenomenon is mapped out by the use of structure-activity relationships, where several structures of the molecules and of the objects are examined. The different angles and curvatures of the objects are followed with good-fidelity in the visualized edges, even when the objects are in reverse video.

Einfamilienhaus bei Ramelton

The large scale horizontally mounted fibre cement panels follow an orthogonal grid, albeit with only two right angles, one each on the building's longitudinal east and west elevations above the car port. The remaining façade edges describe rising and declining lines. it goes without saying that the structural details of this purist house have been meticulously executed. It is simply complete, lacking nothing and without anything further required.

Generating Realistic Labelled, Weighted Random Graphs

Generative algorithms for random graphs have yielded insights into the structure and evolution of real-world networks. Most networks exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation. Usually, random graph models consider only structural information, but many real-world networks also have labelled vertices and weighted edges. In this paper, we present a generative model for random graphs with discrete vertex labels and numeric edge weights. The weights are represented as a set of Beta Mixture Models (BMMs) with an arbitrary number of mixtures, which are learned from real-world networks. We propose a Bayesian Variational Inference (VI) approach, which yields an accurate estimation while keeping computation times tractable. We compare our approach to state-of-the-art random labelled graph generators and an earlier approach based on Gaussian Mixture Models (GMMs). Our results allow us to draw conclusions about the contribution of vertex labels and edge weights to graph structure.

Factors predicting the portion size and perceived fillingness of evening meals in Danish and Iris households

Purpose:
This study explored how meal-related variables, socio-demographics and psychological predispositions affect the portion
size and perceived fillingness of an evening meal in Danish and Irish households.
Methods:
Using survey data collected in 2115 respondents from Denmark (DK) and the Island of Ireland (IOI), we compared four
sets of predictors of the portion size chosen for four evening meals (i.e. pizza/soup/chicken salad/pork meal): Biological
variables (hunger, thirst), socio-demographic variables (gender, age, BMI); psychological predispositions (cognitive
restraint, uncontrolled eating, emotional eating, general health interest) and meal-related variables (expected fillingness,
perceived healthiness, liking, frequency of consumption). We also compared five sets of predictors (the previous
four plus portion size) of perceived portion fillingness.
Results:
Portion size selections were associated mainly with demographic variables (gender, BMI) and psychological predispositions
(cognitive restraint, uncontrolled eating). In addition, only liking and sometimes expected healthiness (mealrelated
variables) appeared as drivers. Conversely, perceived portion fillingness was mostly influenced by the selected
portion size as well as expected fillingness and liking. There were some differences between meals; e.g. GHI not a
predictor for Pizza but a predictor for Chicken salad. Also some country differences were observed; emotional eating
predicted portion selection in the IOI but not DK.
Conclusions:
When making portion size selections at home, psychological predispositions, restrained and uncontrolled eating as well
as meal-related variables, liking and healthiness explained the decisions. However, surprisingly, individuals’ expected
fillingness of a food did not influence their portion size selection but was a driver of fillingness of the selected portion.

Compact Routing Messages in Self-Healing Trees

Existing compact routing schemes, e.g., Thorup and Zwick [SPAA 2001] and Chechik [PODC 2013], often have no means to tolerate failures, once the system has been setup and started. This paper presents, to our knowledge, the first self-healing compact routing scheme. Besides, our schemes are developed for low memory nodes, i.e., nodes need only O(log2 n) memory, and are thus, compact schemes.
We introduce two algorithms of independent interest: The first is CompactFT, a novel compact version (using only O(log n) local memory) of the self-healing algorithm Forgiving Tree of Hayes et al. [PODC 2008]. The second algorithm (CompactFTZ) combines CompactFT with Thorup-Zwick’s treebased compact routing scheme [SPAA 2001] to produce a fully compact self-healing routing scheme. In the self-healing model, the adversary deletes nodes one at a time with the affected nodes self-healing locally by adding few edges. CompactFT recovers from each attack in only O(1) time and ∆ messages, with only +3 degree increase and O(log∆) graph diameter increase, over any sequence of deletions (∆ is the initial maximum degree).
Additionally, CompactFTZ guarantees delivery of a packet sent from sender s as long as the receiver has not been deleted, with only an additional O(y log ∆) latency, where y is the number of nodes that have been deleted on the path between s and t. If t has been deleted, s gets informed and the packet removed from the network.