Estructura de datos avanzadas : clases disjuntas, montículos, árboles de búsqueda

En aquest treball s'amplia la implementació en Java de les estructures de dades iniciada per Esteve Mariné, utilitzant el seu disseny bàsic. Concretament, s'ha fet la programació de les estructures de a) classes disjuntes, utilitzant els algorismes de llistes encadenades i amb estructura d'arbre, b) monticles, amb els algorismes binari, binomial i de Fibonacci, i c) arbres de recerca basats en l'algorisme d'arbre binari vermell-negre, el qual complementa els dos ja existents amb algorismes d'encadenaments i AVL. Per a examinar l'evolució de les estructures, s'ha preparat un visualitzador gràfic interactiu amb l'usuari que permet fer les operacions bàsiques de l'estructura. Amb aquest entorn és possible desar les estructures, tornar a reproduir-les i desfer i tornar a repetir les operacions fetes sobre l'estructura. Finalment, aporta una metodologia, amb visualització mitjançant gràfics, de l'avaluació comparativa dels algorismes implementats, que permet modificar els paràmetres d'avaluació com ara nombre d'elements que s'han de tractar, algorismes que s'han de comparar i nombre de repeticions. Les dades obtingudes es poden exportar per a analitzar-les posteriorment.

Markov chain montecarlo method applied to rounding zeros of compositional data: first approach

As stated in Aitchison (1986), a proper study of relative variation in a compositional data set should be based on logratios, and dealing with logratios excludes dealing with zeros. Nevertheless, it is clear that zero observations might be present in real data sets, either because the corresponding part is completelyabsent –essential zeros– or because it is below detection limit –rounded zeros. Because the second kind of zeros is usually understood as “a trace too small to measure”, it seems reasonable to replace them by a suitable small value, and this has been the traditional approach. As stated, e.g. by Tauber (1999) and byMartín-Fernández, Barceló-Vidal, and Pawlowsky-Glahn (2000), the principal problem in compositional data analysis is related to rounded zeros. One should be careful to use a replacement strategy that does not seriously distort the general structure of the data. In particular, the covariance structure of the involvedparts –and thus the metric properties– should be preserved, as otherwise further analysis on subpopulations could be misleading. Following this point of view, a non-parametric imputation method isintroduced in Martín-Fernández, Barceló-Vidal, and Pawlowsky-Glahn (2000). This method is analyzed in depth by Martín-Fernández, Barceló-Vidal, and Pawlowsky-Glahn (2003) where it is shown that thetheoretical drawbacks of the additive zero replacement method proposed in Aitchison (1986) can be overcome using a new multiplicative approach on the non-zero parts of a composition. The new approachhas reasonable properties from a compositional point of view. In particular, it is “natural” in the sense thatit recovers the “true” composition if replacement values are identical to the missing values, and it is coherent with the basic operations on the simplex. This coherence implies that the covariance structure of subcompositions with no zeros is preserved. As a generalization of the multiplicative replacement, in thesame paper a substitution method for missing values on compositional data sets is introduced

Algorithmic aspects of bio-inspired string operations

We present building blocks for algorithms for the efficient reduction of square factor, i.e. direct repetitions in strings. So the basic problem is this: given a string, compute all strings that can be obtained by reducing factors of the form zz to z. Two types of algorithms are treated: an offline algorithm is one that can compute a data structure on the given string in advance before the actual search for the square begins; in contrast, online algorithms receive all input only at the time when a request is made. For offline algorithms we treat the following problem: Let u and w be two strings such that w is obtained from u by reducing a square factor zz to only z. If we further are given the suffix table of u, how can we derive the suffix table for w without computing it from scratch? As the suffix table plays a key role in online algorithms for the detection of squares in a string, this derivation can make the iterated reduction of squares more efficient. On the other hand, we also show how a suffix array, used for the offline detection of squares, can be adapted to the new string resulting from the deletion of a square. Because the deletion is a very local change, this adaption is more eficient than the computation of the new suffix array from scratch.

Implementació amb Visual Basic d'un algorisme per a encriptar i desencriptar

Treball de recerca realitzat per un alumne d’ensenyament secundari i guardonat amb un Premi CIRIT per fomentar l'esperit científic del Jovent l’any 2005. La criptografia és l’art d’escriure un llenguatge convingut, amb l’ús d’unes claus i de la seva operació inversa se’n diu criptoanalitzar. Els sistemes criptogràfics han estat emprats al llarg de la història. Actualment existeixen multituds de software i de hardware destinats a analitzar el tràfic de dades en xarxes de computadores. Encara que aquestes eines constitueixen un avenç en tècniques de seguretat i protecció, el seu ús indegut es al mateix temps un greu problema i una enorme font d’atacs a la intimitat dels seus usuaris i a la integritat dels seus propis sistemes. Des d’aquest punt de vista, s’explica com s’ha dissenyat dos aplicacions informàtiques per encriptar i desencriptar.

Modified differentials and basic cohomology for Riemannian foliations

