http://sedici.unlp.edu.ar:80/handle/10915/183296 2026-07-14T07:41:33Z 2026-07-14T07:41:33Z Barbuto, Gabriel Grassi, Juan Pablo Traverso, Patricia http://sedici.unlp.edu.ar:80/handle/10915/190577 2026-02-18T20:13:20Z 2003-01-01T00:00:00Z

Objeto de conferencia Trabajos Estudiantiles (EST 2003) - JAIIO 32 (CABA, 1º al 5 de septiembre de 2003) En este artículo explicaremos brevemente que es un protocolo RPC, mencionaremos los diferentes protocolos RPC disponibles en la actualidad, para así luego poder discutir el protocolo elegido por nosotros para la implementación de un servicio de Binder de RPC para el sistema operativo Minix. Luego, se mostrarán detalles de la implementación del servicio de Binder que se ha realizado, y se mostrará una corrida de prueba obtenida a partir de la utilización de una herramienta de consulta que se creo durante el proyecto. Finalmente, se presentarán conclusiones derivadas de los resultados del trabajo.

2003-01-01T00:00:00Z En este artículo explicaremos brevemente que es un protocolo RPC, mencionaremos los diferentes protocolos RPC disponibles en la actualidad, para así luego poder discutir el protocolo elegido por nosotros para la implementación de un servicio de Binder de RPC para el sistema operativo Minix. Luego, se mostrarán detalles de la implementación del servicio de Binder que se ha realizado, y se mostrará una corrida de prueba obtenida a partir de la utilización de una herramienta de consulta que se creo durante el proyecto. Finalmente, se presentarán conclusiones derivadas de los resultados del trabajo. O'Sullivan, Maureen http://sedici.unlp.edu.ar:80/handle/10915/190574 2026-02-18T20:13:18Z 2003-01-01T00:00:00Z

Objeto de conferencia Jornadas sobre Software Libre (JSL 2003) - JAIIO 32 (CABA, 1º al 5 de septiembre de 2003) This paper talks about the free-proprietary-free software development cycle over the past 30 years, dealing with the introduction of copyright law and the dubious economics of software piracy. It shows that free software continued to exist, despite the onslaught of copyright’s strictures. Free software and open source are defined and distinguished and their various licensing schemes discussed. The most popular free and open source software licence, the GNU GPL is analysed, both from legal and socio-legal perspectives. Latin America’s initiative on free software, initiated by groups such as Fundación Vía Libre, Software Livre and the Free Software Consortium is at a crucial point – while several proposals to promote free software in governments in the region have been made, so far they have only been passed at state level in Brazil. Success in other jurisdictions, however, is likely to follow in time due to the commitment and persistence of the aforementioned groups. An outstanding issue which also needs to be addressed in Latin America and, indeed the world over, is how best to legislate so that the licensing schemes are protected or preferably enshrined in statutory form.

2003-01-01T00:00:00Z This paper talks about the free-proprietary-free software development cycle over the past 30 years, dealing with the introduction of copyright law and the dubious economics of software piracy. It shows that free software continued to exist, despite the onslaught of copyright’s strictures. Free software and open source are defined and distinguished and their various licensing schemes discussed. The most popular free and open source software licence, the GNU GPL is analysed, both from legal and socio-legal perspectives. Latin America’s initiative on free software, initiated by groups such as Fundación Vía Libre, Software Livre and the Free Software Consortium is at a crucial point – while several proposals to promote free software in governments in the region have been made, so far they have only been passed at state level in Brazil. Success in other jurisdictions, however, is likely to follow in time due to the commitment and persistence of the aforementioned groups. An outstanding issue which also needs to be addressed in Latin America and, indeed the world over, is how best to legislate so that the licensing schemes are protected or preferably enshrined in statutory form. Alia de Saravia, Dolores Saravia, Luis R. Saravia, Diego http://sedici.unlp.edu.ar:80/handle/10915/185786 2025-10-09T20:10:03Z 2003-01-01T00:00:00Z

