A steganography hides information within other information, such as file, message, picture, or video. A cryptography is the science of converting the information from a readable form to an unreadable form for unauthorized person. The main problem in the stenographic system is embedding in cover-data without providing information that would facilitate its removal. In this research, a method for embedding data into images is suggested which employs least significant bit Steganography (LSB) and ciphering (RSA algorithm) to protect the data. System security will be enhanced by this collaboration between steganography and cryptography.

This work bases on encouraging a generous and conceivable estimation for modified an algorithm for vehicle travel times on a highway from the eliminated traffic information using set aside camera image groupings. The strategy for the assessment of vehicle travel times relies upon the distinctive verification of traffic state. The particular vehicle velocities are gotten from acknowledged vehicle positions in two persistent images by working out the distance covered all through elapsed past time doing mollification between the removed traffic flow data and cultivating a plan to unequivocally predict vehicle travel times. Erbil road data base is used to recognize road locales around road segments which are projected into the commended camera

Background: Bilastine (BLA) is a second-generation H1 antihistamine used to treat allergic rhinoconjunctivitis. Because of its limited solubility, it falls under class II of the Biopharmaceutics Classification System (BSC). The solid dispersion (SD) approach significantly improves the solubility and dissolution rate of insoluble medicines. Objective: To improve BLA solubility and dissolution rate by formulating a solid dispersion in the form of effervescent granules. Methods: To create BLA SDs, polyvinylpyrrolidone (PVP K30) and poloxamer 188 (PLX188) were mixed in various ratios (1:5, 1:10, and 1:15) using the kneading technique. All formulations were evaluated based on percent yield, drug content, and saturation solubility. The fo

Stripping is one of the major distresses within asphalt concrete pavements caused due to penetration of water within the interface of asphalt-aggregate matrix. In this work, one grade of asphalt cement (40-50) was mixed with variable percentages of three types of additives (fly ash, fumed silica, and phosphogypsum) to obtained an modified asphalt cement to resist the effect of stripping phenomena .The specimens have been tested for physical properties according to AASHTO. The surface free energy has been measured by using two methods namely, the wilhelmy technique and the Sessile drop method according to NCHRP-104
procedures. Samples of asphalt concrete using different asphalt cement and modified asphalt cement percentages(4.1,4.6 an

In this work, we study several features of the non-zero divisor graphs (ℵZD- graph) for the ring Zn of integer modulo n. For instance, the clique number, radius, girth, domination number, and the local clustering coefficient are determined. Furthermore, we present an algorithm that calculates the clique number and draws the non-zero divisor for the ring Zn.

The aim of present study was to develop gel formulation of microsponges of poorly soluble drug meloxicam (MLX) in order to enhance the release and dissolution of MLX which is the limitation for preparation in topical forms. Also skin delivery is an alternative administration for MLX that can minimize gastrointestinal (GI) side effects and improve patient compliance. The microsponges of MLX were prepared by quasi-emulsion solvent diffusion method.  The effects of drug:polymer ratio, stirring time and Eudragit polymer type on the physical characteristics of microsponges were investigated and characterized for production yield, loading efficiency, particle size, surface morphology, and in vitro drug release from microsponges. The selec

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