Elimination of variability sources in NIR spectra for the determination of fat content in olive fruits

Models for prediction of oil content as percentage of dried weight in olive fruits were comput- ed through PLS regression on NIR spectra. Spectral preprocessing was carried out by apply- ing multiplicative signal correction (MSC), Sa vitzky–Golay algorithm, standard normal variate correction (SNV), and detrending (D) to NIR spectra. MSC was the preprocessing technique showing the best performance. Further reduction of variability was performed by applying the Wold method of orthogonal signal correction (OSC). The calibration model achieved a R 2 of 0.93, a SEPc of 1.42, and a RPD of 3.8. The R 2 obtained with the validation set remained 0.93, and the SEPc was 1.41.

Interpretación geométrica de redes neuronales recurrentes discretas mediante grafos completos

El objetivo del presente trabajo de investigación es explorar nuevas técnicas de implementación, basadas en grafos, para las Redes de Neuronas, con el fin de simplificar y optimizar las arquitecturas y la complejidad computacional de las mismas. Hemos centrado nuestra atención en una clase de Red de Neuronas: las Redes de Neuronas Recursivas (RNR), también conocidas como redes de Hopfield. El problema de obtener la matriz sináptica asociada con una RNR imponiendo un determinado número de vectores como puntos fijos, no está en absoluto resuelto, el número de vectores prototipo que pueden ser almacenados en la red, cuando se utiliza la ley de Hebb, es bastante limitado, la red se satura rápidamente cuando se pretende almacenar nuevos prototipos. La ley de Hebb necesita, por tanto, ser revisada. Algunas aproximaciones dirigidas a solventar dicho problema, han sido ya desarrolladas. Nosotros hemos desarrollado una nueva aproximación en la forma de implementar una RNR en orden a solucionar estos problemas. La matriz sináptica es obtenida mediante la superposición de las componentes de los vectores prototipo, sobre los vértices de un Grafo, lo cual puede ser también interpretado como una coloración de dicho grafo. Cuando el periodo de entrenamiento se termina, la matriz de adyacencia del Grafo Resultante o matriz de pesos, presenta ciertas propiedades por las cuales dichas matrices serán llamadas tetraédricas. La energía asociada a cualquier estado de la red es representado por un punto (a,b) de R2. Cada uno de los puntos de energía asociados a estados que disten lo mismo del vector cero está localizado sobre la misma línea de energía de R2. El espacio de vectores de estado puede, por tanto, clasificarse en n clases correspondientes a cada una de las n diferentes distancias que puede tener cualquier vector al vector cero. La matriz (n x n) de pesos puede reducirse a un n-vector; de esta forma, tanto el tiempo de computación como el espacio de memoria requerido par almacenar los pesos, son simplificados y optimizados. En la etapa de recuperación, es introducido un vector de parámetros R2, éste es utilizado para controlar la capacidad de la red: probaremos que lo mayor es la componente a¡, lo menor es el número de puntos fijos pertenecientes a la línea de energía R¡. Una vez que la capacidad de la red ha sido controlada mediante este parámetro, introducimos otro parámetro, definido como la desviación del vector de pesos relativos, este parámetro sirve para disminuir ostensiblemente el número de parásitos. A lo largo de todo el trabajo, hemos ido desarrollando un ejemplo, el cual nos ha servido para ir corroborando los resultados teóricos, los algoritmos están escritos en un pseudocódigo, aunque a su vez han sido implamentados utilizando el paquete Mathematica 2.2., mostrándolos en un volumen suplementario al texto.---ABSTRACT---The aim of the present research is intended to explore new specifícation techniques of Neural Networks based on Graphs to be used in the optimization and simplification of Network Architectures and Computational Complexhy. We have focused our attention in a, well known, class of Neural Networks: the Recursive Neural Networks, also known as Hopfield's Neural Networks. The general problem of constructing the synaptic matrix associated with a Recursive Neural Network imposing some vectors as fixed points is fer for completery solved, the number of prototype vectors (learning patterns) which can be stored by Hebb's law is rather limited and the memory will thus quickly reach saturation if new prototypes are continuously acquired in the course of time. Hebb's law needs thus to be revised in order to allow new prototypes to be stored at the expense of the older ones. Some approaches related with this problem has been developed. We have developed a new approach of implementing a Recursive Neural Network in order to sob/e these kind of problems, the synaptic matrix is obtained superposing the components of the prototype vectors over the vértices of a Graph which may be interpreted as a coloring of the Graph. When training is finished the adjacency matrix of the Resulting Graph or matrix of weights presents certain properties for which it may be called a tetrahedral matrix The energy associated to any possible state of the net is represented as a point (a,b) in R2. Every one of the energy points associated with state-vectors having the same Hamming distance to the zero vector are located over the same energy Une in R2. The state-vector space may be then classified in n classes according to the n different possible distances firom any of the state-vectors to the zero vector The (n x n) matrix of weights may also be reduced to a n-vector of weights, in this way the computational time and the memory space required for obtaining the weights is optimized and simplified. In the recall stage, a parameter vectora is introduced, this parameter is used for controlling the capacity of the net: it may be proved that the bigger is the r, component of J, the lower is the number of fixed points located in the r¡ energy line. Once the capacity of the net has been controlled by the ex parameter, we introduced other parameter, obtained as the relative weight vector deviation parameter, in order to reduce the number of spurious states. All along the present text, we have also developed an example, which serves as a prove for the theoretical results, the algorithms are shown in a pseudocode language in the text, these algorithm so as the graphics have been developed also using the Mathematica 2.2. mathematical package which are shown in a supplementary volume of the text.

Considering cycling for commuting : the role of mode familiarity : an exploration on the (circular) relation between cycling behaviours and attitudes toward cycling in Vitoria-Gasteiz, Spain

