Lithology, age determination and pollen records of five profiles for nothern Bavaria, Germany

Palynological investigations in northeastern Bavaria (Bavarian Vogtland, Fichtelgebirge, Steinwald) reveal the Late Glacial and Postglacial history of the regional vegetation. Radiocarbon data in comparison with those from the neighbouring regions (Rhön, Oberpfälzer Wald, Bavarian Forests) show a time lag in the development of the arboreal vegetation due to migration processes. The Fichtelgebirge is the southernmost part ofnortheastern Bavaria where the early Alleröd period (pollen zone IIa) is characterised by a dominance of birch forests. Hazel reached maximal values around 8000 BP in the area from the Fichtelgebirge to the Bavarian Forests, e.g. about 600 years earlier than in the more northern Rhön mountains. For spruce there is a considerable time lag between the Bavarian Forests and the Fichtelgebirge. Spruce spreading started in the Fichtelgebirge during the older part of the Atlantic period (pollen zone VI). At the same time, spruce already was the dominant tree in the Bavarian Forests. During the younger part of the Atlantic period (pollen zone VII) spruce and mixed oak forest tree species frequently occurred in the Fichtelgebirge. At the end of pollen zone VI, spruce came to dominance. At the same time, the immigration of beech started. During the Subboreal period (pollen zone VIII), spruce remained being a dominant member in the forests and at the end of pollen zone VIII, fir began to spread rapidly. During the first part of the Subatlantic period (pollen zone IX) spruce, beech, fir and pine formed the mountainous forests in the Fichtelgebirge. In the area of the Bavarian Vogtland, however, fir was a dominant forest tree during pollen zone IX, while spruce and beech played a less important role. During the 12th century, human colonisation started in the area of the Fichtelgebirge. This is 400 years later as in the area of the Rhön mountains. Indicators for earlier forest clearances are rare or absent.

Palynology on profile Rotmoss at Obergurgl in Austria

Die pollenanalytische Untersuchung des Rotmooses in Verbindung mit C-14 Daten hat ergeben, daß die organogenen Sedimente nachwärmezeitliche Bildungen sind. Ein Gletschervorstoß um 2500 v. Chr. konnte mit Hilfe der C-14 Daten eingegrenzt und mit anderen Fundstellen parallelisiert werden. Weitere pollenanalytisch festgestellte Gletscher und auch Waldgrenzschwankungen konnten festgestellt, müssen aber noch genau datiert und parallelisiert werden.

Lithology and pollen record of 4 profiles from the Bavaria, southern Germany

Palynological investigations of sediments from northern Bavaria (Rhön, Grabfeld, Lange Berge) reveal the Late Glacial and Postglacial history of the regional vegetation. The older sedirnents were found in the Rhön (Schwarzes Moor) and date back into the Bölling Period. At the end of that period pine spread into the Grabfeld. In both areas Lacher Tuff has been found. A radiocarbon date of 10,300 BP was found for the Late Glacial - Postglacial transition and one of 9300 BP for the Preboreal - Boreal transition. Hazel reached its highest values in the Rhön around 7,400 BP. During the Atlanticum a deciduous mixed oak forest covered the Rhön and Grabfeld regions. Beech dominated since the Subatlanticum. In the Lange Berge region, however, a mixed forest with Fagus, Picea, Pinus and Abies developed. In the Rhön first anthropogenic influence was found during the Latene Period. The boundary between zone IX and X has been dated at 820 A.D., and the start of extensive forest clearances at 1000 A. D. A culmination of landuse was found for the Medieval Period. At the end of that period however the Rhön was deserted. New forest clearances started around 1500 A.D., but were interrupted by the 'Thirty Years War'. Afterwards the Rhön got its present appearance.

Metaheuristic approaches for MWT and MWPT problems