We define a new version of the exterior derivative on the basic forms of a Riemannian foliation to obtain a new form of basic cohomology that satisfies Poincaré duality in the transversally orientable case. We use this twisted basic cohomology to show relationships between curvature, tautness, and vanishing of the basic Euler characteristic and basic signature.

Index theory for basic Dirac operators on Riemannian foliations

In this paper we prove a formula for the analytic index of a basic Dirac-type operator on a Riemannian foliation, solving a problem that has been open for many years. We also consider more general indices given by twisting the basic Dirac operator by a representation of the orthogonal group. The formula is a sum of integrals over blowups of the strata of the foliation and also involves eta invariants of associated elliptic operators. As a special case, a Gauss-Bonnet formula for the basic Euler characteristic is obtained using two independent proofs.

WePreserve 2009: DPE/Planets/CASPAR/nestor Joint Training Event: The Preservation challenge: basic concepts and practical applications (Barcelona, 23-27 març 2009)

Reseña del congreso WePreserve 2009 que tuvo lugar los pasados 23 al 27 de marzo en Barcelona, organizadopor la Facultad de Biblioteconomía y Documentación de la Universitat de Barcelona, con la colaboración del Institut d'Estudis Catalans, la Biblioteca de Catalunya y el Consorci de Biblioteques de Barcelona. El seminario 2009 WePreserve se celebra anualmente desde el año 2007 y participan todas las figuras de referencia europeas en materia de investigación en sistemas y metodologías que garantizan la preservación digital de los documentos: Digital Preservation Europe (DPE), Preservation and Long-term Access Through Networked Services (Planets), Cultural Artistic and Scientific Knowledge for Preservation, Access and Retrieval (CASPAR), y Network of expertise in Digital long-term preservation (nestor).

CoDaPack. An Excel and Visual Basic based software of compositional data analysis. Current version and discussion form upcoming versions

In the eighties, John Aitchison (1986) developed a new methodological approach for the statistical analysis of compositional data. This new methodology was implemented in Basic routines grouped under the name CODA and later NEWCODA inMatlab (Aitchison, 1997). After that, several other authors have published extensions to this methodology: Marín-Fernández and others (2000), Barceló-Vidal and others (2001), Pawlowsky-Glahn and Egozcue (2001, 2002) and Egozcue and others (2003). (...)

A Sustainable Development Strategy for the Pyrenees-Mediterranean Euroregion: Basic Guidelines

L'estudi presenta té per objecte formular els requisits necessaris per posar en marxa una estratègia per al desenvolupament sostenible de l'Euroregió Pirineus-Mediterrània. Aquest és un projecte de cooperació transfronterera regional promogut per l'expresident de la Generalitat, Honorable Sr Pasqual Maragall, que, a més de Catalunya, inclou Aragó, Illes Balears, Llenguadoc-Rosselló i Migdia-Pirineus. A la Unió Europea hi ha més de 70 euroregions, que han estat en funcionant per diferents periodes de temps, després d'haver estat creat per regions o entitats locals, o ambdós

A multi-objective model for a multi-period distribution management problem

The problems arising in commercial distribution are complex and involve several players and decision levels. One important decision is relatedwith the design of the routes to distribute the products, in an efficient and inexpensive way.This article deals with a complex vehicle routing problem that can beseen as a new extension of the basic vehicle routing problem. The proposed model is a multi-objective combinatorial optimization problemthat considers three objectives and multiple periods, which models in a closer way the real distribution problems. The first objective is costminimization, the second is balancing work levels and the third is amarketing objective. An application of the model on a small example, with5 clients and 3 days, is presented. The results of the model show the complexity of solving multi-objective combinatorial optimization problems and the contradiction between the several distribution management objective.

A new chance-constrained maximum capture location problem

The paper presents a new model based on the basic Maximum Capture model,MAXCAP. The New Chance Constrained Maximum Capture modelintroduces astochastic threshold constraint, which recognises the fact that a facilitycan be open only if a minimum level of demand is captured. A metaheuristicbased on MAX MIN ANT system and TABU search procedure is presented tosolve the model. This is the first time that the MAX MIN ANT system isadapted to solve a location problem. Computational experience and anapplication to 55 node network are also presented.

Creació d'un programa de rentat industrial amb Visual Basic

Treball de recerca realitzat per alumnes d’ensenyament secundari i guardonat amb un Premi CIRIT per fomentar l'esperit científic del Jovent l’any 2010. L’objectiu del treball ha consistit a desenvolupar un programa informàtic per controlar les fases d'un procés de rentat industrial.

Endogeneous matching in university-industry collaboration: Theory and empirical evidence from the UK

We develop a two-sided matching model to analyze collaboration between heterogeneousacademics and firms. We predict a positive assortative matching in terms of both scientificability and affinity for type of research, but negative assortative in terms of ability on one sideand affinity in the other. In addition, the most able and most applied academics and the mostable and most basic firms shall collaborate rather than stay independent. Our predictionsreceive strong support from the analysis of the teams of academics and firms that proposeresearch projects to the UK's Engineering and Physical Sciences Research Council.