@unpublished{11631,
  abstract     = {The recently launched NASA Transiting Exoplanet Survey Satellite (TESS) mission is going to collect lightcurves for a few hundred million of stars and we expect to increase the number of pulsating stars to analyze compared to the few thousand stars observed by the CoRoT, Kepler and K2 missions. However, most of the TESS targets have not yet been properly classified and characterized. In order to improve the analysis of the TESS data, it is crucial to determine the type of stellar pulsations in a timely manner. We propose an automatic method to classify stars attending to their pulsation properties, in particular, to identify solar-like pulsators among all TESS targets. It relies on the use of the global amount of power contained in the power spectrum (already known as the FliPer method) as a key parameter, along with
the effective temperature, to feed into a machine learning classifier. Our study, based on TESS simulated datasets, shows that we are able to classify pulsators with a 98% accuracy.},
  author       = {Bugnet, Lisa Annabelle and García, R. A. and Davies, G. R. and Mathur, S. and Hall, O. J. and Rendle, B. M.},
  booktitle    = {arXiv},
  keywords     = {asteroseismology - methods, data analysis - stars, oscillations},
  title        = {{FliPer: Classifying TESS pulsating stars}},
  doi          = {10.48550/arXiv.1811.12140},
  year         = {2018},
}

@article{11657,
  abstract     = {The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm is based on cluster contraction using label propagation and Padberg and Rinaldi’s contraction heuristics [SIAM Review, 1991]. We give both sequential and shared-memory parallel implementations of our algorithm. Extensive experiments on both real-world and generated instances show that our algorithm finds the optimal cut on nearly all instances significantly faster than other state-of-the-art exact algorithms, and our error rate is lower than that of other heuristic algorithms. In addition, our parallel algorithm runs a factor 7.5× faster on average when using 32 threads. To further speed up computations, we also give a version of our algorithm that performs random edge contractions as preprocessing. This version achieves a lower running time and better parallel scalability at the expense of a higher error rate.},
  author       = {Henzinger, Monika H and Noe, Alexander and Schulz, Christian and Strash, Darren},
  issn         = {1084-6654},
  journal      = {ACM Journal of Experimental Algorithmics},
  keywords     = {Theoretical Computer Science},
  pages        = {1--22},
  publisher    = {Association for Computing Machinery},
  title        = {{Practical minimum cut algorithms}},
  doi          = {10.1145/3274662},
  volume       = {23},
  year         = {2018},
}

@article{11664,
  abstract     = {We present a deterministic incremental algorithm for exactly maintaining the size of a minimum cut with O(log3 n log log2 n) amortized time per edge insertion and O(1) query time. This result partially answers an open question posed by Thorup (2007). It also stays in sharp contrast to a polynomial conditional lower bound for the fully dynamic weighted minimum cut problem. Our algorithm is obtained by combining a sparsification technique of Kawarabayashi and Thorup (2015) or its recent improvement by Henzinger, Rao, and Wang (2017), and an exact incremental algorithm of Henzinger (1997).

We also study space-efficient incremental algorithms for the minimum cut problem. Concretely, we show that there exists an O(nlog n/ε2) space Monte Carlo algorithm that can process a stream of edge insertions starting from an empty graph, and with high probability, the algorithm maintains a (1+ε)-approximation to the minimum cut. The algorithm has O((α (n) log3 n)/ε 2) amortized update time and constant query time, where α (n) stands for the inverse of Ackermann function.},
  author       = {Goranci, Gramoz and Henzinger, Monika H and Thorup, Mikkel},
  issn         = {1549-6333},
  journal      = {ACM Transactions on Algorithms},
  number       = {2},
  publisher    = {Association for Computing Machinery},
  title        = {{Incremental exact min-cut in polylogarithmic amortized update time}},
  doi          = {10.1145/3174803},
  volume       = {14},
  year         = {2018},
}

