Semi-Supervised Sparse Coding

Sparse coding approximates the data sample as a sparse linear combination of some basic codewords and uses the sparse codes as new presentations. In this paper, we investigate learning discriminative sparse codes by sparse coding in a semi-supervised manner, where only a few training samples are labeled. By using the manifold structure spanned by the data set of both labeled and unlabeled samples and the constraints provided by the labels of the labeled samples, we learn the variable class labels for all the samples. Furthermore, to improve the discriminative ability of the learned sparse codes, we assume that the class labels could be predicted from the sparse codes directly using a linear classifier. By solving the codebook, sparse codes, class labels and classifier parameters simultaneously in a unified objective function, we develop a semi-supervised sparse coding algorithm. Experiments on two real-world pattern recognition problems demonstrate the advantage of the proposed methods over supervised sparse coding methods on partially labeled data sets

Cell fault management using machine learning techniques

This paper surveys the literature relating to the application of machine learning to fault management in cellular networks from an operational perspective. We summarise the main issues as 5G networks evolve, and their implications for fault management. We describe the relevant machine learning techniques through to deep learning, and survey the progress which has been made in their application, based on the building blocks of a typical fault management system. We review recent work to develop the abilities of deep learning systems to explain and justify their recommendations to network operators. We discuss forthcoming changes in network architecture which are likely to impact fault management and offer a vision of how fault management systems can exploit deep learning in the future. We identify a series of research topics for further study in order to achieve this

Performance analysis with network-enhanced complexities: On fading measurements, event-triggered mechanisms, and cyber attacks

Copyright © 2014 Derui Ding et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.Nowadays, the real-world systems are usually subject to various complexities such as parameter uncertainties, time-delays, and nonlinear disturbances. For networked systems, especially large-scale systems such as multiagent systems and systems over sensor networks, the complexities are inevitably enhanced in terms of their degrees or intensities because of the usage of the communication networks. Therefore, it would be interesting to (1) examine how this kind of network-enhanced complexities affects the control or filtering performance; and (2) develop some suitable approaches for controller/filter design problems. In this paper, we aim to survey some recent advances on the performance analysis and synthesis with three sorts of fashionable network-enhanced complexities, namely, fading measurements, event-triggered mechanisms, and attack behaviors of adversaries. First, these three kinds of complexities are introduced in detail according to their engineering backgrounds, dynamical characteristic, and modelling techniques. Then, the developments of the performance analysis and synthesis issues for various networked systems are systematically reviewed. Furthermore, some challenges are illustrated by using a thorough literature review and some possible future research directions are highlighted.This work was supported in part by the National Natural Science Foundation of China under Grants 61134009, 61329301, 61203139, 61374127, and 61374010, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

Towards Flexible and Cognitive Production—Addressing the Production Challenges

Globalization in the field of industry is fostering the need for cognitive production systems. To implement modern concepts that enable tools and systems for such a cognitive production system, several challenges on the shop floor level must first be resolved. This paper discusses the implementation of selected cognitive technologies on a real industrial case-study of a construction machine manufacturer. The partner company works on the concept of mass customization but utilizes manual labour for the high-variety assembly stations or lines. Sensing and guidance devices are used to provide information to the worker and also retrieve and monitor the working, with respecting data privacy policies. Next, a specified process of data contextualization, visual analytics, and causal discovery is used to extract useful information from the retrieved data via sensors. Communications and safety systems are explained further to complete the loop of implementation of cognitive entities on a manual assembly line. This deepened involvement of cognitive technologies are human-centered, rather than automated systems. The explained cognitive technologies enhance human interaction with the processes and ease the production methods. These concepts form a quintessential vision for an effective assembly line. This paper revolutionizes the existing industry 4.0 with an even-intensified human–machine interaction and moving towards cognitivity

Design and implementation for automated network troubleshooting using data mining

