Show simple item record  

dc.contributor.authorPaynter, Gordon W.en_NZ
dc.date.accessioned2007-05-09T09:34:41Z
dc.date.available2007-05-09T09:35:29Z
dc.date.issued2000en_NZ
dc.identifier.citationPaynter, G. W. (2000). Automating iterative tasks with programming by demonstration (Thesis, Doctor of Philosophy (PhD)). The University of Waikato, Hamilton, New Zealand. Retrieved from https://hdl.handle.net/10289/2587en
dc.identifier.urihttps://hdl.handle.net/10289/2587
dc.description.abstractProgramming by demonstration is an end-user programming technique that allows people to create programs by showing the computer examples of what they want to do. Users do not need specialised programming skills. Instead, they instruct the computer by demonstrating examples, much as they might show another person how to do the task. Programming by demonstration empowers users to create programs that perform tedious and time-consuming computer chores. However, it is not in widespread use, and is instead confined to research applications that end users never see. This makes it difficult to evaluate programming by demonstration tools and techniques. This thesis claims that domain-independent programming by demonstration can be made available in existing applications and used to automate iterative tasks by end users. It is supported by Familiar, a domain-independent, AppleScript-based programming-by-demonstration tool embodying standard machine learning algorithms. Familiar is designed for end users, so works in the existing applications that they regularly use. The assertion that programming by demonstration can be made available in existing applications is validated by identifying the relevant platform requirements and a range of platforms that meet them. A detailed scrutiny of AppleScript highlights problems with the architecture and with many implementations, and yields a set of guidelines for designing applications that support programming-by-demonstration. An evaluation shows that end users are capable of using programming by demonstration to automate iterative tasks. However, the subjects tended to prefer other tools, choosing Familiar only when the alternatives were unsuitable or unavailable. Familiar's inferencing is evaluated on an extensive set of examples, highlighting the tasks it can perform and the functionality it requires.en_NZ
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherThe University of Waikatoen_NZ
dc.rightsAll items in Research Commons are provided for private study and research purposes and are protected by copyright with all rights reserved unless otherwise indicated.
dc.subjectprogramming by demonstrationen_NZ
dc.subjectiterative tasksen_NZ
dc.subjectprogramming techniquesen_NZ
dc.titleAutomating iterative tasks with programming by demonstrationen_NZ
dc.typeThesisen_NZ
thesis.degree.disciplineComputer Scienceen_NZ
thesis.degree.grantorUniversity of Waikatoen_NZ
thesis.degree.levelDoctoral
thesis.degree.nameDoctor of Philosophy (PhD)en_NZ
uow.date.accession2007-05-09T09:34:41Zen_NZ
uow.date.available2007-05-09T09:35:29Zen_NZ
uow.identifier.adthttp://adt.waikato.ac.nz/public/adt-uow20070509.093441en_NZ
uow.date.migrated2009-06-14T21:34:11Zen_NZ
pubs.place-of-publicationHamilton, New Zealanden_NZ


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record