Idoneidad didáctica de un protocolo sociocultural de enseñanza y aprendizaje de las matemáticas

En este estudio se evalúa la adecuación de un protocolo para la enseñanza del concepto de poliedro regular, destinado a alumnos de 14 y 15 años. Este protocolo se ha diseñado desde una perspectiva sociocultural y su evaluación se basa en la aplicación de los criterios de idoneidad didáctica que ofrece el enfoque ontosemiótico. La idoneidad se estudia con la revisión de sus diferentes dimensiones: matemática, cognitiva, interaccional, mediacional, emocional y ecológica. El análisis ha permitido detectar algunos factores que favorecen la validez del protocolo y la adecuación para su empleo en el aula, como el tipo de discurso, el uso de material manipulable o el trabajo cooperativo

Refinement criteria for global illumination using convex funcions

In several computer graphics areas, a refinement criterion is often needed to decide whether to go on or to stop sampling a signal. When the sampled values are homogeneous enough, we assume that they represent the signal fairly well and we do not need further refinement, otherwise more samples are required, possibly with adaptive subdivision of the domain. For this purpose, a criterion which is very sensitive to variability is necessary. In this paper, we present a family of discrimination measures, the f-divergences, meeting this requirement. These convex functions have been well studied and successfully applied to image processing and several areas of engineering. Two applications to global illumination are shown: oracles for hierarchical radiosity and criteria for adaptive refinement in ray-tracing. We obtain significantly better results than with classic criteria, showing that f-divergences are worth further investigation in computer graphics. Also a discrimination measure based on entropy of the samples for refinement in ray-tracing is introduced. The recursive decomposition of entropy provides us with a natural method to deal with the adaptive subdivision of the sampling region

New delay-dependent stability criteria for uncertain neutral systems with mixed time-varying delays and nonlinear perturbations

The problem of stability analysis for a class of neutral systems with mixed time-varying neutral, discrete and distributed delays and nonlinear parameter perturbations is addressed. By introducing a novel Lyapunov-Krasovskii functional and combining the descriptor model transformation, the Leibniz-Newton formula, some free-weighting matrices, and a suitable change of variables, new sufficient conditions are established for the stability of the considered system, which are neutral-delay-dependent, discrete-delay-range dependent, and distributeddelay-dependent. The conditions are presented in terms of linear matrix inequalities (LMIs) and can be efficiently solved using convex programming techniques. Two numerical examples are given to illustrate the efficiency of the proposed method