<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Volumen 09 | Número 02</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/395</link>
<description/>
<pubDate>Thu, 19 Nov 2026 02:05:26 GMT</pubDate>
<dc:date>2026-11-19T02:05:26Z</dc:date>
<item>
<title>Using scenarios to derive software</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9659</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 9, no. 2
The present thesis describes a Requirements Engineering strategy, called SDRES (Scenario Driven Requirements Engineering Strategy), which proposes to face topics rarely treated in real practice, such as continuous changes in requirements, software defects originated during requirements production, the organisational context surrounding the software system and the treatment of quality requirements.
Es revisión de: http://sedici.unlp.edu.ar/handle/10915/2456
</description>
<pubDate>Thu, 01 Oct 2009 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9659</guid>
<dc:date>2009-10-01T00:00:00Z</dc:date>
<dc:description>The present thesis describes a Requirements Engineering strategy, called SDRES (Scenario Driven Requirements Engineering Strategy), which proposes to face topics rarely treated in real practice, such as continuous changes in requirements, software defects originated during requirements production, the organisational context surrounding the software system and the treatment of quality requirements.</dc:description>
</item>
<item>
<title>Operating Systems. A concept-based approach, Second Edition: D.M. Dhamdhere, McGraw Hill, 2006. ISBN 0070611947</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9658</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 9, no. 2
The book deals with the topic of Operating Systems from and intuitive perspective and then delves into more technical concepts, which makes it appropriate for a first introductory course on the matter.
</description>
<pubDate>Thu, 01 Oct 2009 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9658</guid>
<dc:date>2009-10-01T00:00:00Z</dc:date>
<dc:description>The book deals with the topic of Operating Systems from and intuitive perspective and then delves into more technical concepts, which makes it appropriate for a first introductory course on the matter.</dc:description>
</item>
<item>
<title>Power aware routing in ad hoc wireless networks</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9657</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 9, no. 2
Development of the efficient power aware protocol is the need of today s adhoc networks. Although developing battery efficient systems that have low cost and complexity, remains a crucial issue. In order to facilitate communication within a mobile adhoc network, an efficient routing protocol is required to discover routes between mobile nodes. Power is one of the most important design criteria for adhoc networks as batteries provide limited working capacity to the mobile nodes. Power failure of a mobile node not only affects the node itself but also its ability to forward packets on behalf of others and hence affects the overall network lifetime. Much research efforts have been devoted to develop energy aware routing protocols. In this paper we propose an efficient algorithm, which maximizes the network lifetime by minimizing the power consumption during the source to destination route establishment. As a case study proposed algorithm has been incorporated along with the route discovery procedure of AODV and by simulation it is observed that proposed algorithm s perperformance is better as compare to AODV and DSR in terms of various energy related parameters like Total Energy Consumption, Average Energy Left Per Alive Node, Node Termination Rate, and Network Lifetime for different network scenarios.
</description>
<pubDate>Thu, 01 Oct 2009 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9657</guid>
<dc:date>2009-10-01T00:00:00Z</dc:date>
<dc:description>Development of the efficient power aware protocol is the need of today s adhoc networks. Although developing battery efficient systems that have low cost and complexity, remains a crucial issue. In order to facilitate communication within a mobile adhoc network, an efficient routing protocol is required to discover routes between mobile nodes. Power is one of the most important design criteria for adhoc networks as batteries provide limited working capacity to the mobile nodes. Power failure of a mobile node not only affects the node itself but also its ability to forward packets on behalf of others and hence affects the overall network lifetime. Much research efforts have been devoted to develop energy aware routing protocols. In this paper we propose an efficient algorithm, which maximizes the network lifetime by minimizing the power consumption during the source to destination route establishment. As a case study proposed algorithm has been incorporated along with the route discovery procedure of AODV and by simulation it is observed that proposed algorithm s perperformance is better as compare to AODV and DSR in terms of various energy related parameters like Total Energy Consumption, Average Energy Left Per Alive Node, Node Termination Rate, and Network Lifetime for different network scenarios.</dc:description>
</item>
<item>
<title>A simulation agent for efficient network evaluation in 3G cellular mobile radio planning</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9656</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 9, no. 2
An accurate procedure for evaluating the strong correlation and conflicting goals of coverage, capacity and Quality of Service (QoS) is required for efficient planning of 3G radio networks. In this paper, we explore and implement an agent-based simulation methodology which allows for the fine-tuning of the input model parameters to study and evaluate the performance of Code Division Multiple Access (CDMA) systems. The results obtained are represented graphically to show scenarios for both uplink and downlink limited CDMA. The analysis is extended to demonstrate how Tower Mounted Amplifiers (TMA) can be used to benefit the uplink performance of a 1× EV-D0 data system.
</description>
<pubDate>Thu, 01 Oct 2009 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9656</guid>
<dc:date>2009-10-01T00:00:00Z</dc:date>
<dc:description>An accurate procedure for evaluating the strong correlation and conflicting goals of coverage, capacity and Quality of Service (QoS) is required for efficient planning of 3G radio networks. In this paper, we explore and implement an agent-based simulation methodology which allows for the fine-tuning of the input model parameters to study and evaluate the performance of Code Division Multiple Access (CDMA) systems. The results obtained are represented graphically to show scenarios for both uplink and downlink limited CDMA. The analysis is extended to demonstrate how Tower Mounted Amplifiers (TMA) can be used to benefit the uplink performance of a 1× EV-D0 data system.</dc:description>
</item>
<item>
<title>Robust realtime face recognition and tracking system</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9655</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 9, no. 2
There s some very important meaning in the study of realtime face recognition and tracking system for the video monitoring and artifical vision. The current method is still very susceptible to the illumination condition, non-real time and very common to fail to track the target face especially when partly covered or moving fast. In this paper, we propose to use Boosted Cascade combined with skin model for face detection and then in order to recognize the candidate faces, they will be analyzed by the hybrid Wavelet, PCA (principle component analysis) and SVM (support vector machine) method. After that, Meanshift and Kalman filter will be invoked to track the face. The experimental results show that the algorithm has quite good performance in terms of real-time and accuracy.
</description>
<pubDate>Thu, 01 Oct 2009 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9655</guid>
<dc:date>2009-10-01T00:00:00Z</dc:date>
<dc:description>There s some very important meaning in the study of realtime face recognition and tracking system for the video monitoring and artifical vision. The current method is still very susceptible to the illumination condition, non-real time and very common to fail to track the target face especially when partly covered or moving fast. In this paper, we propose to use Boosted Cascade combined with skin model for face detection and then in order to recognize the candidate faces, they will be analyzed by the hybrid Wavelet, PCA (principle component analysis) and SVM (support vector machine) method. After that, Meanshift and Kalman filter will be invoked to track the face. The experimental results show that the algorithm has quite good performance in terms of real-time and accuracy.</dc:description>
</item>
<item>
<title>Reduced computational cost in the calculation of worst case response time for real time systems</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9654</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 9, no. 2
Modern Real Time Operating Systems require reducing computational costs even though the microprocessors become more powerful each day. It is usual that Real Time Operating Systems for embedded systems have advance features to administrate the resources of the applications that they support. In order to guarantee either the schedulability of the system or the schedulability of a new task in a dynamic Real Time System, it is necessary to know the Worst Case Response Time of the Real Time tasks during runtime. In this paper a reduced computational cost algorithm is proposed to determine the Worst Case Response Time of Real Time tasks.Modern Real Time Operating Systems require reducing computational costs even though the microprocessors become more powerful each day. It is usual that Real Time Operating Systems for embedded systems have advance features to administrate the resources of the applications that they support. In order to guarantee either the schedulability of the system or the schedulability of a new task in a dynamic Real Time System, it is necessary to know the Worst Case Response Time of the Real Time tasks during runtime. In this paper a reduced computational cost algorithm is proposed to determine the Worst Case Response Time of Real Time tasks.
</description>
<pubDate>Thu, 01 Oct 2009 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9654</guid>
<dc:date>2009-10-01T00:00:00Z</dc:date>
<dc:description>Modern Real Time Operating Systems require reducing computational costs even though the microprocessors become more powerful each day. It is usual that Real Time Operating Systems for embedded systems have advance features to administrate the resources of the applications that they support. In order to guarantee either the schedulability of the system or the schedulability of a new task in a dynamic Real Time System, it is necessary to know the Worst Case Response Time of the Real Time tasks during runtime. In this paper a reduced computational cost algorithm is proposed to determine the Worst Case Response Time of Real Time tasks.Modern Real Time Operating Systems require reducing computational costs even though the microprocessors become more powerful each day. It is usual that Real Time Operating Systems for embedded systems have advance features to administrate the resources of the applications that they support. In order to guarantee either the schedulability of the system or the schedulability of a new task in a dynamic Real Time System, it is necessary to know the Worst Case Response Time of the Real Time tasks during runtime. In this paper a reduced computational cost algorithm is proposed to determine the Worst Case Response Time of Real Time tasks.</dc:description>
</item>
<item>
<title>Hybrid approach for designing smart adaptive Web Sites</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9653</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 9, no. 2
The very beginning of the research on Smart Adaptive Web Systems (SAWS). They are systems that adapt their response based on the context in which they are used. In AWS, three main sources of information have been identified are: user, environment, and technology. To design a site for adaptivity, the site s parts must be changeable according to users needs and interests. This paper represents a careful study of a large number of adaptive web systems which are used for adapting predesigned web pages and automatic synthesizing web pages. It suggests a new approach to extract the user s interest without the need of many visits to the web site or viewing the catalog in details. Different E-metrics are measured to evaluate the user s history, extract users interests, create adaptable interface, and synthesize a new page with special features referring to users needs and interests and also predict the next step the user may need.
</description>
<pubDate>Thu, 01 Oct 2009 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9653</guid>
<dc:date>2009-10-01T00:00:00Z</dc:date>
<dc:description>The very beginning of the research on Smart Adaptive Web Systems (SAWS). They are systems that adapt their response based on the context in which they are used. In AWS, three main sources of information have been identified are: user, environment, and technology. To design a site for adaptivity, the site s parts must be changeable according to users needs and interests. This paper represents a careful study of a large number of adaptive web systems which are used for adapting predesigned web pages and automatic synthesizing web pages. It suggests a new approach to extract the user s interest without the need of many visits to the web site or viewing the catalog in details. Different E-metrics are measured to evaluate the user s history, extract users interests, create adaptable interface, and synthesize a new page with special features referring to users needs and interests and also predict the next step the user may need.</dc:description>
</item>
<item>
<title>Extracting contour lines from topographic maps based on cartography and graphics knowledge</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9652</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 9, no. 2
This paper addresses the problem of contour line extraction from scanned topographic maps in poor condition. A novel method is developed, using knowledge of cartography and graphics to extract contours by removing other layers which overlay the contours, and reconstructing the contour lines. The contributions of this paper are the supplementation of the use of knowledge discovery for extraction on the scanned topographic maps.&#13;
Examples are presented from diverse applications to show that the developed algorithm can work effectively.
</description>
<pubDate>Thu, 01 Oct 2009 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9652</guid>
<dc:date>2009-10-01T00:00:00Z</dc:date>
<dc:description>This paper addresses the problem of contour line extraction from scanned topographic maps in poor condition. A novel method is developed, using knowledge of cartography and graphics to extract contours by removing other layers which overlay the contours, and reconstructing the contour lines. The contributions of this paper are the supplementation of the use of knowledge discovery for extraction on the scanned topographic maps.&#13;
Examples are presented from diverse applications to show that the developed algorithm can work effectively.</dc:description>
</item>
<item>
<title>Semiclassical grounds of the Calderbank-Shor-Steane quantum error correction codes</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9651</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 9, no. 2
A valid Calderbank-Shor-Steane (CSS) error correction code requires two classical linear codes for the preparation of the initial state (codewords). This code allow to correct for certain errors caused by an unwanted interaction which produces a degraded quantum state. However, this initial seven qubits encoding can be obtained from a maximally entangled Bell state  (0000000&gt;+|1111111)/√  through an operation Hint whose explicit expression is derived in the present work. The price the CSS syndrome has to pay due to its classical grounds is that the operator Hint is not unitary. In other words, Hint is not a valid quantum gate i. e. this does not represent a logical operation. Consequently, the final state is not completely robust for the standard cryptography of Quantum Computation. Besides to be a non unitary operator, Hint, is not reversible introducing with this dissipative effects that destroy the coherence in the quantum computer. Additionally, this operator is not invariant under rotations of the protector qubits inducing then preferred directions of the propagation of the logical information. These are indeed the reasons that prompt us for extending the semi classical CSS quantum error correction codes formalism to a pure quantum Hamming codes.
</description>
<pubDate>Thu, 01 Oct 2009 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9651</guid>
<dc:date>2009-10-01T00:00:00Z</dc:date>
<dc:description>A valid Calderbank-Shor-Steane (CSS) error correction code requires two classical linear codes for the preparation of the initial state (codewords). This code allow to correct for certain errors caused by an unwanted interaction which produces a degraded quantum state. However, this initial seven qubits encoding can be obtained from a maximally entangled Bell state  (0000000&gt;+|1111111)/√  through an operation Hint whose explicit expression is derived in the present work. The price the CSS syndrome has to pay due to its classical grounds is that the operator Hint is not unitary. In other words, Hint is not a valid quantum gate i. e. this does not represent a logical operation. Consequently, the final state is not completely robust for the standard cryptography of Quantum Computation. Besides to be a non unitary operator, Hint, is not reversible introducing with this dissipative effects that destroy the coherence in the quantum computer. Additionally, this operator is not invariant under rotations of the protector qubits inducing then preferred directions of the propagation of the logical information. These are indeed the reasons that prompt us for extending the semi classical CSS quantum error correction codes formalism to a pure quantum Hamming codes.</dc:description>
</item>
<item>
<title>Global and local selection in differential evolution for constrained numerical optimization</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9650</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 9, no. 2
The performance of two selection mechanisms used in the most popular variant of differential evolution, known as DE/rand/1/bin, are compared in the solution of constrained numerical optimization problems. Four performance measures proposed in the specialized literature are used to analyze the capabilities of each selection mechanism to reach the feasible region of the search space, to find the vicinity of the feasible global optimum and the computational cost (measured by the number of evaluations) required. Two parameters of the differential evolution algorithm are varied to determine the most convenient values.&#13;
A set of problems with different features is chosen to test both selection mechanisms and some findings are extracted from the results obtained.
</description>
<pubDate>Thu, 01 Oct 2009 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9650</guid>
<dc:date>2009-10-01T00:00:00Z</dc:date>
<dc:description>The performance of two selection mechanisms used in the most popular variant of differential evolution, known as DE/rand/1/bin, are compared in the solution of constrained numerical optimization problems. Four performance measures proposed in the specialized literature are used to analyze the capabilities of each selection mechanism to reach the feasible region of the search space, to find the vicinity of the feasible global optimum and the computational cost (measured by the number of evaluations) required. Two parameters of the differential evolution algorithm are varied to determine the most convenient values.&#13;
A set of problems with different features is chosen to test both selection mechanisms and some findings are extracted from the results obtained.</dc:description>
</item>
</channel>
</rss>