¿La gente utiliza la bicicleta porque les gusta? ¿O es el propio hecho de usarla la razón por la que les gusta hacerlo? ¿O es una combinación de las dos? Este tipo de preguntas reflejan un problema que se puede llamar ‘el círculo de la consideración de la bicicleta’: para poder considerar el uso de la bicicleta en el conjunto de posibles opciones a escoger, un individuo tiene que tener creencias positivas sobre ella, sobre todo en el caso de ‘contextos de bajo uso’. Pero parece poco probable que se formen creencias positivas cuando hay bajos niveles de familiaridad al modo, es decir, con un bajo conocimiento de sus características, su funcionamiento y del imaginario asociado; al mismo tiempo, la familiaridad irá alcanzando niveles más altos conforme aumente el tiempo y la intensidad con la que se utilice la bicicleta a lo largo de la vida de los individuos. El problema parece un circulo recursivo huevo-gallina, ya que es difícil que alguien considere el usar la bicicleta en lugares donde su uso es una práctica poco extendida. En estos lugares, y dentro del conglomerado actual de tecnologías, infraestructuras, reglas, prácticas de los usuarios y preferencias culturales que se han desarrollado alrededor del automóvil (el actual "sistema socio-técnico de la movilidad urbana", Urry 2004; Geels 2005, 2012) usar la bicicleta es considerado por la mayoría como algo difícil, inseguro, y anormal. Como consecuencia, los procesos de aumento de familiaridad con la bicicleta permanecen inactivos. La tesis asume la familiaridad como una fuente de información e influencia sobre las creencias positivas sobre la bicicleta. En ‘contextos de bajo uso’, sin familiaridad al uso de la bicicleta, estas creencias sólo pueden surgir de ciertos rasgos personales (afecto, valores, identidades, voluntad, etc.). Tal como han evidenciado investigaciones recientes, en estos contextos la posibilidad de considerar el uso de la bicicleta (y su eventual adopción), se circunscribe principalmente a los ‘entusiastas’, a los que están dispuestos a “ir contra corriente” (Horton & Parkin 2012), limitando el alcance de las políticas de promoción. La investigación llevada a cabo en esta tesis ofrece un nuevo enfoque al problema del ‘círculo de la consideración de la bicicleta’. Para ello, plantea un modelo en el que se introduce a la familiaridad como un constructo que media entre el comportamiento final –qué modo de transporte elige el individuo– y el conjunto de constructos psicosociales que preceden la elección modal (creencias y actitudes). La familiaridad al uso de la bicicleta se concibe como una medida de la intensidad relativa del uso de una bicicleta, real y percibida (basándose en Diana & Mokhtarian 2009) que puede formarse de manera distinta según sus fines (utilitarios o no utilitarios). El constructo familiaridad con el modo bicicleta está relacionado con la cantidad de tiempo, la intensidad y la regularidad con la que un individuo ha hecho uso de la bicicleta a lo largo de su vida. La familiaridad se concibe así como una condición que permite definir adecuadamente el contexto en el que se toman las decisiones modales de los individuos, en línea con investigaciones que postulan patrones de causalidad alternativos entre los procesos cognitivos de elección y los comportamientos modales (Tardif 1977; Dobson et al. 1978; Golob et al. 1979; Golob 2001; Schwanen et al. 2012; Diana et al. 2009; Vij & Walker 2014). De este modo se plantea que el esquema unidireccional actitudesconductas podría no ser completamente valido en el caso de la consideración de la bicicleta, explorando la hipótesis que sean las propias conductas a influenciar la formación de las actitudes. En esta tesis, el constructo de familiaridad se articula teórica y metodológicamente, y se emplea un instrumento de diseño transversal para contrastarlo. Los resultados de una encuesta telefónica a una muestra representativa de 736 personas en la ciudad española de Vitoria-Gasteiz proveen evidencias que sugieren –aunque de forma preliminar– que la familiaridad juega un papel de mediadora en la relación entre la utilización de la bicicleta y la formación de las creencias y actitudes hacia el su uso. La tesis emplea mediciones para cada individuo con respecto tanto a su consideración como a su familiaridad al uso de la bicicleta. Éstas mediciones se definen haciendo uso del análisis factorial exploratorio (AFE). Por un lado, el AFE arroja una estructura del constructo ‘consideración’ formada por cuatro factores, tres de ellos asociados con elementos positivos y uno con elementos negativos: (1) de cómo el uso de la bicicleta se considera verde e inteligente (G&S); (2) sobre su carácter agradable y adecuado (P&S); (3) sobre su eficacia como modo de transporte para ir al trabajo (E); y (4) sobre los principales inconvenientes de su uso, es decir, las dificultades implícitas (sudoración y estar expuestos a las inclemencias del tiempo) y la sensación de inseguridad que genera (sentirse en riesgo de accidentes y estresarse por el tráfico) (D&T). Por otro lado, la familiaridad al uso de la bicicleta se mide en dos distintas variables ordinales (según se base en el uso utilitario o no utilitario). Como resultado, se puede hablar de que cada individuo se encuentra en una de las siguientes cuatro etapas en orden creciente hacia una familiaridad completa al modo: no familiarizados; apenas familiarizados; moderadamente familiarizados; totalmente familiarizados. El análisis de los datos de los cuatro grupos de sujetos de la muestra, –definidos de acuerdo con cada una de las cuatro etapas de familiaridad definidas– ha evidenciado la existencia de diferencias intergrupo estadísticamente significativas, especialmente para la medida relacionada con el uso utilitario. Asimismo, las personas en los niveles inferiores de familiaridad tienen una consideración menor de los aspectos positivos de la bicicleta y por el contrario presentan preocupaciones mayores hacia las características negativas respecto a aquellas personas que están más familiarizados en el uso utilitario. El uso, aunque esporádico, de una bicicleta para fines utilitarios (ir de compras, hacer recados, etc.), a diferencia de no usarla en absoluto, aparece asociado a unas puntuaciones significativamente más altas en los tres factores positivos (G&S, E, P&S), mientras que parece estar asociado a puntuaciones significativamente más bajas en el factor relacionado con las características negativas (D&U). Aparecen resultados similares cuando se compara un uso moderado, con uno esporádico, sobre todo con respecto a la consideración de las características negativas. Los resultados de esta tesis están en línea con la literatura anterior que se ha basado en variables similares (por ejemplo, de Geus et al. 2008; Stinson & Bhat 2003, 2004; Hunt & Abraham 2006; y van Bekkum et al. 2011a, entre otros), pero en este estudio las diferencias se observan en un contexto de bajo uso y se derivan de un análisis de toda la población de personas que se desplazan a su lugar de trabajo o estudio, lo cual eleva la fiabilidad de los resultados. La posibilidad de que unos niveles más altos de uso de la bicicleta para fines utilitarios puedan llevar a niveles más positivos de su consideración abre el camino a implicaciones teóricas y de políticas que se discuten en la tesis. Con estos resultados se argumenta que el enfoque convencional basado en el cambio de actitudes puede no ser el único y prioritario para lograr cambios a la hora de fomentar el uso de la bicicleta. Los resultados apuntan al potencial de otros esquemas de causalidad, basados en patrones de influencia más descentrados y distribuidos, y que adopten una mirada más positiva hacia los hábitos de transporte, conceptualizándolos como “inteligencia encarnada y pre-reflexiva” (Schwanen et al. 2012). Tales esquemas conducen a un enfoque más práctico para la promoción del uso de la bicicleta, con estrategias que podrían basarse en acciones de ‘degustación’ de su uso o de mayor ‘exposición’ a su uso. Is the fact that people like cycling the reason for them to cycle? Or is the fact that they do cycle the reason for them to like cycling? Or is a combination of the two? This kind of questions reflect a problem that can be called ‘the cycle of cycling consideration’: in order to consider cycling in the set of possible options to be chosen, an individual needs to have positive beliefs about it, especially in the case of ‘low-cycling contexts’. However, positive beliefs seem unlikely to be formed with low levels of mode familiarity, say, with a low acquaintance with mode features, functioning and images; at the same time, higher levels of familiarity are likely to be reached if cycling is practised over relative threshold levels of intensities and extensively across individual life courses. The problem looks like a chicken-egg recursive cycle, since the latter condition is hardly met in places where cycling is little practised. In fact, inside the current conglomerate of technologies, infrastructures, regulations, user practices, cultural preferences that have grown around the automobile (the current “socio-technical system of urban mobility”, Urry 2004; Geels 2005, 2012) cycling is commonly considered as difficult, unsafe, and abnormal. Consequently, the processes of familiarity forming remain disabled, and, as a result, beliefs cannot rely on mode familiarity as a source of information and influence. Without cycling familiarity, origins of positive beliefs are supposed to rely only on personal traits (affect, values, identities, willingness, etc.), which, in low-cycling contexts, confine the possibility of cycling consideration (and eventual adoption) mainly to ‘cycling enthusiasts’ who are willing to “go against the grain” (Horton & Parkin 2012), as it results from previous research. New research conducted by author provides theoretical insights for a different approach of the cycling consideration problem in which the presence of the new construct of cycling familiarity is hypothesised in the relationship between mode choice behaviour and the set of psychosocial constructs that are supposed to precede it (beliefs and attitudes). Cycling familiarity is conceived as a measure of the real and the perceived relative intensity of use of a bicycle (building upon Diana & Mokhtarian 2009) which may be differently formed for utilitarian or non-utilitarian purposes. The construct is assumed to be related to the amount of time, the intensity and the regularity an individual spends in using a bicycle for the two distinct categories of purposes, gaining in this way a certain level of acquaintance with the mode. Familiarity with a mode of transport is conceived as an enabling condition to properly define the decision-making context in which individual travel mode choices are taken, in line with rather disperse research efforts postulating inverse relationships between mode behaviours and mode choices (Tardiff 1977; Dobson et al. 1978; Golob et al. 1979; Golob 2001; Schwanen et al. 2012; Diana et al. 2009; Vij & Walker 2014). The new construct is built theoretically and methodologically, and a cross-sectional design instrument is employed. Results from a telephone survey in a representative sample of 736 commuters in the Spanish city of Vitoria-Gasteiz, provide suggestive –although preliminary– evidence on the role of mode familiarity as a mediator in the relationship between cycling use and the formation of beliefs and attitudes toward cycling. Measures of both cycling consideration and cycling familiarity are defined making use of exploratory factor analysis. On the one hand, four distinct cycling consideration measures are created, based on attitude expressions on four underlying factors relating to the cycling commuting behaviour: on how cycling commuting is considered green and smart (G&S); on its pleasant and suited character (P&S); on its efficiency as a mode of transport for commuting (E); and on the main drawbacks of its use, namely the difficulties implied (sweating and being exposed to adverse weather conditions) and the sense of unsafety it generates (feeling at risk of accidents and getting stressed by traffic) (D&U). On the other hand, dimensions of cycling familiarity are measured on two distinct ordinal variables (whether based on the utilitarian or non-utilitarian use) comprising four stages to a complete mode familiarity: not familiar; barely familiar; moderately familiar; fully familiar. For each of the four stages of cycling familiarity defined, statistical significant differences are found, especially for the measure related to the utilitarian use. Consistently, people at the lower levels of cycling familiarity have a lower consideration of the positive aspects of cycling and conversely they exhibit higher concerns towards the negative characteristics than those individuals that are more familiar in utilitarian cycling. Using a bicycle occasionally for practical purposes, as opposed to not using it at all, seems associated to significant higher scores in the three positive factors (G&S, E, P&S) while it appears to be associated to significant lower scores in the factor relating with the negative characteristics of cycling commuting (D&U). A same pattern also occurs with a moderate use, as opposed to an occasional one, especially for the consideration of the negative characteristics. The results are in line with previous literature based on similar variables (e.g. de Geus et al. 2008; Stinson & Bhat 2003, 2004; Hunt & Abraham 2006; and van Bekkum et al. 2011a, among others), but in this study the differences are observed in a low-cycling context and derive from an analysis of the entire population of commuters, which rises the reliability of results.

