<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Volumen 14 | Número 02</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/41793</link>
<description/>
<pubDate>Sat, 31 Oct 2026 23:09:28 GMT</pubDate>
<dc:date>2026-10-31T23:09:28Z</dc:date>
<item>
<title>Principles of distributed database systems, third edition: Tamer Özsu, Patrick Valduriez; Springer – 2011; ISBN 978-1-4419-8833-1</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/41818</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 14, no. 2
We could consider this book as a classical one from many points of view. To start with, the book is the third in a series of editions since the first one more than 20 years ago, thus containing the evolution in the field of distributed databases as well as the basic concepts which are not strongly affected by technology evolution. The thorough review of relational databases as well as a discussion of several aspects of distributed systems (as computer networks) in Chapter 2 makes the book highly self-contained, enhancing reading and understanding underlying principles. The book covers all the problems expected to be encountered in distributed databases.&#13;
&#13;
&lt;i&gt;(Párrafo extraído del texto a modo de resumen)&lt;/i&gt;
</description>
<pubDate>Wed, 01 Oct 2014 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/41818</guid>
<dc:date>2014-10-01T00:00:00Z</dc:date>
<dc:description>We could consider this book as a classical one from many points of view. To start with, the book is the third in a series of editions since the first one more than 20 years ago, thus containing the evolution in the field of distributed databases as well as the basic concepts which are not strongly affected by technology evolution. The thorough review of relational databases as well as a discussion of several aspects of distributed systems (as computer networks) in Chapter 2 makes the book highly self-contained, enhancing reading and understanding underlying principles. The book covers all the problems expected to be encountered in distributed databases.&#13;
&#13;
&lt;i&gt;(Párrafo extraído del texto a modo de resumen)&lt;/i&gt;</dc:description>
</item>
<item>
<title>Scalable and autonomic management to computer networks</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/41817</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 14, no. 2
This work aims at designing a solution for network autonomic management that provides, among other things, a feature of scalability in the verification of new network solutions with a case study on the flow allocation. To do so, we developed a self-managed framework to be used in several scalable scenarios, which were generated through the conception of a strategy of network partitioning (Network Partitioning Computing Engine or NPCE). NPCE simultaneously considers a set of specified requirements as quality of service parameters and execution time in the search for new configurations. Results demonstrate autonomic solution feasibility through tests in scenarios with different topologies, traffic profiles and with applying random failures.
</description>
<pubDate>Wed, 01 Oct 2014 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/41817</guid>
<dc:date>2014-10-01T00:00:00Z</dc:date>
<dc:description>This work aims at designing a solution for network autonomic management that provides, among other things, a feature of scalability in the verification of new network solutions with a case study on the flow allocation. To do so, we developed a self-managed framework to be used in several scalable scenarios, which were generated through the conception of a strategy of network partitioning (Network Partitioning Computing Engine or NPCE). NPCE simultaneously considers a set of specified requirements as quality of service parameters and execution time in the search for new configurations. Results demonstrate autonomic solution feasibility through tests in scenarios with different topologies, traffic profiles and with applying random failures.</dc:description>
</item>
<item>
<title>Content based image retrieval through object features</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/41814</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 14, no. 2
Digital images are an increasingly important class of data, especially as computers become more usable with greater memory and communication capacities. As the demand for digital images increases, the need to store and retrieve images in an intuitive and efficient manner arises. These approaches can roughly be classified into three categories such as text-based, content-based and semantic based.&#13;
ARC-BC or convexity measures. The aim of this thesis to show that the rate of retrieval can be improved by combining various features than using a single characteristic. The proposed method combines colour, texture and geometric features to form a multidimension feature vector.&#13;
&#13;
&lt;i&gt;(Párrafo extraído del texto a modo de resumen)&lt;/i&gt;
</description>
<pubDate>Wed, 01 Oct 2014 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/41814</guid>
<dc:date>2014-10-01T00:00:00Z</dc:date>
<dc:description>Digital images are an increasingly important class of data, especially as computers become more usable with greater memory and communication capacities. As the demand for digital images increases, the need to store and retrieve images in an intuitive and efficient manner arises. These approaches can roughly be classified into three categories such as text-based, content-based and semantic based.&#13;
ARC-BC or convexity measures. The aim of this thesis to show that the rate of retrieval can be improved by combining various features than using a single characteristic. The proposed method combines colour, texture and geometric features to form a multidimension feature vector.&#13;
&#13;
&lt;i&gt;(Párrafo extraído del texto a modo de resumen)&lt;/i&gt;</dc:description>
</item>
<item>
<title>NFR catalogues for RFID middleware</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/41812</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 14, no. 2
Non-functional requirements (NFR) are related to the user satisfaction about the quality attributes of the information system. In some cases these requirements are ignored or implemented by the end of the project in a chaotic way. It happens because, in many cases, the user does not have enough contact with the information system to solve these requirements, such as nonfunctional requirements for Radio-Frequency Identification (RFID) middleware. This study presents the preparation of non-functional requirements catalogues for RFID middleware supported by Non-Functional Requirements Framework (NFR-Framework). Two case studies were performed to evaluate the Requirements Engineering process in the creation of the NFR catalogues and the effectiveness of the reuse of the catalogues. As a result, a set of non-functional requirements are presented and organized into catalogues that work as the foundation for RFID system developers in the identification and validation of non-functional requirements for RFID middleware in information systems context.
</description>
<pubDate>Wed, 01 Oct 2014 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/41812</guid>
<dc:date>2014-10-01T00:00:00Z</dc:date>
<dc:description>Non-functional requirements (NFR) are related to the user satisfaction about the quality attributes of the information system. In some cases these requirements are ignored or implemented by the end of the project in a chaotic way. It happens because, in many cases, the user does not have enough contact with the information system to solve these requirements, such as nonfunctional requirements for Radio-Frequency Identification (RFID) middleware. This study presents the preparation of non-functional requirements catalogues for RFID middleware supported by Non-Functional Requirements Framework (NFR-Framework). Two case studies were performed to evaluate the Requirements Engineering process in the creation of the NFR catalogues and the effectiveness of the reuse of the catalogues. As a result, a set of non-functional requirements are presented and organized into catalogues that work as the foundation for RFID system developers in the identification and validation of non-functional requirements for RFID middleware in information systems context.</dc:description>
</item>
<item>
<title>Incorporating electronics in the architecture track of computer science, a comparative study</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/41809</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 14, no. 2
The latest draft report of the ACM/IEEE Joint Task Force on computer science makes several recommendations. Of these, for computer architecture: a) a shift towards more use of Programmable Logic Devices (PLDs), and b) more emphasis on the study of power constraints.&#13;
While the shift towards use of PLDs requires minimal electrical knowledge, the study of power constraints requires better understanding of the electrical topics. With further constraints placed on the number of credit hours, detailed study the electrical topics may be skipped.&#13;
The contribution of the paper is to propose a set of electrical topics compiled so as to include under curricula constraints and offer pedagogy of teaching the topics. In addition, the paper presents a comparative study of the electronics topics found in digital design texts.
</description>
<pubDate>Wed, 01 Oct 2014 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/41809</guid>
<dc:date>2014-10-01T00:00:00Z</dc:date>
<dc:description>The latest draft report of the ACM/IEEE Joint Task Force on computer science makes several recommendations. Of these, for computer architecture: a) a shift towards more use of Programmable Logic Devices (PLDs), and b) more emphasis on the study of power constraints.&#13;
While the shift towards use of PLDs requires minimal electrical knowledge, the study of power constraints requires better understanding of the electrical topics. With further constraints placed on the number of credit hours, detailed study the electrical topics may be skipped.&#13;
The contribution of the paper is to propose a set of electrical topics compiled so as to include under curricula constraints and offer pedagogy of teaching the topics. In addition, the paper presents a comparative study of the electronics topics found in digital design texts.</dc:description>
</item>
<item>
<title>A set of metrics for characterizing simulink model comprehension</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/41807</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 14, no. 2
Simulink is a powerful tool for Embedded Systems, playing a key role in dynamic systems modeling. However, far too little attention has been paid to quality of Simulink models. In addition, no research has been found linking the relationship between model complexity and its impact in the comprehension quality of Simulink models. The aim of this paper is to define a set of metrics to support the characterization of Simulink models and to investigate their relationship with the model comprehension property. For this study, we performed a controlled experiment using two versions of a robotic Simulink model — one of them was constructed through the ad hoc development approach and the other one through the re-engineered development approach. The results of the experiment show that the re-engineered model is more comprehensible than the ad hoc model. In summary, the set of metrics collected from each version of the Simulink model suggests an inverse relationship with the model comprehension, i.e., the lower the metrics, the greater the model comprehension.
</description>
<pubDate>Wed, 01 Oct 2014 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/41807</guid>
<dc:date>2014-10-01T00:00:00Z</dc:date>
<dc:description>Simulink is a powerful tool for Embedded Systems, playing a key role in dynamic systems modeling. However, far too little attention has been paid to quality of Simulink models. In addition, no research has been found linking the relationship between model complexity and its impact in the comprehension quality of Simulink models. The aim of this paper is to define a set of metrics to support the characterization of Simulink models and to investigate their relationship with the model comprehension property. For this study, we performed a controlled experiment using two versions of a robotic Simulink model — one of them was constructed through the ad hoc development approach and the other one through the re-engineered development approach. The results of the experiment show that the re-engineered model is more comprehensible than the ad hoc model. In summary, the set of metrics collected from each version of the Simulink model suggests an inverse relationship with the model comprehension, i.e., the lower the metrics, the greater the model comprehension.</dc:description>
</item>
<item>
<title>Improving the performance of web service recommenders using semantic similarity</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/41804</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 14, no. 2
This paper addresses issues related to recommending Semantic Web Services (SWS) using collaborative filtering (CF). The focus is on reducing the problems arising from data sparsity, one of the main difficulties for CF algorithms. Two CF algorithms are presented and discussed: a memory-based algorithm, using the k-NN method, and a model-based algorithm, using the k-means method. In both algorithms, similarity between users is computed using the Pearson Correlation Coefficient (PCC). One of the limitations of using the PCC in this context is that in those instances where users have not rated items in common it is not possible to compute their similarity. In addition, when the number of common items that were rated is low, the reliability of the computed similarity degree may also be low. To overcome these limitations, the presented algorithms compute the similarity between two users taking into account services that both users accessed and also semantically similar services. Likewise, to predict the rating for a not yet accessed target service, the algorithms consider the ratings that neighbor users assigned to the target service, as is normally the case, while also considering the ratings assigned to services that are semantically similar to the target service. The experiments described in the paper show that this approach has a significantly positive impact on prediction accuracy, particularly when the user-item matrix is sparse.
</description>
<pubDate>Wed, 01 Oct 2014 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/41804</guid>
<dc:date>2014-10-01T00:00:00Z</dc:date>
<dc:description>This paper addresses issues related to recommending Semantic Web Services (SWS) using collaborative filtering (CF). The focus is on reducing the problems arising from data sparsity, one of the main difficulties for CF algorithms. Two CF algorithms are presented and discussed: a memory-based algorithm, using the k-NN method, and a model-based algorithm, using the k-means method. In both algorithms, similarity between users is computed using the Pearson Correlation Coefficient (PCC). One of the limitations of using the PCC in this context is that in those instances where users have not rated items in common it is not possible to compute their similarity. In addition, when the number of common items that were rated is low, the reliability of the computed similarity degree may also be low. To overcome these limitations, the presented algorithms compute the similarity between two users taking into account services that both users accessed and also semantically similar services. Likewise, to predict the rating for a not yet accessed target service, the algorithms consider the ratings that neighbor users assigned to the target service, as is normally the case, while also considering the ratings assigned to services that are semantically similar to the target service. The experiments described in the paper show that this approach has a significantly positive impact on prediction accuracy, particularly when the user-item matrix is sparse.</dc:description>
</item>
<item>
<title>A fault resilience tool for embedded real-time systems</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/41799</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 14, no. 2
A simulation-based approach to measuring the faultresilience of real-time systems is presented. Simulation is used to favor generality, comparability and make it possible to study the system taking into consideration its overall behavior instead of dealing only with worst-case scenarios. Tasks can be analyzed individually, which may be useful when they have different levels of criticality. The simulation procedure is efficient since only randomly generated parts of the schedule are simulated. We show that results collected from simulation can then be statistically analyzed for different scheduling models so that one can infer the overall fault resilience for the system.
</description>
<pubDate>Wed, 01 Oct 2014 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/41799</guid>
<dc:date>2014-10-01T00:00:00Z</dc:date>
<dc:description>A simulation-based approach to measuring the faultresilience of real-time systems is presented. Simulation is used to favor generality, comparability and make it possible to study the system taking into consideration its overall behavior instead of dealing only with worst-case scenarios. Tasks can be analyzed individually, which may be useful when they have different levels of criticality. The simulation procedure is efficient since only randomly generated parts of the schedule are simulated. We show that results collected from simulation can then be statistically analyzed for different scheduling models so that one can infer the overall fault resilience for the system.</dc:description>
</item>
<item>
<title>Tiered architecture for remote access to data sources</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/41796</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 14, no. 2
Teamwork is benefited by the use of shared data sources. Also, ever increasingly, organizational work depends on the activities of team members situated in different physical locations, including both employees who work from their homes and others who have been temporarily transferred to another place.&#13;
Since, for all these reasons, accessing data remotely is a growing need, organizations implement internal systems in order to control shared data access according to user privileges. In this regard, the cost of resource transportation needed to generate communication must be considered. The main contribution of this paper is the extended reference layered architecture ICDFSCV (Interface Control and Distributed File Systems - Communication Versioning). It allows to build a solution that, facilitates documents download and the creation and concurrent modification by multiple users through versioning control.
</description>
<pubDate>Wed, 01 Oct 2014 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/41796</guid>
<dc:date>2014-10-01T00:00:00Z</dc:date>
<dc:description>Teamwork is benefited by the use of shared data sources. Also, ever increasingly, organizational work depends on the activities of team members situated in different physical locations, including both employees who work from their homes and others who have been temporarily transferred to another place.&#13;
Since, for all these reasons, accessing data remotely is a growing need, organizations implement internal systems in order to control shared data access according to user privileges. In this regard, the cost of resource transportation needed to generate communication must be considered. The main contribution of this paper is the extended reference layered architecture ICDFSCV (Interface Control and Distributed File Systems - Communication Versioning). It allows to build a solution that, facilitates documents download and the creation and concurrent modification by multiple users through versioning control.</dc:description>
</item>
</channel>
</rss>
