http://sedici.unlp.edu.ar:80/handle/10915/375 2026-03-12T08:44:25Z 2026-03-12T08:44:25Z Ramón, Hugo Dionisio http://sedici.unlp.edu.ar:80/handle/10915/9438 2019-06-16T04:03:38Z 2002-01-01T00:00:00Z

Revision Journal of Computer Science & Technology; vol. 1, no. 6 There is a need of counting on precise measurements of subjective losses that can be used for predicting the quality of an image. The objective of the present work is to determine these distortion measurements and test the use of different objective measurements in order to forecast an image subjective quality. Es revisión de: http://sedici.unlp.edu.ar/handle/10915/4056; Dossier: Resumen de tesis presentada por el autor para obtener el título de Magister en Automatización de Oficinas en el año 2001, dirigida por Armando Eduardo De Giusti

2002-01-01T00:00:00Z There is a need of counting on precise measurements of subjective losses that can be used for predicting the quality of an image. The objective of the present work is to determine these distortion measurements and test the use of different objective measurements in order to forecast an image subjective quality. Lage, Fernando Javier http://sedici.unlp.edu.ar:80/handle/10915/9437 2019-06-15T20:04:10Z 2002-01-01T00:00:00Z

Revision Journal of Computer Science & Technology; vol. 1, no. 6 The subject matter of this work is focused in the development of an application for team work over a distributed system belonging to an organization. This choice is based in the organizations need of their members’ continuing formation/training, and of the possibility of using computing resources generally sub-used by them. Resumen de tesis presentada por el autor para obtener el título de Magister en Automatización de Oficinas, en el año 2001, dirigida por Horacio Villagarcía.; Es revisión de: http://sedici.unlp.edu.ar/handle/10915/4058

2002-01-01T00:00:00Z The subject matter of this work is focused in the development of an application for team work over a distributed system belonging to an organization. This choice is based in the organizations need of their members’ continuing formation/training, and of the possibility of using computing resources generally sub-used by them. Gorga, Gladys Madoz, María Cristina http://sedici.unlp.edu.ar:80/handle/10915/9436 2019-06-15T20:04:07Z 2002-01-01T00:00:00Z

Revision Journal of Computer Science & Technology; vol. 1, no. 6 This text introduces comprehensively the reader to the distance teaching/learning process. With this purpose, it presents a model of the Distance Education System to be used for understanding its embedded elements: contents, instructional design, communications, interaction, learning environment, and administration.

2002-01-01T00:00:00Z This text introduces comprehensively the reader to the distance teaching/learning process. With this purpose, it presents a model of the Distance Education System to be used for understanding its embedded elements: contents, instructional design, communications, interaction, learning environment, and administration. Romero, Fernando http://sedici.unlp.edu.ar:80/handle/10915/9435 2019-06-15T20:04:05Z 2002-01-01T00:00:00Z

Revision Journal of Computer Science & Technology; vol. 1, no. 6 This book presents an approach based on Linux operating system, including issues such as kernel per se, units use and construction, different types of them, debugging techniques, as well as time management, interruptions, DMA (direct memory access), different buses and peripherals

2002-01-01T00:00:00Z This book presents an approach based on Linux operating system, including issues such as kernel per se, units use and construction, different types of them, debugging techniques, as well as time management, interruptions, DMA (direct memory access), different buses and peripherals Estévez, Elsa Clara Fillottrani, Pablo Rubén http://sedici.unlp.edu.ar:80/handle/10915/9434 2019-06-15T20:04:04Z 2002-01-01T00:00:00Z

Articulo Journal of Computer Science & Technology; vol. 1, no. 6 Guaranteeing that assembled components will behave as required is one of the main aspects in working with Component-Based Development. In this paper we present a formal approach for tackling this problem by applying the concept of bisimulation, originally presented in the study of concurrency theory. Bisimulation allows us to abstract details that are irrelevant from the behavioral point of view, such as data representations and implementation structures, providing a powerful formalism for proving software correctness properties. Thus, our approach facilitates to demonstrate the behavioral equivalence between the integrated system and the required specification. We introduce these concepts with the help of an example described in RAISE.

2002-01-01T00:00:00Z Guaranteeing that assembled components will behave as required is one of the main aspects in working with Component-Based Development. In this paper we present a formal approach for tackling this problem by applying the concept of bisimulation, originally presented in the study of concurrency theory. Bisimulation allows us to abstract details that are irrelevant from the behavioral point of view, such as data representations and implementation structures, providing a powerful formalism for proving software correctness properties. Thus, our approach facilitates to demonstrate the behavioral equivalence between the integrated system and the required specification. We introduce these concepts with the help of an example described in RAISE. Roldán, María Carina Naiouf, Marcelo De Giusti, Armando Eduardo http://sedici.unlp.edu.ar:80/handle/10915/9433 2019-06-15T20:04:02Z 2002-01-01T00:00:00Z

