Highlighting hybridity: A critical discourse analysis of teacher talk in science classrooms

There is evidence that alienation from science is linked to the dominant discourse practices of science classrooms (cf. Lemke, J. L. (1990). Talking Science: Language, Learning, and Values. Norwood, NJ: Ablex). Yet, in secondary science education it is particularly hard to find evidence of curriculum reform that includes explicit changes in pedagogic discourses to accommodate the needs of students from a wide range of backgrounds. However, such evidence does exist and needs to be highlighted wherever it is found to help address social justice concerns in science education. In this article, I show how critical discourse analysis can be used to explore a way of challenging the dominant discourse in teacher-student interactions in science classrooms. My findings suggest a new way of moving toward more socially just science curricula in middle years and secondary classrooms by using hybrid discourses that can serve emancipatory purposes. © 2005 Wiley Periodicals. Inc.

An analysis of relational complexity in an air traffic control conflict detection task

Theoretical analyses of air traffic complexity were carried out using the Method for the Analysis of Relational Complexity. Twenty-two air traffic controllers examined static air traffic displays and were required to detect and resolve conflicts. Objective measures of performance included conflict detection time and accuracy. Subjective perceptions of mental workload were assessed by a complexity-sorting task and subjective ratings of the difficulty of different aspects of the task. A metric quantifying the complexity of pair-wise relations among aircraft was able to account for a substantial portion of the variance in the perceived complexity and difficulty of conflict detection problems, as well as reaction time. Other variables that influenced performance included the mean minimum separation between aircraft pairs and the amount of time that aircraft spent in conflict.

Evaluation of unsupervised semantic mapping of natural language with Leximancer concept mapping

The Leximancer system is a relatively new method for transforming lexical co-occurrence information from natural language into semantic patterns in an unsupervised manner. It employs two stages of co-occurrence information extraction-semantic and relational-using a different algorithm for each stage. The algorithms used are statistical, but they employ nonlinear dynamics and machine learning. This article is an attempt to validate the output of Leximancer, using a set of evaluation criteria taken from content analysis that are appropriate for knowledge discovery tasks.

The commentariat and discourse failure: language and atrocity in Cool Britannia

Recent terrorist events in the UK, such as the security alerts at British airports in August 2006 and the London bombings of July 2005 gained extensive media and academic analysis. This study contends, however, that much of the commentary demonstrated a wide degree of failure among government agencies, academic and analytic experts and the wider media, about the nature of the threat and continues to distort comprehension of the extant danger. The principal failure, this argument maintains, was, and continues to be, one of an asymmetry of comprehension that mistakes the still relatively limited means of violent jihadist radicals with limited political ends. The misapprehension often stems from the language that surrounds the idea of 'terrorism', which increasingly restricts debate to an intellectually redundant search for the 'root causes' that give rise to the politics of complacency. In recent times this outlook has consistently underestimated the level of the threat to the security of the UK. This article argues that a more realistic appreciation of the current security condition requires abandoning the prevailing view that the domestic threat is best prosecuted as a criminal conspiracy. It demands instead a total strategy to deal with a totalizing threat. The empirical evidence demonstrates the existence of a physical threat, not merely the political fear of threat. The implementation of a coherent set of social policies for confronting the threat at home recognizes that securing state borders and maintaining internal stability are the first tasks of government. Fundamentally, this requires a return to an understanding of the Hobbesian conditions for sovereignty, which, despite the delusions of post-Cold War cosmopolitan multiculturalism, never went away.

A Correlation Analysis on LSA and HAL Semantic Space Models

In this paper, we compare a well-known semantic spacemodel, Latent Semantic Analysis (LSA) with another model, Hyperspace Analogue to Language (HAL) which is widely used in different area, especially in automatic query refinement. We conduct this comparative analysis to prove our hypothesis that with respect to ability of extracting the lexical information from a corpus of text, LSA is quite similar to HAL. We regard HAL and LSA as black boxes. Through a Pearsonrsquos correlation analysis to the outputs of these two black boxes, we conclude that LSA highly co-relates with HAL and thus there is a justification that LSA and HAL can potentially play a similar role in the area of facilitating automatic query refinement. This paper evaluates LSA in a new application area and contributes an effective way to compare different semantic space models.

Timing analysis of assembler code control-flow paths

Timinganalysis of assembler code is essential to achieve the strongest possible guarantee of correctness for safety-critical, real-time software. Previous work has shown how timingconstrain ts on controlflow paths through high-level language programs can be formalised using the semantics of the statements comprisingthe path. We extend these results to assembler-level code where it becomes possible to not only determine timingconstrain ts, but also to verify them against the known execution times for each instruction. A minimal formal model is developed with both a weakest liberal precondition and a strongest postcondition semantics. However, despite the formalism’s simplicity, it is shown that complex timingb ehaviour associated with instruction pipeliningand iterative code can be modelled accurately.