Exploració per tema "Graphs"
Ara es mostren els items 1-20 de 31
-
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
(2015-05)
Article
Accés obertThis paper focuses on the capacitated minimum spanning tree(CMST)problem.Given a central processor and a set of remote terminals with specified demands for traffic that must flow between the central processor and terminals,the ... -
A fast and efficient algorithm to identify clusters in networks
(2010-11-01)
Article
Accés restringit per política de l'editorialA characteristic feature of many relevant real life networks, like the WWW, Internet, transportation and communication networks, or even biological and social networks, is their clustering structure. We discuss in this ... -
A Knowledge-Graph Data Layer for Software Project Dashboards
(Universitat Politècnica de Catalunya, 2023-06-29)
Projecte Final de Màster Oficial
Accés obertSoftware project dashboards provide advanced visualization capabilities and analysis techniques (such as predictions, simulations, what-if analysis, and alerts). They operate by gathering data from several sources (such ... -
Bass numbers of local cohomology of cover ideals of graphs
(2020)
Article
Accés obertWe develop splitting techniques to study the Lyubeznik numbers of cover ideals of graphs which allow us to describe them for large families of graphs including forests, cycles, wheels and cactus graphs. More generally, we ... -
Cascade failures in air transportation networks
(Universitat Politècnica de Catalunya, 2012-07-04)
Treball Final de Grau
Accés obertWe are surrounded by many complex networks like the World Wide Web, Internet, transportation networks, among others. The resilience of these networks, i.e., the ability to maintain their properties and operation when there ... -
Caterpillars are antimagic
(2021-01-21)
Article
Accés obertAn antimagic labeling of a graph G is a bijection from the set of edges E(G) to {1,2,…,|E(G)|}, such that all vertex sums are pairwise distinct, where the vertex sum at vertex u is the sum of the labels assigned to the ... -
Causal reasoning over knowledge graphs leveraging drug-perturbed and disease-specific transcriptomic signatures for drug discovery
(Public Library of Science (PLOS), 2022-02)
Article
Accés obertNetwork-based approaches are becoming increasingly popular for drug discovery as they provide a systems-level overview of the mechanisms underlying disease pathophysiology. They have demonstrated significant early promise ... -
Causal reasoning over knowledge graphs leveraging drug-perturbed and disease-specific transcriptomic signatures for drug discovery
(Public Library of Science, 2022-02)
Article
Accés obertNetwork-based approaches are becoming increasingly popular for drug discovery as they provide a systems-level overview of the mechanisms underlying disease pathophysiology. They have demonstrated significant early promise ... -
Classification in biological networks with hypergraphlet kernels
(Oxford University Press, 2020)
Article
Accés obertAbstract Motivation Biological and cellular systems are often modeled as graphs in which vertices represent objects of interest (genes, proteins and drugs) and edges represent relational ties between these objects ... -
Degree lower bounds of tower-type for approximating formulas with parity quantifiers
(2014-02-01)
Article
Accés obertKolaitis and Kopparty have shown that for any first-order formula with parity quantifiers over the language of graphs, there is a family of multivariate polynomials of constant-degree that agree with the formula on all but ... -
Detection of nework attacks using graph neural networks
(Universitat Politècnica de Catalunya, 2023-01-20)
Projecte Final de Màster Oficial
Accés obertThe last few years have seen an increasing wave of attacks with serious economic and privacy damages, which evinces the need for accurate Network Intrusion Detection Systems (NIDS). Recent works proposed the use of Machine ... -
Detection of nework attacks using graph neural networks
(Universitat Politècnica de Catalunya, 2023-01-20)
Projecte Final de Màster Oficial
Accés obertThe last few years have seen an increasing wave of attacks with serious economic and privacy damages, which evinces the need for accurate Network Intrusion Detection Systems (NIDS). Recent works proposed the use of Machine ... -
Enumeration of chordal planar graphs and maps
(Universitat Politècnica de Catalunya, 2022-05)
Projecte Final de Màster Oficial
Accés obertWe determine the number of labelled chordal planar graphs with $n$ vertices, which is asymptotically $c_1\cdot n^{-5/2} \gamma^n n!$ for a constant $c_1>0$ and $\gamma \approx 11.89235$. We also determine the number of ... -
Graph Signal Processing for Link Prediction
(Universitat Politècnica de Catalunya, 2023-02-01)
Treball Final de Grau
Accés obertThis project will focus on the development of methods to predict relations (links) between elements (nodes) of a network structured in a graph. In order to study these systems, the graphs will be understood as a signal ... -
Inherent directionality explains the lack of feedback loops in empirical networks
(MACMILLAN PUBLISHERS LIMITED, 2014-12-22)
Article
Accés obertWe explore the hypothesis that the relative abundance of feedback loops in many empirical complex networks is severely reduced owing to the presence of an inherent global directionality. Aimed at quantifying this idea, we ... -
Library-free technology mapping for VLSI circuits with regular layouts
(Universitat Politècnica de Catalunya, 2014-07)
Projecte Final de Màster Oficial
Accés obertTechnology mapping is the task to transform a technology independent logic network into a mapped network using gates from a library, optimizing some objective function such total area, delay or power consumption. As stated, ... -
Markov chain monte carlo methods applied to big graphs clustering
(Universitat Politècnica de Catalunya, 2015-07-10)
Projecte Final de Màster Oficial
Accés obert
Realitzat a/amb: École nationale supérieure des télécommunicationsWe propose two new method that implements community detection algorithms introducing stochastic process. The stochasticity aims at enabling the methods to exit local minima. Besides we expect to obtain better efficiency ... -
Matrix completion and extrapolation via kernel regression
(2019-10-01)
Article
Accés obertMatrix completion and extrapolation (MCEX) are dealt with here over reproducing kernel Hilbert spaces (RKHSs) in order to account for prior information present in the available data. Aiming at a fast and low-complexity ... -
Metamaterial structure analysis using graphs
(Universitat Politècnica de Catalunya, 2021-01-02)
Treball Final de Grau
Accés obertOne of the current scientific challenges is to progress in research on metamaterials to contribute to their practical applications. The transfer of this knowledge is showing applications in the scientific, technological, ... -
Modelado y simulación del flujo de intercambiadores de calor de tubos y aletas con cambio de fase en el refrigerante
(Universitat Politècnica de Catalunya. CIMNE, 2016)
Article
Accés obertEn este trabajo se presenta el desarrollo de una herramienta computacional para la simulación del comportamiento del flujo en los intercambiadores de tubos y aletas en el que se puede presentar cambio de fase en el ...
