This work is concerned with the design and performance evaluation of a shell and double concentric tubes heat exchanger using Solid Works and ANSY (Computational Fluid Dynamics).

Computational fluid dynamics technique which is a computer-based analysis is used to simulate the heat exchanger involving fluid flow, heat transfer. CFD resolve the entire heat exchanger in discrete elements to find: (1) the temperature gradients, (2) pressure distribution, and (3) velocity vectors.  The RNG k-ε model of turbulence is used to determining the accurate results from CFD.

The heat exchanger design for this work consisted of a shell and eight double concentric tubes. The number of inlets are three and that of o

The Non-Photorealistic Rendering (NPR) demands are increased with the development of electronic devices. This paper presents a new model for a cartooning system, as an essential category of the NPR. It is used the concept of vector quantization and Logarithmic Image Processing (LIP). An enhancement of Kekre Median Codebook Generation (KMCG) algorithm has been proposed and used by the system. Several metrics utilized to evaluate the time and quality of the system. The results showed that the proposed system reduced the time of cartoon production. Additionally, it enhanced the quality of several aspects like smoothing, color reduction, and brightness.

   Hiding secret information in the image is a challenging and painstaking task in computer security and steganography system. Certainly, the absolute intricacy of attacks to security system makes it more attractive.in this research on steganography system involving information hiding,Huffman codding used to compress the secret code before embedding which provide high capacity and some security. Fibonacci decomposition used to represent the pixels in the cover image, which increase the robustness of the system. One byte used for mapping all the pixels properties. This makes the PSNR of the system higher due to random distribution of embedded bits. Finally, three kinds of evaluation are applied such as PSNR, chi-square attack, a

Pattern matching algorithms are usually used as detecting process in intrusion detection system. The efficiency of these algorithms is affected by the performance of the intrusion detection system which reflects the requirement of a new investigation in this field. Four matching algorithms and a combined of two algorithms, for intrusion detection system based on new DNA encoding, are applied for evaluation of their achievements. These algorithms are Brute-force algorithm, Boyer-Moore algorithm, Horspool algorithm, Knuth-Morris-Pratt algorithm, and the combined of Boyer-Moore algorithm and Knuth–Morris– Pratt algorithm. The performance of the proposed approach is calculated based on the executed time, where these algorithms are applied o

Intrusion detection systems detect attacks inside computers and networks, where the detection of the attacks must be in fast time and high rate. Various methods proposed achieved high detection rate, this was done either by improving the algorithm or hybridizing with another algorithm. However, they are suffering from the time, especially after the improvement of the algorithm and dealing with large traffic data. On the other hand, past researches have been successfully applied to the DNA sequences detection approaches for intrusion detection system; the achieved detection rate results were very low, on other hand, the processing time was fast. Also, feature selection used to reduce the computation and complexity lead to speed up the system

In this paper a Г-ring M is presented. We will study the concept of orthogonal generalized symmetric higher bi-derivations on Г-ring. We prove that if M is a 2-torsion free semiprime    Г-ring ,  and  are orthogonal generalized symmetric higher bi-derivations  associated with symmetric higher bi-derivations   respectively for all n ϵN.

     This paper presents a new RGB image encryption scheme using multi chaotic maps. Encrypting an image is performed via chaotic maps to confirm the properties of secure cipher namely confusion and diffusion are satisfied. Also, the key sequence for encrypting an image is generated using a combination of   1D logistic and Sine chaotic maps. Experimental results and the compassion results indicate that the suggested scheme provides high security against several types of attack, large secret keyspace and highly sensitive.   

In this research, a new technique is suggested to reduce the long time required by the encoding process by using modified moment features on domain blocks. The modified moment features were used in accelerating the matching step of the Iterated Function System (IFS). The main disadvantage facing the fractal image compression (FIC) method is the over-long encoding time needed for checking all domain blocks and choosing the least error to get the best matched domain for each block of ranges. In this paper, we develop a method that can reduce the encoding time of FIC by reducing the size of the domain pool based on the moment features of domain blocks, followed by a comparison with threshold (the selected  threshold based on experience

Piled raft is commonly used as foundation for high rise buildings. The design concept of piled raft foundation is to minimize the number of piles, and to utilize the entire bearing capacity. High axial stresses are therefore, concentrated at the region of connection between the piles and raft. Recently, an alternative technique is proposed to disconnect the piles from the raft in a so called unconnected piled raft (UCPR) foundation, in which a compacted soil layer (cushion) beneath the raft, is usually introduced.  The piles of the new system are considered as reinforcement members for the subsoil rather than as structural members. In the current study, the behavior of unconnected piled rafts systems has been studie

The concept of strong soft  pre-open set was initiated by Biswas and Parsanann.We utilize this notion to study several characterizations and properties of this set. We investigate the relationships between this set and other types of soft open sets. Moreover, the properties of the strong soft  pre-interior and closure are discussed. Furthermore, we define a new concept by using strong soft  pre-closed that we denote as locally strong soft  pre-closed, in which several results are obtained. We establish a new type of soft pre-open set, namely soft  pre-open. Also, we continue to study pre-  soft open set and discuss the relationships among all these sets. Some counter examples are given to show some relations