ARO: A new model free optimization algorithm for real time applications inspired by the asexual reproduction

This paper presents a new individual based optimization algorithm, which is inspired from asexual reproduction known as a remarkable biological phenomenon, called as asexual reproduction optimization (ARO). ARO can be essentially considered as an evolutionary based algorithm that mathematically models the budding mechanism of asexual reproduction. In ARO, a parent produces a bud through a reproduction operator; thereafter the parent and its bud compete to survive according to a performance index obtained from the underlying objective function of the optimization problem; this leads to the fitter individual. ARO adaptive search ability along with its strength and weakness points are fully described in the paper. Furthermore, the ARO convergence to the global optimum is mathematically analyzed. To approve the effectiveness of the ARO performance, it is tested with several benchmark functions frequently used in the area of optimization. Finally, the ARO performance is statistically compared with that of an improved genetic algorithm (GA). Results of simulation illustrate that ARO remarkably outperforms GA.     

Non-parametric statistical background modeling for efficient foreground region detection

Most methods for foreground region detection in videos are challenged by the presence of quasi-stationary backgrounds—flickering monitors, waving tree branches, moving water surfaces or rain. Additional difficulties are caused by camera shake or by the presence of moving objects in every image. The contribution of this paper is to propose a scene-independent and non-parametric modeling technique which covers most of the above scenarios. First, an adaptive statistical method, called adaptive kernel density estimation (AKDE), is proposed as a base-line system that addresses the scene dependence issue. After investigating its performance we introduce a novel general statistical technique, called recursive modeling (RM). The RM overcomes the weaknesses of the AKDE in modeling slow changes in the background. The performance of the RM is evaluated asymptotically and compared with the base-line system (AKDE). A wide range of quantitative and qualitative experiments is performed to compare the proposed RM with the base-line system and existing algorithms. Finally, a comparison of various background modeling systems is presented as well as a discussion on the suitability of each technique for different scenarios.     

A survey and taxonomy on energy efficient resource allocation techniques for cloud computing systems

In a cloud computing paradigm, energy efficient allocation of different virtualized ICT resources (servers, storage disks, and networks, and the like) is a complex problem due to the presence of heterogeneous application (e.g., content delivery networks, MapReduce, web applications, and the like) workloads having contentious allocation requirements in terms of ICT resource capacities (e.g., network bandwidth, processing speed, response time, etc.). Several recent papers have tried to address the issue of improving energy efficiency in allocating cloud resources to applications with varying degree of success. However, to the best of our knowledge there is no published literature on this subject that clearly articulates the research problem and provides research taxonomy for succinct classification of existing techniques. Hence, the main aim of this paper is to identify open challenges associated with energy efficient resource allocation. In this regard, the study, first, outlines the problem and existing hardware and software-based techniques available for this purpose. Furthermore, available techniques already presented in the literature are summarized based on the energy-efficient research dimension taxonomy. The advantages and disadvantages of the existing techniques are comprehensively analyzed against the proposed research dimension taxonomy namely: resource adaption policy, objective function, allocation method, allocation operation, and interoperability.     

Simultaneous state estimation and parameter identification in linear fractional order systems using coloured measurement noise

In the present paper, the identification and estimation problem of a single-input–single-output (SISO) fractional order state-space system will be addressed. A SISO state-space model is considered in which parameters and also state variables should be estimated. The canonical fractional order state-space system will be transformed into a regression equation by using a linear transformation and a shift operator that are appropriate for identification. The identification method provided in this paper is based on a recursive identification algorithm that has the capability of identifying the parameters of fractional order state-space system recursively. Another subject that will be addressed in this paper is a novel fractional order Kalman filter suitable for the systems with coloured measurement noise. The promising performance of the proposed methods is verified using two stable fractional order systems.     

High throughput blood plasma separation using a passive PMMA microfluidic device

Since plasma is rich in many biomarkers used in clinical diagnostic experiments, microscale blood plasma separation is a primitive step in most of microfluidic analytical chips. In this paper, a passive microfluidic device for on-chip blood plasma separation based on Zweifach–Fung effect and plasma skimming was designed and fabricated by hot embossing of microchannels on a PMMA substrate and thermal bonding process. Human blood was diluted in various times and injected into the device. The main novelty of the proposed microfluidic device is the design of diffuser-shaped daughter channels. Our results demonstrated that this design exerted a considerable positive influence on the separation efficiency of the passive separator device, and the separation efficiency of 66.6 % was achieved. The optimum purity efficiency of 70 % was achieved for 1:100 dilution times.     

Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm

Flow shop problems as a typical manufacturing challenge have gained wide attention in academic fields. In this paper, we consider a bi-criteria permutation flow shop scheduling problem, where the weighted mean completion time and the weighted mean tardiness are to be minimized simultaneously. Due to the complexity of the problem, it is very difficult to obtain optimum solution for this kind of problems by means of traditional approaches. Therefore, a new multi-objective shuffled frog-leaping algorithm (MOSFLA) is introduced for the first time to search locally Pareto-optimal frontier for the given problem. To prove the efficiency of the proposed algorithm, various test problems are solved and the reliability of the proposed algorithm, based on some comparison metrics, is compared with three distinguished multi-objective genetic algorithms, i.e. PS-NC GA, NSGA-II, and SPEA-II. The computational results show that the proposed MOSFLA performs better than the above genetic algorithms, especially for the large-sized problems.     

Modeling industrial thickener using computational fluid dynamics (CFD), a case study: Tailing thickener in the Sarcheshmeh copper mine

Separation of particles from liquid in the large gravitational tanks is widely used in mining and industrial wastewater treatment process. Thickener is key unit in the operational processes of hydrometallurgy and is used to separate solid from liquid. In this study, population balance models were combined with computational fluid dynamics (CFD) for modeling the tailing thickener. Parameters such as feed flow rate, flocculant dosage, inlet solid percent and feedwell were investigated. CFD was used to simulate the industrial tailing thickener with settled bed of 120 m diameter which is located in the Sarcheshmeh copper mine. Important factor of drag force that defines the rake torque of rotating paddles on the bed was also determined. Two phases turbulence model of Eulerian/Eulerian in accordance with turbulence model of k-ε was used in the steady-state. Also population balance model consists of 15 groups of particle sizes with Luo and Lehr kernel was used for aggregation/breakage kernel. The simulation results showed good agreement with the operational data.     

A general insight into the effect of neuron structure on classification

This paper gives a general insight into how the neuron structure in a multilayer perceptron (MLP) can affect the ability of neurons to deal with classification. Most of the common neuron structures are based on monotonic activation functions and linear input mappings. In comparison, the proposed neuron structure utilizes a nonmonotonic activation function and/or a nonlinear input mapping to increase the power of a neuron. An MLP of these high power neurons usually requires a less number of hidden nodes than conventional MLP for solving classification problems. The fewer number of neurons is equivalent to the smaller number of network weights that must be optimally determined by a learning algorithm. The performance of learning algorithm is usually improved by reducing the number of weights, i.e., the dimension of the search space. This usually helps the learning algorithm to escape local optimums, and also, the convergence speed of the algorithm is increased regardless of which algorithm is used for learning. Several 2-dimensional examples are provided manually to visualize how the number of neurons can be reduced by choosing an appropriate neuron structure. Moreover, to show the efficiency of the proposed scheme in solving real-world classification problems, the Iris data classification problem is solved using an MLP whose neurons are equipped by nonmonotonic activation functions, and the result is compared with two well-known monotonic activation functions.     

A general computational recognition primed decision model with multi-agent rescue simulation benchmark

Analytical decision making strategies rely on weighing pros and cons of multiple options in an unbounded rationality manner. Contrary to these strategies, recognition primed decision (RPD) model which is a primary naturalistic decision making (NDM) approach assumes that experienced and professional decision makers when encounter problems in real operating conditions are able to use their previous experiences and trainings in order to diagnose the problem, recall the appropriate solution, evaluate it mentally, and implement it to handle the problem in a satisficing manner. In this paper, a computational form of RPD, now called C-RPD, is presented. Unified Modeling Language was used as a modeling language to represent the proposed C-RPD model in order to make the implementation easy and obvious. To execute the model, RoboCup Rescue agent simulation environment, which is one of the best and the most famous complex and multi-agent large-scale environments, was selected. The environment simulates the incidence of fire and earthquakes in urban areas where it is the duty of the police forces, firefighters and ambulance teams to control the crisis. Firefighters of SOS team are first modeled and implemented by utilizing C-RPD and then the system is trained using an expert’s experience. There are two evaluations. To find out the convergence of different versions developed during experience adding, some of the developed versions are chosen and evaluated on seven maps. Results show performance improvements. The SOS team ranked first in an official world championship and three official open tournaments.