It is known that the Minimum Weight Triangulation problem is NP-hard. Also the complexity of the Minimum Weight Pseudo-Triangulation problem is unknown, yet it is suspected to be also NP-hard. Therefore we focused on the development of approximate algorithms to find high quality triangulations and pseudo-triangulations of minimum weight. In this work we propose two metaheuristics to solve these problems: Ant Colony Optimization (ACO) and Simulated Annealing (SA). For the experimental study we have created a set of instances for MWT and MWPT problems, since no reference to benchmarks for these problems were found in the literature. Through experimental evaluation, we assess the applicability of the ACO and SA metaheuristics for MWT and MWPT problems. These results are compared with those obtained from the application of deterministic algorithms for the same problems (Delaunay Triangulation for MWT and a Greedy algorithm respectively for MWT and MWPT).

Approximations on minimum weight pseudo-triangulation problem using ant colony optimization

In this work, we consider the Minimum Weight Pseudo-Triangulation (MWPT) problem of a given set of n points in the plane. Globally optimal pseudo-triangulations with respect to the weight, as optimization criteria, are difficult to be found by deterministic methods, since no polynomial algorithm is known. We show how the Ant Colony Optimization (ACO) metaheuristic can be used to find high quality pseudo-triangulations of minimum weight. We present the experimental and statistical study based on our own set of instances since no reference to benchmarks for these problems were found in the literature. Throughout the experimental evaluation, we appraise the ACO metaheuristic performance for MWPT problem.

Algoritmos inspirados en Swarm intelligence para el enrutamieto en redes de telecomunicaciones.

En las últimas décadas hemos visto un rápido desarrollo de las redes de telecomunicación llegando a todos los rincones de la sociedad, bien a través de cable o bien de forma inalámbrica. Dichas redes, que cada vez son más grandes, dinámicas y complejas, integrando un mayor número de servicios y protocolos, requieren de un componente central que es el enrutamiento. El enrutamiento determina las estrategias a utilizar por los nodos de una red para encontrar las rutas óptimas entre un origen y un destino en el envío de información. Resulta difícil conseguir una estrategia que se adapte a este tipo de entornos altamente dinámicos, complejos y con un alto grado de heterogeneidad. Los algoritmos clásicos propuestos hasta la fecha suelen ser algoritmos centralizados que tratan de gestionar una arquitectura claramente distribuida, que en escenarios estacionarios pueden mantener un buen rendimiento, pero que no funcionan bien en escenarios donde se dan continuos cambios en la topología de red o en los patrones de tráfico. Es necesario proponer nuevos algoritmos que permitan el enrutamiento de forma distribuida, más adaptables a los cambios, robustos y escalables. Aquí vamos a tratar de hacer una revisión de los algoritmos propuestos inspirados en la naturaleza, particularmente en los comportamientos colectivos de sociedades de insectos. Veremos cómo de una forma descentralizada y auto-organizada, mediante agentes simples e interacciones locales, podemos alcanzar un comportamiento global "inteligente" que cumpla dichas cualidades. Por último proponemos Abira, un algoritmo ACO basado en AntNet-FA que trata de mejorar el rendimiento y la convergencia introduciendo mecanismos de exploración, de feedback negativo como la penalización y de comunicación de de las mejores rutas. Tras realizar una simulación y comparar los resultados con el algoritmo original, vemos que Abira muestra un mejor rendimiento.

Correo del otro mundo : Número VI.º

Contiene: Las quexas que han dirigido à Radamanto y Éaco contra varios Europeos ... contra los Franceses ...

Automatic design of Ant Colony Optimization for permutation problems

In this study, we present a framework based on ant colony optimization (ACO) for tackling combinatorial problems. ACO algorithms have been applied to many diferent problems, focusing on algorithmic variants that obtain high-quality solutions. Usually, the implementations are re-done for various problem even if they maintain the same details of the ACO algorithm. However, our goal is to generate a sustainable framework for applications on permutation problems. We concentrate on understanding the behavior of pheromone trails and specific methods that can be combined. Eventually, we will propose an automatic offline configuration tool to build an efective algorithm. ---RESUMEN---En este trabajo vamos a presentar un framework basado en la familia de algoritmos ant colony optimization (ACO), los cuales están dise~nados para enfrentarse a problemas combinacionales. Los algoritmos ACO han sido aplicados a diversos problemas, centrándose los investigadores en diversas variantes que obtienen buenas soluciones. Normalmente, las implementaciones se tienen que rehacer, inclusos si se mantienen los mismos detalles para los algoritmos ACO. Sin embargo, nuestro objetivo es generar un framework sostenible para aplicaciones sobre problemas de permutaciones. Nos centraremos en comprender el comportamiento de la sendas de feromonas y ciertos métodos con los que pueden ser combinados. Finalmente, propondremos una herramienta para la configuraron automática offline para construir algoritmos eficientes.

