Generating trees for permutations avoiding generalized patterns

We construct generating trees with with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation, which allows us to incorporate the adjacency condition about some entries in an occurrence of a generalized pattern. We use these trees to find functional equations for the generating functions enumerating these classes of permutations with respect to different parameters. In several cases we solve them using the kernel method and some ideas of Bousquet-Mélou [2]. We obtain refinements of known enumerative results and find new ones.

Label Space Reduction in All-Optical Label Switchiing Networks

Report for the scientific sojourn at the Department of Information Technology (INTEC) at the Ghent University, Belgium, from january to june 2007. All-Optical Label Swapping (AOLS) forms a key technology towards the implementation of All-Optical Packet Switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the wayin which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This project studies and proposes All-Optical Label Stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this project, an Integer Lineal Program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more.

Marine biotoxins in the Catalan littoral: could biosensors be integrated into monitoring programmes?

Aquest article descriu els sensors enzimàtics i immunosensors electroquímics que s’han desenvolupat als nostres grups per a la detecció de la biotoxina marina àcid okadaic (OA), i discuteix la possibilitat d’integrar-los en programes de seguiment. Els sensors enzimàtics per a OA que es presenten es basen en la inhibició de la proteïna fosfatasa (PP2A) per aquesta toxina i la mesura electroquímica de l’activitat enzimàtica mitjançant l’ús de substrats enzimàtics apropiats, electroquímicament actius després de la seva desfosforació per l’enzim. Els immunosensors electroquímics descrits en aquest article es basen en un enzimoimmunoassaig sobre fase sòlida competitiu indirecte (ciELISA), amb fosfatasa alcalina (ALP) o peroxidasa (HRP) com a marcatges, i un sistema de reciclatge enzimàtic amb diaforasa (DI). Els biosensors presentats aquí s’han aplicat a l’anàlisi de dinoflagel·lats, musclos i ostres. Les validacions preliminars amb assaigs colorimètrics i LC-MS/MS han demostrat la possibilitat d’utilitzar les bioeines desenvolupades per al cribratge preliminar de biotoxines marines en mostres de camp o de cultiu, que ofereixen informació complementària a la cromatografia. En conclusió, tot i que encara cal optimitzar alguns paràmetres experimentals, la integració dels biosensors a programes de seguiment és viable i podria proporcionar avantatges respecte a altres tècniques analítiques pel que fa al temps d’anàlisi, la simplicitat, la selectivitat, la sensibilitat, el fet de poder ser d’un sol ús i l’efectivitat de cost. This article describes the electrochemical enzyme sensors and immunosensors that have been developed by our groups for the detection of marine biotoxin okadaic acid (OA), and discusses the possibility of integrating them into monitoring programmes. The enzyme sensors for OA reported herein are based on the inhibition of immobilised protein phosphatase 2A (PP2A) by this toxin and the electrochemical measurement of the enzyme activity through the use of appropriate enzyme substrates, which are electrochemically active after dephosphorylation by the enzyme. The electrochemical immunosensors described in this article are based on a competitive indirect Enzyme- Linked ImmunoSorbent Assay (ciELISA), using alkaline phosphatase (ALP) or horseradish peroxidase (HRP) as labels, and an enzymatic recycling system with diaphorase (DI). The biosensors presented herein have been applied to the analysis of dinoflagellates, mussels and oysters. Preliminary validations with colorimetric assays and LC-MS/MS have demonstrated the possibility of using the developed biotools for the preliminary screening of marine biotoxins in field or cultured samples, offering complementary information to chromatography. In conclusion, although optimisation of some experimental parameters is still required, the integration of biosensors into monitoring programmes is viable and may provide advantages over other analytical techniques in terms of analysis time, simplicity, selectivity, sensitivity, disposability of electrodes and cost effectiveness.

Sound Texture Modelling

