<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>DSpace Community:</title>
    <link>http://hdl.handle.net/2117/3971</link>
    <description />
    <pubDate>Thu, 23 May 2013 02:10:44 GMT</pubDate>
    <dc:date>2013-05-23T02:10:44Z</dc:date>
    <itunes:owner>
      <itunes:email>webmaster.bupc@upc.edu</itunes:email>
      <itunes:name>Universitat Politècnica de Catalunya. Servei de Biblioteques i Documentació</itunes:name>
    </itunes:owner>
    <itunes:explicit>no</itunes:explicit>
    <itunes:keywords />
    <item>
      <title>Empowering automatic data-center management with machine learning</title>
      <link>http://hdl.handle.net/2117/19370</link>
      <description>Title: Empowering automatic data-center management with machine learning
Authors: Berral García, Josep Lluís; Gavaldà Mestre, Ricard; Torres Viñals, Jordi
Abstract: The Cloud as computing paradigm has become nowadays crucial for most Internet business models. Managing and optimizing its performance on a moment-by-moment basis is not easy given as the amount and diversity of elements involved (hardware, applications, workloads, customer needs...). Here we show how a combination of scheduling algorithms and data mining techniques helps improving the performance and profitability of a data-center running virtualized web-services. We model the data-center's main resources (CPU, memory, IO), quality of service (viewed as response time), and workloads (incoming streams of requests) from past executions. We show how these models to help scheduling algorithms make better decisions about job and resource allocation, aiming for a balance between throughput, quality of service, and power consumption.</description>
      <pubDate>Wed, 22 May 2013 11:19:56 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19370</guid>
      <dc:date>2013-05-22T11:19:56Z</dc:date>
      <itunes:author>Berral García, Josep Lluís; Gavaldà Mestre, Ricard; Torres Viñals, Jordi</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
      <itunes:summary>The Cloud as computing paradigm has become nowadays crucial for most Internet business models. Managing and optimizing its performance on a moment-by-moment basis is not easy given as the amount and diversity of elements involved (hardware, applications, workloads, customer needs...). Here we show how a combination of scheduling algorithms and data mining techniques helps improving the performance and profitability of a data-center running virtualized web-services. We model the data-center's main resources (CPU, memory, IO), quality of service (viewed as response time), and workloads (incoming streams of requests) from past executions. We show how these models to help scheduling algorithms make better decisions about job and resource allocation, aiming for a balance between throughput, quality of service, and power consumption.</itunes:summary>
    </item>
    <item>
      <title>Towards an implementation of a social electronic reminder for pills</title>
      <link>http://hdl.handle.net/2117/19369</link>
      <description>Title: Towards an implementation of a social electronic reminder for pills
Authors: Gómez Sebastià, Ignasi; Garcia Gasulla, Dario; Álvarez Napagao, Sergio; Vázquez Salceda, Javier; Cortés García, Claudio Ulises
Abstract: Non-compliance with prescribed medication is a major problem for elder people living alone in developed countries. Forgetfulness and confusion can lead to it, specially when multiple pathologies require a cocktail of diff erent medications each delivered at different time intervals during di fferent periods of time. Assistive technologies, a recent application area for a wide range of Arti cial Intelligence techniques and tools, have been e ectively used for supporting people in their daily activities. This paper introduces the design and implementation of a system for assisting elder people on following the treatment prescribed by a professional, with the novelty of being based in social and organisational aware&#xD;
assistive technology.</description>
      <pubDate>Wed, 22 May 2013 09:00:23 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19369</guid>
      <dc:date>2013-05-22T09:00:23Z</dc:date>
      <itunes:author>Gómez Sebastià, Ignasi; Garcia Gasulla, Dario; Álvarez Napagao, Sergio; Vázquez Salceda, Javier; Cortés García, Claudio Ulises</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Assistive technologies, Normative agents, Agent-oriented software&#xD;
design, Ambient intelligence</itunes:keywords>
      <itunes:summary>Non-compliance with prescribed medication is a major problem for elder people living alone in developed countries. Forgetfulness and confusion can lead to it, specially when multiple pathologies require a cocktail of diff erent medications each delivered at different time intervals during di fferent periods of time. Assistive technologies, a recent application area for a wide range of Arti cial Intelligence techniques and tools, have been e ectively used for supporting people in their daily activities. This paper introduces the design and implementation of a system for assisting elder people on following the treatment prescribed by a professional, with the novelty of being based in social and organisational aware&#xD;
assistive technology.</itunes:summary>
    </item>
    <item>
      <title>Full high-dynamic range images for dynamic scenes</title>
      <link>http://hdl.handle.net/2117/19368</link>
      <description>Title: Full high-dynamic range images for dynamic scenes
