A stochastic spatially structured epidemic model with diffusive processes

We developed a stochastic lattice model to describe the vector-borne disease (like yellow fever or dengue). The model is spatially structured and its dynamical rules take into account the diffusion of vectors. We consider a bipartite lattice, forming a sub-lattice of human and another occupied by mosquitoes. At each site of lattice we associate a stochastic variable that describes the occupation and the health state of a single individual (mosquito or human). The process of disease transmission in the human population follows a similar dynamic of the Susceptible-Infected-Recovered model (SIR), while the disease transmission in the mosquito population has an analogous dynamic of the Susceptible-Infected-Susceptible model (SIS) with mosquitos diffusion. The occurrence of an epidemic is directly related to the conditional probability of occurrence of infected mosquitoes (human) in the presence of susceptible human (mosquitoes) on neighborhood. The probability of diffusion of mosquitoes can facilitate the formation of pairs Susceptible-Infected enabling an increase in the size of the epidemic. Using an asynchronous dynamic update, we study the disease transmission in a population initially formed by susceptible individuals due to the introduction of a single mosquito (human) infected. We find that this model exhibits a continuous phase transition related to the existence or non-existence of an epidemic. By means of mean field approximations and Monte Carlo simulations we investigate the epidemic threshold and the phase diagram in terms of the diffusion probability and the infection probability.

Parallel Layout Construction Algorithm for Irregular Shape Packing Problems

Cutting and packing problems arise in a variety of industries, including garment, wood and shipbuilding. Irregular shape packing is a special case which admits irregular items and is much more complex due to the geometry of items. In order to ensure that items do not overlap and no item from the layout protrudes from the container, the collision free region concept was adopted. It represents all possible translations for a new item to be inserted into a container with already placed items. To construct a feasible layout, collision free region for each item is determined through a sequence of Boolean operations over polygons. In order to improve the speed of the algorithm, a parallel version of the layout construction was proposed and it was applied to a simulated annealing algorithm used to solve bin packing problems. Tests were performed in order to determine the speed improvement of the parallel version over the serial algorithm

Parallel implementation of a robust optical flow technique

[EN] The accuracy and performance of current variational optical ow methods have considerably increased during the last years. The complexity of these techniques is high and enough care has to be taken for the implementation. The aim of this work is to present a comprehensible implementation of recent variational optical flow methods. We start with an energy model that relies on brightness and gradient constancy terms and a ow-based smoothness term. We minimize this energy model and derive an e cient implicit numerical scheme. In the experimental results, we evaluate the accuracy and performance of this implementation with the Middlebury benchmark database. We show that it is a competitive solution with respect to current methods in the literature. In order to increase the performance, we use a simple strategy to parallelize the execution on multi-core processors.

A parallel future for Ocean research?

[EN] Today, science is difficult to pursue because funding is so tenuous. In such a financial climate, researchers need to consider parallel alternatives to ensure that scientific research can continue. Based on this thinking, we created BIOCEANSolutions, a company born of a research group. A great variety of environmental regulations and standards have emerged over recent years with the purpose of protecting natural ecosystems. These have enabled us to link our research to the market of environmental management. Marine activities can alter environmental conditions, resulting in changes in physiological states, species diversity, abundance, and biomass in the local biological communities. In this way, we can apply our knowledge, to plankton ecophysiology and biochemical oceanography. We measure enzyme activities as bio-indicators of energy metabolism and other physiological rates and biologic-oceanographic processes in marine organisms. This information provides insight into the health of marine communities, the stress levels of individual organisms, and potential anomalies that may be affecting them. In the process of verifying standards and complying with regulations, we can apply our analytic capability and knowledge. The main analyses that we offer are: (1) the activity of the electron transport system (ETS) or potential respiration (Φ), (2) the physiological measurement of respiration (oxygen consumption), (3) the activity of Isocitrate dehydrogenase (IDH), (4) the respiratory CO2 production, and (5) the activity of Glutamate dehydrogenase (GDH) and (6) the physiological measurement of ammonium excretion. In addition, our experience in a productive research group allows us to pursue and develop technical-experimental activities such as marine and freshwater aquaculture, oceanographic field sampling, as well as providing guidance, counseling, and academic services. In summary, this new company will permit us to create a symbiosis between public and private sectors that serve clients and will allow us to grow and expand as a research team.