Aportación al análisis de espectros de radiación: estructuras y algoritmos

A lo largo del presente trabajo se investiga la viabilidad de la descomposición automática de espectros de radiación gamma por medio de algoritmos de resolución de sistemas de ecuaciones algebraicas lineales basados en técnicas de pseudoinversión. La determinación de dichos algoritmos ha sido realizada teniendo en cuenta su posible implementación sobre procesadores de propósito específico de baja complejidad. En el primer capítulo se resumen las técnicas para la detección y medida de la radiación gamma que han servido de base para la confección de los espectros tratados en el trabajo. Se reexaminan los conceptos asociados con la naturaleza de la radiación electromagnética, así como los procesos físicos y el tratamiento electrónico que se hallan involucrados en su detección, poniendo de relieve la naturaleza intrínsecamente estadística del proceso de formación del espectro asociado como una clasificación del número de detecciones realizadas en función de la energía supuestamente continua asociada a las mismas. Para ello se aporta una breve descripción de los principales fenómenos de interacción de la radiación con la materia, que condicionan el proceso de detección y formación del espectro. El detector de radiación es considerado el elemento crítico del sistema de medida, puesto que condiciona fuertemente el proceso de detección. Por ello se examinan los principales tipos de detectores, con especial hincapié en los detectores de tipo semiconductor, ya que son los más utilizados en la actualidad. Finalmente, se describen los subsistemas electrónicos fundamentales para el acondicionamiento y pretratamiento de la señal procedente del detector, a la que se le denomina con el término tradicionalmente utilizado de Electrónica Nuclear. En lo que concierne a la espectroscopia, el principal subsistema de interés para el presente trabajo es el analizador multicanal, el cual lleva a cabo el tratamiento cualitativo de la señal, y construye un histograma de intensidad de radiación en el margen de energías al que el detector es sensible. Este vector N-dimensional es lo que generalmente se conoce con el nombre de espectro de radiación. Los distintos radionúclidos que participan en una fuente de radiación no pura dejan su impronta en dicho espectro. En el capítulo segundo se realiza una revisión exhaustiva de los métodos matemáticos en uso hasta el momento ideados para la identificación de los radionúclidos presentes en un espectro compuesto, así como para determinar sus actividades relativas. Uno de ellos es el denominado de regresión lineal múltiple, que se propone como la aproximación más apropiada a los condicionamientos y restricciones del problema: capacidad para tratar con espectros de baja resolución, ausencia del concurso de un operador humano (no supervisión), y posibilidad de ser soportado por algoritmos de baja complejidad capaces de ser instrumentados sobre procesadores dedicados de alta escala de integración. El problema del análisis se plantea formalmente en el tercer capítulo siguiendo las pautas arriba mencionadas y se demuestra que el citado problema admite una solución en la teoría de memorias asociativas lineales. Un operador basado en este tipo de estructuras puede proporcionar la solución al problema de la descomposición espectral deseada. En el mismo contexto, se proponen un par de algoritmos adaptativos complementarios para la construcción del operador, que gozan de unas características aritméticas especialmente apropiadas para su instrumentación sobre procesadores de alta escala de integración. La característica de adaptatividad dota a la memoria asociativa de una gran flexibilidad en lo que se refiere a la incorporación de nueva información en forma progresiva.En el capítulo cuarto se trata con un nuevo problema añadido, de índole altamente compleja. Es el del tratamiento de las deformaciones que introducen en el espectro las derivas instrumentales presentes en el dispositivo detector y en la electrónica de preacondicionamiento. Estas deformaciones invalidan el modelo de regresión lineal utilizado para describir el espectro problema. Se deriva entonces un modelo que incluya las citadas deformaciones como una ampliación de contribuciones en el espectro compuesto, el cual conlleva una ampliación sencilla de la memoria asociativa capaz de tolerar las derivas en la mezcla problema y de llevar a cabo un análisis robusto de contribuciones. El método de ampliación utilizado se basa en la suposición de pequeñas perturbaciones. La práctica en el laboratorio demuestra que, en ocasiones, las derivas instrumentales pueden provocar distorsiones severas en el espectro que no pueden ser tratadas por el modelo anterior. Por ello, en el capítulo quinto se plantea el problema de medidas afectadas por fuertes derivas desde el punto de vista de la teoría de optimización no lineal. Esta reformulación lleva a la introducción de un algoritmo de tipo recursivo inspirado en el de Gauss-Newton que permite introducir el concepto de memoria lineal realimentada. Este operador ofrece una capacidad sensiblemente mejorada para la descomposición de mezclas con fuerte deriva sin la excesiva carga computacional que presentan los algoritmos clásicos de optimización no lineal. El trabajo finaliza con una discusión de los resultados obtenidos en los tres principales niveles de estudio abordados, que se ofrecen en los capítulos tercero, cuarto y quinto, así como con la elevación a definitivas de las principales conclusiones derivadas del estudio y con el desglose de las posibles líneas de continuación del presente trabajo.---ABSTRACT---Through the present research, the feasibility of Automatic Gamma-Radiation Spectral Decomposition by Linear Algebraic Equation-Solving Algorithms using Pseudo-Inverse Techniques is explored. The design of the before mentioned algorithms has been done having into account their possible implementation on Specific-Purpose Processors of Low Complexity. In the first chapter, the techniques for the detection and measurement of gamma radiation employed to construct the spectra being used throughout the research are reviewed. Similarly, the basic concepts related with the nature and properties of the hard electromagnetic radiation are also re-examined, together with the physic and electronic processes involved in the detection of such kind of radiation, with special emphasis in the intrinsic statistical nature of the spectrum build-up process, which is considered as a classification of the number of individual photon-detections as a function of the energy associated to each individual photon. Fbr such, a brief description of the most important matter-energy interaction phenomena conditioning the detection and spectrum formation processes is given. The radiation detector is considered as the most critical element in the measurement system, as this device strongly conditions the detection process. Fbr this reason, the characteristics of the most frequent detectors are re-examined, with special emphasis on those of semiconductor nature, as these are the most frequently employed ones nowadays. Finally, the fundamental electronic subsystems for preaconditioning and treating of the signal delivered by the detector, classically addresed as Nuclear Electronics, is described. As far as Spectroscopy is concerned, the subsystem most interesting for the scope covered by the present research is the so-called Multichannel Analyzer, which is devoted to the cualitative treatment of the signal, building-up a hystogram of radiation intensity in the range of energies in which the detector is sensitive. The resulting N-dimensional vector is generally known with the ñame of Radiation Spectrum. The different radio-nuclides contributing to the spectrum of a composite source will leave their fingerprint in the resulting spectrum. Through the second chapter, an exhaustive review of the mathematical methods devised to the present moment to identify the radio-nuclides present in the composite spectrum and to quantify their relative contributions, is reviewed. One of the more popular ones is the so-known Múltiple Linear Regression, which is proposed as the best suited approach according to the constraints and restrictions present in the formulation of the problem, i.e., the need to treat low-resolution spectra, the absence of control by a human operator (un-supervision), and the possibility of being implemented as low-complexity algorithms amenable of being supported by VLSI Specific Processors. The analysis problem is formally stated through the third chapter, following the hints established in this context, and it is shown that the addressed problem may be satisfactorily solved under the point of view of Linear Associative Memories. An operator based on this kind of structures may provide the solution to the spectral decomposition problem posed. In the same context, a pair of complementary adaptive algorithms useful for the construction of the solving operator are proposed, which share certain special arithmetic characteristics that render them specially suitable for their implementation on VLSI Processors. The adaptive nature of the associative memory provides a high flexibility to this operator, in what refers to the progressive inclusión of new information to the knowledge base. Through the fourth chapter, this fact is treated together with a new problem to be considered, of a high interest but quite complex nature, as is the treatment of the deformations appearing in the spectrum when instrumental drifts in both the detecting device and the pre-acconditioning electronics are to be taken into account. These deformations render the Linear Regression Model proposed almost unuseful to describe the resulting spectrum. A new model including the drifts is derived as an extensión of the individual contributions to the composite spectrum, which implies a simple extensión of the Associative Memory, which renders this suitable to accept the drifts in the composite spectrum, thus producing a robust analysis of contributions. The extensión method is based on the Low-Amplitude Perturbation Hypothesis. Experimental practice shows that in certain cases the instrumental drifts may provoke severe distortions in the resulting spectrum, which can not be treated with the before-mentioned hypothesis. To cover also these less-frequent cases, through the fifth chapter, the problem involving strong drifts is treated under the point of view of Non-Linear Optimization Techniques. This reformulation carries the study to the consideration of recursive algorithms based on the Gauss-Newton methods, which allow the introduction of Feed-Back Memories, computing elements with a sensibly improved capability to decompose spectra affected by strong drifts. The research concludes with a discussion of the results obtained in the three main levéis of study considerad, which are presented in chapters third, fourth and fifth, toghether with the review of the main conclusions derived from the study and the outline of the main research lines opened by the present work.

