Pub Date : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397268
Ahmed E. Abdel Raouf, N. Badr, M. Tolba
Distributed databases have become the most essential technology for recent business organizations. One of the main issues of the distributed database management system (DDBMS) is the distributed database design. The performance and efficiency of a distributed database design largely depend on the fragmentation of global relations. It also depends on the allocation and replication of those fragments to several sites of the network. Earlier approaches suggest vertical fragmentation solutions based on the frequency of the user queries. However, these approaches have the limitation of higher complexity and availability of the frequency of user queries at the initial stage of the database design, iterative binary partitioning in case of n-ary partitioning which will increase the complexity and predetermined threshold value that is used to enhance the results, as well as the problem of more computation. Consequently in this paper, we present a vertical fragmentation, allocation and replication scheme of a distributed database called (VFAR). The proposed scheme partitions the distributed database relations vertically at the initial stage of distributed database design, without the need for the frequency of user queries which are not available at this stage. It also allocates and replicates the resulted fragments to the sites of the distributed database, using manipulates and read operations of each site to each fragment. Experimental results showed that firstly; the proposed scheme reduces the overheads and the complexity of complicated computations of previous vertical partitioning approaches. Secondly, it solves the problem of the frequency of the user queries that are not available at the initial stage. Thirdly, it solves the problem of iterative binary partitioning in the case of n-ary partitioning by generating all fragments of one iteration. Finally, it gets the optimal results without the need to determine a threshold value that is used to enhance the results.
{"title":"An optimized scheme for vertical fragmentation, allocation and replication of a distributed database","authors":"Ahmed E. Abdel Raouf, N. Badr, M. Tolba","doi":"10.1109/INTELCIS.2015.7397268","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397268","url":null,"abstract":"Distributed databases have become the most essential technology for recent business organizations. One of the main issues of the distributed database management system (DDBMS) is the distributed database design. The performance and efficiency of a distributed database design largely depend on the fragmentation of global relations. It also depends on the allocation and replication of those fragments to several sites of the network. Earlier approaches suggest vertical fragmentation solutions based on the frequency of the user queries. However, these approaches have the limitation of higher complexity and availability of the frequency of user queries at the initial stage of the database design, iterative binary partitioning in case of n-ary partitioning which will increase the complexity and predetermined threshold value that is used to enhance the results, as well as the problem of more computation. Consequently in this paper, we present a vertical fragmentation, allocation and replication scheme of a distributed database called (VFAR). The proposed scheme partitions the distributed database relations vertically at the initial stage of distributed database design, without the need for the frequency of user queries which are not available at this stage. It also allocates and replicates the resulted fragments to the sites of the distributed database, using manipulates and read operations of each site to each fragment. Experimental results showed that firstly; the proposed scheme reduces the overheads and the complexity of complicated computations of previous vertical partitioning approaches. Secondly, it solves the problem of the frequency of the user queries that are not available at the initial stage. Thirdly, it solves the problem of iterative binary partitioning in the case of n-ary partitioning by generating all fragments of one iteration. Finally, it gets the optimal results without the need to determine a threshold value that is used to enhance the results.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"44 1","pages":"506-513"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84612180","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 : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397261
Taha M. Mohamed
Breast cancer is one of the most dangerous cancers in the world especially in the Arab countries and Egypt. Due to the large spreading of the disease, automatic recognition systems can help physicians to classify the tumors as benign or malignant. However, performing a lot of pathological analysis consumes time and money. In this paper, we propose an algorithm for decreasing the number of features required to detect the tumor. Two classifiers are chosen to test the classification accuracy; linear and quadratic. The experimental results show that, there are strong correlations between the features in the data set. When using the sequential feature selection algorithm, results show that, discarding more than 50% of the features has no significant loss on classification accuracy when using the quadratic discriminate classifier. Additionally, only four PCA components can be used with the same accuracy as using nine components when being classified by the linear discriminate classifier. Additionally, the outliers in the data set have no notable effect on the classification accuracy. The data set is proved to be homogenous using the k-means clustering algorithm.
{"title":"Efficient breast cancer detection using sequential feature selection techniques","authors":"Taha M. Mohamed","doi":"10.1109/INTELCIS.2015.7397261","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397261","url":null,"abstract":"Breast cancer is one of the most dangerous cancers in the world especially in the Arab countries and Egypt. Due to the large spreading of the disease, automatic recognition systems can help physicians to classify the tumors as benign or malignant. However, performing a lot of pathological analysis consumes time and money. In this paper, we propose an algorithm for decreasing the number of features required to detect the tumor. Two classifiers are chosen to test the classification accuracy; linear and quadratic. The experimental results show that, there are strong correlations between the features in the data set. When using the sequential feature selection algorithm, results show that, discarding more than 50% of the features has no significant loss on classification accuracy when using the quadratic discriminate classifier. Additionally, only four PCA components can be used with the same accuracy as using nine components when being classified by the linear discriminate classifier. Additionally, the outliers in the data set have no notable effect on the classification accuracy. The data set is proved to be homogenous using the k-means clustering algorithm.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"11 1","pages":"458-464"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86139010","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 : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397250
M. Sabry, M. Hashem, T. Nazmy, M. E. Khalifa
DNA cryptography is a new promising direction in cryptography research that emerged with the progress in DNA computing field. Traditional cryptographic systems have long legacy and are built on a strong mathematical and theoretical basis. So, an important perception needs to be developed that the DNA cryptography is not to negate the tradition, but to create a bridge between existing and new technology. The power of DNA computing will strengthen the existing security systems by opening up a new possibility of a hybrid cryptographic system. In our work, we are presenting the DNA-based design and implementation to “Advanced Encryption Standard” [AES]. We built our algorithm with all its specifications (data, algorithms operations and used functions) on DNA basis instead of bits. This aims at proving the possibility of building such a complex system on DNA basis in a way of making it a suitable candidate for implementation in biological environment or on DNA computers. Our algorithm kept the same security strength and robustness of the standard algorithm.
{"title":"Design of DNA-based Advanced Encryption Standard (AES)","authors":"M. Sabry, M. Hashem, T. Nazmy, M. E. Khalifa","doi":"10.1109/INTELCIS.2015.7397250","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397250","url":null,"abstract":"DNA cryptography is a new promising direction in cryptography research that emerged with the progress in DNA computing field. Traditional cryptographic systems have long legacy and are built on a strong mathematical and theoretical basis. So, an important perception needs to be developed that the DNA cryptography is not to negate the tradition, but to create a bridge between existing and new technology. The power of DNA computing will strengthen the existing security systems by opening up a new possibility of a hybrid cryptographic system. In our work, we are presenting the DNA-based design and implementation to “Advanced Encryption Standard” [AES]. We built our algorithm with all its specifications (data, algorithms operations and used functions) on DNA basis instead of bits. This aims at proving the possibility of building such a complex system on DNA basis in a way of making it a suitable candidate for implementation in biological environment or on DNA computers. Our algorithm kept the same security strength and robustness of the standard algorithm.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"6 1","pages":"390-397"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83723536","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 : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397278
Mohamed Dahi, N. Semary, M. Hadhoud
Due to the several forms of different Arabic font types, Arabic character recognition is still a challenge. Most literature works consider only one font per text what results in low recognition accuracy. This paper tends to enhance the accuracy of AOCR (Arabic Optical Character Recognition) by considering an automatic Optical Font Recognition (OFR) stage before going ahead with the traditional OCR stages. This has been achieved using SIFT (Scale Invariant Feature Transform) descriptors. First, a comparative study of four most recent algorithms of primitive OCR has been performed to evaluate the different features and classifiers utilized in their systems. Accordingly, a combining of statistical features have been proposed as well as selecting Random Forest Tree classifier for classification stage. The combination of the features are used to train the classifiers. As a result, each recognized text font is directed to a specific classifier tree. The proposed system was tested on a generated Primitive Arabic Characters Noise Free dataset (PAC-NF) containing 30000 samples. Experimental results achieved a promising character recognition accuracy of 99.8-100%.
{"title":"Primitive printed Arabic Optical Character Recognition using statistical features","authors":"Mohamed Dahi, N. Semary, M. Hadhoud","doi":"10.1109/INTELCIS.2015.7397278","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397278","url":null,"abstract":"Due to the several forms of different Arabic font types, Arabic character recognition is still a challenge. Most literature works consider only one font per text what results in low recognition accuracy. This paper tends to enhance the accuracy of AOCR (Arabic Optical Character Recognition) by considering an automatic Optical Font Recognition (OFR) stage before going ahead with the traditional OCR stages. This has been achieved using SIFT (Scale Invariant Feature Transform) descriptors. First, a comparative study of four most recent algorithms of primitive OCR has been performed to evaluate the different features and classifiers utilized in their systems. Accordingly, a combining of statistical features have been proposed as well as selecting Random Forest Tree classifier for classification stage. The combination of the features are used to train the classifiers. As a result, each recognized text font is directed to a specific classifier tree. The proposed system was tested on a generated Primitive Arabic Characters Noise Free dataset (PAC-NF) containing 30000 samples. Experimental results achieved a promising character recognition accuracy of 99.8-100%.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"1 1","pages":"567-571"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88595271","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 : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397254
Jing-pei Wang, Liu Jie, Shengming Yang, Li Dan
Security vulnerabilities in industrial control systems (ICS) and its open interconnected trends lead to security risks escalating. The existed security protection technologies, with poor applicability, are hard to meet the special need of information security for ICS. In this paper, trusted protection theories and technologies for ICS were studied and an integrated trusted protection model was proposed. The proposed method protected data and system security of ICS from aspects of trusted computing platform, trusted data protection mechanism and trust management network. The trusted protection technologies were deployed on each of the three network layers of ICS according to differentiated resource and security requirements of each layer. Analysis and simulation results indicate the effectiveness and superiority of the proposed method. The establishing of trusted protection model assists realizing the systematic security protection for heterogeneous industrial control systems.
{"title":"Integrated trusted protection technologies for industrial control systems","authors":"Jing-pei Wang, Liu Jie, Shengming Yang, Li Dan","doi":"10.1109/INTELCIS.2015.7397254","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397254","url":null,"abstract":"Security vulnerabilities in industrial control systems (ICS) and its open interconnected trends lead to security risks escalating. The existed security protection technologies, with poor applicability, are hard to meet the special need of information security for ICS. In this paper, trusted protection theories and technologies for ICS were studied and an integrated trusted protection model was proposed. The proposed method protected data and system security of ICS from aspects of trusted computing platform, trusted data protection mechanism and trust management network. The trusted protection technologies were deployed on each of the three network layers of ICS according to differentiated resource and security requirements of each layer. Analysis and simulation results indicate the effectiveness and superiority of the proposed method. The establishing of trusted protection model assists realizing the systematic security protection for heterogeneous industrial control systems.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"26 1","pages":"418-423"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90462971","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 : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397288
K. Shahzad, Steve Woodhead
Fast spreading network worms continue to pose a threat to the Internet due to their virulence, speed and the continuous discovery of wormable vulnerabilities. Mathematical models for worm propagation can help us to understand the epidemiology of worm outbreaks and to devise effective defense mechanisms. In this paper, we report the epidemiological modeling and analysis of worm propagation and a distributed worm detection and prevention countermeasure. The work is based on the Slammer and Witty worm characteristics and employs the widely used Susceptible-Infected biological model. The epidemiological modeling shows that the SI model can be used to represent the virulence of random scanning worms and to quantify the effectiveness of worm countermeasures.
{"title":"Epidemiological modeling of network worm infections and countermeasures","authors":"K. Shahzad, Steve Woodhead","doi":"10.1109/INTELCIS.2015.7397288","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397288","url":null,"abstract":"Fast spreading network worms continue to pose a threat to the Internet due to their virulence, speed and the continuous discovery of wormable vulnerabilities. Mathematical models for worm propagation can help us to understand the epidemiology of worm outbreaks and to devise effective defense mechanisms. In this paper, we report the epidemiological modeling and analysis of worm propagation and a distributed worm detection and prevention countermeasure. The work is based on the Slammer and Witty worm characteristics and employs the widely used Susceptible-Infected biological model. The epidemiological modeling shows that the SI model can be used to represent the virulence of random scanning worms and to quantify the effectiveness of worm countermeasures.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"22 1","pages":"628-633"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81918426","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 : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397264
M. El-Gayyar, Amira Ibrahim, Ahmed Sallam
Despite the efforts of many organizations and governments, deaf people still forming a closed community isolated from the public society. The only way to communicate in a deaf community is the use of Sign Language. In fact, for deaf individuals, Sign Language is the main communication barrier with hearing people; either one side needs to learn the language of the other or they have to depend on a third-party interpreter. With technological advances, there have been many attempts to build a feasible bridge to connect deaf communities with the public. However, most of the developed techniques are complex and need special and expensive equipment which is not affordable for deaf people, especially in Arabic countries where deaf represents a significant proportion of the population mostly of medium and poor classes. Fortunately, mobile devices reached all hands recently creating a good opportunity to build a simple viable solution. Thus, we have developed an Android mobile application to support the Arabic Sign Language. Inspired by Chinese keyboards, we have embedded the language signs as a font to build a user-friendly keyboard. It helps a deaf person to construct Arabic Sign Language sentences and to ask the application to convert them into standard Arabic text or speech. Moreover, the application works the other way around and translates from standard Arabic to Arabic Sign Language forming a simple mechanism for seamless communications between hearing and deaf people. Finally, we have tested our solution with a number of volunteers from deaf and hearing communities and the results were promising.
{"title":"The ArSL keyboard for android","authors":"M. El-Gayyar, Amira Ibrahim, Ahmed Sallam","doi":"10.1109/INTELCIS.2015.7397264","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397264","url":null,"abstract":"Despite the efforts of many organizations and governments, deaf people still forming a closed community isolated from the public society. The only way to communicate in a deaf community is the use of Sign Language. In fact, for deaf individuals, Sign Language is the main communication barrier with hearing people; either one side needs to learn the language of the other or they have to depend on a third-party interpreter. With technological advances, there have been many attempts to build a feasible bridge to connect deaf communities with the public. However, most of the developed techniques are complex and need special and expensive equipment which is not affordable for deaf people, especially in Arabic countries where deaf represents a significant proportion of the population mostly of medium and poor classes. Fortunately, mobile devices reached all hands recently creating a good opportunity to build a simple viable solution. Thus, we have developed an Android mobile application to support the Arabic Sign Language. Inspired by Chinese keyboards, we have embedded the language signs as a font to build a user-friendly keyboard. It helps a deaf person to construct Arabic Sign Language sentences and to ask the application to convert them into standard Arabic text or speech. Moreover, the application works the other way around and translates from standard Arabic to Arabic Sign Language forming a simple mechanism for seamless communications between hearing and deaf people. Finally, we have tested our solution with a number of volunteers from deaf and hearing communities and the results were promising.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"11 1","pages":"481-486"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81392221","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 : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397220
E. Khater, A. Hegazy, M. E. Shehab
Adaptive e-learning is concerning about students' skills and preferences. A few researches concerning about adaptive examination systems. Ontologies can be used in e-learning systems to organize and describe knowledge and to support content management. Combining ontology with CAT systems helps to control the exam content regarding content semantics. This paper propose an ontology based adaptive Comparing system's results with IRT results -The CAT major model- provide an exact information about how far the system is reliable regarding the IRT.
{"title":"Comparing ontology-based and Item response theory in computer adaptive test","authors":"E. Khater, A. Hegazy, M. E. Shehab","doi":"10.1109/INTELCIS.2015.7397220","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397220","url":null,"abstract":"Adaptive e-learning is concerning about students' skills and preferences. A few researches concerning about adaptive examination systems. Ontologies can be used in e-learning systems to organize and describe knowledge and to support content management. Combining ontology with CAT systems helps to control the exam content regarding content semantics. This paper propose an ontology based adaptive Comparing system's results with IRT results -The CAT major model- provide an exact information about how far the system is reliable regarding the IRT.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"84 1","pages":"187-195"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83877123","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 : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397248
Yu Zhang, Jingzhao Yang, S. Chen, J. Chen
This paper studies the problem of planning collision-free dynamically feasible trajectories for a team of autonomous unmanned aerial vehicles (UAVs) in real-time, where the UAVs try to fly through a complex 3-D environment to reach their specified destinations. First, the cooperative trajectory planning problem is mathematically formulated as a decentralized receding horizon optimal control problem (DRH-OCP). Second, a decentralized coordination strategy for multi-vehicle real-time trajectory planning is designed by effectively combining the benefits of inverse dynamics optimization method and receding horizon optimal control technique. This coordination strategy mainly features that each vehicle only solves a sub-problem for its own plan and vehicles in the team make plans in parallel. Finally, simulation results show the feasibility of the proposed planning strategies.
{"title":"Decentralized cooperative trajectory planning for multiple UAVs in dynamic and uncertain environments","authors":"Yu Zhang, Jingzhao Yang, S. Chen, J. Chen","doi":"10.1109/INTELCIS.2015.7397248","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397248","url":null,"abstract":"This paper studies the problem of planning collision-free dynamically feasible trajectories for a team of autonomous unmanned aerial vehicles (UAVs) in real-time, where the UAVs try to fly through a complex 3-D environment to reach their specified destinations. First, the cooperative trajectory planning problem is mathematically formulated as a decentralized receding horizon optimal control problem (DRH-OCP). Second, a decentralized coordination strategy for multi-vehicle real-time trajectory planning is designed by effectively combining the benefits of inverse dynamics optimization method and receding horizon optimal control technique. This coordination strategy mainly features that each vehicle only solves a sub-problem for its own plan and vehicles in the team make plans in parallel. Finally, simulation results show the feasibility of the proposed planning strategies.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"4 1","pages":"377-382"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89422772","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 : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397216
G. Sammour, A. Al-Zoubi, A. Gladun, K. Khala, Jeanne Schreurs
A massive open online course (MOOC) is a model for delivering learning content online to any person who wants to take a course, with no conditions on attendance. Unlike traditional courses, MOOCs require additional skills, provided by videographers, instructional designers, IT specialists and platform specialists. Over the past few years several Universities facilitated partnership with MOOCs providers and are building MOOC courses, to serve as e-learning versions of their courses. Despite all the advantages offered by the MOOC courses, the current statistics show that only a very limited number of registered learners are completing the course. And the vast majority are stopping learning at an early stage. The main reason can be found in the lack of motivation of the students to pass the exams to become a certificate, because universities do not accept the certificates for credits. The aim of this paper is to study the readiness of students to take MOOC courses on one hand and the acceptance of MOOC courses in Universities. A study is conducted on two Universities, Hasselt University, Belgium and Princess Sumaya University for Technology, Jordan. The results of the study are promising, as they suggest that such virtual study programs are accepted in both Universities. However, professors in both Universities elucidate concerns on accepting the equivalence of the MOOC courses to their own courses.
{"title":"MOOCs in universities: Intelligent model for delivering online learning content","authors":"G. Sammour, A. Al-Zoubi, A. Gladun, K. Khala, Jeanne Schreurs","doi":"10.1109/INTELCIS.2015.7397216","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397216","url":null,"abstract":"A massive open online course (MOOC) is a model for delivering learning content online to any person who wants to take a course, with no conditions on attendance. Unlike traditional courses, MOOCs require additional skills, provided by videographers, instructional designers, IT specialists and platform specialists. Over the past few years several Universities facilitated partnership with MOOCs providers and are building MOOC courses, to serve as e-learning versions of their courses. Despite all the advantages offered by the MOOC courses, the current statistics show that only a very limited number of registered learners are completing the course. And the vast majority are stopping learning at an early stage. The main reason can be found in the lack of motivation of the students to pass the exams to become a certificate, because universities do not accept the certificates for credits. The aim of this paper is to study the readiness of students to take MOOC courses on one hand and the acceptance of MOOC courses in Universities. A study is conducted on two Universities, Hasselt University, Belgium and Princess Sumaya University for Technology, Jordan. The results of the study are promising, as they suggest that such virtual study programs are accepted in both Universities. However, professors in both Universities elucidate concerns on accepting the equivalence of the MOOC courses to their own courses.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"118 1","pages":"167-171"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79395708","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
扫码关注我们
求助内容：
应助结果提醒方式：