ELM-induced transient tungsten melting in the JET divertor

The original goals of the JET ITER-like wall included the study of the impact of an all W divertor on plasma operation (Coenen et al 2013 Nucl. Fusion 53 073043) and fuel retention (Brezinsek et al 2013 Nucl. Fusion 53 083023). ITER has recently decided to install a full-tungsten (W) divertor from the start of operations. One of the key inputs required in support of this decision was the study of the possibility of W melting and melt splashing during transients. Damage of this type can lead to modifications of surface topology which could lead to higher disruption frequency or compromise subsequent plasma operation. Although every effort will be made to avoid leading edges, ITER plasma stored energies are sufficient that transients can drive shallow melting on the top surfaces of components. JET is able to produce ELMs large enough to allow access to transient melting in a regime of relevance to ITER.

Transient W melt experiments were performed in JET using a dedicated divertor module and a sequence of I-P = 3.0 MA/B-T = 2.9 T H-mode pulses with an input power of P-IN = 23 MW, a stored energy of similar to 6 MJ and regular type I ELMs at Delta W-ELM = 0.3 MJ and f(ELM) similar to 30 Hz. By moving the outer strike point onto a dedicated leading edge in the W divertor the base temperature was raised within similar to 1 s to a level allowing transient, ELM-driven melting during the subsequent 0.5 s. Such ELMs (delta W similar to 300 kJ per ELM) are comparable to mitigated ELMs expected in ITER (Pitts et al 2011 J. Nucl. Mater. 415 (Suppl.) S957-64).

Although significant material losses in terms of ejections into the plasma were not observed, there is indirect evidence that some small droplets (similar to 80 mu m) were released. Almost 1 mm (similar to 6 mm(3)) of W was moved by similar to 150 ELMs within 7 subsequent discharges. The impact on the main plasma parameters was minor and no disruptions occurred. The W-melt gradually moved along the leading edge towards the high-field side, driven by j x B forces. The evaporation rate determined from spectroscopy is 100 times less than expected from steady state melting and is thus consistent only with transient melting during the individual ELMs. Analysis of IR data and spectroscopy together with modelling using the MEMOS code Bazylev et al 2009 J. Nucl. Mater. 390-391 810-13 point to transient melting as the main process. 3D MEMOS simulations on the consequences of multiple ELMs on damage of tungsten castellated armour have been performed.

These experiments provide the first experimental evidence for the absence of significant melt splashing at transient events resembling mitigated ELMs on ITER and establish a key experimental benchmark for the MEMOS code.

Infra-Éireann: Making Ireland Modern - Irish Pavilion for the 14th Architectural biennale, Venice 2014.

After an open competition, we were selected to commission, curate and design the Irish pavilion for the Venice biennale 2014. Our proposal engage with the role of infrastructure and architecture in the cultural development of the new Irish state 1914-2014. This curatorial programme was realised in a demountable, open matrix pavilion measuring 12 x 5 x 6 metres.

How modernity is absorbed into national cultures usually presupposes an attachment to previous conditions and a desire to reconcile the two. In an Irish context, due to the processes of de-colonisation and political independence, this relationship is more complicated.

In 1914, Ireland was largely agricultural and lacked any significant industrial complex. The construction of new infrastructures after independence in 1921 became central to the cultural imagining of the new nation. The adoption of modernist architecture was perceived as a way to escape the colonial past. As the desire to reconcile cultural and technological aims developed, these infrastructures became both the physical manifestation and concrete identity of the new nation with architecture an essential element in this construct.

Technology and infrastructure are inherently cosmopolitan. Beginning with the Shannon hydro-electric facility at Ardnacrusha (1929) involving the German firm of Siemens-Schuckert, Ireland became a point of various intersections between imported international expertise and local need. By the turn of the last century, it had become one of the most globalised countries in the world, site of the European headquarters of multinationals such as Google and Microsoft. Climatically and economically expedient to the storing and harvesting of data, Ireland has subsequently become an important repository of digital information farmed in large, single-storey sheds absorbed into dispersed suburbs. In 2013, it became the preferred site for Intel to design and develop its new microprocessor board, the Galileo, a building block for the internet of things.

The story of the decades in between, of shifts made manifest in architecture and infrastructure, from the policies of economic protectionism to the embracing of the EU is one of the influx of technologies and cultural references into a small country on the edges of Europe: Ireland as both a launch-pad and testing ground for a series of aspects of designed modernity.

Enhancing Linear Programming with Motion Modeling for Multi-target Tracking

