Evolutionary·co.nipimit'iQo  is  a· c'!a s of glbbal ·searb  techniq

based on the lei.lffi:ing process ,of  g po_pl)'latiog-·of pote.n:tiaf solutions to

a  ven probl_e-ID'.  thahas .been  succe_ssfull'y  applied    19  v ety of

prQblern, lll thls paper a riew approach  to. design lie_ ural ne'twQj:ks

based oh ev.ohltipnary -computa.tio.rt i·s pre.Seri-L  _A   tine-f.!£ clurP.mosome

'repr:esentati:on  or the etwor}< i_s.  u_secl: 'Q.y  genetiC  gperntb_l:s, whicQ

allow th¢  voJution of.the   chitecture and' weight-s Â

     Binary relations or interactions among bio-entities, such as proteins, set up the essential part of any living biological system. Protein-protein interactions are usually structured in a graph data structure called "protein-protein interaction networks" (PPINs). Analysis of PPINs into complexes tries to lay out the significant knowledge needed to answer many unresolved questions, including how cells are organized and how proteins work. However, complex detection problems fall under the category of non-deterministic polynomial-time hard (NP-Hard) problems due to their computational complexity. To accommodate such combinatorial explosions, evolutionary algorithms (EAs) are proven effective alternatives to heuristics in solvin

Astronomy image is regarded main source of information to discover outer space, therefore to know the basic contain for galaxy (Milky way), it was classified using Variable Precision Rough Sets technique to determine the different region within galaxy according different color in the image. From classified image we can determined the percentage for each class and then what is the percentage mean. In this technique a good classified image result and faster time required to done the classification process.

 In the current study, the definition of mapping of fuzzy neutrosophic generalized semi-continuous and fuzzy neutrosophic alpha has generalized mapping as continuous. The study confirmed some theorems regarding such a concept. In the following, it has been found relationships among fuzzy neutrosophic alpha generalized mapping as continuous, fuzzy neutrosophic mapping as continuous, fuzzy neutrosophic alpha mapping as continuous, fuzzy neutrosophic generalized semi mapping as continuous, fuzzy neutrosophic pre mapping as continuous and fuzzy neutrosophic γ mapping as continuous.

Mosques could be considered as one of the most powerful architectural types throughout historical ages. With their highly symbolic formal legacy, Mosques  play an essential role in providing the Islamic city with its special identity. Nevertheless, the advent of digital technology and its ubiquity at different levels of architectural design marked the emergence of new tendencies in the Architecture of Mosques, represented by various models added to the storage of this architectural type. Consequently a review of these tendencies would be needed, aiming at pointing out the formal transformations and new suggested characteristics.

The paper investigates the surviving and the disappearing formal components of&n

In this research and by using the concept of   , a new set of near  set which is nano-Ἷ-semi-g-closed set was defined. Some properties and examples with illustrative table and an applied example were presented.

Establishing complete and reliable coverage for a long time-span is a crucial issue in densely surveillance wireless sensor networks (WSNs). Many scheduling algorithms have been proposed to model the problem as a maximum disjoint set covers (DSC) problem. The goal of DSC based algorithms is to schedule sensors into several disjoint subsets. One subset is assigned to be active, whereas, all remaining subsets are set to sleep. An extension to the maximum disjoint set covers problem has also been addressed in literature to allow for more advance sensors to adjust their sensing range. The problem, then, is extended to finding maximum number of overlapped set covers. Unlike all related works which concern with the disc sensing model, the cont

This paper presents a linear fractional programming problem (LFPP) with rough interval coefficients (RICs) in the objective function. It shows that the LFPP with RICs in the objective function can be converted into a linear programming problem (LPP) with RICs by using the variable transformations. To solve this problem, we will make two LPP with interval coefficients (ICs). Next, those four LPPs can be constructed under these assumptions; the LPPs can be solved by the classical simplex method and used with MS Excel Solver. There is also argumentation about solving this type of linear fractional optimization programming problem. The derived theory can be applied to several numerical examples with its details, but we show only two examples

In this paper, we generalized the principle of Banach contractive to the relative formula and then used this formula to prove that the set valued mapping has a fixed point in a complete partial metric space. We also showed that the set-valued mapping can have a fixed point in a complete partial metric space without satisfying the contraction condition. Additionally, we justified an example for our proof.