<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Volumen 17 | Número 01</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/134657</link>
<description/>
<pubDate>Thu, 12 Nov 2026 07:54:35 GMT</pubDate>
<dc:date>2026-11-12T07:54:35Z</dc:date>
<item>
<title>Nota editorial del Volumen 17, número 1</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/135697</link>
<description>Contribucion a revista
Electronic Journal of SADIO; vol. 17, no. 1
Nota sobre el contenido del volumen 17, número 1 del Electronic Journal of SADIO.
</description>
<pubDate>Wed, 04 Apr 2018 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/135697</guid>
<dc:date>2018-04-04T00:00:00Z</dc:date>
<dc:description>Nota sobre el contenido del volumen 17, número 1 del Electronic Journal of SADIO.</dc:description>
</item>
<item>
<title>Using negotiation for group recommendation: A user-study on the movies domain</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/135217</link>
<description>Articulo
XVIII Simposio Argentino de Inteligencia Artificial (ASAI) - JAIIO 46 (Córdoba, 2017); Electronic Journal of SADIO; vol. 17, no. 1; https://sedici.unlp.edu.ar/handle/10915/65948
Providing recommendations to groups of users has become popular in many applications today. Even though there are several group recommendation techniques, the generation of recommendations that satisfy the group members in an even way remains a challenge. Because of this, we have developed a multi-agent approach called MAGReS that relies on negotiation techniques to improve group recommendations. Our approach was tested (on the movies domain) using synthetic data with satisfactory results. Given that the results when using synthetic data may sometimes dier with reality, we decided to assess MAGReS using data from real users. The results obtained showed rstly that, in comparison with the recommendations produced by a traditional approach, the recommendations of MAGReS produce a greater level of satisfaction to the group, and secondly that the proposed approach was able to predict more accurately the satisfaction levels of the group members. Finally, we could obtain some preliminary feedback regarding the explanations provided by the recommender system.
</description>
<pubDate>Wed, 04 Apr 2018 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/135217</guid>
<dc:date>2018-04-04T00:00:00Z</dc:date>
<dc:description>Providing recommendations to groups of users has become popular in many applications today. Even though there are several group recommendation techniques, the generation of recommendations that satisfy the group members in an even way remains a challenge. Because of this, we have developed a multi-agent approach called MAGReS that relies on negotiation techniques to improve group recommendations. Our approach was tested (on the movies domain) using synthetic data with satisfactory results. Given that the results when using synthetic data may sometimes dier with reality, we decided to assess MAGReS using data from real users. The results obtained showed rstly that, in comparison with the recommendations produced by a traditional approach, the recommendations of MAGReS produce a greater level of satisfaction to the group, and secondly that the proposed approach was able to predict more accurately the satisfaction levels of the group members. Finally, we could obtain some preliminary feedback regarding the explanations provided by the recommender system.</dc:description>
</item>
<item>
<title>Hydrothermal Unit Commitment with Deterministic Optimization: Generation and Transmission Including Pumped Storage Units</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/135214</link>
<description>Articulo
XV Simposio Argentino de Investigación Operativa (SIO) - JAIIO 46 (Córdoba, 2017); Electronic Journal of SADIO; vol. 17, no. 1; https://sedici.unlp.edu.ar/handle/10915/66451
This work presents a novel approach for solving the short-therm scheduling of hydro-thermal power generation, including pumped storage systemsand transmission constraints. The problem addressed is known as Security Constrained Unit Commitment (SCUC). Pumped Storage Units (PSUs) are importantin electric systems during the off-peak and the peak demand periods, providing economic and technical benefits. Linear aproximations are applied to nonlinear equations of this kind of mathematical problems which are: fuel cost functions, generation-discharge curves of PSUs and transmission constraints modeled with Alternating Current power flow model. Thus, MILP models are presented for the problem addessed. To prove the efficiency of the proposed models, two systems with PSUs will be tested: a modified 6-bus and the IEEE 31-bus power system. Results show that the proposed MILP models allow: modeling the SCUC problem more realistically, obtaining feasible solutions within efficient computational times, and reaching production cost savings up to almost 20% compared to power systems that lack capacities to pumping water. Several indicators obtained from results are presented through graphs, as a tool for improving operation and maintenance of power systems. The analysis of these indicators and the graphic interpretation allow to identify and classify critical parts of systems as well as to make recommendations about future system improvements.
</description>
<pubDate>Wed, 04 Apr 2018 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/135214</guid>
<dc:date>2018-04-04T00:00:00Z</dc:date>
<dc:description>This work presents a novel approach for solving the short-therm scheduling of hydro-thermal power generation, including pumped storage systemsand transmission constraints. The problem addressed is known as Security Constrained Unit Commitment (SCUC). Pumped Storage Units (PSUs) are importantin electric systems during the off-peak and the peak demand periods, providing economic and technical benefits. Linear aproximations are applied to nonlinear equations of this kind of mathematical problems which are: fuel cost functions, generation-discharge curves of PSUs and transmission constraints modeled with Alternating Current power flow model. Thus, MILP models are presented for the problem addessed. To prove the efficiency of the proposed models, two systems with PSUs will be tested: a modified 6-bus and the IEEE 31-bus power system. Results show that the proposed MILP models allow: modeling the SCUC problem more realistically, obtaining feasible solutions within efficient computational times, and reaching production cost savings up to almost 20% compared to power systems that lack capacities to pumping water. Several indicators obtained from results are presented through graphs, as a tool for improving operation and maintenance of power systems. The analysis of these indicators and the graphic interpretation allow to identify and classify critical parts of systems as well as to make recommendations about future system improvements.</dc:description>
</item>
<item>
<title>Static Taint Analysis Applied to Detecting Bad Programming Practices in Android</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/135208</link>
<description>Articulo
Simposio Argentino de Ingeniería de Software (ASSE) - JAIIO 46 (Córdoba, 2017); Electronic Journal of SADIO; vol. 17, no. 1; https://sedici.unlp.edu.ar/handle/10915/66161
Frameworks and Application Programming Interfaces (API) usually come along with a set of guidelines that establish good programming practices in order to avoid pitfalls which could lead, at least, to bad user experiences, but also to program crashes. Most often than not, such guidelines are not at all enforced by IDEs. This work investigates whether static taint analysis could be effectively used for automatically detecting bad programming patterns in Android applications. It presents the implemented tool, called CheckDroid, together with the preliminary experimental evaluation carried out.
</description>
<pubDate>Wed, 04 Apr 2018 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/135208</guid>
<dc:date>2018-04-04T00:00:00Z</dc:date>
<dc:description>Frameworks and Application Programming Interfaces (API) usually come along with a set of guidelines that establish good programming practices in order to avoid pitfalls which could lead, at least, to bad user experiences, but also to program crashes. Most often than not, such guidelines are not at all enforced by IDEs. This work investigates whether static taint analysis could be effectively used for automatically detecting bad programming patterns in Android applications. It presents the implemented tool, called CheckDroid, together with the preliminary experimental evaluation carried out.</dc:description>
</item>
<item>
<title>Planning the Workday of Bus Drivers by a Graph List-Coloring Model</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/135196</link>
<description>Articulo
Electronic Journal of SADIO; vol. 17, no. 1
In this work, we address the problem of planning the workday of bus drivers in argentinian intercity bus transport companies. In particular, we focus on a company which needs to fulfill roughly 800 trips per day between 3 cities of the Province of Buenos Aires with a stuff of around 200 drivers and 100 buses. Planning consists of assigning one driver to each trip in a way the driver performs all the trips without scheduling conflicts and minimizing the overall amount of overtime among all bus drivers. We model the problem as a particular Graph Coloring Problem and we propose an Integer Linear Programming formulation. Computations experiments show that this formulation outperforms other ones given in the literature for the same problem. In order to address large instances as the one given by the company, we also propose a heuristic algorithm that delivers better solutions than the company actually uses in a reasonably amount of time. The heuristic has two phases where the first one constructs an initial solution and the second one improves the solution iteratively.
</description>
<pubDate>Wed, 04 Apr 2018 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/135196</guid>
<dc:date>2018-04-04T00:00:00Z</dc:date>
<dc:description>In this work, we address the problem of planning the workday of bus drivers in argentinian intercity bus transport companies. In particular, we focus on a company which needs to fulfill roughly 800 trips per day between 3 cities of the Province of Buenos Aires with a stuff of around 200 drivers and 100 buses. Planning consists of assigning one driver to each trip in a way the driver performs all the trips without scheduling conflicts and minimizing the overall amount of overtime among all bus drivers. We model the problem as a particular Graph Coloring Problem and we propose an Integer Linear Programming formulation. Computations experiments show that this formulation outperforms other ones given in the literature for the same problem. In order to address large instances as the one given by the company, we also propose a heuristic algorithm that delivers better solutions than the company actually uses in a reasonably amount of time. The heuristic has two phases where the first one constructs an initial solution and the second one improves the solution iteratively.</dc:description>
</item>
<item>
<title>Applying Meta-Functions for Improving JavaScript Code Performance</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/135194</link>
<description>Articulo
Simposio Argentino de Ingeniería de Software (ASSE) - JAIIO 46 (Córdoba, 2017); Electronic Journal of SADIO; vol. 17, no. 1; https://sedici.unlp.edu.ar/handle/10915/66097
In recent years, the expansion of the World Wide Web, and web runtimes in particular, to all kind of devices has rendered the Java- Script performance in a hot topic. Several approaches to improve the performance of JavaScript applications have been tried by the industrial and research communities. In this paper we review the most popular approaches and propose a novel solution based on meta-programming and source code rewriting. The preliminary results of our experiments are very promising, although more studies are required to know to what extent this approach can improve the performance of real-life JavaScriptprograms.
</description>
<pubDate>Wed, 04 Apr 2018 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/135194</guid>
<dc:date>2018-04-04T00:00:00Z</dc:date>
<dc:description>In recent years, the expansion of the World Wide Web, and web runtimes in particular, to all kind of devices has rendered the Java- Script performance in a hot topic. Several approaches to improve the performance of JavaScript applications have been tried by the industrial and research communities. In this paper we review the most popular approaches and propose a novel solution based on meta-programming and source code rewriting. The preliminary results of our experiments are very promising, although more studies are required to know to what extent this approach can improve the performance of real-life JavaScriptprograms.</dc:description>
</item>
<item>
<title>A Strategy for Container Lifecycle Management</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/135187</link>
<description>Articulo
Simposio Argentino de Ingeniería de Software (ASSE) - JAIIO 46 (Córdoba, 2017); Electronic Journal of SADIO; vol. 17, no. 1; https://sedici.unlp.edu.ar/handle/10915/66158
Virtualization has been around much of the history of computing from the introduction of virtual memory to virtualization at the operating system level and containers. The use of containers as a deployment tool has boomed since the release of Docker as free software in 2013. Docker includes a large set of tools ranging from building and executing containers on a single node to managing multiple containers in clusters. However, the distribution of deployment descriptors and of maintenance scripts is not properly addressed. This work introduces the mechanisms provided by Docker and describes a practice developed by the Bitlogic team for the deployment and management of the container lifecycle.
</description>
<pubDate>Wed, 04 Apr 2018 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/135187</guid>
<dc:date>2018-04-04T00:00:00Z</dc:date>
<dc:description>Virtualization has been around much of the history of computing from the introduction of virtual memory to virtualization at the operating system level and containers. The use of containers as a deployment tool has boomed since the release of Docker as free software in 2013. Docker includes a large set of tools ranging from building and executing containers on a single node to managing multiple containers in clusters. However, the distribution of deployment descriptors and of maintenance scripts is not properly addressed. This work introduces the mechanisms provided by Docker and describes a practice developed by the Bitlogic team for the deployment and management of the container lifecycle.</dc:description>
</item>
</channel>
</rss>
