In this paper, we will present proposed enhance process of image compression by using RLE algorithm. This proposed yield to decrease the size of compressing image, but the original method used primarily for compressing a binary images [1].Which will yield increasing the size of an original image mostly when used for color images. The test of an enhanced algorithm is performed on sample consists of ten BMP 24-bit true color images, building an application by using visual basic 6.0 to show the size after and before compression process and computing the compression ratio for RLE and for the enhanced RLE algorithm.

Fractal image compression gives some desirable properties like fast decoding image, and very good rate-distortion curves, but suffers from a high encoding time. In fractal image compression a partitioning of the image into ranges is required. In this work, we introduced good partitioning process by means of merge approach, since some ranges are connected to the others. This paper presents a method to reduce the encoding time of this technique by reducing the number of range blocks based on the computing the statistical measures between them . Experimental results on standard images show that the proposed method yields minimize (decrease) the encoding time and remain the quality results passable visually.

Abstract\

In this research, estimated the reliability of water system network in Baghdad was done. to assess its performance during a specific period. a fault tree through static and dynamic gates was belt and these gates represent logical relationships between the main events in the network and analyzed using dynamic Bayesian networks . As it has been applied Dynamic Bayesian networks estimate reliability by translating dynamic fault tree to Dynamic Bayesian networks and reliability of the system appreciated. As was the potential for the expense of each phase of the network for each gate . Because there are two parts to the Dynamic Bayesian networks and two part of gate (AND), which includes the three basic units of the

Internet of Things (IoT) is one of the newest matters in both industry and academia of the communication engineering world. On the other hand, wireless mesh networks, a network topology that has been debate for decades that haven’t been put into use in great scale, can make a transformation when it arises to the network in the IoT world nowadays. A Mesh IoT network is a local network architecture in which linked devices cooperate and route data using a specified protocol. Typically, IoT devices exchange sensor data by connecting to an IoT gateway. However, there are certain limitations if it involves to large number of sensors and the data that should be received is difficult to analyze. The aim of the work here is to implement a self-

Simulation  of  the  Linguistic  Fuzzy Trust  Model  (LFTM)  over  oscillating  Wireless  Sensor Networks (WSNs) where the goodness of the servers belonging to them could change along the time is presented in this paper, and the comparison between the outcomes achieved with LFTM model over oscillating WSNs with the outcomes obtained by applying the model over static WSNs where the servers maintaining always the same goodness, in terms of the selection percentage of trustworthy servers (the accuracy of the model) and the average path length are also presented here. Also in this paper the comparison between the LFTM and the Bio-inspired Trust and Reputation Model for Wireless Sensor Network

Background Cold atmospheric plasma (CAP) is widely used in the cancer therapy field. This type of plasma is very close to room temperature. This paper illustrates the effects of CAP on breast cancer tissues both in vivo and in vitro. Methods The mouse mammary adenocarcinoma cell line AN3 was used for the in vivo study, and the MCF7, AMJ13, AMN3, and HBL cell lines were used for the in vitro study. A floating electrode-dielectric barrier discharge (FE-DBD) system was used. The cold plasma produced by the device was tested against breast cancer cells. Results The induced cytotoxicity percentages were 61.7%, 68% and 58.07% for the MCF7, AMN3, and AMJ13 cell lines, respectively, whereas the normal breast tissue HBL cell line exhibited very li

Homomorphic encryption became popular and powerful cryptographic primitive for various cloud computing applications. In the recent decades several developments has been made. Few schemes based on coding theory have been proposed but none of them support unlimited operations with security.   We propose a modified Reed-Muller Code based symmetric key fully homomorphic encryption to improve its security by using message expansion technique. Message expansion with prepended random fixed length string provides one-to-many mapping between message and codeword, thus one-to many mapping between plaintext and ciphertext. The proposed scheme supports both (MOD 2) additive and multiplication operations unlimitedly.   We make an effort to prove

In the latest years there has been a profound evolution in computer science and technology, which incorporated several fields. Under this evolution, Content Base Image Retrieval (CBIR) is among the image processing field. There are several image retrieval methods that can easily extract feature as a result of the image retrieval methods’ progresses. To the researchers, finding resourceful image retrieval devices has therefore become an extensive area of concern. Image retrieval technique refers to a system used to search and retrieve images from digital images’ huge database. In this paper, the author focuses on recommendation of a fresh method for retrieving image. For multi presentation of image in Convolutional Neural Network (CNN),

In this work, a joint quadrature for numerical solution of the double integral is presented. This method is based on combining two rules of the same precision level to form a higher level of precision. Numerical results of the present method with a lower level of precision are presented and compared with those performed by the existing high-precision Gauss-Legendre five-point rule in two variables, which has the same functional evaluation. The efficiency of the proposed method is justified with numerical examples. From an application point of view, the determination of the center of gravity is a special consideration for the present scheme. Convergence analysis is demonstrated to validate the current method.

A new modified differential evolution algorithm DE-BEA, is proposed to improve the reliability of the standard DE/current-to-rand/1/bin by implementing a new mutation scheme inspired by the bacterial evolutionary algorithm (BEA). The crossover and the selection schemes of the DE method are also modified to fit the new DE-BEA mechanism. The new scheme diversifies the population by applying to all the individuals a segment based scheme that generates multiple copies (clones) from each individual one-by-one and applies the BEA segment-wise mechanism. These new steps are embedded in the DE/current-to-rand/bin scheme. The performance of the new algorithm has been compared with several DE variants over eighteen benchmark functions including sever