Articulo Journal of Computer Science & Technology; vol. 1, no. 6 In several applications, the trajectory of an entity, a feature or an object has to be tracked over a sequence of image frames. When the processing is to be performed in real time, there are important constraints leading to the parallelization of tracking algorithms. This paper presents the results of a concrete implementation, which deals with the particular case of simple objects moving in an context reachable by the vision element (video camera). The steps involved in the solution development are detailed, specially in relation to their parallelization by using a computer heterogeneous network and MPI (Message Passing Interface) support. Finally, an analysis of the different algorithms behavior is carried out together with the obtained results assessment, which allows knowing the performed parallelization efficiency, and determining under which conditions this solution turns out to be the best one.

2002-01-01T00:00:00Z In several applications, the trajectory of an entity, a feature or an object has to be tracked over a sequence of image frames. When the processing is to be performed in real time, there are important constraints leading to the parallelization of tracking algorithms. This paper presents the results of a concrete implementation, which deals with the particular case of simple objects moving in an context reachable by the vision element (video camera). The steps involved in the solution development are detailed, specially in relation to their parallelization by using a computer heterogeneous network and MPI (Message Passing Interface) support. Finally, an analysis of the different algorithms behavior is carried out together with the obtained results assessment, which allows knowing the performed parallelization efficiency, and determining under which conditions this solution turns out to be the best one. Printista, Alicia Marcela Errecalde, Marcelo Luis Montoya, Cecilia Inés http://sedici.unlp.edu.ar:80/handle/10915/9432 2019-06-15T20:03:58Z 2002-01-01T00:00:00Z

Articulo vol. 1, no. 6 Q-Learning is a Reinforcement Learning method for solving sequential decision problems, where the utility of actions depends on a sequence of decisions and there exists uncertainty about the dynamics of the environment the agent is situated on. This general framework has allowed that Q-Learning and other Reinforcement Learning methods to be applied to a broad spectrum of complex real world problems such as robotics, industrial manufacturing, games and others. Despite its interesting properties, Q-learning is a very slow method that requires a long period of training for learning an acceptable policy. In order to solve or at least reduce this problem, we propose a parallel implementation model of Q-learning using a tabular representation and via a communication scheme based on cache. This model is applied to a particular problem and the results obtained with different processor configurations are reported. A brief discussion about the properties and current limitations of our approach is finally presented.

2002-01-01T00:00:00Z Q-Learning is a Reinforcement Learning method for solving sequential decision problems, where the utility of actions depends on a sequence of decisions and there exists uncertainty about the dynamics of the environment the agent is situated on. This general framework has allowed that Q-Learning and other Reinforcement Learning methods to be applied to a broad spectrum of complex real world problems such as robotics, industrial manufacturing, games and others. Despite its interesting properties, Q-learning is a very slow method that requires a long period of training for learning an acceptable policy. In order to solve or at least reduce this problem, we propose a parallel implementation model of Q-learning using a tabular representation and via a communication scheme based on cache. This model is applied to a particular problem and the results obtained with different processor configurations are reported. A brief discussion about the properties and current limitations of our approach is finally presented. Castro, Silvia Mabel Castro, Liliana Raquel Boscardín, Liliana Beatriz De Giusti, Armando Eduardo http://sedici.unlp.edu.ar:80/handle/10915/9431 2019-06-15T20:03:55Z 2002-01-01T00:00:00Z

Articulo Journal of Computer Science & Technology; vol. 1, no. 6 In this paper, a method for representing scalar functions on volumes is presented. The method is based on wavelets and it can be used for representing volumetric data (geometric or scalar) defifined on non structured grids. The basic contribution is the extension of wavelets to represent scalar functions on volumetric domains of arbitrary topological type. This extension is made by constructing a wavelet basis defifined on any tetrahedrized volume. This basis construction is achieved using multiresolution analysis and the lifting scheme

2002-01-01T00:00:00Z In this paper, a method for representing scalar functions on volumes is presented. The method is based on wavelets and it can be used for representing volumetric data (geometric or scalar) defifined on non structured grids. The basic contribution is the extension of wavelets to represent scalar functions on volumetric domains of arbitrary topological type. This extension is made by constructing a wavelet basis defifined on any tetrahedrized volume. This basis construction is achieved using multiresolution analysis and the lifting scheme Sanz, Cecilia Verónica Jordán, Ramiro http://sedici.unlp.edu.ar:80/handle/10915/9430 2019-06-15T20:03:53Z 2002-01-01T00:00:00Z

