@inproceedings{9040,
  abstract     = {Machine learning and formal methods have complimentary benefits and drawbacks. In this work, we address the controller-design problem with a combination of techniques from both fields. The use of black-box neural networks in deep reinforcement learning (deep RL) poses a challenge for such a combination. Instead of reasoning formally about the output of deep RL, which we call the wizard, we extract from it a decision-tree based model, which we refer to as the magic book. Using the extracted model as an intermediary, we are able to handle problems that are infeasible for either deep RL or formal methods by themselves. First, we suggest, for the first time, a synthesis procedure that is based on a magic book. We synthesize a stand-alone correct-by-design controller that enjoys the favorable performance of RL. Second, we incorporate a magic book in a bounded model checking (BMC) procedure. BMC allows us to find numerous traces of the plant under the control of the wizard, which a user can use to increase the trustworthiness of the wizard and direct further training.},
  author       = {Alamdari, Par Alizadeh and Avni, Guy and Henzinger, Thomas A and Lukina, Anna},
  booktitle    = {Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design},
  isbn         = {9783854480426},
  issn         = {2708-7824},
  location     = {Online Conference},
  pages        = {138--147},
  publisher    = {TU Wien Academic Press},
  title        = {{Formal methods with a touch of magic}},
  doi          = {10.34727/2020/isbn.978-3-85448-042-6_21},
  year         = {2020},
}

@inbook{9096,
  author       = {Schmid-Hempel, Paul and Cremer, Sylvia M},
  booktitle    = {Encyclopedia of Social Insects},
  editor       = {Starr, C},
  isbn         = {9783319903064},
  publisher    = {Springer Nature},
  title        = {{Parasites and Pathogens}},
  doi          = {10.1007/978-3-319-90306-4_94-1},
  year         = {2020},
}

@article{9129,
  abstract     = {We investigate the role of a warm sea surface temperature (SST) anomaly (hot spot of typically 3 to 5 K) on the aggregation of convection using cloud-resolving simulations in a nonrotating framework. It is well known that SST gradients can spatially organize convection. Even with uniform SST, the spontaneous self-aggregation of convection is possible above a critical SST (here 295 K), arising mainly from radiative feedbacks. We investigate how a circular hot spot helps organize convection, and how self-aggregation feedbacks modulate this organization. The hot spot significantly accelerates aggregation, particularly for warmer/larger hot spots, and extends the range of SSTs for which aggregation occurs; however, at cold SST (290 K) the aggregated cluster disaggregates if we remove the hot spot. A large convective instability over the hot spot leads to stronger convection and generates a large-scale circulation which forces the subsidence drying outside the hot spot. Indeed, convection over the hot spot brings the atmosphere toward a warmer temperature. The warmer temperatures are imprinted over the whole domain by gravity waves and subsidence warming. The initial transient warming and concomitant subsidence drying suppress convection outside the hot spot, thus driving the aggregation. The hot-spot-induced large-scale circulation can enforce the aggregation even without radiative feedbacks for hot spots sufficiently large/warm. The strength of the large-scale circulation, which defines the speed of aggregation, is a function of the hot spot fractional area. At equilibrium, once the aggregation is well established, the moist convective region with upward midtropospheric motion, centered over the hot spot, has an area surprisingly independent of the hot spot size.},
  author       = {Shamekh, Sara and Muller, Caroline J and Duvel, Jean-Philippe and D’Andrea, Fabio},
  issn         = {0022-4928},
  journal      = {Journal of the Atmospheric Sciences},
  keywords     = {Atmospheric Science},
  number       = {11},
  pages        = {3733--3745},
  publisher    = {American Meteorological Society},
  title        = {{How do ocean warm anomalies favor the aggregation of deep convective clouds?}},
  doi          = {10.1175/jas-d-18-0369.1},
  volume       = {77},
  year         = {2020},
}

