Vehicle-driver communication using off-the-shelf transceivers

Almost all modern cars can be controlled remotely using a personal communicator (keyfob). However, the degree of interaction between currently available personal communicators and cars is very limited. The communication link is unidirectional and the communication range is limited to a few dozen meters. However, there are many interesting applications that could be supported if a keyfob would be able to support energy efficient bidirectional longer range communication. In this paper we investigate off-the-shelf transceivers in terms of their usability for bidirectional longer range communication. Our evaluation results show that existing transceivers can generally support the required communication ranges but that links tend to be very unreliable. This high unreliability must be handled in an energy efficient way by the keyfob to car communication protocol in order to make off-the-shelf transceivers a viable solution.

An introduction to the Chinese Evaluation Standard for the indoor thermal environment

Designing for indoor thermal environmental conditions is one of the key elements in the energy efficient building design process. This paper introduces a development of the Chinese national Evaluation Standard for indoor thermal environments (Evaluation Standard). International standards including the ASHRAE55, ISO7730, DIN EN, and CIBSE Guide-A have been reviewed and referenced for the development of the Evaluation Standard. In addition, over 28,000 subjects participated in the field study from different climate zones in China and over 500 subjects have been involved in laboratory studies. The research findings reveal that there is a need to update the Chinese thermal comfort standard based on local climates and people's habitats. This paper introduces in detail the requirements for the thermal environment for heated and cooled buildings and free-running buildings in China.

An investigation of the required skills for the delivery of low and zero carbon buildings within a region

The United Kingdom is committed to a raft of requirements to create a low-carbon economy. Buildings consume approximately 40% of UK energy demand. Any improvement on the energy performance of buildings therefore can significantly contribute to the delivery of a low-carbon economy. The challenge for the construction sector and its clients is how to meet the policy requirements to deliver low and zero carbon (LZC) buildings, which spans broader than the individual building level, to requirements at the local and regional levels, and wider sustainability pressures. Further, the construction sector is reporting skills shortages coupled with the need for ‘new skills’ for the delivery of LZC buildings. The aim of this paper is to identify, and better understand, the skills required by the construction sector and its clients for the delivery of LZC buildings within a region. The theoretical framing for this research is regional innovation system (RIS) using a socio-technical network analysis (STNA) methodology. A case study of a local authority region is presented. Data is drawn from a review of relevant local authority documentation, observations and semi-structured interviews from one (project 1) of five school retrofit projects within the region. The initial findings highlight the complexity surrounding the form and operation of the LZC network for project 1. The skills required by the construction sector and its clients are connected to different actor roles surrounding the delivery of the project. The key actors involved and their required skills are: project management and energy management skills required by local authority; project management skills (in particular project planning), communication and research skills required by school end-users; and a ‘technical skill’ relating to knowledge of a particular energy efficient measure (EEM) and use of equipment to implement the EEM is required by the EEM contractors.

Graph-based algorithms for comparison and prediction of household-level energy use profiles

We present an efficient graph-based algorithm for quantifying the similarity of household-level energy use profiles, using a notion of similarity that allows for small time–shifts when comparing profiles. Experimental results on a real smart meter data set demonstrate that in cases of practical interest our technique is far faster than the existing method for computing the same similarity measure. Having a fast algorithm for measuring profile similarity improves the efficiency of tasks such as clustering of customers and cross-validation of forecasting methods using historical data. Furthermore, we apply a generalisation of our algorithm to produce substantially better household-level energy use forecasts from historical smart meter data.

A cross layer protocol for energy aware and critical data delivered applications using Wireless Sensor Networks

Environment monitoring applications using Wireless Sensor Networks (WSNs) have had a lot of attention in recent years. In much of this research tasks like sensor data processing, environment states and events decision making and emergency message sending are done by a remote server. A proposed cross layer protocol for two different applications where, reliability for delivered data, delay and life time of the network need to be considered, has been simulated and the results are presented in this paper. A WSN designed for the proposed applications needs efficient MAC and routing protocols to provide a guarantee for the reliability of the data delivered from source nodes to the sink. A cross layer based on the design given in [1] has been extended and simulated for the proposed applications, with new features, such as routes discovery algorithms added. Simulation results show that the proposed cross layer based protocol can conserve energy for nodes and provide the required performance such as life time of the network, delay and reliability.