Articulo Journal of Computer Science & Technology; vol. 1, no. 6 This paper describes a new classification method (DER) based on evidential reasoning to which a series of modifications are added [1]. DER allows including new evidence for the classification process and defines a different decision rule. The evidential reasoning algorithm provides a means to combine evidence from different data sources. It is a supervised classification technique that uses a training samples set. This novel method (DER) offers a learning stage to introduce new evidence in case the classifier requires so. Moreover, it uses the plausibility measure in order to define the decision rule as a way to incorporate data-associated uncertainty. The proposed method is applied in order to classify crops in hyperspectral images of the area of Nebraska (USA). Some results obtained are presented in order to assess DER precision.

2002-01-01T00:00:00Z This paper describes a new classification method (DER) based on evidential reasoning to which a series of modifications are added [1]. DER allows including new evidence for the classification process and defines a different decision rule. The evidential reasoning algorithm provides a means to combine evidence from different data sources. It is a supervised classification technique that uses a training samples set. This novel method (DER) offers a learning stage to introduce new evidence in case the classifier requires so. Moreover, it uses the plausibility measure in order to define the decision rule as a way to incorporate data-associated uncertainty. The proposed method is applied in order to classify crops in hyperspectral images of the area of Nebraska (USA). Some results obtained are presented in order to assess DER precision. Pissioli, Mauricio Moreira, Edson dos Santos Goularte, Rudinei http://sedici.unlp.edu.ar:80/handle/10915/9429 2019-06-15T20:03:53Z 2002-01-01T00:00:00Z

Articulo Journal of Computer Science & Technology; vol. 1, no. 6 A large quantity of data of different types and priorities pass through on high-speed networks. A relevant part of these data, like continuous media (audio, video, and so), need a control of its Quality of Service (QoS). This paper describes experiments on the characteristics of the ATM network technology that provide support to quality video streaming transmission. The experiments were realized considering QoS, connection admission control, network congestion, transmission priorities and bandwidth demand associated to applications and network configuration. Three basic kinds of videos were analyzed-movies (smooth movies), sports (action movies) and talking head movies. Data about video transmission were collected from an ATM switch, showing results that can be used in the future on ATM channel mapping to multimedia data distribution (in applications like Interactive TV and Video-on-Demand, for example).

2002-01-01T00:00:00Z A large quantity of data of different types and priorities pass through on high-speed networks. A relevant part of these data, like continuous media (audio, video, and so), need a control of its Quality of Service (QoS). This paper describes experiments on the characteristics of the ATM network technology that provide support to quality video streaming transmission. The experiments were realized considering QoS, connection admission control, network congestion, transmission priorities and bandwidth demand associated to applications and network configuration. Three basic kinds of videos were analyzed-movies (smooth movies), sports (action movies) and talking head movies. Data about video transmission were collected from an ATM switch, showing results that can be used in the future on ATM channel mapping to multimedia data distribution (in applications like Interactive TV and Video-on-Demand, for example). Scolnik, Hugo Daniel Gambini, María Juliana http://sedici.unlp.edu.ar:80/handle/10915/9428 2019-06-15T20:03:51Z 2001-01-01T00:00:00Z

Articulo Journal of Computer Science & Technology; vol. 1, no. 6 In this article we consider the problem of computing approximations to the second derivatives of functions of n variables using finite differences. We show how to derive different formulas and how to comput the errors of those approximations as functions of the increment h, both for first and second derivatives. Based upon those results we describe the methods of Gill and Murray and the one of gradient difference. On the other hand we introduce a new algorithm which use conjugate directions methods for minimizing functions without derivatives and the corresponding numerical comparisons with the other two methods. Finally, numerical experiences are given and the corresponding conclusions are discussed.

2001-01-01T00:00:00Z In this article we consider the problem of computing approximations to the second derivatives of functions of n variables using finite differences. We show how to derive different formulas and how to comput the errors of those approximations as functions of the increment h, both for first and second derivatives. Based upon those results we describe the methods of Gill and Murray and the one of gradient difference. On the other hand we introduce a new algorithm which use conjugate directions methods for minimizing functions without derivatives and the corresponding numerical comparisons with the other two methods. Finally, numerical experiences are given and the corresponding conclusions are discussed.