<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Volumen 08 | Número 01</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/391</link>
<description/>
<pubDate>Wed, 18 Nov 2026 19:07:31 GMT</pubDate>
<dc:date>2026-11-18T19:07:31Z</dc:date>
<item>
<title>A formal foundation for transformations in model driven engineering</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9623</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 8, no. 1
In the MDE (Model Driven Engineering) paradigm, models are thought to be the primary conductors in all software development aspects. A PIM (Platform Independent Model) is transformed into one or more PSMs (Platform Specific Model); hence, a specific PSM is generated for each specific technological platform. In turn these output models may be transformed into another set of models until finally the output consists of program code that can be executed. Model transformation is the MDE engine; models are no longer mere contemplative entities and become productive entities. The MDE initiative covers a broad spectrum of research areas: modeling languages, definition of languages for model transformation, construction of support tools for the different tasks involved, application of concepts to development methods and specific domains, etc. Currently, some of these aspects are well-based, and are being applied with some success; however, other aspects are still undergoing their definition process. In this context, it is necessary to make every effort to convert MDE and its concepts and related techniques into a coherent proposal, based on open standards, and supported by mature tools and techniques. Model transformations require specific languages for their definition; these languages should have a formal base, for example, a metamodel that supports them and allows for an automated treatment.
Resumen de la tesis presentada por la autora para obtener el título de Doctor en Ciencias Informáticas (UNLP, 2007).; Es revisión de: http://sedici.unlp.edu.ar/handle/10915/4145
</description>
<pubDate>Tue, 01 Apr 2008 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9623</guid>
<dc:date>2008-04-01T00:00:00Z</dc:date>
<dc:description>In the MDE (Model Driven Engineering) paradigm, models are thought to be the primary conductors in all software development aspects. A PIM (Platform Independent Model) is transformed into one or more PSMs (Platform Specific Model); hence, a specific PSM is generated for each specific technological platform. In turn these output models may be transformed into another set of models until finally the output consists of program code that can be executed. Model transformation is the MDE engine; models are no longer mere contemplative entities and become productive entities. The MDE initiative covers a broad spectrum of research areas: modeling languages, definition of languages for model transformation, construction of support tools for the different tasks involved, application of concepts to development methods and specific domains, etc. Currently, some of these aspects are well-based, and are being applied with some success; however, other aspects are still undergoing their definition process. In this context, it is necessary to make every effort to convert MDE and its concepts and related techniques into a coherent proposal, based on open standards, and supported by mature tools and techniques. Model transformations require specific languages for their definition; these languages should have a formal base, for example, a metamodel that supports them and allows for an automated treatment.</dc:description>
</item>
<item>
<title>C# for programmers (second edition). Harvey M. Deitel and Paul J. Deitel: Prentice Hall, 2006. ISBN 0131345915</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9622</link>
<description>Revision
Journal of Computer Science &amp; Technology; vol. 8, no. 1
C# for Programmers (Second Edition) focuses on explaining the characteristics of this language through the development of desktop applications –and in some cases, web forms– with the step-by-step technique, developing study cases such as: • Basic application for an automatic teller machine (ATM) • Payroll application • Guestbook application Concepts are developed in 26 chapters supported by 9 appendixes included in one CD.
</description>
<pubDate>Tue, 01 Apr 2008 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9622</guid>
<dc:date>2008-04-01T00:00:00Z</dc:date>
<dc:description>C# for Programmers (Second Edition) focuses on explaining the characteristics of this language through the development of desktop applications –and in some cases, web forms– with the step-by-step technique, developing study cases such as: • Basic application for an automatic teller machine (ATM) • Payroll application • Guestbook application Concepts are developed in 26 chapters supported by 9 appendixes included in one CD.</dc:description>
</item>
<item>
<title>Compositional synthesis of distributed system components based on augmented marked graphs</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9621</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 8, no. 1
Augmented marked graphs possess a special structure for modelling common resources as well as some desirable properties pertaining to liveness, boundedness, reversibility and conservativeness. This paper investigates the property-preserving composition of augmented marked graphs for the synthesis of distributed systems. It is proposed that distributed system components are specified as augmented marked graphs. An integrated system is obtained by composing these augmented marked graphs via their common resource places. Based on preservation of properties, liveness, boundedness, reversibility and conservativeness of the system can be readily derived. This contributes to resolve the problem of ensuring design correctness in the composition of distributed system components.
</description>
<pubDate>Tue, 01 Apr 2008 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9621</guid>
<dc:date>2008-04-01T00:00:00Z</dc:date>
<dc:description>Augmented marked graphs possess a special structure for modelling common resources as well as some desirable properties pertaining to liveness, boundedness, reversibility and conservativeness. This paper investigates the property-preserving composition of augmented marked graphs for the synthesis of distributed systems. It is proposed that distributed system components are specified as augmented marked graphs. An integrated system is obtained by composing these augmented marked graphs via their common resource places. Based on preservation of properties, liveness, boundedness, reversibility and conservativeness of the system can be readily derived. This contributes to resolve the problem of ensuring design correctness in the composition of distributed system components.</dc:description>
</item>
<item>
<title>A proposal of communication protocols in ubiquitous computation environment in the residential automation</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9620</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 8, no. 1
An ubiquitous computation environment has as presupposed that the computation is in all equipment and devices, and these are interacting between itself and with the people. The connection between objects and human beings is instantaneous, when these enter in the ubiquitous environment. A communication protocol to make the linking between many devices, of many manufacturers, in this environment, will be the key so that this connectivity happens. In the industrial automation, the protocol RS 485, is very used. Although some similarities in the intentions, the residential automation has different concepts from the industrial. The protocol I2C, of the wire technology, developed by Philips, appears as option for the residential automation. Protocols of wireless technology, as bluetooth and zigbee, because of its characteristic of covering, are presented as complement for this automation. This article aims to present a vision about the necessary characteristics of the communication protocols for a ubiquitous computation environment in the residential automation. In it will be described the studies, development and implantation of devices of residential automation that occurs in the QualiHouse Residential Automation, incubated company in the Trilha, pre-incubator of the Faculdade Integrada do Recife - FIR.
</description>
<pubDate>Tue, 01 Apr 2008 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9620</guid>
<dc:date>2008-04-01T00:00:00Z</dc:date>
<dc:description>An ubiquitous computation environment has as presupposed that the computation is in all equipment and devices, and these are interacting between itself and with the people. The connection between objects and human beings is instantaneous, when these enter in the ubiquitous environment. A communication protocol to make the linking between many devices, of many manufacturers, in this environment, will be the key so that this connectivity happens. In the industrial automation, the protocol RS 485, is very used. Although some similarities in the intentions, the residential automation has different concepts from the industrial. The protocol I2C, of the wire technology, developed by Philips, appears as option for the residential automation. Protocols of wireless technology, as bluetooth and zigbee, because of its characteristic of covering, are presented as complement for this automation. This article aims to present a vision about the necessary characteristics of the communication protocols for a ubiquitous computation environment in the residential automation. In it will be described the studies, development and implantation of devices of residential automation that occurs in the QualiHouse Residential Automation, incubated company in the Trilha, pre-incubator of the Faculdade Integrada do Recife - FIR.</dc:description>
</item>
<item>
<title>A UML profile for documenting the component-and-connector view of software architectures</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9619</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 8, no. 1
In this paper, we present a UML profile and a group of UML patterns for documenting the component-andconnector&#13;
views of software architectures [8]. They facilitate the creation of the component and connector viewtype in any UML 2.0 tool with a compliance level 3 [14]. This work's contributions are: (1) Facilitating the documentation of all the software application's views using only one tool. (2) Curtailing investment in personnel training. (3) Allowing the establishment of an adequate traceability between the architectural artifacts and the rest of the model.
</description>
<pubDate>Tue, 01 Apr 2008 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9619</guid>
<dc:date>2008-04-01T00:00:00Z</dc:date>
<dc:description>In this paper, we present a UML profile and a group of UML patterns for documenting the component-andconnector&#13;
views of software architectures [8]. They facilitate the creation of the component and connector viewtype in any UML 2.0 tool with a compliance level 3 [14]. This work's contributions are: (1) Facilitating the documentation of all the software application's views using only one tool. (2) Curtailing investment in personnel training. (3) Allowing the establishment of an adequate traceability between the architectural artifacts and the rest of the model.</dc:description>
</item>
<item>
<title>DWT based digital watermarking fidelity and robustness evaluation</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9618</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 8, no. 1
An Image Adaptive Watermarking method based on the Discrete Wavelet Transform is presented in this paper.&#13;
The robustness and fidelity of the proposed method are evaluated and the method is compared to state-of-the-art watermarking techniques available in the literature. For the evaluation of watermark transparency, an image fidelity factor based on a perceptual distortion metric is introduced.&#13;
On the other hand, a degradation factor is introduced for the evaluation of watermark robustness against JPEG compression and resizing. The new fidelity metric allows a perceptually aware objective quantification of image fidelity.&#13;
The suitability of the proposed metric for the fidelity evaluation of still image watermarking is supported by simulation results.
</description>
<pubDate>Tue, 01 Apr 2008 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9618</guid>
<dc:date>2008-04-01T00:00:00Z</dc:date>
<dc:description>An Image Adaptive Watermarking method based on the Discrete Wavelet Transform is presented in this paper.&#13;
The robustness and fidelity of the proposed method are evaluated and the method is compared to state-of-the-art watermarking techniques available in the literature. For the evaluation of watermark transparency, an image fidelity factor based on a perceptual distortion metric is introduced.&#13;
On the other hand, a degradation factor is introduced for the evaluation of watermark robustness against JPEG compression and resizing. The new fidelity metric allows a perceptually aware objective quantification of image fidelity.&#13;
The suitability of the proposed metric for the fidelity evaluation of still image watermarking is supported by simulation results.</dc:description>
</item>
<item>
<title>A low cost advance encryption standard (AES) co-processor implementation</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9617</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 8, no. 1
The need for privacy has become a major priority for both governments and civilians desiring protection from signal interception. Widespread use of personal communications devices has only increased demand for a level of security on previously insecure communications. This paper presents a novel low-cost architecture for the Advanced Encryption Standard (AES) algorithm utilizing a field programmable gate array (FPGA). In as much as possible, this architecture uses a bit-serial approach, and it is also suitable for VLSI implementations. In this implementation, the primary objective was not to increase throughput or decrease latency, but to balance these factors in order to lower the cost. A focus on low cost resulted in a design well-suited for SoC implementations. This allows for scaling of the architecture towards vulnerable portable and cost-sensitive communications devices in consumer and military applications.
</description>
<pubDate>Tue, 01 Apr 2008 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9617</guid>
<dc:date>2008-04-01T00:00:00Z</dc:date>
<dc:description>The need for privacy has become a major priority for both governments and civilians desiring protection from signal interception. Widespread use of personal communications devices has only increased demand for a level of security on previously insecure communications. This paper presents a novel low-cost architecture for the Advanced Encryption Standard (AES) algorithm utilizing a field programmable gate array (FPGA). In as much as possible, this architecture uses a bit-serial approach, and it is also suitable for VLSI implementations. In this implementation, the primary objective was not to increase throughput or decrease latency, but to balance these factors in order to lower the cost. A focus on low cost resulted in a design well-suited for SoC implementations. This allows for scaling of the architecture towards vulnerable portable and cost-sensitive communications devices in consumer and military applications.</dc:description>
</item>
<item>
<title>Robustness analysis for the method of assignment MATEHa</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/9616</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 8, no. 1
The TTIGHa model has been developed to model and predict the performance of parallel applications run over heterogeneous architectures. In addition, the task assignment algorithm was implemented to MATEHa processors based on the TTIGHa model.&#13;
This paper analyzes the assignment algorithm robustness before different variations which the model parameters may undergo (basically, communication and processing times).
</description>
<pubDate>Tue, 01 Apr 2008 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/9616</guid>
<dc:date>2008-04-01T00:00:00Z</dc:date>
<dc:description>The TTIGHa model has been developed to model and predict the performance of parallel applications run over heterogeneous architectures. In addition, the task assignment algorithm was implemented to MATEHa processors based on the TTIGHa model.&#13;
This paper analyzes the assignment algorithm robustness before different variations which the model parameters may undergo (basically, communication and processing times).</dc:description>
</item>
<item>
<title>Storage of simulation and entities history in discrete models</title>
<link>http://sedici.unlp.edu.ar:80/handle/10915/5518</link>
<description>Articulo
Journal of Computer Science &amp; Technology; vol. 8, no. 1
Simulation is the process of executing a model, that is a representation of a system with enough detail to describe it but not too excessive. This model has a set of entities an internal state, a set of input variable that can be controlled and others that cannot, a list of process that bind these input variables with the entities and one or more output values, which result from the execution of the processes. Running a model is totally useless if it can not be analyzed, which means to study all interactions among input variables, model entities and their weight in the values of the output variables. In this work we consider Discrete Event Simulation, which means that the status of the system variables being simulated change in a countable set of instants, finite or countable infinite. Simulation programming languages provide a big range of tools for analysis of the results, for generation and execution of experiments and to perform complex analysis (such as Analysis of Variance). This is usually enough for common analysis, but many times more detailed information is required. In many circumstances it is desirable to have all run of simulations stored in order to make further analysis or comparisons between simulations, many time after they have been run. Most simulation environments provide reports and logs (journals) and permit to save them in text or formated files, which include all results and some aspects of the run itself. In this work, we propose to store not only all simulation results, but all simulation history. This implies to store all permanent entities of the simulation, and all changes they have undergone along the simulation times. But it not only limits to permanent entities, since we also store the temporary ones, which are created and destroyed anytime in the simulation and which existence is subject to the execution of the simulation and the state of all model variables. This development takes the same syntax of GPSS language and the way it handles entities, to develop a simple interpreter and a tool that considers a subset of GPSS entities and permits to execute simulations with them. Besides, this tool permits to search and select entities for each simulation and displays their evolution along the simulation.
</description>
<pubDate>Tue, 01 Jan 2008 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://sedici.unlp.edu.ar:80/handle/10915/5518</guid>
<dc:date>2008-01-01T00:00:00Z</dc:date>
<dc:description>Simulation is the process of executing a model, that is a representation of a system with enough detail to describe it but not too excessive. This model has a set of entities an internal state, a set of input variable that can be controlled and others that cannot, a list of process that bind these input variables with the entities and one or more output values, which result from the execution of the processes. Running a model is totally useless if it can not be analyzed, which means to study all interactions among input variables, model entities and their weight in the values of the output variables. In this work we consider Discrete Event Simulation, which means that the status of the system variables being simulated change in a countable set of instants, finite or countable infinite. Simulation programming languages provide a big range of tools for analysis of the results, for generation and execution of experiments and to perform complex analysis (such as Analysis of Variance). This is usually enough for common analysis, but many times more detailed information is required. In many circumstances it is desirable to have all run of simulations stored in order to make further analysis or comparisons between simulations, many time after they have been run. Most simulation environments provide reports and logs (journals) and permit to save them in text or formated files, which include all results and some aspects of the run itself. In this work, we propose to store not only all simulation results, but all simulation history. This implies to store all permanent entities of the simulation, and all changes they have undergone along the simulation times. But it not only limits to permanent entities, since we also store the temporary ones, which are created and destroyed anytime in the simulation and which existence is subject to the execution of the simulation and the state of all model variables. This development takes the same syntax of GPSS language and the way it handles entities, to develop a simple interpreter and a tool that considers a subset of GPSS entities and permits to execute simulations with them. Besides, this tool permits to search and select entities for each simulation and displays their evolution along the simulation.</dc:description>
</item>
</channel>
</rss>