Objeto de conferencia Jornadas sobre Software Libre (JSL 2003) - JAIIO 32 (CABA, 1 al 5 de septiembre de 2003) This paper shows how two specific programs Sceptre and Dia have been used to develop Simusol, a tool for simulating thermal systems. The thermal system must be outlined with Dia which has to be extended with a specially prepared thermal circuit sheet. The resulting XML Dia-file is translated, by Simusol, into several text files, one of them with input data for Sceptre to simulate the system. Using output from Sceptre, Simusol prepares text files with input data for Gnuplot to represent results. So, in some sense, Simusol converts graphics to code to simulate de system. All the used software, Simusol included, is free; most of it distributed under the GPL license: GNU/Linux, Dia —which works with XML and SVG files—, Sceptre, Perl, f2c, gcc and Gnuplot.

2003-01-01T00:00:00Z This paper shows how two specific programs Sceptre and Dia have been used to develop Simusol, a tool for simulating thermal systems. The thermal system must be outlined with Dia which has to be extended with a specially prepared thermal circuit sheet. The resulting XML Dia-file is translated, by Simusol, into several text files, one of them with input data for Sceptre to simulate the system. Using output from Sceptre, Simusol prepares text files with input data for Gnuplot to represent results. So, in some sense, Simusol converts graphics to code to simulate de system. All the used software, Simusol included, is free; most of it distributed under the GPL license: GNU/Linux, Dia —which works with XML and SVG files—, Sceptre, Perl, f2c, gcc and Gnuplot. Chaparro, Enrique A. http://sedici.unlp.edu.ar:80/handle/10915/185785 2025-10-09T20:10:03Z 2003-01-01T00:00:00Z

Objeto de conferencia Jornadas sobre Software Libre (JSL 2003) - JAIIO 32 (CABA, 1 al 5 de septiembre de 2003) Este trabajo contribuye a la discusión sobre la seguridad del software libre, procurando determinar si sus características singulares de disponibilidad universal del código fuente y de desarrollo colaborativo influyen positiva o negativamente en su fiabilidad respecto del software privativo. Se demuestra que, con base en los supuestos estándar de la teoría de crecimiento de la fiabilidad, los programas libres pueden alcanzar un nivel de fiabilidad no inferior al de los privativos, y convergen mucho más rápidamente hacia un estado "cero bugs”. Se establecen las restricciones de los modelos empleados, y se analiza la influencia que circunstancias de índole práctica tienen en la fiabilidad del software. Se concluye que, en términos generales, el software libre es potencialmente más seguro que el propietario bajo condiciones reales, y se formulan algunas cuestiones aún abiertas a la investigación.

2003-01-01T00:00:00Z Este trabajo contribuye a la discusión sobre la seguridad del software libre, procurando determinar si sus características singulares de disponibilidad universal del código fuente y de desarrollo colaborativo influyen positiva o negativamente en su fiabilidad respecto del software privativo. Se demuestra que, con base en los supuestos estándar de la teoría de crecimiento de la fiabilidad, los programas libres pueden alcanzar un nivel de fiabilidad no inferior al de los privativos, y convergen mucho más rápidamente hacia un estado "cero bugs”. Se establecen las restricciones de los modelos empleados, y se analiza la influencia que circunstancias de índole práctica tienen en la fiabilidad del software. Se concluye que, en términos generales, el software libre es potencialmente más seguro que el propietario bajo condiciones reales, y se formulan algunas cuestiones aún abiertas a la investigación. Imada, Akira http://sedici.unlp.edu.ar:80/handle/10915/185600 2025-10-07T20:10:10Z 2003-01-01T00:00:00Z

Objeto de conferencia Simposio Argentino de Inteligencia Artificial (ASAI 2003)- JAIIO 32 (CABA, 1 al 5 de septiembre de 2003) We simulate an associative memory model using spiking neurons instead of McCulloch-Pitts neurons. To store a set of patterns, we employ a Hebbian-like learning algorithm. The learning behavior, however, is somewhat of a different one of the traditional Hopfield model. To study the difference we explore the fitness landscape defined on synaptic weights space when they evolve searching for the optimal learning.

