Multicast deflector

Technological evolution is leading telecommunications toward all-IP scenarios, where multiple services are transported as IP packets. Among these services is the broadcast of video. A possible mechanism for broadcasting multiple video channels over IP is to use IP multicast, and let each client decide about the reception of a channel. The secure IP multicast specified by the IETF MSEC working group is a candidate solution for securing these broadcast services. In this paper we propose a new solution for supporting the broadcast of multiple video channels which can be accessed only by authorized users; besides, when a video channel is not visualized in the last mile its transmission is temporarily suspended, so that the cable can be used for other services such as standard Internet access.     

Phosphonic acid‐containing polysulfones as anticorrosive layers

As a part of research work to elaborate polymeric materials for metal corrosion protection, we have developed a new family of phosphonic acid‐containing polymers. The synthesis and the characterization of polysulfones bearing alkyl phosphonate ester side groups are first described. These polymers are synthesized by direct polycondensation of a phosphonate ester‐containing bisphenol by aromatic nucleophilic substitution. The physicochemical properties of the resulting polymers are described. Acidic hydrolysis of phosphonate esters results in the formation of phosphonic acid groups. A series of phosphonic acid‐containing polysulfones is therefore obtained and characterized. A preliminary evaluation of the anticorrosive properties of these polymers is described. In 0.25M Na₂SO₄ solution, the corrosion rate of a polymer‐coated mild steel sample is much lower than of the free metal substrate. These results suggest that phosphonic acid‐containing polysulfones might be interesting as anticorrosive coatings. © 2015 Wiley Periodicals, Inc. J. Appl. Polym. Sci. 2015 , 132, 41890.     

On the evaluation of unsupervised outlier detection: measures,datasets, and an empirical study

The evaluation of unsupervised outlier detection algorithms is a constant challenge in data mining research. Little is known regarding the strengths and weaknesses of different standard outlier detection models, and the impact of parameter choices for these algorithms. The scarcity of appropriate benchmark datasets with ground truth annotation is a significant impediment to the evaluation of outlier methods. Even when labeled datasets are available, their suitability for the outlier detection task is typically unknown. Furthermore, the biases of commonly-used evaluation measures are not fully understood. It is thus difficult to ascertain the extent to which newly-proposed outlier detection methods improve over established methods. In this paper, we perform an extensive experimental study on the performance of a representative set of standard k nearest neighborhood-based methods for unsupervised outlier detection, across a wide variety of datasets prepared for this purpose. Based on the overall performance of the outlier detection methods, we provide a characterization of the datasets themselves, and discuss their suitability as outlier detection benchmark sets. We also examine the most commonly-used measures for comparing the performance of different methods, and suggest adaptations that are more suitable for the evaluation of outlier detection results.     

An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem

This paper addresses the multiobjective hybrid flow shop (MOHFS) scheduling problem. In the MOHFS problem considered here, we have a set of jobs that must be performed in a set of stages. At each stage, we have a set of unrelated parallel machines. Some jobs may skip stages. The evaluation criteria are the minimizations of makespan, the weighted sum of the tardiness, and the weighted sum of the earliness. For solving it, an algorithm based on the multiobjective general variable neighborhood search (MO‐GVNS) metaheuristic, named adapted MO‐GVNS, is proposed. This work also presents and compares the results obtained by the adapted MO‐GVNS with those of four other algorithms: multiobjective reduced variable neighborhood search, nondominated sorting genetic algorithm II (NSGA‐II), and NSGA‐III, and another MO‐GVNS from the literature. The results were evaluated based on the Hypervolume, Epsilon, and Spacing metrics, and statistically validated by the Levene test and confidence interval charts. The results showed the efficiency of the proposed algorithm for solving the MOHFS problem.     

Methodology for evaluating a novel education technology: a case study of handheld video games in Chile

Many school systems, in both the developed and developing world, are implementing educational technology to assist in student learning. However, there is no clear consensus on how to evaluate these new technologies. This paper proposes a comprehensive methodology for estimating the value of a new educational technology in three steps: benefit analysis, through the administration of a well-designed experiment; cost analysis, which incorporates costs to weigh against the benefits; and feasibility analysis, which introduces real-world concerns that may affect the ability to actually implement the technology. To illustrate the methodology, a case study from Chile is used where portable educational video games were introduced into first and second grade classrooms with the aim of improving learning in mathematics and language. This paper demonstrates the importance of all three steps in the evaluation process and provides a framework for future analyses.     

A globally asymptotically stabilizing trajectory tracking controller for fully actuated rigid bodies using landmark‐based information

In this paper, we address the problem of designing a control law based on sensor measurements that provides global asymptotic stabilization to a reference trajectory defined on the . The proposed control law is a function of the angular velocity, of vector measurements characterizing the position of some given landmarks, and of their rate of change. We provide sufficient conditions for the existence of synergistic potential functions on SO(3) which are pivotal in the generation of a suitable hybrid control law. We also provide sufficient conditions on the geometry of the landmarks to solve the given problem. Finally, the proposed solution is simulated and compared with a continuous feedback control law. Copyright © 2014 John Wiley & Sons, Ltd.     

A new robust algorithmic for multi-camera calibration with a 1D object under general motions without prior knowledge of any camera intrinsic parameter

In computer vision, camera calibration is a necessary process when the retrieval of information such as angles and distances is required. This paper addresses the multi-camera calibration problem with a single dimension calibration pattern under general motions. Currently, the known algorithms for solving this problem are based on the estimation of vanishing points. However, this estimate is very susceptible to noise, making the methods unsuitable for practical applications. Instead, this paper presents a new calibration algorithm, where the cameras are divided into binocular sets. The fundamental matrix of each binocular set is then estimated, allowing to perform a projective calibration of each camera. Then, the calibration is updated for the Euclidean space, ending the process. The calibration is possible without imposing any restrictions on the movement of the pattern and without any prior information about the cameras or motion. Experiments on synthetic and real images validate the new method and show that its accuracy makes it suitable also for practical applications.     

Hybrid dynamical systems with hybrid inputs: Definition of solutions and applications to interconnections

In this paper, we define solutions for hybrid systems with prespecified hybrid inputs. Unlike previous work where solutions and inputs are assumed to be defined on the same domain a priori, we consider the case where intervals of flow and jump times of the input are not necessarily synchronized with those of the state trajectory. This happens in particular when the input is the output of another hybrid system, for instance, in the context of observer design or reference tracking. The proposed approach relies on reparametrizing the jumps of the input in order to write it on a common domain. The solutions then consist of a pair made of the state trajectory and the reparametrized input. Our definition generalizes the notions of solutions of continuous‐time and discrete‐time systems with inputs. We provide an algorithm that automatically performs the construction of solutions for a given hybrid input. In the context of hybrid interconnections, we show how the solutions of the individual systems can be linked to the solutions of a closed‐loop system. Example illustrate the notions and the proposed algorithm.     

Energy functions for dissipativity-based balancing of discrete-time nonlinear systems

Most of the energy functions used in nonlinear balancing theory can be expressed as storage functions in the framework of dissipativity theory. By defining a framework of discrete-time dissipative systems, this paper presents existence conditions for their discrete-time energy functions along with algorithms to find them based on dynamic optimization problems. Furthermore, the important case of the nonlinear discrete-time versions of the controllability and observability functions, its properties and algorithms to find them are presented. These algorithms are illustrated with linear and nonlinear examples.