<?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 06 | Número 02</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/385" rel="alternate"/>
<subtitle/>
<id>http://sedici.unlp.edu.ar:80/handle/10915/385</id>
<updated>2026-11-18T22:11:25Z</updated>
<dc:date>2026-11-18T22:11:25Z</dc:date>
<entry>
<title>AES development in FPGA</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/52001" rel="alternate"/>
<author>
<name>Villagarcía Wanza, Horacio A.</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/52001</id>
<updated>2019-06-20T20:03:09Z</updated>
<published>2006-10-01T00:00:00Z</published>
<summary type="text">Revision
Journal of Computer Science &amp; Technology; vol. 6, no. 2
The National Institute of Standards and Technology (NIST) created a new standard known as Advanced Encryption Standard (AES), with the objective of developing the Federal Information Processing Standard (FIPS) which specifies an encryption algorithm capable of protecting sensitive information to be used by the government of the United States. In October 2000, the NIST selected Rijndael as the algorithm proposed for the AES.&#13;
The algorithm has a round shape made up by three uniform and non-reversible transformations which assures broadcast over the total set of fixed rounds and optimal non-linearity properties. This thesis presents an 8-bit FPGA implementation of the 128-bit block and 128 bit-key AES cipher.
Es revisión de: http://sedici.unlp.edu.ar/handle/10915/4101; Reseña de la tesis presentada en 2006 por Mónica Cristina Liberatori para obtener el título de Magister en Redes de Datos (UNLP)
</summary>
<dc:date>2006-10-01T00:00:00Z</dc:date>
<dc:description>The National Institute of Standards and Technology (NIST) created a new standard known as Advanced Encryption Standard (AES), with the objective of developing the Federal Information Processing Standard (FIPS) which specifies an encryption algorithm capable of protecting sensitive information to be used by the government of the United States. In October 2000, the NIST selected Rijndael as the algorithm proposed for the AES.&#13;
The algorithm has a round shape made up by three uniform and non-reversible transformations which assures broadcast over the total set of fixed rounds and optimal non-linearity properties. This thesis presents an 8-bit FPGA implementation of the 128-bit block and 128 bit-key AES cipher.</dc:description>
</entry>
<entry>
<title>&lt;i&gt;Distributed computing: Principles and applications&lt;/i&gt;. M. L. Liu: Addison-Wesley, 2004. ISBN 0-201-79644-9</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9544" rel="alternate"/>
<author>
<name>Tinetti, Fernando Gustavo</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9544</id>
<updated>2019-06-20T20:03:05Z</updated>
<published>2006-10-01T00:00:00Z</published>
<summary type="text">Revision
Journal of Computer Science &amp; Technology; vol. 6, no. 2
Such as the author states in the first pages, this book is the result of several years of teaching the involved topics at the California Polytechnic State University (Cal Poly), San Luis Obispo, California, U.S.A, to undergraduates. This characteristic can be observed in the organization of the book, in each of the chapters, and in the "hands-on" orientation of each of the presented topics.&#13;
&#13;
&lt;i&gt;(Párrafo extraído del texto a modo de resumen)&lt;/i&gt;
</summary>
<dc:date>2006-10-01T00:00:00Z</dc:date>
<dc:description>Such as the author states in the first pages, this book is the result of several years of teaching the involved topics at the California Polytechnic State University (Cal Poly), San Luis Obispo, California, U.S.A, to undergraduates. This characteristic can be observed in the organization of the book, in each of the chapters, and in the "hands-on" orientation of each of the presented topics.&#13;
&#13;
&lt;i&gt;(Párrafo extraído del texto a modo de resumen)&lt;/i&gt;</dc:description>
</entry>
<entry>
<title>Manuscript Character Recognition: Overview of features for the Feature Vector</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/5520" rel="alternate"/>
<author>
<name>De Giusti, Marisa Raquel</name>
</author>
<author>
<name>Vila, María Marta</name>
</author>
<author>
<name>Villarreal, Gonzalo Luján</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/5520</id>
<updated>2022-04-20T17:44:40Z</updated>
<published>2006-10-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 6, no. 2
The image recognizing process requires the identification of every logical object that compose every image, which first implies to recognize it as an object (segmentation) and then identify which object is, or at least which is the most likely one from the universe of objects that can be recognized (recognition). During the segmentation process, the aim is to identify as many objects that compose the images as possible. This process must be adapted to the universe of all objects that are looked for, which can vary from printed or manuscript characters to fruits or animals, or even fingerprints. Once all objects have been obtained, the system must carry on to the next step, which is the identification of the objects based on the called universe. In other words, if the system is looking for fruits, it must identify univocally fruits from apples and oranges; if they are characters, it must identify the character "a" from the rest of the alphabet, and soon. In this document, the character recognition step has been studied. More specifically, which methods to obtain characteristics exist (advantages and disadvantages, implementations, costs). There is also an overview about the feature vector, in which all features are stored and analyzed in order to perform the character recognition itself.
</summary>
<dc:date>2006-10-01T00:00:00Z</dc:date>
<dc:description>The image recognizing process requires the identification of every logical object that compose every image, which first implies to recognize it as an object (segmentation) and then identify which object is, or at least which is the most likely one from the universe of objects that can be recognized (recognition). During the segmentation process, the aim is to identify as many objects that compose the images as possible. This process must be adapted to the universe of all objects that are looked for, which can vary from printed or manuscript characters to fruits or animals, or even fingerprints. Once all objects have been obtained, the system must carry on to the next step, which is the identification of the objects based on the called universe. In other words, if the system is looking for fruits, it must identify univocally fruits from apples and oranges; if they are characters, it must identify the character "a" from the rest of the alphabet, and soon. In this document, the character recognition step has been studied. More specifically, which methods to obtain characteristics exist (advantages and disadvantages, implementations, costs). There is also an overview about the feature vector, in which all features are stored and analyzed in order to perform the character recognition itself.</dc:description>
</entry>
<entry>
<title>Frontal-view Face Detection in The Presence of Skin-Tone Regions Using a New Symmetry Approach</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9543" rel="alternate"/>
<author>
<name>Saad, El-Sayed M.</name>
</author>
<author>
<name>Hadhoud, Mohiy M.</name>
</author>
<author>
<name>Moawad, Moawad I.</name>
</author>
<author>
<name>El-Halawany, Mohamed</name>
</author>
<author>
<name>Abbas, Alaa M.</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9543</id>
<updated>2019-06-20T20:03:04Z</updated>
<published>2006-10-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 6, no. 2
In this paper, an efficient algorithm for detecting frontalview faces in color images is proposed. The proposed algorithm has a special task; it detects faces in the presence of skin-tone regions such as human body, clothes, and background. Firstly, a pixel based color classifier is applied to segment the skin pixels from background. Next, a hybrid cluster algorithm is applied to partition the skin region. It is well known that the frontal face is symmetrical; therefore we introduce a new symmetry approach, which is the main distinguishing feature of the proposed algorithm. It measures a symmetrical value, searches for the real center of the region, and then removes the extra unsymmetrical skin pixels. The cost functions are adopted to locate the real two eyes of the candidate face region. Finally, a template matching process is preformed between an aligning frontal face model and the candidate face region as a verification step. We have tested our algorithm on 200 images from different sets. Experimental results reveal that our algorithm can perform the detection of faces successfully under wide variations of captured images.
</summary>
<dc:date>2006-10-01T00:00:00Z</dc:date>
<dc:description>In this paper, an efficient algorithm for detecting frontalview faces in color images is proposed. The proposed algorithm has a special task; it detects faces in the presence of skin-tone regions such as human body, clothes, and background. Firstly, a pixel based color classifier is applied to segment the skin pixels from background. Next, a hybrid cluster algorithm is applied to partition the skin region. It is well known that the frontal face is symmetrical; therefore we introduce a new symmetry approach, which is the main distinguishing feature of the proposed algorithm. It measures a symmetrical value, searches for the real center of the region, and then removes the extra unsymmetrical skin pixels. The cost functions are adopted to locate the real two eyes of the candidate face region. Finally, a template matching process is preformed between an aligning frontal face model and the candidate face region as a verification step. We have tested our algorithm on 200 images from different sets. Experimental results reveal that our algorithm can perform the detection of faces successfully under wide variations of captured images.</dc:description>
</entry>
<entry>
<title>Topological Concepts applied to Digital Image Processing</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9542" rel="alternate"/>
<author>
<name>Pastore, Juan Ignacio</name>
</author>
<author>
<name>Bouchet, A.</name>
</author>
<author>
<name>Moler, Emilce Graciela</name>
</author>
<author>
<name>Ballarín, Virginia Laura</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9542</id>
<updated>2019-06-20T20:03:01Z</updated>
<published>2006-10-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 6, no. 2
This article describes an automatic method applicable to the segmentation of mediastinum Computerized Axial Tomography (CAT) images with tumors, by means of Alternating Sequential Filters (ASFs) of Mathematical Morphology, and connected components extraction based on continuous topology concepts. Digital images can be related to topological space structures, and then general topology principles can be straightforwardly implemented.&#13;
This method allows not only to accurately determine the area and external boundary of the segmented structures but also to obtain their precise location.&#13;
Throughout these last years, technological development has significantly improved diagnostic imaging, enabling renal tumor and incidental hepatic tumor detection -usually small in size- in younger people and with an eventually lower malignant potential. This has led to a remarkable advance in interventionist techniques such as cryosurgery and radiofrequency ablation, preventing, in some cases, major surgeries, decreasing morbid-mortality rate, hospital stay and total treatment costs. Notwithstanding this, both cryosurgery and radiofrequency ablation, through extremely low and high temperatures, respectively, kill tumor as well as healthy cells, rendering crucial the identification of tumors with an extraordinary spatial accuracy.
</summary>
<dc:date>2006-10-01T00:00:00Z</dc:date>
<dc:description>This article describes an automatic method applicable to the segmentation of mediastinum Computerized Axial Tomography (CAT) images with tumors, by means of Alternating Sequential Filters (ASFs) of Mathematical Morphology, and connected components extraction based on continuous topology concepts. Digital images can be related to topological space structures, and then general topology principles can be straightforwardly implemented.&#13;
This method allows not only to accurately determine the area and external boundary of the segmented structures but also to obtain their precise location.&#13;
Throughout these last years, technological development has significantly improved diagnostic imaging, enabling renal tumor and incidental hepatic tumor detection -usually small in size- in younger people and with an eventually lower malignant potential. This has led to a remarkable advance in interventionist techniques such as cryosurgery and radiofrequency ablation, preventing, in some cases, major surgeries, decreasing morbid-mortality rate, hospital stay and total treatment costs. Notwithstanding this, both cryosurgery and radiofrequency ablation, through extremely low and high temperatures, respectively, kill tumor as well as healthy cells, rendering crucial the identification of tumors with an extraordinary spatial accuracy.</dc:description>
</entry>
<entry>
<title>Application of Artificial Neural Network for Analysis of Self-Excited Induction Generator</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9541" rel="alternate"/>
<author>
<name>Khela, Raja Singh</name>
</author>
<author>
<name>Bansal, Raj Kumar</name>
</author>
<author>
<name>Sandhu, K. S.</name>
</author>
<author>
<name>Goel, Ashok Kumar</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9541</id>
<updated>2019-06-20T20:03:00Z</updated>
<published>2006-10-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 6, no. 2
It is observed that conventional techniques to analyse the steady state analysis of Self-Excited Induction Generator (SEIG) involve cumbersome mathematical procedures. In this paper an Artificial Intelligence (AI) technique has been used to analyse the behaviour of Self-Excited Induction Generator, which does not require rigorous modelling as required in conventional techniques.&#13;
Proposed Artificial Neural Network (ANN) model has been implemented to predict the effect of speed, capacitance and load on generated voltage and frequency of SEIG. Experimental data is used for the training of ANN. Results obtained from the trained ANN are found to be in close agreement with the experimental results.
</summary>
<dc:date>2006-10-01T00:00:00Z</dc:date>
<dc:description>It is observed that conventional techniques to analyse the steady state analysis of Self-Excited Induction Generator (SEIG) involve cumbersome mathematical procedures. In this paper an Artificial Intelligence (AI) technique has been used to analyse the behaviour of Self-Excited Induction Generator, which does not require rigorous modelling as required in conventional techniques.&#13;
Proposed Artificial Neural Network (ANN) model has been implemented to predict the effect of speed, capacitance and load on generated voltage and frequency of SEIG. Experimental data is used for the training of ANN. Results obtained from the trained ANN are found to be in close agreement with the experimental results.</dc:description>
</entry>
<entry>
<title>The JK System to Detect Plagiarism</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9540" rel="alternate"/>
<author>
<name>Sabri, Khair Eddin M.</name>
</author>
<author>
<name>Al-Jaafer, Jubair J.</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9540</id>
<updated>2019-06-20T20:02:58Z</updated>
<published>2006-10-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 6, no. 2
In this research a system, referred to as Jubair-Khaireddin (JK), has been developed to assess the degree of similarity between two programs even though they look superficially dissimilar. The JK system has the capability to detect deliberate attempts of plagiarism. Reverse engineering technique is used to bring each suspected program back to its initial specification stage. This operation enables us to extract the structure of the program which is an important factor in detecting plagiarism. This can be achieved through the extraction of the Static Execution Tree (SET) for each program. The SET is then transformed into Terminating Binary Sequence (TBS). The TBSs generated from the tested programs are compared in order to get similar branches. Reengineering technique is then applied on these similar branches in order to compute its entropy (information content). The entropy is computed to prove or disprove the existence of similarities between programs. The JK system has been tested on different Java programs with different modifications, and proved successful in detecting almost all cases including those of partially plagiarised programs.
</summary>
<dc:date>2006-10-01T00:00:00Z</dc:date>
<dc:description>In this research a system, referred to as Jubair-Khaireddin (JK), has been developed to assess the degree of similarity between two programs even though they look superficially dissimilar. The JK system has the capability to detect deliberate attempts of plagiarism. Reverse engineering technique is used to bring each suspected program back to its initial specification stage. This operation enables us to extract the structure of the program which is an important factor in detecting plagiarism. This can be achieved through the extraction of the Static Execution Tree (SET) for each program. The SET is then transformed into Terminating Binary Sequence (TBS). The TBSs generated from the tested programs are compared in order to get similar branches. Reengineering technique is then applied on these similar branches in order to compute its entropy (information content). The entropy is computed to prove or disprove the existence of similarities between programs. The JK system has been tested on different Java programs with different modifications, and proved successful in detecting almost all cases including those of partially plagiarised programs.</dc:description>
</entry>
<entry>
<title>Distributed Simulation of Large-Scale Individual Oriented Models</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9539" rel="alternate"/>
<author>
<name>Mostaccio, Diego</name>
</author>
<author>
<name>Dalforno, Christianne</name>
</author>
<author>
<name>Suppi, Remo</name>
</author>
<author>
<name>Luque Fadón, Emilio</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9539</id>
<updated>2019-06-20T20:02:56Z</updated>
<published>2006-10-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 6, no. 2
The distributed simulation for high performance models has been carried-out into a very useful and low-cost tool. In the present work their application to an individual oriented model (Fish Schools) is analyzed. To do this, it was analyzed different alternatives for this type of simulation and their application to obtain performance and model scalability using different implementation. Thus, two distributed simulator have been developed based on PVM and MPI communication libraries. This paper resumes the advantages and drawbacks of each implementation and some conclusions about the distributed simulation for this type of models are extracted. Moreover, visualization aspects and the developed infrastructure based on OpenGl are described.
</summary>
<dc:date>2006-10-01T00:00:00Z</dc:date>
<dc:description>The distributed simulation for high performance models has been carried-out into a very useful and low-cost tool. In the present work their application to an individual oriented model (Fish Schools) is analyzed. To do this, it was analyzed different alternatives for this type of simulation and their application to obtain performance and model scalability using different implementation. Thus, two distributed simulator have been developed based on PVM and MPI communication libraries. This paper resumes the advantages and drawbacks of each implementation and some conclusions about the distributed simulation for this type of models are extracted. Moreover, visualization aspects and the developed infrastructure based on OpenGl are described.</dc:description>
</entry>
</feed>