Authors: Ramírez Orozco, Raissel; Martín, Ignacio; Loscos, Céline; Vázquez Alcocer, Pere Pau
Abstract: The limited dynamic range of digital images can be extended by composing photographs of the same scene taken with the same camera at the same view point at di erent exposure times. This is a standard procedure for static scenes but a challenging task for dynamic ones. Several methods have been presented but few recover high dynamic range within moving areas. We present a method to recover full high dynamic range (HDR) images&#xD;
from dynamic scenes, even in moving regions. Our method has 3 steps. Firstly, areas a ected by motion are detected to generate a ghost mask. Secondly, we register dynamic objects over a reference image (the best exposed image in the input sequence). Thirdly, we combine the registered input photographs to recover HDR values in a whole image using a weighted average function. Once matching is found, the assembling step guarantees that all aligned pixels will contribute to the  nal result, including dynamic content. Tests were made on more than&#xD;
20 sets of sequences, with moving cars or pedestrians and di erent background. Our results show that Image Mapping Function approach detects best motion regions while Normalized Cross Correlation o ers the best deal speed-accuracy for image registration. Results from our method o ers better result when moving object are roughly rigid and their movement is mostly rigid. The  nal composition is an HDR image with no ghosting and all dynamic content present in HDR values.</description>
      <pubDate>Wed, 22 May 2013 08:40:29 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19368</guid>
      <dc:date>2013-05-22T08:40:29Z</dc:date>
      <itunes:author>Ramírez Orozco, Raissel; Martín, Ignacio; Loscos, Céline; Vázquez Alcocer, Pere Pau</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>High dynamic range imaging, Movement detection, Image registration</itunes:keywords>
      <itunes:summary>The limited dynamic range of digital images can be extended by composing photographs of the same scene taken with the same camera at the same view point at di erent exposure times. This is a standard procedure for static scenes but a challenging task for dynamic ones. Several methods have been presented but few recover high dynamic range within moving areas. We present a method to recover full high dynamic range (HDR) images&#xD;
from dynamic scenes, even in moving regions. Our method has 3 steps. Firstly, areas a ected by motion are detected to generate a ghost mask. Secondly, we register dynamic objects over a reference image (the best exposed image in the input sequence). Thirdly, we combine the registered input photographs to recover HDR values in a whole image using a weighted average function. Once matching is found, the assembling step guarantees that all aligned pixels will contribute to the  nal result, including dynamic content. Tests were made on more than&#xD;
20 sets of sequences, with moving cars or pedestrians and di erent background. Our results show that Image Mapping Function approach detects best motion regions while Normalized Cross Correlation o ers the best deal speed-accuracy for image registration. Results from our method o ers better result when moving object are roughly rigid and their movement is mostly rigid. The  nal composition is an HDR image with no ghosting and all dynamic content present in HDR values.</itunes:summary>
    </item>
    <item>
      <title>Cloud virtual machine scheduling: modelling the cloud virtual machine instantiation</title>
      <link>http://hdl.handle.net/2117/19310</link>
      <description>Title: Cloud virtual machine scheduling: modelling the cloud virtual machine instantiation
Authors: Sotiriadis, S.; Bessis, N.; Xhafa Xhafa, Fatos; Antonopoulos, Nicos</description>
      <pubDate>Thu, 16 May 2013 13:55:24 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19310</guid>
      <dc:date>2013-05-16T13:55:24Z</dc:date>
      <itunes:author>Sotiriadis, S.; Bessis, N.; Xhafa Xhafa, Fatos; Antonopoulos, Nicos</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Cloud, Static and dynamic virtual machine scheduling, Virtual machine instantiation, Virtualization</itunes:keywords>
    </item>
    <item>
      <title>Performance analysis of DSR and DYMO routing protocols for VANETs</title>
      <link>http://hdl.handle.net/2117/19306</link>
      <description>Title: Performance analysis of DSR and DYMO routing protocols for VANETs
Authors: Spaho, Evjola; Ikeda, Makoto; Barolli, Leonard; Xhafa Xhafa, Fatos; Kolici, Vladi; Takizawa, Makoto</description>
      <pubDate>Thu, 16 May 2013 13:36:45 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19306</guid>
      <dc:date>2013-05-16T13:36:45Z</dc:date>
      <itunes:author>Spaho, Evjola; Ikeda, Makoto; Barolli, Leonard; Xhafa Xhafa, Fatos; Kolici, Vladi; Takizawa, Makoto</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>DSR, DYMO, Routing protocols, VANETs</itunes:keywords>
    </item>
    <item>
      <title>Performance evaluation of WMN-GA system for low densities of clients and different settings of population size</title>
      <link>http://hdl.handle.net/2117/19304</link>
      <description>Title: Performance evaluation of WMN-GA system for low densities of clients and different settings of population size
