Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
We provide a general account of parallelism in discourse, and apply it to the special case of resolving possible readings for instances of VP ellipsis. We show how several problem...
—This paper reports the design and development processes of a totally decoupled flexure-based XYZ parallel-kinematics micropositioning stage with piezoelectric actuation. The un...
To address the server industry’s marketing focus on performance, benchmarking organizations have played a pivotal role in developing techniques to determine the maximum achievabl...
This paper describes the use of the reflective journal in a computer programming course at the University of South Australia. We describe rationale for the journal relating it to ...