Algorithm creation and optimization for the crew pairing problem

Algoritmo que optimiza y crea pairings para tripulaciones de líneas aéreas mediante la posterior programación en Java.

A note on parallelizing the parameterized expectations algorithm

The parameterized expectations algorithm (PEA) involves a long simulation and a nonlinear least squares (NLS) fit, both embedded in a loop. Both steps are natural candidates for parallelization. This note shows that parallelization can lead to important speedups for the PEA. I provide example code for a simple model that can serve as a template for parallelization of more interesting models, as well as a download link for an image of a bootable CD that allows creation of a cluster and execution of the example code in minutes, with no need to install any software.

Automatic Extraction of Polar Adjectives for the Creation of Polarity Lexicons

Automatic creation of polarity lexicons is a crucial issue to be solved in order to reduce time andefforts in the first steps of Sentiment Analysis. In this paper we present a methodology based onlinguistic cues that allows us to automatically discover, extract and label subjective adjectivesthat should be collected in a domain-based polarity lexicon. For this purpose, we designed abootstrapping algorithm that, from a small set of seed polar adjectives, is capable to iterativelyidentify, extract and annotate positive and negative adjectives. Additionally, the methodautomatically creates lists of highly subjective elements that change their prior polarity evenwithin the same domain. The algorithm proposed reached a precision of 97.5% for positiveadjectives and 71.4% for negative ones in the semantic orientation identification task.

A Methodology to measure shareholder value orientation and shareholder value creation aimed at providing a research basis to investigate the link between both magnitudes

Does shareholder value orientation lead to shareholder value creation? This article proposes methods to quantify both, shareholder value orientation and shareholder value creation. Through the application of these models it is possible to quantify both dimensions and examine statistically in how far shareholder value orientation explains shareholder value creation. The scoring model developed in this paper allows quantifying the orientation of managers towards the objective to maximize wealth of shareholders. The method evaluates information that comes from the companies and scores the value orientation in a scale from 0 to 10 points. Analytically the variable value orientation is operationalized expressing it as the general attitude of managers toward the objective of value creation, investment policy and behavior, flexibility and further eight value drivers. The value creation model works with market data such as stock prices and dividend payments. Both methods where applied to a sample of 38 blue chip companies: 32 firms belonged to the share index IBEX 35 on July 1st, 1999, one company represents the “new economy” listed in the Spanish New Market as per July 1st, 2001, and 5 European multinational groups formed part of the EuroStoxx 50 index also on July 1st, 2001. The research period comprised the financial years 1998, 1999, and 2000. A regression analysis showed that between 15.9% and 23.4% of shareholder value creation can be explained by shareholder value orientation.

Technological trampolines for new venture creation in Catalonia: the case of the University of Girona

Recent trends in technology transfer show an intensification of spin-off creation as a modality of university research commercialisation, complementary to the conventional ones, contract research and licensing. In this paper we analyse the evolution, objectives, resources and activities of a specialised unit –Technological Trampoline (TT) - in charge of new venture creation at the University of Girona (Catalonia-Spain). Based on two theoretical frameworks, Resource-based-view and Institutional Theory, we adopt a multi-dimensional approach to study the strategy of spinning-off new ventures at the University of Girona in terms of resources and activities, how this process is organised and if the outputs fit with this UdG’s objectives and the local environment. Our main contribution is an in-depth analysis of the spin-off creation unit with special emphasis on its variety of resources and activities. The results have a series of implications and recommendations at both university and TT level.

Creation of a carrier-grade telco based on a voice over IP backbone

En aquesta memòria l'autor, fent servir un enfoc modern, redissenya i implementa la plataforma que una empresa de telecomunicacions del segle 21 necessita per poder donar serveis de telefonia i comunicacions als seus usuaris i clients. Al llarg d'aquesta exposició es condueix al lector des d'una fase inicial de disseny fins a la implementació i posada en producció del sistema final desenvolupat, centrant-nos en solucionar les necessitats actuals que això implica. Aquesta memòria cubreix el software, hardware i els processos de negoci associats al repte de fer realitat aquest objectiu, i presenta al lector les múltiples tecnologies emprades per aconseguir-ho, fent emfàsi en la convergència actual de xarxes cap al concepte de xarxes IP i basant-se en aquesta tendència i utilitzant aquesta tecnologia de veu sobre IP per donar forma a la plataforma que finalment, de forma pràctica, es posa en producció.

A numerical algorithm for finding solutions of a generalized Nash equilibrium problem

A family of nonempty closed convex sets is built by using the data of the Generalized Nash equilibrium problem (GNEP). The sets are selected iteratively such that the intersection of the selected sets contains solutions of the GNEP. The algorithm introduced by Iusem-Sosa (2003) is adapted to obtain solutions of the GNEP. Finally some numerical experiments are given to illustrate the numerical behavior of the algorithm.

An algorithm for semi-infinite polynomial optimization

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

An approximation algorithm for #k-SAT

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

BCN­Routing : càlcul web de rutes amb pgRouting, OpenStreetMap i OpenLayers

En aquest projecte s'ha desenvolupat una interfície web per calcular rutes a la ciutat de Barcelona. Les rutes calculades són a peu, entre un punt d'origen qualsevol i un punt d'interès turístic de la ciutat com a destí. Per això s'han extret les dades dels carrers de Barcelona d'OpenStreetMap i s'han insertat a una base de dades postgreSQL/postGIS, juntament amb una capa vectorial de punts d'interès turístic que s'ha creat amb el SIG d'escriptori qGIS. El càlcul de les rutes amb les dades de la base de dades s'ha realitzat amb l'extensió pgRouting, i la interfície web per seleccionar els punts d'origen i destí, mostrar els mapes, i mostrar les rutes resultat, s'ha desenvolupat utilitzant la llibreria OpenLayers.

Creació d'un plug-in de Protégé per a podar ontologies

La creació d'una ontologia partint de zero és una feina llarga i feixuga que pot simplificar-se si, partint d'una ontologia més general, es poden podar les parts que no formen part del domini de context. Aquesta memòria té una doble vessant: d'un costat l'estudi de l'estat de l'art de les ontologies (història, aplicacions, línies de treball, etc) i de l'altra l'anàlisi i disseny d'un plug-in en java per a Protégé que implementi l'algorisme de poda.

Desarrollo de un índice espacial para la extensión JASPA sobre H2

El presente trabajo tiene por objetivo ofrecer una solución para la creación de un índice espacial para la extensión JASPA (Java SPAtial) sobre la base de datos H2. El algoritmo de indexación elegido para la implementación del índice espacial ha sido el Rtree.La implementación se ha realizado con el lenguaje de programación Java lo que ha facilitado su integración con la extensión JASPA y la base de datos H2, dado que ambos proyectos están codificados en el mismo lenguaje. El índice es persistente en memoria secundaria en una tabla de la propia base de datos H2.La solución que se propone está limitada a operaciones espaciales en dos dimensiones y es lo suficientemente flexible como para que no se haya necesitado modificar ni el código fuente de JASPA, ni de H2. Además, se ha previsto que el algoritmo de indexación se pueda mejorar o sustituir fácilmente.Por último, se ha tenido en cuenta que el proceso de creación y manipulación de los índices espaciales sea intuitivo y fácil de usar.

Open video tools to support the production of online collaborative audiovisual projects : how to promote collective creation in e-learning

This paper analyses the use of open video editing tools to support the creation and production of online collaborative audiovisual projects for higher education. It focuses on the possibilities offered by these tools to promote collective creation in virtual environments.

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