A pilot study utilising cross-age peer tutoring as a method of intervention for anxious adolescents

Anxiety disorders are the most common psychopathology experienced by young people, with up to 18% of adolescents developing an anxiety disorder. The consequences of these disorders, if left untreated, include impaired peer relationships, school absenteeism and self-concept problems. In addition, anxiety disorders may play a causal role in the development of depression in young people, precede eating disorders and predispose adolescents to substance abuse disorders. While the school is often chosen as a place to provide early intervention for this debilitating disorder, the fact that excessive anxiety is often not recognised in school and that young people are reluctant to seek help, makes identifying these adolescents difficult. Even when these young people are identified, there are problems in providing sensitive programs which are not stigmatising to them within a school setting. One method which may engage this adolescent population could be cross-age peer tutoring. This paper reports on a small pilot study using the “Worrybusters” program and a cross-age peer tutoring method to engage the anxious adolescents. These anxious secondary school students planned activities for teacher-referred anxious primary school students for a term in the high school setting and then delivered those activities to the younger students weekly in the next term in the primary school. Although the secondary school students decreased their scores on anxiety self-report measures there were no significant differences for primary school students’ self-reports. However, the primary school parent reports indicated a significant decrease in their child’s anxiety.

Practice as method : the ex/centric fixations project

In the past decade, scholars have proposed a range of terms to describe the relationship between practice and research in the creative arts, including increasingly nuanced definitions of practice-based research, practice-led research and practice-as-research. In this paper, I consider the efficacy of creative practice as method. I use the example of The Ex/Centric Fixations Project – a project in which I have embedded creative practice in a research project, rather than embedding research in a creative project. The Ex/Centric Fixations project investigates the way spectators interpret human experiences – especially human experiences of difference, marginalisation or discrimination – depicted onstage. In particular, it investigates the way postmodern performance writing strategies, and the presence of performing bodied to which the experience depicted can be attached, impacts on interpretations. It is part of a broader research project which examines the performativity of spectatorship, and intervenes in emergent debates about performance, ethics and spectatorship in the context of debate about whether live performance is a privileged site for the emergence of an ethical face-to-face encounter with the Other. Using the metaphor of the Mobius strip, I examines the way practice – as a method, rather than an output – has informed, influenced and problematised the broader research project.

Fast searching algorithm for candidate satellite-node set in NLMG

The Node-based Local Mesh Generation (NLMG) algorithm, which is free of mesh inconsistency, is one of core algorithms in the Node-based Local Finite Element Method (NLFEM) to achieve the seamless link between mesh generation and stiffness matrix calculation, and the seamless link helps to improve the parallel efficiency of FEM. Furthermore, the key to ensure the efficiency and reliability of NLMG is to determine the candidate satellite-node set of a central node quickly and accurately. This paper develops a Fast Local Search Method based on Uniform Bucket (FLSMUB) and a Fast Local Search Method based on Multilayer Bucket (FLSMMB), and applies them successfully to the decisive problems, i.e. presenting the candidate satellite-node set of any central node in NLMG algorithm. Using FLSMUB or FLSMMB, the NLMG algorithm becomes a practical tool to reduce the parallel computation cost of FEM. Parallel numerical experiments validate that either FLSMUB or FLSMMB is fast, reliable and efficient for their suitable problems and that they are especially effective for computing the large-scale parallel problems.

Metal oxide nanofibres membranes assembled by spin-coating method

Ceramic membranes are of particular interest in many industrial processes due to their ability to function under extreme conditions while maintaining their chemical and thermal stability. Major structural deficiencies under conventional fabrication approach are pin-holes and cracks, and the dramatic losses of flux when pore sizes are reduced to enhance selectivity. We overcome these structural deficiencies by constructing hierarchically structured separation layer on a porous substrate using larger titanate nanofibres and smaller boehmite nanofibres. This yields a radical change in membrane texture. The differences in the porous supports have no substantial influences on the texture of resulting membranes. The membranes with top layer of nanofibres coated on different porous supports by spin-coating method have similar size of the filtration pores, which is in a range of 10–100 nm. These membranes are able to effectively filter out species larger than 60 nm at flow rates orders of magnitude greater than conventional membranes. The retention can attain more than 95%, while maintaining a high flux rate about 900 L m-2 h. The calcination after spin-coating creates solid linkages between the fibres and between fibres and substrate, in addition to convert boehmite into -alumina nanofibres. This reveals a new direction in membrane fabrication.

Krylov subspace methods for approximating functions of symmetric positive definite matrices with applications to applied statistics and anomalous diffusion