Simulación eficiente de mecanismos flexibles mediante formulaciones topológicas

El objetivo de esta Tesis es presentar un método eficiente para la evaluación de sistemas multi-cuerpo con elementos flexibles con pequeñas deformaciones, basado en métodos topológicos para la simulación de sistemas tan complejos como los que se utilizan en la práctica y en tiempo real o próximo al real. Se ha puesto un especial énfasis en la resolución eficiente de aquellos aspectos que conllevan mayor coste computacional, tales como la evaluación de las ecuaciones dinámicas y el cálculo de los términos de inercia. Las ecuaciones dinámicas se establecen en función de las variables independientes del sistema, y la integración de las mismas se realiza mediante formulaciones implícitas de index-3. Esta Tesis se articula en seis Capítulos. En el Capítulo 1 se realiza una revisión bibliográfica de la simulación de sistemas flexibles y los métodos más relevantes de integración de las ecuaciones diferenciales del movimiento. Asimismo, se presentan los objetivos de esta Tesis. En el Capítulo 2 se presenta un método semi-recursivo para la evaluación de las ecuaciones de los sistemas multi-cuerpo con elementos flexibles basado en formulaciones topológicas y síntesis modal. Esta Tesis determina la posición de cada punto del cuerpo flexible en función de un sistema de referencia flotante que se mueve con dicho cuerpo y de las amplitudes de ciertos modos de deformación calculados a partir de un mallado obtenido mediante el Método de Elementos Finitos. Se presta especial atención en las condiciones de contorno que se han de tener en cuenta a la hora de establecer las variables que definen la deformación del cuerpo flexible. El Capítulo 3 se centra en la evaluación de los términos de inercia de los sistemas flexibles que generalmente conllevan un alto coste computacional. Se presenta un método que permite el cálculo de dichos términos basado en el uso de 24 matrices constantes que pueden ser calculadas previamente al proceso de integración. Estas matrices permiten evaluar la matriz de masas y el vector de fuerzas de inercia dependientes de la velocidad sin que sea necesario evaluar la posición deformada de todos los puntos del cuerpo flexible. Se realiza un análisis pormenorizado de dichas matrices con el objetivo de optimizar su cálculo estableciendo aproximaciones que permitan reducir el número de dichos términos y optimizar aún más su evaluación. Se analizan dos posibles simplificaciones: la primera utiliza una discretización no-consistente basada en elementos finitos en los que se definen únicamente los desplazamientos axiales de los nodos; en la segunda propuesta se hace uso de una matriz de masas concentradas (Lumped Mass). Basándose en la formulación presentada, el Capítulo 4 aborda la integración eficiente de las ecuaciones dinámicas. Se presenta un método iterativo para la integración con fórmulas de index-3 basado en la proyección de las ecuaciones dinámicas según las variables independientes del sistema multi-cuerpo. El cálculo del residuo del sistema de ecuaciones no lineales que se ha de resolver de modo iterativo se realiza mediante un proceso recursivo muy eficiente que aprovecha la estructura topológica del sistema. Se analizan tres formas de evaluar la matriz tangente del citado sistema no lineal: evaluación aproximada, numérica y recursiva. El método de integración presentado permite el uso de distintas fórmulas. En esta Tesis se analizan la Regla Trapezoidal, la fórmula BDF de segundo orden y un método híbrido TR-BDF2. Para este último caso se presenta un algoritmo de paso variable. En el Capítulo 5 plantea la implementación del método propuesto en un programa general de simulación de mecanismos que permita la resolución de cualquier sistema multi-cuerpo definiéndolo mediante un fichero de datos. La implementación de este programa se ha realizado tanto en C++ como en Java. Se muestran los resultados de las formulaciones presentadas en esta Tesis mediante la simulación de cuatro ejemplos de distinta complejidad. Mediante análisis concretos se comparan la formulación presentada con otras existentes. También se analiza el efecto del lenguaje de programación utilizado en la implementación y los efectos de las posibles simplificaciones planteadas. Por último, el Capítulo 6 resume las principales conclusiones alcanzadas en la Tesis y las futuras líneas de investigación que con ella se abren. ABSTRACT This Thesis presents an efficient method for solving the forward dynamics of a multi-body sys-tem formed by rigid and flexible bodies with small strains for real-time simulation of real-life models. It is based on topological formulations. The presented work focuses on the efficient solution of the most time-consuming tasks of the simulation process, such as the numerical integration of the motion differential equations and in particular the evaluation of the inertia terms corresponding to the flexible bodies. The dynamic equations are formulated in terms of independent variables of the muti-body system, and they are integrated by means of implicit index-3 formulae. The Thesis is arranged in six chapters. Chapter 1 presents a review of the most relevant and recent contributions related to the modelization of flexible multi-body systems and the integration of the corresponding dynamic equations. The main objectives of the Thesis are also presented in detail. Chapter 2 presents a semi-recursive method for solving the equations of a multi-body system with flexible bodies based on topological formulations and modal synthesis. This Thesis uses the floating frame approach and the modal amplitudes to define the position of any point at the flexible body. These modal deformed shapes are obtained by means of the Finite Element Method. Particular attention has been taken to the boundary conditions used to define the deformation of the flexible bodies. Chapter 3 focuses on the evaluation of the inertia terms, which is usually a very time-consuming task. A new method based on the use of 24 constant matrices is presented. These matrices are evaluated during the set-up step, before the integration process. They allow the calculation of the inertia terms in terms of the position and orientation of the local coordinate system and the deformation variables, and there is no need to evaluate the position and velocities of all the nodes of the FEM mesh. A deep analysis of the inertia terms is performed in order to optimize the evaluation process, reducing both the terms used and the number of arithmetic operations. Two possible simplifications are presented: the first one uses a non-consistent approach in order to define the inertia terms respect to the Cartesian coordinates of the FEM mesh, rejecting those corresponding to the angular rotations; the second approach makes use of lumped mass matrices. Based on the previously presented formulation, Chapter 4 is focused on the numerical integration of the motion differential equations. A new predictor-corrector method based on index-3 formulae and on the use of multi-body independent variables is presented. The evaluation of the dynamic equations in a new time step needs the solution of a set on nonlinear equations by a Newton-Raphson iterative process. The computation of the corresponding residual vector is performed efficiently by taking advantage of the system’s topological structure. Three methods to compute the tangent matrix are presented: an approximated evaluation that considers only the most relevant terms, a numerical approach based on finite differences and a recursive method that uses the topological structure. The method presented for integrating the dynamic equations can use a variety of integration formulae. This Thesis analyses the use of the trapezoidal rule, the 2nd order BDF formula and the hybrid TR-BDF2 method. A variable-time step strategy is presented for the last one. Chapter 5 describes the implementation of the proposed method in a general purpose pro-gram for solving any multibody defined by a data file. This program is implemented both in C++ and Java. Four examples are used to check the validity of the formulation and to compare this method with other methods commonly used to solve the dynamic equations of multi-body systems containing flexible bodies. The efficiency of the programming methodology used and the effect of the possible simplifications proposed are also analyzed. Chapter 6 summarizes the main Conclusions obtained in this Thesis and the new lines of research that have been opened.

