Guías de itinerarios didácticos por los espacios naturales de la Región de Murcia : humedales.

Itinerarios didácticos por tres humedales protegidos de la Región de Murcia: Reserva Natural de Sotos y Bosques de Ribera de Cañaverosa; Paisaje Protegido del Humedal de Ajauque y Rambla Salada y Parque Regional de Salinas y Arenales de San Pedro del Pinatar. El objetivo es. Esta serie de Cuadernos del Centro de Recursos de Educación Ambiental, CREA, incluye otra guía sobre itinerarios didácticos dedicados a las montañas de interior: Parque Regional de Sierra Espuña, Parque Regional de Carrascoy y El Valle, Lugar de Importancia Comunitaria Sierra de Ricote - La Navela.- Las fotografías son de: Miguel Ángel Núñez Herrero, Manuel Águila Guillén, Andrés Millán Sánchez, José Campillo.

Paisaje ecológico y biológico de Cantabria.

En el presente Proyecto el autor, profesor perteneciente al Departamento de Biología y Geología del IES Ría del Carmen de Camargo, desarrolla las siguientes unidades: El paisaje y su historia. El ciclo de las rocas y la dinámica de las placas tectónicas. El tiempo geológico (cronologías relativas y absolutas). Tipos de rocas, suelos y estructuras de deformación. Nociones de la geología de la Península Ibérica. Columna estratigráfica de Cantabria (capas rocosas y sus edades). Las zonas geológicas de la región. Cantabria paleozoica, Liébana. Del paleozoico al mesozoico, Valle del Nansa. Cuenca del Saja-Besaya y Sierra del Escudo de Cabuérniga. Valle del Pas, terrazas fluviales y dunas. Valles del Miera y Asón, glaciales y bahías. Costa de Liendo-Oriñón. La comarca costera y sus rasgos geológicos, rocas terciarias. Las comarcas meridionales, de Campoo a Valderredible. Macizos kársticos. Cuaternario, turberas, pólenes antiguos y plantas insectívoras. Vegetación de Cantabria, pisos biogeográficos. Las especies vegetales y los árboles con bellotas. Encinares. Bosques aluviales y vegetación de riberas. Vegetación costera, arenales, acantilados y marismas. Aproximación a la fauna y micología regional. Todo este material está documentado con fotos y dibujos.

El Sáhara y los cambios climáticos.

Resumen tomado de la publicación

Elaboración de un programa global de educación motriz orientado al desarrollo de la cooperación, la creatividad y la regulación autónoma de los conflictos en alumnado de educación infantil y primaria.

Este proyecto de innovación educativa se presentó en el Congreso Internacional de Innovación en la Educación celebrado en Valladolid los dias 26, 27 y 28 de abril de 2005

La lectura es divertida y nos acerca.

Se desarrolla un proyecto de innovación educativa sobre el fomento de la lectura en un Centro de Educación Especial en Astorga. El proyecto trata de compartir actividades que favorezcan la relación del alumnado de Educación especial con los alumnos y alumnas de otros Colegios, y el conocimiento por la sociedad del Colegio de Educación Especial a través de una actividad lúdica, divertida y a la vez educativa. El proyecto propuesto se ofrece a 14 centros educativos del entorno, a quienes se les invita a visitar la exposición y a realizar las actividades previstas. Se invita a cada colegio a una jornada de actividad y convivencia alrededor de una actividad lúdica centrada en el hábito lector con el fin de fomentar la interrelación y conocimiento de la realidad del alumnado, para finalizar con la elaboración de un boletín con el resumen de la experiencia que se envía a cada centro invitado. La actividad principal de la visita se centra en el trabajo en un espacio lúdico de exposición y manipulación de libros curiosos (grandes troquelados, libros de gran tamaño, libros pequeños, libros juego, libros que se huelen, interactivos, libros con sonido, en diferentes y raros formatos, cerámica, madera) así como realizar otras actividades relacionadas con la lectura (ordenador, dibujo, lecturas, proyecciones, etc.). Alrededor de esta actividad central se realizarían otras (taller de cuenta cuentos rítmico participativo, actividad 'fabricamos un libro' recreos y comida compartidos, visitas a los talleres del Centro Ocupacional, unidades temáticas para realizar en casa, visita posterior a la exposición de los alumnos con sus padres, etc.). El éxito de las diversas actividades planteadas ha llevado a la consecución de dos grandes objetivos, la integración de los alumnos y alumnas del centro con otros niños y niñas y el fomento de la lectura como medio para conseguir el primero.

El vídeo en un centro de FP : cursos 1985-86 y 86-87 : IFP Rodríguez Fabrés.

Ejemplar fotocopiado. Incompleto

Investigación lexicográfica para la enseñanza de lenguas.

Resumen basado en el de la publicación

Del texto al sonido, del guión a la imagen : periodistas escolares al servicio de la comunicación : memoria del proyecto de innovación.

Es continuación de otro proyecto titulado : Del lenguaje oral al texto escrito, desde nuestra biblioteca a vuestra biblioteca. Ayudas a la Innovación Educativa, 1997-98. Anexo Memoria en C-Innov. 92

The constrained compartmentalized knapsack problem: mathematical models and solution methods

