@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{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},
}
@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},
}
@article{6659,
abstract = {Chemical labeling of proteins with synthetic molecular probes offers the possibility to probe the functions of proteins of interest in living cells. However, the methods for covalently labeling targeted proteins using complementary peptide tag-probe pairs are still limited, irrespective of the versatility of such pairs in biological research. Herein, we report the new CysHis tag-Ni(II) probe pair for the specific covalent labeling of proteins. A broad-range evaluation of the reactivity profiles of the probe and the CysHis peptide tag afforded a tag-probe pair with an optimized and high labeling selectivity and reactivity. In particular, the labeling specificity of this pair was notably improved compared to the previously reported one. This pair was successfully utilized for the fluorescence imaging of membrane proteins on the surfaces of living cells, demonstrating its potential utility in biological research.},
author = {Zenmyo, Naoki and Tokumaru, Hiroki and Uchinomiya, Shohei and Fuchida, Hirokazu and Tabata, Shigekazu and Hamachi, Itaru and Shigemoto, Ryuichi and Ojida, Akio},
issn = {00092673},
journal = {Bulletin of the Chemical Society of Japan},
number = {5},
pages = {995--1000},
publisher = { Bulletin of the Chemical Society of Japan},
title = {{Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins}},
doi = {10.1246/bcsj.20190034},
volume = {92},
year = {2019},
}