In this paper we extend the minimum-cost network flow approach to multi-target tracking, by incorporating a motion model, allowing the tracker to better cope with longterm occlusions and missed detections. In our new method, the tracking problem is solved iteratively: Firstly, an initial tracking solution is found without the help of motion information. Given this initial set of tracklets, the motion at each detection is estimated, and used to refine the tracking solution.
Finally, special edges are added to the tracking graph, allowing a further revised tracking solution to be found, where distant tracklets may be linked based on motion similarity. Our system has been tested on the PETS S2.L1 and Oxford town-center sequences, outperforming the baseline system, and achieving results comparable with the current state of the art.

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 article 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. In particular, the seemingly obvious lower bounds of Ω(m) messages, where m is the number of edges in the network, and Ω(D) time, where D is the network diameter, are nontrivial to show for randomized (Monte Carlo) algorithms. (Recent results, showing that even Ω(n), where 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 restricted case of comparison algorithms, where it was also required that nodes may not wake up spontaneously and that D and n were not known. We establish these fundamental lower bounds in this article 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 (namely, algorithms that 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 any use of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time leader election algorithm is known. A slight adaptation of our lower bound technique gives rise to an Ω(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 tradeoff messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.

The 'human revolution' in lowland tropical Southeast Asia:the antiquity and behavior of anatomically modern humans at Niah Cave (Sarawak, Borneo)

Recent research in Europe, Africa, and Southeast Asia suggests that we can no longer assume a direct and exclusive link between anatomically modern humans and behavioral modernity (the 'human revolution'), and assume that the presence of either one implies the presence of the other: discussions of the emergence of cultural complexity have to proceed with greater scrutiny of the evidence on a site-by-site basis to establish secure associations between the archaeology present there and the hominins who created it. This paper presents one such case study: Niah Cave in Sarawak on the island of Borneo, famous for the discovery in 1958 in the West Mouth of the Great Cave of a modern human skull, the 'Deep Skull,' controversially associated with radiocarbon dates of ca. 40,000 years before the present. A new chronostratigraphy has been developed through a re-investigation of the lithostratigraphy left by the earlier excavations, AMS-dating using three different comparative pre-treatments including ABOX of charcoal, and U-series using the Diffusion-Absorption model applied to fragments of bones from the Deep Skull itself. Stratigraphic reasons for earlier uncertainties about the antiquity of the skull are examined, and it is shown not to be an `intrusive' artifact. It was probably excavated from fluvial-pond-desiccation deposits that accumulated episodically in a shallow basin immediately behind the cave entrance lip, in a climate that ranged from times of comparative aridity with complete desiccation, to episodes of greater surface wetness, changes attributed to regional climatic fluctuations. Vegetation outside the cave varied significantly over time, including wet lowland forest, montane forest, savannah, and grassland. The new dates and the lithostratigraphy relate the Deep Skull to evidence of episodes of human activity that range in date from ca. 46,000 to ca. 34,000 years ago. Initial investigations of sediment scorching, pollen, palynomorphs, phytoliths, plant macrofossils, and starch grains recovered from existing exposures, and of vertebrates from the current and the earlier excavations, suggest that human foraging during these times was marked by habitat-tailored hunting technologies, the collection and processing of toxic plants for consumption, and, perhaps, the use of fire at some forest-edges. The Niah evidence demonstrates the sophisticated nature of the subsistence behavior developed by modern humans to exploit the tropical environments that they encountered in Southeast Asia, including rainforest. (c) 2006 Elsevier Ltd. All rights reserved.

A metapopulation model of species boundaries

The majority, if not all, species have a limited geographic range bounded by a distribution edge. Violent ecotones such as sea coasts clearly produce edges for many species; however such ecotones, while sufficient for the formation of an edge, are not always necessary. We demonstrate this by simulation in discrete time of a spatially structured finite size metapopulation subjected to a spatial gradient in per-unit-time population extinction probability together with spatially structured dispersal and recolonisation. We find that relatively sharp edges separating a homeland or main geographical range from an outland or zone of relatively sparse and ephemeral colonisation can form in gradual environmental gradients. The form and placing of the edge is an emergent property of the metapopulation dynamics. The sharpness of the edge declines with increasing dispersal distance, and is dependent on the relative scales of dispersal distance and gradient length. The space over which the edge develops is short relative to the potential species range. The edge is robust against changes in both the shape of the environmental gradient and to a lesser extent to alterations in the kind of dispersal operating. Persistence times in the absence of environmental gradients are virtually independent of the shape of the dispersal function describing migration. The common finding of bell shaped population density distributions across geographic ranges may occur without the strict necessity of a niche mediated response to a spatially autocorrelated environment.

Small molecular logic systems can draw the outlines of objects via edge visualization

The recently-discovered ability of small logical molecules to recognize edges is exploited to achieve outline drawing from binary templates. Outlines of arbitrary curvature, several colours and thicknesses down to 1 mm are drawn in around 30 min or less by employing a common laboratory two-colour ultraviolet lamp. The outlines and the light dose-driven XOR logic with fluorescence output or ‘off-on-off’ action which is observed in the irradiated regions are modelled by combining foundational principles of photochemistry, acid-base neutralization and diffusion.

Experimental and Numerical Benchmarking of an Improved Impeller Meanline Modelling Method for Automotive Turbocharger Centrifugal Compressors

After the development of a new single-zone meanline modelling technique, benchmarking of the technique and the modelling methods used during its development are presented. The new meanline model had been developed using the results of three automotive turbocharger centrifugal compressors, and single passage CFD models based on their geometry.

The target of the current study was to test the new meanline modelling method on two new centrifugal compressor stages, again from the automotive turbocharger variety. Furthermore the single passage CFD modelling method used in the previous study would be again employed here and also benchmarked.

The benchmarking was twofold; firstly test the overall performance prediction accuracy of the single-zone meanline model. Secondly, test the detailed performance estimation of the CFD model using detailed interstage static pressure tappings.

The final component of this study exposed the weaknesses in the current modelling methods used (explicitly during this study). The non-axisymmetric flow field at the leading and trailing edges for the two compressors was measured and is presented here for the complete compressor map, highlighting the distortion relative to the tongue.

Partial Encryption by Randomized Zig-Zag Scanning for Video Encoding

19.Wang, Y, O’Neill, M, Kurugollu, F, Partial Encryption by Randomized Zig-Zag Scanning for Video Encoding, IEEE International Symposium on Circuits and Systems (ISCAS), Beijing, May 2013

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.

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.

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.