Tree-Structured Stick Breaking Processes for Hierarchical Data

Many data are naturally modeled by an unobserved hierarchical structure. In this paper we propose a flexible nonparametric prior over unknown data hierarchies. The approach uses nested stick-breaking processes to allow for trees of unbounded width and depth, where data can live at any node and are infinitely exchangeable. One can view our model as providing infinite mixtures where the components have a dependency structure corresponding to an evolutionary diffusion down a tree. By using a stick-breaking approach, we can apply Markov chain Monte Carlo methods based on slice sampling to perform Bayesian inference and simulate from the posterior distribution on trees. We apply our method to hierarchical clustering of images and topic modeling of text data.

Novel architecture to facilitate disassembly and reuse of electronic components and sub-assemblies

This paper advances the proposition that in many electronic products, the partitioning scheme adopted and the interconnection system used to interconnect the sub-assemblies or components are intimately related to the economic benefits, and hence the attractiveness, of reuse of these items. An architecture has been developed in which the residual values of the connectors, components and sub-assemblies are maximized, and opportunities for take-back and reuse of redundant items are greatly enhanced. The system described also offers significant manufacturing cost benefits in terms of ease of assembly, compactness and robustness.

A closely integrated digital image capture device for embedded applications

A modular image capture system with close integration to CCD cameras has been developed. The aim is to produce a system capable of integrating CCD sensor, image capture and image processing into a single compact unit. This close integration provides a direct mapping between CCD pixels and digital image pixels. The system has been interfaced to a digital signal processor board for the development and control of image processing tasks. These have included characterization and enhancement of noisy images from an intensified camera and measurement to subpixel resolutions. A highly compact form of the image capture system is in an advanced stage of development. This consists of a single FPGA device and a single VRAM providing a two chip image capturing system capable of being integrated into a CCD camera. A miniature compact PC has been developed using a novel modular interconnection technique, providing a processing unit in a three dimensional format highly suited to integration into a CCD camera unit. Work is under way to interface the compact capture system to the PC using this interconnection technique, combining CCD sensor, image capture and image processing into a single compact unit. ©2005 Copyright SPIE - The International Society for Optical Engineering.

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.

Decentralised minimum-time consensus

We consider the discrete-time dynamics of a network of agents that exchange information according to a 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 final consensus value of the whole network in finite time using the minimum number of successive values of its own state history. We show that the minimum number of steps is related to a Jordan block decomposition of the network dynamics, and present an algorithm to compute the final consensus value in the minimum number of steps by checking a rank condition of a Hankel matrix of local observations. Furthermore, we prove that the minimum number of steps is related to graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the minimum external equitable partition. © 2013 Elsevier Ltd. All rights reserved.