An approximation algorithm for #k-SAT

"Vegeu el resum a l'inici del document del fitxer adjunt"

Proposal of a parallel architecture for a motion detection algorithm

This paper proposes a parallel architecture for estimation of the motion of an underwater robot. It is well known that image processing requires a huge amount of computation, mainly at low-level processing where the algorithms are dealing with a great number of data. In a motion estimation algorithm, correspondences between two images have to be solved at the low level. In the underwater imaging, normalised correlation can be a solution in the presence of non-uniform illumination. Due to its regular processing scheme, parallel implementation of the correspondence problem can be an adequate approach to reduce the computation time. Taking into consideration the complexity of the normalised correlation criteria, a new approach using parallel organisation of every processor from the architecture is proposed

Improving Clustering Algorithms for Image Segmentation using Contour and Region Information

In image segmentation, clustering algorithms are very popular because they are intuitive and, some of them, easy to implement. For instance, the k-means is one of the most used in the literature, and many authors successfully compare their new proposal with the results achieved by the k-means. However, it is well known that clustering image segmentation has many problems. For instance, the number of regions of the image has to be known a priori, as well as different initial seed placement (initial clusters) could produce different segmentation results. Most of these algorithms could be slightly improved by considering the coordinates of the image as features in the clustering process (to take spatial region information into account). In this paper we propose a significant improvement of clustering algorithms for image segmentation. The method is qualitatively and quantitative evaluated over a set of synthetic and real images, and compared with classical clustering approaches. Results demonstrate the validity of this new approach

Speculative parallelization of multipath radiosity algorithm

In computer graphics, global illumination algorithms take into account not only the light that comes directly from the sources, but also the light interreflections. This kind of algorithms produce very realistic images, but at a high computational cost, especially when dealing with complex environments. Parallel computation has been successfully applied to such algorithms in order to make it possible to compute highly-realistic images in a reasonable time. We introduce here a speculation-based parallel solution for a global illumination algorithm in the context of radiosity, in which we have taken advantage of the hierarchical nature of such an algorithm

A Monte Carlo-Based Fiber Tracking Algorithm using Diffusion Tensor MRI

Diffusion tensor magnetic resonance imaging, which measures directional information of water diffusion in the brain, has emerged as a powerful tool for human brain studies. In this paper, we introduce a new Monte Carlo-based fiber tracking approach to estimate brain connectivity. One of the main characteristics of this approach is that all parameters of the algorithm are automatically determined at each point using the entropy of the eigenvalues of the diffusion tensor. Experimental results show the good performance of the proposed approach

Constraint algorithm for k-presymplectic Hamiltonian systems. Application to singular field theories

The k-symplectic formulation of field theories is especially simple, since only tangent and cotangent bundles are needed in its description. Its defining elements show a close relationship with those in the symplectic formulation of mechanics. It will be shown that this relationship also stands in the presymplectic case. In a natural way,one can mimick the presymplectic constraint algorithm to obtain a constraint algorithmthat can be applied to k-presymplectic field theory, and more particularly to the Lagrangian and Hamiltonian formulations offield theories defined by a singular Lagrangian, as well as to the unified Lagrangian-Hamiltonian formalism (Skinner--Rusk formalism) for k-presymplectic field theory. Two examples of application of the algorithm are also analyzed.

A Label space reduction algorithm for P2MP LSPs using asymmetric tunnels

The aim of traffic engineering is to optimise network resource utilization. Although several works on minimizing network resource utilization have been published, few works have focused on LSR label space. This paper proposes an algorithm that uses MPLS label stack features in order to reduce the number of labels used in LSPs forwarding. Some tunnelling methods and their MPLS implementation drawbacks are also discussed. The algorithm described sets up the NHLFE tables in each LSR, creating asymmetric tunnels when possible. Experimental results show that the algorithm achieves a large reduction factor in the label space. The work presented here applies for both types of connections: P2MP and P2P

China’s Strategy in North Africa: New economic challenges for the Mediterranean region

El WP té com a objectiu examinar per què els països del nord d'Àfrica estan augmentant les seves importacions de Xina i per què la Xina està augmentant les seves inversions estrangeres directes a la zona. la avantatges per als països del nord d'Àfrica es troben en els actuals acords de lliure comerç, el absència de barreres aranzelàries i la seva ubicació geogràfica summament beneficiosa com Hub de la Mediterrània. El paper de la Unió per la Mediterrània és clau per identificar aspectes de la política regional, tenint en compte la participació xinesa a la zona. com conseqüència, concloem que els actors polítics han de trobar un equilibri entre sostenible desenvolupament i els interessos econòmics de la regió.

The Öresund region: A dynamic region in Europe due to inter-regional collaboration?

