An efficient meta-heuristic algorithm for grid computing

A grid computing system consists of a group of programs and resources that are spread across machines in the grid. A grid system has a dynamic environment and decentralized distributed resources, so it is important to provide efficient scheduling for applications. Task scheduling is an NP-hard problem and deterministic algorithms are inadequate and heuristic algorithms such as particle swarm optimization (PSO) are needed to solve the problem. PSO is a simple parallel algorithm that can be applied in different ways to resolve optimization problems. PSO searches the problem space globally and needs to be combined with other methods to search locally as well. In this paper, we propose a hybrid-scheduling algorithm to solve the independent task- scheduling problem in grid computing. We have combined PSO with the gravitational emulation local search (GELS) algorithm to form a new method, PSO–GELS. Our experimental results demonstrate the effectiveness of PSO–GELS compared to other algorithms.

Special issue : recent advances in soft computing : theories and applications

Soft Computing is an interdisciplinary area that encompasses a variety of computing paradigms. Examples of some popular soft computing paradigms include fuzzy computing, neural computing, evolutionary computing, and probabilistic computing. Soft computing paradigms, in general, aim to produce computing systems/machines that exhibit some useful properties, e.g. making inference with vague and/or ambiguous information, learning from noisy and/or incomplete data, adapting to changing environments, and reasoning with uncertainties. These properties are important for the systems/machines to be useful in assisting humans in our daily activities. Indeed, soft computing paradigms have been demonstrated to be capable of tackling a wide range of problems, e.g. optimization, decision making, information processing, pattern recognition, and intelligent data analysis. A number of papers pertaining to some recent advances in theoretical development and practical application of different soft computing paradigms are highlighted in this special issue.

Community-based learning (CBL) via facebook mobile “it is time to BYOD (bring your own device)

 The penetration of social networking platforms such as Facebook is becoming pervasive in education, along with mobile applications (apps) and mobile devices. Students are using these technologies and apps to organise their learning material. Social media via apps is the most popular activity among college students. In this paper we discuss how teachers could take advantage of Facebook social media platform to promote community-based-learning environment that is flexible, portable and challengeable. We describe how this could be achieved with no restriction to any particular mobile device brand or operating system and how student would simply bring their own device (BYOD).

Recognition from appearance subspaces across image sets of variable scale

Linear subspace representations of appearance variation are pervasive in computer vision. In this paper we address the problem of robustly matching them (computing the similarity between them) when they correspond to sets of images of different (possibly greatly so) scales. We show that the naïve solution of projecting the low-scale subspace into the high-scale image space is inadequate, especially at large scale discrepancies. A successful approach is proposed instead. It consists of (i) an interpolated projection of the low-scale subspace into the high-scale space, which is followed by (ii) a rotation of this initial estimate within the bounds of the imposed “downsampling constraint”. The optimal rotation is found in the closed-form which best aligns the high-scale reconstruction of the low-scale subspace with the reference it is compared to. The proposed method is evaluated on the problem of matching sets of face appearances under varying illumination. In comparison to the naïve matching, our algorithm is shown to greatly increase the separation of between-class and within-class similarities, as well as produce far more meaningful modes of common appearance on which the match score is based.

GLOA : a new job scheduling algorithm for grid computing

The purpose of grid computing is to produce a virtual supercomputer by using free resources available through widespread networks such as the Internet. This resource distribution, changes in resource availability, and an unreliable communication infrastructure pose a major challenge for efficient resource allocation. Because of the geographical spread of resources and their distributed management, grid scheduling is considered to be a NP-complete problem. It has been shown that evolutionary algorithms offer good performance for grid scheduling. This article uses a new evaluation (distributed) algorithm inspired by the effect of leaders in social groups, the group leaders' optimization algorithm (GLOA), to solve the problem of scheduling independent tasks in a grid computing system. Simulation results comparing GLOA with several other evaluation algorithms show that GLOA produces shorter makespans.