@article{9157,
  abstract     = {Representing an atom by a solid sphere in 3-dimensional Euclidean space, we get the space-filling diagram of a molecule by taking the union. Molecular dynamics simulates its motion subject to bonds and other forces, including the solvation free energy. The morphometric approach [12, 17] writes the latter as a linear combination of weighted versions of the volume, area, mean curvature, and Gaussian curvature of the space-filling diagram. We give a formula for the derivative of the weighted mean curvature. Together with the derivatives of the weighted volume in [7], the weighted area in [3], and the weighted Gaussian curvature [1], this yields the derivative of the morphometric expression of the solvation free energy.},
  author       = {Akopyan, Arseniy and Edelsbrunner, Herbert},
  issn         = {2544-7297},
  journal      = {Computational and Mathematical Biophysics},
  number       = {1},
  pages        = {51--67},
  publisher    = {De Gruyter},
  title        = {{The weighted mean curvature derivative of a space-filling diagram}},
  doi          = {10.1515/cmb-2020-0100},
  volume       = {8},
  year         = {2020},
}

@article{9249,
  abstract     = {Rhombic dodecahedron is a space filling polyhedron which represents the close packing of spheres in 3D space and the Voronoi structures of the face centered cubic (FCC) lattice. In this paper, we describe a new coordinate system where every 3-integer coordinates grid point corresponds to a rhombic dodecahedron centroid. In order to illustrate the interest of the new coordinate system, we propose the characterization of 3D digital plane with its topological features, such as the interrelation between the thickness of the digital plane and the separability constraint we aim to obtain. We also present the characterization of 3D digital lines and study it as the intersection of multiple digital planes. Characterization of 3D digital sphere with relevant topological features is proposed as well along with the 48-symmetry appearing in the new coordinate system.},
  author       = {Biswas, Ranita and Largeteau-Skapin, Gaëlle and Zrour, Rita and Andres, Eric},
  issn         = {2353-3390},
  journal      = {Mathematical Morphology - Theory and Applications},
  number       = {1},
  pages        = {143--158},
  publisher    = {De Gruyter},
  title        = {{Digital objects in rhombic dodecahedron grid}},
  doi          = {10.1515/mathm-2020-0106},
  volume       = {4},
  year         = {2020},
}

@inproceedings{9299,
  abstract     = {We call a multigraph non-homotopic if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can be shrunk to its end-vertex in the same way. It is easy to see that a non-homotopic multigraph on   n>1  vertices can have arbitrarily many edges. We prove that the number of crossings between the edges of a non-homotopic multigraph with n vertices and   m>4n  edges is larger than   cm2n  for some constant   c>0 , and that this bound is tight up to a polylogarithmic factor. We also show that the lower bound is not asymptotically sharp as n is fixed and   m⟶∞ .},
  author       = {Pach, János and Tardos, Gábor and Tóth, Géza},
  booktitle    = {28th International Symposium on Graph Drawing and Network Visualization},
  isbn         = {9783030687656},
  issn         = {1611-3349},
  location     = {Virtual, Online},
  pages        = {359--371},
  publisher    = {Springer Nature},
  title        = {{Crossings between non-homotopic edges}},
  doi          = {10.1007/978-3-030-68766-3_28},
  volume       = {12590},
  year         = {2020},
}

@article{9578,
  abstract     = {How long a monotone path can one always find in any edge-ordering of the complete graph Kn? This appealing question was first asked by Chvátal and Komlós in 1971, and has since attracted the attention of many researchers, inspiring a variety of related problems. The prevailing conjecture is that one can always find a monotone path of linear length, but until now the best known lower bound was n2/3-o(1). In this paper we almost close this gap, proving that any edge-ordering of the complete graph contains a monotone path of length n1-o(1).},
  author       = {Bucić, Matija and Kwan, Matthew Alan and Pokrovskiy, Alexey and Sudakov, Benny and Tran, Tuan and Wagner, Adam Zsolt},
  issn         = {1565-8511},
  journal      = {Israel Journal of Mathematics},
  number       = {2},
  pages        = {663--685},
  publisher    = {Springer},
  title        = {{Nearly-linear monotone paths in edge-ordered graphs}},
  doi          = {10.1007/s11856-020-2035-7},
  volume       = {238},
  year         = {2020},
}