2003-01-01T00:00:00Z We simulate an associative memory model using spiking neurons instead of McCulloch-Pitts neurons. To store a set of patterns, we employ a Hebbian-like learning algorithm. The learning behavior, however, is somewhat of a different one of the traditional Hopfield model. To study the difference we explore the fitness landscape defined on synaptic weights space when they evolve searching for the optimal learning. Abdala, Gabriel Baigorria, Lorena Danielle, Marcelo Gil Costa, Verónica Kasian, Fernando Lopresti, Mariela Lucero, Walter Mendoza, Cristián Miranda, Natalia Zanabria, Gustavo http://sedici.unlp.edu.ar:80/handle/10915/185438 2025-10-02T20:09:54Z 2003-01-01T00:00:00Z

Objeto de conferencia Trabajos Estudiantiles (EST 2003) - JAIIO 32 (CABA, 1 al 5 de septiembre de 2003) El envío de documentos a través de medios electrónicos es una práctica frecuente en diversas actividades y se ve afectada por la presencia de agentes externos que, accidental o maliciosamente, atentan contra su seguridad e integridad. La firma digital de documentos electrónicos tiene como objetivo garantizar la procedencia y la autenticidad del mismo, debido a que los medios y mecanismos de envío de uso masivo no lo garantizan.

2003-01-01T00:00:00Z El envío de documentos a través de medios electrónicos es una práctica frecuente en diversas actividades y se ve afectada por la presencia de agentes externos que, accidental o maliciosamente, atentan contra su seguridad e integridad. La firma digital de documentos electrónicos tiene como objetivo garantizar la procedencia y la autenticidad del mismo, debido a que los medios y mecanismos de envío de uso masivo no lo garantizan. Villegas Bautista, José Antonio http://sedici.unlp.edu.ar:80/handle/10915/185345 2025-10-01T20:10:00Z 2003-01-01T00:00:00Z

Objeto de conferencia Trabajos Estudiantiles (EST 2003) - JAIIO 32 (CABA, 1 al 5 de septiembre de 2003) En este trabajo primero definimos formalmente qué es la criptografía y sus principales metas. Se implementa el esquema de clave simétrica por sustitución polialfabética; nuestra tarea es la de interpretar los archivos como sucesiones finitas de números del conjunto {0,...,255}, representar en archivos las permutaciones de ese conjunto y proceder con estas estructuras a la encriptación y desencriptación. Seguidamente con modelos matemáticos más firmes definimos esquemas de clave pública; aquí se necesita una implementación de una aritmética de números grandes, definir algoritmos sobre estas estructuras de datos, principalmente para probar la primalidad de grandes números impares. Así con una interpretación de archivos de cualquier tipo en sucesiones finitas de números grandes, podemos aplicar el esquema RSA, encriptando y desencriptando. Siguiendo el mismo patrón, firmamos cualquier tipo de archivos, resumiéndolos mediante una función hash, y recién aplicamos el DSA. Se implementan los algoritmos de firmado y verificación. Con todo esto tenemos asegurados los cuatro postulados de la seguridad de la información que se buscan con la criptografía: confidencialidad, integridad de los datos, autentificación del ente y del origen de datos, y desconocimiento o no repudio.

2003-01-01T00:00:00Z En este trabajo primero definimos formalmente qué es la criptografía y sus principales metas. Se implementa el esquema de clave simétrica por sustitución polialfabética; nuestra tarea es la de interpretar los archivos como sucesiones finitas de números del conjunto {0,...,255}, representar en archivos las permutaciones de ese conjunto y proceder con estas estructuras a la encriptación y desencriptación. Seguidamente con modelos matemáticos más firmes definimos esquemas de clave pública; aquí se necesita una implementación de una aritmética de números grandes, definir algoritmos sobre estas estructuras de datos, principalmente para probar la primalidad de grandes números impares. Así con una interpretación de archivos de cualquier tipo en sucesiones finitas de números grandes, podemos aplicar el esquema RSA, encriptando y desencriptando. Siguiendo el mismo patrón, firmamos cualquier tipo de archivos, resumiéndolos mediante una función hash, y recién aplicamos el DSA. Se implementan los algoritmos de firmado y verificación. Con todo esto tenemos asegurados los cuatro postulados de la seguridad de la información que se buscan con la criptografía: confidencialidad, integridad de los datos, autentificación del ente y del origen de datos, y desconocimiento o no repudio. Huapaya, Constanza R. Arona, Graciela M. Lizarralde, Francisco A. http://sedici.unlp.edu.ar:80/handle/10915/185221 2025-09-29T20:09:47Z 2003-01-01T00:00:00Z