The efficient and effective monitoring of mobile networks is vital given the number of users who rely on such networks and the importance of those networks. The purpose of this paper is to present a monitoring scheme for mobile networks based on the use of rules and decision tree data mining classifiers to upgrade fault detection and handling. The goal is to have optimisation rules that improve anomaly detection. In addition, a monitoring scheme that relies on Bayesian classifiers was also implemented for the purpose of fault isolation and localisation. The data mining techniques described in this paper are intended to allow a system to be trained to actually learn network fault rules. The results of the tests that were conducted allowed for the conclusion that the rules were highly effective to improve network troubleshooting.Comment: 19 pages, 7 figures, International Journal of Data Mining & Knowledge Management Process (IJDKP) Vol.5, No.3, May 201

Sensor placement for fault location identification in water networks: A minimum test cover approach

This paper focuses on the optimal sensor placement problem for the identification of pipe failure locations in large-scale urban water systems. The problem involves selecting the minimum number of sensors such that every pipe failure can be uniquely localized. This problem can be viewed as a minimum test cover (MTC) problem, which is NP-hard. We consider two approaches to obtain approximate solutions to this problem. In the first approach, we transform the MTC problem to a minimum set cover (MSC) problem and use the greedy algorithm that exploits the submodularity property of the MSC problem to compute the solution to the MTC problem. In the second approach, we develop a new \textit{augmented greedy} algorithm for solving the MTC problem. This approach does not require the transformation of the MTC to MSC. Our augmented greedy algorithm provides in a significant computational improvement while guaranteeing the same approximation ratio as the first approach. We propose several metrics to evaluate the performance of the sensor placement designs. Finally, we present detailed computational experiments for a number of real water distribution networks

High Performance Communication Framework for Mobile Sinks Wireless Sensor Networks

A wireless sensor networks typically consist of thousand of nodes and each node has limited power, processing and bandwidth resources. Harvesting advances in the past decade in microelectronics, sensing, wireless communications and networking, sensor networks technology is expected to have a significant impact on our lives in the twenty-first century. Proposed applications of sensor networks include environmental monitoring, natural disaster prediction and relief, homeland security, healthcare, manufacturing, transportation, and home appliances and entertainment. However, Communication is one of the major challenges in wireless sensor networks as it is the main source for energy depletion. Improved network lifetime is a fundamental challenge of wireless sensor networks. Many researchers have proposed using mobile sinks as one possible solution to improve the lifetime of wireless sensor networks. The reason is that the typical manyto- one communication traffic pattern in wireless sensor networks imposes a heavy forwarding load on the nodes close to the sinks. However, it also introduces many research challenges such as the high communication overhead for updating the dynamic routing paths to connect to mobile sinks and packet loss problems while transmitted messages to mobile sinks. Therefore, our goal is to design a robust and efficient routing framework for both non-geographic aware and geographic aware mobile sinks wireless sensor networks. In order to achieve this goal in non-geographic based mobile sinks wireless sensor networks, we proposed a spider-net zone routing protocol to improve network efficiency and lifetime. Our proposed routing protocol utilise spider web topology inspired by the way spiders hunt prey in their web to provide reliable and high performance data delivery to mobile sinks. For routing in geographic aware based mobile sinks wireless sensor networks, we proposed a fault-tolerant magnetic coordinate routing algorithm to allow these network sensors to take advantage of geographic knowledge to build a routing protocol. Our proposed routing algorithm incorporates a coordinated routing algorithm for grid based network topology to improve network performance. Our third contribution is a component level fault diagnosis scheme for wireless sensor networks. The advantage of this scheme, causal model fault diagnosis, is that it can "deeply understand" and express the relationship among failure behaviours and node system components through causal relations. The above contributions constitute a novel routing framework to address the routing challenges in mobile sinks wireless sensor networks, Our framework considers both geographic and non-geographic aware based sensor networks to achieve energy efficient, high performance and network reliability. We have analyzed the proposed protocols and schemes and evaluated their performances using analytical study and simulations. The evaluation was based on the most important metries in wireless sensor networks, such as: power consumption and average delay. The evaluation shows that our solution is more energy efficient, improves the network performance, and provides data reliability in mobile sinks wireless sensor networks