Field configured assembly: Programmed manipulation and self-assembly at the mesoscale

Field configured assembly is a programmable force field method that permits rapid, "hands-free" manipulation, assembly, and integration of mesoscale objects and devices. In this method, electric fields, configured by specific addressing of receptor and counter electrode sites pre-patterned at a silicon chip substrate, drive the field assisted transport, positioning, and localization of mesoscale devices at selected receptor locations. Using this approach, we demonstrate field configured deterministic and stochastic self-assembly of model mesoscale devices, i.e., 50 mum diameter, 670 nm emitting GaAs-based light emitting diodes, at targeted receptor sites on a silicon chip. The versatility of the field configured assembly method suggests that it is applicable to self-assembly of a wide variety of functionally integrated nanoscale and mesoscale systems.

Self-generated expressions of residual complaints following brain injury

Following brain injury there is often a prolonged period of deteriorating psychological condition, despite neurological stability or improvement. This is presumably consequent to the remission of anosognosia and the realisation of permanently worsened status. This change is hypothesised to be directed partially by the socially mediated processes which play a role in generating self-awareness and which here direct the reconstruction of the self as a permanently injured person. However, before we can understand this process of redevelopment, we need an unbiassed technique to monitor self-awareness. Semi-structured interviews were conducted with 30 individuals with long-standing brain injuries to capture their spontaneous complaints and their level of insight into the implications of their difficulties. The focus was on what the participants said in their own words, and the extent to which self-knowledge of difficulties was spontaneously salient to the participants. Their responses were subjected to content analysis. Most participants were able to say that they had brain injuries and physical difficulties, many mentioned memory and attentional problems and a few made references to a variety of emotional disturbances. Content analysis of data from unbiassed interviews can reveal the extent to which people with brain injuries know about their difficulties. Social constructionist accounts of self-awareness and recovery are supported.

Evolutionary dynamics of the spatial Prisoner's Dilemma with self-inhibition

In this paper we study the influence of interventions on self-interactions in a spatial Prisoner's Dilemma on a two-dimensional grid with periodic boundary conditions and synchronous updating of the dynamics. We investigate two different types of self-interaction modifications. The first type (FSIP) is deterministic, effecting each self-interaction of a player by a constant factor, whereas the second type (PSIP) performs a probabilistic interventions. Both types of interventions lead to a reduction of the payoff of the players and, hence, represent inhibiting effects. We find that a constant but moderate reduction of self-interactions has a very beneficial effect on the evolution of cooperators in the population, whereas probabilistic interventions on self-interactions are in general counter productive for the coexistence of the two different strategies. (C) 2011 Elsevier Inc. All rights reserved.

Influence of the type of coarse lightweight aggregate on properties of Semi-Lightweight Self-Consolidating Concrete

This paper presents studies on the properties of fresh and hardened semilightweight self-consolidating concrete (SLWSCC) mixtures, produced with two types of manufactured coarse lightweight aggregates (LWA) and normal weight sand. The first type, a sintered pulverized fuel ash, was made from an industrial by-product, fly ash, whereas the second one, an expanded clay, was produced from a naturally sourced clay. For all mixtures, normal weight sand was used as a fine fraction of aggregates, and the portland cement was partially replaced with a limestone powder. The SLWSCC was produced with different water presaturation regimes of the LWAs. The desired initial slump-flow spread was set between 700 and 800 mm. The effect of three superplasticizers was evaluated by testing properties of SLWSCC, normal weight SCC, and paste mixtures. Three SCC fresh properties were measured: the slump-flow, the V-funnel flow time, and the J-ring blocking step. Moreover, the slump-flow loss was evaluated. The degree of segregation was assessed in both fresh and hardened states. Additionally, the hardened density and the compressive strengths were tested. All SLWSCC mixtures were produced with a desired range of slump-flow spread and with satisfactory passing ability assessed with the J-ring test. SLWSCCs prepared with the expanded clay LWA were less sensitive to the variation of water presaturation levels and showed lower viscosity than those made with the sintered pulverized fuel ash LWA. Only mixtures containing SP-3 superplasticizer showed acceptable workability loss resistance. The saturated surface-dry density of all of the mixtures varied in a range of 2,025–2,125??kg/m 3 . Mixtures containing 29% of coarse LWAs and 71% of sand (by mass) had 24-h and 28-day compressive strengths above 20 and 40 MPa, respectively, but the mixtures made with the expanded clay were slightly weaker.

DEX: Self-Healing Expanders

We present a fully-distributed self-healing algorithm DEX, that maintains a constant degree expander network in a dynamic setting. To the best of our knowledge, our algorithm provides the first efficient distributed construction of expanders - whose expansion properties hold deterministically - that works even under an all-powerful adaptive adversary that controls the dynamic changes to the network (the adversary has unlimited computational power and knowledge of the entire network state, can decide which nodes join and leave and at what time, and knows the past random choices made by the algorithm). Previous distributed expander constructions typically provide only probabilistic guarantees on the network expansion which rapidly degrade in a dynamic setting, in particular, the expansion properties can degrade even more rapidly under adversarial insertions and deletions. Our algorithm provides efficient maintenance and incurs a low overhead per insertion/deletion by an adaptive adversary: only O(log n) rounds and O(log n) messages are needed with high probability (n is the number of nodes currently in the network). The algorithm requires only a constant number of topology changes. Moreover, our algorithm allows for an efficient implementation and maintenance of a distributed hash table (DHT) on top of DEX, with only a constant additional overhead. Our results are a step towards implementing efficient self-healing networks that have guaranteed properties (constant bounded degree and expansion) despite dynamic changes.