Objeto de conferencia Simposio Argentino de Inteligencia Artificial (ASAI 2003)- JAIIO 32 (CABA, 1 al 5 de septiembre de 2003) Our long term aim is to reach an easily available, flexible and complete instructor model of an Intelligent Tutoring System. In order to get our objective, we propose a new instructor model where intentions of actual instructors are shaped into adaptive tutoring strategies. The key idea involves an instructor acting as she if was a knowledge engineer, proposing goals and softgoals, and choosing resources and tasks in order to reach them through an ITS. We present a preliminary conceptual approach to an explicit instructor model. When an author/instructor delivers to system her personal experience, ITS captures these individual features. Each instance of the model would be an instructor with a clear profile acting according to specific behavior. So, a student would choose a personal instructor that matches better her learning style.

2003-01-01T00:00:00Z Our long term aim is to reach an easily available, flexible and complete instructor model of an Intelligent Tutoring System. In order to get our objective, we propose a new instructor model where intentions of actual instructors are shaped into adaptive tutoring strategies. The key idea involves an instructor acting as she if was a knowledge engineer, proposing goals and softgoals, and choosing resources and tasks in order to reach them through an ITS. We present a preliminary conceptual approach to an explicit instructor model. When an author/instructor delivers to system her personal experience, ITS captures these individual features. Each instance of the model would be an instructor with a clear profile acting according to specific behavior. So, a student would choose a personal instructor that matches better her learning style. Schiaffino, Silvia Amandi, Analía http://sedici.unlp.edu.ar:80/handle/10915/185220 2025-09-29T20:09:48Z 2003-01-01T00:00:00Z

Objeto de conferencia Simposio Argentino de Inteligencia Artificial (ASAI 2003)- JAIIO 32 (CABA, 1 al 5 de septiembre de 2003) Interface agents are computer programs that learn users’ preferences to provide them personalized assistance with their computer-based tasks. In order to personalize the interaction with users, interface agents must learn how to best interact with each user and how to provide them assistance of the right sort at the right time. Particularly, an interface agent has to discover when the user needs a suggestion to solve a problem, when he requires only a warning about it, when he wants the agent to execute an action and when he wants the agent to do just nothing. In this work we propose a learning algorithm, named WATSON, to tackle this problem. The WATSON algorithm enables an interface agent to adapt its behavior and its interaction with a user to the user’s assistance requirements. Our algorithm uses association rules to discover associations among problem situations and a user’s assistance requirements in a given application domain.

2003-01-01T00:00:00Z Interface agents are computer programs that learn users’ preferences to provide them personalized assistance with their computer-based tasks. In order to personalize the interaction with users, interface agents must learn how to best interact with each user and how to provide them assistance of the right sort at the right time. Particularly, an interface agent has to discover when the user needs a suggestion to solve a problem, when he requires only a warning about it, when he wants the agent to execute an action and when he wants the agent to do just nothing. In this work we propose a learning algorithm, named WATSON, to tackle this problem. The WATSON algorithm enables an interface agent to adapt its behavior and its interaction with a user to the user’s assistance requirements. Our algorithm uses association rules to discover associations among problem situations and a user’s assistance requirements in a given application domain. Araya, Juan Francisco Cipriano, Aldo http://sedici.unlp.edu.ar:80/handle/10915/185218 2025-09-29T20:09:48Z 2003-01-01T00:00:00Z

Objeto de conferencia Simposio Argentino de Inteligencia Artificial (ASAI 2003)- JAIIO 32 (CABA, 1 al 5 de septiembre de 2003) In this paper, a parameter estimation problem for a Takagi-Sugeno (TS) fuzzy dynamical system is formulated under the assumption that the premises in the membership functions are known. A linear expression in consequent parameters is obtained under this assumption. If the system is timevarying (TV), the parameters can be determined by recursive estimation techniques. As an alternate approach, the use of multi-resolution wavelets is proposed. Furthermore, a parameter estimation toolbox for fuzzy dynamical models is developed which is then applied to a simple example and to the Mackey-Glass chaotic time series.

