Pub Date : 2016-04-05DOI: 10.1109/IACS.2016.7476112
M. Khodeir, Sari Khatalin
In this study, approximate symbol probability of error (i.e., symbol error rate) formulas are derived for both of the M-ary phase shift keying and M-ary quadrature amplitude modulation constellations schemes. These formulas are obtained over slow, flat, and independent and identically distributed Nakagami-m fading channels, where the orthogonal space-time block codes is utilized. This approach reduces the complexity and instability of using integrals or hyper-geometric infinite series forms to evaluate exact symbol error rate formulas. Numerical examples are presented to illustrate the new results.
{"title":"SER approximation for orthogonal STBC over Nakagami-m fading channels","authors":"M. Khodeir, Sari Khatalin","doi":"10.1109/IACS.2016.7476112","DOIUrl":"https://doi.org/10.1109/IACS.2016.7476112","url":null,"abstract":"In this study, approximate symbol probability of error (i.e., symbol error rate) formulas are derived for both of the M-ary phase shift keying and M-ary quadrature amplitude modulation constellations schemes. These formulas are obtained over slow, flat, and independent and identically distributed Nakagami-m fading channels, where the orthogonal space-time block codes is utilized. This approach reduces the complexity and instability of using integrals or hyper-geometric infinite series forms to evaluate exact symbol error rate formulas. Numerical examples are presented to illustrate the new results.","PeriodicalId":6579,"journal":{"name":"2016 7th International Conference on Information and Communication Systems (ICICS)","volume":"87 1 1","pages":"207-212"},"PeriodicalIF":0.0,"publicationDate":"2016-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91119679","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 : 2016-04-05DOI: 10.1109/IACS.2016.7476084
R. Khasawneh, Malek M. Tarawneh
Government agencies are increasingly looking to leverage social media usage to improve governmental services quality and enable greater citizen engagement. Publicly available social media sites such as Facebook and Twitter, which are widely available to governments' employees and citizens with Internet access, provide governments with attractive options for meeting such new objectives. This research explored the literature in this area and tried to develop an instrument to measure citizens' attitudes toward government 2.0 based on four main variables: perceived value of e-government, e government usage intensity, general trust in government, general Internet usage. A random moderate sample of Jordanian citizens was used to test the instrument.
{"title":"Citizens' attitudes towards e-government presence on social networks (e-government 2.0): An empirical study","authors":"R. Khasawneh, Malek M. Tarawneh","doi":"10.1109/IACS.2016.7476084","DOIUrl":"https://doi.org/10.1109/IACS.2016.7476084","url":null,"abstract":"Government agencies are increasingly looking to leverage social media usage to improve governmental services quality and enable greater citizen engagement. Publicly available social media sites such as Facebook and Twitter, which are widely available to governments' employees and citizens with Internet access, provide governments with attractive options for meeting such new objectives. This research explored the literature in this area and tried to develop an instrument to measure citizens' attitudes toward government 2.0 based on four main variables: perceived value of e-government, e government usage intensity, general trust in government, general Internet usage. A random moderate sample of Jordanian citizens was used to test the instrument.","PeriodicalId":6579,"journal":{"name":"2016 7th International Conference on Information and Communication Systems (ICICS)","volume":"151 1","pages":"45-49"},"PeriodicalIF":0.0,"publicationDate":"2016-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86165216","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 : 2016-04-05DOI: 10.1109/IACS.2016.7476078
J. Alsakran, N. Alhindawi, L. Alnemer
The high dimensionality of data presents a major issue in understanding and interpreting the results of classification learning. Among the various approaches that address this issue, parallel coordinates visualization has proven its capabilities to enhance investigation and comprehension of data dimension features especially when the number of dimensions is high and there are numerous output classes. We propose several parallel coordinates metrics, namely entropy, class ordering, and edge crossing, to further facilitate inspection of data features and their relevance to output class. Experiments on real world datasets are presented to show the effectiveness of the proposed approach.
{"title":"Parallel coordinates metrics for classification visualization","authors":"J. Alsakran, N. Alhindawi, L. Alnemer","doi":"10.1109/IACS.2016.7476078","DOIUrl":"https://doi.org/10.1109/IACS.2016.7476078","url":null,"abstract":"The high dimensionality of data presents a major issue in understanding and interpreting the results of classification learning. Among the various approaches that address this issue, parallel coordinates visualization has proven its capabilities to enhance investigation and comprehension of data dimension features especially when the number of dimensions is high and there are numerous output classes. We propose several parallel coordinates metrics, namely entropy, class ordering, and edge crossing, to further facilitate inspection of data features and their relevance to output class. Experiments on real world datasets are presented to show the effectiveness of the proposed approach.","PeriodicalId":6579,"journal":{"name":"2016 7th International Conference on Information and Communication Systems (ICICS)","volume":"1 1","pages":"7-12"},"PeriodicalIF":0.0,"publicationDate":"2016-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73129940","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 : 2016-04-05DOI: 10.1109/IACS.2016.7476107
Khalil Omar, Barbara Rapp, J. Gómez
The emergence of full-screen mobile phones and tablet PCs has motivated ERP vendors to adopt a mobile strategy in order to extend their products' features. Several researchers have pointed out that ERP systems' UIs suffer from poor usability, due to their complex, rigid and bloated UIs, since these systems have to process and integrate a large amount of data. Therefore, accessing ERP systems via mobile devices like fullscreen phones or tablet PCs suffers from UIs usability challenges. Currently, mobile ERP is a young topic in research and practice, there are only few academic papers available about mobile ERP. Particularly, there is a knowledge gap in addressing the usability issues when designing the mobile ERP's UIs and determining a suitable usability evaluation method and criteria which are specific to mobile ERP. This paper aims at narrowing that gap by proposing a set of usability heuristics and a UI design checklist dedicated to evaluate mobile ERP's UIs which can be used by mobile ERP developers.
{"title":"Heuristic evaluation checklist for mobile ERP user interfaces","authors":"Khalil Omar, Barbara Rapp, J. Gómez","doi":"10.1109/IACS.2016.7476107","DOIUrl":"https://doi.org/10.1109/IACS.2016.7476107","url":null,"abstract":"The emergence of full-screen mobile phones and tablet PCs has motivated ERP vendors to adopt a mobile strategy in order to extend their products' features. Several researchers have pointed out that ERP systems' UIs suffer from poor usability, due to their complex, rigid and bloated UIs, since these systems have to process and integrate a large amount of data. Therefore, accessing ERP systems via mobile devices like fullscreen phones or tablet PCs suffers from UIs usability challenges. Currently, mobile ERP is a young topic in research and practice, there are only few academic papers available about mobile ERP. Particularly, there is a knowledge gap in addressing the usability issues when designing the mobile ERP's UIs and determining a suitable usability evaluation method and criteria which are specific to mobile ERP. This paper aims at narrowing that gap by proposing a set of usability heuristics and a UI design checklist dedicated to evaluate mobile ERP's UIs which can be used by mobile ERP developers.","PeriodicalId":6579,"journal":{"name":"2016 7th International Conference on Information and Communication Systems (ICICS)","volume":"29 1","pages":"180-185"},"PeriodicalIF":0.0,"publicationDate":"2016-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78296503","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 : 2016-04-05DOI: 10.1109/IACS.2016.7476092
A. Otoom, Doaa Al-Shdaifat, M. Hammad, E. Abdallah
We target the problem of identifying the severity of a bug report. Our main aim is to develop an intelligent system that is capable of predicting the severity of a newly submitted bug report through a bug tracking system. For this purpose, we build a dataset consisting of 59 features characterizing 163 instances that belong to two classes: severe and non-severe. We combine the proposed feature set with strong classification algorithms to assist in predicting the severity of bugs. Moreover, the proposed algorithms are integrated within a boosting algorithm for an enhanced performance. Our results show that the proposed technique has proved successful with a classification performance accuracy of more than 76% with the AdaBoost algorithm and cross validation test. Moreover, boosting has been effective in enhancing the performance of its base classifiers with improvements of up to 4.9%.
{"title":"Severity prediction of software bugs","authors":"A. Otoom, Doaa Al-Shdaifat, M. Hammad, E. Abdallah","doi":"10.1109/IACS.2016.7476092","DOIUrl":"https://doi.org/10.1109/IACS.2016.7476092","url":null,"abstract":"We target the problem of identifying the severity of a bug report. Our main aim is to develop an intelligent system that is capable of predicting the severity of a newly submitted bug report through a bug tracking system. For this purpose, we build a dataset consisting of 59 features characterizing 163 instances that belong to two classes: severe and non-severe. We combine the proposed feature set with strong classification algorithms to assist in predicting the severity of bugs. Moreover, the proposed algorithms are integrated within a boosting algorithm for an enhanced performance. Our results show that the proposed technique has proved successful with a classification performance accuracy of more than 76% with the AdaBoost algorithm and cross validation test. Moreover, boosting has been effective in enhancing the performance of its base classifiers with improvements of up to 4.9%.","PeriodicalId":6579,"journal":{"name":"2016 7th International Conference on Information and Communication Systems (ICICS)","volume":"PC-22 1","pages":"92-95"},"PeriodicalIF":0.0,"publicationDate":"2016-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84840809","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 : 2016-04-05DOI: 10.1109/IACS.2016.7476101
Erfan Najmi, Zaki Malik, Khayyam Hashmi, A. Rezgui
The exponential growth of information on the Web has prompted the introduction of new technologies such as Semantic Web and Common Sense knowledge bases. While there are different models available to present information, RDF, as the cornerstone of Semantic Web technologies, has a dominant place for formats suitable both for human interactions and machine understanding. In this paper we present ConceptRDF, a conversion of ConceptNet, as one of the largest common sense knowledge bases available for public use, to RDF/XML format, suitable for use in different fields of information retrieval.
{"title":"ConceptRDF: An RDF presentation of ConceptNet knowledge base","authors":"Erfan Najmi, Zaki Malik, Khayyam Hashmi, A. Rezgui","doi":"10.1109/IACS.2016.7476101","DOIUrl":"https://doi.org/10.1109/IACS.2016.7476101","url":null,"abstract":"The exponential growth of information on the Web has prompted the introduction of new technologies such as Semantic Web and Common Sense knowledge bases. While there are different models available to present information, RDF, as the cornerstone of Semantic Web technologies, has a dominant place for formats suitable both for human interactions and machine understanding. In this paper we present ConceptRDF, a conversion of ConceptNet, as one of the largest common sense knowledge bases available for public use, to RDF/XML format, suitable for use in different fields of information retrieval.","PeriodicalId":6579,"journal":{"name":"2016 7th International Conference on Information and Communication Systems (ICICS)","volume":"1 1","pages":"145-150"},"PeriodicalIF":0.0,"publicationDate":"2016-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82755396","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 : 2016-04-05DOI: 10.1109/IACS.2016.7476066
Amjad Nusayr, Ziad Al-Sharif
Denotational semantics is an approach for giving a mathematical meaning to programming languages and systems. It gives the language designers a tool for high level abstract definitions. In aspect oriented programming, advice is weaved in designated locations of an underlying program specified by a pointcut expression. It is the job of the language implementer to specify how weaved code gets to be inserted into the proper location. Current denotational semantics of languages do not have the necessary constructs for accepting this weaved code. In this paper, we preset a denotational semantics formal description that embodies the representation of constructs to be woven by some aspect. It illustrates the a formal description of the mechanism of where and how woven advice is inserted. The semantics presented are intended to be a general baseline for the use of any advice in any random joinpoint.
{"title":"The denotational semantics of a pre-woven language","authors":"Amjad Nusayr, Ziad Al-Sharif","doi":"10.1109/IACS.2016.7476066","DOIUrl":"https://doi.org/10.1109/IACS.2016.7476066","url":null,"abstract":"Denotational semantics is an approach for giving a mathematical meaning to programming languages and systems. It gives the language designers a tool for high level abstract definitions. In aspect oriented programming, advice is weaved in designated locations of an underlying program specified by a pointcut expression. It is the job of the language implementer to specify how weaved code gets to be inserted into the proper location. Current denotational semantics of languages do not have the necessary constructs for accepting this weaved code. In this paper, we preset a denotational semantics formal description that embodies the representation of constructs to be woven by some aspect. It illustrates the a formal description of the mechanism of where and how woven advice is inserted. The semantics presented are intended to be a general baseline for the use of any advice in any random joinpoint.","PeriodicalId":6579,"journal":{"name":"2016 7th International Conference on Information and Communication Systems (ICICS)","volume":"51 1","pages":"286-291"},"PeriodicalIF":0.0,"publicationDate":"2016-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76679027","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 : 2016-04-05DOI: 10.1109/IACS.2016.7476081
Khayyam Hashmi, Hussain AlJafar, Zaki Malik, Amal Alhosban
Business process automation using software as a service is well accepted software deployment and distribution model that is grown exponentially in the last few years. SaaS can provide solutions that are suitable for both one off as well as long running systems. Multiple component services are combined to formulate a composite solution. This modular nature of the systems allows the flexibility to replace faulty services or introduce better performing components into the initial solution. On the other hand it makes it easier to deal with situations where a long running system may need to deal with a service which is no longer available or has a competitor which offers similar to better service as a much more attractive package. To fully utilize this nature of the software we need to understand the structure of the system. In this paper we present a bat algorithm based solution for different Quality of Service parameters of a component service considering the different invocation patterns of these component services in the system for optimum values of the QoS parameters. We evaluate the efficiency of our proposed technique on WSDream-QoSDataset [20] and show its effectiveness.
{"title":"A bat algorithm based approach of QoS optimization for long term business pattern","authors":"Khayyam Hashmi, Hussain AlJafar, Zaki Malik, Amal Alhosban","doi":"10.1109/IACS.2016.7476081","DOIUrl":"https://doi.org/10.1109/IACS.2016.7476081","url":null,"abstract":"Business process automation using software as a service is well accepted software deployment and distribution model that is grown exponentially in the last few years. SaaS can provide solutions that are suitable for both one off as well as long running systems. Multiple component services are combined to formulate a composite solution. This modular nature of the systems allows the flexibility to replace faulty services or introduce better performing components into the initial solution. On the other hand it makes it easier to deal with situations where a long running system may need to deal with a service which is no longer available or has a competitor which offers similar to better service as a much more attractive package. To fully utilize this nature of the software we need to understand the structure of the system. In this paper we present a bat algorithm based solution for different Quality of Service parameters of a component service considering the different invocation patterns of these component services in the system for optimum values of the QoS parameters. We evaluate the efficiency of our proposed technique on WSDream-QoSDataset [20] and show its effectiveness.","PeriodicalId":6579,"journal":{"name":"2016 7th International Conference on Information and Communication Systems (ICICS)","volume":"37 1","pages":"27-32"},"PeriodicalIF":0.0,"publicationDate":"2016-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76458654","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 : 2016-04-05DOI: 10.1109/IACS.2016.7476087
Issa M. Khalil, I. Hababeh, Abdallah Khreishah
Cloud computing services are becoming more and more popular. However, the high concentration of data and services on the clouds make them attractive targets for various security attacks, including DoS, data theft, and privacy attacks. Additionally, cloud providers may fail to comply with service level agreement in terms of performance, availability, and security guarantees. Therefore, it is of paramount importance to have secure and efficient mechanisms that enable users to transparently copy and move their data from one provider to another. In this paper, we explore the state-of-the-art inter-cloud migration techniques and identify the potential security threats in the scope of Hadoop Distributed File System HDFS. We propose an inter-cloud data migration mechanism that offers better security guarantees and faster response time for migrating large scale data files in cloud database management systems. The performance of the proposed approach is validated by measuring its impact on response time and throughput, and comparing the performance to that of other techniques in the literature. The results show that our approach significantly improves the performance of HDFS and outperforms its counterparts.
{"title":"Secure inter cloud data migration","authors":"Issa M. Khalil, I. Hababeh, Abdallah Khreishah","doi":"10.1109/IACS.2016.7476087","DOIUrl":"https://doi.org/10.1109/IACS.2016.7476087","url":null,"abstract":"Cloud computing services are becoming more and more popular. However, the high concentration of data and services on the clouds make them attractive targets for various security attacks, including DoS, data theft, and privacy attacks. Additionally, cloud providers may fail to comply with service level agreement in terms of performance, availability, and security guarantees. Therefore, it is of paramount importance to have secure and efficient mechanisms that enable users to transparently copy and move their data from one provider to another. In this paper, we explore the state-of-the-art inter-cloud migration techniques and identify the potential security threats in the scope of Hadoop Distributed File System HDFS. We propose an inter-cloud data migration mechanism that offers better security guarantees and faster response time for migrating large scale data files in cloud database management systems. The performance of the proposed approach is validated by measuring its impact on response time and throughput, and comparing the performance to that of other techniques in the literature. The results show that our approach significantly improves the performance of HDFS and outperforms its counterparts.","PeriodicalId":6579,"journal":{"name":"2016 7th International Conference on Information and Communication Systems (ICICS)","volume":"31 1","pages":"62-67"},"PeriodicalIF":0.0,"publicationDate":"2016-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75803692","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 : 2016-04-05DOI: 10.1109/IACS.2016.7476110
M. Esmail, H. Fathallah
Interest in free space optics (FSO) increases day-to-day as a solution for the last mile bottleneck. The FSO link reliability is in principle sufficiently high except in severe weather conditions such as fog, dust, rain, etc. In effect, fog is until now considered as a primary challenge for FSO system because this may cause attenuation up to 480 dB/km. Fog attenuation prediction was determined by Kruse formula for long time ago. However, this formula underestimates the fog attenuation. In this paper, we improve the wavelength independent model proposed in literature for fog attenuation prediction. We determine the optimum values of the parameter k using some field measurements reported in literature. The improved model is compared and evaluated with Kruse model and others reported in literature using root mean square error (RMSE) measure. The results show good performance for the proposed model with 5 dB average RMSE lower than the lowest average RMSE achieved by other models.
{"title":"Improved wavelength independent empirical model for Fog attenuation in FSO communication systems","authors":"M. Esmail, H. Fathallah","doi":"10.1109/IACS.2016.7476110","DOIUrl":"https://doi.org/10.1109/IACS.2016.7476110","url":null,"abstract":"Interest in free space optics (FSO) increases day-to-day as a solution for the last mile bottleneck. The FSO link reliability is in principle sufficiently high except in severe weather conditions such as fog, dust, rain, etc. In effect, fog is until now considered as a primary challenge for FSO system because this may cause attenuation up to 480 dB/km. Fog attenuation prediction was determined by Kruse formula for long time ago. However, this formula underestimates the fog attenuation. In this paper, we improve the wavelength independent model proposed in literature for fog attenuation prediction. We determine the optimum values of the parameter k using some field measurements reported in literature. The improved model is compared and evaluated with Kruse model and others reported in literature using root mean square error (RMSE) measure. The results show good performance for the proposed model with 5 dB average RMSE lower than the lowest average RMSE achieved by other models.","PeriodicalId":6579,"journal":{"name":"2016 7th International Conference on Information and Communication Systems (ICICS)","volume":"234 1","pages":"196-200"},"PeriodicalIF":0.0,"publicationDate":"2016-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77640509","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
扫码关注我们
求助内容：
应助结果提醒方式：