Search

In this paper, two models are presented for Multiprocessor Stochastic Systems (MSS). The first one is the Generalized Semi-Markov Process (GSMP), the second is the Generalized Stochastic Petri Net (GSPN). These models are used to study performance arbitrary parameters of (MSS). Our main result is by constructing an isomorphism mapping between (MSS) model and (GSPN) model. This isomorphism captures the essential dynamical structure of (MSS).

Virtual LANs (VLANs) are introduced as some alternative switches to solve for the traffic problems of those LAN networks with Hubs. The idea is to create some collections in the whole LAN network, such collections are the so called VLANs. Appropriate switches (one switch or more of up to 24 ports) are designed to interconnect those VLANs. The design of such VLAN switches looks like the design of Look-Up tables to facilitate routing (similar to those used in CISCO networks). In this paper, an analytical model for such VLANs is proposed and then compared with single VLAN switch from the point of view of validity and speed characteristics.

This paper compares between two models: Common Genetic algorithm and the new Clonal selection theory in the field of Intrusion Detection. Genetic algorithms (GA) which is a model of genetic evolution, while Clonal selection theory (CST) is from models of the natural immune system NIS, the two models are from two different fields of Artificial Intelligence AI but they have portion of shared operations and objectives. The comparison to be done by applying the two models on some records of Knowledge Discovery and Data mining tools which is known by the name KDD data sets (its records the data of the interring packets to the computer system from the internet), to produce population ( in case of GA) or antibodies (in case of CST) can recognize these abnormal records.

Morphological filtering is a useful technique for processing and analyzing binary and grayscale images. These filters are effective in impulsive noise filtering, feature extracting, and images enhancing. So it is important to find out method for applying morphological technique on color image and keep the colors unchanged at the same time. This paper deals with the use of morphological filters for suppression "salt & pepper" noise in color images. We have used "component-wise approach", in which grayscale morphological operations are applied to each of the three colors image components independently. We present experimental results of applying this approach for the application of noise suppression in color images.

Detecting circles is very important in the application of image processing especially in determining the object locations. In this paper, a new algorithm is proposed for circle detection, called Point Search Circle Detection (PSCD), which detects points and assumes them as inspection points on the circle circumference by using them to create a virtual circle to match it with the original image. Using matching operation leads to reduce computational operations and reduce the complexity and the running time of the algorithm. The proposed algorithm is highly accurate, has high speed and low storage requirements in comparing with other related algorithms. The proposed algorithm can precisely detect circles with various scales, crossed and nested circles in the binary images. The proposed algorithm was compared with Hough Transform (HT) method for circle detection by using many images with different numbers and radius of circles and different image dimensions. The proposed algorithm was more efficient, where the average ratio of the running time for the proposed algorithm to HT method was 1:646, and the accuracy of the proposed algorithm was 100% for circles detection. Both the proposed and HT algorithms are applied by using Matlab 7.2 language, PC equipment with 1.8MHz Pentium IV processor and 512MB RAM.

Steganographic techniques are generally used to maintain the confidentiality of valuable information and to protect it from any possible theft or unauthorized use especially over the internet.In this paper, Least Significant Bit LSB-based Steganographic techniques is used to embed large of data in different color space models, such as (RGB, HSV, YCbCr, YIQ, YUV). The idea can be summarized by transforming the RGB value of the secret image pixels into three separate components into the pixels of the cover image. The measures (MSE, SNR, PSNR) were used to compare between the color space models, the comparisons proved that steganography with color systems (RGB and HIS) shown a best results.

In last years, Steganography techniques involving audio file formats appear to be increasing in popularity. This may be attributed to the fact that current steganalysis tools available to the general public fall short when applied to audio files. Another factor that may be contributing to the increasing popularity is the widespread popularity of the MP3 file format and its ubiquitous presence on the Internet. In this paper, an introductory look at steganography and the important methods for hiding data in audio is shown, as well as the strengths and weaknesses of each method. An overview about sound and their file formats especially MP3 file format and its attribute and features. Here, some steganography techniques on sound (Low Bit Encoding, Phase Coding) has been used to apply them on MP3 file format which had been chosen as a cover for data transmission.

The best band selection from remote sensing image plays an important roles in multispectral and hyperspectral remote sensing image processing due to the intercorrelation that inherent in the multispectral images taken by remote sensing sensors. In this paper we use principle component analysis algorithm applied on remote sensing data and find covariance matrix for bands that should be processed then find eigen vector using Jacobi methods .The algorithm was applied on multispectral images of Thematic Mapper sensor , it concluded that the six band was the best band , the value of it’s eigen value was the biggest one and the value of signal to noise ratio equals to 74.7217. This algorithm is constructed using Visual C# 2008 that is characterized by efficient and high speed implementation.