@article{11667,
  abstract     = {The focus of classic mechanism design has been on truthful direct-revelation mechanisms. In the context of combinatorial auctions, the truthful direct-revelation mechanism that maximizes social welfare is the Vickrey-Clarke-Groves mechanism. For many valuation spaces, computing the allocation and payments of the VCG mechanism, however, is a computationally hard problem. We thus study the performance of the VCG mechanism when bidders are forced to choose bids from a subspace of the valuation space for which the VCG outcome can be computed efficiently. We prove improved upper bounds on the welfare loss for restrictions to additive bids and upper and lower bounds for restrictions to non-additive bids. These bounds show that increased expressiveness can give rise to additional equilibria of poorer efficiency.},
  author       = {Dütting, Paul and Henzinger, Monika H and Starnberger, Martin},
  issn         = {2167-8383},
  journal      = {ACM Transactions on Economics and Computation},
  keywords     = {Theory of computation, Algorithmic game theory and mechanism design, Applied computing, Economics, Simplified mechanisms, Combinatorial auctions with item bidding, Price of anarchy},
  number       = {2},
  publisher    = {Association for Computing Machinery},
  title        = {{Valuation compressions in VCG-based combinatorial auctions}},
  doi          = {10.1145/3232860},
  volume       = {6},
  year         = {2018},
}

@article{11757,
  abstract     = {We develop a dynamic version of the primal-dual method for optimization problems, and apply it to obtain the following results. (1) For the dynamic set-cover problem, we maintain an O ( f 2)-approximately optimal solution in O ( f · log(m + n)) amortized update time, where f is the maximum “frequency” of an element, n is the number of sets, and m is the maximum number of elements in the universe at any point in time. (2) For the dynamic b-matching problem, we maintain an O (1)-approximately optimal solution in O (log3 n) amortized update time, where n is the number of nodes in the graph.},
  author       = {Bhattacharya, Sayan and Henzinger, Monika H and Italiano, Giuseppe},
  issn         = {0890-5401},
  journal      = {Information and Computation},
  number       = {08},
  pages        = {219--239},
  publisher    = {Elsevier},
  title        = {{Dynamic algorithms via the primal-dual method}},
  doi          = {10.1016/j.ic.2018.02.005},
  volume       = {261},
  year         = {2018},
}

@article{11768,
  abstract     = {In the decremental single-source shortest paths (SSSP) problem, we want to maintain the distances between a given source node s and every other node in an n-node m-edge graph G undergoing edge deletions. While its static counterpart can be solved in near-linear time, this decremental problem is much more challenging even in the undirected unweighted case. In this case, the classic O(mn) total update time of Even and Shiloach [16] has been the fastest known algorithm for three decades. At the cost of a (1+ϵ)-approximation factor, the running time was recently improved to n2+o(1) by Bernstein and Roditty [9]. In this article, we bring the running time down to near-linear: We give a (1+ϵ)-approximation algorithm with m1+o(1) expected total update time, thus obtaining near-linear time. Moreover, we obtain m1+o(1) log W time for the weighted case, where the edge weights are integers from 1 to W. The only prior work on weighted graphs in o(mn) time is the mn0.9 + o(1)-time algorithm by Henzinger et al. [18, 19], which works for directed graphs with quasi-polynomial edge weights. The expected running time bound of our algorithm holds against an oblivious adversary.

In contrast to the previous results, which rely on maintaining a sparse emulator, our algorithm relies on maintaining a so-called sparse (h, ϵ)-hop set introduced by Cohen [12] in the PRAM literature. An (h, ϵ)-hop set of a graph G=(V, E) is a set F of weighted edges such that the distance between any pair of nodes in G can be (1+ϵ)-approximated by their h-hop distance (given by a path containing at most h edges) on G′=(V, E ∪ F). Our algorithm can maintain an (no(1), ϵ)-hop set of near-linear size in near-linear time under edge deletions. It is the first of its kind to the best of our knowledge. To maintain approximate distances using this hop set, we extend the monotone Even-Shiloach tree of Henzinger et al. [20] and combine it with the bounded-hop SSSP technique of Bernstein [4, 5] and Mądry [27]. These two new tools might be of independent interest.},
  author       = {Henzinger, Monika H and Krinninger, Sebastian and Nanongkai, Danupon},
  issn         = {1557-735X},
  journal      = {Journal of the ACM},
  number       = {6},
  pages        = {1--40},
  publisher    = {Association for Computing Machinery},
  title        = {{Decremental single-source shortest paths on undirected graphs in near-linear total update time}},
  doi          = {10.1145/3218657},
  volume       = {65},
  year         = {2018},
}

