the aim of this study is to investigate iranian tefl graduates’ conception of measurement error in research. adopting a sequential explanatory multi-method strategy (borg, 2009), the researchers analyzed causal and temporal relations in the research narratives elicited from 30 tefl graduates. gee’s (1986) framework for identifying narrative discourse units (lines, stanzas, and episodes) was ado...

We study a dissimilarity measure between shapes, expressed by the natural pseudodistance between size pairs, where a shape is viewed as a topological space endowed with a real-valued continuous function. Measuring dissimilarity amounts to minimizing the change in the functions due to the application of homeomorphisms between topological spaces, with respect to the L∞-norm. A new class of shape ...

In this paper we answer a question posed by Sertel and Özkal-Sanver (2002) on the manipulability of optimal matching rules in matching problems with endowments. We characterize the classes of consumption rules under which optimal matching rules can be manipulated via predonation of endowment.

This article presents some of the facilities offered by our TraMiner R-package for clustering and visualizing sequence data. Firstly, we discuss our implementation of the optimal matching algorithm for evaluating the distance between two sequences and its use for generating a distance matrix for the whole sequence data set. Once such a matrix is obtained, we may use it as input for a cluster an...

We deene distances between geometric curves by the square root of the minimal energy required to transform one curve into the other. The energy is formally deened from a left invariant Riemannian distance on an innnite dimensional group acting on the curves, which can be explicitely computed. The obtained distance boils down to a variational problem for which an optimal matching between the cur...

We define distances between geometric curves by the square root of the minimal energy required to transform one curve into the other. The energy is formally defined from a left invariant Riemannian distance on an infinite dimensional group acting on the curves, which can be explicitely computed. The obtained distance boils down to a variational problem for which an optimal matching between the ...

In diesem Artikel wird das Verfahren und das Potenzial der Analyse von E-Learningprozessen mittels explorativ-heuristischer Optimal-Matching Analyse dargestellt. Ziel ist das Identifizieren von Mustern, Regelmäßigkeiten und Strukturen in Navigationsprozessen. E-Learning als Prozess der Interaktion von Lernern mit einer Online-Lernumgebung wird so analysierbar. Auf Grundlage der Levenshtein-Dist...