Normal forms for rational difference equations with applications to the global periodicity problem

We propose a classification and derive the associated normal forms for rational difference equations with complex coefficients. As an application, we study the global periodicity problem for second order rational difference equations with complex coefficients. We find new necessary conditions as well as some new examples of globally periodic equations.

Combinatorial Synthesis and Biological Evaluation of Inhibitors of D-Ala-D-Ala-Ligase

Report for the scientific sojourn carried out at the Max Planck Institut of Molecular Phisiology, Germany, from 2006 to 2008.The work carried out during this postdoctoral stage was focused on two different projects. Firstly, identification of D-Ala D-Ala Inhibitors and the development of new synthethic approaches to obtain lipidated peptides and proteins and the use of these lipidated proteins in biological and biophysical studies. In the first project, new D-Ala D-Ala inhibitors were identified by using structural alignments of the ATP binding sites of the bacterial ligase DDl and protein and lipid kinases in complex with ATP analogs. We tested a series of commercially available kinase inhibitors and found LFM-A13 and Tyrphostine derivatives to inhibit DDl enzyme activity. Based on the initial screening results we synthesized a series of malononitrilamide and salicylamide derivatives and were able to confirm the validity of these scaffolds as inhibitors of DDl. From this investigation we gained a better understanding of the structural requirements and limitations necessary for the preparation of ATP competitive DDl inhibitors. The compounds in this study may serve as starting points for the development of bi-substrate inhibitors that incorporate both, an ATP competitive and a substrate competitive moiety. Bisubstrate inhibitors that block the ATP and D-Ala binding sites should exhibit enhanced selectivity and potency profiles by preferentially inhibiting DDl over kinases. In the second project, an optimized synthesis for tha alkylation of cysteins using the thiol ene reaction was establisehd. This new protocol allowed us to obtain large amounts of hexadecylated cysteine that was required for the synthesis of differently lipidated peptides. Afterwards the synthesis of various N-ras peptides bearing different lipid anchors was performed and the peptides were ligated to a truncated N-ras protein. The influence of this differently lipidated N-ras proteins on the partioning and association of N-Ras in model membrane subdomains was studied using Atomic Force Microscopy.

Development of a tool for the construction of "ground truth" for complex color images with text

Aquesta memoria resumeix el treball de final de carrera d’Enginyeria Superior d’Informàtica. Explicarà les principals raons que han motivat el projecte així com exemples que il·lustren l’aplicació resultant. En aquest cas el software intentarà resoldre la actual necessitat que hi ha de tenir dades de Ground Truth per als algoritmes de segmentació de text per imatges de color complexes. Tots els procesos seran explicats en els diferents capítols partint de la definició del problema, la planificació, els requeriments i el disseny fins a completar la il·lustració dels resultats del programa i les dades de Ground Truth resultants.

The Crocidura fuliginosa species complex (Mammalia, Insectivora) in Peninsular Malaya: biological, karyological and genetical evidence

