Wireless Sensor Networks (WSNs) are promoting the spread of the Internet for devices in all areas of
life, which makes it is a promising technology in the future. In the coming days, as attack technologies become
more improved, security will have an important role in WSN. Currently, quantum computers pose a significant
risk to current encryption technologies that work in tandem with intrusion detection systems because it is
difficult to implement quantum properties on sensors due to the resource limitations. In this paper, quantum
computing is used to develop a future-proof, robust, lightweight and resource-conscious approach to sensor
networks. Great emphasis is placed on the concepts of using the BB8

In this study, a fast block matching search algorithm based on blocks' descriptors and multilevel blocks filtering is introduced. The used descriptors are the mean and a set of centralized low order moments. Hierarchal filtering and MAE similarity measure were adopted to nominate the best similar blocks lay within the pool of neighbor blocks. As next step to blocks nomination the similarity of the mean and moments is used to classify the nominated blocks and put them in one of three sub-pools, each one represents certain nomination priority level (i.e., most, less & least level). The main reason of the introducing nomination and classification steps is a significant reduction in the number of matching instances of the pixels belong to the c

To maintain the security and integrity of data, with the growth of the Internet and the increasing prevalence of transmission channels, it is necessary to strengthen security and develop several algorithms. The substitution scheme is the Playfair cipher. The traditional Playfair scheme uses a small 5*5 matrix containing only uppercase letters, making it vulnerable to hackers and cryptanalysis. In this study, a new encryption and decryption approach is proposed to enhance the resistance of the Playfair cipher. For this purpose, the development of symmetric cryptography based on shared secrets is desired. The proposed Playfair method uses a 5*5 keyword matrix for English and a 6*6 keyword matrix for Arabic to encrypt the alphabets of

There are several oil reservoirs that had severe from a sudden or gradual decline in their production due to asphaltene precipitation inside these reservoirs. Asphaltene deposition inside oil reservoirs causes damage for permeability and skin factor, wettability alteration of a reservoir, greater drawdown pressure. These adverse changing lead to flow rate reduction, so the economic profit will drop. The aim of this study is using local solvents: reformate, heavy-naphtha and binary of them for dissolving precipitated asphaltene inside the oil reservoir. Three samples of the sand pack had been prepared and mixed with a certain amount of asphaltene. Permeability of these samples calculated before and after mixed with asphaltenes. Then, the

In this paper, we designed a new efficient stream cipher cryptosystem that depend on a chaotic map to encrypt (decrypt) different types of digital images. The designed encryption system passed all basic efficiency criteria (like Randomness, MSE, PSNR, Histogram Analysis, and Key Space) that were applied to the key extracted from the random generator as well as to the digital images after completing the encryption process.

Among the different passive techniques heat pipe heat exchanger (HPHE) seems to be the most effective one for energy saving in heating ventilation and air conditioning system (HVAC). The applications for nanofluids with high conductivity are favorable to increase the thermal performance in HPHE. Even though the nanofluid has the higher heat conduction coefficient that dispels more heat theoretically but the higher concentration will make clustering .Clustering is a problem that must be solved before nanofluids can be considered for long-term practical uses. Results showed that the maximum value of relative power is 0.13 mW at nanofluid compared with other concentrations due to the low density of nanofluid at this concentration. For highe

A new algorithm is proposed to compress speech signals using wavelet transform and linear predictive coding. Signal compression based on the concept of selecting a small number of approximation coefficients after they are compressed by the wavelet decomposition (Haar and db4) at a suitable chosen level and ignored details coefficients, and then approximation coefficients are windowed by a rectangular window and fed to the linear predictor. Levinson Durbin algorithm is used to compute LP coefficients, reflection coefficients and predictor error. The compress files contain LP coefficients and previous sample. These files are very small in size compared to the size of the original signals. Compression ratio is calculated from the size of th