Swarm Intelligent Compressive Routing in Wireless Sensor Networks

This article proposes a novel algorithm to improve the lifetime of a wireless sensor network. This algorithm employs swarm intelligence algorithms in conjunction with compressive sensing theory to build up the routing trees and to decrease the communication rate. The main contribution of this article is to extend swarm intelligence algorithms to build a routing tree in such a way that it can be utilized to maximize efficiency, thereby rectifying the delay problem of compressive sensing theory and improving the network lifetime. In addition, our approach offers accurate data recovery from small amounts of compressed data. Simulation results show that our approach can effectively extend the network lifetime of a large‐scale wireless sensor network.     

A Model for Incident Tickets Correlation in Network Management

In Information Technology Service Management (ITSM), network management teams typically use an Incident Ticket System (ITS) as a tool to track, troubleshoot, and coordinate the resolution of network incidents that occur during the daily operation of the network. A well organized ITS may positively impact on the efficiency of the incident management process. Nevertheless, in many cases the handling of tickets by the management team is not completely systematic and may be incoherent and inefficient. This way, irrelevant or redundant tickets for the same incident may be issued, thus creating a redundancy in the system that leads to inefficiencies. In this paper, we suggest a model aimed to correlate redundant tickets in order to reduce the information to a single ticket per incident. We validate the proposed correlation model by evaluating it with two datasets taken from a real ticketing system of a telecommunications network company. Using this model as a basis, we also develop and evaluate a methodology that assesses the efficiency of the management team during the process of tickets creation and management. Based on it, we also get some insights on the performance of the different management groups involved in the ticket creation process. These analyses can be leveraged for improving both the management groups functioning and the policies for the tickets’ creation.     

Fast implementation of dense stereo vision algorithms on a highly parallel SIMD architecture

In this paper, we present faster than real-time implementation of a class of dense stereo vision algorithms on a low-power massively parallel SIMD architecture, the CSX700. With two cores, each with 96 Processing Elements, this SIMD architecture provides a peak computation power of 96 GFLOPS while consuming only 9 Watts, making it an excellent candidate for embedded computing applications. Exploiting full features of this architecture, we have developed schemes for an efficient parallel implementation with minimum of overhead. For the sum of squared differences (SSD) algorithm and for VGA (640 × 480) images with disparity ranges of 16 and 32, we achieve a performance of 179 and 94 frames per second (fps), respectively. For the HDTV (1,280 × 720) images with disparity ranges of 16 and 32, we achieve a performance of 67 and 35 fps, respectively. We have also implemented more accurate, and hence more computationally expensive variants of the SSD, and for most cases, particularly for VGA images, we have achieved faster than real-time performance. Our results clearly demonstrate that, by developing careful parallelization schemes, the CSX architecture can provide excellent performance and flexibility for various embedded vision applications.     

Understanding post‐adoption IS usage stages: an empirical assessment of self‐service information systems

Organisations have invested in self‐service information systems (IS) to provide a direct interface for service delivery. Enriching the usage of these systems can provide organisations with immense benefits. However, limited research has been directed towards understanding post‐adoption IS usage behaviour in general and specifically in the context of self‐service IS. This study proposes post‐adoption IS usage behaviour as a broader concept constituting feature level usage of IS, integration of IS in the work system and exploration of new uses of IS. We evaluate how the new conceptualisation can be used to classify users at different stages of self‐service IS usage. Further, we examine user perceptions that differentiate among the users situated at different self‐service IS usage stages. Data were collected in the context of a self‐service Web‐based IS to validate the post‐adoption IS usage constructs and to examine the proposed thesis. The newly developed conceptual structure and measures for post‐adoption IS usage behaviour exhibit strong psychometric properties. The analysis shows three distinct post‐adoption IS usage stages and highlights that usefulness, user‐initiated learning, ease of use, satisfaction and voluntariness of use differentiate users at the different stages of post‐adoption IS usage. The results show that these variables aggregate into value confirmation and learning orientation as two higher‐level concepts. Further, we evaluate the predictive efficacy of the research model in classifying users into different post‐adoption self‐service IS usage stages. Implications are drawn for future research.     

A model-based survey of alert correlation techniques

As telecommunication networks evolve rapidly in terms of scalability, complexity, and heterogeneity, the efficiency of fault localization procedures and the accuracy in the detection of anomalous behaviors are becoming important factors that largely influence the decision making process in large management companies. For this reason, telecommunication companies are doing a big effort investing in new technologies and projects aimed at finding efficient management solutions. One of the challenging issues for network and system management operators is that of dealing with the huge amount of alerts generated by the managed systems and networks. In order to discover anomalous behaviors and speed up fault localization processes, alert correlation is one of the most popular resources. Although many different alert correlation techniques have been investigated, it is still an active research field. In this paper, a survey of the state of the art in alert correlation techniques is presented. Unlike other authors, we consider that the correlation process is a common problem for different fields in the industry. Thus, we focus on showing the broad influence of this problem. Additionally, we suggest an alert correlation architecture capable of modeling current and prospective proposals. Finally, we also review some of the most important commercial products currently available.