Computing inverse optical flow

[EN] We propose four algorithms for computing the inverse optical flow between two images. We assume that the forward optical flow has already been obtained and we need to estimate the flow in the backward direction. The forward and backward flows can be related through a warping formula, which allows us to propose very efficient algorithms. These are presented in increasing order of complexity. The proposed methods provide high accuracy with low memory requirements and low running times.In general, the processing reduces to one or two image passes. Typically, when objects move in a sequence, some regions may appear or disappear. Finding the inverse flows in these situations is difficult and, in some cases, it is not possible to obtain a correct solution. Our algorithms deal with occlusions very easy and reliably. On the other hand, disocclusions have to be overcome as a post-processing step. We propose three approaches for filling disocclusions. In the experimental results, we use standard synthetic sequences to study the performance of the proposed methods, and show that they yield very accurate solutions. We also analyze the performance of the filling strategies. 

A PDE model for computing the optical flow

[EN] In this paper we present a new model for optical flow calculation using a variational formulation which preserves discontinuities of the flow much better than classical methods. We study the Euler-Lagrange equations asociated to the variational problem. In the case of quadratic energy, we show the existence and uniqueness of the corresponding evolution problem. Since our method avoid linearization in the optical flow constraint, it can recover large displacement in the scene. We avoid convergence to irrelevant local minima by embedding our method into a linear scale-space framework and using a focusing strategy from coarse to fine scales.

Formalizing languages for service oriented computing

Service Oriented Computing is a new programming paradigm for addressing distributed system design issues. Services are autonomous computational entities which can be dynamically discovered and composed in order to form more complex systems able to achieve different kinds of task. E-government, e-business and e-science are some examples of the IT areas where Service Oriented Computing will be exploited in the next years. At present, the most credited Service Oriented Computing technology is that of Web Services, whose specifications are enriched day by day by industrial consortia without following a precise and rigorous approach. This PhD thesis aims, on the one hand, at modelling Service Oriented Computing in a formal way in order to precisely define the main concepts it is based upon and, on the other hand, at defining a new approach, called bipolar approach, for addressing system design issues by synergically exploiting choreography and orchestration languages related by means of a mathematical relation called conformance. Choreography allows us to describe systems of services from a global view point whereas orchestration supplies a means for addressing such an issue from a local perspective. In this work we present SOCK, a process algebra based language inspired by the Web Service orchestration language WS-BPEL which catches the essentials of Service Oriented Computing. From the definition of SOCK we will able to define a general model for dealing with Service Oriented Computing where services and systems of services are related to the design of finite state automata and process algebra concurrent systems, respectively. Furthermore, we introduce a formal language for dealing with choreography. Such a language is equipped with a formal semantics and it forms, together with a subset of the SOCK calculus, the bipolar framework. Finally, we present JOLIE which is a Java implentation of a subset of the SOCK calculus and it is part of the bipolar framework we intend to promote.

Teaching and learning stance in specialized English for computing. A corpus linguistics approach

[EN]The use of large corpora in the study of languages is a well established tradition. In the same vein, scholarship is also well represented in the case of the study of corpora for making grammars of languages. This is the case of the COBUILD grammar and dictionary and the case of the Longman Grammar of Spoken and Written English. This means that corpora have been analyzed in order to identify patterns in languages that can be later practised by learners following those patterns described and exemplified with real instances.

Green Cloud Computing: una rassegna comparativa

La rapida crescita di Internet e del numero di host connessi sta portando sempre di più alla nascita di nuove forme di tecnlogie ed applicazioni serverside, facendo del client un thin-client. Il Cloud Computing offre una valida piattaforma a queste nuove tecnologie, ma esso si deve confrontare con diverse problematiche, fra cui la richiesta energetica sempre più crescente, che si ripercuote su un'inevitabile aumento dei gas serra prodotti indirettamente. In questa tesi analizzeremo i problemi energetici legati al Cloud Computing e le possibili soluzioni, andando infine a creare una tassonomia fra i diversi Cloud Computing più importanti sul mercato attuale.

Transformations of bridging ligands in diiron complexes: unconventional routes to new functionalized multisite bound organic frames

The main scope of this Ph.D. thesis has concerned the possible transformations of bridging ligands in diiron complexes, in order to explore unconventional routes to the synthesis of new functionalized multisite bound organic frames. The results achieved during the Ph.D. can be summarized in the following points: 1) We have extended the assembling between small unsaturated molecules and bridging carbyne ligands in diiron complexes to other species. In particular, we have investigated the coupling between olefins and thiocarbyne, leading to the synthesis of thioallylidene bridging diiron complexes. Then, we have extended the study to the coupling between olefins and aminocarbyne. This result shows that the coupling between activated olefins and heteroatom substituted bridging carbynes has a general character. 2) As we have shown, the coupling of bridging alkylidyne ligands with alkynes and alkenes provides excellent routes to the synthesis of bridging C3 hydrocarbyl ligands. As a possible extension of these results we have examined the synthesis of C4 bridging frames through the combination of bridging alkylidynes with allenes. Also in this case the reaction has a general character. 3) Diiron complexes bearing bridging functionalized C3 organic frames display the presence of donor atoms, such as N and S, potentially able to coordinate unsaturated metal fragments. Thus, we have studied the possibility for these systems to act as ‘organometallic ligands’, in particular towards Pd and Rh. 4) The possibility of releasing the organic frame from the bridging coordination appears particularly appealing in the direction of a metal-assisted organic synthesis. Within this field, we have investigated the possibility of involving the C3 bridging ligand in cycloaddition reactions with alkynes, with the aim of generating variously functionalized five-membered cycles. The [3+2] cyclization does not lead to the complete release of the organic fragment but rather it produces its transformation into a cyclopentadienyl ring, which remains coordinated to one Fe atom. This result introduces a new approach to the formation of polyfunctionalised ferrocenes. 5) Furthermore, I have spent a research period of about six months at the Department of Inorganic Chemistry of the Barcelona University, under the supervision of Prof. Concepción López, with the aim of studying the chemistry of polydentate ferrocenyl ligands and their use in organometallic synthesis.

Garanzie del servizio in ambienti di cloud computing: uno studio sperimentale

Nel corso di questa tesi analizzeremo che cos'è il cloud computing, illustrando i contratti di service level agreement e le soluzioni presenti nel mercato.