A Multi Ant Colony Optimization algorithm for a Mixed Car Assembly Line

This paper presents an ant colony optimization algorithm to sequence the mixed assembly lines considering the inventory and the replenishment of components. This is a NP-problem that cannot be solved to optimality by exact methods when the size of the problem growth. Groups of specialized ants are implemented to solve the different parts of the problem. This is intended to differentiate each part of the problem. Different types of pheromone structures are created to identify good car sequences, and good routes for the replenishment of components vehicle. The contribution of this paper is the collaborative approach of the ACO for the mixed assembly line and the replenishment of components and the jointly solution of the problem.

Discurso pronunciado por el Excmo. Sr. D. Rafael Portaencasa Baaza, Rector Magnífico de la Universidad Politécnica de Madrid, en el acto de apertura del curso académico universitario 1988-89

En este discurso D. Rafael Portaencasa, Rector de la UPM, reflexiona sobre los principales acontecimientos relacionados con esta universidad en 1988 y sobre el papel que debe desempeñar dicha institución de cara a la sociedad.

Arquitectura de supercomputación en la nube para la resolución de problemas de optimización combinatoria

La tesis está focalizada en la resolución de problemas de optimización combinatoria, haciendo uso de las opciones tecnológicas actuales que ofrecen las tecnologías de la información y las comunicaciones, y la investigación operativa. Los problemas de optimización combinatoria se resuelven en general mediante programación lineal y metaheurísticas. La aplicación de las técnicas de resolución de los problemas de optimización combinatoria requiere de una elevada carga computacional, y los algoritmos deben diseñarse, por un lado pensando en la efectividad para encontrar buenas soluciones del problema, y por otro lado, pensando en un uso adecuado de los recursos informáticos disponibles. La programación lineal y las metaheurísticas son técnicas de resolución genéricas, que se pueden aplicar a diferentes problemas, partiendo de una base común que se particulariza para cada problema concreto. En el campo del desarrollo de software, los frameworks cumplen esa función de comenzar un proyecto con el trabajo general ya disponible, con la opción de cambiar o extender ese comportamiento base o genérico, para construir el sistema concreto, lo que permite reducir el tiempo de desarrollo, y amplía las posibilidades de éxito del proyecto. En esta tesis se han desarrollado dos frameworks de desarrollo. El framework ILP permite modelar y resolver problemas de programación lineal, de forma independiente al software de resolución de programación lineal que se utilice. El framework LME permite resolver problemas de optimización combinatoria mediante metaheurísticas. Tradicionalmente, las aplicaciones de resolución de problemas de optimización combinatoria son aplicaciones de escritorio que permiten gestionar toda la información de entrada del problema y resuelven el problema en local, con los recursos hardware disponibles. Recientemente ha aparecido un nuevo paradigma de despliegue y uso de aplicaciones que permite compartir recursos informáticos especializados por Internet. Esta nueva forma de uso de recursos informáticos es la computación en la nube, que presenta el modelo de software como servicio (SaaS). En esta tesis se ha construido una plataforma SaaS, para la resolución de problemas de optimización combinatoria, que se despliega sobre arquitecturas compuestas por procesadores multi-núcleo y tarjetas gráficas, y dispone de algoritmos de resolución basados en frameworks de programación lineal y metaheurísticas. Toda la infraestructura es independiente del problema de optimización combinatoria a resolver, y se han desarrollado tres problemas que están totalmente integrados en la plataforma SaaS. Estos problemas se han seleccionado por su importancia práctica. Uno de los problemas tratados en la tesis, es el problema de rutas de vehículos (VRP), que consiste en calcular las rutas de menor coste de una flota de vehículos, que reparte mercancías a todos los clientes. Se ha partido de la versión más clásica del problema y se han hecho estudios en dos direcciones. Por un lado se ha cuantificado el aumento en la velocidad de ejecución de la resolución del problema en tarjetas gráficas. Por otro lado, se ha estudiado el impacto en la velocidad de ejecución y en la calidad de soluciones, en la resolución por la metaheurística de colonias de hormigas (ACO), cuando se introduce la programación lineal para optimizar las rutas individuales de cada vehículo. Este problema se ha desarrollado con los frameworks ILP y LME, y está disponible en la plataforma SaaS. Otro de los problemas tratados en la tesis, es el problema de asignación de flotas (FAP), que consiste en crear las rutas de menor coste para la flota de vehículos de una empresa de transporte de viajeros. Se ha definido un nuevo modelo de problema, que engloba características de problemas presentados en la literatura, y añade nuevas características, lo que permite modelar los requerimientos de las empresas de transporte de viajeros actuales. Este nuevo modelo resuelve de forma integrada el problema de definir los horarios de los trayectos, el problema de asignación del tipo de vehículo, y el problema de crear las rotaciones de los vehículos. Se ha creado un modelo de programación lineal para el problema, y se ha resuelto por programación lineal y por colonias de hormigas (ACO). Este problema se ha desarrollado con los frameworks ILP y LME, y está disponible en la plataforma SaaS. El último problema tratado en la tesis es el problema de planificación táctica de personal (TWFP), que consiste en definir la configuración de una plantilla de trabajadores de menor coste, para cubrir una demanda de carga de trabajo variable. Se ha definido un modelo de problema muy flexible en la definición de contratos, que permite el uso del modelo en diversos sectores productivos. Se ha definido un modelo matemático de programación lineal para representar el problema. Se han definido una serie de casos de uso, que muestran la versatilidad del modelo de problema, y permiten simular el proceso de toma de decisiones de la configuración de una plantilla de trabajadores, cuantificando económicamente cada decisión que se toma. Este problema se ha desarrollado con el framework ILP, y está disponible en la plataforma SaaS. ABSTRACT The thesis is focused on solving combinatorial optimization problems, using current technology options offered by information technology and communications, and operations research. Combinatorial optimization problems are solved in general by linear programming and metaheuristics. The application of these techniques for solving combinatorial optimization problems requires a high computational load, and algorithms are designed, on the one hand thinking to find good solutions to the problem, and on the other hand, thinking about proper use of the available computing resources. Linear programming and metaheuristic are generic resolution techniques, which can be applied to different problems, beginning with a common base that is particularized for each specific problem. In the field of software development, frameworks fulfill this function that allows you to start a project with the overall work already available, with the option to change or extend the behavior or generic basis, to build the concrete system, thus reducing the time development, and expanding the possibilities of success of the project. In this thesis, two development frameworks have been designed and developed. The ILP framework allows to modeling and solving linear programming problems, regardless of the linear programming solver used. The LME framework is designed for solving combinatorial optimization problems using metaheuristics. Traditionally, applications for solving combinatorial optimization problems are desktop applications that allow the user to manage all the information input of the problem and solve the problem locally, using the available hardware resources. Recently, a new deployment paradigm has appeared, that lets to share hardware and software resources by the Internet. This new use of computer resources is cloud computing, which presents the model of software as a service (SaaS). In this thesis, a SaaS platform has been built for solving combinatorial optimization problems, which is deployed on architectures, composed of multi-core processors and graphics cards, and has algorithms based on metaheuristics and linear programming frameworks. The SaaS infrastructure is independent of the combinatorial optimization problem to solve, and three problems are fully integrated into the SaaS platform. These problems have been selected for their practical importance. One of the problems discussed in the thesis, is the vehicle routing problem (VRP), which goal is to calculate the least cost of a fleet of vehicles, which distributes goods to all customers. The VRP has been studied in two directions. On one hand, it has been quantified the increase in execution speed when the problem is solved on graphics cards. On the other hand, it has been studied the impact on execution speed and quality of solutions, when the problem is solved by ant colony optimization (ACO) metaheuristic, and linear programming is introduced to optimize the individual routes of each vehicle. This problem has been developed with the ILP and LME frameworks, and is available in the SaaS platform. Another problem addressed in the thesis, is the fleet assignment problem (FAP), which goal is to create lower cost routes for a fleet of a passenger transport company. It has been defined a new model of problem, which includes features of problems presented in the literature, and adds new features, allowing modeling the business requirements of today's transport companies. This new integrated model solves the problem of defining the flights timetable, the problem of assigning the type of vehicle, and the problem of creating aircraft rotations. The problem has been solved by linear programming and ACO. This problem has been developed with the ILP and LME frameworks, and is available in the SaaS platform. The last problem discussed in the thesis is the tactical planning staff problem (TWFP), which is to define the staff of lower cost, to cover a given work load. It has been defined a very rich problem model in the definition of contracts, allowing the use of the model in various productive sectors. It has been defined a linear programming mathematical model to represent the problem. Some use cases has been defined, to show the versatility of the model problem, and to simulate the decision making process of setting up a staff, economically quantifying every decision that is made. This problem has been developed with the ILP framework, and is available in the SaaS platform.