@unpublished{7783,
  abstract     = {The Drosophila Genetic Reference Panel (DGRP) serves as a valuable resource to better understand the genetic landscapes underlying quantitative traits. However, such DGRP studies have so far only focused on nuclear genetic variants. To address this, we sequenced the mitochondrial genomes of >170 DGRP lines, identifying 229 variants including 21 indels and 7 frameshifts. We used our mitochondrial variation data to identify 12 genetically distinct mitochondrial haplotypes, thus revealing important population structure at the mitochondrial level. We further examined whether this population structure was reflected on the nuclear genome by screening for the presence of potential mito-nuclear genetic incompatibilities in the form of significant genotype ratio distortions (GRDs) between mitochondrial and nuclear variants. In total, we detected a remarkable 1,845 mito-nuclear GRDs, with the highest enrichment observed in a 40 kb region around the gene Sex-lethal (Sxl). Intriguingly, downstream phenotypic analyses did not uncover major fitness effects associated with these GRDs, suggesting that a large number of mito-nuclear GRDs may reflect population structure at the mitochondrial level rather than actual genomic incompatibilities. This is further supported by the GRD landscape showing particular large genomic regions associated with a single mitochondrial haplotype. Next, we explored the functional relevance of the detected mitochondrial haplotypes through an association analysis on a set of 259 assembled, non-correlating DGRP phenotypes. We found multiple significant associations with stress- and metabolism-related phenotypes, including food intake in males. We validated the latter observation by reciprocal swapping of mitochondrial genomes from high food intake DGRP lines to low food intake ones. In conclusion, our study uncovered important mitochondrial population structure and haplotype-specific metabolic variation in the DGRP, thus demonstrating the significance of incorporating mitochondrial haplotypes in geno-phenotype relationship studies.},
  author       = {Bevers, Roel P.J. and Litovchenko, Maria and Kapopoulou, Adamandia and Braman, Virginie S. and Robinson, Matthew Richard and Auwerx, Johan and Hollis, Brian and Deplancke, Bart},
  booktitle    = {bioRxiv},
  pages        = {49},
  publisher    = {Cold Spring Harbor Laboratory},
  title        = {{Extensive mitochondrial population structure and haplotype-specific phenotypic variation in the Drosophila Genetic Reference Panel}},
  year         = {2018},
}

@inproceedings{78,
  abstract     = {We provide a procedure for detecting the sub-segments of an incrementally observed Boolean signal ω that match a given temporal pattern ϕ. As a pattern specification language, we use timed regular expressions, a formalism well-suited for expressing properties of concurrent asynchronous behaviors embedded in metric time. We construct a timed automaton accepting the timed language denoted by ϕ and modify it slightly for the purpose of matching. We then apply zone-based reachability computation to this automaton while it reads ω, and retrieve all the matching segments from the results. Since the procedure is automaton based, it can be applied to patterns specified by other formalisms such as timed temporal logics reducible to timed automata or directly encoded as timed automata. The procedure has been implemented and its performance on synthetic examples is demonstrated.},
  author       = {Bakhirkin, Alexey and Ferrere, Thomas and Nickovic, Dejan and Maler, Oded and Asarin, Eugene},
  isbn         = {978-3-030-00150-6},
  location     = {Bejing, China},
  pages        = {215 -- 232},
  publisher    = {Springer},
  title        = {{Online timed pattern matching using automata}},
  doi          = {10.1007/978-3-030-00151-3_13},
  volume       = {11022},
  year         = {2018},
}

@inproceedings{7812,
  abstract     = {Deep neural networks (DNNs) continue to make significant advances, solving tasks from image classification to translation or reinforcement learning. One aspect of the field receiving considerable attention is efficiently executing deep models in resource-constrained environments, such as mobile or embedded devices. This paper focuses on this problem, and proposes two new compression methods, which jointly leverage weight quantization and distillation of larger teacher networks into smaller student networks. The first method we propose is called quantized distillation and leverages distillation during the training process, by incorporating distillation loss, expressed with respect to the teacher, into the training of a student network whose weights are quantized to a limited set of levels. The second method,  differentiable quantization, optimizes the location of quantization points through stochastic gradient descent, to better fit the behavior of the teacher model.  We validate both methods through experiments on convolutional and recurrent architectures. We show that quantized shallow students can reach similar accuracy levels to full-precision teacher models, while providing order of magnitude compression, and inference speedup that is linear in the depth reduction. In sum, our results enable DNNs for resource-constrained environments to leverage architecture and accuracy advances developed on more powerful devices.},
  author       = {Polino, Antonio and Pascanu, Razvan and Alistarh, Dan-Adrian},
  booktitle    = {6th International Conference on Learning Representations},
  location     = {Vancouver, Canada},
  title        = {{Model compression via distillation and quantization}},
  year         = {2018},
}