Image fusion is an effective tool to integrate multi-source image, where the purpose of the process access to information integration concept, and make the resulting image more suited to human vision, as well as digital processing. This integration leads to a technology that joins the resources in order to increase and clarify the information that serve the visual and automatic interpretation. The current research aims to use wavelet transformation with two dimensions (2D-DWT) in the integration of multispectral images (images taken by visible band) and others taken by IR (Infrared band) to obtain a single and clear image, and shows in accurate details of the original images. This algorithm programmed by MATLAB tools (MATLAB R2008a) is applied to the two images, the dimensions of each image 512×512 pixels. Where the fusion process depends on two types of mathematical models, the Maximum, and Average. High pass Combination and Low pass Combination filters were used. Using filters db4, coif4 and sym4 and then the Entropies of images were calculated to measure the amount of information in the resulting image. This paper shows that the 2D-DWT is used to integrate images using the image fusion ,and it gives good results in increasing the amount of generated information, increase the efficiency of the image , increase reliability , and reduce the uncertainty-surrounding some of the features in the images which are not clear.

In this paper a new algorithm is suggested to encrypt data, as it was to benefit from human iris as one of Biometric properties in human body which distinguish the individual from the other to produce the encryption through extracting important features using Wavelet Transformation and then passing through a series of operations moderation as the first phase, at the second phase a chaotic function properties is used by leading it in encryption operation as a basic factor. Through the overlap between the results of above phases a new encryption algorithm is produced which show strength, and could not discover the encryption key until getting the biometric property and finding complete information about the chaotic used function in addition to the working algorithm .

In this paper the genetic algorithm has been used to estimate the parameter θ which exist in Boltzmann Distribution which controls the structure of the Ribo Nucleic Acid (RNA). Two algorithms have been suggested. The first found the value of the estimator which maximizes the likelihood function of Boltzmann Distribution. The second minimized the generation constraint of Boltzmann Distribution by using the genetic algorithm. Matlab (7.0) has been used in writing the programs of algorithms and achieved the following results: The maximum value for the likelihood estimator for Boltzmann Distribution appear at the value -4.1614 where the value of θ is 0.1457, and the minimum value for the Constraint Generation for Boltzmann Distribution appear at the value 0.951039101*17 where the value of θ is -4.4066.

In this paper audio files are compressed using counter propagation neural network (CPNN) which is one of the fastest neural networks in multi media. The utilized counter propagation neural network was trained on uncompressed sound file to obtain the final weights of this CPNN (Kohonen layer, Grossberg layer ). In compression operation: the sound signal segmented to number of frames equal in size. Then these frames are applied step by step, to the first layer of the neural network(kohonen layer) to obtain some compression results. The decompression operation done by retrieve stored information in resulted file. This information is applied to second layer of this CPNN (Grosberg layer) which will perform decompression operation and retrieve the original sound file. The proposed algorithm is applied on (.wav) audio files , The results show high performance in addition to short time in compression and decompression operation.

In this paper, the solution of constrained nonlinear programming problems by a Sequential Quadratic Programming (SQP) is considered. The aim of the present work is to promote global convergence without the need to use a penalty and Barrier functions in the mixed interior-exterior point method. Instead, a new concept of a “filter” that aims to minimize the objective function and its approach that allows appoint to be accepted if reduces the objective function and satisfies the constraint violation function. If that point is rejected a new point is tested.

In an electronic color-imaging device, such as a digital camera, using a single CCD (Charge Coupled Device) sensor, the color information is usually acquired in sub-sampled patterns of Red (R), Green (G) and Blue (B) pixels. The methodology to recover or interpolate the missing color components is known as color demosaicing, a type of image interpolation. This paper introduces and compares some of the most popularly demosaicing algorithms of adaptive type applied on true color images. Another comparison is done between these methods and the non-adaptive traditional methods. Also, a new method is invented, which depends on both types. The used images are of Bitmap type. Signal to noise ratio measure is used as an objective quality metric. The results of comparison are presented with some sampled images. Programming has been applied using Visual C++ 6.0 programming language.