The constrained compartmentalized knapsack problem can be seen as an extension of the constrained knapsack problem. However, the items are grouped into different classes so that the overall knapsack has to be divided into compartments, and each compartment is loaded with items from the same class. Moreover, building a compartment incurs a fixed cost and a fixed loss of the capacity in the original knapsack, and the compartments are lower and upper bounded. The objective is to maximize the total value of the items loaded in the overall knapsack minus the cost of the compartments. This problem has been formulated as an integer non-linear program, and in this paper, we reformulate the non-linear model as an integer linear master problem with a large number of variables. Some heuristics based on the solution of the restricted master problem are investigated. A new and more compact integer linear model is also presented, which can be solved by a branch-and-bound commercial solver that found most of the optimal solutions for the constrained compartmentalized knapsack problem. On the other hand, heuristics provide good solutions with low computational effort. (C) 2011 Elsevier BM. All rights reserved.

On the cutting stock problem under stochastic demand

This paper addresses the one-dimensional cutting stock problem when demand is a random variable. The problem is formulated as a two-stage stochastic nonlinear program with recourse. The first stage decision variables are the number of objects to be cut according to a cutting pattern. The second stage decision variables are the number of holding or backordering items due to the decisions made in the first stage. The problem`s objective is to minimize the total expected cost incurred in both stages, due to waste and holding or backordering penalties. A Simplex-based method with column generation is proposed for solving a linear relaxation of the resulting optimization problem. The proposed method is evaluated by using two well-known measures of uncertainty effects in stochastic programming: the value of stochastic solution-VSS-and the expected value of perfect information-EVPI. The optimal two-stage solution is shown to be more effective than the alternative wait-and-see and expected value approaches, even under small variations in the parameters of the problem.

Crop rotation scheduling with adjacency constraints

In this article we propose a 0-1 optimization model to determine a crop rotation schedule for each plot in a cropping area. The rotations have the same duration in all the plots and the crops are selected to maximize plot occupation. The crops may have different production times and planting dates. The problem includes planting constraints for adjacent plots and also for sequences of crops in the rotations. Moreover, cultivating crops for green manuring and fallow periods are scheduled into each plot. As the model has, in general, a great number of constraints and variables, we propose a heuristics based on column generation. To evaluate the performance of the model and the method, computational experiments using real-world data were performed. The solutions obtained indicate that the method generates good results.

Sustainable vegetable crop supply problem

We consider an agricultural production problem, in which one must meet a known demand of crops while respecting ecologically-based production constraints. The problem is twofold: in order to meet the demand, one must determine the division of the available heterogeneous arable areas in plots and, for each plot, obtain an appropriate crop rotation schedule. Rotation plans must respect ecologically-based constraints such as the interdiction of certain crop successions, and the regular insertion of fallows and green manures. We propose a linear formulation for this problem, in which each variable is associated with a crop rotation schedule. The model may include a large number of variables and it is, therefore, solved by means of a column-generation approach. We also discuss some extensions to the model, in order to incorporate additional characteristics found in field conditions. A set of computational tests using instances based on real-world data confirms the efficacy of the proposed methodology. (C) 2009 Elsevier B.V. All rights reserved.

A linear optimization approach to the combined production planning model

Two fundamental processes usually arise in the production planning of many industries. The first one consists of deciding how many final products of each type have to be produced in each period of a planning horizon, the well-known lot sizing problem. The other process consists of cutting raw materials in stock in order to produce smaller parts used in the assembly of final products, the well-studied cutting stock problem. In this paper the decision variables of these two problems are dependent of each other in order to obtain a global optimum solution. Setups that are typically present in lot sizing problems are relaxed together with integer frequencies of cutting patterns in the cutting problem. Therefore, a large scale linear optimizations problem arises, which is exactly solved by a column generated technique. It is worth noting that this new combined problem still takes the trade-off between storage costs (for final products and the parts) and trim losses (in the cutting process). We present some sets of computational tests, analyzed over three different scenarios. These results show that, by combining the problems and using an exact method, it is possible to obtain significant gains when compared to the usual industrial practice, which solve them in sequence. (C) 2010 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.

Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths

This paper deals with the classical one-dimensional integer cutting stock problem, which consists of cutting a set of available stock lengths in order to produce smaller ordered items. This process is carried out in order to optimize a given objective function (e.g., minimizing waste). Our study deals with a case in which there are several stock lengths available in limited quantities. Moreover, we have focused on problems of low demand. Some heuristic methods are proposed in order to obtain an integer solution and compared with others. The heuristic methods are empirically analyzed by solving a set of randomly generated instances and a set of instances from the literature. Concerning the latter. most of the optimal solutions of these instances are known, therefore it was possible to compare the solutions. The proposed methods presented very small objective function value gaps. (C) 2008 Elsevier Ltd. All rights reserved.

A Lagrangian relaxation approach to a coupled lot-sizing and cutting stock problem

Industrial production processes involving both lot-sizing and cutting stock problems are common in many industrial settings. However, they are usually treated in a separate way, which could lead to costly production plans. In this paper, a coupled mathematical model is formulated and a heuristic method based on Lagrangian relaxation is proposed. Computational results prove its effectiveness. (C) 2009 Elsevier B.V. All rights reserved.