Matrix function approximation is a current focus of worldwide interest and finds application in a variety of areas of applied mathematics and statistics. In this thesis we focus on the approximation of A^(-α/2)b, where A ∈ ℝ^(n×n) is a large, sparse symmetric positive definite matrix and b ∈ ℝ^n is a vector. In particular, we will focus on matrix function techniques for sampling from Gaussian Markov random fields in applied statistics and the solution of fractional-in-space partial differential equations. Gaussian Markov random fields (GMRFs) are multivariate normal random variables characterised by a sparse precision (inverse covariance) matrix. GMRFs are popular models in computational spatial statistics as the sparse structure can be exploited, typically through the use of the sparse Cholesky decomposition, to construct fast sampling methods. It is well known, however, that for sufficiently large problems, iterative methods for solving linear systems outperform direct methods. Fractional-in-space partial differential equations arise in models of processes undergoing anomalous diffusion. Unfortunately, as the fractional Laplacian is a non-local operator, numerical methods based on the direct discretisation of these equations typically requires the solution of dense linear systems, which is impractical for fine discretisations. In this thesis, novel applications of Krylov subspace approximations to matrix functions for both of these problems are investigated. Matrix functions arise when sampling from a GMRF by noting that the Cholesky decomposition A = LL^T is, essentially, a `square root' of the precision matrix A. Therefore, we can replace the usual sampling method, which forms x = L^(-T)z, with x = A^(-1/2)z, where z is a vector of independent and identically distributed standard normal random variables. Similarly, the matrix transfer technique can be used to build solutions to the fractional Poisson equation of the form ϕn = A^(-α/2)b, where A is the finite difference approximation to the Laplacian. Hence both applications require the approximation of f(A)b, where f(t) = t^(-α/2) and A is sparse. In this thesis we will compare the Lanczos approximation, the shift-and-invert Lanczos approximation, the extended Krylov subspace method, rational approximations and the restarted Lanczos approximation for approximating matrix functions of this form. A number of new and novel results are presented in this thesis. Firstly, we prove the convergence of the matrix transfer technique for the solution of the fractional Poisson equation and we give conditions by which the finite difference discretisation can be replaced by other methods for discretising the Laplacian. We then investigate a number of methods for approximating matrix functions of the form A^(-α/2)b and investigate stopping criteria for these methods. In particular, we derive a new method for restarting the Lanczos approximation to f(A)b. We then apply these techniques to the problem of sampling from a GMRF and construct a full suite of methods for sampling conditioned on linear constraints and approximating the likelihood. Finally, we consider the problem of sampling from a generalised Matern random field, which combines our techniques for solving fractional-in-space partial differential equations with our method for sampling from GMRFs.

Numerical method and analytical technique of the modified anomalous subdiffusion equation with a nonlinear source term

In this paper, we consider a modified anomalous subdiffusion equation with a nonlinear source term for describing processes that become less anomalous as time progresses by the inclusion of a second fractional time derivative acting on the diffusion term. A new implicit difference method is constructed. The stability and convergence are discussed using a new energy method. Finally, some numerical examples are given. The numerical results demonstrate the effectiveness of theoretical analysis

Stability and convergence of an implicit numerical method for the non-linear fractional reaction-subdiffusion process

In this paper, we consider the following non-linear fractional reaction–subdiffusion process (NFR-SubDP): Formula where f(u, x, t) is a linear function of u, the function g(u, x, t) satisfies the Lipschitz condition and 0Dt1–{gamma} is the Riemann–Liouville time fractional partial derivative of order 1 – {gamma}. We propose a new computationally efficient numerical technique to simulate the process. Firstly, the NFR-SubDP is decoupled, which is equivalent to solving a non-linear fractional reaction–subdiffusion equation (NFR-SubDE). Secondly, we propose an implicit numerical method to approximate the NFR-SubDE. Thirdly, the stability and convergence of the method are discussed using a new energy method. Finally, some numerical examples are presented to show the application of the present technique. This method and supporting theoretical results can also be applied to fractional integrodifferential equations.

Marx as critical discourse analyst : the genesis of a critical method and its relevance to the critique of global capital.

In this paper we identify elements in Marx´s economic and political writings that are relevant to contemporary critical discourse analysis (CDA). We argue that Marx can be seen to be engaging in a form of discourse analysis. We identify the elements in Marx´s historical materialist method that support such a perspective, and exemplify these in a longitudinal comparison of Marx´s texts.

Design of self-turning controllers for two terminal HVDC link

This paper presents the design of self-tuning controllers for a two terminal HVDC link. The controllers are designed utilizing a novel discrete-time converter model based on multirate sampling. The nature of converter firing system necessitates the development of a two-step ahead self-tuning control strategy. A two terminal HVDC system study has been carried out to show the effectiveness of the control strategies proposed which include the design of minimum variance controller, pole assigned controller and PLQG controller. The coordinated control of a two terminal HVDC system has been established deriving the signal from inverter end current and voltage which has been estimated based on the measurements of rectifier end quantities only realized through the robust reduced order observer. A well known scaled down sample system data has been selected for studies and the controllers designed have been tested for worst conditions. The performance of self-tuning controllers has been evaluated through digital simulation.

The relationship between subjective appetite sensations, markers of inflammation and appetite in dialysis patients

Background: Poor appetite is a marker of morbidity and mortality in hemodialysis patients, making it an important area for research. Visual analog scales (VAS) can capture a range of subjective sensations related to appetite (such as hunger, desire to eat or fullness), but have not been commonly used to measure appetite in dialysis patients. The aim of this study was to explore the association between retrospective ratings of appetite using VAS and a range of clinical variables as well as biomarkers of appetite in hemodialysis patients.----- Methods: 28 hemodialysis patients (mean age 61±17y, 50% male, median dialysis vintage 19.5(4-101) months) rated their appetite using VAS for hunger, fullness and desire to eat and a 5-point categorical scale measuring general appetite. Blood levels of the appetite peptides leptin, ghrelin and peptide YY were also measured.----- Results: Hunger ratings measured by VAS were significantly (p<0.05) correlated with a range of clinical, nutritional and inflammatory markers: age (r=-0.376), co-morbidities, (r=-0.380) PG-SGA score (r=-0.451), weight (r=-0.375), fat-free mass (r=-0.435), C-Reactive Protein (CRP) (r=-0.383) and Intercellular adhesion molecule (sICAM-1) (r=-0.387). There was a consistent relationship between VAS and appetite on a 5-point categorical scale for questions of hunger, and a similar trend for desire to eat, but not for fullness. Neither method of measuring subjective appetite correlated with appetite peptides.----- Conclusions: Retrospective ratings of hunger on a VAS are associated with a range of clinical variables and further studies are warranted to support their use as a method of measuring appetite in dialysis patients.

Generation in context : an exploratory method for musical enquiry

This paper discusses a method, Generation in Context, for interrogating theories of music analysis and music perception. Given an analytic theory, the method consists of creating a generative process that implements the theory in reverse. Instead of using the theory to create analyses from scores, the theory is used to generate scores from analyses. Subjective evaluation of the quality of the musical output provides a mechanism for testing the theory in a contextually robust fashion. The method is exploratory, meaning that in addition to testing extant theories it provides a general mechanism for generating new theoretical insights. We outline our initial explorations in the use of generative processes for music research, and we discuss how generative processes provide evidence as to the veracity of theories about how music is experienced, with insights into how these theories may be improved and, concurrently, provide new techniques for music creation. We conclude that Generation in Context will help reveal new perspectives on our understanding of music.

Generating rules with predicates, terms and variables from the pruned neural networks

Artificial neural networks (ANN) have demonstrated good predictive performance in a wide range of applications. They are, however, not considered sufficient for knowledge representation because of their inability to represent the reasoning process succinctly. This paper proposes a novel methodology Gyan that represents the knowledge of a trained network in the form of restricted first-order predicate rules. The empirical results demonstrate that an equivalent symbolic interpretation in the form of rules with predicates, terms and variables can be derived describing the overall behaviour of the trained ANN with improved comprehensibility while maintaining the accuracy and fidelity of the propositional rules.

Link-the-Wiki : performance evaluation based on frequent phrases

In this paper, we discuss our participation to the INEX 2008 Link-the-Wiki track. We utilized a sliding window based algorithm to extract the frequent terms and phrases. Using the extracted phrases and term as descriptive vectors, the anchors and relevant links (both incoming and outgoing) are recognized efficiently.

Type Test Elimination using Typeflow Analysis

Programs written in languages of the Oberon family usually contain runtime tests on the dynamic type of variables. In some cases it may be desirable to reduce the number of such tests. Typeflow analysis is a static method of determining bounds on the types that objects may possess at runtime. We show that this analysis is able to reduce the number of tests in certain plausible circumstances. Furthermore, the same analysis is able to detect certain program errors at compile time, which would normally only be detected at program execution. This paper introduces the concepts of typeflow analysis and details its use in the reduction of runtime overhead in Oberon-2.