This paper investigates a novel algorithm for compressing and encrypting Arabic short text messages (SMS messages). Short text messages are used in cellular networks. Compression is required for saving the transmission energy or to use bandwidth in an efficient manner in addition to save the user money while the end-to-end effective encryption is required for security providence. This work succeeded to overcome small size limitation of the SMS message by changing Arabic characters coding from Unicode to Base64 coding scheme and developing a runt version of lossless Huffman coding scheme. Examples are shown where the application of the text compressor for short message services offering more than three times the capacity compared to a standard message.

This paper proposes a new algorithm for recognizing text object images by using fractal geometry. The fractal dimension was used as a main feature for recognizing text objects within images. Box-counting method was used to estimate the fractal dimension for image contents. In order to determine a threshold value for the textual objects within image, the fractal dimension was computed for a number of gray scale textual images. The fractal number of each pixel was calculated, then the mean value of all these fractal values were computed. The threshold value was used in recognizing and retrieving the textual objects within image. This algorithm was applied on 75 image samples, 25 image samples were used in training phase, the threshold value was determined throughout this phase; whereas 50 image samples were used in testing the algorithm. The proposed algorithm has performed extremely well with recognition rates 91.5% which is considered good performance. It is a promising technique for optical character recognition system.

There are two basic types of symmetric algorithms: block ciphers and stream ciphers. Block ciphers operate on blocks of plaintext and ciphertext—usually of 64 bits but sometimes longer. Stream ciphers operate on streams of plaintext and ciphertext one bit or byte (sometimes even one 32-bit word) at a time. With a block cipher, the same plaintext block will always encrypt to the same ciphertext block, using the same key. With a stream cipher, the same plaintext bit or byte will encrypt to a different bit or byte every time it is encrypted. In this paper we introduce three developments of Counter Mode of Operation of Block cipher. These developments merge between advantages of Counter Mode with other Modes. This gives a good secure Modes for General purpose block-oriented transmission Authentication, Random access, Stream-oriented transmission over noisy channel.

One of the key issues of modern cryptography is the problem of establishing a secure end-to-end communication over an insecure communication channel. Short Message Service (SMS) is a hugely popular and easily adopted communications technology for mobile devices. Users conduct business, disclose passwords and receive sensitive notification reports from systems using this communication technology. SMSs by default are sent in clear text form within the serving GSM (Global System for Mobile communications) network, Over The Air (OTA), and potentially over the public Internet in a predictable format. This allows anyone accessing the GSM system to read, and or modify the SMS content even on the fly. In this paper, we present an approach mainly consists of two steps, first, SHA-1 authentication is used to generate a message digest that is combined with previous message digest and a shared secret key to form an initial key stream. Secondly, this key will be used as input to a mathematical equation derived in prefix notation from randomly selected set of operators and functions supported by the software platform extracted from special table. The final key stream is the output of this equation which is a one time pad to encrypt the original message text. Lastly, encrypted SMS message will be sent and a randomized operation will be then applied to that table. A one-time pad, considered to be the only perfectly secure cryptosystem, secures an SMS message for transport over any medium between a mobile device and the serving GSM network and through it too.

In this paper, we have developed a new formula which is more suitable to the Barrier function and we have also investigated a new hybrid algorithm of SD and VM formulas with exact line search in the field of non-linear constrained optimization.

Peace Agreement signed on October 26, 1994 between Jordan and Israel in Wadi-Araba on their borders was not but a circle in long series of relations which had been established since 1920's. In order to understand these relations, we should go back to its essentials explaining the reasons behind its continuity all over these years. The paper trying to give a view for the development of these relations as well as the consequences and both of official and popular positions.

Image matching plays an important role in many applications such as multi-modality medical imaging and multi-spectral image analysis. The role of matching is to integrate multiple sources of object information into a single image. The matching problem consists of determining the unknown transform parameters required to map one image to match the other image(20). Different non – traditional methods are used for solving this kind of problem. Among these methods are the Genetic Algorithms, Neural Networks & Simulating Annealing. Swarm Intelligence (SI) algorithms take their inspiration from the collective behavior of natural, for example, ant colonies, flocks of birds, or fish shoals, a particularly successful strandant colony optimization (ACO)(1). Ant Colony Optimization is a population-based general search technique, proposed by Dorigo(1992,1996), for the solution of difficult combinatorial problems)4). The studies show that, in nature, the ant colony is able to discover the shortest paths between the nest and food sources very efficiently, such a deposit substance is called pheromone during talking and another ants can smell it, if one of ants find a short path, it feedback on the same path and the value of pheromone on this path increases and a another ants gradually chose this path.(22) Tabu search is one of the best known heuristic to choose the next neighbor to move on. At each step, one chooses the best neighbor with respect to specific function (23). The basic idea in this paper is using Ant Colony Optimization(ACO) & Tabu Search(TS) as a success strategy for matching two images. The suggestion algorithm evaluation is a good promising solution, by providing an optimal algorithm which is executed by optimal time and coast, I believe that there is no prior research conjoining the two topics in this way. The program is written in Matlab language (6.5).

