Comparison of the computational cost of a Monte Carlo and deterministic algorithm for computing bilinear forms of matrix powers

In this paper we consider bilinear forms of matrix polynomials and show that these polynomials can be used to construct solutions for the problems of solving systems of linear algebraic equations, matrix inversion and finding extremal eigenvalues. An almost Optimal Monte Carlo (MAO) algorithm for computing bilinear forms of matrix polynomials is presented. Results for the computational costs of a balanced algorithm for computing the bilinear form of a matrix power is presented, i.e., an algorithm for which probability and systematic errors are of the same order, and this is compared with the computational cost for a corresponding deterministic method.

A blueprint for affective computing: A sourcebook

A Blueprint for Affective Computing: A sourcebook and manual is the very first attempt to ground affective computing within the disciplines of psychology, affective neuroscience, and philosophy. This book illustrates the contributions of each of these disciplines to the development of the ever-growing field of affective computing. In addition, it demonstrates practical examples of cross-fertilization between disciplines in order to highlight the need for integration of computer science, engineering and the affective sciences.

Retrieval of global atmospheric electrical activity at a polluted urban site

The atmospheric electrical Potential Gradient (PG) arises from global thunderstorm activity, but surface measurements of the atmospheric Potential Gradient (PG) are influenced by global thunderstorms and local aerosol concentration changes. The local aerosol change can be monitored independently, and in some cases the concentration changes are closely related to PG changes. For these circumstances, a general theory to remove the local aerosol influence on PG measurements has been developed. Continuous measurements of PG and aerosol mass concentration were made during 24–31 Dec, 2005 within an urban environment at Reading, UK. The average diurnal variation of PG showed a double diurnal cycle, with maxima in the early morning and evening hours. The aerosol concentration has similar double maxima. Removing the aerosol using from the PG and aerosol correlation returns a single diurnal cycle, suggestive of the more global PG diurnal cycle.

Nocturnal ranging behaviour of urban hedgehogs, Erinaceus europaeus, in relation to risk and reward

Urban areas have both positive and negative influences on wildlife. For terrestrial mammals, one of the principle problems is the risk associated with moving through the environment whilst foraging. In this study, we examined nocturnal patterns of movement of urban-dwelling hedgehogs (Erinaceus europaeus) in relation to (i) the risks posed by predators and motor vehicles and (ii) nightly weather patterns. Hedgehogs preferentially utilised the gardens of semi-detached and terraced houses. However, females, but not males, avoided the larger back gardens of detached houses, which contain more of the habitat features selected by badgers. This difference in the avoidance of predation risk is probably associated with sex differences in breeding behaviour. Differences in nightly movement patterns were consistent with strategies associated with mating behaviour and the accumulation of fat reserves for hibernation. Hedgehogs also exhibited differences in behaviour associated with the risks posed by humans; they avoided actively foraging near roads and road verges, but did not avoid crossing roads per se. They were, however, significantly more active after midnight when there was a marked reduction in vehicle and foot traffic. In particular, responses to increased temperature, which is associated with increased abundance of invertebrate prey, were only observed after midnight. This variation in the timing of bouts of activity would reduce the risks associated with human activities. There were also profound differences in both area ranged and activity with chronological year which warrant further investigation.

The International Urban Energy Balance Models Comparison Project: First Results from Phase 1

A large number of urban surface energy balance models now exist with different assumptions about the important features of the surface and exchange processes that need to be incorporated. To date, no com- parison of these models has been conducted; in contrast, models for natural surfaces have been compared extensively as part of the Project for Intercomparison of Land-surface Parameterization Schemes. Here, the methods and first results from an extensive international comparison of 33 models are presented. The aim of the comparison overall is to understand the complexity required to model energy and water exchanges in urban areas. The degree of complexity included in the models is outlined and impacts on model performance are discussed. During the comparison there have been significant developments in the models with resulting improvements in performance (root-mean-square error falling by up to two-thirds). Evaluation is based on a dataset containing net all-wave radiation, sensible heat, and latent heat flux observations for an industrial area in Vancouver, British Columbia, Canada. The aim of the comparison is twofold: to identify those modeling ap- proaches that minimize the errors in the simulated fluxes of the urban energy balance and to determine the degree of model complexity required for accurate simulations. There is evidence that some classes of models perform better for individual fluxes but no model performs best or worst for all fluxes. In general, the simpler models perform as well as the more complex models based on all statistical measures. Generally the schemes have best overall capability to model net all-wave radiation and least capability to model latent heat flux.

Exploring carrier agents in swarm-array computing

How can a bridge be built between autonomic computing approaches and parallel computing systems? The work reported in this paper is motivated towards bridging this gap by proposing a swarm-array computing approach based on ‘Intelligent Agents’ to achieve autonomy for distributed parallel computing systems. In the proposed approach, a task to be executed on parallel computing cores is carried onto a computing core by carrier agents that can seamlessly transfer between processing cores in the event of a predicted failure. The cognitive capabilities of the carrier agents on a parallel processing core serves in achieving the self-ware objectives of autonomic computing, hence applying autonomic computing concepts for the benefit of parallel computing systems. The feasibility of the proposed approach is validated by simulation studies using a multi-agent simulator on an FPGA (Field-Programmable Gate Array) and experimental studies using MPI (Message Passing Interface) on a computer cluster. Preliminary results confirm that applying autonomic computing principles to parallel computing systems is beneficial.

A cluster-based implementation of a fault-tolerant parallel reduction algorithm using swarm-array computing

Recent research in multi-agent systems incorporate fault tolerance concepts. However, the research does not explore the extension and implementation of such ideas for large scale parallel computing systems. The work reported in this paper investigates a swarm array computing approach, namely ‘Intelligent Agents’. In the approach considered a task to be executed on a parallel computing system is decomposed to sub-tasks and mapped onto agents that traverse an abstracted hardware layer. The agents intercommunicate across processors to share information during the event of a predicted core/processor failure and for successfully completing the task. The agents hence contribute towards fault tolerance and towards building reliable systems. The feasibility of the approach is validated by simulations on an FPGA using a multi-agent simulator and implementation of a parallel reduction algorithm on a computer cluster using the Message Passing Interface.

A simplified mathematical model for urban microclimate simulation

Techniques for modelling urban microclimates and urban block surfaces temperatures are desired by urban planners and architects for strategic urban designs at the early design stages. This paper introduces a simplified mathematical model for urban simulations (UMsim) including urban surfaces temperatures and microclimates. The nodal network model has been developed by integrating coupled thermal and airflow model. Direct solar radiation, diffuse radiation, reflected radiation, long-wave radiation, heat convection in air and heat transfer in the exterior walls and ground within the complex have been taken into account. The relevant equations have been solved using the finite difference method under the Matlab platform. Comparisons have been conducted between the data produced from the simulation and that from an urban experimental study carried out in a real architectural complex on the campus of Chongqing University, China in July 2005 and January 2006. The results show a satisfactory agreement between the two sets of data. The UMsim can be used to simulate the microclimates, in particular the surface temperatures of urban blocks, therefore it can be used to assess the impact of urban surfaces properties on urban microclimates. The UMsim will be able to produce robust data and images of urban environments for sustainable urban design.