Abstract
The automatic classification of urban sounds is important for environmental monitoring. In this work we employ SAX-based Multiresolution Motif Discovery to generate features for Urban Sound Classification. Our approach consists in the discovery of relevant frequent motifs in the audio signals and use the frequency of discovered motifs as characterizing attributes. We explore and evaluate different configurations of motif discovery for defining attributes. In the automatic classification step we use a decision tree based algorithm, random forests and SVM. Results obtained are compared with the ones using Mel-Frequency Cepstral Coefficients (MFCC) as features. MFCCs are commonly used in environmental sound analysis, as well as in other sound classification tasks. Experiments were performed on the Urban Sound dataset, which is publicly available. Our results indicate that we can separate difficult pairs of classes (where MFCC fails) using the motif approach for feature construction. © 2015 SERSC.

Abstract
Dynamic logic combines logic with programs, which at a certain level of abstraction, can be regarded as behaviours changing the system state and, therefore, the truth value of formulas. This paper suggests a method for generating such logics for the domain of robot controllers and illustrates it with a logic for handling resource consumption.

Abstract
Automated Guided Vehicle System (AGVS) has become an important strategic tool for automated warehouses. In a very competitive business scenario, they can increase productivity and reduce costs of FMS (Flexible Manufacturing System) transportation systems. The AGV System provides efficient material flow and distribution among workstations at the right time and place. To attend such requirements, AGVS involves dispatching and scheduling of tasks and routing of AGVs. Some studies have approached such procedures in a similar form, although they have different functionalities. This paper reviews the literature related to the dispatching, scheduling and routing of AGVs (Automated Guided Vehicles) and highlights their main differences in comparison with the common management of vehicles transportation systems. To obtain a theoretical base, the definitions of dispatching, routing and scheduling procedures for materials handling applications are presented and the main methods to solve them are discussed.

Abstract
Traditionally, a single model is developed for a data mining task. As more data is being collected at a more detailed level, organizations are becoming more interested in having specific models for distinct parts of data (e. g. customer segments). From the business perspective, data can be divided naturally into different dimensions. Each of these dimensions is usually hierarchically organized (e. g. country, city, zip code), which means that, when developing a model for a given part of the problem (e. g. a zip code) the training data may be collected at different levels of this nested hierarchy (e. g. the same zip code, the city and the country it is located in). Selecting different levels of granularity may change the performance of the whole process, so the question is which level to use for a given part. We propose a metalearning model which recommends a level of granularity for the training data to learn the model that is expected to obtain the best performance. We apply decision tree and random forest algorithms for metalearning. At the base level, our experiment uses results obtained by outlier detection methods on the problem of detecting errors in foreign trade transactions. The results show that using metalearning help finding the best level of granularity.

Abstract
Self-localization of a robot in an indoor plant is one of the most important requirement in mobile robotics. This paper addresses the application and improvement of a well known localization algorithm used in Robocup Midsize league competition in real service and industrial robots. This new robust approach is based on modeling the quality of several measures and minimizing the maching error. The presented innovative work applies the robotic football knowledge to other fields with high accuracy. Real and simulated results allow to validate the proposed methodology.

Abstract
MATLAB to C translation is foreseen to raise the overall abstraction level when mapping computations to embedded systems (possibly consisting of software and hardware components), and thus for increasing productivity and for providing an automated modeldriven design-flow. This paper describes recent work developed in the context of MATISSE, a MATLAB to C compiler targeting embedded systems. We introduce several techniques to allow the efficient generation of C code, such as weak types, primitives and matrix views. We evaluate the compiler with a set of 9 publicly available benchmarks, targeting both embedded systems and a desktop system. We compare the execution time of the generated C code with the original code running on MATLAB, achieving a geometric mean speedup of 8.1 ×, and qualitatively compare our results with the performance of related approaches. The use of the new techniques allowed the compiler to achieve performance improvements of 46% on average.