2003-01-01T00:00:00Z In this paper, a parameter estimation problem for a Takagi-Sugeno (TS) fuzzy dynamical system is formulated under the assumption that the premises in the membership functions are known. A linear expression in consequent parameters is obtained under this assumption. If the system is timevarying (TV), the parameters can be determined by recursive estimation techniques. As an alternate approach, the use of multi-resolution wavelets is proposed. Furthermore, a parameter estimation toolbox for fuzzy dynamical models is developed which is then applied to a simple example and to the Mackey-Glass chaotic time series. Flores, Cecília Gluz, João Seixas, Louise Vicari, Rosa Coelho, Helder http://sedici.unlp.edu.ar:80/handle/10915/185217 2025-09-29T20:09:48Z 2003-01-01T00:00:00Z

Objeto de conferencia Simposio Argentino de Inteligencia Artificial (ASAI 2003)- JAIIO 32 (CABA, 1 al 5 de septiembre de 2003) AMPLIA is an Intelligent Learning Multi-Agent Environment. It is designed to support training of diagnostic reasoning and modeling of domains with complex and uncertain knowledge. AMPLIA focuses on the medical area, where learner’s modeling tasks will consist of creating a Bayesian network for a problem the system will present. A pedagogic negotiation process (managed by an intelligent Mediator Agent) will treat the differences of topology and probability distribution between the model the learner built and the one built-in in the system. That negotiation process occurs between the agents that represent the expert knowledge domain and the agent that represents the learner knowledge. The possibility of using Bayesian networks to create knowledge representation allows the learner to visualize his/her ideas organization, create and test hypothesis.

2003-01-01T00:00:00Z AMPLIA is an Intelligent Learning Multi-Agent Environment. It is designed to support training of diagnostic reasoning and modeling of domains with complex and uncertain knowledge. AMPLIA focuses on the medical area, where learner’s modeling tasks will consist of creating a Bayesian network for a problem the system will present. A pedagogic negotiation process (managed by an intelligent Mediator Agent) will treat the differences of topology and probability distribution between the model the learner built and the one built-in in the system. That negotiation process occurs between the agents that represent the expert knowledge domain and the agent that represents the learner knowledge. The possibility of using Bayesian networks to create knowledge representation allows the learner to visualize his/her ideas organization, create and test hypothesis. Cofman, Fernando Sáez, Doris Gómez, Juan C. http://sedici.unlp.edu.ar:80/handle/10915/185216 2025-09-29T20:09:49Z 2003-01-01T00:00:00Z

Objeto de conferencia Simposio Argentino de Inteligencia Artificial (ASAI 2003)- JAIIO 32 (CABA, 1 al 5 de septiembre de 2003) This paper presents the results of the implementation of Fuzzy PID control strategies on a complex, critically-stable system, namely the PID-Pong machine. Two different fuzzy algorithms are implemented in real-time and compared to a linear PID controller, used as the evaluation basis. Conclusions are established based on regulation, implementation and tuning indicators

2003-01-01T00:00:00Z This paper presents the results of the implementation of Fuzzy PID control strategies on a complex, critically-stable system, namely the PID-Pong machine. Two different fuzzy algorithms are implemented in real-time and compared to a linear PID controller, used as the evaluation basis. Conclusions are established based on regulation, implementation and tuning indicators Destéfanis, Eduardo A. Canali, Luis R. Steiner, Guillermo M. http://sedici.unlp.edu.ar:80/handle/10915/185214 2025-09-29T20:09:49Z 2003-01-01T00:00:00Z

Objeto de conferencia Simposio Argentino de Inteligencia Artificial (ASAI 2003)- JAIIO 32 (CABA, 1 al 5 de septiembre de 2003) The Hough Transform is a robust algorithm, intended to detect lines, circles or even more complex shapes within an image. A weakness of the algorithm is that it requires an important processing time, in particular if the shape to be detected is not a straight line. In many practical applications this constraint could not be acceptable. A solution to this problem has been called the Fast Hough Transform (FHT) -[8] and [5]. The FHT approaches addresses the problem using specialized parallel hardware. Instead of this, this paper proposes an algorithmic approach for circle detection, which yields an acceptable processing time, without the need of any specialized hardware. To reach this goal the inversion transform [2] is used.

