Mobile wireless technologies have followed different evolutionary (generation) paths aimed at unified target related to the

performance and efficiency in high mobile environment, which provides access to wide range of telecommunication services

including advanced mobile services supported by mobile and fixed networks. This paper illustrate the developments of the

mobile wireless communication, focus on the specification and capability for each technology to make an idea about the future

technology what will offer.

Abstract— XML and relation database are two of the most important mechanisms for storing and transferring data. A reliable and flexible way of moving data between them is very desirable goal. The way data is stored in each method is very different which makes the translation process difficult. To try and abstract some of the differences away, a low–level common data model can be used to successfully move data from one model to another. A way of describing the schema is needed. To the best of our knowledge, there is no widely accepted way of doing this for XML.                                                         

Recently, XML Schema has taken on this role. On one hand, this paper takes XML conforming to XML schema definitions and transforms into relational database via the low–level modeling language HDM. On the other hand, a relational database is transformed into an XML Schema document and an XML instance document containing the data from the database. The transformations are done within the Auto med framework providing a sound theoretical basis for the work. A visual tool that represents the XML Schema in tree structure and allows some manipulation of the schema is also described.   

Abstract— With the growth of digital Arabic documents specially in information retrieval (IR) and natural language processing (NLP) applications, identification of irregular plurals which are commonly called broken plurals (BP) in modern standard Arabic becomes very urgent issue. Broken plurals are formed by imposing interdigitating patterns on stems, and singular words cannot be recovered by standard affix stripping stemming techniques. Identifying broken plurals is an important and difficult problem which needs to be addressed. In information retrieval, deriving singulars from plurals is referred to as a stemming. The process of stemming can be achieved by removing the attached affixes from a given word. To the best of our knowledge, all existing Arabic stemmers are unreliable and still under research. Consequently, this paper proposes an approach which identifies broken plurals without the need to perform the stemming process on any given word. The well known decision tree system (WEKA J48) is applied to build a classifier (model) on a very huge Arabic corpus as a training data which is pre-processed and prepared as a piece of this work. The built classifier is evaluated using unseen test set. The obtained results reveal that a very promising broken plural recognizer could be designed and implemented for NLP applications.

Abstract— In this paper, the XMLSchema-driven mapping of architecture components for generating new data formats will be introduced and an investigation of how the XMLSchema can be stored in different ways will be carried out. In general, any application that has the capability to work with XML documents will need to display the structure of its related data in a different format specified for a particular occasion, due to its nature in working in heterogeneous environment. Accordingly, mapping document from one data structure to another is needed. Such a mapping process is essential, especially when dealing with XMLSchema. Actually, when the data are to be translated between XML and database there should be some means of mapping formulated for the data before they can be transferred either to the database or in the document. Most of the techniques use object relational mapping for transforming data between XML and the database. In this paper, we will present different types of mapping of XMLSchema such as tree-to-tree which means XMLSchema to another XMLSchema and XMLSchema to XHTML. Other mappings are XMLSchema to relation, XMLSchema to object relational, and XMLSchema to relational algebra. We also introduce general algorithms for many of the mapping types. The algorithms and the techniques show how XMLSchema drives the mapping of architecture components to generate a new data structure.

Abstract— Query expansion is the process of supplementing additional terms to the original query to improve the information retrieval (IR) performance. For heavily inflectional languages such as Arabic, query expansion is considered a difficult task. In this paper, the well-known approach: "The similarity thesaurus" is adopted to be applied on Arabic. Prior to applying this approach, first; datasets (three collections of Arabic documents) are pre-processed to create documents inverted index vocabularies, then, the normal indexing process is carried out. The thesaurus method is applied to create a modified (expanded) query of the original one and the target collection is indexed once more. To gauge the enhancement of retrieval process, the results of normal indexing and those of applying thesaurus approach are evaluated against each other using precision and recall measures. The results have shown that the thesaurus method has considerably enhanced the performance of the Arabic Information Retrieval (AIR) System. As the number of expansion terms increases up to a certain extent (35 terms), the performance has been improved. On the other hand, the performance will not be affected, or grow insignificantly as the number of expansion terms exceeds this limit.

Abstract With the explosive growth of the World Wide Web, Information Retrieval Systems (IRS) have recently become a focus of research. Query expansion is defined as the process of supplementing additional terms or phrases to the original query to improve the information retrieval performance. Arabic is highly inflectional and derivational language which makes the query expansion process a hard task. In this paper, the well known approach, Pseudo Relevance Feedback (PRF) is adopted to be applied on Arabic. Prior to applying PRF, first; datasets (three collections of Arabic documents) are pre-processed to create documents inverted index vocabularies, then, the normal indexing process is carried out. The PRF is applied to create a modified (expanded) query of the original one and the target collection is indexed once more. To judge the enhancement of retrieval process, the results of normal indexing and those of applying PRF are evaluated against each other using precision and recall measures. The results have shown that the PRF method has significantly enhanced the performance of the Arabic Information Retrieval (AIR) System. As the number of expansion terms increases up to a certain extent (35 terms), the performance has been improved. On the other hand, the performance will not be affected, or grow insignificantly as the number of expansion terms exceeds this limit. 

Abstract: Nowadays, enormous amounts of accessible textual information available on the Internet are phenomenal. Automatic text classification is considered an important application in natural language processing. It is the process of assigning a document to predefined categories based on its content. In this paper, the well-known Centroid-based technique developed for text classification is considered to be applied on Arabic text. Arabic language is highly inflectional and derivational which makes text processing a complex and challenging task. In the proposed work, the Centroid-based Algorithm is adopted and adapted to be applied to classify Arabic documents. The implemented algorithm is evaluated using a corpus containing a set of Arabic documents. The experimental results against a dataset of 1400 Arabic text documents covering seven distinct categories reveal that the adapted Centroid-based algorithm is applicable to classify Arabic documents. The performance criteria of the implemented Arabic classifier achieved roughly figures of 90.7%, 87.1%, 88.9%, 94.8%, and 5.2% of Micro-averaging recall, precision, F measure, accuracy, and error rates respectively.

Abstract— Automatic text categorization is considered an important application in natural language processing. It is the process of assigning a document to predefined categories based on its content. In this research, some well-known techniques developed for classifying English text are considered to be applied on Arabic. This work focuses on applying the well-known Rocchio (Centroid-based) technique on Arabic documents. This technique uses centroids to define good class boundaries. The centroid of a class c is computed as center of mass of its members. Arabic language is highly inflectional and derivational which makes text processing a complex task. In the proposed work, first Arabic text is preprocessed using tokenization and stemming techniques. Then, the Rocchio Algorithm is adopted and adapted to be applied to classify Arabic documents. The implemented algorithm is evaluated using a corpus containing a set of actual documents. The results show that the adapted Rocchio algorithm is applicable to categorize Arabic text. Ratios of 92.2%, 92.7%, and 92.1% of Micro-averaging recall, precision, and F-measure respectively are achieved, against a data set of 500 Arabic text documents covering five distinct categories.