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 optimization problem where a modularity-based ( ) and normalized mutual information ( ) metrics are formulated to describe the problem. An evolutionary algorithm is then expressed in the light of its characteristic components to tackle the problem. The presentation will highlight the possible alternative that can be adopted in this study for individual representation, fitness evaluations, and crossover and mutation operators. The results point out that adopting as a fitness function carries out more correct solutions than adopting the modularity function . Moreover, the strength of mutation has a background role. When coupled with non elite selection, increasing mutation probability could results in better solutions. However, when elitism is used, increasing mutation probability could bewilder the behavior of EA.
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 optimization problem where a modularity-based ( ) and normalized mutual information ( ) metrics are formulated to describe the problem. An evolutionary algorithm is then expressed in the light of its characteristic components to tackle the problem. The presentation will highlight the possible alternative that can be adopted in this study for individual representation, fitness evaluations, and crossover and mutation operators. The results point out that adopting as a fitness function carries out more correct solutions than adopting the modularity function . Moreover, the strength of mutation has a background role. When coupled with non elite selection, increasing mutation probability could results in better solutions. However, when elitism is used, increasing mutation probability could bewilder the behavior of EA.
In this paper we describe several different training algorithms for feed forward neural networks(FFNN). In all of these algorithms we use the gradient of the performance function, energy function, to determine how to adjust the weights such that the performance function is minimized, where the back propagation algorithm has been used to increase the speed of training. The above algorithms have a variety of different computation and thus different type of form of search direction and storage requirements, however non of the above algorithms has a global properties which suited to all problems.
Photoacoustic is a unique imaging method that combines the absorption contrast of light or radio frequency waves with ultrasound resolution. When the deposition of this energy is sufficiently short, a thermo-elastic expansion takes place whereby acoustic waves are generated. These waves can be recorded and stored to construct an image. This work presents experimental procedure of laser photoacoustic two dimensional imaging to detect tumor embedded within normal tissue. The experimental work is accomplished using phantoms that are sandwiched from fish heart or blood sac (simulating a tumor) 1-14mm mean diameter embedded within chicken breast to simulate a real tissue. Nd: YAG laser of 1.064μm and 532nm wavelengths, 10ns pulse duration, 4
... Show MoreProduction logging is used to diagnose well production problems by evaluating the flow profile, entries of unwanted fluids and downhole flow regimes. Evaluating wells production performance can be easily induce from production logs through interpretation of production log data to provide velocity profile and contribution of each zone on total production. Production logging results supply information for reservoir modeling, provide data to optimize the productivity of existing wells and plan drilling and completion strategies for future wells. Production logging was carried out in a production oil well from Mishrif formation of West Qurna field, with the objective to determine the flow profile and fluid contributions from the perforations af
... Show MoreA spectrophotometric study of Fe(III) mixed ligand complex has been
performed involving 1,4 phenylenediamine (A) and anthran i lic acid (B) ligand at 25°C and aconstant ionic strength of µ= 0.05M NaC I04• The optimum pH was found to be pH=4.l. The format ion rat io of the new complex is determined to be 2:1:4 of Fe(III):(A):(B). The molar absorptivity was determined to be :::::: 0.5 x I 04• Stepwise spectrum change of the complex formation is recorded by continuous flow system. Keywords: Mixed ligand
... Show MoreBackground: Bone marrow aspiration (BMA) and biopsy is a procedure that is used to evaluate the cause of abnormal blood test results, to confirm a diagnosis or check the status of severe anemia of unknown cause, to evaluate abnormalities in the blood's ability to store iron and also to diagnose infection.
Objectives: To identify the main indications of bone marrow aspiration and the most common diagnoses encountered in children welfare teaching hospital.
Patients and methods: This was a prospective and retrospective descriptive study over 6- month period from 8th of February 2010 to 8th of August 2010 in children younger than 14 years. All bone marrow aspirate results wer
... Show MoreThere are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com
... Show MoreIn this work, we find the terms of the complex of characteristic zero in the case of the skew-shape (8,6, 3)/(u,1), where u = 1 and 2. We also study this complex as a diagram by using the mapping Cone and other concepts.
Phytoplankton community is a model for of monitoring aquatic systems and interpreting the environmental change in aquatic systems. The present study aimed to forecast environmental parameters that drive the change of phytoplankton community structure in the lake. The present study was carried out in Baghdad Tourist Island Lake (BTIL) for the period From October 2021 to May 2022. The study included the quality and quantity of phytoplankton, moreover, the highest and lowest value of the physical and chemical parameters were (Water temperature (13-30 °C), Light penetration (94-275cm), electric conductivity (837-1128 µS/cm), salinity (0.5-0.7 ‰), pH (7-8.2), total alkalinity (126-226 mg CaCO3/L), total Hardness (297-395 mg CaCO3/L
... Show More