<?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 11 | Número 01</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/399" rel="alternate"/>
<subtitle/>
<id>http://sedici.unlp.edu.ar:80/handle/10915/399</id>
<updated>2026-11-18T19:37:43Z</updated>
<dc:date>2026-11-18T19:37:43Z</dc:date>
<entry>
<title>Diseño y evaluación de arquitecturas de computadoras: Marta Bertrán Pardo y Antonio Guzmán Sacristán, Pearson Educación, Madrid, 2010</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9695" rel="alternate"/>
<author>
<name>Villagarcía Wanza, Horacio A.</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9695</id>
<updated>2019-06-22T20:03:23Z</updated>
<published>2011-04-01T00:00:00Z</published>
<summary type="text">Revision
Journal of Computer Science &amp; Technology; vol. 11, no. 1
In the first paragraph of the Introduction of the book the authors say "The definition of computer architecture has generated many discussions since the emergence of what could be considered the first computer in 1943, the ENIAC". Later they add "The main idea of all the proposals made in this direction is the same: define of computer components in different levels of study to produce a hierarchical description and to facilitate their understanding and design”. The authors' goal is to provide a textbook (written in Spanish) that systematically collect the most important techniques of design and evaluation of computer architectures.
</summary>
<dc:date>2011-04-01T00:00:00Z</dc:date>
<dc:description>In the first paragraph of the Introduction of the book the authors say "The definition of computer architecture has generated many discussions since the emergence of what could be considered the first computer in 1943, the ENIAC". Later they add "The main idea of all the proposals made in this direction is the same: define of computer components in different levels of study to produce a hierarchical description and to facilitate their understanding and design”. The authors' goal is to provide a textbook (written in Spanish) that systematically collect the most important techniques of design and evaluation of computer architectures.</dc:description>
</entry>
<entry>
<title>Protocols for Microcontrollers Networks</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9694" rel="alternate"/>
<author>
<name>López, Ricardo A.</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9694</id>
<updated>2019-06-22T20:03:22Z</updated>
<published>2011-04-01T00:00:00Z</published>
<summary type="text">Revision
Journal of Computer Science &amp; Technology; vol. 11, no. 1
The microcontrollers are embedded in our way of life and are found in many devices. The ability of Very High Scale Integration (VLSI) - with almost exponential growth in recent years makes these devices every day contain functions previously unthinkable.&#13;
Therefore, a grouping of these networked devices creates a very powerful system, which equipped with a standard protocol that allows interconnection to the Internet gives you a virtually unlimited range of scalability. For these reasons, this thesis studied the implementation of a network of microcontrollers, defining functions equivalent to those with Supervisory Control and Data Acquisition (SCADA) of great scale. Based on the definition we have, we studied among others, the protocols of communications layers to reach two of the most popular implementations used in industrial environments: Rs485 and Ethernet. While the former is much older, it remains still active and has been promoted from creating compatible interfaces, due to Rs485’s high immunity to electrical noise that provides a transparent interface over fiber. The second, more modern, already have set a trend because of its ubiquity and extent of benefits.
Es revisión de: http://sedici.unlp.edu.ar/handle/10915/4177; Resumen de la tesis del autor para acceder al título de Magister en Redes de Datos (UNLP, 2010)
</summary>
<dc:date>2011-04-01T00:00:00Z</dc:date>
<dc:description>The microcontrollers are embedded in our way of life and are found in many devices. The ability of Very High Scale Integration (VLSI) - with almost exponential growth in recent years makes these devices every day contain functions previously unthinkable.&#13;
Therefore, a grouping of these networked devices creates a very powerful system, which equipped with a standard protocol that allows interconnection to the Internet gives you a virtually unlimited range of scalability. For these reasons, this thesis studied the implementation of a network of microcontrollers, defining functions equivalent to those with Supervisory Control and Data Acquisition (SCADA) of great scale. Based on the definition we have, we studied among others, the protocols of communications layers to reach two of the most popular implementations used in industrial environments: Rs485 and Ethernet. While the former is much older, it remains still active and has been promoted from creating compatible interfaces, due to Rs485’s high immunity to electrical noise that provides a transparent interface over fiber. The second, more modern, already have set a trend because of its ubiquity and extent of benefits.</dc:description>
</entry>
<entry>
<title>E-Mail Processing with Fuzzy SOMs and Association Rules</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9693" rel="alternate"/>
<author>
<name>Lanzarini, Laura Cristina</name>
</author>
<author>
<name>Villa Monte, Augusto</name>
</author>
<author>
<name>Estrebou, César Armando</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9693</id>
<updated>2019-06-22T20:03:18Z</updated>
<published>2011-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 11, no. 1
E-mail texts are hard to process due to their short length. In this article, the use of a diffuse neural network that is capable of identifying the most relevant terms in a set of e-mails is proposed. The associations between these terms will be measured through association rules built with the terms identified by the network. The metrics support, confidence and interest of the rules will be used to qualify the corresponding terms. The method proposed has been used to process e-mails of the PACENI Project (Support Project for Improving First-Year Teaching in Courses of Studies in Exact and Natural Sciences, Economic Science and Computer Science). With this type of analysis, the most common topics of student questions have been identified. Even though this new information can have various applications, they all involve, as a first instance, an improvement in student service.
</summary>
<dc:date>2011-01-01T00:00:00Z</dc:date>
<dc:description>E-mail texts are hard to process due to their short length. In this article, the use of a diffuse neural network that is capable of identifying the most relevant terms in a set of e-mails is proposed. The associations between these terms will be measured through association rules built with the terms identified by the network. The metrics support, confidence and interest of the rules will be used to qualify the corresponding terms. The method proposed has been used to process e-mails of the PACENI Project (Support Project for Improving First-Year Teaching in Courses of Studies in Exact and Natural Sciences, Economic Science and Computer Science). With this type of analysis, the most common topics of student questions have been identified. Even though this new information can have various applications, they all involve, as a first instance, an improvement in student service.</dc:description>
</entry>
<entry>
<title>Reversible Data Hiding Exploiting Variance in Wavelet Coefficients</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9692" rel="alternate"/>
<author>
<name>Luo, Xu-Ren</name>
</author>
<author>
<name>Yin, Te-Lung</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9692</id>
<updated>2019-06-22T20:03:18Z</updated>
<published>2011-04-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 11, no. 1
In this paper, we present a new reversible data hiding scheme that utilizes the wavelet transform and better exploits the large wavelet coefficient variance to achieve high capacity and imperceptible embedding. Our scheme differs from those of previous studies in that the wavelet coefficients histogram rather than the gray-level histogram is manipulated. In addition, we design intelligent histogram-shifting rules to avoid the decimal problem in grayscale pixel values after recovery process to achieve reversibility. Small changes in the wavelet coefficients after embedding process are important factors contributing to low visual distortion in the marked image. Furthermore, an important property of our scheme is that the use of threshold differs greatly from previous schemes. The experimental results show that our scheme outperforms other reversible data hiding schemes.
</summary>
<dc:date>2011-04-01T00:00:00Z</dc:date>
<dc:description>In this paper, we present a new reversible data hiding scheme that utilizes the wavelet transform and better exploits the large wavelet coefficient variance to achieve high capacity and imperceptible embedding. Our scheme differs from those of previous studies in that the wavelet coefficients histogram rather than the gray-level histogram is manipulated. In addition, we design intelligent histogram-shifting rules to avoid the decimal problem in grayscale pixel values after recovery process to achieve reversibility. Small changes in the wavelet coefficients after embedding process are important factors contributing to low visual distortion in the marked image. Furthermore, an important property of our scheme is that the use of threshold differs greatly from previous schemes. The experimental results show that our scheme outperforms other reversible data hiding schemes.</dc:description>
</entry>
<entry>
<title>Group Mutual Exclusion Based on Priorities</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9691" rel="alternate"/>
<author>
<name>Cenci, Karina M.</name>
</author>
<author>
<name>Ardenghi, Jorge Raúl</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9691</id>
<updated>2019-06-22T20:03:16Z</updated>
<published>2011-04-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 11, no. 1
We propose a distributed solution for the group mutual exclusion problem based on priorities, in a network with no share memory whose members only communicate by messages. The proposed algorithm is composed by two players: groups and processes, groups are passive players while processes are active players. For the coordination access to the resource, each group has assigned a quorum. The groups have associated a base priority in each stage, meanwhile the processes have the same level priority. An important feature is that processes have associated a time to participate in the group in each stage. The message complexity obtain, in the best case, where the group does not yield the permission, is 3l + 3(q - 1) messages, where l denotes the processes linked and q denotes the quorum size. The maximum concurrency of the algorithm is n, which implies that all processes have linked to the same group.
</summary>
<dc:date>2011-04-01T00:00:00Z</dc:date>
<dc:description>We propose a distributed solution for the group mutual exclusion problem based on priorities, in a network with no share memory whose members only communicate by messages. The proposed algorithm is composed by two players: groups and processes, groups are passive players while processes are active players. For the coordination access to the resource, each group has assigned a quorum. The groups have associated a base priority in each stage, meanwhile the processes have the same level priority. An important feature is that processes have associated a time to participate in the group in each stage. The message complexity obtain, in the best case, where the group does not yield the permission, is 3l + 3(q - 1) messages, where l denotes the processes linked and q denotes the quorum size. The maximum concurrency of the algorithm is n, which implies that all processes have linked to the same group.</dc:description>
</entry>
<entry>
<title>Hardware radial basis function neural network automatic generation</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9690" rel="alternate"/>
<author>
<name>Leiva, Lucas</name>
</author>
<author>
<name>Acosta, Nelson</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9690</id>
<updated>2019-06-22T20:03:14Z</updated>
<published>2011-04-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 11, no. 1
This paper presents a parallel architecture for a radial basis function (RBF) neural network used for pattern recognition. This architecture allows defining sub-networks which can be activated sequentially. It can be used as a fruitful classification mechanism in many application fields. Several implementations of the network on a Xilinx FPGA Virtex 4-(xc4vsx25) are presented, with speed and area evaluation metrics. Some network improvements have been achieved by segmenting the critical path. The results expressed in terms of speed and area are satisfactory and have been applied to pattern recognition problems.
</summary>
<dc:date>2011-04-01T00:00:00Z</dc:date>
<dc:description>This paper presents a parallel architecture for a radial basis function (RBF) neural network used for pattern recognition. This architecture allows defining sub-networks which can be activated sequentially. It can be used as a fruitful classification mechanism in many application fields. Several implementations of the network on a Xilinx FPGA Virtex 4-(xc4vsx25) are presented, with speed and area evaluation metrics. Some network improvements have been achieved by segmenting the critical path. The results expressed in terms of speed and area are satisfactory and have been applied to pattern recognition problems.</dc:description>
</entry>
<entry>
<title>Position index preserving compression of text data</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9689" rel="alternate"/>
<author>
<name>Akhtar, Nasim</name>
</author>
<author>
<name>Rashid, Mamunur</name>
</author>
<author>
<name>Islam, Shafiqul</name>
</author>
<author>
<name>Kashem, Mohammod Abul</name>
</author>
<author>
<name>Kolybanov, Cyrll Y.</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9689</id>
<updated>2019-06-22T20:03:13Z</updated>
<published>2011-04-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 11, no. 1
Data compression offers an attractive approach to reducing communication cost by using available bandwidth effectively. It also secures data during transmission for its encoded form. In this paper an index based position oriented lossless text compression called PIPC ( Position Index Preserving Compression) is developed. In PIPC the position of the input word is denoted by ASCII code. The basic philosopy of the secure compression is to preprocess the text and transform it into some intermediate file which can be compressed with better efficiency and which exploits the natural redundancy of the languaje in making the transformation. The proposed algorithm compresses the data 35 % to 50 % of its original size depending on occurrence of repeat word
</summary>
<dc:date>2011-04-01T00:00:00Z</dc:date>
<dc:description>Data compression offers an attractive approach to reducing communication cost by using available bandwidth effectively. It also secures data during transmission for its encoded form. In this paper an index based position oriented lossless text compression called PIPC ( Position Index Preserving Compression) is developed. In PIPC the position of the input word is denoted by ASCII code. The basic philosopy of the secure compression is to preprocess the text and transform it into some intermediate file which can be compressed with better efficiency and which exploits the natural redundancy of the languaje in making the transformation. The proposed algorithm compresses the data 35 % to 50 % of its original size depending on occurrence of repeat word</dc:description>
</entry>
<entry>
<title>The seven ages of Fortran</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9688" rel="alternate"/>
<author>
<name>Metcalf, Michael</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9688</id>
<updated>2019-06-22T20:03:12Z</updated>
<published>2011-04-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 11, no. 1
When IBM's John Backus first developed the Fortran programming language, back in 1957, he certainly never dreamt that it would become a world-wide success and still be going strong many years later. Given the oft-repeated predictions of its imminent demise, starting around 1968, it is a surprise, even to some of its most devoted users, that this much-maligned language is not only still with us, but is being further developed for the demanding applications of the future. What has made this programming language succeed where most slip into oblivion? One reason is certainly that the language has been regularly standardized. In this paper we will trace the evolution of the language from its first version and though six cycles of formal revision, and speculate on how this might continue. Now, modern Fortran is a procedural, imperative, compiled language with a syntax well suited to a direct representation of mathematical formulas. Individual procedures may be compiled separately or grouped into modules, either way allowing the convenient construction of very large programs and procedure libraries. Procedures communicate via global data areas or by argument association. The language now contains features for array processing, abstract data types, dynamic data structures, objectoriented programming and parallel processing.
</summary>
<dc:date>2011-04-01T00:00:00Z</dc:date>
<dc:description>When IBM's John Backus first developed the Fortran programming language, back in 1957, he certainly never dreamt that it would become a world-wide success and still be going strong many years later. Given the oft-repeated predictions of its imminent demise, starting around 1968, it is a surprise, even to some of its most devoted users, that this much-maligned language is not only still with us, but is being further developed for the demanding applications of the future. What has made this programming language succeed where most slip into oblivion? One reason is certainly that the language has been regularly standardized. In this paper we will trace the evolution of the language from its first version and though six cycles of formal revision, and speculate on how this might continue. Now, modern Fortran is a procedural, imperative, compiled language with a syntax well suited to a direct representation of mathematical formulas. Individual procedures may be compiled separately or grouped into modules, either way allowing the convenient construction of very large programs and procedure libraries. Procedures communicate via global data areas or by argument association. The language now contains features for array processing, abstract data types, dynamic data structures, objectoriented programming and parallel processing.</dc:description>
</entry>
<entry>
<title>An adaptive variable structure controller for the trajectory tracking of a nonholonomic mobile robot with uncertainties and disturbances</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9687" rel="alternate"/>
<author>
<name>Almeida Martins, Nardênio</name>
</author>
<author>
<name>El'youssef, Ebrahim Samer</name>
</author>
<author>
<name>De Pieri, Edson Roberto</name>
</author>
<author>
<name>Lombardi, Warody Claudinei</name>
</author>
<author>
<name>Jungers, Marc</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9687</id>
<updated>2019-06-22T20:03:12Z</updated>
<published>2011-04-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 11, no. 1
In this paper, a trajectory tracking control for a nonholonomic mobile robot subjected to uncertainties and disturbances in the kinematic model is proposed. An adaptive variable structure controller based on the sliding mode theory is used, and applied to compensate these uncertainties and disturbances. To minimize the problems found in practical implementation using classical variable structure controllers, and eliminate the chattering phenomenon as well as compensate disturbances a neural compensator is used, which is nonlinear and continuous, in lieu of the discontinuous portion of the control signals present in classical forms. The proposed neural compensator is designed by a modeling technique of Gaussian radial basis function neural networks and does not require the time-consuming training process. Stability analysis is guaranteed with basis on the Lyapunov method.&#13;
Simulation results are provided to show the effectiveness of the proposed approach.
</summary>
<dc:date>2011-04-01T00:00:00Z</dc:date>
<dc:description>In this paper, a trajectory tracking control for a nonholonomic mobile robot subjected to uncertainties and disturbances in the kinematic model is proposed. An adaptive variable structure controller based on the sliding mode theory is used, and applied to compensate these uncertainties and disturbances. To minimize the problems found in practical implementation using classical variable structure controllers, and eliminate the chattering phenomenon as well as compensate disturbances a neural compensator is used, which is nonlinear and continuous, in lieu of the discontinuous portion of the control signals present in classical forms. The proposed neural compensator is designed by a modeling technique of Gaussian radial basis function neural networks and does not require the time-consuming training process. Stability analysis is guaranteed with basis on the Lyapunov method.&#13;
Simulation results are provided to show the effectiveness of the proposed approach.</dc:description>
</entry>
</feed>
