<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Volumen 04 | Número 01</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/379</link>
<description/>
<pubDate>Wed, 18 Nov 2026 19:10:09 GMT</pubDate>
<dc:date>2026-11-18T19:10:09Z</dc:date>
<item>
<title>Dynamic tuning of parallel/distributed applications</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9484</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 4, no. 1
The thesis addresses the problem of automatic and dynamic tuning of parallel and distributed applications. Our objective is to help developers in the process of improving the application performance. The work presents a whole solution that deals with the issues of automatic and dynamic application improvement. In this approach, an application is monitored, its performance bottlenecks are detected, solutions are given and the application is modified on the fly
</description>
<pubDate>Thu, 01 Apr 2004 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9484</guid>
<dc:date>2004-04-01T00:00:00Z</dc:date>
<dc:description>The thesis addresses the problem of automatic and dynamic tuning of parallel and distributed applications. Our objective is to help developers in the process of improving the application performance. The work presents a whole solution that deals with the issues of automatic and dynamic application improvement. In this approach, an application is monitored, its performance bottlenecks are detected, solutions are given and the application is modified on the fly</dc:description>
</item>
<item>
<title>&lt;i&gt;High performance VLSI signal processing: Innovative architectures and algorithms&lt;/i&gt; Volume 2 - Systems design and applications: Edited by K. J. Ray Liu and Kung Yao. IEEE Press, 1998</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9483</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 4, no. 1
One of the major breakthroughs in VLSI technology has been its ability to implement signal processing algorithms and architectures onto cost-effective ASIC and DSP chips.&#13;
Works in this area are highly interdisciplinary; they involve interaction among areas such as VLSI and circuit design, computer architecture, signal processing, communications and computer-aided design.&#13;
The editors collect in two volumes much of the research efforts and findings that have made the high performance implementation of signal processing possible in the '90s.
</description>
<pubDate>Thu, 01 Apr 2004 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9483</guid>
<dc:date>2004-04-01T00:00:00Z</dc:date>
<dc:description>One of the major breakthroughs in VLSI technology has been its ability to implement signal processing algorithms and architectures onto cost-effective ASIC and DSP chips.&#13;
Works in this area are highly interdisciplinary; they involve interaction among areas such as VLSI and circuit design, computer architecture, signal processing, communications and computer-aided design.&#13;
The editors collect in two volumes much of the research efforts and findings that have made the high performance implementation of signal processing possible in the '90s.</dc:description>
</item>
<item>
<title>HTSN: a complex workflow model based on colored Petri net</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9482</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 4, no. 1
Traditional workflow models have obvious shortcomings in describing complex workflows. Such complexity is due not only to the hierarchical property of business process, but also to the complicated dependencies among tasks. In this paper, we first introduce a conceptual task model based on UML class graph. Then we apply colored Petri nets to model task interfaces and composite task versions which form Task State Nets (TSNs) and Task Version Nets (TVNs). The main advantage is that they explicitly express all task interfaces´ internal states and thus they can easily describe the complex control dependencies. Next we further combine TSN/TVN with place refining mechanism and bring forward our Hierarchical Task State Net (HTSN). It supports the description of workflow's hierarchical structure, multi-versions configuration of composite task as well as the analysis of structural properties. Finally, we give a case study.
</description>
<pubDate>Thu, 01 Apr 2004 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9482</guid>
<dc:date>2004-04-01T00:00:00Z</dc:date>
<dc:description>Traditional workflow models have obvious shortcomings in describing complex workflows. Such complexity is due not only to the hierarchical property of business process, but also to the complicated dependencies among tasks. In this paper, we first introduce a conceptual task model based on UML class graph. Then we apply colored Petri nets to model task interfaces and composite task versions which form Task State Nets (TSNs) and Task Version Nets (TVNs). The main advantage is that they explicitly express all task interfaces´ internal states and thus they can easily describe the complex control dependencies. Next we further combine TSN/TVN with place refining mechanism and bring forward our Hierarchical Task State Net (HTSN). It supports the description of workflow's hierarchical structure, multi-versions configuration of composite task as well as the analysis of structural properties. Finally, we give a case study.</dc:description>
</item>
<item>
<title>ALENA: Adaptive-Length Evolving Neural Arrays</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9481</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 4, no. 1
Evolving neural arrays (ENA) have proved to be capable of learning complex behaviors, i.e., problems whose solution requires strategy learning. For this reason, they present many applications in various areas such as robotics and process control. Unlike conventional methods "based on a single neural network" ENAs are made up of a set of networks organized as an array. Each of them represents a part of the expected solution. This work describes a new method, ALENA, that enhances the solutions obtained by solving the main deficiencies of ENA since it eases the obtaining of specialized components, does not require the explicit decomposition of the problem into subtasks, and is capable of automatically adjusting the arrays length for each particular use. The measurements of the proposed method "applied to problems of obstacle evasion and objects collection" show the superiority of ALENA in relation to the traditional methods that deal with populations of neural networks. SANE has been used in particular as a comparative referent due to its high performance. Eventually, conclusions and some future lines of work are presented.
</description>
<pubDate>Thu, 01 Apr 2004 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9481</guid>
<dc:date>2004-04-01T00:00:00Z</dc:date>
<dc:description>Evolving neural arrays (ENA) have proved to be capable of learning complex behaviors, i.e., problems whose solution requires strategy learning. For this reason, they present many applications in various areas such as robotics and process control. Unlike conventional methods "based on a single neural network" ENAs are made up of a set of networks organized as an array. Each of them represents a part of the expected solution. This work describes a new method, ALENA, that enhances the solutions obtained by solving the main deficiencies of ENA since it eases the obtaining of specialized components, does not require the explicit decomposition of the problem into subtasks, and is capable of automatically adjusting the arrays length for each particular use. The measurements of the proposed method "applied to problems of obstacle evasion and objects collection" show the superiority of ALENA in relation to the traditional methods that deal with populations of neural networks. SANE has been used in particular as a comparative referent due to its high performance. Eventually, conclusions and some future lines of work are presented.</dc:description>
</item>
<item>
<title>A GRASP algorithm with tree based local search for designing a survivable wide area network backbone</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9480</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 4, no. 1
System survivability is the ability to give service in spite of failures of some of the components. To assure survivability is an important goal when designing a communications network backbone, to ensure that it can resist to failures in the switch sites as well as in the connection lines. Previous work has employed a Greedy Randomized Adaptive Search Procedure (GRASP), based on path algorithms, to build low cost network topologies which comply with heterogeneous node-connectivity requirements, which can model the survivability goals. In this work, we present another variant of the GRASP procedure, based on a tree search, which obtains good results in topologies with a large number of switch nodes.
</description>
<pubDate>Thu, 01 Apr 2004 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9480</guid>
<dc:date>2004-04-01T00:00:00Z</dc:date>
<dc:description>System survivability is the ability to give service in spite of failures of some of the components. To assure survivability is an important goal when designing a communications network backbone, to ensure that it can resist to failures in the switch sites as well as in the connection lines. Previous work has employed a Greedy Randomized Adaptive Search Procedure (GRASP), based on path algorithms, to build low cost network topologies which comply with heterogeneous node-connectivity requirements, which can model the survivability goals. In this work, we present another variant of the GRASP procedure, based on a tree search, which obtains good results in topologies with a large number of switch nodes.</dc:description>
</item>
<item>
<title>Integrating defeasible argumentation with fuzzy ART neural networks for pattern classification</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9479</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 4, no. 1
Many classification systems rely on clustering techniques in which a collection of training examples is provided as an&#13;
input, and a number of clusters c&lt;SUB&gt;1&lt;/SUB&gt;,...c&lt;SUB&gt;m&lt;/SUB&gt; modelling some concept C results as an output, such that every cluster c&lt;SUB&gt;i&lt;/SUB&gt; is labelled as positive or negative. Given a new, unlabelled&#13;
instance e&lt;SUB&gt;new&lt;/SUB&gt;, the above classification is used to determine to which particular cluster c&lt;SUB&gt;i&lt;/SUB&gt; this new instance belongs. In such a setting clusters can overlap, and a new unlabelled instance can be assigned to more than one cluster with conflicting labels. In the literature, such a case is usually solved non-deterministically by making a random choice. This paper&#13;
presents a novel, hybrid approach to solve this situation&#13;
by combining a neural network for classification along with a defeasible argumentation framework which models preference&#13;
criteria for performing clustering.
</description>
<pubDate>Thu, 01 Apr 2004 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9479</guid>
<dc:date>2004-04-01T00:00:00Z</dc:date>
<dc:description>Many classification systems rely on clustering techniques in which a collection of training examples is provided as an&#13;
input, and a number of clusters c&lt;SUB&gt;1&lt;/SUB&gt;,...c&lt;SUB&gt;m&lt;/SUB&gt; modelling some concept C results as an output, such that every cluster c&lt;SUB&gt;i&lt;/SUB&gt; is labelled as positive or negative. Given a new, unlabelled&#13;
instance e&lt;SUB&gt;new&lt;/SUB&gt;, the above classification is used to determine to which particular cluster c&lt;SUB&gt;i&lt;/SUB&gt; this new instance belongs. In such a setting clusters can overlap, and a new unlabelled instance can be assigned to more than one cluster with conflicting labels. In the literature, such a case is usually solved non-deterministically by making a random choice. This paper&#13;
presents a novel, hybrid approach to solve this situation&#13;
by combining a neural network for classification along with a defeasible argumentation framework which models preference&#13;
criteria for performing clustering.</dc:description>
</item>
<item>
<title>Towards a metric suite for OCL expressions expressed within UML/OCL models</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9478</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 4, no. 1
UML models quality is clearly a crucial issue that must be evaluated at the initial stages of object-oriented software development, in order to get software products with better quality. This fact is corroborated by the huge amount of metrics that have appeared in the literature related to the measurement of UML diagrams at a high level design stage. Most of these metrics are focused on the measurement of internal quality attributes such as structural complexity, coupling, size, etc. However, none of the proposed metrics take into account the added complexity involved when a UML model are complemented by expressions written in Object Constraint Language (OCL), that is a UML/OCL model. Due OCL is essential in building consistent and coherent platform-independent models we propose a metric suite for structural properties of OCL expressions. These metrics were proposed considering OCL concepts related to the "chunking" and "tracing" cognitive techniques. We believe that cognitive techniques affect the cognitive complexity, and by consequence the understandability and maintainability of expression of UML/OCL models. Therefore, the goal of this paper is to show how we defined these metrics in a methodological way, assuring thus their validity.
</description>
<pubDate>Thu, 01 Apr 2004 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9478</guid>
<dc:date>2004-04-01T00:00:00Z</dc:date>
<dc:description>UML models quality is clearly a crucial issue that must be evaluated at the initial stages of object-oriented software development, in order to get software products with better quality. This fact is corroborated by the huge amount of metrics that have appeared in the literature related to the measurement of UML diagrams at a high level design stage. Most of these metrics are focused on the measurement of internal quality attributes such as structural complexity, coupling, size, etc. However, none of the proposed metrics take into account the added complexity involved when a UML model are complemented by expressions written in Object Constraint Language (OCL), that is a UML/OCL model. Due OCL is essential in building consistent and coherent platform-independent models we propose a metric suite for structural properties of OCL expressions. These metrics were proposed considering OCL concepts related to the "chunking" and "tracing" cognitive techniques. We believe that cognitive techniques affect the cognitive complexity, and by consequence the understandability and maintainability of expression of UML/OCL models. Therefore, the goal of this paper is to show how we defined these metrics in a methodological way, assuring thus their validity.</dc:description>
</item>
<item>
<title>Activation and termination detection on distributed systems</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9477</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 4, no. 1
Facing the different approaches to process activation and global termination detection on distributed systems, this paper performs a practical comparison between the mainly opposed centralized and distributed models. Firstly, they were implemented to solve both the activation and termination detection problems. Based on processing performance and communication overhead metrics, both systems were evaluated running on various parametrized environments. As a result, we present the values obtained and the final conclusions. The overall design was made following an object oriented methodology, which was coded using C++. The inter-process communication was carried out using the PVM libraries.
</description>
<pubDate>Thu, 01 Apr 2004 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9477</guid>
<dc:date>2004-04-01T00:00:00Z</dc:date>
<dc:description>Facing the different approaches to process activation and global termination detection on distributed systems, this paper performs a practical comparison between the mainly opposed centralized and distributed models. Firstly, they were implemented to solve both the activation and termination detection problems. Based on processing performance and communication overhead metrics, both systems were evaluated running on various parametrized environments. As a result, we present the values obtained and the final conclusions. The overall design was made following an object oriented methodology, which was coded using C++. The inter-process communication was carried out using the PVM libraries.</dc:description>
</item>
<item>
<title>Reasoning about Protocols using Dijkstra’s Calculus</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9476</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 4, no. 1
A mathematical model for the specification and verification of a data link layer protocol is proposed. The weakest precondition calculus, developed by Dijkstra, originally for sequential programs, has been chosen for this purpose. It is demonstrated that the wp-calculus provides a basis, not only for the modeling but also, for a straightforward and thorough analysis of large and complex distributed systems like data link layer protocol. This analysis contributes to the understanding of the system and could lead to an improvement in the design. The technique has been illustrated by describing the sliding window protocol.
</description>
<pubDate>Thu, 01 Apr 2004 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9476</guid>
<dc:date>2004-04-01T00:00:00Z</dc:date>
<dc:description>A mathematical model for the specification and verification of a data link layer protocol is proposed. The weakest precondition calculus, developed by Dijkstra, originally for sequential programs, has been chosen for this purpose. It is demonstrated that the wp-calculus provides a basis, not only for the modeling but also, for a straightforward and thorough analysis of large and complex distributed systems like data link layer protocol. This analysis contributes to the understanding of the system and could lead to an improvement in the design. The technique has been illustrated by describing the sliding window protocol.</dc:description>
</item>
<item>
<title>On improved deformable template matching for polygonal objects</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9475</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 4, no. 1
In this paper, an improvement of deformable template matching algorithm for polygonal objects in grayscale images using two-dimensional deformable templates along orthogonal curves is presented. In the process of pre-computing extensions of the deformable template along orthogonal curves, the novel matching approach incorporates adapting knowledge-specific template discretization techniques appropriate for different polygonal objects and minimizing the improved internal and external energy terms containing inter-shape information of polygonal objects. In our application, this energy optimization problem of the deformable template is efficiently solved by a genetic algorithm (GA). Our algorithm has been successfully applied on synthetic images and real images. The experiment results show that the new approach provides more robust and accurate matching method.
</description>
<pubDate>Thu, 01 Apr 2004 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9475</guid>
<dc:date>2004-04-01T00:00:00Z</dc:date>
<dc:description>In this paper, an improvement of deformable template matching algorithm for polygonal objects in grayscale images using two-dimensional deformable templates along orthogonal curves is presented. In the process of pre-computing extensions of the deformable template along orthogonal curves, the novel matching approach incorporates adapting knowledge-specific template discretization techniques appropriate for different polygonal objects and minimizing the improved internal and external energy terms containing inter-shape information of polygonal objects. In our application, this energy optimization problem of the deformable template is efficiently solved by a genetic algorithm (GA). Our algorithm has been successfully applied on synthetic images and real images. The experiment results show that the new approach provides more robust and accurate matching method.</dc:description>
</item>
<item>
<title>CBS: constraint-based approach for scheduling in bluetooth networks</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9474</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 4, no. 1
In Bluetooth networks, devices are organized into small piconets and large scatternets, and each node acts as the role of master, slave or gateway. Due to dynamic topology changes, different bandwidth available and unpredictable interference of media in Bluetooth networks, the congestion of data flow will inevitably emerges on the link, and the gateway has to switch between piconets on a time division basis, so its presence in the different piconet has to be controlled by scheduling mechanism such as inter- and intra -piconet scheduling. However, the time division in gateways will limit the network capacity and introduce bottleneck points in the network, and the switch between piconets will prevent the packet from transmitting smoothly and efficiently. Most of the published work on Bluetooth scheduling has focused on the polling scheme between master and slaves. In this paper, we put our approach on the inner constraints of Bluetooth networks and present a constraint-based scheduler (CBS), to adaptively cater to the changing role of each node throughout Bluetooth ad hoc networks, thereby it will save time and definitely enhance fairness and efficiency on packet scheduling in Bluetooth environment.
</description>
<pubDate>Thu, 01 Apr 2004 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9474</guid>
<dc:date>2004-04-01T00:00:00Z</dc:date>
<dc:description>In Bluetooth networks, devices are organized into small piconets and large scatternets, and each node acts as the role of master, slave or gateway. Due to dynamic topology changes, different bandwidth available and unpredictable interference of media in Bluetooth networks, the congestion of data flow will inevitably emerges on the link, and the gateway has to switch between piconets on a time division basis, so its presence in the different piconet has to be controlled by scheduling mechanism such as inter- and intra -piconet scheduling. However, the time division in gateways will limit the network capacity and introduce bottleneck points in the network, and the switch between piconets will prevent the packet from transmitting smoothly and efficiently. Most of the published work on Bluetooth scheduling has focused on the polling scheme between master and slaves. In this paper, we put our approach on the inner constraints of Bluetooth networks and present a constraint-based scheduler (CBS), to adaptively cater to the changing role of each node throughout Bluetooth ad hoc networks, thereby it will save time and definitely enhance fairness and efficiency on packet scheduling in Bluetooth environment.</dc:description>
</item>
<item>
<title>Index structures for distributed text databases</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9473</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 4, no. 1
The Web has became an obiquitous resource for distributed computing making it relevant to investigate new ways of providing efficient access to services available at dedicated sites. Efficiency is an ever-increasing demand which can be only satisfied with the development of parallel algorithms which are efficient in practice. This tutorial paper focuses on the design, analysis and implementation of parallel algorithms and data structures for widely-used text database applications on the Web. In particular we describe parallel algorithms for inverted files and suffix arrays structures that are suitable for implementing search engines. Algorithmic design is effected on top of the BSP model of parallel computing. This model ensures portability across diverse parallel architectures ranging from clusters to super-computers.
</description>
<pubDate>Thu, 01 Apr 2004 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9473</guid>
<dc:date>2004-04-01T00:00:00Z</dc:date>
<dc:description>The Web has became an obiquitous resource for distributed computing making it relevant to investigate new ways of providing efficient access to services available at dedicated sites. Efficiency is an ever-increasing demand which can be only satisfied with the development of parallel algorithms which are efficient in practice. This tutorial paper focuses on the design, analysis and implementation of parallel algorithms and data structures for widely-used text database applications on the Web. In particular we describe parallel algorithms for inverted files and suffix arrays structures that are suitable for implementing search engines. Algorithmic design is effected on top of the BSP model of parallel computing. This model ensures portability across diverse parallel architectures ranging from clusters to super-computers.</dc:description>
</item>
</channel>
</rss>
