UPCommons
http://upcommons.upc.edu
UPCommons, el portal d'accés obert al coneixement de la UPC, està format pel conjunt de dipòsits institucionals oberts de la UPC i té com a missió garantir la preservació de la producció docent i de recerca cientificotècnica de la Universitat, maximitzant-ne la visibilitat i, conseqüentment, incrementant-ne l’impacte en la docència i la recerca de tot el món.2016-12-02T06:33:01ZReconocimiento de especies biológicas con redes neuronales convolucionales.
http://hdl.handle.net/2117/97667
Reconocimiento de especies biológicas con redes neuronales convolucionales.
Gironès Bedós, Xavier
Elaboración de un programa que sea capaz de reconocer una especie biológica (árbol en principio) a través de una foto tomada por un usuario. Posibilidad de vincular el programa a una App para Smartphone.
2016-12-01T19:45:36ZGironès Bedós, XavierElaboración de un programa que sea capaz de reconocer una especie biológica (árbol en principio) a través de una foto tomada por un usuario. Posibilidad de vincular el programa a una App para Smartphone.Environmental assessment of drinking water transport and distribution network use phase for small to medium-sized municipalities in Spain
http://hdl.handle.net/2117/97666
Environmental assessment of drinking water transport and distribution network use phase for small to medium-sized municipalities in Spain
Sanjuan-Delmás, David; Petit Boix, Anna; Gasol, Carlos M.; Farreny, Ramon; Villalba Mendez, Gara; Suárez-Ojeda, María Eugenia; Gabarrell Durany, Xavier; Josa Garcia-Tornel, Alejandro; Rieradevall Pons, Joan
Previous studies assessing the environmental impacts of drinking water supply networks have considered a bottom-up approach, analysing single case studies. This paper presents a top-down approach for the assessment of the operational phase of a water supply network. A representative sample of 50 cities was statistically analysed to find relations between different variables regarding electricity and water consumption linked with the environmental impacts of the network. The results show that some of the variables are clearly related to the relative energy consumption of the network. Such is the case for population size, where small municipalities have up to 14 times higher relative electricity consumption compared with medium-sized municipalities (1.15E-2 as opposed to 8.3E-4 kWh/m3 registered water km of network) due to case-specific factors such as a strong gradient between a water tank and the consumption point. Similarly, the cases showing low population density exhibit 7 times higher relative electricity consumption because of the longer distances that must be covered and the correlation between population density and size. The values found for greenhouse gas (GHG) emissions derived from the energy consumption are consistent with results from previous studies: on average, 5.53 kg of CO2 eq. emissions/inhabitant·year are released, but the variability is very high, ranging from 0.005 to 67.8 kg of CO2 eq. emissions/inhabitant·year. No clearly significant correlations were found between the relative water demand and variables such as seasonality or income per capita, which might indicate that water consumption depends on individual decisions of the population rather than on the variables assessed. Models for the estimation of water demand, length of network and electricity consumption were defined. However, the modelling of electricity consumption presented more difficulties because of its high variability. A protocol for data collection should be defined and implemented in the future to enable the analysis of more high quality case studies and for the definition of more accurate and reliable models.
2016-12-01T19:30:09ZSanjuan-Delmás, DavidPetit Boix, AnnaGasol, Carlos M.Farreny, RamonVillalba Mendez, GaraSuárez-Ojeda, María EugeniaGabarrell Durany, XavierJosa Garcia-Tornel, AlejandroRieradevall Pons, JoanPrevious studies assessing the environmental impacts of drinking water supply networks have considered a bottom-up approach, analysing single case studies. This paper presents a top-down approach for the assessment of the operational phase of a water supply network. A representative sample of 50 cities was statistically analysed to find relations between different variables regarding electricity and water consumption linked with the environmental impacts of the network. The results show that some of the variables are clearly related to the relative energy consumption of the network. Such is the case for population size, where small municipalities have up to 14 times higher relative electricity consumption compared with medium-sized municipalities (1.15E-2 as opposed to 8.3E-4 kWh/m3 registered water km of network) due to case-specific factors such as a strong gradient between a water tank and the consumption point. Similarly, the cases showing low population density exhibit 7 times higher relative electricity consumption because of the longer distances that must be covered and the correlation between population density and size. The values found for greenhouse gas (GHG) emissions derived from the energy consumption are consistent with results from previous studies: on average, 5.53 kg of CO2 eq. emissions/inhabitant·year are released, but the variability is very high, ranging from 0.005 to 67.8 kg of CO2 eq. emissions/inhabitant·year. No clearly significant correlations were found between the relative water demand and variables such as seasonality or income per capita, which might indicate that water consumption depends on individual decisions of the population rather than on the variables assessed. Models for the estimation of water demand, length of network and electricity consumption were defined. However, the modelling of electricity consumption presented more difficulties because of its high variability. A protocol for data collection should be defined and implemented in the future to enable the analysis of more high quality case studies and for the definition of more accurate and reliable models.Information systems action research weaknesses addressed with project management
http://hdl.handle.net/2117/97665
Information systems action research weaknesses addressed with project management
Estay Niculcar, Christian Antonio; Pastor Collado, Juan Antonio
Action research is a qualitative research method with several weaknesses
when it is used in Information Systems.
In order to improve action research in Information Systems, in this
paper we address these weaknesses with
consolidated results from the project management discipline. We
illustrate this proposal along two main aspects:
on one side, with a retrospective analysis of a set of problems reported
in a published case; and, on other side,
by discussing the relationship of our proposal with the
interdisciplinary work involved in an Information Systems
action research project.
2016-12-01T19:23:25ZEstay Niculcar, Christian AntonioPastor Collado, Juan AntonioAction research is a qualitative research method with several weaknesses
when it is used in Information Systems.
In order to improve action research in Information Systems, in this
paper we address these weaknesses with
consolidated results from the project management discipline. We
illustrate this proposal along two main aspects:
on one side, with a retrospective analysis of a set of problems reported
in a published case; and, on other side,
by discussing the relationship of our proposal with the
interdisciplinary work involved in an Information Systems
action research project.Reconocimiento de especies biológicas con redes neuronales convolucionales.
http://hdl.handle.net/2117/97664
Reconocimiento de especies biológicas con redes neuronales convolucionales.
Génova Tesoro, Ana
Elaboración de un programa que sea capaz de reconocer una especie biológica (árbol en principio) a través de una foto tomada por un usuario. Posibilidad de vincular el programa a una App para Smartphone.
2016-12-01T19:19:49ZGénova Tesoro, AnaElaboración de un programa que sea capaz de reconocer una especie biológica (árbol en principio) a través de una foto tomada por un usuario. Posibilidad de vincular el programa a una App para Smartphone.On the construction of high dimensional simple games
http://hdl.handle.net/2117/97663
On the construction of high dimensional simple games
Olsen, Martin; Kurz, Sascha; Molinero Albareda, Xavier
Voting is a commonly applied method for the aggregation
of the preferences of multiple agents into a joint decision. If preferences are binary, i.e., “yes” and “no”, every voting system can be
described by a (monotone) Boolean function : f0; 1gn ! f0; 1g.
However, its naive encoding needs 2n bits. The subclass of threshold
functions, which is sufficient for homogeneous agents, allows
a more succinct representation using n weights and one threshold.
For heterogeneous agents one can represent as an intersection of k
threshold functions. Taylor and Zwicker have constructed a sequence
of examples requiring k 2 n2 ¿1 and provided a construction guaranteeingk ¿ n bn=2c 2 2n¿o(n). The magnitude of the worst case situation was thought to be determined by Elkind et al. in 2008, but the analysis unfortunately turned out to be wrong. Here we uncover a relation to coding theory that allows the determination of the minimum number k for a subclass of voting systems. As an application, we give a construction for k 2n¿o(n), i.e., there is no gain from a representation complexity point of view.
2016-12-01T19:18:00ZOlsen, MartinKurz, SaschaMolinero Albareda, XavierVoting is a commonly applied method for the aggregation
of the preferences of multiple agents into a joint decision. If preferences are binary, i.e., “yes” and “no”, every voting system can be
described by a (monotone) Boolean function : f0; 1gn ! f0; 1g.
However, its naive encoding needs 2n bits. The subclass of threshold
functions, which is sufficient for homogeneous agents, allows
a more succinct representation using n weights and one threshold.
For heterogeneous agents one can represent as an intersection of k
threshold functions. Taylor and Zwicker have constructed a sequence
of examples requiring k 2 n2 ¿1 and provided a construction guaranteeingk ¿ n bn=2c 2 2n¿o(n). The magnitude of the worst case situation was thought to be determined by Elkind et al. in 2008, but the analysis unfortunately turned out to be wrong. Here we uncover a relation to coding theory that allows the determination of the minimum number k for a subclass of voting systems. As an application, we give a construction for k 2n¿o(n), i.e., there is no gain from a representation complexity point of view.Aprendiendo a pensar con las manos: estrategias creativas de aprendizaje en Arquitectura
http://hdl.handle.net/2117/97662
Aprendiendo a pensar con las manos: estrategias creativas de aprendizaje en Arquitectura
Alba-Dorado, María Isabel
García Escudero, Daniel; Bardí Milà, Berta; Domingo Calabuig, Débora
Every project comes into existence through a handmade object. When designing, our hands act as tools that move between the worlds of matter and thought, making it possible to work with our ideas, clarifying them and fixing them up into
something buildable. From the drawing, the performing of sketches, models, collages ... we can travel that road made by ideas to enter a world of physical reality through a process in which the actions of thinking, drawing and building
continually succeed each other. This article tries to explore the role of our hands when designing in order to learn more about the process of creating the architectural project and the way it is generated, to finally speak about issues
interesting for us concerning the way they are taught.; Todo proyecto comienza a existir a través de un objeto realizado con las manos. Al proyectar nuestras manos actúan como herramientas que se mueven entre el mundo de la materia y el pensamiento, haciendo posible el trabajo con nuestras ideas, precisándolas y fijándolas hasta convertirlas en algo construible. A partir del dibujo, de la realización de bocetos, croquis, maquetas, collages… nos es posible recorrer ese camino que hacen las ideas hasta incorporarse al mundo de la realidad física a través de un proceso en el que las acciones de pensar, dibujar y construir se suceden continuamente. Este artículo trata de profundizar en el papel que juegan nuestras manos a la hora de proyectar con el objetivo de conocer más acerca del proceso de creación del proyecto de arquitectura y de cómo éste se genera para, en último término, pronunciarnos acerca de cuestiones que nos interesan en relación con su docencia.
2016-12-01T19:14:57ZAlba-Dorado, María IsabelEvery project comes into existence through a handmade object. When designing, our hands act as tools that move between the worlds of matter and thought, making it possible to work with our ideas, clarifying them and fixing them up into
something buildable. From the drawing, the performing of sketches, models, collages ... we can travel that road made by ideas to enter a world of physical reality through a process in which the actions of thinking, drawing and building
continually succeed each other. This article tries to explore the role of our hands when designing in order to learn more about the process of creating the architectural project and the way it is generated, to finally speak about issues
interesting for us concerning the way they are taught.
Todo proyecto comienza a existir a través de un objeto realizado con las manos. Al proyectar nuestras manos actúan como herramientas que se mueven entre el mundo de la materia y el pensamiento, haciendo posible el trabajo con nuestras ideas, precisándolas y fijándolas hasta convertirlas en algo construible. A partir del dibujo, de la realización de bocetos, croquis, maquetas, collages… nos es posible recorrer ese camino que hacen las ideas hasta incorporarse al mundo de la realidad física a través de un proceso en el que las acciones de pensar, dibujar y construir se suceden continuamente. Este artículo trata de profundizar en el papel que juegan nuestras manos a la hora de proyectar con el objetivo de conocer más acerca del proceso de creación del proyecto de arquitectura y de cómo éste se genera para, en último término, pronunciarnos acerca de cuestiones que nos interesan en relación con su docencia.Combining spectral sequencing and parallel simulated annealing for the MinLA problem
http://hdl.handle.net/2117/97661
Combining spectral sequencing and parallel simulated annealing for the MinLA problem
Petit Silvestre, Jordi
In this paper we present and analyze new sequential and parallel
heuristics to approximate the Minimum Linear Arrangement problem
(MinLA). The heuristics consist in obtaining a first global solution
using Spectral Sequencing and improving it locally through Simulated
Annealing. In order to accelerate the annealing process, we present a
special neighborhood distribution that tends to favor moves with high
probability to be accepted. We show how to make use of this
neighborhood to parallelize the Metropolis stage on distributed memory
machines by mapping partitions of the input graph to processors and
performing moves concurrently. The paper reports the results obtained
with this new heuristic when applied to a set of large graphs,
including graphs arising from finite elements methods and graphs
arising from VLSI applications. Compared to other heuristics, the
measurements obtained show that the new heuristic improves the
solution quality, decreases the running time and offers an excellent
speedup when ran on a commodity network made of nine personal
computers.
2016-12-01T19:10:19ZPetit Silvestre, JordiIn this paper we present and analyze new sequential and parallel
heuristics to approximate the Minimum Linear Arrangement problem
(MinLA). The heuristics consist in obtaining a first global solution
using Spectral Sequencing and improving it locally through Simulated
Annealing. In order to accelerate the annealing process, we present a
special neighborhood distribution that tends to favor moves with high
probability to be accepted. We show how to make use of this
neighborhood to parallelize the Metropolis stage on distributed memory
machines by mapping partitions of the input graph to processors and
performing moves concurrently. The paper reports the results obtained
with this new heuristic when applied to a set of large graphs,
including graphs arising from finite elements methods and graphs
arising from VLSI applications. Compared to other heuristics, the
measurements obtained show that the new heuristic improves the
solution quality, decreases the running time and offers an excellent
speedup when ran on a commodity network made of nine personal
computers.Dimension and codimension of simple games
http://hdl.handle.net/2117/97660
Dimension and codimension of simple games
Kurz, Sascha; Molinero Albareda, Xavier; Olsen, Martin; Serna Iglesias, María José
This paper studies the complexity of computing a representation of a simple game as the intersection (union) of weighted majority games, as well as, the dimension or the codimension. We also present some examples with linear dimension and exponential codimension with respect to the number of players.
2016-12-01T18:56:01ZKurz, SaschaMolinero Albareda, XavierOlsen, MartinSerna Iglesias, María JoséThis paper studies the complexity of computing a representation of a simple game as the intersection (union) of weighted majority games, as well as, the dimension or the codimension. We also present some examples with linear dimension and exponential codimension with respect to the number of players.A memetic algorithm for the minimum weighted k-cardinality tree subgraph problem
http://hdl.handle.net/2117/97659
A memetic algorithm for the minimum weighted k-cardinality tree subgraph problem
Blesa Aguilera, Maria Josep; Moscato, Pablo; Xhafa Xhafa, Fatos
In this paper we present a memetic algorithm for the minimum weighted
k-cardinality tree subgraph problem.
This problem consists in finding, in a given undirected weighted graph
G=(V,E,W), a tree T of k edges having
minimal total weight among all of k-trees that are subgraphs of G. This
problem was first described by Hamacher,
Jornsten, and Maffioli (1991) who also proved to be strongly NP-hard.
Given this observation, researchers have
focused on heuristic and metaheuristic algorithms to find suboptimal
feasible solutions for the problem, as a good way
to cope with most practical setting applications.
To our knowledge, no memetic algorithm (MA) has yet been reported for
this problem. It is known that some MAs have
a good synergy with Tabu Search when they use it as individual steps
for diversification and local optimization by the agents.
As a consequence, one of our main motivations was to obtain a new
implementation of an MA to the problem using an
existing implementation of Tabu Search to the problem (Blesa and Xhafa,
2000). We are currently implementing the
proposed algorithm.
2016-12-01T18:55:20ZBlesa Aguilera, Maria JosepMoscato, PabloXhafa Xhafa, FatosIn this paper we present a memetic algorithm for the minimum weighted
k-cardinality tree subgraph problem.
This problem consists in finding, in a given undirected weighted graph
G=(V,E,W), a tree T of k edges having
minimal total weight among all of k-trees that are subgraphs of G. This
problem was first described by Hamacher,
Jornsten, and Maffioli (1991) who also proved to be strongly NP-hard.
Given this observation, researchers have
focused on heuristic and metaheuristic algorithms to find suboptimal
feasible solutions for the problem, as a good way
to cope with most practical setting applications.
To our knowledge, no memetic algorithm (MA) has yet been reported for
this problem. It is known that some MAs have
a good synergy with Tabu Search when they use it as individual steps
for diversification and local optimization by the agents.
As a consequence, one of our main motivations was to obtain a new
implementation of an MA to the problem using an
existing implementation of Tabu Search to the problem (Blesa and Xhafa,
2000). We are currently implementing the
proposed algorithm.Diagrammatic analysis of nonlinear planar waveguides
http://hdl.handle.net/2117/97658
Diagrammatic analysis of nonlinear planar waveguides
Pérez Torres, Juan; Torner Sabata, Lluís
We show that universal V–b diagrams provide a powerful tool for analyzing the properties of nonlinear TE-polarized waves guided by optical planar structures. Here we focus on a waveguide consisting of an optically linear film bounded by a saturable nonlinear substrate and cladding. Relevant information on existence conditions and stability of the different allowed nonlinear guided waves is summarized in a few diagrams, and waveguiding properties can be immediately read off them. Critical, power-independent values of the various waveguide parameters for the different kinds of wave that exist have been identified, and we give the condition in parameter space that ensures stable propagation in a symmetric structure.
2016-12-01T18:42:34ZPérez Torres, JuanTorner Sabata, LluísWe show that universal V–b diagrams provide a powerful tool for analyzing the properties of nonlinear TE-polarized waves guided by optical planar structures. Here we focus on a waveguide consisting of an optically linear film bounded by a saturable nonlinear substrate and cladding. Relevant information on existence conditions and stability of the different allowed nonlinear guided waves is summarized in a few diagrams, and waveguiding properties can be immediately read off them. Critical, power-independent values of the various waveguide parameters for the different kinds of wave that exist have been identified, and we give the condition in parameter space that ensures stable propagation in a symmetric structure.