Four West Malaysian shrew populations of the genus Crocidura were investigated through their karyotype and allozyme variations, and, in part, by interfertility experiments. Two different karyotypes characterize these shrews. The first, restricted to the Cameron Highlands (Peninsular Malaysia), invariably has 2n = 40 chromosomes but a varying fundamental number (FN = 54-58). The second karyotype shows a fundamental number of 62-68 and a polymorphic chromosomal number of 2n = 38, 39 or 40, a rare event in the genus Crocidura. Thus both can be distinguished by either a low or a higher number of meta- and submetacentric elements. In heterospecific breeding experiments, mutual avoidance was observed suggesting prezygotic barriers, whereas intraspecific pairs produced 13 liters (mean 2.1 young). Furthermore, our biochemical results indicate that both karyotypes correspond to a relatively ancient separation (Nei's D = 0.354), an amount of genetic differentiation comparable to the distance separating them from the West Palearctic C. russula (D = 0.429-0.583). In contrast, conspecific island and mainland Malaysian shrews possessing the second karyotype had only one fixed allelic difference over the 35 loci surveyed. The problem of naming the two biological species remains unsolved and requires further comparative investigations.

Rapid, combinatorial analysis of membrane compartments in intact plants with a multicolor marker set.

Plant membrane compartments and trafficking pathways are highly complex, and are often distinct from those of animals and fungi. Progress has been made in defining trafficking in plants using transient expression systems. However, many processes require a precise understanding of plant membrane trafficking in a developmental context, and in diverse, specialized cell types. These include defense responses to pathogens, regulation of transporter accumulation in plant nutrition or polar auxin transport in development. In all of these cases a central role is played by the endosomal membrane system, which, however, is the most divergent and ill-defined aspect of plant cell compartmentation. We have designed a new vector series, and have generated a large number of stably transformed plants expressing membrane protein fusions to spectrally distinct, fluorescent tags. We selected lines with distinct subcellular localization patterns, and stable, non-toxic expression. We demonstrate the power of this multicolor 'Wave' marker set for rapid, combinatorial analysis of plant cell membrane compartments, both in live-imaging and immunoelectron microscopy. Among other findings, our systematic co-localization analysis revealed that a class of plant Rab1-homologs has a much more extended localization than was previously assumed, and also localizes to trans-Golgi/endosomal compartments. Constructs that can be transformed into any genetic background or species, as well as seeds from transgenic Arabidopsis plants, will be freely available, and will promote rapid progress in diverse areas of plant cell biology.

A parameter-free approach for solving combinatorial optimization problems through biased randomization of efficient heuristics

This paper discusses the use of probabilistic or randomized algorithms for solving combinatorial optimization problems. Our approach employs non-uniform probability distributions to add a biased random behavior to classical heuristics so a large set of alternative good solutions can be quickly obtained in a natural way and without complex conguration processes. This procedure is especially useful in problems where properties such as non-smoothness or non-convexity lead to a highly irregular solution space, for which the traditional optimization methods, both of exact and approximate nature, may fail to reach their full potential. The results obtained are promising enough to suggest that randomizing classical heuristics is a powerful method that can be successfully applied in a variety of cases.

Equidistribution estimates for Fekete points on complex manifolds

We study the equidistribution of Fekete points in a compact complex manifold. These are extremal point configurations defined through sections of powers of a positive line bundle. Their equidistribution is a known result. The novelty of our approach is that we relate them to the problem of sampling and interpolation on line bundles, which allows us to estimate the equidistribution of the Fekete points quantitatively. In particular we estimate the Kantorovich-Wasserstein distance of the Fekete points to its limiting measure. The sampling and interpolation arrays on line bundles are a subject of independent interest, and we provide necessary density conditions through the classical approach of Landau, that in this context measures the local dimension of the space of sections of the line bundle. We obtain a complete geometric characterization of sampling and interpolation arrays in the case of compact manifolds of dimension one, and we prove that there are no arrays of both sampling and interpolation in the more general setting of semipositive line bundles.

Algorithm creation and optimization for the crew pairing problem

Algoritmo que optimiza y crea pairings para tripulaciones de líneas aéreas mediante la posterior programación en Java.

Adaptive approach heuristics for the generalized assignment problem

The Generalized Assignment Problem consists in assigning a setof tasks to a set of agents with minimum cost. Each agent hasa limited amount of a single resource and each task must beassigned to one and only one agent, requiring a certain amountof the resource of the agent. We present new metaheuristics forthe generalized assignment problem based on hybrid approaches.One metaheuristic is a MAX-MIN Ant System (MMAS), an improvedversion of the Ant System, which was recently proposed byStutzle and Hoos to combinatorial optimization problems, and itcan be seen has an adaptive sampling algorithm that takes inconsideration the experience gathered in earlier iterations ofthe algorithm. Moreover, the latter heuristic is combined withlocal search and tabu search heuristics to improve the search.A greedy randomized adaptive search heuristic (GRASP) is alsoproposed. Several neighborhoods are studied, including one basedon ejection chains that produces good moves withoutincreasing the computational effort. We present computationalresults of the comparative performance, followed by concludingremarks and ideas on future research in generalized assignmentrelated problems.

Driver scheduling problem modelling

The Drivers Scheduling Problem (DSP) consists of selecting a set of duties for vehicle drivers, for example buses, trains, plane or boat drivers or pilots, for the transportation of passengers or goods. This is a complex problem because it involves several constraints related to labour and company rules and can also present different evaluation criteria and objectives. Being able to develop an adequate model for this problem that can represent the real problem as close as possible is an important research area.The main objective of this research work is to present new mathematical models to the DSP problem that represent all the complexity of the drivers scheduling problem, and also demonstrate that the solutions of these models can be easily implemented in real situations. This issue has been recognized by several authors and as important problem in Public Transportation. The most well-known and general formulation for the DSP is a Set Partition/Set Covering Model (SPP/SCP). However, to a large extend these models simplify some of the specific business aspects and issues of real problems. This makes it difficult to use these models as automatic planning systems because the schedules obtained must be modified manually to be implemented in real situations. Based on extensive passenger transportation experience in bus companies in Portugal, we propose new alternative models to formulate the DSP problem. These models are also based on Set Partitioning/Covering Models; however, they take into account the bus operator issues and the perspective opinions and environment of the user.We follow the steps of the Operations Research Methodology which consist of: Identify the Problem; Understand the System; Formulate a Mathematical Model; Verify the Model; Select the Best Alternative; Present the Results of theAnalysis and Implement and Evaluate. All the processes are done with close participation and involvement of the final users from different transportation companies. The planner s opinion and main criticisms are used to improve the proposed model in a continuous enrichment process. The final objective is to have a model that can be incorporated into an information system to be used as an automatic tool to produce driver schedules. Therefore, the criteria for evaluating the models is the capacity to generate real and useful schedules that can be implemented without many manual adjustments or modifications. We have considered the following as measures of the quality of the model: simplicity, solution quality and applicability. We tested the alternative models with a set of real data obtained from several different transportation companies and analyzed the optimal schedules obtained with respect to the applicability of the solution to the real situation. To do this, the schedules were analyzed by the planners to determine their quality and applicability. The main result of this work is the proposition of new mathematical models for the DSP that better represent the realities of the passenger transportation operators and lead to better schedules that can be implemented directly in real situations.

Metaheuristics for the bus-driver scheduling problem

We present new metaheuristics for solving real crew scheduling problemsin a public transportation bus company. Since the crews of thesecompanies are drivers, we will designate the problem by the bus-driverscheduling problem. Crew scheduling problems are well known and severalmathematical programming based techniques have been proposed to solvethem, in particular using the set-covering formulation. However, inpractice, there exists the need for improvement in terms of computationalefficiency and capacity of solving large-scale instances. Moreover, thereal bus-driver scheduling problems that we consider can present variantaspects of the set covering, as for example a different objectivefunction, implying that alternative solutions methods have to bedeveloped. We propose metaheuristics based on the following approaches:GRASP (greedy randomized adaptive search procedure), tabu search andgenetic algorithms. These metaheuristics also present some innovationfeatures based on and genetic algorithms. These metaheuristics alsopresent some innovation features based on the structure of the crewscheduling problem, that guide the search efficiently and able them tofind good solutions. Some of these new features can also be applied inthe development of heuristics to other combinatorial optimizationproblems. A summary of computational results with real-data problems ispresented.

A pseudo-spectral method for simulating of poro-elastic seismic wave propagation in complex borehole environments

We present a novel numerical approach for the comprehensive, flexible, and accurate simulation of poro-elastic wave propagation in cylindrical coordinates. An important application of this method is the modeling of complex seismic wave phenomena in fluid-filled boreholes, which represents a major, and as of yet largely unresolved, computational problem in exploration geophysics. In view of this, we consider a numerical mesh consisting of three concentric domains representing the borehole fluid in the center, the borehole casing and the surrounding porous formation. The spatial discretization is based on a Chebyshev expansion in the radial direction, Fourier expansions in the other directions, and a Runge-Kutta integration scheme for the time evolution. A domain decomposition method based on the method of characteristics is used to match the boundary conditions at the fluid/porous-solid and porous-solid/porous-solid interfaces. The viability and accuracy of the proposed method has been tested and verified in 2D polar coordinates through comparisons with analytical solutions as well as with the results obtained with a corresponding, previously published, and independently benchmarked solution for 2D Cartesian coordinates. The proposed numerical solution also satisfies the reciprocity theorem, which indicates that the inherent singularity associated with the origin of the polar coordinate system is handled adequately.

Gauge group and reality conditions in Ashtekar's complex formulation of canonical gravity

We discuss reality conditions and the relation between spacetime diffeomorphisms and gauge transformations in Ashtekars complex formulation of general relativity. We produce a general theoretical framework for the stabilization algorithm for the reality conditions, which is different from Diracs method of stabilization of constraints. We solve the problem of the projectability of the diffeomorphism transformations from configuration-velocity space to phase space, linking them to the reality conditions. We construct the complete set of canonical generators of the gauge group in the phase space which includes all the gauge variables. This result proves that the canonical formalism has all the gauge structure of the Lagrangian theory, including the time diffeomorphisms.

Subclass problem-dependent design for error-correcting output codes

A common way to model multiclass classification problems is by means of Error-Correcting Output Codes (ECOCs). Given a multiclass problem, the ECOC technique designs a code word for each class, where each position of the code identifies the membership of the class for a given binary problem. A classification decision is obtained by assigning the label of the class with the closest code. One of the main requirements of the ECOC design is that the base classifier is capable of splitting each subgroup of classes from each binary problem. However, we cannot guarantee that a linear classifier model convex regions. Furthermore, nonlinear classifiers also fail to manage some type of surfaces. In this paper, we present a novel strategy to model multiclass classification problems using subclass information in the ECOC framework. Complex problems are solved by splitting the original set of classes into subclasses and embedding the binary problems in a problem-dependent ECOC design. Experimental results show that the proposed splitting procedure yields a better performance when the class overlap or the distribution of the training objects conceal the decision boundaries for the base classifier. The results are even more significant when one has a sufficiently large training size.

Metal concentrations in soils around the copper smelter and surrounding industrial complex of Port Kembla, NSW, Australia

Anthropogenic emissions of metals from sources such as smelters are an international problem, but there is limited published information on emissions from Australian smelters. The objective of this study was to investigate the regional distribution of heavy metals in soils in the vicinity of the industrial complex of Port Kembla, NSW, Australia, which comprises a copper smelter, steelworks and associated industries. Soil samples (n=25) were collected at the depths of 0-5 and 5-20 cm, air dried and sieved to < 2 mm. Aqua regia extractable amounts of As, Cr, Cu, Ph and Zn were analysed by inductively coupled plasma mass spectrometry (lCP-MS) and inductively coupled plasma atomic emission spectrometry (ICP-AES). Outliers were identified from background levels by statistical methods. Mean background levels at a depth of 0-5 cm were estimated at 3.2 mg/kg As, 12 mg/kg Cr, 49 mg/kg Cu, 20 mg/kg Ph and 42 mg/kg Zn. Outliers for elevated As and Cu values were mainly present within 4 km from the Port Kembla industrial complex, but high Ph at two sites and high Zn concentrations were found at six sites up to 23 km from Port Kembla. Chromium concentrations were not anomalous close to the industrial complex. There was no significant difference of metal concentrations at depths of 0-5 and 5-20 cm, except for Ph and Zn. Copper and As concentrations in the soils are probably related to the concentrations in the parent rock. From this investigation, the extent of the contamination emanating from the Port Kembla industrial complex is limited to 1-13 km, but most likely <4 km, depending on the element; the contamination at the greater distance may not originate from the industrial complex. (C) 2003 Elsevier B.V. All rights reserved.