Software evolution: a graph based model

A model based on graph isomorphisms is used to formalize software evolution. Step by step we narrow the search space by an informed selection of the attributes based on the current state-of-the-art in software engineering and generate a seed solution. We then traverse the resulting space using graph isomorphisms and other set operations over the vertex sets. The new solutions will preserve the desired attributes. The goal of defining an isomorphism based search mechanism is to construct predictors of evolution that can facilitate the automation of ’software factory’ paradigm. The model allows for automation via software tools implementing the concepts.

Synthesis of heterosulfamates. Search for structure-taste relationships

Thirty one new sodium heterosulfamates, RNHSO3Na, where the R portion contains mainly thiazole, benzothiazole, thiadiazole and pyridine ring structures, have been synthesized and their taste portfolios have been assessed. A database of 132 heterosulfamates ( both open-chain and cyclic) has been formed by combining these new compounds with an existing set of 101 heterosulfamates which were previously synthesized and for which taste data are available. Simple descriptors have been obtained using (i) measurements with Corey-Pauling-Koltun (CPK) space- filling models giving x, y and z dimensions and a volume VCPK, (ii) calculated first order molecular connectivities ((1)chi(v)) and (iii) the calculated Spartan program parameters to obtain HOMO, LUMO energies, the solvation energy E-solv and V-SPART AN. The techniques of linear (LDA) and quadratic (QDA) discriminant analysis and Tree analysis have then been employed to develop structure-taste relationships (SARs) that classify the sweet (S) and non-sweet (N) compounds into separate categories. In the LDA analysis 70% of the compounds were correctly classified ( this compares with 65% when the smaller data set of 101 compounds was used) and in the QDA analysis 68% were correctly classified ( compared to 80% previously). TheTree analysis correctly classified 81% ( compared to 86% previously). An alternative Tree analysis derived using the Cerius2 program and a set of physicochemical descriptors correctly classified only 54% of the compounds.

Space partitioning for scalable K-means

K-Means is a popular clustering algorithm which adopts an iterative refinement procedure to determine data partitions and to compute their associated centres of mass, called centroids. The straightforward implementation of the algorithm is often referred to as `brute force' since it computes a proximity measure from each data point to each centroid at every iteration of the K-Means process. Efficient implementations of the K-Means algorithm have been predominantly based on multi-dimensional binary search trees (KD-Trees). A combination of an efficient data structure and geometrical constraints allow to reduce the number of distance computations required at each iteration. In this work we present a general space partitioning approach for improving the efficiency and the scalability of the K-Means algorithm. We propose to adopt approximate hierarchical clustering methods to generate binary space partitioning trees in contrast to KD-Trees. In the experimental analysis, we have tested the performance of the proposed Binary Space Partitioning K-Means (BSP-KM) when a divisive clustering algorithm is used. We have carried out extensive experimental tests to compare the proposed approach to the one based on KD-Trees (KD-KM) in a wide range of the parameters space. BSP-KM is more scalable than KDKM, while keeping the deterministic nature of the `brute force' algorithm. In particular, the proposed space partitioning approach has shown to overcome the well-known limitation of KD-Trees in high-dimensional spaces and can also be adopted to improve the efficiency of other algorithms in which KD-Trees have been used.

Historicizing counterurbanization: in-migration and the reconstruction of rural space in Berkshire (UK), 1901-51

This article uses census data for Berkshire to argue that large-scale counterurbanization began much earlier than is generally recognized in some parts of southern England. This was not just movement down the urban hierarchy, which as Pooley and Turnbull have demonstrated was a long-term feature of England’s settlement system, but in some cases at least amenity-driven migration to rural areas of the kind increasingly recognized as a core component of recent counterurbanization. Despite a reduction of acreage Berkshire’s rural districts saw a 54% rise in population between 1901 and 1951. The sub-regional pattern of growth is assessed to gauge whether ‘clean break’ migration to the remote west of the county (which remained effectively out of commuting range from London throughout the period) was taking place, or whether counterurbanization was confined to the more accessible eastern districts. However, whilst population did increase in both west and east, it was in fact the central districts that grew most impressively. Three case study parishes are investigated in order to gauge the nature and consequences of counterurbanization at a local level. Professional and business migrants figure prominently, seeking to preserve and promote the rural attributes of their new communities, without however cutting their ties to urban centres. It is argued that migration to rural Berkshire in the first half of the twentieth century cannot adequately be described either as a form of extended suburbanization or an anti-metropolitan ‘clean break’. Rather, early counterurbanization marks the first stage on the long road to a post-productivist countryside, in which countryside becomes detached from agriculture, there is socio-economic convergence between town and country, and the ‘rural’ increasingly becomes defined by landscape and identity rather than economic function.