Engineering Computational Emotion - A Reference Model for Emotion in Artificial Systems

Emotion is generally argued to be an influence on the behavior of life systems, largely concerning flexibility and adaptivity. The way in which life systems acts in response to a particular situations of the environment, has revealed the decisive and crucial importance of this feature in the success of behaviors. And this source of inspiration has influenced the way of thinking artificial systems. During the last decades, artificial systems have undergone such an evolution that each day more are integrated in our daily life. They have become greater in complexity, and the subsequent effects are related to an increased demand of systems that ensure resilience, robustness, availability, security or safety among others. All of them questions that raise quite a fundamental challenges in control design. This thesis has been developed under the framework of the Autonomous System project, a.k.a the ASys-Project. Short-term objectives of immediate application are focused on to design improved systems, and the approaching of intelligence in control strategies. Besides this, long-term objectives underlying ASys-Project concentrate on high order capabilities such as cognition, awareness and autonomy. This thesis is placed within the general fields of Engineery and Emotion science, and provides a theoretical foundation for engineering and designing computational emotion for artificial systems. The starting question that has grounded this thesis aims the problem of emotion--based autonomy. And how to feedback systems with valuable meaning has conformed the general objective. Both the starting question and the general objective, have underlaid the study of emotion, the influence on systems behavior, the key foundations that justify this feature in life systems, how emotion is integrated within the normal operation, and how this entire problem of emotion can be explained in artificial systems. By assuming essential differences concerning structure, purpose and operation between life and artificial systems, the essential motivation has been the exploration of what emotion solves in nature to afterwards analyze analogies for man--made systems. This work provides a reference model in which a collection of entities, relationships, models, functions and informational artifacts, are all interacting to provide the system with non-explicit knowledge under the form of emotion-like relevances. This solution aims to provide a reference model under which to design solutions for emotional operation, but related to the real needs of artificial systems. The proposal consists of a multi-purpose architecture that implement two broad modules in order to attend: (a) the range of processes related to the environment affectation, and (b) the range or processes related to the emotion perception-like and the higher levels of reasoning. This has required an intense and critical analysis beyond the state of the art around the most relevant theories of emotion and technical systems, in order to obtain the required support for those foundations that sustain each model. The problem has been interpreted and is described on the basis of AGSys, an agent assumed with the minimum rationality as to provide the capability to perform emotional assessment. AGSys is a conceptualization of a Model-based Cognitive agent that embodies an inner agent ESys, the responsible of performing the emotional operation inside of AGSys. The solution consists of multiple computational modules working federated, and aimed at conforming a mutual feedback loop between AGSys and ESys. Throughout this solution, the environment and the effects that might influence over the system are described as different problems. While AGSys operates as a common system within the external environment, ESys is designed to operate within a conceptualized inner environment. And this inner environment is built on the basis of those relevances that might occur inside of AGSys in the interaction with the external environment. This allows for a high-quality separate reasoning concerning mission goals defined in AGSys, and emotional goals defined in ESys. This way, it is provided a possible path for high-level reasoning under the influence of goals congruence. High-level reasoning model uses knowledge about emotional goals stability, letting this way new directions in which mission goals might be assessed under the situational state of this stability. This high-level reasoning is grounded by the work of MEP, a model of emotion perception that is thought as an analogy of a well-known theory in emotion science. The work of this model is described under the operation of a recursive-like process labeled as R-Loop, together with a system of emotional goals that are assumed as individual agents. This way, AGSys integrates knowledge that concerns the relation between a perceived object, and the effect which this perception induces on the situational state of the emotional goals. This knowledge enables a high-order system of information that provides the sustain for a high-level reasoning. The extent to which this reasoning might be approached is just delineated and assumed as future work. This thesis has been studied beyond a long range of fields of knowledge. This knowledge can be structured into two main objectives: (a) the fields of psychology, cognitive science, neurology and biological sciences in order to obtain understanding concerning the problem of the emotional phenomena, and (b) a large amount of computer science branches such as Autonomic Computing (AC), Self-adaptive software, Self-X systems, Model Integrated Computing (MIC) or the paradigm of models@runtime among others, in order to obtain knowledge about tools for designing each part of the solution. The final approach has been mainly performed on the basis of the entire acquired knowledge, and described under the fields of Artificial Intelligence, Model-Based Systems (MBS), and additional mathematical formalizations to provide punctual understanding in those cases that it has been required. This approach describes a reference model to feedback systems with valuable meaning, allowing for reasoning with regard to (a) the relationship between the environment and the relevance of the effects on the system, and (b) dynamical evaluations concerning the inner situational state of the system as a result of those effects. And this reasoning provides a framework of distinguishable states of AGSys derived from its own circumstances, that can be assumed as artificial emotion.

