Data compression offers an attractive approach to reducing communication costs using available bandwidth effectively. It makes sense to pursue research on developing algorithms that can most effectively use available network. It is also important to consider the security aspect of the data being transmitted is vulnerable to attacks. The basic aim of this work is to develop a module for combining the operation of compression and encryption on the same set of data to perform these two operations simultaneously. This is achieved through embedding encryption into compression algorithms since both cryptographic ciphers and entropy coders bear certain resemblance in the sense of secrecy. First in the secure compression module, the given text is p

Mobile ad hoc network security is a new area for research that it has been faced many difficulties to implement. These difficulties are due to the absence of central authentication server, the dynamically movement of the nodes (mobility), limited capacity of the wireless medium and the various types of vulnerability attacks. All these factor combine to make mobile ad hoc a great challenge to the researcher. Mobile ad hoc has been used in different applications networks range from military operations and emergency disaster relief to community networking and interaction among meeting attendees or students during a lecture. In these and other ad hoc networking applications, security in the routing protocol is necessary to protect against malic

In data transmission a change in single bit in the received data may lead to miss understanding or a disaster. Each bit in the sent information has high priority especially with information such as the address of the receiver. The importance of error detection with each single change is a key issue in data transmission field.
The ordinary single parity detection method can detect odd number of errors efficiently, but fails with even number of errors. Other detection methods such as two-dimensional and checksum showed better results and failed to cope with the increasing number of errors.
Two novel methods were suggested to detect the binary bit change errors when transmitting data in a noisy media.Those methods were: 2D-Checksum me

This research investigates the methods of producing Investigative Arabic Television Programs that are able to prove its existence during a short period of time as a form of Television programs on Arab satellite channels growing in number and varied in content. The research aims to present qualitative and quantitative descriptions of the methods used in tackling the topics discussed in the program, and knowing whether they satisfy the conditions and scientific foundations for the research, investigation, analysis, and interpretation. The researcher uses the survey method and uses the tool of content analysis including a set of methodological steps that seek to discover the implied meaning of the research sample represented by the program

This research aims to assess the adoption of TQM in the Middle East Bank for Investment, and diagnosis means and techniques of technological innovation that applied in, as well as to determine the nature of the relationship between total quality management practices (operations management, employment relations, customer relations) and technological innovation (the incremental innovation  of the service, incremental innovation process, a radical innovation of the service, a radical innovation of the operation), through use  the checklists, derived from a study (Kim et al, 2012) the many styles of mathematical and statistical tools was adopted like the percentage, mean, duplicates, as well as the adoption of the Z test th

The influx of data in bioinformatics is primarily in the form of DNA, RNA, and protein sequences. This condition places a significant burden on scientists and computers. Some genomics studies depend on clustering techniques to group similarly expressed genes into one cluster. Clustering is a type of unsupervised learning that can be used to divide unknown cluster data into clusters. The k-means and fuzzy c-means (FCM) algorithms are examples of algorithms that can be used for clustering. Consequently, clustering is a common approach that divides an input space into several homogeneous zones; it can be achieved using a variety of algorithms. This study used three models to cluster a brain tumor dataset. The first model uses FCM, whic

The effect of using three different interpolation methods (nearest neighbour, linear and non-linear) on a 3D sinogram to restore the missing data due to using angular difference greater than 1° (considered as optimum 3D sinogram) is presented. Two reconstruction methods are adopted in this study, the back-projection method and Fourier slice theorem method, from the results the second reconstruction proven to be a promising reconstruction with the linear interpolation method when the angular difference is less than 20°.

     The searching process using a binary codebook of combined Block Truncation Coding (BTC) method and Vector Quantization (VQ), i.e. a full codebook search for each input image vector to find the best matched code word in the codebook, requires a long time.   Therefore, in this paper, after designing a small binary codebook, we adopted a new method by rotating each binary code word in this codebook into 900 to 2700 step 900 directions. Then, we systematized each code word depending on its angle  to involve four types of binary code books (i.e. Pour when , Flat when  , Vertical when, or Zigzag). The proposed scheme was used for decreasing the time of the coding procedure, with very small distortion per block, by designing s

We propose a system to detect human faces in color images type BMP by using two methods RGB and YCbCr to determine which is the best one to be used, also determine the effect of applying Low pass filter, Contrast and Brightness on the image. In face detection we try to find the forehead from the binary image by scanning of the image that starts in the middle of the image then precedes by finding the continuous white pixel after continuous black pixel and the maximum width of the white pixel by scanning left and right vertically(sampled w) if the new width is half the previous one the scanning stops.

Variable selection is an essential and necessary task in the statistical modeling field. Several studies have triedto develop and standardize the process of variable selection, but it isdifficultto do so. The first question a researcher needs to ask himself/herself what are the most significant variables that should be used to describe a given dataset’s response. In thispaper, a new method for variable selection using Gibbs sampler techniqueshas beendeveloped.First, the model is defined, and the posterior distributions for all the parameters are derived.The new variable selection methodis tested usingfour simulation datasets. The new approachiscompared with some existingtechniques: Ordinary Least Squared (OLS), Least Absolute Shrinkage