García, Alejandro Javier
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
Chesñevar, Carlos Iván
This paper summarizes the main results developed in the author's PhD Thesis.
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.
Thomas, Pablo Javier
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.
This book intends to provide the state of the art material on techniques, methods, and tools for the elicitation, representation and validation of requirements.
De Giusti, Marisa Raquel
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.
Gallard, Raúl Hector; Esquivel, Susana Cecilia
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...
García, Pablo S.; Silva, Omar E.; Ardenghi, Jorge Raúl
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.
Naiouf, Marcelo; Tarrío, Diego F.; De Giusti, Armando Eduardo; De Giusti, Laura Cristina
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...
Gagliardi, Edilma Olinda; Herrera, Norma Edith; Reyes, Nora Susana; Turull Torres, José María
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...
Murta Vale, María Helena; Silveira, Humberto de Aquino; Visacro Filho, Silvério; Matsumoto Sato, Liria
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,...
Valente, Marco Tulio; Silva, Mariza Bigonha Andrade da; Silva, Roberto Bigonha da
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.
Gutiérrez Llorente, José Manuel; Ivanissevich, María Laura; Cofiño, Antonio S.
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...
Stegmayer Machado, Georgina S.; Taverna, María Laura; Chiotti, Omar Juan Alfredo; Galli, María Rosa
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...
Simari, Guillermo Ricardo; Falappa, Marcelo Alejandro
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...
Solsona Theás, Francesc; Giné de Solà, Francesc; Hernández Budé, Porfidio; Luque Fadón, Emilio
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...