<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Volumen 02</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/134719</link>
<description/>
<pubDate>Thu, 19 Nov 2026 04:54:04 GMT</pubDate>
<dc:date>2026-11-19T04:54:04Z</dc:date>
<item>
<title>Discrete events cellular models with explicit delays</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/134883</link>
<description>Revision
Electronic Journal of SADIO; vol. 2
This work is devoted to introduce several formal descriptions used to model and simúlate cell-shaped spaces. The paradigms are based on the DEVS and Cellular Autómata formalisms, combined with transport delays and inertial delays. The speciñcation formalisms have been deñned for binary or three-states cell spaces, and have been extended to other domains. The delay concepts belong to the digital circuits domain, and have been adapted to the Cellular Autómata paradigm, being one of the main contributions of the present work. The formalims allow the automatic deñnition for the cell spaces, easing the model veriñcation, allowing the cost-effective development of simulators. A tool was built with the goal to implement the formalism, allowing to verify em- pirically the performance of the proposed Solutions.
</description>
<pubDate>Fri, 01 Jan 1999 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/134883</guid>
<dc:date>1999-01-01T00:00:00Z</dc:date>
<dc:description>This work is devoted to introduce several formal descriptions used to model and simúlate cell-shaped spaces. The paradigms are based on the DEVS and Cellular Autómata formalisms, combined with transport delays and inertial delays. The speciñcation formalisms have been deñned for binary or three-states cell spaces, and have been extended to other domains. The delay concepts belong to the digital circuits domain, and have been adapted to the Cellular Autómata paradigm, being one of the main contributions of the present work. The formalims allow the automatic deñnition for the cell spaces, easing the model veriñcation, allowing the cost-effective development of simulators. A tool was built with the goal to implement the formalism, allowing to verify em- pirically the performance of the proposed Solutions.</dc:description>
</item>
<item>
<title>Approximate text searching</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/134881</link>
<description>Revision
Electronic Journal of SADIO; vol. 2
This thesis focuses on the problem of text retrieval allowing errors, also called “approximate” string matching. The problem is to ñnd a pattern in a text, where the pattern and the text may have “errors”. This problem has received a lot of attention in recent years because of its applications in many areas, such as information retrieval, computational biology and signal processing, to ñame a few. The aim of this work is the development and analysis of novel algorithms to deal with the problem under various conditions, as well as a better understanding of the problem itself and its statistical behavior. Although our results are valid in many different areas, we focus our attention on typical text searching for information retrieval applications. This makes some ranges of valúes for the parameters of the problem more interesting than others.
</description>
<pubDate>Fri, 01 Jan 1999 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/134881</guid>
<dc:date>1999-01-01T00:00:00Z</dc:date>
<dc:description>This thesis focuses on the problem of text retrieval allowing errors, also called “approximate” string matching. The problem is to ñnd a pattern in a text, where the pattern and the text may have “errors”. This problem has received a lot of attention in recent years because of its applications in many areas, such as information retrieval, computational biology and signal processing, to ñame a few. The aim of this work is the development and analysis of novel algorithms to deal with the problem under various conditions, as well as a better understanding of the problem itself and its statistical behavior. Although our results are valid in many different areas, we focus our attention on typical text searching for information retrieval applications. This makes some ranges of valúes for the parameters of the problem more interesting than others.</dc:description>
</item>
<item>
<title>Defeasible Temporal Reasoning</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/134880</link>
<description>Revision
Electronic Journal of SADIO; vol. 2
This work is involved with the confluence of two areas of artiñcial intelligence (AI) called “defeasible reasoning” and “temporal reasoning”. The work can be briefly described as the extensión of a particular kind of defeasible reasoning systems, called “argumentative systems”, to allow them to use temporal references. The importance of this study is given by the intensive usefulness of temporal concepts in Computer sience. At the same time there are several areas in AI where time plays a fundamental role. Since the goal is to capture human abilities in solving problems, to consider temporal concepts is unavoidable. An intelligent agent makes a decisive use of temporal references in its communica- tion and its deductive processes. For example, in natural language written text comprehension, medical diagnosis elaboration, faults detection and in planning systems for industrial applications or robots.
</description>
<pubDate>Fri, 01 Jan 1999 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/134880</guid>
<dc:date>1999-01-01T00:00:00Z</dc:date>
<dc:description>This work is involved with the confluence of two areas of artiñcial intelligence (AI) called “defeasible reasoning” and “temporal reasoning”. The work can be briefly described as the extensión of a particular kind of defeasible reasoning systems, called “argumentative systems”, to allow them to use temporal references. The importance of this study is given by the intensive usefulness of temporal concepts in Computer sience. At the same time there are several areas in AI where time plays a fundamental role. Since the goal is to capture human abilities in solving problems, to consider temporal concepts is unavoidable. An intelligent agent makes a decisive use of temporal references in its communica- tion and its deductive processes. For example, in natural language written text comprehension, medical diagnosis elaboration, faults detection and in planning systems for industrial applications or robots.</dc:description>
</item>
<item>
<title>Trampa en el Cyberespacio</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/134879</link>
<description>Articulo
Electronic Journal of SADIO; vol. 2
Durante las últimas vacaciones de Navidad me he quedado asombradísimo con la fascinación creciente de los medios de comunicación por ese oscuro objeto del deseo que se oculta detrás de las palabras “ordenador”, “multimedia”, “web”, “internet” y sus derivados. Si uno creyera a esos medios de comunicación y a un buen número de expertos improvisados, no se podría pretender ser un ciudadano de primera clase sin poseer el ultimísimo (y muy caro) material informático que da acceso al paraíso encantado del “cyberespacio”. Es también difícil ignorar la omnipresente y extraña confusión que nos incita a pensar que el único tipo existente de ordenador es el PC, por supuesto equipado con un chip de Intel, y que en ese PC sólo puede haber un programa indispensable, Microsoft Windows.
</description>
<pubDate>Fri, 01 Jan 1999 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/134879</guid>
<dc:date>1999-01-01T00:00:00Z</dc:date>
<dc:description>Durante las últimas vacaciones de Navidad me he quedado asombradísimo con la fascinación creciente de los medios de comunicación por ese oscuro objeto del deseo que se oculta detrás de las palabras “ordenador”, “multimedia”, “web”, “internet” y sus derivados. Si uno creyera a esos medios de comunicación y a un buen número de expertos improvisados, no se podría pretender ser un ciudadano de primera clase sin poseer el ultimísimo (y muy caro) material informático que da acceso al paraíso encantado del “cyberespacio”. Es también difícil ignorar la omnipresente y extraña confusión que nos incita a pensar que el único tipo existente de ordenador es el PC, por supuesto equipado con un chip de Intel, y que en ese PC sólo puede haber un programa indispensable, Microsoft Windows.</dc:description>
</item>
<item>
<title>Mediators Metadata Management Services: An Implementation Using GOA++ System</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/134876</link>
<description>Articulo
Electronic Journal of SADIO; vol. 2
The main contribution of this work is the development of a Metadata Manager to interconnect heterogeneous and autonomous information sources in a flexible, expandable and transparent way. The interoperability at the semantic level is reached using an integration layer, structured in a hierarchical way, based on the concept of Mediators. Services of a Mediator Metadata Manager (MMM) are specified and implemented using functions based on the Outlines of GOA++. The MMM services e are available in the form of a GOA++ API and they can be accessed remotely via CORBA or through local API calls.
</description>
<pubDate>Fri, 01 Jan 1999 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/134876</guid>
<dc:date>1999-01-01T00:00:00Z</dc:date>
<dc:description>The main contribution of this work is the development of a Metadata Manager to interconnect heterogeneous and autonomous information sources in a flexible, expandable and transparent way. The interoperability at the semantic level is reached using an integration layer, structured in a hierarchical way, based on the concept of Mediators. Services of a Mediator Metadata Manager (MMM) are specified and implemented using functions based on the Outlines of GOA++. The MMM services e are available in the form of a GOA++ API and they can be accessed remotely via CORBA or through local API calls.</dc:description>
</item>
<item>
<title>Reifying Design Patterns as Metalevel Constructs</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/134875</link>
<description>Articulo
Electronic Journal of SADIO; vol. 2
A design pattern describes a structure of communicating components that solves a commonly occurring design problem. Designing with patterns offers the possibility of raising the abstraction level at which design is performed, with improvements in clarity, understanding, and facility of maintenance of applications. However, in their most common presentation, design patterns are informal pieces of design process, which application is not reflected in the operational system, and the potential advantages of a more principled design are not realized. This work proposes to organize design in such a way that pattern applications remain explicit in the operational systems. A reflective architecture is proposed, where patterns are reified as metalevel constructs.
</description>
<pubDate>Fri, 01 Jan 1999 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/134875</guid>
<dc:date>1999-01-01T00:00:00Z</dc:date>
<dc:description>A design pattern describes a structure of communicating components that solves a commonly occurring design problem. Designing with patterns offers the possibility of raising the abstraction level at which design is performed, with improvements in clarity, understanding, and facility of maintenance of applications. However, in their most common presentation, design patterns are informal pieces of design process, which application is not reflected in the operational system, and the potential advantages of a more principled design are not realized. This work proposes to organize design in such a way that pattern applications remain explicit in the operational systems. A reflective architecture is proposed, where patterns are reified as metalevel constructs.</dc:description>
</item>
<item>
<title>Object-Agent Oriented Programming</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/134873</link>
<description>Articulo
Electronic Journal of SADIO; vol. 2
Object-oriented programming has been used for building intelligent agents, with the limitation it cannot represent complex mental attitudes. With logic programming it is possible to represent and infer relationships among mental attitudes such as intentions, goals and beliefs, with limitations in the usage of capabilities of action. This paper presents two alternatives for integrating object- oriented with logic programming, which enable agent programming. Java and Smalltalk have been used for providing one typed and another non-typed integration with Prolog.
</description>
<pubDate>Fri, 01 Jan 1999 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/134873</guid>
<dc:date>1999-01-01T00:00:00Z</dc:date>
<dc:description>Object-oriented programming has been used for building intelligent agents, with the limitation it cannot represent complex mental attitudes. With logic programming it is possible to represent and infer relationships among mental attitudes such as intentions, goals and beliefs, with limitations in the usage of capabilities of action. This paper presents two alternatives for integrating object- oriented with logic programming, which enable agent programming. Java and Smalltalk have been used for providing one typed and another non-typed integration with Prolog.</dc:description>
</item>
<item>
<title>Epidemics with two levels of mixing: The exact moments</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/134871</link>
<description>Articulo
Electronic Journal of SADIO; vol. 2
The probabilities [fórmula] occur in an epidemics model. It is demonstrated how one can compute the moments.
</description>
<pubDate>Fri, 01 Jan 1999 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/134871</guid>
<dc:date>1999-01-01T00:00:00Z</dc:date>
<dc:description>The probabilities [fórmula] occur in an epidemics model. It is demonstrated how one can compute the moments.</dc:description>
</item>
</channel>
</rss>
