Condition-based diagnosis of mechatronic systems using a fractional calculus approach

While fractional calculus (FC) is as old as integer calculus, its application has been mainly restricted to mathematics. However, many real systems are better described using FC equations than with integer models. FC is a suitable tool for describing systems characterised by their fractal nature, long-term memory and chaotic behaviour. It is a promising methodology for failure analysis and modelling, since the behaviour of a failing system depends on factors that increase the model’s complexity. This paper explores the proficiency of FC in modelling complex behaviour by tuning only a few parameters. This work proposes a novel two-step strategy for diagnosis, first modelling common failure conditions and, second, by comparing these models with real machine signals and using the difference to feed a computational classifier. Our proposal is validated using an electrical motor coupled with a mechanical gear reducer.     

Skill Memory in Biped Locomotion

Robots must be able to adapt their motor behavior to unexpected situations in order to safely move among humans. A necessary step is to be able to predict failures, which result in behavior abnormalities and may cause irrecoverable damage to the robot and its surroundings, i.e. humans. In this paper we build a predictive model of sensor traces that enables early failure detection by means of a skill memory. Specifically, we propose an architecture based on a biped locomotion solution with improved robustness due to sensory feedback, and extend the concept of Associative Skill Memories (ASM) to periodic movements by introducing several mechanisms into the training workflow, such as linear interpolation and regression into a Dynamical Motion Primitive (DMP) system such that representation becomes time invariant and easily parameterizable. The failure detection mechanism applies statistical tests to determine the optimal operating conditions. Both training and failure testing were conducted on a DARwIn-OP inside a simulation environment to assess and validate the failure detection system proposed. Results show that the system performance in terms of the compromise between sensitivity and specificity is similar with and without the proposed mechanism, while achieving a significant data size reduction due to the periodic approach taken.     

The use of data-derived label hierarchies in multi-label classification

Instead of traditional (multi-class) learning approaches that assume label independency, multi-label learning approaches must deal with the existing label dependencies and relations. Many approaches try to model these dependencies in the process of learning and integrate them in the final predictive model, without making a clear difference between the learning process and the process of modeling the label dependencies. Also, the label relations incorporated in the learned model are not directly visible and can not be (re)used in conjunction with other learning approaches. In this paper, we investigate the use of label hierarchies in multi-label classification, constructed in a data-driven manner. We first consider flat label sets and construct label hierarchies from the label sets that appear in the annotations of the training data by using a hierarchical clustering approach. The obtained hierarchies are then used in conjunction with hierarchical multi-label classification (HMC) approaches (two local model approaches for HMC, based on SVMs and PCTs, and two global model approaches, based on PCTs for HMC and ensembles thereof). The experimental results reveal that the use of the data-derived label hierarchy can significantly improve the performance of single predictive models in multi-label classification as compared to the use of a flat label set, while this is not preserved for the ensemble models.     

Resilient overlay network for real-time interactive multimedia sessions in corporate networks

Real-time interactive multimedia communications are becoming increasingly useful for education, business, e-commerce and e-government, providing an enriched user experience in teleconferencing, e-meetings, distance training and product demonstrations. Large corporations are usually located at several sites, so real-time multipoint sessions within corporations are especially difficult. IP multicast is available or feasible within each site of an organization. Thus, corporate networks can be considered as various multicast-capable networks interconnected through a wide area network without multicast connectivity. This paper proposes a resilient self-managed overlay network to support real-time multipoint interactive sessions within corporate networks. The proposed overlay takes advantage of the configuration of corporate networks to self-organize and provide an efficient media delivery service, making use of multicast communications wherever available. Various self-healing techniques are implemented allowing for the continuity of ongoing sessions in spite of network disruptions and entity failures. Extensive simulations and tests have been carried out to assess the performance and resilience of the overlay facing several types of disruptions.     

Set‐based fault detection and isolation for detectable linear parameter‐varying systems