A (R)EXISTÊNCIA DAS VOCACIONADAS AO MINISTÉRIO PASTORAL BATISTA: DESCORTINANDO A RELAÇÃO ENTRE AS PASTORAS BATISTAS DE SÃO PAULO E A NÃO FILIAÇÃO NA ORDEM DOS PASTORES BATISTAS DO BRASIL EM SÃO PAULO (OPBB-SP)

O contexto batista é predominantemente marcado por lideranças masculinas, destinando às mulheres apenas lugares e comportamentos socialmente estabelecidos, como a casa, o cuidado, a maternidade, a submissão, entre outras características que enfatizam a hierarquia de gênero. Mesmo diante do desenvolvimento econômico e da ocupação que as mulheres estão conquistando no campo público, a igreja e principalmente as igrejas batistas, permanecem fundadas em alicerces que exaltam o poder masculino em detrimento do lugar que deve ser ocupado pelas mulheres, ou seja, onde elas decidirem atuar. Caso elas decidam atuar num campo predominantemente masculino, terão que lidar com a desconstrução de um pensamento socialmente permeado de dominação masculina e com a árdua construção de um pensamento que vise a igualdade de gênero. O objeto desta pesquisa é o ministério pastoral feminino no contexto batista brasileiro. O texto analisa o discurso das Pastoras Batistas do Estado de São Paulo e o discurso dos líderes da Ordem dos Pastores Batistas de São Paulo (OPBB-SP) a respeito do ministério pastoral feminino e a não filiação de mulheres na OPBB-SP. A importância deste trabalho é a de demostrar as relações de micro poder existentes entre pastores e pastoras e concomitantemente as desigualdades dentro do contexto batista com relação ao ministério pastoral feminino. Essa afirmação se consolida por meio das análises das entrevistas semiestruturadas que realizei na pesquisa de campo, com sete pastoras batistas do Estado de São Paulo, bem como com três líderes da OPPB-SP. Esta é uma pesquisa qualitativa, em que foram analisados documentos oficiais da igreja, como pautas de convenções, atas, sites institucionais, periódicos e documentos não oficiais encontrados em redes sociais, blogs, jornais online, entre outros. Posso afirmar que as pastoras batistas estão se mobilizando para cumprir sua vocação, usando argumentos transcendentes que impedem qualquer pessoa de desafiar ou duvidar de seu chamado pastoral, pois: “O vento sopra onde quer; ouve-se o ruído, mas não sabes de onde vem, nem para onde vai. Assim acontece com aquele(a) que nasceu do Espírito.” (João 3.8).