@article{9581,
  abstract     = {We show that for any  𝑛  divisible by 3, almost all order-  𝑛  Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a Steiner triple system and show that almost all Steiner triple systems essentially attain this maximum. We accomplish this via a general theorem comparing a uniformly random Steiner triple system to the outcome of the triangle removal process, which we hope will be useful for other problems. Our methods can also be adapted to other types of designs; for example, we sketch a proof of the theorem that almost all Latin squares have transversals.},
  author       = {Kwan, Matthew Alan},
  issn         = {1460-244X},
  journal      = {Proceedings of the London Mathematical Society},
  number       = {6},
  pages        = {1468--1495},
  publisher    = {Wiley},
  title        = {{Almost all Steiner triple systems have perfect matchings}},
  doi          = {10.1112/plms.12373},
  volume       = {121},
  year         = {2020},
}

@article{9583,
  abstract     = {We show that for any n divisible by 3, almost all order-n Steiner triple systems admit a decomposition of almost all their triples into disjoint perfect matchings (that is, almost all Steiner triple systems are almost resolvable).},
  author       = {Ferber, Asaf and Kwan, Matthew Alan},
  issn         = {2050-5094},
  journal      = {Forum of Mathematics},
  publisher    = {Cambridge University Press},
  title        = {{Almost all Steiner triple systems are almost resolvable}},
  doi          = {10.1017/fms.2020.29},
  volume       = {8},
  year         = {2020},
}

@misc{9780,
  abstract     = {PADREV : 4,4'-dimethoxy[1,1'-biphenyl]-2,2',5,5'-tetrol
Space Group: C 2 (5), Cell: a 24.488(16)Å b 5.981(4)Å c 3.911(3)Å, α 90° β 91.47(3)° γ 90°},
  author       = {Schlemmer, Werner and Nothdurft, Philipp and Petzold, Alina and Riess, Gisbert and Frühwirt, Philipp and Schmallegger, Max and Gescheidt-Demner, Georg and Fischer, Roland and Freunberger, Stefan Alexander and Kern, Wolfgang and Spirk, Stefan},
  publisher    = {CCDC},
  title        = {{CCDC 1991959: Experimental Crystal Structure Determination}},
  doi          = {10.5517/ccdc.csd.cc24vsrk},
  year         = {2020},
}

@article{6906,
  abstract     = {We consider systems of bosons trapped in a box, in the Gross–Pitaevskii regime. We show that low-energy states exhibit complete Bose–Einstein condensation with an optimal bound on the number of orthogonal excitations. This extends recent results obtained in Boccato et al. (Commun Math Phys 359(3):975–1026, 2018), removing the assumption of small interaction potential.},
  author       = {Boccato, Chiara and Brennecke, Christian and Cenatiempo, Serena and Schlein, Benjamin},
  issn         = {1432-0916},
  journal      = {Communications in Mathematical Physics},
  pages        = {1311--1395},
  publisher    = {Springer},
  title        = {{Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime}},
  doi          = {10.1007/s00220-019-03555-9},
  volume       = {376},
  year         = {2020},
}

