Nuevas herramientas para el estudio de la interacción entre especies en el espacio y en el tiempo

Las funciones de segundo orden son cada vez más empleadas en el análisis de procesos ecológicos. En este trabajo presentamos dos funciones de 2º orden desarrolladas recientemente que permiten analizar la interacción espacio-temporal entre dos especies o tipos funcionales de individuos. Estas funciones han sido desarrolladas para el estudio de interacciones entre especies en masas forestales a partir de la actual distribución diamétrica de los árboles. La primera de ellas es la función bivariante para procesos de puntos con marca Krsmm, que permite analizar la correlación espacial de una variable entre los individuos pertenecientes a dos especies en función de la distancia. La segunda es la función de reemplazo , que permite analizar la asociación entre los individuos pertenecientes a dos especies en función de la diferencia entre sus diámetros u otra variable asociada a dichos individuos. Para mostrar el comportamiento de ambas funciones en el análisis de sistemas forestales en los que operan diferentes procesos ecológicos se presentan tres casos de estudio: una masa mixta de Pinus pinea L. y Pinus pinaster Ait. en la Meseta Norte, un bosque de niebla de la Región Tropical Andina y el ecotono entre las masas de Quercus pyrenaica Willd. y Pinus sylvestris L. en el Sistema Central, en los que tanto la función Krsmm como la función r se utilizan para analizar la dinámica forestal a partir de parcelas experimentales con todos los árboles localizados y de parcelas de inventario.

Fénix: a flexible information exchange data model for natural language processing

In this paper we describe Fénix, a data model for exchanging information between Natural Language Processing applications. The format proposed is intended to be flexible enough to cover both current and future data structures employed in the field of Computational Linguistics. The Fénix architecture is divided into four separate layers: conceptual, logical, persistence and physical. This division provides a simple interface to abstract the users from low-level implementation details, such as programming languages and data storage employed, allowing them to focus in the concepts and processes to be modelled. The Fénix architecture is accompanied by a set of programming libraries to facilitate the access and manipulation of the structures created in this framework. We will also show how this architecture has been already successfully applied in different research projects.

Spanish Nursing Students' Practical Experience of Computer Applications in Nursing

This study aimed to determine the level of computer practical experience in a sample of Spanish nursing students. Each student was given a Spanish language questionnaire, modified from an original used previously with medical students at the Medical School of North Carolina University (USA) and also at the Education Unit of Hospital General Universitario del Mar (Spain). The 10-item self-report questionnaire probed for information about practical experience with computers. A total of 126 students made up the sample. The majority were female (80.2%; n=101). The results showed that just over half (57.1%, n=72) of the students had used a computer game (three or more times before), and that only one third (37.3%, n=47) had the experience of using a word processing package. Moreover, other applications and IT-based facilities (e.g. statistical packages, e-mail, databases, CD-ROM searches, programming languages and computer-assisted learning) had never been used by the majority of students. The student nurses' practical experience was less than that reported for medical students in previous studies.

Calmness of the Feasible Set Mapping for Linear Inequality Systems

In this paper we deal with parameterized linear inequality systems in the n-dimensional Euclidean space, whose coefficients depend continuosly on an index ranging in a compact Hausdorff space. The paper is developed in two different parametric settings: the one of only right-hand-side perturbations of the linear system, and that in which both sides of the system can be perturbed. Appealing to the backgrounds on the calmness property, and exploiting the specifics of the current linear structure, we derive different characterizations of the calmness of the feasible set mapping, and provide an operative expresion for the calmness modulus when confined to finite systems. In the paper, the role played by the Abadie constraint qualification in relation to calmness is clarified, and illustrated by different examples. We point out that this approach has the virtue of tackling the calmness property exclusively in terms of the system’s data.

Enseñando a programar: un camino directo para desarrollar el pensamiento computacional

Está ampliamente aceptado que es fundamental desarrollar la habilidad de resolver problemas. El pensamiento computacional se basa en resolver problemas haciendo uso de conceptos fundamentales de la informática. Nada mejor para desarrollar la habilidad de resolver problemas usando conceptos informáticos que una asignatura de introducción a la programación. Este trabajo presenta nuestras reflexiones acerca de cómo iniciar a un estudiante en el campo de la programación de computadores. El trabajo no detalla los contenidos a impartir, sino que se centra en aspectos metodológicos, con la inclusión de experiencias y ejemplos concretos, a la vez que generales, extensibles a cualquier enseñanza de programación. En general, aunque se van desarrollado lenguajes cada vez más cercanos al lenguaje humano, la programación de ordenadores utilizando lenguajes formales no es una materia intuitiva y de fácil comprensión por parte de los estudiantes. A la persona que ya sabe programar le parece una tarea sencilla, pero al neófito no. Es más, dominar el arte de la programación es complejo. Por esta razón es indispensable utilizar todas las técnicas y herramientas posibles que faciliten dicha labor.

A Clearer Picture of Total Variation Blind Deconvolution

Blind deconvolution is the problem of recovering a sharp image and a blur kernel from a noisy blurry image. Recently, there has been a significant effort on understanding the basic mechanisms to solve blind deconvolution. While this effort resulted in the deployment of effective algorithms, the theoretical findings generated contrasting views on why these approaches worked. On the one hand, one could observe experimentally that alternating energy minimization algorithms converge to the desired solution. On the other hand, it has been shown that such alternating minimization algorithms should fail to converge and one should instead use a so-called Variational Bayes approach. To clarify this conundrum, recent work showed that a good image and blur prior is instead what makes a blind deconvolution algorithm work. Unfortunately, this analysis did not apply to algorithms based on total variation regularization. In this manuscript, we provide both analysis and experiments to get a clearer picture of blind deconvolution. Our analysis reveals the very reason why an algorithm based on total variation works. We also introduce an implementation of this algorithm and show that, in spite of its extreme simplicity, it is very robust and achieves a performance comparable to the top performing algorithms.

Optimization of the Modular Educational Program Structure

Optimized structure of the educational program consisting of a set of the interconnected educational objects is offered by means of problem solution of optimum partition of the acyclic weighed graph. The condition of acyclicity preservation for subgraphs is formulated and the quantitative assessment of decision options is executed. The original algorithm of search of quasioptimum partition using the genetic algorithm scheme with coding chromosomes by permutation is offered. Object-oriented realization of algorithm in language C++ is described and results of numerical experiments are presented.

UNIMATCH : a record linkage system : users manual /

Mode of access: Internet.

Tools for embedded computing systems software.

"Preprint for a workshop sponsored by NASA Langley Research Center, Hampton, Virginia, and the American Institute of Aeronautics and Astronautics, New York, and held in Hampton, Virginia, November 7-8, 1978."

An experiment on a unified control construct /

Bibliography: p. 34.

The automatic generation of Floyd production syntactic analyzers /

"September 9, 1969."

A semantic definition system (a preliminary description) /

Bibliography: p. 87.

A universal language for continuous network simulation /

Typescript.

An experiment on CAI sequencing constructs /

Includes bibliographical references.

The translator generator system,

"Supported in part by Contract AT (11-1)-1018 with the U.S. Atomic Energy Commission and the Advanced Research Projects Agency."