Use of data dependence graphs in the design of bit-level systolic arrays

The use of bit-level systolic array circuits as building blocks in the construction of larger word-level systolic systems is investigated. It is shown that the overall structure and detailed timing of such systems may be derived quite simply using the dependence graph and cut-set procedure developed by S. Y. Kung (1988). This provides an attractive and intuitive approach to the bit-level design of many VLSI signal processing components. The technique can be applied to ripple-through and partly pipelined circuits as well as fully systolic designs. It therefore provides a means of examining the relative tradeoff between levels of pipelining, chip area, power consumption, and throughput rate within a given VLSI design.

'One cut too many?' History and film: a practice-based case study

This article explores the different ways that film-makers and historians approach the narrating of the past. It draws upon a collaborative, practice-based case study of a feature film project, The enigma of Frank Ryan, in order to explore the role of the history film as a vehicle for extending historical understanding. In the dialogue between film-maker and historian, a range of issues regarding the import of the history film for the practice or 'poetics' of history is explored.

The Forgiving Graph: a distributed data structure for low stretch under adversarial attack

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick “repairs,” which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions, without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been l in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most l log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degree would have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network.

The Forgiving Graph:A distributed data structure for low stretch under adversarial attack

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick "repairs," which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions,without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been - in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most - log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degreewould have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network. © Springer-Verlag 2012.

Macroscopic bound entanglement in thermal graph states

We address the presence of bound entanglement in strongly interacting spin systems at thermal equilibrium. In particular, we consider thermal graph states composed of an arbitrary number of particles. We show that for a certain range of temperatures no entanglement can be extracted by means of local operations and classical communication, even though the system is still entangled. This is found by harnessing the independence of the entanglement in some bipartitions of such states with the system's size. Specific examples for one- and two-dimensional systems are given. Our results thus prove the existence of thermal bound entanglement in an arbitrary large spin system with finite-range local interactions.

Investigation of Finish-cut of Microelectrodischarge Milling for Nano Surface Finish

In this article, the machining conditions to achieve nanometric surface roughness in finish cut microelectrodischarge milling were investigated. For a constant gap voltage, the effect of feed rate and capacitance was studied on average surface roughness (Ra) and maximum peak-to-valley roughness height (Ry). Statistical models were developed using a three-level, two-factor experimental design. The developed models minimized Ra and Ry by desirability function approach. Maximum desirability was found to be more than 98%. The minimum values of Ra and Ry were 23 and 173 nm, respectively, for 1.00 μm s-1 feed rate and 0.01 nF capacitance. Verification experiments were conducted to check the accuracy of the models, where the responses were found to be very close to the predicted values. Thus, the developed models can be used to generate nanometric level surface finish, which are useful for many applications in microelectromechanical systems.

'If we do not cut social spending, we will end up like Greece': Challenging consent to austerity through social work action

'If we do not cut social spending, we will end up like Greece'. Establishment politicians and media figures use this new ideological mantra throughout the Western world to frighten people into consenting to further neo-liberal restructuring along with cuts in social spending. This phrase and other ideologically laden assertions hide the real causes of the Greek public debt crisis. This commentary challenges the dominant discourse by contextualizing the Greek case within the larger global neo-liberal restructuring processes and then, drawing upon Gramsci's concept of the organic intellectual, proposes ways that the members of the Professional Association of Social Workers (PASW) can engage in a war of ideas and action, as organic intellectuals, to delegitimize the dominant discourse, which seeks consent for social spending cuts and further neo-liberal restructuring of society. © The Author(s) 2013.