Grid Computing has become major player in super-computing community. But due to the diversity and disruptive nature of its resources, failure of jobs is not an exception. However, many researchers have come up with models that enhance jobs survivability. Popular among this model is checkpoint model which have the ability of saving already computed jobs on a stable secured storage. This model avoids re-computing of already computed jobs from the scratch in case of resources failure. But the time a job takes in checkpoinitng also becomes another task which adds overheads to computing resources thereby reducing the resources performance. In order not to add too many overheads to computing resources, the number of checkpoints must be minimized. This study proposed checkpoint interval models which is implemented based on fault index history of computing resources. Failed jobs are re-allocated from their last saved checkpoint using an exception handler. The study observed that arithmetic checkpoint model is better used when fault index of computing resources is high while geometric checkpoint model is better when fault index of resources is low.

In this paper, adaptive synchronization of fractional-order Lorenz systems with memristor is investigated. Based on the Lyapunov stability theories, several novel criteria are adopted to realize the synchronization of fractional-order Lorenz systems with memristor. Finally, some numerical examples are exploited to demonstrate the theoretical results.

Link prediction is an important part of complex network research. Traditional static link prediction algorithm ignores that nodes and links in network are added and removed over time. But temporal link prediction can use the information of historical network to make better prediction. Based on local random walk, this paper proposes a time-series random walk algorithm. Given link data for times 1 through T, then we predict the links at time T+1. The algorithm first computes the Markov probability transfer matrix at each time, then combines them into a transformation matrix, and applies the local random walk algorithm to obtain the final prediction result. The experimental results on real networks show that our algorithm demonstrates better than other algorithms.

By combining fractional differential operator with the memristor-based 4-D system, a fractional order 4-D system with memristor is proposed and the chaotic behavior of it is investigated. According to the chaos characteristics of the proposed system, an image encryption method is put forward. Numerical simulations suggest that the given image encryption method can make an image effectively resist statistics attack in transferring and saving.

In this research work, we propose an intelligent search technique called genetic simulated annealing algorithm (GASA) to obtain an approximate solution to the single machine total weighted tardiness job scheduling problem, which is a strong NP-hard. The developed approach is based on two metaheuristics: genetic algorithm (GA) and simulated annealing (SA) algorithm. In this context, when GA is exploited as a global search strategy to discover solution space, SA algorithm is used as a local search technique to enhance more efficiently the visited attractive regions to improve solution quality. Numerical results using a set of benchmarks have shown the capability of the proposed method to produce better solutions compared to results given by some other recently literature works.

In today’s fast changing business environment, it is extremely important to be able to respond to client needs in the most effective and timely manner. In online business, customers will wish to view products and services online without waiting or delaying. Researches have shown that most of the systems developed recently were not customer-centric. As a result, this research has proposed a customer-centric transformation for next generation e-commerce web application, which retails various brands of cars. The developed system would enable users to register, login, place order for desired products and make payment by using cash on delivery or pay later option, however, the user will be expected to pay shipping fee depending on the location. In developing the system, different strategies - like 3-tier architecture, server and model were considered. The tools used were bootstrap and JavaScript to design the front-end, codeigniter frame work for validation and verification, and to achieve a high degree of speed and less memory requirements, MySQL database were used. The result of the implementation did not only produced a customer centric website with many functionalities and user-friendly interface, but also provides an easy access to viewing orders placed by Administrators and Managers.

In order to deal with uncertain information of real-world, in 2011 Zadeh suggested the concept of a Z-number, as an ordered pair of fuzzy numbers (A ̃,B ̃) that describes the restriction and the reliability of the evaluation. Due to the limitation of its basic properties, converting Z-number to classical fuzzy number is rather significant for application. In this paper, we will calculate fuzzy expected value of a Z-number with assuming uniform distribution and linear membership functions. This fuzzy expected value can be used instead of Z-number in applications. An Example is used to illustrate the procedure of the proposed approach.

We propose an automatic, programmable and computational model consisting of biomolecules[1-5] by transforming a base pair into a one-dimensional matrix containing only 0,1, using the matrix length as the sample space, representing the event The sample point takes the percentage of the sample space as the percentage of the sample space as the probability of the event, and details the probability calculation problem into the model of the molecular calculation problem. After the introduction of the molecular matrix calculation probability method, the examples are given to illustrate the realization of the complex event molecular matrix calculation probability. In order to verify the feasibility and complexity of calculating the probability problem of the molecular matrix, we use the manual calculation probability to compare with the results of the DNA chain to predict the DNA secondary structure and its interaction through NUPACK[6] software.

This paper deals with the finite-time chaos synchronization of the delay Lorenz system with disturbance via a single controller. Based on the finite-time stability theory, a control law is proposed to realize finite-time chaos synchronization of delay Lorenz system with disturbance. Finally, numerical simulation results are given to demonstrate the effectiveness and robustness of the proposed scheme.