Low Ply Drawings of Trees

We consider the recently introduced model of \emph{low ply graph drawing}, in which the ply-disks of the vertices do not have many common overlaps, which results in a good distribution of the vertices in the plane. The \emph{ply-disk} of a vertex in a straight-line drawing is the disk centered at it whose radius is half the length of its longest incident edge. The largest number of ply-disks having a common overlap is called the \emph{ply-number} of the drawing. We focus on trees. We first consider drawings of trees with constant ply-number, proving that they may require exponential area, even for stars, and that they may not even exist for bounded-degree trees. Then, we turn our attention to drawings with logarithmic ply-number and show that trees with maximum degree $6$ always admit such drawings in polynomial area.Comment: This is a complete access version of a paper that will appear in the proceedings of GD201

A Generalization of the Directed Graph Layering Problem

The Directed Layering Problem (DLP) solves a step of the widely used layer-based layout approach to automatically draw directed acyclic graphs. To cater for cyclic graphs, classically a preprocessing step is used that solves the Feedback Arc Set Problem (FASP)to make the graph acyclic before a layering is determined. Here, we present the Generalized Layering Problem (GLP) which solves the combination of DLP and FASP simultaneously, allowing general graphs as input. We show GLP to be NP- complete, present integer programming models to solve it, and perform thorough evaluations on different sets of graphs and with different implementations for the steps of the layer- based approach. We observe that GLP reduces the number of dummy nodes significantly, can produce more compact drawings and improves on graphs where DLP yields poor aspect ratios

Attachment-specific speech patterns induce dysphoric mood changes in the listener as a function of individual differences in attachment characteristics and psychopathology

Objectives Early childhood experiences influence cognitive-emotional development, with insecure attachment predisposing to potential psychopathologies. We investigated whether narratives containing attachment-specific speech patterns shape listeners’ emotional responses and social intentions. Design First, 149 healthy participants listened to three narratives characteristic for secure, insecure-preoccupied, and insecure-dismissing attachment. Following each narrative, the wellbeing and interpersonal reactivity as a particular aspect of emotional reactivity of the listener were assessed. Likewise, psychopathological aspects of personality were evaluated. A follow-up study compared 10 psychosomatic patients with a current depressive episode and/or personality disorder with distinct depressive symptoms and 10 age- and gender-matched healthy controls. Methods Effects of narratives on listeners’ mental state were tested with repeated-measures AN(C)OVA. Mediating effects in the listener (attachment characteristics in the context of personality traits) were explored. Narrative effects were compared between patients and controls. Results Listening to insecure attachment narratives reduced wellbeing in controls. Nevertheless, tendency for social interaction was highest following the insecure-preoccupied narrative. Importantly, listeners’ individual attachment characteristics mediated the relationship between wellbeing/interpersonal reactivity following the insecure-preoccupied narrative and levels of psychopathology. Furthermore, compared with healthy participants, patients showed higher emotional reactivity following exposure to the insecure-preoccupied narrative, represented by lower wellbeing and lower estimation of friendliness towards the narrator. Conclusions Exposure to attachment-specific speech patterns can result in dysphoric mood changes. Specifically, the insecure-preoccupied narrative influenced the listeners’ emotional state, which was further mediated by the individual attachment patterns and psychopathological personality characteristics. This deepens the understanding of interpersonal processes, especially in psychotherapeutic settings

Internal Transcribed Spacer 2 (nu ITS2 rRNA) Sequence-Structure Phylogenetics: Towards an Automated Reconstruction of the Green Algal Tree of Life

