@article{7790, abstract = {We prove a lower bound for the free energy (per unit volume) of the two-dimensional Bose gas in the thermodynamic limit. We show that the free energy at density 𝜌 and inverse temperature đ›œ differs from the one of the noninteracting system by the correction term đœ‹đœŒđœŒđ›œđ›œ . Here, is the scattering length of the interaction potential, and đ›œ is the inverse Berezinskii–Kosterlitz–Thouless critical temperature for superfluidity. The result is valid in the dilute limit 𝜌 and if đ›œđœŒ .}, author = {Deuchert, Andreas and Mayer, Simon and Seiringer, Robert}, issn = {20505094}, journal = {Forum of Mathematics, Sigma}, publisher = {Cambridge University Press}, title = {{The free energy of the two-dimensional dilute Bose gas. I. Lower bound}}, doi = {10.1017/fms.2020.17}, volume = {8}, year = {2020}, } @article{7792, abstract = {Phonon polaritons—light coupled to lattice vibrations—in polar van der Waals crystals are promising candidates for controlling the flow of energy on the nanoscale due to their strong field confinement, anisotropic propagation and ultra-long lifetime in the picosecond range1,2,3,4,5. However, the lack of tunability of their narrow and material-specific spectral range—the Reststrahlen band—severely limits their technological implementation. Here, we demonstrate that intercalation of Na atoms in the van der Waals semiconductor α-V2O5 enables a broad spectral shift of Reststrahlen bands, and that the phonon polaritons excited show ultra-low losses (lifetime of 4 ± 1 ps), similar to phonon polaritons in a non-intercalated crystal (lifetime of 6 ± 1 ps). We expect our intercalation method to be applicable to other van der Waals crystals, opening the door for the use of phonon polaritons in broad spectral bands in the mid-infrared domain.}, author = {Taboada-GutiĂ©rrez, Javier and Álvarez-PĂ©rez, Gonzalo and Duan, Jiahua and Ma, Weiliang and Crowley, Kyle and Prieto Gonzalez, Ivan and Bylinkin, Andrei and Autore, Marta and Volkova, Halyna and Kimura, Kenta and Kimura, Tsuyoshi and Berger, M. H. and Li, Shaojuan and Bao, Qiaoliang and Gao, Xuan P.A. and Errea, Ion and Nikitin, Alexey Y. and Hillenbrand, Rainer and MartĂ­n-SĂĄnchez, Javier and Alonso-GonzĂĄlez, Pablo}, issn = {14764660}, journal = {Nature Materials}, pages = {964–968}, publisher = {Springer Nature}, title = {{Broad spectral tuning of ultra-low-loss polaritons in a van der Waals crystal by intercalation}}, doi = {10.1038/s41563-020-0665-0}, volume = {19}, year = {2020}, } @article{7793, abstract = {Hormonal signalling in animals often involves direct transcription factor-hormone interactions that modulate gene expression. In contrast, plant hormone signalling is most commonly based on de-repression via the degradation of transcriptional repressors. Recently, we uncovered a non-canonical signalling mechanism for the plant hormone auxin whereby auxin directly affects the activity of the atypical auxin response factor (ARF), ETTIN towards target genes without the requirement for protein degradation. Here we show that ETTIN directly binds auxin, leading to dissociation from co-repressor proteins of the TOPLESS/TOPLESS-RELATED family followed by histone acetylation and induction of gene expression. This mechanism is reminiscent of animal hormone signalling as it affects the activity towards regulation of target genes and provides the first example of a DNA-bound hormone receptor in plants. Whilst auxin affects canonical ARFs indirectly by facilitating degradation of Aux/IAA repressors, direct ETTIN-auxin interactions allow switching between repressive and de-repressive chromatin states in an instantly-reversible manner.}, author = {Kuhn, AndrĂ© and Ramans Harborough, Sigurd and McLaughlin, Heather M and Natarajan, Bhavani and Verstraeten, Inge and Friml, Jiƙí and Kepinski, Stefan and Østergaard, Lars}, issn = {2050-084X}, journal = {eLife}, publisher = {eLife Sciences Publications}, title = {{Direct ETTIN-auxin interaction controls chromatin states in gynoecium development}}, doi = {10.7554/elife.51787}, volume = {9}, year = {2020}, } @unpublished{7800, abstract = {De novo loss of function mutations in the ubiquitin ligase-encoding gene Cullin3 (CUL3) lead to autism spectrum disorder (ASD). Here, we used Cul3 mouse models to evaluate the consequences of Cul3 mutations in vivo. Our results show that Cul3 haploinsufficient mice exhibit deficits in motor coordination as well as ASD-relevant social and cognitive impairments. Cul3 mutant brain displays cortical lamination abnormalities due to defective neuronal migration and reduced numbers of excitatory and inhibitory neurons. In line with the observed abnormal columnar organization, Cul3 haploinsufficiency is associated with decreased spontaneous excitatory and inhibitory activity in the cortex. At the molecular level, employing a quantitative proteomic approach, we show that Cul3 regulates cytoskeletal and adhesion protein abundance in mouse embryos. Abnormal regulation of cytoskeletal proteins in Cul3 mutant neuronal cells results in atypical organization of the actin mesh at the cell leading edge, likely causing the observed migration deficits. In contrast to these important functions early in development, Cul3 deficiency appears less relevant at adult stages. In fact, induction of Cul3 haploinsufficiency in adult mice does not result in the behavioral defects observed in constitutive Cul3 haploinsufficient animals. Taken together, our data indicate that Cul3 has a critical role in the regulation of cytoskeletal proteins and neuronal migration and that ASD-associated defects and behavioral abnormalities are primarily due to Cul3 functions at early developmental stages.}, author = {Morandell, Jasmin and Schwarz, Lena A and Basilico, Bernadette and Tasciyan, Saren and Nicolas, Armel and Sommer, Christoph M and Kreuzinger, Caroline and Knaus, Lisa and Dobler, Zoe and Cacci, Emanuele and Danzl, Johann G and Novarino, Gaia}, booktitle = {bioRxiv}, publisher = {Cold Spring Harbor Laboratory}, title = {{Cul3 regulates cytoskeleton protein homeostasis and cell migration during a critical window of brain development}}, doi = {10.1101/2020.01.10.902064 }, year = {2020}, } @inproceedings{7802, abstract = {The Massively Parallel Computation (MPC) model is an emerging model which distills core aspects of distributed and parallel computation. It has been developed as a tool to solve (typically graph) problems in systems where the input is distributed over many machines with limited space. Recent work has focused on the regime in which machines have sublinear (in $n$, the number of nodes in the input graph) space, with randomized algorithms presented for fundamental graph problems of Maximal Matching and Maximal Independent Set. However, there have been no prior corresponding deterministic algorithms. A major challenge underlying the sublinear space setting is that the local space of each machine might be too small to store all the edges incident to a single node. This poses a considerable obstacle compared to the classical models in which each node is assumed to know and have easy access to its incident edges. To overcome this barrier we introduce a new graph sparsification technique that deterministically computes a low-degree subgraph with additional desired properties. The degree of the nodes in this subgraph is small in the sense that the edges of each node can be now stored on a single machine. This low-degree subgraph also has the property that solving the problem on this subgraph provides \emph{significant} global progress, i.e., progress towards solving the problem for the original input graph. Using this framework to derandomize the well-known randomized algorithm of Luby [SICOMP'86], we obtain $O(\log \Delta+\log\log n)$-round deterministic MPC algorithms for solving the fundamental problems of Maximal Matching and Maximal Independent Set with $O(n^{\epsilon})$ space on each machine for any constant $\epsilon > 0$. Based on the recent work of Ghaffari et al. [FOCS'18], this additive $O(\log\log n)$ factor is conditionally essential. These algorithms can also be shown to run in $O(\log \Delta)$ rounds in the closely related model of CONGESTED CLIQUE, improving upon the state-of-the-art bound of $O(\log^2 \Delta)$ rounds by Censor-Hillel et al. [DISC'17].}, author = {Czumaj, Artur and Davies, Peter and Parter, Merav}, booktitle = {Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2020)}, location = {Virtual Event, United States}, number = {7}, pages = {175--185}, publisher = {Association for Computing Machinery}, title = {{Graph sparsification for derandomizing massively parallel computation with low space}}, doi = {10.1145/3350755.3400282}, year = {2020}, } @inproceedings{7803, abstract = {We settle the complexity of the (Δ+1)-coloring and (Δ+1)-list coloring problems in the CONGESTED CLIQUE model by presenting a simple deterministic algorithm for both problems running in a constant number of rounds. This matches the complexity of the recent breakthrough randomized constant-round (Δ+1)-list coloring algorithm due to Chang et al. (PODC'19), and significantly improves upon the state-of-the-art O(logΔ)-round deterministic (Δ+1)-coloring bound of Parter (ICALP'18). A remarkable property of our algorithm is its simplicity. Whereas the state-of-the-art randomized algorithms for this problem are based on the quite involved local coloring algorithm of Chang et al. (STOC'18), our algorithm can be described in just a few lines. At a high level, it applies a careful derandomization of a recursive procedure which partitions the nodes and their respective palettes into separate bins. We show that after O(1) recursion steps, the remaining uncolored subgraph within each bin has linear size, and thus can be solved locally by collecting it to a single node. This algorithm can also be implemented in the Massively Parallel Computation (MPC) model provided that each machine has linear (in n, the number of nodes in the input graph) space. We also show an extension of our algorithm to the MPC regime in which machines have sublinear space: we present the first deterministic (Δ+1)-list coloring algorithm designed for sublinear-space MPC, which runs in O(logΔ+loglogn) rounds.}, author = {Czumaj, Artur and Davies, Peter and Parter, Merav}, booktitle = {Proceedings of the 2020 ACM Symposium on Principles of Distributed Computing}, location = {Salerno, Italy}, pages = {309--318}, publisher = {Association for Computing Machinery}, title = {{Simple, deterministic, constant-round coloring in the congested clique}}, doi = {10.1145/3382734.3405751}, year = {2020}, } @article{7804, abstract = {Besides pro-inflammatory roles, the ancient cytokine interleukin-17 (IL-17) modulates neural circuit function. We investigate IL-17 signaling in neurons, and the extent it can alter organismal phenotypes. We combine immunoprecipitation and mass spectrometry to biochemically characterize endogenous signaling complexes that function downstream of IL-17 receptors in C. elegans neurons. We identify the paracaspase MALT-1 as a critical output of the pathway. MALT1 mediates signaling from many immune receptors in mammals, but was not previously implicated in IL-17 signaling or nervous system function. C. elegans MALT-1 forms a complex with homologs of Act1 and IRAK and appears to function both as a scaffold and a protease. MALT-1 is expressed broadly in the C. elegans nervous system, and neuronal IL-17–MALT-1 signaling regulates multiple phenotypes, including escape behavior, associative learning, immunity and longevity. Our data suggest MALT1 has an ancient role modulating neural circuit function downstream of IL-17 to remodel physiology and behavior.}, author = {Flynn, Sean M. and Chen, Changchun and Artan, Murat and Barratt, Stephen and Crisp, Alastair and Nelson, Geoffrey M. and Peak-Chew, Sew Yeu and Begum, Farida and Skehel, Mark and De Bono, Mario}, issn = {20411723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{MALT-1 mediates IL-17 neural signaling to regulate C. elegans behavior, immunity and longevity}}, doi = {10.1038/s41467-020-15872-y}, volume = {11}, year = {2020}, } @article{7805, abstract = {Plants as non-mobile organisms constantly integrate varying environmental signals to flexibly adapt their growth and development. Local fluctuations in water and nutrient availability, sudden changes in temperature or other abiotic and biotic stresses can trigger changes in the growth of plant organs. Multiple mutually interconnected hormonal signaling cascades act as essential endogenous translators of these exogenous signals in the adaptive responses of plants. Although the molecular backbones of hormone transduction pathways have been identified, the mechanisms underlying their interactions are largely unknown. Here, using genome wide transcriptome profiling we identify an auxin and cytokinin cross-talk component; SYNERGISTIC ON AUXIN AND CYTOKININ 1 (SYAC1), whose expression in roots is strictly dependent on both of these hormonal pathways. We show that SYAC1 is a regulator of secretory pathway, whose enhanced activity interferes with deposition of cell wall components and can fine-tune organ growth and sensitivity to soil pathogens.}, author = {Hurny, Andrej and Cuesta, Candela and Cavallari, Nicola and Ötvös, Krisztina and Duclercq, Jerome and DoklĂĄdal, Ladislav and Montesinos LĂłpez, Juan C and Gallemi, Marçal and Semeradova, Hana and Rauter, Thomas and Stenzel, Irene and Persiau, Geert and Benade, Freia and Bhalearo, Rishikesh and SĂœkorovĂĄ, Eva and GorzsĂĄs, AndrĂĄs and Sechet, Julien and Mouille, Gregory and Heilmann, Ingo and De Jaeger, Geert and Ludwig-MĂŒller, Jutta and BenkovĂĄ, Eva}, issn = {20411723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Synergistic on Auxin and Cytokinin 1 positively regulates growth and attenuates soil pathogen resistance}}, doi = {10.1038/s41467-020-15895-5}, volume = {11}, year = {2020}, } @inproceedings{7806, abstract = {We consider the following decision problem EMBEDk→d in computational topology (where k ≀ d are fixed positive integers): Given a finite simplicial complex K of dimension k, does there exist a (piecewise-linear) embedding of K into ℝd? The special case EMBED1→2 is graph planarity, which is decidable in linear time, as shown by Hopcroft and Tarjan. In higher dimensions, EMBED2→3 and EMBED3→3 are known to be decidable (as well as NP-hard), and recent results of Čadek et al. in computational homotopy theory, in combination with the classical Haefliger–Weber theorem in geometric topology, imply that EMBEDk→d can be solved in polynomial time for any fixed pair (k, d) of dimensions in the so-called metastable range . Here, by contrast, we prove that EMBEDk→d is algorithmically undecidable for almost all pairs of dimensions outside the metastable range, namely for . This almost completely resolves the decidability vs. undecidability of EMBEDk→d in higher dimensions and establishes a sharp dichotomy between polynomial-time solvability and undecidability. Our result complements (and in a wide range of dimensions strengthens) earlier results of MatouĆĄek, Tancer, and the second author, who showed that EMBEDk→d is undecidable for 4 ≀ k Ï” {d – 1, d}, and NP-hard for all remaining pairs (k, d) outside the metastable range and satisfying d ≄ 4.}, author = {FilakovskĂœ, Marek and Wagner, Uli and Zhechev, Stephan Y}, booktitle = {Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms}, isbn = {9781611975994}, location = {Salt Lake City, UT, United States}, pages = {767--785}, publisher = {SIAM}, title = {{Embeddability of simplicial complexes is undecidable}}, doi = {10.1137/1.9781611975994.47}, volume = {2020-January}, 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}, } @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{7810, abstract = {Interprocedural data-flow analyses form an expressive and useful paradigm of numerous static analysis applications, such as live variables analysis, alias analysis and null pointers analysis. The most widely-used framework for interprocedural data-flow analysis is IFDS, which encompasses distributive data-flow functions over a finite domain. On-demand data-flow analyses restrict the focus of the analysis on specific program locations and data facts. This setting provides a natural split between (i) an offline (or preprocessing) phase, where the program is partially analyzed and analysis summaries are created, and (ii) an online (or query) phase, where analysis queries arrive on demand and the summaries are used to speed up answering queries. In this work, we consider on-demand IFDS analyses where the queries concern program locations of the same procedure (aka same-context queries). We exploit the fact that flow graphs of programs have low treewidth to develop faster algorithms that are space and time optimal for many common data-flow analyses, in both the preprocessing and the query phase. We also use treewidth to develop query solutions that are embarrassingly parallelizable, i.e. the total work for answering each query is split to a number of threads such that each thread performs only a constant amount of work. Finally, we implement a static analyzer based on our algorithms, and perform a series of on-demand analysis experiments on standard benchmarks. Our experimental results show a drastic speed-up of the queries after only a lightweight preprocessing phase, which significantly outperforms existing techniques.}, author = {Chatterjee, Krishnendu and Goharshady, Amir Kafshdar and Ibsen-Jensen, Rasmus and Pavlogiannis, Andreas}, booktitle = {European Symposium on Programming}, isbn = {9783030449131}, issn = {16113349}, location = {Dublin, Ireland}, pages = {112--140}, publisher = {Springer Nature}, title = {{Optimal and perfectly parallel algorithms for on-demand data-flow analysis}}, doi = {10.1007/978-3-030-44914-8_5}, volume = {12075}, year = {2020}, } @article{7814, abstract = {Scientific research is to date largely restricted to wealthy laboratories in developed nations due to the necessity of complex and expensive equipment. This inequality limits the capacity of science to be used as a diplomatic channel. Maker movements use open-source technologies including additive manufacturing (3D printing) and laser cutting, together with low-cost computers for developing novel products. This movement is setting the groundwork for a revolution, allowing scientific equipment to be sourced at a fraction of the cost and has the potential to increase the availability of equipment for scientists around the world. Science education is increasingly recognized as another channel for science diplomacy. In this perspective, we introduce the idea that the Maker movement and open-source technologies have the potential to revolutionize science, technology, engineering and mathematics (STEM) education worldwide. We present an open-source STEM didactic tool called SCOPES (Sparking Curiosity through Open-source Platforms in Education and Science). SCOPES is self-contained, independent of local resources, and cost-effective. SCOPES can be adapted to communicate complex subjects from genetics to neurobiology, perform real-world biological experiments and explore digitized scientific samples. We envision such platforms will enhance science diplomacy by providing a means for scientists to share their findings with classrooms and for educators to incorporate didactic concepts into STEM lessons. By providing students the opportunity to design, perform, and share scientific experiments, students also experience firsthand the benefits of a multinational scientific community. We provide instructions on how to build and use SCOPES on our webpage: http://scopeseducation.org.}, author = {Beattie, Robert J and Hippenmeyer, Simon and Pauler, Florian}, issn = {2504-284X}, journal = {Frontiers in Education}, publisher = {Frontiers Media}, title = {{SCOPES: Sparking curiosity through Open-Source platforms in education and science}}, doi = {10.3389/feduc.2020.00048}, volume = {5}, year = {2020}, } @article{7815, abstract = {Beginning from a limited pool of progenitors, the mammalian cerebral cortex forms highly organized functional neural circuits. However, the underlying cellular and molecular mechanisms regulating lineage transitions of neural stem cells (NSCs) and eventual production of neurons and glia in the developing neuroepithelium remains unclear. Methods to trace NSC division patterns and map the lineage of clonally related cells have advanced dramatically. However, many contemporary lineage tracing techniques suffer from the lack of cellular resolution of progeny cell fate, which is essential for deciphering progenitor cell division patterns. Presented is a protocol using mosaic analysis with double markers (MADM) to perform in vivo clonal analysis. MADM concomitantly manipulates individual progenitor cells and visualizes precise division patterns and lineage progression at unprecedented single cell resolution. MADM-based interchromosomal recombination events during the G2-X phase of mitosis, together with temporally inducible CreERT2, provide exact information on the birth dates of clones and their division patterns. Thus, MADM lineage tracing provides unprecedented qualitative and quantitative optical readouts of the proliferation mode of stem cell progenitors at the single cell level. MADM also allows for examination of the mechanisms and functional requirements of candidate genes in NSC lineage progression. This method is unique in that comparative analysis of control and mutant subclones can be performed in the same tissue environment in vivo. Here, the protocol is described in detail, and experimental paradigms to employ MADM for clonal analysis and lineage tracing in the developing cerebral cortex are demonstrated. Importantly, this protocol can be adapted to perform MADM clonal analysis in any murine stem cell niche, as long as the CreERT2 driver is present.}, author = {Beattie, Robert J and Streicher, Carmen and Amberg, Nicole and Cheung, Giselle T and Contreras, Ximena and Hansen, Andi H and Hippenmeyer, Simon}, issn = {1940-087X}, journal = {Journal of Visual Experiments}, number = {159}, publisher = {MyJove Corporation}, title = {{Lineage tracing and clonal analysis in developing cerebral cortex using mosaic analysis with double markers (MADM)}}, doi = {10.3791/61147}, year = {2020}, } @article{7847, abstract = {Water-in-salt electrolytes based on highly concentrated bis(trifluoromethyl)sulfonimide (TFSI) promise aqueous electrolytes with stabilities nearing 3 V. However, especially with an electrode approaching the cathodic (reductive) stability, cycling stability is insufficient. While stability critically relies on a solid electrolyte interphase (SEI), the mechanism behind the cathodic stability limit remains unclear. Here, we reveal two distinct reduction potentials for the chemical environments of 'free' and 'bound' water and that both contribute to SEI formation. Free-water is reduced ~1V above bound water in a hydrogen evolution reaction (HER) and responsible for SEI formation via reactive intermediates of the HER; concurrent LiTFSI precipitation/dissolution establishes a dynamic interface. The free-water population emerges, therefore, as the handle to extend the cathodic limit of aqueous electrolytes and the battery cycling stability. }, author = {Bouchal, Roza and Li, Zhujie and Bongu, Chandra and Le Vot, Steven and Berthelot, Romain and Rotenberg, Benjamin and Favier, FrĂ©deric and Freunberger, Stefan Alexander and Salanne, Mathieu and Fontaine, Olivier}, issn = {1521-3773}, journal = {Angewandte Chemie International Edition}, number = {37}, pages = {15913--1591}, publisher = {Wiley}, title = {{Competitive salt precipitation/dissolution during free‐water reduction in water‐in‐salt electrolyte}}, doi = {10.1002/anie.202005378}, volume = {59}, year = {2020}, } @article{7864, abstract = {Purpose of review: Cancer is one of the leading causes of death and the incidence rates are constantly rising. The heterogeneity of tumors poses a big challenge for the treatment of the disease and natural antibodies additionally affect disease progression. The introduction of engineered mAbs for anticancer immunotherapies has substantially improved progression-free and overall survival of cancer patients, but little efforts have been made to exploit other antibody isotypes than IgG. Recent findings: In order to improve these therapies, ‘next-generation antibodies’ were engineered to enhance a specific feature of classical antibodies and form a group of highly effective and precise therapy compounds. Advanced antibody approaches include among others antibody-drug conjugates, glyco-engineered and Fc-engineered antibodies, antibody fragments, radioimmunotherapy compounds, bispecific antibodies and alternative (non-IgG) immunoglobulin classes, especially IgE. Summary: The current review describes solutions for the needs of next-generation antibody therapies through different approaches. Careful selection of the best-suited engineering methodology is a key factor in developing personalized, more specific and more efficient mAbs against cancer to improve the outcomes of cancer patients. We highlight here the large evidence of IgE exploiting a highly cytotoxic effector arm as potential next-generation anticancer immunotherapy.}, author = {Singer, Judit and Singer, Josef and Jensen-Jarolim, Erika}, issn = {14736322}, journal = {Current opinion in allergy and clinical immunology}, number = {3}, pages = {282--289}, publisher = {Wolters Kluwer}, title = {{Precision medicine in clinical oncology: the journey from IgG antibody to IgE}}, doi = {10.1097/ACI.0000000000000637}, volume = {20}, year = {2020}, } @article{7866, abstract = {In this paper, we establish convergence to equilibrium for a drift–diffusion–recombination system modelling the charge transport within certain semiconductor devices. More precisely, we consider a two-level system for electrons and holes which is augmented by an intermediate energy level for electrons in so-called trapped states. The recombination dynamics use the mass action principle by taking into account this additional trap level. The main part of the paper is concerned with the derivation of an entropy–entropy production inequality, which entails exponential convergence to the equilibrium via the so-called entropy method. The novelty of our approach lies in the fact that the entropy method is applied uniformly in a fast-reaction parameter which governs the lifetime of electrons on the trap level. Thus, the resulting decay estimate for the densities of electrons and holes extends to the corresponding quasi-steady-state approximation.}, author = {Fellner, Klemens and Kniely, Michael}, issn = {22969039}, journal = {Journal of Elliptic and Parabolic Equations}, pages = {529--598}, publisher = {Springer Nature}, title = {{Uniform convergence to equilibrium for a family of drift–diffusion models with trap-assisted recombination and the limiting Shockley–Read–Hall model}}, doi = {10.1007/s41808-020-00068-8}, volume = {6}, year = {2020}, } @article{7875, abstract = {Cells navigating through complex tissues face a fundamental challenge: while multiple protrusions explore different paths, the cell needs to avoid entanglement. How a cell surveys and then corrects its own shape is poorly understood. Here, we demonstrate that spatially distinct microtubule dynamics regulate amoeboid cell migration by locally promoting the retraction of protrusions. In migrating dendritic cells, local microtubule depolymerization within protrusions remote from the microtubule organizing center triggers actomyosin contractility controlled by RhoA and its exchange factor Lfc. Depletion of Lfc leads to aberrant myosin localization, thereby causing two effects that rate-limit locomotion: (1) impaired cell edge coordination during path finding and (2) defective adhesion resolution. Compromised shape control is particularly hindering in geometrically complex microenvironments, where it leads to entanglement and ultimately fragmentation of the cell body. We thus demonstrate that microtubules can act as a proprioceptive device: they sense cell shape and control actomyosin retraction to sustain cellular coherence.}, author = {Kopf, Aglaja and Renkawitz, Jörg and Hauschild, Robert and Girkontaite, Irute and Tedford, Kerry and Merrin, Jack and Thorn-Seshold, Oliver and Trauner, Dirk and HĂ€cker, Hans and Fischer, Klaus Dieter and Kiermaier, Eva and Sixt, Michael K}, issn = {1540-8140}, journal = {The Journal of Cell Biology}, number = {6}, publisher = {Rockefeller University Press}, title = {{Microtubules control cellular shape and coherence in amoeboid migrating cells}}, doi = {10.1083/jcb.201907154}, volume = {219}, year = {2020}, } @article{7876, abstract = {In contrast to lymph nodes, the lymphoid regions of the spleen—the white pulp—are located deep within the organ, yielding the trafficking paths of T cells in the white pulp largely invisible. In an intravital microscopy tour de force reported in this issue of Immunity, Chauveau et al. show that T cells perform unidirectional, perivascular migration through the enigmatic marginal zone bridging channels. }, author = {Sixt, Michael K and LĂ€mmermann, Tim}, issn = {10974180}, journal = {Immunity}, number = {5}, pages = {721--723}, publisher = {Elsevier}, title = {{T cells: Bridge-and-channel commute to the white pulp}}, doi = {10.1016/j.immuni.2020.04.020}, volume = {52}, year = {2020}, } @article{7877, abstract = {The NIPBL/MAU2 heterodimer loads cohesin onto chromatin. Mutations inNIPBLaccount for most cases ofthe rare developmental disorder Cornelia de Lange syndrome (CdLS). Here we report aMAU2 variant causing CdLS, a deletion of seven amino acids that impairs the interaction between MAU2 and the NIPBL N terminus.Investigating this interaction, we discovered that MAU2 and the NIPBL N terminus are largely dispensable fornormal cohesin and NIPBL function in cells with a NIPBL early truncating mutation. Despite a predicted fataloutcome of an out-of-frame single nucleotide duplication inNIPBL, engineered in two different cell lines,alternative translation initiation yields a form of NIPBL missing N-terminal residues. This form cannot interactwith MAU2, but binds DNA and mediates cohesin loading. Altogether, our work reveals that cohesin loading can occur independently of functional NIPBL/MAU2 complexes and highlights a novel mechanism protectiveagainst out-of-frame mutations that is potentially relevant for other genetic conditions.}, author = {Parenti, Ilaria and Diab, Farah and Gil, Sara Ruiz and Mulugeta, Eskeatnaf and Casa, Valentina and Berutti, Riccardo and Brouwer, Rutger W.W. and DupĂ©, Valerie and Eckhold, Juliane and Graf, Elisabeth and Puisac, Beatriz and Ramos, Feliciano and Schwarzmayr, Thomas and Gines, Macarena Moronta and Van Staveren, Thomas and Van Ijcken, Wilfred F.J. and Strom, Tim M. and PiĂ©, Juan and Watrin, Erwan and Kaiser, Frank J. and Wendt, Kerstin S.}, issn = {22111247}, journal = {Cell Reports}, number = {7}, publisher = {Elsevier}, title = {{MAU2 and NIPBL variants impair the heterodimerization of the cohesin loader subunits and cause Cornelia de Lange syndrome}}, doi = {10.1016/j.celrep.2020.107647}, volume = {31}, year = {2020}, }