Sensibly highlighting the hidden structures of many real-world networks has attracted growing interest and triggered a vast array of techniques on what is called nowadays community detection (CD) problem. Non-deterministic metaheuristics are proved to competitively transcending the limits of the counterpart deterministic heuristics in solving community detection problem. Despite the increasing interest, most of the existing metaheuristic based community detection (MCD) algorithms reflect one traditional language. Generally, they tend to explicitly project some features of real communities into different definitions of single or multi-objective optimization functions. The design of other operators, however, remains canonical lacking any inte

In this paper, a new class of nonconvex sets and functions called strongly -convex sets and strongly -convex functions are introduced. This class is considered as a natural extension of strongly -convex sets and functions introduced in the literature. Some basic and differentiability properties related to strongly -convex functions are discussed. As an application to optimization problems, some optimality properties of constrained optimization problems are proved. In these optimization problems, either the objective function or the inequality constraints functions are strongly -convex. 

The techniques of fractional calculus are applied successfully in many branches of science and engineering, one of the techniques is the Elzaki Adomian decomposition method (EADM), which researchers did not study with the fractional derivative of Caputo Fabrizio. This work aims to study the Elzaki Adomian decomposition method (EADM) to solve fractional differential equations with the Caputo-Fabrizio derivative. We presented the algorithm of this method with the CF operator and discussed its convergence by using the method of the Cauchy series then, the method has applied to solve Burger, heat-like, and, couped Burger equations with the Caputo -Fabrizio operator. To conclude the method was convergent and effective for solving this type of

Dylan Thomas (1914-1953) is a modern poet belongs to the apocalyptic movement of the 1940's.This movement is influenced by the doctrines and techniques of surrealism.

              Poetry for him should not be primarily concerned with man in society, but with the celebration of spiritual truth. It should bring to light the hidden causes, hence  his personal interest is to strip darkness and explore the inward motives. To do this he uses a cluster of images: a constant building up and breaking down of images. His poetry depends on the romantic spontaneity, suggestiveness of the Symbolists and the the surrealists' mysterious liberation of the unconsciousness and

Dylan Thomas (1914-1953) is a modern poet belongs to the apocalyptic movement of the 1940's.This movement is influenced by the doctrines and techniques of surrealism. Poetry for him should not be primarily concerned with man in society, but with the celebration of spiritual truth. It should bring to light the hidden causes, hence his personal interest is to strip darkness and explore the inward motives. To do this he uses a cluster of images: a constant building up and breaking down of images. His poetry depends on the romantic spontaneity, suggestiveness of the Symbolists and the the surrealists' mysterious liberation of the unconsciousness and the emotional involvement in the dynamics of life. In "Light Breaks

Within the framework of big data, energy issues are highly significant. Despite the significance of energy, theoretical studies focusing primarily on the issue of energy within big data analytics in relation to computational intelligent algorithms are scarce. The purpose of this study is to explore the theoretical aspects of energy issues in big data analytics in relation to computational intelligent algorithms since this is critical in exploring the emperica aspects of big data. In this chapter, we present a theoretical study of energy issues related to applications of computational intelligent algorithms in big data analytics. This work highlights that big data analytics using computational intelligent algorithms generates a very high amo

The Hopfield network is one of the easiest types, and its architecture is such that each neuron in the network connects to the other, thus called a fully connected neural network. In addition, this type is considered auto-associative memory, because the network returns the pattern immediately upon recognition, this network has many limitations, including memory capacity, discrepancy, orthogonally between patterns, weight symmetry, and local minimum. This paper proposes a new strategy for designing Hopfield based on XOR operation; A new strategy is proposed to solve these limitations by suggesting a new algorithm in the Hopfield network design, this strategy will increase the performance of Hopfield by modifying the architecture of t