<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Volumen 01 | Número 05</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/374</link>
<description/>
<pubDate>Wed, 18 Nov 2026 17:46:19 GMT</pubDate>
<dc:date>2026-11-18T17:46:19Z</dc:date>
<item>
<title>Defeasible logic programming: language definition, operational semantics, and parallelism</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9427</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 1, no. 5
This thesis defines Defeasible Logic Programming and provides a concrete specification of this new language through its operational semantics. Defeasible Logic Programming, or DeLP for short, has been defined based on the Logic Programming paradigm and considering features of recent developments in the area of Defeasible Argumentation. DeLP relates and improves many aspects of the areas of Logic Programming, Defeasible Argumentation, Intelligent Agents, and Parallel Logic Programming
</description>
<pubDate>Mon, 01 Jan 2001 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9427</guid>
<dc:date>2001-01-01T00:00:00Z</dc:date>
<dc:description>This thesis defines Defeasible Logic Programming and provides a concrete specification of this new language through its operational semantics. Defeasible Logic Programming, or DeLP for short, has been defined based on the Logic Programming paradigm and considering features of recent developments in the area of Defeasible Argumentation. DeLP relates and improves many aspects of the areas of Logic Programming, Defeasible Argumentation, Intelligent Agents, and Parallel Logic Programming</dc:description>
</item>
<item>
<title>Formalizing processes in defeasible argumentation using labeled deductive systems</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9426</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 1, no. 5
This paper summarizes the main results developed in the author's PhD Thesis.&#13;
The main goal of the Thesis is to provide a formalization of defeasible argumentation oriented towards its computational treatment. In order to do this, an LDS-based logical framework for defeasible argumentation called LDSar has been developed. The object language is that of logic programming, complemented with labels that identify distinguished elements for representing knowledge and performing inference.
Resumen de la tesis doctoral presentada por el autor en la Universidad del Sur.
</description>
<pubDate>Mon, 01 Jan 2001 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9426</guid>
<dc:date>2001-01-01T00:00:00Z</dc:date>
<dc:description>This paper summarizes the main results developed in the author's PhD Thesis.&#13;
The main goal of the Thesis is to provide a formalization of defeasible argumentation oriented towards its computational treatment. In order to do this, an LDS-based logical framework for defeasible argumentation called LDSar has been developed. The object language is that of logic programming, complemented with labels that identify distinguished elements for representing knowledge and performing inference.</dc:description>
</item>
<item>
<title>&lt;i&gt;System requirements engineering&lt;/i&gt; by V. Loucopoulos and V. Karakostas: 1995.- McGraw-Hill International series in Software Engineering. ISBN 0-07-707843-8</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9425</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 1, no. 5
Requirements Engineering is the key issue for the development of Software Systems, that meet the expectations of their customers and users, are delivered on time, and are developed within budget.&#13;
This book intends to provide the state of the art material on techniques, methods, and tools for the elicitation, representation and validation of requirements.
</description>
<pubDate>Mon, 01 Jan 2001 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9425</guid>
<dc:date>2001-01-01T00:00:00Z</dc:date>
<dc:description>Requirements Engineering is the key issue for the development of Software Systems, that meet the expectations of their customers and users, are delivered on time, and are developed within budget.&#13;
This book intends to provide the state of the art material on techniques, methods, and tools for the elicitation, representation and validation of requirements.</dc:description>
</item>
<item>
<title>&lt;i&gt;The Student's Guide to VHDL&lt;/i&gt;,  Peter J. Ashenden, Morgan Kaufmann: Morgan Kaufmann Publishers, 1998. ISBN 1-55860-520-7</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9424</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 1, no. 5
The Student’s Guide to VHDL teaches the fundamental modeling features of VHDL, showing how the features are used for the design of digital systems. It is organized so that it can be read linearly from front to back, as a structured self-learning guide to the language.
</description>
<pubDate>Mon, 01 Jan 2001 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9424</guid>
<dc:date>2001-01-01T00:00:00Z</dc:date>
<dc:description>The Student’s Guide to VHDL teaches the fundamental modeling features of VHDL, showing how the features are used for the design of digital systems. It is organized so that it can be read linearly from front to back, as a structured self-learning guide to the language.</dc:description>
</item>
<item>
<title>Enhancing evolutionary algorithms through recombination and parallelism</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9423</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 1, no. 5
Evolutionary computation (EC) has been recently recognized as a research field, which studies a new type of algorithms: Evolutionary Algorithms (EAs). These algorithms process populations of solutions as opposed to most traditional approaches which improve a single solution. All these algorithms share common features: reproduction, random variation, competition and selection of individuals. During our research it was evident that some components of EAs should be re-examined. Hence, specific topics such as multiple crossovers per couple and its enhancements, multiplicity of parents and crossovers and their application to single and multiple criteria optimization problems, adaptability, and parallel genetic algorithms, were proposed and investigated carefully. This paper show the most relevant and recent enhancements on recombination for a genetic-algorithm-based EA and migration control strategies for parallel genetic algorithms. Details of implementation and results are discussed.
</description>
<pubDate>Mon, 01 Jan 2001 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9423</guid>
<dc:date>2001-01-01T00:00:00Z</dc:date>
<dc:description>Evolutionary computation (EC) has been recently recognized as a research field, which studies a new type of algorithms: Evolutionary Algorithms (EAs). These algorithms process populations of solutions as opposed to most traditional approaches which improve a single solution. All these algorithms share common features: reproduction, random variation, competition and selection of individuals. During our research it was evident that some components of EAs should be re-examined. Hence, specific topics such as multiple crossovers per couple and its enhancements, multiplicity of parents and crossovers and their application to single and multiple criteria optimization problems, adaptability, and parallel genetic algorithms, were proposed and investigated carefully. This paper show the most relevant and recent enhancements on recombination for a genetic-algorithm-based EA and migration control strategies for parallel genetic algorithms. Details of implementation and results are discussed.</dc:description>
</item>
<item>
<title>Instantaneous messaging system: a distributed approach</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9422</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 1, no. 5
This work presents the development of an instantaneous messaging system, which is centered on the distributed handling of user groups. The method pro-posed for handling of groups has several distinctive characteristics: the non exis-tence of a moderator for each group, allowing any user to abandon the group at any moment without putting in danger the group's existence, and the absence of a server where the user must be authenticated every time that he wants to engage in conversation with somebody, which allows that a more direct communication be established with the person with which communication is desired.
</description>
<pubDate>Mon, 01 Jan 2001 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9422</guid>
<dc:date>2001-01-01T00:00:00Z</dc:date>
<dc:description>This work presents the development of an instantaneous messaging system, which is centered on the distributed handling of user groups. The method pro-posed for handling of groups has several distinctive characteristics: the non exis-tence of a moderator for each group, allowing any user to abandon the group at any moment without putting in danger the group's existence, and the absence of a server where the user must be authenticated every time that he wants to engage in conversation with somebody, which allows that a more direct communication be established with the person with which communication is desired.</dc:description>
</item>
<item>
<title>Parallelization of image similarity analysis</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9421</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 1, no. 5
The algorithmical architecture and structure is presented for the parallelization of image similarity analysis, based on obtaining multiple digital signatures for each image, in which each "signature" is composed by the most representative coefficients of the wavelet transform of the corresponding image area. In the present paper, image representation by wavelet transform coefficients is analyzed, as well as the convenience/necessity of using multiple coefficients for the study of similarity of images which may have transferred components, with change of sizes, color or texture. The complexity of the involved computation justifies parallelization, and the suggested solution constitutes a combination of a multiprocessors "pipelining", being each of them an homogeneous parallel architecture which obtains signature coefficients (wavelet). Partial reusability of computations for successive signatures makes these architectures pipelining compulsory.
</description>
<pubDate>Mon, 01 Jan 2001 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9421</guid>
<dc:date>2001-01-01T00:00:00Z</dc:date>
<dc:description>The algorithmical architecture and structure is presented for the parallelization of image similarity analysis, based on obtaining multiple digital signatures for each image, in which each "signature" is composed by the most representative coefficients of the wavelet transform of the corresponding image area. In the present paper, image representation by wavelet transform coefficients is analyzed, as well as the convenience/necessity of using multiple coefficients for the study of similarity of images which may have transferred components, with change of sizes, color or texture. The complexity of the involved computation justifies parallelization, and the suggested solution constitutes a combination of a multiprocessors "pipelining", being each of them an homogeneous parallel architecture which obtains signature coefficients (wavelet). Partial reusability of computations for successive signatures makes these architectures pipelining compulsory.</dc:description>
</item>
<item>
<title>Using boolean circuits for the parallel computation of queries</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9420</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 1, no. 5
We present partial results of a research project in which we use boolean circuits as a parallel computation model for the expression of queries to relational databases. For that purpose, we use the well-known equivalence between First Order Logic (FO) and a class of restricted families of boolean circuits. First, we translate a given query, expressed through a FO formula, into a uniform family of boolean circuits. Then we analyse the depth of the boolean circuits, in order to optimize parallel time. For this sake, we work on the expression tree of the formula, looking for its transformation into an equivalent family of boolean circuits of minimum depth.
</description>
<pubDate>Mon, 01 Jan 2001 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9420</guid>
<dc:date>2001-01-01T00:00:00Z</dc:date>
<dc:description>We present partial results of a research project in which we use boolean circuits as a parallel computation model for the expression of queries to relational databases. For that purpose, we use the well-known equivalence between First Order Logic (FO) and a class of restricted families of boolean circuits. First, we translate a given query, expressed through a FO formula, into a uniform family of boolean circuits. Then we analyse the depth of the boolean circuits, in order to optimize parallel time. For this sake, we work on the expression tree of the formula, looking for its transformation into an equivalent family of boolean circuits of minimum depth.</dc:description>
</item>
<item>
<title>Parallel processing applied to the design of concrete encased grounding electrodes</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9419</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 1, no. 5
This work presents the authors investigation regarding the application of parallel processing to the design of grounding systems, comprising concrete encased electrodes. The natural parallelism of the involved tasks and the large time-consuming characteristic of sequential processing for this kind of application justify the use of high performance computation. This design problem presents two main approaches for parallelism exploring. This work shows the advantages of parallel processing for generation of a geometric coefficient matrix, which describes the basic relations among currents and potentials at the grounding system. The grounding model has been developed at Federal University of Minas Gerais and, for implementing the parallel algorithm version, a computational tool (CPAR), which was developed in Polytechnic School of São Paulo University, was employed.
</description>
<pubDate>Mon, 01 Jan 2001 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9419</guid>
<dc:date>2001-01-01T00:00:00Z</dc:date>
<dc:description>This work presents the authors investigation regarding the application of parallel processing to the design of grounding systems, comprising concrete encased electrodes. The natural parallelism of the involved tasks and the large time-consuming characteristic of sequential processing for this kind of application justify the use of high performance computation. This design problem presents two main approaches for parallelism exploring. This work shows the advantages of parallel processing for generation of a geometric coefficient matrix, which describes the basic relations among currents and potentials at the grounding system. The grounding model has been developed at Federal University of Minas Gerais and, for implementing the parallel algorithm version, a computational tool (CPAR), which was developed in Polytechnic School of São Paulo University, was employed.</dc:description>
</item>
<item>
<title>An algorithm for dynamic reconfiguration of mobile agents</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9418</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 1, no. 5
In this paper we show an algorithm for dynamic reconfiguration of distributed applications based on the mobile agent model. We also show that the proposed algorithm can be easily implemented in the IPL language, a language with several abstractions for the construction of mobile applications in the Internet.
</description>
<pubDate>Mon, 01 Jan 2001 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9418</guid>
<dc:date>2001-01-01T00:00:00Z</dc:date>
<dc:description>In this paper we show an algorithm for dynamic reconfiguration of distributed applications based on the mobile agent model. We also show that the proposed algorithm can be easily implemented in the IPL language, a language with several abstractions for the construction of mobile applications in the Internet.</dc:description>
</item>
<item>
<title>A comparison of different evolutive niching strategies for identifying a set of selfsimilar contractions for the IFS inverse problem</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9417</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 1, no. 5
The key problem in fractal image compression is that of obtaining the IFS code (a set of linear transformations)which approximates a given image with a certain prescribed accuracy (inverse IFS problem).In this paper,we analyze and compare the performance of sharing and crowding niching techniques for identifying optimal selfsimilar transformations likely to represent a selfsimilar area within the image. The best results are found using the deterministic crowding method.We also present an nteractive Matlab program implementing the algorithms described in the paper.The key problem in fractal image compression is that of obtaining the IFS code (a set of linear transformations)which approximates a given image with a certain prescribed accuracy (inverse IFS problem).In this paper,we analyze and compare the performance of sharing and crowding niching techniques for identifying optimal selfsimilar transformations likely to represent a selfsimilar area within the image. The best results are found using the deterministic crowding method.We also present an nteractive Matlab program implementing the algorithms described in the paper.
</description>
<pubDate>Mon, 01 Jan 2001 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9417</guid>
<dc:date>2001-01-01T00:00:00Z</dc:date>
<dc:description>The key problem in fractal image compression is that of obtaining the IFS code (a set of linear transformations)which approximates a given image with a certain prescribed accuracy (inverse IFS problem).In this paper,we analyze and compare the performance of sharing and crowding niching techniques for identifying optimal selfsimilar transformations likely to represent a selfsimilar area within the image. The best results are found using the deterministic crowding method.We also present an nteractive Matlab program implementing the algorithms described in the paper.The key problem in fractal image compression is that of obtaining the IFS code (a set of linear transformations)which approximates a given image with a certain prescribed accuracy (inverse IFS problem).In this paper,we analyze and compare the performance of sharing and crowding niching techniques for identifying optimal selfsimilar transformations likely to represent a selfsimilar area within the image. The best results are found using the deterministic crowding method.We also present an nteractive Matlab program implementing the algorithms described in the paper.</dc:description>
</item>
<item>
<title>The agent routering process of a dynamic distributed decision support system</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9416</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 1, no. 5
When certain enterprise domain needs to make an unusual decision, it will probably require new kind of information. If the interaction model among domains cannot be defined because the decision scenarios are unpredictable, the system itself must search the required information analyzing where it is available, or can be generated. To do that, it is necessary to design a mechanism able to decide where to look for the information.We have developed a distributed DSS able to work in a dynamic way. This system is based on the use of mobile agents, which receive the user´s queries and visit the DSS domains gathering the required information. One of the main elements to the efficient operation of this system is the Router Agent. Its responsibility is to give an adequate route to the mobile agents. In this paper we propose a structure for the Router Agent. It includes a Knowledge Base where the information managed by each domain is represented, and a mechanism to compare the query content with the domain representation. We also present an interactive strategy to obtain the initial data to be stored in the Router Knowledge Base. The AHP method is used to support the task of evaluating the relative importance among terms representing each domain.
</description>
<pubDate>Mon, 01 Jan 2001 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9416</guid>
<dc:date>2001-01-01T00:00:00Z</dc:date>
<dc:description>When certain enterprise domain needs to make an unusual decision, it will probably require new kind of information. If the interaction model among domains cannot be defined because the decision scenarios are unpredictable, the system itself must search the required information analyzing where it is available, or can be generated. To do that, it is necessary to design a mechanism able to decide where to look for the information.We have developed a distributed DSS able to work in a dynamic way. This system is based on the use of mobile agents, which receive the user´s queries and visit the DSS domains gathering the required information. One of the main elements to the efficient operation of this system is the Router Agent. Its responsibility is to give an adequate route to the mobile agents. In this paper we propose a structure for the Router Agent. It includes a Knowledge Base where the information managed by each domain is represented, and a mechanism to compare the query content with the domain representation. We also present an interactive strategy to obtain the initial data to be stored in the Router Knowledge Base. The AHP method is used to support the task of evaluating the relative importance among terms representing each domain.</dc:description>
</item>
<item>
<title>Revision of informant plausibility in multi-agent system</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9415</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 1, no. 5
Within the context of multi-agent systems, an agent may often find itself in a position where it receives information through informants. These informants are independent agents who have their own interests and, therefore are not necessarily completely reliable. It is natural for an agent to be more inclined to believe one informant over another, especially if the informant has provent itself reliable over a period of time. This paper proposes the organization of the informants into a partial order with compares the plausibility of the relevant informants. This partial order need not remain static throughout the agent's lifespan. The agent may choose to update its partial order relation to reflect a new perception of informants plausibility. Therefore this paper also proposes the application of change operators, not to the beliefs themselves, but to the partial order. These operators are used to alter the structure of relative credibility of the informants. These operators are characterized through postulates and construction is provided for them.
</description>
<pubDate>Mon, 01 Jan 2001 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9415</guid>
<dc:date>2001-01-01T00:00:00Z</dc:date>
<dc:description>Within the context of multi-agent systems, an agent may often find itself in a position where it receives information through informants. These informants are independent agents who have their own interests and, therefore are not necessarily completely reliable. It is natural for an agent to be more inclined to believe one informant over another, especially if the informant has provent itself reliable over a period of time. This paper proposes the organization of the informants into a partial order with compares the plausibility of the relevant informants. This partial order need not remain static throughout the agent's lifespan. The agent may choose to update its partial order relation to reflect a new perception of informants plausibility. Therefore this paper also proposes the application of change operators, not to the beliefs themselves, but to the partial order. These operators are used to alter the structure of relative credibility of the informants. These operators are characterized through postulates and construction is provided for them.</dc:description>
</item>
<item>
<title>Coscheduling techniques and monitoring tools for non-dedicated cluster computing</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9414</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 1, no. 5
Our efforts are directed towards the understanding of the coscheduling mechanism in a NOW system when a parallel job is executed jointly with local workloads, balancing parallel perfor-mance against the local interactive response. Explicit and implicit coscheduling techniques in a PVM-Linux NOW (or cluster) have been implemented. Furthermore, dynamic coscheduling remains an open question when parallel jobs are executed in a non-dedicated Cluster. A basis model for dynamic coscheduling in Cluster systems is presented in this paper. Also, one dynamic coscheduling algorithm for this model is proposed. The applicability of this algorithm has been proved and its performance ana-lyzed by simulation. Finally, a new tool (named Monito) for monitoring the different queues of messages in such an environments is presented. The main aim of implementing this facility is to provide a mean of capturing the bottlenecks and overheads of the communication system in a PVM-Linux cluster.
</description>
<pubDate>Mon, 01 Jan 2001 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9414</guid>
<dc:date>2001-01-01T00:00:00Z</dc:date>
<dc:description>Our efforts are directed towards the understanding of the coscheduling mechanism in a NOW system when a parallel job is executed jointly with local workloads, balancing parallel perfor-mance against the local interactive response. Explicit and implicit coscheduling techniques in a PVM-Linux NOW (or cluster) have been implemented. Furthermore, dynamic coscheduling remains an open question when parallel jobs are executed in a non-dedicated Cluster. A basis model for dynamic coscheduling in Cluster systems is presented in this paper. Also, one dynamic coscheduling algorithm for this model is proposed. The applicability of this algorithm has been proved and its performance ana-lyzed by simulation. Finally, a new tool (named Monito) for monitoring the different queues of messages in such an environments is presented. The main aim of implementing this facility is to provide a mean of capturing the bottlenecks and overheads of the communication system in a PVM-Linux cluster.</dc:description>
</item>
</channel>
</rss>
