Decision Models in the Design of Adaptive Educational Hypermedia Systems

Author(s):  
Demetrios G Sampson ◽  
Pythagoras Karampiperis

Several efforts have been reported in literature aiming to support the Adaptation Model (AM) design in Adaptive Educational Hypermedia Systems (AEHS) with either guidance for the direct definition of adaptation rules or semi-automated mechanisms that generate the AM through the implicit definition of such rules. The main drawback of the direct definition of adaptation rules is that there can be cases during the run-time execution of AEHS where no adaptation decision can be made, due to insufficiency and/or inconsistency of the pre-defined adaptation rule sets. The goal of the semi-automated, decision-based approaches is to generate a continuous decision function that estimates the desired AEHS response, aiming to overcome the above mentioned problem. However, such approaches still miss a commonly accepted framework for evaluating their performance. In this chapter, we review the design approaches for the definition of the AM in AEHS and discuss a set of performance evaluation metrics proposed by the literature for validating the use of decision-based approaches.

2021 ◽  
Vol 31 ◽  
Author(s):  
ANDREA VEZZOSI ◽  
ANDERS MÖRTBERG ◽  
ANDREAS ABEL

Abstract Proof assistants based on dependent type theory provide expressive languages for both programming and proving within the same system. However, all of the major implementations lack powerful extensionality principles for reasoning about equality, such as function and propositional extensionality. These principles are typically added axiomatically which disrupts the constructive properties of these systems. Cubical type theory provides a solution by giving computational meaning to Homotopy Type Theory and Univalent Foundations, in particular to the univalence axiom and higher inductive types (HITs). This paper describes an extension of the dependently typed functional programming language Agda with cubical primitives, making it into a full-blown proof assistant with native support for univalence and a general schema of HITs. These new primitives allow the direct definition of function and propositional extensionality as well as quotient types, all with computational content. Additionally, thanks also to copatterns, bisimilarity is equivalent to equality for coinductive types. The adoption of cubical type theory extends Agda with support for a wide range of extensionality principles, without sacrificing type checking and constructivity.


2011 ◽  
Vol 2011 ◽  
pp. 1-14 ◽  
Author(s):  
G. Boschetti ◽  
R. Rosa ◽  
A. Trevisani

Performance indexes usually provide global evaluations of robot performances mixing their translational and/or rotational capabilities. This paper proposes a definition of performance index, called direction-selective index (DSI), which has been specifically developed for parallel manipulators and can provide uncoupled evaluations of robot translational capabilities along relevant directions. The DSI formulation is first presented within a general framework, highlighting its relationship with traditional manipulability definitions, and then applied to a family of parallel manipulators (4-RUU) of industrial interest. The investigation is both numerical and experimental and allows highlighting the two chief advantages of the proposed DSIs over more conventional manipulability indexes: not only are DSIs more accurate in predicting the workspace regions where manipulators can best perform translational movements along specific directions, but also they allow foreseeing satisfactorily the dynamic performance variations within the workspace, though being purely kinematic indexes. The experiments have been carried out on an instrumented 4-RUU commercial robot.


2011 ◽  
Vol 39 (10) ◽  
pp. 2246-2252 ◽  
Author(s):  
Lynne Moore ◽  
Alexis F. Turgeon ◽  
Marcel Émond ◽  
Natalie Le Sage ◽  
André Lavoie

Author(s):  
Alexis G. Burgess ◽  
John P. Burgess

This chapter offers a simplified account of the most basic features of Alfred Tarski's model theory. Tarski foresaw important applications for a notion of truth in mathematics, but also saw that mathematicians were suspicious of that notion, and rightly so given the state of understanding of it circa 1930. In a series of papers in Polish, German, French, and English from the 1930s onward, Tarski attempted to rehabilitate the notion for use in mathematics, and his efforts had by the 1950s resulted in the creation of a branch of mathematical logic known as model theory. The chapter first considers Tarski's notion of truth, which he calls “semantic” truth, before discussing his views on object language and metalanguage, recursive versus direct definition of the truth predicate, and self-reference.


Author(s):  
Serena Ruggeri ◽  
Gianmauro Fontana ◽  
Irene Fassi ◽  
Giovanni Legnani

In precise manipulation and assembly of components with sub-millimetric dimensions, the role of the gripping tools is fundamental. In the literature, many different types of the so-called microgrippers have been presented, based on different working principles, to cope with the issues related to the gripping, the handling and the release of different micro-components. Depending on the component properties, the task requirements and the system constraints, a microgripper could be more suitable than another and allow the achievement of higher performance. However, the performance assessment of the microgrippers lacks of a standardized and quantitative methodology. Many authors declare the good capabilities of their tools in a qualitative way or according to the results obtained executing specific and different tasks. For this reason, it is often difficult to compare different microgrippers and estimate the actual results that can be obtained e.g. in the gripping or the release of a component. In this context, after a preliminary survey of the adopted approaches in literature and of their meaning, this paper investigates the conception and formalization of methods and procedures to evaluate the performance of a generic microgripper and the definition of standard performance indices to support the presentation of the microgripper characteristics.


2010 ◽  
Vol 20 (4) ◽  
pp. 655-703 ◽  
Author(s):  
LARS BIRKEDAL ◽  
KRISTIAN STØVRING ◽  
JACOB THAMSBORG

We present a realisability model for a call-by-value, higher-order programming language with parametric polymorphism, general first-class references, and recursive types. The main novelty is a relational interpretation of open types that include general reference types. The interpretation uses a new approach to modelling references.The universe of semantic types consists of world-indexed families of logical relations over a universal predomain. In order to model general reference types, worlds are finite maps from locations to semantic types: this introduces a circularity between semantic types and worlds that precludes a direct definition of either. Our solution is to solve a recursive equation in an appropriate category of metric spaces. In effect, types are interpreted using a Kripke logical relation over a recursively defined set of worlds.We illustrate how the model can be used to prove simple equivalences between different implementations of imperative abstract data types.


2014 ◽  
Vol 1037 ◽  
pp. 532-535
Author(s):  
Li Zhen Du ◽  
De Xin Tao ◽  
Lian Qing Yu

According to the definition of integrated supply chain performance, improved method of grey relational evaluation and multi-level dynamic fuzzy comprehensive evaluation method are adopted to comprehensively evaluate the overall performance of the integrated supply chain. Based on these, the Performance Evaluation System (PES) of the integrated supply chain is developed on MATLAB software platform. In the end, the validity and feasibility of the system is validated by an example, and the system can provide a convenient operation tool and scientific, objective decision basis for managers to evaluate the integrated supply chain performance.


Sign in / Sign up

Export Citation Format

Share Document