<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Volumen 05 | Número 04</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/390</link>
<description/>
<pubDate>Wed, 18 Nov 2026 21:42:45 GMT</pubDate>
<dc:date>2026-11-18T21:42:45Z</dc:date>
<item>
<title>Definition of a goal elicitation process</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9615</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 5, no. 4
Requirement Engineering plays an essential role at the initial stage in the software development life cycle. This discipline entails three processes: Requirements Elicitation, Specification and Validation. Elicitation has, as a primary goal, the knowledge acquisition over a problem domain. In order to do this, different techniques are applied according to the kind of information to be elicited and the time and resources available for the analyst. One of the most important techniques is Goal Analysis. It was established, once analysed the most important approaches as far as use is concerned (GBRAM, KAOS, Softgoals, Ideas, Rolland, Loucopoulos) that those approaches lack a Goal Elicitation Process, in other words, they lack a methodology that shows clearly what are to be made to obtain Goals. This Thesis proposes a process to elicit Goals based on Annie Antón's approach (GBRAM) from Scenarios applying the schema proposed by Julio Leite. To do this 12 rules were defined which, applied to Scenario elements, allow us to obtain the goal elements with GBRAM schema.
Dossier: Resumen de la tesis presentada por el autor para la obtención del título de Magister en Ingeniería de Software (UNLP) en al 2005.; Es revisión de: http://sedici.unlp.edu.ar/handle/10915/4084
</description>
<pubDate>Thu, 01 Dec 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9615</guid>
<dc:date>2005-12-01T00:00:00Z</dc:date>
<dc:description>Requirement Engineering plays an essential role at the initial stage in the software development life cycle. This discipline entails three processes: Requirements Elicitation, Specification and Validation. Elicitation has, as a primary goal, the knowledge acquisition over a problem domain. In order to do this, different techniques are applied according to the kind of information to be elicited and the time and resources available for the analyst. One of the most important techniques is Goal Analysis. It was established, once analysed the most important approaches as far as use is concerned (GBRAM, KAOS, Softgoals, Ideas, Rolland, Loucopoulos) that those approaches lack a Goal Elicitation Process, in other words, they lack a methodology that shows clearly what are to be made to obtain Goals. This Thesis proposes a process to elicit Goals based on Annie Antón's approach (GBRAM) from Scenarios applying the schema proposed by Julio Leite. To do this 12 rules were defined which, applied to Scenario elements, allow us to obtain the goal elements with GBRAM schema.</dc:description>
</item>
<item>
<title>&lt;i&gt;Grid computing: A practical guide to technology and applications&lt;/i&gt;. Ahmar Abbas: Charles River Media Inc, 2004</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9614</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 5, no. 4
The book is useful as a comprehensive introduction, covering many application areas. Grid technology and its applications are clearly presented, but require some background on Operating Systems, Concurrent Programming and Communication Networks.
</description>
<pubDate>Thu, 01 Dec 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9614</guid>
<dc:date>2005-12-01T00:00:00Z</dc:date>
<dc:description>The book is useful as a comprehensive introduction, covering many application areas. Grid technology and its applications are clearly presented, but require some background on Operating Systems, Concurrent Programming and Communication Networks.</dc:description>
</item>
<item>
<title>A Framework for Deliberation and Negotiation among BDI Agents</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9613</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 5, no. 4
This work presents an interaction model among collaborative agents based on dialogues. For the specification we use a formalism, called Dialogue Games, which allows to describe the nature of the utterances available in each dialogue. We propose an interaction language which favors deliberation and argumentationbased negotiation among BDI agents. For each locution's specification we establish a set of preconditions, its meaning, the expected responses, and the modifications that it could produce. The interaction protocol and the interaction language as a whole can be used for specifying meaningful interaction between dialogical partners by following the rules of an individual dialogue.
</description>
<pubDate>Thu, 01 Dec 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9613</guid>
<dc:date>2005-12-01T00:00:00Z</dc:date>
<dc:description>This work presents an interaction model among collaborative agents based on dialogues. For the specification we use a formalism, called Dialogue Games, which allows to describe the nature of the utterances available in each dialogue. We propose an interaction language which favors deliberation and argumentationbased negotiation among BDI agents. For each locution's specification we establish a set of preconditions, its meaning, the expected responses, and the modifications that it could produce. The interaction protocol and the interaction language as a whole can be used for specifying meaningful interaction between dialogical partners by following the rules of an individual dialogue.</dc:description>
</item>
<item>
<title>A proposal from the point of view of information visualization and human computer interaction for the visualization of distributed system load</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9612</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 5, no. 4
In this article we show how the design of interfaces for the visualization of distributed system load can benefit from the combination of concepts and techniques from Information Visualization and Human Computer Interaction (HCI). Every distributed systems administrator must handle a high volume of information and the exploration and analysis of this data set has become increasingly difficult. We propose how to visualize the parameters involved in the load of a distributed system to obtain an effective visualization tool in order to reduce the user cognitive workload and help the user make the right decisions in a productive way.
</description>
<pubDate>Thu, 01 Dec 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9612</guid>
<dc:date>2005-12-01T00:00:00Z</dc:date>
<dc:description>In this article we show how the design of interfaces for the visualization of distributed system load can benefit from the combination of concepts and techniques from Information Visualization and Human Computer Interaction (HCI). Every distributed systems administrator must handle a high volume of information and the exploration and analysis of this data set has become increasingly difficult. We propose how to visualize the parameters involved in the load of a distributed system to obtain an effective visualization tool in order to reduce the user cognitive workload and help the user make the right decisions in a productive way.</dc:description>
</item>
<item>
<title>Learning object semantic description for enhancing reusability</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9611</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 5, no. 4
In the design of activities for Web-Based Education Systems, the concept of Didactic Object or Learning Object, has appeared as the axis of a new paradigm concerned with the reusability of contents and activities, due to its organization from a conceptual point of view, the use of metadata in known formats and the setting of new standards. In this article, the concept of reusability is analyzed within the context of the systems mentioned. In addition, Sowa-Style Conceptual Maps as well as Hypermedia Conceptual Maps are proposed as schemes capable of representing knowledge, since they allow for a clear visualization and tend to enable known automated functionalities accurately. The above mentioned resources tend to complete the information in metadata with regard to the semantic aspect.
</description>
<pubDate>Thu, 01 Dec 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9611</guid>
<dc:date>2005-12-01T00:00:00Z</dc:date>
<dc:description>In the design of activities for Web-Based Education Systems, the concept of Didactic Object or Learning Object, has appeared as the axis of a new paradigm concerned with the reusability of contents and activities, due to its organization from a conceptual point of view, the use of metadata in known formats and the setting of new standards. In this article, the concept of reusability is analyzed within the context of the systems mentioned. In addition, Sowa-Style Conceptual Maps as well as Hypermedia Conceptual Maps are proposed as schemes capable of representing knowledge, since they allow for a clear visualization and tend to enable known automated functionalities accurately. The above mentioned resources tend to complete the information in metadata with regard to the semantic aspect.</dc:description>
</item>
<item>
<title>Requirement specifications for electronic voting systems</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9610</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 5, no. 4
This paper presents an analysis of the requirements specification in electronic voting systems. In particular, it poses a specification that assumes a physical distributed architecture model with two networked intelligent units (Voting Terminal and Authorities Terminal). State Transition Diagrams and Use Cases are used in the modeling of the requirements. Finally, the model adaptation to two classes of different elections is analyzed: a national election of closed daily cycle and a university election with a cycle of several days, both with multiple objectives.
</description>
<pubDate>Thu, 01 Dec 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9610</guid>
<dc:date>2005-12-01T00:00:00Z</dc:date>
<dc:description>This paper presents an analysis of the requirements specification in electronic voting systems. In particular, it poses a specification that assumes a physical distributed architecture model with two networked intelligent units (Voting Terminal and Authorities Terminal). State Transition Diagrams and Use Cases are used in the modeling of the requirements. Finally, the model adaptation to two classes of different elections is analyzed: a national election of closed daily cycle and a university election with a cycle of several days, both with multiple objectives.</dc:description>
</item>
<item>
<title>Security in process migration systems</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9609</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 5, no. 4
A loosely coupled distributed system is composed by nodes, usually heterogenous, connected by a network. These systems have enormous aggregate computing potential. However most of this potential is not realized unless the underlying software is able to implement the concept of single system image (SSI) on the physically distributed system. This way the resources belonging to a node could be accessed transparently from any other node. This paper discusses the issues of a process migration protocol as an essential component of a distributed system and its extension to the grid computing paradigm. The security issues are specially considered.
</description>
<pubDate>Thu, 01 Dec 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9609</guid>
<dc:date>2005-12-01T00:00:00Z</dc:date>
<dc:description>A loosely coupled distributed system is composed by nodes, usually heterogenous, connected by a network. These systems have enormous aggregate computing potential. However most of this potential is not realized unless the underlying software is able to implement the concept of single system image (SSI) on the physically distributed system. This way the resources belonging to a node could be accessed transparently from any other node. This paper discusses the issues of a process migration protocol as an essential component of a distributed system and its extension to the grid computing paradigm. The security issues are specially considered.</dc:description>
</item>
<item>
<title>A parallel search algorithm for the SAT</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9608</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 5, no. 4
In order to be able to perform multimedia searches (like sounds, videos, images, etc.) we have to use data structures like the Spatial Approximation Tree (SAT). This structure is a nice example of a tree structure in which well-known tricks for tree parallelization simply do not work. It is too sparse, unbalanced and its performance is too dependent on the work-load generated by the queries being solved by means of searching the tree. The complexity measure is given by the number of distances computed to retrieve those objects close enough to the query. In this paper we examine some alternatives to parallelize this structure through the MPI library and the BSPpub library.
</description>
<pubDate>Thu, 01 Dec 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9608</guid>
<dc:date>2005-12-01T00:00:00Z</dc:date>
<dc:description>In order to be able to perform multimedia searches (like sounds, videos, images, etc.) we have to use data structures like the Spatial Approximation Tree (SAT). This structure is a nice example of a tree structure in which well-known tricks for tree parallelization simply do not work. It is too sparse, unbalanced and its performance is too dependent on the work-load generated by the queries being solved by means of searching the tree. The complexity measure is given by the number of distances computed to retrieve those objects close enough to the query. In this paper we examine some alternatives to parallelize this structure through the MPI library and the BSPpub library.</dc:description>
</item>
<item>
<title>Verifying BON models with alloy</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9607</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 5, no. 4
In this paper we describe a methodology to translate BON (architectural) designs to Alloy specifications. The main virtue of this process is that it can be implemented by means of software tools. The utilization of this methodology during the software development allows designers to validate different kinds of properties over their BON models. Allowing, in this way, the finding of critical bugs in earlier steps of system construction. Finally, we present a software which implements this translation from BON to Alloy.
</description>
<pubDate>Thu, 01 Dec 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9607</guid>
<dc:date>2005-12-01T00:00:00Z</dc:date>
<dc:description>In this paper we describe a methodology to translate BON (architectural) designs to Alloy specifications. The main virtue of this process is that it can be implemented by means of software tools. The utilization of this methodology during the software development allows designers to validate different kinds of properties over their BON models. Allowing, in this way, the finding of critical bugs in earlier steps of system construction. Finally, we present a software which implements this translation from BON to Alloy.</dc:description>
</item>
<item>
<title>Evaluating simple metaheuristics for the generalized steiner problem</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9606</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 5, no. 4
This article presents the empirical evaluation of several simple metaheuristics applied to solve the Generalized Steiner Problem (GSP). This problem models the design of high-reliability communication networks, demanding a variable number of independent paths linking each pair of terminal nodes. GSP solutions are built using intermediate nodes for guaranteeing path redundancy, while trying to minimize the design total cost. The GSP is a NP-hard problem, and few algorithms have been proposed to solve it. In this work, we present the resolution of several GSP instances whose optimal solutions are known, using metaheuristic techniques. The comparative analysis shows promising results for some of the studied techniques
</description>
<pubDate>Thu, 01 Dec 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9606</guid>
<dc:date>2005-12-01T00:00:00Z</dc:date>
<dc:description>This article presents the empirical evaluation of several simple metaheuristics applied to solve the Generalized Steiner Problem (GSP). This problem models the design of high-reliability communication networks, demanding a variable number of independent paths linking each pair of terminal nodes. GSP solutions are built using intermediate nodes for guaranteeing path redundancy, while trying to minimize the design total cost. The GSP is a NP-hard problem, and few algorithms have been proposed to solve it. In this work, we present the resolution of several GSP instances whose optimal solutions are known, using metaheuristic techniques. The comparative analysis shows promising results for some of the studied techniques</dc:description>
</item>
<item>
<title>Applying ontologies to educational resources retrieval driven by cultural aspects</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9605</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 5, no. 4
This work presents the architecture used in the ongoing e-learning EduCa Project. The approach is based in a strong use of ontologies for the retrieval, management and clustered of electronic educational resources according to user's cultural aspects. Cultural aspects are preferences and ways of behavior determined by the person's culture. In this project, the cultural aspects are just the features that distinguish between the preferences of users from different regions.
</description>
<pubDate>Thu, 01 Dec 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9605</guid>
<dc:date>2005-12-01T00:00:00Z</dc:date>
<dc:description>This work presents the architecture used in the ongoing e-learning EduCa Project. The approach is based in a strong use of ontologies for the retrieval, management and clustered of electronic educational resources according to user's cultural aspects. Cultural aspects are preferences and ways of behavior determined by the person's culture. In this project, the cultural aspects are just the features that distinguish between the preferences of users from different regions.</dc:description>
</item>
<item>
<title>Dynamic load balancing in parallel processing on non-homogeneous clusters</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9604</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 5, no. 4
This paper analyzes the dynamic and static balancing of non-homogenous cluster architectures, simultaneously analyzing the theoretical parallel Speedup as well as the Speedup experimentally obtained. Three interconnected clusters have been used in which the machines within each cluster have homogeneous processors although different among clusters. Thus, the set can be seen as a 25-processor heterogeneous cluster or as a multi-cluster scheme with subsets of homogeneous processors. A classical application (Parallel N-Queens) with a parallel solution algorithm, where processing predominates upon communication, has been chosen so as to go deep in the load balancing aspects (dynamic or static) without distortion of results caused by communication overhead. At the same time, three forms of load distribution in the processors (Direct Static, Predictive Static and Dynamic by Demand) have been studied, analyzing in each case parallel Speedup and load unbalancing regarding problem size and the processors used.
</description>
<pubDate>Thu, 01 Dec 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9604</guid>
<dc:date>2005-12-01T00:00:00Z</dc:date>
<dc:description>This paper analyzes the dynamic and static balancing of non-homogenous cluster architectures, simultaneously analyzing the theoretical parallel Speedup as well as the Speedup experimentally obtained. Three interconnected clusters have been used in which the machines within each cluster have homogeneous processors although different among clusters. Thus, the set can be seen as a 25-processor heterogeneous cluster or as a multi-cluster scheme with subsets of homogeneous processors. A classical application (Parallel N-Queens) with a parallel solution algorithm, where processing predominates upon communication, has been chosen so as to go deep in the load balancing aspects (dynamic or static) without distortion of results caused by communication overhead. At the same time, three forms of load distribution in the processors (Direct Static, Predictive Static and Dynamic by Demand) have been studied, analyzing in each case parallel Speedup and load unbalancing regarding problem size and the processors used.</dc:description>
</item>
<item>
<title>Adaptive clustering with artificial ants</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9603</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 5, no. 4
Clustering task aims at the unsupervised classification of patterns (e.g., observations, data, vec- tors, etc.) in different groups. Clustering problem has been approached from different disciplines during the last years. Although have been proposed different alternatives to cope with clustering, there also exists an interesting and novel field of research from which different bioinspired &#13;
algorithms have emerged, e.g., genetic algorithms and ant colony algorithms. In this article we pro- pose an extension of the AntTree algorithm, an example of an algorithm recently proposed for a data mining task which is designed following the principle of self-assembling behavior observed in some species of real ants. The extension proposed called Adaptive-AntTree (AAT for short) represents a more flexible version of the original one. The ants in AAT are able of changing the assigned position in previous iterations in the tree under construction. As a consequence, this new algorithm builds an adaptive hierarchical cluster which changes over the run in order to improve the final result. The AAT performance is experimentally analyzed and compared against AntTree and K-means which is one of the more popular and referenced clustering algorithm.
</description>
<pubDate>Thu, 01 Dec 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9603</guid>
<dc:date>2005-12-01T00:00:00Z</dc:date>
<dc:description>Clustering task aims at the unsupervised classification of patterns (e.g., observations, data, vec- tors, etc.) in different groups. Clustering problem has been approached from different disciplines during the last years. Although have been proposed different alternatives to cope with clustering, there also exists an interesting and novel field of research from which different bioinspired &#13;
algorithms have emerged, e.g., genetic algorithms and ant colony algorithms. In this article we pro- pose an extension of the AntTree algorithm, an example of an algorithm recently proposed for a data mining task which is designed following the principle of self-assembling behavior observed in some species of real ants. The extension proposed called Adaptive-AntTree (AAT for short) represents a more flexible version of the original one. The ants in AAT are able of changing the assigned position in previous iterations in the tree under construction. As a consequence, this new algorithm builds an adaptive hierarchical cluster which changes over the run in order to improve the final result. The AAT performance is experimentally analyzed and compared against AntTree and K-means which is one of the more popular and referenced clustering algorithm.</dc:description>
</item>
<item>
<title>Cellular memetic algorithms</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9602</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 5, no. 4
This work is focussed on the development and analysis of a new class of algorithms, called cellular memetic algorithms (cMAs), which will be evaluated here on the satisfiability problem (SAT). For describing a cMA, we study the effects of adding specific knowledge of the problem to the fitness function, the crossover and mutation operators, and to the local search step in a canonical cellular genetic algorithm (cGA). Hence, the proposed cMAs are the result of including these hybridization techniques in different structural ways into a canonical cGA. We conclude that the performance of the cGA is largely improved by these hybrid extensions. The accuracy and efficiency of the resulting cMAs are even better than those of the best existing heuristics for SAT in many cases.
</description>
<pubDate>Thu, 01 Dec 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9602</guid>
<dc:date>2005-12-01T00:00:00Z</dc:date>
<dc:description>This work is focussed on the development and analysis of a new class of algorithms, called cellular memetic algorithms (cMAs), which will be evaluated here on the satisfiability problem (SAT). For describing a cMA, we study the effects of adding specific knowledge of the problem to the fitness function, the crossover and mutation operators, and to the local search step in a canonical cellular genetic algorithm (cGA). Hence, the proposed cMAs are the result of including these hybridization techniques in different structural ways into a canonical cGA. We conclude that the performance of the cGA is largely improved by these hybrid extensions. The accuracy and efficiency of the resulting cMAs are even better than those of the best existing heuristics for SAT in many cases.</dc:description>
</item>
<item>
<title>Towards a UML profile for modeling WAP applications</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9601</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 5, no. 4
UML (Unified Modeling Language) is one of the most used languages to specify and document informatics applications. However, UML is a generalpurpose language, so it often lacks of elements to model and represent concrete concepts of specifics domains. As a solution, OMG (Object Management Group) has created the profiles, a mechanism to extend the syntax and semantics of UML to express more specific concepts of certain application domains. In this work we present a UML profile for modeling WAP (Wireless Applications Protocol) applications. The main goal of the proposed profile is to extend UML to provide specifics elements (labeled classes, stereotypes, tagged values and constraints) that allow software developers to modelWAP applications. The expressiveness of the UML diagrams allows modeling important stages of the process of common applications; nevertheless, the modeling process of WAP applications is still a too specific domain that can be hardly dealt with in its entirety without extending the language. In the process exists navigational, design and construction issues that cannot be modeled using the traditional elements of UML. However, by using the specific elements created by the proposed profile, these issues can be completely solved, and even a greater expressiveness can be obtained.
</description>
<pubDate>Thu, 01 Dec 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9601</guid>
<dc:date>2005-12-01T00:00:00Z</dc:date>
<dc:description>UML (Unified Modeling Language) is one of the most used languages to specify and document informatics applications. However, UML is a generalpurpose language, so it often lacks of elements to model and represent concrete concepts of specifics domains. As a solution, OMG (Object Management Group) has created the profiles, a mechanism to extend the syntax and semantics of UML to express more specific concepts of certain application domains. In this work we present a UML profile for modeling WAP (Wireless Applications Protocol) applications. The main goal of the proposed profile is to extend UML to provide specifics elements (labeled classes, stereotypes, tagged values and constraints) that allow software developers to modelWAP applications. The expressiveness of the UML diagrams allows modeling important stages of the process of common applications; nevertheless, the modeling process of WAP applications is still a too specific domain that can be hardly dealt with in its entirety without extending the language. In the process exists navigational, design and construction issues that cannot be modeled using the traditional elements of UML. However, by using the specific elements created by the proposed profile, these issues can be completely solved, and even a greater expressiveness can be obtained.</dc:description>
</item>
<item>
<title>Wildland fire risk maps using S&lt;sup&gt;2&lt;/sup&gt;F&lt;sup&gt;2&lt;/sup&gt;M&lt;sup&gt;*&lt;/sup&gt;</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9600</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 5, no. 4
Wildland fires are a critical natural hazard in many regions of the World. Every year, millions of hectares are burned in Tropical, Boreal and Mediterranean forest, which causes a wide variety of effects, from atmospheric emissions, to soil erosion, biodiversity loss and drainage alterations. Reduction of those negative effects of fire requires to improve current fire risk assessment methods. Wildland firerisk assessment is a very significant issue. This risk assessment is usually based on ignition probability due to meteorological or human factors, but it does not usually consider propagation danger when a wildland fire has started. To evaluate propagation danger, it is necessary to apply some propagation model and simulate the behaviour of the fireline. However, this propagation danger must be evaluated considering many different possible scenarios. Therefore, the amount of simulations that must be carried out is enormous and it is necessary to apply high-performance computing techniques to make the methodology feasible. In this paper, a method for creating propagation danger maps based on factorial experimentation is described. The methodology was applied at a southern Europe scale during the 2004 summer season.
</description>
<pubDate>Thu, 01 Dec 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9600</guid>
<dc:date>2005-12-01T00:00:00Z</dc:date>
<dc:description>Wildland fires are a critical natural hazard in many regions of the World. Every year, millions of hectares are burned in Tropical, Boreal and Mediterranean forest, which causes a wide variety of effects, from atmospheric emissions, to soil erosion, biodiversity loss and drainage alterations. Reduction of those negative effects of fire requires to improve current fire risk assessment methods. Wildland firerisk assessment is a very significant issue. This risk assessment is usually based on ignition probability due to meteorological or human factors, but it does not usually consider propagation danger when a wildland fire has started. To evaluate propagation danger, it is necessary to apply some propagation model and simulate the behaviour of the fireline. However, this propagation danger must be evaluated considering many different possible scenarios. Therefore, the amount of simulations that must be carried out is enormous and it is necessary to apply high-performance computing techniques to make the methodology feasible. In this paper, a method for creating propagation danger maps based on factorial experimentation is described. The methodology was applied at a southern Europe scale during the 2004 summer season.</dc:description>
</item>
<item>
<title>Analysis of web based learning use in a first course of algorithmics</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9599</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 5, no. 4
This paper presents an analysis of the aspects to take into account when reformulating the teaching and learning processes of a first course of Algorithmics employing elements of Distance Education in a Web-based virtual environment. Particularly it analyzes a large experience (more than 1000 students) carried out in the initial subject of Algorithmics (Computer Programming, annual subject), of the School of Computer Sciences at the UNLP, on three different student's profiles. In addition, this paper discusses the difficulties of distance education on subjects with an important experimental component, such as the analyzed first course of Algorithmics. Finally, the results obtained in the initial evaluation of the different student profiles are presented, analyzing the advantage and disadvantages of using these technologies in the initial graduate courses on Computer Sciences.
</description>
<pubDate>Thu, 01 Dec 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9599</guid>
<dc:date>2005-12-01T00:00:00Z</dc:date>
<dc:description>This paper presents an analysis of the aspects to take into account when reformulating the teaching and learning processes of a first course of Algorithmics employing elements of Distance Education in a Web-based virtual environment. Particularly it analyzes a large experience (more than 1000 students) carried out in the initial subject of Algorithmics (Computer Programming, annual subject), of the School of Computer Sciences at the UNLP, on three different student's profiles. In addition, this paper discusses the difficulties of distance education on subjects with an important experimental component, such as the analyzed first course of Algorithmics. Finally, the results obtained in the initial evaluation of the different student profiles are presented, analyzing the advantage and disadvantages of using these technologies in the initial graduate courses on Computer Sciences.</dc:description>
</item>
<item>
<title>Processing interaction protocols in parallel: a logic programming implementation for robotic soccer</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9598</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 5, no. 4
In this paper we explore different situations in which collaborative agents have to communicate among themselves using standard interaction protocols. We will propose how to process these interactions in parallel without interfering with other agent's activities. Thus, agents will not have to interrupt or delay an activity for handling incoming messages, and in some cases, answers can be created and delivered immediately. Our proposal will be oriented to a robotic soccer domain with autonomous mobile robots. We will analyze three kinds of situations in which the interaction between agents plays an important role for coordination: requirements, queries and proposals. Requirements arise when an agent asks another to execute a specific action. A query is used when an agent wants to acquire certain information from another agent. Finally, proposals arise when an agent wants to &#13;
synchronize with another agent for collaboration. In a realistic scenario, an agent may interact with several agents and these interactions usually proceed simultaneously with the rest of the activities of the agent. Therefore, our proposal is to process these in- teractions in parallel with the decision cycle of the agent reducing the overhead imposed by the interaction. The implementation of this approach will be done in an extended logic programming framework developed for implementing multi-agent systems.
</description>
<pubDate>Thu, 01 Dec 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9598</guid>
<dc:date>2005-12-01T00:00:00Z</dc:date>
<dc:description>In this paper we explore different situations in which collaborative agents have to communicate among themselves using standard interaction protocols. We will propose how to process these interactions in parallel without interfering with other agent's activities. Thus, agents will not have to interrupt or delay an activity for handling incoming messages, and in some cases, answers can be created and delivered immediately. Our proposal will be oriented to a robotic soccer domain with autonomous mobile robots. We will analyze three kinds of situations in which the interaction between agents plays an important role for coordination: requirements, queries and proposals. Requirements arise when an agent asks another to execute a specific action. A query is used when an agent wants to acquire certain information from another agent. Finally, proposals arise when an agent wants to &#13;
synchronize with another agent for collaboration. In a realistic scenario, an agent may interact with several agents and these interactions usually proceed simultaneously with the rest of the activities of the agent. Therefore, our proposal is to process these in- teractions in parallel with the decision cycle of the agent reducing the overhead imposed by the interaction. The implementation of this approach will be done in an extended logic programming framework developed for implementing multi-agent systems.</dc:description>
</item>
<item>
<title>The multi-agent system architecture in SEWASIE</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9597</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 5, no. 4
We describe the design, implementation and deployment of the multi-level agent-based system architecture developed for the SEWASIE project. The aim of the system is to help the user in querying heterogeneous data sources which are integrated by means of ontologies. The agent architecture is based on a two level data integration scheme supported by mediators and brokers, connected by a peer to peer mechanism. Implementation is done on top of the JADE system, a modular and scalable platform that satisfies FIPA standards.
</description>
<pubDate>Thu, 01 Dec 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9597</guid>
<dc:date>2005-12-01T00:00:00Z</dc:date>
<dc:description>We describe the design, implementation and deployment of the multi-level agent-based system architecture developed for the SEWASIE project. The aim of the system is to help the user in querying heterogeneous data sources which are integrated by means of ontologies. The agent architecture is based on a two level data integration scheme supported by mediators and brokers, connected by a peer to peer mechanism. Implementation is done on top of the JADE system, a modular and scalable platform that satisfies FIPA standards.</dc:description>
</item>
<item>
<title>Semi-automatic object tracking in video sequences</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9596</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 5, no. 4
A method is presented for semi-automatic object tracking in video sequences using multiple features and a method for probabilistic relaxation to improve the tracking results producing smooth and accurate tracked borders. Starting from a given initial position of the object in the first frame the proposed method automatically tracks the object in the sequence modelling the a posteriori probabilities of a set of features such as color, position and motion, depth, etc.
</description>
<pubDate>Thu, 01 Dec 2005 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9596</guid>
<dc:date>2005-12-01T00:00:00Z</dc:date>
<dc:description>A method is presented for semi-automatic object tracking in video sequences using multiple features and a method for probabilistic relaxation to improve the tracking results producing smooth and accurate tracked borders. Starting from a given initial position of the object in the first frame the proposed method automatically tracks the object in the sequence modelling the a posteriori probabilities of a set of features such as color, position and motion, depth, etc.</dc:description>
</item>
</channel>
</rss>
