M. I. A. Elwahab, K. Mahar, H. Abdul-kader, H. Khater
{"title":"Combining R-Tree and B-Tree to Enhance Spatial Queries Processing","authors":"M. I. A. Elwahab, K. Mahar, H. Abdul-kader, H. Khater","doi":"10.1109/ICCTA32607.2013.9529800","DOIUrl":"https://doi.org/10.1109/ICCTA32607.2013.9529800","url":null,"abstract":"The search process in the spatial database consumes much time for the user. The size of the database determines the efficacy and speed of information retrieval. The potency of spatial query in Geographic Information Systems (GIS) is of paramount importance. It depends heavily on the query processing algorithms. When the database size increases, the processes of data retrieval gets complicated. This paper employs two types of data structures; Rectangle-Tree (R-tree) and the Balanced-Tree (B-tree) which is called aRB-Tree. These two types have been formerly merged by researchers to facilitate the retrieval of data as quickly as possible while providing efficient results. The same idea has been adopted in this paper where the aRB (aggregate RB) accelerates executing complex queries and minimizes the time consumed in searching, editing, deleting and updating any record in the spatial database. In this paper a web application was developed to test the efficiency of using both data structures. This web application utilises a medical institution database that contains locations such as addresses of physicians, clinics, hospital, labs, and radiology centres. Results of aRB-Tree are more sufficient and accurate than using each index alone.","PeriodicalId":405465,"journal":{"name":"2013 23rd International Conference on Computer Theory and Applications (ICCTA)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128972246","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}
Abdelrahman Abdelazim, Wassim Masri, F. Abou-Galala
{"title":"Minimizing Delivery time in WSN-based Real-Time Applications using Multi-view video","authors":"Abdelrahman Abdelazim, Wassim Masri, F. Abou-Galala","doi":"10.1109/ICCTA32607.2013.9529385","DOIUrl":"https://doi.org/10.1109/ICCTA32607.2013.9529385","url":null,"abstract":"In this paper we investigate an improved prototype for a Multi-view video-surveillance system utilizing Wireless Sensor Networks (WSN) along with an enhanced Multi-view video compression algorithm, all working side by side to generate real-time HD quality video with minimal delivery time to end user. The system has been divided into two stages: stage 1 includes the implementation of an efficient video coding scheme followed by stage 2 which includes the transmission over a state-of-the-art WSN network. Experimental results show delivery time saving of up to 49%, which is vital for real time application.","PeriodicalId":405465,"journal":{"name":"2013 23rd International Conference on Computer Theory and Applications (ICCTA)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124129545","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}
Mohamed A. El-Serafy, M. Aly, E. El-Badawy, I. Ghaleb
{"title":"A Comparison between Two Post-Failure Load Distribution Techniques with Multiple Routing Configurations","authors":"Mohamed A. El-Serafy, M. Aly, E. El-Badawy, I. Ghaleb","doi":"10.1109/ICCTA32607.2013.9529608","DOIUrl":"https://doi.org/10.1109/ICCTA32607.2013.9529608","url":null,"abstract":"When a link fails in an IP network, the network re-converges to redirect the traffic away from the failed link. IP fast reroute is used to minimize the time taken to redirect the traffic to an alternate path. Multiple routing configurations (MRC) is the IP fast reroute scheme under consideration. In this paper, we will discuss how to minimize the impact of the MRC recovery process on the post failure load distribution over network links. Two techniques used to achieve a good load distribution across links after failure are compared. The first technique utilizes manual link weight manipulation with MRC. The second technique is the modified MRC. Both advantages and disadvantages of the two techniques are discussed.","PeriodicalId":405465,"journal":{"name":"2013 23rd International Conference on Computer Theory and Applications (ICCTA)","volume":"118 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126419592","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":"Enhancing Optical Burst Switching Networks Throughput at Low & High Traffic Loads","authors":"Mahmoud H. Odeh, Mohammed Mahmoud, M. Aly","doi":"10.1109/ICCTA32607.2013.9529658","DOIUrl":"https://doi.org/10.1109/ICCTA32607.2013.9529658","url":null,"abstract":"This paper presents a new burst-scheduling algorithm for variable size burst in optical burst switching (OBS) networks, which will improve the quality of service (QoS). This is done for burst control to avoid burst overlapping in the egress router of OBS network. The impact of the burst size ,fiber delay lines (FDL), inter-arrival time, burst loss rate (BLR), and minimum time gap required between two successive bursts (d) on throughput are studied.","PeriodicalId":405465,"journal":{"name":"2013 23rd International Conference on Computer Theory and Applications (ICCTA)","volume":"550 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132446349","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":"Towards Trusted Mobile Ad-Hoc Clouds","authors":"A. Hammam, S. Senbel","doi":"10.1109/ICCTA32607.2013.9529882","DOIUrl":"https://doi.org/10.1109/ICCTA32607.2013.9529882","url":null,"abstract":"Most current cloud provisioning involves a data center model, in which clusters of machines are dedicated to running cloud infrastructure software. Ad-hoc mobile clouds, in which infrastructure software is distributed over resources harvested from machines already existing and used for other purposes, are gaining popularity. In this paper, we propose a trust management system (TMC) for mobile ad-hoc clouds. This system considers availability, neighbors’ evaluation and response quality and task completeness in calculating the trust value for a node. The trust management system is built over PlanetCloud which introduced the term of ubiquitous computing. EigenTrust algorithm is used to calculate the reputation trust value for nodes. Finally, a performance test was executed to prove the efficiency of the proposed TMC in term of execution time, and detecting node behavior.","PeriodicalId":405465,"journal":{"name":"2013 23rd International Conference on Computer Theory and Applications (ICCTA)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132401694","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":"Feature Extraction for Trajectory Representation of Sign Language Recognition","authors":"K. Mahar, Y. F. Hassan, Nermeen El Kashef","doi":"10.1109/ICCTA32607.2013.9529728","DOIUrl":"https://doi.org/10.1109/ICCTA32607.2013.9529728","url":null,"abstract":"Gestures are the dynamic movements of hands within a certain time interval, which are of practical importance in many areas, such as human computer interaction, computer vision, and computer graphics. This paper deals with the problem of representing and classifying trajectories of sign language. A proposed method of features extraction is introduced that includes time serial combined with chain code. The produced feature vector is used as input to a recurrent neural network (RNN) for recognition. The dynamic behavior of the RNN used to categorize input sequences into classes. The results show the effectiveness of the proposed method, where the input to the system is weekday’s signs and the output is the corresponding word.","PeriodicalId":405465,"journal":{"name":"2013 23rd International Conference on Computer Theory and Applications (ICCTA)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116580971","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":"Quality Controlled Stock Prediction Model","authors":"S. Guirguis, Fatma Zada, Tawfik A. Khattab","doi":"10.1109/ICCTA32607.2013.9529781","DOIUrl":"https://doi.org/10.1109/ICCTA32607.2013.9529781","url":null,"abstract":"This paper attempts to improve the quality of investing in the highly volatile Egyptian Stock Exchange by combining the concepts of statistical process control and artificial intelligence. Control charts were used to construct a statistically controlled stock market prediction model to support the decision of stock investors. The suggested model is mainly based on the concepts of Case-based Reasoning which is an artificial intelligent methodology that imitates the human problem-solving and reasoning behavior. Hit rate was applied as a performance measure of the quality of prediction for the suggested model. Results of predicting 900 next day stock predictions during January 2012 had a mean absolute prediction error of 2.096 LE and a hit ratio of 67%. After using the quality controlled process, the mean absolute prediction error was reduced to 1.92 L.E. and the hit ratio increased to 72%.","PeriodicalId":405465,"journal":{"name":"2013 23rd International Conference on Computer Theory and Applications (ICCTA)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130200168","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":"Predicting the Short Term Electrical Energy Consumption using Dynamic Model and Genetic Algorithm","authors":"K. Eskaf, I. El-Mohr","doi":"10.1109/ICCTA32607.2013.9529847","DOIUrl":"https://doi.org/10.1109/ICCTA32607.2013.9529847","url":null,"abstract":"Residential and commercial buildings accounted for about 70% of the total electricity consumption in the world. Many researchers are working hard to reduce building electrical energy consumption. This work is concerned with managing short term electrical energy consumption by trying to predict this consumption in the near future (6 months) on the basis of the current consumption.The goal of this paper is to determine the future electrical energy consumption using a Genetic Algorithm. Unlike other approaches, which involved in questioning the users, feature extraction procedures were implemented on electrical energy consumption time series in order to extract knowledge. The Genetic Algorithm generates the future value of electrical energy consumption with an accepted accuracy.","PeriodicalId":405465,"journal":{"name":"2013 23rd International Conference on Computer Theory and Applications (ICCTA)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131570679","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":"Optimizing Rules Sharing System in e-Government Using Service-Oriented Architecture: A Case Study in Egypt","authors":"S. Elkaffas, H. S. Fouad","doi":"10.1109/ICCTA32607.2013.9529894","DOIUrl":"https://doi.org/10.1109/ICCTA32607.2013.9529894","url":null,"abstract":"Information sharing systems are considered as one of essential challenges and issues that need to be addressed to meet the goal of effective e-government. E-government has complicated construction, interoperability platform and heterogeneous information systems. This paper proposes a framework to deploy Service-Oriented Architecture (SOA) principles for optimizing rules sharing mechanism in governmental agencies. Trusted and just in time information is the target. SOA serves as a bridge to pass the data logic as a black box and separate the logic of the rules to provide reusing capability. The proposed framework provides a solution when governmental agencies have common confused rules. It helps obtaining the most trusted rules. Accrued Vacation rules are developed to test and validate the proposed framework solution.","PeriodicalId":405465,"journal":{"name":"2013 23rd International Conference on Computer Theory and Applications (ICCTA)","volume":"297 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133497622","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":"Hybrid Moving Object Detection Algorithm with Controlled Temporal Scale Frame Difference","authors":"Mohammed Awney, M. Sayed, F. El-Samie","doi":"10.1109/ICCTA32607.2013.9529422","DOIUrl":"https://doi.org/10.1109/ICCTA32607.2013.9529422","url":null,"abstract":"Moving object detection is the first stage in any video surveillance system. It is followed by two other stages; tracking and classification. The accuracy of the later two stages strongly depends on the first one. This paper proposes a hybrid moving object detection algorithm, which combines controlled temporal scale frame difference and selective running average as a method of background subtraction. In order to overcome the main drawbacks of traditional temporal difference methods that depend strongly on the speed of the moving object, we propose a new algorithm that controls the temporal scale between successive frames to solve the problem of emptiness phenomenon, whenan object moves slowly. Experimental results show that the proposed algorithm outperforms other commonly used object detection algorithms.","PeriodicalId":405465,"journal":{"name":"2013 23rd International Conference on Computer Theory and Applications (ICCTA)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132320990","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}