Research topic: (The Epistemological Foundations for Comparison of Religions by al-Amiri)

The research sought to study the topic with: a descriptive methodology by investigating the components of al-Amiri's approach to the interfaith comparison. And analytical, by showing the applied perception of an objective model in the comparison of religions to answer two questions: What are the cognitive foundations of al-Amiri? And what is his approach to establishing an objective comparison between religions?

The research started by introducing Abu al-Hassan al-Amiri, and then presented four topics: An introduction to al-Amiri's efforts in the interfaith comparison, his knowledge foundations, an applied model

The Boltzmann transport equation is solved by using two- terms approximation for pure gases and mixtures. This method of solution is used to calculate the electron energy distribution function and electric transport parameters were evaluated in the range of E/N varying from . 172152110./510.VcmENVcm
The electron energy distribution function of CF4 gas is nearly Maxwellian at (1,2)Td, and when E/N increase the distribution function is non Maxwellian. Also, the mixtures are have different energy values depending on transport energy between electron and molecule through the collisions. Behavior of electrons transport parameters is nearly from the experimental results in references. The drift velocity of electron in carbon tetraflouride i

Recently, a new secure steganography algorithm has been proposed, namely, the secure Block Permutation Image Steganography (BPIS) algorithm. The new algorithm consists of five main steps, these are: convert the secret message to a binary sequence, divide the binary sequence into blocks, permute each block using a key-based randomly generated permutation, concatenate the permuted blocks forming a permuted binary sequence, and then utilize a plane-based Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image file format. The performance of algorithm was given a preliminary evaluation through estimating the PSNR (Peak Signal-to-Noise Ratio) of the stego image for limited number of experiments comprised hiding

One of the most difficult issues in the history of communication technology is the transmission of secure images. On the internet, photos are used and shared by millions of individuals for both private and business reasons. Utilizing encryption methods to change the original image into an unintelligible or scrambled version is one way to achieve safe image transfer over the network. Cryptographic approaches based on chaotic logistic theory provide several new and promising options for developing secure Image encryption methods. The main aim of this paper is to build a secure system for encrypting gray and color images. The proposed system consists of two stages, the first stage is the encryption process, in which the keys are genera

In the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other

In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

Diarrhea is one of the most commonly encountered minor ailments in the community pharmacies. It is associated with significant morbidity and mortality. However, the majority of pharmacists in Iraq did not manage diarrheal cases in a proper way. Therefore, the current study aimed to evaluate the benefit of a new mobile application (diarrhea management step by step) to improve the pharmacist's role in the management of diarrhea. The study was conducted from 21th September to 21th October 2021 using a pre-post design via a simulated patient (SP) technique. A validated diarrhea scenario was presented to each pharmacist by the SP twice, once before and the other after giving the mobile application to the pharmacist. Furthermore, pharmaci