Catálogo de publicaciones - libros

Increasingly, e-learning platforms are being implemented at various educational levels as a form of teaching support. In addition to promoting flexibility in teaching and to permitting the incorporation of new educational materials and resources, e-learning aims to familiarize students with the use of the computer as a work tool. The present paper describes an experiment involving the construction and adaptation of an e-learning platform to the teaching of psychology at university level. The paper presents findings concerning the use of the platform by students and the relation between this use and academic performance in two courses over two complete academic years. Results show that students who take advantage of the virtual educational platforms generally present a higher level of participation and academic achievement.

There are many tools that leans in the cognitivism as general platform, for example the wikis. This is a study in a topography course of Spanish students with no previous knowledge of computers and computing.We aplicated one voluntary work in their last project where it showed that the 59,4% of these students use in an effective manner the Wiki tool.

The impressive growth of life sciences in the last couple of years forced computer scientists to deal with scientific areas like biochemistry, biophysics or medicine. Studies in these research areas are often based on dynamic molecular systems whose principles are found in basic mechanics, forming the term ”molecular mechanics”. Since such highly computationally intensive molecular dynamics (MD) simulations [12] are usually carried out through the variation of different input parameters, they are well suited for being executed in heterogenous grid environments. This paper introduces a novel technique for interactively visualizing MD simulations on the grid, a method currently not available for grid-based MD simulations, supporting physicians, chemists and biophysicists of being able to abort a simulation when it turns out that it would not make sense to run it even longer.

Grid technology concerns the sharing of resources among a very large set of users. One of the main security issues of the Grid environment concerns the user authorization. As a matter of fact, Grid resource providers grant accesses to their resources to possibly unknown Grid users, but they want that these accesses are regulated by proper security policies.

This paper proposes a framework that integrates an advanced authorization system, the RTML one, in the Globus toolkit. For each Grid user that requests to access the Grid resource, the framework determines the proper set of rights to be paired to the user depending on the trust he previously collected interacting with other sites on the Grid, instead of simply considering his identity. This trust is represented by the set of credentials issued by other Grid sites that grant to the user some roles in these sites.

We are developing a computer system that will enable the precise diagnosis and the planning of therapy in the field of coronary artery disease. The implementation of this system is carried out within the framework of a computational GRID (Austrian GRID). Our aim is to obtain patient-specific simulations of coronary hemodynamics. The geometry of the flow domain is derived from biplane angiograms. In these images, the coronary artery tree must be segmented. Thereafter, a three-dimensional reconstruction method is applied. However, biplane angiograms are subject to noise, blur, and image deterioration caused by background structures. In order to eliminate these disturbances, several image pre-processing steps and a newly developed segmentation method must be carried out. In this paper we will concentrate on our new segmentation approach and show that the segmentation of the coronary artery tree can be solved advantageously within the framework of a computational GRID.

This paper proposes an efficient optimization algorithm based on tabu search and estimation of distribution algorithms. The proposed algorithm estimates characteristics of distribution of solutions after performing tabu searches based on a marginal product model to acquire linkage information. Once correct linkage information is obtained, we can perform crossovers effectively without disrupting building blocks using the information. The proposed algorithm is expected to adapt to both global and local characteristics of solution space. Through empirical studies, we show the effectiveness of our approach.

This paper presents a problem-solving framework based on robust evolutionary search in GRID computing environment. Our problem-solving environment called performs simulator programs in parallel and optimize their input parameters employing a competent evolutionary algorithm with gene analysis. The objective of our project is to replace a part of human designer’s try-and-error processes by a parallel and robust evolutionary search on GRID computing systems.

Grid system has various kinds of resources such as computing resources, storage resources, instrument resources, data resources, etc. However, because of the differences of formats, descriptions, structures, and access modes of these resources, grid computing fails to access these resources uniformly and make full use of them. How to organize and manage all sorts of resources as a whole In Grid Environment, and provide the upper application with coherent description as well as uniform access interface is the problem of coherency access of different resources In Grid Environment.

This paper describes novel contributions to the problem of sequential equivalence checking. We address industrial setups, where the design of VLSI chips typically requires checking the equivalence of an RTL model (the specification) and a gate level optimized circuit (the implementation). Due to the size of the overall problem, compositionality is required. The circuit must be resetable, but the reset state is not yet known when equivalence checking is performed. In this paper we discuss the conditions under which decomposed proofs of equivalence are able to infer the equivalence of the full design. Our main contributions with respect to the state of the art in this field are: (1) discussing compositionality given a 3-valued initialization scheme, (2) accepting decompositions with overlapping partitions.

Most non-trivial applications use some form of input/output (I/O), such as network communication. When model checking such an application, a simple state space exploration scheme is not applicable, as the process being model checked would replay I/O operations when revisiting a given state. Thus software model checking needs to encapsulate such operations in a caching layer that is capable of hiding redundant executions of I/O operations from the environment.