@inproceedings{79,
  abstract     = {Markov Decision Processes (MDPs) are a popular class of models suitable for solving control decision problems in probabilistic reactive systems. We consider parametric MDPs (pMDPs) that include parameters in some of the transition probabilities to account for stochastic uncertainties of the environment such as noise or input disturbances. We study pMDPs with reachability objectives where the parameter values are unknown and impossible to measure directly during execution, but there is a probability distribution known over the parameter values. We study for the first time computing parameter-independent strategies that are expectation optimal, i.e., optimize the expected reachability probability under the probability distribution over the parameters. We present an encoding of our problem to partially observable MDPs (POMDPs), i.e., a reduction of our problem to computing optimal strategies in POMDPs. We evaluate our method experimentally on several benchmarks: a motivating (repeated) learner model; a series of benchmarks of varying configurations of a robot moving on a grid; and a consensus protocol.},
  author       = {Arming, Sebastian and Bartocci, Ezio and Chatterjee, Krishnendu and Katoen, Joost P and Sokolova, Ana},
  location     = {Beijing, China},
  pages        = {53--70},
  publisher    = {Springer},
  title        = {{Parameter-independent strategies for pMDPs via POMDPs}},
  doi          = {10.1007/978-3-319-99154-2_4},
  volume       = {11024},
  year         = {2018},
}

@article{7983,
  abstract     = {Feste Alkalicarbonate sind universelle Bestandteile von Passivierungsschichten an Materialien für Interkalationsbatterien, übliche Nebenprodukte in Metall‐O2‐Batterien, und es wird angenommen, dass sie sich reversibel in Metall‐O2 /CO2‐Zellen bilden und zersetzen. In all diesen Kathoden zersetzt sich Li2CO3 zu CO2, sobald es Spannungen >3.8 V vs. Li/Li+ ausgesetzt wird. Beachtenswert ist, dass keine O2‐Entwicklung detektiert wird, wie gemäß der Zersetzungsreaktion 2 Li2CO3 → 4 Li+ + 4 e− + 2 CO2 + O2 zu erwarten wäre. Deswegen war der Verbleib eines der O‐Atome ungeklärt und wurde nicht identifizierten parasitären Reaktionen zugerechnet. Hier zeigen wir, dass hochreaktiver Singulett‐Sauerstoff (1O2) bei der Oxidation von Li2CO3 in einem aprotischen Elektrolyten gebildet und daher nicht als O2 freigesetzt wird. Diese Ergebnisse haben weitreichende Auswirkungen auf die langfristige Zyklisierbarkeit von Batterien: sie untermauern die Wichtigkeit, 1O2 in Metall‐O2‐Batterien zu verhindern, stellen die Möglichkeit einer reversiblen Metall‐O2 /CO2‐Batterie basierend auf einem Carbonat‐Entladeprodukt in Frage und helfen, Grenzflächenreaktivität von Übergangsmetallkathoden mit Li2CO3‐Resten zu erklären.},
  author       = {Mahne, Nika and Renfrew, Sara E. and McCloskey, Bryan D. and Freunberger, Stefan Alexander},
  issn         = {0044-8249},
  journal      = {Angewandte Chemie},
  number       = {19},
  pages        = {5627--5631},
  publisher    = {Wiley},
  title        = {{Elektrochemische Oxidation von Lithiumcarbonat generiert Singulett-Sauerstoff}},
  doi          = {10.1002/ange.201802277},
  volume       = {130},
  year         = {2018},
}

@article{8015,
  abstract     = {The neural code of cortical processing remains uncracked; however, it must necessarily rely on faithful signal propagation between cortical areas. In this issue of Neuron, Joglekar et al. (2018) show that strong inter-areal excitation balanced by local inhibition can enable reliable signal propagation in data-constrained network models of macaque cortex. },
  author       = {Stroud, Jake P. and Vogels, Tim P},
  issn         = {0896-6273},
  journal      = {Neuron},
  number       = {1},
  pages        = {8--9},
  publisher    = {Elsevier},
  title        = {{Cortical signal propagation: Balance, amplify, transmit}},
  doi          = {10.1016/j.neuron.2018.03.028},
  volume       = {98},
  year         = {2018},
}

