<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>Volumen 14 | Número 01</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/34526" rel="alternate"/>
<subtitle/>
<id>http://sedici.unlp.edu.ar:80/handle/10915/34526</id>
<updated>2026-11-19T03:07:16Z</updated>
<dc:date>2026-11-19T03:07:16Z</dc:date>
<entry>
<title>Kevin R. Fall, W. Richard Stevens. &lt;i&gt;TCP/IP I llustrated, Volume 1: The Protocols, 2nd edition&lt;/i&gt;: ISBN 0-321-33631-3 Pearson Education, Inc. 2012</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/34554" rel="alternate"/>
<author>
<name>Marrone, Luis Armando</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/34554</id>
<updated>2019-06-23T20:02:43Z</updated>
<published>2014-04-01T00:00:00Z</published>
<summary type="text">Revision
Journal of Computer Science &amp; Technology; vol. 14, no. 1
&lt;i&gt;TCP/IP Illustrated Vol. 1, first edition&lt;/i&gt; has been for decades, "the book" for the IP platform. It is undeniably the wide contribution to the academic, research and professional environments. This second edition is not a mere update of the first one. The book presents remarkable novelties in the scope and development of the subjects it covers which deserve a detailed explanation.
</summary>
<dc:date>2014-04-01T00:00:00Z</dc:date>
<dc:description>&lt;i&gt;TCP/IP Illustrated Vol. 1, first edition&lt;/i&gt; has been for decades, "the book" for the IP platform. It is undeniably the wide contribution to the academic, research and professional environments. This second edition is not a mere update of the first one. The book presents remarkable novelties in the scope and development of the subjects it covers which deserve a detailed explanation.</dc:description>
</entry>
<entry>
<title>Performance of long term evolution for wireless networks: Thesis overview</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/34551" rel="alternate"/>
<author>
<name>Ahmad, Tauseef</name>
</author>
<author>
<name>Abbas, Ash Mohammad</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/34551</id>
<updated>2019-06-23T20:02:48Z</updated>
<published>2014-04-01T00:00:00Z</published>
<summary type="text">Revision
Journal of Computer Science &amp; Technology; vol. 14, no. 1
Long Term Evolution (LTE) is a standard for high speed communication in wireless networks. It is developed by 3rd Generation Partnership Project (3GPP). One of the goals of LTE was to increase the capacity of wireless networks so that communication can be performed at high speeds. The second goal was to redesign and simplify the ar.chitecture of the network so as to conform to an Internet Protocol (IP) based system so that there is significant reduction in the communication delays.
</summary>
<dc:date>2014-04-01T00:00:00Z</dc:date>
<dc:description>Long Term Evolution (LTE) is a standard for high speed communication in wireless networks. It is developed by 3rd Generation Partnership Project (3GPP). One of the goals of LTE was to increase the capacity of wireless networks so that communication can be performed at high speeds. The second goal was to redesign and simplify the ar.chitecture of the network so as to conform to an Internet Protocol (IP) based system so that there is significant reduction in the communication delays.</dc:description>
</entry>
<entry>
<title>Model design for a reduced variant of a Trivium Type Stream Cipher</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/34550" rel="alternate"/>
<author>
<name>Castro Lechtaler, Antonio</name>
</author>
<author>
<name>Cipriano, Marcelo</name>
</author>
<author>
<name>García, Edith</name>
</author>
<author>
<name>Liporace, Julio</name>
</author>
<author>
<name>Maiorano, Ariel</name>
</author>
<author>
<name>Malvacio, Eduardo</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/34550</id>
<updated>2019-06-23T04:04:16Z</updated>
<published>2014-04-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 14, no. 1
We analyze the family of stream ciphers N-viums: Trivium and Bivium. We present the Trivium algorithm and its variants. In particular, we study the NLFSRs used in these generators, their feedback functions and their combination. Two reduced variants of these models are presented, labeled Toys. Finally, we delve into the open problems ingrained in these cryptosystems.
</summary>
<dc:date>2014-04-01T00:00:00Z</dc:date>
<dc:description>We analyze the family of stream ciphers N-viums: Trivium and Bivium. We present the Trivium algorithm and its variants. In particular, we study the NLFSRs used in these generators, their feedback functions and their combination. Two reduced variants of these models are presented, labeled Toys. Finally, we delve into the open problems ingrained in these cryptosystems.</dc:description>
</entry>
<entry>
<title>A framework for multi-criteria argumentation-based decision making within a BDI agent</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/34549" rel="alternate"/>
<author>
<name>Errecalde, Marcelo Luis</name>
</author>
<author>
<name>Sosa Toranzo, Cecilia</name>
</author>
<author>
<name>Ferretti, Edgardo</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/34549</id>
<updated>2019-06-23T20:02:52Z</updated>
<published>2014-04-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 14, no. 1
The BDI model, as a practical reasoning architecture aims at making decisions about what to do based on cognitives notions as beliefs, desires and intentions.&#13;
However, during the decision making process, BDI agents also have to make background decisions like choosing what intention to achieve next from a set of possibly conflicting desires; which plan to execute from among the plans that satisfy a given intention; and whether is necessary or not to reconsider current intentions. With this aim, in this work, we present an abstract framework which integrates a Possibilistic Defeasible Logic Programming approach to decision making in the inner decision processes within BDI agents.
</summary>
<dc:date>2014-04-01T00:00:00Z</dc:date>
<dc:description>The BDI model, as a practical reasoning architecture aims at making decisions about what to do based on cognitives notions as beliefs, desires and intentions.&#13;
However, during the decision making process, BDI agents also have to make background decisions like choosing what intention to achieve next from a set of possibly conflicting desires; which plan to execute from among the plans that satisfy a given intention; and whether is necessary or not to reconsider current intentions. With this aim, in this work, we present an abstract framework which integrates a Possibilistic Defeasible Logic Programming approach to decision making in the inner decision processes within BDI agents.</dc:description>
</entry>
<entry>
<title>An efficient alternative for deletions in dynamic spatial approximation trees</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/34547" rel="alternate"/>
<author>
<name>Kasián, Fernando</name>
</author>
<author>
<name>Ludueña, Verónica</name>
</author>
<author>
<name>Reyes, Nora Susana</name>
</author>
<author>
<name>Roggero, Patricia</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/34547</id>
<updated>2019-06-23T20:02:39Z</updated>
<published>2014-04-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 14, no. 1
Metric space searching is an emerging technique to address the problem of similarity searching in many applications. In order to efficiently answer similarity queries, the database must be indexed. In some interesting real applications dynamism is an indispensable property of the index.&#13;
There are very few actually dynamic indexes that support not only searches, but also insertions and deletions of elements. The dynamic spatial approximation tree (DSAT) is a data structure specially designed for searching in metric spaces, which compares favorably against other data structures in high dimensional spaces or queries with low selectivity.&#13;
Insertions are efficient and easily supported in DSAT, but deletions degrade the structure over time.&#13;
Several methods are proposed to handle deletions over the DSAT. One of them has shown to be superior to the others, in the sense that it permits controlling the expected deletion cost as a proportion of the insertion cost and searches does not overly degrade after several deletions.&#13;
In this paper we propose and study a new alternative deletion method, based on the better existing strategy. The outcome is a fully dynamic data structure that can be managed through insertions and deletions over arbitrarily long periods of time without any significant reorganization.
</summary>
<dc:date>2014-04-01T00:00:00Z</dc:date>
<dc:description>Metric space searching is an emerging technique to address the problem of similarity searching in many applications. In order to efficiently answer similarity queries, the database must be indexed. In some interesting real applications dynamism is an indispensable property of the index.&#13;
There are very few actually dynamic indexes that support not only searches, but also insertions and deletions of elements. The dynamic spatial approximation tree (DSAT) is a data structure specially designed for searching in metric spaces, which compares favorably against other data structures in high dimensional spaces or queries with low selectivity.&#13;
Insertions are efficient and easily supported in DSAT, but deletions degrade the structure over time.&#13;
Several methods are proposed to handle deletions over the DSAT. One of them has shown to be superior to the others, in the sense that it permits controlling the expected deletion cost as a proportion of the insertion cost and searches does not overly degrade after several deletions.&#13;
In this paper we propose and study a new alternative deletion method, based on the better existing strategy. The outcome is a fully dynamic data structure that can be managed through insertions and deletions over arbitrarily long periods of time without any significant reorganization.</dc:description>
</entry>
<entry>
<title>A tool for detecting transient faults in execution of parallel scientific applications on multicore clusters</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/34544" rel="alternate"/>
<author>
<name>Montezanti, Diego Miguel</name>
</author>
<author>
<name>Rucci, Enzo</name>
</author>
<author>
<name>Rexachs del Rosario, Dolores</name>
</author>
<author>
<name>Luque Fadón, Emilio</name>
</author>
<author>
<name>Naiouf, Marcelo</name>
</author>
<author>
<name>De Giusti, Armando Eduardo</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/34544</id>
<updated>2019-06-23T20:02:54Z</updated>
<published>2014-04-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 14, no. 1
Transient faults are becoming a critical concern among current trends of design of generalpurpose multiprocessors. Because of their capability to corrupt programs outputs, their impact gains importance when considering long duration, parallel scientific applications, due to the high cost of re-launching execution from the beginning in case of incorrect results. This paper introduces SMCV tool which improves reliability for high-performance systems. SMCV replicates application processes and validates the contents of the messages to be sent, preventing the propagation of errors to other processes and restricting detection latency and notification. To assess its utility, the overhead of SMCV tool is evaluated with three computationallyintensive, representative parallel scientific applications. The obtained results demonstrate the efficiency of SMCV tool to detect transient faults occurrences.
</summary>
<dc:date>2014-04-01T00:00:00Z</dc:date>
<dc:description>Transient faults are becoming a critical concern among current trends of design of generalpurpose multiprocessors. Because of their capability to corrupt programs outputs, their impact gains importance when considering long duration, parallel scientific applications, due to the high cost of re-launching execution from the beginning in case of incorrect results. This paper introduces SMCV tool which improves reliability for high-performance systems. SMCV replicates application processes and validates the contents of the messages to be sent, preventing the propagation of errors to other processes and restricting detection latency and notification. To assess its utility, the overhead of SMCV tool is evaluated with three computationallyintensive, representative parallel scientific applications. The obtained results demonstrate the efficiency of SMCV tool to detect transient faults occurrences.</dc:description>
</entry>
<entry>
<title>Towards the use of video games for learning: a survey about video games preferences of Engineering</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/34540" rel="alternate"/>
<author>
<name>Bouciguez, María José</name>
</author>
<author>
<name>Santos, Graciela</name>
</author>
<author>
<name>Abásolo Guerrero, María José</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/34540</id>
<updated>2019-06-23T20:02:50Z</updated>
<published>2014-04-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 14, no. 1
Video games are now a widespread cultural practice, especially among young people, making them an ideal medium for the design of learning processes. In order to design educational technologies that provide teaching support we must first understand the practices developed by the young with computers and especially with video games. The aim of the present study is therefore to learn about the experience and expectations about video games among students, particularly engineering students. The results are going to be considered in the design of educational technologies based on interactive virtual environments that mediate the learning processes, particularly in physics course of engineering studies.
</summary>
<dc:date>2014-04-01T00:00:00Z</dc:date>
<dc:description>Video games are now a widespread cultural practice, especially among young people, making them an ideal medium for the design of learning processes. In order to design educational technologies that provide teaching support we must first understand the practices developed by the young with computers and especially with video games. The aim of the present study is therefore to learn about the experience and expectations about video games among students, particularly engineering students. The results are going to be considered in the design of educational technologies based on interactive virtual environments that mediate the learning processes, particularly in physics course of engineering studies.</dc:description>
</entry>
<entry>
<title>Multi-Criteria Decision Model based on AHP and Linguistic Information</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/34539" rel="alternate"/>
<author>
<name>Karanik, Marcelo J.</name>
</author>
<author>
<name>Gramajo, Sergio D.</name>
</author>
<author>
<name>Wanderer, Leonardo S.</name>
</author>
<author>
<name>Gimenez, Manuel</name>
</author>
<author>
<name>Carpintero, Diana</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/34539</id>
<updated>2019-06-23T04:04:20Z</updated>
<published>2014-04-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 14, no. 1
Multi-Criteria Decision Analysis (MCDA) is a usual activity among organisations and decisions related to people’s activities. Due to the complexity of considering multiple criteria, to select an alternative is a non-trivial task. From operative levels to managerial ones, MCDA is implemented by using several (formal and informal) techniques. Two useful techniques that help to make a decision are the Analytic Hierarchy Process (AHP) and MCDA models based on Linguistic Information (LI). This work describes a MCDA framework that combines the mentioned techniques in order to provide more confidence in the decision making process. To test the proposed model, framework was used to select the adequate network configuration to improve quality of service (QoS). Finally, the framework’s outputs were compared to real experts’ opinions obtaining satisfactory results. Keywords: IPv6 deployment, IPv6 transition solutions, performance analysis, DNS64, TOTD, security, cache poisoning attack, random permutation.
</summary>
<dc:date>2014-04-01T00:00:00Z</dc:date>
<dc:description>Multi-Criteria Decision Analysis (MCDA) is a usual activity among organisations and decisions related to people’s activities. Due to the complexity of considering multiple criteria, to select an alternative is a non-trivial task. From operative levels to managerial ones, MCDA is implemented by using several (formal and informal) techniques. Two useful techniques that help to make a decision are the Analytic Hierarchy Process (AHP) and MCDA models based on Linguistic Information (LI). This work describes a MCDA framework that combines the mentioned techniques in order to provide more confidence in the decision making process. To test the proposed model, framework was used to select the adequate network configuration to improve quality of service (QoS). Finally, the framework’s outputs were compared to real experts’ opinions obtaining satisfactory results. Keywords: IPv6 deployment, IPv6 transition solutions, performance analysis, DNS64, TOTD, security, cache poisoning attack, random permutation.</dc:description>
</entry>
<entry>
<title>Improving the performance and security of the TOTD DNS64 implementation</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/34537" rel="alternate"/>
<author>
<name>Lencse, Gábor</name>
</author>
<author>
<name>Répás, Sándor</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/34537</id>
<updated>2019-06-23T04:04:15Z</updated>
<published>2014-04-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 14, no. 1
DNS64 and NAT64 IPv6 transition mechanisms are expected to play an important role in the near future to solve the problem that some of the new clients will not be able to get public IPv4 addresses and thus having only IPv6 addresses they still should be able to reach servers that have only IPv4 addresses. In our earlier experiments, the TOTD DNS64 implementation showed significantly better average performance than BIND, however TOTD was not stable, therefore now it was carefully tested to find the reason for its experienced strange behavior. Besides the detailed description of the testing method, the bug and the correction, a security vulnerability is disclosed and a patch is provided. The performance and the stability of the modified versions of TOTD are analyzed and compared to that of the original TOTD and BIND.
</summary>
<dc:date>2014-04-01T00:00:00Z</dc:date>
<dc:description>DNS64 and NAT64 IPv6 transition mechanisms are expected to play an important role in the near future to solve the problem that some of the new clients will not be able to get public IPv4 addresses and thus having only IPv6 addresses they still should be able to reach servers that have only IPv4 addresses. In our earlier experiments, the TOTD DNS64 implementation showed significantly better average performance than BIND, however TOTD was not stable, therefore now it was carefully tested to find the reason for its experienced strange behavior. Besides the detailed description of the testing method, the bug and the correction, a security vulnerability is disclosed and a patch is provided. The performance and the stability of the modified versions of TOTD are analyzed and compared to that of the original TOTD and BIND.</dc:description>
</entry>
<entry>
<title>A model-driving approach to constructing robotic systems</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/34532" rel="alternate"/>
<author>
<name>Pons, Claudia</name>
</author>
<author>
<name>Pérez, Claudia</name>
</author>
<author>
<name>Giandini, Roxana Silvia</name>
</author>
<author>
<name>Baum, Gabriel Alfredo</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/34532</id>
<updated>2019-06-23T20:02:45Z</updated>
<published>2014-04-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 14, no. 1
Most robotic systems tend to be complex to maintain and reuse because existing frameworks are based mainly on code-driven approaches. This means the software development process is reduced to the implementation of systems using specific programming languages. During the constant evolution, the systems grow in size and in complexity. Even when these approaches address the needs of robotic focused markets, currently used methodologies and toolsets fail to cope with the needs of such complex software development process. The general objective of our work is the definition of a methodological framework supported by a set of tools to deal with the requirements of the robotic software development process. A major challenge is to make the step from code-driven to model-driven in the development of robotic software systems. Separating robotics knowledge from short-cycled implementation technologies is essential to foster reuse and maintenance.
</summary>
<dc:date>2014-04-01T00:00:00Z</dc:date>
<dc:description>Most robotic systems tend to be complex to maintain and reuse because existing frameworks are based mainly on code-driven approaches. This means the software development process is reduced to the implementation of systems using specific programming languages. During the constant evolution, the systems grow in size and in complexity. Even when these approaches address the needs of robotic focused markets, currently used methodologies and toolsets fail to cope with the needs of such complex software development process. The general objective of our work is the definition of a methodological framework supported by a set of tools to deal with the requirements of the robotic software development process. A major challenge is to make the step from code-driven to model-driven in the development of robotic software systems. Separating robotics knowledge from short-cycled implementation technologies is essential to foster reuse and maintenance.</dc:description>
</entry>
</feed>