Optimization of water procurement decisions in an irrigation district: the role of option contracts

Water supply instability is one of the main risks faced by irrigation districts and farmers. Water procurement decision optimisation is essential in order to increase supply reliability and reduce costs. Water markets, such as spot purchases or water supply option contracts, can make this decision process more flexible. We analyse the potential interest in an option contract for an irrigation district that has access to several water sources. We apply a stochastic recursive mathematical programming model to simulate the water procurement decisions of an irrigation district?s board operating in a context of water supply uncertainty in south-eastern Spain. We analyse what role different option contracts could play in securing its water supply. Results suggest that the irrigation district would be willing to accept the proposed option contract in most cases subject to realistic values of the option contract financial terms. Of nine different water sources, desalination and the option contract are the main substitutes, where the use of either depends on the contract parameters. The contract premium and optioned volume are the variables that have a greater impact on the irrigation district?s decisions. Key words: Segura Basin, stochastic recursive programming, water markets, water supply option contract, water supply risk.

Transgenic cattle produced by reverse-transcribed gene transfer in oocytes

A critical requirement for integration of retroviruses, other than HIV and possibly related lentiviruses, is the breakdown of the nuclear envelope during mitosis. Nuclear envelope breakdown occurs during mitotic M-phase, the envelope reforming immediately after cell division, thereby permitting the translocation of the retroviral preintegration complex into the nucleus and enabling integration to proceed. In the oocyte, during metaphase II (MII) of the second meiosis, the nuclear envelope is also absent and the oocyte remains in MII arrest for a much longer period of time compared with M-phase in a somatic cell. Pseudotyped replication-defective retroviral vector was injected into the perivitelline space of bovine oocytes during MII. We show that reverse-transcribed gene transfer can take place in an oocyte in MII arrest of meiosis, leading to production of offspring, the majority of which are transgenic. We discuss the implications of this mechanism both as a means of production of transgenic livestock and as a model for naturally occurring recursive transgenesis.

