{"title":"Multipath routing mechanism with load balancing in ad hoc network","authors":"Mohamed Tekaya, Nabu Tabbane, S. Tabbane","doi":"10.1109/ICCES.2010.5674892","DOIUrl":"https://doi.org/10.1109/ICCES.2010.5674892","url":null,"abstract":"Mobile Ad hoc Networks (MANET) are wireless networks consisting of a collection of mobile nodes with no fixed infrastructure. Due to their decentralized, self-configuring and dynamic nature, MANETs offer many advantages and are easy to install. But with this dynamic topology, mobile ad hoc networks have some challenges like the design of an efficient routing protocol. An example for this challenge is load balancing. The multipath routing protocol with load balancing provides a solution for the congestion network and increases it's capacity. To consider that the use of multiple paths simultaneously for transmission data allows to improve the network performance, we propose a new protocol LB-AOMDV (Load Balancing-AOMDV), a solution to achieve better load balancing mechanism. The simulation's result shows the significant performance improvement of the network for the multipath routing protocol with load balancing. The proposed solution LB-AOMDV works better than other protocols in terms of average delay, capacity and load balance.","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131689135","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":"On-line signature verification based on PCA feature reduction and statistical analysis","authors":"K. Ahmed, I. El-Henawy, M. Rashad, O. Nomir","doi":"10.1109/ICCES.2010.5674907","DOIUrl":"https://doi.org/10.1109/ICCES.2010.5674907","url":null,"abstract":"This paper presents a novel online signature verification method that uses PCA for dimensional-reduction of signature snapshot. The resulting vectors from PCA are submitted to a multilayer perceptron (MLP) neural network with EBP and sigmoid activation function. In the other hand, Dynamic features such as x, y coordinates, pressure, velocity, acceleration, pen down time, distance, altitude, azimuth and inclination angles, etc. are processed statistically. During enrollment, five reference signatures are captured from each user. One-way ANOVA is used to analyze relative X-Coordinates in 6 groups (5 reference group, 1 testing group). ANOVA test will be repeated for relative Y-Coordinates, pressure value, azimuth and inclination angles. Thus, the algorithm will fill up a vector of five distances (F-scores) between all the possible pairs of testing and reference vectors. The resulting vector is compared to a threshold vector. Our database includes 130 genuine signatures and 170 forgery signatures. Our verification system has achieved a false acceptance rate (FAR) of 2% and a false rejection rate (FRR) of 5%","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122582365","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":"High performance adaptive framework for scheduling Grid Workflow applications","authors":"Ahmed Ghanem, A. Saleh, H. Ali","doi":"10.1109/ICCES.2010.5674896","DOIUrl":"https://doi.org/10.1109/ICCES.2010.5674896","url":null,"abstract":"The Grid Workflow scheduling is one of the most important issues in Workflow management because of its impact on the performance. Due to its importance, many scheduling approaches are proposed including static, dynamic and adaptive ones. Static approaches performance in Grid environment is questioned due to the continuous environment changes. The main objective of this paper is to introduce an adaptive scheduling approach in which the new Grid changes can be taken into consideration in order to achieve high performance and minimized makespan. The experimental results show that the proposed adaptive approach outperforms the static approaches in Grid environment.","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"338 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115671236","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":"A generic process to build reliable distributed software components from early to late stages of software development","authors":"Mariam Lahami, M. Krichen, M. Jmaiel, Akram Idani","doi":"10.1109/ICCES.2010.5674870","DOIUrl":"https://doi.org/10.1109/ICCES.2010.5674870","url":null,"abstract":"In this paper, we propose an incremental software development process that addresses reliability concerns, from early to late stages of software development. Contrary to existing techniques, in our proposal we merge two dependability means: fault prevention and fault forecasting techniques in order to build reliable distributed software systems. The design stage is focused on obtaining coherent specification of each individual component using an incremental refinement technique. After obtaining a consistent specification of each component, we deal with generating its code safely. In addition, we define consistent component assemblies by checking their compatibility at the integration level. The runtime testing stage is based on the fault forecasting technique which allows an emprirical estimation of the overall system reliability. Such process is used to get confidence that the obtained system behaves correctly according to its specification and fulfils all requirements and expectations. As an example, this paper introduces B formal method and Fractal component model to build reliable and trustworthy Fractal based applications.","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127369423","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":"A new frequency domain based methodology for signal integrity analysis","authors":"A. El-Rouby","doi":"10.1109/ICCES.2010.5674881","DOIUrl":"https://doi.org/10.1109/ICCES.2010.5674881","url":null,"abstract":"The co-existence of two different sets of parameter definitions, requirements and specifications in the domain of digital system design; namely the time domain (TD) and frequency domain (FD), is imposing some challenges on digital system design. Those challenges are increasing with the increase in system speed and are hard to address using traditional methods. This paper proposes a new methodology to perform signal integrity (SI) analysis, fully, in frequency domain to help addressing those challenges. To perform SI analysis, fully, in FD it is required to build the correct system model, construct an efficient methodology and develop quantitative measures and relationships as well as correlation to TD quantities. The focus in this paper will be on the first two items where a system model and an efficient FD methodology are introduced and their accuracy, compared to TD simulations, is examined.","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127027803","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":"A new dental panoramic X-ray image registration technique using hybrid and hierarchical strategies","authors":"N. Mekky, F. Abou-Chadi, S. Kishk","doi":"10.1109/ICCES.2010.5674886","DOIUrl":"https://doi.org/10.1109/ICCES.2010.5674886","url":null,"abstract":"In this paper, a wavelet-based decomposition level with scale invariant feature transform (SIFT) is proposed to solve the problem of image registration. At the highest wavelet-based pyramid level, mutual-information (MI) based registration is applied and rough similarity (linear conformai) transformation parameters are achieved. At the first wavelet-based decomposition level, SIFT-based registration technique is utilized with the aid of rough parameters obtained. To remove outliers automatically a RANdom Sample And Consensus (RANSAC) algorithm is applied. A comparison between proposed technique with three registration approaches is achieved: cross-correlation based registration, point mapping image registration, and hybrid registration technique using MI and SIFT in the spatial domain. The quality of the registration process was measured using the following criteria: normalized cross-correlation coefficient (NCCC) and percentage relative root mean square error (PRRMSE). The application of the proposed technique to dental panoramic X-ray images has shown that wavelet-based hybrid approach combining MI and SIFT operator achieves high performance registration results and can be used efficiently for registration of X-ray images.","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121816002","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":"Applying a novel clustering technique based on FP-tree to university timetabling problem: A case study","authors":"S. Shatnawi, K. Al-Rababah, B. Bani-Ismail","doi":"10.1109/ICCES.2010.5674875","DOIUrl":"https://doi.org/10.1109/ICCES.2010.5674875","url":null,"abstract":"In this study, we propose a clustering technique based on FP-tree algorithm to group students based on the intended courses they will register for a given next semester. The goal of this clustering is to solve the problem of course's time scheduling that we encountered in previous semesters which prevented students from enrolling in some of these courses as they are being scheduled at the same time which resulted in delaying their graduation. We also apply this technique on exams scheduling to ensure that no two exams are scheduled on the same time for courses that are being taken by the same set of students. The proposed technique has been tested using real data drawn from Applied Studies College (ASC) records.","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121875344","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":"Image streaming with multiple descriptions and network coding in mesh networks","authors":"Hussein H. Maza'ar","doi":"10.1109/ICCES.2010.5674847","DOIUrl":"https://doi.org/10.1109/ICCES.2010.5674847","url":null,"abstract":"This paper presents a proposal for transmitting and recovering images using Multiple Description Coding (MDC) techniques over unreliable multiple links in a mesh network, while using network coding technique to add a protection path. In pure MDC, the loss of one description degrades the received image quality. In the proposed technique, the protection path ensures that all the descriptions are received even when one description is lost, but at the expense of additional link. The image is divided into subimages called descriptions by the sender. Each description is encoded by JPEG standard. The descriptions transmitted on different links or channels. The proposed method (MDC+NC) can recover the exact lost pixels rather than the interpolated pixels in classical methods such as interpolations. A comparative evaluation and objective quality metrics based on simulation is presented.","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"40 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130537682","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":"A fast locking digital phase-locked loop using programmable charge pump","authors":"M. Ali, H. Elsemary, H. Shawkey, A. Zekry","doi":"10.1109/ICCES.2010.5674840","DOIUrl":"https://doi.org/10.1109/ICCES.2010.5674840","url":null,"abstract":"A proposed fast locking digital phase-locked loop (DPLL) is designed and simulated in this paper. The proposed topology based on converting the difference between the input frequency and the output frequency into a 3-bit code. This code is used to control a programmable charge pump (PCP) output current. As the difference between the two frequencies decreases, the PCP output current decreases to obtain smooth PLL locking. As locking is achieved, the PCP operates with its conventional current. The proposed DPLL is designed using UMC 130nm CMOS process with a 1.2V power supply. It operates in the frequency range 250MHz–1.75GHz. Over this frequency range a locking time reduction in the range of 35.7%–66.6% was achieved compared with conventional DPLL.","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"20 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132835728","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}
A. M. Zaki, M. H. El-Shafey, A. Eldin, Gamal M. Ali
{"title":"A new architecture for accurate dot product of floating point numbers","authors":"A. M. Zaki, M. H. El-Shafey, A. Eldin, Gamal M. Ali","doi":"10.1109/ICCES.2010.5674841","DOIUrl":"https://doi.org/10.1109/ICCES.2010.5674841","url":null,"abstract":"Many techniques were proposed to improve the accuracy of floating point operations such as addition, multiplication, and dot product. The purpose of such technique is to reduce the effect of rounding error. This paper introduces an efficient hardware implementation for accurate dot product. The proposed implementation was configured as a custom instruction in the ALTERA NiosII soft processor core. The computed result from the proposed method is as accurate as other algorithms and faster than them. Another advantage is that it has a linear time complexity, without any limitation on the vector length.","PeriodicalId":124411,"journal":{"name":"The 2010 International Conference on Computer Engineering & Systems","volume":"411 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132984058","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}