2003-01-01T00:00:00Z The Hough Transform is a robust algorithm, intended to detect lines, circles or even more complex shapes within an image. A weakness of the algorithm is that it requires an important processing time, in particular if the shape to be detected is not a straight line. In many practical applications this constraint could not be acceptable. A solution to this problem has been called the Fast Hough Transform (FHT) -[8] and [5]. The FHT approaches addresses the problem using specialized parallel hardware. Instead of this, this paper proposes an algorithmic approach for circle detection, which yields an acceptable processing time, without the need of any specialized hardware. To reach this goal the inversion transform [2] is used. Katz, Román Delrieux, Claudio http://sedici.unlp.edu.ar:80/handle/10915/185212 2025-09-29T20:09:49Z 2003-01-01T00:00:00Z

Objeto de conferencia Simposio Argentino de Inteligencia Artificial (ASAI 2003)- JAIIO 32 (CABA, 1 al 5 de septiembre de 2003) In this work we present a robot path planning architecture based on Lee's routing algorithm. This algorithm was originally conceived to obtain minimal conductor nets among terminals on VLSI circuits. In our system it provides a simple and robust mechanism to compute near to shortest free paths in two-dimensional configuration environments. We incorporate this algorithm in a planning system, and the resulting architecture can be used to generate trajectories in order to guide a mobile agent from an initial point to a final (static or moving) position of the working space, avoiding not only static but also moving obstacles. The guidance engine is implemented as a rule-based version of Lee's algorithm, embedded in a multi-paradigm software system that performs logical inferences in a Prolog component, whose results are provided to an imperative and numerical processing compiled component. This allows a neat factorization of the functionality of the system: high level representation of the navigation algorithm is implemented through its logical formulation, and easy and natural means to acquire the layout of the environment with computer vision and image processing techniques is implemented via numerical programming. The same imperative approach is also natural to provide 2D or 3D visualization and simulation features to aid to understand the ongoing process. Thus, our architecture features both the speed and versatility of a visual language application, and the abstraction level and modularity of a logical description.

2003-01-01T00:00:00Z In this work we present a robot path planning architecture based on Lee's routing algorithm. This algorithm was originally conceived to obtain minimal conductor nets among terminals on VLSI circuits. In our system it provides a simple and robust mechanism to compute near to shortest free paths in two-dimensional configuration environments. We incorporate this algorithm in a planning system, and the resulting architecture can be used to generate trajectories in order to guide a mobile agent from an initial point to a final (static or moving) position of the working space, avoiding not only static but also moving obstacles. The guidance engine is implemented as a rule-based version of Lee's algorithm, embedded in a multi-paradigm software system that performs logical inferences in a Prolog component, whose results are provided to an imperative and numerical processing compiled component. This allows a neat factorization of the functionality of the system: high level representation of the navigation algorithm is implemented through its logical formulation, and easy and natural means to acquire the layout of the environment with computer vision and image processing techniques is implemented via numerical programming. The same imperative approach is also natural to provide 2D or 3D visualization and simulation features to aid to understand the ongoing process. Thus, our architecture features both the speed and versatility of a visual language application, and the abstraction level and modularity of a logical description. Tosini, Marcelo Alejandro http://sedici.unlp.edu.ar:80/handle/10915/185211 2025-09-29T20:09:50Z 2003-01-01T00:00:00Z

Objeto de conferencia Simposio Argentino de Inteligencia Artificial (ASAI 2003)- JAIIO 32 (CABA, 1 al 5 de septiembre de 2003) A design and development tool to achieve artificial neural networks (ANN) implemented in a Field Programmable Gate Array (FPGA), is presented in this article. Its main components and functionality are thoroughly described. This tool, called NNGen, allows constructing digital ANN, which are easily programmable selecting different parameters. The output of such programming task is directly VHDL code to be ported to, in principle, any chip of the mentioned kind. A case study of a multilayer perceptron applied to weather forecast that was fully designed with NNGen, is also analyzed to obtain some conclusions.

