<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Volumen 06 | Número 01</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/383</link>
<description/>
<pubDate>Wed, 18 Nov 2026 21:41:51 GMT</pubDate>
<dc:date>2026-11-18T21:41:51Z</dc:date>
<item>
<title>Ubiquigeneous networking: a distributed networking application over mobile embedded devices</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9519</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 6, no. 1
Resumen de la tesis del autor para obtener el grado de Magister en Redes de Datos de la Facultad de Informática de la UNLP, dirigida por Luis Armando Marrone.
Es revisión de: http://sedici.unlp.edu.ar/handle/10915/4107
</description>
<pubDate>Sat, 01 Apr 2006 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9519</guid>
<dc:date>2006-04-01T00:00:00Z</dc:date>
<dc:description>Resumen de la tesis del autor para obtener el grado de Magister en Redes de Datos de la Facultad de Informática de la UNLP, dirigida por Luis Armando Marrone.</dc:description>
</item>
<item>
<title>&lt;i&gt;The Linux Enterprise Cluster&lt;/i&gt;, Karl Kopper: No Starch Press, 2005</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9518</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 6, no. 1
This book focuses on Load Balance and High Availability clustering, clearly aiming at the practitioner. It intends to help a technical user design, build and maintain clustered services from the ground up. Theory on clusters and High Availability is skimmed through or not presented at all. However, the book makes for a complete and useful manual on tools and techniques commonly used in the domain. High Performance clustering, on the other hand, falls out of scope.
</description>
<pubDate>Sat, 01 Apr 2006 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9518</guid>
<dc:date>2006-04-01T00:00:00Z</dc:date>
<dc:description>This book focuses on Load Balance and High Availability clustering, clearly aiming at the practitioner. It intends to help a technical user design, build and maintain clustered services from the ground up. Theory on clusters and High Availability is skimmed through or not presented at all. However, the book makes for a complete and useful manual on tools and techniques commonly used in the domain. High Performance clustering, on the other hand, falls out of scope.</dc:description>
</item>
<item>
<title>Wavelets bases defined over tetrahedra</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9517</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 6, no.1
In this paper we define two wavelets bases over tetrahedra which are generated by a regular subdivision method. One of them is a basis based on vertices while the other one is a Haar-like basis that form an unconditional basis for L&lt;sub&gt;p&lt;/sub&gt; (T, Σ, μ), 1 &lt; p &lt; ∞, being μ the Lebesgue measure and Σ the σ - algebra of all tetrahedra generated from a tetrahedron T by the chosen subdivision method. In order to obtain more vanishing moments, the lifting scheme has been applied to both of them
</description>
<pubDate>Sat, 01 Apr 2006 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9517</guid>
<dc:date>2006-04-01T00:00:00Z</dc:date>
<dc:description>In this paper we define two wavelets bases over tetrahedra which are generated by a regular subdivision method. One of them is a basis based on vertices while the other one is a Haar-like basis that form an unconditional basis for L&lt;sub&gt;p&lt;/sub&gt; (T, Σ, μ), 1 &lt; p &lt; ∞, being μ the Lebesgue measure and Σ the σ - algebra of all tetrahedra generated from a tetrahedron T by the chosen subdivision method. In order to obtain more vanishing moments, the lifting scheme has been applied to both of them</dc:description>
</item>
<item>
<title>Adaptive Ttwo-phase spatial association rules mining method</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9516</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 6, no. 1
Since huge amounts of spatial data can be easily collected from various applications, ranging from remote sensing technology to geographical information system, the extraction and comprehension of spatial knowledge is a more and more important task. Many excellent studies on Remote Sensed Image (RSI) have been conducted for potential relationships of crop yield. However, most of them suffer from the performance problem because their techniques for mining association rules are based on Apriori algorithm. In this paper, two efficient algorithms, two-phase spatial association rules mining and adaptive two-phase spatial association rules mining, are proposed for address the above problem. Both methods primarily conduct two phase algorithms by creating Histogram Generators for fast generating coarse-grained spatial association rules, and further mining the fine-grained spatial association rules w.r.t the coarse-grained frequently patterns obtained in the first phase. Adaptive two-phase spatial association rules mining method conducts the idea of partition on an image for efficiently quantizing out non-frequent patterns and thus facilitate the following two phase process. Such two-phase approaches save much computations and will be shown by lots of experimental results in the paper.
</description>
<pubDate>Sat, 01 Apr 2006 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9516</guid>
<dc:date>2006-04-01T00:00:00Z</dc:date>
<dc:description>Since huge amounts of spatial data can be easily collected from various applications, ranging from remote sensing technology to geographical information system, the extraction and comprehension of spatial knowledge is a more and more important task. Many excellent studies on Remote Sensed Image (RSI) have been conducted for potential relationships of crop yield. However, most of them suffer from the performance problem because their techniques for mining association rules are based on Apriori algorithm. In this paper, two efficient algorithms, two-phase spatial association rules mining and adaptive two-phase spatial association rules mining, are proposed for address the above problem. Both methods primarily conduct two phase algorithms by creating Histogram Generators for fast generating coarse-grained spatial association rules, and further mining the fine-grained spatial association rules w.r.t the coarse-grained frequently patterns obtained in the first phase. Adaptive two-phase spatial association rules mining method conducts the idea of partition on an image for efficiently quantizing out non-frequent patterns and thus facilitate the following two phase process. Such two-phase approaches save much computations and will be shown by lots of experimental results in the paper.</dc:description>
</item>
<item>
<title>Buckets inverted lists for a search engine with BSP</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9515</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 6, no. 1
Most information in science, engineering and business has been recorded in form of text. This information can be found online in the World-Wide-Web. One of the major tools to support information access are the search engines which usually use information retrieval techniques to rank Web pages based on a simple query and an index structure like the inverted lists. The retrieval models are the basis for the algorithms that score and rank the Web pages. The focus of this presentation is to show some inverted lists alternatives, based on buckets, for an information retrieval system. The main interest is how query performance is effected by the index organization on a cluster of PCs. The server design is effected on top of the parallel computing model Bulk Synchronous Parallel-BSP.
</description>
<pubDate>Sat, 01 Apr 2006 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9515</guid>
<dc:date>2006-04-01T00:00:00Z</dc:date>
<dc:description>Most information in science, engineering and business has been recorded in form of text. This information can be found online in the World-Wide-Web. One of the major tools to support information access are the search engines which usually use information retrieval techniques to rank Web pages based on a simple query and an index structure like the inverted lists. The retrieval models are the basis for the algorithms that score and rank the Web pages. The focus of this presentation is to show some inverted lists alternatives, based on buckets, for an information retrieval system. The main interest is how query performance is effected by the index organization on a cluster of PCs. The server design is effected on top of the parallel computing model Bulk Synchronous Parallel-BSP.</dc:description>
</item>
<item>
<title>A single-version scheme of fault tolerant computing</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9514</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 6, no. 1
This paper describes how to design low-cost reliable computing software for various application systems, by incorporating a single-version fault tolerant scheme along with run-time signature-based control-flow checking. Most of the ordinary systems lack fault tolerant software fix. The conventional fault tolerant approaches viz., Recovery Block (RB), N Version Programming (NVP) etc., are too costly to fix in an ordinary low-cost application system because, both the RB and NVP rely on multiple (at least three) versions of both software and computing machines. However, the proposed approach needs a single version (SV) of an enhanced application program that gets executed on one computing machine only. It is common that we often face interrupted service (caused either by an intermittent fault in an application program or in hardware), during the service delivery period of an ordinary cheaper application system. Execution of an application program often show malfunctions or it gets interrupted due to memory bit errors. Error Correction Codes (ECC) (viz., parity, Hamming codes, CRC etc.,) that are used in memory, are not as effective for online correction of multiple bit errors, as they are, for the detection of few bit errors. Again, software implemented ECC has a significant overhead over both time and code redundancy. In other words, built in ECC in memory, cannot recover all bit errors but can detect only. As a result, if an error is detected by ECC, the application program needs to be restarted for its re-execution afresh in various microprocessor based application systems. So, the ECC alone is useful for designing a fail-stop kind of system but it suffers from high time redundancy. Other software implemented fault- tolerance schemes are also towards fail-stop kind. But, the proposed (SV) based approach is capable of tolerating such errors without stopping the execution of an application. This SV Scheme (SVS) aims to provide an uninterrupted service at no extra money, but at an acceptable more execution time and memory space. This SV is a non- fail-stop kind fault tolerance scheme that can be implemented in various computing systems without spending an additional money, and as a result, major part of common people in our society, can gain reliable service from the low-cost, SV-based computing system.
</description>
<pubDate>Sat, 01 Apr 2006 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9514</guid>
<dc:date>2006-04-01T00:00:00Z</dc:date>
<dc:description>This paper describes how to design low-cost reliable computing software for various application systems, by incorporating a single-version fault tolerant scheme along with run-time signature-based control-flow checking. Most of the ordinary systems lack fault tolerant software fix. The conventional fault tolerant approaches viz., Recovery Block (RB), N Version Programming (NVP) etc., are too costly to fix in an ordinary low-cost application system because, both the RB and NVP rely on multiple (at least three) versions of both software and computing machines. However, the proposed approach needs a single version (SV) of an enhanced application program that gets executed on one computing machine only. It is common that we often face interrupted service (caused either by an intermittent fault in an application program or in hardware), during the service delivery period of an ordinary cheaper application system. Execution of an application program often show malfunctions or it gets interrupted due to memory bit errors. Error Correction Codes (ECC) (viz., parity, Hamming codes, CRC etc.,) that are used in memory, are not as effective for online correction of multiple bit errors, as they are, for the detection of few bit errors. Again, software implemented ECC has a significant overhead over both time and code redundancy. In other words, built in ECC in memory, cannot recover all bit errors but can detect only. As a result, if an error is detected by ECC, the application program needs to be restarted for its re-execution afresh in various microprocessor based application systems. So, the ECC alone is useful for designing a fail-stop kind of system but it suffers from high time redundancy. Other software implemented fault- tolerance schemes are also towards fail-stop kind. But, the proposed (SV) based approach is capable of tolerating such errors without stopping the execution of an application. This SV Scheme (SVS) aims to provide an uninterrupted service at no extra money, but at an acceptable more execution time and memory space. This SV is a non- fail-stop kind fault tolerance scheme that can be implemented in various computing systems without spending an additional money, and as a result, major part of common people in our society, can gain reliable service from the low-cost, SV-based computing system.</dc:description>
</item>
<item>
<title>Implementation of high-speed fixed-point dividers on FPGA</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9513</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 6, no. 1
Study deals with implementations of fixed-point division modules based on different algorithms on basis of Xilinx FPGAs. We show that our implementation of the nonrestoring algorithm is significantly faster and smaller than the 32-bit IP Core "Pipelined Divider" from Xilinx. For example, the speed of the 32-bit designed module is almost 245 MHz vs. 193 MHz from Xilinx divider. Moreover, high-speed parameterized modules are designed to provide arbitrary precision of the fixed-point division, for example, with 64-bit or 128-bit operands and large fixedpoint result.
</description>
<pubDate>Sat, 01 Apr 2006 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9513</guid>
<dc:date>2006-04-01T00:00:00Z</dc:date>
<dc:description>Study deals with implementations of fixed-point division modules based on different algorithms on basis of Xilinx FPGAs. We show that our implementation of the nonrestoring algorithm is significantly faster and smaller than the 32-bit IP Core "Pipelined Divider" from Xilinx. For example, the speed of the 32-bit designed module is almost 245 MHz vs. 193 MHz from Xilinx divider. Moreover, high-speed parameterized modules are designed to provide arbitrary precision of the fixed-point division, for example, with 64-bit or 128-bit operands and large fixedpoint result.</dc:description>
</item>
<item>
<title>Toward Energy-Efficient High-Performance Organizations of the Memory Hierarchy in Chip-Multiprocessors Architectures</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9512</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 6, no. 1
Chip-multiprocessor systems or CMPs have emerged as a high-perfomance organization for the increasing number of transistors available on a chip, and are projected to dominate the market of server and desktop computers. CMPs require innovative designs of on-chip memory hierarchies, especially designed to address the problems that arise in this novel kind of architecture: higher memory bandwidh demand from more processing cores and the increasing latency of off-chip cache misses. Moreover, the energy consumption topic is even more pressing than in traditionalmultiprocessors, as the CMPs are commonly used in embedded systems. This paper presents a survey of some of the proposals that have recently appeared facing these topics.
</description>
<pubDate>Sat, 01 Apr 2006 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9512</guid>
<dc:date>2006-04-01T00:00:00Z</dc:date>
<dc:description>Chip-multiprocessor systems or CMPs have emerged as a high-perfomance organization for the increasing number of transistors available on a chip, and are projected to dominate the market of server and desktop computers. CMPs require innovative designs of on-chip memory hierarchies, especially designed to address the problems that arise in this novel kind of architecture: higher memory bandwidh demand from more processing cores and the increasing latency of off-chip cache misses. Moreover, the energy consumption topic is even more pressing than in traditionalmultiprocessors, as the CMPs are commonly used in embedded systems. This paper presents a survey of some of the proposals that have recently appeared facing these topics.</dc:description>
</item>
<item>
<title>A Fault Diagnosis Scheme and Its Quality Issue in Reconfigurable Array Architecture</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9511</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 6, no. 1
In this paper, we propose an efficient diagnosis scheme to detect and locate the switching network defects/faults in reconfigurable array architecture. This diagnosis scheme performs the test of switching network based on the scan path and fault intersection test methodology to locate the faults occurring in the switching network. After the diagnosis of switching network, the processing element (PE) test can then be initiated through the good switches and links. Errors in testing that cause a good switch, link or PE to be considered as a bad one is called "killing error". The issue of killing error in testing is addressed and the probability of killing error for our diagnosis technique is analyzed and shown to be extremely low. The significance of this approach is the ability to detect and locate the multiple faults in switches, links, and PEs with low testing circuit overhead, and to offer the good test quality in linear diagnosis time.
</description>
<pubDate>Sat, 01 Apr 2006 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9511</guid>
<dc:date>2006-04-01T00:00:00Z</dc:date>
<dc:description>In this paper, we propose an efficient diagnosis scheme to detect and locate the switching network defects/faults in reconfigurable array architecture. This diagnosis scheme performs the test of switching network based on the scan path and fault intersection test methodology to locate the faults occurring in the switching network. After the diagnosis of switching network, the processing element (PE) test can then be initiated through the good switches and links. Errors in testing that cause a good switch, link or PE to be considered as a bad one is called "killing error". The issue of killing error in testing is addressed and the probability of killing error for our diagnosis technique is analyzed and shown to be extremely low. The significance of this approach is the ability to detect and locate the multiple faults in switches, links, and PEs with low testing circuit overhead, and to offer the good test quality in linear diagnosis time.</dc:description>
</item>
</channel>
</rss>
