Now showing items 1-20 of 21

    • Accelerating zero knowledge proofs 

      Pujol Ventosa, Laia (Universitat Politècnica de Catalunya, 2023-10-19)
      Bachelor thesis
      Open Access
      Covenantee:   Massachusetts Institute of Technology / Massachusetts Institute of Technology
      Les proves de coneixement zero són una eina criptogràfica altament prometedora que permet demostrar que un predicat és correcte sense revelar informació addicional sobre aquest. Aquestes tipus de proves són útils en ...
    • Adjacency maps and efficient graph algorithms 

      Valiente Feruglio, Gabriel Alejandro (Multidisciplinary Digital Publishing Institute (MDPI), 2022-02-20)
      Article
      Open Access
      Graph algorithms that test adjacencies are usually implemented with an adjacency-matrix representation because the adjacency test takes constant time with adjacency matrices, but it takes linear time in the degree of the ...
    • Automated chlorine dosage in a simulated drinking water treatment plant: a real case study 

      Gámiz Caro, Javier Francisco; Grau Saldes, Antoni; Martínez García, Herminio; Bolea Monte, Yolanda (Multidisciplinary Digital Publishing Institute, 2020-06-11)
      Article
      Open Access
      In this paper, we present a simulator of a drinking water treatment plant. The model of the plant was based in hydraulic and matter transportation models. In order to not introduce more inaccuracies in the simulation, the ...
    • Communication-aware sparse patterns for the factorized approximate inverse preconditioner 

      Laut Turón, Sergi; Casas, Marc; Borrell Pol, Ricard (Association for Computing Machinery (ACM), 2022)
      Conference report
      Open Access
      The Conjugate Gradient (CG) method is an iterative solver targeting linear systems of equations Ax=b where A is a symmetric and positive definite matrix. CG convergence properties improve when preconditioning is applied ...
    • Eigenvalues with respect to a weight for discrete elliptic boundary value problems 

      Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Mitjana Riera, Margarida (2019)
      Conference report
      Open Access
    • Energy harvesting for system of coupled oscillators under external excitation in the vicinity of resonance 1:1 

      Acho Zuppa, Leonardo; Awrejcewicz,, Jan; Losyeva, Nataliya; Puzyrov, Volodymyr; Savchenko, Nina (2020-12-14)
      Article
      Open Access
      Vibration energy is abundantly present in many natural and artificial systems and can be assembled by various devices, mainly employing benefits of the piezoelectric and electromagnetic phenomena. In the present article, ...
    • Green functions on product networks 

      Arauz Lombardía, Cristina; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Mitjana Riera, Margarida (2018-01-01)
      Article
      Open Access
      We aim here at determining the Green function for general Schrödinger operators on product networks. The first step consists in expressing Schrödinger operators on a product network as sum of appropriate Schrödinger operators ...
    • Implementation and evaluation of a PRNG optimized for HPC 

      Jurado Balaer, David (Universitat Politècnica de Catalunya, 2021-01-26)
      Bachelor thesis
      Open Access
      Acceleration is a widely used technique in the field of High-Performance Computing (HPC) to improve the performance of standard CPU powered computational nodes. Examples of widely used accelerators in HPC are graphic cards ...
    • Improved bounds for randomly sampling colorings via linear programming 

      Chen, Sitan; Delcourt, Michelle; Moitra, Ankur; Perarnau Llobet, Guillem; Postle, Luke (2019)
      Conference report
      Restricted access - publisher's policy
      A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the set of k-colorings of a graph G on n vertices with maximum degree ¿ is rapidly mixing for k = ¿ + 2. In FOCS 1999, Vigoda ...
    • Locality analysis and its hardware implications for graph pattern mining 

      Arduengo García, Ana (Universitat Politècnica de Catalunya, 2023-05-24)
      Bachelor thesis
      Open Access
      Covenantee:   Massachusetts Institute of Technology
      En aquest treball hem abordat l'acceleració d'aplicacions GPM des de la perspectiva oferta per l'arquitectura NDP. Hem desenvolupat una nova eina de simulació, basada en la integració de dos coneguts simuladors: ZSim (per ...
    • Matching points with disks with a common intersection 

      Huemer, Clemens; Pérez Lantero, Pablo; Seara Ojea, Carlos; Silveira, Rodrigo Ignacio (2019-07-01)
      Article
      Open Access
      We consider matchings with diametral disks between two sets of points R and B. More precisely, for each pair of matched points p ¿ R and q ¿ B, we consider the disk through p and q with the smallest diameter. We prove that ...
    • Modeling seismic wave propagation using staggered-grid mimetic finite differences 

      Solano, Freysimar; Guevara-Jordan, Juan; González, Carlos; Rojas, Otilio; Otero Calviño, Beatriz (2017-04-12)
      Article
      Open Access
      Mimetic finite difference (MFD) approximations of continuous gradient and divergente operators satisfy a discrete version of the Gauss-Divergente theorem on staggered grids. On the mimetic approximation of this integral ...
    • Non-homogenizable classes of finite structures 

      Atserias, Albert; Torunczyk, Szymon Abram (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016)
      Conference report
      Open Access
      Homogenization is a powerful way of taming a class of finite structures with several interesting applications in different areas, from Ramsey theory in combinatorics to constraint satisfaction problems (CSPs) in computer ...
    • On publicly verifiable secret sharing schemes 

      Lavollée, Jérémy (Universitat Politècnica de Catalunya, 2023-01)
      Master thesis
      Open Access
      Secret sharing allows a dealer to distribute shares of a secret to a set of parties such that only so-called authorised subsets of these parties can recover the secret, whilst forbidden sets gain at most some restricted amount ...
    • On varieties defined by large sets of quadrics and their application to error-correcting codes 

      Ball, Simeon Michael; Pepe, Valentina (2020-10-01)
      Article
      Open Access
      Let U be a ( k-1 2 - 1)-dimensional subspace of quadratic forms defined on F k with the property that U does not contain any reducible quadratic form. Let V (U) be the points of PG(k - 1, F) which are zeros of all quadratic ...
    • On zero-one and convergence laws for graphs embeddable on a fixed surface 

      Atserias, Albert; Kreutzer, Stephan; Noy Serrano, Marcos (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018)
      Conference report
      Open Access
      We show that for no surface except for the plane does monadic second-order logic (MSO) have a zero-one-law - and not even a convergence law - on the class of (connected) graphs embeddable on the surface. In addition we ...
    • Planar differential growth rates initiate precise fold positions in complex epithelia 

      Muñoz Romero, José (2019-11-04)
      Article
      Open Access
      Tissue folding is a fundamental process that shapes epithelia into complex 3D organs. The initial positioning of folds is the foundation for the emergence of correct tissue morphology. Mechanisms forming individual folds ...
    • Rainbow matchings in Dirac bipartite graphs 

      Coulson, Matthew John; Perarnau Llobet, Guillem (2019-01-15)
      Article
      Open Access
      We show the existence of rainbow perfect matchings in µn-bounded edge colorings of Dirac bipartite graphs, for a sufficiently small µ¿>¿0. As an application of our results, we obtain several results on the existence of ...
    • Satisfiability of constraint specifications on XML documents 

      Navarro Gómez, Marisa; Orejas Valdés, Fernando; Pino Blanco, Elvira (Springer, 2015)
      Conference report
      Open Access
      Jose Meseguer is one of the earliest contributors in the area of Algebraic Specification. In this paper, which we are happy to dedicate to him on the occasion of his 65th birthday, we use ideas and methods coming from that ...
    • Total domination in plane triangulations 

      Claverol Aguas, Mercè; Garcia Olaverri, Alfredo Martin; Hernández Peñalver, Gregorio; Hernando Martín, María del Carmen; Maureso Sánchez, Montserrat; Mora Giné, Mercè; Tejel Altarriba, Francisco Javier (2021-01-01)
      Article
      Open Access
      A total dominating set of a graph is a subset of such that every vertex in is adjacent to at least one vertex in . The total domination number of , denoted by , is the minimum cardinality of a total dominating set of . A ...