In this paper, a compact genetic algorithm (CGA) is enhanced by integrating its selection strategy with a steepest descent algorithm (SDA) as a local search method to give I-CGA-SDA. This system is an attempt to avoid the large CPU time and computational complexity of the standard genetic algorithm. Here, CGA dramatically reduces the number of bits required to store the population and has a faster convergence. Consequently, this integrated system is used to optimize the maximum likelihood function lnL(φ1, θ1) of the mixed model. Simulation results based on MSE were compared with those obtained from the SDA and showed that the hybrid genetic algorithm (HGA) and I-CGA-SDA can give a good estimator of (φ1, θ1) for the ARMA(1,1) model. Anot

Isolation of fungi was performed from February to July, 2019. One hundred clinical specimens were collected from King Abdullah Hospital (KAH) Bisha, Saudi Arabia. Samples were collected from twenty patients of different ages (30 - 70 years old) ten males and ten females. The samples were collected from patients with the two types of diabetics. Specimens included blood, hair, nail, oral swabs and skin.  Specimens were inoculated on Sabourauds Dextrose agar containing chloramphenicol. Thirteen fungal species were isolated and identified. The isolated species were: Aspergillus flavus, A. niger, A. terrus, A. nidulans, A. fumigatus, Candida albicans, C. krusei, C. parapsilosis, C. Tropicalis, Curvularia lunata, Fusarium solani, Penicill

            In this work, the adsorption of crystal violet dye from aqueous solution on charcoal and rice husk has been investigated, where the impact of variable factors (contact time; the dosage of adsorbent, pH, temperature, and ionic strength) have been studied. It has been found that charcoal and rice husk have an appropriate adsorption limit with regards to the expulsion of crystal violet dye from fluid arrangements. The harmony adsorption is for all intents and purposes accomplished in 45 min for charcoal and 60 min for rice husk. The amount of crystal violet dye adsorbed (0.4 g of charcoal and 0.5 g of rice husk) increased with an increasing pH and the value of 11 is the best

Software testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing

Tchebichef polynomials (TPs) play a crucial role in various fields of mathematics and applied sciences, including numerical analysis, image and signal processing, and computer vision. This is due to the unique properties of the TPs and their remarkable performance. Nowadays, the demand for high-quality images (2D signals) is increasing and is expected to continue growing. The processing of these signals requires the generation of accurate and fast polynomials. The existing algorithms generate the TPs sequentially, and this is considered as computationally costly for high-order and larger-sized polynomials. To this end, we present a new efficient solution to overcome the limitation of sequential algorithms. The presented algorithm us

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f