One of the most interested problems that recently attracts many research investigations in Protein-protein interactions (PPI) networks is complex detection problem. Detecting natural divisions in such complex networks is proved to be extremely NP-hard problem wherein, recently, the field of Evolutionary Algorithms (EAs) reveals positive results. The contribution of this work is to introduce a heuristic operator, called protein-complex attraction and repulsion, which is especially tailored for the complex detection problem and to enable the EA to improve its detection ability. The proposed heuristic operator is designed to fine-grain the structure of a complex by dividing it into two more complexes, each being distinguished with a core protein. Then, it is possible for each of the remaining proteins associated with the original coarse-grained complex to repulse from one of the new generated complexes while attracted by the core protein of the second complex. The topology-based complex detection models presented in the literature are adopted to inter-play with the proposed heuristic operator inside the EA general framework. To assess the performance of the EA when coupled with the proposed heuristic operator, the well known Saccaromycaes Cerevisiae yeast PPI network and one reference set of benchmark complexes created from MIPS are used in the experiments. The results prove the positive impact of the heuristic operator to harness the strength of almost all adopted EA models.
The aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).
(1)
There are large numbers of weakness in the generated keys of security algorithms. This paper includes a new algorithm to generate key of 5120 bits for a new proposed cryptography algorithm for 10 rounds that combine neural networks and chaos theory (1D logistic map). Two methods of neural networks (NN) are employed as Adaline and Hopfield and the results are combined through several sequential operation. Carefully integrating high quality random number generators from neural networks and chaos theory to obtain suitable key for randomness and complexity.
(18)
Determining the face of wearing a mask from not wearing a mask from visual data such as video and still, images have been a fascinating research topic in recent decades due to the spread of the Corona pandemic, which has changed the features of the entire world and forced people to wear a mask as a way to prevent the pandemic that has calmed the entire world, and it has played an important role. Intelligent development based on artificial intelligence and computers has a very important role in the issue of safety from the pandemic, as the Topic of face recognition and identifying people who wear the mask or not in the introduction and deep education was the most prominent in this topic. Using deep learning techniques and the YOLO (”You on
... Show More
(40)
(34)
One of the most important methodologies in operations research (OR) is the linear programming problem (LPP). Many real-world problems can be turned into linear programming models (LPM), making this model an essential tool for today's financial, hotel, and industrial applications, among others. Fuzzy linear programming (FLP) issues are important in fuzzy modeling because they can express uncertainty in the real world. There are several ways to tackle fuzzy linear programming problems now available. An efficient method for FLP has been proposed in this research to find the best answer. This method is simple in structure and is based on crisp linear programming. To solve the fuzzy linear programming problem (FLPP), a new ranking function (R
... Show More
(1)
(8)
(2)
The OpenStreetMap (OSM) project aims to establish a free geospatial database for the entire world which is editable by international volunteers. The OSM database contains a wide range of different types of geographical data and characteristics, including highways, buildings, and land use regions. The varying scientific backgrounds of the volunteers can affect the quality of the spatial data that is produced and shared on the internet as an OSM dataset. This study aims to compare the completeness and attribute accuracy of the OSM road networks with the data supplied by a digitizing process for areas in the Baghdad and Thi-Qar governorates. The analyses are primarily based on calculating the portion of the commission (extr
... Show More
The OpenStreetMap (OSM) project aims to establish a free geospatial database for the entire world which is editable by international volunteers. The OSM database contains a wide range of different types of geographical data and characteristics, including highways, buildings, and land use regions. The varying scientific backgrounds of the volunteers can affect the quality of the spatial data that is produced and shared on the internet as an OSM dataset. This study aims to compare the completeness and attribute accuracy of the OSM road networks with the data supplied by a digitizing process for areas in the Baghdad and Thi-Qar governorates. The analyses are primarily based on calculating the portion of the commission (extra road) and
... Show More
(5)
(4)