Context-sensitive dependency pairs

Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although a good number of techniques for proving termination of context-sensitive rewriting (CSR) have been proposed so far, the adaptation to CSR of the dependency pair approach, one of the most powerful techniques for proving termination of rewriting, took some time and was possible only after introducing some new notions like collapsing dependency pairs, which are specific for CSR. In this paper, we develop the notion of context-sensitive dependency pair (CSDP) and show how to use CSDPs in proofs of termination of CSR. The implementation and practical use of the developed techniques yield a novel and powerful framework which improves the current state-of-the-art of methods for automatically proving termination of CSR.     

SENFIS: a Sensor Node File System for increasing the scalability and reliability of Wireless Sensor Networks applications

In the last years the Wireless Sensor Networks’ (WSN) technology has been increasingly employed in various application domains. The extensive use of WSN posed new challenges in terms of both scalability and reliability. This paper proposes Sensor Node File System (SENFIS), a novel file system for sensor nodes, which addresses both scalability and reliability concerns. SENFIS can be mainly used in two broad scenarios. First, it can transparently be employed as a permanent storage for distributed TinyDB queries, in order to increase the reliability and scalability. Second, it can be directly used by a WSN application for permanent storage of data on the WSN nodes. The experimental section shows that SENFIS implementation makes an efficient use of resources in terms of energy consumption, memory footprint, flash wear levelling, while achieving execution times similarly with existing WSN file systems.     

Lower bounds on lengths of checking sequences

Lower bounds on the lengths of checking sequences constructed for testing from Finite State Machine-based specifications are established. These bounds consider the case where a distinguishing sequence is used in forming state recognition and transition verification subsequences and identify the effects of overlapping among such subsequences. Empirical results show that the existing methods for construction of checking sequences provide checking sequences with lengths that are within acceptable distance to these lower bounds.     

An adaptive, real-time, traffic monitoring system

In this paper we describe a computer vision-based traffic monitoring system able to detect individual vehicles in real-time. Our fully integrated system first obtains the main traffic variables: counting, speed and category; and then computes a complete set of statistical variables. The objective is to investigate some of the difficulties impeding existing traffic systems to achieve balanced accuracy in every condition; i.e. day and night transitions, shadows, heavy vehicles, occlusions, slow traffic and congestions. The system we present is autonomous, works for long periods of time without human intervention and adapts automatically to the changing environmental conditions. Several innovations, designed to deal with the above circumstances, are proposed in the paper: an integrated calibration and image rectification step, differentiated methods for day and night, an adaptive segmentation algorithm, a multistage shadow detection method and special considerations for heavy vehicle identification and treatment of slow traffic. A specific methodology has been developed to benchmark the accuracy of the different methods proposed.     

Simultaneous learning of perception and action in mobile robots

One of the main problems of robots is the lack of adaptability and the need for adjustment every time the robot changes its working place. To solve this, we propose a learning approach for mobile robots using a reinforcement-based strategy and a dynamic sensor-state mapping. This strategy, practically parameterless, minimises the adjustments needed when the robot operates in a different environment or performs a different task.Our system will simultaneously learn the state space and the action to execute on each state. The learning algorithm will attempt to maximise the time before a robot failure in order to obtain a control policy suited to the desired behaviour, thus providing a more interpretable learning process. The state representation will be created dynamically, starting with an empty state space and adding new states as the robot finds new situations that has not seen before. A dynamic creation of the state representation will avoid the classic, error-prone and cyclic process of designing and testing an ad hoc representation. We performed an exhaustive study of our approach, comparing it with other classic strategies. Unexpectedly, learning both perception and action does not increase the learning time.     

Vehicle inductive signatures recognition using a Madaline neural network

In this paper, we report results obtained with a Madaline neural network trained to classify inductive signatures of two vehicles classes: trucks with one rear axle and trucks with double rear axle. In order to train the Madaline, the inductive signatures were pre-processed and both classes, named C2 and C3, were subdivided into four subclasses. Thus, the initial classification task was split into four smaller tasks (theoretically) easier to be performed. The heuristic adopted in the training attempts to minimize the effects of the input space non-linearity on the classifier performance by uncoupling the learning of the classes and, for this, we induce output Adalines to specialize in learning one of the classes. The percentages of correct classifications presented concern patterns which were not submitted to the neural network in the training process, and, therefore, they indicate the neural network generalization ability. The results are good and stimulate the maintenance of this research on the use of Madaline networks in vehicle classification tasks using not linearly separable inductive signatures.     

A genetic solution based on lexicographical goal programming for a multiobjective job shop with uncertainty

In this work we consider a multiobjective job shop problem with uncertain durations and crisp due dates. Ill-known durations are modelled as fuzzy numbers. We take a fuzzy goal programming approach to propose a generic multiobjective model based on lexicographical minimisation of expected values. To solve the resulting problem, we propose a genetic algorithm searching in the space of possibly active schedules. Experimental results are presented for several problem instances, solved by the GA according to the proposed model, considering three objectives: makespan, tardiness and idleness. The results illustrate the potential of the proposed multiobjective model and genetic algorithm.     

Two-stage cascaded classification approach based on genetic fuzzy learning for speech/music discrimination

Automatic discrimination of speech and music is an important tool in many multimedia applications. The paper presents a robust and effective approach for speech/music discrimination, which relies on a two-stage cascaded classification scheme. The cascaded classification scheme is composed of a statistical pattern recognition classifier followed by a genetic fuzzy system. For the first stage of the classification scheme, other widely used classifiers, such as neural networks and support vector machines, have also been considered in order to assess the robustness of the proposed classification scheme. Comparison with well-proven signal features is also performed. In this work, the most commonly used genetic learning algorithms (Michigan and Pittsburgh) have been evaluated in the proposed two-stage classification scheme. The genetic fuzzy system gives rise to an improvement of about 4% in the classification accuracy rate. Experimental results show the good performance of the proposed approach with a classification accuracy rate of about 97% for the best trial.     

A technique for defining agent-oriented engineering processes with tool support

The formalization of engineering processes is necessary for guaranteeing the quality and cost of the products involved. Agent-oriented engineering has already proposed development processes that still need to be further formalized to be applicable by non-researchers. This paper proposes a technique to instantiate processes for specific agent-oriented methodologies. This technique is based on three orthogonal views that are respectively related with lifecycles, disciplines and guidances. In addition, processes are modeled with a tool, which is automatically generated from a process metamodel inspired by the software & systems process engineering metamodel. Accordingly, engineers can choose the methodology–process pair best-suited for the characteristics of their project. The paper illustrates the approach based on the unified development process and the scrum process for the INGENIAS methodology and compares the results with other existing alternatives.