Volumen 10 | Número 02http://sedici.unlp.edu.ar:80/handle/10915/3972024-03-19T10:15:58Z2024-03-19T10:15:58ZAerial image acquisition and processing for remote sensingManera, José F.Rodríguez, LucasDelrieux, ClaudioCoppo, Ricardohttp://sedici.unlp.edu.ar:80/handle/10915/96762019-06-22T20:02:56Z2010-06-01T00:00:00ZArticulo
Journal of Computer Science & Technology; vol. 10, no. 2
UAV (Unmanned Airborne Vehicle) high resolution digital image acquisition systems based on small format cameras provide a versatile alternative to the solution of environmental monitoring and remote sensing problems. Through digital image processing these small format optical and multi-spectral camera images can obtain orthomosaics that meet quality standards at a fraction of the cost of traditional heavier manned vehicle equipment. They also have higher availability, resolution and flexibility can also be obtained when compared to satellite images. This paper presents research and development undertaken to produce a computational system that can automatically process optical and multi-spectral images obtained from digital cameras mounted on a UAV aircraft. The system acquires, rectifies, mosaics and georeferences these images with minimum operator assistance. Results prove that the process can almost be fully automated and that the system can be operated by minimally trained personnel. Processed images obtained by the software can be used for pattern recognition, photo interpretation, photogrammetry, and other remote sensing applications.
2010-06-01T00:00:00ZUAV (Unmanned Airborne Vehicle) high resolution digital image acquisition systems based on small format cameras provide a versatile alternative to the solution of environmental monitoring and remote sensing problems. Through digital image processing these small format optical and multi-spectral camera images can obtain orthomosaics that meet quality standards at a fraction of the cost of traditional heavier manned vehicle equipment. They also have higher availability, resolution and flexibility can also be obtained when compared to satellite images. This paper presents research and development undertaken to produce a computational system that can automatically process optical and multi-spectral images obtained from digital cameras mounted on a UAV aircraft. The system acquires, rectifies, mosaics and georeferences these images with minimum operator assistance. Results prove that the process can almost be fully automated and that the system can be operated by minimally trained personnel. Processed images obtained by the software can be used for pattern recognition, photo interpretation, photogrammetry, and other remote sensing applications.Dynamic generation of test cases with metaheuristicsLanzarini, Laura CristinaBattaiotto, Pedro Eduardohttp://sedici.unlp.edu.ar:80/handle/10915/96752019-06-22T20:02:54Z2010-06-01T00:00:00ZArticulo
Journal of Computer Science & Technology; vol. 10, no. 2
The resolution of optimization problems is of great interest nowadays and has encouraged the development of various information technology methods to attempt solving them. There are several problems related to Software Engineering that can be solved by using this approach. In this paper, a new alternative based on the combination of population metaheuristics with a Tabu List to solve the problem of test cases generation when testing software is presented. This problem is of great importance for the development of software with a high computational cost and which is generally hard to solve. The performance of the solution proposed has been tested on a set of varying complexity programs. The results obtained show that the method proposed allows obtaining a reduced test data set in a suitable timeframe and with a greater coverage than conventional methods such as Random Method or Tabu Search.
2010-06-01T00:00:00ZThe resolution of optimization problems is of great interest nowadays and has encouraged the development of various information technology methods to attempt solving them. There are several problems related to Software Engineering that can be solved by using this approach. In this paper, a new alternative based on the combination of population metaheuristics with a Tabu List to solve the problem of test cases generation when testing software is presented. This problem is of great importance for the development of software with a high computational cost and which is generally hard to solve. The performance of the solution proposed has been tested on a set of varying complexity programs. The results obtained show that the method proposed allows obtaining a reduced test data set in a suitable timeframe and with a greater coverage than conventional methods such as Random Method or Tabu Search.4-(<i>N<SUP>2</SUP></i>-1) puzzle: parallelization and performance on clustersSanz, Victoria MaríaDe Giusti, Armando EduardoNaiouf, Marcelohttp://sedici.unlp.edu.ar:80/handle/10915/96742019-06-22T20:02:52Z2010-06-01T00:00:00ZArticulo
Journal of Computer Science & Technology; vol. 10, no. 2
In this paper, an analysis of the 4-(<i>N<SUP>2</SUP></i>-1) Puzzle, which is a generalization of the (<i>N<SUP>2</SUP></i>-1) Puzzle, is presented. This problem is of interest due to its algorithmic and computational complexity and its applications to robot movements with several objectives. Taking the formal definition as a starting point, 4 heuristics that can be used to predict the best achievable objective and to estimate the number of steps required to reach a solution state from a given configuration are analyzed. By selecting the objective, a sequential and parallel solution over a cluster is presented for the (<i>N<SUP>2</SUP></i>-1) Puzzle, based on the heuristic search algorithm A*. Also, variations of the classic heuristic are analyzed. The experimental work focuses on analyzing the possible superlinearity and the scalability of the parallel solution on clusters, by varying the physical configuration and the dimension of the problem. Finally, the suitability of the heuristic used to assess the best achievable objective in the 4-(<i>N<SUP>2</SUP></i>-1) Puzzle is analyzed.
2010-06-01T00:00:00ZIn this paper, an analysis of the 4-(<i>N<SUP>2</SUP></i>-1) Puzzle, which is a generalization of the (<i>N<SUP>2</SUP></i>-1) Puzzle, is presented. This problem is of interest due to its algorithmic and computational complexity and its applications to robot movements with several objectives. Taking the formal definition as a starting point, 4 heuristics that can be used to predict the best achievable objective and to estimate the number of steps required to reach a solution state from a given configuration are analyzed. By selecting the objective, a sequential and parallel solution over a cluster is presented for the (<i>N<SUP>2</SUP></i>-1) Puzzle, based on the heuristic search algorithm A*. Also, variations of the classic heuristic are analyzed. The experimental work focuses on analyzing the possible superlinearity and the scalability of the parallel solution on clusters, by varying the physical configuration and the dimension of the problem. Finally, the suitability of the heuristic used to assess the best achievable objective in the 4-(<i>N<SUP>2</SUP></i>-1) Puzzle is analyzed.MultiMice Air Hockey: A game with a low-cost non-conventional interfaceFlores Choque, DamiánCastro, Silvia MabelMartig, Sergio R.http://sedici.unlp.edu.ar:80/handle/10915/96732019-06-22T20:02:49Z2010-06-01T00:00:00ZArticulo
Journal of Computer Science & Technology; vol. 10, no. 2
Interaction between user and computer is gradually going beyond the traditional mouse and keyboard. New ways of interaction are emerging, which use new and different means for data acquisition. Virtual or augmented reality, haptic, tangible or camerabased user interfaces are all examples of this. Computer games take advantage of these new facilities, as they obtain the benefit of providing new user (player) experience with every new interface developed. In this article, we present a nonconventional user interface for the popular Air Hockey game. This interface is based on a table-like surface with support for multiple users. Additionally, it does not require special nor costly hardware.
2010-06-01T00:00:00ZInteraction between user and computer is gradually going beyond the traditional mouse and keyboard. New ways of interaction are emerging, which use new and different means for data acquisition. Virtual or augmented reality, haptic, tangible or camerabased user interfaces are all examples of this. Computer games take advantage of these new facilities, as they obtain the benefit of providing new user (player) experience with every new interface developed. In this article, we present a nonconventional user interface for the popular Air Hockey game. This interface is based on a table-like surface with support for multiple users. Additionally, it does not require special nor costly hardware.A defeasible logic programming approach to the integration of rules and ontologiesGómez, Sergio AlejandroChesñevar, Carlos IvánSimari, Guillermo Ricardohttp://sedici.unlp.edu.ar:80/handle/10915/96722019-06-22T20:02:47Z2010-06-01T00:00:00ZArticulo
Journal of Computer Science & Technology; vol. 10, no. 2
The Semantic Web is a vision of the current Web where resources have exact meaning assigned in terms of ontologies, thus enabling agents to reason about them. As inconsistencies cannot be treated by standard reasoning approaches, we use Defeasible Logic Programming (DeLP) to reason with possibly inconsistent ontologies. In this article we show how to integrate rules and ontologies in the Semantic Web. We present an approach that can be used to suitably extend the SWRL standard by incorporating classical and default negated literals in SemanticWeb rules in the presence of incomplete and possibly inconsistent information. The rules and ontologies will be interpreted as a DeLP program allowing the rules to reason on top of a set of (possibly inconsistent) ontologies.
2010-06-01T00:00:00ZThe Semantic Web is a vision of the current Web where resources have exact meaning assigned in terms of ontologies, thus enabling agents to reason about them. As inconsistencies cannot be treated by standard reasoning approaches, we use Defeasible Logic Programming (DeLP) to reason with possibly inconsistent ontologies. In this article we show how to integrate rules and ontologies in the Semantic Web. We present an approach that can be used to suitably extend the SWRL standard by incorporating classical and default negated literals in SemanticWeb rules in the presence of incomplete and possibly inconsistent information. The rules and ontologies will be interpreted as a DeLP program allowing the rules to reason on top of a set of (possibly inconsistent) ontologies.A Quantitative Framework for the Evaluation of Agile MethodologiesMendes Calo, KarlaEstévez, Elsa ClaraFillottrani, Pablo Rubénhttp://sedici.unlp.edu.ar:80/handle/10915/96712019-06-22T20:02:45Z2010-06-01T00:00:00ZArticulo
Journal of Computer Science & Technology; vol. 10, no. 2
The methodologies for agile software development are fundamentally based on the collaboration with software users during the entire development process, the simplicity to adapt the product to changes in requirements, and on the incremental product delivery. Based on the Agile Manifesto, they have been accepted and are successfully used in projects where the detailed requirements are unknown at first and are identified during the development process from the interactions with the users and the feedback thus obtained. In this paper, we propose an evaluation framework for the methodologies for agile software development. This framework is applied in detail to two of them -Scrum and eXtreme Programming (XP). The definition of this quantitative framework is innovative, especially because it allows the evaluation of how the agile methodologies satisfy the basic principles defined by the Agile Manifesto, thus it can be used when deciding which methodology to adopt in a particular project.
2010-06-01T00:00:00ZThe methodologies for agile software development are fundamentally based on the collaboration with software users during the entire development process, the simplicity to adapt the product to changes in requirements, and on the incremental product delivery. Based on the Agile Manifesto, they have been accepted and are successfully used in projects where the detailed requirements are unknown at first and are identified during the development process from the interactions with the users and the feedback thus obtained. In this paper, we propose an evaluation framework for the methodologies for agile software development. This framework is applied in detail to two of them -Scrum and eXtreme Programming (XP). The definition of this quantitative framework is innovative, especially because it allows the evaluation of how the agile methodologies satisfy the basic principles defined by the Agile Manifesto, thus it can be used when deciding which methodology to adopt in a particular project.Discovering geographic services from textual use casesSaldaño, Viviana E.Buccella, AgustinaCechich, Alejandrahttp://sedici.unlp.edu.ar:80/handle/10915/96702019-06-22T20:02:42Z2010-06-01T00:00:00ZArticulo
Journal of Computer Science & Technology; vol. 10, no. 2
Component Based Software Development (CBSD) relies upon utilization of previously developed software components OTS (Off-The-Shelf), which are appropriately merged to satisfy particular system requirements. However, wide acceptance of this paradigm at industry requires efficient component identification and selection, aspects which are being investigated until now.
In this context, this paper further explores the use of a geographic services taxonomy, which facilitates component identification, and is used by analysts in charge of developing a Geographic Information System (GIS) employing a CBSD approach.
In this article, different knowledge extraction techniques are evaluated and a methodology is proposed to standardize resultant vocabulary in order to allow automatic tools to support GIS services search.
2010-06-01T00:00:00ZComponent Based Software Development (CBSD) relies upon utilization of previously developed software components OTS (Off-The-Shelf), which are appropriately merged to satisfy particular system requirements. However, wide acceptance of this paradigm at industry requires efficient component identification and selection, aspects which are being investigated until now.
In this context, this paper further explores the use of a geographic services taxonomy, which facilitates component identification, and is used by analysts in charge of developing a Geographic Information System (GIS) employing a CBSD approach.
In this article, different knowledge extraction techniques are evaluated and a methodology is proposed to standardize resultant vocabulary in order to allow automatic tools to support GIS services search.Metric-temporal access methodsDe Battista, AnabellaHerrera, Norma EdithGutiérrez Retamal, Gilberto A.Pascal, Andréshttp://sedici.unlp.edu.ar:80/handle/10915/96692019-06-22T20:02:38Z2010-06-01T00:00:00ZArticulo
Journal of Computer Science & Technology; vol. 10, no. 2
Metric-temporal databases are a new database model that combines metric spaces with temporal databases to process similarity queries within a time interval or snapshot. The Historical FHQT is a metric-temporal index which has shown to be competitive answering this type of queries. This index store a list of valid snapshots where each one contains an Fixed Height Queries Tree that indexes all objects existing at that instant. In this paper we present an improvement to this access method that consists in using different sets of pivots for the Fixed Height Queries Tree that correspond to consecutive time instants. The experimental results show this modification improves the filtering capacity of the index.
2010-06-01T00:00:00ZMetric-temporal databases are a new database model that combines metric spaces with temporal databases to process similarity queries within a time interval or snapshot. The Historical FHQT is a metric-temporal index which has shown to be competitive answering this type of queries. This index store a list of valid snapshots where each one contains an Fixed Height Queries Tree that indexes all objects existing at that instant. In this paper we present an improvement to this access method that consists in using different sets of pivots for the Fixed Height Queries Tree that correspond to consecutive time instants. The experimental results show this modification improves the filtering capacity of the index.Globally optimal triangulations of minimum weight using Ant Colony Optimization metaheuristicDorzán, María GiselaGagliardi, Edilma OlindaLeguizamón, Mario GuillermoHernández Peñalver, Gregoriohttp://sedici.unlp.edu.ar:80/handle/10915/96682019-06-22T20:02:35Z2010-06-01T00:00:00ZArticulo
Journal of Computer Science & Technology; vol. 10, no. 2
Globally optimal triangulations are difficult to be found by deterministic methods as, for most type of criteria, no polynomial algorithm is known. In this work, we consider the Minimum Weight Triangulation (MWT) problem of a given set of n points in the plane. Our aim is to show how the Ant Colony Optimization (ACO) metaheuristic can be used to search for globally optimal triangulations of minimum weight. We present an experimental study for a set of instances for MWT problem. We create these instances since no reference to benchmarks for this problem were found in the literature. We assess through the experimental evaluation the applicability of the ACO metaheuristic for MWT problem.
2010-06-01T00:00:00ZGlobally optimal triangulations are difficult to be found by deterministic methods as, for most type of criteria, no polynomial algorithm is known. In this work, we consider the Minimum Weight Triangulation (MWT) problem of a given set of n points in the plane. Our aim is to show how the Ant Colony Optimization (ACO) metaheuristic can be used to search for globally optimal triangulations of minimum weight. We present an experimental study for a set of instances for MWT problem. We create these instances since no reference to benchmarks for this problem were found in the literature. We assess through the experimental evaluation the applicability of the ACO metaheuristic for MWT problem.