Classical planning in an intelligent tutoring system (poster session)

A. Wheeldon, J. Reye
{"title":"Classical planning in an intelligent tutoring system (poster session)","authors":"A. Wheeldon, J. Reye","doi":"10.1145/359369.359413","DOIUrl":null,"url":null,"abstract":"we store hash values that represent chunkg. Not only do we expect false positives because l~h functions can produce the same value for different chunks but also because the number of possible cbnnk.~ in Interuet-docomants onmumber the available mmaber of hash values. There are two ways to reduce index-space. We can either reduce the number ofchunk~ to be kept, which increases the chance of false negatives, or we can reduce the size of the hash value we calculate on each chunk, which increases the chance of false positives. False negatives are harder to handle because we have already missed potential documents. We propose a method that is able to ellm/nate false positives from a given set of documents. The comparison is completed in two phases. In the :first phase we define candiclate documents using the aforementioned methods and the second stage ellrn/nates false positives. Our algorithm for eliminating false positives uses a suffix tree built on the suspicious document to compare candidate documents and elim/nate accidental matches. Comparison of the chnnking methods and our algorithm are presented in this poster. Maintenance can be defined as the single most expensive activity in large software engineering projects, requiring 65% to 75% of total effort. Hence software engineering can be termed software evolution. The subject Software Engineering Practice (CSE2201) taught in the School of Computer Science and Software Engineering at Monash University is a second year core subject in an undergraduate degree program and comprises about 250 students per year. CSE2201 introduces software engineering concepts to students and expects students to view software engineering as an evolutionary process. Students are additionally introduced to and expected to implement the practical aspects of the Personal Software Process (PSP). We demonstrate the practice of teaching software evolution to undergraduate computing students in the Bachelor of Computing degree, and show how the four maintenance activities of corrective, adaptive, perfective and preventative can be included into the practical component of a software engineering course, providing students with a much more realistic view of software engineering. Expla-ations are needed to give feedback to students, as part of an Intelligent Tutoring System (ITS). A student submits an SQL query to the ITS as a solution to a question. When the query is incorrect the student receives an explanation, from the ITS, of how they can improve it so that it satisfies the task at hand. An expert enters an SQL …","PeriodicalId":435916,"journal":{"name":"African Conference on Software Engineering","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"African Conference on Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/359369.359413","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

we store hash values that represent chunkg. Not only do we expect false positives because l~h functions can produce the same value for different chunks but also because the number of possible cbnnk.~ in Interuet-docomants onmumber the available mmaber of hash values. There are two ways to reduce index-space. We can either reduce the number ofchunk~ to be kept, which increases the chance of false negatives, or we can reduce the size of the hash value we calculate on each chunk, which increases the chance of false positives. False negatives are harder to handle because we have already missed potential documents. We propose a method that is able to ellm/nate false positives from a given set of documents. The comparison is completed in two phases. In the :first phase we define candiclate documents using the aforementioned methods and the second stage ellrn/nates false positives. Our algorithm for eliminating false positives uses a suffix tree built on the suspicious document to compare candidate documents and elim/nate accidental matches. Comparison of the chnnking methods and our algorithm are presented in this poster. Maintenance can be defined as the single most expensive activity in large software engineering projects, requiring 65% to 75% of total effort. Hence software engineering can be termed software evolution. The subject Software Engineering Practice (CSE2201) taught in the School of Computer Science and Software Engineering at Monash University is a second year core subject in an undergraduate degree program and comprises about 250 students per year. CSE2201 introduces software engineering concepts to students and expects students to view software engineering as an evolutionary process. Students are additionally introduced to and expected to implement the practical aspects of the Personal Software Process (PSP). We demonstrate the practice of teaching software evolution to undergraduate computing students in the Bachelor of Computing degree, and show how the four maintenance activities of corrective, adaptive, perfective and preventative can be included into the practical component of a software engineering course, providing students with a much more realistic view of software engineering. Expla-ations are needed to give feedback to students, as part of an Intelligent Tutoring System (ITS). A student submits an SQL query to the ITS as a solution to a question. When the query is incorrect the student receives an explanation, from the ITS, of how they can improve it so that it satisfies the task at hand. An expert enters an SQL …
智能辅导系统中的经典规划(海报环节)
我们存储代表chunkg的哈希值。我们不仅期望误报,因为l~h函数可以为不同的块产生相同的值,而且还因为可能的区块数量。在internet - doccomants中~对可用的哈希值进行编号。有两种方法可以减少索引空间。我们可以减少要保留的块~的数量,这增加了假阴性的机会,或者我们可以减少我们在每个块上计算的哈希值的大小,这增加了假阳性的机会。假阴性更难处理,因为我们已经错过了潜在的文件。我们提出了一种能够从给定的一组文档中识别/识别误报的方法。比较分两个阶段完成。在第一阶段,我们使用上述方法定义候选文档,而在第二阶段,我们发现/排除误报。我们消除误报的算法使用在可疑文档上构建的后缀树来比较候选文档并剔除/淘汰意外匹配。在这张海报中,我们比较了这些方法和我们的算法。维护可以被定义为大型软件工程项目中最昂贵的活动,需要总工作量的65%到75%。因此,软件工程可以称为软件进化。莫纳什大学计算机科学与软件工程学院开设的软件工程实践课程(CSE2201)是本科学位课程的二年级核心课程,每年约有250名学生。CSE2201向学生介绍软件工程概念,并期望学生将软件工程视为一个进化过程。此外,学生还被介绍并期望实现个人软件过程(PSP)的实际方面。我们展示了在计算机学士学位的计算机本科生中教授软件进化的实践,并展示了如何将纠正性、适应性、完善性和预防性四种维护活动纳入软件工程课程的实践部分,为学生提供了一个更现实的软件工程观点。作为智能辅导系统(ITS)的一部分,需要向学生提供反馈。学生向ITS提交一个SQL查询作为问题的解决方案。当查询不正确时,学生会收到来自ITS的解释,告诉他们如何改进查询,使其满足手头的任务。专家输入一个SQL…
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信