--- _id: '896' abstract: - lang: eng text: Multicellular eukaryotes have evolved a range of mechanisms for immune recognition. A widespread family involved in innate immunity are the NACHT-domain and leucine-rich-repeat-containing (NLR) proteins.Mammals have small numbers of NLR proteins, whereas in some species, mostly those without adaptive immune systems, NLRs have expanded into very large families.We describe a family of nearly 400NLR proteins encoded in the zebrafish genome. The proteins share a defining overall structure, which arose in fishes after a fusion of the core NLR domains with a B30.2 domain, but can be subdivided into four groups based on their NACHT domains. Gene conversion acting differentially on the NACHT and B30.2 domains has shaped the family and created the groups. Evidence of positive selection in the B30.2 domain indicates that this domain rather than the leucine-rich repeats acts as the pathogen recognition module. In an unusual chromosomal organization, the majority of the genes are located on one chromosome arm, interspersed with other large multigene families, including a new family encoding zinc-finger proteins. The NLR-B30.2 proteins represent a new family with diversity in the specific recognition module that is present in fishes in spite of the parallel existence of an adaptive immune system. acknowledgement: Financial support was provided by EMBO and the DFG SFB 670 'Zellautonome Immunität' to M.L., DFG SFB 680 'Molecular basis of evolutionary innovation' to T.W., DFG SPP1819 to M.L. and T.W., the HHMI International Early Career Scientist Programme (55007424), MINECO (Sev-2012-0208), AGAUR programme (2014 SGR 0974), and an ERC Starting Grant (335980-EinME) to F.K., the European Molecular Biology Laboratory to J.M., the Wellcome Trust to K.H. (zebrafish genome sequencing project) and the National Human Genome Research Institute (NHGRI) grant HG002659 to G.K.L. (gene annotation), and a grant from the Volkswagen Foundation to P.H.S. We thank the CHEOPS support team and the Bundesland Nordrhein Westfalen for making HPC applications freely available at the University of Cologne. author: - first_name: Kerstin full_name: Howe, Kerstin L last_name: Howe - first_name: Philipp full_name: Schiffer, Philipp H last_name: Schiffer - first_name: Julia full_name: Zielinski, Julia G last_name: Zielinski - first_name: Thomas full_name: Wiehe, Thomas H last_name: Wiehe - first_name: Gavin full_name: Laird, Gavin K last_name: Laird - first_name: John full_name: Marioni, John C last_name: Marioni - first_name: Onuralp full_name: Soylemez, Onuralp last_name: Soylemez - first_name: Fyodor full_name: Fyodor Kondrashov id: 44FDEF62-F248-11E8-B48F-1D18A9856A87 last_name: Kondrashov orcid: 0000-0001-8243-4694 - first_name: Maria full_name: Leptin, Maria last_name: Leptin citation: ama: Howe K, Schiffer P, Zielinski J, et al. Structure and evolutionary history of a large family of NLR proteins in the zebrafish. Open Biology. 2016;6(4). doi:10.1098/rsob.160009 apa: Howe, K., Schiffer, P., Zielinski, J., Wiehe, T., Laird, G., Marioni, J., … Leptin, M. (2016). Structure and evolutionary history of a large family of NLR proteins in the zebrafish. Open Biology. Royal Society, The. https://doi.org/10.1098/rsob.160009 chicago: Howe, Kerstin, Philipp Schiffer, Julia Zielinski, Thomas Wiehe, Gavin Laird, John Marioni, Onuralp Soylemez, Fyodor Kondrashov, and Maria Leptin. “Structure and Evolutionary History of a Large Family of NLR Proteins in the Zebrafish.” Open Biology. Royal Society, The, 2016. https://doi.org/10.1098/rsob.160009. ieee: K. Howe et al., “Structure and evolutionary history of a large family of NLR proteins in the zebrafish,” Open Biology, vol. 6, no. 4. Royal Society, The, 2016. ista: Howe K, Schiffer P, Zielinski J, Wiehe T, Laird G, Marioni J, Soylemez O, Kondrashov F, Leptin M. 2016. Structure and evolutionary history of a large family of NLR proteins in the zebrafish. Open Biology. 6(4). mla: Howe, Kerstin, et al. “Structure and Evolutionary History of a Large Family of NLR Proteins in the Zebrafish.” Open Biology, vol. 6, no. 4, Royal Society, The, 2016, doi:10.1098/rsob.160009. short: K. Howe, P. Schiffer, J. Zielinski, T. Wiehe, G. Laird, J. Marioni, O. Soylemez, F. Kondrashov, M. Leptin, Open Biology 6 (2016). date_created: 2018-12-11T11:49:04Z date_published: 2016-01-01T00:00:00Z date_updated: 2021-01-12T08:21:32Z day: '01' doi: 10.1098/rsob.160009 extern: 1 intvolume: ' 6' issue: '4' license: https://creativecommons.org/licenses/by/4.0/ month: '01' publication: Open Biology publication_status: published publisher: Royal Society, The publist_id: '6754' quality_controlled: 0 status: public title: Structure and evolutionary history of a large family of NLR proteins in the zebrafish tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article volume: 6 year: '2016' ... --- _id: '1616' abstract: - lang: eng text: The hippocampus plays a key role in learning and memory. Previous studies suggested that the main types of principal neurons, dentate gyrus granule cells (GCs), CA3 pyramidal neurons, and CA1 pyramidal neurons, differ in their activity pattern, with sparse firing in GCs and more frequent firing in CA3 and CA1 pyramidal neurons. It has been assumed but never shown that such different activity may be caused by differential synaptic excitation. To test this hypothesis, we performed high-resolution whole-cell patch-clamp recordings in anesthetized rats in vivo. In contrast to previous in vitro data, both CA3 and CA1 pyramidal neurons fired action potentials spontaneously, with a frequency of ∼3–6 Hz, whereas GCs were silent. Furthermore, both CA3 and CA1 cells primarily fired in bursts. To determine the underlying mechanisms, we quantitatively assessed the frequency of spontaneous excitatory synaptic input, the passive membrane properties, and the active membrane characteristics. Surprisingly, GCs showed comparable synaptic excitation to CA3 and CA1 cells and the highest ratio of excitation versus hyperpolarizing inhibition. Thus, differential synaptic excitation is not responsible for differences in firing. Moreover, the three types of hippocampal neurons markedly differed in their passive properties. While GCs showed the most negative membrane potential, CA3 pyramidal neurons had the highest input resistance and the slowest membrane time constant. The three types of neurons also differed in the active membrane characteristics. GCs showed the highest action potential threshold, but displayed the largest gain of the input-output curves. In conclusion, our results reveal that differential firing of the three main types of hippocampal principal neurons in vivo is not primarily caused by differences in the characteristics of the synaptic input, but by the distinct properties of synaptic integration and input-output transformation. acknowledgement: "The authors thank Jose Guzman for critically reading prior versions of the manuscript. They also thank T. Asenov for\r\nengineering mechanical devices, A. Schlögl for efficient pro-gramming, F. Marr for technical assistance, and E. Kramberger for manuscript editing." article_processing_charge: No author: - first_name: Janina full_name: Kowalski, Janina id: 3F3CA136-F248-11E8-B48F-1D18A9856A87 last_name: Kowalski - first_name: Jian full_name: Gan, Jian id: 3614E438-F248-11E8-B48F-1D18A9856A87 last_name: Gan - first_name: Peter M full_name: Jonas, Peter M id: 353C1B58-F248-11E8-B48F-1D18A9856A87 last_name: Jonas orcid: 0000-0001-5001-4804 - first_name: Alejandro full_name: Pernia-Andrade, Alejandro id: 36963E98-F248-11E8-B48F-1D18A9856A87 last_name: Pernia-Andrade citation: ama: Kowalski J, Gan J, Jonas PM, Pernia-Andrade A. Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats. Hippocampus. 2016;26(5):668-682. doi:10.1002/hipo.22550 apa: Kowalski, J., Gan, J., Jonas, P. M., & Pernia-Andrade, A. (2016). Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats. Hippocampus. Wiley. https://doi.org/10.1002/hipo.22550 chicago: Kowalski, Janina, Jian Gan, Peter M Jonas, and Alejandro Pernia-Andrade. “Intrinsic Membrane Properties Determine Hippocampal Differential Firing Pattern in Vivo in Anesthetized Rats.” Hippocampus. Wiley, 2016. https://doi.org/10.1002/hipo.22550. ieee: J. Kowalski, J. Gan, P. M. Jonas, and A. Pernia-Andrade, “Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats,” Hippocampus, vol. 26, no. 5. Wiley, pp. 668–682, 2016. ista: Kowalski J, Gan J, Jonas PM, Pernia-Andrade A. 2016. Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats. Hippocampus. 26(5), 668–682. mla: Kowalski, Janina, et al. “Intrinsic Membrane Properties Determine Hippocampal Differential Firing Pattern in Vivo in Anesthetized Rats.” Hippocampus, vol. 26, no. 5, Wiley, 2016, pp. 668–82, doi:10.1002/hipo.22550. short: J. Kowalski, J. Gan, P.M. Jonas, A. Pernia-Andrade, Hippocampus 26 (2016) 668–682. date_created: 2018-12-11T11:53:03Z date_published: 2016-05-01T00:00:00Z date_updated: 2023-10-17T10:02:02Z day: '01' ddc: - '570' department: - _id: PeJo doi: 10.1002/hipo.22550 file: - access_level: open_access checksum: 284b72b12fbe15474833ed3d4549f86b content_type: application/pdf creator: system date_created: 2018-12-12T10:13:47Z date_updated: 2020-07-14T12:45:07Z file_id: '5033' file_name: IST-2016-469-v1+1_Kowalski_et_al-Hippocampus.pdf file_size: 905348 relation: main_file file_date_updated: 2020-07-14T12:45:07Z has_accepted_license: '1' intvolume: ' 26' issue: '5' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-nd/4.0/ month: '05' oa: 1 oa_version: Published Version page: 668 - 682 publication: Hippocampus publication_identifier: eissn: - 1098-1063 issn: - 1050-9631 publication_status: published publisher: Wiley publist_id: '5550' pubrep_id: '469' quality_controlled: '1' scopus_import: '1' status: public title: Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 26 year: '2016' ... --- _id: '1617' abstract: - lang: eng text: 'We study the discrepancy of jittered sampling sets: such a set P⊂ [0,1]d is generated for fixed m∈ℕ by partitioning [0,1]d into md axis aligned cubes of equal measure and placing a random point inside each of the N=md cubes. We prove that, for N sufficiently large, 1/10 d/N1/2+1/2d ≤EDN∗(P)≤ √d(log N) 1/2/N1/2+1/2d, where the upper bound with an unspecified constant Cd was proven earlier by Beck. Our proof makes crucial use of the sharp Dvoretzky-Kiefer-Wolfowitz inequality and a suitably taylored Bernstein inequality; we have reasons to believe that the upper bound has the sharp scaling in N. Additional heuristics suggest that jittered sampling should be able to improve known bounds on the inverse of the star-discrepancy in the regime N≳dd. We also prove a partition principle showing that every partition of [0,1]d combined with a jittered sampling construction gives rise to a set whose expected squared L2-discrepancy is smaller than that of purely random points.' acknowledgement: We are grateful to the referee whose suggestions greatly improved the quality and clarity of the exposition. author: - first_name: Florian full_name: Pausinger, Florian id: 2A77D7A2-F248-11E8-B48F-1D18A9856A87 last_name: Pausinger orcid: 0000-0002-8379-3768 - first_name: Stefan full_name: Steinerberger, Stefan last_name: Steinerberger citation: ama: Pausinger F, Steinerberger S. On the discrepancy of jittered sampling. Journal of Complexity. 2016;33:199-216. doi:10.1016/j.jco.2015.11.003 apa: Pausinger, F., & Steinerberger, S. (2016). On the discrepancy of jittered sampling. Journal of Complexity. Academic Press. https://doi.org/10.1016/j.jco.2015.11.003 chicago: Pausinger, Florian, and Stefan Steinerberger. “On the Discrepancy of Jittered Sampling.” Journal of Complexity. Academic Press, 2016. https://doi.org/10.1016/j.jco.2015.11.003. ieee: F. Pausinger and S. Steinerberger, “On the discrepancy of jittered sampling,” Journal of Complexity, vol. 33. Academic Press, pp. 199–216, 2016. ista: Pausinger F, Steinerberger S. 2016. On the discrepancy of jittered sampling. Journal of Complexity. 33, 199–216. mla: Pausinger, Florian, and Stefan Steinerberger. “On the Discrepancy of Jittered Sampling.” Journal of Complexity, vol. 33, Academic Press, 2016, pp. 199–216, doi:10.1016/j.jco.2015.11.003. short: F. Pausinger, S. Steinerberger, Journal of Complexity 33 (2016) 199–216. date_created: 2018-12-11T11:53:03Z date_published: 2016-04-01T00:00:00Z date_updated: 2021-01-12T06:52:02Z day: '01' department: - _id: HeEd doi: 10.1016/j.jco.2015.11.003 intvolume: ' 33' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1510.00251 month: '04' oa: 1 oa_version: Submitted Version page: 199 - 216 publication: Journal of Complexity publication_status: published publisher: Academic Press publist_id: '5549' quality_controlled: '1' scopus_import: 1 status: public title: On the discrepancy of jittered sampling type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 33 year: '2016' ... --- _id: '1620' abstract: - lang: eng text: We consider the Bardeen–Cooper–Schrieffer free energy functional for particles interacting via a two-body potential on a microscopic scale and in the presence of weak external fields varying on a macroscopic scale. We study the influence of the external fields on the critical temperature. We show that in the limit where the ratio between the microscopic and macroscopic scale tends to zero, the next to leading order of the critical temperature is determined by the lowest eigenvalue of the linearization of the Ginzburg–Landau equation. acknowledgement: The authors are grateful to I. M. Sigal for useful discussions. Financial support from the US National Science Foundation through Grants PHY-1347399 and DMS-1363432 (R.L.F.), from the Danish council for independent research and from ERC Advanced Grant 321029 (J.P.S.) is acknowledged. author: - first_name: Rupert full_name: Frank, Rupert last_name: Frank - first_name: Christian full_name: Hainzl, Christian last_name: Hainzl - first_name: Robert full_name: Seiringer, Robert id: 4AFD0470-F248-11E8-B48F-1D18A9856A87 last_name: Seiringer orcid: 0000-0002-6781-0521 - first_name: Jan full_name: Solovej, Jan last_name: Solovej citation: ama: Frank R, Hainzl C, Seiringer R, Solovej J. The external field dependence of the BCS critical temperature. Communications in Mathematical Physics. 2016;342(1):189-216. doi:10.1007/s00220-015-2526-2 apa: Frank, R., Hainzl, C., Seiringer, R., & Solovej, J. (2016). The external field dependence of the BCS critical temperature. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-015-2526-2 chicago: Frank, Rupert, Christian Hainzl, Robert Seiringer, and Jan Solovej. “The External Field Dependence of the BCS Critical Temperature.” Communications in Mathematical Physics. Springer, 2016. https://doi.org/10.1007/s00220-015-2526-2. ieee: R. Frank, C. Hainzl, R. Seiringer, and J. Solovej, “The external field dependence of the BCS critical temperature,” Communications in Mathematical Physics, vol. 342, no. 1. Springer, pp. 189–216, 2016. ista: Frank R, Hainzl C, Seiringer R, Solovej J. 2016. The external field dependence of the BCS critical temperature. Communications in Mathematical Physics. 342(1), 189–216. mla: Frank, Rupert, et al. “The External Field Dependence of the BCS Critical Temperature.” Communications in Mathematical Physics, vol. 342, no. 1, Springer, 2016, pp. 189–216, doi:10.1007/s00220-015-2526-2. short: R. Frank, C. Hainzl, R. Seiringer, J. Solovej, Communications in Mathematical Physics 342 (2016) 189–216. date_created: 2018-12-11T11:53:04Z date_published: 2016-02-01T00:00:00Z date_updated: 2021-01-12T06:52:03Z day: '01' department: - _id: RoSe doi: 10.1007/s00220-015-2526-2 intvolume: ' 342' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1410.2352 month: '02' oa: 1 oa_version: Submitted Version page: 189 - 216 publication: Communications in Mathematical Physics publication_status: published publisher: Springer publist_id: '5546' quality_controlled: '1' scopus_import: 1 status: public title: The external field dependence of the BCS critical temperature type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 342 year: '2016' ... --- _id: '1622' abstract: - lang: eng text: We prove analogues of the Lieb–Thirring and Hardy–Lieb–Thirring inequalities for many-body quantum systems with fractional kinetic operators and homogeneous interaction potentials, where no anti-symmetry on the wave functions is assumed. These many-body inequalities imply interesting one-body interpolation inequalities, and we show that the corresponding one- and many-body inequalities are actually equivalent in certain cases. acknowledgement: "We thank Jan Philip Solovej, Robert Seiringer and Vladimir Maz’ya for helpful discussions, as well as Rupert Frank\r\nand the anonymous referee for useful comments. Part of this work has been carried out during a visit at the Institut Mittag-Leffler (Stockholm). D.L. acknowledges financial support by the grant KAW 2010.0063 from the Knut and Alice Wallenberg Foundation and the Swedish Research Council grant no. 2013-4734. P.T.N. is supported by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. 291734. F.P. acknowledges support from the ERC project no. 321029 “The\r\nmathematics of the structure of matter”." author: - first_name: Douglas full_name: Lundholm, Douglas last_name: Lundholm - first_name: Phan full_name: Nam, Phan id: 404092F4-F248-11E8-B48F-1D18A9856A87 last_name: Nam - first_name: Fabian full_name: Portmann, Fabian last_name: Portmann citation: ama: Lundholm D, Nam P, Portmann F. Fractional Hardy–Lieb–Thirring and related Inequalities for interacting systems. Archive for Rational Mechanics and Analysis. 2016;219(3):1343-1382. doi:10.1007/s00205-015-0923-5 apa: Lundholm, D., Nam, P., & Portmann, F. (2016). Fractional Hardy–Lieb–Thirring and related Inequalities for interacting systems. Archive for Rational Mechanics and Analysis. Springer. https://doi.org/10.1007/s00205-015-0923-5 chicago: Lundholm, Douglas, Phan Nam, and Fabian Portmann. “Fractional Hardy–Lieb–Thirring and Related Inequalities for Interacting Systems.” Archive for Rational Mechanics and Analysis. Springer, 2016. https://doi.org/10.1007/s00205-015-0923-5. ieee: D. Lundholm, P. Nam, and F. Portmann, “Fractional Hardy–Lieb–Thirring and related Inequalities for interacting systems,” Archive for Rational Mechanics and Analysis, vol. 219, no. 3. Springer, pp. 1343–1382, 2016. ista: Lundholm D, Nam P, Portmann F. 2016. Fractional Hardy–Lieb–Thirring and related Inequalities for interacting systems. Archive for Rational Mechanics and Analysis. 219(3), 1343–1382. mla: Lundholm, Douglas, et al. “Fractional Hardy–Lieb–Thirring and Related Inequalities for Interacting Systems.” Archive for Rational Mechanics and Analysis, vol. 219, no. 3, Springer, 2016, pp. 1343–82, doi:10.1007/s00205-015-0923-5. short: D. Lundholm, P. Nam, F. Portmann, Archive for Rational Mechanics and Analysis 219 (2016) 1343–1382. date_created: 2018-12-11T11:53:05Z date_published: 2016-03-01T00:00:00Z date_updated: 2021-01-12T06:52:04Z day: '01' department: - _id: RoSe doi: 10.1007/s00205-015-0923-5 ec_funded: 1 intvolume: ' 219' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1501.04570 month: '03' oa: 1 oa_version: Submitted Version page: 1343 - 1382 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Archive for Rational Mechanics and Analysis publication_status: published publisher: Springer publist_id: '5542' quality_controlled: '1' scopus_import: 1 status: public title: Fractional Hardy–Lieb–Thirring and related Inequalities for interacting systems type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 219 year: '2016' ... --- _id: '1631' abstract: - lang: eng text: 'Ancestral processes are fundamental to modern population genetics and spatial structure has been the subject of intense interest for many years. Despite this interest, almost nothing is known about the distribution of the locations of pedigree or genetic ancestors. Using both spatially continuous and stepping-stone models, we show that the distribution of pedigree ancestors approaches a travelling wave, for which we develop two alternative approximations. The speed and width of the wave are sensitive to the local details of the model. After a short time, genetic ancestors spread far more slowly than pedigree ancestors, ultimately diffusing out with radius ## rather than spreading at constant speed. In contrast to the wave of pedigree ancestors, the spread of genetic ancestry is insensitive to the local details of the models.' author: - first_name: Jerome full_name: Kelleher, Jerome last_name: Kelleher - first_name: Alison full_name: Etheridge, Alison last_name: Etheridge - first_name: Amandine full_name: Véber, Amandine last_name: Véber - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 citation: ama: Kelleher J, Etheridge A, Véber A, Barton NH. Spread of pedigree versus genetic ancestry in spatially distributed populations. Theoretical Population Biology. 2016;108:1-12. doi:10.1016/j.tpb.2015.10.008 apa: Kelleher, J., Etheridge, A., Véber, A., & Barton, N. H. (2016). Spread of pedigree versus genetic ancestry in spatially distributed populations. Theoretical Population Biology. Academic Press. https://doi.org/10.1016/j.tpb.2015.10.008 chicago: Kelleher, Jerome, Alison Etheridge, Amandine Véber, and Nicholas H Barton. “Spread of Pedigree versus Genetic Ancestry in Spatially Distributed Populations.” Theoretical Population Biology. Academic Press, 2016. https://doi.org/10.1016/j.tpb.2015.10.008. ieee: J. Kelleher, A. Etheridge, A. Véber, and N. H. Barton, “Spread of pedigree versus genetic ancestry in spatially distributed populations,” Theoretical Population Biology, vol. 108. Academic Press, pp. 1–12, 2016. ista: Kelleher J, Etheridge A, Véber A, Barton NH. 2016. Spread of pedigree versus genetic ancestry in spatially distributed populations. Theoretical Population Biology. 108, 1–12. mla: Kelleher, Jerome, et al. “Spread of Pedigree versus Genetic Ancestry in Spatially Distributed Populations.” Theoretical Population Biology, vol. 108, Academic Press, 2016, pp. 1–12, doi:10.1016/j.tpb.2015.10.008. short: J. Kelleher, A. Etheridge, A. Véber, N.H. Barton, Theoretical Population Biology 108 (2016) 1–12. date_created: 2018-12-11T11:53:08Z date_published: 2016-04-01T00:00:00Z date_updated: 2021-01-12T06:52:07Z day: '01' ddc: - '576' department: - _id: NiBa doi: 10.1016/j.tpb.2015.10.008 ec_funded: 1 file: - access_level: open_access checksum: 6a65ba187994d4ad86c1c509e0ff482a content_type: application/pdf creator: system date_created: 2018-12-12T10:11:12Z date_updated: 2020-07-14T12:45:07Z file_id: '4865' file_name: IST-2016-465-v1+1_1-s2.0-S0040580915001094-main.pdf file_size: 1684043 relation: main_file file_date_updated: 2020-07-14T12:45:07Z has_accepted_license: '1' intvolume: ' 108' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 1 - 12 project: - _id: 25B07788-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '250152' name: Limits to selection in biology and in evolutionary computation publication: Theoretical Population Biology publication_status: published publisher: Academic Press publist_id: '5524' pubrep_id: '465' quality_controlled: '1' scopus_import: 1 status: public title: Spread of pedigree versus genetic ancestry in spatially distributed populations tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 108 year: '2016' ... --- _id: '1641' abstract: - lang: eng text: The plant hormone auxin (indole-3-acetic acid) is a major regulator of plant growth and development including embryo and root patterning, lateral organ formation and growth responses to environmental stimuli. Auxin is directionally transported from cell to cell by the action of specific auxin influx [AUXIN-RESISTANT1 (AUX1)] and efflux [PIN-FORMED (PIN)] transport regulators, whose polar, subcellular localizations are aligned with the direction of the auxin flow. Auxin itself regulates its own transport by modulation of the expression and subcellular localization of the auxin transporters. Increased auxin levels promote the transcription of PIN2 and AUX1 genes as well as stabilize PIN proteins at the plasma membrane, whereas prolonged auxin exposure increases the turnover of PIN proteins and their degradation in the vacuole. In this study, we applied a forward genetic approach, to identify molecular components playing a role in the auxin-mediated degradation. We generated EMS-mutagenized Arabidopsis PIN2::PIN2:GFP, AUX1::AUX1:YFP eir1aux1 populations and designed a screen for mutants with persistently strong fluorescent signals of the tagged PIN2 and AUX1 after prolonged treatment with the synthetic auxin 2,4-dichlorophenoxyacetic acid (2,4-D). This approach yielded novel auxin degradation mutants defective in trafficking and degradation of PIN2 and AUX1 proteins and established a role for auxin-mediated degradation in plant development. acknowledgement: 'European Social Fund (CZ.1.07/2.3.00/20.0043) and the Czech Science Foundation GAČR (GA13-40637S) to JF. ' author: - first_name: Radka full_name: Zemová, Radka last_name: Zemová - first_name: Marta full_name: Zwiewka, Marta last_name: Zwiewka - first_name: Agnieszka full_name: Bielach, Agnieszka last_name: Bielach - first_name: Hélène full_name: Robert, Hélène last_name: Robert - first_name: Jirí full_name: Friml, Jirí id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: Zemová R, Zwiewka M, Bielach A, Robert H, Friml J. A forward genetic screen for new regulators of auxin mediated degradation of auxin transport proteins in Arabidopsis thaliana. Journal of Plant Growth Regulation. 2016;35(2):465-476. doi:10.1007/s00344-015-9553-2 apa: Zemová, R., Zwiewka, M., Bielach, A., Robert, H., & Friml, J. (2016). A forward genetic screen for new regulators of auxin mediated degradation of auxin transport proteins in Arabidopsis thaliana. Journal of Plant Growth Regulation. Springer. https://doi.org/10.1007/s00344-015-9553-2 chicago: Zemová, Radka, Marta Zwiewka, Agnieszka Bielach, Hélène Robert, and Jiří Friml. “A Forward Genetic Screen for New Regulators of Auxin Mediated Degradation of Auxin Transport Proteins in Arabidopsis Thaliana.” Journal of Plant Growth Regulation. Springer, 2016. https://doi.org/10.1007/s00344-015-9553-2. ieee: R. Zemová, M. Zwiewka, A. Bielach, H. Robert, and J. Friml, “A forward genetic screen for new regulators of auxin mediated degradation of auxin transport proteins in Arabidopsis thaliana,” Journal of Plant Growth Regulation, vol. 35, no. 2. Springer, pp. 465–476, 2016. ista: Zemová R, Zwiewka M, Bielach A, Robert H, Friml J. 2016. A forward genetic screen for new regulators of auxin mediated degradation of auxin transport proteins in Arabidopsis thaliana. Journal of Plant Growth Regulation. 35(2), 465–476. mla: Zemová, Radka, et al. “A Forward Genetic Screen for New Regulators of Auxin Mediated Degradation of Auxin Transport Proteins in Arabidopsis Thaliana.” Journal of Plant Growth Regulation, vol. 35, no. 2, Springer, 2016, pp. 465–76, doi:10.1007/s00344-015-9553-2. short: R. Zemová, M. Zwiewka, A. Bielach, H. Robert, J. Friml, Journal of Plant Growth Regulation 35 (2016) 465–476. date_created: 2018-12-11T11:53:12Z date_published: 2016-06-01T00:00:00Z date_updated: 2021-01-12T06:52:11Z day: '01' ddc: - '581' department: - _id: JiFr doi: 10.1007/s00344-015-9553-2 file: - access_level: open_access checksum: 0dc6a300cde6536ceedd2bcdd2060efb content_type: application/pdf creator: system date_created: 2018-12-12T10:08:34Z date_updated: 2020-07-14T12:45:08Z file_id: '4695' file_name: IST-2018-1001-v1+1_Zemova_JPlantGrowthRegul_2016_proofs.pdf file_size: 5637591 relation: main_file file_date_updated: 2020-07-14T12:45:08Z has_accepted_license: '1' intvolume: ' 35' issue: '2' language: - iso: eng month: '06' oa: 1 oa_version: Preprint page: 465 - 476 publication: Journal of Plant Growth Regulation publication_status: published publisher: Springer publist_id: '5512' pubrep_id: '1001' quality_controlled: '1' scopus_import: 1 status: public title: A forward genetic screen for new regulators of auxin mediated degradation of auxin transport proteins in Arabidopsis thaliana type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 35 year: '2016' ... --- _id: '1653' abstract: - lang: eng text: "A somewhere statistically binding (SSB) hash, introduced by Hubáček and Wichs (ITCS ’15), can be used to hash a long string x to a short digest y = H hk (x) using a public hashing-key hk. Furthermore, there is a way to set up the hash key hk to make it statistically binding on some arbitrary hidden position i, meaning that: (1) the digest y completely determines the i’th bit (or symbol) of x so that all pre-images of y have the same value in the i’th position, (2) it is computationally infeasible to distinguish the position i on which hk is statistically binding from any other position i’. Lastly, the hash should have a local opening property analogous to Merkle-Tree hashing, meaning that given x and y = H hk (x) it should be possible to create a short proof π that certifies the value of the i’th bit (or symbol) of x without having to provide the entire input x. A similar primitive called a positional accumulator, introduced by Koppula, Lewko and Waters (STOC ’15) further supports dynamic updates of the hashed value. These tools, which are interesting in their own right, also serve as one of the main technical components in several recent works building advanced applications from indistinguishability obfuscation (iO).\r\n\r\nThe prior constructions of SSB hashing and positional accumulators required fully homomorphic encryption (FHE) and iO respectively. In this work, we give new constructions of these tools based on well studied number-theoretic assumptions such as DDH, Phi-Hiding and DCR, as well as a general construction from lossy/injective functions." alternative_title: - LNCS author: - first_name: Tatsuaki full_name: Okamoto, Tatsuaki last_name: Okamoto - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 - first_name: Brent full_name: Waters, Brent last_name: Waters - first_name: Daniel full_name: Wichs, Daniel last_name: Wichs citation: ama: 'Okamoto T, Pietrzak KZ, Waters B, Wichs D. New realizations of somewhere statistically binding hashing and positional accumulators. In: Vol 9452. Springer; 2016:121-145. doi:10.1007/978-3-662-48797-6_6' apa: 'Okamoto, T., Pietrzak, K. Z., Waters, B., & Wichs, D. (2016). New realizations of somewhere statistically binding hashing and positional accumulators (Vol. 9452, pp. 121–145). Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Auckland, New Zealand: Springer. https://doi.org/10.1007/978-3-662-48797-6_6' chicago: Okamoto, Tatsuaki, Krzysztof Z Pietrzak, Brent Waters, and Daniel Wichs. “New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators,” 9452:121–45. Springer, 2016. https://doi.org/10.1007/978-3-662-48797-6_6. ieee: 'T. Okamoto, K. Z. Pietrzak, B. Waters, and D. Wichs, “New realizations of somewhere statistically binding hashing and positional accumulators,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Auckland, New Zealand, 2016, vol. 9452, pp. 121–145.' ista: 'Okamoto T, Pietrzak KZ, Waters B, Wichs D. 2016. New realizations of somewhere statistically binding hashing and positional accumulators. ASIACRYPT: Theory and Application of Cryptology and Information Security, LNCS, vol. 9452, 121–145.' mla: Okamoto, Tatsuaki, et al. New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators. Vol. 9452, Springer, 2016, pp. 121–45, doi:10.1007/978-3-662-48797-6_6. short: T. Okamoto, K.Z. Pietrzak, B. Waters, D. Wichs, in:, Springer, 2016, pp. 121–145. conference: end_date: 2015-12-03 location: Auckland, New Zealand name: 'ASIACRYPT: Theory and Application of Cryptology and Information Security' start_date: 2015-11-29 date_created: 2018-12-11T11:53:16Z date_published: 2016-01-08T00:00:00Z date_updated: 2021-01-12T06:52:16Z day: '08' ddc: - '000' department: - _id: KrPi doi: 10.1007/978-3-662-48797-6_6 ec_funded: 1 file: - access_level: open_access checksum: a57711cb660c5b17b42bb47275a00180 content_type: application/pdf creator: system date_created: 2018-12-12T10:12:05Z date_updated: 2020-07-14T12:45:08Z file_id: '4923' file_name: IST-2016-677-v1+1_869.pdf file_size: 580088 relation: main_file file_date_updated: 2020-07-14T12:45:08Z has_accepted_license: '1' intvolume: ' 9452' language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 121 - 145 project: - _id: 258C570E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '259668' name: Provable Security for Physical Cryptography publication_status: published publisher: Springer publist_id: '5497' pubrep_id: '677' quality_controlled: '1' scopus_import: 1 status: public title: New realizations of somewhere statistically binding hashing and positional accumulators type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 9452 year: '2016' ... --- _id: '1662' abstract: - lang: eng text: We introduce a modification of the classic notion of intrinsic volume using persistence moments of height functions. Evaluating the modified first intrinsic volume on digital approximations of a compact body with smoothly embedded boundary in Rn, we prove convergence to the first intrinsic volume of the body as the resolution of the approximation improves. We have weaker results for the other modified intrinsic volumes, proving they converge to the corresponding intrinsic volumes of the n-dimensional unit ball. acknowledgement: "This research is partially supported by the Toposys project FP7-ICT-318493-STREP, and by ESF under the ACAT Research Network Programme.\r\nBoth authors thank Anne Marie Svane for her comments on an early version of this paper. The second author wishes to thank Eva B. Vedel Jensen and Markus Kiderlen from Aarhus University for enlightening discussions and their kind hospitality during a visit of their department in 2014." author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Florian full_name: Pausinger, Florian id: 2A77D7A2-F248-11E8-B48F-1D18A9856A87 last_name: Pausinger orcid: 0000-0002-8379-3768 citation: ama: Edelsbrunner H, Pausinger F. Approximation and convergence of the intrinsic volume. Advances in Mathematics. 2016;287:674-703. doi:10.1016/j.aim.2015.10.004 apa: Edelsbrunner, H., & Pausinger, F. (2016). Approximation and convergence of the intrinsic volume. Advances in Mathematics. Academic Press. https://doi.org/10.1016/j.aim.2015.10.004 chicago: Edelsbrunner, Herbert, and Florian Pausinger. “Approximation and Convergence of the Intrinsic Volume.” Advances in Mathematics. Academic Press, 2016. https://doi.org/10.1016/j.aim.2015.10.004. ieee: H. Edelsbrunner and F. Pausinger, “Approximation and convergence of the intrinsic volume,” Advances in Mathematics, vol. 287. Academic Press, pp. 674–703, 2016. ista: Edelsbrunner H, Pausinger F. 2016. Approximation and convergence of the intrinsic volume. Advances in Mathematics. 287, 674–703. mla: Edelsbrunner, Herbert, and Florian Pausinger. “Approximation and Convergence of the Intrinsic Volume.” Advances in Mathematics, vol. 287, Academic Press, 2016, pp. 674–703, doi:10.1016/j.aim.2015.10.004. short: H. Edelsbrunner, F. Pausinger, Advances in Mathematics 287 (2016) 674–703. date_created: 2018-12-11T11:53:20Z date_published: 2016-01-10T00:00:00Z date_updated: 2023-09-07T11:41:25Z day: '10' ddc: - '004' department: - _id: HeEd doi: 10.1016/j.aim.2015.10.004 ec_funded: 1 file: - access_level: open_access checksum: f8869ec110c35c852ef6a37425374af7 content_type: application/pdf creator: system date_created: 2018-12-12T10:12:10Z date_updated: 2020-07-14T12:45:10Z file_id: '4928' file_name: IST-2017-774-v1+1_2016-J-03-FirstIntVolume.pdf file_size: 248985 relation: main_file file_date_updated: 2020-07-14T12:45:10Z has_accepted_license: '1' intvolume: ' 287' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 674 - 703 project: - _id: 255D761E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '318493' name: Topological Complex Systems publication: Advances in Mathematics publication_status: published publisher: Academic Press publist_id: '5488' pubrep_id: '774' quality_controlled: '1' related_material: record: - id: '1399' relation: dissertation_contains status: public scopus_import: 1 status: public title: Approximation and convergence of the intrinsic volume tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 287 year: '2016' ... --- _id: '1705' abstract: - lang: eng text: Hybrid systems represent an important and powerful formalism for modeling real-world applications such as embedded systems. A verification tool like SpaceEx is based on the exploration of a symbolic search space (the region space). As a verification tool, it is typically optimized towards proving the absence of errors. In some settings, e.g., when the verification tool is employed in a feedback-directed design cycle, one would like to have the option to call a version that is optimized towards finding an error trajectory in the region space. A recent approach in this direction is based on guided search. Guided search relies on a cost function that indicates which states are promising to be explored, and preferably explores more promising states first. In this paper, we propose an abstraction-based cost function based on coarse-grained space abstractions for guiding the reachability analysis. For this purpose, a suitable abstraction technique that exploits the flexible granularity of modern reachability analysis algorithms is introduced. The new cost function is an effective extension of pattern database approaches that have been successfully applied in other areas. The approach has been implemented in the SpaceEx model checker. The evaluation shows its practical potential. article_processing_charge: Yes (via OA deal) author: - first_name: Sergiy full_name: Bogomolov, Sergiy id: 369D9A44-F248-11E8-B48F-1D18A9856A87 last_name: Bogomolov orcid: 0000-0002-0686-0365 - first_name: Alexandre full_name: Donzé, Alexandre last_name: Donzé - first_name: Goran full_name: Frehse, Goran last_name: Frehse - first_name: Radu full_name: Grosu, Radu last_name: Grosu - first_name: Taylor full_name: Johnson, Taylor last_name: Johnson - first_name: Hamed full_name: Ladan, Hamed last_name: Ladan - first_name: Andreas full_name: Podelski, Andreas last_name: Podelski - first_name: Martin full_name: Wehrle, Martin last_name: Wehrle citation: ama: Bogomolov S, Donzé A, Frehse G, et al. Guided search for hybrid systems based on coarse-grained space abstractions. International Journal on Software Tools for Technology Transfer. 2016;18(4):449-467. doi:10.1007/s10009-015-0393-y apa: Bogomolov, S., Donzé, A., Frehse, G., Grosu, R., Johnson, T., Ladan, H., … Wehrle, M. (2016). Guided search for hybrid systems based on coarse-grained space abstractions. International Journal on Software Tools for Technology Transfer. Springer. https://doi.org/10.1007/s10009-015-0393-y chicago: Bogomolov, Sergiy, Alexandre Donzé, Goran Frehse, Radu Grosu, Taylor Johnson, Hamed Ladan, Andreas Podelski, and Martin Wehrle. “Guided Search for Hybrid Systems Based on Coarse-Grained Space Abstractions.” International Journal on Software Tools for Technology Transfer. Springer, 2016. https://doi.org/10.1007/s10009-015-0393-y. ieee: S. Bogomolov et al., “Guided search for hybrid systems based on coarse-grained space abstractions,” International Journal on Software Tools for Technology Transfer, vol. 18, no. 4. Springer, pp. 449–467, 2016. ista: Bogomolov S, Donzé A, Frehse G, Grosu R, Johnson T, Ladan H, Podelski A, Wehrle M. 2016. Guided search for hybrid systems based on coarse-grained space abstractions. International Journal on Software Tools for Technology Transfer. 18(4), 449–467. mla: Bogomolov, Sergiy, et al. “Guided Search for Hybrid Systems Based on Coarse-Grained Space Abstractions.” International Journal on Software Tools for Technology Transfer, vol. 18, no. 4, Springer, 2016, pp. 449–67, doi:10.1007/s10009-015-0393-y. short: S. Bogomolov, A. Donzé, G. Frehse, R. Grosu, T. Johnson, H. Ladan, A. Podelski, M. Wehrle, International Journal on Software Tools for Technology Transfer 18 (2016) 449–467. date_created: 2018-12-11T11:53:34Z date_published: 2016-08-01T00:00:00Z date_updated: 2021-01-12T06:52:38Z day: '01' ddc: - '000' department: - _id: ToHe doi: 10.1007/s10009-015-0393-y ec_funded: 1 file: - access_level: open_access checksum: 31561d7705599a9bd4ea816accc0752e content_type: application/pdf creator: system date_created: 2018-12-12T10:15:26Z date_updated: 2020-07-14T12:45:13Z file_id: '5146' file_name: IST-2016-457-v1+1_s10009-015-0393-y.pdf file_size: 2296522 relation: main_file file_date_updated: 2020-07-14T12:45:13Z has_accepted_license: '1' intvolume: ' 18' issue: '4' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: 449 - 467 project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication: International Journal on Software Tools for Technology Transfer publication_status: published publisher: Springer publist_id: '5431' pubrep_id: '457' quality_controlled: '1' scopus_import: 1 status: public title: Guided search for hybrid systems based on coarse-grained space abstractions tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 18 year: '2016' ... --- _id: '1707' abstract: - lang: eng text: "Volunteer supporters play an important role in modern crisis and disaster management. In the times of mobile Internet devices, help from thousands of volunteers can be requested within a short time span, thus relieving professional helpers from minor chores or geographically spread-out tasks. However, the simultaneous availability of many volunteers also poses new problems. In particular, the volunteer efforts must be well coordinated, or otherwise situations might emerge in which too many idle volunteers at one location become more of a burden than a relief to the professionals.\r\nIn this work, we study the task of optimally assigning volunteers to selected locations, e.g. in order to perform regular measurements, to report on damage, or to distribute information or resources to the population in a crisis situation. We formulate the assignment tasks as an optimization problem and propose an effective and efficient solution procedure. Experiments on real data of the Team Österreich, consisting of over 36,000 Austrian volunteers, show the effectiveness and efficiency of our approach." acknowledgement: The DRIVER FP7 project has received funding from the European Unions Seventh Framework Programme for research, technological development and demonstration under grant agreement no 607798. RE-ACTA was funded within the framework of the Austrian Security Research Programme KIRAS by the Federal Ministry for Transport, Innovation and Technology. article_number: '7402041' author: - first_name: Jasmin full_name: Pielorz, Jasmin id: 49BC895A-F248-11E8-B48F-1D18A9856A87 last_name: Pielorz - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 citation: ama: 'Pielorz J, Lampert C. Optimal geospatial allocation of volunteers for crisis management. In: IEEE; 2016. doi:10.1109/ICT-DM.2015.7402041' apa: 'Pielorz, J., & Lampert, C. (2016). Optimal geospatial allocation of volunteers for crisis management. Presented at the ICT-DM: Information and Communication Technologies for Disaster Management, Rennes, France: IEEE. https://doi.org/10.1109/ICT-DM.2015.7402041' chicago: Pielorz, Jasmin, and Christoph Lampert. “Optimal Geospatial Allocation of Volunteers for Crisis Management.” IEEE, 2016. https://doi.org/10.1109/ICT-DM.2015.7402041. ieee: 'J. Pielorz and C. Lampert, “Optimal geospatial allocation of volunteers for crisis management,” presented at the ICT-DM: Information and Communication Technologies for Disaster Management, Rennes, France, 2016.' ista: 'Pielorz J, Lampert C. 2016. Optimal geospatial allocation of volunteers for crisis management. ICT-DM: Information and Communication Technologies for Disaster Management, 7402041.' mla: Pielorz, Jasmin, and Christoph Lampert. Optimal Geospatial Allocation of Volunteers for Crisis Management. 7402041, IEEE, 2016, doi:10.1109/ICT-DM.2015.7402041. short: J. Pielorz, C. Lampert, in:, IEEE, 2016. conference: end_date: 2015-12-02 location: Rennes, France name: 'ICT-DM: Information and Communication Technologies for Disaster Management' start_date: 2015-11-30 date_created: 2018-12-11T11:53:35Z date_published: 2016-02-11T00:00:00Z date_updated: 2021-01-12T06:52:39Z day: '11' department: - _id: ChLa doi: 10.1109/ICT-DM.2015.7402041 language: - iso: eng month: '02' oa_version: None publication_status: published publisher: IEEE publist_id: '5429' quality_controlled: '1' scopus_import: 1 status: public title: Optimal geospatial allocation of volunteers for crisis management type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2016' ... --- _id: '173' abstract: - lang: eng text: We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct primes. article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Timothy D full_name: Browning, Timothy D id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 - first_name: Andrew full_name: Booker, Andrew last_name: Booker citation: ama: Browning TD, Booker A. Square-free values of reducible polynomials. Discrete Analysis. 2016;8:1-18. doi:10.19086/da.732 apa: Browning, T. D., & Booker, A. (2016). Square-free values of reducible polynomials. Discrete Analysis. https://doi.org/10.19086/da.732 chicago: Browning, Timothy D, and Andrew Booker. “Square-Free Values of Reducible Polynomials.” Discrete Analysis, 2016. https://doi.org/10.19086/da.732. ieee: T. D. Browning and A. Booker, “Square-free values of reducible polynomials,” Discrete Analysis, vol. 8. pp. 1–18, 2016. ista: Browning TD, Booker A. 2016. Square-free values of reducible polynomials. Discrete Analysis. 8, 1–18. mla: Browning, Timothy D., and Andrew Booker. “Square-Free Values of Reducible Polynomials.” Discrete Analysis, vol. 8, 2016, pp. 1–18, doi:10.19086/da.732. short: T.D. Browning, A. Booker, Discrete Analysis 8 (2016) 1–18. date_created: 2018-12-11T11:45:00Z date_published: 2016-06-01T00:00:00Z date_updated: 2021-01-12T06:52:49Z day: '01' doi: 10.19086/da.732 extern: '1' external_id: arxiv: - '1511.00601' intvolume: ' 8' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1511.00601 month: '06' oa: 1 oa_version: Preprint page: 1 - 18 publication: Discrete Analysis publication_status: published publist_id: '7748' quality_controlled: '1' status: public title: Square-free values of reducible polynomials type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 8 year: '2016' ... --- _id: '1794' abstract: - lang: eng text: We consider Conditional random fields (CRFs) with pattern-based potentials defined on a chain. In this model the energy of a string (labeling) (Formula presented.) is the sum of terms over intervals [i, j] where each term is non-zero only if the substring (Formula presented.) equals a prespecified pattern w. Such CRFs can be naturally applied to many sequence tagging problems. We present efficient algorithms for the three standard inference tasks in a CRF, namely computing (i) the partition function, (ii) marginals, and (iii) computing the MAP. Their complexities are respectively (Formula presented.), (Formula presented.) and (Formula presented.) where L is the combined length of input patterns, (Formula presented.) is the maximum length of a pattern, and D is the input alphabet. This improves on the previous algorithms of Ye et al. (NIPS, 2009) whose complexities are respectively (Formula presented.), (Formula presented.) and (Formula presented.), where (Formula presented.) is the number of input patterns. In addition, we give an efficient algorithm for sampling, and revisit the case of MAP with non-positive weights. acknowledgement: This work has been partially supported by the European Research Council under the European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no. 616160. arxiv: 1 author: - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov - first_name: Rustem full_name: Takhanov, Rustem id: 2CCAC26C-F248-11E8-B48F-1D18A9856A87 last_name: Takhanov citation: ama: Kolmogorov V, Takhanov R. Inference algorithms for pattern-based CRFs on sequence data. Algorithmica. 2016;76(1):17-46. doi:10.1007/s00453-015-0017-7 apa: Kolmogorov, V., & Takhanov, R. (2016). Inference algorithms for pattern-based CRFs on sequence data. Algorithmica. Springer. https://doi.org/10.1007/s00453-015-0017-7 chicago: Kolmogorov, Vladimir, and Rustem Takhanov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” Algorithmica. Springer, 2016. https://doi.org/10.1007/s00453-015-0017-7. ieee: V. Kolmogorov and R. Takhanov, “Inference algorithms for pattern-based CRFs on sequence data,” Algorithmica, vol. 76, no. 1. Springer, pp. 17–46, 2016. ista: Kolmogorov V, Takhanov R. 2016. Inference algorithms for pattern-based CRFs on sequence data. Algorithmica. 76(1), 17–46. mla: Kolmogorov, Vladimir, and Rustem Takhanov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” Algorithmica, vol. 76, no. 1, Springer, 2016, pp. 17–46, doi:10.1007/s00453-015-0017-7. short: V. Kolmogorov, R. Takhanov, Algorithmica 76 (2016) 17–46. date_created: 2018-12-11T11:54:02Z date_published: 2016-09-01T00:00:00Z date_updated: 2023-10-17T09:51:31Z day: '01' department: - _id: VlKo doi: 10.1007/s00453-015-0017-7 ec_funded: 1 external_id: arxiv: - '1210.0508' intvolume: ' 76' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1210.0508 month: '09' oa: 1 oa_version: Preprint page: 17 - 46 project: - _id: 25FBA906-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '616160' name: 'Discrete Optimization in Computer Vision: Theory and Practice' publication: Algorithmica publication_status: published publisher: Springer publist_id: '5316' quality_controlled: '1' related_material: record: - id: '2272' relation: earlier_version status: public scopus_import: 1 status: public title: Inference algorithms for pattern-based CRFs on sequence data type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 76 year: '2016' ... --- _id: '1833' abstract: - lang: eng text: 'Relational models for contingency tables are generalizations of log-linear models, allowing effects associated with arbitrary subsets of cells in the table, and not necessarily containing the overall effect, that is, a common parameter in every cell. Similarly to log-linear models, relational models can be extended to non-negative distributions, but the extension requires more complex methods. An extended relational model is defined as an algebraic variety, and it turns out to be the closure of the original model with respect to the Bregman divergence. In the extended relational model, the MLE of the cell parameters always exists and is unique, but some of its properties may be different from those of the MLE under log-linear models. The MLE can be computed using a generalized iterative scaling procedure based on Bregman projections. ' author: - first_name: Anna full_name: Klimova, Anna id: 31934120-F248-11E8-B48F-1D18A9856A87 last_name: Klimova - first_name: Tamás full_name: Rudas, Tamás last_name: Rudas citation: ama: Klimova A, Rudas T. On the closure of relational models. Journal of Multivariate Analysis. 2016;143:440-452. doi:10.1016/j.jmva.2015.10.005 apa: Klimova, A., & Rudas, T. (2016). On the closure of relational models. Journal of Multivariate Analysis. Elsevier. https://doi.org/10.1016/j.jmva.2015.10.005 chicago: Klimova, Anna, and Tamás Rudas. “On the Closure of Relational Models.” Journal of Multivariate Analysis. Elsevier, 2016. https://doi.org/10.1016/j.jmva.2015.10.005. ieee: A. Klimova and T. Rudas, “On the closure of relational models,” Journal of Multivariate Analysis, vol. 143. Elsevier, pp. 440–452, 2016. ista: Klimova A, Rudas T. 2016. On the closure of relational models. Journal of Multivariate Analysis. 143, 440–452. mla: Klimova, Anna, and Tamás Rudas. “On the Closure of Relational Models.” Journal of Multivariate Analysis, vol. 143, Elsevier, 2016, pp. 440–52, doi:10.1016/j.jmva.2015.10.005. short: A. Klimova, T. Rudas, Journal of Multivariate Analysis 143 (2016) 440–452. date_created: 2018-12-11T11:54:15Z date_published: 2016-01-01T00:00:00Z date_updated: 2021-01-12T06:53:30Z day: '01' department: - _id: CaUh doi: 10.1016/j.jmva.2015.10.005 intvolume: ' 143' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1501.00600 month: '01' oa: 1 oa_version: Preprint page: 440 - 452 publication: Journal of Multivariate Analysis publication_status: published publisher: Elsevier publist_id: '5270' quality_controlled: '1' scopus_import: 1 status: public title: On the closure of relational models type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 143 year: '2016' ... --- _id: '1881' abstract: - lang: eng text: 'We consider random matrices of the form H=W+λV, λ∈ℝ+, where W is a real symmetric or complex Hermitian Wigner matrix of size N and V is a real bounded diagonal random matrix of size N with i.i.d.\ entries that are independent of W. We assume subexponential decay for the matrix entries of W and we choose λ∼1, so that the eigenvalues of W and λV are typically of the same order. Further, we assume that the density of the entries of V is supported on a single interval and is convex near the edges of its support. In this paper we prove that there is λ+∈ℝ+ such that the largest eigenvalues of H are in the limit of large N determined by the order statistics of V for λ>λ+. In particular, the largest eigenvalue of H has a Weibull distribution in the limit N→∞ if λ>λ+. Moreover, for N sufficiently large, we show that the eigenvectors associated to the largest eigenvalues are partially localized for λ>λ+, while they are completely delocalized for λ<λ+. Similar results hold for the lowest eigenvalues. ' acknowledgement: "Most of the presented work was obtained while Kevin Schnelli was staying at the IAS with the support of\r\nThe Fund For Math." author: - first_name: Jioon full_name: Lee, Jioon last_name: Lee - first_name: Kevin full_name: Schnelli, Kevin id: 434AD0AE-F248-11E8-B48F-1D18A9856A87 last_name: Schnelli orcid: 0000-0003-0954-3231 citation: ama: Lee J, Schnelli K. Extremal eigenvalues and eigenvectors of deformed Wigner matrices. Probability Theory and Related Fields. 2016;164(1-2):165-241. doi:10.1007/s00440-014-0610-8 apa: Lee, J., & Schnelli, K. (2016). Extremal eigenvalues and eigenvectors of deformed Wigner matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-014-0610-8 chicago: Lee, Jioon, and Kevin Schnelli. “Extremal Eigenvalues and Eigenvectors of Deformed Wigner Matrices.” Probability Theory and Related Fields. Springer, 2016. https://doi.org/10.1007/s00440-014-0610-8. ieee: J. Lee and K. Schnelli, “Extremal eigenvalues and eigenvectors of deformed Wigner matrices,” Probability Theory and Related Fields, vol. 164, no. 1–2. Springer, pp. 165–241, 2016. ista: Lee J, Schnelli K. 2016. Extremal eigenvalues and eigenvectors of deformed Wigner matrices. Probability Theory and Related Fields. 164(1–2), 165–241. mla: Lee, Jioon, and Kevin Schnelli. “Extremal Eigenvalues and Eigenvectors of Deformed Wigner Matrices.” Probability Theory and Related Fields, vol. 164, no. 1–2, Springer, 2016, pp. 165–241, doi:10.1007/s00440-014-0610-8. short: J. Lee, K. Schnelli, Probability Theory and Related Fields 164 (2016) 165–241. date_created: 2018-12-11T11:54:31Z date_published: 2016-02-01T00:00:00Z date_updated: 2021-01-12T06:53:49Z day: '01' department: - _id: LaEr doi: 10.1007/s00440-014-0610-8 ec_funded: 1 intvolume: ' 164' issue: 1-2 language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1310.7057 month: '02' oa: 1 oa_version: Preprint page: 165 - 241 project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication: Probability Theory and Related Fields publication_status: published publisher: Springer publist_id: '5215' quality_controlled: '1' scopus_import: 1 status: public title: Extremal eigenvalues and eigenvectors of deformed Wigner matrices type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 164 year: '2016' ... --- _id: '6732' abstract: - lang: eng text: Consider the transmission of a polar code of block length N and rate R over a binary memoryless symmetric channel W and let P e be the block error probability under successive cancellation decoding. In this paper, we develop new bounds that characterize the relationship of the parameters R, N, P e , and the quality of the channel W quantified by its capacity I(W) and its Bhattacharyya parameter Z(W). In previous work, two main regimes were studied. In the error exponent regime, the channel W and the rate R <; I(W) are fixed, and it was proved that the error probability Pe scales roughly as 2 -√N . In the scaling exponent approach, the channel W and the error probability Pe are fixed and it was proved that the gap to capacity I(W) - R scales as N -1/μ . Here, μ is called scaling exponent and this scaling exponent depends on the channel W. A heuristic computation for the binary erasure channel (BEC) gives μ = 3.627 and it was shown that, for any channel W, 3.579 ≤ μ ≤ 5.702. Our contributions are as follows. First, we provide the tighter upper bound μ <;≤ 4.714 valid for any W. With the same technique, we obtain the upper bound μ ≤ 3.639 for the case of the BEC; this upper bound approaches very closely the heuristically derived value for the scaling exponent of the erasure channel. Second, we develop a trade-off between the gap to capacity I(W)- R and the error probability Pe as the functions of the block length N. In other words, we neither fix the gap to capacity (error exponent regime) nor the error probability (scaling exponent regime), but we do consider a moderate deviations regime in which we study how fast both quantities, as the functions of the block length N, simultaneously go to 0. Third, we prove that polar codes are not affected by error floors. To do so, we fix a polar code of block length N and rate R. Then, we vary the channel W and study the impact of this variation on the error probability. We show that the error probability Pe scales as the Bhattacharyya parameter Z(W) raised to a power that scales roughly like VN. This agrees with the scaling in the error exponent regime. article_type: original arxiv: 1 author: - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: S. Hamed full_name: Hassani, S. Hamed last_name: Hassani - first_name: Rudiger L. full_name: Urbanke, Rudiger L. last_name: Urbanke citation: ama: 'Mondelli M, Hassani SH, Urbanke RL. Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors. IEEE Transactions on Information Theory. 2016;62(12):6698-6712. doi:10.1109/tit.2016.2616117' apa: 'Mondelli, M., Hassani, S. H., & Urbanke, R. L. (2016). Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors. IEEE Transactions on Information Theory. IEEE. https://doi.org/10.1109/tit.2016.2616117' chicago: 'Mondelli, Marco, S. Hamed Hassani, and Rudiger L. Urbanke. “Unified Scaling of Polar Codes: Error Exponent, Scaling Exponent, Moderate Deviations, and Error Floors.” IEEE Transactions on Information Theory. IEEE, 2016. https://doi.org/10.1109/tit.2016.2616117.' ieee: 'M. Mondelli, S. H. Hassani, and R. L. Urbanke, “Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors,” IEEE Transactions on Information Theory, vol. 62, no. 12. IEEE, pp. 6698–6712, 2016.' ista: 'Mondelli M, Hassani SH, Urbanke RL. 2016. Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors. IEEE Transactions on Information Theory. 62(12), 6698–6712.' mla: 'Mondelli, Marco, et al. “Unified Scaling of Polar Codes: Error Exponent, Scaling Exponent, Moderate Deviations, and Error Floors.” IEEE Transactions on Information Theory, vol. 62, no. 12, IEEE, 2016, pp. 6698–712, doi:10.1109/tit.2016.2616117.' short: M. Mondelli, S.H. Hassani, R.L. Urbanke, IEEE Transactions on Information Theory 62 (2016) 6698–6712. date_created: 2019-07-31T06:03:49Z date_published: 2016-12-01T00:00:00Z date_updated: 2021-01-12T08:08:44Z day: '01' doi: 10.1109/tit.2016.2616117 extern: '1' external_id: arxiv: - '1501.02444' intvolume: ' 62' issue: '12' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1501.02444 month: '12' oa: 1 oa_version: Preprint page: 6698-6712 publication: IEEE Transactions on Information Theory publication_identifier: eissn: - 1557-9654 issn: - 0018-9448 publication_status: published publisher: IEEE quality_controlled: '1' status: public title: 'Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 62 year: '2016' ... --- _id: '6733' abstract: - lang: eng text: 'The question whether RM codes are capacity-achieving is a long-standing open problem in coding theory that was recently answered in the affirmative for transmission over erasure channels [1], [2]. Remarkably, the proof does not rely on specific properties of RM codes, apart from their symmetry. Indeed, the main technical result consists in showing that any sequence of linear codes, with doubly-transitive permutation groups, achieves capacity on the memoryless erasure channel under bit-MAP decoding. Thus, a natural question is what happens under block-MAP decoding. In [1], [2], by exploiting further symmetries of the code, the bit-MAP threshold was shown to be sharp enough so that the block erasure probability also converges to 0. However, this technique relies heavily on the fact that the transmission is over an erasure channel. We present an alternative approach to strengthen results regarding the bit-MAP threshold to block-MAP thresholds. This approach is based on a careful analysis of the weight distribution of RM codes. In particular, the flavor of the main result is the following: assume that the bit-MAP error probability decays as N -δ , for some δ > 0. Then, the block-MAP error probability also converges to 0. This technique applies to transmission over any binary memoryless symmetric channel. Thus, it can be thought of as a first step in extending the proof that RM codes are capacity-achieving to the general case.' arxiv: 1 author: - first_name: Shrinivas full_name: Kudekar, Shrinivas last_name: Kudekar - first_name: Santhosh full_name: Kumar, Santhosh last_name: Kumar - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: Henry D. full_name: Pfister, Henry D. last_name: Pfister - first_name: Rudiger full_name: Urbankez, Rudiger last_name: Urbankez citation: ama: 'Kudekar S, Kumar S, Mondelli M, Pfister HD, Urbankez R. Comparing the bit-MAP and block-MAP decoding thresholds of Reed-Muller codes on BMS channels. In: 2016 IEEE International Symposium on Information Theory . IEEE; 2016:1755-1759. doi:10.1109/isit.2016.7541600' apa: 'Kudekar, S., Kumar, S., Mondelli, M., Pfister, H. D., & Urbankez, R. (2016). Comparing the bit-MAP and block-MAP decoding thresholds of Reed-Muller codes on BMS channels. In 2016 IEEE International Symposium on Information Theory (pp. 1755–1759). Barcelona, Spain: IEEE. https://doi.org/10.1109/isit.2016.7541600' chicago: Kudekar, Shrinivas, Santhosh Kumar, Marco Mondelli, Henry D. Pfister, and Rudiger Urbankez. “Comparing the Bit-MAP and Block-MAP Decoding Thresholds of Reed-Muller Codes on BMS Channels.” In 2016 IEEE International Symposium on Information Theory , 1755–59. IEEE, 2016. https://doi.org/10.1109/isit.2016.7541600. ieee: S. Kudekar, S. Kumar, M. Mondelli, H. D. Pfister, and R. Urbankez, “Comparing the bit-MAP and block-MAP decoding thresholds of Reed-Muller codes on BMS channels,” in 2016 IEEE International Symposium on Information Theory , Barcelona, Spain, 2016, pp. 1755–1759. ista: 'Kudekar S, Kumar S, Mondelli M, Pfister HD, Urbankez R. 2016. Comparing the bit-MAP and block-MAP decoding thresholds of Reed-Muller codes on BMS channels. 2016 IEEE International Symposium on Information Theory . ISIT: International Symposium on Information Theory, 1755–1759.' mla: Kudekar, Shrinivas, et al. “Comparing the Bit-MAP and Block-MAP Decoding Thresholds of Reed-Muller Codes on BMS Channels.” 2016 IEEE International Symposium on Information Theory , IEEE, 2016, pp. 1755–59, doi:10.1109/isit.2016.7541600. short: S. Kudekar, S. Kumar, M. Mondelli, H.D. Pfister, R. Urbankez, in:, 2016 IEEE International Symposium on Information Theory , IEEE, 2016, pp. 1755–1759. conference: end_date: 2016-07-15 location: Barcelona, Spain name: 'ISIT: International Symposium on Information Theory' start_date: 2016-07-10 date_created: 2019-07-31T06:36:16Z date_published: 2016-08-11T00:00:00Z date_updated: 2021-01-12T08:08:44Z day: '11' doi: 10.1109/isit.2016.7541600 extern: '1' external_id: arxiv: - '1601.06048' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1601.06048 month: '08' oa: 1 oa_version: Preprint page: 1755-1759 publication: '2016 IEEE International Symposium on Information Theory ' publication_status: published publisher: IEEE quality_controlled: '1' status: public title: Comparing the bit-MAP and block-MAP decoding thresholds of Reed-Muller codes on BMS channels type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2016' ... --- _id: '6770' abstract: - lang: eng text: "We describe a new method to compare the bit-MAP and block-MAP decoding thresholds of Reed-Muller (RM) codes for transmission over a binary memoryless symmetric channel. The question whether RM codes are capacity-achieving is a long-standing open problem in coding theory and it has recently been answered in the affirmative for transmission over\r\nerasure channels. Remarkably, the proof does not rely on specific properties of RM codes, apart from their symmetry. Indeed, the main technical result consists in showing that any sequence of linear codes, with doubly-transitive permutation groups, achieves capacity on the memoryless erasure channel under bit-MAP decoding. A natural question is what happens under block-MAP decoding. If the minimum distance of the code family is close to linear (e.g., of order N/ log(N)), then one can combine an upper bound on the bit-MAP error probability with a lower bound on the minimum distance to show that the code family is also capacity-achieving under block-MAP decoding. This strategy is successful for BCH codes. Unfortunately, the minimum distance of RM codes scales only as √N, which does not suffice to obtain the desired result. Then, one can exploit further symmetries of RM codes to show that the bit-MAP threshold is sharp enough so that the block erasure probability also tends to 0. However, this technique relies heavily on the fact that the transmission is over an erasure channel.\r\nWe present an alternative approach to strengthen results regarding the bit-MAP threshold to block-MAP thresholds. This approach is based on a careful analysis of the weight distribution of RM codes. In particular, the flavor of the main result is the following: assume that the bit-MAP error probability decays as N−δ, for some δ > 0. Then, the block-MAP\r\nerror probability also converges to 0. This technique applies to the transmission over any binary memoryless symmetric channel. Thus, it can be thought of as a first step in extending the proof that RM codes are capacity-achieving to the general case." author: - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: Shrinivas full_name: Kudekar, Shrinivas last_name: Kudekar - first_name: Santosh full_name: Kumar, Santosh last_name: Kumar - first_name: Henry D. full_name: Pfister, Henry D. last_name: Pfister - first_name: Eren full_name: Şaşoğlu, Eren last_name: Şaşoğlu - first_name: Rüdiger full_name: Urbanke, Rüdiger last_name: Urbanke citation: ama: 'Mondelli M, Kudekar S, Kumar S, Pfister HD, Şaşoğlu E, Urbanke R. Reed-Muller codes: Thresholds and weight distribution. In: 24th International Zurich Seminar on Communications. ETH Zürich; 2016:50. doi:10.3929/ETHZ-A-010646484' apa: 'Mondelli, M., Kudekar, S., Kumar, S., Pfister, H. D., Şaşoğlu, E., & Urbanke, R. (2016). Reed-Muller codes: Thresholds and weight distribution. In 24th International Zurich Seminar on Communications (p. 50). Zurich, Switzerland: ETH Zürich. https://doi.org/10.3929/ETHZ-A-010646484' chicago: 'Mondelli, Marco, Shrinivas Kudekar, Santosh Kumar, Henry D. Pfister, Eren Şaşoğlu, and Rüdiger Urbanke. “Reed-Muller Codes: Thresholds and Weight Distribution.” In 24th International Zurich Seminar on Communications, 50. ETH Zürich, 2016. https://doi.org/10.3929/ETHZ-A-010646484.' ieee: 'M. Mondelli, S. Kudekar, S. Kumar, H. D. Pfister, E. Şaşoğlu, and R. Urbanke, “Reed-Muller codes: Thresholds and weight distribution,” in 24th International Zurich Seminar on Communications, Zurich, Switzerland, 2016, p. 50.' ista: 'Mondelli M, Kudekar S, Kumar S, Pfister HD, Şaşoğlu E, Urbanke R. 2016. Reed-Muller codes: Thresholds and weight distribution. 24th International Zurich Seminar on Communications. IZS: International Zurich Seminar on Communications, 50.' mla: 'Mondelli, Marco, et al. “Reed-Muller Codes: Thresholds and Weight Distribution.” 24th International Zurich Seminar on Communications, ETH Zürich, 2016, p. 50, doi:10.3929/ETHZ-A-010646484.' short: M. Mondelli, S. Kudekar, S. Kumar, H.D. Pfister, E. Şaşoğlu, R. Urbanke, in:, 24th International Zurich Seminar on Communications, ETH Zürich, 2016, p. 50. conference: end_date: 2016-03-04 location: Zurich, Switzerland name: 'IZS: International Zurich Seminar on Communications' start_date: 2016-03-02 date_created: 2019-08-05T12:43:48Z date_published: 2016-03-01T00:00:00Z date_updated: 2021-01-12T08:08:57Z day: '01' doi: 10.3929/ETHZ-A-010646484 extern: '1' language: - iso: eng month: '03' oa_version: None page: '50' publication: 24th International Zurich Seminar on Communications publication_status: published publisher: ETH Zürich quality_controlled: '1' status: public title: 'Reed-Muller codes: Thresholds and weight distribution' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2016' ... --- _id: '7068' abstract: - lang: eng text: Electrons in materials with linear dispersion behave as massless Weyl- or Dirac-quasiparticles, and continue to intrigue due to their close resemblance to elusive ultra-relativistic particles as well as their potential for future electronics. Yet the experimental signatures of Weyl-fermions are often subtle and indirect, in particular if they coexist with conventional, massive quasiparticles. Here we show a pronounced anomaly in the magnetic torque of the Weyl semimetal NbAs upon entering the quantum limit state in high magnetic fields. The torque changes sign in the quantum limit, signalling a reversal of the magnetic anisotropy that can be directly attributed to the topological nature of the Weyl electrons. Our results establish that anomalous quantum limit torque measurements provide a direct experimental method to identify and distinguish Weyl and Dirac systems. article_number: '12492' article_processing_charge: No article_type: original author: - first_name: Philip J. W. full_name: Moll, Philip J. W. last_name: Moll - first_name: Andrew C. full_name: Potter, Andrew C. last_name: Potter - first_name: Nityan L. full_name: Nair, Nityan L. last_name: Nair - first_name: B. J. full_name: Ramshaw, B. J. last_name: Ramshaw - first_name: Kimberly A full_name: Modic, Kimberly A id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425 last_name: Modic orcid: 0000-0001-9760-3147 - first_name: Scott full_name: Riggs, Scott last_name: Riggs - first_name: Bin full_name: Zeng, Bin last_name: Zeng - first_name: Nirmal J. full_name: Ghimire, Nirmal J. last_name: Ghimire - first_name: Eric D. full_name: Bauer, Eric D. last_name: Bauer - first_name: Robert full_name: Kealhofer, Robert last_name: Kealhofer - first_name: Filip full_name: Ronning, Filip last_name: Ronning - first_name: James G. full_name: Analytis, James G. last_name: Analytis citation: ama: Moll PJW, Potter AC, Nair NL, et al. Magnetic torque anomaly in the quantum limit of Weyl semimetals. Nature Communications. 2016;7. doi:10.1038/ncomms12492 apa: Moll, P. J. W., Potter, A. C., Nair, N. L., Ramshaw, B. J., Modic, K. A., Riggs, S., … Analytis, J. G. (2016). Magnetic torque anomaly in the quantum limit of Weyl semimetals. Nature Communications. Springer Nature. https://doi.org/10.1038/ncomms12492 chicago: Moll, Philip J. W., Andrew C. Potter, Nityan L. Nair, B. J. Ramshaw, Kimberly A Modic, Scott Riggs, Bin Zeng, et al. “Magnetic Torque Anomaly in the Quantum Limit of Weyl Semimetals.” Nature Communications. Springer Nature, 2016. https://doi.org/10.1038/ncomms12492. ieee: P. J. W. Moll et al., “Magnetic torque anomaly in the quantum limit of Weyl semimetals,” Nature Communications, vol. 7. Springer Nature, 2016. ista: Moll PJW, Potter AC, Nair NL, Ramshaw BJ, Modic KA, Riggs S, Zeng B, Ghimire NJ, Bauer ED, Kealhofer R, Ronning F, Analytis JG. 2016. Magnetic torque anomaly in the quantum limit of Weyl semimetals. Nature Communications. 7, 12492. mla: Moll, Philip J. W., et al. “Magnetic Torque Anomaly in the Quantum Limit of Weyl Semimetals.” Nature Communications, vol. 7, 12492, Springer Nature, 2016, doi:10.1038/ncomms12492. short: P.J.W. Moll, A.C. Potter, N.L. Nair, B.J. Ramshaw, K.A. Modic, S. Riggs, B. Zeng, N.J. Ghimire, E.D. Bauer, R. Kealhofer, F. Ronning, J.G. Analytis, Nature Communications 7 (2016). date_created: 2019-11-19T13:20:53Z date_published: 2016-08-22T00:00:00Z date_updated: 2021-01-12T08:11:40Z day: '22' ddc: - '530' doi: 10.1038/ncomms12492 extern: '1' file: - access_level: open_access checksum: e3272ed18d22187406b30be48a56e7b2 content_type: application/pdf creator: dernst date_created: 2019-11-26T12:52:19Z date_updated: 2020-07-14T12:47:48Z file_id: '7114' file_name: 2016_NatureComm_Moll.pdf file_size: 663911 relation: main_file file_date_updated: 2020-07-14T12:47:48Z has_accepted_license: '1' intvolume: ' 7' language: - iso: eng month: '08' oa: 1 oa_version: Published Version publication: Nature Communications publication_identifier: issn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Magnetic torque anomaly in the quantum limit of Weyl semimetals tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7 year: '2016' ... --- _id: '7069' abstract: - lang: eng text: The observation of a reconstructed Fermi surface via quantum oscillations in hole-doped cuprates opened a path towards identifying broken symmetry states in the pseudogap regime. However, such an identification has remained inconclusive due to the multi-frequency quantum oscillation spectra and complications accounting for bilayer effects in most studies. We overcome these impediments with high-resolution measurements on the structurally simpler cuprate HgBa2CuO4+δ (Hg1201), which features one CuO2 plane per primitive unit cell. We find only a single oscillatory component with no signatures of magnetic breakdown tunnelling to additional orbits. Therefore, the Fermi surface comprises a single quasi-two-dimensional pocket. Quantitative modelling of these results indicates that a biaxial charge density wave within each CuO2 plane is responsible for the reconstruction and rules out criss-crossed charge stripes between layers as a viable alternative in Hg1201. Lastly, we determine that the characteristic gap between reconstructed pockets is a significant fraction of the pseudogap energy. article_number: '12244' article_processing_charge: No article_type: original author: - first_name: M. K. full_name: Chan, M. K. last_name: Chan - first_name: N. full_name: Harrison, N. last_name: Harrison - first_name: R. D. full_name: McDonald, R. D. last_name: McDonald - first_name: B. J. full_name: Ramshaw, B. J. last_name: Ramshaw - first_name: Kimberly A full_name: Modic, Kimberly A id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425 last_name: Modic orcid: 0000-0001-9760-3147 - first_name: N. full_name: Barišić, N. last_name: Barišić - first_name: M. full_name: Greven, M. last_name: Greven citation: ama: Chan MK, Harrison N, McDonald RD, et al. Single reconstructed Fermi surface pocket in an underdoped single-layer cuprate superconductor. Nature Communications. 2016;7. doi:10.1038/ncomms12244 apa: Chan, M. K., Harrison, N., McDonald, R. D., Ramshaw, B. J., Modic, K. A., Barišić, N., & Greven, M. (2016). Single reconstructed Fermi surface pocket in an underdoped single-layer cuprate superconductor. Nature Communications. Springer Nature. https://doi.org/10.1038/ncomms12244 chicago: Chan, M. K., N. Harrison, R. D. McDonald, B. J. Ramshaw, Kimberly A Modic, N. Barišić, and M. Greven. “Single Reconstructed Fermi Surface Pocket in an Underdoped Single-Layer Cuprate Superconductor.” Nature Communications. Springer Nature, 2016. https://doi.org/10.1038/ncomms12244. ieee: M. K. Chan et al., “Single reconstructed Fermi surface pocket in an underdoped single-layer cuprate superconductor,” Nature Communications, vol. 7. Springer Nature, 2016. ista: Chan MK, Harrison N, McDonald RD, Ramshaw BJ, Modic KA, Barišić N, Greven M. 2016. Single reconstructed Fermi surface pocket in an underdoped single-layer cuprate superconductor. Nature Communications. 7, 12244. mla: Chan, M. K., et al. “Single Reconstructed Fermi Surface Pocket in an Underdoped Single-Layer Cuprate Superconductor.” Nature Communications, vol. 7, 12244, Springer Nature, 2016, doi:10.1038/ncomms12244. short: M.K. Chan, N. Harrison, R.D. McDonald, B.J. Ramshaw, K.A. Modic, N. Barišić, M. Greven, Nature Communications 7 (2016). date_created: 2019-11-19T13:21:23Z date_published: 2016-07-22T00:00:00Z date_updated: 2021-01-12T08:11:41Z day: '22' doi: 10.1038/ncomms12244 extern: '1' intvolume: ' 7' language: - iso: eng month: '07' oa_version: Published Version publication: Nature Communications publication_identifier: issn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Single reconstructed Fermi surface pocket in an underdoped single-layer cuprate superconductor type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7 year: '2016' ...