@article{8329,
abstract = {We show the synthesis of a redox‐active quinone, 2‐methoxy‐1,4‐hydroquinone (MHQ), from a bio‐based feedstock and its suitability as electrolyte in aqueous redox flow batteries. We identified semiquinone intermediates at insufficiently low pH and quinoid radicals as responsible for decomposition of MHQ under electrochemical conditions. Both can be avoided and/or stabilized, respectively, using H 3 PO 4 electrolyte, allowing for reversible cycling in a redox flow battery for hundreds of cycles.},
author = {Schlemmer, Werner and Nothdurft, Philipp and Petzold, Alina and Frühwirt, Philipp and Schmallegger, Max and Gescheidt-Demner, Georg and Fischer, Roland and Freunberger, Stefan Alexander and Kern, Wolfgang and Spirk, Stefan},
issn = {1521-3773},
journal = {Angewandte Chemie International Edition},
number = {51},
pages = {22943--22946},
publisher = {Wiley},
title = {{2‐methoxyhydroquinone from vanillin for aqueous redox‐flow batteries}},
doi = {10.1002/anie.202008253},
volume = {59},
year = {2020},
}
@article{8361,
abstract = {With the lithium-ion technology approaching its intrinsic limit with graphite-based anodes, Li metal is recently receiving renewed interest from the battery community as potential high capacity anode for next-generation rechargeable batteries. In this focus paper, we review the main advances in this field since the first attempts in the mid-1970s. Strategies for enabling reversible cycling and avoiding dendrite growth are thoroughly discussed, including specific applications in all-solid-state (inorganic and polymeric), Lithium–Sulfur (Li–S) and Lithium-O2 (air) batteries. A particular attention is paid to recent developments of these battery technologies and their current state with respect to the 2030 targets of the EU Integrated Strategic Energy Technology Plan (SET-Plan) Action 7.},
author = {Varzi, Alberto and Thanner, Katharina and Scipioni, Roberto and Di Lecce, Daniele and Hassoun, Jusef and Dörfler, Susanne and Altheus, Holger and Kaskel, Stefan and Prehal, Christian and Freunberger, Stefan Alexander},
issn = {0378-7753},
journal = {Journal of Power Sources},
number = {12},
publisher = {Elsevier},
title = {{Current status and future perspectives of lithium metal batteries}},
doi = {10.1016/j.jpowsour.2020.228803},
volume = {480},
year = {2020},
}
@inproceedings{8382,
abstract = {We present the first deterministic wait-free long-lived snapshot algorithm, using only read and write operations, that guarantees polylogarithmic amortized step complexity in all executions. This is the first non-blocking snapshot algorithm, using reads and writes only, that has sub-linear amortized step complexity in executions of arbitrary length. The key to our construction is a novel implementation of a 2-component max array object which may be of independent interest.},
author = {Baig, Mirza Ahad and Hendler, Danny and Milani, Alessia and Travers, Corentin},
booktitle = {Proceedings of the 39th Symposium on Principles of Distributed Computing},
isbn = {9781450375825},
location = {Virtual, Italy},
pages = {31--40},
publisher = {Association for Computing Machinery},
title = {{Long-lived snapshots with polylogarithmic amortized step complexity}},
doi = {10.1145/3382734.3406005},
year = {2020},
}
@inproceedings{8383,
abstract = {We introduce extension-based proofs, a class of impossibility proofs that includes valency arguments. They are modelled as an interaction between a prover and a protocol. Using proofs based on combinatorial topology, it has been shown that it is impossible to deterministically solve k-set agreement among n > k ≥ 2 processes in a wait-free manner. However, it was unknown whether proofs based on simpler techniques were possible. We explain why this impossibility result cannot be obtained by an extension-based proof and, hence, extension-based proofs are limited in power.},
author = {Alistarh, Dan-Adrian and Aspnes, James and Ellen, Faith and Gelashvili, Rati and Zhu, Leqi},
booktitle = {Proceedings of the 39th Symposium on Principles of Distributed Computing},
isbn = {9781450375825},
location = {Virtual, Italy},
pages = {54--56},
publisher = {Association for Computing Machinery},
title = {{Brief Announcement: Why Extension-Based Proofs Fail}},
doi = {10.1145/3382734.3405743},
year = {2020},
}
@article{8402,
abstract = {Background: The mitochondrial pyruvate carrier (MPC) plays a central role in energy metabolism by transporting pyruvate across the inner mitochondrial membrane. Its heterodimeric composition and homology to SWEET and semiSWEET transporters set the MPC apart from the canonical mitochondrial carrier family (named MCF or SLC25). The import of the canonical carriers is mediated by the carrier translocase of the inner membrane (TIM22) pathway and is dependent on their structure, which features an even number of transmembrane segments and both termini in the intermembrane space. The import pathway of MPC proteins has not been elucidated. The odd number of transmembrane segments and positioning of the N-terminus in the matrix argues against an import via the TIM22 carrier pathway but favors an import via the flexible presequence pathway.
Results: Here, we systematically analyzed the import pathways of Mpc2 and Mpc3 and report that, contrary to an expected import via the flexible presequence pathway, yeast MPC proteins with an odd number of transmembrane segments and matrix-exposed N-terminus are imported by the carrier pathway, using the receptor Tom70, small TIM chaperones, and the TIM22 complex. The TIM9·10 complex chaperones MPC proteins through the mitochondrial intermembrane space using conserved hydrophobic motifs that are also required for the interaction with canonical carrier proteins.
Conclusions: The carrier pathway can import paired and non-paired transmembrane helices and translocate N-termini to either side of the mitochondrial inner membrane, revealing an unexpected versatility of the mitochondrial import pathway for non-cleavable inner membrane proteins.},
author = {Rampelt, Heike and Sucec, Iva and Bersch, Beate and Horten, Patrick and Perschil, Inge and Martinou, Jean-Claude and van der Laan, Martin and Wiedemann, Nils and Schanda, Paul and Pfanner, Nikolaus},
issn = {1741-7007},
journal = {BMC Biology},
keywords = {Biotechnology, Plant Science, General Biochemistry, Genetics and Molecular Biology, Developmental Biology, Cell Biology, Physiology, Ecology, Evolution, Behavior and Systematics, Structural Biology, General Agricultural and Biological Sciences},
publisher = {Springer Nature},
title = {{The mitochondrial carrier pathway transports non-canonical substrates with an odd number of transmembrane segments}},
doi = {10.1186/s12915-019-0733-6},
volume = {18},
year = {2020},
}
@unpublished{8403,
abstract = {Chaperones are essential for assisting protein folding, and for transferring poorly soluble proteins to their functional locations within cells. Hydrophobic interactions drive promiscuous chaperone–client binding, but our understanding of how additional interactions enable client specificity is sparse. Here we decipher what determines binding of two chaperones (TIM8·13, TIM9·10) to different integral membrane proteins, the all-transmembrane mitochondrial carrier Ggc1, and Tim23 which has an additional disordered hydrophilic domain. Combining NMR, SAXS and molecular dynamics simulations, we determine the structures of Tim23/TIM8·13 and Tim23/TIM9·10 complexes. TIM8·13 uses transient salt bridges to interact with the hydrophilic part of its client, but its interactions to the transmembrane part are weaker than in TIM9·10. Consequently, TIM9·10 outcompetes TIM8·13 in binding hydrophobic clients, while TIM8·13 is tuned to few clients with both hydrophilic and hydrophobic parts. Our study exemplifies how chaperones fine-tune the balance of promiscuity vs. specificity.},
author = {Sučec, Iva and Wang, Yong and Dakhlaoui, Ons and Weinhäupl, Katharina and Jores, Tobias and Costa, Doriane and Hessel, Audrey and Brennich, Martha and Rapaport, Doron and Lindorff-Larsen, Kresten and Bersch, Beate and Schanda, Paul},
booktitle = {bioRxiv},
publisher = {Cold Spring Harbor Laboratory},
title = {{Structural basis of client specificity in mitochondrial membrane-protein chaperones}},
doi = {10.1101/2020.06.08.140772},
year = {2020},
}
@unpublished{8404,
abstract = {The mitochondrial Tim chaperones are responsible for the transport of membrane proteins across the inter-membrane space to the inner and outer mitochondrial membranes. TIM9·10, a hexameric 70 kDa protein complex formed by 3 copies of Tim9 and Tim10, guides its clients across the aqueous compartment. The TIM9·10·12 complex is the anchor point at the inner-membrane insertase complex TIM22. The mechanism of client transport by TIM9·10 has been resolved recently, but the structure and subunit composition of the TIM9·10·12 complex remains largely unresolved. Furthermore, the assembly process of the hexameric TIM chaperones from its subunits remained elusive. We investigate the structural and dynamical properties of the Tim subunits, and show that they are highly dynamic. In their non-assembled form, the subunits behave as intrinsically disordered proteins; when the conserved cysteines of the CX3C-Xn-CX3C motifs are formed, short marginally stable α-helices are formed, which are only fully stabilized upon hexamer formation to the mature chaperone. Subunits are in equilibrium between their hexamer-embedded and a free form, with exchange kinetics on a minutes time scale. Joint NMR, small-angle X-ray scattering and MD simulation data allow us to derive a structural model of the TIM9·10·12 assembly, which has a 2:3:1 stoichiometry (Tim9:Tim10:Tim12) with a conserved hydrophobic client-binding groove and flexible N- and C-terminal tentacles.},
author = {Weinhäupl, Katharina and Wang, Yong and Hessel, Audrey and Brennich, Martha and Lindorff-Larsen, Kresten and Schanda, Paul},
booktitle = {bioRxiv},
publisher = {Cold Spring Harbor Laboratory},
title = {{Architecture and subunit dynamics of the mitochondrial TIM9·10·12 chaperone}},
doi = {10.1101/2020.03.13.990150},
year = {2020},
}
@book{8414,
abstract = {Arnold diffusion, which concerns the appearance of chaos in classical mechanics, is one of the most important problems in the fields of dynamical systems and mathematical physics. Since it was discovered by Vladimir Arnold in 1963, it has attracted the efforts of some of the most prominent researchers in mathematics. The question is whether a typical perturbation of a particular system will result in chaotic or unstable dynamical phenomena. In this groundbreaking book, Vadim Kaloshin and Ke Zhang provide the first complete proof of Arnold diffusion, demonstrating that that there is topological instability for typical perturbations of five-dimensional integrable systems (two and a half degrees of freedom).
This proof realizes a plan John Mather announced in 2003 but was unable to complete before his death. Kaloshin and Zhang follow Mather’s strategy but emphasize a more Hamiltonian approach, tying together normal forms theory, hyperbolic theory, Mather theory, and weak KAM theory. Offering a complete, clean, and modern explanation of the steps involved in the proof, and a clear account of background material, this book is designed to be accessible to students as well as researchers. The result is a critical contribution to mathematical physics and dynamical systems, especially Hamiltonian systems.},
author = {Kaloshin, Vadim and Zhang, Ke},
isbn = {9-780-6912-0253-2},
pages = {224},
publisher = {Princeton University Press},
title = {{Arnold Diffusion for Smooth Systems of Two and a Half Degrees of Freedom}},
doi = {10.1515/9780691204932},
volume = {208},
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 = {1868-8969},
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 = {1868-8969},
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},
}
@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 = {2157-8095},
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{8539,
abstract = {Cohomological and K-theoretic stable bases originated from the study of quantum cohomology and quantum K-theory. Restriction formula for cohomological stable bases played an important role in computing the quantum connection of cotangent bundle of partial flag varieties. In this paper we study the K-theoretic stable bases of cotangent bundles of flag varieties. We describe these bases in terms of the action of the affine Hecke algebra and the twisted group algebra of KostantKumar. Using this algebraic description and the method of root polynomials, we give a restriction formula of the stable bases. We apply it to obtain the restriction formula for partial flag varieties. We also build a relation between the stable basis and the Casselman basis in the principal series representations of the Langlands dual group. As an application, we give a closed formula for the transition matrix between Casselman basis and the characteristic functions.},
author = {Su, C. and Zhao, Gufang and Zhong, C.},
issn = {0012-9593},
journal = {Annales Scientifiques de l'Ecole Normale Superieure},
number = {3},
pages = {663--671},
publisher = {Société Mathématique de France},
title = {{On the K-theory stable bases of the springer resolution}},
doi = {10.24033/asens.2431},
volume = {53},
year = {2020},
}
@article{8568,
abstract = {Aqueous iodine based electrochemical energy storage is considered a potential candidate to improve sustainability and performance of current battery and supercapacitor technology. It harnesses the redox activity of iodide, iodine, and polyiodide species in the confined geometry of nanoporous carbon electrodes. However, current descriptions of the electrochemical reaction mechanism to interconvert these species are elusive. Here we show that electrochemical oxidation of iodide in nanoporous carbons forms persistent solid iodine deposits. Confinement slows down dissolution into triiodide and pentaiodide, responsible for otherwise significant self-discharge via shuttling. The main tools for these insights are in situ Raman spectroscopy and in situ small and wide-angle X-ray scattering (in situ SAXS/WAXS). In situ Raman confirms the reversible formation of triiodide and pentaiodide. In situ SAXS/WAXS indicates remarkable amounts of solid iodine deposited in the carbon nanopores. Combined with stochastic modeling, in situ SAXS allows quantifying the solid iodine volume fraction and visualizing the iodine structure on 3D lattice models at the sub-nanometer scale. Based on the derived mechanism, we demonstrate strategies for improved iodine pore filling capacity and prevention of self-discharge, applicable to hybrid supercapacitors and batteries.},
author = {Prehal, Christian and Fitzek, Harald and Kothleitner, Gerald and Presser, Volker and Gollas, Bernhard and Freunberger, Stefan Alexander and Abbas, Qamar},
issn = {2041-1723},
journal = {Nature Communications},
keywords = {General Biochemistry, Genetics and Molecular Biology, General Physics and Astronomy, General Chemistry},
publisher = {Springer Nature},
title = {{Persistent and reversible solid iodine electrodeposition in nanoporous carbons}},
doi = {10.1038/s41467-020-18610-6},
volume = {11},
year = {2020},
}
@inproceedings{8571,
abstract = {We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2020. This year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. These tools are applied to solve reachability analysis problems on six benchmark problems, two of them featuring hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools.},
author = {Geretti, Luca and Alexandre Dit Sandretto, Julien and Althoff, Matthias and Benet, Luis and Chapoutot, Alexandre and Chen, Xin and Collins, Pieter and Forets, Marcelo and Freire, Daniel and Immler, Fabian and Kochdumper, Niklas and Sanders, David and Schilling, Christian},
booktitle = {EPiC Series in Computing},
pages = {49--75},
publisher = {EasyChair},
title = {{ARCH-COMP20 Category Report: Continuous and hybrid systems with nonlinear dynamics}},
doi = {10.29007/zkf6},
volume = {74},
year = {2020},
}
@inproceedings{8572,
abstract = {We present the results of the ARCH 2020 friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. In its fourth edition, eight tools have been applied to solve eight different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, C2E2, HyDRA, Hylaa, Hylaa-Continuous, JuliaReach, SpaceEx, and XSpeed. This report is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results provide one of the most complete assessments of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date.},
author = {Althoff, Matthias and Bak, Stanley and Bao, Zongnan and Forets, Marcelo and Frehse, Goran and Freire, Daniel and Kochdumper, Niklas and Li, Yangge and Mitra, Sayan and Ray, Rajarshi and Schilling, Christian and Schupp, Stefan and Wetzlinger, Mark},
booktitle = {EPiC Series in Computing},
pages = {16--48},
publisher = {EasyChair},
title = {{ARCH-COMP20 Category Report: Continuous and hybrid systems with linear dynamics}},
doi = {10.29007/7dt2},
volume = {74},
year = {2020},
}
@inproceedings{8580,
abstract = {We evaluate the usefulness of persistent homology in the analysis of heart rate variability. In our approach we extract several topological descriptors characterising datasets of RR-intervals, which are later used in classical machine learning algorithms. By this method we are able to differentiate the group of patients with the history of transient ischemic attack and the group of hypertensive patients.},
author = {Graff, Grzegorz and Graff, Beata and Jablonski, Grzegorz and Narkiewicz, Krzysztof},
booktitle = {11th Conference of the European Study Group on Cardiovascular Oscillations: Computation and Modelling in Physiology: New Challenges and Opportunities, },
isbn = {9781728157511},
location = {Pisa, Italy},
publisher = {IEEE},
title = {{The application of persistent homology in the analysis of heart rate variability}},
doi = {10.1109/ESGCO49734.2020.9158054},
year = {2020},
}
@article{8581,
abstract = {The majority of adenosine triphosphate (ATP) powering cellular processes in eukaryotes is produced by the mitochondrial F1Fo ATP synthase. Here, we present the atomic models of the membrane Fo domain and the entire mammalian (ovine) F1Fo, determined by cryo-electron microscopy. Subunits in the membrane domain are arranged in the ‘proton translocation cluster’ attached to the c-ring and a more distant ‘hook apparatus’ holding subunit e. Unexpectedly, this subunit is anchored to a lipid ‘plug’ capping the c-ring. We present a detailed proton translocation pathway in mammalian Fo and key inter-monomer contacts in F1Fo multimers. Cryo-EM maps of F1Fo exposed to calcium reveal a retracted subunit e and a disassembled c-ring, suggesting permeability transition pore opening. We propose a model for the permeability transition pore opening, whereby subunit e pulls the lipid plug out of the c-ring. Our structure will allow the design of drugs for many emerging applications in medicine.},
author = {Pinke, Gergely and Zhou, Long and Sazanov, Leonid A},
issn = {1545-9985},
journal = {Nature Structural and Molecular Biology},
number = {11},
pages = {1077--1085},
publisher = {Springer Nature},
title = {{Cryo-EM structure of the entire mammalian F-type ATP synthase}},
doi = {10.1038/s41594-020-0503-8},
volume = {27},
year = {2020},
}
@article{8588,
abstract = {Dipolar (or spatially indirect) excitons (IXs) in semiconductor double quantum well (DQW) subjected to an electric field are neutral species with a dipole moment oriented perpendicular to the DQW plane. Here, we theoretically study interactions between IXs in stacked DQW bilayers, where the dipolar coupling can be either attractive or repulsive depending on the relative positions of the particles. By using microscopic band structure calculations to determine the electronic states forming the excitons, we show that the attractive dipolar interaction between stacked IXs deforms their electronic wave function, thereby increasing the inter-DQW interaction energy and making the IX even more electrically polarizable. Many-particle interaction effects are addressed by considering the coupling between a single IX in one of the DQWs to a cloud of IXs in the other DQW, which is modeled either as a closed-packed lattice or as a continuum IX fluid. We find that the lattice model yields IX interlayer binding energies decreasing with increasing lattice density. This behavior is due to the dominating role of the intra-DQW dipolar repulsion, which prevents more than one exciton from entering the attractive region of the inter-DQW coupling. Finally, both models shows that the single IX distorts the distribution of IXs in the adjacent DQW, thus inducing the formation of an IX dipolar polaron (dipolaron). While the interlayer binding energy reduces with IX density for lattice dipolarons, the continuous polaron model predicts a nonmonotonous dependence on density in semiquantitative agreement with a recent experimental study [cf. Hubert et al., Phys. Rev. X 9, 021026 (2019)].},
author = {Hubert, C. and Cohen, K. and Ghazaryan, Areg and Lemeshko, Mikhail and Rapaport, R. and Santos, P. V.},
issn = {2469-9969},
journal = {Physical Review B},
number = {4},
publisher = {American Physical Society},
title = {{Attractive interactions, molecular complexes, and polarons in coupled dipolar exciton fluids}},
doi = {10.1103/physrevb.102.045307},
volume = {102},
year = {2020},
}
@article{8592,
abstract = {Glioblastoma is the most malignant cancer in the brain and currently incurable. It is urgent to identify effective targets for this lethal disease. Inhibition of such targets should suppress the growth of cancer cells and, ideally also precancerous cells for early prevention, but minimally affect their normal counterparts. Using genetic mouse models with neural stem cells (NSCs) or oligodendrocyte precursor cells (OPCs) as the cells‐of‐origin/mutation, it is shown that the susceptibility of cells within the development hierarchy of glioma to the knockout of insulin‐like growth factor I receptor (IGF1R) is determined not only by their oncogenic states, but also by their cell identities/states. Knockout of IGF1R selectively disrupts the growth of mutant and transformed, but not normal OPCs, or NSCs. The desirable outcome of IGF1R knockout on cell growth requires the mutant cells to commit to the OPC identity regardless of its development hierarchical status. At the molecular level, oncogenic mutations reprogram the cellular network of OPCs and force them to depend more on IGF1R for their growth. A new‐generation brain‐penetrable, orally available IGF1R inhibitor harnessing tumor OPCs in the brain is also developed. The findings reveal the cellular window of IGF1R targeting and establish IGF1R as an effective target for the prevention and treatment of glioblastoma.},
author = {Tian, Anhao and Kang, Bo and Li, Baizhou and Qiu, Biying and Jiang, Wenhong and Shao, Fangjie and Gao, Qingqing and Liu, Rui and Cai, Chengwei and Jing, Rui and Wang, Wei and Chen, Pengxiang and Liang, Qinghui and Bao, Lili and Man, Jianghong and Wang, Yan and Shi, Yu and Li, Jin and Yang, Minmin and Wang, Lisha and Zhang, Jianmin and Hippenmeyer, Simon and Zhu, Junming and Bian, Xiuwu and Wang, Ying‐Jie and Liu, Chong},
issn = {2198-3844},
journal = {Advanced Science},
keywords = {General Engineering, General Physics and Astronomy, General Materials Science, Medicine (miscellaneous), General Chemical Engineering, Biochemistry, Genetics and Molecular Biology (miscellaneous)},
number = {21},
publisher = {Wiley},
title = {{Oncogenic state and cell identity combinatorially dictate the susceptibility of cells within glioma development hierarchy to IGF1R targeting}},
doi = {10.1002/advs.202001724},
volume = {7},
year = {2020},
}
@inproceedings{8599,
abstract = {A graph game is a two-player zero-sum game in which the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. In bidding games, both players have budgets, and in each turn, we hold an "auction" (bidding) to determine which player moves the token. In this survey, we consider several bidding mechanisms and study their effect on the properties of the game. Specifically, bidding games, and in particular bidding games of infinite duration, have an intriguing equivalence with random-turn games in which in each turn, the player who moves is chosen randomly. We show how minor changes in the bidding mechanism lead to unexpected differences in the equivalence with random-turn games.},
author = {Avni, Guy and Henzinger, Thomas A},
booktitle = {31st International Conference on Concurrency Theory},
isbn = {9783959771603},
issn = {1868-8969},
location = {Virtual},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
title = {{A survey of bidding games on graphs}},
doi = {10.4230/LIPIcs.CONCUR.2020.2},
volume = {171},
year = {2020},
}