Issues in designing learning by teaching systems

Abstract: Learning by teaching systems are a relatively recent approach to designing Intelligent Learning Environments that place learners in the role of tutors. These systems are based on the practice of peer tutoring where students take on defined roles of tutor and tutee. An architecture for learning by teaching systems is described that does not require the domain model of an Intelligent Tutoring System. However a mutual communication language is needed and is defined by a conceptual syntax that delimits the domain content of the dialogue. An example learning by teaching system is described for the domain of qualitative economics. The construction and testing of this system inform a discussion of the major design issues involved: the nature of the learnt model, the form of the conceptual syntax, the control of the interaction and the possible introduction of domain knowledge. 1

Design as conversation with digital materials

This paper explores Donald Schön's concept of design as a conversation with materials, in the context of designing digital systems. It proposes material utterance as a central event in designing. A material utterance is a situated communication act that depends on the particularities of speaker, audience, material and genre. The paper argues that, if digital designing differs from other forms of designing, then accounts for such differences must be sought by understanding the material properties of digital systems and the genres of practice that surround their use. Perspectives from human-computer interaction (HCI) and the psychology of programming are used to examine how such an understanding might be constructed.</p

A graphical user interface for Boolean query specification

On-line information repositories commonly provide keyword search facilities via textual query languages based on Boolean logic. However, there is evidence to suggest that the syntactical demands of such languages can lead to user errors and adversely affect the time that it takes users to form queries. Users also face difficulties because of the conflict in semantics between AND and OR when used in Boolean logic and English language. We suggest that graphical query languages, in particular Venn-like diagrams, can alleviate the problems that users experience when forming Boolean expressions with textual languages. We describe Vquery, a Venn-diagram based user interface to the New Zealand Digital Library (NZDL). The design of Vquery has been partly motivated by analysis of NZDL usage. We found that few queries contain more than three terms, use of the intersection operator dominates and that query refinement is common. A study of the utility of Venn diagrams for query specification indicates that with little or no training users can interpret and form Venn-like diagrams which accurately correspond to Boolean expressions. The utility of Vquery is considered and directions for future work are proposed

Study to determine potential flight applications and human factors design guidelines for voice recognition and synthesis systems

A study was conducted to determine potential commercial aircraft flight deck applications and implementation guidelines for voice recognition and synthesis. At first, a survey of voice recognition and synthesis technology was undertaken to develop a working knowledge base. Then, numerous potential aircraft and simulator flight deck voice applications were identified and each proposed application was rated on a number of criteria in order to achieve an overall payoff rating. The potential voice recognition applications fell into five general categories: programming, interrogation, data entry, switch and mode selection, and continuous/time-critical action control. The ratings of the first three categories showed the most promise of being beneficial to flight deck operations. Possible applications of voice synthesis systems were categorized as automatic or pilot selectable and many were rated as being potentially beneficial. In addition, voice system implementation guidelines and pertinent performance criteria are proposed. Finally, the findings of this study are compared with those made in a recent NASA study of a 1995 transport concept

Computer-Assisted Program Reasoning Based on a Relational Semantics of Programs

We present an approach to program reasoning which inserts between a program and its verification conditions an additional layer, the denotation of the program expressed in a declarative form. The program is first translated into its denotation from which subsequently the verification conditions are generated. However, even before (and independently of) any verification attempt, one may investigate the denotation itself to get insight into the "semantic essence" of the program, in particular to see whether the denotation indeed gives reason to believe that the program has the expected behavior. Errors in the program and in the meta-information may thus be detected and fixed prior to actually performing the formal verification. More concretely, following the relational approach to program semantics, we model the effect of a program as a binary relation on program states. A formal calculus is devised to derive from a program a logic formula that describes this relation and is subject for inspection and manipulation. We have implemented this idea in a comprehensive form in the RISC ProgramExplorer, a new program reasoning environment for educational purposes which encompasses the previously developed RISC ProofNavigator as an interactive proving assistant.Comment: In Proceedings THedu'11, arXiv:1202.453