House at Bogwest - Best House 2012 RIAI Architecture Awards:A House Loved into Existence

Full length critical peer review article about House at Bogwest, which was the winner of the 2012 RIAI Best House award, by architect Emmett Scanlon. Photographs by Alice Clancy. Photographs and plans describing House at Bogwest.

House at Bogwest:Emerging Architecture

Feature on House at Bogwest. Includes text by Steve Larkin and Emmet Scanlon. Includes photographs by Alice Clancy and drawings by Steve Larkin.

An Gaelaras, by O'Donnell and Tuomey:The Building blocks of Language: Review by Rick LeVert and Tarla MacGabhann

The opening of An Gaelaras - the Irish language cultural centre in Derry designed by O'Donnell + Tuomey - is the most significant architectural addition to the symbolic landscape of the Walled City in recent times. It marks nothing less than a physical re-surfacing and a normalisation of the Irish language in this long fragmented city. This alone places An Gaelaras in a delicate historical arc that spans over 1500 years of architectural heritage and links it with the now invisible ruins of St Columba's original 6th century monastery.

On the Complexity of Universal Leader Election

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have not been proven for randomized algorithms. The "obvious" lower bounds of O(m) messages (m is the number of edges in the network) and O(D) time (D is the network diameter) are non-trivial to show for randomized (Monte Carlo) algorithms. (Recent results that show that even O(n) (n is the number of nodes in the network) is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms (except for the limited case of comparison algorithms, where it was also required that some nodes may not wake up spontaneously, and that D and n were not known).

We establish these fundamental lower bounds in this paper for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (such algorithms should work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make anyuse of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time algorithm is known. A slight adaptation of our lower bound technique gives rise to an O(m) message lower bound for randomized broadcast algorithms.

An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. (The answer is known to be negative in the deterministic setting). We answer this problem partially by presenting a randomized algorithm that matches both complexities in some cases. This already separates (for some cases) randomized algorithms from deterministic ones. As first steps towards the general case, we present several universal leader election algorithms with bounds that trade-off messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.

Portrush: Architecture for the North Irish Coast

The North Irish coast resembles one of the unique landscapes that define the scenic character of the place. To understand place you need to engage with stories and histories behind it. The search for Portrush has to start from Ulster. This book offers a journey to explore histories, traditions, festivities and the architecture of the Irish town. Approaching Portrush as a field of experimental architectural studio, the studio at Queen’s University Belfast teamed up to rediscover the Irish coastal condition and have a rethink about the origins and ingredients of Irish architecture and landscape. This book records and discusses this ambitious project and its outcome. Divided into two parts, the book introduces a comprehensive contextual and historical investigation into the heritage, culture and architecture followed by a display of students’ theoretical encounters and designs.

Synthesis and characterization of amphiphilic star copolymers of 2-(dimethylamino) ethyl methacrylate and methyl methacrylate: Effects of architecture and composition

Six amphiphilic star copolymers comprising hydrophilic units of 2-(dimethylamino)ethyl methacrylate (DMAEMA) and hydrophobic units of methyl methacrylate (MMA) were prepared by the sequential group transfer polymerization (GTP) of the two comonomers and ethylene glycol dimethacrylate (EGDMA) cross-linker. Four star-block copolymers of different compositions, one miktoarm star, and one statistical copolymer star were synthesized. The molecular weights (MWs) and MW distributions of all the star copolymers and their linear homopolymer and copolymer precursors were characterized by gel permeation chromatography (GPC), while the compositions of the stars were determined by proton nuclear magnetic resonance (H-1 NMR) spectroscopy. Tetrahydrofuran (THF) solutions of all the star copolymers were characterized by static light scattering to determine the absolute weight-average MW ((M) over bar (w)) and the number of arms of the stars. The R, of the stars ranged between 359,000 and 565,000 g mol(-1), while their number of arms ranged between 39 and 120. The star copolymers were soluble in acidic water at pH 4 giving transparent or slightly opaque solutions, with the exception of the very hydrophobic DMAEMA(10)-b-MMA(30)-star, which gave a very opaque solution. Only the random copolymer star was completely dispersed in neutral water, giving a very opaque solution. The effective pKs of the copolymer stars were determined by hydrogen ion titration and were found to be in the range 6.5-7.6. The pHs of precipitation of the star copolymer solutions/dispersions were found to be between 8.8-10.1, except for the most hydrophobic DMA-EMA(10)-b-MMA(30)-Star, which gave a very opaque solution over the whole pH range. (c) 2006 Elsevier Ltd. All rights reserved.

Analysis of Dependence Tracking Algorithms for Task Dataflow Execution

Processor architectures has taken a turn towards many-core processors, which integrate multiple processing cores on a single chip to increase overall performance, and there are no signs that this trend will stop in the near future. Many-core processors are harder to program than multi-core and single-core processors due to the need of writing parallel or concurrent programs with high degrees of parallelism. Moreover, many-cores have to operate in a mode of strong scaling because of memory bandwidth constraints. In strong scaling increasingly finer-grain parallelism must be extracted in order to keep all processing cores busy.

Task dataflow programming models have a high potential to simplify parallel program- ming because they alleviate the programmer from identifying precisely all inter-task de- pendences when writing programs. Instead, the task dataflow runtime system detects and enforces inter-task dependences during execution based on the description of memory each task accesses. The runtime constructs a task dataflow graph that captures all tasks and their dependences. Tasks are scheduled to execute in parallel taking into account dependences specified in the task graph.

Several papers report important overheads for task dataflow systems, which severely limits the scalability and usability of such systems. In this paper we study efficient schemes to manage task graphs and analyze their scalability. We assume a programming model that supports input, output and in/out annotations on task arguments, as well as commutative in/out and reductions. We analyze the structure of task graphs and identify versions and generations as key concepts for efficient management of task graphs. Then, we present three schemes to manage task graphs building on graph representations, hypergraphs and lists. We also consider a fourth edge-less scheme that synchronizes tasks using integers. Analysis using micro-benchmarks shows that the graph representation is not always scalable and that the edge-less scheme introduces least overhead in nearly all situations.

Network Topology, Higher Orders of Stability and Efficiency

Stable networks of order r where r is a natural number refer to those networks that are immune to coalitional deviation of size r or less. In this paper, we introduce stability of a finite order and examine its relation with efficient networks under anonymous and component additive value functions and the component-wise egalitarian allocation rule. In particular, we examine shapes of networks or network architectures that would resolve the conflict between stability and efficiency in the sense that if stable networks assume those shapes they would be efficient and if efficient networks assume those shapes, they would be stable with minimal further restrictions on value functions.

NFA decomposition and multiprocessing architecture for parallel regular expression processing

This work presents a novel algorithm for decomposing NFA automata into one-state-active modules for parallel execution on Multiprocessor Systems on Chip (MP-SoC). Furthermore, performance related studies based on a 16-PE system for Snort, Bro and Linux-L7 regular expressions are presented. ©2009 IEEE.

Multi-standard sub-pixel interpolation architecture for video motion estimation

A new domain-specific reconfigurable sub-pixel interpolation architecture for multi-standard video Motion Estimation (ME) is presented. The mixed use of parallel and serial-input FIR filters achieves high throughput rate and efficient silicon utilisation. Flexibility has been achieved by using a multiplexed reconfigurable data-path controlled by a selection signal. Silicon design studies show that this can be implemented using 34.8K gates with area and performance that compares very favourably with existing fixed solutions based solely on the H.264 standard. ©2008 IEEE.

Implementation of phantom-less IMRT delivery verification using Varian DynaLog files and R/V output

This study aims to evaluate the use of Varian radiotherapy dynamic treatment log (DynaLog) files to verify IMRT plan delivery as part of a routine quality assurance procedure. Delivery accuracy in terms of machine performance was quantified by multileaf collimator (MLC) position errors and fluence delivery accuracy for patients receiving intensity modulated radiation therapy (IMRT) treatment. The relationship between machine performance and plan complexity, quantified by the modulation complexity score (MCS) was also investigated. Actual MLC positions and delivered fraction of monitor units (MU), recorded every 50 ms during IMRT delivery, were extracted from the DynaLog files. The planned MLC positions and fractional MU were taken from the record and verify system MLC control file. Planned and delivered beam data were compared to determine leaf position errors with and without the overshoot effect. Analysis was also performed on planned and actual fluence maps reconstructed from the MLC control file and delivered treatment log files respectively. This analysis was performed for all treatment fractions for 5 prostate, 5 prostate and pelvic node (PPN) and 5 head and neck (H&N) IMRT plans, totalling 82 IMRT fields in ∼5500 DynaLog files. The root mean square (RMS) leaf position errors without the overshoot effect were 0.09, 0.26, 0.19 mm for the prostate, PPN and H&N plans respectively, which increased to 0.30, 0.39 and 0.30 mm when the overshoot effect was considered. Average errors were not affected by the overshoot effect and were 0.05, 0.13 and 0.17 mm for prostate, PPN and H&N plans respectively. The percentage of pixels passing fluence map gamma analysis at 3%/3 mm was 99.94 ± 0.25%, which reduced to 91.62 ± 11.39% at 1%/1 mm criterion. Leaf position errors, but not gamma passing rate, were directly related to plan complexity as determined by the MCS. Site specific confidence intervals for average leaf position errors were set at -0.03-0.12 mm for prostate and -0.02-0.28 mm for more complex PPN and H&N plans. For all treatment sites confidence intervals for RMS errors with the overshoot was set at 0-0.50 mm and for the percentage of pixels passing a gamma analysis at 1%/1 mm a confidence interval of 68.83% was set also for all treatment sites. This work demonstrates the successful implementation of treatment log files to validate IMRT deliveries and how dynamic log files can diagnose delivery errors not possible with phantom based QC. Machine performance was found to be directly related to plan complexity but this is not the dominant determinant of delivery accuracy.

The Map of Watchful Architecture

The international border between Northern Ireland and the South (the Republic of Ireland) came into being in 1922, but there are many important historical antecedents to the notion and expression of spatial separation in this borderland. The author identifies historical precedents and links them to recent defensive features in order to generate a 'map of watchful architecture' that includes recent and much older elements.

The Map of Watchful Architecture 2.0:Defensive forms along Ireland's border

For The Map of Watchful Architecture I only concerned myself with defensive architecture along the Border. As the map followed a border it came out as a wavy line of points. This was largely artificial, I only charted architecture within the Border corridor, but was not entirely artificial. That linear landscape has long been staked-out by the regularity of certain kinds of architecture. The 1st/2nd century Black Pig’s Dyke and Dorsey correspond with today’s Border. The concentration of souterrains in north Louth indicate that it may have been a volatile interface zone in later centuries. In 1618 Londonderry and its walls were built. Further north and two centuries later, Martello Towers were constructed to watch over Lough Foyle. During the Second World War pillboxes and observation posts were manned along the Border, close to what was now an international frontier. Then came the Operation Banner installations built during The Troubles. All this adds up to be one of the longest unbroken traditions of defensive architecture anywhere in Western Europe, a tradition some thought finally broken as the last of the Operation Banner towers were de-installed in 2007. But, take a bus south across the Border and you will often be pulled over by the Garda Síochána. They ID check the passengers in an attempt to stop illegal immigration via the UK. What about illegal immigrants who walk through the fields or along quiet lanes? They will have understood the Border is not really how it seems on most maps. It is not a solid line, it is a row of points.