A hybrid harmony search with arithmetic crossover operation for economic dispatch

Economic dispatch (ED) problems often exhibit non-linear, non-convex characteristics due to the valve point effects. Further, various constraints and factors, such as prohibited operation zones, ramp rate limits and security constraints imposed by the generating units, and power loss in transmission make it even more challenging to obtain the global optimum using conventional mathematical methods. Meta-heuristic approaches are capable of solving non-linear, non-continuous and non-convex problems effectively as they impose no requirements on the optimization problems. However, most methods reported so far mainly focus on a specific type of ED problems, such as static or dynamic ED problems. This paper proposes a hybrid harmony search with arithmetic crossover operation, namely ACHS, for solving five different types of ED problems, including static ED with valve point effects, ED with prohibited operating zones, ED considering multiple fuel cells, combined heat and power ED, and dynamic ED. In this proposed ACHS, the global best information and arithmetic crossover are used to update the newly generated solution and speed up the convergence, which contributes to the algorithm exploitation capability. To balance the exploitation and exploration capabilities, the opposition based learning (OBL) strategy is employed to enhance the diversity of solutions. Further, four commonly used crossover operators are also investigated, and the arithmetic crossover shows its efficiency than the others when they are incorporated into HS. To make a comprehensive study on its scalability, ACHS is first tested on a group of benchmark functions with a 100 dimensions and compared with several state-of-the-art methods. Then it is used to solve seven different ED cases and compared with the results reported in literatures. All the results confirm the superiority of the ACHS for different optimization problems.

An experiment in group learning technology: evaluating critical thinking in face-to-face and computer-supported seminars

Can learning quality be maintained in the face of increasing class size by the use of Computer Supported Co-operative Learning (CSCL) technologies? In particular, can Computer-Mediated Communication promote critical thinking in addition to surface information transfer? We compared face-to-face seminars with asynchronous computer conferencing in the same Information Management class. From Garrison's theory of critical thinking and Henri's critical reasoning skills, we developed two ways of evaluating critical thinking: a student questionnaire and a content analysis technique. We found evidence for critical thinking in both situations, with some subtle differences in learning style. This paper provides an overview of this work.

A content analysis method to measure critical thinking in face-to-face and computer supported group learning

This paper gives a detailed account of the content analysis method developed at Queen's University Belfast to measure critical thinking during group learning, as used in our controlled comparisons between learning in face-to-face and computer conference seminars. From Garrison's 5 stages of critical thinking, and Henri's cognitive skills needed in CMC, we have developed two research instruments: a student questionnaire and this content analysis method. The content analysis relies on identifying, within transcripts, examples of indicators of obviously critical and obviously uncritical thinking, from which several critical thinking ratios can be calculated.

SK1-like functors for division algebras

We investigate the group valued functor G(D) = D*/F*D' where D is a division algebra with center F and D' the commutator subgroup of D*. We show that G has the most important functorial properties of the reduced Whitehead group SK1. We then establish a fundamental connection between this group, its residue version, and relative value group when D is a Henselian division algebra. The structure of G(D) turns out to carry significant information about the arithmetic of D. Along these lines, we employ G(D) to compute the group SK1(D). As an application, we obtain theorems of reduced K-theory which require heavy machinery, as simple examples of our method.