2003-01-01T00:00:00Z A design and development tool to achieve artificial neural networks (ANN) implemented in a Field Programmable Gate Array (FPGA), is presented in this article. Its main components and functionality are thoroughly described. This tool, called NNGen, allows constructing digital ANN, which are easily programmable selecting different parameters. The output of such programming task is directly VHDL code to be ported to, in principle, any chip of the mentioned kind. A case study of a multilayer perceptron applied to weather forecast that was fully designed with NNGen, is also analyzed to obtain some conclusions. Levrini, Aldo Cipriano, Aldo http://sedici.unlp.edu.ar:80/handle/10915/185210 2025-09-29T20:09:50Z 2003-01-01T00:00:00Z

Objeto de conferencia Simposio Argentino de Inteligencia Artificial (ASAI 2003)- JAIIO 32 (CABA, 1 al 5 de septiembre de 2003) This paper presents a comparison of three nonlinear models used for residual generation. The residual generation is part of a simple fault detection and diagnostics scheme applied to the Pendubot dynamic system operating in closed loop. The compared models are: Hammerstein, neural NARMAX, and Takagi-Sugeno Fuzzy models.

2003-01-01T00:00:00Z This paper presents a comparison of three nonlinear models used for residual generation. The residual generation is part of a simple fault detection and diagnostics scheme applied to the Pendubot dynamic system operating in closed loop. The compared models are: Hammerstein, neural NARMAX, and Takagi-Sugeno Fuzzy models. Katz, Román Delrieux, Claudio http://sedici.unlp.edu.ar:80/handle/10915/185209 2025-09-29T20:09:51Z 2003-01-01T00:00:00Z

Objeto de conferencia Simposio Argentino de Inteligencia Artificial (ASAI 2003)- JAIIO 32 (CABA, 1 al 5 de septiembre de 2003) Border extraction is an important procedure associated with recognition and interpretation tasks in digital image processing and computer vision. Since local processing schemes (i.e., spatial filltering) are not appropriate for border extraction in noisy images, global and intelligent mechanisms are required to deal with this situation. Some heuristic algorithms that apply jointly local operators and some kind of optimization criterion have been successfully applied to treat images corrupted by additive noise. However, the behavior of these mechanisms is considerably undermined when managing images with multiplicative (speckle) noise. In this paper we present a gradient-based evolutionary algorithm that can achieve convenient boundary extraction in digital images with additive noise, and that can be successfully extended to operate with non-additive noisy images as well.

2003-01-01T00:00:00Z Border extraction is an important procedure associated with recognition and interpretation tasks in digital image processing and computer vision. Since local processing schemes (i.e., spatial filltering) are not appropriate for border extraction in noisy images, global and intelligent mechanisms are required to deal with this situation. Some heuristic algorithms that apply jointly local operators and some kind of optimization criterion have been successfully applied to treat images corrupted by additive noise. However, the behavior of these mechanisms is considerably undermined when managing images with multiplicative (speckle) noise. In this paper we present a gradient-based evolutionary algorithm that can achieve convenient boundary extraction in digital images with additive noise, and that can be successfully extended to operate with non-additive noisy images as well. Pérez Santángelo, Hugo http://sedici.unlp.edu.ar:80/handle/10915/185208 2025-09-29T20:09:51Z 2003-01-01T00:00:00Z

Objeto de conferencia Simposio Argentino de Inteligencia Artificial (ASAI 2003)- JAIIO 32 (CABA, 1 al 5 de septiembre de 2003) The agents metaphor, expressed theoretically in the Distributed Artificial Intelligence field of Multi-Agent Systems, has been awakening the interest of the commercial software companies, because new emergent technologies like e-commerce follow the same metaphor from the consumer's perspective. Researchers in that field has been developing useful models that can be used to construct commercial servers, but the computational complexity problem and the lack of general models and architectures, sometimes make the technological transfer between researchers and commercial companies impracticable. State of the art is to put the focus on ontologies in order to create more general business models, but there are some software engineering issues related to the software construction that ontology does not cover. This paper offers a proposed solution to that problem, including conceptual aspects, and necessaries methods to model commercial Multi-Agent Systems, using fuzzy logic and evolutionary algorithms.