@article{6976,
  abstract     = {Origami is rapidly transforming the design of robots1,2, deployable structures3,4,5,6 and metamaterials7,8,9,10,11,12,13,14. However, as foldability requires a large number of complex compatibility conditions that are difficult to satisfy, the design of crease patterns is limited to heuristics and computer optimization. Here we introduce a systematic strategy that enables intuitive and effective design of complex crease patterns that are guaranteed to fold. First, we exploit symmetries to construct 140 distinct foldable motifs, and represent these as jigsaw puzzle pieces. We then show that when these pieces are fitted together they encode foldable crease patterns. This maps origami design to solving combinatorial problems, which allows us to systematically create, count and classify a vast number of crease patterns. We show that all of these crease patterns are pluripotent—capable of folding into multiple shapes—and solve exactly for the number of possible shapes for each pattern. Finally, we employ our framework to rationally design a crease pattern that folds into two independently defined target shapes, and fabricate such pluripotent origami. Our results provide physicists, mathematicians and engineers with a powerful new design strategy.},
  author       = {Dieleman, Peter and Vasmel, Niek and Waitukaitis, Scott R and van Hecke, Martin},
  issn         = {1745-2481},
  journal      = {Nature Physics},
  number       = {1},
  pages        = {63–68},
  publisher    = {Springer Nature},
  title        = {{Jigsaw puzzle design of pluripotent origami}},
  doi          = {10.1038/s41567-019-0677-3},
  volume       = {16},
  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{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},
}

@inproceedings{7213,
  abstract     = {Persistent homology is a powerful tool in Topological Data Analysis (TDA) to capture the topological properties of data succinctly at different spatial resolutions. For graphical data, the shape, and structure of the neighborhood of individual data items (nodes) are an essential means of characterizing their properties. We propose the use of persistent homology methods to capture structural and topological properties of graphs and use it to address the problem of link prediction. We achieve encouraging results on nine different real-world datasets that attest to the potential of persistent homology-based methods for network analysis.},
  author       = {Bhatia, Sumit and Chatterjee, Bapi and Nathani, Deepak and Kaul, Manohar},
  booktitle    = {Complex Networks and their applications VIII},
  isbn         = {9783030366865},
  issn         = {1860-9503},
  location     = {Lisbon, Portugal},
  pages        = {27--39},
  publisher    = {Springer Nature},
  title        = {{A persistent homology perspective to the link prediction problem}},
  doi          = {10.1007/978-3-030-36687-2_3},
  volume       = {881},
  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{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         = {1440-1711},
  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{7235,
  abstract     = {We consider the Fröhlich model of a polaron, and show that its effective mass diverges in thestrong coupling limit.},
  author       = {Lieb, Elliott H. and Seiringer, Robert},
  issn         = {1572-9613},
  journal      = {Journal of Statistical Physics},
  pages        = {23--33},
  publisher    = {Springer Nature},
  title        = {{Divergence of the effective mass of a polaron in the strong coupling limit}},
  doi          = {10.1007/s10955-019-02322-3},
  volume       = {180},
  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         = {1617-9692},
  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{7417,
  abstract     = {Previously, we reported that the allelic de-etiolated by zinc (dez) and trichome birefringence (tbr) mutants exhibit photomorphogenic development in the dark, which is enhanced by high Zn. TRICHOME BIREFRINGENCE-LIKE proteins had been implicated in transferring acetyl groups to various hemicelluloses. Pectin O-acetylation levels were lower in dark-grown dez seedlings than in the wild type. We observed Zn-enhanced photomorphogenesis in the dark also in the reduced wall acetylation 2 (rwa2-3) mutant, which exhibits lowered O-acetylation levels of cell wall macromolecules including pectins and xyloglucans, supporting a role for cell wall macromolecule O-acetylation in the photomorphogenic phenotypes of rwa2-3 and dez. Application of very short oligogalacturonides (vsOGs) restored skotomorphogenesis in dark-grown dez and rwa2-3. Here we demonstrate that in dez, O-acetylation of non-pectin cell wall components, notably of xyloglucan, is enhanced. Our results highlight the complexity of cell wall homeostasis and indicate against an influence of xyloglucan O-acetylation on light-dependent seedling development.},
  author       = {Sinclair, Scott A and Gille, S. and Pauly, M. and Krämer, U.},
  issn         = {1559-2324},
  journal      = {Plant Signaling & Behavior},
  number       = {1},
  publisher    = {Informa UK Limited},
  title        = {{Regulation of acetylation of plant cell wall components is complex and responds to external stimuli}},
  doi          = {10.1080/15592324.2019.1687185},
  volume       = {15},
  year         = {2020},
}