@article{806,
  abstract     = {Social insect colonies have evolved many collectively performed adaptations that reduce the impact of infectious disease and that are expected to maximize their fitness. This colony-level protection is termed social immunity, and it enhances the health and survival of the colony. In this review, we address how social immunity emerges from its mechanistic components to produce colony-level disease avoidance, resistance, and tolerance. To understand the evolutionary causes and consequences of social immunity, we highlight the need for studies that evaluate the effects of social immunity on colony fitness. We discuss the role that host life history and ecology have on predicted eco-evolutionary dynamics, which differ among the social insect lineages. Throughout the review, we highlight current gaps in our knowledge and promising avenues for future research, which we hope will bring us closer to an integrated understanding of socio-eco-evo-immunology.},
  author       = {Cremer, Sylvia and Pull, Christopher and Fürst, Matthias},
  issn         = {1545-4487},
  journal      = {Annual Review of Entomology},
  pages        = {105 -- 123},
  publisher    = {Annual Reviews},
  title        = {{Social immunity: Emergence and evolution of colony-level disease protection}},
  doi          = {10.1146/annurev-ento-020117-043110},
  volume       = {63},
  year         = {2018},
}

@article{8073,
  abstract     = {Motor cortex (M1) exhibits a rich repertoire of neuronal activities to support the generation of complex movements. Although recent neuronal-network models capture many qualitative aspects of M1 dynamics, they can generate only a few distinct movements. Additionally, it is unclear how M1 efficiently controls movements over a wide range of shapes and speeds. We demonstrate that modulation of neuronal input–output gains in recurrent neuronal-network models with a fixed architecture can dramatically reorganize neuronal activity and thus downstream muscle outputs. Consistent with the observation of diffuse neuromodulatory projections to M1, a relatively small number of modulatory control units provide sufficient flexibility to adjust high-dimensional network activity using a simple reward-based learning rule. Furthermore, it is possible to assemble novel movements from previously learned primitives, and one can separately change movement speed while preserving movement shape. Our results provide a new perspective on the role of modulatory systems in controlling recurrent cortical activity.},
  author       = {Stroud, Jake P. and Porter, Mason A. and Hennequin, Guillaume and Vogels, Tim P},
  issn         = {1097-6256},
  journal      = {Nature Neuroscience},
  number       = {12},
  pages        = {1774--1783},
  publisher    = {Springer Nature},
  title        = {{Motor primitives in space and time via targeted gain modulation in cortical networks}},
  doi          = {10.1038/s41593-018-0276-0},
  volume       = {21},
  year         = {2018},
}

@inproceedings{81,
  abstract     = {We solve the offline monitoring problem for timed propositional temporal logic (TPTL), interpreted over dense-time Boolean signals. The variant of TPTL we consider extends linear temporal logic (LTL) with clock variables and reset quantifiers, providing a mechanism to specify real-time constraints. We first describe a general monitoring algorithm based on an exhaustive computation of the set of satisfying clock assignments as a finite union of zones. We then propose a specialized monitoring algorithm for the one-variable case using a partition of the time domain based on the notion of region equivalence, whose complexity is linear in the length of the signal, thereby generalizing a known result regarding the monitoring of metric temporal logic (MTL). The region and zone representations of time constraints are known from timed automata verification and can also be used in the discrete-time case. Our prototype implementation appears to outperform previous discrete-time implementations of TPTL monitoring,},
  author       = {Elgyütt, Adrian and Ferrere, Thomas and Henzinger, Thomas A},
  location     = {Beijing, China},
  pages        = {53 -- 70},
  publisher    = {Springer},
  title        = {{Monitoring temporal logic with clock variables}},
  doi          = {10.1007/978-3-030-00151-3_4},
  volume       = {11022},
  year         = {2018},
}

