Objetos de aprendizaje y significado.

El artículo está incluido en un número monográfico especial con los trabajos del I Simposio Pluridisciplinar sobre Diseño, Evaluación y Descripción de Contenidos Educativos Reutilizables (Guadalajara, Octubre 2004).Resumen basado en el de la publicación

Uma perspectiva interacionista em educação à distância na área de linguagem. 'Una perspectiva de interacción en educación a distancia en el área del lenguaje'.

Resumen basado en el de la publicación

Entornos hipermedia para aprender : una alternativa para los ejemplos elaborados.

Resumen basado en el de la publicación

A aprendizagem sobre intervalos de confian??a com recurso ao software R

Resumen basado en el de la publicaci??n

Per qu?? treballar la programaci?? a l'escola prim??ria?

Resumen basado en el de la publicaci??n

Baja SAE USB como caso de aprendizaje orientado por proyectos desde el paradigma de la complejidad

Resumen basado en el de la publicaci??n

Incorporaci??n de la programaci??n inform??tica en el curr??culum de Biolog??a

Resumen tomado de la publicaci??n

Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces

We present algorithms for computing approximate distance functions and shortest paths from a generalized source (point, segment, polygonal chain or polygonal region) on a weighted non-convex polyhedral surface in which obstacles (represented by polygonal chains or polygons) are allowed. We also describe an algorithm for discretizing, by using graphics hardware capabilities, distance functions. Finally, we present algorithms for computing discrete k-order Voronoi diagrams

Generalized Higher-Order Voronoi Diagrams on Polyhedral Surfaces

We present an algorithm for computing exact shortest paths, and consequently distances, from a generalized source (point, segment, polygonal chain or polygonal region) on a possibly non-convex polyhedral surface in which polygonal chain or polygon obstacles are allowed. We also present algorithms for computing discrete Voronoi diagrams of a set of generalized sites (points, segments, polygonal chains or polygons) on a polyhedral surface with obstacles. To obtain the discrete Voronoi diagrams our algorithms, exploiting hardware graphics capabilities, compute shortest path distances defined by the sites

View-dependent information theory quality measures for pixel sampling and scene discretization in flatland

In this paper, we present view-dependent information theory quality measures for pixel sampling and scene discretization in flatland. The measures are based on a definition for the mutual information of a line, and have a purely geometrical basis. Several algorithms exploiting them are presented and compare well with an existing one based on depth differences

Informational Aesthetics Measures

The Birkhoff aesthetic measure of an object is the ratio between order and complexity. Informational aesthetics describes the interpretation of this measure from an information-theoretic perspective. From these ideas, the authors define a set of ratios based on information theory and Kolmogorov complexity that can help to quantify the aesthetic experience

Shape complexity based on mutual information

Shape complexity has recently received attention from different fields, such as computer vision and psychology. In this paper, integral geometry and information theory tools are applied to quantify the shape complexity from two different perspectives: from the inside of the object, we evaluate its degree of structure or correlation between its surfaces (inner complexity), and from the outside, we compute its degree of interaction with the circumscribing sphere (outer complexity). Our shape complexity measures are based on the following two facts: uniformly distributed global lines crossing an object define a continuous information channel and the continuous mutual information of this channel is independent of the object discretisation and invariant to translations, rotations, and changes of scale. The measures introduced in this paper can be potentially used as shape descriptors for object recognition, image retrieval, object localisation, tumour analysis, and protein docking, among others

Point sampling with uniformly distributed lines

In this paper we address the problem of extracting representative point samples from polygonal models. The goal of such a sampling algorithm is to find points that are evenly distributed. We propose star-discrepancy as a measure for sampling quality and propose new sampling methods based on global line distributions. We investigate several line generation algorithms including an efficient hardware-based sampling method. Our method contributes to the area of point-based graphics by extracting points that are more evenly distributed than by sampling with current algorithms

Error and complexity of random walk Monte Carlo radiosity

The author studies the error and complexity of the discrete random walk Monte Carlo technique for radiosity, using both the shooting and gathering methods. The author shows that the shooting method exhibits a lower complexity than the gathering one, and under some constraints, it has a linear complexity. This is an improvement over a previous result that pointed to an O(n log n) complexity. The author gives and compares three unbiased estimators for each method, and obtains closed forms and bounds for their variances. The author also bounds the expected value of the mean square error (MSE). Some of the results obtained are also shown

Perfils: Evert Jan Baerends i la densitat electrònica de molècules

Evert Jan Baerends és catedràtic de la Universitat Lliure d’Amsterdam i de la Universitat de Ciència i Tecnologia de Pohang de Corea del Sud. És un dels impulsors de l’Amsterdam Density Functional Program System, la teoria que ha revolucionat el camp de la química teòrica i computacional moderna. La importància de la densitat electrònica es va fer patent l’any 1964, quan Walter Kohn (Premi Nobel 1998) va demostrar que totes les propietats de les molècules es poden caracteritzar a partir del coneixement de la densitat. Ha assistit al Girona Seminar, convidat per l’Institut de Química Computacional de la UdG