<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>Volumen 04 | Número 03</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/381" rel="alternate"/>
<subtitle/>
<id>http://sedici.unlp.edu.ar:80/handle/10915/381</id>
<updated>2026-11-18T21:29:16Z</updated>
<dc:date>2026-11-18T21:29:16Z</dc:date>
<entry>
<title>Parallel processing: Dynamic load balance in sorting algorithms</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9500" rel="alternate"/>
<author>
<name>Naiouf, Marcelo</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9500</id>
<updated>2019-06-19T04:02:51Z</updated>
<published>2004-10-01T00:00:00Z</published>
<summary type="text">Revision
Journal of Computer Science &amp; Technology; vol. 4, no. 3
The growing importance and interest in parallel processing within Computer Sciences are undeniable, and thus make it one of the more influencing areas of this discipline. Several reasons support this fact, such as the increase in the computer power, the existence of problems in which the sequential solution times are unacceptable, the possibility of mapping the problem's implicit concurrency into parallel processes in order to minimize response times, etc.
Es revisión de: http://sedici.unlp.edu.ar/handle/10915/2264
</summary>
<dc:date>2004-10-01T00:00:00Z</dc:date>
<dc:description>The growing importance and interest in parallel processing within Computer Sciences are undeniable, and thus make it one of the more influencing areas of this discipline. Several reasons support this fact, such as the increase in the computer power, the existence of problems in which the sequential solution times are unacceptable, the possibility of mapping the problem's implicit concurrency into parallel processes in order to minimize response times, etc.</dc:description>
</entry>
<entry>
<title>&lt;i&gt;Watch IT: The risks and promises of new information technologies&lt;/i&gt;. Nicholas C. Burbules, Thomas A. Callister (h): Ediciones Granica S. A., 2001</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9499" rel="alternate"/>
<author>
<name>Gorga, Gladys</name>
</author>
<author>
<name>Madoz, María Cristina</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9499</id>
<updated>2019-06-19T04:02:48Z</updated>
<published>2004-10-01T00:00:00Z</published>
<summary type="text">Revision
Journal of Computer Science &amp; Technology; vol. 4, no. 3
Se realiza una reseña del libro capítulo por capítulo. Los títulos de los capítulos son (en inglés): &#13;
&#13;
Chapter 1 - The Risky Promises and Promising Risks of New Information Technologies for Education&#13;
Chapter 2 - Dilemmas of Access and Credibility: Access for Whom? Access to What?&#13;
Chapter 3 - Hypertext: Knowledge at the Crossroads&#13;
Chapter 4 - Critical reading on Internet&#13;
Chapter 5 - Misinformation, Malinformation, Messed-Up Information, and Mostly Useless Information: Is Censorship the Best Response?&#13;
Chapter 6 - Surveillance &amp; Privacy: Can Technology Protect What Technology Takes Away?&#13;
Chapter 7 - Information for sale: Commercialization &amp; the Educational Potential of the Internet&#13;
Chapter 8 - What Kind of Community Can the Internet Be?
</summary>
<dc:date>2004-10-01T00:00:00Z</dc:date>
<dc:description>Se realiza una reseña del libro capítulo por capítulo. Los títulos de los capítulos son (en inglés): &#13;
&#13;
Chapter 1 - The Risky Promises and Promising Risks of New Information Technologies for Education&#13;
Chapter 2 - Dilemmas of Access and Credibility: Access for Whom? Access to What?&#13;
Chapter 3 - Hypertext: Knowledge at the Crossroads&#13;
Chapter 4 - Critical reading on Internet&#13;
Chapter 5 - Misinformation, Malinformation, Messed-Up Information, and Mostly Useless Information: Is Censorship the Best Response?&#13;
Chapter 6 - Surveillance &amp; Privacy: Can Technology Protect What Technology Takes Away?&#13;
Chapter 7 - Information for sale: Commercialization &amp; the Educational Potential of the Internet&#13;
Chapter 8 - What Kind of Community Can the Internet Be?</dc:description>
</entry>
<entry>
<title>A cryptography method employing a new mathematical paradigm for public keys schemes</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9498" rel="alternate"/>
<author>
<name>Ribeiro, Vinicius Gadis</name>
</author>
<author>
<name>Weber, Raul Fernando</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9498</id>
<updated>2019-06-19T04:02:47Z</updated>
<published>2004-10-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 4, no. 3
blic Keys Schemes usually generate two pairs of keys that bear some mathematical relation-usually, a relation of the field known as Number Theory. Identifying a key from another that is given is a problem of great difficulty. This paper presents a public key scheme in wich such key identification is also a great difficulty problem-however, the mathematical problem does not fall under Number Theory; rather, it is one of Differential equations, the rules of Lie groups being the best solution. Even using Lie groups, a problem of great difficulty still remains. The first few examples use Maple 5.0, a symbolic processing program, and are available in an Internet site.
</summary>
<dc:date>2004-10-01T00:00:00Z</dc:date>
<dc:description>blic Keys Schemes usually generate two pairs of keys that bear some mathematical relation-usually, a relation of the field known as Number Theory. Identifying a key from another that is given is a problem of great difficulty. This paper presents a public key scheme in wich such key identification is also a great difficulty problem-however, the mathematical problem does not fall under Number Theory; rather, it is one of Differential equations, the rules of Lie groups being the best solution. Even using Lie groups, a problem of great difficulty still remains. The first few examples use Maple 5.0, a symbolic processing program, and are available in an Internet site.</dc:description>
</entry>
<entry>
<title>Carpal-bone feature extraction analysis in skeletal age assessment based on deformable model</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9497" rel="alternate"/>
<author>
<name>Pan, Lin</name>
</author>
<author>
<name>Zhang, Feng</name>
</author>
<author>
<name>Yang, Yong</name>
</author>
<author>
<name>Zheng, Chong-Xun</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9497</id>
<updated>2019-06-19T04:02:46Z</updated>
<published>2004-10-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 4, no. 3
Skeletal age assessment is one of the important applications of hand radiography in the area of pediatric radiology. Features analysis of the carpal bones can reveal the important information for skeletal age assessment. The present work in this paper faces the problem of the detection of carpal-bone features from its radio-image. A novel and effective segmentation technique is presented in this work with carpal bone image for skeletal age estimation. Carpal bone segmentation is a critical operation of the automatic skeletal age assessment system. This method consists of three procedures. First, the original carpal bone image is preprocessed via anisotropic diffusion. Then, the carpal bone image is segmented by GVF-Snake model. Third, experiments are carried out on images of carpal bone. The results are very promising. In particular the method is able to extract overlapping carpal bones.
</summary>
<dc:date>2004-10-01T00:00:00Z</dc:date>
<dc:description>Skeletal age assessment is one of the important applications of hand radiography in the area of pediatric radiology. Features analysis of the carpal bones can reveal the important information for skeletal age assessment. The present work in this paper faces the problem of the detection of carpal-bone features from its radio-image. A novel and effective segmentation technique is presented in this work with carpal bone image for skeletal age estimation. Carpal bone segmentation is a critical operation of the automatic skeletal age assessment system. This method consists of three procedures. First, the original carpal bone image is preprocessed via anisotropic diffusion. Then, the carpal bone image is segmented by GVF-Snake model. Third, experiments are carried out on images of carpal bone. The results are very promising. In particular the method is able to extract overlapping carpal bones.</dc:description>
</entry>
<entry>
<title>Accurate calibration of stereo cameras for machine vision</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9496" rel="alternate"/>
<author>
<name>Li, Liangfu</name>
</author>
<author>
<name>Feng, Zuren</name>
</author>
<author>
<name>Feng, Yuanjing</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9496</id>
<updated>2019-06-19T04:02:45Z</updated>
<published>2004-10-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 4, no. 3
Camera calibration is an important task for machine vision, whose goal is to obtain the internal and external parameters of each camera. With these parameters, the 3D positions of a scene point, which is identified and matched in two stereo images, can be determined by the triangulation theory. This paper presents a new accurate estimation of CCD camera parameters for machine vision. We present a fast technique to estimate the camera center with special arrangement of calibration target and the camera model is aimed at efficient computation of camera parameters considering lens distortion. Built on strict geometry constraint, our calibration method has compensated the error for distortion cased by circular features on calibration target, which gets over the relativity influence of every unknown parameters of traditional calibration way and make the error distributed among the constraint relation of parameters, in order to guarantee the accuracy and consistency of calibration results. Experimental results are provided to show that the calibration accuracy is high.
</summary>
<dc:date>2004-10-01T00:00:00Z</dc:date>
<dc:description>Camera calibration is an important task for machine vision, whose goal is to obtain the internal and external parameters of each camera. With these parameters, the 3D positions of a scene point, which is identified and matched in two stereo images, can be determined by the triangulation theory. This paper presents a new accurate estimation of CCD camera parameters for machine vision. We present a fast technique to estimate the camera center with special arrangement of calibration target and the camera model is aimed at efficient computation of camera parameters considering lens distortion. Built on strict geometry constraint, our calibration method has compensated the error for distortion cased by circular features on calibration target, which gets over the relativity influence of every unknown parameters of traditional calibration way and make the error distributed among the constraint relation of parameters, in order to guarantee the accuracy and consistency of calibration results. Experimental results are provided to show that the calibration accuracy is high.</dc:description>
</entry>
<entry>
<title>Color image segmentation using multispectral random field texture model &amp; color content features</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9495" rel="alternate"/>
<author>
<name>Hernandez, Orlando J.</name>
</author>
<author>
<name>Khotanzad, Alireza</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9495</id>
<updated>2019-06-19T04:02:45Z</updated>
<published>2004-10-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 4, no. 3
This paper describes a color texture-based image segmentation system. The color texture information is obtained via modeling with the Multispectral Simultaneous Auto Regressive (MSAR) random field model. The general color content characterized by ratios of sample color means is also used. The image is segmented into regions of uniform color texture using an unsupervised histogram clustering approach that utilizes the combination of MSAR and color features. The performance of the system is tested on two databases containing synthetic mosaics of natural textures and natural scenes, respectively
</summary>
<dc:date>2004-10-01T00:00:00Z</dc:date>
<dc:description>This paper describes a color texture-based image segmentation system. The color texture information is obtained via modeling with the Multispectral Simultaneous Auto Regressive (MSAR) random field model. The general color content characterized by ratios of sample color means is also used. The image is segmented into regions of uniform color texture using an unsupervised histogram clustering approach that utilizes the combination of MSAR and color features. The performance of the system is tested on two databases containing synthetic mosaics of natural textures and natural scenes, respectively</dc:description>
</entry>
<entry>
<title>A five-valued logic and a system</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9494" rel="alternate"/>
<author>
<name>Ferreira, Ulisses</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9494</id>
<updated>2019-06-19T04:02:44Z</updated>
<published>2004-10-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 4, no. 3
The present article introduces a five-valued logic and a deductive system. Here, the logic presented is a relevant fragment of the @-logic, which is also a space-time logic. These five values correspond to the following semantics: unknown, possibly known but consistent, false, true, and inconsistent. The present logic and the PLAIN programming language are two results of the same intuitions and from the same philosophical view. Finally, as well as the purposes of PLAIN, the logic ought to be used to support (mobile) agents systems in some manner, besides general purposes.
</summary>
<dc:date>2004-10-01T00:00:00Z</dc:date>
<dc:description>The present article introduces a five-valued logic and a deductive system. Here, the logic presented is a relevant fragment of the @-logic, which is also a space-time logic. These five values correspond to the following semantics: unknown, possibly known but consistent, false, true, and inconsistent. The present logic and the PLAIN programming language are two results of the same intuitions and from the same philosophical view. Finally, as well as the purposes of PLAIN, the logic ought to be used to support (mobile) agents systems in some manner, besides general purposes.</dc:description>
</entry>
<entry>
<title>An evolutionary algorithm to track changes of optimum value locations in dynamic environments</title>
<link href="http://sedici.unlp.edu.ar:80/handle/10915/9493" rel="alternate"/>
<author>
<name>Aragón, Victoria S.</name>
</author>
<author>
<name>Esquivel, Susana Cecilia</name>
</author>
<id>http://sedici.unlp.edu.ar:80/handle/10915/9493</id>
<updated>2019-06-19T04:02:42Z</updated>
<published>2004-10-01T00:00:00Z</published>
<summary type="text">Articulo
Journal of Computer Science &amp; Technology; vol. 4, no. 3
Non-stationary, or dynamic, problems change over time. There exist a variety of forms of dynamism. The concept of dynamic environments in the context of this paper means that the fitness&#13;
landscape changes during the run of an evolutionary algorithm. Genetic diversity is crucial to provide the necessary adaptability of the algorithm to changes. Two mechanism of macromutation are incorporated to the algorithm to maintain genetic diversity in the population. The algorithm was tested on a set of dynamic testing functions provided by a dynamic fitness problem generator. The main goal was to&#13;
determinate the algorithm´s ability to reacting to changes of optimum values that alter their locations, so that the optimum value can still be tracked when dimensional and multimodal scalability in the functions is adjusted. The effectiveness and limitations of the proposed algorithm is discussed from results empirically obtained.
</summary>
<dc:date>2004-10-01T00:00:00Z</dc:date>
<dc:description>Non-stationary, or dynamic, problems change over time. There exist a variety of forms of dynamism. The concept of dynamic environments in the context of this paper means that the fitness&#13;
landscape changes during the run of an evolutionary algorithm. Genetic diversity is crucial to provide the necessary adaptability of the algorithm to changes. Two mechanism of macromutation are incorporated to the algorithm to maintain genetic diversity in the population. The algorithm was tested on a set of dynamic testing functions provided by a dynamic fitness problem generator. The main goal was to&#13;
determinate the algorithm´s ability to reacting to changes of optimum values that alter their locations, so that the optimum value can still be tracked when dimensional and multimodal scalability in the functions is adjusted. The effectiveness and limitations of the proposed algorithm is discussed from results empirically obtained.</dc:description>
</entry>
</feed>
