Artificial Bee Colony (ABC) algorithm is based on natural behavior of honey bees and has earned good success in optimization area. In this paper a new quantum inspired algorithm that is called Quantum Artificial Bee Colony (QABC) is presented. QABC is a general method and in this work it is adapted to be applied on Knapsack 0-1 problem. In the experiments QABC is compared with classic ABC and the results present robustness of QABC.

Artificial Neural Networks (ANN) and evolutionary algorithms are two relatively young research areas that were subject to a steadily growing interest during the past years. The use of ANN has been proved to be a cost-effective technique. It is very important to choose a suitable algorithm for training a neural network. Mostly Back Propagation (BP) algorithm is a gradient descent algorithm (a first-order optimization algorithm) on the error space, which most likely gets trapped into a local minimum and has very slow convergence. This shortcoming can be removed by global searching ability of the evolutionary algorithms such as Imperialist Competitive Algorithm (ICA) which is a new evolutionary algorithm based on the human's socio-political evolution. This investigation provides a comparison between training a neural network with BP algorithms used for training Feed-forward Neural Networks (FNN) and ICA. Among the BP algorithms, Gradient descent, Levenberg–Marquardt, Conjugate gradient descent, Resilient, BFGS Quasi-newton, and One-step secant algorithm are tested then the obtained results will be compared with the results of training the neural network with ICA. Also, Accuracy and Mean Squared Error (MSE) are the main measures selected to assess both models. Also the MSE was used as a criterion to specify optimum number of neurons in the hidden layer. The results showed that ICA approach outperforms the BP for training neural network models.

The object of the present paper is to study a generalized Ricci-recurrent LP-Sasakian manifold. Here we show that the generalized Ricci-recurrent LP-Sasakian manifold admitting cyclic Ricci tensor is an Einstein manifold.

In this paper we have considered the following coupled system of nonlinear ordinary differential equations. \[x^{n_1}_1(t)=f_1(t,x_2(t))\] \[x^{n_2}_2(t)=f_2(t,x_1(t))\] where \( f_1,f_2\) are real valued functions on \( [t_0,\infty)×R, \quad t\geq t_0>0\). We have given sufficient conditions on the nonlinear functions \( f_1,f_2\), such that the solutions pair \( x_1,x_2\) asymptotically behaves like a pair of real polynomials.

In this Paper we give a scheme for the numerical solution of fractional order Logistic equations (FOLE) using operational matrices for fractional order integration and multiplications based on Bernstein Polynomials (BPs). By this method we get the FOLE in the form of a system of algebraic equations which is simple in handling for the numerical solutions and better approximations are obtained. For the illustration of the efficiency and simplicity of the scheme, three examples are added in the paper.

The goal of this paper is to present some common fixed point theorems for multivalued weakly C-contractive mappings in quasi-ordered complete metric space. These results generalizes the existing fixed point results in the literature.

Frame theory is Lattice theory applied to topology. This approach to topology takes the lattices of open sets as the basic notion-it is "point free topology". There, one investigates typical properties of lattices of open sets that can be expressed without reference to points. In this paper we generalise the concept of frame into a fuzzy frame. The category FFrm of fuzzy frame and fuzzy frame homomorphism is defined and we show that there exist products and coproducts in the category FFrm and to construct them explicitly and we conclude that the category FFrm is complete and cocomplete.

In this paper, suitable operations are defined on the class of partitions of a language which give rise to certain monoids and semigroups. In particular, certain algebraic structures of a language defined over a string are described.