@article{9630, abstract = {Various kinds of data are routinely represented as discrete probability distributions. Examples include text documents summarized by histograms of word occurrences and images represented as histograms of oriented gradients. Viewing a discrete probability distribution as a point in the standard simplex of the appropriate dimension, we can understand collections of such objects in geometric and topological terms. Importantly, instead of using the standard Euclidean distance, we look into dissimilarity measures with information-theoretic justification, and we develop the theory needed for applying topological data analysis in this setting. In doing so, we emphasize constructions that enable the usage of existing computational topology software in this context.}, author = {Edelsbrunner, Herbert and Virk, Ziga and Wagner, Hubert}, issn = {1920180X}, journal = {Journal of Computational Geometry}, number = {2}, pages = {162--182}, publisher = {Carleton University}, title = {{Topological data analysis in information space}}, doi = {10.20382/jocg.v11i2a7}, volume = {11}, year = {2020}, } @inproceedings{9631, abstract = {The ability to leverage large-scale hardware parallelism has been one of the key enablers of the accelerated recent progress in machine learning. Consequently, there has been considerable effort invested into developing efficient parallel variants of classic machine learning algorithms. However, despite the wealth of knowledge on parallelization, some classic machine learning algorithms often prove hard to parallelize efficiently while maintaining convergence. In this paper, we focus on efficient parallel algorithms for the key machine learning task of inference on graphical models, in particular on the fundamental belief propagation algorithm. We address the challenge of efficiently parallelizing this classic paradigm by showing how to leverage scalable relaxed schedulers in this context. We present an extensive empirical study, showing that our approach outperforms previous parallel belief propagation implementations both in terms of scalability and in terms of wall-clock convergence time, on a range of practical applications.}, author = {Aksenov, Vitaly and Alistarh, Dan-Adrian and Korhonen, Janne}, booktitle = {Advances in Neural Information Processing Systems}, isbn = {9781713829546}, issn = {10495258}, location = {Vancouver, Canada}, pages = {22361--22372}, publisher = {Curran Associates}, title = {{Scalable belief propagation via relaxed scheduling}}, volume = {33}, year = {2020}, } @inproceedings{8533, abstract = {Game of Life is a simple and elegant model to study dynamical system over networks. The model consists of a graph where every vertex has one of two types, namely, dead or alive. A configuration is a mapping of the vertices to the types. An update rule describes how the type of a vertex is updated given the types of its neighbors. In every round, all vertices are updated synchronously, which leads to a configuration update. While in general, Game of Life allows a broad range of update rules, we focus on two simple families of update rules, namely, underpopulation and overpopulation, that model several interesting dynamics studied in the literature. In both settings, a dead vertex requires at least a desired number of live neighbors to become alive. For underpopulation (resp., overpopulation), a live vertex requires at least (resp. at most) a desired number of live neighbors to remain alive. We study the basic computation problems, e.g., configuration reachability, for these two families of rules. For underpopulation rules, we show that these problems can be solved in polynomial time, whereas for overpopulation rules they are PSPACE-complete.}, author = {Chatterjee, Krishnendu and Ibsen-Jensen, Rasmus and Jecker, Ismael R and Svoboda, Jakub}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science}, isbn = {9783959771597}, issn = {18688969}, location = {Prague, Czech Republic}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Simplified game of life: Algorithms and complexity}}, doi = {10.4230/LIPIcs.MFCS.2020.22}, volume = {170}, year = {2020}, } @inproceedings{8534, abstract = {A regular language L of finite words is composite if there are regular languages L₁,L₂,…,L_t such that L = ⋂_{i = 1}^t L_i and the index (number of states in a minimal DFA) of every language L_i is strictly smaller than the index of L. Otherwise, L is prime. Primality of regular languages was introduced and studied in [O. Kupferman and J. Mosheiff, 2015], where the complexity of deciding the primality of the language of a given DFA was left open, with a doubly-exponential gap between the upper and lower bounds. We study primality for unary regular languages, namely regular languages with a singleton alphabet. A unary language corresponds to a subset of ℕ, making the study of unary prime languages closer to that of primality in number theory. We show that the setting of languages is richer. In particular, while every composite number is the product of two smaller numbers, the number t of languages necessary to decompose a composite unary language induces a strict hierarchy. In addition, a primality witness for a unary language L, namely a word that is not in L but is in all products of languages that contain L and have an index smaller than L’s, may be of exponential length. Still, we are able to characterize compositionality by structural properties of a DFA for L, leading to a LogSpace algorithm for primality checking of unary DFAs.}, author = {Jecker, Ismael R and Kupferman, Orna and Mazzocchi, Nicolas}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science}, isbn = {9783959771597}, issn = {18688969}, location = {Prague, Czech Republic}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Unary prime languages}}, doi = {10.4230/LIPIcs.MFCS.2020.51}, volume = {170}, year = {2020}, } @article{8538, abstract = {We prove some recent experimental observations of Dan Reznik concerning periodic billiard orbits in ellipses. For example, the sum of cosines of the angles of a periodic billiard polygon remains constant in the 1-parameter family of such polygons (that exist due to the Poncelet porism). In our proofs, we use geometric and complex analytic methods.}, author = {Akopyan, Arseniy and Schwartz, Richard and Tabachnikov, Serge}, issn = {2199-6768}, journal = {European Journal of Mathematics}, publisher = {Springer Nature}, title = {{Billiards in ellipses revisited}}, doi = {10.1007/s40879-020-00426-9}, year = {2020}, } @unpublished{8616, abstract = {The brain vasculature supplies neurons with glucose and oxygen, but little is known about how vascular plasticity contributes to brain function. Using longitudinal in vivo imaging, we reported that a substantial proportion of blood vessels in the adult brain sporadically occluded and regressed. Their regression proceeded through sequential stages of blood-flow occlusion, endothelial cell collapse, relocation or loss of pericytes, and retraction of glial endfeet. Regressing vessels were found to be widespread in mouse, monkey and human brains. Both brief occlusions of the middle cerebral artery and lipopolysaccharide-mediated inflammation induced an increase of vessel regression. Blockage of leukocyte adhesion to endothelial cells alleviated LPS-induced vessel regression. We further revealed that blood vessel regression caused a reduction of neuronal activity due to a dysfunction in mitochondrial metabolism and glutamate production. Our results elucidate the mechanism of vessel regression and its role in neuronal function in the adult brain.}, author = {Gao, Xiaofei and Li, Jun-Liszt and Chen, Xingjun and Ci, Bo and Chen, Fei and Lu, Nannan and Shen, Bo and Zheng, Lijun and Jia, Jie-Min and Yi, Yating and Zhang, Shiwen and Shi, Ying-Chao and Shi, Kaibin and Propson, Nicholas E and Huang, Yubin and Poinsatte, Katherine and Zhang, Zhaohuan and Yue, Yuanlei and Bosco, Dale B and Lu, Ying-mei and Yang, Shi-bing and Adams, Ralf H. and Lindner, Volkhard and Huang, Fen and Wu, Long-Jun and Zheng, Hui and Han, Feng and Hippenmeyer, Simon and Stowe, Ann M. and Peng, Bo and Margeta, Marta and Wang, Xiaoqun and Liu, Qiang and Körbelin, Jakob and Trepel, Martin and Lu, Hui and Zhou, Bo O. and Zhao, Hu and Su, Wenzhi and Bachoo, Robert M. and Ge, Woo-ping}, booktitle = {bioRxiv}, publisher = {Cold Spring Harbor Laboratory}, title = {{Reduction of neuronal activity mediated by blood-vessel regression in the brain}}, doi = {10.1101/2020.09.15.262782}, year = {2020}, } @techreport{8695, abstract = {A look at international activities on Open Science reveals a broad spectrum from individual institutional policies to national action plans. The present Recommendations for a National Open Science Strategy in Austria are based on these international initiatives and present practical considerations for their coordinated implementation with regard to strategic developments in research, technology and innovation (RTI) in Austria until 2030. They are addressed to all relevant actors in the RTI system, in particular to Research Performing Organisations, Research Funding Organisations, Research Policy, memory institutions such as Libraries and Researchers. The recommendation paper was developed from 2018 to 2020 by the OANA working group "Open Science Strategy" and published for the first time in spring 2020 for a public consultation. The now available final version of the recommendation document, which contains feedback and comments from the consultation, is intended to provide an impetus for further discussion and implementation of Open Science in Austria and serves as a contribution and basis for a potential national Open Science Strategy in Austria. The document builds on the diverse expertise of the authors (academia, administration, library and archive, information technology, science policy, funding system, etc.) and reflects their personal experiences and opinions.}, author = {Mayer, Katja and Rieck, Katharina and Reichmann, Stefan and Danowski, Patrick and Graschopf, Anton and König, Thomas and Kraker, Peter and Lehner, Patrick and Reckling, Falk and Ross-Hellauer, Tony and Spichtinger, Daniel and Tzatzanis, Michalis and Schürz, Stefanie}, pages = {36}, publisher = {OANA}, title = {{Empfehlungen für eine nationale Open Science Strategie in Österreich / Recommendations for a National Open Science Strategy in Austria}}, doi = {10.5281/ZENODO.4109242}, year = {2020}, } @article{8706, abstract = {As part of the Austrian Transition to Open Access (AT2OA) project, subproject TP1-B is working on designing a monitoring solution for the output of Open Access publications in Austria. This report on a potential Open Access monitoring approach in Austria is one of the results of these efforts and can serve as a basis for discussion on an international level.}, author = {Danowski, Patrick and Ferus, Andreas and Hikl, Anna-Laetitia and McNeill, Gerda and Miniberger, Clemens and Reding, Steve and Zarka, Tobias and Zojer, Michael}, issn = {10222588}, journal = {Mitteilungen der Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare}, number = {2}, pages = {278--284}, publisher = {Vereinigung Osterreichischer Bibliothekarinnen und Bibliothekare}, title = {{„Recommendation“ for the further procedure for open access monitoring. Deliverable of the AT2OA subproject TP1-B}}, doi = {10.31263/voebm.v73i2.3941}, volume = {73}, year = {2020}, } @article{8978, abstract = {Mosaic analysis with double markers (MADM) technology enables concomitant fluorescent cell labeling and induction of uniparental chromosome disomy (UPD) with single-cell resolution. In UPD, imprinted genes are either overexpressed 2-fold or are not expressed. Here, the MADM platform is utilized to probe imprinting phenotypes at the transcriptional level. This protocol highlights major steps for the generation and isolation of projection neurons and astrocytes with MADM-induced UPD from mouse cerebral cortex for downstream single-cell and low-input sample RNA-sequencing experiments. For complete details on the use and execution of this protocol, please refer to Laukoter et al. (2020b).}, author = {Laukoter, Susanne and Amberg, Nicole and Pauler, Florian and Hippenmeyer, Simon}, issn = {2666-1667}, journal = {STAR Protocols}, number = {3}, publisher = {Elsevier}, title = {{Generation and isolation of single cells from mouse brain with mosaic analysis with double markers-induced uniparental chromosome disomy}}, doi = {10.1016/j.xpro.2020.100215}, volume = {1}, year = {2020}, } @inproceedings{9103, abstract = {We introduce LRT-NG, a set of techniques and an associated toolset that computes a reachtube (an over-approximation of the set of reachable states over a given time horizon) of a nonlinear dynamical system. LRT-NG significantly advances the state-of-the-art Langrangian Reachability and its associated tool LRT. From a theoretical perspective, LRT-NG is superior to LRT in three ways. First, it uses for the first time an analytically computed metric for the propagated ball which is proven to minimize the ball’s volume. We emphasize that the metric computation is the centerpiece of all bloating-based techniques. Secondly, it computes the next reachset as the intersection of two balls: one based on the Cartesian metric and the other on the new metric. While the two metrics were previously considered opposing approaches, their joint use considerably tightens the reachtubes. Thirdly, it avoids the "wrapping effect" associated with the validated integration of the center of the reachset, by optimally absorbing the interval approximation in the radius of the next ball. From a tool-development perspective, LRT-NG is superior to LRT in two ways. First, it is a standalone tool that no longer relies on CAPD. This required the implementation of the Lohner method and a Runge-Kutta time-propagation method. Secondly, it has an improved interface, allowing the input model and initial conditions to be provided as external input files. Our experiments on a comprehensive set of benchmarks, including two Neural ODEs, demonstrates LRT-NG’s superior performance compared to LRT, CAPD, and Flow*.}, author = {Gruenbacher, Sophie and Cyranka, Jacek and Lechner, Mathias and Islam, Md Ariful and Smolka, Scott A. and Grosu, Radu}, booktitle = {Proceedings of the 59th IEEE Conference on Decision and Control}, isbn = {9781728174471}, issn = {07431546}, location = {Jeju Islang, Korea (South)}, pages = {1556--1563}, publisher = {IEEE}, title = {{Lagrangian reachtubes: The next generation}}, doi = {10.1109/CDC42340.2020.9304042}, volume = {2020}, year = {2020}, } @article{9208, abstract = {Bending-active structures are able to efficiently produce complex curved shapes from flat panels. The desired deformation of the panels derives from the proper selection of their elastic properties. Optimized panels, called FlexMaps, are designed such that, once they are bent and assembled, the resulting static equilibrium configuration matches a desired input 3D shape. The FlexMaps elastic properties are controlled by locally varying spiraling geometric mesostructures, which are optimized in size and shape to match specific bending requests, namely the global curvature of the target shape. The design pipeline starts from a quad mesh representing the input 3D shape, which defines the edge size and the total amount of spirals: every quad will embed one spiral. Then, an optimization algorithm tunes the geometry of the spirals by using a simplified pre-computed rod model. This rod model is derived from a non-linear regression algorithm which approximates the non-linear behavior of solid FEM spiral models subject to hundreds of load combinations. This innovative pipeline has been applied to the project of a lightweight plywood pavilion named FlexMaps Pavilion, which is a single-layer piecewise twisted arch that fits a bounding box of 3.90x3.96x3.25 meters. This case study serves to test the applicability of this methodology at the architectural scale. The structure is validated via FE analyses and the fabrication of the full scale prototype.}, author = {Laccone, Francesco and Malomo, Luigi and Perez Rodriguez, Jesus and Pietroni, Nico and Ponchio, Federico and Bickel, Bernd and Cignoni, Paolo}, issn = {25233971}, journal = {SN Applied Sciences}, number = {9}, publisher = {Springer Nature}, title = {{A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion}}, doi = {10.1007/s42452-020-03305-w}, volume = {2}, year = {2020}, } @inproceedings{9221, abstract = {Recent works have shown that gradient descent can find a global minimum for over-parameterized neural networks where the widths of all the hidden layers scale polynomially with N (N being the number of training samples). In this paper, we prove that, for deep networks, a single layer of width N following the input layer suffices to ensure a similar guarantee. In particular, all the remaining layers are allowed to have constant widths, and form a pyramidal topology. We show an application of our result to the widely used LeCun’s initialization and obtain an over-parameterization requirement for the single wide layer of order N2. }, author = {Nguyen, Quynh and Mondelli, Marco}, booktitle = {34th Conference on Neural Information Processing Systems}, location = {Vancouver, Canada}, pages = {11961–11972}, publisher = {Curran Associates}, title = {{Global convergence of deep networks with one wide layer followed by pyramidal topology}}, volume = {33}, year = {2020}, } @inproceedings{9415, abstract = {Optimizing convolutional neural networks for fast inference has recently become an extremely active area of research. One of the go-to solutions in this context is weight pruning, which aims to reduce computational and memory footprint by removing large subsets of the connections in a neural network. Surprisingly, much less attention has been given to exploiting sparsity in the activation maps, which tend to be naturally sparse in many settings thanks to the structure of rectified linear (ReLU) activation functions. In this paper, we present an in-depth analysis of methods for maximizing the sparsity of the activations in a trained neural network, and show that, when coupled with an efficient sparse-input convolution algorithm, we can leverage this sparsity for significant performance gains. To induce highly sparse activation maps without accuracy loss, we introduce a new regularization technique, coupled with a new threshold-based sparsification method based on a parameterized activation function called Forced-Activation-Threshold Rectified Linear Unit (FATReLU). We examine the impact of our methods on popular image classification models, showing that most architectures can adapt to significantly sparser activation maps without any accuracy loss. Our second contribution is showing that these these compression gains can be translated into inference speedups: we provide a new algorithm to enable fast convolution operations over networks with sparse activations, and show that it can enable significant speedups for end-to-end inference on a range of popular models on the large-scale ImageNet image classification task on modern Intel CPUs, with little or no retraining cost. }, author = {Kurtz, Mark and Kopinsky, Justin and Gelashvili, Rati and Matveev, Alexander and Carr, John and Goin, Michael and Leiserson, William and Moore, Sage and Nell, Bill and Shavit, Nir and Alistarh, Dan-Adrian}, booktitle = {37th International Conference on Machine Learning, ICML 2020}, issn = {2640-3498}, location = {Online}, pages = {5533--5543}, title = {{Inducing and exploiting activation sparsity for fast neural network inference}}, volume = {119}, year = {2020}, } @inproceedings{10672, abstract = {The family of feedback alignment (FA) algorithms aims to provide a more biologically motivated alternative to backpropagation (BP), by substituting the computations that are unrealistic to be implemented in physical brains. While FA algorithms have been shown to work well in practice, there is a lack of rigorous theory proofing their learning capabilities. Here we introduce the first feedback alignment algorithm with provable learning guarantees. In contrast to existing work, we do not require any assumption about the size or depth of the network except that it has a single output neuron, i.e., such as for binary classification tasks. We show that our FA algorithm can deliver its theoretical promises in practice, surpassing the learning performance of existing FA methods and matching backpropagation in binary classification tasks. Finally, we demonstrate the limits of our FA variant when the number of output neurons grows beyond a certain quantity.}, author = {Lechner, Mathias}, booktitle = {8th International Conference on Learning Representations}, location = {Virtual ; Addis Ababa, Ethiopia}, publisher = {ICLR}, title = {{Learning representations for binary-classification without backpropagation}}, year = {2020}, } @inproceedings{8188, abstract = {A natural approach to generative modeling of videos is to represent them as a composition of moving objects. Recent works model a set of 2D sprites over a slowly-varying background, but without considering the underlying 3D scene that gives rise to them. We instead propose to model a video as the view seen while moving through a scene with multiple 3D objects and a 3D background. Our model is trained from monocular videos without any supervision, yet learns to generate coherent 3D scenes containing several moving objects. We conduct detailed experiments on two datasets, going beyond the visual complexity supported by state-of-the-art generative approaches. We evaluate our method on depth-prediction and 3D object detection---tasks which cannot be addressed by those earlier works---and show it out-performs them even on 2D instance segmentation and tracking.}, author = {Henderson, Paul M and Lampert, Christoph}, booktitle = {34th Conference on Neural Information Processing Systems}, isbn = {9781713829546}, location = {Vancouver, Canada}, pages = {3106–3117}, publisher = {Curran Associates}, title = {{Unsupervised object-centric video generation and decomposition in 3D}}, volume = {33}, year = {2020}, } @book{7474, abstract = {This booklet is a collection of abstracts presented at the AHPC conference.}, editor = {Schlögl, Alois and Kiss, Janos and Elefante, Stefano}, isbn = {978-3-99078-004-6}, location = {Klosterneuburg, Austria}, pages = {72}, publisher = {IST Austria}, title = {{Austrian High-Performance-Computing meeting (AHPC2020)}}, doi = {10.15479/AT:ISTA:7474}, year = {2020}, } @inproceedings{7808, abstract = {Quantization converts neural networks into low-bit fixed-point computations which can be carried out by efficient integer-only hardware, and is standard practice for the deployment of neural networks on real-time embedded devices. However, like their real-numbered counterpart, quantized networks are not immune to malicious misclassification caused by adversarial attacks. We investigate how quantization affects a network’s robustness to adversarial attacks, which is a formal verification question. We show that neither robustness nor non-robustness are monotonic with changing the number of bits for the representation and, also, neither are preserved by quantization from a real-numbered network. For this reason, we introduce a verification method for quantized neural networks which, using SMT solving over bit-vectors, accounts for their exact, bit-precise semantics. We built a tool and analyzed the effect of quantization on a classifier for the MNIST dataset. We demonstrate that, compared to our method, existing methods for the analysis of real-numbered networks often derive false conclusions about their quantizations, both when determining robustness and when detecting attacks, and that existing methods for quantized networks often miss attacks. Furthermore, we applied our method beyond robustness, showing how the number of bits in quantization enlarges the gender bias of a predictor for students’ grades.}, author = {Giacobbe, Mirco and Henzinger, Thomas A and Lechner, Mathias}, booktitle = {International Conference on Tools and Algorithms for the Construction and Analysis of Systems}, isbn = {9783030452360}, issn = {16113349}, location = {Dublin, Ireland}, pages = {79--97}, publisher = {Springer Nature}, title = {{How many bits does it take to quantize your neural network?}}, doi = {10.1007/978-3-030-45237-7_5}, volume = {12079}, year = {2020}, } @inproceedings{7952, abstract = {Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. manifolds defined as the zero set of some multivariate vector-valued smooth function f: ℝ^d → ℝ^(d-n). A natural (and efficient) way to approximate an isomanifold is to consider its Piecewise-Linear (PL) approximation based on a triangulation 𝒯 of the ambient space ℝ^d. In this paper, we give conditions under which the PL-approximation of an isomanifold is topologically equivalent to the isomanifold. The conditions are easy to satisfy in the sense that they can always be met by taking a sufficiently fine triangulation 𝒯. This contrasts with previous results on the triangulation of manifolds where, in arbitrary dimensions, delicate perturbations are needed to guarantee topological correctness, which leads to strong limitations in practice. We further give a bound on the Fréchet distance between the original isomanifold and its PL-approximation. Finally we show analogous results for the PL-approximation of an isomanifold with boundary. }, author = {Boissonnat, Jean-Daniel and Wintraecken, Mathijs}, booktitle = {36th International Symposium on Computational Geometry}, isbn = {978-3-95977-143-6}, issn = {1868-8969}, location = {Zürich, Switzerland}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{The topological correctness of PL-approximations of isomanifolds}}, doi = {10.4230/LIPIcs.SoCG.2020.20}, volume = {164}, year = {2020}, } @inproceedings{7990, abstract = {Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation on P is a full triangulation of some subset P' of P containing all extreme points in P. A bistellar flip on a partial triangulation either flips an edge, removes a non-extreme point of degree 3, or adds a point in P ⧵ P' as vertex of degree 3. The bistellar flip graph has all partial triangulations as vertices, and a pair of partial triangulations is adjacent if they can be obtained from one another by a bistellar flip. The goal of this paper is to investigate the structure of this graph, with emphasis on its connectivity. For sets P of n points in general position, we show that the bistellar flip graph is (n-3)-connected, thereby answering, for sets in general position, an open questions raised in a book (by De Loera, Rambau, and Santos) and a survey (by Lee and Santos) on triangulations. This matches the situation for the subfamily of regular triangulations (i.e., partial triangulations obtained by lifting the points and projecting the lower convex hull), where (n-3)-connectivity has been known since the late 1980s through the secondary polytope (Gelfand, Kapranov, Zelevinsky) and Balinski’s Theorem. Our methods also yield the following results (see the full version [Wagner and Welzl, 2020]): (i) The bistellar flip graph can be covered by graphs of polytopes of dimension n-3 (products of secondary polytopes). (ii) A partial triangulation is regular, if it has distance n-3 in the Hasse diagram of the partial order of partial subdivisions from the trivial subdivision. (iii) All partial triangulations are regular iff the trivial subdivision has height n-3 in the partial order of partial subdivisions. (iv) There are arbitrarily large sets P with non-regular partial triangulations, while every proper subset has only regular triangulations, i.e., there are no small certificates for the existence of non-regular partial triangulations (answering a question by F. Santos in the unexpected direction).}, author = {Wagner, Uli and Welzl, Emo}, booktitle = {36th International Symposium on Computational Geometry}, isbn = {9783959771436}, issn = {18688969}, location = {Zürich, Switzerland}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips)}}, doi = {10.4230/LIPIcs.SoCG.2020.67}, volume = {164}, year = {2020}, } @inproceedings{7807, abstract = {In a straight-line embedded triangulation of a point set P in the plane, removing an inner edge and—provided the resulting quadrilateral is convex—adding the other diagonal is called an edge flip. The (edge) flip graph has all triangulations as vertices, and a pair of triangulations is adjacent if they can be obtained from each other by an edge flip. The goal of this paper is to contribute to a better understanding of the flip graph, with an emphasis on its connectivity. For sets in general position, it is known that every triangulation allows at least edge flips (a tight bound) which gives the minimum degree of any flip graph for n points. We show that for every point set P in general position, the flip graph is at least -vertex connected. Somewhat more strongly, we show that the vertex connectivity equals the minimum degree occurring in the flip graph, i.e. the minimum number of flippable edges in any triangulation of P, provided P is large enough. Finally, we exhibit some of the geometry of the flip graph by showing that the flip graph can be covered by 1-skeletons of polytopes of dimension (products of associahedra). A corresponding result ((n – 3)-vertex connectedness) can be shown for the bistellar flip graph of partial triangulations, i.e. the set of all triangulations of subsets of P which contain all extreme points of P. This will be treated separately in a second part.}, author = {Wagner, Uli and Welzl, Emo}, booktitle = {Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms}, isbn = {9781611975994}, location = {Salt Lake City, UT, United States}, pages = {2823--2841}, publisher = {SIAM}, title = {{Connectivity of triangulation flip graphs in the plane (Part I: Edge flips)}}, doi = {10.1137/1.9781611975994.172}, volume = {2020-January}, year = {2020}, } @misc{13073, abstract = {The Mytilus complex of marine mussel species forms a mosaic of hybrid zones, found across temperate regions of the globe. This allows us to study "replicated" instances of secondary contact between closely-related species. Previous work on this complex has shown that local introgression is both widespread and highly heterogeneous, and has identified SNPs that are outliers of differentiation between lineages. Here, we developed an ancestry-informative panel of such SNPs. We then compared their frequencies in newly-sampled populations, including samples from within the hybrid zones, and parental populations at different distances from the contact. Results show that close to the hybrid zones, some outlier loci are near to fixation for the heterospecific allele, suggesting enhanced local introgression, or the local sweep of a shared ancestral allele. Conversely, genomic cline analyses, treating local parental populations as the reference, reveal a globally high concordance among loci, albeit with a few signals of asymmetric introgression. Enhanced local introgression at specific loci is consistent with the early transfer of adaptive variants after contact, possibly including asymmetric bi-stable variants (Dobzhansky-Muller incompatibilities), or haplotypes loaded with fewer deleterious mutations. Having escaped one barrier, however, these variants can be trapped or delayed at the next barrier, confining the introgression locally. These results shed light on the decay of species barriers during phases of contact.}, author = {Simon, Alexis and Fraisse, Christelle and El Ayari, Tahani and Liautard-Haag, Cathy and Strelkov, Petr and Welch, John and Bierne, Nicolas}, publisher = {Dryad}, title = {{How do species barriers decay? concordance and local introgression in mosaic hybrid zones of mussels}}, doi = {10.5061/DRYAD.R4XGXD29N}, year = {2020}, } @misc{13065, abstract = {Domestication is a human-induced selection process that imprints the genomes of domesticated populations over a short evolutionary time scale, and that occurs in a given demographic context. Reconstructing historical gene flow, effective population size changes and their timing is therefore of fundamental interest to understand how plant demography and human selection jointly shape genomic divergence during domestication. Yet, the comparison under a single statistical framework of independent domestication histories across different crop species has been little evaluated so far. Thus, it is unclear whether domestication leads to convergent demographic changes that similarly affect crop genomes. To address this question, we used existing and new transcriptome data on three crop species of Solanaceae (eggplant, pepper and tomato), together with their close wild relatives. We fitted twelve demographic models of increasing complexity on the unfolded joint allele frequency spectrum for each wild/crop pair, and we found evidence for both shared and species-specific demographic processes between species. A convergent history of domestication with gene-flow was inferred for all three species, along with evidence of strong reduction in the effective population size during the cultivation stage of tomato and pepper. The absence of any reduction in size of the crop in eggplant stands out from the classical view of the domestication process; as does the existence of a “protracted period” of management before cultivation. Our results also suggest divergent management strategies of modern cultivars among species as their current demography substantially differs. Finally, the timing of domestication is species-specific and supported by the few historical records available.}, author = {Arnoux, Stephanie and Fraisse, Christelle and Sauvage, Christopher}, publisher = {Dryad}, title = {{VCF files of synonymous SNPs related to: Genomic inference of complex domestication histories in three Solanaceae species}}, doi = {10.5061/DRYAD.Q2BVQ83HD}, year = {2020}, } @inproceedings{8536, abstract = {This work analyzes the latency of the simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It is shown that, unlike conventional successive cancellation decoding, where latency is linear in the block length, the latency of SSC decoding is sublinear. More specifically, the latency of SSC decoding is O(N 1−1/µ ), where N is the block length and µ is the scaling exponent of the channel, which captures the speed of convergence of the rate to capacity. Numerical results demonstrate the tightness of the bound and show that most of the latency reduction arises from the parallel decoding of subcodes of rate 0 and 1.}, author = {Mondelli, Marco and Hashemi, Seyyed Ali and Cioffi, John and Goldsmith, Andrea}, booktitle = {IEEE International Symposium on Information Theory - Proceedings}, isbn = {9781728164328}, issn = {21578095}, location = {Los Angeles, CA, United States}, publisher = {IEEE}, title = {{Simplified successive cancellation decoding of polar codes has sublinear latency}}, doi = {10.1109/ISIT44484.2020.9174141}, volume = {2020-June}, year = {2020}, } @article{9308, author = {Avvakumov, Sergey and Wagner, Uli and Mabillard, Isaac and Skopenkov, A. B.}, issn = {0036-0279}, journal = {Russian Mathematical Surveys}, number = {6}, pages = {1156--1158}, publisher = {IOP Publishing}, title = {{Eliminating higher-multiplicity intersections, III. Codimension 2}}, doi = {10.1070/RM9943}, volume = {75}, year = {2020}, } @article{6358, abstract = {We study dynamical optimal transport metrics between density matricesassociated to symmetric Dirichlet forms on finite-dimensional C∗-algebras. Our settingcovers arbitrary skew-derivations and it provides a unified framework that simultaneously generalizes recently constructed transport metrics for Markov chains, Lindblad equations, and the Fermi Ornstein–Uhlenbeck semigroup. We develop a non-nommutative differential calculus that allows us to obtain non-commutative Ricci curvature bounds, logarithmic Sobolev inequalities, transport-entropy inequalities, andspectral gap estimates.}, author = {Carlen, Eric A. and Maas, Jan}, issn = {15729613}, journal = {Journal of Statistical Physics}, number = {2}, pages = {319--378}, publisher = {Springer Nature}, title = {{Non-commutative calculus, optimal transport and functional inequalities in dissipative quantum systems}}, doi = {10.1007/s10955-019-02434-w}, volume = {178}, year = {2020}, } @inbook{74, abstract = {We study the Gromov waist in the sense of t-neighborhoods for measures in the Euclidean space, motivated by the famous theorem of Gromov about the waist of radially symmetric Gaussian measures. In particular, it turns our possible to extend Gromov’s original result to the case of not necessarily radially symmetric Gaussian measure. We also provide examples of measures having no t-neighborhood waist property, including a rather wide class of compactly supported radially symmetric measures and their maps into the Euclidean space of dimension at least 2. We use a simpler form of Gromov’s pancake argument to produce some estimates of t-neighborhoods of (weighted) volume-critical submanifolds in the spirit of the waist theorems, including neighborhoods of algebraic manifolds in the complex projective space. In the appendix of this paper we provide for reader’s convenience a more detailed explanation of the Caffarelli theorem that we use to handle not necessarily radially symmetric Gaussian measures.}, author = {Akopyan, Arseniy and Karasev, Roman}, booktitle = {Geometric Aspects of Functional Analysis}, editor = {Klartag, Bo'az and Milman, Emanuel}, isbn = {9783030360191}, issn = {16179692}, pages = {1--27}, publisher = {Springer Nature}, title = {{Gromov's waist of non-radial Gaussian measures and radial non-Gaussian measures}}, doi = {10.1007/978-3-030-36020-7_1}, volume = {2256}, year = {2020}, } @article{177, abstract = {We develop a geometric version of the circle method and use it to compute the compactly supported cohomology of the space of rational curves through a point on a smooth affine hypersurface of sufficiently low degree.}, author = {Browning, Timothy D and Sawin, Will}, journal = {Annals of Mathematics}, number = {3}, pages = {893--948}, publisher = {Princeton University}, title = {{A geometric version of the circle method}}, doi = {10.4007/annals.2020.191.3.4}, volume = {191}, year = {2020}, } @article{6649, abstract = {While Hartree–Fock theory is well established as a fundamental approximation for interacting fermions, it has been unclear how to describe corrections to it due to many-body correlations. In this paper we start from the Hartree–Fock state given by plane waves and introduce collective particle–hole pair excitations. These pairs can be approximately described by a bosonic quadratic Hamiltonian. We use Bogoliubov theory to construct a trial state yielding a rigorous Gell-Mann–Brueckner–type upper bound to the ground state energy. Our result justifies the random-phase approximation in the mean-field scaling regime, for repulsive, regular interaction potentials. }, author = {Benedikter, Niels P and Nam, Phan Thành and Porta, Marcello and Schlein, Benjamin and Seiringer, Robert}, issn = {1432-0916}, journal = {Communications in Mathematical Physics}, pages = {2097–2150}, publisher = {Springer Nature}, title = {{Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime}}, doi = {10.1007/s00220-019-03505-5}, volume = {374}, year = {2020}, } @article{6796, abstract = {Nearby grid cells have been observed to express a remarkable degree of long-rangeorder, which is often idealized as extending potentially to infinity. Yet their strict peri-odic firing and ensemble coherence are theoretically possible only in flat environments, much unlike the burrows which rodents usually live in. Are the symmetrical, coherent grid maps inferred in the lab relevant to chart their way in their natural habitat? We consider spheres as simple models of curved environments and waiting for the appropriate experiments to be performed, we use our adaptation model to predict what grid maps would emerge in a network with the same type of recurrent connections, which on the plane produce coherence among the units. We find that on the sphere such connections distort the maps that single grid units would express on their own, and aggregate them into clusters. When remapping to a different spherical environment, units in each cluster maintain only partial coherence, similar to what is observed in disordered materials, such as spin glasses.}, author = {Stella, Federico and Urdapilleta, Eugenio and Luo, Yifan and Treves, Alessandro}, issn = {10981063}, journal = {Hippocampus}, number = {4}, pages = {302--313}, publisher = {Wiley}, title = {{Partial coherence and frustration in self-organizing spherical grids}}, doi = {10.1002/hipo.23144}, volume = {30}, year = {2020}, } @article{6761, abstract = {In resource allocation games, selfish players share resources that are needed in order to fulfill their objectives. The cost of using a resource depends on the load on it. In the traditional setting, the players make their choices concurrently and in one-shot. That is, a strategy for a player is a subset of the resources. We introduce and study dynamic resource allocation games. In this setting, the game proceeds in phases. In each phase each player chooses one resource. A scheduler dictates the order in which the players proceed in a phase, possibly scheduling several players to proceed concurrently. The game ends when each player has collected a set of resources that fulfills his objective. The cost for each player then depends on this set as well as on the load on the resources in it – we consider both congestion and cost-sharing games. We argue that the dynamic setting is the suitable setting for many applications in practice. We study the stability of dynamic resource allocation games, where the appropriate notion of stability is that of subgame perfect equilibrium, study the inefficiency incurred due to selfish behavior, and also study problems that are particular to the dynamic setting, like constraints on the order in which resources can be chosen or the problem of finding a scheduler that achieves stability.}, author = {Avni, Guy and Henzinger, Thomas A and Kupferman, Orna}, issn = {03043975}, journal = {Theoretical Computer Science}, pages = {42--55}, publisher = {Elsevier}, title = {{Dynamic resource allocation games}}, doi = {10.1016/j.tcs.2019.06.031}, volume = {807}, year = {2020}, } @article{6593, abstract = {We consider the monotone variational inequality problem in a Hilbert space and describe a projection-type method with inertial terms under the following properties: (a) The method generates a strongly convergent iteration sequence; (b) The method requires, at each iteration, only one projection onto the feasible set and two evaluations of the operator; (c) The method is designed for variational inequality for which the underline operator is monotone and uniformly continuous; (d) The method includes an inertial term. The latter is also shown to speed up the convergence in our numerical results. A comparison with some related methods is given and indicates that the new method is promising.}, author = {Shehu, Yekini and Li, Xiao-Huan and Dong, Qiao-Li}, issn = {1572-9265}, journal = {Numerical Algorithms}, pages = {365--388}, publisher = {Springer Nature}, title = {{An efficient projection-type method for monotone variational inequalities in Hilbert spaces}}, doi = {10.1007/s11075-019-00758-y}, volume = {84}, year = {2020}, } @article{6808, abstract = {Super-resolution fluorescence microscopy has become an important catalyst for discovery in the life sciences. In STimulated Emission Depletion (STED) microscopy, a pattern of light drives fluorophores from a signal-emitting on-state to a non-signalling off-state. Only emitters residing in a sub-diffraction volume around an intensity minimum are allowed to fluoresce, rendering them distinguishable from the nearby, but dark fluorophores. STED routinely achieves resolution in the few tens of nanometers range in biological samples and is suitable for live imaging. Here, we review the working principle of STED and provide general guidelines for successful STED imaging. The strive for ever higher resolution comes at the cost of increased light burden. We discuss techniques to reduce light exposure and mitigate its detrimental effects on the specimen. These include specialized illumination strategies as well as protecting fluorophores from photobleaching mediated by high-intensity STED light. This opens up the prospect of volumetric imaging in living cells and tissues with diffraction-unlimited resolution in all three spatial dimensions.}, author = {Jahr, Wiebke and Velicky, Philipp and Danzl, Johann G}, issn = {1046-2023}, journal = {Methods}, number = {3}, pages = {27--41}, publisher = {Elsevier}, title = {{Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens}}, doi = {10.1016/j.ymeth.2019.07.019}, volume = {174}, year = {2020}, } @article{6563, abstract = {This paper presents two algorithms. The first decides the existence of a pointed homotopy between given simplicial maps 𝑓,𝑔:𝑋→𝑌, and the second computes the group [𝛴𝑋,𝑌]∗ of pointed homotopy classes of maps from a suspension; in both cases, the target Y is assumed simply connected. More generally, these algorithms work relative to 𝐴⊆𝑋.}, author = {Filakovský, Marek and Vokřínek, Lukas}, issn = {16153383}, journal = {Foundations of Computational Mathematics}, pages = {311--330}, publisher = {Springer Nature}, title = {{Are two given maps homotopic? An algorithmic viewpoint}}, doi = {10.1007/s10208-019-09419-x}, volume = {20}, year = {2020}, } @article{6952, abstract = {We present a unified framework tackling two problems: class-specific 3D reconstruction from a single image, and generation of new 3D shape samples. These tasks have received considerable attention recently; however, most existing approaches rely on 3D supervision, annotation of 2D images with keypoints or poses, and/or training with multiple views of each object instance. Our framework is very general: it can be trained in similar settings to existing approaches, while also supporting weaker supervision. Importantly, it can be trained purely from 2D images, without pose annotations, and with only a single view per instance. We employ meshes as an output representation, instead of voxels used in most prior work. This allows us to reason over lighting parameters and exploit shading information during training, which previous 2D-supervised methods cannot. Thus, our method can learn to generate and reconstruct concave object classes. We evaluate our approach in various settings, showing that: (i) it learns to disentangle shape from pose and lighting; (ii) using shading in the loss improves performance compared to just silhouettes; (iii) when using a standard single white light, our model outperforms state-of-the-art 2D-supervised methods, both with and without pose supervision, thanks to exploiting shading cues; (iv) performance improves further when using multiple coloured lights, even approaching that of state-of-the-art 3D-supervised methods; (v) shapes produced by our model capture smooth surfaces and fine details better than voxel-based approaches; and (vi) our approach supports concave classes such as bathtubs and sofas, which methods based on silhouettes cannot learn.}, author = {Henderson, Paul M and Ferrari, Vittorio}, issn = {1573-1405}, journal = {International Journal of Computer Vision}, pages = {835--854}, publisher = {Springer Nature}, title = {{Learning single-image 3D reconstruction by generative modelling of shape, pose and shading}}, doi = {10.1007/s11263-019-01219-8}, volume = {128}, year = {2020}, } @article{7148, abstract = {In the cerebellum, GluD2 is exclusively expressed in Purkinje cells, where it regulates synapse formation and regeneration, synaptic plasticity, and motor learning. Delayed cognitive development in humans with GluD2 gene mutations suggests extracerebellar functions of GluD2. However, extracerebellar expression of GluD2 and its relationship with that of GluD1 are poorly understood. GluD2 mRNA and protein were widely detected, with relatively high levels observed in the olfactory glomerular layer, medial prefrontal cortex, cingulate cortex, retrosplenial granular cortex, olfactory tubercle, subiculum, striatum, lateral septum, anterodorsal thalamic nucleus, and arcuate hypothalamic nucleus. These regions were also enriched for GluD1, and many individual neurons coexpressed the two GluDs. In the retrosplenial granular cortex, GluD1 and GluD2 were selectively expressed at PSD‐95‐expressing glutamatergic synapses, and their coexpression on the same synapses was shown by SDS‐digested freeze‐fracture replica labeling. Biochemically, GluD1 and GluD2 formed coimmunoprecipitable complex formation in HEK293T cells and in the cerebral cortex and hippocampus. We further estimated the relative protein amount by quantitative immunoblotting using GluA2/GluD2 and GluA2/GluD1 chimeric proteins as standards for titration of GluD1 and GluD2 antibodies. Intriguingly, the relative amount of GluD2 was almost comparable to that of GluD1 in the postsynaptic density fraction prepared from the cerebral cortex and hippocampus. In contrast, GluD2 was overwhelmingly predominant in the cerebellum. Thus, we have determined the relative extracerebellar expression of GluD1 and GluD2 at regional, neuronal, and synaptic levels. These data provide a molecular–anatomical basis for possible competitive and cooperative interactions of GluD family members at synapses in various brain regions.}, author = {Nakamoto, Chihiro and Konno, Kohtarou and Miyazaki, Taisuke and Nakatsukasa, Ena and Natsume, Rie and Abe, Manabu and Kawamura, Meiko and Fukazawa, Yugo and Shigemoto, Ryuichi and Yamasaki, Miwako and Sakimura, Kenji and Watanabe, Masahiko}, issn = {1096-9861}, journal = {Journal of Comparative Neurology}, number = {6}, pages = {1003--1027}, publisher = {Wiley}, title = {{Expression mapping, quantification, and complex formation of GluD1 and GluD2 glutamate receptors in adult mouse brain}}, doi = {10.1002/cne.24792}, volume = {528}, year = {2020}, } @article{7033, abstract = {Removal of the Bax gene from mice completely protects the somas of retinal ganglion cells (RGCs) from apoptosis following optic nerve injury. This makes BAX a promising therapeutic target to prevent neurodegeneration. In this study, Bax+/− mice were used to test the hypothesis that lowering the quantity of BAX in RGCs would delay apoptosis following optic nerve injury. RGCs were damaged by performing optic nerve crush (ONC) and then immunostaining for phospho-cJUN, and quantitative PCR were used to monitor the status of the BAX activation mechanism in the months following injury. The apoptotic susceptibility of injured cells was directly tested by virally introducing GFP-BAX into Bax−/− RGCs after injury. The competency of quiescent RGCs to reactivate their BAX activation mechanism was tested by intravitreal injection of the JNK pathway agonist, anisomycin. Twenty-four weeks after ONC, Bax+/− mice had significantly less cell loss in their RGC layer than Bax+/+ mice 3 weeks after ONC. Bax+/− and Bax+/+ RGCs exhibited similar patterns of nuclear phospho-cJUN accumulation immediately after ONC, which persisted in Bax+/− RGCs for up to 7 weeks before abating. The transcriptional activation of BAX-activating genes was similar in Bax+/− and Bax+/+ RGCs following ONC. Intriguingly, cells deactivated their BAX activation mechanism between 7 and 12 weeks after crush. Introduction of GFP-BAX into Bax−/− cells at 4 weeks after ONC showed that these cells had a nearly normal capacity to activate this protein, but this capacity was lost 8 weeks after crush. Collectively, these data suggest that 8–12 weeks after crush, damaged cells no longer displayed increased susceptibility to BAX activation relative to their naïve counterparts. In this same timeframe, retinal glial activation and the signaling of the pro-apoptotic JNK pathway also abated. Quiescent RGCs did not show a timely reactivation of their JNK pathway following intravitreal injection with anisomycin. These findings demonstrate that lowering the quantity of BAX in RGCs is neuroprotective after acute injury. Damaged RGCs enter a quiescent state months after injury and are no longer responsive to an apoptotic stimulus. Quiescent RGCs will require rejuvenation to reacquire functionality.}, author = {Donahue, RJ and Maes, Margaret E and Grosser, JA and Nickells, RW}, issn = {1559-1182}, journal = {Molecular Neurobiology}, number = {2}, pages = {1070–1084}, publisher = {Springer Nature}, title = {{BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage}}, doi = {10.1007/s12035-019-01783-7}, volume = {57}, year = {2020}, } @article{6997, author = {Zhang, Yuzhou and Friml, Jiří}, issn = {1469-8137}, journal = {New Phytologist}, number = {3}, pages = {1049--1052}, publisher = {Wiley}, title = {{Auxin guides roots to avoid obstacles during gravitropic growth}}, doi = {10.1111/nph.16203}, volume = {225}, year = {2020}, } @article{7149, abstract = {In recent years, many genes have been associated with chromatinopathies classified as “Cornelia de Lange Syndrome‐like.” It is known that the phenotype of these patients becomes less recognizable, overlapping to features characteristic of other syndromes caused by genetic variants affecting different regulators of chromatin structure and function. Therefore, Cornelia de Lange syndrome diagnosis might be arduous due to the seldom discordance between unexpected molecular diagnosis and clinical evaluation. Here, we review the molecular features of Cornelia de Lange syndrome, supporting the hypothesis that “CdLS‐like syndromes” are part of a larger “rare disease family” sharing multiple clinical features and common disrupted molecular pathways.}, author = {Avagliano, Laura and Parenti, Ilaria and Grazioli, Paolo and Di Fede, Elisabetta and Parodi, Chiara and Mariani, Milena and Kaiser, Frank J. and Selicorni, Angelo and Gervasini, Cristina and Massa, Valentina}, issn = {1399-0004}, journal = {Clinical Genetics}, number = {1}, pages = {3--11}, publisher = {Wiley}, title = {{Chromatinopathies: A focus on Cornelia de Lange syndrome}}, doi = {10.1111/cge.13674}, volume = {97}, year = {2020}, } @article{7004, abstract = {We define an action of the (double of) Cohomological Hall algebra of Kontsevich and Soibelman on the cohomology of the moduli space of spiked instantons of Nekrasov. We identify this action with the one of the affine Yangian of gl(1). Based on that we derive the vertex algebra at the corner Wr1,r2,r3 of Gaiotto and Rapčák. We conjecture that our approach works for a big class of Calabi–Yau categories, including those associated with toric Calabi–Yau 3-folds.}, author = {Rapcak, Miroslav and Soibelman, Yan and Yang, Yaping and Zhao, Gufang}, issn = {1432-0916}, journal = {Communications in Mathematical Physics}, pages = {1803--1873}, publisher = {Springer Nature}, title = {{Cohomological Hall algebras, vertex algebras and instantons}}, doi = {10.1007/s00220-019-03575-5}, volume = {376}, year = {2020}, } @article{7204, abstract = {Plant root architecture dynamically adapts to various environmental conditions, such as salt‐containing soil. The phytohormone abscisic acid (ABA) is involved among others also in these developmental adaptations, but the underlying molecular mechanism remains elusive. Here, a novel branch of the ABA signaling pathway in Arabidopsis involving PYR/PYL/RCAR (abbreviated as PYLs) receptor‐protein phosphatase 2A (PP2A) complex that acts in parallel to the canonical PYLs‐protein phosphatase 2C (PP2C) mechanism is identified. The PYLs‐PP2A signaling modulates root gravitropism and lateral root formation through regulating phytohormone auxin transport. In optimal conditions, PYLs ABA receptor interacts with the catalytic subunits of PP2A, increasing their phosphatase activity and thus counteracting PINOID (PID) kinase‐mediated phosphorylation of PIN‐FORMED (PIN) auxin transporters. By contrast, in salt and osmotic stress conditions, ABA binds to PYLs, inhibiting the PP2A activity, which leads to increased PIN phosphorylation and consequently modulated directional auxin transport leading to adapted root architecture. This work reveals an adaptive mechanism that may flexibly adjust plant root growth to withstand saline and osmotic stresses. It occurs via the cross‐talk between the stress hormone ABA and the versatile developmental regulator auxin.}, author = {Li, Yang and Wang, Yaping and Tan, Shutang and Li, Zhen and Yuan, Zhi and Glanc, Matous and Domjan, David and Wang, Kai and Xuan, Wei and Guo, Yan and Gong, Zhizhong and Friml, Jiří and Zhang, Jing}, issn = {2198-3844}, journal = {Advanced Science}, number = {3}, publisher = {Wiley}, title = {{Root growth adaptation is mediated by PYLs ABA receptor-PP2A protein phosphatase complex}}, doi = {10.1002/advs.201901455}, volume = {7}, year = {2020}, } @article{7220, abstract = {BACKGROUND:The introduction of image-guided methods to bypass surgery has resulted in optimized preoperative identification of the recipients and excellent patency rates. However, the recently presented methods have also been resource-consuming. In the present study, we have reported a cost-efficient planning workflow for extracranial-intracranial (EC-IC) revascularization combined with transdural indocyanine green videoangiography (tICG-VA). METHODS:We performed a retrospective review at a single tertiary referral center from 2011 to 2018. A novel software-derived workflow was applied for 25 of 92 bypass procedures during the study period. The precision and accuracy were assessed using tICG-VA identification of the cortical recipients and a comparison of the virtual and actual data. The data from a control group of 25 traditionally planned procedures were also matched. RESULTS:The intraoperative transfer time of the calculated coordinates averaged 0.8 minute (range, 0.4-1.9 minutes). The definitive recipients matched the targeted branches in 80%, and a neighboring branch was used in 16%. Our workflow led to a significant craniotomy size reduction in the study group compared with that in the control group (P = 0.005). tICG-VA was successfully applied in 19 cases. An average of 2 potential recipient arteries were identified transdurally, resulting in tailored durotomy and 3 craniotomy adjustments. Follow-up patency results were available for 49 bypass surgeries, comprising 54 grafts. The overall patency rate was 91% at a median follow-up period of 26 months. No significant difference was found in the patency rate between the study and control groups (P = 0.317). CONCLUSIONS:Our clinical results have validated the presented planning and surgical workflow and support the routine implementation of tICG-VA for recipient identification before durotomy.}, author = {Dodier, Philippe and Auzinger, Thomas and Mistelbauer, Gabriel and Wang, Wei Te and Ferraz-Leite, Heber and Gruber, Andreas and Marik, Wolfgang and Winter, Fabian and Fischer, Gerrit and Frischer, Josa M. and Bavinzski, Gerhard}, issn = {1878-8769}, journal = {World Neurosurgery}, number = {2}, pages = {e892--e902}, publisher = {Elsevier}, title = {{Novel software-derived workflow in extracranial–intracranial bypass surgery validated by transdural indocyanine green videoangiography}}, doi = {10.1016/j.wneu.2019.11.038}, volume = {134}, year = {2020}, } @article{7142, abstract = {The phytohormone auxin acts as an amazingly versatile coordinator of plant growth and development. With its morphogen-like properties, auxin controls sites and timing of differentiation and/or growth responses both, in quantitative and qualitative terms. Specificity in the auxin response depends largely on distinct modes of signal transmission, by which individual cells perceive and convert auxin signals into a remarkable diversity of responses. The best understood, or so-called canonical mechanism of auxin perception ultimately results in variable adjustments of the cellular transcriptome, via a short, nuclear signal transduction pathway. Additional findings that accumulated over decades implied that an additional, presumably, cell surface-based auxin perception mechanism mediates very rapid cellular responses and decisively contributes to the cell's overall hormonal response. Recent investigations into both, nuclear and cell surface auxin signalling challenged this assumed partition of roles for different auxin signalling pathways and revealed an unexpected complexity in transcriptional and non-transcriptional cellular responses mediated by auxin.}, author = {Gallei, Michelle C and Luschnig, Christian and Friml, Jiří}, issn = {1879-0356}, journal = {Current Opinion in Plant Biology}, number = {2}, pages = {43--49}, publisher = {Elsevier}, title = {{Auxin signalling in growth: Schrödinger's cat out of the bag}}, doi = {10.1016/j.pbi.2019.10.003}, volume = {53}, year = {2020}, } @article{7166, abstract = {In the living cell, we encounter a large variety of motile processes such as organelle transport and cytoskeleton remodeling. These processes are driven by motor proteins that generate force by transducing chemical free energy into mechanical work. In many cases, the molecular motors work in teams to collectively generate larger forces. Recent optical trapping experiments on small teams of cytoskeletal motors indicated that the collectively generated force increases with the size of the motor team but that this increase depends on the motor type and on whether the motors are studied in vitro or in vivo. Here, we use the theory of stochastic processes to describe the motion of N motors in a stationary optical trap and to compute the N-dependence of the collectively generated forces. We consider six distinct motor types, two kinesins, two dyneins, and two myosins. We show that the force increases always linearly with N but with a prefactor that depends on the performance of the single motor. Surprisingly, this prefactor increases for weaker motors with a lower stall force. This counter-intuitive behavior reflects the increased probability with which stronger motors detach from the filament during strain generation. Our theoretical results are in quantitative agreement with experimental data on small teams of kinesin-1 motors.}, author = {Ucar, Mehmet C and Lipowsky, Reinhard}, issn = {1530-6992}, journal = {Nano Letters}, number = {1}, pages = {669--676}, publisher = {American Chemical Society}, title = {{Collective force generation by molecular motors is determined by strain-induced unbinding}}, doi = {10.1021/acs.nanolett.9b04445}, volume = {20}, year = {2020}, } @misc{9885, abstract = {Data obtained from the fine-grained simulations used in Figures 2-5, data obtained from the coarse-grained numerical calculations used in Figure 6, and a sample script for the fine-grained simulation as a Jupyter notebook (ZIP)}, author = {Ucar, Mehmet C and Lipowsky, Reinhard}, publisher = {American Chemical Society }, title = {{MURL_Dataz}}, doi = {10.1021/acs.nanolett.9b04445.s002}, year = {2020}, } @article{7218, abstract = {The combined resection of skull-infiltrating tumours and immediate cranioplastic reconstruction predominantly relies on freehand-moulded solutions. Techniques that enable this procedure to be performed easily in routine clinical practice would be useful. A cadaveric study was developed in which a new software tool was used to perform single-stage reconstructions with prefabricated implants after the resection of skull-infiltrating pathologies. A novel 3D visualization and interaction framework was developed to create 10 virtual craniotomies in five cadaveric specimens. Polyether ether ketone (PEEK) implants were manufactured according to the bone defects. The image-guided craniotomy was reconstructed with PEEK and compared to polymethyl methacrylate (PMMA). Navigational accuracy and surgical precision were assessed. The PEEK workflow resulted in up to 10-fold shorter reconstruction times than the standard technique. Surgical precision was reflected by the mean 1.1 ± 0.29 mm distance between the virtual and real craniotomy, with submillimetre precision in 50%. Assessment of the global offset between virtual and actual craniotomy revealed an average shift of 4.5 ± 3.6 mm. The results validated the ‘elective single-stage cranioplasty’ technique as a state-of-the-art virtual planning method and surgical workflow. This patient-tailored workflow could significantly reduce surgical times compared to the traditional, intraoperative acrylic moulding method and may be an option for the reconstruction of bone defects in the craniofacial region.}, author = {Dodier, Philippe and Winter, Fabian and Auzinger, Thomas and Mistelbauer, Gabriel and Frischer, Josa M. and Wang, Wei Te and Mallouhi, Ammar and Marik, Wolfgang and Wolfsberger, Stefan and Reissig, Lukas and Hammadi, Firas and Matula, Christian and Baumann, Arnulf and Bavinzski, Gerhard}, issn = {1399-0020}, journal = {International Journal of Oral and Maxillofacial Surgery}, number = {8}, pages = {P1007--1015}, publisher = {Elsevier}, title = {{Single-stage bone resection and cranioplastic reconstruction: Comparison of a novel software-derived PEEK workflow with the standard reconstructive method}}, doi = {10.1016/j.ijom.2019.11.011}, volume = {49}, year = {2020}, } @article{7219, abstract = {Root system architecture (RSA), governed by the phytohormone auxin, endows plants with an adaptive advantage in particular environments. Using geographically representative arabidopsis (Arabidopsis thaliana) accessions as a resource for GWA mapping, Waidmann et al. and Ogura et al. recently identified two novel components involved in modulating auxin-mediated RSA and conferring plant fitness in particular habitats.}, author = {Xiao, Guanghui and Zhang, Yuzhou}, issn = {13601385}, journal = {Trends in Plant Science}, number = {2}, pages = {P121--123}, publisher = {Elsevier}, title = {{Adaptive growth: Shaping auxin-mediated root system architecture}}, doi = {10.1016/j.tplants.2019.12.001}, volume = {25}, year = {2020}, } @article{7234, abstract = {T lymphocytes utilize amoeboid migration to navigate effectively within complex microenvironments. The precise rearrangement of the actin cytoskeleton required for cellular forward propulsion is mediated by actin regulators, including the actin‐related protein 2/3 (Arp2/3) complex, a macromolecular machine that nucleates branched actin filaments at the leading edge. The consequences of modulating Arp2/3 activity on the biophysical properties of the actomyosin cortex and downstream T cell function are incompletely understood. We report that even a moderate decrease of Arp3 levels in T cells profoundly affects actin cortex integrity. Reduction in total F‐actin content leads to reduced cortical tension and disrupted lamellipodia formation. Instead, in Arp3‐knockdown cells, the motility mode is dominated by blebbing migration characterized by transient, balloon‐like protrusions at the leading edge. Although this migration mode seems to be compatible with interstitial migration in three‐dimensional environments, diminished locomotion kinetics and impaired cytotoxicity interfere with optimal T cell function. These findings define the importance of finely tuned, Arp2/3‐dependent mechanophysical membrane integrity in cytotoxic effector T lymphocyte activities.}, author = {Obeidy, Peyman and Ju, Lining A. and Oehlers, Stefan H. and Zulkhernain, Nursafwana S. and Lee, Quintin and Galeano Niño, Jorge L. and Kwan, Rain Y.Q. and Tikoo, Shweta and Cavanagh, Lois L. and Mrass, Paulus and Cook, Adam J.L. and Jackson, Shaun P. and Biro, Maté and Roediger, Ben and Sixt, Michael K and Weninger, Wolfgang}, issn = {14401711}, journal = {Immunology and Cell Biology}, number = {2}, pages = {93--113}, publisher = {Wiley}, title = {{Partial loss of actin nucleator actin-related protein 2/3 activity triggers blebbing in primary T lymphocytes}}, doi = {10.1111/imcb.12304}, volume = {98}, year = {2020}, } @article{7253, abstract = {The cyclin-dependent kinase inhibitor p57KIP2 is encoded by the imprinted Cdkn1c locus, exhibits maternal expression, and is essential for cerebral cortex development. How Cdkn1c regulates corticogenesis is however not clear. To this end we employ Mosaic Analysis with Double Markers (MADM) technology to genetically dissect Cdkn1c gene function in corticogenesis at single cell resolution. We find that the previously described growth-inhibitory Cdkn1c function is a non-cell-autonomous one, acting on the whole organism. In contrast we reveal a growth-promoting cell-autonomous Cdkn1c function which at the mechanistic level mediates radial glial progenitor cell and nascent projection neuron survival. Strikingly, the growth-promoting function of Cdkn1c is highly dosage sensitive but not subject to genomic imprinting. Collectively, our results suggest that the Cdkn1c locus regulates cortical development through distinct cell-autonomous and non-cell-autonomous mechanisms. More generally, our study highlights the importance to probe the relative contributions of cell intrinsic gene function and tissue-wide mechanisms to the overall phenotype.}, author = {Laukoter, Susanne and Beattie, Robert J and Pauler, Florian and Amberg, Nicole and Nakayama, Keiichi I. and Hippenmeyer, Simon}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Imprinted Cdkn1c genomic locus cell-autonomously promotes cell survival in cerebral cortex development}}, doi = {10.1038/s41467-019-14077-2}, volume = {11}, year = {2020}, } @article{7339, abstract = {Cytoskeletal filaments such as microtubules (MTs) and filamentous actin (F-actin) dynamically support cell structure and functions. In central presynaptic terminals, F-actin is expressed along the release edge and reportedly plays diverse functional roles, but whether axonal MTs extend deep into terminals and play any physiological role remains controversial. At the calyx of Held in rats of either sex, confocal and high-resolution microscopy revealed that MTs enter deep into presynaptic terminal swellings and partially colocalize with a subset of synaptic vesicles (SVs). Electrophysiological analysis demonstrated that depolymerization of MTs specifically prolonged the slow-recovery time component of EPSCs from short-term depression induced by a train of high-frequency stimulation, whereas depolymerization of F-actin specifically prolonged the fast-recovery component. In simultaneous presynaptic and postsynaptic action potential recordings, depolymerization of MTs or F-actin significantly impaired the fidelity of high-frequency neurotransmission. We conclude that MTs and F-actin differentially contribute to slow and fast SV replenishment, thereby maintaining high-frequency neurotransmission.}, author = {Piriya Ananda Babu, Lashmi and Wang, Han Ying and Eguchi, Kohgaku and Guillaud, Laurent and Takahashi, Tomoyuki}, issn = {15292401}, journal = {Journal of neuroscience}, number = {1}, pages = {131--142}, publisher = {Society for Neuroscience}, title = {{Microtubule and actin differentially regulate synaptic vesicle cycling to maintain high-frequency neurotransmission}}, doi = {10.1523/JNEUROSCI.1571-19.2019}, volume = {40}, year = {2020}, } @article{7350, abstract = {The ability to sense environmental temperature and to coordinate growth and development accordingly, is critical to the reproductive success of plants. Flowering time is regulated at the level of gene expression by a complex network of factors that integrate environmental and developmental cues. One of the main players, involved in modulating flowering time in response to changes in ambient temperature is FLOWERING LOCUS M (FLM). FLM transcripts can undergo extensive alternative splicing producing multiple variants, of which FLM-β and FLM-δ are the most representative. While FLM-β codes for the flowering repressor FLM protein, translation of FLM-δ has the opposite effect on flowering. Here we show that the cyclin-dependent kinase G2 (CDKG2), together with its cognate cyclin, CYCLYN L1 (CYCL1) affects the alternative splicing of FLM, balancing the levels of FLM-β and FLM-δ across the ambient temperature range. In the absence of the CDKG2/CYCL1 complex, FLM-β expression is reduced while FLM-δ is increased in a temperature dependent manner and these changes are associated with an early flowering phenotype in the cdkg2 mutant lines. In addition, we found that transcript variants retaining the full FLM intron 1 are sequestered in the cell nucleus. Strikingly, FLM intron 1 splicing is also regulated by CDKG2/CYCL1. Our results provide evidence that temperature and CDKs regulate the alternative splicing of FLM, contributing to flowering time definition.}, author = {Nibau, Candida and Gallemi, Marçal and Dadarou, Despoina and Doonan, John H. and Cavallari, Nicola}, issn = {1664-462X}, journal = {Frontiers in Plant Science}, publisher = {Frontiers Media}, title = {{Thermo-sensitive alternative splicing of FLOWERING LOCUS M is modulated by cyclin-dependent kinase G2}}, doi = {10.3389/fpls.2019.01680}, volume = {10}, year = {2020}, }