In the context of fault detection and isolation of linear parameter‐varying systems, a challenging task appears when the dynamics and the available measurements render the model unobservable, which invalidates the use of standard set‐valued observers. Two results are obtained in this paper, namely, using a left‐coprime factorization, one can achieve set‐valued estimates with ultimately bounded hyper‐volume and convergence dependent on the slowest unobservable mode; and by rewriting the set‐valued observer equations and taking advantage of a coprime factorization, it is possible to have a low‐complexity fault detection and isolation method. Performance is assessed through simulation, illustrating, in particular, the detection time for various types of faults. Copyright © 2017 John Wiley & Sons, Ltd.     

Authorship verification applied to detection of compromised accounts on online social networks

Compromising legitimate accounts has been the most used strategy to spread malicious content on OSN (Online Social Network). To address this problem, we propose a pure text mining approach to check if an account has been compromised based on its posts content. In the first step, the proposed approach extracts the writing style from the user account. The second step comprehends the k-Nearest Neighbors algorithm (k-NN) to evaluate the post content and identify the user. Finally, Baseline Updating (third step) consists of a continuous updating of the user baseline to support the current trends and seasonality issues of user’s posts. Experiments were carried out using a dataset from Twitter composed by tweets of 1000 users. All the three steps were individually evaluated, and the results show that the developed method is stable and can detect the compromised accounts. An important observation is the Baseline Updating contribution, which leads to an enhancement of accuracy superior of 60 %. Regarding average accuracy, the developed method achieved results over 93 %.     

From software extensions to product lines of dataflow programs

Dataflow programs are widely used. Each program is a directed graph where nodes are computations and edges indicate the flow of data. In prior work, we reverse-engineered legacy dataflow programs by deriving their optimized implementations from a simple specification graph using graph transformations called refinements and optimizations. In MDE speak, our derivations were PIM-to-PSM mappings. In this paper, we show how extensions complement refinements, optimizations, and PIM-to-PSM derivations to make the process of reverse engineering complex legacy dataflow programs tractable. We explain how optional functionality in transformations can be encoded, thereby enabling us to encode product lines of transformations as well as product lines of dataflow programs. We describe the implementation of extensions in the \(\mathtt{ReFlO}\) tool and present two non-trivial case studies as evidence of our work’s generality.     

Vision-based control for rigid body stabilization

This paper addresses the problem of stabilizing to a desired equilibrium point an eye-in-hand system, which consists of a single camera mounted on a rigid body free to move on order="0" style="vertical-align:bottom" width="34" alt="View the MathML source" title="View the MathML source" src="http://binary-services.sciencedirect.com/content/image/1-s2.0-S000510981100077X-si23.gif">. It is assumed that there is a collection of landmarks fixed in the environment and that the image coordinates of those landmarks are provided to the system by an on-board CCD camera. The proposed method addresses not only the problem of stabilization but also that of maintaining feature visibility along the system’s trajectory. The resulting solution consists of a feedback control law based on the current and desired image coordinates and reconstructed attitude and depth ratio information, which guarantees that (i) the desired equilibrium point is an almost global attractor; (ii) a set of necessary conditions for feature visibility holds throughout the system’s trajectories; and (iii) the image of a predefined feature point is kept inside the camera’s field of view.     

Active learning paradigms for CBIR systems based on optimum-path forest classification

This paper discusses methods for content-based image retrieval (CBIR) systems based on relevance feedback according to two active learning paradigms, named greedy and planned. In greedy methods, the system aims to return the most relevant images for a query at each iteration. In planned methods, the most informative images are returned during a few iterations and the most relevant ones are only presented afterward. In the past, we proposed a greedy approach based on optimum-path forest classification (OPF) and demonstrated its gain in effectiveness with respect to a planned method based on support-vector machines and another greedy approach based on multi-point query. In this work, we introduce a planned approach based on the OPF classifier and demonstrate its gain in effectiveness over all methods above using more image databases. In our tests, the most informative images are better obtained from images that are classified as relevant, which differs from the original definition. The results also indicate that both OPF-based methods require less user involvement (efficiency) to satisfy the user's expectation (effectiveness), and provide interactive response times.     

IsoGeometric analysis using T-splines on two-patch geometries

We develop optimal approximation estimates for T-splines in the case of geometries obtained by gluing two standard tensor product patches. We derive results both for the T-spline space in the parametric domain and the mapped T-NURBS in the physical one. A set of numerical tests in complete accordance with the theoretical developments is also presented.