--- _id: '58' abstract: - lang: eng text: 'Inside a two-dimensional region (``cake""), there are m nonoverlapping tiles of a certain kind (``toppings""). We want to expand the toppings while keeping them nonoverlapping, and possibly add some blank pieces of the same ``certain kind,"" such that the entire cake is covered. How many blanks must we add? We study this question in several cases: (1) The cake and toppings are general polygons. (2) The cake and toppings are convex figures. (3) The cake and toppings are axis-parallel rectangles. (4) The cake is an axis-parallel rectilinear polygon and the toppings are axis-parallel rectangles. In all four cases, we provide tight bounds on the number of blanks.' article_processing_charge: No arxiv: 1 author: - first_name: Arseniy full_name: Akopyan, Arseniy id: 430D2C90-F248-11E8-B48F-1D18A9856A87 last_name: Akopyan orcid: 0000-0002-2548-617X - first_name: Erel full_name: Segal Halevi, Erel last_name: Segal Halevi citation: ama: Akopyan A, Segal Halevi E. Counting blanks in polygonal arrangements. SIAM Journal on Discrete Mathematics. 2018;32(3):2242-2257. doi:10.1137/16M110407X apa: Akopyan, A., & Segal Halevi, E. (2018). Counting blanks in polygonal arrangements. SIAM Journal on Discrete Mathematics. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/16M110407X chicago: Akopyan, Arseniy, and Erel Segal Halevi. “Counting Blanks in Polygonal Arrangements.” SIAM Journal on Discrete Mathematics. Society for Industrial and Applied Mathematics , 2018. https://doi.org/10.1137/16M110407X. ieee: A. Akopyan and E. Segal Halevi, “Counting blanks in polygonal arrangements,” SIAM Journal on Discrete Mathematics, vol. 32, no. 3. Society for Industrial and Applied Mathematics , pp. 2242–2257, 2018. ista: Akopyan A, Segal Halevi E. 2018. Counting blanks in polygonal arrangements. SIAM Journal on Discrete Mathematics. 32(3), 2242–2257. mla: Akopyan, Arseniy, and Erel Segal Halevi. “Counting Blanks in Polygonal Arrangements.” SIAM Journal on Discrete Mathematics, vol. 32, no. 3, Society for Industrial and Applied Mathematics , 2018, pp. 2242–57, doi:10.1137/16M110407X. short: A. Akopyan, E. Segal Halevi, SIAM Journal on Discrete Mathematics 32 (2018) 2242–2257. date_created: 2018-12-11T11:44:24Z date_published: 2018-09-06T00:00:00Z date_updated: 2023-09-11T12:48:39Z day: '06' department: - _id: HeEd doi: 10.1137/16M110407X ec_funded: 1 external_id: arxiv: - '1604.00960' isi: - '000450810500036' intvolume: ' 32' isi: 1 issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1604.00960 month: '09' oa: 1 oa_version: Preprint page: 2242 - 2257 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: SIAM Journal on Discrete Mathematics publication_status: published publisher: 'Society for Industrial and Applied Mathematics ' publist_id: '7996' quality_controlled: '1' scopus_import: '1' status: public title: Counting blanks in polygonal arrangements type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 32 year: '2018' ... --- _id: '5816' abstract: - lang: eng text: Solid-state qubit manipulation and read-out fidelities are reaching fault-tolerance, but quantum error correction requires millions of physical qubits and therefore a scalable quantum computer architecture. To solve signal-line bandwidth and fan-out problems, microwave sources required for qubit manipulation might be embedded close to the qubit chip, typically operating at temperatures below 4 K. Here, we perform the first low temperature measurements of a 130 nm BiCMOS based SiGe voltage controlled oscillator at cryogenic temperature. We determined the frequency and output power dependence on temperature and magnetic field up to 5 T and measured the temperature influence on its noise performance. The device maintains its full functionality from 300 K to 4 K. The carrier frequency at 4 K increases by 3% with respect to the carrier frequency at 300 K, and the output power at 4 K increases by 10 dB relative to the output power at 300 K. The frequency tuning range of approximately 20% remains unchanged between 300 K and 4 K. In an in-plane magnetic field of 5 T, the carrier frequency shifts by only 0.02% compared to the frequency at zero magnetic field. article_number: '114701' article_processing_charge: No arxiv: 1 author: - first_name: Arne full_name: Hollmann, Arne last_name: Hollmann - first_name: Daniel full_name: Jirovec, Daniel id: 4C473F58-F248-11E8-B48F-1D18A9856A87 last_name: Jirovec orcid: 0000-0002-7197-4801 - first_name: Maciej full_name: Kucharski, Maciej last_name: Kucharski - first_name: Dietmar full_name: Kissinger, Dietmar last_name: Kissinger - first_name: Gunter full_name: Fischer, Gunter last_name: Fischer - first_name: Lars R. full_name: Schreiber, Lars R. last_name: Schreiber citation: ama: Hollmann A, Jirovec D, Kucharski M, Kissinger D, Fischer G, Schreiber LR. 30 GHz-voltage controlled oscillator operating at 4 K. Review of Scientific Instruments. 2018;89(11). doi:10.1063/1.5038258 apa: Hollmann, A., Jirovec, D., Kucharski, M., Kissinger, D., Fischer, G., & Schreiber, L. R. (2018). 30 GHz-voltage controlled oscillator operating at 4 K. Review of Scientific Instruments. AIP Publishing. https://doi.org/10.1063/1.5038258 chicago: Hollmann, Arne, Daniel Jirovec, Maciej Kucharski, Dietmar Kissinger, Gunter Fischer, and Lars R. Schreiber. “30 GHz-Voltage Controlled Oscillator Operating at 4 K.” Review of Scientific Instruments. AIP Publishing, 2018. https://doi.org/10.1063/1.5038258. ieee: A. Hollmann, D. Jirovec, M. Kucharski, D. Kissinger, G. Fischer, and L. R. Schreiber, “30 GHz-voltage controlled oscillator operating at 4 K,” Review of Scientific Instruments, vol. 89, no. 11. AIP Publishing, 2018. ista: Hollmann A, Jirovec D, Kucharski M, Kissinger D, Fischer G, Schreiber LR. 2018. 30 GHz-voltage controlled oscillator operating at 4 K. Review of Scientific Instruments. 89(11), 114701. mla: Hollmann, Arne, et al. “30 GHz-Voltage Controlled Oscillator Operating at 4 K.” Review of Scientific Instruments, vol. 89, no. 11, 114701, AIP Publishing, 2018, doi:10.1063/1.5038258. short: A. Hollmann, D. Jirovec, M. Kucharski, D. Kissinger, G. Fischer, L.R. Schreiber, Review of Scientific Instruments 89 (2018). date_created: 2019-01-10T14:22:23Z date_published: 2018-11-01T00:00:00Z date_updated: 2024-03-25T23:30:14Z day: '01' department: - _id: GeKa doi: 10.1063/1.5038258 external_id: arxiv: - '1804.09522' isi: - '000451735700054' intvolume: ' 89' isi: 1 issue: '11' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1804.09522 month: '11' oa: 1 oa_version: Preprint publication: Review of Scientific Instruments publication_identifier: issn: - '00346748' publication_status: published publisher: AIP Publishing quality_controlled: '1' related_material: record: - id: '10058' relation: dissertation_contains status: public scopus_import: '1' status: public title: 30 GHz-voltage controlled oscillator operating at 4 K type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 89 year: '2018' ... --- _id: '5830' abstract: - lang: eng text: CLE peptides have been implicated in various developmental processes of plants and mediate their responses to environmental stimuli. However, the biological relevance of most CLE genes remains to be functionally characterized. Here, we report that CLE9, which is expressed in stomata, acts as an essential regulator in the induction of stomatal closure. Exogenous application of CLE9 peptides or overexpression of CLE9 effectively led to stomatal closure and enhanced drought tolerance, whereas CLE9 loss-of-function mutants were sensitivity to drought stress. CLE9-induced stomatal closure was impaired in abscisic acid (ABA)-deficient mutants, indicating that ABA is required for CLE9-medaited guard cell signalling. We further deciphered that two guard cell ABA-signalling components, OST1 and SLAC1, were responsible for CLE9-induced stomatal closure. MPK3 and MPK6 were activated by the CLE9 peptide, and CLE9 peptides failed to close stomata in mpk3 and mpk6 mutants. In addition, CLE9 peptides stimulated the induction of hydrogen peroxide (H2O2) and nitric oxide (NO) synthesis associated with stomatal closure, which was abolished in the NADPH oxidase-deficient mutants or nitric reductase mutants, respectively. Collectively, our results reveal a novel ABA-dependent function of CLE9 in the regulation of stomatal apertures, thereby suggesting a potential role of CLE9 in the stress acclimatization of plants. article_processing_charge: No author: - first_name: Luosha full_name: Zhang, Luosha last_name: Zhang - first_name: Xiong full_name: Shi, Xiong last_name: Shi - first_name: Yutao full_name: Zhang, Yutao last_name: Zhang - first_name: Jiajing full_name: Wang, Jiajing last_name: Wang - first_name: Jingwei full_name: Yang, Jingwei last_name: Yang - first_name: Takashi full_name: Ishida, Takashi last_name: Ishida - first_name: Wenqian full_name: Jiang, Wenqian last_name: Jiang - first_name: Xiangyu full_name: Han, Xiangyu last_name: Han - first_name: Jingke full_name: Kang, Jingke last_name: Kang - first_name: Xuening full_name: Wang, Xuening last_name: Wang - first_name: Lixia full_name: Pan, Lixia last_name: Pan - first_name: Shuo full_name: Lv, Shuo last_name: Lv - first_name: Bing full_name: Cao, Bing last_name: Cao - first_name: Yonghong full_name: Zhang, Yonghong last_name: Zhang - first_name: Jinbin full_name: Wu, Jinbin last_name: Wu - first_name: Huibin full_name: Han, Huibin id: 31435098-F248-11E8-B48F-1D18A9856A87 last_name: Han - first_name: Zhubing full_name: Hu, Zhubing last_name: Hu - first_name: Langjun full_name: Cui, Langjun last_name: Cui - first_name: Shinichiro full_name: Sawa, Shinichiro last_name: Sawa - first_name: Junmin full_name: He, Junmin last_name: He - first_name: Guodong full_name: Wang, Guodong last_name: Wang citation: ama: Zhang L, Shi X, Zhang Y, et al. CLE9 peptide-induced stomatal closure is mediated by abscisic acid, hydrogen peroxide, and nitric oxide in arabidopsis thaliana. Plant Cell and Environment. 2018. doi:10.1111/pce.13475 apa: Zhang, L., Shi, X., Zhang, Y., Wang, J., Yang, J., Ishida, T., … Wang, G. (2018). CLE9 peptide-induced stomatal closure is mediated by abscisic acid, hydrogen peroxide, and nitric oxide in arabidopsis thaliana. Plant Cell and Environment. Wiley. https://doi.org/10.1111/pce.13475 chicago: Zhang, Luosha, Xiong Shi, Yutao Zhang, Jiajing Wang, Jingwei Yang, Takashi Ishida, Wenqian Jiang, et al. “CLE9 Peptide-Induced Stomatal Closure Is Mediated by Abscisic Acid, Hydrogen Peroxide, and Nitric Oxide in Arabidopsis Thaliana.” Plant Cell and Environment. Wiley, 2018. https://doi.org/10.1111/pce.13475. ieee: L. Zhang et al., “CLE9 peptide-induced stomatal closure is mediated by abscisic acid, hydrogen peroxide, and nitric oxide in arabidopsis thaliana,” Plant Cell and Environment. Wiley, 2018. ista: Zhang L, Shi X, Zhang Y, Wang J, Yang J, Ishida T, Jiang W, Han X, Kang J, Wang X, Pan L, Lv S, Cao B, Zhang Y, Wu J, Han H, Hu Z, Cui L, Sawa S, He J, Wang G. 2018. CLE9 peptide-induced stomatal closure is mediated by abscisic acid, hydrogen peroxide, and nitric oxide in arabidopsis thaliana. Plant Cell and Environment. mla: Zhang, Luosha, et al. “CLE9 Peptide-Induced Stomatal Closure Is Mediated by Abscisic Acid, Hydrogen Peroxide, and Nitric Oxide in Arabidopsis Thaliana.” Plant Cell and Environment, Wiley, 2018, doi:10.1111/pce.13475. short: L. Zhang, X. Shi, Y. Zhang, J. Wang, J. Yang, T. Ishida, W. Jiang, X. Han, J. Kang, X. Wang, L. Pan, S. Lv, B. Cao, Y. Zhang, J. Wu, H. Han, Z. Hu, L. Cui, S. Sawa, J. He, G. Wang, Plant Cell and Environment (2018). date_created: 2019-01-13T22:59:11Z date_published: 2018-10-31T00:00:00Z date_updated: 2023-09-11T12:43:31Z day: '31' department: - _id: JiFr doi: 10.1111/pce.13475 external_id: isi: - '000459014800021' pmid: - '30378140' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://www.ncbi.nlm.nih.gov/pubmed/30378140 month: '10' oa: 1 oa_version: Published Version pmid: 1 publication: Plant Cell and Environment publication_identifier: issn: - '01407791' publication_status: epub_ahead publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: CLE9 peptide-induced stomatal closure is mediated by abscisic acid, hydrogen peroxide, and nitric oxide in arabidopsis thaliana type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2018' ... --- _id: '5858' abstract: - lang: eng text: Spatial patterns are ubiquitous on the subcellular, cellular and tissue level, and can be studied using imaging techniques such as light and fluorescence microscopy. Imaging data provide quantitative information about biological systems; however, mechanisms causing spatial patterning often remain elusive. In recent years, spatio-temporal mathematical modelling has helped to overcome this problem. Yet, outliers and structured noise limit modelling of whole imaging data, and models often consider spatial summary statistics. Here, we introduce an integrated data-driven modelling approach that can cope with measurement artefacts and whole imaging data. Our approach combines mechanistic models of the biological processes with robust statistical models of the measurement process. The parameters of the integrated model are calibrated using a maximum-likelihood approach. We used this integrated modelling approach to study in vivo gradients of the chemokine (C-C motif) ligand 21 (CCL21). CCL21 gradients guide dendritic cells and are important in the adaptive immune response. Using artificial data, we verified that the integrated modelling approach provides reliable parameter estimates in the presence of measurement noise and that bias and variance of these estimates are reduced compared to conventional approaches. The application to experimental data allowed the parametrization and subsequent refinement of the model using additional mechanisms. Among other results, model-based hypothesis testing predicted lymphatic vessel-dependent concentration of heparan sulfate, the binding partner of CCL21. The selected model provided an accurate description of the experimental data and was partially validated using published data. Our findings demonstrate that integrated statistical modelling of whole imaging data is computationally feasible and can provide novel biological insights. article_number: '20180600' article_processing_charge: No author: - first_name: Sabrina full_name: Hross, Sabrina last_name: Hross - first_name: Fabian J. full_name: Theis, Fabian J. last_name: Theis - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 - first_name: Jan full_name: Hasenauer, Jan last_name: Hasenauer citation: ama: Hross S, Theis FJ, Sixt MK, Hasenauer J. Mechanistic description of spatial processes using integrative modelling of noise-corrupted imaging data. Journal of the Royal Society Interface. 2018;15(149). doi:10.1098/rsif.2018.0600 apa: Hross, S., Theis, F. J., Sixt, M. K., & Hasenauer, J. (2018). Mechanistic description of spatial processes using integrative modelling of noise-corrupted imaging data. Journal of the Royal Society Interface. Royal Society Publishing. https://doi.org/10.1098/rsif.2018.0600 chicago: Hross, Sabrina, Fabian J. Theis, Michael K Sixt, and Jan Hasenauer. “Mechanistic Description of Spatial Processes Using Integrative Modelling of Noise-Corrupted Imaging Data.” Journal of the Royal Society Interface. Royal Society Publishing, 2018. https://doi.org/10.1098/rsif.2018.0600. ieee: S. Hross, F. J. Theis, M. K. Sixt, and J. Hasenauer, “Mechanistic description of spatial processes using integrative modelling of noise-corrupted imaging data,” Journal of the Royal Society Interface, vol. 15, no. 149. Royal Society Publishing, 2018. ista: Hross S, Theis FJ, Sixt MK, Hasenauer J. 2018. Mechanistic description of spatial processes using integrative modelling of noise-corrupted imaging data. Journal of the Royal Society Interface. 15(149), 20180600. mla: Hross, Sabrina, et al. “Mechanistic Description of Spatial Processes Using Integrative Modelling of Noise-Corrupted Imaging Data.” Journal of the Royal Society Interface, vol. 15, no. 149, 20180600, Royal Society Publishing, 2018, doi:10.1098/rsif.2018.0600. short: S. Hross, F.J. Theis, M.K. Sixt, J. Hasenauer, Journal of the Royal Society Interface 15 (2018). date_created: 2019-01-20T22:59:18Z date_published: 2018-12-05T00:00:00Z date_updated: 2023-09-13T08:55:05Z day: '05' ddc: - '570' department: - _id: MiSi doi: 10.1098/rsif.2018.0600 external_id: isi: - '000456783800011' file: - access_level: open_access checksum: 56eb4308a15b7190bff938fab1f780e8 content_type: application/pdf creator: dernst date_created: 2019-02-05T14:46:44Z date_updated: 2020-07-14T12:47:13Z file_id: '5925' file_name: 2018_Interface_Hross.pdf file_size: 1464288 relation: main_file file_date_updated: 2020-07-14T12:47:13Z has_accepted_license: '1' intvolume: ' 15' isi: 1 issue: '149' language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '12' oa: 1 oa_version: Published Version publication: Journal of the Royal Society Interface publication_identifier: issn: - '17425689' publication_status: published publisher: Royal Society Publishing quality_controlled: '1' scopus_import: '1' status: public title: Mechanistic description of spatial processes using integrative modelling of noise-corrupted imaging data 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: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 15 year: '2018' ... --- _id: '5859' abstract: - lang: eng text: The emergence of syntax during childhood is a remarkable example of how complex correlations unfold in nonlinear ways through development. In particular, rapid transitions seem to occur as children reach the age of two, which seems to separate a two-word, tree-like network of syntactic relations among words from the scale-free graphs associated with the adult, complex grammar. Here, we explore the evolution of syntax networks through language acquisition using the chromatic number, which captures the transition and provides a natural link to standard theories on syntactic structures. The data analysis is compared to a null model of network growth dynamics which is shown to display non-trivial and sensible differences. At a more general level, we observe that the chromatic classes define independent regions of the graph, and thus, can be interpreted as the footprints of incompatibility relations, somewhat as opposed to modularity considerations. acknowledgement: This work was supported by the James McDonnell Foundation (B.C-M., S.V. and R.S.) article_number: '181286' article_processing_charge: No article_type: original author: - first_name: Bernat full_name: Corominas-Murtra, Bernat id: 43BE2298-F248-11E8-B48F-1D18A9856A87 last_name: Corominas-Murtra orcid: 0000-0001-9806-5643 - first_name: Martí Sànchez full_name: Fibla, Martí Sànchez last_name: Fibla - first_name: Sergi full_name: Valverde, Sergi last_name: Valverde - first_name: Ricard full_name: Solé, Ricard last_name: Solé citation: ama: Corominas-Murtra B, Fibla MS, Valverde S, Solé R. Chromatic transitions in the emergence of syntax networks. Royal Society Open Science. 2018;5(12). doi:10.1098/rsos.181286 apa: Corominas-Murtra, B., Fibla, M. S., Valverde, S., & Solé, R. (2018). Chromatic transitions in the emergence of syntax networks. Royal Society Open Science. The Royal Society. https://doi.org/10.1098/rsos.181286 chicago: Corominas-Murtra, Bernat, Martí Sànchez Fibla, Sergi Valverde, and Ricard Solé. “Chromatic Transitions in the Emergence of Syntax Networks.” Royal Society Open Science. The Royal Society, 2018. https://doi.org/10.1098/rsos.181286. ieee: B. Corominas-Murtra, M. S. Fibla, S. Valverde, and R. Solé, “Chromatic transitions in the emergence of syntax networks,” Royal Society Open Science, vol. 5, no. 12. The Royal Society, 2018. ista: Corominas-Murtra B, Fibla MS, Valverde S, Solé R. 2018. Chromatic transitions in the emergence of syntax networks. Royal Society Open Science. 5(12), 181286. mla: Corominas-Murtra, Bernat, et al. “Chromatic Transitions in the Emergence of Syntax Networks.” Royal Society Open Science, vol. 5, no. 12, 181286, The Royal Society, 2018, doi:10.1098/rsos.181286. short: B. Corominas-Murtra, M.S. Fibla, S. Valverde, R. Solé, Royal Society Open Science 5 (2018). date_created: 2019-01-20T22:59:18Z date_published: 2018-12-12T00:00:00Z date_updated: 2023-10-18T06:41:12Z day: '12' ddc: - '570' department: - _id: EdHa doi: 10.1098/rsos.181286 external_id: isi: - '000456566500027' pmid: - '30662738' file: - access_level: open_access checksum: 9664d4417f6b792242e31eea77ce9501 content_type: application/pdf creator: dernst date_created: 2019-02-05T14:38:09Z date_updated: 2020-07-14T12:47:13Z file_id: '5924' file_name: 2018_RoyalSocOS_Corominas.pdf file_size: 646732 relation: main_file file_date_updated: 2020-07-14T12:47:13Z has_accepted_license: '1' intvolume: ' 5' isi: 1 issue: '12' language: - iso: eng month: '12' oa: 1 oa_version: Published Version pmid: 1 publication: Royal Society Open Science publication_identifier: issn: - 2054-5703 publication_status: published publisher: The Royal Society quality_controlled: '1' scopus_import: '1' status: public title: Chromatic transitions in the emergence of syntax networks 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: 5 year: '2018' ... --- _id: '5860' abstract: - lang: eng text: 'A major problem for evolutionary theory is understanding the so-called open-ended nature of evolutionary change, from its definition to its origins. Open-ended evolution (OEE) refers to the unbounded increase in complexity that seems to characterize evolution on multiple scales. This property seems to be a characteristic feature of biological and technological evolution and is strongly tied to the generative potential associated with combinatorics, which allows the system to grow and expand their available state spaces. Interestingly, many complex systems presumably displaying OEE, from language to proteins, share a common statistical property: the presence of Zipf''s Law. Given an inventory of basic items (such as words or protein domains) required to build more complex structures (sentences or proteins) Zipf''s Law tells us that most of these elements are rare whereas a few of them are extremely common. Using algorithmic information theory, in this paper we provide a fundamental definition for open-endedness, which can be understood as postulates. Its statistical counterpart, based on standard Shannon information theory, has the structure of a variational problem which is shown to lead to Zipf''s Law as the expected consequence of an evolutionary process displaying OEE. We further explore the problem of information conservation through an OEE process and we conclude that statistical information (standard Shannon information) is not conserved, resulting in the paradoxical situation in which the increase of information content has the effect of erasing itself. We prove that this paradox is solved if we consider non-statistical forms of information. This last result implies that standard information theory may not be a suitable theoretical framework to explore the persistence and increase of the information content in OEE systems.' article_number: '20180395' article_processing_charge: No arxiv: 1 author: - first_name: Bernat full_name: Corominas-Murtra, Bernat id: 43BE2298-F248-11E8-B48F-1D18A9856A87 last_name: Corominas-Murtra orcid: 0000-0001-9806-5643 - first_name: Luís F. full_name: Seoane, Luís F. last_name: Seoane - first_name: Ricard full_name: Solé, Ricard last_name: Solé citation: ama: Corominas-Murtra B, Seoane LF, Solé R. Zipf’s Law, unbounded complexity and open-ended evolution. Journal of the Royal Society Interface. 2018;15(149). doi:10.1098/rsif.2018.0395 apa: Corominas-Murtra, B., Seoane, L. F., & Solé, R. (2018). Zipf’s Law, unbounded complexity and open-ended evolution. Journal of the Royal Society Interface. Royal Society Publishing. https://doi.org/10.1098/rsif.2018.0395 chicago: Corominas-Murtra, Bernat, Luís F. Seoane, and Ricard Solé. “Zipf’s Law, Unbounded Complexity and Open-Ended Evolution.” Journal of the Royal Society Interface. Royal Society Publishing, 2018. https://doi.org/10.1098/rsif.2018.0395. ieee: B. Corominas-Murtra, L. F. Seoane, and R. Solé, “Zipf’s Law, unbounded complexity and open-ended evolution,” Journal of the Royal Society Interface, vol. 15, no. 149. Royal Society Publishing, 2018. ista: Corominas-Murtra B, Seoane LF, Solé R. 2018. Zipf’s Law, unbounded complexity and open-ended evolution. Journal of the Royal Society Interface. 15(149), 20180395. mla: Corominas-Murtra, Bernat, et al. “Zipf’s Law, Unbounded Complexity and Open-Ended Evolution.” Journal of the Royal Society Interface, vol. 15, no. 149, 20180395, Royal Society Publishing, 2018, doi:10.1098/rsif.2018.0395. short: B. Corominas-Murtra, L.F. Seoane, R. Solé, Journal of the Royal Society Interface 15 (2018). date_created: 2019-01-20T22:59:19Z date_published: 2018-12-12T00:00:00Z date_updated: 2023-09-19T10:40:38Z day: '12' department: - _id: EdHa doi: 10.1098/rsif.2018.0395 external_id: arxiv: - '1612.01605' isi: - '000456783800002' intvolume: ' 15' isi: 1 issue: '149' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1612.01605 month: '12' oa: 1 oa_version: Preprint publication: Journal of the Royal Society Interface publication_identifier: issn: - '17425689' publication_status: published publisher: Royal Society Publishing quality_controlled: '1' scopus_import: '1' status: public title: Zipf's Law, unbounded complexity and open-ended evolution type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 15 year: '2018' ... --- _id: '5861' abstract: - lang: eng text: In zebrafish larvae, it is the cell type that determines how the cell responds to a chemokine signal. article_number: e37888 article_processing_charge: No article_type: original author: - first_name: Jonna H full_name: Alanko, Jonna H id: 2CC12E8C-F248-11E8-B48F-1D18A9856A87 last_name: Alanko orcid: 0000-0002-7698-3061 - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 citation: ama: Alanko JH, Sixt MK. The cell sets the tone. eLife. 2018;7. doi:10.7554/eLife.37888 apa: Alanko, J. H., & Sixt, M. K. (2018). The cell sets the tone. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.37888 chicago: Alanko, Jonna H, and Michael K Sixt. “The Cell Sets the Tone.” ELife. eLife Sciences Publications, 2018. https://doi.org/10.7554/eLife.37888. ieee: J. H. Alanko and M. K. Sixt, “The cell sets the tone,” eLife, vol. 7. eLife Sciences Publications, 2018. ista: Alanko JH, Sixt MK. 2018. The cell sets the tone. eLife. 7, e37888. mla: Alanko, Jonna H., and Michael K. Sixt. “The Cell Sets the Tone.” ELife, vol. 7, e37888, eLife Sciences Publications, 2018, doi:10.7554/eLife.37888. short: J.H. Alanko, M.K. Sixt, ELife 7 (2018). date_created: 2019-01-20T22:59:19Z date_published: 2018-06-06T00:00:00Z date_updated: 2023-09-19T10:01:39Z day: '06' ddc: - '570' department: - _id: MiSi doi: 10.7554/eLife.37888 external_id: isi: - '000434375000001' file: - access_level: open_access checksum: f1c7ec2a809408d763c4b529a98f9a3b content_type: application/pdf creator: dernst date_created: 2019-02-13T10:52:11Z date_updated: 2020-07-14T12:47:13Z file_id: '5973' file_name: 2018_eLife_Alanko.pdf file_size: 358141 relation: main_file file_date_updated: 2020-07-14T12:47:13Z has_accepted_license: '1' intvolume: ' 7' isi: 1 language: - iso: eng month: '06' oa: 1 oa_version: Published Version publication: eLife publication_identifier: issn: - 2050084X publication_status: published publisher: eLife Sciences Publications quality_controlled: '1' scopus_import: '1' status: public title: The cell sets the tone 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: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 7 year: '2018' ... --- _id: '5888' abstract: - lang: eng text: "Despite the remarkable number of scientific breakthroughs of the last 100 years, the treatment of neurodevelopmental\r\ndisorders (e.g., autism spectrum disorder, intellectual disability) remains a great challenge. Recent advancements in\r\ngenomics, such as whole-exome or whole-genome sequencing, have enabled scientists to identify numerous\r\nmutations underlying neurodevelopmental disorders. Given the few hundred risk genes that have been discovered,\r\nthe etiological variability and the heterogeneous clinical presentation, the need for genotype — along with phenotype-\r\nbased diagnosis of individual patients has become a requisite. In this review we look at recent advancements in\r\ngenomic analysis and their translation into clinical practice." article_number: '100' article_processing_charge: No author: - first_name: Dora-Clara full_name: Tarlungeanu, Dora-Clara id: 2ABCE612-F248-11E8-B48F-1D18A9856A87 last_name: Tarlungeanu - first_name: Gaia full_name: Novarino, Gaia id: 3E57A680-F248-11E8-B48F-1D18A9856A87 last_name: Novarino orcid: 0000-0002-7673-7178 citation: ama: 'Tarlungeanu D-C, Novarino G. Genomics in neurodevelopmental disorders: an avenue to personalized medicine. Experimental & Molecular Medicine. 2018;50(8). doi:10.1038/s12276-018-0129-7' apa: 'Tarlungeanu, D.-C., & Novarino, G. (2018). Genomics in neurodevelopmental disorders: an avenue to personalized medicine. Experimental & Molecular Medicine. Springer Nature. https://doi.org/10.1038/s12276-018-0129-7' chicago: 'Tarlungeanu, Dora-Clara, and Gaia Novarino. “Genomics in Neurodevelopmental Disorders: An Avenue to Personalized Medicine.” Experimental & Molecular Medicine. Springer Nature, 2018. https://doi.org/10.1038/s12276-018-0129-7.' ieee: 'D.-C. Tarlungeanu and G. Novarino, “Genomics in neurodevelopmental disorders: an avenue to personalized medicine,” Experimental & Molecular Medicine, vol. 50, no. 8. Springer Nature, 2018.' ista: 'Tarlungeanu D-C, Novarino G. 2018. Genomics in neurodevelopmental disorders: an avenue to personalized medicine. Experimental & Molecular Medicine. 50(8), 100.' mla: 'Tarlungeanu, Dora-Clara, and Gaia Novarino. “Genomics in Neurodevelopmental Disorders: An Avenue to Personalized Medicine.” Experimental & Molecular Medicine, vol. 50, no. 8, 100, Springer Nature, 2018, doi:10.1038/s12276-018-0129-7.' short: D.-C. Tarlungeanu, G. Novarino, Experimental & Molecular Medicine 50 (2018). date_created: 2019-01-27T22:59:11Z date_published: 2018-08-07T00:00:00Z date_updated: 2023-09-11T14:04:41Z day: '07' ddc: - '570' department: - _id: GaNo doi: 10.1038/s12276-018-0129-7 external_id: isi: - '000441266700006' pmid: - '30089840' file: - access_level: open_access checksum: 4498301c8c53097c9a1a8ef990936eb5 content_type: application/pdf creator: dernst date_created: 2019-01-28T15:18:02Z date_updated: 2020-07-14T12:47:13Z file_id: '5893' file_name: 2018_EMM_Tarlungeanu.pdf file_size: 1237482 relation: main_file file_date_updated: 2020-07-14T12:47:13Z has_accepted_license: '1' intvolume: ' 50' isi: 1 issue: '8' language: - iso: eng month: '08' oa: 1 oa_version: Published Version pmid: 1 publication: Experimental & Molecular Medicine publication_identifier: issn: - 2092-6413 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: 'Genomics in neurodevelopmental disorders: an avenue to personalized medicine' 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: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 50 year: '2018' ... --- _id: '59' abstract: - lang: eng text: Graph-based games are an important tool in computer science. They have applications in synthesis, verification, refinement, and far beyond. We review graphbased games with objectives on infinite plays. We give definitions and algorithms to solve the games and to give a winning strategy. The objectives we consider are mostly Boolean, but we also look at quantitative graph-based games and their objectives. Synthesis aims to turn temporal logic specifications into correct reactive systems. We explain the reduction of synthesis to graph-based games (or equivalently tree automata) using synthesis of LTL specifications as an example. We treat the classical approach that uses determinization of parity automata and more modern approaches. author: - first_name: Roderick full_name: Bloem, Roderick last_name: Bloem - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Barbara full_name: Jobstmann, Barbara last_name: Jobstmann citation: ama: 'Bloem R, Chatterjee K, Jobstmann B. Graph games and reactive synthesis. In: Henzinger TA, Clarke EM, Veith H, Bloem R, eds. Handbook of Model Checking. 1st ed. Springer; 2018:921-962. doi:10.1007/978-3-319-10575-8_27' apa: Bloem, R., Chatterjee, K., & Jobstmann, B. (2018). Graph games and reactive synthesis. In T. A. Henzinger, E. M. Clarke, H. Veith, & R. Bloem (Eds.), Handbook of Model Checking (1st ed., pp. 921–962). Springer. https://doi.org/10.1007/978-3-319-10575-8_27 chicago: Bloem, Roderick, Krishnendu Chatterjee, and Barbara Jobstmann. “Graph Games and Reactive Synthesis.” In Handbook of Model Checking, edited by Thomas A Henzinger, Edmund M. Clarke, Helmut Veith, and Roderick Bloem, 1st ed., 921–62. Springer, 2018. https://doi.org/10.1007/978-3-319-10575-8_27. ieee: R. Bloem, K. Chatterjee, and B. Jobstmann, “Graph games and reactive synthesis,” in Handbook of Model Checking, 1st ed., T. A. Henzinger, E. M. Clarke, H. Veith, and R. Bloem, Eds. Springer, 2018, pp. 921–962. ista: 'Bloem R, Chatterjee K, Jobstmann B. 2018.Graph games and reactive synthesis. In: Handbook of Model Checking. , 921–962.' mla: Bloem, Roderick, et al. “Graph Games and Reactive Synthesis.” Handbook of Model Checking, edited by Thomas A Henzinger et al., 1st ed., Springer, 2018, pp. 921–62, doi:10.1007/978-3-319-10575-8_27. short: R. Bloem, K. Chatterjee, B. Jobstmann, in:, T.A. Henzinger, E.M. Clarke, H. Veith, R. Bloem (Eds.), Handbook of Model Checking, 1st ed., Springer, 2018, pp. 921–962. date_created: 2018-12-11T11:44:24Z date_published: 2018-05-19T00:00:00Z date_updated: 2021-01-12T08:05:10Z day: '19' department: - _id: KrCh doi: 10.1007/978-3-319-10575-8_27 edition: '1' editor: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Edmund M. full_name: Clarke, Edmund M. last_name: Clarke - first_name: Helmut full_name: Veith, Helmut last_name: Veith - first_name: Roderick full_name: Bloem, Roderick last_name: Bloem language: - iso: eng month: '05' oa_version: None page: 921 - 962 publication: Handbook of Model Checking publication_identifier: isbn: - 978-3-319-10574-1 publication_status: published publisher: Springer publist_id: '7995' quality_controlled: '1' scopus_import: 1 status: public title: Graph games and reactive synthesis type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '5914' abstract: - lang: eng text: With the advent of optogenetics, it became possible to change the activity of a targeted population of neurons in a temporally controlled manner. To combine the advantages of 60-channel in vivo tetrode recording and laser-based optogenetics, we have developed a closed-loop recording system that allows for the actual electrophysiological signal to be used as a trigger for the laser light mediating the optogenetic intervention. We have optimized the weight, size, and shape of the corresponding implant to make it compatible with the size, force, and movements of a behaving mouse, and we have shown that the system can efficiently block sharp wave ripple (SWR) events using those events themselves as a trigger. To demonstrate the full potential of the optogenetic recording system we present a pilot study addressing the contribution of SWR events to learning in a complex behavioral task. article_number: e0087 article_processing_charge: No author: - first_name: Dámaris K full_name: Rangel Guerrero, Dámaris K id: 4871BCE6-F248-11E8-B48F-1D18A9856A87 last_name: Rangel Guerrero orcid: 0000-0002-8602-4374 - first_name: James G. full_name: Donnett, James G. last_name: Donnett - first_name: Jozsef L full_name: Csicsvari, Jozsef L id: 3FA14672-F248-11E8-B48F-1D18A9856A87 last_name: Csicsvari orcid: 0000-0002-5193-4036 - first_name: Krisztián full_name: Kovács, Krisztián id: 2AB5821E-F248-11E8-B48F-1D18A9856A87 last_name: Kovács orcid: 0000-0001-6251-1007 citation: ama: 'Rangel Guerrero DK, Donnett JG, Csicsvari JL, Kovács K. Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR events to learning. eNeuro. 2018;5(4). doi:10.1523/ENEURO.0087-18.2018' apa: 'Rangel Guerrero, D. K., Donnett, J. G., Csicsvari, J. L., & Kovács, K. (2018). Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR events to learning. ENeuro. Society of Neuroscience. https://doi.org/10.1523/ENEURO.0087-18.2018' chicago: 'Rangel Guerrero, Dámaris K, James G. Donnett, Jozsef L Csicsvari, and Krisztián Kovács. “Tetrode Recording from the Hippocampus of Behaving Mice Coupled with Four-Point-Irradiation Closed-Loop Optogenetics: A Technique to Study the Contribution of Hippocampal SWR Events to Learning.” ENeuro. Society of Neuroscience, 2018. https://doi.org/10.1523/ENEURO.0087-18.2018.' ieee: 'D. K. Rangel Guerrero, J. G. Donnett, J. L. Csicsvari, and K. Kovács, “Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR events to learning,” eNeuro, vol. 5, no. 4. Society of Neuroscience, 2018.' ista: 'Rangel Guerrero DK, Donnett JG, Csicsvari JL, Kovács K. 2018. Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR events to learning. eNeuro. 5(4), e0087.' mla: 'Rangel Guerrero, Dámaris K., et al. “Tetrode Recording from the Hippocampus of Behaving Mice Coupled with Four-Point-Irradiation Closed-Loop Optogenetics: A Technique to Study the Contribution of Hippocampal SWR Events to Learning.” ENeuro, vol. 5, no. 4, e0087, Society of Neuroscience, 2018, doi:10.1523/ENEURO.0087-18.2018.' short: D.K. Rangel Guerrero, J.G. Donnett, J.L. Csicsvari, K. Kovács, ENeuro 5 (2018). date_created: 2019-02-03T22:59:16Z date_published: 2018-07-27T00:00:00Z date_updated: 2024-03-25T23:30:06Z day: '27' ddc: - '570' department: - _id: JoCs doi: 10.1523/ENEURO.0087-18.2018 ec_funded: 1 external_id: isi: - '000443994700007' file: - access_level: open_access checksum: f4915d45fc7ad4648b7b7a13fdecca01 content_type: application/pdf creator: dernst date_created: 2019-02-05T12:48:36Z date_updated: 2020-07-14T12:47:13Z file_id: '5921' file_name: 2018_ENeuro_Guerrero.pdf file_size: 3746884 relation: main_file file_date_updated: 2020-07-14T12:47:13Z has_accepted_license: '1' intvolume: ' 5' isi: 1 issue: '4' language: - iso: eng month: '07' oa: 1 oa_version: Published Version project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme - _id: 257D4372-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I2072-B27 name: Interneuron plasticity during spatial learning publication: eNeuro publication_status: published publisher: Society of Neuroscience quality_controlled: '1' related_material: record: - id: '6849' relation: dissertation_contains status: public scopus_import: '1' status: public title: 'Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR events to learning' 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: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 5 year: '2018' ... --- _id: '5959' abstract: - lang: eng text: Formalizing properties of systems with continuous dynamics is a challenging task. In this paper, we propose a formal framework for specifying and monitoring rich temporal properties of real-valued signals. We introduce signal first-order logic (SFO) as a specification language that combines first-order logic with linear-real arithmetic and unary function symbols interpreted as piecewise-linear signals. We first show that while the satisfiability problem for SFO is undecidable, its membership and monitoring problems are decidable. We develop an offline monitoring procedure for SFO that has polynomial complexity in the size of the input trace and the specification, for a fixed number of quantifiers and function symbols. We show that the algorithm has computation time linear in the size of the input trace for the important fragment of bounded-response specifications interpreted over input traces with finite variability. We can use our results to extend signal temporal logic with first-order quantifiers over time and value parameters, while preserving its efficient monitoring. We finally demonstrate the practical appeal of our logic through a case study in the micro-electronics domain. article_processing_charge: No author: - first_name: Alexey full_name: Bakhirkin, Alexey last_name: Bakhirkin - first_name: Thomas full_name: Ferrere, Thomas id: 40960E6E-F248-11E8-B48F-1D18A9856A87 last_name: Ferrere orcid: 0000-0001-5199-3143 - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Deian full_name: Nickovicl, Deian last_name: Nickovicl citation: ama: 'Bakhirkin A, Ferrere T, Henzinger TA, Nickovicl D. Keynote: The first-order logic of signals. In: 2018 International Conference on Embedded Software. IEEE; 2018:1-10. doi:10.1109/emsoft.2018.8537203' apa: 'Bakhirkin, A., Ferrere, T., Henzinger, T. A., & Nickovicl, D. (2018). Keynote: The first-order logic of signals. In 2018 International Conference on Embedded Software (pp. 1–10). Turin, Italy: IEEE. https://doi.org/10.1109/emsoft.2018.8537203' chicago: 'Bakhirkin, Alexey, Thomas Ferrere, Thomas A Henzinger, and Deian Nickovicl. “Keynote: The First-Order Logic of Signals.” In 2018 International Conference on Embedded Software, 1–10. IEEE, 2018. https://doi.org/10.1109/emsoft.2018.8537203.' ieee: 'A. Bakhirkin, T. Ferrere, T. A. Henzinger, and D. Nickovicl, “Keynote: The first-order logic of signals,” in 2018 International Conference on Embedded Software, Turin, Italy, 2018, pp. 1–10.' ista: 'Bakhirkin A, Ferrere T, Henzinger TA, Nickovicl D. 2018. Keynote: The first-order logic of signals. 2018 International Conference on Embedded Software. EMSOFT: International Conference on Embedded Software, 1–10.' mla: 'Bakhirkin, Alexey, et al. “Keynote: The First-Order Logic of Signals.” 2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10, doi:10.1109/emsoft.2018.8537203.' short: A. Bakhirkin, T. Ferrere, T.A. Henzinger, D. Nickovicl, in:, 2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10. conference: end_date: 2018-10-05 location: Turin, Italy name: 'EMSOFT: International Conference on Embedded Software' start_date: 2018-09-30 date_created: 2019-02-13T09:19:28Z date_published: 2018-09-30T00:00:00Z date_updated: 2023-09-19T10:41:29Z day: '30' ddc: - '000' department: - _id: ToHe doi: 10.1109/emsoft.2018.8537203 external_id: isi: - '000492828500005' file: - access_level: open_access checksum: 234a33ad9055b3458fcdda6af251b33a content_type: application/pdf creator: dernst date_created: 2020-05-14T16:01:29Z date_updated: 2020-07-14T12:47:13Z file_id: '7839' file_name: 2018_EMSOFT_Bakhirkin.pdf file_size: 338006 relation: main_file file_date_updated: 2020-07-14T12:47:13Z has_accepted_license: '1' isi: 1 language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: 1-10 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: 2018 International Conference on Embedded Software publication_identifier: isbn: - '9781538655603' publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: '1' status: public title: 'Keynote: The first-order logic of signals' type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2018' ... --- _id: '5960' abstract: - lang: eng text: In this paper we present a reliable method to verify the existence of loops along the uncertain trajectory of a robot, based on proprioceptive measurements only, within a bounded-error context. The loop closure detection is one of the key points in simultaneous localization and mapping (SLAM) methods, especially in homogeneous environments with difficult scenes recognitions. The proposed approach is generic and could be coupled with conventional SLAM algorithms to reliably reduce their computing burden, thus improving the localization and mapping processes in the most challenging environments such as unexplored underwater extents. To prove that a robot performed a loop whatever the uncertainties in its evolution, we employ the notion of topological degree that originates in the field of differential topology. We show that a verification tool based on the topological degree is an optimal method for proving robot loops. This is demonstrated both on datasets from real missions involving autonomous underwater vehicles and by a mathematical discussion. article_processing_charge: No arxiv: 1 author: - first_name: Simon full_name: Rohou, Simon last_name: Rohou - first_name: Peter full_name: Franek, Peter id: 473294AE-F248-11E8-B48F-1D18A9856A87 last_name: Franek orcid: 0000-0001-8878-8397 - first_name: Clément full_name: Aubry, Clément last_name: Aubry - first_name: Luc full_name: Jaulin, Luc last_name: Jaulin citation: ama: Rohou S, Franek P, Aubry C, Jaulin L. Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. 2018;37(12):1500-1516. doi:10.1177/0278364918808367 apa: Rohou, S., Franek, P., Aubry, C., & Jaulin, L. (2018). Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. SAGE Publications. https://doi.org/10.1177/0278364918808367 chicago: Rohou, Simon, Peter Franek, Clément Aubry, and Luc Jaulin. “Proving the Existence of Loops in Robot Trajectories.” The International Journal of Robotics Research. SAGE Publications, 2018. https://doi.org/10.1177/0278364918808367. ieee: S. Rohou, P. Franek, C. Aubry, and L. Jaulin, “Proving the existence of loops in robot trajectories,” The International Journal of Robotics Research, vol. 37, no. 12. SAGE Publications, pp. 1500–1516, 2018. ista: Rohou S, Franek P, Aubry C, Jaulin L. 2018. Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. 37(12), 1500–1516. mla: Rohou, Simon, et al. “Proving the Existence of Loops in Robot Trajectories.” The International Journal of Robotics Research, vol. 37, no. 12, SAGE Publications, 2018, pp. 1500–16, doi:10.1177/0278364918808367. short: S. Rohou, P. Franek, C. Aubry, L. Jaulin, The International Journal of Robotics Research 37 (2018) 1500–1516. date_created: 2019-02-13T09:36:20Z date_published: 2018-10-24T00:00:00Z date_updated: 2023-09-19T10:41:59Z day: '24' department: - _id: UlWa doi: 10.1177/0278364918808367 external_id: arxiv: - '1712.01341' isi: - '000456881100004' intvolume: ' 37' isi: 1 issue: '12' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1712.01341 month: '10' oa: 1 oa_version: Preprint page: 1500-1516 publication: The International Journal of Robotics Research publication_identifier: eissn: - 1741-3176 issn: - 0278-3649 publication_status: published publisher: SAGE Publications quality_controlled: '1' scopus_import: '1' status: public title: Proving the existence of loops in robot trajectories type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 37 year: '2018' ... --- _id: '5961' abstract: - lang: eng text: "The area of machine learning has made considerable progress over the past decade, enabled by the widespread availability of large datasets, as well as by improved algorithms and models. Given the large computational demands of machine learning workloads, parallelism, implemented either through single-node concurrency or through multi-node distribution, has been a third key ingredient to advances in machine learning.\r\nThe goal of this tutorial is to provide the audience with an overview of standard distribution techniques in machine learning, with an eye towards the intriguing trade-offs between synchronization and communication costs of distributed machine learning algorithms, on the one hand, and their convergence, on the other.The tutorial will focus on parallelization strategies for the fundamental stochastic gradient descent (SGD) algorithm, which is a key tool when training machine learning models, from classical instances such as linear regression, to state-of-the-art neural network architectures.\r\nThe tutorial will describe the guarantees provided by this algorithm in the sequential case, and then move on to cover both shared-memory and message-passing parallelization strategies, together with the guarantees they provide, and corresponding trade-offs. The presentation will conclude with a broad overview of ongoing research in distributed and concurrent machine learning. The tutorial will assume no prior knowledge beyond familiarity with basic concepts in algebra and analysis.\r\n" article_processing_charge: No author: - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Alistarh D-A. A brief tutorial on distributed and concurrent machine learning. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18. ACM Press; 2018:487-488. doi:10.1145/3212734.3212798' apa: 'Alistarh, D.-A. (2018). A brief tutorial on distributed and concurrent machine learning. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18 (pp. 487–488). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212798' chicago: Alistarh, Dan-Adrian. “A Brief Tutorial on Distributed and Concurrent Machine Learning.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, 487–88. ACM Press, 2018. https://doi.org/10.1145/3212734.3212798. ieee: D.-A. Alistarh, “A brief tutorial on distributed and concurrent machine learning,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, Egham, United Kingdom, 2018, pp. 487–488. ista: 'Alistarh D-A. 2018. A brief tutorial on distributed and concurrent machine learning. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18. PODC: Principles of Distributed Computing, 487–488.' mla: Alistarh, Dan-Adrian. “A Brief Tutorial on Distributed and Concurrent Machine Learning.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 487–88, doi:10.1145/3212734.3212798. short: D.-A. Alistarh, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 487–488. conference: end_date: 2018-07-27 location: Egham, United Kingdom name: 'PODC: Principles of Distributed Computing' start_date: 2018-07-23 date_created: 2019-02-13T09:48:55Z date_published: 2018-07-27T00:00:00Z date_updated: 2023-09-19T10:42:28Z day: '27' department: - _id: DaAl doi: 10.1145/3212734.3212798 external_id: isi: - '000458186900063' isi: 1 language: - iso: eng month: '07' oa_version: None page: 487-488 publication: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18 publication_identifier: isbn: - '9781450357951' publication_status: published publisher: ACM Press quality_controlled: '1' scopus_import: '1' status: public title: A brief tutorial on distributed and concurrent machine learning type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2018' ... --- _id: '5962' abstract: - lang: eng text: Stochastic Gradient Descent (SGD) is a fundamental algorithm in machine learning, representing the optimization backbone for training several classic models, from regression to neural networks. Given the recent practical focus on distributed machine learning, significant work has been dedicated to the convergence properties of this algorithm under the inconsistent and noisy updates arising from execution in a distributed environment. However, surprisingly, the convergence properties of this classic algorithm in the standard shared-memory model are still not well-understood. In this work, we address this gap, and provide new convergence bounds for lock-free concurrent stochastic gradient descent, executing in the classic asynchronous shared memory model, against a strong adaptive adversary. Our results give improved upper and lower bounds on the "price of asynchrony'' when executing the fundamental SGD algorithm in a concurrent setting. They show that this classic optimization tool can converge faster and with a wider range of parameters than previously known under asynchronous iterations. At the same time, we exhibit a fundamental trade-off between the maximum delay in the system and the rate at which SGD can converge, which governs the set of parameters under which this algorithm can still work efficiently. article_processing_charge: No arxiv: 1 author: - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Christopher full_name: De Sa, Christopher last_name: De Sa - first_name: Nikola H full_name: Konstantinov, Nikola H id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87 last_name: Konstantinov citation: ama: 'Alistarh D-A, De Sa C, Konstantinov NH. The convergence of stochastic gradient descent in asynchronous shared memory. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18. ACM Press; 2018:169-178. doi:10.1145/3212734.3212763' apa: 'Alistarh, D.-A., De Sa, C., & Konstantinov, N. H. (2018). The convergence of stochastic gradient descent in asynchronous shared memory. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18 (pp. 169–178). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212763' chicago: Alistarh, Dan-Adrian, Christopher De Sa, and Nikola H Konstantinov. “The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, 169–78. ACM Press, 2018. https://doi.org/10.1145/3212734.3212763. ieee: D.-A. Alistarh, C. De Sa, and N. H. Konstantinov, “The convergence of stochastic gradient descent in asynchronous shared memory,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, Egham, United Kingdom, 2018, pp. 169–178. ista: 'Alistarh D-A, De Sa C, Konstantinov NH. 2018. The convergence of stochastic gradient descent in asynchronous shared memory. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18. PODC: Principles of Distributed Computing, 169–178.' mla: Alistarh, Dan-Adrian, et al. “The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 169–78, doi:10.1145/3212734.3212763. short: D.-A. Alistarh, C. De Sa, N.H. Konstantinov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 169–178. conference: end_date: 2018-07-27 location: Egham, United Kingdom name: 'PODC: Principles of Distributed Computing' start_date: 2018-07-23 date_created: 2019-02-13T09:58:58Z date_published: 2018-07-23T00:00:00Z date_updated: 2023-09-19T10:42:53Z day: '23' department: - _id: DaAl doi: 10.1145/3212734.3212763 external_id: arxiv: - '1803.08841' isi: - '000458186900022' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1803.08841 month: '07' oa: 1 oa_version: Preprint page: 169-178 publication: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18 publication_identifier: isbn: - '9781450357951' publication_status: published publisher: ACM Press quality_controlled: '1' scopus_import: '1' status: public title: The convergence of stochastic gradient descent in asynchronous shared memory type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2018' ... --- _id: '5963' abstract: - lang: eng text: 'There has been significant progress in understanding the parallelism inherent to iterative sequential algorithms: for many classic algorithms, the depth of the dependence structure is now well understood, and scheduling techniques have been developed to exploit this shallow dependence structure for efficient parallel implementations. A related, applied research strand has studied methods by which certain iterative task-based algorithms can be efficiently parallelized via relaxed concurrent priority schedulers. These allow for high concurrency when inserting and removing tasks, at the cost of executing superfluous work due to the relaxed semantics of the scheduler. In this work, we take a step towards unifying these two research directions, by showing that there exists a family of relaxed priority schedulers that can efficiently and deterministically execute classic iterative algorithms such as greedy maximal independent set (MIS) and matching. Our primary result shows that, given a randomized scheduler with an expected relaxation factor of k in terms of the maximum allowed priority inversions on a task, and any graph on n vertices, the scheduler is able to execute greedy MIS with only an additive factor of \poly(k) expected additional iterations compared to an exact (but not scalable) scheduler. This counter-intuitive result demonstrates that the overhead of relaxation when computing MIS is not dependent on the input size or structure of the input graph. Experimental results show that this overhead can be clearly offset by the gain in performance due to the highly scalable scheduler. In sum, we present an efficient method to deterministically parallelize iterative sequential algorithms, with provable runtime guarantees in terms of the number of executed tasks to completion.' article_processing_charge: No arxiv: 1 author: - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Trevor A full_name: Brown, Trevor A id: 3569F0A0-F248-11E8-B48F-1D18A9856A87 last_name: Brown - first_name: Justin full_name: Kopinsky, Justin last_name: Kopinsky - first_name: Giorgi full_name: Nadiradze, Giorgi last_name: Nadiradze citation: ama: 'Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. Relaxed schedulers can efficiently parallelize iterative algorithms. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18. ACM Press; 2018:377-386. doi:10.1145/3212734.3212756' apa: 'Alistarh, D.-A., Brown, T. A., Kopinsky, J., & Nadiradze, G. (2018). Relaxed schedulers can efficiently parallelize iterative algorithms. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18 (pp. 377–386). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212756' chicago: Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, and Giorgi Nadiradze. “Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, 377–86. ACM Press, 2018. https://doi.org/10.1145/3212734.3212756. ieee: D.-A. Alistarh, T. A. Brown, J. Kopinsky, and G. Nadiradze, “Relaxed schedulers can efficiently parallelize iterative algorithms,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, Egham, United Kingdom, 2018, pp. 377–386. ista: 'Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. 2018. Relaxed schedulers can efficiently parallelize iterative algorithms. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18. PODC: Principles of Distributed Computing, 377–386.' mla: Alistarh, Dan-Adrian, et al. “Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 377–86, doi:10.1145/3212734.3212756. short: D.-A. Alistarh, T.A. Brown, J. Kopinsky, G. Nadiradze, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 377–386. conference: end_date: 2018-07-27 location: Egham, United Kingdom name: 'PODC: Principles of Distributed Computing' start_date: 2018-07-23 date_created: 2019-02-13T10:03:25Z date_published: 2018-07-23T00:00:00Z date_updated: 2023-09-19T10:43:21Z day: '23' department: - _id: DaAl doi: 10.1145/3212734.3212756 external_id: arxiv: - '1808.04155' isi: - '000458186900048' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1808.04155 month: '07' oa: 1 oa_version: Preprint page: 377-386 publication: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18 publication_identifier: isbn: - '9781450357951' publication_status: published publisher: ACM Press quality_controlled: '1' scopus_import: '1' status: public title: Relaxed schedulers can efficiently parallelize iterative algorithms type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2018' ... --- _id: '5964' abstract: - lang: eng text: A standard design pattern found in many concurrent data structures, such as hash tables or ordered containers, is an alternation of parallelizable sections that incur no data conflicts and critical sections that must run sequentially and are protected with locks. A lock can be viewed as a queue that arbitrates the order in which the critical sections are executed, and a natural question is whether we can use stochastic analysis to predict the resulting throughput. As a preliminary evidence to the affirmative, we describe a simple model that can be used to predict the throughput of coarse-grained lock-based algorithms. We show that our model works well for CLH lock, and we expect it to work for other popular lock designs such as TTAS, MCS, etc. article_processing_charge: No author: - first_name: Vitaly full_name: Aksenov, Vitaly last_name: Aksenov - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Petr full_name: Kuznetsov, Petr last_name: Kuznetsov citation: ama: 'Aksenov V, Alistarh D-A, Kuznetsov P. Brief Announcement: Performance prediction for coarse-grained locking. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18. ACM Press; 2018:411-413. doi:10.1145/3212734.3212785' apa: 'Aksenov, V., Alistarh, D.-A., & Kuznetsov, P. (2018). Brief Announcement: Performance prediction for coarse-grained locking. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18 (pp. 411–413). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212785' chicago: 'Aksenov, Vitaly, Dan-Adrian Alistarh, and Petr Kuznetsov. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, 411–13. ACM Press, 2018. https://doi.org/10.1145/3212734.3212785.' ieee: 'V. Aksenov, D.-A. Alistarh, and P. Kuznetsov, “Brief Announcement: Performance prediction for coarse-grained locking,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, Egham, United Kingdom, 2018, pp. 411–413.' ista: 'Aksenov V, Alistarh D-A, Kuznetsov P. 2018. Brief Announcement: Performance prediction for coarse-grained locking. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18. PODC: Principles of Distributed Computing, 411–413.' mla: 'Aksenov, Vitaly, et al. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 411–13, doi:10.1145/3212734.3212785.' short: V. Aksenov, D.-A. Alistarh, P. Kuznetsov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing  - PODC ’18, ACM Press, 2018, pp. 411–413. conference: end_date: 2018-07-27 location: Egham, United Kingdom name: 'PODC: Principles of Distributed Computing' start_date: 2018-07-23 date_created: 2019-02-13T10:08:19Z date_published: 2018-07-23T00:00:00Z date_updated: 2023-09-19T10:43:45Z day: '23' department: - _id: DaAl doi: 10.1145/3212734.3212785 external_id: isi: - '000458186900052' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://hal-univ-lyon3.archives-ouvertes.fr/INRIA/hal-01887733v1 month: '07' oa: 1 oa_version: Submitted Version page: 411-413 publication: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18 publication_identifier: isbn: - '9781450357951' publication_status: published publisher: ACM Press quality_controlled: '1' scopus_import: '1' status: public title: 'Brief Announcement: Performance prediction for coarse-grained locking' type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2018' ... --- _id: '5965' abstract: - lang: eng text: Relaxed concurrent data structures have become increasingly popular, due to their scalability in graph processing and machine learning applications (\citeNguyen13, gonzalez2012powergraph ). Despite considerable interest, there exist families of natural, high performing randomized relaxed concurrent data structures, such as the popular MultiQueue~\citeMQ pattern for implementing relaxed priority queue data structures, for which no guarantees are known in the concurrent setting~\citeAKLN17. Our main contribution is in showing for the first time that, under a set of analytic assumptions, a family of relaxed concurrent data structures, including variants of MultiQueues, but also a new approximate counting algorithm we call the MultiCounter, provides strong probabilistic guarantees on the degree of relaxation with respect to the sequential specification, in arbitrary concurrent executions. We formalize these guarantees via a new correctness condition called distributional linearizability, tailored to concurrent implementations with randomized relaxations. Our result is based on a new analysis of an asynchronous variant of the classic power-of-two-choices load balancing algorithm, in which placement choices can be based on inconsistent, outdated information (this result may be of independent interest). We validate our results empirically, showing that the MultiCounter algorithm can implement scalable relaxed timestamps. article_processing_charge: No arxiv: 1 author: - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Trevor A full_name: Brown, Trevor A id: 3569F0A0-F248-11E8-B48F-1D18A9856A87 last_name: Brown - first_name: Justin full_name: Kopinsky, Justin last_name: Kopinsky - first_name: Jerry Z. full_name: Li, Jerry Z. last_name: Li - first_name: Giorgi full_name: Nadiradze, Giorgi last_name: Nadiradze citation: ama: 'Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. Distributionally linearizable data structures. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. ACM Press; 2018:133-142. doi:10.1145/3210377.3210411' apa: 'Alistarh, D.-A., Brown, T. A., Kopinsky, J., Li, J. Z., & Nadiradze, G. (2018). Distributionally linearizable data structures. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18 (pp. 133–142). Vienna, Austria: ACM Press. https://doi.org/10.1145/3210377.3210411' chicago: Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, Jerry Z. Li, and Giorgi Nadiradze. “Distributionally Linearizable Data Structures.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, 133–42. ACM Press, 2018. https://doi.org/10.1145/3210377.3210411. ieee: D.-A. Alistarh, T. A. Brown, J. Kopinsky, J. Z. Li, and G. Nadiradze, “Distributionally linearizable data structures,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, Vienna, Austria, 2018, pp. 133–142. ista: 'Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. 2018. Distributionally linearizable data structures. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. SPAA: Symposium on Parallelism in Algorithms and Architectures, 133–142.' mla: Alistarh, Dan-Adrian, et al. “Distributionally Linearizable Data Structures.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018, pp. 133–42, doi:10.1145/3210377.3210411. short: D.-A. Alistarh, T.A. Brown, J. Kopinsky, J.Z. Li, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018, pp. 133–142. conference: end_date: 2018-07-18 location: Vienna, Austria name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures' start_date: 2018-07-16 date_created: 2019-02-13T10:17:19Z date_published: 2018-07-16T00:00:00Z date_updated: 2023-09-19T10:44:13Z day: '16' department: - _id: DaAl doi: 10.1145/3210377.3210411 external_id: arxiv: - '1804.01018' isi: - '000545269600016' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1804.01018 month: '07' oa: 1 oa_version: Preprint page: 133-142 publication: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18 publication_identifier: isbn: - '9781450357999' publication_status: published publisher: ACM Press quality_controlled: '1' related_material: record: - id: '10429' relation: dissertation_contains status: public scopus_import: '1' status: public title: Distributionally linearizable data structures type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2018' ... --- _id: '5966' abstract: - lang: eng text: 'The transactional conflict problem arises in transactional systems whenever two or more concurrent transactions clash on a data item. While the standard solution to such conflicts is to immediately abort one of the transactions, some practical systems consider the alternative of delaying conflict resolution for a short interval, which may allow one of the transactions to commit. The challenge in the transactional conflict problem is to choose the optimal length of this delay interval so as to minimize the overall running time penalty for the conflicting transactions. In this paper, we propose a family of optimal online algorithms for the transactional conflict problem. Specifically, we consider variants of this problem which arise in different implementations of transactional systems, namely "requestor wins'''' and "requestor aborts'''' implementations: in the former, the recipient of a coherence request is aborted, whereas in the latter, it is the requestor which has to abort. Both strategies are implemented by real systems. We show that the requestor aborts case can be reduced to a classic instance of the ski rental problem, while the requestor wins case leads to a new version of this classical problem, for which we derive optimal deterministic and randomized algorithms. Moreover, we prove that, under a simplified adversarial model, our algorithms are constant-competitive with the offline optimum in terms of throughput. We validate our algorithmic results empirically through a hardware simulation of hardware transactional memory (HTM), showing that our algorithms can lead to non-trivial performance improvements for classic concurrent data structures.' article_processing_charge: No arxiv: 1 author: - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Syed Kamran full_name: Haider, Syed Kamran last_name: Haider - first_name: Raphael full_name: Kübler, Raphael last_name: Kübler - first_name: Giorgi full_name: Nadiradze, Giorgi last_name: Nadiradze citation: ama: 'Alistarh D-A, Haider SK, Kübler R, Nadiradze G. The transactional conflict problem. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. ACM Press; 2018:383-392. doi:10.1145/3210377.3210406' apa: 'Alistarh, D.-A., Haider, S. K., Kübler, R., & Nadiradze, G. (2018). The transactional conflict problem. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18 (pp. 383–392). Vienna, Austria: ACM Press. https://doi.org/10.1145/3210377.3210406' chicago: Alistarh, Dan-Adrian, Syed Kamran Haider, Raphael Kübler, and Giorgi Nadiradze. “The Transactional Conflict Problem.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, 383–92. ACM Press, 2018. https://doi.org/10.1145/3210377.3210406. ieee: D.-A. Alistarh, S. K. Haider, R. Kübler, and G. Nadiradze, “The transactional conflict problem,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, Vienna, Austria, 2018, pp. 383–392. ista: 'Alistarh D-A, Haider SK, Kübler R, Nadiradze G. 2018. The transactional conflict problem. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. SPAA: Symposium on Parallelism in Algorithms and Architectures, 383–392.' mla: Alistarh, Dan-Adrian, et al. “The Transactional Conflict Problem.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018, pp. 383–92, doi:10.1145/3210377.3210406. short: D.-A. Alistarh, S.K. Haider, R. Kübler, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018, pp. 383–392. conference: end_date: 2018-07-18 location: Vienna, Austria name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures' start_date: 2018-07-16 date_created: 2019-02-13T10:26:07Z date_published: 2018-07-16T00:00:00Z date_updated: 2023-09-19T10:44:49Z day: '16' department: - _id: DaAl doi: 10.1145/3210377.3210406 external_id: arxiv: - '1804.00947' isi: - '000545269600046' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1804.00947 month: '07' oa: 1 oa_version: Preprint page: 383-392 publication: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18 publication_identifier: isbn: - '9781450357999' publication_status: published publisher: ACM Press quality_controlled: '1' scopus_import: '1' status: public title: The transactional conflict problem type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2018' ... --- _id: '5967' abstract: - lang: eng text: "The Big Match is a multi-stage two-player game. In each stage Player 1 hides one or two pebbles in his hand, and his opponent has to guess that number; Player 1 loses a point if Player 2 is correct, and otherwise he wins a point. As soon as Player 1 hides one pebble, the players cannot change their choices in any future stage.\r\nBlackwell and Ferguson (1968) give an ε-optimal strategy for Player 1 that hides, in each stage, one pebble with a probability that depends on the entire past history. Any strategy that depends just on the clock or on a finite memory is worthless. The long-standing natural open problem has been whether every strategy that depends just on the clock and a finite memory is worthless. We prove that there is such a strategy that is ε-optimal. In fact, we show that just two states of memory are sufficient.\r\n" article_processing_charge: No author: - first_name: Kristoffer Arnsfelt full_name: Hansen, Kristoffer Arnsfelt last_name: Hansen - first_name: Rasmus full_name: Ibsen-Jensen, Rasmus id: 3B699956-F248-11E8-B48F-1D18A9856A87 last_name: Ibsen-Jensen orcid: 0000-0003-4783-0389 - first_name: Abraham full_name: Neyman, Abraham last_name: Neyman citation: ama: 'Hansen KA, Ibsen-Jensen R, Neyman A. The Big Match with a clock and a bit of memory. In: Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18. ACM Press; 2018:149-150. doi:10.1145/3219166.3219198' apa: 'Hansen, K. A., Ibsen-Jensen, R., & Neyman, A. (2018). The Big Match with a clock and a bit of memory. In Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18 (pp. 149–150). Ithaca, NY, United States: ACM Press. https://doi.org/10.1145/3219166.3219198' chicago: Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham Neyman. “The Big Match with a Clock and a Bit of Memory.” In Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, 149–50. ACM Press, 2018. https://doi.org/10.1145/3219166.3219198. ieee: K. A. Hansen, R. Ibsen-Jensen, and A. Neyman, “The Big Match with a clock and a bit of memory,” in Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, Ithaca, NY, United States, 2018, pp. 149–150. ista: 'Hansen KA, Ibsen-Jensen R, Neyman A. 2018. The Big Match with a clock and a bit of memory. Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18. EC: Conference on Economics and Computation, 149–150.' mla: Hansen, Kristoffer Arnsfelt, et al. “The Big Match with a Clock and a Bit of Memory.” Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, ACM Press, 2018, pp. 149–50, doi:10.1145/3219166.3219198. short: K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, ACM Press, 2018, pp. 149–150. conference: end_date: 2018-06-22 location: Ithaca, NY, United States name: 'EC: Conference on Economics and Computation' start_date: 2018-06-18 date_created: 2019-02-13T10:31:41Z date_published: 2018-06-18T00:00:00Z date_updated: 2023-09-19T10:45:15Z day: '18' ddc: - '000' department: - _id: KrCh doi: 10.1145/3219166.3219198 external_id: isi: - '000492755100020' file: - access_level: open_access checksum: bb52683e349cfd864f4769a8f38f2798 content_type: application/pdf creator: dernst date_created: 2019-11-19T08:24:24Z date_updated: 2020-07-14T12:47:14Z file_id: '7054' file_name: 2018_EC18_Hansen.pdf file_size: 302539 relation: main_file file_date_updated: 2020-07-14T12:47:14Z has_accepted_license: '1' isi: 1 language: - iso: eng month: '06' oa: 1 oa_version: Submitted Version page: 149-150 publication: Proceedings of the 2018 ACM Conference on Economics and Computation - EC '18 publication_identifier: isbn: - '9781450358293' publication_status: published publisher: ACM Press quality_controlled: '1' scopus_import: '1' status: public title: The Big Match with a clock and a bit of memory type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2018' ... --- _id: '5971' abstract: - lang: eng text: "We consider a Wigner-type ensemble, i.e. large hermitian N×N random matrices H=H∗ with centered independent entries and with a general matrix of variances Sxy=\U0001D53C∣∣Hxy∣∣2. The norm of H is asymptotically given by the maximum of the support of the self-consistent density of states. We establish a bound on this maximum in terms of norms of powers of S that substantially improves the earlier bound 2∥S∥1/2∞ given in [O. Ajanki, L. Erdős and T. Krüger, Universality for general Wigner-type matrices, Prob. Theor. Rel. Fields169 (2017) 667–727]. The key element of the proof is an effective Markov chain approximation for the contributions of the weighted Dyck paths appearing in the iterative solution of the corresponding Dyson equation." article_number: '1950009' article_processing_charge: No arxiv: 1 author: - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Peter full_name: Mühlbacher, Peter last_name: Mühlbacher citation: ama: 'Erdös L, Mühlbacher P. Bounds on the norm of Wigner-type random matrices. Random matrices: Theory and applications. 2018. doi:10.1142/s2010326319500096' apa: 'Erdös, L., & Mühlbacher, P. (2018). Bounds on the norm of Wigner-type random matrices. Random Matrices: Theory and Applications. World Scientific Publishing. https://doi.org/10.1142/s2010326319500096' chicago: 'Erdös, László, and Peter Mühlbacher. “Bounds on the Norm of Wigner-Type Random Matrices.” Random Matrices: Theory and Applications. World Scientific Publishing, 2018. https://doi.org/10.1142/s2010326319500096.' ieee: 'L. Erdös and P. Mühlbacher, “Bounds on the norm of Wigner-type random matrices,” Random matrices: Theory and applications. World Scientific Publishing, 2018.' ista: 'Erdös L, Mühlbacher P. 2018. Bounds on the norm of Wigner-type random matrices. Random matrices: Theory and applications., 1950009.' mla: 'Erdös, László, and Peter Mühlbacher. “Bounds on the Norm of Wigner-Type Random Matrices.” Random Matrices: Theory and Applications, 1950009, World Scientific Publishing, 2018, doi:10.1142/s2010326319500096.' short: 'L. Erdös, P. Mühlbacher, Random Matrices: Theory and Applications (2018).' date_created: 2019-02-13T10:40:54Z date_published: 2018-09-26T00:00:00Z date_updated: 2023-09-19T14:24:05Z day: '26' department: - _id: LaEr doi: 10.1142/s2010326319500096 ec_funded: 1 external_id: arxiv: - '1802.05175' isi: - '000477677200002' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1802.05175 month: '09' oa: 1 oa_version: Preprint project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication: 'Random matrices: Theory and applications' publication_identifier: eissn: - 2010-3271 issn: - 2010-3263 publication_status: published publisher: World Scientific Publishing quality_controlled: '1' scopus_import: '1' status: public title: Bounds on the norm of Wigner-type random matrices type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2018' ...