A group learning management method for intelligent tutoring systems

In this paper we propose a group management specification and execution method that seeks a compromise between simple course design and complex adaptive group interaction. This is achieved through an authoring method that proposes predefined scenarios to the author. These scenarios already include complex learning interaction protocols in which student and group models use and update are automatically included. The method adopts ontologies to represent domain and student models, and object Petri nets to specify the group interaction protocols. During execution, the method is supported by a multi-agent architecture

Innovative Evaluation System – IESM: An Architecture for the Database Management System for Mobile Application

As the mobile applications are constantly facing a rapid development in the recent years especially in the academic environment such as student response system [1-8] used in universities and other educational institutions; there has not been reported an effective and scalable Database Management System to support fast and reliable data storage and retrieval. This paper presents Database Management Architecture for an Innovative Evaluation System based on Mobile Learning Applications. The need for a relatively stable, independent and extensible data model for faster data storage and retrieval is analyzed and investigated. It concludes by emphasizing further investigation for high throughput so as to support multimedia data such as video clips, images and documents

Particle-based simulation of ellipse-shaped particle aggregation as a model for vascular network formation

Computational modelling is helpful for elucidating the cellular mechanisms driving biological morphogenesis. Previous simulation studies of blood vessel growth based on the Cellular Potts model (CPM) proposed that elongated, adhesive or mutually attractive endothelial cells suffice for the formation of blood vessel sprouts and vascular networks. Because each mathematical representation of a model introduces potential artifacts, it is important that model results are reproduced using alternative modelling paradigms. Here, we present a lattice-free, particle-based simulation of the cell elongation model of vasculogenesis. The new, particle-based simulations confirm the results obtained from the previous Cellular Potts simulations. Furthermore, our current findings suggest that the emergence of order is possible with the application of a high enough attractive force or, alternatively, a longer attraction radius. The methodology will be applicable to a range of problems in morphogenesis and noisy particle aggregation in which cell shape is a key determining factor.Comment: 9 pages, 11 figures, 2 supplementary videos (on Youtube), submitted to Computational Particle Mechanics, special issue: Jos\'e-Manuel Garcia Aznar (Ed.) Particle-based simulations on cell and biomolecular mechanic

Abstract State Machines 1988-1998: Commented ASM Bibliography

An annotated bibliography of papers which deal with or use Abstract State Machines (ASMs), as of January 1998.Comment: Also maintained as a BibTeX file at http://www.eecs.umich.edu/gasm

How the structure of precedence constraints may change the complexity class of scheduling problems

This survey aims at demonstrating that the structure of precedence constraints plays a tremendous role on the complexity of scheduling problems. Indeed many problems can be NP-hard when considering general precedence constraints, while they become polynomially solvable for particular precedence constraints. We also show that there still are many very exciting challenges in this research area

Bounds on the Number of Longest Common Subsequences

This paper performs the analysis necessary to bound the running time of known, efficient algorithms for generating all longest common subsequences. That is, we bound the running time as a function of input size for algorithms with time essentially proportional to the output size. This paper considers both the case of computing all distinct LCSs and the case of computing all LCS embeddings. Also included is an analysis of how much better the efficient algorithms are than the standard method of generating LCS embeddings. A full analysis is carried out with running times measured as a function of the total number of input characters, and much of the analysis is also provided for cases in which the two input sequences are of the same specified length or of two independently specified lengths.Comment: 13 pages. Corrected typos, corrected operation of hyperlinks, improved presentatio

Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing

This paper presents a general technique for optimally transforming any dynamic data structure that operates on atomic and indivisible keys by constant-time comparisons, into a data structure that handles unbounded-length keys whose comparison cost is not a constant. Examples of these keys are strings, multi-dimensional points, multiple-precision numbers, multi-key data (e.g.~records), XML paths, URL addresses, etc. The technique is more general than what has been done in previous work as no particular exploitation of the underlying structure of is required. The only requirement is that the insertion of a key must identify its predecessor or its successor. Using the proposed technique, online suffix tree can be constructed in worst case time $O(\log n)$ per input symbol (as opposed to amortized $O(\log n)$ time per symbol, achieved by previously known algorithms). To our knowledge, our algorithm is the first that achieves $O(\log n)$ worst case time per input symbol. Searching for a pattern of length $m$ in the resulting suffix tree takes $O(\min(m\log |\Sigma|, m + \log n) + tocc)$ time, where $tocc$ is the number of occurrences of the pattern. The paper also describes more applications and show how to obtain alternative methods for dealing with suffix sorting, dynamic lowest common ancestors and order maintenance