{"title":"Ethnic Immigrant Minorities and Mobile Learning for Schools -- A Class without Walls: A New Didactic Approach to Digital Literacy across the Curriculum","authors":"Konstantinos Kalemis","doi":"10.1109/INCoS.2011.163","DOIUrl":"https://doi.org/10.1109/INCoS.2011.163","url":null,"abstract":"Much like immigrants who leave the cultural comfort of their home societies and move to places with very different cultures and social practices, those who teach online leave the familiarity of the face-to-face classroom for the uncharted terrain of the online environment, whose constraints and affordances often lead to very different practices. The trans-classroom teacher who moves between the two environments, transferring ideas, strategies, and practices from one to the other, is a mental migrant. The transformations -- of the teacher and of the course -- that occur in these migrations and the two-way interactions between face-to-face and online teaching are the focus of this study. As teachers adapt their courses for the online environment, they are forced to re-examine the course design, reconsider curriculum strategies, and make many decisions about what to take out and what to keep, what to add and what to substitute. The implication for faculty who would like to implement mobile learning in their online or traditional courses is that they can begin by making content and information available to students in formats easily accessible by mobile phone or laptop computer. This would be a logical first step, since a majority of students and faculty already use these tools in many of their daily activities. Other tools, such as video iPods and MP3 players, can be phased in gradually. The following ideas could be implemented immediately with little to no additional cost. Most basic cell phones today can send and receive text messages, voice mail, and e-mail. E-mail is a convenient way to communicate information to the learning community, so the instructor can begin by sending class-wide \"broadcast\" e-mails that students can access via a variety of mobile devices.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132505289","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}
Kentaro Hamada, Kaori Yoshida, K. Ohnishi, M. Köppen
{"title":"Color Effect on Subjective Perception of Progress Bar Speed","authors":"Kentaro Hamada, Kaori Yoshida, K. Ohnishi, M. Köppen","doi":"10.1109/INCoS.2011.65","DOIUrl":"https://doi.org/10.1109/INCoS.2011.65","url":null,"abstract":"This present study attempts to find relationship between progress bar colors and subjective speed by subjective evaluation experiment. We prepared the six combinations of colors, blue/red for progress bar foreground color and cyan/orange/gray for background color. The test progress bars are designed under the same condition, for example progress bar size or animation speed, except colors. The test progress bars were displayed one after the other of all pair combinations, and made the subjects mark the test progress bar which they felt faster. As a result, there were no obvious significant color effects related to subjective speed impression in this subjective evaluation experiments. We consider the reason why not found significant color effects as follows, (i) it's not enough data due to the small-scale experiments with only 10 subjects, (ii) color effect might not strong on progress bar.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133366261","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}
{"title":"An Alternative Implementation of 3FT RAID in Virtual Large Scale Disks","authors":"M. Uehara","doi":"10.1109/INCoS.2011.47","DOIUrl":"https://doi.org/10.1109/INCoS.2011.47","url":null,"abstract":"Recently, the demand of low cost large scale storages increases. We developed VLSD (Virtual Large Scale Disks) toolkit for constructing virtual disk based distributed storages, which aggregate free spaces of individual disks. However, in order to construct large-scale storage, more than or equal to 3 faults tolerant RAID is important. In the previous work we proposed Mesh RAID that is 3 faults tolerant orthogonal RAID. And, we implemented Mesh RAID using VLSD. Mesh RAID is not tolerant of only disk fault but also tolerant of string fault. In addition, we also proposed Composite RAID, which is an easy implementation of complex RAID system by combining VLSD classes. We also implemented Composite RAID based Mesh RAID. In this paper, we propose another implementation of Mesh RAID based on Alternate Disk, which chooses any implementation from all implementations dynamically. This implementation has simple structure and good performance.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132790301","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}
Elnaz Mazandarani, Kaori Yoshida, M. Köppen, Wladimir Bodrow
{"title":"Recommendation System Based on Competing Algorithms","authors":"Elnaz Mazandarani, Kaori Yoshida, M. Köppen, Wladimir Bodrow","doi":"10.1109/INCoS.2011.141","DOIUrl":"https://doi.org/10.1109/INCoS.2011.141","url":null,"abstract":"In this paper, we provide the idea of analyzing the performance of algorithms generating personal recommendation by using competing algorithms for one and the same recommendation request based on same situation and information in a unified framework. The analysis of the recently proposed collaborative filter PAF (Popularity Among Friends) for finding user similarity based on past ratings and evaluation of missing ratings of a user-item-matrix in order to generate recommendations will serve as a base to specify competing algorithm for an experimental recommendation system. We present results of an on-line experiment of the proposed recommendation system which will demonstrate the advantage of directly comparing the rate of user acceptance of competing algorithms and allow a statement about their suitability as base of an easy evaluation of the system. The evaluation gives a conclusion about algorithms to be replaced through new competing methods in order to steadily improve the recommendation system.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115005661","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}
{"title":"An Integrated Model for E-assessment of Learning Experiences Enriched with Complex Learning Resources","authors":"M. Al-Smadi, Margit Hoefler, C. Gütl","doi":"10.1109/INCoS.2011.52","DOIUrl":"https://doi.org/10.1109/INCoS.2011.52","url":null,"abstract":"The emergence of Web 2.0 and the influence of Information and Communication Technology (ICT) have fostered e-learning to be more interactive, challenging, and situated. As a result, learners felt empowered when they are engaged in collaborative learning activities and self-directed learning. Given the different learning styles of students, educators are faced with the challenge of having to develop assessments which are required to appraise the students' learning process. Therefore, assessment models of learning experiences enriched with complex learning resources such as: simulations, serious games, and collaborative and virtual experiences are required. In this paper, an Integrated Model for e-Assessment (IMA) of learning experiences enriched with such complex learning resources is proposed. Moreover, a bottom-up framework of how to use IMA is discussed. A case study of developed tool and experiment is shown to more explain the model and the framework.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115299592","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}
{"title":"The Evaluation of ReCoNote Summaries for Learner-Centered Integration","authors":"Sayaka Tohyama, N. Miyake","doi":"10.1109/INCoS.2011.155","DOIUrl":"https://doi.org/10.1109/INCoS.2011.155","url":null,"abstract":"We present the influence of a midterm integration which supports making relations among many varied learning materials from learners' own viewpoints. We designed a curriculum for the learners integrating sets of similar learning materials at the midterm before integrating broader learning materials in the final results. A concept mapping system called \"ReCoNote\" helped the learners externalize their thinking. The result is that learners from the 2007 class were more successful in deepening integration of their knowledge at the midterm than learners from the 2006 class. And the learners in 2007 made more relations among the learning materials to their final concept maps than in 2006. In the activity of making relations, the learners in 2007 used their own common concepts or keywords which were made at the midterm when they relate the learning materials. These results suggest that supporting constructing the learners' own integrated knowledge helped them relate many varied learning materials from their own viewpoints.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123929607","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}
{"title":"Approximation Algorithm for Finding Protected Links to Keep Small Diameter against Link Failures","authors":"K. Imagawa, Takeshi Fujimura, H. Miwa","doi":"10.1109/INCoS.2011.57","DOIUrl":"https://doi.org/10.1109/INCoS.2011.57","url":null,"abstract":"High reliability and performance are needed as the Internet becomes an important social infrastructure. Network delay is one of measures of performance of network. As delay between two nodes correlates roughly with the distance between them, the diameter of the network which is the maximum distance of all two nodes must be small. In addition, it is necessary to keep small network delay against network failures. Therefore, critical links whose failures significantly degrade the performance must be protected by rapid recovery so that failures cannot be detected over the IP layer. The number of these protected links must be small to restrict investment cost of facilities and operational cost for Internet service providers. Consequently, it is important to find the smallest number of links to be protected so that the diameter of a network is not more than a given integer even if a limited number of non-protected links fail. It was proved by the authors that this problem is NP-hard when the number of the simultaneous link failures, k, is more than or equal to three, and it can be solved in polynomial time when k is restricted to one. However, it was not known whether the problem is NP-hard or not when k = 2. Furthermore, no approximation algorithm was known for the NP-hard cases. In this paper, we solve these unsolved issues of this problem. First, we prove that the problem is NP-hard even if k = 2. Second, we present approximation algorithms with the approximation ratio of a fixed constant for the NP-hard cases. These results make clear the computational complexity of this problem theoretically and give the useful network design algorithms also from the practical viewpoints.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121365573","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}
{"title":"Design and Implementation of 3D MeshRAID in Virtual Large-Scale Disks","authors":"M. Uehara","doi":"10.1109/INCoS.2011.71","DOIUrl":"https://doi.org/10.1109/INCoS.2011.71","url":null,"abstract":"Recently, the demand of low cost large scale storages increases. We developed VLSD (Virtual Large Scale Disks) toolkit for constructing virtual disk based distributed storages, which aggregate free spaces of individual disks. However, in order to construct large-scale storage, more than or equal to 3 fault tolerant RAID is important. In the previous work we proposed Mesh RAID that is 3 fault tolerant orthogonal RAID. And, we implemented Mesh RAID using VLSD. Mesh RAID is a hierarchical RAID that shares elemental disks. The structure of hierarchical RAID is tree but the structure of Mesh RAID is DAG(Directed A cyclic Graph). Mesh RAID is not tolerant of only disk fault but also tolerant of string fault. Furthermore, in hierarchical RAID, the larger the number of layers is, the higher the reliability of the system. In Mesh RAID, increasing the layers is equivalent to increasing the dimensions. In this paper, we implement 3 dimensional Mesh RAID and evaluate it.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116469508","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}
{"title":"An Ontology-Based Approach for Context-Aware E-learning","authors":"N. Capuano, M. Gaeta, S. Salerno, G. Mangione","doi":"10.1109/INCoS.2011.53","DOIUrl":"https://doi.org/10.1109/INCoS.2011.53","url":null,"abstract":"Context-aware e-learning is an educational model that foresees the selection of learning resources to make the e-learning content more relevant and suitable for the learner in his/her situation. The research reported in this paper was purposed to improve an existing system for personalized e-learning with contextualisation features. This has been done by defining a context model, an ontology-based model to represent a teaching domain that includes contextualization information and a methodology to generate personalized and context-aware learning experiences basing on such structures.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"47 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123265699","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}
{"title":"Influence of Interference with Moving Terminal in Wireless LAN Environment and Evaluation of Behavior of QoS-TCP","authors":"Remi Ando, T. Murase, M. Oguchi","doi":"10.1109/INCoS.2011.125","DOIUrl":"https://doi.org/10.1109/INCoS.2011.125","url":null,"abstract":"In late years, the demand for multimedia communication has been raised extensively. In this environment, to guarantee the QoS is extremely important. While various control mechanisms have already been realized about the QoS control in each protocol layer, a QoS-guaranteed TCP (QoS-TCP) has been proposed. The QoS-TCP tries to guarantee a specified bandwidth against competing background TCP traffic. Previous researches reveal that the QoS-TCP is effective in wired networks, fixed wireless networks, and wireless network with handover. Recently, a mobile router has spread quickly. Therefore, we should assume the environment where an access point (AP) and portable terminals move together, and investigate the use of QoS-TCP in such an environment. In this paper, we investigate the behavior of QoS-TCP caused by radio interference when 2 QoS-TCPs come close together.","PeriodicalId":235301,"journal":{"name":"2011 Third International Conference on Intelligent Networking and Collaborative Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122600688","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}