It may be possible to find the Wiener polynomial with respect to a generalized distance of a compound graph constructed from two graphs having some kind of regularity. In this paper, we obtain the Wiener polynomials for a generalized distance of compound graphs constructed from a complete graph with some other special graph, such as a complete bipartite graph, a star, and a wheel, using binary operations defined by Gutman [4]. The Wiener index with respect to such generalized distance for each such compound graph is also obtained.الملخصإن وضع صیغة لمتعددة حدود وینر لتعمیم المسافة فی البیانات المرکبة یتطلب ان تکون البیانات المرکبة لها درجة من الانتظام, وهذا ینطبق على تراکیب بعض البیانات الخاصة التی لها انتظام معین, لذلک وجدنا من المناسب إیجاد حدودیات وینر لتعمیم المسافة للبیان المرکب من البیان التام مع بعض البیانات الخاصة مثلا البیان الثنائی التجزئة التام, وبیان النجمة, وبیان العجلة بإحدى العملیات الثنائیة المعرفة لـ[4] Gutman. وکذلک أوجدنا دلیل وینر لمتعددات الحدود لتعمیم المسافة لکل من البیانات المرکبة المذکورة سابقا.

The aim of the project is to develop parallel approaches for both the simplex that are used in linear programming to solve linear module systems. Most of these models are time consuming when executed and processed in the sequential microprocessor computers. During the project, we try to decrease this time and increase the efficiency of the algorithm for the two methods simplex, through developing parallel methods appropriate to be executed on MIMD type computers. In this paper, three algorithms were suggested for paralleling (a developed algorithm and a comparison was made between the three algorithms and the original. This comparison is included in second section. In general, the practical results and the suggested programs for these new algorithms proved to be better in performance than their analogues that are executed in computers of sequential processor in view of the two elements of execution time and algorithm time.

In this paper, a new hybrid conjugate gradient algorithm is proposed for unconstrained optimization. This algorithm combines the desirable computation aspects of Polak-Ribière steps and useful theoretical features of Fletcher-Reeves CG-steps. Computational results for this algorithm are given and compared with those of the Fletcher and Polak standard CG methods showing a considerable improvement over the latter two methods.

After having reviewed the RETARD code, which was originally written by Hairer & Wanner in 1995 with the aim of solving delay differential equations (DDEs), a new arithmetic called OSFESOR code is presented in this paper. The OSFESOR (Optimal stepsize for each step of RETARD) code is a tool for automatic implementation of DDEs in Fortran 77. Consequently, by use of the OSFESOR code, it is possible during the run of a program to evaluate the solution of DDEs with optimal stepsize, H, for each step , to evaluate the accuracy of any result provided by the computer . In short, the use of OSFESOR code serves to validate the result provided by a computer, and to assure the user of the reliability of scientific computations.

The main purpose of this paper is to study ERT and MERT rings, in order to study the connection between such rings and II-regular rings.

In this paper a class of self-scaling VM-algorithms for unconstrained optimization is investigated. Some theoretical results are given on the scaling strategies that guarantee the global convergence of the new proposed algorithm.

Audio hiding is method for embedding information into an audio signal. It seeks to do so in a robust Fashion, while not perceivably degrading the host signal (coves audio). Hiding data in audio signals presents & varicty of challenges: due in part to the wider dynamic and differential range of the Human Auditory System (HAS) as compared to other senses. Transform are usually used for robust audio hiding (audio watcrmarking). But, the audio hiding process is affected by the type of transform used. Therefore, this paper presents an evaluation of wavelet transform hiding in comprison with sclccted types of transforms (Walsh transform and cosine transform) hiding. In order to generate the audio stegecover, the research concludce (Wavelet, Walsh, or Cosine) transform of the audio cover, replacing some transformed cover cocfficients with secret audio message coefficients, and inverse (Wavelet, Walsit, or Carsine Irannom for audio cover with replaced coefficients. While, the extracting method concludes (Wavelel, Walsh, or Cosine runsform of the stego ove18 and extracting the secrecy extracted Audio message.

In This paper, An efficient architecture for the implementation of two dimensional discrete wavelet transform based on lifting scheme for two types of JPEG2000 filters (5/3 and 9/7 filter) are proposed. The pipelining method is applied in the proposed architecture to design multilevel (three-level) architecture for both direction (forward and inverse) transform. After that, the proposed architecture is used to study the effect of clearing the detail coefficients HH, HL and LH sub-band images into the quality of reconstruction image, the proposed one-level two dimensional discrete wavelet transform architecture (one-level 2-D DWT) is built by using the one dimensional discrete wavelet transform (1-D DWT) only,then by using the 1-D DWT as basic element, the architecture are developed to built the three-level two dimensional discrete wavelet transform module (three-level 2-D DWT). The Matlab was used to simulate the proposed architectures and measure the quality of image by using the signal to Noise Ratio (SNR).

The last decade witnessed a great evolution on the fields of computer science, artificial intelligence, communication and data transmission. This evolution draw the attention of specialists to design a modern cryptosystem for data encryption based on neural networks methodologies that are very hard, if not impossible, to be broken. This paper employs cryptography scheme utilizes the neural networks in block cipher algorithms. Taking into consideration different plaintexts block size. The block frequency test has been show the successful of ciphertexts with difficulty to break the cipher process. The application of the neural network in cryptography provides fast and high security system in block ciphering in comparison with traditional methods. The C++ language is used for designing the programs of neural network to encryption and decryption algorithms.

In this paper, a new adapted optimal step-size is designed to improve the efficiency of pair conjugate method. At each linear search an acceptable step- size is estimated during quadratic interpolation and this estimate is used as an initial trial step-size. The technique needs only additional gradient evaluation at each search direction. Also we have improved Armijo line search technique to be used together with the new optimal stepsize. The numerical results are more efficient than the results of the same method using the classical scheme for the linear search technique.

There are some recent arguments in the community of computer enlightenment respecting the Object Oriented Programing (COP). This discussions focucs on one of the major questions that is "are we starting the duration of theory of computer science? How In this short paper we try to answer the most significant question of With the use of OOP, arc we passed Mccartry's theory ?are we starting new theory of computer science ? " We will first look at McCarthy theory, the principles of OOP. then finally we will attempt to answer the question and show our claims.

This paper discusses the form and meaning of conjunctive relation and how conjunctive relation is translated from source language into target language. The different system amongst languages in forming words, sentences or paragraph might represent peculiar form and meaning. As a part of element in determining logical meaning, conjunctive relation can be in the form of conjunction, verb, noun, preposition and implicit. Those forms signal how unity of a text is constructed. In translation, the use of conjunctive relation forms frequently make problem for translators since it is closely related to logical meaning in a text. In translating text, different meaning between two languages should be occasionally translated into different form and meaning of the two languages. To understand a text comprehensively, a reader must know the unity of a text. One of the aspects to determine unity of a text in translation is conjunctive relation. The unity of a text can be covered with the conjunctive relation which signal logical relation among clauses, sentences and paragraph, so that in translation cohesiveness of a text is interpreted well both in source text and target text.Keywords: Terjemahan, Conjuctive, Relation, Makna, Logis

This paper discusses a suggested approach for new kind of Speech Signal Compression Algorithm based on KL transform (Karhunen-Loève transform) which normally used with digital image. Speech signal (which is single sequence) rearranged in form of two dimension square matrix to be suitable for KL transformation. Then to be compressed using different no. of eigen values and eigenvectors. Measuring the performance of applied KL transformation (by evaluating the PSNR and SNR factors) with different numbers of eigen values and vectors studied. High rate of compression with high SNR, PSNR got with so closed speech signal to the original one measured using correlation factor which gives values near to 1. In addition to short time needed for compression operation.

Voice compression is one of the important subject today specially in field of communication and application so in this paper, speech compression was adopted based on hybrid technique between wavelet and Huffman code. Wavelet in single dimension can reduce the signal size to half of the original in each level, then using Huffman code to store output the file. Hybrid between the above two techniques give high rate of compression ratio, and closed returned signal from the original one, because of the coding technique from the lossless classification but the idea of sample down was achieved with the wavelet which produce little loss in the retrieved data, while the effected of the wavelet is positive effect due to the reduction of the high frequencies, which effect as noise in most application[specially in speech],in addition to that it give high redundancy in the component of the speech signal [in low-low components]. The practical application of the proposed algorithm give (30%) compression ratio plus stability when the file size growth up. SNR&MSE show that retrieved speech quality is good.