2003-01-01T00:00:00Z The agents metaphor, expressed theoretically in the Distributed Artificial Intelligence field of Multi-Agent Systems, has been awakening the interest of the commercial software companies, because new emergent technologies like e-commerce follow the same metaphor from the consumer's perspective. Researchers in that field has been developing useful models that can be used to construct commercial servers, but the computational complexity problem and the lack of general models and architectures, sometimes make the technological transfer between researchers and commercial companies impracticable. State of the art is to put the focus on ontologies in order to create more general business models, but there are some software engineering issues related to the software construction that ontology does not cover. This paper offers a proposed solution to that problem, including conceptual aspects, and necessaries methods to model commercial Multi-Agent Systems, using fuzzy logic and evolutionary algorithms. Wong, Felix McGovern, Jim Fernandez, George http://sedici.unlp.edu.ar:80/handle/10915/185118 2025-09-26T20:10:00Z 2003-01-01T00:00:00Z

Objeto de conferencia Simposio Argentino de Ingeniería de Software (ASSE 2003) - JAIIO 32 (CABA, 1 al 5 de septiembre de 2003) An important part of software engineering is the collaborative development of artefacts, such as requirements analysis and design documents. Software engineers can independently work on parts of software engineering documents, but they will often need to work closely with other software engineers and domain experts developing and refining these documents. The Internet and distributed computing tools allow geographically separated stakeholders to participate in the software engineering process, not only asynchronously, but also synchronously in realtime. Real time collaboration for software engineering is technically challenging, requiring support for concurrent editing of text and diagrams. This paper describes a replicated architecture, where copies of software engineering documents are kept at each participating site. While this architecture provides reliability, fast local response, and supports a high level of concurrency, maintaining consistency among copies, in the face of network latency and conflicting operations from independent team members, is a difficult task. Conflicts in software engineering analysis and design are often an indication of a need for further investigation, and are best resolved by discussion between stakeholders rather than by automatic and arbitrary actions. This project proposes a scheme to support the management and resolution of these conflicts, and demonstrates its correctness in a simulation environment.

2003-01-01T00:00:00Z An important part of software engineering is the collaborative development of artefacts, such as requirements analysis and design documents. Software engineers can independently work on parts of software engineering documents, but they will often need to work closely with other software engineers and domain experts developing and refining these documents. The Internet and distributed computing tools allow geographically separated stakeholders to participate in the software engineering process, not only asynchronously, but also synchronously in realtime. Real time collaboration for software engineering is technically challenging, requiring support for concurrent editing of text and diagrams. This paper describes a replicated architecture, where copies of software engineering documents are kept at each participating site. While this architecture provides reliability, fast local response, and supports a high level of concurrency, maintaining consistency among copies, in the face of network latency and conflicting operations from independent team members, is a difficult task. Conflicts in software engineering analysis and design are often an indication of a need for further investigation, and are best resolved by discussion between stakeholders rather than by automatic and arbitrary actions. This project proposes a scheme to support the management and resolution of these conflicts, and demonstrates its correctness in a simulation environment. Soares Xavier, Maria Ester Varejão, Flávio Miguel http://sedici.unlp.edu.ar:80/handle/10915/185108 2025-09-25T20:10:21Z 2003-01-01T00:00:00Z

Objeto de conferencia Simposio Argentino de Inteligencia Artificial (ASAI 2003)- JAIIO 32 (CABA, 1 al 5 de septiembre de 2003) In this work we present an extension of the parametric network representation language used by Active Documents models. The extension incorporates a new kind of parameter to the representation language. This new kind of parameter enables the reuse of a task-especific library of problem solving components implementing automatic search in Active Documents Systems. In order to illustrate the use of this new parameter, the Hill Climbing, Propose and Backtracking, Complete the Model Then Revise and Extend The Model Then Revise methods were implemented. These methods were used for solving an office allocation problem. The knowledge modeling technique used here allows the knowledge engineer to configure new methods using the library components. The knowledge engineer can also include new components to the library

2003-01-01T00:00:00Z In this work we present an extension of the parametric network representation language used by Active Documents models. The extension incorporates a new kind of parameter to the representation language. This new kind of parameter enables the reuse of a task-especific library of problem solving components implementing automatic search in Active Documents Systems. In order to illustrate the use of this new parameter, the Hill Climbing, Propose and Backtracking, Complete the Model Then Revise and Extend The Model Then Revise methods were implemented. These methods were used for solving an office allocation problem. The knowledge modeling technique used here allows the knowledge engineer to configure new methods using the library components. The knowledge engineer can also include new components to the library