e-Learning (e-L) is the latest wave of development of distance education, which has become an extremely important part of instructional technology (Almekhlafi, 20006). Recent e-L research has indicated the utility of this instructional method for both students and teachers. However, teachers’ perceptions of e-L utility have not been extensively researched, particularly in the United Arab Emirates. The purpose of this study is to explore preservice teachers' perception of the utility of e-L at the College of Education, United Arab Emirates University. Study participants were 278 preservice teachers studying the capstone course during 2005-2006 and 2006-2007 academic years. A questionnaire was administered to preservice teachers taking the course electronically (e-L). Study results showed high self-perception of the utility of e-L. In addition, a positive relationship between the overall course grade and the frequency of using Blackboard communication tools was found. On the other hand, results did not show any significant differences between participants' overall course grade due to method of instruction (online versus face-to-face). Implications for United Arab Emirates context were discussed.
{"title":"An Evaluation Study of an e-Learning Course at the United Arab Emirates University: A Case Study","authors":"Abdurrahman G. Almekhlafi","doi":"10.1109/ICFCC.2009.96","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.96","url":null,"abstract":"e-Learning (e-L) is the latest wave of development of distance education, which has become an extremely important part of instructional technology (Almekhlafi, 20006). Recent e-L research has indicated the utility of this instructional method for both students and teachers. However, teachers’ perceptions of e-L utility have not been extensively researched, particularly in the United Arab Emirates. The purpose of this study is to explore preservice teachers' perception of the utility of e-L at the College of Education, United Arab Emirates University. Study participants were 278 preservice teachers studying the capstone course during 2005-2006 and 2006-2007 academic years. A questionnaire was administered to preservice teachers taking the course electronically (e-L). Study results showed high self-perception of the utility of e-L. In addition, a positive relationship between the overall course grade and the frequency of using Blackboard communication tools was found. On the other hand, results did not show any significant differences between participants' overall course grade due to method of instruction (online versus face-to-face). Implications for United Arab Emirates context were discussed.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122532282","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}
Early detection and treatment of breast cancer can effectively prohibit its progress and decrease mortality rate. Recently, ultrasound imaging plays an important role in the field of breast cancer diagnosis because of its convenience and non-invasive. With the assist of computer-aided diagnosis (CAD) system, the characteristics of tumor can be detected and provided to physicians as a critical reference. Because the shape of a tumor may be altered due to the stress caused by the ultrasound probe, the registration method can be utilized to analyze the variation of tumor between pre- and post-compression. Therefore, we can determine whether the tumor is benign or not with several statistical materials. The experimental results will show that this proposed model can efficaciously detect the tumors and support the clinical diagnoses.
{"title":"3D Breast Tumor Classification Using Image Registration Framework","authors":"Chii-Jen Chen","doi":"10.1109/ICFCC.2009.33","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.33","url":null,"abstract":"Early detection and treatment of breast cancer can effectively prohibit its progress and decrease mortality rate. Recently, ultrasound imaging plays an important role in the field of breast cancer diagnosis because of its convenience and non-invasive. With the assist of computer-aided diagnosis (CAD) system, the characteristics of tumor can be detected and provided to physicians as a critical reference. Because the shape of a tumor may be altered due to the stress caused by the ultrasound probe, the registration method can be utilized to analyze the variation of tumor between pre- and post-compression. Therefore, we can determine whether the tumor is benign or not with several statistical materials. The experimental results will show that this proposed model can efficaciously detect the tumors and support the clinical diagnoses.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115446704","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}
The advantage of project-based, collaborative assignments has been demonstrated to foster greater depth of learning in traditional classroom settings. However, there are numerous challenges that are inherent within this pedagogy,especially in promoting computer supported collaborative learning. Although lots of computer systems and tools are compatible to support project-based learning (PBL) in a computer supported environment, an integrated computer supported system which provides infrastructure for PBL is still lacking. This paper brings forward the initiative to coalesce and strengthen a set of coherent foundations for generating integrated computer supported environment for PBL by introducing the initiation phase. Understanding the initiation phase activities and their characteristics in computer supported environment is a definite step towards generating an integrated computer supported environment.
{"title":"Initiation Steps towards Generating Integrated Computer Supported Environment for Project-Based Learning","authors":"Kouros Basiri, N. A. Iahad","doi":"10.1109/ICFCC.2009.104","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.104","url":null,"abstract":"The advantage of project-based, collaborative assignments has been demonstrated to foster greater depth of learning in traditional classroom settings. However, there are numerous challenges that are inherent within this pedagogy,especially in promoting computer supported collaborative learning. Although lots of computer systems and tools are compatible to support project-based learning (PBL) in a computer supported environment, an integrated computer supported system which provides infrastructure for PBL is still lacking. This paper brings forward the initiative to coalesce and strengthen a set of coherent foundations for generating integrated computer supported environment for PBL by introducing the initiation phase. Understanding the initiation phase activities and their characteristics in computer supported environment is a definite step towards generating an integrated computer supported environment.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131397546","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}
M. HeidariNezhad, Z. Zukarnain, N. Udzir, M. Othman
Design of mobility management protocols stands out as an important challenge in integrating wireless networks into the IP-based Internet, especially when such networks are deployed for Real-Time applications. We present a new hierarchical model for intra-domain mobility management with QoS support for the wireless access network. The scheme includes an anchor selection algorithm with QoS support, and efficient techniques for intra-anchor handover, inter-anchor handover, and paging management. In addition to QoS support, the proposed scheme has the advantages of robustness, scalability, load balancing and fast handover. Simulation results of our model indicate that it provides good handover performance in the presence of multiple QoS classes of applications.
{"title":"A QoS-Support Mobility Management Approach in Wireless Network","authors":"M. HeidariNezhad, Z. Zukarnain, N. Udzir, M. Othman","doi":"10.1109/ICFCC.2009.126","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.126","url":null,"abstract":"Design of mobility management protocols stands out as an important challenge in integrating wireless networks into the IP-based Internet, especially when such networks are deployed for Real-Time applications. We present a new hierarchical model for intra-domain mobility management with QoS support for the wireless access network. The scheme includes an anchor selection algorithm with QoS support, and efficient techniques for intra-anchor handover, inter-anchor handover, and paging management. In addition to QoS support, the proposed scheme has the advantages of robustness, scalability, load balancing and fast handover. Simulation results of our model indicate that it provides good handover performance in the presence of multiple QoS classes of applications.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"14 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131225596","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}
The security of audio data in high end communication applications like satellites and radars is an issue of concern these days. Designing a processor at the chip level for this requirement is by itself a challenge to VLSI engineers. This paper aims to design a HDL based novel audio subword sorter unit, which is less complex in structure and highly efficient in terms of security. In this paper, we examine the hardware implementation of low power powerful permutation instruction group (GRP). This is done at the integrated chip (IC-level) using Verilog HDL and can be implemented in FPGA. To our knowledge this is the first audio subword sorter unit implemented in FPGA
{"title":"Design of HDL Based Low Power Audio Subword Sorter Unit","authors":"P. Karthigaikumar, K. Baskaran","doi":"10.1109/ICFCC.2009.67","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.67","url":null,"abstract":"The security of audio data in high end communication applications like satellites and radars is an issue of concern these days. Designing a processor at the chip level for this requirement is by itself a challenge to VLSI engineers. This paper aims to design a HDL based novel audio subword sorter unit, which is less complex in structure and highly efficient in terms of security. In this paper, we examine the hardware implementation of low power powerful permutation instruction group (GRP). This is done at the integrated chip (IC-level) using Verilog HDL and can be implemented in FPGA. To our knowledge this is the first audio subword sorter unit implemented in FPGA","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130665661","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}
M. Rostami, Masoudnia Saeed, Seyed Mohammad Hoseininasab
Data dissemination in the existing peer-to-peer multicast protocols is performed from source node by delivering data to destination nodes over either a tree or a partial-mesh path structure covering all the multicast nodes. In this paper, we show that the existing tree-based or partial-mesh-based data dissemination algorithms do not perform efficiently in traditional customer-provider networks. We propose a new class of data dissemination algorithms called SBDD that considers a full-mesh path structure between multicast nodes. We show that SBDD improves multicast throughput, Latency, fairness, and node dependency over the tree-based or partial-mesh-based algorithms in traditional customer-provider networks. Furthermore, it can also be used in heterogeouse multicast environments with a low computational complexity and a low overhead in comparison with the existing algorithms for such environments.
{"title":"Sequence-Based Data Dissemination Algorithms for Peer-to-Peer Multicast Protocols","authors":"M. Rostami, Masoudnia Saeed, Seyed Mohammad Hoseininasab","doi":"10.1109/ICFCC.2009.93","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.93","url":null,"abstract":"Data dissemination in the existing peer-to-peer multicast protocols is performed from source node by delivering data to destination nodes over either a tree or a partial-mesh path structure covering all the multicast nodes. In this paper, we show that the existing tree-based or partial-mesh-based data dissemination algorithms do not perform efficiently in traditional customer-provider networks. We propose a new class of data dissemination algorithms called SBDD that considers a full-mesh path structure between multicast nodes. We show that SBDD improves multicast throughput, Latency, fairness, and node dependency over the tree-based or partial-mesh-based algorithms in traditional customer-provider networks. Furthermore, it can also be used in heterogeouse multicast environments with a low computational complexity and a low overhead in comparison with the existing algorithms for such environments.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114381085","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}
Although most existing e-learning systems in the country are no more than organized web sites that contain downloadable course notes and power point slides, video streams, discussion forums, and other related course materials. The essential asset of intelligent knowledge consolidation, easy editable content, up-to-date information, the growing test bank,the Chinese resource library and the knowledgebase from various experts, however, has not been fully exploited. In this conceptual paper, we proposed a national framework in capturing, processing,browsing, learning, retrieving, adding and apply knowledge to complete the task or solving a problem,and state the challenges of fully utilizing these essential assets. The proposed High-touch Intelligent Chinese learning system (iCL) framework is aimed to achieve the nature of High-touch and intelligent. The knowledge includes in the iCL will based on the current educational level in Malaysia.
{"title":"High-Touch Intelligent Chinese Learning (iCL) Framework for Malaysia Case","authors":"Esyin Chew, Norah Jones","doi":"10.1109/ICFCC.2009.147","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.147","url":null,"abstract":"Although most existing e-learning systems in the country are no more than organized web sites that contain downloadable course notes and power point slides, video streams, discussion forums, and other related course materials. The essential asset of intelligent knowledge consolidation, easy editable content, up-to-date information, the growing test bank,the Chinese resource library and the knowledgebase from various experts, however, has not been fully exploited. In this conceptual paper, we proposed a national framework in capturing, processing,browsing, learning, retrieving, adding and apply knowledge to complete the task or solving a problem,and state the challenges of fully utilizing these essential assets. The proposed High-touch Intelligent Chinese learning system (iCL) framework is aimed to achieve the nature of High-touch and intelligent. The knowledge includes in the iCL will based on the current educational level in Malaysia.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115908328","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}
Shawki A. Al-Dubaee, Nesar Ahmad, H. Abdulla, V. Snás̃el
In traditional search engines, it is not so easy for users to find relevant Web pages list (snippet) of a given query. Therefore, there is a need to retrieve and find the relevant information in a better way by clustering the search results. This paper presents a new approach for clustering search results using Haar wavelet transform. We explain how uses of Haar wavelet transform offer a reasonably good solution for the above.
{"title":"A New Search Result Clustering Using Haar Wavelet Transform","authors":"Shawki A. Al-Dubaee, Nesar Ahmad, H. Abdulla, V. Snás̃el","doi":"10.1109/ICFCC.2009.142","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.142","url":null,"abstract":"In traditional search engines, it is not so easy for users to find relevant Web pages list (snippet) of a given query. Therefore, there is a need to retrieve and find the relevant information in a better way by clustering the search results. This paper presents a new approach for clustering search results using Haar wavelet transform. We explain how uses of Haar wavelet transform offer a reasonably good solution for the above.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"311 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124424639","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}
In this paper, we present solutions that enable efficient XML data querying on a structured P2Pnetwork. In particular, our solutions rely on a distributed index technique which indexes both the string values and structure summary of any XML document over the P2P network. With such kind of distributed indices, we may find the relevant results by a limiting number of peer lookups. To improve the efficiency of data querying, we also present a method that enables performing a query in parallelization. In addition, we use Bloom Filter to reduce the size of the candidate document lists exchanging between peers and improve the network traffic. Our simulation results show that our solutions can achieve major performance gains in terms of network bandwidth and execution time.
{"title":"Querying XML Data on a Structured P2P Network","authors":"Dehua Chen, Yongming Guo, Xiujin Shi, Shoujian Yu","doi":"10.1109/ICFCC.2009.75","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.75","url":null,"abstract":"In this paper, we present solutions that enable efficient XML data querying on a structured P2Pnetwork. In particular, our solutions rely on a distributed index technique which indexes both the string values and structure summary of any XML document over the P2P network. With such kind of distributed indices, we may find the relevant results by a limiting number of peer lookups. To improve the efficiency of data querying, we also present a method that enables performing a query in parallelization. In addition, we use Bloom Filter to reduce the size of the candidate document lists exchanging between peers and improve the network traffic. Our simulation results show that our solutions can achieve major performance gains in terms of network bandwidth and execution time.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121927145","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}
This paper investigates and undertakes simulation based study of Adhoc routing protocols in Wireless Sensor Networks. For our simulation based study we have considered three different scenarios where a Adhoc routing protocol can be applied, namely a) Phenom nodes with Mobility, Sensor nodes with mobility while the SINK node is stationary b) Phenom nodes with Mobility, Sensor nodes are stationary and Sink node is stationary c) Phenom nodes are stationary, Sensor nodes are stationary and SINK node is stationary. We have considered AODV and DSR as the Adhoc routing protocols for comparison in these scenarios. We wanted to consider a table driven routing protocol like DSDV but it was not able to scale beyond 80 nodes in the very first scenario itself. As we wanted uniformity across all the scenarios we opted out of table driven routing protocols like DSDV, even though DSDV could have been used in the third scenario. Finally, through our analysis we show the various intricacies that are associated with Adhoc routing protocols when used in a sensor environment. We also list the various problems we faced while simulating the routing protocols in each of the scenarios.
{"title":"Scenario Based Simulation Study of Ad Hoc Routing Protocol's Behavior in Wireless Sensor Networks","authors":"S. Gowrishankar, S. Sarkar, T. Basavaraju","doi":"10.1109/ICFCC.2009.72","DOIUrl":"https://doi.org/10.1109/ICFCC.2009.72","url":null,"abstract":"This paper investigates and undertakes simulation based study of Adhoc routing protocols in Wireless Sensor Networks. For our simulation based study we have considered three different scenarios where a Adhoc routing protocol can be applied, namely a) Phenom nodes with Mobility, Sensor nodes with mobility while the SINK node is stationary b) Phenom nodes with Mobility, Sensor nodes are stationary and Sink node is stationary c) Phenom nodes are stationary, Sensor nodes are stationary and SINK node is stationary. We have considered AODV and DSR as the Adhoc routing protocols for comparison in these scenarios. We wanted to consider a table driven routing protocol like DSDV but it was not able to scale beyond 80 nodes in the very first scenario itself. As we wanted uniformity across all the scenarios we opted out of table driven routing protocols like DSDV, even though DSDV could have been used in the third scenario. Finally, through our analysis we show the various intricacies that are associated with Adhoc routing protocols when used in a sensor environment. We also list the various problems we faced while simulating the routing protocols in each of the scenarios.","PeriodicalId":338489,"journal":{"name":"2009 International Conference on Future Computer and Communication","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123278624","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
扫码关注我们
求助内容：
应助结果提醒方式：