A collaborative working environment for a large scale environmental model

Large scientific applications are usually developed, tested and used by a group of geographically dispersed scientists. The problems associated with the remote development and data sharing could be tackled by using collaborative working environments. There are various tools and software to create collaborative working environments. Some software frameworks, currently available, use these tools and software to enable remote job submission and file transfer on top of existing grid infrastructures. However, for many large scientific applications, further efforts need to be put to prepare a framework which offers application-centric facilities. Unified Air Pollution Model (UNI-DEM), developed by Danish Environmental Research Institute, is an example of a large scientific application which is in a continuous development and experimenting process by different institutes in Europe. This paper intends to design a collaborative distributed computing environment for UNI-DEM in particular but the framework proposed may also fit to many large scientific applications as well.

A novel haptic interface for navigation in large volume environments

Haptic interfaces can provide highly realistic interaction with objects within their workspace, but the task of interacting with objects over large areas or volumes is made difficult by the limits of interface travel. This paper details the development of a custom haptic interface - for navigating a large virtual environment (a simulated supermarket), and investigation into different control methods which allow for haptic interaction over extremely large workspaces.

Monte Carlo numerical treatment of large linear algebra problems

In this paper we deal with performance analysis of Monte Carlo algorithm for large linear algebra problems. We consider applicability and efficiency of the Markov chain Monte Carlo for large problems, i.e., problems involving matrices with a number of non-zero elements ranging between one million and one billion. We are concentrating on analysis of the almost Optimal Monte Carlo (MAO) algorithm for evaluating bilinear forms of matrix powers since they form the so-called Krylov subspaces. Results are presented comparing the performance of the Robust and Non-robust Monte Carlo algorithms. The algorithms are tested on large dense matrices as well as on large unstructured sparse matrices.

MIMO Wiener model identification for large scale fading of wireless mobile communications links

The large scale fading of wireless mobile communications links is modelled assuming the mobile receiver motion is described by a dynamic linear system in state-space. The geometric relations involved in the attenuation and multi-path propagation of the electric field are described by a static non-linear mapping. A Wiener system subspace identification algorithm in conjunction with polynomial regression is used to identify a model from time-domain estimates of the field intensity assuming a multitude of emitters and an antenna array at the receiver end.

A comparative study of Java and C performance in two large-scale parallel applications

In the 1990s the Message Passing Interface Forum defined MPI bindings for Fortran, C, and C++. With the success of MPI these relatively conservative languages have continued to dominate in the parallel computing community. There are compelling arguments in favour of more modern languages like Java. These include portability, better runtime error checking, modularity, and multi-threading. But these arguments have not converted many HPC programmers, perhaps due to the scarcity of full-scale scientific Java codes, and the lack of evidence for performance competitive with C or Fortran. This paper tries to redress this situation by porting two scientific applications to Java. Both of these applications are parallelized using our thread-safe Java messaging system—MPJ Express. The first application is the Gadget-2 code, which is a massively parallel structure formation code for cosmological simulations. The second application uses the finite-domain time-difference method for simulations in the area of computational electromagnetics. We evaluate and compare the performance of the Java and C versions of these two scientific applications, and demonstrate that the Java codes can achieve performance comparable with legacy applications written in conventional HPC languages. Copyright © 2009 John Wiley & Sons, Ltd.

Recent patterns of change in vegetation structure and tree composition of British broadleaved woodland: evidence from large-scale surveys

Evidence is presented of widespread changes in structure and species composition between the 1980s and 2003–2004 from surveys of 249 British broadleaved woodlands. Structural components examined include canopy cover, vertical vegetation profiles, field-layer cover and deadwood abundance. Woods were located in 13 geographical localities and the patterns of change were examined for each locality as well as across all woods. Changes were not uniform throughout the localities; overall, there were significant decreases in canopy cover and increases in sub-canopy (2–10 m) cover. Changes in 0.5–2 m vegetation cover showed strong geographic patterns, increasing in western localities, but declining or showing no change in eastern localities. There were significant increases in canopy ash Fraxinus excelsior and decreases in oak Quercus robur/petraea. Shrub layer ash and honeysuckle Lonicera periclymenum increased while birch Betula spp. hawthorn Crataegus monogyna and hazel Corylus avellana declined. Within the field layer, both bracken Pteridium aquilinum and herbs increased. Overall, deadwood generally increased. Changes were consistent with reductions in active woodland management and changes in grazing and browsing pressure. These findings have important implications for sustainable active management of British broadleaved woodlands to meet silvicultural and biodiversity objectives.