Document clustering is the process of organizing a particular electronic corpus of documents into subgroups of similar text features. Formerly, a number of conventional algorithms had been applied to perform document clustering. There are current endeavors to enhance clustering performance by employing evolutionary algorithms. Thus, such endeavors became an emerging topic gaining more attention in recent years. The aim of this paper is to present an up-to-date and self-contained review fully devoted to document clustering via evolutionary algorithms. It firstly provides a comprehensive inspection to the document clustering model revealing its various components with its related concepts. Then it shows and analyzes the principle research wor

Secure information transmission over the internet is becoming an important requirement in data communication. These days, authenticity, secrecy, and confidentiality are the most important concerns in securing data communication. For that reason, information hiding methods are used, such as Cryptography, Steganography and Watermarking methods, to secure data transmission, where cryptography method is used to encrypt the information in an unreadable form. At the same time, steganography covers the information within images, audio or video. Finally, watermarking is used to protect information from intruders. This paper proposed a new cryptography method by using thre

Data hiding (Steganography) is a method used for data security purpose and to protect the data during its transmission. Steganography is used to hide the communication between two parties by embedding a secret message inside another cover (audio, text, image or video). In this paper a new text Steganography method is proposed that based on a parser and the ASCII of non-printed characters to hide the secret information in the English cover text after coding the secret message and compression it using modified Run Length Encoding method (RLE). The proposed method achieved a high capacity ratio for Steganography (five times more than the cover text length) when compared with other methods, and provides a 1.0 transparency by depending on som

In Automatic Speech Recognition (ASR) the non-linear data projection provided by a one hidden layer Multilayer Perceptron (MLP), trained to recognize phonemes, and has previous experiments to provide feature enhancement substantially increased ASR performance, especially in noise. Previous attempts to apply an analogous approach to speaker identification have not succeeded in improving performance, except by combining MLP processed features with other features. We present test results for the TIMIT database which show that the advantage of MLP preprocessing for open set speaker identification increases with the number of speakers used to train the MLP and that improved identification is obtained as this number increases beyond sixty.

The reciprocal relationship between the text and the mask in the printed product is one of the most important relationships that frame the level of communication between the appearance and the interior, although it is not cared for by some designers and publishing institutions. Therefore, the problem of research is determined by the following question (What is the dialectical relationship between the text and the mask in the literary books covers design?). The research aims to shed light on this problematic relationship at the level of reception and aesthetics at the same moment. The theoretical framework included two sections: the first (mask and text ... the concept and the mutual relationship), while the second section (trends in the

All modern critical approaches attempt to cover the meanings and overtones of the text, claiming that they are better than others in the analysis and attainment of the intended meanings of the text. The structural approach claims to be able to do so more than any other modern critical approach, as it claimed that it is possible to separate what is read from the reader, on the presumed belief that it is possible to read the text with a zero-memory. However, the studies in criticism of criticism state that each of these approaches is successful in dealing with the text in one or more aspects while failing in one or more aspects. Consequently, the criticism whether the approach possesses the text, or that the text rejects this possession, r

Cryptography steganography is a practical tool for data security. Hybridization of the cryptography with steganography can provide more security by taking advantage of each technique. This work proposes a method for improving the crypto-stego method by utilizing the proposed dictionary method to modified ciphertext. After that, the modified encrypt ciphertext id was hidden in the text by using the proposed method. For cryptography, an Advanced Encryption Standard (AES) was utilized to encrypt the message. The AES employed a 128bit block size and 256bit key size. The ciphertext characters were then replaced by the characters identified by a dictionary list. The dictionary is time-dependent, where each of the equivalent words shift based o

Care and attention to the structure in the sixties of the last century replaced the mark, and if the structure of Ms. pampered in research and studies, it has become the mark is also a spoiled lady .. But the relationship between the structure and the mark was not a break and break, but the relationship of integration, His themes are structural analysis, and these are intellectual themes that can not be surpassed in contemporary research, especially since semiotics have emerged from the linguistic inflection.

We have tried to distinguish between text and speech, which is a daunting task, as it seems that whenever the difference between them is clear and clear, we come back to wonder whether the text is the same discourse, and is

In this paper, the problem of scheduling jobs on one machine for a variety multicriteria
are considered to minimize total completion time and maximum late work. A set of n
independent jobs has to be scheduled on a single machine that is continuously available from
time zero onwards and that can handle no more than one job at a time. Job i,(i=1,…,n)
requires processing during a given positive uninterrupted time pi, and its due date d
i.
For the bicriteria problems, some algorithms are proposed to find efficient (Pareto)
solutions for simultaneous case. Also for the multicriteria problem we proposed general
algorithms which gives efficient solutions within the efficient range

.