James Harland

James Harland

Auto-generated profile, based on publicly available information

James Harland

RMIT University

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2001 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
MWMichael Winikoff
Michael Winikoff
LPLin Padgham
Lin Padgham
JHJames Harland
James Harland

8 July 2015 in International Journal of Modern Education and Computer Science
Verified
Journal Article
Open access
PDF file
DNDip Nandi
Dip Nandi
MHMargaret Hamilton
Margaret Hamilton
JHJames Harland
James Harland
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
Verified
Journal Article
Open access
JHJames Harland
James Harland
DPDavid Pym
David Pym
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
Verified
Journal Article
Closed access
PDF file
JHJames Harland
James Harland
DMDavid N. Morley
David N. Morley
JTJohn Thangarajah
John Thangarajah
Neil Yorke-SmithNeil Yorke-Smith
Neil Yorke-Smith


1 November 2007
Verified
Conference Paper
Closed access
NGNalaka Gooneratne
Nalaka Gooneratne
ZTZahir Tari
Zahir Tari
JHJames Harland
James Harland
Web service discovery requires matching techniques for comparing and selecting web service descriptions based on user constraints. Semantic-based approaches achieve higher recall than other approaches (such as syntax-based approaches), because they employ ontological reasoning mechanisms to match syntactically heterogeneous descriptions. However, existing semantic-based approaches are not scalable as they perform an exhaustive search to locate composite services that conform to global constraints. This paper proposes a semantic-based matching technique that locates composite services. It relates attributes of services to a common attribute to ensure that they have the same scope. This enables the assigned values to be compared and evaluated against a given global constraint. Conforming composite services are located in polynomial time with a three-dimensional data structure that indexes services based on their types, attributes and the assigned values. Simulation results indicate that the proposed approach achieves higher recall than syntax-based approaches and is more scalable than existing semantic-based approaches.