In the PhD thesis “Sound Texture Modeling” we deal with statistical modelling or textural sounds like water, wind, rain, etc. For synthesis and classification. Our initial model is based on a wavelet tree signal decomposition and the modeling of the resulting sequence by means of a parametric probabilistic model, that can be situated within the family of models trainable via expectation maximization (hidden Markov tree model ). Our model is able to capture key characteristics of the source textures (water, rain, fire, applause, crowd chatter ), and faithfully reproduces some of the sound classes. In terms of a more general taxonomy of natural events proposed by Graver, we worked on models for natural event classification and segmentation. While the event labels comprise physical interactions between materials that do not have textural propierties in their enterity, those segmentation models can help in identifying textural portions of an audio recording useful for analysis and resynthesis. Following our work on concatenative synthesis of musical instruments, we have developed a pattern-based synthesis system, that allows to sonically explore a database of units by means of their representation in a perceptual feature space. Concatenative syntyhesis with “molecules” built from sparse atomic representations also allows capture low-level correlations in perceptual audio features, while facilitating the manipulation of textural sounds based on their physical and perceptual properties. We have approached the problem of sound texture modelling for synthesis from different directions, namely a low-level signal-theoretic point of view through a wavelet transform, and a more high-level point of view driven by perceptual audio features in the concatenative synthesis setting. The developed framework provides unified approach to the high-quality resynthesis of natural texture sounds. Our research is embedded within the Metaverse 1 European project (2008-2011), where our models are contributting as low level building blocks within a semi-automated soundscape generation system.

GMODI : Gestión y mantenimiento Online de departamentos informáticos

La finalitat d'aquest projecte és la d'aconseguir d'una banda la gestió de recanvis per als equips informàtics de l'empresa tals com, tonners d'impressores làser i faxos, cartutxos de tinta, escàners i terminals de fàbrica i finalment impressores d'impressió tèrmica per a etiquetes dels productes de la nostra fàbrica. Per l'altre costat tindrem el manteniment dels equips informàtics de l'empresa, és dir els PC's de feina.

Registre d'entrades i eixides per a l'administració pública

Aquesta memòria representa la definició del meu projecte final de carrera amb una aplicació destinada al registre d'entrades i eixides de l'Administració pública. He emprat eines de plataformes lliures i obertes per al desenvolupament del projecte, amb tecnologia J2EE. A més, hi ha l'objectiu de fer servir i provar arquitectures d'última generació com Enterprise JavaBeans Preview_2 (EJB) 3.0 (5/11/04) per a la lògica de negoci, Hibernate 3.0 alpha (actualment hi ha la beta 1.0 publicada el 20/12/04) com a

Construcció d'un SIG i sincronització de les etiquetes amb els objectes representats a GEOMEDIA PROFESSIONAL 5.2

En aquest treball de fi de carrera s'estudia en què consisteix en SIG i les seves característiques, en concret es realitza l'estudi d'un SIG comercial, GEOMEDIA PROFESSIONAL 5.2 D'aquest producte es presenta el problema de sincronització de les etiquetes amb les entitats que etiqueten, i es planteja una solució a aquest problema, mitjançant el desenvolupament d'una aplicació implementada amb MICROSOFT VISUAL BASIC 6.0

On optimal computation of MPLS label binding for multipoint-to-point connections

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced

Label Space Reduction in MPLS Networks: How Much Can A Single Stacked Label Do?

Most network operators have considered reducing LSR label spaces (number of labels used) as a way of simplifying management of underlaying virtual private networks (VPNs) and therefore reducing operational expenditure (OPEX). The IETF outlined the label merging feature in MPLS-allowing the configuration of multipoint-to-point connections (MP2P)-as a means of reducing label space in LSRs. We found two main drawbacks in this label space reduction a)it should be separately applied to a set of LSPs with the same egress LSR-which decreases the options for better reductions, and b)LSRs close to the edge of the network experience a greater label space reduction than those close to the core. The later implies that MP2P connections reduce the number of labels asymmetrically

All-Optical Label Stacking: Easing the Trade-offs Between Routing and Architecture Cost in All-Optical Packet Switching

All-optical label swapping (AOLS) forms a key technology towards the implementation of all-optical packet switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the way in which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This paper studies all-optical label stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this paper, an integer lineal program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more

Implantació de l’etiqueta ecològica comunitària de l’Hotel Melià Girona

Estudi sobre les mesures que l’hotel Melià de Girona hauria d’adoptar per tal d’assolir l’etiqueta ecològica comunitària (EEC). També es fa una anàlisi comparativa entre aquesta ecoetiqueta i el sistema de gestió que utilitza actualment l’hotel (EMAS: Eco-Management and Audit Scheme)

