@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},
}
@article{8597,
abstract = {Error analysis and data visualization of positive COVID-19 cases in 27 countries have been performed up to August 8, 2020. This survey generally observes a progression from early exponential growth transitioning to an intermediate power-law growth phase, as recently suggested by Ziff and Ziff. The occurrence of logistic growth after the power-law phase with lockdowns or social distancing may be described as an effect of avoidance. A visualization of the power-law growth exponent over short time windows is qualitatively similar to the Bhatia visualization for pandemic progression. Visualizations like these can indicate the onset of second waves and may influence social policy.},
author = {Merrin, Jack},
issn = {14783975},
journal = {Physical Biology},
number = {6},
publisher = {IOP Publishing},
title = {{Differences in power law growth over time and indicators of COVID-19 pandemic progression worldwide}},
doi = {10.1088/1478-3975/abb2db},
volume = {17},
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 = {18688969},
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},
}
@inproceedings{8600,
abstract = {A vector addition system with states (VASS) consists of a finite set of states and counters. A transition changes the current state to the next state, and every counter is either incremented, or decremented, or left unchanged. A state and value for each counter is a configuration; and a computation is an infinite sequence of configurations with transitions between successive configurations. A probabilistic VASS consists of a VASS along with a probability distribution over the transitions for each state. Qualitative properties such as state and configuration reachability have been widely studied for VASS. In this work we consider multi-dimensional long-run average objectives for VASS and probabilistic VASS. For a counter, the cost of a configuration is the value of the counter; and the long-run average value of a computation for the counter is the long-run average of the costs of the configurations in the computation. The multi-dimensional long-run average problem given a VASS and a threshold value for each counter, asks whether there is a computation such that for each counter the long-run average value for the counter does not exceed the respective threshold. For probabilistic VASS, instead of the existence of a computation, we consider whether the expected long-run average value for each counter does not exceed the respective threshold. Our main results are as follows: we show that the multi-dimensional long-run average problem (a) is NP-complete for integer-valued VASS; (b) is undecidable for natural-valued VASS (i.e., nonnegative counters); and (c) can be solved in polynomial time for probabilistic integer-valued VASS, and probabilistic natural-valued VASS when all computations are non-terminating.},
author = {Chatterjee, Krishnendu and Henzinger, Thomas A and Otop, Jan},
booktitle = {31st International Conference on Concurrency Theory},
isbn = {9783959771603},
issn = {18688969},
location = {Virtual},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
title = {{Multi-dimensional long-run average problems for vector addition systems with states}},
doi = {10.4230/LIPIcs.CONCUR.2020.23},
volume = {171},
year = {2020},
}
@article{8601,
abstract = {We consider large non-Hermitian real or complex random matrices X with independent, identically distributed centred entries. We prove that their local eigenvalue statistics near the spectral edge, the unit circle, coincide with those of the Ginibre ensemble, i.e. when the matrix elements of X are Gaussian. This result is the non-Hermitian counterpart of the universality of the Tracy–Widom distribution at the spectral edges of the Wigner ensemble.},
author = {Cipolloni, Giorgio and Erdös, László and Schröder, Dominik J},
issn = {14322064},
journal = {Probability Theory and Related Fields},
publisher = {Springer Nature},
title = {{Edge universality for non-Hermitian random matrices}},
doi = {10.1007/s00440-020-01003-7},
year = {2020},
}