Abstract-The arabic language is different from Western languages especially at the morphology and spelling variations. Indeed, the performance of information retrieval systems in the arabic language is still problematic. For this reason, we are interested in studying the performance of search engines which is the most famous between 2006 and 2010, on a corpus of a thousand arabic documents. We found that morphological analysis is not taken in consideration in these engines. Morphological analysis of an arabic word is to identify its morphemes, its affixes, its model and its root.

The use of VDMOS transistor under certain functional stress conditions produces a modification of its physical and electrical properties. This paper explores the physical analysis and SPICE simulation of the degradation effects related to the component micronic structure, and points out the degraded parameters following this stress.

No abstract

In this article, we present a new application that evaluated the performance of a number of the Arabic root extraction methods. The implemented methods in this system are selected according to a previous classification, where these methods are classified into five categories. We have selected a method for each category. These methods are: Light Stemmer, Arabic Stemming without a root dictionary, MT-based Arabic Stemmer, N-gram based on similarity coefficient and N-gram based on dissimilarity coefficient. This evaluation was conducted on the same terms in a corpus of two thousand words and their roots. These words are taken from Arabic dictionary "Lesan Al-Arab". This application has allowed us to have a first original comparison between the evaluated methods. This system works in two ways: normal and automatic.

Peer-to-peer (P2P) computing is currently attracting enormous attention. P2P systems have emerged as a popular way to share huge volumes of data. In such systems each peer is a database management system in itself, ex-posing its own schema. A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. In such settings, the main objective is the efficient search across peer databases by processing each incoming query without overly consuming bandwidth. In this paper, we propose an architecture based on (super-)peers, and we focus on query routing. Our approach considers that (super-)Peers having similar interests are grouped together for an efficient query routing method. In such groups, called Knowledge-Super- Peers (KSP), super-peers submit queries that are often processed by members of this group. A KSP is a specific super-peer which contains knowledge about: 1. its superpeers and 2. The others super-peers. Knowledge is extracted by using data mining techniques (e.g. decision tree algorithms) starting from queries of peers that transit on the network. The advantage of this distributed knowledge is that, it avoids to making semantic mapping, between heterogeneous data sources owned by (super-)peers, each time the system decides to route query to other (super- )peers. The set of KSP improves the robustness in queries routing mechanism and scalability in P2P Network. Compared with a baseline approach, our proposal shows a better performance using a new simulator with respect to important criteria such as response time, precision and recall.