The implementation we have used in our experiment is a distributed implementation on top of CORBA [3, 2].
Sample text:```Following the experimental design proposed in Yannakakis and Hallam (2007c) and Yannakakis et al. (2008) for effectively capturing the level of entertainment, the test-bed game under investigation is played in variants.```
Sample intent: background
Sample text:```Following the experimental design proposed in Yannakakis and Hallam (2007c) and Yannakakis et al. (2008) for effectively capturing the level of entertainment, the test-bed game under investigation is played in variants.```
Sample intent: background



Sample text:```Our results confi rm previous studies that reached the same conclusion (Boushey et al 1994; Vermeulen et al 2000; Till et al 2005; Marcucci et al 2005).```
Sample intent: result



Sample text:```On the other hand, there are research works on the design of graph-based routing algorithms [3], [16], [17], [18], [19], [20], [21], [22], [23] to deal with the void problem.```
Sample intent: method



Sample text:```The D-HOTM system is based on the Text Mining Infrast ucture (TMI) developed by the parallel and distributed text mining lab at Lehigh University [20].```
Sample intent: background



Sample text:```[19] showed that the system quality and information quality perceived by virtual community users significantly impacts their perceived benefits of participation in virtual communities.```
Sample intent: method
Sample text:```From a strategic viewpoint, layered modular architectures have the competitive advantage, as well as the challenge, in being doubly distributed [57].```
Sample intent: method



Sample text:```Our results further confirm previous findings on the differential regulatory mechanisms for Hoxa3 and Hoxb3 expression in r5 and r6 by kreisler (Manzanares et al., 1997, 1999a,b, 2001).```
Sample intent: result



Sample text:```Here we analyse the sustainability of the initiative over a 32-month period of operations, using a modified version of a framework developed by Sarriot et al. (2004a).```
Sample intent: background



Sample text:```This seems to be the main drawback of the current implementation in comparison to the method of Black Jepson (“refined” in Table 1).```
Sample intent: result



Sample text:```NP3L [10] is consistently outperformed by our methods, while for UPnP [8] our NPnLupC outperforms it in the noisy cases.```
Sample intent: background



Sample text:```Following the experimental design proposed in Yannakakis and Hallam (2007c) and Yannakakis et al. (2008) for effectively capturing the level of entertainment, the test-bed game under investigation is played in variants.```
Sample intent: background



Sample text:```Our results confi rm previous studies that reached the same conclusion (Boushey et al 1994; Vermeulen et al 2000; Till et al 2005; Marcucci et al 2005).```
Sample intent: result



Sample text:```have been proposed as potential alternatives to the Turing Test, specifically targeting its potential weaknesses and inadequacy [1].```
Sample intent: background



Sample text:```On the other hand, there are research works on the design of graph-based routing algorithms [3], [16], [17], [18], [19], [20], [21], [22], [23] to deal with the void problem.```
Sample intent: method



Sample text:```Discrepancies analogous to those between our results and those of simulations have, indeed, recently been observed in the case of the binary perceptron [18], the pspin interaction spin glass [19], and in the case of fluctuating manifolds in random media [20], where dynamically frozen phases were observed in regions of parameter space in which static approaches yielded ergodic phases.```
Sample intent: result