Abstract

The aim of this study was to prepare rebamipide ocular inserts in order to extend its release on the ocular surface for dry eye treatment. Solubility study was applied to the drug with or without l-arginine using different solvents. Solvent casting technique was used to prepare the inserts; l-arginine was used to solubilize the drug, hydroxypropyl methylcellulose grades (E5 and K15M) and poly ethylene glycol 200 were used as excipients. The inserts were evaluated for their physical and mechanical properties, moisture loss% and absorption %, surface pH, and in-vitro drug release. The use l-arginine exhibited an enhancement of rebamipide solubility in both deionized water and phosphate buffer (pH 7.4) by a

    Enjoy cinema privileged position , they have the ability to influence and the impact of including environs of prior art , and what distinguishes them , possessing motion picture , especially since the film possesses through its means technical ( camera , lighting, sound, editing , costume, scenery and makeup ) that work together in harmony and harmony to create enchanting fantasy world does not exist only in the imagination of corrupt officials . Out of imagination found that the art of make-up one of the means that enable it to create characters imagined located between simulate realistic characters (such manifestations of blood , cut leg, wounds , burns , etc. ..) and the figures are unrealistic , particularly in the

Chemical compounds, characteristics, and molecular structures are inevitably connected. Topological indices are numerical values connected with chemical molecular graphs that contribute to understanding a chemical compounds physical qualities, chemical reactivity, and biological activity. In this study, we have obtained some topological properties of the first dominating David derived (DDD) networks and computed several K-Banhatti polynomials of the first type of DDD.

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall