An alternative node deployment scheme for WSNs

© 2001-2012 IEEE. Sensing coverage is a fundamental design problem in wireless sensor networks (WSNs). This is because there is always a possibility that the sensor nodes may function incorrectly due to a number of reasons, such as failure, power, or noise instability, which negatively influences the coverage of the WSNs. In order to address this problem, we propose a fuzzy-based self-healing coverage scheme for randomly deployed mobile sensor nodes. The proposed scheme determines the uncovered sensing areas and then select the best mobile nodes to be moved to minimize the coverage hole. In addition, it distributes the sensor nodes uniformly considering Euclidean distance and coverage redundancy among the mobile nodes. We have performed an extensive performance analysis of the proposed scheme. The results of the experiment show that the proposed scheme outperforms the existing approaches.

Classification of self-consumable highlights for soccer video summaries

An effective scheme for soccer summarization is significant to improve the usage of this massively growing video data. The paper presents an extension to our recent work which proposed a framework to integrate highlights into play-breaks to construct more complete soccer summaries. The current focus is to demonstrate the benefits of detecting some specific audio-visual features during play-break sequences in order to classify highlights contained within them. The main purpose is to generate summaries which are self-consumable individually. To support this framework, the algorithms for shot classification and detection of near-goal and slow-motion replay scenes is described. The results of our experiment using 5 soccer videos (20 minutes each) show the performance and reliability of our framework.

The power of play-break for automatic detection and browsing of self-consumable sport video highlights

To enable content-based retrieval, highlights extraction from broadcasted sport video has been an active research topic in the last decade. There is a well-known theory that high-level semantic, such as goal in soccer can be detected based on the occurrences of specific audio and visual features that can be extracted automatically. However, there is yet a definitive solution for the scope (i.e. start and end) of the detection for self consumable highlights. Thus, in this paper we will primarily demonstrate the benefits of using play-break for this purpose. Moreover, we also propose a browsing scheme that is based on integrated play-break and highlights (extended from [1]). To validate our approach, we will present the results from some experiments and a user study.

On the discrete time dynamics of a self-stabilizing MCA learning algorithm

The stability of minor component analysis (MCA) learning algorithms is an important problem in many signal processing applications. In this paper, we propose an effective MCA learning algorithm that can offer better stability. The dynamics of the proposed algorithm are analyzed via a corresponding deterministic discrete time (DDT) system. It is proven that if the learning rate satisfies some mild conditions, almost all trajectories of the DDT system starting from points in an invariant set are bounded, and will converge to the minor component of the autocorrelation matrix of the input data. Simulation results will be furnished to illustrate the theoretical results achieved.

Interoperable and transparent dynamic deployment of web services for service oriented grids

Dynamic deployment of Web services is a term used frequently when describing the selection and deployment of a service to a grid host. Although current grid systems (such as Globus) provide dynamic deployment, the requirements of the service being deployed are not considered. Therefore truly dynamic deployment cannot be achieved as the services deployed are restricted to the grid system used. We present a dynamic deployment mechanism as part of self configuration in a service oriented grid environment. The dynamic deployment mechanism takes the requirements of the service into consideration, including parameters such as the operating system required to execute the service, the required software libraries, any additional required software packages, price and Quality of Service (QoS) parameters.

An empirical study of neighbourhood decay in Kohonen's self organizing map

In this paper, empirical results are presented which suggest that size and rate of decay of region size plays a much more significant role in the learning, and especially the development, of topographic feature maps. Using these results as a basis, a scheme for decaying region size during SOM training is proposed. The proposed technique provides near optimal training time. This scheme avoids the need for sophisticated learning gain decay schemes, and precludes the need for a priori knowledge of likely training times. This scheme also has some potential uses for continuous learning.

Beyond the topological map : developing alternate mappings in self organisation

The self organising map is a well established unsupervised
learning technique which is able to form sophisticated representations of an input data set. However, conventional Self Organising Map (SOM) algorithms are limited to the production of topological maps — that is, maps where distance between points on the map have a direct relationship to the Euclidean distance between the training vectors corresponding to those points.

It would be desirable to be able to create maps which form clusters on primitive attributes other than Euclidean distance; for example, clusters based upon orientation or shape. Such maps could provide a novel approach to pattern recognition tasks by providing a new method to associate groups of data.

In this paper, it is shown that the type of map produced by SOM algorithms is a direct consequence of the lateral connection strategy employed. Given this knowledge, a technique is required to establish the feasability of using an alternative lateral connection strategy. Such a technique is presented. Using this technique, it is possible to rule out lateral connection strategies that will not produce output states useful to the organisation process. This technique is demonstrated using conventional Laplacian interconnection as well as a number of novel interconnection strategies.

Being a ‘wog’ in Melbourne – young people's self-fashioning through discourses of racism

The Greek community in Melbourne, Australia, is large and has a long history in the city. It is diverse and associated with a range of cultural, social and political structures. It has strong transnational links and in many ways exemplifies ‘diasporic’ in contradistinction to ‘migrant’. This paper focuses on young people from this community, particularly those who attend schools established to promote Greek language and cultural maintenance. In this paper, we examine such students’ explorations of their cultural identifications, most specifically how they adopt the term ‘wog’. This term is complex and its place in Australian discourse has shifted over time. Tracking these shifts and considering them as a context for these young people's use of the term allows us to consider the processes involved in their self-fashioning. We argue that their uptake of ‘wog’ involves the deployment of irony, given their awareness of its strong association with racism. We are also interested in the potential for women's experience to be silenced through the common association between ‘wog’ and protest masculinities. We argue that these students’ use of the term illustrates self-fashioning that provides insights into the complexities that surround cultural identification at the micro level, including schooling, but also in the broader context of globalisation.

Growing self-organizing map for online continuous clustering

The internet age has fuelled an enormous explosion in the amount of information generated by humanity. Much of this information is transient in nature, created to be immediately consumed and built upon (or discarded). The field of data mining is surprisingly scant with algorithms that are geared towards the unsupervised knowledge extraction of such dynamic data streams. This chapter describes a new neural network algorithm inspired by self-organising maps. The new algorithm is a hybrid algorithm from the growing self-organising map (GSOM) and the cellular probabilistic self-organising map (CPSOM). The result is an algorithm which generates a dynamically growing feature map for the purpose of clustering dynamic data streams and tracking clusters as they evolve in the data stream.

Asymmetric self-learning for tackling Twitter spam drift

Spam has become a critical problem on Twitter. In order to stop spammers, security companies apply blacklisting services to filter spam links. However, over 90% victims will visit a new malicious link before it is blocked by blacklists. To eliminate the limitation of blacklists, researchers have proposed a number of statistical features based mechanisms, and applied machine learning techniques to detect Twitter spam. In our labelled large dataset, we observe that the statistical properties of spam tweets vary over time, and thus the performance of existing ML based classifiers are poor. This phenomenon is referred as 'Twitter Spam Drift'. In order to tackle this problem, we carry out deep analysis of 1 million spam tweets and 1 million non-spam tweets, and propose an asymmetric self-learning (ASL) approach. The proposed ASL can discover new information of changed tweeter spam and incorporate it into classifier training process. A number of experiments are performed to evaluate the ASL approach. The results show that the ASL approach can be used to significantly improve the spam detection accuracy of using traditional ML algorithms.