@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},
}
@article{73,
abstract = {We consider the space of probability measures on a discrete set X, endowed with a dynamical optimal transport metric. Given two probability measures supported in a subset Y⊆X, it is natural to ask whether they can be connected by a constant speed geodesic with support in Y at all times. Our main result answers this question affirmatively, under a suitable geometric condition on Y introduced in this paper. The proof relies on an extension result for subsolutions to discrete Hamilton-Jacobi equations, which is of independent interest.},
author = {Erbar, Matthias and Maas, Jan and Wirth, Melchior},
issn = {09442669},
journal = {Calculus of Variations and Partial Differential Equations},
number = {1},
publisher = {Springer},
title = {{On the geometry of geodesics in discrete optimal transport}},
doi = {10.1007/s00526-018-1456-1},
volume = {58},
year = {2019},
}
@article{6755,
abstract = {Differentiated sex chromosomes are accompanied by a difference in gene dose between X/Z-specific and autosomal genes. At the transcriptomic level, these sex-linked genes can lead to expression imbalance, or gene dosage can be compensated by epigenetic mechanisms and results into expression level equalization. Schistosoma mansoni has been previously described as a ZW species (i.e., female heterogamety, in opposition to XY male heterogametic species) with a partial dosage compensation, but underlying mechanisms are still unexplored. Here, we combine transcriptomic (RNA-Seq) and epigenetic data (ChIP-Seq against H3K4me3, H3K27me3,andH4K20me1histonemarks) in free larval cercariae and intravertebrate parasitic stages. For the first time, we describe differences in dosage compensation status in ZW females, depending on the parasitic status: free cercariae display global dosage compensation, whereas intravertebrate stages show a partial dosage compensation. We also highlight regional differences of gene expression along the Z chromosome in cercariae, but not in the intravertebrate stages. Finally, we feature a consistent permissive chromatin landscape of the Z chromosome in both sexes and stages. We argue that dosage compensation in schistosomes is characterized by chromatin remodeling mechanisms in the Z-specific region.},
author = {Picard, Marion A L and Vicoso, Beatriz and Roquis, David and Bulla, Ingo and Augusto, Ronaldo C. and Arancibia, Nathalie and Grunau, Christoph and Boissier, Jérôme and Cosseau, Céline},
issn = {17596653},
journal = {Genome biology and evolution},
number = {7},
pages = {1909--1922},
publisher = {Oxford Academic Press},
title = {{Dosage compensation throughout the Schistosoma mansoni lifecycle: Specific chromatin landscape of the Z chromosome}},
doi = {10.1093/gbe/evz133},
volume = {11},
year = {2019},
}
@article{6762,
abstract = {We present and study novel optimal control problems motivated by the search for photovoltaic materials with high power-conversion efficiency. The material must perform the first step: convert light (photons) into electronic excitations. We formulate various desirable properties of the excitations as mathematical control goals at the Kohn-Sham-DFT level
of theory, with the control being given by the nuclear charge distribution. We prove that nuclear distributions exist which give rise to optimal HOMO-LUMO excitations, and present illustrative numerical simulations for 1D finite nanocrystals. We observe pronounced goal-dependent features such as large electron-hole separation, and a hierarchy of length scales: internal HOMO and LUMO wavelengths < atomic spacings < (irregular) fluctuations of the doping profiles < system size.},
author = {Friesecke, Gero and Kniely, Michael},
issn = {15403467},
journal = {Multiscale Modeling and Simulation},
number = {3},
pages = {926--947},
publisher = {SIAM},
title = {{New optimal control problems in density functional theory motivated by photovoltaics}},
doi = {10.1137/18M1207272},
volume = {17},
year = {2019},
}
@inproceedings{6490,
abstract = {Smart contracts are programs that are stored and executed on the Blockchain and can receive, manage and transfer money (cryptocurrency units). Two important problems regarding smart contracts are formal analysis and compiler optimization. Formal analysis is extremely important, because smart contracts hold funds worth billions of dollars and their code is immutable after deployment. Hence, an undetected bug can cause significant financial losses. Compiler optimization is also crucial, because every action of a smart contract has to be executed by every node in the Blockchain network. Therefore, optimizations in compiling smart contracts can lead to significant savings in computation, time and energy.
Two classical approaches in program analysis and compiler optimization are intraprocedural and interprocedural analysis. In intraprocedural analysis, each function is analyzed separately, while interprocedural analysis considers the entire program. In both cases, the analyses are usually reduced to graph problems over the control flow graph (CFG) of the program. These graph problems are often computationally expensive. Hence, there has been ample research on exploiting structural properties of CFGs for efficient algorithms. One such well-studied property is the treewidth, which is a measure of tree-likeness of graphs. It is known that intraprocedural CFGs of structured programs have treewidth at most 6, whereas the interprocedural treewidth cannot be bounded. This result has been used as a basis for many efficient intraprocedural analyses.
In this paper, we explore the idea of exploiting the treewidth of smart contracts for formal analysis and compiler optimization. First, similar to classical programs, we show that the intraprocedural treewidth of structured Solidity and Vyper smart contracts is at most 9. Second, for global analysis, we prove that the interprocedural treewidth of structured smart contracts is bounded by 10 and, in sharp contrast with classical programs, treewidth-based algorithms can be easily applied for interprocedural analysis. Finally, we supplement our theoretical results with experiments using a tool we implemented for computing treewidth of smart contracts and show that the treewidth is much lower in practice. We use 36,764 real-world Ethereum smart contracts as benchmarks and find that they have an average treewidth of at most 3.35 for the intraprocedural case and 3.65 for the interprocedural case.
},
author = {Chatterjee, Krishnendu and Goharshady, Amir Kafshdar and Goharshady, Ehsan Kafshdar},
booktitle = {Proceedings of the 34th ACM Symposium on Applied Computing},
isbn = {9781450359337},
location = {Limassol, Cyprus},
pages = {400--408},
publisher = {ACM},
title = {{The treewidth of smart contracts}},
doi = {10.1145/3297280.3297322},
volume = {Part F147772},
year = {2019},
}
@article{6786,
abstract = {Dipolar coupling plays a fundamental role in the interaction between electrically or magnetically polarized species such as magnetic atoms and dipolar molecules in a gas or dipolar excitons in the solid state. Unlike Coulomb or contactlike interactions found in many atomic, molecular, and condensed-matter systems, this interaction is long-ranged and highly anisotropic, as it changes from repulsive to attractive depending on the relative positions and orientation of the dipoles. Because of this unique property, many exotic, symmetry-breaking collective states have been recently predicted for cold dipolar gases, but only a few have been experimentally detected and only in dilute atomic dipolar Bose-Einstein condensates. Here, we report on the first observation of attractive dipolar coupling between excitonic dipoles using a new design of stacked semiconductor bilayers. We show that the presence of a dipolar exciton fluid in one bilayer modifies the spatial distribution and increases the binding energy of excitonic dipoles in a vertically remote layer. The binding energy changes are explained using a many-body polaron model describing the deformation of the exciton cloud due to its interaction with a remote dipolar exciton. The surprising nonmonotonic dependence on the cloud density indicates the important role of dipolar correlations, which is unique to dense, strongly interacting dipolar solid-state systems. Our concept provides a route for the realization of dipolar lattices with strong anisotropic interactions in semiconductor systems, which open the way for the observation of theoretically predicted new and exotic collective phases, as well as for engineering and sensing their collective excitations.},
author = {Hubert, Colin and Baruchi, Yifat and Mazuz-Harpaz, Yotam and Cohen, Kobi and Biermann, Klaus and Lemeshko, Mikhail and West, Ken and Pfeiffer, Loren and Rapaport, Ronen and Santos, Paulo},
issn = {2160-3308},
journal = {Physical Review X},
number = {2},
publisher = {APS},
title = {{Attractive dipolar coupling between stacked exciton fluids}},
doi = {10.1103/PhysRevX.9.021026},
volume = {9},
year = {2019},
}