Portfolio: Objective structured examination for the assessment of essential competences at graduation

[EN] This porfolio is an Objective Structured Competence Examination (OSCE) designed for the Assessment of essentian competences defined by The European Asociation of Establishments for Veterinay Education (EAEVE) in its programme Evaluation of Veterinary Training in Europe

A model and an algebra for semi-structured and full-text queries

The need for a convergence between semi-structured data management and Information Retrieval techniques is manifest to the scientific community. In order to fulfil this growing request, W3C has recently proposed XQuery Full Text, an IR-oriented extension of XQuery. However, the issue of query optimization requires the study of important properties like query equivalence and containment; to this aim, a formal representation of document and queries is needed. The goal of this thesis is to establish such formal background. We define a data model for XML documents and propose an algebra able to represent most of XQuery Full-Text expressions. We show how an XQuery Full-Text expression can be translated into an algebraic expression and how an algebraic expression can be optimized.

Topological analysis of singularity loci for serial and parallel manipulators

Singularities of robot manipulators have been intensely studied in the last decades by researchers of many fields. Serial singularities produce some local loss of dexterity of the manipulator, therefore it might be desirable to search for singularityfree trajectories in the jointspace. On the other hand, parallel singularities are very dangerous for parallel manipulators, for they may provoke the local loss of platform control, and jeopardize the structural integrity of links or actuators. It is therefore utterly important to avoid parallel singularities, while operating a parallel machine. Furthermore, there might be some configurations of a parallel manipulators that are allowed by the constraints, but nevertheless are unreachable by any feasible path. The present work proposes a numerical procedure based upon Morse theory, an important branch of differential topology. Such procedure counts and identify the singularity-free regions that are cut by the singularity locus out of the configuration space, and the disjoint regions composing the configuration space of a parallel manipulator. Moreover, given any two configurations of a manipulator, a feasible or a singularity-free path connecting them can always be found, or it can be proved that none exists. Examples of applications to 3R and 6R serial manipulators, to 3UPS and 3UPU parallel wrists, to 3UPU parallel translational manipulators, and to 3RRR planar manipulators are reported in the work.

Performance evaluation of a parallel algorithm for simultaneous untangling and smoothing of tetrahedral meshes

[EN]A new parallel algorithm for simultaneous untangling and smoothing of tetrahedral meshes is proposed in this paper. We provide a detailed analysis of its performance on shared-memory many-core computer architectures. This performance analysis includes the evaluation of execution time, parallel scalability, load balancing, and parallelism bottlenecks. Additionally, we compare the impact of three previously published graph coloring procedures on the performance of our parallel algorithm. We use six benchmark meshes with a wide range of sizes. Using these experimental data sets, we describe the behavior of the parallel algorithm for different data sizes. We demonstrate that this algorithm is highly scalable when it runs on two different high-performance many-core computers with up to 128 processors...

Kernel Methods for Tree Structured Data

Machine learning comprises a series of techniques for automatic extraction of meaningful information from large collections of noisy data. In many real world applications, data is naturally represented in structured form. Since traditional methods in machine learning deal with vectorial information, they require an a priori form of preprocessing. Among all the learning techniques for dealing with structured data, kernel methods are recognized to have a strong theoretical background and to be effective approaches. They do not require an explicit vectorial representation of the data in terms of features, but rely on a measure of similarity between any pair of objects of a domain, the kernel function. Designing fast and good kernel functions is a challenging problem. In the case of tree structured data two issues become relevant: kernel for trees should not be sparse and should be fast to compute. The sparsity problem arises when, given a dataset and a kernel function, most structures of the dataset are completely dissimilar to one another. In those cases the classifier has too few information for making correct predictions on unseen data. In fact, it tends to produce a discriminating function behaving as the nearest neighbour rule. Sparsity is likely to arise for some standard tree kernel functions, such as the subtree and subset tree kernel, when they are applied to datasets with node labels belonging to a large domain. A second drawback of using tree kernels is the time complexity required both in learning and classification phases. Such a complexity can sometimes prevents the kernel application in scenarios involving large amount of data. This thesis proposes three contributions for resolving the above issues of kernel for trees. A first contribution aims at creating kernel functions which adapt to the statistical properties of the dataset, thus reducing its sparsity with respect to traditional tree kernel functions. Specifically, we propose to encode the input trees by an algorithm able to project the data onto a lower dimensional space with the property that similar structures are mapped similarly. By building kernel functions on the lower dimensional representation, we are able to perform inexact matchings between different inputs in the original space. A second contribution is the proposal of a novel kernel function based on the convolution kernel framework. Convolution kernel measures the similarity of two objects in terms of the similarities of their subparts. Most convolution kernels are based on counting the number of shared substructures, partially discarding information about their position in the original structure. The kernel function we propose is, instead, especially focused on this aspect. A third contribution is devoted at reducing the computational burden related to the calculation of a kernel function between a tree and a forest of trees, which is a typical operation in the classification phase and, for some algorithms, also in the learning phase. We propose a general methodology applicable to convolution kernels. Moreover, we show an instantiation of our technique when kernels such as the subtree and subset tree kernels are employed. In those cases, Direct Acyclic Graphs can be used to compactly represent shared substructures in different trees, thus reducing the computational burden and storage requirements.

