Pub Date : 2010-07-01DOI: 10.1504/IJKWI.2010.034185
K. Asakura, Hiroya Takikawa, Junya Oishi, Toyohide Watanabe
In this paper, we propose an ad-hoc unicursal protocol for communication systems in disaster situations. This protocol is designed for gathering information about rescues effectively in a big earthquake. For the longevity of networks, terminals are connected to each other in linear form in our protocol, which makes the communication loads among terminals relatively equal. In order to decrease frequency of packet sending, our protocol introduces virtual terminals, in which two neighbouring terminals activate alternatively. Experimental results show that our protocol needs less packets and that the average life time of terminals is longer than other protocols.
{"title":"An ad-hoc unicursal protocol for stable and long-lived communication systems in disaster situations","authors":"K. Asakura, Hiroya Takikawa, Junya Oishi, Toyohide Watanabe","doi":"10.1504/IJKWI.2010.034185","DOIUrl":"https://doi.org/10.1504/IJKWI.2010.034185","url":null,"abstract":"In this paper, we propose an ad-hoc unicursal protocol for communication systems in disaster situations. This protocol is designed for gathering information about rescues effectively in a big earthquake. For the longevity of networks, terminals are connected to each other in linear form in our protocol, which makes the communication loads among terminals relatively equal. In order to decrease frequency of packet sending, our protocol introduces virtual terminals, in which two neighbouring terminals activate alternatively. Experimental results show that our protocol needs less packets and that the average life time of terminals is longer than other protocols.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"445 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123433256","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 : 2010-07-01DOI: 10.1504/IJKWI.2010.034186
Neil Rubens, Mikko Vilenius, Toshio Okamoto, D. Kaplan
Research-oriented tasks continue to become more complex, requiring more collaboration between experts. Historically, research has focused on either finding a single expert for a specific task Expertise Finding (EF), or trying to form a group that satisfies various conditions Group Formation (GF). EF is typically group context agnostic, while GF requires complex models that are difficult to automate. This paper focuses on the union of these two, forming groups of experts. We concentrate in this paper on the expertise aspect of GF, since without the needed expertise, regardless of other factors, the task cannot be accomplished.
{"title":"CAFE: Collaboration Aimed at Finding Experts","authors":"Neil Rubens, Mikko Vilenius, Toshio Okamoto, D. Kaplan","doi":"10.1504/IJKWI.2010.034186","DOIUrl":"https://doi.org/10.1504/IJKWI.2010.034186","url":null,"abstract":"Research-oriented tasks continue to become more complex, requiring more collaboration between experts. Historically, research has focused on either finding a single expert for a specific task Expertise Finding (EF), or trying to form a group that satisfies various conditions Group Formation (GF). EF is typically group context agnostic, while GF requires complex models that are difficult to automate. This paper focuses on the union of these two, forming groups of experts. We concentrate in this paper on the expertise aspect of GF, since without the needed expertise, regardless of other factors, the task cannot be accomplished.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124131392","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 : 2010-07-01DOI: 10.1504/IJKWI.2010.034192
Yasuhiro Noguchi, Takeharu Nakahara, Tatsuhiro Konishi, Satoru Kogure, Y. Itoh
Recently, non-engineers are becoming to learn algorithms and programs. Although learners' backgrounds have been greatly changed, programming/algorithm education methods remain unchanged. In a typical method, learners are given the grammar of a programming language, an algorithm and some exercises. In such a method, however, many learners who do not understand the algorithm repeat a trial-and-error process without considering the algorithm. Hence, our system can lets learners externalise their understanding of an algorithm by operating objects in a domain world before they code a program. In this paper, we describe the architecture of our system, and the result of our evaluation.
{"title":"Construction of a learning environment for algorithm and programming where learners operate objects in a domain world","authors":"Yasuhiro Noguchi, Takeharu Nakahara, Tatsuhiro Konishi, Satoru Kogure, Y. Itoh","doi":"10.1504/IJKWI.2010.034192","DOIUrl":"https://doi.org/10.1504/IJKWI.2010.034192","url":null,"abstract":"Recently, non-engineers are becoming to learn algorithms and programs. Although learners' backgrounds have been greatly changed, programming/algorithm education methods remain unchanged. In a typical method, learners are given the grammar of a programming language, an algorithm and some exercises. In such a method, however, many learners who do not understand the algorithm repeat a trial-and-error process without considering the algorithm. Hence, our system can lets learners externalise their understanding of an algorithm by operating objects in a domain world before they code a program. In this paper, we describe the architecture of our system, and the result of our evaluation.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129608069","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 : 2010-07-01DOI: 10.1504/IJKWI.2010.034190
Y. Iribe, Hiroaki Nagaoka, Kouichi Katsurada, T. Nitta
One of today's hottest topics in the field of education is the effectiveness of Learning Management Systems have introduced text chat, bulletin boards into the classroom. However, these systems do not provide visual explanation, by drawing diagrams or numbers on the presentation slides. We developed a classroom lecture system that encourages teacher-to-student and student-to-student communication by means of sharing slides drawn notes using a digital pen. The teacher and students can confirm the explanation by sharing these slides. As a result, enhanced understanding is achieved through classroom questions and answers using both text and visual explanation.
{"title":"Web-based lecture system using slide sharing for classroom questions and answers","authors":"Y. Iribe, Hiroaki Nagaoka, Kouichi Katsurada, T. Nitta","doi":"10.1504/IJKWI.2010.034190","DOIUrl":"https://doi.org/10.1504/IJKWI.2010.034190","url":null,"abstract":"One of today's hottest topics in the field of education is the effectiveness of Learning Management Systems have introduced text chat, bulletin boards into the classroom. However, these systems do not provide visual explanation, by drawing diagrams or numbers on the presentation slides. We developed a classroom lecture system that encourages teacher-to-student and student-to-student communication by means of sharing slides drawn notes using a digital pen. The teacher and students can confirm the explanation by sharing these slides. As a result, enhanced understanding is achieved through classroom questions and answers using both text and visual explanation.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133216597","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 : 2010-07-01DOI: 10.1504/IJKWI.2010.034191
Y. Tateiwa, Tomohiro Iwasaki, T. Yasuda, N. Takahashi
We have developed a system called LiNeS to facilitate exercises with virtual machines in the existing computer laboratories of universities. We achieved this by establishing a method for constructing a virtual network consisting of heterogeneous virtual machines, and another method for constructing overlay networks consisting of virtual networks on each PC; in addition, we developed several functions for supporting exercises. In this study, we evaluated LiNeS in experiments that students performed with actual machines and with LiNeS, with the help and supervision of assistants.
{"title":"Evaluation of network construction exercise system LiNeS on the basis of heterogeneous and distributed virtual machine network composition function","authors":"Y. Tateiwa, Tomohiro Iwasaki, T. Yasuda, N. Takahashi","doi":"10.1504/IJKWI.2010.034191","DOIUrl":"https://doi.org/10.1504/IJKWI.2010.034191","url":null,"abstract":"We have developed a system called LiNeS to facilitate exercises with virtual machines in the existing computer laboratories of universities. We achieved this by establishing a method for constructing a virtual network consisting of heterogeneous virtual machines, and another method for constructing overlay networks consisting of virtual networks on each PC; in addition, we developed several functions for supporting exercises. In this study, we evaluated LiNeS in experiments that students performed with actual machines and with LiNeS, with the help and supervision of assistants.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114879496","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 : 2010-07-01DOI: 10.1504/IJKWI.2010.034187
Y. Hayashi, J. Bourdeau, R. Mizoguchi
Structuring learning/instructional theories suffer from the issue of 'paradigms', which makes them even more challenging. This paper discusses the conceptualisation of the theories and proposes a mechanism to provide perspectives for understanding and utilising them. Two types of conceptualisation proposed in this paper reveal their characteristics from a variety of viewpoints.
{"title":"Strategy-centred modelling for better understanding of learning/instructional theories","authors":"Y. Hayashi, J. Bourdeau, R. Mizoguchi","doi":"10.1504/IJKWI.2010.034187","DOIUrl":"https://doi.org/10.1504/IJKWI.2010.034187","url":null,"abstract":"Structuring learning/instructional theories suffer from the issue of 'paradigms', which makes them even more challenging. This paper discusses the conceptualisation of the theories and proposes a mechanism to provide perspectives for understanding and utilising them. Two types of conceptualisation proposed in this paper reveal their characteristics from a variety of viewpoints.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124814499","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 : 2009-08-01DOI: 10.1504/IJKWI.2009.027926
Bhaskar Biswas, K. Jain, Vipul Mittal, K. K. Shukla
An approach to designing a Universal Web Wrapper has been in stages of implementation for over years. An issue associated with this is the automated selection of web pages and thereby extraction of content of interest. We propose an algorithm to cluster pages on the basis of their structure. Due to high amount of similarity in these pages, it is be easier to categorise them and extract any particular section of the page. This algorithm makes use of only the structural factors leading to complexity equivalent to O(log n). Further, the algorithm evaluation illustrates the precision and efficiency of the algorithm.
{"title":"Exploiting tree structure of a web page for clustering","authors":"Bhaskar Biswas, K. Jain, Vipul Mittal, K. K. Shukla","doi":"10.1504/IJKWI.2009.027926","DOIUrl":"https://doi.org/10.1504/IJKWI.2009.027926","url":null,"abstract":"An approach to designing a Universal Web Wrapper has been in stages of implementation for over years. An issue associated with this is the automated selection of web pages and thereby extraction of content of interest. We propose an algorithm to cluster pages on the basis of their structure. Due to high amount of similarity in these pages, it is be easier to categorise them and extract any particular section of the page. This algorithm makes use of only the structural factors leading to complexity equivalent to O(log n). Further, the algorithm evaluation illustrates the precision and efficiency of the algorithm.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116710872","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 : 2009-08-01DOI: 10.1504/IJKWI.2009.027923
Vassiliki A. Koutsonikola, A. Vakali
With the rapid development of information technology, the significance of clustering in the process of delivering information to users is becoming more eminent. Especially in the web information space, clustering analysis can prove particularly beneficial for a variety of applications such as web personalisation and profiling, caching and prefetching and content delivery networks. In this paper, we propose a bi-clustering approach, which identifies groups of related web users and pages. The proposed approach is a three-step process that relies on the principles of spectral clustering analysis and provides a fuzzy relation scheme for the revealed users' and pages' clusters. Experiments have been conducted on both synthetic and real datasets to prove the proposed method's efficiency and reveal hidden knowledge.
{"title":"A fuzzy bi-clustering approach to correlate web users and pages","authors":"Vassiliki A. Koutsonikola, A. Vakali","doi":"10.1504/IJKWI.2009.027923","DOIUrl":"https://doi.org/10.1504/IJKWI.2009.027923","url":null,"abstract":"With the rapid development of information technology, the significance of clustering in the process of delivering information to users is becoming more eminent. Especially in the web information space, clustering analysis can prove particularly beneficial for a variety of applications such as web personalisation and profiling, caching and prefetching and content delivery networks. In this paper, we propose a bi-clustering approach, which identifies groups of related web users and pages. The proposed approach is a three-step process that relies on the principles of spectral clustering analysis and provides a fuzzy relation scheme for the revealed users' and pages' clusters. Experiments have been conducted on both synthetic and real datasets to prove the proposed method's efficiency and reveal hidden knowledge.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133041722","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 : 2009-08-01DOI: 10.1504/IJKWI.2009.027925
F. Khalil, Jiuyong Li, Hua Wang
Accurate next web page prediction benefits many applications, e-business in particular. The most widely used techniques for this purpose are Markov Model, association rules and clustering. However, each of these techniques has its own limitations, especially when it comes to accuracy and space complexity. This paper presents an improved prediction accuracy and state space complexity by using novel approaches that combine clustering, association rules and Markov Models. The three techniques are integrated together to maximise their strengths. The integration model has been shown to achieve better prediction accuracy than individual and other integrated models.
{"title":"An integrated model for next page access prediction","authors":"F. Khalil, Jiuyong Li, Hua Wang","doi":"10.1504/IJKWI.2009.027925","DOIUrl":"https://doi.org/10.1504/IJKWI.2009.027925","url":null,"abstract":"Accurate next web page prediction benefits many applications, e-business in particular. The most widely used techniques for this purpose are Markov Model, association rules and clustering. However, each of these techniques has its own limitations, especially when it comes to accuracy and space complexity. This paper presents an improved prediction accuracy and state space complexity by using novel approaches that combine clustering, association rules and Markov Models. The three techniques are integrated together to maximise their strengths. The integration model has been shown to achieve better prediction accuracy than individual and other integrated models.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131477495","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 : 1900-01-01DOI: 10.1504/IJKWI.2012.051285
Ryosuke Arasawa, Koichi Hanaue, Toyohide Watanabe
We propose a method for supporting story composition of folk-tales. Our idea is to derive events in a story and their order constraints from the outline specified by a storywriter. To achieve this, we introduce a technique of partial order planning, and represent the situations and the events in a story based on the framework of STRIPS. In our method, events and order constraints are derived according to the policy that respects the intentions of a storywriter specified in his/her outline. We investigated the effectiveness of the policy in a case study.
{"title":"Composition method of folk-tales based on STRIPS-like framework","authors":"Ryosuke Arasawa, Koichi Hanaue, Toyohide Watanabe","doi":"10.1504/IJKWI.2012.051285","DOIUrl":"https://doi.org/10.1504/IJKWI.2012.051285","url":null,"abstract":"We propose a method for supporting story composition of folk-tales. Our idea is to derive events in a story and their order constraints from the outline specified by a storywriter. To achieve this, we introduce a technique of partial order planning, and represent the situations and the events in a story based on the framework of STRIPS. In our method, events and order constraints are derived according to the policy that respects the intentions of a storywriter specified in his/her outline. We investigated the effectiveness of the policy in a case study.","PeriodicalId":113936,"journal":{"name":"Int. J. Knowl. Web Intell.","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125567385","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
扫码关注我们
求助内容：
应助结果提醒方式：