Redox cycling of Ni-YSZ anode investigated by TPR technique

Effect of redox cycling on a Ni-YSZ anode prepared from 50 wt.% NiO and 50 wt.% YSZ was investigated by using temperature-programmed reduction (TPR), XRD and SEM techniques. XRD results showed that NiO was formed during re-oxidation. Both the XRD and TPR results depicted that the conversion of nickel to NiO depended on the re-oxidation temperature. The oxidation of Ni to NiO occurred quickly in the initial several minutes and then reached a quasi equilibrium. The TPR profiles tracing the redox cycling showed that it brought continuous changes in the NiO micro-structure at 800 degrees C, whereas at 600 degrees C it had only little effects on the reduction of NiO. Re-oxidation resulted in the formation of spongy aggregates of NiO crystallites. Redox cycling at 800 degrees C led to a continuous decrease in the primary crystallite size of NiO and a high dispersion of the Ni particles. A continuous expansion of the slice sample was observed in both of the oxidized and reduced states during the redox cycling at 800 degrees C, whereas this process did not occur during the redox cycling at 600 degrees C. (c) 2005 Elsevier B.V All rights reserved.

Growth of Motor Coordination in Early Robot Learning

M. H. Lee and Q. Meng, Growth of Motor Coordination in Early Robot Learning, IJCAI-05, 2005.

Critical incident technique and explicitation interviewing in studies of information behavior

Urquhart, C., Light, A., Thomas, R., Barker, A., Yeoman, A., Cooper, J., Armstrong, C., Fenton, R., Lonsdale, R. & Spink, S. (2003). Critical incident technique and explicitation interviewing in studies of information behavior. Library and Information Science Research, 25(1), 63-88. Sponsorship: JISC (for JUSTEIS element)

Error-driven active learning in growing radial basis function networks for early robot learning

Q. Meng and M.H. Lee, 'Error-driven active learning in growing radial basis function networks for early robot learning', 2006 IEEE International Conference on Robotics and Automation (IEEE ICRA 2006), 2984-90, Orlando, Florida, USA.

Construction of Robot Intra-modal and Inter-modal Coordination Skills by Developmental Learning

Q. Meng and M. H. Lee, 'Construction of Robot Intra-modal and Inter-modal Coordination Skills by Developmental Learning', Journal of Intelligent and Robotic Systems, 48(1), pp 97-114, 2007.

Staged development of Robot Motor Coordination

M.H. Lee and Q. Meng, 'Staged development of Robot Motor Coordination', IEEE International Conference on Systems, Man and Cybernetics, (IEEE SMC 05), Hawaii, USA, v3, 2917-2922, 2005.

Imaging as a technique for assessment and control in the field

C.R. Bull, R. Zwiggelaar and J.V. Stafford, 'Imaging as a technique for assessment and control in the field', Aspects of Applied Biology 43, 197-204 (1995)

Coordination changes in magnesium silicate glasses

Wilding, Martin; Benmore, C.J.; Tangeman, J.A.; Sampath, S., (2004) 'Coordination changes in magnesium silicate glasses', Europhysics Letters 67 pp.212-218 RAE2008

Radio tomography: A new experimental technique

Pryse, Sian, 'Radio tomography: A new experimental technique', Surveys in Geophysics (2003) 24 pp.1-38 RAE2008

Constructivist Character of the Technique of Role-Playing Games and its Autonomizing Values in the Glottodidactic Process

To Augustyn Surdyk numerous assumptions of constructivism and constructionism in the educational context seem to correspond with the idea of autonomisation in foreign language didactics. He presents a comparison of selected aspects of the three theories in question on the example of an innovative communicative technique of Role-Playing Games applied in the process of teaching foreign languages at an advanced level. The conventions of the technique with its simplified rules have been borrowed from popular parlour games and adapted by the author to the conditions of language didactics. The elements of play and simulation incorporated in the technique allow it to be rated among techniques of ludic strategy. (from Preface to the book)

Detour-Based Mobility Coordination in DTNs

