Abstract
Consider the problem of designing an algorithm for acquiring sensor readings. Consider specifically the problem of obtaining an approximate representation of sensor readings where (i) sensor readings originate from different sensor nodes, (ii) the number of sensor nodes is very large, (iii) all sensor nodes are deployed in a small area (dense network) and (iv) all sensor nodes communicate over a communication medium where at most one node can transmit at a time (a single broadcast domain). We present an efficient algorithm for this problem, and our novel algorithm has two desired properties: (i) it obtains an interpolation based on all sensor readings and (ii) it is scalable, that is, its time-complexity is independent of the number of sensor nodes. Achieving these two properties is possible thanks to the close interlinking of the information processing algorithm, the communication system and a model of the physical world.

Abstract
High strength, first order Bragg Grating Waveguides are inscribed in the core and cladding of optical fibers using oil immersion femtosecond direct laser-writing. A laser-induced birefringence of 2.05×10-4 was inferred from polarization split Bragg resonances. ©OSA/ CLEO 2011.

Abstract
Recent evidence suggests that the neural mechanisms underlying memory for serial order and interval timing of sequential events are closely linked. We present a dynamic neural field model which exploits the existence and stability of multi-bump solutions with a gradient of activation to store serial order. The activation gradient is achieved by applying a state-dependent threshold accommodation process to the firing rate function. A field dynamics of lateral inhibition type is used in combination with a dynamics for the baseline activity to recall the sequence from memory. We show that depending on the time scale of the baseline dynamics the precise temporal structure of the original sequence may be retrieved or a proactive timing of events may be achieved.

Abstract
This article addresses the problem of scheduling economic lots in a multi-product single-machine environment. A mixed integer non-linear programming formulation is developed, which finds the optimal sequence and economic lots. The model takes explicit account of initial inventories, setup times, allows setups to be scheduled at arbitrary epochs in continuous time and models backorders. To solve the problem we develop a hybrid approach, combining a genetic algorithm and linear programming. The approach is tested on a set of instances taken from the literature and compared with other approaches. The experimental results validate the quality of the solutions and the effectiveness of the proposed approach.

Abstract
In order to develop a flexible simulator, a variety of models for Ancillary Services (AS) negotiation has been implemented in MASCEM a multi-agent system competitive electricity markets simulator. In some of these models, the energy and the AS are addressed simultaneously while in other models they are addressed separately. This paper presents an energy and ancillary services joint market simulation. This paper proposes a deterministic approach for solving the energy and ancillary services joint market. A case study based on the dispatch of Regulation Down, Regulation Up, Spinning Reserve, and Non-Spinning Reserve services is used to demonstrate that the use of the developed methodology is suitable for solving this kind of optimization problem. The presented case study is based on CAISO real AS market data considers fifteen bids. © 2011 IEEE.

Abstract
In this paper we present a novel approach to tackling the synchronisation of a secondary resource in lot-sizing and scheduling problems. This kind of problem occurs in various manufacturing processes (e. g. wafer testing in the semiconductor industry, production and bottling of soft drinks). We consider a scenario of parallel unrelated machines that have to be equipped with a tool or need a special kind of resource for processing. Our approach allows tracing the assignment of these secondary resources across different machines and synchronising their usage independently of the time period. We present extensions of the general lot-sizing and scheduling problem and of the capacitated lot-sizing problem. We prove that the latter model is a special case of the first, but it performs computationally much better.