1 January 2001 in Lecture Notes in Computer Science
8 July 2015 in International Journal of Modern Education and Computer Science
The rapid advancement of fully online courses has made education accessible from-anywhere‖ and-anytime‖. One of the major success factors of online courses is effective student-content interaction-which defines how students interact with the content in the fully online learning environment. However, there appears to have been little research published about the relationship of content to course design and consequent outcomes for students. In this article, we report on our research on the investigation of factors that affect student-content interaction in fully online computing courses. We have conducted our research through surveys and used a grounded theoretic approach for data analysis. Our results identify the factors that are perceived by students as critical in ensuring effective student-content interaction in fully online computing courses.
1 January 2003 in ACM Transactions on Computational Logic
We consider the problem of searching for proofs in sequential presentations of logics with multiplicative (or intensional) connectives. Specifically, we start with the multiplicative fragment of linear logic and extend, on the one hand, to linear logic with its additives and, on the other, to the additives of the logic of bunched implications ( BI ). We give an algebraic method for calculating the distribution of the side-formulæ in multiplicative rules which allows the occurrence or non-occurrence of a formula on a branch of a proof to be determined once sufficient information is available. Each formula in the conclusion of such a rule is assigned a Boolean expression. As a search proceeds, a set of Boolean constraint equations is generated. We show that a solution to such a set of equations determines a proof corresponding to the given search. We explain a range of strategies, from the lazy to the eager, for solving sets of constraint equations. We indicate how to apply our methods systematically to large family of relevant systems.
2 October 2013 in Autonomous Agents and Multi-Agent Systems