{"title":"An interactive system for Extracting arabic lexicon from arabic newspaper text","authors":"M. Ben Halima, A. Alimi","doi":"10.1109/INNOVATIONS.2008.4781719","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2008.4781719","url":null,"abstract":"We describe how to build a large comprehensive, integrated Arabic lexicon by automatic parsing of newspaper text. We have built a parser system to read Arabic newspaper articles, isolate the tokens from them, find the part of speech, and the features for each token. To achieve this goal we designed a set of algorithms, we generated several sets of rules, and we developed a set of techniques, and a set of components to carry out these techniques. As each sentence is processed, new words and features are added to the lexicon, so that it grows continuously as the system runs. To test the system we have used 75 articles (7 108 words) from the ASSAHAFA newspaper. The system consists of several modules: the tokenizer module to isolate the tokens, the type finder system to find the part of speech of each token, the proper noun phrase parser module to mark the proper nouns and to discover some information about them and the feature finder module to find the features of the words.","PeriodicalId":412180,"journal":{"name":"2008 International Conference on Innovations in Information Technology","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116989101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Two-Phased Real-Time Rendering of Large Neuron Databases","authors":"P. de Heras Ciechomski, R. Mange, A. Peternier","doi":"10.1109/INNOVATIONS.2008.4781778","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2008.4781778","url":null,"abstract":"By dividing the rendering of neurons into two modes called exploration mode and static mode, the user can explore large neuron databases interactively. The exploration mode contains only the necessary visual characteristics of neurons for the user to be able to navigate inside of the circuit, with an upper limit of primitives used. It is done in a forward rendering fashion. The static mode is of a higher visual quality, where neurons are rendered with a deferred shading technique, achieving a constant time update frequency.","PeriodicalId":412180,"journal":{"name":"2008 International Conference on Innovations in Information Technology","volume":"2008 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117049624","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Online and offline test unification in digital filters","authors":"R. Yousefi, M. Sargolzaie, S. M. Fakhraie","doi":"10.1109/INNOVATIONS.2008.4781740","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2008.4781740","url":null,"abstract":"A unification technique is proposed for online and offline test of digital filters to reduce area overhead of testing by sharing the offline and online resources. Performance, area and fault detection capability of the proposed technique is also discussed. The area overhead is invariant with the size of the main system and also near 100% fault detection capability is achieved for FIR and IIR case studies. Fault vulnerabilities of FIR and IIR filters are also compared.","PeriodicalId":412180,"journal":{"name":"2008 International Conference on Innovations in Information Technology","volume":"7 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120990723","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Global index for QoS in wireless networks","authors":"M. Boulmalf, T. Aouam, A. Lakas","doi":"10.1109/INNOVATIONS.2008.4781771","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2008.4781771","url":null,"abstract":"When GSM was introduced in the early 90's, it was considered an over specified system. Nowadays it is obvious that the whole range of services is widely in use, and in addition performance is degrading due to the rapidly increased number of mobile subscribers, numbering over 2.9 billion subscribers in the world today. The performance of cellular networks is the most important issue concerning their operators. The main goal is to keep subscribers satisfied with the delivered quality of service. In order to achieve the best performance, service providers have to monitor and optimize their network continuously. A Network Management System (NMS) with an online database is responsible for the collection of data on the networks. For greater effectiveness, operators install systems that do a lot more than collect and store raw data. These systems are easier to use and take advantage of all the data provided by NMS. In this paper we summarize measurements that were carried out to evaluate the performance of the GSM's Air-Interface (Um). We developed a new global Quality of Service (QoS) indicator that would be provided to business development department on a monthly basis. It would represent the overall impact of the quality of service on customers. For these measurements, an operative GSM-1900 network was utilized. The parameters selected (performance metrics) on a daily basis for measurements were those with a direct impact on subscribers.","PeriodicalId":412180,"journal":{"name":"2008 International Conference on Innovations in Information Technology","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124856622","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Iris Recognition Using Rotational Complex Wavelet Filters: A novel approach","authors":"R. Bodade, S. Talbar, S.K. Ojha","doi":"10.1109/INNOVATIONS.2008.4781770","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2008.4781770","url":null,"abstract":"In this paper, authors have proposed a novel approach of feature extraction of iris image using multi-directional wavelets obtained by combination of 2D Dual Tree Rotated Complex Wavelet Filters (RCWF) and 2D Dual Trace Complex wavelet Transform(CWT). This method provide features in 12 directions against 3 and 6 directions in DWT and CWT respectively. Iris features are obtained by computing energies and standard deviation of detailed coefficient subbands in 12 directions per stage, at 3 level of decomposition. Canbera distance is used for matching. The results are obtained using DWT, CWT combination of CWT and RCWF on UBIRIS database of 24000 image. The performance measure, ZeroFAR, is reduced from 6.3 using DWT to 2.6 using proposed method. The results are also comparable with the Daughman method. The method is also computationally efficient as compared to Gabor Filters.","PeriodicalId":412180,"journal":{"name":"2008 International Conference on Innovations in Information Technology","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125049349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Efficient range queries in spatial Peer-to-Peer networks","authors":"A. Mustafa, Z. Al Aghbari, I. Kamel","doi":"10.1109/INNOVATIONS.2008.4781667","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2008.4781667","url":null,"abstract":"Recently, many geographic information systems (GIS) utilize peer-to-peer (P2P) systems to overcome the current problems with client/server GIS systems such as non-scalability, high bandwidth requirement and single point of failure. In this paper, we propose an efficient scheme to support efficient range query processing over structured P2P systems, while balancing the storage load. The paper proposes a rotating token approach to balance the storage load by placing joining nodes in appropriate locations in the identifier space to share loads with already overloaded nodes. Then, to support range queries, we utilize an order preserving mapping function to map keys to nodes in order preserving way without hashing. In this study, we carry simulation experiments with synthetic data to measure the performance of the proposed approach.","PeriodicalId":412180,"journal":{"name":"2008 International Conference on Innovations in Information Technology","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126196104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Auto-Summarization-Based Steganography","authors":"A. Desoky, M. Younis, H. El-Sayed","doi":"10.1109/INNOVATIONS.2008.4781634","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2008.4781634","url":null,"abstract":"Steganography is the science and art of avoiding the arousal of suspicion in covert communications. This paper presents a novel steganography methodology that pursues text summarization in order to hide messages. The proposed summarization-based steganography (Sumstega) methodology takes advantage of recent advances in automatic summarization techniques to generate a text-cover. Sumstega does not exploit noise (errors) to embed a message nor produce a detectable noise. Instead, it pursues the variations among the outputs of autosummarization techniques to conceal data. Basically, Sumstega manipulates the parameters of automatic summarization tools, e.g. how the word frequency weights in the sentence selection, and employs other contemporary techniques such as paraphrasing, reordering, etc., to generate summary-cover that looks legitimate. The popular use of text summaries in business, science, education, news, etc., renders summary an attractive steganographic carrier and averts an adversary's suspicion. The validation results demonstrate the effectiveness of Sumstega.","PeriodicalId":412180,"journal":{"name":"2008 International Conference on Innovations in Information Technology","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126803314","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Energy optimization in mobile TV broadcast networks","authors":"M. Hefeeda, Cheng-Hsin Hsu","doi":"10.1109/INNOVATIONS.2008.4781676","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2008.4781676","url":null,"abstract":"We consider energy optimization in mobile TV networks in which a base station broadcasts multiple TV channels to mobile receivers over a common wireless medium. In these systems, the base station broadcasts TV channels in bursts with bit rates much higher than the encoding rates of the video streams. Thus, mobile devices can receive a burst of traffic and then turn off their radio frequency circuits till the next burst in order to save energy. To achieve this energy saving, the base station must carefully construct the burst schedule for all TV channels. In this paper, we formulate the problem of determining the optimal burst schedules for broadcasting multiple TV channels. We show that this problem is NP-complete for channels with arbitrary bit rates. We then propose a practical simplification of the general problem, which allows TV channels to have different bit rates, but at power of two increments. Using this simplification, we propose and analyze an optimal burst scheduling algorithm. We implement our algorithm in a mobile TV testbed and we present empirical results to demonstrate its efficiency and optimality.","PeriodicalId":412180,"journal":{"name":"2008 International Conference on Innovations in Information Technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114416180","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Classification and identification of stocks using SOM and genetic algorithm based backpropagation neural network","authors":"A. Khan, T. K. Bandopadhyaya, Sudhir Sharma","doi":"10.1109/INNOVATIONS.2008.4781644","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2008.4781644","url":null,"abstract":"Investment in stock market is one of the most popular type of investment. There are many conventional techniques being used and these include technical and fundamental analysis. The main aim of every investor is to earn maximum possible return on investments. The main issue with any approach is the proper weighting of criteria to obtain a list of stocks that are suitable for investments. This paper proposes an improved method for stock picking using self-organizing maps and genetic algorithm based backpropagation neural networks. The stock selected using self-organizing maps and genetic algorithm based backpropagation neural networks outperformed the BSE-30 Index by about 30.17% based on one and half month of stock data.","PeriodicalId":412180,"journal":{"name":"2008 International Conference on Innovations in Information Technology","volume":"522 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116336371","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Policy driven context-aware services in mobile environments","authors":"Y. Ridhawi, H. Harroud, A. Karmouch, N. Agoulmine","doi":"10.1109/INNOVATIONS.2008.4781747","DOIUrl":"https://doi.org/10.1109/INNOVATIONS.2008.4781747","url":null,"abstract":"The emergence of ubiquitous computing, enabled by the availability of portable devices and advances in (wireless) networking technologies , has increased the need for personalized and adaptive services in mobile environments. Making use of context is essential to cope and timely react to changes in such environments and hence achieve adaptability, reliability, and seamless service provisioning. This paper introduces the use of policies in processing and disseminating contextual information to provide context aware mobile services. The policy-based approach facilitates end-users services context awareness by dynamically creating new context policies and by triggering actions of predefined policies in response to satisfied context sensitive conditions. The enforcement of policies on services automatically results in the adaptation of their behavior according to context changes. This approach has been demonstrated with presence and proximity services scenario using agent technology.","PeriodicalId":412180,"journal":{"name":"2008 International Conference on Innovations in Information Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124113473","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}