A mass-conservative control volume-finite element method for solving Richards’ equation in heterogeneous porous media

We present a mass-conservative vertex-centred finite volume method for efficiently solving the mixed form of Richards’ equation in heterogeneous porous media. The spatial discretisation is particularly well-suited to heterogeneous media because it produces consistent flux approximations at quadrature points where material properties are continuous. Combined with the method of lines, the spatial discretisation gives a set of differential algebraic equations amenable to solution using higher-order implicit solvers. We investigate the solution of the mixed form using a Jacobian-free inexact Newton solver, which requires the solution of an extra variable for each node in the mesh compared to the pressure-head form. By exploiting the structure of the Jacobian for the mixed form, the size of the preconditioner is reduced to that for the pressure-head form, and there is minimal computational overhead for solving the mixed form. The proposed formulation is tested on two challenging test problems. The solutions from the new formulation offer conservation of mass at least one order of magnitude more accurate than a pressure head formulation, and the higher-order temporal integration significantly improves both the mass balance and computational efficiency of the solution.

The media and parliament

For decades, indeed centuries, the Scottish media have been a source of national pride. Alongside the education system, the Church of Scotland and the legal apparatus the media have been rightly viewed as a distinctive Scottish cultural institution, a key part of what makes Scotland a nation rather than a region. Scotland has long sustained, per capita, one of the richest and most diverse media systems in the world, encapsulating a heady mix of local newspapers such as the West Highland Free Press, national [i.e., Scotland-wide] newspapers and broadcast outlets such as BBC Scotland and the Scotsman, and UK-based media with Scottish editions such as the Sun and the Mail. These media have reflected and fuelled what is in turn a distinctive Scottish political identity separate from, though connected with that of the United Kingdom as a whole. There has, for example, been no major paper with a pro-Tory editorial line north of the border for longer than most of us can remember, reflecting (and perhaps contributing to) the Conservative Party’s poor showing in successive Scottish elections.

The Scottish media and politics

This chapter will explore the performance of the Scottish media in post-devolution political life, before turning its attention to the specific coverage of the 2007 election.

Diversity in action : minority group media and social change (text-only version)

This magazine, written by Melissa Giles, features three Brisbane-based media organisations: Radio 4RPH, Queensland Pride and 98.9FM. The PDF file on this website contains a text-only version of the magazine. Contact the author if you would like a copy of the text-only EPUB file or a copy of the full digital magazine with images. An audio version of the magazine is available at http://eprints.qut.edu.au/41729/

How does media play and ICT fit in the early childhood context?

In this chapter, Shaleen Prowse describes teaching strategies for media education and information communication technologies (ICT) and how young children’s experiences with tools of technology at home are an important starting point for building learning experiences within the classroom setting. She illustrates how digital cameras and computer editing software assist young children to share their learning.

Start playing with your food : fun food experiences with mobile social media

Healthy and sustainable food is gaining more attention from consumers, industry, and researchers. Yet many approaches to date are limited to information dissemination, advertisement or education. We have embarked on a three year collaborative research project (2011 – 2013) to explore urban food practices – eating, cooking, growing food – to support the well-being of people and the environment. Our overall goal is to employ a user-centred interaction design research approach to inform the development of entertaining, real-time, mobile and networked applications, engaging playful feedback to build motivation. Our aspiration for this study is to deliver usable and useful mobile and situated interaction prototypes that employ individual and group strategies to foster food cultures that provide new pathways to produce, share and enjoy food that is green, healthy, and fun.

The 2008 Tibet riots : perspectives, divided group protests and divergent media narratives

Awareness of the power of the mass media to communicate images of protest to global audiences and, in so doing, to capture space in global media discourses is a central feature of the transnational protest movement. A number of protest movements have formed around opposition to concepts and practices that operate beyond national borders, such as neoliberal globalization or threats to the environment. However, transnational protests also involve more geographically discreet issues such as claims to national independence or greater religious or political freedom by groups within specific national contexts. Appealing to the international community for support is a familiar strategy for communities who feel that they are being discriminated against or ignored by a national government.

The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network

Sample complexity results from computational learning theory, when applied to neural network learning for pattern classification problems, suggest that for good generalization performance the number of training examples should grow at least linearly with the number of adjustable parameters in the network. Results in this paper show that if a large neural network is used for a pattern classification problem and the learning algorithm finds a network with small weights that has small squared error on the training patterns, then the generalization performance depends on the size of the weights rather than the number of weights. For example, consider a two-layer feedforward network of sigmoid units, in which the sum of the magnitudes of the weights associated with each unit is bounded by A and the input dimension is n. We show that the misclassification probability is no more than a certain error estimate (that is related to squared error on the training set) plus A3 √((log n)/m) (ignoring log A and log m factors), where m is the number of training patterns. This may explain the generalization performance of neural networks, particularly when the number of training examples is considerably smaller than the number of weights. It also supports heuristics (such as weight decay and early stopping) that attempt to keep the weights small during training. The proof techniques appear to be useful for the analysis of other pattern classifiers: when the input domain is a totally bounded metric space, we use the same approach to give upper bounds on misclassification probability for classifiers with decision boundaries that are far from the training examples.