An integrated model of soil-canopy spectral radiances, photosynthesis, fluorescence, temperature and energy balance

This paper presents the model SCOPE (Soil Canopy Observation, Photochemistry and Energy fluxes), which is a vertical (1-D) integrated radiative transfer and energy balance model. The model links visible to thermal infrared radiance spectra (0.4 to 50 μm) as observed above the canopy to the fluxes of water, heat and carbon dioxide, as a function of vegetation structure, and the vertical profiles of temperature. Output of the model is the spectrum of outgoing radiation in the viewing direction and the turbulent heat fluxes, photosynthesis and chlorophyll fluorescence. A special routine is dedicated to the calculation of photosynthesis rate and chlorophyll fluorescence at the leaf level as a function of net radiation and leaf temperature. The fluorescence contributions from individual leaves are integrated over the canopy layer to calculate top-of-canopy fluorescence. The calculation of radiative transfer and the energy balance is fully integrated, allowing for feedback between leaf temperatures, leaf chlorophyll fluorescence and radiative fluxes. Leaf temperatures are calculated on the basis of energy balance closure. Model simulations were evaluated against observations reported in the literature and against data collected during field campaigns. These evaluations showed that SCOPE is able to reproduce realistic radiance spectra, directional radiance and energy balance fluxes. The model may be applied for the design of algorithms for the retrieval of evapotranspiration from optical and thermal earth observation data, for validation of existing methods to monitor vegetation functioning, to help interpret canopy fluorescence measurements, and to study the relationships between synoptic observations with diurnally integrated quantities. The model has been implemented in Matlab and has a modular design, thus allowing for great flexibility and scalability.

Fast approximate calculation of multiply scattered lidar returns

An efficient method is described for the approximate calculation of the intensity of multiply scattered lidar returns. It divides the outgoing photons into three populations, representing those that have experienced zero, one, and more than one forward-scattering event. Each population is parameterized at each range gate by its total energy, its spatial variance, the variance of photon direction, and the covariance, of photon direction and position. The result is that for an N-point profile the calculation is O(N-2) efficient and implicitly includes up to N-order scattering, making it ideal for use in iterative retrieval algorithms for which speed is crucial. In contrast, models that explicitly consider each scattering order separately are at best O(N-m/m!) efficient for m-order scattering and often cannot be performed to more than the third or fourth order in retrieval algorithms. For typical cloud profiles and a wide range of lidar fields of view, the new algorithm is as accurate as an explicit calculation truncated at the fifth or sixth order but faster by several orders of magnitude. (C) 2006 Optical Society of America.

Efficient mining of discriminative molecular fragments

Frequent pattern discovery in structured data is receiving an increasing attention in many application areas of sciences. However, the computational complexity and the large amount of data to be explored often make the sequential algorithms unsuitable. In this context high performance distributed computing becomes a very interesting and promising approach. In this paper we present a parallel formulation of the frequent subgraph mining problem to discover interesting patterns in molecular compounds. The application is characterized by a highly irregular tree-structured computation. No estimation is available for task workloads, which show a power-law distribution in a wide range. The proposed approach allows dynamic resource aggregation and provides fault and latency tolerance. These features make the distributed application suitable for multi-domain heterogeneous environments, such as computational Grids. The distributed application has been evaluated on the well known National Cancer Institute’s HIV-screening dataset.

A comparison of energy use in conventional and integrated arable farming systems in the UK

The LINK Integrated Farming Systems (LINK-IFS) Project (1992-1997) was setup to compare conventional and integrated arable farming systems (IAFS), concentrating on practical feasibility and economic viability, but also taking into account the level of inputs used and environmental impact. As part of this, an examination into energy use within the two systems was also undertaken. This paper presents the results from that analysis. The data used is from the six sites within the LINK-IFS Project, spread through the arable production areas of England and from the one site in Scotland, covering the 5 years of the project. The comparison of the energy used is based on the equipment and inputs used to produce I kg of each crop within the conventional and integrated rotations, and thereby the overall energy used for each system. The results suggest that, in terms of total energy used, the integrated system appears to be the most efficient. However, in terms of energy efficiency, energy use per kilogram of output, the results are less conclusive. (C) 2003 Elsevier Science B.V. All rights reserved.

