The objective of the study to develop an amorphous solid dispersion for poorly soluble raltegravir by hot melt extrusion (HME) technique. A novel solubility improving agent plasdone  s630 was utilized. The HME raltegravir was formulated into tablet by direct compression method. The prepared tablets were assessed for all pre and post-compression parameters. The drug- excipients interaction was examined by FTIR and DSC. All formulas displayed complying with pharmacopoeial measures. The study reveals that formula prepared by utilizing drug and plasdone S630 at 1:1.5 proportion and span 20 at concentration about 30mg (trail-6) has given highest dissolution rate than contrasted with various formulas of raltegravir.

Keywor

This study aims to develop a recommendation engine methodology to enhance the model’s effectiveness and efficiency. The proposed model is commonly used to assign or propose a limited number of developers with the required skills and expertise to address and resolve a bug report. Managing collections within bug repositories is the responsibility of software engineers in addressing specific defects. Identifying the optimal allocation of personnel to activities is challenging when dealing with software defects, which necessitates a substantial workforce of developers. Analyzing new scientific methodologies to enhance comprehension of the results is the purpose of this analysis. Additionally, developer priorities were discussed, especially th

Isradipine belong to dihydropyridine (DHP) class of calcium channel blockers (CCBs). It is  used in the treatment of hypertension, angina pectoris, in addition to Parkinson disease. It goes under the BCS class II drug (low solubility-high permeability). The drug will experience extensive first-pass metabolism in liver, therefore, oral bio-availability will be approximately15 to 24 %.

 The aim of this study was to formulate and optimize a stable  nanoparticles of a highly hydrophobic drug, isradipine by anti-solvent microprecipitation Method to achieve the higher in vitro dissolution rate, so that it will be absorbed by intestinal lymphatic transport in order to avoid hepatic first-pass metabolism&nbs

Convergence prop erties of Jackson polynomials have been considered by Zugmund
[1,ch.X] in (1959) and J.Szbados [2], (p =ï‚¥) while in (1983) V.A.Popov and J.Szabados [3]
(1 ï‚£p ï‚£ ï‚¥) have proved a direct inequality for Jackson polynomials in L
p-sp ace of 2-periodic bounded Riemann integrable functions (f R) in terms of some modulus of
continuity .
In 1991 S.K.Jassim proved direct and inverse inequality for Jackson polynomials in
locally global norms (L
,p) of 2-p eriodic bounded measurable functions (f L) in terms of
suitable Peetre K-functional [4].
Now the aim of our paper is to proved direct and inverse inequalities for Jackson
polynomials

Steganography is an important class of security which is widely used in computer and network security nowadays. In this research, a new proposed algorithm was introduced with a new concept of dealing with steganography as an algorithmic secret key technique similar to stream cipher cryptographic system. The proposed algorithm is a secret key system suggested to be used in communications for messages transmission steganography

Compressing an image and reconstructing it without degrading its original quality is one of the challenges that still exist now a day. A coding system that considers both quality and compression rate is implemented in this work. The implemented system applies a high synthetic entropy coding schema to store the compressed image at the smallest size as possible without affecting its original quality. This coding schema is applied with two transform-based techniques, one with Discrete Cosine Transform and the other with Discrete Wavelet Transform. The implemented system was tested with different standard color images and the obtained results with different evaluation metrics have been shown. A comparison was made with some previous rel

Most heuristic search method's performances are dependent on parameter choices. These parameter settings govern how new candidate solutions are generated and then applied by the algorithm. They essentially play a key role in determining the quality of the solution obtained and the efficiency of the search. Their fine-tuning techniques are still an on-going research area. Differential Evolution (DE) algorithm is a very powerful optimization method and has become popular in many fields. Based on the prolonged research work on DE, it is now arguably one of the most outstanding stochastic optimization algorithms for real-parameter optimization. One reason for its popularity is its widely appreciated property of having only a small number of par

The Internet is providing vital communications between millions of individuals. It is also more and more utilized as one of the commerce tools; thus, security is of high importance for securing communications and protecting vital information. Cryptography algorithms are essential in the field of security. Brute force attacks are the major Data Encryption Standard attacks. This is the main reason that warranted the need to use the improved structure of the Data Encryption Standard algorithm. This paper proposes a new, improved structure for Data Encryption Standard to make it secure and immune to attacks. The improved structure of Data Encryption Standard was accomplished using standard Data Encryption Standard with a new way of two key gene