@article{82,
  abstract     = {In experimental cultures, when bacteria are mixed with lytic (virulent) bacteriophage, bacterial cells resistant to the phage commonly emerge and become the dominant population of bacteria. Following the ascent of resistant mutants, the densities of bacteria in these simple communities become limited by resources rather than the phage. Despite the evolution of resistant hosts, upon which the phage cannot replicate, the lytic phage population is most commonly maintained in an apparently stable state with the resistant bacteria. Several mechanisms have been put forward to account for this result. Here we report the results of population dynamic/evolution experiments with a virulent mutant of phage Lambda, λVIR, and Escherichia coli in serial transfer cultures. We show that, following the ascent of λVIR-resistant bacteria, λVIRis maintained in the majority of cases in maltose-limited minimal media and in all cases in nutrient-rich broth. Using mathematical models and experiments, we show that the dominant mechanism responsible for maintenance of λVIRin these resource-limited populations dominated by resistant E. coli is a high rate of either phenotypic or genetic transition from resistance to susceptibility—a hitherto undemonstrated mechanism we term "leaky resistance." We discuss the implications of leaky resistance to our understanding of the conditions for the maintenance of phage in populations of bacteria—their “existence conditions.”.},
  author       = {Chaudhry, Waqas and Pleska, Maros and Shah, Nilang and Weiss, Howard and Mccall, Ingrid and Meyer, Justin and Gupta, Animesh and Guet, Calin C and Levin, Bruce},
  journal      = {PLoS Biology},
  number       = {8},
  publisher    = {Public Library of Science},
  title        = {{Leaky resistance and the conditions for the existence of lytic bacteriophage}},
  doi          = {10.1371/journal.pbio.2005971},
  volume       = {16},
  year         = {2018},
}

@article{8231,
  author       = {Fazekas-Singer, Judit and Singer, Josef and Ilieva, Kristina M. and Matz, Miroslawa and Herrmann, Ina and Spillner, Edzard and Karagiannis, Sophia N. and Jensen-Jarolim, Erika},
  issn         = {0091-6749},
  journal      = {Journal of Allergy and Clinical Immunology},
  number       = {3},
  pages        = {973--976.e11},
  publisher    = {Elsevier},
  title        = {{AllergoOncology: Generating a canine anticancer IgE against the epidermal growth factor receptor}},
  doi          = {10.1016/j.jaci.2018.04.021},
  volume       = {142},
  year         = {2018},
}

@article{8232,
  abstract     = {Anti-epidermal growth factor receptor (EGFR) antibody therapy is used in EGFR expressing cancers including lung, colon, head and neck, and bladder cancers, however results have been modest. Near infrared photoimmunotherapy (NIR-PIT) is a highly selective tumor treatment that employs an antibody-photo-absorber conjugate which is activated by NIR light. NIR-PIT is in clinical trials in patients with recurrent head and neck cancers using cetuximab-IR700 as the conjugate. However, its use has otherwise been restricted to mouse models. This is an effort to explore larger animal models with NIR-PIT. We describe the use of a recombinant canine anti-EGFR monoclonal antibody (mAb), can225IgG, conjugated to the photo-absorber, IR700DX, in three EGFR expressing canine transitional cell carcinoma (TCC) cell lines as a prelude to possible canine clinical studies. Can225-IR700 conjugate showed specific binding and cell-specific killing after NIR-PIT on EGFR expressing cells in vitro. In the in vivo study, can225-IR700 conjugate demonstrated accumulation of the fluorescent conjugate with high tumor-to-background ratio. Tumor-bearing mice were separated into 4 groups: (1) no treatment; (2) 100 μg of can225-IR700 i.v. only; (3) NIR light exposure only; (4) 100 μg of can225-IR700 i.v., NIR light exposure. Tumor growth was significantly inhibited by NIR-PIT treatment compared with the other groups (p < 0.001), and significantly prolonged survival was achieved (p < 0.001 vs. other groups) in the treatment groups. In conclusion, NIR-PIT with can225-IR700 is a promising treatment for canine EGFR-expressing cancers, including invasive transitional cell carcinoma in pet dogs, that could provide a pathway to translation to humans.},
  author       = {Nagaya, Tadanobu and Okuyama, Shuhei and Ogata, Fusa and Maruoka, Yasuhiro and Knapp, Deborah W. and Karagiannis, Sophia N. and Fazekas-Singer, Judit and Choyke, Peter L. and LeBlanc, Amy K. and Jensen-Jarolim, Erika and Kobayashi, Hisataka},
  issn         = {1949-2553},
  journal      = {Oncotarget},
  pages        = {19026--19038},
  publisher    = {Impact Journals},
  title        = {{Near infrared photoimmunotherapy targeting bladder cancer with a canine anti-epidermal growth factor receptor (EGFR) antibody}},
  doi          = {10.18632/oncotarget.24876},
  volume       = {9},
  year         = {2018},
}

