Literacy, security, governmentality: Defining spaces, managing populations – How has education become part of whole of government security strategy?

In this paper I conduct a Foucauldian discourse analysis of a political speech given by Brendon Nelson in 2006 when the Australian Minister for Defence in the Howard Coalition Government. The speech connects conceptualisations of terror, globalization, education and literacy as part of a whole of government security strategy. The analysis examines this speech as an example of a liberal way of governing the conduct of diverse and unpredictable populations. My analysis suggests that the apparatus of government has been strategically used in order to biopolitically contain the rise of complex social forces and protect a set of homogenous cultural values. The purposes of education and uses of literacy are seen as instruments for the inscription of a coded set of values understood to be synonymous with civil society.

The relevance of composing: Children’s spaces for social agency

This chapter addresses the relevance of composing for young children in creating spaces for social agency. It begins with a working definition of agency, outlines forms of agency and what might constrain it. Referring to case studies of particular children, it then goes on to discuss key themes, which illuminate what is possible and what is at stake when children compose. These overlapping themes include identity (sense of self, belonging), positioning (helping, initiating, befriending, “being bright”), voices (made through sound effects, singing, language style, and appropriating from popular culture and digital worlds), play (appropriating, imagining, designing, and creating), and resistance (not participating, staying silent, moving). Two main cases are drawn upon, those of Ta’Von and Gareth, who demonstrate agency in terms of finding spaces of belonging and meaning-making occasions in the classroom and playground. Vignettes from other children are referred to in order to illustrate common themes.

Formal network behaviour analysis using model checking

In this research we modelled computer network devices to ensure their communication behaviours meet various network standards. By modelling devices as finite-state machines and examining their properties in a range of configurations, we discovered a flaw in a common network protocol and produced a technique to improve organisations' network security against data theft.

Formal security analysis of the DNP3-secure authentication protocol

This thesis evaluates the security of Supervisory Control and Data Acquisition (SCADA) systems, which are one of the key foundations of many critical infrastructures. Specifically, it examines one of the standardised SCADA protocols called the Distributed Network Protocol Version 3, which attempts to provide a security mechanism to ensure that messages transmitted between devices, are adequately secured from rogue applications. To achieve this, the thesis applies formal methods from theoretical computer science to formally analyse the correctness of the protocol.

Professional learning places and spaces: The staffroom as a site of beginning teacher induction and transition

This paper argues that the staffroom is an important professional learning space where beginning teachers interact to understand who they are and the nature of their professional work. The authors highlight the theoretical importance of space and place in the construction and negotiation of beginning teacher subjectivities. To illustrate the staffroom as a particular place where important professional learning could occur the authors use two narratives based on the lived experiences of two beginning teachers, one in a primary context, the other secondary. The authors conclude by calling for greater research attention to the significance of the staffroom and its interaction with teacher subjectivities. At the level of practice we also call for the teaching profession to recognise staffrooms as important sites of professional learning and places that should support induction and mentoring of beginning teachers. Such recognition could enhance the retention, satisfaction, and effectiveness of new and experienced teachers alike.

Situated interpretation in computational creativity

This paper describes, formalizes and implements an approach to computational creativity based on situated interpretation. The paper introduces the notions of framing and reframing of conceptual spaces based on empirical studies as the driver for this research. It uses concepts from situated cognition, and situated interpretation in particular, to be the basis of a formal model of the movement between conceptual spaces. This model is implemented using rules within interacting neural networks. This implementation demonstrates behaviour similar to that observed in studies of human designers.

A Team of Continuous-Action Learning Automata for Noise-Tolerant Learning of Half-Spaces

Learning automata are adaptive decision making devices that are found useful in a variety of machine learning and pattern recognition applications. Although most learning automata methods deal with the case of finitely many actions for the automaton, there are also models of continuous-action-set learning automata (CALA). A team of such CALA can be useful in stochastic optimization problems where one has access only to noise-corrupted values of the objective function. In this paper, we present a novel formulation for noise-tolerant learning of linear classifiers using a CALA team. We consider the general case of nonuniform noise, where the probability that the class label of an example is wrong may be a function of the feature vector of the example. The objective is to learn the underlying separating hyperplane given only such noisy examples. We present an algorithm employing a team of CALA and prove, under some conditions on the class conditional densities, that the algorithm achieves noise-tolerant learning as long as the probability of wrong label for any example is less than 0.5. We also present some empirical results to illustrate the effectiveness of the algorithm.

Stereoselective Formal Total Synthesis of (-)-Didemniserinolipid B

A formal total synthesis of (-)-didemniserinolipid B from L-(+)-tartaric acid is presented. Key features of the synthesis include construction of the bicyclic acetal core from bisdimethyl amide of tartaric acid and further elaboration by cross metathesis.

Holomorphic Sobolev spaces, Hermite and special Hermite semigroups and a Paley-Wiener theorem for the windowed Fourier transform

The images of Hermite and Laguerre-Sobolev spaces under the Hermite and special Hermite semigroups (respectively) are characterized. These are used to characterize the image of Schwartz class of rapidly decreasing functions f on R-n and C-n under these semigroups. The image of the space of tempered distributions is also considered and a Paley-Wiener theorem for the windowed (short-time) Fourier transform is proved.

Proximinality in Banach spaces

In this paper, we study approximatively τ-compact and τ-strongly Chebyshev sets, where τ is the norm or the weak topology. We show that the metric projection onto τ-strongly Chebyshev sets are norm-τ continuous. We characterize approximatively τ-compact and τ-strongly Chebyshev hyperplanes and use them to characterize factor reflexive proximinal subspaces in τ-almost locally uniformly rotund spaces. We also prove some stability results on approximatively τ-compact and τ-strongly Chebyshev subspaces.

Semigroups on Frechet spaces and equations with infinite delays

In this paper, we show existence and uniqueness of a solution to a functional differential equation with infinite delay. We choose an appropriate Frechet space so as to cover a large class of functions to be used as initial functions to obtain existence and uniqueness of solutions.

Formal Verification of Full-Wave Rectifier: A Case Study

We present a case study of formal verification of full-wave rectifier for analog and mixed signal designs. We have used the Checkmate tool from CMU [1], which is a public domain formal verification tool for hybrid systems. Due to the restriction imposed by Checkmate it necessitates to make the changes in the Checkmate implementation to implement the complex and non-linear system. Full-wave rectifier has been implemented by using the Checkmate custom blocks and the Simulink blocks from MATLAB from Math works. After establishing the required changes in the Checkmate implementation we are able to efficiently verify, the safety properties of the full-wave rectifier.

Semigroups on Frechet spaces and equations with infinite delays

In this paper, we show existence and uniqueness of a solution to a functional differential equation with infinite delay. We choose an appropriate Frechet space so as to cover a large class of functions to be used as initial functions to obtain existence and uniqueness of solutions.