Automated GUI performance testing

A significant body of prior work has devised approaches for automating the functional testing of interactive applications. However, little work exists for automatically testing their performance. Performance testing imposes additional requirements upon GUI test automation tools: the tools have to be able to replay complex interactive sessions, and they have to avoid perturbing the application’s performance. We study the feasibility of using five Java GUI capture and replay tools for GUI performance test automation. Besides confirming the severity of the previously known GUI element identification problem, we also describe a related problem, the temporal synchronization problem, which is of increasing importance for GUI applications that use timer-driven activity. We find that most of the tools we study have severe limitations when used for recording and replaying realistic sessions of real-world Java applications and that all of them suffer from the temporal synchronization problem. However, we find that the most reliable tool, Pounder, causes only limited perturbation and thus can be used to automate performance testing. Based on an investigation of Pounder’s approach, we further improve its robustness and reduce its perturbation. Finally, we demonstrate in a set of case studies that the conclusions about perceptible performance drawn from manual tests still hold when using automated tests driven by Pounder. Besides the significance of our findings to GUI performance testing, the results are also relevant to capture and replay-based functional GUI test automation approaches.     

A heuristic approach for packing identical rectangles in convex regions

In this paper we propose a heuristic approach for the problem of packing equal rectangles within a convex region. The approach is based on an Iterated Local Search scheme, in which the key step is the perturbation move. Different perturbation moves, both combinatorial and continuous ones, are proposed and compared through extensive computational experiments on a set of test instances. The overall results are quite encouraging.     

Covering a line segment with variable radius discs

The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the disc covering problem on a line. The cost of each sensor includes a fixed component f, and a variable component that is a convex function of the diameter of the field-of-view area. When only one type of sensor or, in general, one type of disc, is available, then a simple polynomial algorithm solves the problem. When there are different types of sensors, the problem becomes hard. A branch-and-bound algorithm as well as an efficient heuristic are developed for the special case in which the variable cost component of each sensor is proportional to the square of the measure of the field-of-view area. The heuristic very often obtains the optimal solution as shown in extensive computational testing.     

Simultaneously learning actions and goals from demonstration

Our research aim is to develop interactions and algorithms for learning from naïve human teachers through demonstration. We introduce a novel approach to leverage the goal-oriented nature of human teachers by learning an action model and a goal model simultaneously from the same set of demonstrations. We use robot motion data to learn an action model for executing the skill. We use a generic set of perceptual features to learn a goal model and use it to monitor the executed action model. We evaluate our approach with data from 8 naïve teachers demonstrating two skills to the robot. We show that the goal models in the perceptual feature space are consistent across users and correctly recognize demonstrations in cross-validation tests. We additionally observe that a subset of users were not able to teach a successful action model whereas all of them were able to teach a mostly successful goal model. When the learned action models are executed on the robot, the success was on average 66.25 %. Whereas the goal models were on average 90 % correct at deciding on success/failure of the executed action, which we call monitoring.     

Survey on using constraints in data mining

This paper provides an overview of the current state-of-the-art on using constraints in knowledge discovery and data mining. The use of constraints in a data mining task requires specific definition and satisfaction tools during knowledge extraction. This survey proposes three groups of studies based on classification, clustering and pattern mining, whether the constraints are on the data, the models or the measures, respectively. We consider the distinctions between hard and soft constraint satisfaction, and between the knowledge extraction phases where constraints are considered. In addition to discussing how constraints can be used in data mining, we show how constraint-based languages can be used throughout the data mining process.     

An Acoustic Network Navigation System

This work describes a system for acoustic‐based navigation that relies on the addition of localization services to underwater networks. The localization capability has been added on top of an existing network, without imposing constraints on its structure/operation. The approach is based on the inclusion of timing information within acoustic messages through which it is possible to know the time of an acoustic transmission in relation to its reception. Exploiting such information at the network application level makes it possible to create an interrogation scheme similar to that of a long baseline. The advantage is that the nodes/autonomous underwater vehicles (AUVs) themselves become the transponders of a network baseline, and hence there is no need for dedicated instrumentation. The paper reports at sea results obtained from the COLLAB–NGAS14 experimental campaign. During the sea trial, the approach was implemented within an operational network in different configurations to support the navigation of the two Centre for Maritime Research and Experimentation Ocean Explorer (CMRE OEX) vehicles. The obtained results demonstrate that it is possible to support AUV navigation without constraining the network design and with a minimum communication overhead. Alternative solutions (e.g., synchronized clocks or two‐way‐travel‐time interrogations) might provide higher precision or accuracy, but they come at the cost of impacting on the network design and/or on the interrogation strategies. Results are discussed, and the performance achieved at sea demonstrates the viability to use the system in real, large‐scale operations involving multiple AUVs. These results represent a step toward location‐aware underwater networks that are able to provide node localization as a service.