Advanced scalable algorithms for advanced architectures

With the latest advances in the area of advanced computer architectures we are seeing already large scale machines at petascale level and we are discussing exascale computing. All these require efficient scalable algorithms in order to bridge the performance gap. In this paper examples of various approaches of designing scalable algorithms for such advanced architectures will be given and the corresponding properties of these algorithms will be outlined and discussed. Examples will outline such scalable algorithms applied to large scale problems in the area Computational Biology, Environmental Modelling etc. The key properties of such advanced and scalable algorithms will be outlined.

Efficient fuzzy control of a rotary inverted pendulum based on LQR mapping

This paper develops fuzzy methods for control of the rotary inverted pendulum, an underactuated mechanical system. Two control laws are presented, one for swing up and another for the stabilization. The pendulum is swung up from the vertical down stable position to the upward unstable position in a controlled trajectory. The rules for the swing up are heuristically written such that each swing results in greater energy build up. The stabilization is achieved by mapping a stabilizing LQR control law to two fuzzy inference engines, which reduces the computational load compared with using a single fuzzy inference engine. The robustness of the balancing control is tested by attaching a bottle of water at the tip of the pendulum.

Parallel Hybrid Monte Carlo Algorithms for Matrix Computations

In this paper we consider hybrid (fast stochastic approximation and deterministic refinement) algorithms for Matrix Inversion (MI) and Solving Systems of Linear Equations (SLAE). Monte Carlo methods are used for the stochastic approximation, since it is known that they are very efficient in finding a quick rough approximation of the element or a row of the inverse matrix or finding a component of the solution vector. We show how the stochastic approximation of the MI can be combined with a deterministic refinement procedure to obtain MI with the required precision and further solve the SLAE using MI. We employ a splitting A = D – C of a given non-singular matrix A, where D is a diagonal dominant matrix and matrix C is a diagonal matrix. In our algorithm for solving SLAE and MI different choices of D can be considered in order to control the norm of matrix T = D –1C, of the resulting SLAE and to minimize the number of the Markov Chains required to reach given precision. Further we run the algorithms on a mini-Grid and investigate their efficiency depending on the granularity. Corresponding experimental results are presented.

Complexity of Monte Carlo algorithms for a class of integral equations

In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the integral equation by a system of algebraic equations. Then the Markov chain iterative Monte Carlo is used to solve the system. The assumption here is that the corresponding Neumann series for the iterative matrix does not necessarily converge or converges slowly. We use a special technique to accelerate the convergence. An estimate of the computational complexity of Monte Carlo algorithm using the considered approach is obtained. The estimate of the complexity is compared with the corresponding quantity for the complexity of the grid-free Monte Carlo algorithm. The conditions under which the class of grid Monte Carlo algorithms is more efficient are given.

Regression based D-optimality experimental design for sparse kernel density estimation

This paper derives an efficient algorithm for constructing sparse kernel density (SKD) estimates. The algorithm first selects a very small subset of significant kernels using an orthogonal forward regression (OFR) procedure based on the D-optimality experimental design criterion. The weights of the resulting sparse kernel model are then calculated using a modified multiplicative nonnegative quadratic programming algorithm. Unlike most of the SKD estimators, the proposed D-optimality regression approach is an unsupervised construction algorithm and it does not require an empirical desired response for the kernel selection task. The strength of the D-optimality OFR is owing to the fact that the algorithm automatically selects a small subset of the most significant kernels related to the largest eigenvalues of the kernel design matrix, which counts for the most energy of the kernel training data, and this also guarantees the most accurate kernel weight estimate. The proposed method is also computationally attractive, in comparison with many existing SKD construction algorithms. Extensive numerical investigation demonstrates the ability of this regression-based approach to efficiently construct a very sparse kernel density estimate with excellent test accuracy, and our results show that the proposed method compares favourably with other existing sparse methods, in terms of test accuracy, model sparsity and complexity, for constructing kernel density estimates.