“Coarse” stability and bifurcation analysis using time-steppers: A reaction-diffusion example

Evolutionary, pattern forming partial differential equations (PDEs) are often derived as limiting descriptions of microscopic, kinetic theory-based models of molecular processes (e.g., reaction and diffusion). The PDE dynamic behavior can be probed through direct simulation (time integration) or, more systematically, through stability/bifurcation calculations; time-stepper-based approaches, like the Recursive Projection Method [Shroff, G. M. & Keller, H. B. (1993) SIAM J. Numer. Anal. 30, 1099–1120] provide an attractive framework for the latter. We demonstrate an adaptation of this approach that allows for a direct, effective (“coarse”) bifurcation analysis of microscopic, kinetic-based models; this is illustrated through a comparative study of the FitzHugh-Nagumo PDE and of a corresponding Lattice–Boltzmann model.

Liquid-phase combinatorial synthesis.

A concept termed liquid-phase combinatorial synthesis (LPCS) is described. The central feature of this methodology is that it combines the advantages that classic organic synthesis in solution offers with those that solid-phase synthesis can provide, through the application of a linear homogeneous polymer. To validate this concept two libraries were prepared, one of peptide and the second of nonpeptide origin. The peptide-based library was synthesized by a recursive deconvolution strategy [Erb, E., Janda, K. D. & Brenner, S. (1994) Proc. Natl. Acad. Sci. USA 91, 11422-11426] and several ligands were found within this library to bind a monoclonal antibody elicited against beta-endorphin. The non-peptide molecules synthesized were arylsulfonamides, a class of compounds of known clinical bactericidal efficacy. The results indicate that the reaction scope of LPCS should be general, and its value to multiple, high-throughput screening assays could be of particular merit, since multimilligram quantities of each library member can readily be attained.

Types of Listeria monocytogenes predicted by the positions of EcoRI cleavage sites relative to ribosomal RNA sequences.

