S100A4 downregulates filopodia formation through increased dynamic instability

Cell migration requires the initial formation of cell protrusions, lamellipodia and/or filopodia, the attachment of the leading lamella to extracellular cues and the formation and efficient recycling of focal contacts at the leading edge. The small calcium binding EF-hand protein S100A4 has been shown to promote cell motility but the direct molecular mechanisms responsible remain to be elucidated. In this work, we provide new evidences indicating that elevated levels of S100A4 affect the stability of filopodia and prevent the maturation of focal complexes. Increasing the levels of S100A4 in a rat mammary benign tumor derived cell line results in acquired cellular migration on the wound healing scratch assay. At the cellular levels, we found that high levels of S100A4 induce the formation of many nascent filopodia, but that only a very small and limited number of those can stably adhere and mature, as opposed to control cells, which generate fewer protrusions but are able to maintain these into more mature projections. This observation was paralleled by the fact that S100A4 overexpressing cells were unable to establish stable focal adhesions. Using different truncated forms of the S100A4 proteins that are unable to bind to myosin IIA, our data suggests that this newly identified functions of S100A4 is myosin-dependent, providing new understanding on the regulatory functions of S100A4 on cellular migration.

Mechanisms of transfer film formation on data recording heads

The increasing demand for high capacity data storage requires decreasing the head-to-tape gap and reducing the track width. A problem very often encountered is the development of adhesive debris on the heads at low humidity and high temperatures that can lead to an increase of space between the head and media, and thus a decrease in the playback signal. The influence of stains on the playback signal of reading heads is studied using RAW (Read After Write) tests and their influence on the wear of the heads by using indentation technique. The playback signal has been found to vary and the errors to increase as stains form a patchy pattern and grow in size to form a continuous layer. The indentation technique shows that stains reduce the wear rate of the heads. In addition, the wear tends to be more pronounced at the leading edge of the head compared to the trailing one. Chemical analysis of the stains using ferrite samples in conjunction with MP (metal particulate) tapes shows that stains contain iron particles and polymeric binder transferred from the MP tape. The chemical anchors in the binder used to grip the iron particles now react with the ferrite surface to create strong chemical bonds. At high humidity, a thin layer of iron oxyhydroxide forms on the surface of the ferrite. This soft material increases the wear rate and so reduces the amount of stain present on the heads. The stability of the binder under high humidity and under high temperature as well as the chemical reactions that might occur on the ferrite poles of the heads influences the dynamic behaviour of stains. A model of stain formation taking into account the channels of binder degradation and evolution upon different environmental conditions is proposed.

Using min-sum loopy belief propagation for decentralised supply chain formation

Modern business trends such as agile manufacturing and virtual corporations require high levels of flexibility and responsiveness to consumer demand, and require the ability to quickly and efficiently select trading partners. Automated computational techniques for supply chain formation have the potential to provide significant advantages in terms of speed and efficiency over the traditional manual approach to partner selection. Automated supply chain formation is the process of determining the participants within a supply chain and the terms of the exchanges made between these participants. In this thesis we present an automated technique for supply chain formation based upon the min-sum loopy belief propagation algorithm (LBP). LBP is a decentralised and distributed message-passing algorithm which allows participants to share their beliefs about the optimal structure of the supply chain based upon their costs, capabilities and requirements. We propose a novel framework for the application of LBP to the existing state-of-the-art case of the decentralised supply chain formation problem, and extend this framework to allow for application to further novel and established problem cases. Specifically, the contributions made by this thesis are: • A novel framework to allow for the application of LBP to the decentralised supply chain formation scenario investigated using the current state-of-the-art approach. Our experimental analysis indicates that LBP is able to match or outperform this approach for the vast majority of problem instances tested. • A new solution goal for supply chain formation in which economically motivated producers aim to maximise their profits by intelligently altering their profit margins. We propose a rational pricing strategy that allows producers to earn significantly greater profits than a comparable LBP-based profitmaking approach. • An LBP-based framework which allows the algorithm to be used to solve supply chain formation problems in which goods are exchanged in multiple units, a first for a fully decentralised technique. As well as multiple-unit exchanges, we also model in this scenario realistic constraints such as factory capacities and input-to-output ratios. LBP continues to be able to match or outperform an extended version of the existing state-of-the-art approach in this scenario. • Introduction of a dynamic supply chain formation scenario in which participants are able to alter their properties or to enter or leave the process at any time. Our results suggest that LBP is able to deal easily with individual occurences of these alterations and that performance degrades gracefully when they occur in larger numbers.

Can an episodic approach to social identification account for identification as interaction between individual and collective identity work in an increasingly flexible and transient identity formation context?

A review of available literature suggests that social identification exists at the interface between individual and collective identity work. This poster proposes that it is the interaction between these two processes that leads a person to define themselves in terms of their membership of a particular social group. The poster suggests that identity work undertaken by the group (or ‘the creation of identities as widely understood signs with a set of rules and conventions for their use’, Schwalbe & Mason-Schrock, 1996, p.115), can be used by a person to inform their own individual identity work and, from this, the extent of alignment between their identity and the perceived identity of the group. In stable or internally-structured groups collective identity work may simply take the form of communication and preservation of dominant collective identities. However, in unstable, new or transitional groups, interaction between individual and collective identity work may be more dynamic, as both collective and individual identities are simultaneously codified, enacted and refined. To develop an understanding of social identification that is applicable in both stable and transitional social groups, it is useful to consider recent proposals that identification may occur cyclically as a series of discrete episodes (Ashforth, Harrison & Corley, 2008). This poster draws on the literature to present these suggestions in greater detail, outlining propositions for social identification that are relevant to transient as well as stable identity formation, supported by suggestion of how episodes of social identification may lead to a person identifying with a group.

Modular construction of dynamic nucleodendrimers

Isoguanosine-containing dendritic small molecules self-assemble into decameric nucleodendrimers as observed by 1D NMR spectroscopy, 2D DOSY, and mass spectrometry. In particular, apolar building blocks readily form pentameric structures in acetonitrile while the presence of alkali metals promotes the formation of stable decameric assemblies with a preference for cesium ions. Remarkably, co-incubation of guanosine and isoguanosine-containing nucleodendrons results in the formation of decameric structures in absence of added salts. Further analysis of the mixture indicated that guanosine derivatives facilitate the formation, but are not involved in decameric structures; a process reminiscent of molecular crowding. This molecular system provides a powerful canvas for the rapid and modular assembly of polyfunctional dendritic macromolecules. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Using the max-sum algorithm for supply chain emergence in dynamic multiunit environments

Supply chain formation (SCF) is the process of determining the set of participants and exchange relationships within a network with the goal of setting up a supply chain that meets some predefined social objective. Many proposed solutions for the SCF problem rely on centralized computation, which presents a single point of failure and can also lead to problems with scalability. Decentralized techniques that aid supply chain emergence offer a more robust and scalable approach by allowing participants to deliberate between themselves about the structure of the optimal supply chain. Current decentralized supply chain emergence mechanisms are only able to deal with simplistic scenarios in which goods are produced and traded in single units only and without taking into account production capacities or input-output ratios other than 1:1. In this paper, we demonstrate the performance of a graphical inference technique, max-sum loopy belief propagation (LBP), in a complex multiunit unit supply chain emergence scenario which models additional constraints such as production capacities and input-to-output ratios. We also provide results demonstrating the performance of LBP in dynamic environments, where the properties and composition of participants are altered as the algorithm is running. Our results suggest that max-sum LBP produces consistently strong solutions on a variety of network structures in a multiunit problem scenario, and that performance tends not to be affected by on-the-fly changes to the properties or composition of participants.