@article{8233,
  abstract     = {The M2a subtype of macrophages plays an important role in human immunoglobulin E (IgE-mediated allergies) and other Th2 type immune reactions. In contrast, very little is known about these cells in the dog. Here we describe an in vitro method to activate canine histiocytic DH82 cells and primary canine monocyte-derived macrophages (MDMs) toward the M2a macrophages using human cytokines. For a side-by-side comparison, we compared the canine cells to human MDMs, and the human monocytic cell line U937 activated towards M1 and M2a cells on the cellular and molecular level. In analogy to activated human M2a cells, canine M2a, differentiated from both DH82 and MDMs, showed an increase in CD206 surface receptor expression compared to M1. Interestingly, canine M2a, but not M1 derived from MDM, upregulated the high-affinity IgE receptor (FcεRI). Transcription levels of M2a-associated genes (IL10, CCL22, TGFβ, CD163) showed a diverse pattern between the human and dog species, whereas M1 genes (IDO1, CXCL11, IL6, TNF-α) were similarly upregulated in canine and human M1 cells (cell lines and MDMs). We suggest that our novel in vitro method will be suitable in comparative allergology studies focussing on macrophages.},
  author       = {Herrmann, Ina and Gotovina, Jelena and Fazekas-Singer, Judit and Fischer, Michael B. and Hufnagl, Karin and Bianchini, Rodolfo and Jensen-Jarolim, Erika},
  issn         = {0145-305X},
  journal      = {Developmental & Comparative Immunology},
  number       = {5},
  pages        = {118--127},
  publisher    = {Elsevier},
  title        = {{Canine macrophages can like human macrophages be in vitro activated toward the M2a subtype relevant in allergy}},
  doi          = {10.1016/j.dci.2018.01.005},
  volume       = {82},
  year         = {2018},
}

@article{8234,
  abstract     = {Molecular imaging probes such as PET-tracers have the potential to improve the accuracy of tumor characterization by directly visualizing the biochemical situation. Thus, molecular changes can be detected early before morphological manifestation. The A3 adenosine receptor (A3AR) is described to be highly expressed in colon cancer cell lines and human colorectal cancer (CRC), suggesting this receptor as a tumor marker. The aim of this preclinical study was the evaluation of FE@SUPPY as a PET-tracer for CRC using in vitro imaging and in vivo PET imaging. First, affinity and selectivity of FE@SUPPY and its metabolites were determined, proving the favorable binding profile of FE@SUPPY. The human adenocarcinoma cell line HT-29 was characterized regarding its hA3AR expression and was subsequently chosen as tumor graft. Promising results regarding the potential of FE@SUPPY as a PET-tracer for CRC imaging were obtained by autoradiography as ≥2.3-fold higher accumulation of FE@SUPPY was found in CRC tissue compared to adjacent healthy colon tissue from the same patient. Nevertheless, first in vivo studies using HT-29 xenografts showed insufficient tumor uptake due to (1) poor conservation of target expression in xenografts and (2) unfavorable pharmacokinetics of FE@SUPPY in mice. We therefore conclude that HT-29 xenografts are not adequate to visualize hA3ARs using FE@SUPPY.},
  author       = {Balber, T. and Singer, Judit and Berroterán-Infante, N. and Dumanic, M. and Fetty, L. and Fazekas-Singer, J. and Vraka, C. and Nics, L. and Bergmann, M. and Pallitsch, K. and Spreitzer, H. and Wadsak, W. and Hacker, M. and Jensen-Jarolim, E. and Viernstein, H. and Mitterhauser, M.},
  issn         = {1555-4309},
  journal      = {Contrast Media & Molecular Imaging},
  publisher    = {Hindawi},
  title        = {{Preclinical in vitro and in vivo evaluation of [18F]FE@SUPPY for cancer PET imaging: Limitations of a xenograft model for colorectal cancer}},
  doi          = {10.1155/2018/1269830},
  volume       = {2018},
  year         = {2018},
}