By using taxonomic characters derived from EcoRI restriction endonuclease digestion of genomic DNA and hybridization with a labeled rRNA operon from Escherichia coli, a polymorphic structure of Listeria monocytogenes, characterized by fragments with different frequencies of occurrence, was observed. This structure was expanded by creating predicted patterns through a recursive process of observation, expectation, prediction, and assessment of completeness. This process was applied, in turn, to normalized strain patterns, fragment bands, and positions of EcoRI recognition sites relative to rRNA regions. Analysis of 1346 strains provided observed patterns, fragment sizes, and their frequencies of occurrence in the patterns. Fragment size statistics led to the creation of unobserved combinations of bands, predicted pattern types. The observed fragment bands revealed positions of EcoRI sites relative to rRNA sequences. Each EcoRI site had a frequency of occurrence, and unobserved fragment sizes were postulated on the basis of knowing the restriction site locations. The result of the recursion process applied to the components of the strain data was an extended classification with observed and predicted members.

Algoritmos recursivos e não-recursivos aplicados à estimação fasorial em sistemas elétricos de potência

Este trabalho apresenta uma análise de algoritmos computacionais aplicados à estimação de fasores elétricos em SEPs. A medição dos fasores é realizada por meio da alocação de Unidades de Medição Fasorial nestes sistemas e encontra diversas aplicações nas áreas de operação, controle, proteção e planejamento. Para que os fasores possam ser aplicados, são definidos padrões de medição, sincronização e comunicação, por meio da norma IEEE C37.118.1. A norma apresenta os padrões de mensagens, timetag, fasores, sistema de sincronização, e define testes para avaliar a estimação. Apesar de abranger todos esses critérios, a diretriz não define um algoritmo de estimação padrão, abrindo espaço para uso de diversos métodos, desde que a precisão seja atendida. Nesse contexto, o presente trabalho analisa alguns algoritmos de estimação de fasores definidos na literatura, avaliando o comportamento deles em determinados casos. Foram considerados, dessa forma, os métodos: Transformada Discreta de Fourier, Método dos Mínimos Quadrados e Transformada Wavelet Discreta, nas versões recursivas e não-recursivas. Esses métodos foram submetidos a sinais sintéticos, a fim de verificar o comportamento diante dos testes propostos pela norma, avaliando o Total Vector Error, tempo de resposta e atraso e overshoot. Os algoritmos também foram embarcados em um hardware, denominado PC104, e avaliados de acordo com os sinais medidos pelo equipamento na saída analógica de um simulador em tempo real (Real Time Digital Simulator).

A contribution on modeling methodologies for multibody systems.

Multibody System Dynamics has been responsible for revolutionizing Mechanical Engineering Design by using mathematical models to simulate and optimize the dynamic behavior of a wide range of mechanical systems. These mathematical models not only can provide valuable informations about a system that could otherwise be obtained only by experiments with prototypes, but also have been responsible for the development of many model-based control systems. This work represents a contribution for dynamic modeling of multibody mechanical systems by developing a novel recursive modular methodology that unifies the main contributions of several Classical Mechanics formalisms. The reason for proposing such a methodology is to motivate the implementation of computational routines for modeling complex multibody mechanical systems without being dependent on closed source software and, consequently, to contribute for the teaching of Multibody System Dynamics in undergraduate and graduate levels. All the theoretical developments are based on and motivated by a critical literature review, leading to a general matrix form of the dynamic equations of motion of a multibody mechanical system (that can be expressed in terms of any set of variables adopted for the description of motions performed by the system, even if such a set includes redundant variables) and to a general recursive methodology for obtaining mathematical models of complex systems given a set of equations describing the dynamics of each of its uncoupled subsystems and another set describing the constraints among these subsystems in the assembled system. This work also includes some discussions on the description of motion (using any possible set of motion variables and admitting any kind of constraint that can be expressed by an invariant), and on the conditions for solving forward and inverse dynamics problems given a mathematical model of a multibody system. Finally, some examples of computational packages based on the novel methodology, along with some case studies, are presented, highlighting the contributions that can be achieved by using the proposed methodology.

Flexibilidad en la resolución de problemas de identificación de patrones lineales en estudiantes de educación secundaria

El objetivo de este trabajo es caracterizar la flexibilidad, entendida como habilidad para modificar la estrategia de resolución de un problema cuando se modifica la demanda de la tarea, de estudiantes de educación secundaria (12-16 años) en problemas de reconocimiento de patrones con varios apartados. Se utiliza una metodología de tipo cualitativo analizando las respuestas de los estudiantes en base a dos criterios: corrección de las respuestas y estrategias de resolución, y agrupando las que presentan características semejantes. Los resultados indican tres perfiles de estudiantes en relación a la flexibilidad en el uso de estrategias y el éxito alcanzado. El primero agrupa a los estudiantes que usan sólo la estrategia recursiva; la mayor parte de ellos se bloquea al aumentar la demanda cognitiva de la tarea; predominan los estudiantes de 12-13 años. El segundo perfil corresponde a los que cambian de una estrategia recursiva a una aproximación proporcional dando un resultado incorrecto; es más frecuente en los estudiantes de 13-14 años. Finalmente, el tercer perfil agrupa a los estudiantes que al aumentar la demanda cognitiva de la tarea cambian con éxito de una estrategia recursiva a una funcional; su frecuencia aumenta con la edad. Se concluye que la flexibilidad necesaria para identificar patrones cuando se incrementa la demanda de la tarea está relacionada con los conocimientos de los estudiantes y con el control y la regulación del proceso de resolución. Por otra parte, los estudiantes más jóvenes manifestaron menor grado de flexibilidad que los más mayores.

A Computational Model of the Belief System Under the Scope of Social Communication

This paper presents an approach to the belief system based on a computational framework in three levels: first, the logic level with the definition of binary local rules, second, the arithmetic level with the definition of recursive functions and finally the behavioural level with the definition of a recursive construction pattern. Social communication is achieved when different beliefs are expressed, modified, propagated and shared through social nets. This approach is useful to mimic the belief system because the defined functions provide different ways to process the same incoming information as well as a means to propagate it. Our model also provides a means to cross different beliefs so, any incoming information can be processed many times by the same or different functions as it occurs is social nets.