O AGENDAMENTO DE TELEJORNAIS BRASILEIROS EM SITES NOTICIOSOS DE CONTEÚDO COLABORATIVO

The thesis investigates if with the free news production, people who post information on collaborative content sites, known as interacting, tend to reproduce information that was scheduled for Tv news. This study is a comparison of the collaborative content vehicles Vc reporter, Vc no G1 and Eu reporter with TV news SBT Brasil, Jornal Nacional, Jornal da Record and Jornal da Band. We sought to determine whether those newscasts guide the collaborative platforms. The hypothesis assumes that Brazilian TV news have been building over time a credible relationship with the viewer, so it is possible to think that the interacting use the same criteria for selecting the broadcasts and reproduce similar information in collaborative content sites. The method used was content analysis, based on the study of Laurence Bardin and the type of research used was quantitative. This research concluded that, within a small portion of the universe surveyed, there are schedules of television news across the collaborative content.

O DISCURSO DE HUMANIZAÇÃO COMO ESTRATÉGIA DE APROXIMAÇÃO COM O CONSUMIDOR NAS PUBLICIDADES DAS MÍDIAS SOCIAIS

Este trabalho propõe o estudo analítico de estratégias discursivas das organizações empregadas nas publicidades das mídias sociais no Brasil em que, na tentativa de aproximação com os consumidores, as empresas emitem discursos de humanização. A pesquisa ocupou-se em identificar e analisar as publicidades das marcas notabilizadas nesse ambiente superabundante de informação, capazes de comunicar-se efetivamente com os consumidores, a ponto de levá-los ao engajamento com os interesses da organização pela interação e compartilhamento dos conteúdos nas mídias sociais, e de torná-los os agentes da marca, aqueles que divulgam voluntariamente os seus benefícios para a sua rede de amigos. Trata-se de uma pesquisa exploratória de teor qualitativo, cuja busca se dará pelas delineações de um espaço discursivo. Utilizou-se a análise do discurso (AD), da linha francesa, sob a perspectiva dos estudos do ethos, cenas de enunciação e contrato de comunicação que contemplam os discursos organizacionais. Além da conceituação teórica e revisão de literatura vinculadas às mídias sociais e cultura organizacional, o trabalho analisou as publicidades em vídeo publicadas no Facebook e YouTube, nos anos de 2014 e 2015, cujo intuito era a aproximação com o consumidor. A pesquisa demonstrou que o ambiente das mídias sociais requer outra postura das organizações, uma linguagem dialógica e interativa com a participação do consumidor nas suas publicidades. A supervalorização do consumidor e a sua inclusão nas narrativas é uma tentativa de humanizar as relações entre organização e seus públicos e demonstram ser o eixo conciliador entre ambos na nova ambiência midiática.

