Abstract
We introduce the concept of identity based key encapsulation to multiple parties (mID-KEM), and define a security model for it. This concept is the identity based analogue of public key KEM to multiple parties. We also analyse possible mID-KEM constructions, and propose an efficient scheme based on bilinear pairings. We prove our scheme secure in the random oracle model under the Gap Bilinear Diffie-Hellman assumption.

Abstract
Localization is essential to modern autonomous robots in order to enable effective completion of complex tasks over possibly large distances in low structured environments. In this paper, a Extended Kalman Filter is used in order to implement self-localization. This is done by merging odometry and localization information, when available. The used landmarks are colored poles that can be recognized while the robot moves around performing normal tasks. This paper models measurements with very different characteristics in distance and angle to markers and shows results of the self-localization method. Results of simulations and real robot tests are shown.

Abstract
The MatPLC is an international project to develop a program similar to a PLC (Programmable Logic Controller) for POSIX operating systems. It is an open source application consisting of a core, generic modules, and tools for creating custom modules. Since many control and monitoring systems are distributed in nature, they require that the application be running on an embedded system capable of withstanding harsh environments. This paper describes the porting of the MatPLC code base to a commercial embedded system running on a PowerPC CPU. Time measurements were taken to determine whether the resulting code would be suitable for control applications.

Abstract
This paper presents several beam search algorithms for the single-machine earliness/tardiness scheduling problem with release dates and no unforced idle time. These algorithms include classical beam search procedures, with both priority and total cost evaluation functions, as well as the filtered and recovering variants. Both priority evaluation functions and problem-specific properties were considered for the filtering step used in the filtered and recovering procedures. The computational results show that the recovering beam search algorithms outperform their filtered counterparts, while the priority-based filtering procedure proves superior to the rules-based alternative. The beam search procedure with a total cost function provides very good results but is computationally expensive. The recovering algorithm is quite close in solution quality and is significantly faster, so it can be used to solve even large instances.

Abstract
The idea behind the first proposal of the Fuzzy Power Flow (FPF) was to analyze the impact of the uncertainties in load and generation at the power flow level, when no statistical information is available. Further development of the field addressed the optimal power flow problem and the use of fuzzy methodologies to help planners of the composite generation-transmission system. In a market environment, transmission system adequacy may be defined as the ability of the system to meet reasonable demands for the transmission of electricity. The starting point of this paper is that FPF can be used as a tool to quantify this adequacy, without the need of making too many assumptions about load and generation uncertainties. However, some changes in the basic concept of the FPF are needed in order to accomplish this task - part of the paper is devoted to the description of the adequate formulation. We'll also show that this formulation can be used both in the normal operation situation and in the reliability evaluation of the transmission system. An illustrative example completes the paper.

Abstract
An increasingly important design constraint for software running on ubiquitous computing devices is security, particularly against physical methods such as side-channel attack. One well studied methodology for defending against such attacks is the concept of indistinguishable functions which leak no information about program control flow since all execution paths are computationally identical. However, constructing such functions by hand becomes laborious and error prone as their complexity increases. We investigate techniques for automating this process and find that effective solutions can be constructed with only minor amounts of computational effort.