An experiment was carried out to study the effects of Time Factor, potassium and Molybdenum on Rhizobium growth. The objective of the experiment, which conducted under laboratory conditions, was to investigate the interaction effects of using three levels of Molybdenum (0, 0.25, 2.50 mg Mo . Kg-1 sterile soil) and four levels of potassium (0, 25, 50, 100 mg K . Kg-1 sterile soil) on the viable counts of Rhizobium growth in the sterile soil after 3, 9, 15 and 21 days of incubation at 28°C. The results indicated that Molybdenum level 2.50 mg Mo . Kg-1 sterile soil and potassium level 50 mg K . Kg-1 sterile soil recorded the biggest significant increase in the viable counts of Rhizobium growth in the sterile soil especially after 15 da

Background: Both bladder cancer and schistosomiasis are endemic in Egypt. The former has a unique epidemiological pattern, which has been linked to bladder infestation by Schistosoma. The last decades have witnessed a great reduction in the infection rate of schistosomiasis and a decline in the incidence and changes in the patterns of bladder cancer. Whether these changes are linked to each other or a co-incidence is a subject of investigations.

Method: Literature on epidemiological data of bladder cancer and Schistosoma in Egypt was searched for in Medline, Scopus, PubMed, and Google Scholar. Furthermore, a hand search for literature and reports released by the Egyptian government and involved agencies was perfo

Cryptography is the process of transforming message to avoid an unauthorized access of data. One of the main problems and an important part in cryptography with secret key algorithms is key. For higher level of secure communication key plays an important role. For increasing the level of security in any communication, both parties must have a copy of the secret key which, unfortunately, is not that easy to achieve. Triple Data Encryption Standard algorithm is weak due to its weak key generation, so that key must be reconfigured to make this algorithm more secure, effective, and strong. Encryption key enhances the Triple Data Encryption Standard algorithm securities. This paper proposed a combination of two efficient encryption algorithms to

Anomaly detection is still a difficult task. To address this problem, we propose to strengthen DBSCAN algorithm for the data by converting all data to the graph concept frame (CFG). As is well known that the work DBSCAN method used to compile the data set belong to the same species in a while it will be considered in the external behavior of the cluster as a noise or anomalies. It can detect anomalies by DBSCAN algorithm can detect abnormal points that are far from certain set threshold (extremism). However, the abnormalities are not those cases, abnormal and unusual or far from a specific group, There is a type of data that is do not happen repeatedly, but are considered abnormal for the group of known. The analysis showed DBSCAN using the

In this research, the problem of ambiguity of the data for the project of establishing the typical reform complex in Basrah Governorate was eliminated. The blurry of the data represented by the time and cost of the activities was eliminated by using the Ranking function and converting them into normal numbers. Scheduling and managing the Project in the Critical Pathway (CPM) method to find the project completion time in normal conditions in the presence of non-traditional relationships between the activities and the existence of the lead and lag periods. The MS Project was used to find the critical path. The results showed that the project completion time (1309.5) dinars and the total cost has reached (33113017769) dinars and the

A new modified differential evolution algorithm DE-BEA, is proposed to improve the reliability of the standard DE/current-to-rand/1/bin by implementing a new mutation scheme inspired by the bacterial evolutionary algorithm (BEA). The crossover and the selection schemes of the DE method are also modified to fit the new DE-BEA mechanism. The new scheme diversifies the population by applying to all the individuals a segment based scheme that generates multiple copies (clones) from each individual one-by-one and applies the BEA segment-wise mechanism. These new steps are embedded in the DE/current-to-rand/bin scheme. The performance of the new algorithm has been compared with several DE variants over eighteen benchmark functions including sever