Establishing coverage of the target sensing field and extending the network’s lifetime, together known as Coverage-lifetime is the key issue in wireless sensor networks (WSNs). Recent studies realize the important role of nature-inspired algorithms in handling coverage-lifetime problem with different optimization aspects. One of the main formulations is to define coverage-lifetime problem as a disjoint set covers problem. In this paper, we propose an evolutionary algorithm for solving coverage-lifetime problem as a disjoint set covers function. The main interest in this paper is to reflect both models of sensing: Boolean and probabilistic. Moreover, a heuristic operator is proposed as a local refinement operator to improve the quality

Systematic Reviews in Pharmacy is a monthly Peer-review open access Journal,different scientists involved in Pharmaceutical research and development

The chemical properties of chemical compounds and their molecular structures are intimately connected. Topological indices are numerical values associated with chemical molecular graphs that help in understanding the physicochemical properties, chemical reactivity and biological activity of a chemical compound. This study obtains some topological properties of second and third dominating David derived (DDD) networks and computes several K Banhatti polynomial of second and third type of DDD.

      In this paper, we show that each soft topological group is a strong small soft loop transfer space at the identity element. This indicates that the soft quasitopological fundamental group of a soft connected and locally soft path connected space, is a soft topological group.

The research demonstrates new species of the games by applying separation axioms via  sets, where the relationships between the various species that were specified and the strategy of winning and losing to any one of the players, and their relationship with the concepts of separation axioms via  sets have been studied.

The aim of this paper is to present a weak form of -light functions by using -open set which is -light function, and to offer new concepts of disconnected spaces and totally disconnected spaces. The relation between them have been studied. Also, a new form of -totally disconnected and inversely -totally disconnected function have been defined, some examples and facts was submitted.

Soft closure spaces are a new structure that was introduced very recently. These new spaces are based on the notion of soft closure operators. This work aims to provide applications of soft closure operators. We introduce the concept of soft continuous mappings and soft closed (resp. open) mappings, support them with examples, and investigate some of their properties.

Nano crystalline copper sulphide (Cu2S) thin films pure and 3% Bi doped were deposited on glass substrate by thermal evaporation technique of thickness 400±20 nm under a vacuum of ~ 2 × 10− 5 mbar to study the influence of annealing temperatures ( as-deposited, and 573) K on structural, surface morphology and optical properties of (Cu2S and Cu2S:3%Bi). (XRD) X-ray diffraction analysis showed (Cu2S and Cu2S:3%Bi) films before and after annealing are polycrystalline and hexagonal structure. AFM measurement approves that (Cu2S and Cu2S:3%Bi) films were Nano crystalline with grain size of (105.05-158.12) nm. The optical properties exhibits good optical absorption for Cu2S:3%Bi films. Decreased of optical band gap from 2.25 to 2 eV after dop

Cadmium Oxide and Bi doped Cadmium Oxide thin films are prepared by using the chemical spray pyrolysis technique a glass substrate at a temperature of (400?C) with volumetric concentration (2,4)%. The thickness of all prepared films is about (400±20) nm. Transmittance and Absorbance spectra are recorded in the wave length ranged (400-800) nm. The nature of electronic transitions is determined, it is found out that these films have directly allowed transition with an optical energy gap of (2.37( eV for CdO and ) 2.59, 2.62) eV for (2% ,4%) Bi doped CdO respectively. The optical constants have been evaluated before and after doping.

A network (or formally a graph) can be described by a set of nodes and a set of edges connecting these nodes. Networks model many real-world phenomena in various research domains, such as biology, engineering and sociology. Community mining is discovering the groups in a network where individuals group of membership are not explicitly given. Detecting natural divisions in such complex networks is proved to be extremely NP-hard problem that recently enjoyed a considerable interest. Among the proposed methods, the field of evolutionary algorithms (EAs) takes a remarkable interest. To this end, the aim of this paper is to present the general statement of community detection problem in social networks. Then, it visits the problem as an optim