Non-enzymatic and enzymatic hydrolysis of alkyl halides: A haloalkane dehalogenation enzyme evolved to stabilize the gas-phase transition state of an SN2 displacement reaction

The semiempirical PM3 method, calibrated against ab initio HF/6–31+G(d) theory, has been used to elucidate the reaction of 1,2-dichloroethane (DCE) with the carboxylate of Asp-124 at the active site of haloalkane dehalogenase of Xanthobacter autothropicus. Asp-124 and 13 other amino acid side chains that make up the active site cavity (Glu-56, Trp-125, Phe-128, Phe-172, Trp-175, Leu-179, Val-219, Phe-222, Pro-223, Val-226, Leu-262, Leu-263, and His-289) were included in the calculations. The three most significant observations of the present study are that: (i) the DCE substrate and Asp-124 carboxylate, in the reactive ES complex, are present as an ion-molecule complex with a structure similar to that seen in the gas-phase reaction of AcO− with DCE; (ii) the structures of the transition states in the gas-phase and enzymatic reaction are much the same where the structure formed at the active site is somewhat exploded; and (iii) the enthalpies in going from ground states to transition states in the enzymatic and gas-phase reactions differ by only a couple kcal/mol. The dehalogenase derives its catalytic power from: (i) bringing the electrophile and nucleophile together in a low-dielectric environment in an orientation that allows the reaction to occur without much structural reorganization; (ii) desolvation; and (iii) stabilizing the leaving chloride anion by Trp-125 and Trp-175 through hydrogen bonding.