Commonly, research work in routing for delay tolerant networks (DTN) assumes that node encounters are predestined, in the sense that they are the result of unknown, exogenous processes that control the mobility of these nodes. In this paper, we argue that for many applications such an assumption is too restrictive: while the spatio-temporal coordinates of the start and end points of a node's journey are determined by exogenous processes, the specific path that a node may take in space-time, and hence the set of nodes it may encounter could be controlled in such a way so as to improve the performance of DTN routing. To that end, we consider a setting in which each mobile node is governed by a schedule consisting of a ist of locations that the node must visit at particular times. Typically, such schedules exhibit some level of slack, which could be leveraged for DTN message delivery purposes. We define the Mobility Coordination Problem (MCP) for DTNs as follows: Given a set of nodes, each with its own schedule, and a set of messages to be exchanged between these nodes, devise a set of node encounters that minimize message delivery delays while satisfying all node schedules. The MCP for DTNs is general enough that it allows us to model and evaluate some of the existing DTN schemes, including data mules and message ferries. In this paper, we show that MCP for DTNs is NP-hard and propose two detour-based approaches to solve the problem. The first (DMD) is a centralized heuristic that leverages knowledge of the message workload to suggest specific detours to optimize message delivery. The second (DNE) is a distributed heuristic that is oblivious to the message workload, and which selects detours so as to maximize node encounters. We evaluate the performance of these detour-based approaches using extensive simulations based on synthetic workloads as well as real schedules obtained from taxi logs in a major metropolitan area. Our evaluation shows that our centralized, workload-aware DMD approach yields the best performance, in terms of message delay and delivery success ratio, and that our distributed, workload-oblivious DNE approach yields favorable performance when compared to approaches that require the use of data mules and message ferries.

A New Lower Bound Technique for Quantum Circuits without Ancillae

We present a technique to derive depth lower bounds for quantum circuits. The technique is based on the observation that in circuits without ancillae, only a few input states can set all the control qubits of a Toffoli gate to 1. This can be used to selectively remove large Toffoli gates from a quantum circuit while keeping the cumulative error low. We use the technique to give another proof that parity cannot be computed by constant depth quantum circuits without ancillæ.

Service Provisioning in Mobile Networks Through Distributed Coordinated Resource Management

The pervasiveness of personal computing platforms offers an unprecedented opportunity to deploy large-scale services that are distributed over wide physical spaces. Two major challenges face the deployment of such services: the often resource-limited nature of these platforms, and the necessity of preserving the autonomy of the owner of these devices. These challenges preclude using centralized control and preclude considering services that are subject to performance guarantees. To that end, this thesis advances a number of new distributed resource management techniques that are shown to be effective in such settings, focusing on two application domains: distributed Field Monitoring Applications (FMAs), and Message Delivery Applications (MDAs). In the context of FMA, this thesis presents two techniques that are well-suited to the fairly limited storage and power resources of autonomously mobile sensor nodes. The first technique relies on amorphous placement of sensory data through the use of novel storage management and sample diffusion techniques. The second approach relies on an information-theoretic framework to optimize local resource management decisions. Both approaches are proactive in that they aim to provide nodes with a view of the monitored field that reflects the characteristics of queries over that field, enabling them to handle more queries locally, and thus reduce communication overheads. Then, this thesis recognizes node mobility as a resource to be leveraged, and in that respect proposes novel mobility coordination techniques for FMAs and MDAs. Assuming that node mobility is governed by a spatio-temporal schedule featuring some slack, this thesis presents novel algorithms of various computational complexities to orchestrate the use of this slack to improve the performance of supported applications. The findings in this thesis, which are supported by analysis and extensive simulations, highlight the importance of two general design principles for distributed systems. First, a-priori knowledge (e.g., about the target phenomena of FMAs and/or the workload of either FMAs or DMAs) could be used effectively for local resource management. Second, judicious leverage and coordination of node mobility could lead to significant performance gains for distributed applications deployed over resource-impoverished infrastructures.

Preferential Field Coverage Through Detour-Based Mobility Coordination

Controlling the mobility pattern of mobile nodes (e.g., robots) to monitor a given field is a well-studied problem in sensor networks. In this setup, absolute control over the nodes’ mobility is assumed. Apart from the physical ones, no other constraints are imposed on planning mobility of these nodes. In this paper, we address a more general version of the problem. Specifically, we consider a setting in which mobility of each node is externally constrained by a schedule consisting of a list of locations that the node must visit at particular times. Typically, such schedules exhibit some level of slack, which could be leveraged to achieve a specific coverage distribution of a field. Such a distribution defines the relative importance of different field locations. We define the Constrained Mobility Coordination problem for Preferential Coverage (CMC-PC) as follows: given a field with a desired monitoring distribution, and a number of nodes n, each with its own schedule, we need to coordinate the mobility of the nodes in order to achieve the following two goals: 1) satisfy the schedules of all nodes, and 2) attain the required coverage of the given field. We show that the CMC-PC problem is NP-complete (by reduction to the Hamiltonian Cycle problem). Then we propose TFM, a distributed heuristic to achieve field coverage that is as close as possible to the required coverage distribution. We verify the premise of TFM using extensive simulations, as well as taxi logs from a major metropolitan area. We compare TFM to the random mobility strategy—the latter provides a lower bound on performance. Our results show that TFM is very successful in matching the required field coverage distribution, and that it provides, at least, two-fold query success ratio for queries that follow the target coverage distribution of the field.