Local synthesis and alignment of zinc oxide nanowires in aqueous solution using microheaters

A bottom-up technique for synthesizing transversely suspended zinc oxide nanowires (ZnO NWs) under a zinc nitrate (Zn(NO 3) 2· 6H 2O) and hexamethylenetetramine (HMTA, (CH 2) 6·N 4) solution within a microfabricated device is reported in this paper. The device consists of a microheater which is used to initially create an oxidized ZnO seed layer. ZnO NWs are then locally synthesized by the microheater and electrodes embedded within the devices are used to drive electric field directed horizontal alignment of the nanowires within the device. The entire process is carried out at low temperature. This approach has the potential to considerably simplify the fabrication and assembly of ZnO nanowires on CMOS compatible substrates, allowing for the chemical synthesis to be carried out under near-ambient conditions by locally defining the conditions for nanowire growth on a silicon reactor chip. © 2012 IEEE.

Solution oriented partnerships - A new business model for integrating global-production efficiencies with sustainability

A business model for integrating global-production efficiencies with sustainability is discussed. Two trends that emulate some of the aspects of the wealthy are the increasing willingness of many to pay extra for customization such as clothes, of kitchens and the increasing acceptance of purchasing a service as a product substitute. Two final trends that are also based in the attitudes of people is an increased awareness of the value of local culture and an increased concern with issues of sustainability. The results show that the goal congruence between for-profit and not-for-profit organizations puts emphasis on value and belief of the organization.

Network structure preserving model reduction with weak a priori structural information

This paper extends a state projection method for structure preserving model reduction to situations where only a weaker notion of system structure is available. This weaker notion of structure, identifying the causal relationship between manifest variables of the system, is especially relevant is settings such as systems biology, where a clear partition of state variables into distinct subsystems may be unknown, or not even exist. The resulting technique, like similar approaches, does not provide theoretical performance guarantees, so an extensive computational study is conducted, and it is observed to work fairly well in practice. Moreover, conditions characterizing structurally minimal realizations and sufficient conditions characterizing edge loss resulting from the reduction process, are presented. ©2009 IEEE.

Decentralised minimal-time consensus

This study considers the discrete-time dynamics of a network of agents that exchange information according to the nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the consensus value of the whole network in finite time using only the minimal number of successive values of its own history. We show that this minimal number of steps is related to a Jordan block decomposition of the network dynamics and present an algorithm to obtain the minimal number of steps in question by checking a rank condition on a Hankel matrix of the local observations. Furthermore, we prove that the minimal number of steps is related to other algebraic and graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the underlying graph topology. © 2011 IEEE.

Achieving robust face recognition from video by combining a weak photometric model and a learnt generic face invariant

In spite of over two decades of intense research, illumination and pose invariance remain prohibitively challenging aspects of face recognition for most practical applications. The objective of this work is to recognize faces using video sequences both for training and recognition input, in a realistic, unconstrained setup in which lighting, pose and user motion pattern have a wide variability and face images are of low resolution. The central contribution is an illumination invariant, which we show to be suitable for recognition from video of loosely constrained head motion. In particular there are three contributions: (i) we show how a photometric model of image formation can be combined with a statistical model of generic face appearance variation to exploit the proposed invariant and generalize in the presence of extreme illumination changes; (ii) we introduce a video sequence re-illumination algorithm to achieve fine alignment of two video sequences; and (iii) we use the smoothness of geodesically local appearance manifold structure and a robust same-identity likelihood to achieve robustness to unseen head poses. We describe a fully automatic recognition system based on the proposed method and an extensive evaluation on 323 individuals and 1474 video sequences with extreme illumination, pose and head motion variation. Our system consistently achieved a nearly perfect recognition rate (over 99.7% on all four databases). © 2012 Elsevier Ltd All rights reserved.

Decentralised minimal-time dynamic consensus

This paper considers a group of agents that aim to reach an agreement on individually received time-varying signals by local communication. In contrast to static network averaging problem, the consensus considered in this paper is reached in a dynamic sense. A discrete-time dynamic average consensus protocol can be designed to allow all the agents tracking the average of their reference inputs asymptotically. We propose a minimal-time dynamic consensus algorithm, which only utilises a minimal number of local observations of a randomly picked node in a network to compute the final consensus signal. Our results illustrate that with memory and computational ability, the running time of distributed averaging algorithms can be indeed improved dramatically as suggested by Olshevsky and Tsitsiklis. © 2012 AACC American Automatic Control Council).

Local Frustration Determines Molecular and Macroscopic Helix Structures

The effect of displaying cytochromes from an amyloid fibre is modelled as perturbation of -strands in a bilayer of helical -sheets, thereby explaining the spiral morphology of decorated amyloid and the dynamic response of morphology to cytochrome conformation. The morphology of the modelled fibre, which consists of minimal energy assemblies of rigid building blocks containing two anisotropic interacting units, depends primarily on the rigid constraints between units rather than the soft interactions between them. The framework is a discrete version of the bilayered frustration principle that drives morphology in Bauhinia seedpods. We show that self-assembly of frustrated long range structures can occur if the building blocks themselves are internally frustrated, e.g. amyloid morphology is governed by the conformation of the misfolded protein nucleating the fibre. Our model supports the idea that any peptide sequence can form amyloid if bilayers can form first, albeit stabilised by additional material such as chaperones or cytochromes. Analysis of experimentally derived amyloid structures supports our conclusions and suggests a range of frustration effects, which natural amyloid fibres may exploit. From this viewpoint, amyloid appears as a molecular example of a more general universal bilayered frustration principle, which may have profound implications for materials design using fibrous systems. Our model provides quantitative guidance for such applications. The relevance to longer length scales was proved by designing the morphology of a series of macroscopic magnetic stacks. Finally, this work leads to the idea of mixing controlled morphologically defined species to generate higher-order assembly and complex functional behaviour. The systematic kinking of decorated fibres and the nested frustration of the Bauhinia seed pod are two outstanding examples.

Local stability results for the collective behaviors of infinite populations of pulse-coupled oscillators

In this paper, we investigate the behavior of pulse-coupled integrate-and-fire oscillators. Because the stability analysis of finite populations is intricate, we investigate stability results in the approximation of infinite populations. In addition to recovering known stability results of finite populations, we also obtain new stability results for infinite populations. In particular, under a weak coupling assumption, we solve for the continuum model a conjecture still prevailing in the finite dimensional case. © 2011 IEEE.