Pub Date : 2012-11-01DOI: 10.1109/ISDA.2012.6416560
Dhanya Oommen, C. Pradeep
Multiprocessor System-On-Chips (MPSoCs) is an emerging technology. They provide support to the design complexity of embedded systems. MPSoCs will combine several types of processor cores and data memory units of widely different sizes, leading to a very heterogeneous architecture. As the feature size is continuously decreasing and integration density is increasing, interconnections have become a dominating factor in determining the overall quality of a chip. Network on Chip (NoC) is a new paradigm to make the interconnections inside a System on Chip (SoC) system. In traditional solutions interconnections are realized using a bus structure. Due to the limited scalability of system bus, it cannot meet the requirement of current System-on-Chip (SoC) implementations. Bus starts to be narrow and in the worst case it begins to block traffic. In NoC technology the bus structure is replaced with a network which is similar to the Internet. Nowadays NoCs are a well established research topic and several implementations have been proposed. Some techniques are proposed to improve NoC performance in terms of latency and throughput while others are proposed to improve area utilization and power consumption. An important research in NoC design is the trade off between area/power and performance. In order to improve performance some techniques tend to increase the number of buffers, this method increases area and power consumption. This paper introduces new router architecture called the Reconfigurable router, which improves the performance of the overall network using the same amount of available buffers but in more efficient way. Therefore there is no need to increase the size of which cause high power consumption, area overheads, and complex logic.
{"title":"Reconfigurable router using RLBS algorithm","authors":"Dhanya Oommen, C. Pradeep","doi":"10.1109/ISDA.2012.6416560","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416560","url":null,"abstract":"Multiprocessor System-On-Chips (MPSoCs) is an emerging technology. They provide support to the design complexity of embedded systems. MPSoCs will combine several types of processor cores and data memory units of widely different sizes, leading to a very heterogeneous architecture. As the feature size is continuously decreasing and integration density is increasing, interconnections have become a dominating factor in determining the overall quality of a chip. Network on Chip (NoC) is a new paradigm to make the interconnections inside a System on Chip (SoC) system. In traditional solutions interconnections are realized using a bus structure. Due to the limited scalability of system bus, it cannot meet the requirement of current System-on-Chip (SoC) implementations. Bus starts to be narrow and in the worst case it begins to block traffic. In NoC technology the bus structure is replaced with a network which is similar to the Internet. Nowadays NoCs are a well established research topic and several implementations have been proposed. Some techniques are proposed to improve NoC performance in terms of latency and throughput while others are proposed to improve area utilization and power consumption. An important research in NoC design is the trade off between area/power and performance. In order to improve performance some techniques tend to increase the number of buffers, this method increases area and power consumption. This paper introduces new router architecture called the Reconfigurable router, which improves the performance of the overall network using the same amount of available buffers but in more efficient way. Therefore there is no need to increase the size of which cause high power consumption, area overheads, and complex logic.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"14 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132728486","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 : 2012-11-01DOI: 10.1109/ISDA.2012.6416554
C. Faria, R. Girardi, P. Novais
This article proposes a process for automatic population of ontologies from text that applies natural language processing and information extraction techniques to acquire and classify ontology instances. The work is part of HERMES, an FCT/CAPES research project looking for techniques and tools for automating the process of ontology learning and population. Two experiments using a legal and a tourism corpora were conducted in order to evaluate it. The results indicate that our approach can extract and classify instances with high effectiveness with the additional advantage of domain independence.
{"title":"Using domain specific generated rules for automatic ontology population","authors":"C. Faria, R. Girardi, P. Novais","doi":"10.1109/ISDA.2012.6416554","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416554","url":null,"abstract":"This article proposes a process for automatic population of ontologies from text that applies natural language processing and information extraction techniques to acquire and classify ontology instances. The work is part of HERMES, an FCT/CAPES research project looking for techniques and tools for automating the process of ontology learning and population. Two experiments using a legal and a tourism corpora were conducted in order to evaluate it. The results indicate that our approach can extract and classify instances with high effectiveness with the additional advantage of domain independence.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133682562","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 : 2012-11-01DOI: 10.1109/ISDA.2012.6416506
Oleg Umanskiy, R. Boyd, V. Pugachev, L. Hagen, V. Yakhnis, B. Stilman
This paper describes LG-PACKAGE, a set of the Linguistic Geometry (LG) tools. LG is a type of game theory that is scalable to the level of the real world defense systems. The LG applications generate best strategies for all sides in a conflict in real time. We consider the main advanced features of the versions of LG-PACKAGE released gradually from 2004 through 2012. These releases converted LG-PACKAGE into the software of industrial strength applicable to the wide range of defense systems. The US and British defense agencies and the world major defense contractors utilize these tools.
{"title":"Industrial applications of Linguistic Geometry","authors":"Oleg Umanskiy, R. Boyd, V. Pugachev, L. Hagen, V. Yakhnis, B. Stilman","doi":"10.1109/ISDA.2012.6416506","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416506","url":null,"abstract":"This paper describes LG-PACKAGE, a set of the Linguistic Geometry (LG) tools. LG is a type of game theory that is scalable to the level of the real world defense systems. The LG applications generate best strategies for all sides in a conflict in real time. We consider the main advanced features of the versions of LG-PACKAGE released gradually from 2004 through 2012. These releases converted LG-PACKAGE into the software of industrial strength applicable to the wide range of defense systems. The US and British defense agencies and the world major defense contractors utilize these tools.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130362016","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 : 2012-11-01DOI: 10.1109/ISDA.2012.6416512
Mohammad Farukh Hashmi, A. Keskar
A reliable traffic flow monitoring and traffic analysis approach using computer vision techniques has been proposed in this paper. The exponential increase in traffic density at urban intersections in the past few decades has raised precious and challenging demands to computer vision algorithms and technological solutions. The focus of this paper is to suggest a statistical based approach to determine the traffic parameters at heavily crowded urban intersections. The algorithm in addition to accurate tracking and counting of freeway traffic also offers high efficiency for determining vehicle count at a high traffic density T-intersection. The system uses Intel Open CV library for image processing. The implementation of algorithm is done using C++. The real time video sequence is obtained from a stationary camera placed atop a high building overlooking the particular T intersection. This paper suggests a dynamic method where each vehicle at a T intersection is passed through a number of detection zones and the final count of vehicles is derived from a statistical equation.
本文提出了一种基于计算机视觉技术的可靠的交通流监测和交通分析方法。在过去的几十年里，城市十字路口的交通密度呈指数级增长，对计算机视觉算法和技术解决方案提出了宝贵而具有挑战性的要求。本文的重点是提出一种基于统计的方法来确定拥挤的城市十字路口的交通参数。该算法除了对高速公路交通进行准确的跟踪和计数外，还为高交通密度的t型交叉口车辆数量的确定提供了高效率。系统采用Intel Open CV库进行图像处理。算法是用c++语言实现的。实时视频序列是由一个固定的摄像机获得的，摄像机放置在俯瞰特定T路口的高层建筑上。本文提出了一种动态方法，其中每辆车辆在T型交叉口通过多个检测区域，并由统计方程推导出最终的车辆数量。
{"title":"Analysis and monitoring of a high density traffic flow at T-intersection using statistical computer vision based approach","authors":"Mohammad Farukh Hashmi, A. Keskar","doi":"10.1109/ISDA.2012.6416512","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416512","url":null,"abstract":"A reliable traffic flow monitoring and traffic analysis approach using computer vision techniques has been proposed in this paper. The exponential increase in traffic density at urban intersections in the past few decades has raised precious and challenging demands to computer vision algorithms and technological solutions. The focus of this paper is to suggest a statistical based approach to determine the traffic parameters at heavily crowded urban intersections. The algorithm in addition to accurate tracking and counting of freeway traffic also offers high efficiency for determining vehicle count at a high traffic density T-intersection. The system uses Intel Open CV library for image processing. The implementation of algorithm is done using C++. The real time video sequence is obtained from a stationary camera placed atop a high building overlooking the particular T intersection. This paper suggests a dynamic method where each vehicle at a T intersection is passed through a number of detection zones and the final count of vehicles is derived from a statistical equation.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"13 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131776855","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 : 2012-11-01DOI: 10.1109/ISDA.2012.6416674
L. Ngo, D. Mai, Mau Uyen Nguyen
When processing with large data such as satellite images, the computing speed is the problem need to be resolved. This paper introduces a method to improve the computational efficiency of the interval type-2 fuzzy c-means clustering(IT2-FCM) based on GPU platform and applied to land-cover classification from multi-spectral satellite image. GPU-based calculations are high performance solution and free up the CPU. The experimental results show that the performance of the GPU is many times faster than CPU.
{"title":"GPU-based acceleration of interval type-2 fuzzy c-means clustering for satellite imagery land-cover classification","authors":"L. Ngo, D. Mai, Mau Uyen Nguyen","doi":"10.1109/ISDA.2012.6416674","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416674","url":null,"abstract":"When processing with large data such as satellite images, the computing speed is the problem need to be resolved. This paper introduces a method to improve the computational efficiency of the interval type-2 fuzzy c-means clustering(IT2-FCM) based on GPU platform and applied to land-cover classification from multi-spectral satellite image. GPU-based calculations are high performance solution and free up the CPU. The experimental results show that the performance of the GPU is many times faster than CPU.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117208458","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 : 2012-11-01DOI: 10.1109/ISDA.2012.6416529
Indrajit Pan, Soumyajit Chatterjee, T. Samanta
Cross-contamination is incurred during droplet routing in digital microfluidic biochip (DMFB) because of intersection and overlap in the routing paths. Those intersected or overlapped regions are termed as contamination sites. In this paper, we propose a scheme for concurrent routing of multiple droplets with avoidance or minimization in cross-contamination, followed by a wash droplet scheduling operation for residue removal in the contamination sites. The proposed method is based on a hierarchical partitioning method that generates an unbalanced tree structure containing routing nets in the different nodes on the tree. The proposed partitioning technique is guided by the bounding boxes of the routing nets that help in avoiding intersection in routing paths in different partitioned zone/area. During droplet routing, our aim is to optimize resource utilizations, and minimize cross-contamination in a partition. Any cross-contamination site is washed with proper scheduling of wash droplets in the intermediate routing stages, and a shortest path based wash droplet operation is adopted to minimize routing overhead, or total routing completion time. Different observations are made by applying our algorithm on real benchmarks, and experimental results show improvement in many cases.
{"title":"Droplet routing and wash droplet scheduling algorithm to remove cross-contamination in digital microfluidic biochip","authors":"Indrajit Pan, Soumyajit Chatterjee, T. Samanta","doi":"10.1109/ISDA.2012.6416529","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416529","url":null,"abstract":"Cross-contamination is incurred during droplet routing in digital microfluidic biochip (DMFB) because of intersection and overlap in the routing paths. Those intersected or overlapped regions are termed as contamination sites. In this paper, we propose a scheme for concurrent routing of multiple droplets with avoidance or minimization in cross-contamination, followed by a wash droplet scheduling operation for residue removal in the contamination sites. The proposed method is based on a hierarchical partitioning method that generates an unbalanced tree structure containing routing nets in the different nodes on the tree. The proposed partitioning technique is guided by the bounding boxes of the routing nets that help in avoiding intersection in routing paths in different partitioned zone/area. During droplet routing, our aim is to optimize resource utilizations, and minimize cross-contamination in a partition. Any cross-contamination site is washed with proper scheduling of wash droplets in the intermediate routing stages, and a shortest path based wash droplet operation is adopted to minimize routing overhead, or total routing completion time. Different observations are made by applying our algorithm on real benchmarks, and experimental results show improvement in many cases.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117259051","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 : 2012-11-01DOI: 10.1109/ISDA.2012.6416648
Ren Ye, P. N. Suganthan
This paper proposes a kernel-ensemble bagging SVM classifier for binary class classification. The classifier is advantageous over bagging SVM classifiers because it has a two-phase grid search module, a proposed parameter randomization module and a proposed ranking module. The novel modules enhance the diversity thus improve the performance of the proposed SVM classifier. Six UCI datasets are used to evaluate the proposed kernel-ensemble bagging SVM. The result show that the proposed SVM classifier outperforms the single kernel bagging SVM classifiers.
{"title":"A kernel-ensemble bagging support vector machine","authors":"Ren Ye, P. N. Suganthan","doi":"10.1109/ISDA.2012.6416648","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416648","url":null,"abstract":"This paper proposes a kernel-ensemble bagging SVM classifier for binary class classification. The classifier is advantageous over bagging SVM classifiers because it has a two-phase grid search module, a proposed parameter randomization module and a proposed ranking module. The novel modules enhance the diversity thus improve the performance of the proposed SVM classifier. Six UCI datasets are used to evaluate the proposed kernel-ensemble bagging SVM. The result show that the proposed SVM classifier outperforms the single kernel bagging SVM classifiers.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116917047","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 : 2012-11-01DOI: 10.1109/ISDA.2012.6416517
N. S. Kumar, G. V. Anand, S. Roul, Dibu John Philip
Accurate estimation of the number of sources plays a crucial role in the source localization and direction-of-arrival estimation problems. In several applications like coastal surveillance and harbour defence, source number estimation has to be performed in a shallow ocean environment. In this paper, the Gerschgorin disk estimator (GDE) method of source number estimation in an unbounded medium is extended for operation in a shallow oceanic waveguide. Classical methods of source number estimation such as Akaike information criterion (AIC) and minimum description length (MDL) require (1) good estimates of the eigenvalues of the spectral correlation matrix, and (2) the assumption of white Gaussian noise to be valid. The GDE method does not suffer from these limitations. A theoretical formulation of the GDE method in a shallow ocean is presented in this paper for acoustic vector sensor (AVS) and acoustic pressure sensor (APS) arrays. Simulation results are then presented to illustrate the advantages of the GDE method and the superior performance of the AVS array in a shallow ocean environment.
{"title":"Source number estimation in shallow ocean by acoustic vector sensor array using Gerschgorin disks","authors":"N. S. Kumar, G. V. Anand, S. Roul, Dibu John Philip","doi":"10.1109/ISDA.2012.6416517","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416517","url":null,"abstract":"Accurate estimation of the number of sources plays a crucial role in the source localization and direction-of-arrival estimation problems. In several applications like coastal surveillance and harbour defence, source number estimation has to be performed in a shallow ocean environment. In this paper, the Gerschgorin disk estimator (GDE) method of source number estimation in an unbounded medium is extended for operation in a shallow oceanic waveguide. Classical methods of source number estimation such as Akaike information criterion (AIC) and minimum description length (MDL) require (1) good estimates of the eigenvalues of the spectral correlation matrix, and (2) the assumption of white Gaussian noise to be valid. The GDE method does not suffer from these limitations. A theoretical formulation of the GDE method in a shallow ocean is presented in this paper for acoustic vector sensor (AVS) and acoustic pressure sensor (APS) arrays. Simulation results are then presented to illustrate the advantages of the GDE method and the superior performance of the AVS array in a shallow ocean environment.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116806015","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 : 2012-11-01DOI: 10.1109/ISDA.2012.6416623
Ahmed F. Abdelzaher, Bhanu K. Kamapantula, P. Ghosh, Sajal K. Das
Biological networks (specifically, genetic regulatory networks) exhibit an optimized sparse topology and are known to be robust to various external perturbations. We have earlier utilized such networks, particularly, the gene regulatory network of E. coli, for constructing smart communication structures in bio-inspired Wireless Sensor Networks (WSNs) having high packet transmission efficiency. In this paper, we present machine learning approaches to relate the graph topology based characteristics of such bio-inspired WSNs to their network-level robustness in terms of average packet transmission efficiency. In particular, we generate a support vector regression model using the graph metric features as input data. The model predicts the percentage of packets received by the highest degree sink node and a theoretical estimate for the overall network robustness.
{"title":"Empirical prediction of packet transmission efficiency in bio-inspired Wireless Sensor Networks","authors":"Ahmed F. Abdelzaher, Bhanu K. Kamapantula, P. Ghosh, Sajal K. Das","doi":"10.1109/ISDA.2012.6416623","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416623","url":null,"abstract":"Biological networks (specifically, genetic regulatory networks) exhibit an optimized sparse topology and are known to be robust to various external perturbations. We have earlier utilized such networks, particularly, the gene regulatory network of E. coli, for constructing smart communication structures in bio-inspired Wireless Sensor Networks (WSNs) having high packet transmission efficiency. In this paper, we present machine learning approaches to relate the graph topology based characteristics of such bio-inspired WSNs to their network-level robustness in terms of average packet transmission efficiency. In particular, we generate a support vector regression model using the graph metric features as input data. The model predicts the percentage of packets received by the highest degree sink node and a theoretical estimate for the overall network robustness.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115086188","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 : 2012-11-01DOI: 10.1109/ISDA.2012.6416577
Richa Sharma, Savita M. Datta, H. Banati, Punam Bedi
Opinions elicited from various groups of society (stakeholders) need to be incorporated into developing socially aware e-learning courses. Elicitation of opinion in initial phases of the designing process helps in chalking out needs of the stakeholders and their expectations from the course. This paper proposes a Social Opinion Framework to involve stakeholders in pre-design as well as post-deployment stages of e-course development. The framework suggests identification of stakeholders from the relevant domains and analysis of their roles. The respective opinions are to be elicited, prioritized and incorporated next in order to modify the course. The paper also discusses how the respective contributions can be instrumental in providing necessary support structures and quality parameters to improve upon the course composition, thus providing a better e-learning experience to the learners.
{"title":"An opinion-based framework for designing socially aware e-learning systems","authors":"Richa Sharma, Savita M. Datta, H. Banati, Punam Bedi","doi":"10.1109/ISDA.2012.6416577","DOIUrl":"https://doi.org/10.1109/ISDA.2012.6416577","url":null,"abstract":"Opinions elicited from various groups of society (stakeholders) need to be incorporated into developing socially aware e-learning courses. Elicitation of opinion in initial phases of the designing process helps in chalking out needs of the stakeholders and their expectations from the course. This paper proposes a Social Opinion Framework to involve stakeholders in pre-design as well as post-deployment stages of e-course development. The framework suggests identification of stakeholders from the relevant domains and analysis of their roles. The respective opinions are to be elicited, prioritized and incorporated next in order to modify the course. The paper also discusses how the respective contributions can be instrumental in providing necessary support structures and quality parameters to improve upon the course composition, thus providing a better e-learning experience to the learners.","PeriodicalId":370150,"journal":{"name":"2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129746632","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
扫码关注我们
求助内容：
应助结果提醒方式：