Do smart grids offer a new incentive for SME carbon reduction?

Collectively small and medium sized enterprises (SMEs) are significant energy users although many are unregulated by existing policies due to their low carbon emissions. Carbon reduction is often not a priority but smart grids may create a new opportunity. A smart grid will give electricity suppliers a picture of real-time energy flows and the opportunity for consumers to receive financial incentives for engaging in demand side management. As well as creating incentives for local carbon reduction, engaging SMEs with smart grids has potential for contributing to wider grid decarbonisation. Modelling of buildings, business activities and technology solutions is needed to identify opportunities for carbon reduction. The diversity of the SME sector complicates strategy development. SMEs are active in almost every business area and occupy the full range of property types. This paper reviews previous modelling work, exposing valuable data on floor space and energy consumption associated with different business activities. Limitations are seen with the age of this data and an inability to distinguish SME energy use. By modelling SME energy use, electrical loads are identified which could be shifted on demand, in a smart network. Initial analysis of consumption, not constrained by existing policies, identifies heating and cooling in retail and commercial offices as having potential for demand response. Hot water in hotel and catering and retail sectors may also be significant because of the energy storage potential. Areas to consider for energy efficiency schemes are also indicated.

Stratospheric dynamics and midlatitude jets under geoengineering with space mirrors and sulfate and titania aerosols

The impact on the dynamics of the stratosphere of three approaches to geoengineering by solar radiation management is investigated using idealized simulations of a global climate model. The approaches are geoengineering with sulfate aerosols, titania aerosols, and reduction in total solar irradiance (representing mirrors placed in space). If it were possible to use stratospheric aerosols to counterbalance the surface warming produced by a quadrupling of atmospheric carbon dioxide concentrations, tropical lower stratospheric radiative heating would drive a thermal wind response which would intensify the stratospheric polar vortices. In the Northern Hemisphere this intensification results in strong dynamical cooling of the polar stratosphere. Northern Hemisphere stratospheric sudden warming events become rare (one and two in 65 years for sulfate and titania, respectively). The intensification of the polar vortices results in a poleward shift of the tropospheric midlatitude jets in winter. The aerosol radiative heating enhances the tropical upwelling in the lower stratosphere, influencing the strength of the Brewer-Dobson circulation. In contrast, solar dimming does not produce heating of the tropical lower stratosphere, and so there is little intensification of the polar vortex and no enhanced tropical upwelling. The dynamical response to titania aerosol is qualitatively similar to the response to sulfate.

Sparse space-time boundary element methods for the heat equation

The goal of this work is the efficient solution of the heat equation with Dirichlet or Neumann boundary conditions using the Boundary Elements Method (BEM). Efficiently solving the heat equation is useful, as it is a simple model problem for other types of parabolic problems. In complicated spatial domains as often found in engineering, BEM can be beneficial since only the boundary of the domain has to be discretised. This makes BEM easier than domain methods such as finite elements and finite differences, conventionally combined with time-stepping schemes to solve this problem. The contribution of this work is to further decrease the complexity of solving the heat equation, leading both to speed gains (in CPU time) as well as requiring smaller amounts of memory to solve the same problem. To do this we will combine the complexity gains of boundary reduction by integral equation formulations with a discretisation using wavelet bases. This reduces the total work to O(h

Still searching for graves: an analytical strategy for interpreting geophysical data used in the search for “unmarked” graves

Searching for and mapping the physical extent of unmarked graves using geophysical techniques has proven difficult in many cases. The success of individual geophysical techniques for detecting graves depends on a site-by-site basis. Significantly, detection of graves often results from measured contrasts that are linked to the background soils rather than the type of archaeological feature associated with the grave. It is evident that investigation of buried remains should be considered within a 3D space as the variation in burial environment can be extremely varied through the grave. Within this paper, we demonstrate the need for a multi-method survey strategy to investigate unmarked graves, as applied at a “planned” but unmarked pauper’s cemetery. The outcome from this case study provides new insights into the strategy that is required at such sites. Perhaps the most significant conclusion is that unmarked graves are best understood in terms of characterization rather than identification. In this paper, we argue for a methodological approach that, while following the current trends to use multiple techniques, is fundamentally dependent on a structured approach to the analysis of the data. The ramifications of this case study illustrate the necessity of an integrated strategy to provide a more holistic understanding of unmarked graves that may help aid in management of these unseen but important aspects of our heritage. It is concluded that the search for graves is still a current debate and one that will be solved by methodological rather than technique-based arguments.