Solar collectors, in general, are utilized to convert the solar energy into heat energy, where it is employed to generate electricity. The non-concentrating solar collector with a circular shape was adopted in the present study. Ambient air is heated under a translucent roof where buoyant air is drawn from outside periphery towards the collector center (tower base). The present study is aimed to predict and visualize the thermal-hydrodynamic behavior for airflow under inclined roof of the solar air collector, SAC. Three-dimensional of the SAC model using the re-normalization group, RNG, k−ε turbulence viscus model is simulated. The simulation was carried out by using ANSYS-FLUENT 14.5. The simulation

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

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