This study examined the effects of task complexity on written narrative production under different task complexity conditions by EFL learners at different proficiency levels. Task complexity was manipulated along Robinson’s (2001b) proposed task complexity dimension of Here-and-Now (simple) vs. There-and-Then (complex) in. Accordingly, three specific measures of the written narratives were targ...

We define a multi-modal version of Computation Tree Logic (ctl) by extending the language with path quantifiers Eδ and Aδ where δ denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a ctl axiomatisation for each dimension. Completeness is proved by employing the complete...

Multi-Agent Systems (MAS) is a promising software paradigm. Considered as a natural metaphor to modeling complex systems, MAS are applied to develop a wide range of applications. However, the developed system’s complexity is a hard obstacle to understand and maintain them. In this paper, some metrics are presented to measure the complexity of MAS. The proposition of these metrics is passed thro...

the notion of sustainable development has rapidly gained considerable attention since the lastdecades of the twentieth century. it has become a locus for global paradigm shift on environment and development issues particularly after rio conference in 1992. the comparative analysis of agenda 21 and major un documents, mdg, and rio+20 as well as some major sources are made to provide a context fo...

Transferring knowledge across a sequence of reinforcement-learning tasks is challenging, and has a number of important applications. Though there is encouraging empirical evidence that transfer can improve performance in subsequent reinforcement-learning tasks, there has been very little theoretical analysis. In this paper, we introduce a new multi-task algorithm for a sequence of reinforcement...

Restricted complexity controller design for the active suspension benchmark problem [1] is considered. The control design specifications of the benchmark is firstly recast into a mixed H∞/l1 optimisation problem, which is solved via a convex optimisation approach. A globally optimal Pareto curve is produced via the optimisation. It presents the limits of performance and is served as a reference...