L). Some have advocated the use of the nuclear-encoded, internal transcribed spacer two (ITS2) as an alternative to the traditional chloroplast markers. However, the ITS2 is broadly perceived to be insufficiently conserved or to be confounded by introgression or biparental inheritance patterns, precluding its broad use in phylogenetic reconstruction or as a DNA barcode. A growing body of evidence has shown that simultaneous analysis of nucleotide data with secondary structure information can overcome at least some of the limitations of ITS2. The goal of this investigation was to assess the feasibility of an automated, sequence-structure approach for analysis of IT2 data from a large sampling of phylum Chlorophyta.Sequences and secondary structures from 591 chlorophycean, 741 trebouxiophycean and 938 ulvophycean algae, all obtained from the ITS2 Database, were aligned using a sequence structure-specific scoring matrix. Phylogenetic relationships were reconstructed by Profile Neighbor-Joining coupled with a sequence structure-specific, general time reversible substitution model. Results from analyses of the ITS2 data were robust at multiple nodes and showed considerable congruence with results from published phylogenetic analyses.Our observations on the power of automated, sequence-structure analyses of ITS2 to reconstruct phylum-level phylogenies of the green algae validate this approach to assessing diversity for large sets of chlorophytan taxa. Moreover, our results indicate that objections to the use of ITS2 for DNA barcoding should be weighed against the utility of an automated, data analysis approach with demonstrated power to reconstruct evolutionary patterns for highly divergent lineages

Nonlinear Integer Programming

Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject to integrality requirements for the variables. This chapter is dedicated to this topic. The primary goal is a study of a simple version of general nonlinear integer problems, where all constraints are still linear. Our focus is on the computational complexity of the problem, which varies significantly with the type of nonlinear objective function in combination with the underlying combinatorial structure. Numerous boundary cases of complexity emerge, which sometimes surprisingly lead even to polynomial time algorithms. We also cover recent successful approaches for more general classes of problems. Though no positive theoretical efficiency results are available, nor are they likely to ever be available, these seem to be the currently most successful and interesting approaches for solving practical problems. It is our belief that the study of algorithms motivated by theoretical considerations and those motivated by our desire to solve practical instances should and do inform one another. So it is with this viewpoint that we present the subject, and it is in this direction that we hope to spark further research.Comment: 57 pages. To appear in: M. J\"unger, T. Liebling, D. Naddef, G. Nemhauser, W. Pulleyblank, G. Reinelt, G. Rinaldi, and L. Wolsey (eds.), 50 Years of Integer Programming 1958--2008: The Early Years and State-of-the-Art Surveys, Springer-Verlag, 2009, ISBN 354068274

Error bounds for monomial convexification in polynomial optimization

Convex hulls of monomials have been widely studied in the literature, and monomial convexifications are implemented in global optimization software for relaxing polynomials. However, there has been no study of the error in the global optimum from such approaches. We give bounds on the worst-case error for convexifying a monomial over subsets of $[0,1]^n$. This implies additive error bounds for relaxing a polynomial optimization problem by convexifying each monomial separately. Our main error bounds depend primarily on the degree of the monomial, making them easy to compute. Since monomial convexification studies depend on the bounds on the associated variables, in the second part, we conduct an error analysis for a multilinear monomial over two different types of box constraints. As part of this analysis, we also derive the convex hull of a multilinear monomial over $[-1,1]^n$.Comment: 33 pages, 2 figures, to appear in journa

Catching-up and falling behind knowledge spillover from American to German machine tool makers

In our days, German machine tool makers accuse their Chinese competitors of violating patent rights and illegally imitating German technology. A century ago, however, German machine tool makers used exactly the same methods to imitate American technology. To understand the dynamics of this catching-up process we use patent statistics to analyze firms? activities between 1877 and 1932. We show that German machine tool makers successfully deployed imitating and counterfeiting activities in the late 19th century and the 1920s to catchup to their American competitors. The German administration supported this strategy by stipulating a patent law that discriminated against foreign patent holders and probably also by delaying the granting of patents to foreign applicants. Parallel to the growing international competitiveness of German firms, however, the willingness to guarantee intellectual property rights of foreigners was also increasing because German firms had now to fear retaliatory measures in their own export markets when violating foreign property rights within Germany