Authors: Oda, Tetsuya; Barolli, Admir; Spaho, Evjola; Barolli, Leonard; Xhafa Xhafa, Fatos; Takizawa, Makoto</description>
      <pubDate>Thu, 16 May 2013 13:22:36 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19304</guid>
      <dc:date>2013-05-16T13:22:36Z</dc:date>
      <itunes:author>Oda, Tetsuya; Barolli, Admir; Spaho, Evjola; Barolli, Leonard; Xhafa Xhafa, Fatos; Takizawa, Makoto</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Genetic algorithms, Number of covered users, Population size, Size of giant component, Wireless Mesh Networks</itunes:keywords>
    </item>
    <item>
      <title>Multimedia transmissions over a MANET testbed: problems and issues</title>
      <link>http://hdl.handle.net/2117/19301</link>
      <description>Title: Multimedia transmissions over a MANET testbed: problems and issues
Authors: Kulla, E.; Ikeda, Makoto; Oda, Tetsuya; Barolli, Leonard; Xhafa Xhafa, Fatos; Takizawa, Makoto</description>
      <pubDate>Thu, 16 May 2013 13:12:58 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19301</guid>
      <dc:date>2013-05-16T13:12:58Z</dc:date>
      <itunes:author>Kulla, E.; Ikeda, Makoto; Oda, Tetsuya; Barolli, Leonard; Xhafa Xhafa, Fatos; Takizawa, Makoto</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Audio, BATMAN, MANET testbed, Multimedia transmissions, Problems and issues, Video</itunes:keywords>
    </item>
    <item>
      <title>Data replication and synchronization in P2P collaborative systems</title>
      <link>http://hdl.handle.net/2117/19300</link>
      <description>Title: Data replication and synchronization in P2P collaborative systems
Authors: Xhafa Xhafa, Fatos</description>
      <pubDate>Thu, 16 May 2013 13:04:29 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19300</guid>
      <dc:date>2013-05-16T13:04:29Z</dc:date>
      <itunes:author>Xhafa Xhafa, Fatos</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Data replication, data synchronization, P2P systems, groupware</itunes:keywords>
    </item>
    <item>
      <title>A comparison study between two fuzzy-based trustworthiness systems for P2P networks</title>
      <link>http://hdl.handle.net/2117/19264</link>
      <description>Title: A comparison study between two fuzzy-based trustworthiness systems for P2P networks
Authors: Umezaki, K.; Spaho, Evjola; Barolli, Leonard; Xhafa Xhafa, Fatos; Matsuo, Keita; Iwashige, J.</description>
      <pubDate>Wed, 15 May 2013 15:47:19 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19264</guid>
      <dc:date>2013-05-15T15:47:19Z</dc:date>
      <itunes:author>Umezaki, K.; Spaho, Evjola; Barolli, Leonard; Xhafa Xhafa, Fatos; Matsuo, Keita; Iwashige, J.</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Fuzzy system, JXTA-Overlay, P2P, Trustworthiness</itunes:keywords>
    </item>
    <item>
      <title>Tuning of operators in memetic algorithms for independent batch scheduling in computational grids</title>
      <link>http://hdl.handle.net/2117/19263</link>
      <description>Title: Tuning of operators in memetic algorithms for independent batch scheduling in computational grids
Authors: Xhafa Xhafa, Fatos; Duran, B.; Barolli, Leonard; Kolici, Vladi; Miho, Rozeta; Takizawa, Makoto</description>
      <pubDate>Wed, 15 May 2013 15:34:03 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19263</guid>
      <dc:date>2013-05-15T15:34:03Z</dc:date>
      <itunes:author>Xhafa Xhafa, Fatos; Duran, B.; Barolli, Leonard; Kolici, Vladi; Miho, Rozeta; Takizawa, Makoto</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Computational Grids, Memetic Algorithms, Meta-heuristics, Operators, Tuning</itunes:keywords>
    </item>
    <item>
      <title>Mission operations scheduling: complexity and resolution methods</title>
      <link>http://hdl.handle.net/2117/19260</link>
      <description>Title: Mission operations scheduling: complexity and resolution methods
Authors: Xhafa Xhafa, Fatos; Sun, Junzi; Barolli, Admir; Takizawa, Makoto</description>
      <pubDate>Wed, 15 May 2013 15:05:24 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19260</guid>
      <dc:date>2013-05-15T15:05:24Z</dc:date>
      <itunes:author>Xhafa Xhafa, Fatos; Sun, Junzi; Barolli, Admir; Takizawa, Makoto</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Constraint programming, Genetic Algorithms, Ground station scheduling, Satellite scheduling, Simulation</itunes:keywords>
    </item>
    <item>
      <title>A fuzzy-based cluster-head selection system for WSNs: a comparison study for static and mobile sensors</title>
      <link>http://hdl.handle.net/2117/19259</link>
      <description>Title: A fuzzy-based cluster-head selection system for WSNs: a comparison study for static and mobile sensors
