<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns="http://www.w3.org/2005/Atom">
<title>vol. 08, no. 02</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/392" rel="alternate"/>
<subtitle/>
<id>http://sedici.unlp.edu.ar:80/handle/10915/392</id>
<updated>2013-05-21T14:46:29Z</updated>
<dc:date>2013-05-21T14:46:29Z</dc:date>
<entry>
<title>Test of distributed applications migration to Web environments</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9635" rel="alternate"/>
<author>
<name>Ciolli, María Elena</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9635</id>
<updated>2013-04-12T13:30:04Z</updated>
<published>2008-01-01T00:00:00Z</published>
<summary type="text">Revision
Journal of Computer Science &amp; Technology; vol. 8, no. 2; http://sedici.unlp.edu.ar/handle/10915/4148
This essay is based on a previous “regression” testing knowledge, black box testing and user graphic interfaces testing. Besides, due to the fact that the testing life cycle is inside the software life cycle, the suggested focus promotes existing test cases rework, as a result of traceability of the use cases to the distributed system, the unique tests automation, integration and “regression”.
</summary>
<dc:date>2008-01-01T00:00:00Z</dc:date>
<dc:description>This essay is based on a previous “regression” testing knowledge, black box testing and user graphic interfaces testing. Besides, due to the fact that the testing life cycle is inside the software life cycle, the suggested focus promotes existing test cases rework, as a result of traceability of the use cases to the distributed system, the unique tests automation, integration and “regression”.</dc:description>
</entry>
<entry>
<title>Numerical methods for engineers (fifth edition). Steven Chapra and Raymond Canale. Mc Graw Hill, 2005</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9634" rel="alternate"/>
<author>
<name>Gaudiani, Adriana</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9634</id>
<updated>2013-04-19T14:04:25Z</updated>
<published>2008-01-01T00:00:00Z</published>
<summary type="text">Revision
Journal of Computer Science &amp; Technology; vol. 8, no. 2
With this book, the same as in previous editions, Chapra and Canale intend to provide a solid training in numerical methods by means of a pleasant and attractive approach that motivates the reader to study the subject and enjoy while doing it. The authors use programming as a powerful tool to implement models and experiment with them, generating a greater enthusiasm on the reader and, as a consequence, a better understanding of the problems developed, which are applied to Engineering and Physics.
</summary>
<dc:date>2008-01-01T00:00:00Z</dc:date>
<dc:description>With this book, the same as in previous editions, Chapra and Canale intend to provide a solid training in numerical methods by means of a pleasant and attractive approach that motivates the reader to study the subject and enjoy while doing it. The authors use programming as a powerful tool to implement models and experiment with them, generating a greater enthusiasm on the reader and, as a consequence, a better understanding of the problems developed, which are applied to Engineering and Physics.</dc:description>
</entry>
<entry>
<title>A tool for supporting the communication in distributed software development environment</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9633" rel="alternate"/>
<author>
<name>Freitas Guilhermino Trindade, Daniela de</name>
</author>
<author>
<name>Calvi Tait, Tania Fatima</name>
</author>
<author>
<name>Moriya Huzita, Elisa Hatsue</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9633</id>
<updated>2012-05-03T13:13:48Z</updated>
<published>2008-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol.8, no. 2
In the Distributed Software Development (DSD) is&#13;
fundamental the use of methodologies, techniques and tools&#13;
to support the communication and help teams physically&#13;
distributed in the activities accomplishment. The adequate&#13;
communication in the cooperative work aids in the activities&#13;
management, allows the identification of flaws and&#13;
deviations in the planning accomplishment, it facilitates the&#13;
conflicts solution, offers support to the decision making&#13;
process and also contributes to maintain the cohesion of the&#13;
team. This paper presents a tool that provides synchronous,&#13;
explicit and formal communication, for a Distributed&#13;
Software Development Environment. This tool, named&#13;
VIMEE (Virtual Distributed Meeting), allows relate to&#13;
CSCW (Computer Supported Cooperative Work) and DSD&#13;
areas; it defines a common workspace to manage the virtual&#13;
meeting, it supports the project management and the decision&#13;
making in group.
</summary>
<dc:date>2008-01-01T00:00:00Z</dc:date>
<dc:description>In the Distributed Software Development (DSD) is&#13;
fundamental the use of methodologies, techniques and tools&#13;
to support the communication and help teams physically&#13;
distributed in the activities accomplishment. The adequate&#13;
communication in the cooperative work aids in the activities&#13;
management, allows the identification of flaws and&#13;
deviations in the planning accomplishment, it facilitates the&#13;
conflicts solution, offers support to the decision making&#13;
process and also contributes to maintain the cohesion of the&#13;
team. This paper presents a tool that provides synchronous,&#13;
explicit and formal communication, for a Distributed&#13;
Software Development Environment. This tool, named&#13;
VIMEE (Virtual Distributed Meeting), allows relate to&#13;
CSCW (Computer Supported Cooperative Work) and DSD&#13;
areas; it defines a common workspace to manage the virtual&#13;
meeting, it supports the project management and the decision&#13;
making in group.</dc:description>
</entry>
<entry>
<title>Optimizing the spatial approximation tree from the root</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9632" rel="alternate"/>
<author>
<name>Gómez, Alejandro</name>
</author>
<author>
<name>Ludueña, Verónica</name>
</author>
<author>
<name>Reyes, Nora Susana</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9632</id>
<updated>2012-05-08T22:00:34Z</updated>
<published>2008-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 8, no. 2
Many computational applications need to look for information in a database. Nowadays, the predominance of nonconventional databases makes the similarity search (i.e., searching elements of the database that are "similar" to a given query) becomes a preponderant concept. The Spatial Approximation Tree has been shown that it compares favorably against alternative data structures for similarity searching in metric spaces of medium to high dimensionality ("difficult" spaces) or queries with low selectivity. However, for the construction process the tree root has been randomly selected and the tree ,in its shape and performance, is completely determined by this selection. Therefore, we are interested in improve mainly the searches in this data structure trying to select the tree root so to reflect some of the own characteristics of the metric space to be indexed. We regard that selecting the root in this way it allows a better adaption of the data structure to the intrinsic dimensionality of the metric space considered, so also it achieves more efficient similarity searches.
</summary>
<dc:date>2008-01-01T00:00:00Z</dc:date>
<dc:description>Many computational applications need to look for information in a database. Nowadays, the predominance of nonconventional databases makes the similarity search (i.e., searching elements of the database that are "similar" to a given query) becomes a preponderant concept. The Spatial Approximation Tree has been shown that it compares favorably against alternative data structures for similarity searching in metric spaces of medium to high dimensionality ("difficult" spaces) or queries with low selectivity. However, for the construction process the tree root has been randomly selected and the tree ,in its shape and performance, is completely determined by this selection. Therefore, we are interested in improve mainly the searches in this data structure trying to select the tree root so to reflect some of the own characteristics of the metric space to be indexed. We regard that selecting the root in this way it allows a better adaption of the data structure to the intrinsic dimensionality of the metric space considered, so also it achieves more efficient similarity searches.</dc:description>
</entry>
<entry>
<title>Dynamic routing balancing on InfiniBand network</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9631" rel="alternate"/>
<author>
<name>Lugones, Diego</name>
</author>
<author>
<name>Franco, Daniel</name>
</author>
<author>
<name>Luque Fadón, Emilio</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9631</id>
<updated>2012-05-03T13:13:48Z</updated>
<published>2008-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 8, no. 2
InfiniBand (IBA) technology was developed to address the&#13;
performance issues associated with messages movement&#13;
among Endnodes and computer I/O devices. However,&#13;
InfiniBand is also widely deployed within high&#13;
performance computing (HPC) clusters due to the high&#13;
bandwidth and low message latency attributes it offers to&#13;
inter-processor communication systems.&#13;
An interconnection-network efficient design is mandatory&#13;
because its great impact on the parallel computer&#13;
performance. Therefore, a high speed routing scheme that&#13;
minimizes congestion and avoids hot-spot areas should be&#13;
included in the network components. We have developed&#13;
Dynamic Routing Balancing (DRB), an adaptive routing&#13;
mechanism that balances the communication traffic over&#13;
the interconnection network. It is based on limited and&#13;
load-controlled multipath expansion in order to maintain&#13;
low and bounded network latency. In this work, we&#13;
propose using DRB as the congestion control mechanism&#13;
for InfiniBand networks. Experimentation shows that our&#13;
method achieves significant performance improvement&#13;
over the original InfiniBand technique which is based on&#13;
message throttling. An improvement up to 66% for latency&#13;
and 35% for throughput is achieved for the networks&#13;
under analysis. Finally, the proposed mechanism use the&#13;
management model defined in InfiniBand specs, thus full&#13;
compatibility is provided.
</summary>
<dc:date>2008-01-01T00:00:00Z</dc:date>
<dc:description>InfiniBand (IBA) technology was developed to address the&#13;
performance issues associated with messages movement&#13;
among Endnodes and computer I/O devices. However,&#13;
InfiniBand is also widely deployed within high&#13;
performance computing (HPC) clusters due to the high&#13;
bandwidth and low message latency attributes it offers to&#13;
inter-processor communication systems.&#13;
An interconnection-network efficient design is mandatory&#13;
because its great impact on the parallel computer&#13;
performance. Therefore, a high speed routing scheme that&#13;
minimizes congestion and avoids hot-spot areas should be&#13;
included in the network components. We have developed&#13;
Dynamic Routing Balancing (DRB), an adaptive routing&#13;
mechanism that balances the communication traffic over&#13;
the interconnection network. It is based on limited and&#13;
load-controlled multipath expansion in order to maintain&#13;
low and bounded network latency. In this work, we&#13;
propose using DRB as the congestion control mechanism&#13;
for InfiniBand networks. Experimentation shows that our&#13;
method achieves significant performance improvement&#13;
over the original InfiniBand technique which is based on&#13;
message throttling. An improvement up to 66% for latency&#13;
and 35% for throughput is achieved for the networks&#13;
under analysis. Finally, the proposed mechanism use the&#13;
management model defined in InfiniBand specs, thus full&#13;
compatibility is provided.</dc:description>
</entry>
<entry>
<title>Control Evaluation in a LVoD System Based on a Peer-to-Peer Multicast Scheme</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9630" rel="alternate"/>
<author>
<name>Godoi, Rodrigo</name>
</author>
<author>
<name>Hernández, Porfidio</name>
</author>
<author>
<name>Luque Fadón, Emilio</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9630</id>
<updated>2012-05-03T13:13:48Z</updated>
<published>2008-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 8, no. 2
Providing Quality of Service (QoS) in Video on Demand&#13;
systems (VoD) is a challenging problem. In this paper, we&#13;
analyse the fault tolerance on a P2P multicast delivery&#13;
scheme, called Patch Collaboration Manager / Multicast&#13;
Channel Distributed Branching (PCM/MCDB) [01]. This&#13;
scheme decentralizes the delivery process between clients&#13;
and scales the VoD server performance. PCM/MCDB&#13;
synchronizes a group of clients in order to create local&#13;
network channels to replace on-going multicast channels&#13;
from the VoD server. Using the P2P paradigm supposes&#13;
facing the challenge of how often peers connect and&#13;
disconnect from the system. To address this problem, a&#13;
centralized mechanism is able to replace the failed client.&#13;
We evaluate the failure management process of the&#13;
centralized scheme in terms of the overhead injected into&#13;
the network and analyse the applicability of a distributed&#13;
approach to managing the process. Analytical models are&#13;
developed for centralized and distributed approaches.&#13;
Their behaviour are compared in order to evaluate whether&#13;
the distributed scheme can improve the fault management&#13;
process, in terms of reducing server load and generating&#13;
better scalability.
</summary>
<dc:date>2008-01-01T00:00:00Z</dc:date>
<dc:description>Providing Quality of Service (QoS) in Video on Demand&#13;
systems (VoD) is a challenging problem. In this paper, we&#13;
analyse the fault tolerance on a P2P multicast delivery&#13;
scheme, called Patch Collaboration Manager / Multicast&#13;
Channel Distributed Branching (PCM/MCDB) [01]. This&#13;
scheme decentralizes the delivery process between clients&#13;
and scales the VoD server performance. PCM/MCDB&#13;
synchronizes a group of clients in order to create local&#13;
network channels to replace on-going multicast channels&#13;
from the VoD server. Using the P2P paradigm supposes&#13;
facing the challenge of how often peers connect and&#13;
disconnect from the system. To address this problem, a&#13;
centralized mechanism is able to replace the failed client.&#13;
We evaluate the failure management process of the&#13;
centralized scheme in terms of the overhead injected into&#13;
the network and analyse the applicability of a distributed&#13;
approach to managing the process. Analytical models are&#13;
developed for centralized and distributed approaches.&#13;
Their behaviour are compared in order to evaluate whether&#13;
the distributed scheme can improve the fault management&#13;
process, in terms of reducing server load and generating&#13;
better scalability.</dc:description>
</entry>
<entry>
<title>A domotic system with remote access based on web services</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9629" rel="alternate"/>
<author>
<name>Pardo, Mauricio Esteban</name>
</author>
<author>
<name>Strack, Guillermo</name>
</author>
<author>
<name>Martínez, Diego C.</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9629</id>
<updated>2012-05-03T13:13:48Z</updated>
<published>2008-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 8, no. 2
Domotics systems are intelligent systems for houses and&#13;
apartments to control several issues as security and light or&#13;
climate devices. In this work we present the development&#13;
of an economic domotic system to control different&#13;
electrical devices in a private house. This is achieved&#13;
either from inside the building or by remote control using&#13;
a regular Internet connection. In order to provide this&#13;
functionality, the system includes a server that provides&#13;
web services to the controlling applications in the house.&#13;
This server also offers an interface that uses AJAX to&#13;
optimize device handling.
</summary>
<dc:date>2008-01-01T00:00:00Z</dc:date>
<dc:description>Domotics systems are intelligent systems for houses and&#13;
apartments to control several issues as security and light or&#13;
climate devices. In this work we present the development&#13;
of an economic domotic system to control different&#13;
electrical devices in a private house. This is achieved&#13;
either from inside the building or by remote control using&#13;
a regular Internet connection. In order to provide this&#13;
functionality, the system includes a server that provides&#13;
web services to the controlling applications in the house.&#13;
This server also offers an interface that uses AJAX to&#13;
optimize device handling.</dc:description>
</entry>
<entry>
<title>Identifier Management and Resolution: Conforming the IEEE Standard for Learning Object Metadata</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9628" rel="alternate"/>
<author>
<name>Godoy, Roberto</name>
</author>
<author>
<name>Minni, Hugo</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9628</id>
<updated>2012-05-03T13:13:49Z</updated>
<published>2008-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 8, no. 2
Uniform Resource Identifiers are an integral part of the current Architecture of the World Wide Web. This work analyzes the implications and possibilities of using Universal Resource Names as unique and persistent identifiers in systems for management of decentralized content and federated collections. Particularly, discussion focuses on applying such identifiers on the context of a learning object repository that the authors are developing at Universidad Nacional del Litoral, according to the IEEE 1484.12.1 standard for Learning Object Metadata. It is explained why Uniform Resource Locators are inadequate, and why Universal Resource Names are preferable. A standardized resolution service over Hypertext Transfer Protocol is recommended for locating resources, and usage of Uniform Resource Characteristics for accessing Learning Object Metadata is proposed. Finally, a content-negotiation mechanism for selecting the best representation among several format or language variants is outlined. The proposed naming schema provides a doubleindirection mechanism, comparable to the Human- Friendly Names approach proposed by Ballintijn, van Steen, and Tanenbaum for improving scalability and usability in naming replicated resources.
</summary>
<dc:date>2008-01-01T00:00:00Z</dc:date>
<dc:description>Uniform Resource Identifiers are an integral part of the current Architecture of the World Wide Web. This work analyzes the implications and possibilities of using Universal Resource Names as unique and persistent identifiers in systems for management of decentralized content and federated collections. Particularly, discussion focuses on applying such identifiers on the context of a learning object repository that the authors are developing at Universidad Nacional del Litoral, according to the IEEE 1484.12.1 standard for Learning Object Metadata. It is explained why Uniform Resource Locators are inadequate, and why Universal Resource Names are preferable. A standardized resolution service over Hypertext Transfer Protocol is recommended for locating resources, and usage of Uniform Resource Characteristics for accessing Learning Object Metadata is proposed. Finally, a content-negotiation mechanism for selecting the best representation among several format or language variants is outlined. The proposed naming schema provides a doubleindirection mechanism, comparable to the Human- Friendly Names approach proposed by Ballintijn, van Steen, and Tanenbaum for improving scalability and usability in naming replicated resources.</dc:description>
</entry>
<entry>
<title>XM-Tree, a new index for web information retrieval</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9627" rel="alternate"/>
<author>
<name>Deco, Claudia</name>
</author>
<author>
<name>Pierángeli, Guillermo</name>
</author>
<author>
<name>Bender, Cristina</name>
</author>
<author>
<name>Reyes, Nora Susana</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9627</id>
<updated>2012-05-03T13:13:49Z</updated>
<published>2008-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 8, no. 2
Web Information Retrieval is another problem of searching elements of a set that are closest to a given query under a certain similarity criterion. It is of interest to take advantage of metric spaces in order to solve a search in an effective and efficient way. In this article, we present an extension of the M-Tree index, called XM-Tree, in order to improve search results. This index allows dynamic insertion of new data, reduces search costs using pruning and precalculated distances, and uses a tolerable amount of space, which makes this index apt for the extensive and dynamic Web. The proposed extension indexes Web documents, uses L&lt;sub&gt;2&lt;/sub&gt; as indexing distance and L&lt;sub&gt;&amp;#8734;&lt;/sub&gt; as similarity criterion to solve queries. We also present experiments validating the results.
</summary>
<dc:date>2008-01-01T00:00:00Z</dc:date>
<dc:description>Web Information Retrieval is another problem of searching elements of a set that are closest to a given query under a certain similarity criterion. It is of interest to take advantage of metric spaces in order to solve a search in an effective and efficient way. In this article, we present an extension of the M-Tree index, called XM-Tree, in order to improve search results. This index allows dynamic insertion of new data, reduces search costs using pruning and precalculated distances, and uses a tolerable amount of space, which makes this index apt for the extensive and dynamic Web. The proposed extension indexes Web documents, uses L&lt;sub&gt;2&lt;/sub&gt; as indexing distance and L&lt;sub&gt;&amp;#8734;&lt;/sub&gt; as similarity criterion to solve queries. We also present experiments validating the results.</dc:description>
</entry>
<entry>
<title>Using Exception Handling to Build Opaque Predicates in Intermediate Code Obfuscation Techniques</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9626" rel="alternate"/>
<author>
<name>Dolz, Daniel</name>
</author>
<author>
<name>Parra, Gerardo</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9626</id>
<updated>2012-05-03T13:13:49Z</updated>
<published>2008-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 8, no. 2
Microsoft's .NET Framework, and JAVA platforms, are based in a just-in-time compilation philosophy. Software developed using these technologies is executed in a hardware independent framework, which provides a full object-oriented&#13;
environment, and in some cases allows the interaction&#13;
of several components written in different programming languages. This flexibility is achieved by compiling into an intermediate code which is platform independent. Java is compiled into ByteCode, and Microsoft .NET programs&#13;
are compiled into MSIL (Microsoft Intermediate Code). However, this flexibility comes with a price. With freeware tools available in Internet, it is quite easy to decompile intermediate codes and obtain a working, readable version of the source&#13;
code. Obfuscation is the most accepted and commercially&#13;
available technique that developers can use to protect their intellectual property In this work, we propose the use of try-catch mechanisms available in .NET as a way to improve the quality of one of the building blocks of obfuscation:&#13;
opaque predicates.
</summary>
<dc:date>2008-01-01T00:00:00Z</dc:date>
<dc:description>Microsoft's .NET Framework, and JAVA platforms, are based in a just-in-time compilation philosophy. Software developed using these technologies is executed in a hardware independent framework, which provides a full object-oriented&#13;
environment, and in some cases allows the interaction&#13;
of several components written in different programming languages. This flexibility is achieved by compiling into an intermediate code which is platform independent. Java is compiled into ByteCode, and Microsoft .NET programs&#13;
are compiled into MSIL (Microsoft Intermediate Code). However, this flexibility comes with a price. With freeware tools available in Internet, it is quite easy to decompile intermediate codes and obtain a working, readable version of the source&#13;
code. Obfuscation is the most accepted and commercially&#13;
available technique that developers can use to protect their intellectual property In this work, we propose the use of try-catch mechanisms available in .NET as a way to improve the quality of one of the building blocks of obfuscation:&#13;
opaque predicates.</dc:description>
</entry>
<entry>
<title>Automatic Spot Adressing in cDNA Microarray Images</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9625" rel="alternate"/>
<author>
<name>Larese, Mónica</name>
</author>
<author>
<name>Gómez, Juan Carlos</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9625</id>
<updated>2013-04-19T14:03:09Z</updated>
<published>2008-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 8, no. 2
Complementary DNA (cDNA) microarrays are a powerful high throughput technology developed in the last decade allowing researchers to analyze the behaviour and interaction of thousands of genes simultaneously. The large amount of information provided by microarray images requires automatic techniques to develop accurate and efﬁcient processing.&#13;
Each spot in the microarray contains the hybridization level of a single gene. One of the most important features of these images are the regularity and pseudo-periodicity implicit in the spot arrangement.&#13;
In this paper, an automatic approach based on texture analysis characterization techniques is proposed to localize spots in microarray images. The method estimates the displacement vectors which characterize the texture (i.e. the spot arrangement). This is achieved by means of applying the generalized Hough transform on the 2D autocorrelation function previously segmented via morphological operations. The obtained displacement vectors are used to generate a grid template which overlaps the original image. The Root-Mean-Square-Error (RMSE) between the estimated locations and the ones computed via a semiautomatic tool is calculated to evaluate the accuracy of the process. The method yields promising results.
</summary>
<dc:date>2008-01-01T00:00:00Z</dc:date>
<dc:description>Complementary DNA (cDNA) microarrays are a powerful high throughput technology developed in the last decade allowing researchers to analyze the behaviour and interaction of thousands of genes simultaneously. The large amount of information provided by microarray images requires automatic techniques to develop accurate and efﬁcient processing.&#13;
Each spot in the microarray contains the hybridization level of a single gene. One of the most important features of these images are the regularity and pseudo-periodicity implicit in the spot arrangement.&#13;
In this paper, an automatic approach based on texture analysis characterization techniques is proposed to localize spots in microarray images. The method estimates the displacement vectors which characterize the texture (i.e. the spot arrangement). This is achieved by means of applying the generalized Hough transform on the 2D autocorrelation function previously segmented via morphological operations. The obtained displacement vectors are used to generate a grid template which overlaps the original image. The Root-Mean-Square-Error (RMSE) between the estimated locations and the ones computed via a semiautomatic tool is calculated to evaluate the accuracy of the process. The method yields promising results.</dc:description>
</entry>
<entry>
<title>Analyzing and Improving Data Quality</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9624" rel="alternate"/>
<author>
<name>Buccella, Agustina</name>
</author>
<author>
<name>Cechich, Alejandra</name>
</author>
<author>
<name>Domingo, Gonzalo</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9624</id>
<updated>2013-04-19T13:59:52Z</updated>
<published>2008-01-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 8, no. 2
Data quality is a research area strongly investigated during the 90’s. However, few companies in Argentina apply data quality methodologies or tools during the analysis, design or implementation phases of software development process. Developers generally use techniques to design systems such as UML without considering mechanisms for future data quality problems.&#13;
In this work we propose a methodology in which the data quality is an essential part of the whole software development process. Early design decisions on data quality strongly impact on the system. Our methodology deﬁnes a set of practices to be applied on the software life cycle. In addition these practices act as a means to evaluate if systems already running fulﬁll with minimal data quality requirements.
</summary>
<dc:date>2008-01-01T00:00:00Z</dc:date>
<dc:description>Data quality is a research area strongly investigated during the 90’s. However, few companies in Argentina apply data quality methodologies or tools during the analysis, design or implementation phases of software development process. Developers generally use techniques to design systems such as UML without considering mechanisms for future data quality problems.&#13;
In this work we propose a methodology in which the data quality is an essential part of the whole software development process. Early design decisions on data quality strongly impact on the system. Our methodology deﬁnes a set of practices to be applied on the software life cycle. In addition these practices act as a means to evaluate if systems already running fulﬁll with minimal data quality requirements.</dc:description>
</entry>
</feed>
