Nebivolol (NBH) is a third-generation B1-blocker with high selectivity and vasodilation activity. Nevertheless, nebivolol exhibits low oral bioavailability, which may adversely affect its efficacy. Recently, supersaturable self-nanoemulsion (Su-SNE) is an advanced SNE approach that can address low bioavailability The study aims to prepare nebivolol-loaded Su-SNE by reduction the amount of the prepared conventional SNE to half. Besides, an appropriate polymer type and concentration to prevent NBH precipitation upon oral administration have investigated.. A conventional self-nanoemulsion (formula A) was prepared by dissolving NBH in 500 mg vehicle mixture of imwitor®988: cremophor-EL: propylene glycol. Then, eight Su-SNE formulas wit

Nebivolol (NBH) is a third-generation B1-blocker with high selectivity and vasodilation activity. Nevertheless, nebivolol exhibits low oral bioavailability, which may adversely affect its efficacy. Recently, supersaturable self-nanoemulsion (Su-SNE) is an advanced SNE approach that can address low bioavailability The study aims to prepare nebivolol-loaded Su-SNE by reduction the amount of the prepared conventional SNE to half. Besides, an appropriate polymer type and concentration to prevent NBH precipitation upon oral administration have investigated.. A conventional self-nanoemulsion (formula A) was prepared by dissolving NBH in 500 mg vehicle mixture of imwitor^®988: cremophor-EL: propylene glycol. Then, eight Su-SNE formul

In this research a new system identification algorithm is presented for obtaining an optimal set of mathematical models for system with perturbed coefficients, then this algorithm is applied practically by an “On Line System Identification Circuit”, based on real time speed response data of a permanent magnet DC motor. Such set of mathematical models represents the physical plant against all variation which may exist in its parameters, and forms a strong mathematical foundation for stability and performance analysis in control theory problems.

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t

Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh

An Optimal Algorithm for HTML Page Building Process

          A novel median filter based on crow optimization algorithms (OMF) is suggested to reduce the random salt and pepper noise and improve the quality of the RGB-colored and gray images. The fundamental idea of the approach is that first, the crow optimization algorithm detects noise pixels, and that replacing them with an optimum median value depending on a criterion of maximization fitness function. Finally, the standard measure peak signal-to-noise ratio (PSNR), Structural Similarity, absolute square error and mean square error have been used to test the performance of suggested filters (original and improved median filter) used to removed noise from images. It achieves the simulation based on MATLAB R2019b and the resul

For several applications, it is very important to have an edge detection technique matching human visual contour perception and less sensitive to noise. The edge detection algorithm describes in this paper based on the results obtained by Maximum a posteriori (MAP) and Maximum Entropy (ME) deblurring algorithms. The technique makes a trade-off between sharpening and smoothing the noisy image. One of the advantages of the described algorithm is less sensitive to noise than that given by Marr and Geuen techniques that considered to be the best edge detection algorithms in terms of matching human visual contour perception.