The English Advanced Extension Award: the twin crossroads

English is the most popular and successful of the subjects currently offered at Advanced Extension Award, a UK examination for the ablest 18-year-olds. Government plans for post-16 reform suggest that AEAs may not continue as a separate examination for much longer. This paper discusses the reasons for the popularity of AEA English, and two key issues for the future which its success raises: the way forward for curriculum reform of English subjects post-16, and whether AEA, or AEA-style assessment, can satisfy the demand of elite universities for a means of identifying top students.

An extension of the well-known quaternary section at Godrevy, St Ives Bay, West Cornwall: analysis and review

The well-known Quaternary section at Godrevy, west Cornwall has been often described during the past half century, however, a further section, about a kilometre to the south is considered for the first time since a brief mention at the beginning of the last century. This 200m long exposure rests upon a raised shore platform and consists of a basal raised beach and littoral sand, overlain by a local diamict revealing evidence of post-depositional frost disturbance and finally Holocene dune sand. It is proposed that this Strap Rock site be included within the general discussion of the Godrevy section.

Comparison of small and large deformation rheological properties of wheat dough and gluten

The rheological properties of dough and gluten are important for end-use quality of flour but there is a lack of knowledge of the relationships between fundamental and empirical tests and how they relate to flour composition and gluten quality. Dough and gluten from six breadmaking wheat qualities were subjected to a range of rheological tests. Fundamental (small-deformation) rheological characterizations (dynamic oscillatory shear and creep recovery) were performed on gluten to avoid the nonlinear influence of the starch component, whereas large deformation tests were conducted on both dough and gluten. A number of variables from the various curves were considered and subjected to a principal component analysis (PCA) to get an overview of relationships between the various variables. The first component represented variability in protein quality, associated with elasticity and tenacity in large deformation (large positive loadings for resistance to extension and initial slope of dough and gluten extension curves recorded by the SMS/Kieffer dough and gluten extensibility rig, and the tenacity and strain hardening index of dough measured by the Dobraszczyk/Roberts dough inflation system), the elastic character of the hydrated gluten proteins (large positive loading for elastic modulus [G'], large negative loadings for tan delta and steady state compliance [J(e)(0)]), the presence of high molecular weight glutenin subunits (HMW-GS) 5+10 vs. 2+12, and a size distribution of glutenin polymers shifted toward the high-end range. The second principal component was associated with flour protein content. Certain rheological data were influenced by protein content in addition to protein quality (area under dough extension curves and dough inflation curves [W]). The approach made it possible to bridge the gap between fundamental rheological properties, empirical measurements of physical properties, protein composition, and size distribution. The interpretation of this study gave indications of the molecular basis for differences in breadmaking performance.

Comprehension of wh-questions and declarative sentences in agrammatic aphasia: the set partition hypothesis

Problematic trace-antecedent relations between deep and surface structure have been a dominant theme in sentence comprehension in agrammatism. We challenge this view and propose that the comprehension in agrammatism in declarative sentences and wh-questions stems from impaired processing in logical form. We present new data from wh-questions and declarative sentences and advance a new hypothesis which we call the set partition hypothesis. We argue that elements that signal set partition operations influence sentence comprehension while trace-antecedent relations remain intact. (C) 2007 Elsevier Ltd. All rights reserved.

Minimum neighborhood in a generalized cube

Generalized cubes are a subclass of hypercube-like networks, which include some hypercube variants as special cases. Let theta(G)(k) denote the minimum number of nodes adjacent to a set of k vertices of a graph G. In this paper, we prove theta(G)(k) >= -1/2k(2) + (2n - 3/2)k - (n(2) - 2) for each n-dimensional generalized cube and each integer k satisfying n + 2 <= k <= 2n. Our result is an extension of a result presented by Fan and Lin [J. Fan, X. Lin, The t/k-diagnosability of the BC graphs, IEEE Trans. Comput. 54 (2) (2005) 176-184]. (c) 2005 Elsevier B.V. All rights reserved.

Fault tolerance of Mobius cubes under two forbidden fault set models

An n-dimensional Mobius cube, 0MQ(n) or 1MQ(n), is a variation of n-dimensional cube Q(n) which possesses many attractive properties such as significantly smaller communication delay and stronger graph-embedding capabilities. In some practical situations, the fault tolerance of a distributed memory multiprocessor system can be measured more precisely by the connectivity of the underlying graph under forbidden fault set models. This article addresses the connectivity of 0MQ(n)/1MQ(n), under two typical forbidden fault set models. We first prove that the connectivity of 0MQ(n)/1MQ(n) is 2n - 2 when the fault set does not contain the neighborhood of any vertex as a subset. We then prove that the connectivity of 0MQ(n)/1MQ(n) is 3n - 5 provided that the neighborhood of any vertex as well as that of any edge cannot fail simultaneously These results demonstrate that 0MQ(n)/1MQ(n) has the same connectivity as Q(n) under either of the previous assumptions.

A lower bound on the size of k-neighborhood in generalized cubes

The determination of the minimum size of a k-neighborhood (i.e., a neighborhood of a set of k nodes) in a given graph is essential in the analysis of diagnosability and fault tolerance of multicomputer systems. The generalized cubes include the hypercube and most hypercube variants as special cases. In this paper, we present a lower bound on the size of a k-neighborhood in n-dimensional generalized cubes, where 2n + 1 <= k <= 3n - 2. This lower bound is tight in that it is met by the n-dimensional hypercube. Our result is an extension of two previously known results. (c) 2005 Elsevier Inc. All rights reserved.