Algorithm engineering for expression dag based number types

Magdeburg, Univ., Fak. für Informatik, Diss., 2015

A note on parallelizing the parameterized expectations algorithm

The parameterized expectations algorithm (PEA) involves a long simulation and a nonlinear least squares (NLS) fit, both embedded in a loop. Both steps are natural candidates for parallelization. This note shows that parallelization can lead to important speedups for the PEA. I provide example code for a simple model that can serve as a template for parallelization of more interesting models, as well as a download link for an image of a bootable CD that allows creation of a cluster and execution of the example code in minutes, with no need to install any software.

Metodologia a seguir per la reconstrucció d’imatges mèdiques i la seva transformació en geometries mallades per a l’ús computacional

Estudi elaborat a partir d’una estada a l'Imperial College of London, Gran Bretanya, entre setembre i desembre 2006. Disposar d'una geometria bona i ben definida és essencial per a poder resoldre eficientment molts dels models computacionals i poder obtenir uns resultats comparables a la realitat del problema. La reconstrucció d'imatges mèdiques permet transformar les imatges obtingudes amb tècniques de captació a geometries en formats de dades numèriques . En aquest text s'explica de forma qualitativa les diverses etapes que formen el procés de reconstrucció d'imatges mèdiques fins a finalment obtenir una malla triangular per a poder‐la processar en els algoritmes de càlcul. Aquest procés s'inicia a l'escàner MRI de The Royal Brompton Hospital de Londres del que s'obtenen imatges per a després poder‐les processar amb les eines CONGEN10 i SURFGEN per a un entorn MATLAB. Aquestes eines les han desenvolupat investigadors del Bioflow group del departament d'enginyeria aeronàutica del Imperial College of London i en l'ultim apartat del text es comenta un exemple d'una artèria que entra com a imatge mèdica i surt com a malla triangular processable amb qualsevol programari o algoritme que treballi amb malles.

Elements of algebraic geometry and the positive theory of partially commutative groups

The first main result of the paper is a criterion for a partially commutative group G to be a domain. It allows us to reduce the study of algebraic sets over G to the study of irreducible algebraic sets, and reduce the elementary theory of G (of a coordinate group over G) to the elementary theories of the direct factors of G (to the elementary theory of coordinate groups of irreducible algebraic sets). Then we establish normal forms for quantifier-free formulas over a non-abelian directly indecomposable partially commutative group H. Analogously to the case of free groups, we introduce the notion of a generalised equation and prove that the positive theory of H has quantifier elimination and that arbitrary first-order formulas lift from H to H * F, where F is a free group of finite rank. As a consequence, the positive theory of an arbitrary partially commutative group is decidable.

Characterizations of Lojasiewicz inequalities and applications

The classical Lojasiewicz inequality and its extensions for partial differential equation problems (Simon) and to o-minimal structures (Kurdyka) have a considerable impact on the analysis of gradient-like methods and related problems: minimization methods, complexity theory, asymptotic analysis of dissipative partial differential equations, tame geometry. This paper provides alternative characterizations of this type of inequalities for nonsmooth lower semicontinuous functions defined on a metric or a real Hilbert space. In a metric context, we show that a generalized form of the Lojasiewicz inequality (hereby called the Kurdyka- Lojasiewicz inequality) relates to metric regularity and to the Lipschitz continuity of the sublevel mapping, yielding applications to discrete methods (strong convergence of the proximal algorithm). In a Hilbert setting we further establish that asymptotic properties of the semiflow generated by -∂f are strongly linked to this inequality. This is done by introducing the notion of a piecewise subgradient curve: such curves have uniformly bounded lengths if and only if the Kurdyka- Lojasiewicz inequality is satisfied. Further characterizations in terms of talweg lines -a concept linked to the location of the less steepest points at the level sets of f- and integrability conditions are given. In the convex case these results are significantly reinforced, allowing in particular to establish the asymptotic equivalence of discrete gradient methods and continuous gradient curves. On the other hand, a counterexample of a convex C2 function in R2 is constructed to illustrate the fact that, contrary to our intuition, and unless a specific growth condition is satisfied, convex functions may fail to fulfill the Kurdyka- Lojasiewicz inequality.

Horospheres in hyperbolic geometry

In this paper we investigate the role of horospheres in Integral Geometry and Differential Geometry. In particular we study envelopes of families of horocycles by means of “support maps”. We define invariant “linear combinations” of support maps or curves. Finally we obtain Gauss-Bonnet type formulas and Chern-Lashof type inequalities.

Continuity of set-valued maps revisited in the light of tame geometry

Continuity of set-valued maps is hereby revisited: after recalling some basic concepts of variational analysis and a short description of the State-of-the-Art, we obtain as by-product two Sard type results concerning local minima of scalar and vector valued functions. Our main result though, is inscribed in the framework of tame geometry, stating that a closed-valued semialgebraic set-valued map is almost everywhere continuous (in both topological and measure-theoretic sense). The result –depending on stratification techniques– holds true in a more general setting of o-minimal (or tame) set-valued maps. Some applications are briefly discussed at the end.