El cluster Medicon Valley es troba a la regió d'Oresund binacional que s'estén per Dinamarca i Suècia, inclosa la Universitat de Lund, ciutat i tercera ciutat més gran de Suècia, Malmö (veure figura 1). El 2000, aquestes dues parts nacionals estaven connectades físicament per l'establiment dels 18 quilòmetres de longitud, enllaç fix del Øresund (ponts i túnels).

From the “Mining Triangle” to the “Greater Region“ (“Großregion”/”Grande Région”). The Institutionalisation of the “SaarLorLux” Euroregion

Gairebé 182 milions d'ciutadans de la Unió Europea (= 37,5% de la població total) viuen en aproximadament 130 regions frontereres i transfrontereres. Aquestes regions contribueixen significativament al procés d'integració europea. Aquesta importància es documenta pel paquet dels Fons Estructurals 2007-2013, que ha estat presentat per la Comissió Europea i que va ser aprovat recentment pel Parlament Europeu. Considerant que la UE ha gastat uns 4875 € milions per a la cooperació transfronterera, transnacional i interregional en el marc de la iniciativa Interreg per al període 2000-2006, la cooperació territorial europea es convertirà en un dels tres objectius dels fons estructurals i rebrà € 7750000000 (5,57 milions d'euros per a la cooperació transfronterera només) per al període 2007-2013 (Comissió Europea, 2006a, 2006b). A part d'això, un nou conjunt de normes per a l'establiment d'una "agrupació europea de cooperació territorial" (AECT) ha estat adoptat i que facilitarà la cooperació transboundray, transnacional i interregional a la UE. Aquest treball s'ocuparà de les estructures de la institucionalització, la presa de decisions i l'execució i les polítiques de la "Gran Regió" / "Großregion" (d'ara endavant: GR o Gran Regió).

Fast calculation of the CAC convolution algorithm using the multinomial distribution function

The authors focus on one of the methods for connection acceptance control (CAC) in an ATM network: the convolution approach. With the aim of reducing the cost in terms of calculation and storage requirements, they propose the use of the multinomial distribution function. This permits direct computation of the associated probabilities of the instantaneous bandwidth requirements. This in turn makes possible a simple deconvolution process. Moreover, under certain conditions additional improvements may be achieved

The Common Strategy on the Mediterranean Region: Evidence and Analysis

The present working paper aims at assessing the Common Strategy on the Mediterranean, taking into account its possible articulation as a coherent instrument of the European Foreign Policy. The study wants to answer some questions related to this instrument. The Common Strategy on the Mediterranean is an excellent case study and is a potential source of several questions about the external action of the European Union. Specifically, the present study has in mind two main questions to answer. Firstly, which are the main reasons behind the adoption of this instrument of the European Foreign Policy? In other words, which was/is the rationale for the existence of this Common Strategy? Secondly, which is the real impact of the Common Strategy? Which are its real achievements?

A Negotiation Style Recommender Based on Computational Ecology in Open Negotiation Environments

The system described herein represents the first example of a recommender system in digital ecosystems where agents negotiate services on behalf of small companies. The small companies compete not only with price or quality, but with a wider service-by-service composition by subcontracting with other companies. The final result of these offerings depends on negotiations at the scale of millions of small companies. This scale requires new platforms for supporting digital business ecosystems, as well as related services like open-id, trust management, monitors and recommenders. This is done in the Open Negotiation Environment (ONE), which is an open-source platform that allows agents, on behalf of small companies, to negotiate and use the ecosystem services, and enables the development of new agent technologies. The methods and tools of cyber engineering are necessary to build up Open Negotiation Environments that are stable, a basic condition for predictable business and reliable business environments. Aiming to build stable digital business ecosystems by means of improved collective intelligence, we introduce a model of negotiation style dynamics from the point of view of computational ecology. This model inspires an ecosystem monitor as well as a novel negotiation style recommender. The ecosystem monitor provides hints to the negotiation style recommender to achieve greater stability of an open negotiation environment in a digital business ecosystem. The greater stability provides the small companies with higher predictability, and therefore better business results. The negotiation style recommender is implemented with a simulated annealing algorithm at a constant temperature, and its impact is shown by applying it to a real case of an open negotiation environment populated by Italian companies

A simulation-based algorithm for solving the resource-assignment problem in satellite telecommunication networks

This paper proposes an heuristic for the scheduling of capacity requests and the periodic assignment of radio resources in geostationary (GEO) satellite networks with star topology, using the Demand Assigned Multiple Access (DAMA) protocol in the link layer, and Multi-Frequency Time Division Multiple Access (MF-TDMA) and Adaptive Coding and Modulation (ACM) in the physical layer.