The Gulf Cooperation Council as a New Regional Power: Time for the EU to Propose a Strategic Partnership. Bruges Regional Integration & Global Governance Papers 3/2012, November 2012

The Gulf Cooperation Council (GCC) is a de facto regional power in the Arab world. Its role has been crucial in some of the outcomes of the Arab Spring. The GCC countries have been very pragmatic in dealing with the uprisings, avoiding any revolutionary spill-over throughout the Gulf region. This paper examines to what extent the policies of the European Union (EU) in the Gulf have changed since the beginning of the Arab Spring. It argues that despite the calls by the European Parliament and by the High Representative Baroness Ashton to improve the relationship, the EU’s support for a new policy in the Gulf after the Arab Spring is stalling, and little new or concrete has been achieved. The paper concludes that the Union needs a reinforced partnership that merges the various EU policies in the region into a single strategic partnership with the Arab countries.

Wetland restoration within agricultural watersheds: Balancing water quality protection with habitat conservation

Peat wetlands that have been restored from agricultural Land have the potential to act as Long term sources of phosphorus (P) and, therefore have to potenital to accelerate freshwater eutrophication. During a two-year study the water table in a eutrophic fen peat that was managed by pump drainage fluctuated annually between +20 cm and -60 cm relative to ground Level. This precise management was facilitated by the high hydraulic conductivity (K) of the humified peat (1.1 x 10(-5) m s(-1)) below around 60 cm depth. However, during one week of intermittent pumping, as much as 50 g ha(-1) dissolved P entered the pumped ditch. Summer. rainfall events and autumn reflooding also triggered P losses. The P Losses were attributed to the low P sorption capacity (217 mg kg(-1)) of the saturated peat below 60 cm, combined with its high K and the reductive dissolution of Fe bound P.

Dynamic load balancing for the distributed mining of molecular structures

In molecular biology, it is often desirable to find common properties in large numbers of drug candidates. One family of methods stems from the data mining community, where algorithms to find frequent graphs have received increasing attention over the past years. However, the computational complexity of the underlying problem and the large amount of data to be explored essentially render sequential algorithms useless. In this paper, we present a distributed approach to the frequent subgraph mining problem to discover interesting patterns in molecular compounds. This problem is characterized by a highly irregular search tree, whereby no reliable workload prediction is available. We describe the three main aspects of the proposed distributed algorithm, namely, a dynamic partitioning of the search space, a distribution process based on a peer-to-peer communication framework, and a novel receiverinitiated load balancing algorithm. The effectiveness of the distributed method has been evaluated on the well-known National Cancer Institute’s HIV-screening data set, where we were able to show close-to linear speedup in a network of workstations. The proposed approach also allows for dynamic resource aggregation in a non dedicated computational environment. These features make it suitable for large-scale, multi-domain, heterogeneous environments, such as computational grids.

Decentralized load balancing for highly irregular search problems

In this paper, we present a distributed computing framework for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available. The framework is based on a peer-to-peer computing environment and dynamic load balancing. The system allows for dynamic resource aggregation, does not depend on any specific meta-computing middleware and is suitable for large-scale, multi-domain, heterogeneous environments, such as computational Grids. Dynamic load balancing policies based on global statistics are known to provide optimal load balancing performance, while randomized techniques provide high scalability. The proposed method combines both advantages and adopts distributed job-pools and a randomized polling technique. The framework has been successfully adopted in a parallel search algorithm for subgraph mining and evaluated on a molecular compounds dataset. The parallel application has shown good calability and close-to linear speedup in a distributed network of workstations.

DTM generation from LIDAR data using skewness balancing

LIght Detection And Ranging (LIDAR) data for terrain and land surveying has contributed to many environmental, engineering and civil applications. However, the analysis of Digital Surface Models (DSMs) from complex LIDAR data is still challenging. Commonly, the first task to investigate LIDAR data point clouds is to separate ground and object points as a preparatory step for further object classification. In this paper, the authors present a novel unsupervised segmentation algorithm-skewness balancing to separate object and ground points efficiently from high resolution LIDAR point clouds by exploiting statistical moments. The results presented in this paper have shown its robustness and its potential for commercial applications.

Design, implementation and characterisation of a contactless power transfer system for rotating applications

This paper describes the design, implementation and characterisation of a contactless power transfer system for rotating applications. The power transfer system is based upon a zero-voltage-switched, full-bridge, DC-DC converter, but utilises a non-standard transformer. This transformer allows power transfer between its primary and secondary windings while also allowing free rotation between these windings. The aim of this research is to develop a solution that could replace mechanical slip-rings in certain applications where a non-contacting system would be advantageous. Based upon the design method presented in this paper, a 2 kW prototype system is constructed. Results obtained from testing the 2 kW prototype are presented and discussed. This discussion considers how the performance of the transformer varies with rotation and also the overall efficiency of the system

Contactless power transfer system for rotating applications

In applications such as radar and wind turbines, it is often necessary to transfer power across a constantly rotating interface. As the rotation is continuous, it would be impossible to use wires to transfer the power as they would soon become twisted and stretched and the system would fail. The widespread solution to this problem is to use a slip-ring.

Dynamic load balancing in parallel KD-tree k-means

One among the most influential and popular data mining methods is the k-Means algorithm for cluster analysis. Techniques for improving the efficiency of k-Means have been largely explored in two main directions. The amount of computation can be significantly reduced by adopting geometrical constraints and an efficient data structure, notably a multidimensional binary search tree (KD-Tree). These techniques allow to reduce the number of distance computations the algorithm performs at each iteration. A second direction is parallel processing, where data and computation loads are distributed over many processing nodes. However, little work has been done to provide a parallel formulation of the efficient sequential techniques based on KD-Trees. Such approaches are expected to have an irregular distribution of computation load and can suffer from load imbalance. This issue has so far limited the adoption of these efficient k-Means variants in parallel computing environments. In this work, we provide a parallel formulation of the KD-Tree based k-Means algorithm for distributed memory systems and address its load balancing issue. Three solutions have been developed and tested. Two approaches are based on a static partitioning of the data set and a third solution incorporates a dynamic load balancing policy.