Self assembled monolayers for engineering of structured inorganic materials in the micrometer and submicrometer range

Deutsch:In der vorliegenden Arbeit konnten neue Methoden zur Synthese anorganischer Materialien mit neuartiger Architektur im Mikrometer und Nanometer Maßstab beschrieben werden. Die zentrale Rolle der Formgebung basiert dabei auf der templatinduzierten Abscheidung der anorganischen Materialien auf selbstorganisierten Monoschichten. Als Substrate eignen sich goldbedampfte Glasträger und Goldkolloide, die eine Mittelstellung in der Welt der Atome bzw. Moleküle und der makroskopischen Welt der ausgedehnten Festkörper einnehmen. Auf diesen Substraten lassen sich Thiole zu einer monomolekularen Schicht adsorbieren und damit die Oberflächeneigenschaften des Substrates ändern. Ein besonderer Schwerpunkt bei dieser Arbeit stellt die Synthese speziell auf die Bedürfnisse der jeweiligen Anwendung ausgerichteten Thiole dar.Im ersten Teil der Arbeit wurden goldbedampfte Glasoberflächen als Template verwendet. Die Abscheidung von Calciumcarbonat wurde in Abhängigkeit der Schichtdicke der adsorbierten Monolage untersucht. Aragonit, eine der drei Hauptphasen des Calciumcarbonat Systems, wurde auf polyaromatischen Amid - Oberflächen mit Schichtdicken von 5 - 400 nm Dicke unter milden Bedingung abgeschieden. Die einstellbaren Parameter waren dabei die Kettenlänge des Polymers, der w-Substituent, die Bindung an die Goldoberfläche über Verwendung verschiedener Aminothiole und die Kristallisationstemperatur. Die Schichtdickeneinstellung der Polymerfilme erfolgte hierbei über einen automatisierten Synthesezyklus.Titanoxid Filme konnten auf Oberflächen strukturiert werden. Dabei kam ein speziell synthetisiertes Thiol zum Einsatz, das die Funktionalität einer Styroleinheit an der Oberflächen Grenze als auch eine Möglichkeit zur späteren Entfernung von der Oberfläche in sich vereinte. Die PDMS Stempeltechnik erzeugte dabei Mikrostrukturen auf der Goldoberfläche im Bereich von 5 bis 10 µm, die ihrerseits über die Polymerisation und Abscheidung des Polymers in den Titanoxid Film überführt werden konnten. Drei dimensionale Strukturen wurden über Goldkolloid Template erhalten. Tetraethylenglykol konnte mit einer Thiolgruppe im Austausch zu einer Hydroxylgruppe monofunktionalisiert werden. Das erhaltene Molekül wurde auf kolloidalem Gold selbstorganisiert; es entstand dabei ein wasserlösliches Goldkolloid. Die Darstellung erfolgte dabei in einer Einphasenreaktion. Die so erhaltenen Goldkolloide wurden als Krstallisationstemplate für die drei dimensionale Abscheidung von Calciumcarbonat verwendet. Es zeigte sich, dass Glykol die Kristallisation bzw. den Habitus des krsitalls bei niedrigem pH Wert modifiziert. Bei erhöhtem pH Wert (pH = 12) jedoch agieren die Glykol belegten Goldkolloide als Template und führen zu sphärisch Aggregaten. Werden Goldkolloide langkettigen Dithiolen ausgesetzt, so führt dies zu einer Aggregation und Ausfällung der Kolloide aufgrund der Vernetzung mehrer Goldkolloide mit den Thiolgruppen der Alkyldithiole. Zur Vermeidung konnte in dieser Arbeit ein halbseitig geschütztes Dithiol synthetisiert werden, mit dessen Hilfe die Aggregation unterbunden werden konnte. Das nachfolgende Entschützten der Thiolfunktion führte zu Goldkolloiden, deren Oberfläche Thiol funktionalisiert werden konnte. Die thiolaktiven Goldkolloide fungierten als template für die Abscheidung von Bleisulfid aus organisch/wässriger Lösung. Die Funktionsweise der Schutzgruppe und die Entschützung konnte mittels Plasmonenresonanz Spektroskopie verdeutlicht werden. Titanoxid / Gold / Polystyrol Komposite in Röhrenform konnten synthetisiert werden. Dazu wurde ein menschliches Haar als biologisches Templat für die Formgebung gewählt.. Durch Bedampfung des Haares mit Gold, Assemblierung eines Stryrolmonomers, welches zusätzlich eine Thiolfunktionalität trug, Polymerisation auf der Oberfläche, Abscheidung des Titanoxid Films und anschließendem Auflösen des biologischen Templates konnte eine Röhrenstruktur im Mikrometer Bereich dargestellt werden. Goldkolloide fungierten in dieser Arbeit nicht nur als Kristallisationstemplate und Formgeber, auch sie selbst wurden dahingehend modifiziert, dass sie drahtförmige Agglormerate im Nanometerbereich ausbilden. Dazu wurden Template aus Siliziumdioxid benutzt. Zum einen konnten Nanoröhren aus amorphen SiO2 in einer Sol Gel Methode dargestellt werden, zum anderen bediente sich diese Arbeit biologischer Siliziumoxid Hohlnadeln aus marinen Schwämmen isoliert. Goldkolloide wurden in die Hohlstrukturen eingebettet und die Struktur durch Ausbildung von Kolloid - Thiol Netzwerken mittels Dithiol Zugabe gefestigt. Die Gold-Nanodrähte im Bereich von 100 bis 500 nm wurden durch Auflösen des SiO2 - Templates freigelegt.