Diseñador de Formularios Web Wform

El presente proyecto tiene como finalidad facilitar al desarrollador y usuario en general el diseño de formularios en forma visual, haciendo uso de los componentes frecuentemente utilizados como cajas de texto, etiquetas, áreas de texto, calendarios, casillas de selección, listas desplegables, entre otros para generar código xhtml con JavaServerFaces.Para este fin me he basado en el diseñador de formularios de Joget Workflow, el cual posee una licencia GPLv2, permitiendo modificar su código, está desarrollado bajo Java, dicho diseñador de formulario tiene un entorno web, los cuales son utilizados e interpretados únicamente por su suite, utiliza en la vista páginas JSP y dentro de ellas JSON (JavaScript Object Notation), para el negocio utiliza el framework Spring y para la persistencia Hibernate. Joget persiste en la Base de Datos MySQL y se sugiere alojarse en un servidor Apache Tomcat, pero podría alojarse en cualquiera servidor de aplicaciones web para Java como Jboss Server Applicaction, Glassfish, entre otros.El diseñador de formularios permite la gestión de los formularios como crear, editar y/o eliminar formularios, y generar archivos código XHTML para JSF (Java Server Faces)ayudándolo en gran medida a un desarrollador especialmente de JAVA a visualizar comoquedará su formulario, menor tiempo en la construcción y personalizar su formulario a través de la modificación del código generado.

Distintiu de garantia de qualitat ambiental per a equipaments culturals: aplicació pilot en biblioteques

El DGQA per a Equipaments Culturals és un distintiu per a la certificació ambiental de biblioteques i museus. L’objectiu del projecte és avaluar el distintiu mitjançant una aplicació pilot en 26 biblioteques de la província de Barcelona, i proposar millores tant per al distintiu com per a les biblioteques. També es pretén fer recerca sobre l’ecoetiquetatge de serveis, ja que és un àmbit poc desenvolupat, i sobre el sistema d’estudi, les biblioteques. Una anàlisi de les ecoetiquetes a nivell mundial, considerant 4 macroregions, ha permès caracteritzar les ecoetiquetes i determinar la situació actual dels serveis en l’ecoetiquetatge. Hi han variacions en el nombre de categories entre ecoetiquetes, i el percentatge de categories de serveis és, en general, reduït (8% de mitjana). Els subsectors serveis dominants són els d’Hosteleria, serveis de neteja i comerç. No hi ha cap experiència de certificació ambiental de serveis culturals, per tant, l’ecoetiquetatge de serveis culturals és un àmbit nou. El sistema d’estudi són 26 biblioteques de la província de Barcelona. L’aplicació del distintiu a aquestes s’ha dut a terme realitzant treball de camp a cadascuna per tal de determinar el seu estat ambiental. Posteriorment, s’han analitzat les dades per establir el grau de compliment de cadascuna. La majoria de les biblioteques (85%) compleixen més de la meitat dels criteris bàsics, i un 60% superen la puntuació mínima de compliment dels criteris opcionals. Els resultats obtinguts han permès avaluar la viabilitat de la implantació del distintiu, a través de l’anàlisi de cadascun dels seus criteris. Per tal de millorar les possibilitats d’èxit en la implantació del distintiu, s’han aportat un seguit de propostes a nivell individual i col·lectiu. S’ha realitzat una fitxa per a cadascuna de les 26 biblioteques, per tal d’orientar els gestors de les biblioteques en l’adopció de mesures per a l’acompliment dels criteris. També s’han inclòs propostes a l’avaluació dels criteris, dirigides als gestors del distintiu.

Asymmetric tunnels in P2MP LSPs as a label space reduction method

The objective of traffic engineering is to optimize network resource utilization. Although several works have been published about minimizing network resource utilization, few works have focused on LSR (label switched router) label space. This paper proposes an algorithm that takes advantage of the MPLS label stack features in order to reduce the number of labels used in LSPs. Some tunnelling methods and their MPLS implementation drawbacks are also discussed. The described algorithm sets up NHLFE (next hop label forwarding entry) tables in each LSR, creating asymmetric tunnels when possible. Experimental results show that the described algorithm achieves a great reduction factor in the label space. The presented works apply for both types of connections: P2MP (point-to-multipoint) and P2P (point-to-point)

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