<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Volumen 07 | Número 03</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/387</link>
<description/>
<pubDate>Wed, 18 Nov 2026 18:00:53 GMT</pubDate>
<dc:date>2026-11-18T18:00:53Z</dc:date>
<item>
<title>Feedback scheduling of real-time control systems with resource constraints</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9568</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 7, no. 3
This thesis observes the emerging trend of convergence of control with computing and communication. By exploiting control and scheduling codesign, we study some practical and open problems in RTCSs from a unique viewpoint of dynamic resource management. Considering constraints on three representative kinds of resources, i.e. CPU time, energy, and network bandwidth, we present a set of feedback scheduling methods that exploit a unified technological framework. They provide enabling technologies for closed-loop dynamic resource scheduling, and tackle some essential problems in the emerging field of feedback scheduling. Meanwhile, this thesis holistically addresses the problem of dynamic allocation of bottleneck resources within RTCSs, thus providing flexible QoC management mechanisms and achieving overall performance optimization under dynamic environments
</description>
<pubDate>Mon, 01 Oct 2007 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9568</guid>
<dc:date>2007-10-01T00:00:00Z</dc:date>
<dc:description>This thesis observes the emerging trend of convergence of control with computing and communication. By exploiting control and scheduling codesign, we study some practical and open problems in RTCSs from a unique viewpoint of dynamic resource management. Considering constraints on three representative kinds of resources, i.e. CPU time, energy, and network bandwidth, we present a set of feedback scheduling methods that exploit a unified technological framework. They provide enabling technologies for closed-loop dynamic resource scheduling, and tackle some essential problems in the emerging field of feedback scheduling. Meanwhile, this thesis holistically addresses the problem of dynamic allocation of bottleneck resources within RTCSs, thus providing flexible QoC management mechanisms and achieving overall performance optimization under dynamic environments</dc:description>
</item>
<item>
<title>&lt;i&gt;Operating systems: Internals and design principles&lt;/i&gt;, 5th ed. William Stallings: Prentice Hall, 2005. ISBN: 0-13-147954-7</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9567</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 7, no. 3
As a professor of the Operating Systems subject, I can say that for many years the book “Operating Systems Concepts” by Avi Silberschatz et al. was considered as the unquestionable number one in the subject’s bibliography. The book we are talking about now, the new edition of “Operating Systems” by William Stallings, is thought to be the possible replacement of the first one.
</description>
<pubDate>Mon, 01 Oct 2007 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9567</guid>
<dc:date>2007-10-01T00:00:00Z</dc:date>
<dc:description>As a professor of the Operating Systems subject, I can say that for many years the book “Operating Systems Concepts” by Avi Silberschatz et al. was considered as the unquestionable number one in the subject’s bibliography. The book we are talking about now, the new edition of “Operating Systems” by William Stallings, is thought to be the possible replacement of the first one.</dc:description>
</item>
<item>
<title>&lt;i&gt;High-speed networks and Internet - Performance and quality of service&lt;/i&gt;, second edition. William Stallings: Pearson Educación (Prentice-Hall), 2004</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9566</link>
<description>Revision
Redes e Internet de alta velocidad - Rendimiento y calidad de servicio.  Segunda edición
Journal of Computer Science &amp; Technology; vol. 7, no. 3
The book presents the treatment of advanced topics in computer networks - mainly in those of high speed - which the designer or the network manager necessarily needs to know. These topics relate to multimedia traffic support, real time traffic, and congestion control as well as the needs of providing different levels of quiality of service (QoS) according to the applications and users.
</description>
<pubDate>Mon, 01 Oct 2007 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9566</guid>
<dc:date>2007-10-01T00:00:00Z</dc:date>
<dc:description>The book presents the treatment of advanced topics in computer networks - mainly in those of high speed - which the designer or the network manager necessarily needs to know. These topics relate to multimedia traffic support, real time traffic, and congestion control as well as the needs of providing different levels of quiality of service (QoS) according to the applications and users.</dc:description>
</item>
<item>
<title>Segmentation of Medical Images using Fuzzy Mathematical Morphology</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9565</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 7, no. 3
Currently, Mathematical Morphology (MM) has become a powerful tool in Digital Image Processing (DIP). It allows processing images to enhance fuzzy areas, segment objects, detect edges and analyze structures. The techniques developed for binary images are a major step forward in the application of this theory to gray level images. One of these techniques is based on fuzzy logic and on the theory of fuzzy sets. Fuzzy sets have proved to be strongly advantageous when representing inaccuracies, not only regarding the spatial localization of objects in an image but also the membership of a certain pixel to a given class. Such inaccuracies are inherent to real images either because of the presence of indefinite limits between the structures or objects to be segmented within the image due to noisy acquisitions or directly because they are inherent to the image formation methods. Our approach is to show how the fuzzy sets specifically utilized in MM have turned into a functional tool in DIP.
</description>
<pubDate>Mon, 01 Oct 2007 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9565</guid>
<dc:date>2007-10-01T00:00:00Z</dc:date>
<dc:description>Currently, Mathematical Morphology (MM) has become a powerful tool in Digital Image Processing (DIP). It allows processing images to enhance fuzzy areas, segment objects, detect edges and analyze structures. The techniques developed for binary images are a major step forward in the application of this theory to gray level images. One of these techniques is based on fuzzy logic and on the theory of fuzzy sets. Fuzzy sets have proved to be strongly advantageous when representing inaccuracies, not only regarding the spatial localization of objects in an image but also the membership of a certain pixel to a given class. Such inaccuracies are inherent to real images either because of the presence of indefinite limits between the structures or objects to be segmented within the image due to noisy acquisitions or directly because they are inherent to the image formation methods. Our approach is to show how the fuzzy sets specifically utilized in MM have turned into a functional tool in DIP.</dc:description>
</item>
<item>
<title>Harmonic Theory and Machine Learning</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9564</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 7, no. 3
A natural inference mechanism is presented : the Black Box problem is transformed into a Dirichlet's problem on the closed cube. Then it is solved in closed polynomial form, together with a Mean-Value theorem and a Maximum Principle.A generalization to Polytopes and a reduction of any Dirichlet problem on compacta is mapp ed into a unit cub e in more dimensions.An algorithm for calculating the solution is suggested.
</description>
<pubDate>Mon, 01 Oct 2007 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9564</guid>
<dc:date>2007-10-01T00:00:00Z</dc:date>
<dc:description>A natural inference mechanism is presented : the Black Box problem is transformed into a Dirichlet's problem on the closed cube. Then it is solved in closed polynomial form, together with a Mean-Value theorem and a Maximum Principle.A generalization to Polytopes and a reduction of any Dirichlet problem on compacta is mapp ed into a unit cub e in more dimensions.An algorithm for calculating the solution is suggested.</dc:description>
</item>
<item>
<title>Digital processing of in situ hybridization images: identification and spatial allocation of specific labels</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9563</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 7, no. 3
In situ hybridization (ISH) method allows to reveal specific genes expression, identify specific cell types and detect areas or tissues, displaying differential gene expression. This work describes a standardized procedure of digital image processing that allows detailed analyses of ISH preparations. We have developed a software that allows through a graphical interface (a) to reliably identify and quantify ISH labels, (b) to locate each label within the image reference system (c) to assemble the total series of images obtained from a complete histological sections of a biological structure, and d) to locate all the labels within a unique reference system that corresponds to the complete biological structure. As each ISH label is positioned within a spatial coordinates system coinciding with an intrinsic biological reference axis, this software can be used to analyze the spatial pattern of distribution of specific genes expression during the embryonic development. The software allows the construction of numerical space series that can be used to analyze the variability and the dynamics of genes expression as a function of space and/or time during the embryonic development.
</description>
<pubDate>Mon, 01 Oct 2007 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9563</guid>
<dc:date>2007-10-01T00:00:00Z</dc:date>
<dc:description>In situ hybridization (ISH) method allows to reveal specific genes expression, identify specific cell types and detect areas or tissues, displaying differential gene expression. This work describes a standardized procedure of digital image processing that allows detailed analyses of ISH preparations. We have developed a software that allows through a graphical interface (a) to reliably identify and quantify ISH labels, (b) to locate each label within the image reference system (c) to assemble the total series of images obtained from a complete histological sections of a biological structure, and d) to locate all the labels within a unique reference system that corresponds to the complete biological structure. As each ISH label is positioned within a spatial coordinates system coinciding with an intrinsic biological reference axis, this software can be used to analyze the spatial pattern of distribution of specific genes expression during the embryonic development. The software allows the construction of numerical space series that can be used to analyze the variability and the dynamics of genes expression as a function of space and/or time during the embryonic development.</dc:description>
</item>
<item>
<title>On Exponential Periodicity And Stability of Nonlinear Neural Networks With Variable Coefficients And Distributed Delays</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9562</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 7, no. 3
The exponential periodicity and stability of continuous nonlinear neural networks with variable coefficients and distributed delays are investigated via employing Young inequality technique and Lyapunov method.&#13;
Some new sufficient conditions ensuring existence and uniqueness of periodic solution for a general class of neural systems are obtained. Without assuming the activation functions are to be bounded, differentiable or strictly increasing. Moreover, the symmetry of the connection matrix is not also necessary. Thus, we generalize and improve some previous works, and they are easy to check and apply in practice.
</description>
<pubDate>Mon, 01 Oct 2007 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9562</guid>
<dc:date>2007-10-01T00:00:00Z</dc:date>
<dc:description>The exponential periodicity and stability of continuous nonlinear neural networks with variable coefficients and distributed delays are investigated via employing Young inequality technique and Lyapunov method.&#13;
Some new sufficient conditions ensuring existence and uniqueness of periodic solution for a general class of neural systems are obtained. Without assuming the activation functions are to be bounded, differentiable or strictly increasing. Moreover, the symmetry of the connection matrix is not also necessary. Thus, we generalize and improve some previous works, and they are easy to check and apply in practice.</dc:description>
</item>
<item>
<title>Improved AFIS for Color and Gray Image based on Biometric Triangulation</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9561</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 7, no. 3
This research presents a fingerprint image processing algorithm for personal automatic identification, which has been in development since 1998. It is principally based on the comparison of the fingerprint's biometric pattern between the fingerprint captured (original) in each session and the one stored in database. It is preferable to capture the image in color. The biometric pattern is formed by the Euclidean distances based on the triangulation of only three minutiae. This methodology locates the position and the type of each minutia to perform the triangulation. The applied metric is the statistic similarity obtained by the comparison of both biometric patterns. This technique enables one to solve translation and rotation problems. An original colored fingerprint is used in order to obtain more information about the fingerprint situation. The space color used is HCL, because it helps get a good skin color for an encrypt key, which is formed by each channel (HCL) in accordance with the skin color. This system has several applications due to its low cost and efficiency. Finally, the results obtained with this methodology were satisfactory since in all the experimental tests the system offered a rate of global success of 99 %.
</description>
<pubDate>Mon, 01 Oct 2007 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9561</guid>
<dc:date>2007-10-01T00:00:00Z</dc:date>
<dc:description>This research presents a fingerprint image processing algorithm for personal automatic identification, which has been in development since 1998. It is principally based on the comparison of the fingerprint's biometric pattern between the fingerprint captured (original) in each session and the one stored in database. It is preferable to capture the image in color. The biometric pattern is formed by the Euclidean distances based on the triangulation of only three minutiae. This methodology locates the position and the type of each minutia to perform the triangulation. The applied metric is the statistic similarity obtained by the comparison of both biometric patterns. This technique enables one to solve translation and rotation problems. An original colored fingerprint is used in order to obtain more information about the fingerprint situation. The space color used is HCL, because it helps get a good skin color for an encrypt key, which is formed by each channel (HCL) in accordance with the skin color. This system has several applications due to its low cost and efficiency. Finally, the results obtained with this methodology were satisfactory since in all the experimental tests the system offered a rate of global success of 99 %.</dc:description>
</item>
<item>
<title>A Methodology for Vertically Partitioning in a Multi-Relation Database Environment</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9560</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 7, no. 3
Vertical partitioning, in which attributes of a relation are assigned to partitions, is aimed at improving database performance. We extend previous research that is based on a single relation to multi-relation database environment, by including referential integrity constraints, access time based heuristic, and a comprehensive cost model that considers most transaction types including updates and joins. The algorithm was applied to a real-world insurance CLAIMS database. Simulation experiments were conducted and the results show a performance improvement of 36% to 65% over unpartitioned case.&#13;
Application of our method for small databases resulted in partitioning schemes that are comparable to optimal.
</description>
<pubDate>Mon, 01 Oct 2007 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9560</guid>
<dc:date>2007-10-01T00:00:00Z</dc:date>
<dc:description>Vertical partitioning, in which attributes of a relation are assigned to partitions, is aimed at improving database performance. We extend previous research that is based on a single relation to multi-relation database environment, by including referential integrity constraints, access time based heuristic, and a comprehensive cost model that considers most transaction types including updates and joins. The algorithm was applied to a real-world insurance CLAIMS database. Simulation experiments were conducted and the results show a performance improvement of 36% to 65% over unpartitioned case.&#13;
Application of our method for small databases resulted in partitioning schemes that are comparable to optimal.</dc:description>
</item>
<item>
<title>Optimizing Routes Quality and Scattering in the AODV Routing Protocol</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9559</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 7, no. 3
An ad-hoc mobile network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. Routing protocols are used to discover routes between nodes.&#13;
Many mobile ad-hoc networks protocols such as AODV construct route only when desired by the source node (reactively). The advantage hereof is that no prior assumptions of the network topology are required. In highly mobile networks this is an attractive property.&#13;
Other used protocols (such as OLSR) are said proactive.&#13;
Such protocols maintain information about routes to all destinations all times. The consequence of this approach is that the amount of control traffic is independent of the actual traffic and mobility in the network.&#13;
In this paper we describe three major optimization schemes for the well-known AODV routing protocol in order to get some of the proactive protocols features in it.&#13;
The targeted characteristics are: traffic independent control and shortest path routes.
</description>
<pubDate>Mon, 01 Oct 2007 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9559</guid>
<dc:date>2007-10-01T00:00:00Z</dc:date>
<dc:description>An ad-hoc mobile network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. Routing protocols are used to discover routes between nodes.&#13;
Many mobile ad-hoc networks protocols such as AODV construct route only when desired by the source node (reactively). The advantage hereof is that no prior assumptions of the network topology are required. In highly mobile networks this is an attractive property.&#13;
Other used protocols (such as OLSR) are said proactive.&#13;
Such protocols maintain information about routes to all destinations all times. The consequence of this approach is that the amount of control traffic is independent of the actual traffic and mobility in the network.&#13;
In this paper we describe three major optimization schemes for the well-known AODV routing protocol in order to get some of the proactive protocols features in it.&#13;
The targeted characteristics are: traffic independent control and shortest path routes.</dc:description>
</item>
<item>
<title>A Simulative Comparison of BB84 Protocol with its Improved Version</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9558</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 7, no. 3
Public key cryptosystems can well become void with the advent of incredibly high performance quantum computers. The underlying principles of these computers themselves, namely quantum mechanics, provide the solution to the key distribution problem. This paper explains how cryptography will be benefited from quantum mechanics, through a short introduction to classical cryptography, and the general principles of quantum cryptography and the BB84 protocol for key distribution. Then we review a modification to the BB84 protocol that is logically claimed to increase its efficiency. We then validate this claim by presenting our simulation results for BB84 and its improved protocols and show that the efficiency of the improved protocol could be doubled without undermining the security level of BB84 protocol.
</description>
<pubDate>Mon, 01 Oct 2007 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9558</guid>
<dc:date>2007-10-01T00:00:00Z</dc:date>
<dc:description>Public key cryptosystems can well become void with the advent of incredibly high performance quantum computers. The underlying principles of these computers themselves, namely quantum mechanics, provide the solution to the key distribution problem. This paper explains how cryptography will be benefited from quantum mechanics, through a short introduction to classical cryptography, and the general principles of quantum cryptography and the BB84 protocol for key distribution. Then we review a modification to the BB84 protocol that is logically claimed to increase its efficiency. We then validate this claim by presenting our simulation results for BB84 and its improved protocols and show that the efficiency of the improved protocol could be doubled without undermining the security level of BB84 protocol.</dc:description>
</item>
<item>
<title>Peer-to-Peer Systems: The Present and the Future</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9557</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 7, no. 3
Nowadays Peer-to-Peer (P2P) systems became an important part of Internet, millions of users have been attracted to use their structures and services. The popularity of Peer-to-Peer systems speed up academic research joining researchers from systems, networking and theory. The most popular P2P applications support file-sharing and content distribution, new applications are emerging in different fields, Internet telephony is an example.&#13;
This paper discusses the issues of P2P systems such as characteristics, structures, protocols, drawbacks, open problems and futures fields of development.
</description>
<pubDate>Mon, 01 Oct 2007 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9557</guid>
<dc:date>2007-10-01T00:00:00Z</dc:date>
<dc:description>Nowadays Peer-to-Peer (P2P) systems became an important part of Internet, millions of users have been attracted to use their structures and services. The popularity of Peer-to-Peer systems speed up academic research joining researchers from systems, networking and theory. The most popular P2P applications support file-sharing and content distribution, new applications are emerging in different fields, Internet telephony is an example.&#13;
This paper discusses the issues of P2P systems such as characteristics, structures, protocols, drawbacks, open problems and futures fields of development.</dc:description>
</item>
</channel>
</rss>