Convexity, Classification, and Risk Bounds

Many of the classification algorithms developed in the machine learning literature, including the support vector machine and boosting, can be viewed as minimum contrast methods that minimize a convex surrogate of the 0–1 loss function. The convexity makes these algorithms computationally efficient. The use of a surrogate, however, has statistical consequences that must be balanced against the computational virtues of convexity. To study these issues, we provide a general quantitative relationship between the risk as assessed using the 0–1 loss and the risk as assessed using any nonnegative surrogate loss function. We show that this relationship gives nontrivial upper bounds on excess risk under the weakest possible condition on the loss function—that it satisfies a pointwise form of Fisher consistency for classification. The relationship is based on a simple variational transformation of the loss function that is easy to compute in many applications. We also present a refined version of this result in the case of low noise, and show that in this case, strictly convex loss functions lead to faster rates of convergence of the risk than would be implied by standard uniform convergence arguments. Finally, we present applications of our results to the estimation of convergence rates in function classes that are scaled convex hulls of a finite-dimensional base class, with a variety of commonly used loss functions.

On the consistency of multiclass classification methods

Binary classification methods can be generalized in many ways to handle multiple classes. It turns out that not all generalizations preserve the nice property of Bayes consistency. We provide a necessary and sufficient condition for consistency which applies to a large class of multiclass classification methods. The approach is illustrated by applying it to some multiclass methods proposed in the literature.

Classification with a reject option using a hinge loss

We consider the problem of binary classification where the classifier can, for a particular cost, choose not to classify an observation. Just as in the conventional classification problem, minimization of the sample average of the cost is a difficult optimization problem. As an alternative, we propose the optimization of a certain convex loss function φ, analogous to the hinge loss used in support vector machines (SVMs). Its convexity ensures that the sample average of this surrogate loss can be efficiently minimized. We study its statistical properties. We show that minimizing the expected surrogate loss—the φ-risk—also minimizes the risk. We also study the rate at which the φ-risk approaches its minimum value. We show that fast rates are possible when the conditional probability P(Y=1|X) is unlikely to be close to certain critical values.

On the consistency of multiclass classification methods

Binary classification is a well studied special case of the classification problem. Statistical properties of binary classifiers, such as consistency, have been investigated in a variety of settings. Binary classification methods can be generalized in many ways to handle multiple classes. It turns out that one can lose consistency in generalizing a binary classification method to deal with multiple classes. We study a rich family of multiclass methods and provide a necessary and sufficient condition for their consistency. We illustrate our approach by applying it to some multiclass methods proposed in the literature.

Public sector strategy classification system for shared service identification

The purpose of this conceptual paper is to address the lack of consistent means through which strategies are identified and discussed across theoretical perspectives in the field of business strategy. A standardised referencing system is offered to codify the means by which strategies can be identified, from which new business services and information systems may be derived. This taxonomy was developed using qualitative content analysis study of government agencies’ strategic plans. This taxonomy is useful for identifying strategy formation and determining gaps and opportunities. Managers will benefit from a more transparent strategic design process that reduces ambiguity, aids in identifying and correcting gaps in strategy formulation, and fosters enhanced strategic analysis. Key benefits to academics are the improved dialogue in strategic management field and suggest that progress in the field requires that fundamentals of strategy formulation and classification be considered more carefully. Finally, the formalization of strategy can lead to the clear identification of new business services, which inform ICT investment decisions and shared service prioritisation.

Exponentiated gradient algorithms for large-margin structured classification

We consider the problem of structured classification, where the task is to predict a label y from an input x, and y has meaningful internal structure. Our framework includes supervised training of Markov random fields and weighted context-free grammars as special cases. We describe an algorithm that solves the large-margin optimization problem defined in [12], using an exponential-family (Gibbs distribution) representation of structured objects. The algorithm is efficient—even in cases where the number of labels y is exponential in size—provided that certain expectations under Gibbs distributions can be calculated efficiently. The method for structured labels relies on a more general result, specifically the application of exponentiated gradient updates [7, 8] to quadratic programs.

A new control-volume finite-element scheme for heterogeneous porous media : application to the drying of softwood

An improved mesoscopic model is presented for simulating the drying of porous media. The aim of this model is to account for two scales simultaneously: the scale of the whole product and the scale of the heterogeneities of the porous medium. The innovation of this method is the utilization of a new mass-conservative scheme based on the Control-Volume Finite-Element (CV-FE) method that partitions the moisture content field over the individual sub-control volumes surrounding each node within the mesh. Although the new formulation has potential for application across a wide range of transport processes in heterogeneous porous media, the focus here is on applying the model to the drying of small sections of softwood consisting of several growth rings. The results conclude that, when compared to a previously published scheme, only the new mass-conservative formulation correctly captures the true moisture content evolution in the earlywood and latewood components of the growth rings during drying.