<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Volumen 11 | Número 02</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/400</link>
<description/>
<pubDate>Wed, 18 Nov 2026 19:34:25 GMT</pubDate>
<dc:date>2026-11-18T19:34:25Z</dc:date>
<item>
<title>Distributed systems: principles and paradigms (2nd edition): Andrew S. Tanenbaum, Maarten Van Steen Pearson Education, Inc., 2007 ISBN: 0-13-239227-5</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9706</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 11, no. 2
This book presents the authors' updated view on the most relevant topics of distributed systems. This second edition shares most of the contents with the previous one in terms of contents/chapters, but many of the chapters have been updated and some new material has been added. Most notably, a new chapter on distributed systems architectures has been added as Chapter 2, giving a general view on the ways distributed systems can be organized.
</description>
<pubDate>Sat, 01 Oct 2011 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9706</guid>
<dc:date>2011-10-01T00:00:00Z</dc:date>
<dc:description>This book presents the authors' updated view on the most relevant topics of distributed systems. This second edition shares most of the contents with the previous one in terms of contents/chapters, but many of the chapters have been updated and some new material has been added. Most notably, a new chapter on distributed systems architectures has been added as Chapter 2, giving a general view on the ways distributed systems can be organized.</dc:description>
</item>
<item>
<title>Multipath Fault-Tolerant Routing Policies to deal with Dynamic Link Failures in High Speed Interconnection Networks</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9705</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 11, no. 2
In this thesis, we present fault-tolerant routing policies based on concepts of adaptability and deadlock freedom, capable of serving interconnection networks affected by a large number of dynamic link failures. The strongest point of this thesis is that it provides a simple but complete solution to the problem of dynamic fault tolerance in interconnection networks. The proposed solution does not require any information about network faults when the system is started or restarted. Throughout the thesis, we present the conception, design, implementation and evaluation of two contributions. The first of these contributions is the adaptive multipath routing method Fault-Tolerant Distributed Routing Balancing (FT-DRB). This method has been designed to exploit the communication path redundancy available in many network topologies, allowing interconnection networks to perform in the presence of a large number of faults. The second contribution is the scalable deadlock avoidance technique Non-blocking Adaptive Cycles (NAC), specifically designed for interconnection networks suffering from a large number of failures. This technique has been designed and implemented with the aim of ensuring freedom from deadlocks in the proposed fault-tolerant routing method FT-DRB.
</description>
<pubDate>Sat, 01 Jan 2011 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9705</guid>
<dc:date>2011-01-01T00:00:00Z</dc:date>
<dc:description>In this thesis, we present fault-tolerant routing policies based on concepts of adaptability and deadlock freedom, capable of serving interconnection networks affected by a large number of dynamic link failures. The strongest point of this thesis is that it provides a simple but complete solution to the problem of dynamic fault tolerance in interconnection networks. The proposed solution does not require any information about network faults when the system is started or restarted. Throughout the thesis, we present the conception, design, implementation and evaluation of two contributions. The first of these contributions is the adaptive multipath routing method Fault-Tolerant Distributed Routing Balancing (FT-DRB). This method has been designed to exploit the communication path redundancy available in many network topologies, allowing interconnection networks to perform in the presence of a large number of faults. The second contribution is the scalable deadlock avoidance technique Non-blocking Adaptive Cycles (NAC), specifically designed for interconnection networks suffering from a large number of failures. This technique has been designed and implemented with the aim of ensuring freedom from deadlocks in the proposed fault-tolerant routing method FT-DRB.</dc:description>
</item>
<item>
<title>Methodology for efficient Execution of SPMD applications on Multicore Clusters</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9704</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 11, no. 2
Nowadays, the scientific applications are developed with more complexity and accuracy and these precisions need high computational resources to be executed. Also, the current trend in high performance computing (HPC) is to find clusters composed of Multicore nodes, and these nodes include heterogeneity levels which have to be handled carefully if we want to improve the performance metrics. The integration of these Multicore nodes in HPC (High Performance Computing) has allowed the inclusion of more parallelism within nodes, but this parallelism generates challenges that have to be managed considering some troubles present in these environments that affect the application efficiency and speedup. Aspects associated to number of cores, data locality, shared cache, communications link inside the node, etc are considered relevant when our goal is to improve the performance.
</description>
<pubDate>Sat, 01 Oct 2011 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9704</guid>
<dc:date>2011-10-01T00:00:00Z</dc:date>
<dc:description>Nowadays, the scientific applications are developed with more complexity and accuracy and these precisions need high computational resources to be executed. Also, the current trend in high performance computing (HPC) is to find clusters composed of Multicore nodes, and these nodes include heterogeneity levels which have to be handled carefully if we want to improve the performance metrics. The integration of these Multicore nodes in HPC (High Performance Computing) has allowed the inclusion of more parallelism within nodes, but this parallelism generates challenges that have to be managed considering some troubles present in these environments that affect the application efficiency and speedup. Aspects associated to number of cores, data locality, shared cache, communications link inside the node, etc are considered relevant when our goal is to improve the performance.</dc:description>
</item>
<item>
<title>Fortran Refactorings for Legacy Systems</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9703</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 11, no. 2
This thesis is based on a certain type of legacy software that came from scientific research. Scientists have become one of the most important legacy code producers for many reasons. One of these is long-lived field (about 50 years old) they have been working in. Another reason is the amount of code produced through years and the lack of a well-defined software development process. Even though refactoring concept was born within the pale of object oriented programming we think that this concept is a paramount tool to be applied on Fortran source code. Since it has been successfully used in C language, our objective was to build a reference catalog which will serve as a guide to Fortran programmers. In thesis we discussed and proposed a detailed catalog of Fortran source transformation.
Es revisión de: http://sedici.unlp.edu.ar/handle/10915/4201
</description>
<pubDate>Sat, 01 Oct 2011 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9703</guid>
<dc:date>2011-10-01T00:00:00Z</dc:date>
<dc:description>This thesis is based on a certain type of legacy software that came from scientific research. Scientists have become one of the most important legacy code producers for many reasons. One of these is long-lived field (about 50 years old) they have been working in. Another reason is the amount of code produced through years and the lack of a well-defined software development process. Even though refactoring concept was born within the pale of object oriented programming we think that this concept is a paramount tool to be applied on Fortran source code. Since it has been successfully used in C language, our objective was to build a reference catalog which will serve as a guide to Fortran programmers. In thesis we discussed and proposed a detailed catalog of Fortran source transformation.</dc:description>
</item>
<item>
<title>A Formal Structure of Separation of Duty and Trust in Modelling Delegation Policy</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9702</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 11, no. 2
There are considerable number of approaches to policy specification both for security management and policy driven network management purposes as reported in [20]. This specification sort security policies into two basic types: authorization and obligation policies. Most of the researches in security policies specification over the years focus on authorization policy modelling. In this paper, we report our approach in the design and Modelling of obligation Policy as delegation in information security by considering separation of duty and trust as pre-requisite conditions for delegation. The formal structures of the Delegation models developed was adapted from the Mathematical structures of Separation of duty (both Static and Dynamic SoD) in RBAC environment as described in [8] and [16]. Three factors of Properties, Experiences and Recommendation as described in [22] were used for the Trust Modelling. Future works proposed include the development of a formal model for revocation after delegation and integration of appropriate authorization policy with the model.
</description>
<pubDate>Sat, 01 Oct 2011 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9702</guid>
<dc:date>2011-10-01T00:00:00Z</dc:date>
<dc:description>There are considerable number of approaches to policy specification both for security management and policy driven network management purposes as reported in [20]. This specification sort security policies into two basic types: authorization and obligation policies. Most of the researches in security policies specification over the years focus on authorization policy modelling. In this paper, we report our approach in the design and Modelling of obligation Policy as delegation in information security by considering separation of duty and trust as pre-requisite conditions for delegation. The formal structures of the Delegation models developed was adapted from the Mathematical structures of Separation of duty (both Static and Dynamic SoD) in RBAC environment as described in [8] and [16]. Three factors of Properties, Experiences and Recommendation as described in [22] were used for the Trust Modelling. Future works proposed include the development of a formal model for revocation after delegation and integration of appropriate authorization policy with the model.</dc:description>
</item>
<item>
<title>Test automation for Markov Chain Usage Models</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9701</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 11, no. 2
Statistical testing with Markov Chain Usage Models is an effective method to be used by programmers and testers during web sites development, to guarantee the software reliability. The JUMBL software works on this models; it supports model construction with the TML language and analysis, tests generation and execution and analysis of tests results. This paper is targeted at test automation for web sites development with JUMBL and JWebUnit.
</description>
<pubDate>Sat, 01 Oct 2011 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9701</guid>
<dc:date>2011-10-01T00:00:00Z</dc:date>
<dc:description>Statistical testing with Markov Chain Usage Models is an effective method to be used by programmers and testers during web sites development, to guarantee the software reliability. The JUMBL software works on this models; it supports model construction with the TML language and analysis, tests generation and execution and analysis of tests results. This paper is targeted at test automation for web sites development with JUMBL and JWebUnit.</dc:description>
</item>
<item>
<title>Formal Analysis of A Novel Mutual Authentication and Key Agreement Protocol</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9700</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 11, no. 2
This research work analyzes the universal mobile telecommunication system (UMTS) authentication and key agreement (AKA) protocol, which suffers from the traffic bottleneck at home location register and authentication center (HLR/AuC). In addition, serving network has no capability to authenticate mobile station. To overcome these problems a new security scheme has been proposed which provides a more efficient and a secure authentication between mobile station and home networks, the proposed protocol called Efficient AKA (E-AKA). The E-AKA uses a temporary key to enable visitor location register and serving network (VLR/SN) to authenticate mobile station (MS) without intervention of HLR/AuC. To analyze and validate the security of the proposed protocol, the BAN (Burrows, Abadi and Needham) logic is used. The results show that the E-AKA protocol is more robust than the current AKA protocol.
</description>
<pubDate>Sat, 01 Oct 2011 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9700</guid>
<dc:date>2011-10-01T00:00:00Z</dc:date>
<dc:description>This research work analyzes the universal mobile telecommunication system (UMTS) authentication and key agreement (AKA) protocol, which suffers from the traffic bottleneck at home location register and authentication center (HLR/AuC). In addition, serving network has no capability to authenticate mobile station. To overcome these problems a new security scheme has been proposed which provides a more efficient and a secure authentication between mobile station and home networks, the proposed protocol called Efficient AKA (E-AKA). The E-AKA uses a temporary key to enable visitor location register and serving network (VLR/SN) to authenticate mobile station (MS) without intervention of HLR/AuC. To analyze and validate the security of the proposed protocol, the BAN (Burrows, Abadi and Needham) logic is used. The results show that the E-AKA protocol is more robust than the current AKA protocol.</dc:description>
</item>
<item>
<title>Fuzzy Classification to Classify the Income Category Based On Entropy</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9699</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 11, no. 2
The classification problem is one of the main issues in data mining because it aims to extract a classifier which can be used to predict the classes of objects whose class table are unknown. This paper deals with classifying the income database with the entropy based method for analyzing the income is high or low. This method incorporates two mathematical techniques Entropy and Information Gain (IG) with Interactive Dichotomize 3 Algorithm (ID3). Subsets are calculated through Entropy. We fix the threshold point based on the fuzzy approach and the factors are identified using IG. The ID3 algorithm is used to derive a decision tree which classifies the income. This method also helps to extract logical rules that could be used in classifying high or low based on income with various attributed.
</description>
<pubDate>Sat, 01 Oct 2011 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9699</guid>
<dc:date>2011-10-01T00:00:00Z</dc:date>
<dc:description>The classification problem is one of the main issues in data mining because it aims to extract a classifier which can be used to predict the classes of objects whose class table are unknown. This paper deals with classifying the income database with the entropy based method for analyzing the income is high or low. This method incorporates two mathematical techniques Entropy and Information Gain (IG) with Interactive Dichotomize 3 Algorithm (ID3). Subsets are calculated through Entropy. We fix the threshold point based on the fuzzy approach and the factors are identified using IG. The ID3 algorithm is used to derive a decision tree which classifies the income. This method also helps to extract logical rules that could be used in classifying high or low based on income with various attributed.</dc:description>
</item>
<item>
<title>Forward-link throughput optimization for wireless cellular packet data networks</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9698</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 11, no. 2
An attempt has been made in this paper to access the control layer of the General Packet Radio Service (GPRS) network base station (BS), using throughput optimization. We focus on the effect of packet transmissions on the throughput of forwardlink (downlink) power balancing, with specific interest on the relative throughput of the four GPRS coding schemes for a realistic GPRS network operating in Nigeria. We derive a model capable of improving the channel quality and simulate the throughput and choice of optimum coding scheme over diverse packet sizes using the MATrix LABoratory toolkit. Simulation results show that the existing system requires effective network optimization to improve the system’s throughput performance.
</description>
<pubDate>Sat, 01 Oct 2011 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9698</guid>
<dc:date>2011-10-01T00:00:00Z</dc:date>
<dc:description>An attempt has been made in this paper to access the control layer of the General Packet Radio Service (GPRS) network base station (BS), using throughput optimization. We focus on the effect of packet transmissions on the throughput of forwardlink (downlink) power balancing, with specific interest on the relative throughput of the four GPRS coding schemes for a realistic GPRS network operating in Nigeria. We derive a model capable of improving the channel quality and simulate the throughput and choice of optimum coding scheme over diverse packet sizes using the MATrix LABoratory toolkit. Simulation results show that the existing system requires effective network optimization to improve the system’s throughput performance.</dc:description>
</item>
<item>
<title>Image steganography: hiding short audio messages withidin digital images</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9697</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 11, no. 2
It is sometimes not enough to keep the contents of a message secret, it may also be necessary to keep the existence of the message secret. The technique used to implement this, is called steganography and it is the process of hiding one medium of communication within another. Many different carrier file formats (text, sound or image) can be used, but digital images are the most popular because of their frequency on the Internet. Essentially, the information-hiding process in a steganographic system starts by identifying a cover meduim's redundant bits (those that can be modified without destroying that medium's integrity). The embedding process creates a stego medium by replacing these redundant bits with data from the hidden message. This paper will discuss the possibility of hiding short audio messages inside a digital image. The proposed approach encrypts the audio message before hiding it in image file. The process of extracting the audio message from stego-image will be discussed as well
</description>
<pubDate>Sat, 01 Oct 2011 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9697</guid>
<dc:date>2011-10-01T00:00:00Z</dc:date>
<dc:description>It is sometimes not enough to keep the contents of a message secret, it may also be necessary to keep the existence of the message secret. The technique used to implement this, is called steganography and it is the process of hiding one medium of communication within another. Many different carrier file formats (text, sound or image) can be used, but digital images are the most popular because of their frequency on the Internet. Essentially, the information-hiding process in a steganographic system starts by identifying a cover meduim's redundant bits (those that can be modified without destroying that medium's integrity). The embedding process creates a stego medium by replacing these redundant bits with data from the hidden message. This paper will discuss the possibility of hiding short audio messages inside a digital image. The proposed approach encrypts the audio message before hiding it in image file. The process of extracting the audio message from stego-image will be discussed as well</dc:description>
</item>
<item>
<title>Using Thematic Contexts and Previous Solutions for Maintaining and Accessing Institutional Repositories</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9696</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 11, no. 2
Institutional Repositories are collections of digital resources organized to facilitate their long term access. Two fundamental issues that need to be addressed at the moment of implementing these repositories are their maintenance and search instruments. This article describes an intelligent tool whose goal is to overcome certain general limitations encountered in current mechanisms for managing Institutional Repositories. The novel aspects of the proposed tool are the use of previous examples to generate suggestions for cataloging incoming digital resources and the ability to refect a thematic context during the search process. The proposed tool applies casebased reasoning in combination with information retrieval techniques to take advantage of a large set of previously classified resources with the purpose of supporting the cataloger's task. The tool has been evaluated using a collection consisting of 9792 training examples from the SciELO electronic library and a test set containing 100 articles coming from diferent disciplines.
</description>
<pubDate>Sat, 01 Oct 2011 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9696</guid>
<dc:date>2011-10-01T00:00:00Z</dc:date>
<dc:description>Institutional Repositories are collections of digital resources organized to facilitate their long term access. Two fundamental issues that need to be addressed at the moment of implementing these repositories are their maintenance and search instruments. This article describes an intelligent tool whose goal is to overcome certain general limitations encountered in current mechanisms for managing Institutional Repositories. The novel aspects of the proposed tool are the use of previous examples to generate suggestions for cataloging incoming digital resources and the ability to refect a thematic context during the search process. The proposed tool applies casebased reasoning in combination with information retrieval techniques to take advantage of a large set of previously classified resources with the purpose of supporting the cataloger's task. The tool has been evaluated using a collection consisting of 9792 training examples from the SciELO electronic library and a test set containing 100 articles coming from diferent disciplines.</dc:description>
</item>
</channel>
</rss>
