Exploració per tema "Computer science--Mathematics"
Ara es mostren els items 1-20 de 45
-
4-Holes in point sets
(2014-08-01)
Article
Accés obertWe consider a variant of a question of Erdos on the number of empty k-gons (k-holes) in a set of n points in the plane, where we allow the k-gons to be non-convex. We show bounds and structural results on maximizing and ... -
A data science approach for spatiotemporal modelling of low and resident air pollution in Madrid (Spain): implications for epidemiological studies
(2019-05-01)
Article
Accés obertModel developments to assess different air pollution exposures within cities are still a key challenge in environmental epidemiology. Background air pollution is a long-term resident and low-level concentration pollution ... -
A multi-attribute group decision model based on unbalanced and multi-granular linguistic information: an application to assess entrepreneurial competencies in secondary schools
(2021-11-01)
Article
Accés restringit per acord de confidencialitatAdvances in multi-attribute group decision making require the development of structures flexible enough to deal with unbalanced and multi-granular linguistic information. New distances between linguistic terms are needed ... -
A new meta-module design for efficient reconfiguration of modular robots
(Springer Nature, 2021-05-01)
Article
Accés obertWe propose a new meta-module design for two important classes of modular robots. The new metamodule is three-dimensional, robust and compact, improving on the previously proposed one. It applies to socalled “edge-hinged” ... -
A non-oscillatory face-centred finite volume method for compressible flows
(Elsevier, 2022-03-15)
Article
Accés obertThis work presents the face-centred finite volume (FCFV) paradigm for the simulation of compressible flows. The FCFV method defines the unknowns at the face barycentre and uses a hybridisation procedure to eliminate all ... -
A note on flips in diagonal rectangulations
(Chapman & Hall/CRC, 2018-11-09)
Article
Accés obertRectangulations are partitions of a square into axis-aligned rectangles. A number of results provide bijections between combinatorial equivalence classes of rectangulations and families of pattern-avoiding permutations. ... -
A study of the threshold selection in the Linear Threshold Rank for random social networks
(Universitat Politècnica de Catalunya, 2020-07)
Projecte Final de Màster Oficial
Accés restringit per decisió de l'autorAn influence network is a directed graph with edge weights and node thresholds. Influence spreads starting from X=S. When the sum of the weights of the incoming arcs from X overpasses a node threshold it is added to X. The ... -
A traffic simulation tool for assessing smart city policies (CitScale)
(2019-09-28)
Article
Accés obertOver the last century, cities have developed as a function of increased usage of automobiles as the standard transport mode. The number of cars increased along with the population as highways and parking spots became ... -
Asymptotics of sequences
(2017-12-01)
Capítol de llibre
Accés restringit per política de l'editorial -
Bounds on the size of super edge-magic graphs depending on the girth
(2009-12-13)
Report de recerca
Accés obertLet G = (V,E) be a graph of order p and size q. It is known that if G is super edge-magic graph then q 2p−3. Furthermore, if G is super edge-magic and q = 2p−3, then the girth of G is 3. It is also known that if the ... -
Comunitats en xarxes complexes: detecció i centralitat
(Universitat Politècnica de Catalunya, 2017-07)
Treball Final de Grau
Accés obertEn aquest treball estudiem l'estructura de comunitats en xarxes complexes. S'anomenen xarxes complexes als grafs construïts a partir de dades empíriques complint una sèrie de propietats, i s'entén per comunitat en un xarxa ... -
Continuous mean distance of a weighted graph
(2023-08-01)
Article
Accés obertWe study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance can be defined as the arithmetic mean of the distances between all pairs of vertices. This parameter ... -
(Di)graph products, labelings and related results
(2017-07)
Article
Accés obertGallian's survey shows that there is a big variety of labelings of graphs. By means of (di)graphs products we can establish strong relations among some of them. Moreover, due to the freedom of one of the factors, we can ... -
Dirichlet-to-Robin maps on finite networks
(2015-04-01)
Article
Accés obertOur aim is to characterize those matrices that are the response matrix of a semi positive definite Schrodinger operator on a circular planar network. Our findings generalize the known results and allow us to consider both ... -
El arte de contar: combinatoria y enumeración
(RBA Libros, 2011-06-01)
Llibre
Accés restringit per política de l'editorialMuchas de las preguntas más importantes de las matemáticas modernas requieren dominar un arte muy especial: el de contar. La rama de las matemáticas que ha hecho del enumerar un arte se llama combinatoria, y de la mano de ... -
Empowering teachers' self assessment of their own practice on student's oral skills: EVALOE decision support system
(Scitepress, 2018)
Text en actes de congrés
Accés restringit per política de l'editorialSchool is an essential context that contributes to children's communicative competence. Decision Support Systems (DSS) are tools that can help teachers to assess their own practice and to make decisions to improve it (Gregg, ... -
Empty monochromatic simplices
(2014-03-01)
Article
Accés obertLet S be a k-colored (finite) set of n points in , da parts per thousand yen3, in general position, that is, no (d+1) points of S lie in a common (d-1)-dimensional hyperplane. We count the number of empty monochromatic ... -
Encapsulated PGD algebraic toolbox operating with high-dimensional data
(2019-11-28)
Article
Accés obertIn its original conception, proper generalized decomposition (PGD) provides explicit parametric solutions, denoted as computational vademecums or digital abacuses, to parametric boundary value problems. The PGD approach ... -
Enumerating super edge-magic labelings for some types of path-like trees
(2010-06-02)
Article
Accés obertThe main goal of this paper is to use a variation of the Kronecker product of matrices in order to obtain lower bounds for the number of non isomorphic super edge-magic labelings of some types of path-like trees. As a ... -
Extraction of threshold functions from formulas in propositional logic
(Universitat Politècnica de Catalunya, 2017-01)
Treball Final de Grau
Accés restringit per decisió de l'autorGiven a formula in propositional logic F in some presentation (BDD, ROBDD, truth table), our aim is to find a threshold function T that is a logical consequence of F and that is as strong as possible according to certain ...