Use of computer algebra in the calculation of Feynman diagrams

The increasing precision of current and future experiments in high-energy physics requires a likewise increase in the accuracy of the calculation of theoretical predictions, in order to find evidence for possible deviations of the generally accepted Standard Model of elementary particles and interactions. Calculating the experimentally measurable cross sections of scattering and decay processes to a higher accuracy directly translates into including higher order radiative corrections in the calculation. The large number of particles and interactions in the full Standard Model results in an exponentially growing number of Feynman diagrams contributing to any given process in higher orders. Additionally, the appearance of multiple independent mass scales makes even the calculation of single diagrams non-trivial. For over two decades now, the only way to cope with these issues has been to rely on the assistance of computers. The aim of the xloops project is to provide the necessary tools to automate the calculation procedures as far as possible, including the generation of the contributing diagrams and the evaluation of the resulting Feynman integrals. The latter is based on the techniques developed in Mainz for solving one- and two-loop diagrams in a general and systematic way using parallel/orthogonal space methods. These techniques involve a considerable amount of symbolic computations. During the development of xloops it was found that conventional computer algebra systems were not a suitable implementation environment. For this reason, a new system called GiNaC has been created, which allows the development of large-scale symbolic applications in an object-oriented fashion within the C++ programming language. This system, which is now also in use for other projects besides xloops, is the main focus of this thesis. The implementation of GiNaC as a C++ library sets it apart from other algebraic systems. Our results prove that a highly efficient symbolic manipulator can be designed in an object-oriented way, and that having a very fine granularity of objects is also feasible. The xloops-related parts of this work consist of a new implementation, based on GiNaC, of functions for calculating one-loop Feynman integrals that already existed in the original xloops program, as well as the addition of supplementary modules belonging to the interface between the library of integral functions and the diagram generator.