Authors: Barolli, Leonard; Wang, Qi; Kulla, E.; Xhafa Xhafa, Fatos; Kamo, B.; Takizawa, Makoto</description>
      <pubDate>Wed, 15 May 2013 14:48:08 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19259</guid>
      <dc:date>2013-05-15T14:48:08Z</dc:date>
      <itunes:author>Barolli, Leonard; Wang, Qi; Kulla, E.; Xhafa Xhafa, Fatos; Kamo, B.; Takizawa, Makoto</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords />
    </item>
    <item>
      <title>Performance evaluation of WMN-GA system for dense networks considering different distributions</title>
      <link>http://hdl.handle.net/2117/19258</link>
      <description>Title: Performance evaluation of WMN-GA system for dense networks considering different distributions
Authors: Barolli, Admir; Oda, Tetsuya; Barolli, Leonard; Xhafa Xhafa, Fatos; Takizawa, Makoto; Uchida, K.</description>
      <pubDate>Wed, 15 May 2013 14:28:58 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19258</guid>
      <dc:date>2013-05-15T14:28:58Z</dc:date>
      <itunes:author>Barolli, Admir; Oda, Tetsuya; Barolli, Leonard; Xhafa Xhafa, Fatos; Takizawa, Makoto; Uchida, K.</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Crossover operators, Genetic algorithms, Mutation operators, Size of giant component, Wireless mesh networks</itunes:keywords>
    </item>
    <item>
      <title>Socially-aware emergent narrative</title>
      <link>http://hdl.handle.net/2117/19256</link>
      <description>Title: Socially-aware emergent narrative
Authors: Álvarez Napagao, Sergio; Gómez Sebastià, Ignasi; Panagiotidi, Sofia; Tejeda Gómez, José Arturo; Oliva Felipe, Luis Javier; Vázquez Salceda, Javier
Abstract: In agent research, emergent narrative aims for practical solutions to the narrative paradox problem in both drama and interactive scenarios. At the same time, organisational frameworks can be used in games to provide flexibility, adaptiveness, or social-awareness. In this paper, we propose an extension of our cOncienS framework to support emergent narrative in games with two objectives: 1) provide social-awareness in emergent narrative by means of an organisational model, and 2) create convincing dynamic and flexible storytelling in games.</description>
      <pubDate>Wed, 15 May 2013 14:10:46 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19256</guid>
      <dc:date>2013-05-15T14:10:46Z</dc:date>
      <itunes:author>Álvarez Napagao, Sergio; Gómez Sebastià, Ignasi; Panagiotidi, Sofia; Tejeda Gómez, José Arturo; Oliva Felipe, Luis Javier; Vázquez Salceda, Javier</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Adaptiveness, Agent research, Emergent narrative, Practical solutions</itunes:keywords>
      <itunes:summary>In agent research, emergent narrative aims for practical solutions to the narrative paradox problem in both drama and interactive scenarios. At the same time, organisational frameworks can be used in games to provide flexibility, adaptiveness, or social-awareness. In this paper, we propose an extension of our cOncienS framework to support emergent narrative in games with two objectives: 1) provide social-awareness in emergent narrative by means of an organisational model, and 2) create convincing dynamic and flexible storytelling in games.</itunes:summary>
    </item>
    <item>
      <title>The HOM problem is EXPTIME-complete</title>
      <link>http://hdl.handle.net/2117/19252</link>
      <description>Title: The HOM problem is EXPTIME-complete
Authors: Creus López, Carles; Gascón Caro, Adrià; Godoy Balil, Guillem; Ramos, Lander
Abstract: The HOM problem questions whether the image of a given regular tree language through a given tree homomorphism is also regular. Decidability of HOM is an important theoretical question which was open for a long time. Recently, HOM has been proved decidable with a triple exponential time algorithm. In this paper we obtain an exponential time algorithm for this problem, and conclude that it is EXPTIME-complete. The proof builds upon previous results and techniques on tree automata with constraints.</description>
      <pubDate>Wed, 15 May 2013 13:39:05 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/2117/19252</guid>
      <dc:date>2013-05-15T13:39:05Z</dc:date>
      <itunes:author>Creus López, Carles; Gascón Caro, Adrià; Godoy Balil, Guillem; Ramos, Lander</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Decision Problems, Tree Automata, Tree Homomorphisms</itunes:keywords>
      <itunes:summary>The HOM problem questions whether the image of a given regular tree language through a given tree homomorphism is also regular. Decidability of HOM is an important theoretical question which was open for a long time. Recently, HOM has been proved decidable with a triple exponential time algorithm. In this paper we obtain an exponential time algorithm for this problem, and conclude that it is EXPTIME-complete. The proof builds upon previous results and techniques on tree automata with constraints.</itunes:summary>
    </item>
  </channel>
</rss>

