Pub Date : 2014-12-01DOI: 10.1109/ICCES.2014.7030942
Hazem M. Kamal, Ehab M. Fareed, S. Elgamel
In this paper the second order cyclo-stationarity property of Fractional Fourier Transform (FrFT) OFDM is investigated. A novel closed form analytical expression for the cyclic autocorrelation function of FrFT-OFDM signal is derived. The derived formula is achieved in the presence of multipath dispersive channel along with additive white Gaussian noise (AWGN). Extensive Simulations are performed in order to investigate the cyclo-stationarity property of FrFT-OFDM signal over fading channel. A comparison with the cyclo-stationarity property of the conventional FT-OFDM signal is presented. It is shown that the FrFT-OFDM signal can be detected based on its second order cyclo-stationarity feature. Also, the autocorrelation function of the FrFT-OFDM is mathematically proven to be periodic. Its magnitude is estimated at different signal to noise ratio and different fractional order values by the aid of simulation.
{"title":"Detection of FrFT-OFDM based on second order cyclo-stationary feature over fading channels","authors":"Hazem M. Kamal, Ehab M. Fareed, S. Elgamel","doi":"10.1109/ICCES.2014.7030942","DOIUrl":"https://doi.org/10.1109/ICCES.2014.7030942","url":null,"abstract":"In this paper the second order cyclo-stationarity property of Fractional Fourier Transform (FrFT) OFDM is investigated. A novel closed form analytical expression for the cyclic autocorrelation function of FrFT-OFDM signal is derived. The derived formula is achieved in the presence of multipath dispersive channel along with additive white Gaussian noise (AWGN). Extensive Simulations are performed in order to investigate the cyclo-stationarity property of FrFT-OFDM signal over fading channel. A comparison with the cyclo-stationarity property of the conventional FT-OFDM signal is presented. It is shown that the FrFT-OFDM signal can be detected based on its second order cyclo-stationarity feature. Also, the autocorrelation function of the FrFT-OFDM is mathematically proven to be periodic. Its magnitude is estimated at different signal to noise ratio and different fractional order values by the aid of simulation.","PeriodicalId":339697,"journal":{"name":"2014 9th International Conference on Computer Engineering & Systems (ICCES)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121817629","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}
Pub Date : 2014-12-01DOI: 10.1109/ICCES.2014.7030928
Reem T. Haweel, W. S. El-Kilani, Hassan H. Ramadan
The Discrete Cosine Transform (DCT) is widely used in image compression for its high power compaction property. The Signed DCT (SDCT) and its modifications approximate the DCT and proceed faster. This paper introduces an efficient and low complexity 8 point transform. The proposed algorithm is derived by applying the signum function operator to an existing SDCT modification transform with good power compaction capabilities. Consequently, the elements of the proposed transform are only zeroes and ones. No multiplications or shift operations are required. The introduced transform keeps the high power compaction capabilities of its originating transform and, in the same time, provides a saving in computational complexity. A flow diagram is provided for the fast implementation of the transform. Only 17 additions are required for both forward and backward transformations. Simulation experiments are provided to justify the efficiency and improved performance of the proposed transform in image compression compared to other transforms.
{"title":"A fast modified signed Discrete Cosine Transform for image compression","authors":"Reem T. Haweel, W. S. El-Kilani, Hassan H. Ramadan","doi":"10.1109/ICCES.2014.7030928","DOIUrl":"https://doi.org/10.1109/ICCES.2014.7030928","url":null,"abstract":"The Discrete Cosine Transform (DCT) is widely used in image compression for its high power compaction property. The Signed DCT (SDCT) and its modifications approximate the DCT and proceed faster. This paper introduces an efficient and low complexity 8 point transform. The proposed algorithm is derived by applying the signum function operator to an existing SDCT modification transform with good power compaction capabilities. Consequently, the elements of the proposed transform are only zeroes and ones. No multiplications or shift operations are required. The introduced transform keeps the high power compaction capabilities of its originating transform and, in the same time, provides a saving in computational complexity. A flow diagram is provided for the fast implementation of the transform. Only 17 additions are required for both forward and backward transformations. Simulation experiments are provided to justify the efficiency and improved performance of the proposed transform in image compression compared to other transforms.","PeriodicalId":339697,"journal":{"name":"2014 9th International Conference on Computer Engineering & Systems (ICCES)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116693785","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}
Pub Date : 2014-12-01DOI: 10.1109/ICCES.2014.7030980
A. S. Elons, Menna Ahmed, Hwaidaa Shedid
Contrary to the common sense that tells us sign language depends mainly on hands, other factors such as facial expressions, body movements and lips affect dramatically a sign meaning. Arabic Sign Language (ArSL) tends to be a descriptive gesture language, facial expressions are involved in 70% of total signs. In this paper, a study on an ArSL database is performed to conclude that the 6 main facial expressions are essential to recognize the sign. A developed system used to classify these expressions accomplished 92% recognition rate on 5 different people. The system employed already existing technical methods such as: Recursive Principle Components (RPCA) for feature extraction and Multi-layer Perceptron (MLP) for classification. The main contribution of this paper is employing the developed module and integrating it with an already existing hand sign recognition system. The proposed system enhanced the hand sign recognition system and raised the recognition rate from 88% to 98%. Various people's shapes and capturing angles and distances have also been taken into consideration.
{"title":"Facial expressions recognition for arabic sign language translation","authors":"A. S. Elons, Menna Ahmed, Hwaidaa Shedid","doi":"10.1109/ICCES.2014.7030980","DOIUrl":"https://doi.org/10.1109/ICCES.2014.7030980","url":null,"abstract":"Contrary to the common sense that tells us sign language depends mainly on hands, other factors such as facial expressions, body movements and lips affect dramatically a sign meaning. Arabic Sign Language (ArSL) tends to be a descriptive gesture language, facial expressions are involved in 70% of total signs. In this paper, a study on an ArSL database is performed to conclude that the 6 main facial expressions are essential to recognize the sign. A developed system used to classify these expressions accomplished 92% recognition rate on 5 different people. The system employed already existing technical methods such as: Recursive Principle Components (RPCA) for feature extraction and Multi-layer Perceptron (MLP) for classification. The main contribution of this paper is employing the developed module and integrating it with an already existing hand sign recognition system. The proposed system enhanced the hand sign recognition system and raised the recognition rate from 88% to 98%. Various people's shapes and capturing angles and distances have also been taken into consideration.","PeriodicalId":339697,"journal":{"name":"2014 9th International Conference on Computer Engineering & Systems (ICCES)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123394771","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}
Pub Date : 2014-12-01DOI: 10.1109/ICCES.2014.7030934
S. Abdelrahman, Ebtsam Abdelhakam Sayed, R. Bahgat
Phrase-level polarity disambiguation recently became attractive. Nowadays, most corners of the sentiment analysis research have been investigated while the core and hard parts are not yet intensively explored, among which polarity disambiguation is one. In this research, we propose the integration between two SentiWordNet-based resources on phrase-level polarity disambiguation: (1) its score for the best word sense identified by a word sense disambiguation algorithm and (2) its examples having the non-zero scores of the prior polarities for the related subjectivity lexicon words. The integration of subjectivity lexicon word prior polarities together with Senti-WordNet scores and examples of word contexts were presented as classifier features to reduce the classification disambiguation. Our empirical evaluation is twofold. First, an experimental analysis was intrinsically conducted using various lexical resource settings coupled with feature selection algorithms to improve the classifier contextual subjective and sentiment polarity recognition. Second, the integration was extrinsically applied to improve the opinion question answering ranking task. These evaluations prove the superiority of the proposed integration in comparison with the state-of-the-art seminal work and baselines.
{"title":"The integration among disambiguation lexical resources for more effective phrase-level contextual polarity recognition","authors":"S. Abdelrahman, Ebtsam Abdelhakam Sayed, R. Bahgat","doi":"10.1109/ICCES.2014.7030934","DOIUrl":"https://doi.org/10.1109/ICCES.2014.7030934","url":null,"abstract":"Phrase-level polarity disambiguation recently became attractive. Nowadays, most corners of the sentiment analysis research have been investigated while the core and hard parts are not yet intensively explored, among which polarity disambiguation is one. In this research, we propose the integration between two SentiWordNet-based resources on phrase-level polarity disambiguation: (1) its score for the best word sense identified by a word sense disambiguation algorithm and (2) its examples having the non-zero scores of the prior polarities for the related subjectivity lexicon words. The integration of subjectivity lexicon word prior polarities together with Senti-WordNet scores and examples of word contexts were presented as classifier features to reduce the classification disambiguation. Our empirical evaluation is twofold. First, an experimental analysis was intrinsically conducted using various lexical resource settings coupled with feature selection algorithms to improve the classifier contextual subjective and sentiment polarity recognition. Second, the integration was extrinsically applied to improve the opinion question answering ranking task. These evaluations prove the superiority of the proposed integration in comparison with the state-of-the-art seminal work and baselines.","PeriodicalId":339697,"journal":{"name":"2014 9th International Conference on Computer Engineering & Systems (ICCES)","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122937844","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}
Pub Date : 2014-12-01DOI: 10.1109/ICCES.2014.7030936
Asanga Nimalasena, V. Getov
Database system performance problems have a cascading effect into all aspects of an enterprise application. Database vendors and application developers provide guidelines, best practices and even initial database settings for good performance. But database performance tuning is not a one-off task. Database administrators have to keep a constant eye on the database performance as the tuning work carried out earlier could be invalidated due to multitude of reasons. Before engaging in a performance tuning endeavor, a database administrator must prioritize which tuning tasks to carry out first. This prioritization is done based on which tuning action would yield highest performance benefit. However, this prediction may not always be accurate. Experiment-based performance tuning methodologies have been introduced as an alternative to prediction-based performance tuning approaches. Experimenting on a representative system similar to the production one allows a database administrator to accurately gauge the performance gain for a particular tuning task. In this paper we propose a novel approach to experiment-based performance tuning with the use of a context-aware application model. Using a proof-of-concept implementation we show how it could be used to automate the detection of performance changes, experiment creation and evaluate the performance tuning outcomes for mixed workload types through database configuration parameter changes.
{"title":"Performance tuning of database systems using a context-aware approach","authors":"Asanga Nimalasena, V. Getov","doi":"10.1109/ICCES.2014.7030936","DOIUrl":"https://doi.org/10.1109/ICCES.2014.7030936","url":null,"abstract":"Database system performance problems have a cascading effect into all aspects of an enterprise application. Database vendors and application developers provide guidelines, best practices and even initial database settings for good performance. But database performance tuning is not a one-off task. Database administrators have to keep a constant eye on the database performance as the tuning work carried out earlier could be invalidated due to multitude of reasons. Before engaging in a performance tuning endeavor, a database administrator must prioritize which tuning tasks to carry out first. This prioritization is done based on which tuning action would yield highest performance benefit. However, this prediction may not always be accurate. Experiment-based performance tuning methodologies have been introduced as an alternative to prediction-based performance tuning approaches. Experimenting on a representative system similar to the production one allows a database administrator to accurately gauge the performance gain for a particular tuning task. In this paper we propose a novel approach to experiment-based performance tuning with the use of a context-aware application model. Using a proof-of-concept implementation we show how it could be used to automate the detection of performance changes, experiment creation and evaluate the performance tuning outcomes for mixed workload types through database configuration parameter changes.","PeriodicalId":339697,"journal":{"name":"2014 9th International Conference on Computer Engineering & Systems (ICCES)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129117180","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}
Pub Date : 2014-12-01DOI: 10.1109/ICCES.2014.7030925
Marwa M. Shalaby, Mohammed Abdel-Megeed Salem, A. Khamis, F. Melgani
Emerging assistive technologies, such as assistive domotics and socially assistive robots have considerable potential for enhancing the lives of many elderly and physically challenged people throughout the world. Blind and visually impaired people can use these technologies for many tasks recognizing objects, handling various household duties, navigation in indoor and outdoor environments. Door detection is one of the important issues in indoor navigation. This paper presents a novel vision-based door detection technique. It is based on the geometric properties of the 4-side polygon. The efficacy of the proposed method is tested using large database of images with different levels of complexity. The experimental results show the robustness of the proposed method against changes in colors, sizes, shapes, orientations, and textures of the door. Detection rate of 83% with relatively low false positive rate for simple images is achieved. This proposed algorithm is suitable for real-time, portable applications where it only requires one digital camera and low computational resources.
{"title":"Geometric model for vision-based door detection","authors":"Marwa M. Shalaby, Mohammed Abdel-Megeed Salem, A. Khamis, F. Melgani","doi":"10.1109/ICCES.2014.7030925","DOIUrl":"https://doi.org/10.1109/ICCES.2014.7030925","url":null,"abstract":"Emerging assistive technologies, such as assistive domotics and socially assistive robots have considerable potential for enhancing the lives of many elderly and physically challenged people throughout the world. Blind and visually impaired people can use these technologies for many tasks recognizing objects, handling various household duties, navigation in indoor and outdoor environments. Door detection is one of the important issues in indoor navigation. This paper presents a novel vision-based door detection technique. It is based on the geometric properties of the 4-side polygon. The efficacy of the proposed method is tested using large database of images with different levels of complexity. The experimental results show the robustness of the proposed method against changes in colors, sizes, shapes, orientations, and textures of the door. Detection rate of 83% with relatively low false positive rate for simple images is achieved. This proposed algorithm is suitable for real-time, portable applications where it only requires one digital camera and low computational resources.","PeriodicalId":339697,"journal":{"name":"2014 9th International Conference on Computer Engineering & Systems (ICCES)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128156374","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}
Pub Date : 2014-12-01DOI: 10.1109/ICCES.2014.7030935
Tamás Matuszka, A. Kiss
Several Geographic Information Systems have become available nowadays. As a result, the most widely used, different types of databases (relational, semantic, NoSQL) allow efficient management of spatial data types. These spatial functions are also required by Augmented Reality browsers in order to handle Points of Interest that have some spatial attributes. In the past few years, some studies on database evaluation and benchmarking applications have been published. However, we have not found one that would be optimized for the case of Augmented Reality browsers. In this paper, a benchmarking tool and the evaluation of spatial properties of the most popular relational and semantic databases is presented.
{"title":"Experimental evaluation of some geodata management systems","authors":"Tamás Matuszka, A. Kiss","doi":"10.1109/ICCES.2014.7030935","DOIUrl":"https://doi.org/10.1109/ICCES.2014.7030935","url":null,"abstract":"Several Geographic Information Systems have become available nowadays. As a result, the most widely used, different types of databases (relational, semantic, NoSQL) allow efficient management of spatial data types. These spatial functions are also required by Augmented Reality browsers in order to handle Points of Interest that have some spatial attributes. In the past few years, some studies on database evaluation and benchmarking applications have been published. However, we have not found one that would be optimized for the case of Augmented Reality browsers. In this paper, a benchmarking tool and the evaluation of spatial properties of the most popular relational and semantic databases is presented.","PeriodicalId":339697,"journal":{"name":"2014 9th International Conference on Computer Engineering & Systems (ICCES)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121721217","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}
Pub Date : 2014-12-01DOI: 10.1109/ICCES.2014.7030979
Karim M. Ibrahim, Mario Hano, Gena George, Mary Fawzy, Gihan Nagib
Mobile communications is one of the fastest growing fields, with new technologies developed continuously to improve the quality by increasing the data rate and adding more services like video broadcasting and multi-media services. One of the newest technologies is the Long Term Evolution (LTE). Building a new LTE network passes through a number of phases, one of the most important phases is the planning phase which helps determining the number of sites and the coverage area of each site. This process consists of two procedures; the coverage and the capacity for both the uplink and the downlink. This paper indicates how using computer software can make this process be executed with high accuracy and results are displayed using tables and a map interface to display the sites as detailed at the end of the paper. This paper also includes an analysis of the effect of different parameters on the planning process.
{"title":"LTE dimensioning tool using C#","authors":"Karim M. Ibrahim, Mario Hano, Gena George, Mary Fawzy, Gihan Nagib","doi":"10.1109/ICCES.2014.7030979","DOIUrl":"https://doi.org/10.1109/ICCES.2014.7030979","url":null,"abstract":"Mobile communications is one of the fastest growing fields, with new technologies developed continuously to improve the quality by increasing the data rate and adding more services like video broadcasting and multi-media services. One of the newest technologies is the Long Term Evolution (LTE). Building a new LTE network passes through a number of phases, one of the most important phases is the planning phase which helps determining the number of sites and the coverage area of each site. This process consists of two procedures; the coverage and the capacity for both the uplink and the downlink. This paper indicates how using computer software can make this process be executed with high accuracy and results are displayed using tables and a map interface to display the sites as detailed at the end of the paper. This paper also includes an analysis of the effect of different parameters on the planning process.","PeriodicalId":339697,"journal":{"name":"2014 9th International Conference on Computer Engineering & Systems (ICCES)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134240513","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}
Pub Date : 2014-12-01DOI: 10.1109/ICCES.2014.7030956
Hanaa Ismail Elshazly, A. Elkorany, A. Hassanien
In this paper, a Genetic algorithm (GA) based supporting vector machine classifier (GA-SVM) is proposed for lymph diseases diagnosis. In the first stage, dimension of lymph diseases dataset that has 18 features is reduced to six features using GA. In the second stage, a support vector machine with different kernel functions including linear, Quadratic and Gaussian was utilized as a classifier. The Lymphography database was obtained from the University Medical Center, Institute of Oncology, Ljubljana, Yugoslavia. The obtained classification accuracy was very promising with regard to the other classification applications in the literature for this problem. The performance of SVM classifier with each kernel function was evaluated by using performance indices such as accuracy, sensitivity, specificity, area under curve (AUC) or (ROC), Matthews Correlation Coefficient (MCC) and F-Measure. Linear kernel function obtained highest results which verifies the efficiency of GA-linear stategy.
{"title":"Lymph diseases diagnosis approach based on support vector machines with different kernel functions","authors":"Hanaa Ismail Elshazly, A. Elkorany, A. Hassanien","doi":"10.1109/ICCES.2014.7030956","DOIUrl":"https://doi.org/10.1109/ICCES.2014.7030956","url":null,"abstract":"In this paper, a Genetic algorithm (GA) based supporting vector machine classifier (GA-SVM) is proposed for lymph diseases diagnosis. In the first stage, dimension of lymph diseases dataset that has 18 features is reduced to six features using GA. In the second stage, a support vector machine with different kernel functions including linear, Quadratic and Gaussian was utilized as a classifier. The Lymphography database was obtained from the University Medical Center, Institute of Oncology, Ljubljana, Yugoslavia. The obtained classification accuracy was very promising with regard to the other classification applications in the literature for this problem. The performance of SVM classifier with each kernel function was evaluated by using performance indices such as accuracy, sensitivity, specificity, area under curve (AUC) or (ROC), Matthews Correlation Coefficient (MCC) and F-Measure. Linear kernel function obtained highest results which verifies the efficiency of GA-linear stategy.","PeriodicalId":339697,"journal":{"name":"2014 9th International Conference on Computer Engineering & Systems (ICCES)","volume":"237 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130848144","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}
Pub Date : 2014-12-01DOI: 10.1109/ICCES.2014.7030991
S. A. A. Amin, Amr M. T. Ali-Eldin, H. Ali
Context-aware e-Services offer entirely new opportunities for application developers and for end users by gathering context data and offering e-services solutions that are adapted to their context. In this paper, using a scenario, we argue for the need for an e-services framework that supports decision-making during fault management process in electricity distribution networks. Then we discuss the different aspects needed to be covered in such a framework and introduce a high-level view of its functional components. The framework functionality was implemented using web services and an android platform. Our experimental work shows improvement in repairing faults thus reducing the associated costs and accordingly increasing user satisfaction and savings in electric power distribution.
{"title":"A context-aware services framework for task management in electric power distribution networks","authors":"S. A. A. Amin, Amr M. T. Ali-Eldin, H. Ali","doi":"10.1109/ICCES.2014.7030991","DOIUrl":"https://doi.org/10.1109/ICCES.2014.7030991","url":null,"abstract":"Context-aware e-Services offer entirely new opportunities for application developers and for end users by gathering context data and offering e-services solutions that are adapted to their context. In this paper, using a scenario, we argue for the need for an e-services framework that supports decision-making during fault management process in electricity distribution networks. Then we discuss the different aspects needed to be covered in such a framework and introduce a high-level view of its functional components. The framework functionality was implemented using web services and an android platform. Our experimental work shows improvement in repairing faults thus reducing the associated costs and accordingly increasing user satisfaction and savings in electric power distribution.","PeriodicalId":339697,"journal":{"name":"2014 9th International Conference on Computer Engineering & Systems (ICCES)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130930325","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：