@article{6596,
abstract = {It is well known that many problems in image recovery, signal processing, and machine learning can be modeled as finding zeros of the sum of maximal monotone and Lipschitz continuous monotone operators. Many papers have studied forward-backward splitting methods for finding zeros of the sum of two monotone operators in Hilbert spaces. Most of the proposed splitting methods in the literature have been proposed for the sum of maximal monotone and inverse-strongly monotone operators in Hilbert spaces. In this paper, we consider splitting methods for finding zeros of the sum of maximal monotone operators and Lipschitz continuous monotone operators in Banach spaces. We obtain weak and strong convergence results for the zeros of the sum of maximal monotone and Lipschitz continuous monotone operators in Banach spaces. Many already studied problems in the literature can be considered as special cases of this paper.},
author = {Shehu, Yekini},
issn = {1420-9012},
journal = {Results in Mathematics},
number = {4},
publisher = {Springer},
title = {{Convergence results of forward-backward algorithms for sum of monotone operators in Banach spaces}},
doi = {10.1007/s00025-019-1061-4},
volume = {74},
year = {2019},
}
@article{6609,
abstract = {Mechanical systems facilitate the development of a hybrid quantum technology comprising electrical, optical, atomic and acoustic degrees of freedom1, and entanglement is essential to realize quantum-enabled devices. Continuous-variable entangled fields—known as Einstein–Podolsky–Rosen (EPR) states—are spatially separated two-mode squeezed states that can be used for quantum teleportation and quantum communication2. In the optical domain, EPR states are typically generated using nondegenerate optical amplifiers3, and at microwave frequencies Josephson circuits can serve as a nonlinear medium4,5,6. An outstanding goal is to deterministically generate and distribute entangled states with a mechanical oscillator, which requires a carefully arranged balance between excitation, cooling and dissipation in an ultralow noise environment. Here we observe stationary emission of path-entangled microwave radiation from a parametrically driven 30-micrometre-long silicon nanostring oscillator, squeezing the joint field operators of two thermal modes by 3.40 decibels below the vacuum level. The motion of this micromechanical system correlates up to 50 photons per second per hertz, giving rise to a quantum discord that is robust with respect to microwave noise7. Such generalized quantum correlations of separable states are important for quantum-enhanced detection8 and provide direct evidence of the non-classical nature of the mechanical oscillator without directly measuring its state9. This noninvasive measurement scheme allows to infer information about otherwise inaccessible objects, with potential implications for sensing, open-system dynamics and fundamental tests of quantum gravity. In the future, similar on-chip devices could be used to entangle subsystems on very different energy scales, such as microwave and optical photons.},
author = {Barzanjeh, Shabir and Redchenko, Elena and Peruzzo, Matilda and Wulf, Matthias and Lewis, Dylan and Arnold, Georg M and Fink, Johannes M},
journal = {Nature},
pages = {480--483},
publisher = {Nature Publishing Group},
title = {{Stationary entangled radiation from micromechanical motion}},
doi = {10.1038/s41586-019-1320-2},
volume = {570},
year = {2019},
}
@article{6508,
author = {Shamipour, Shayan and Kardos, Roland and Xue, Shi-lei and Hof, Björn and Hannezo, Edouard B and Heisenberg, Carl-Philipp J},
issn = {10974172},
journal = {Cell},
number = {6},
pages = {1463--1479.e18},
publisher = {Elsevier},
title = {{Bulk actin dynamics drive phase segregation in zebrafish oocytes}},
doi = {10.1016/j.cell.2019.04.030},
volume = {177},
year = {2019},
}
@article{6515,
abstract = {We give non-degeneracy criteria for Riemannian simplices based on simplices in spaces of constant sectional curvature. It extends previous work on Riemannian simplices, where we developed Riemannian simplices with respect to Euclidean reference simplices. The criteria we give in this article are in terms of quality measures for spaces of constant curvature that we develop here. We see that simplices in spaces that have nearly constant curvature, are already non-degenerate under very weak quality demands. This is of importance because it allows for sampling of Riemannian manifolds based on anisotropy of the manifold and not (absolute) curvature.},
author = {Dyer, Ramsay and Vegter, Gert and Wintraecken, Mathijs},
issn = {1920-180X},
journal = {Journal of Computational Geometry },
number = {1},
pages = {223–256},
publisher = {Carleton University},
title = {{Simplices modelled on spaces of constant curvature}},
doi = {10.20382/jocg.v10i1a9},
volume = {10},
year = {2019},
}
@article{6611,
abstract = {Cell polarity is crucial for the coordinated development of all multicellular organisms. In plants, this is exemplified by the PIN-FORMED (PIN) efflux carriers of the phytohormone auxin: The polar subcellular localization of the PINs is instructive to the directional intercellular auxin transport, and thus to a plethora of auxin-regulated growth and developmental processes. Despite its importance, the regulation of PIN polar subcellular localization remains poorly understood. Here, we have employed advanced live-cell imaging techniques to study the roles of microtubules and actin microfilaments in the establishment of apical polar localization of PIN2 in the epidermis of the Arabidopsis root meristem. We report that apical PIN2 polarity requires neither intact actin microfilaments nor microtubules, suggesting that the primary spatial cue for polar PIN distribution is likely independent of cytoskeleton-guided endomembrane trafficking.},
author = {Glanc, Matous and Fendrych, Matyas and Friml, Jiří},
journal = {Biomolecules},
number = {6},
publisher = {MDPI},
title = {{PIN2 polarity establishment in arabidopsis in the absence of an intact cytoskeleton}},
doi = {10.3390/biom9060222},
volume = {9},
year = {2019},
}
@inproceedings{6628,
abstract = {Fejes Tóth [5] and Schneider [9] studied approximations of smooth convex hypersurfaces in Euclidean space by piecewise flat triangular meshes with a given number of vertices on the hypersurface that are optimal with respect to Hausdorff distance. They proved that this Hausdorff distance decreases inversely proportional with m 2/(d−1), where m is the number of vertices and d is the dimension of Euclidean space. Moreover the pro-portionality constant can be expressed in terms of the Gaussian curvature, an intrinsic quantity. In this short note, we prove the extrinsic nature of this constant for manifolds of sufficiently high codimension. We do so by constructing an family of isometric embeddings of the flat torus in Euclidean space.},
author = {Vegter, Gert and Wintraecken, Mathijs},
booktitle = {The 31st Canadian Conference in Computational Geometry},
location = {Edmonton, Canada},
pages = {275--279},
title = {{The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds}},
year = {2019},
}
@inproceedings{6642,
abstract = {We present a thermodynamically based approach to the design of models for viscoelastic fluids with stress diffusion effect. In particular, we show how to add a stress diffusion term to some standard viscoelastic rate-type models (Giesekus, FENE-P, Johnson–Segalman, Phan-Thien–Tanner and Bautista–Manero–Puig) so that the resulting models with the added stress diffusion term are thermodynamically consistent in the sense that they obey the first and the second law of thermodynamics. We point out the potential applications of the provided thermodynamical background in the study of flows of fluids described by the proposed models.},
author = {Dostalík, Mark and Průša, Vít and Skrivan, Tomas},
booktitle = {AIP Conference Proceedings},
location = {Zlin, Czech Republic},
publisher = {AIP},
title = {{On diffusive variants of some classical viscoelastic rate-type models}},
doi = {10.1063/1.5109493},
volume = {2107},
year = {2019},
}
@inproceedings{6647,
abstract = {The Tverberg theorem is one of the cornerstones of discrete geometry. It states that, given a set X of at least (d+1)(r-1)+1 points in R^d, one can find a partition X=X_1 cup ... cup X_r of X, such that the convex hulls of the X_i, i=1,...,r, all share a common point. In this paper, we prove a strengthening of this theorem that guarantees a partition which, in addition to the above, has the property that the boundaries of full-dimensional convex hulls have pairwise nonempty intersections. Possible generalizations and algorithmic aspects are also discussed. As a concrete application, we show that any n points in the plane in general position span floor[n/3] vertex-disjoint triangles that are pairwise crossing, meaning that their boundaries have pairwise nonempty intersections; this number is clearly best possible. A previous result of Alvarez-Rebollar et al. guarantees floor[n/6] pairwise crossing triangles. Our result generalizes to a result about simplices in R^d,d >=2.},
author = {Fulek, Radoslav and Gärtner, Bernd and Kupavskii, Andrey and Valtr, Pavel and Wagner, Uli},
booktitle = {35th International Symposium on Computational Geometry},
isbn = {9783959771047},
issn = {1868-8969},
location = {Portland, OR, United States},
pages = {38:1--38:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
title = {{The crossing Tverberg theorem}},
doi = {10.4230/LIPICS.SOCG.2019.38},
volume = {129},
year = {2019},
}
@article{6680,
abstract = {This paper analyzes how partial selfing in a large source population influences its ability to colonize a new habitat via the introduction of a few founder individuals. Founders experience inbreeding depression due to partially recessive deleterious alleles as well as maladaptation to the new environment due to selection on a large number of additive loci. I first introduce a simplified version of the Inbreeding History Model (Kelly, 2007) in order to characterize mutation‐selection balance in a large, partially selfing source population under selection involving multiple non‐identical loci. I then use individual‐based simulations to study the eco‐evolutionary dynamics of founders establishing in the new habitat under a model of hard selection. The study explores how selfing rate shapes establishment probabilities of founders via effects on both inbreeding depression and adaptability to the new environment, and also distinguishes the effects of selfing on the initial fitness of founders from its effects on the long‐term adaptive response of the populations they found. A high rate of (but not complete) selfing is found to aid establishment over a wide range of parameters, even in the absence of mate limitation. The sensitivity of the results to assumptions about the nature of polygenic selection are discussed.},
author = {Sachdeva, Himani},
issn = {1558-5646},
journal = {Evolution},
number = {9},
pages = {1729--1745},
publisher = {Wiley},
title = {{Effect of partial selfing and polygenic selection on establishment in a new habitat}},
doi = {10.1111/evo.13812},
volume = {73},
year = {2019},
}
@inproceedings{6673,
abstract = {Several classic problems in graph processing and computational geometry are solved via incremental algorithms, which split computation into a series of small tasks acting on shared state, which gets updated progressively. While the sequential variant of such algorithms usually specifies a fixed (but sometimes random) order in which the tasks should be performed, a standard approach to parallelizing such algorithms is to relax this constraint to allow for out-of-order parallel execution. This is the case for parallel implementations of Dijkstra's single-source shortest-paths (SSSP) algorithm, and for parallel Delaunay mesh triangulation. While many software frameworks parallelize incremental computation in this way, it is still not well understood whether this relaxed ordering approach can still provide any complexity guarantees. In this paper, we address this problem, and analyze the efficiency guarantees provided by a range of incremental algorithms when parallelized via relaxed schedulers. We show that, for algorithms such as Delaunay mesh triangulation and sorting by insertion, schedulers with a maximum relaxation factor of k in terms of the maximum priority inversion allowed will introduce a maximum amount of wasted work of O(łog n poly(k)), where n is the number of tasks to be executed. For SSSP, we show that the additional work is O(poly(k), dmax / wmin), where dmax is the maximum distance between two nodes, and wmin is the minimum such distance. In practical settings where n >> k, this suggests that the overheads of relaxation will be outweighed by the improved scalability of the relaxed scheduler. On the negative side, we provide lower bounds showing that certain algorithms will inherently incur a non-trivial amount of wasted work due to scheduler relaxation, even for relatively benign relaxed schedulers.},
author = {Alistarh, Dan-Adrian and Nadiradze, Giorgi and Koval, Nikita},
booktitle = {31st ACM Symposium on Parallelism in Algorithms and Architectures},
isbn = {9781450361842},
location = {Phoenix, AZ, United States},
pages = {145--154},
publisher = {ACM Press},
title = {{Efficiency guarantees for parallel incremental algorithms under relaxed schedulers}},
doi = {10.1145/3323165.3323201},
year = {2019},
}