{"title":"The Effect of Word Recall on English Vocabulary Learning","authors":"Yeonji Baik, Jiyoun Choi, Taewon Chung, K. Nam","doi":"10.1109/ICCSA.2010.75","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.75","url":null,"abstract":"This study examined the effect of word recall among Korean native students learning English vocabulary as their second language. The aim was to determine if there would be an effect of word recall on English vocabulary learning after the participants had studied 160 English-Korean word pairs using the computer. Participants were assigned to three different learning conditions (Control, Recall, Encode) and they learned lists of word pairs across multiple study trials and were given an immediate recall test. A final delayed recall test was also given 1 week after learning. The results from the delayed recall test indicated that the learning conditions (Control, Recall) which required the participants to actively recall the words resulted in a better recall of words 1 week after the initial learning period. In addition, the results from the survey which investigated the participants’ preferred strategy when studying, demonstrated that 63.5% of the participants preferred to engage in self-testing or retrieval practice while studying. However, participants did not regard retrieval practice via self-testing alone as an effective learning strategy for studying.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121110060","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":"ID-Based Private Key Update Protocol with Anonymity in Mobile Ad-Hoc Networks","authors":"Yohan Park, Y. Park, S. Moon","doi":"10.1109/ICCSA.2010.76","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.76","url":null,"abstract":"Security support is a must for ad hoc networks.Especially in dynamic topology, key update is essential to provide security. Also it need to protect node's identity in wireless environment. However, existing key update or key agreement scheme for ad hoc networks doesn’t consider these issues together. This paper propose ID-based private key update scheme and ID-based key agreement scheme in mobile ad hoc networks. These schemes are suitable for the infrastructureless mobile ad hoc networks.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"139 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113960536","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":"Hyperbolic Voronoi Diagrams Made Easy","authors":"F. Nielsen, R. Nock","doi":"10.1109/ICCSA.2010.37","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.37","url":null,"abstract":"We present a simple framework to compute hyperbolic Voronoi diagrams of finite point sets as affine diagrams.We prove that bisectors in Klein's non-conformal disk model are hyperplanes that can be interpreted as power bisectors of Euclidean balls.Therefore our method simply consists in computing an equivalent clipped power diagram followed by a mapping transformation depending on the selected representation of the hyperbolic space (e.g., Poincare conformal disk or upper-plane representations). We discuss on extensions of this approach to weighted and $k$-order diagrams, and describe their dual triangulations.Finally, we consider two useful primitives on the hyperbolic Voronoi diagrams for designing tailored user interfaces of an image catalog browsing application in the hyperbolic disk:(1) finding nearest neighbors, and (2) computing smallest enclosing balls.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126034311","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}