An objective anisotropic elastic plastic model and Algorithm applicable to bone mechanics

The implicit projection algorithm of isotropic plasticity is extended to an objective anisotropic elastic perfectly plastic model. The recursion formula developed to project the trial stress on the yield surface, is applicable to any non linear elastic law and any plastic yield function.A curvilinear transverse isotropic model based on a quadratic elastic potential and on Hill's quadratic yield criterion is then developed and implemented in a computer program for bone mechanics perspectives. The paper concludes with a numerical study of a schematic bone-prosthesis system to illustrate the potential of the model.

Geometry and physics of knots

KNOTS are usually categorized in terms of topological properties that are invariant under changes in a knot's spatial configuration(1-4). Here we approach knot identification from a different angle, by considering the properties of particular geometrical forms which we define as 'ideal'. For a knot with a given topology and assembled from a tube of uniform diameter, the ideal form is the geometrical configuration having the highest ratio of volume to surface area. Practically, this is equivalent to determining the shortest piece of tube that can be closed to form the knot. Because the notion of an ideal form is independent of absolute spatial scale, the length-to-diameter ratio of a tube providing an ideal representation is constant, irrespective of the tube's actual dimensions. We report the results of computer simulations which show that these ideal representations of knots have surprisingly simple geometrical properties. In particular, there is a simple linear relationship between the length-to-diameter ratio and the crossing number-the number of intersections in a two-dimensional projection of the knot averaged over all directions. We have also found that the average shape of knotted polymeric chains in thermal equilibrium is closely related to the ideal representation of the corresponding knot type. Our observations provide a link between ideal geometrical objects and the behaviour of seemingly disordered systems, and allow the prediction of properties of knotted polymers such as their electrophoretic mobility(5).

A numerical algorithm for finding solutions of a generalized Nash equilibrium problem

A family of nonempty closed convex sets is built by using the data of the Generalized Nash equilibrium problem (GNEP). The sets are selected iteratively such that the intersection of the selected sets contains solutions of the GNEP. The algorithm introduced by Iusem-Sosa (2003) is adapted to obtain solutions of the GNEP. Finally some numerical experiments are given to illustrate the numerical behavior of the algorithm.

An algorithm for semi-infinite polynomial optimization

"Vegeu el resum a l'inici del document del fitxer adjunt."

An approximation algorithm for #k-SAT

"Vegeu el resum a l'inici del document del fitxer adjunt"

Wing geometry as a tool for studying the Lutzomyia longipalpis (Diptera: Psychodidae) complex

Toro Toro (T) and Yungas (Y) have been described as genetically well differentiated populations of the Lutzomyia longipalpis (Lutz & Neiva, 1912) complex in Bolivia. Here we use geometric morphometrics to compare samples from these populations and new populations (Bolivia and Nicaragua), representing distant geographical origins, qualitative morphological variation ("one-spot" or "two-spots" phenotypes), ecologically distinct traits (peridomestic and silvatic populations), and possibly different epidemiological roles (transmitting or nor transmitting Leishmania chagasi). The Nicaragua (N) (Somotillo) sample was "one-spot" phenotype and a possible peridomestic vector. The Bolivian sample of the Y was also "one-spot" phenotype and a demonstrated peridomestic vector of visceral leishmaniasis (VL). The three remaining samples were silvatic, "two-spots" phenotypes. Two of them (Uyuni and T) were collected in the highlands of Bolivian where VL never has been reported. The last one (Robore, R) came from the lowlands of Bolivia, where human cases of VL are sporadically reported. The decomposition of metric variation into size and shape by geometric morphometric techniques suggests the existence of two groups (N/Y/R, and U/T). Several arguments indicate that such subdivision of Lu. longipalpis could correspond to different evolutionary units.

Geometry and physics of catenanes applied to the study of DNA replication.

The concept of ideal geometric configurations was recently applied to the classification and characterization of various knots. Different knots in their ideal form (i.e., the one requiring the shortest length of a constant-diameter tube to form a given knot) were shown to have an overall compactness proportional to the time-averaged compactness of thermally agitated knotted polymers forming corresponding knots. This was useful for predicting the relative speed of electrophoretic migration of different DNA knots. Here we characterize the ideal geometric configurations of catenanes (called links by mathematicians), i.e., closed curves in space that are topologically linked to each other. We demonstrate that the ideal configurations of different catenanes show interrelations very similar to those observed in the ideal configurations of knots. By analyzing literature data on electrophoretic separations of the torus-type of DNA catenanes with increasing complexity, we observed that their electrophoretic migration is roughly proportional to the overall compactness of ideal representations of the corresponding catenanes. This correlation does not apply, however, to electrophoretic migration of certain replication intermediates, believed up to now to represent the simplest torus-type catenanes. We propose, therefore, that freshly replicated circular DNA molecules, in addition to forming regular catenanes, may also form hemicatenanes.