--- _id: '11851' abstract: - lang: eng text: The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weighted sum of the cut edges. In this paper, we engineer the fastest known exact algorithm for the problem. State-of-the-art algorithms like the algorithm of Padberg and Rinaldi or the algorithm of Nagamochi, Ono and Ibaraki identify edges that can be contracted to reduce the graph size such that at least one minimum cut is maintained in the contracted graph. Our algorithm achieves improvements in running time over these algorithms by a multitude of techniques. First, we use a recently developed fast and parallel inexact minimum cut algorithm to obtain a better bound for the problem. Afterwards, we use reductions that depend on this bound to reduce the size of the graph much faster than previously possible. We use improved data structures to further lower the running time of our algorithm. Additionally, we parallelize the contraction routines of Nagamochi et al. . Overall, we arrive at a system that significantly outperforms the fastest state-of-the-art solvers for the exact minimum cut problem. article_number: '8820968' article_processing_charge: No author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Alexander full_name: Noe, Alexander last_name: Noe - first_name: Christian full_name: Schulz, Christian last_name: Schulz citation: ama: 'Henzinger MH, Noe A, Schulz C. Shared-memory exact minimum cuts. In: 33rd International Parallel and Distributed Processing Symposium. Institute of Electrical and Electronics Engineers; 2019. doi:10.1109/ipdps.2019.00013' apa: 'Henzinger, M. H., Noe, A., & Schulz, C. (2019). Shared-memory exact minimum cuts. In 33rd International Parallel and Distributed Processing Symposium. Rio de Janeiro, Brazil: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ipdps.2019.00013' chicago: Henzinger, Monika H, Alexander Noe, and Christian Schulz. “Shared-Memory Exact Minimum Cuts.” In 33rd International Parallel and Distributed Processing Symposium. Institute of Electrical and Electronics Engineers, 2019. https://doi.org/10.1109/ipdps.2019.00013. ieee: M. H. Henzinger, A. Noe, and C. Schulz, “Shared-memory exact minimum cuts,” in 33rd International Parallel and Distributed Processing Symposium, Rio de Janeiro, Brazil, 2019. ista: 'Henzinger MH, Noe A, Schulz C. 2019. Shared-memory exact minimum cuts. 33rd International Parallel and Distributed Processing Symposium. IPDPS: International Parallel and Distributed Processing Symposium, 8820968.' mla: Henzinger, Monika H., et al. “Shared-Memory Exact Minimum Cuts.” 33rd International Parallel and Distributed Processing Symposium, 8820968, Institute of Electrical and Electronics Engineers, 2019, doi:10.1109/ipdps.2019.00013. short: M.H. Henzinger, A. Noe, C. Schulz, in:, 33rd International Parallel and Distributed Processing Symposium, Institute of Electrical and Electronics Engineers, 2019. conference: end_date: 2019-05-24 location: Rio de Janeiro, Brazil name: 'IPDPS: International Parallel and Distributed Processing Symposium' start_date: 2019-05-20 date_created: 2022-08-16T07:25:23Z date_published: 2019-05-01T00:00:00Z date_updated: 2023-02-21T16:30:34Z day: '01' doi: 10.1109/ipdps.2019.00013 extern: '1' external_id: arxiv: - '1808.05458' language: - iso: eng main_file_link: - url: https://arxiv.org/abs/1808.05458 month: '05' oa_version: Preprint publication: 33rd International Parallel and Distributed Processing Symposium publication_identifier: eisbn: - 978-1-7281-1246-6 eissn: - 1530-2075 isbn: - 978-1-7281-1247-3 publication_status: published publisher: Institute of Electrical and Electronics Engineers quality_controlled: '1' related_material: record: - id: '11851' relation: later_version status: public scopus_import: '1' status: public title: Shared-memory exact minimum cuts type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '11865' abstract: - lang: eng text: We present the first sublinear-time algorithm that can compute the edge connectivity λ of a network exactly on distributed message-passing networks (the CONGEST model), as long as the network contains no multi-edge. We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity λ exactly in the CONGEST model, as long as there are no parallel edges. Our algorithm takes Õ(n1−1/353D1/353+n1−1/706) time to compute λ and a cut of cardinality λ with high probability, where n and D are the number of nodes and the diameter of the network, respectively, and Õ hides polylogarithmic factors. This running time is sublinear in n (i.e. Õ(n1−є)) whenever D is. Previous sublinear-time distributed algorithms can solve this problem either (i) exactly only when λ=O(n1/8−є) [Thurimella PODC’95; Pritchard, Thurimella, ACM Trans. Algorithms’11; Nanongkai, Su, DISC’14] or (ii) approximately [Ghaffari, Kuhn, DISC’13; Nanongkai, Su, DISC’14]. To achieve this we develop and combine several new techniques. First, we design the first distributed algorithm that can compute a k-edge connectivity certificate for any k=O(n1−є) in time Õ(√nk+D). The previous sublinear-time algorithm can do so only when k=o(√n) [Thurimella PODC’95]. In fact, our algorithm can be turned into the first parallel algorithm with polylogarithmic depth and near-linear work. Previous near-linear work algorithms are essentially sequential and previous polylogarithmic-depth algorithms require Ω(mk) work in the worst case (e.g. [Karger, Motwani, STOC’93]). Second, we show that by combining the recent distributed expander decomposition technique of [Chang, Pettie, Zhang, SODA’19] with techniques from the sequential deterministic edge connectivity algorithm of [Kawarabayashi, Thorup, STOC’15], we can decompose the network into a sublinear number of clusters with small average diameter and without any mincut separating a cluster (except the “trivial” ones). This leads to a simplification of the Kawarabayashi-Thorup framework (except that we are randomized while they are deterministic). This might make this framework more useful in other models of computation. Finally, by extending the tree packing technique from [Karger STOC’96], we can find the minimum cut in time proportional to the number of components. As a byproduct of this technique, we obtain an Õ(n)-time algorithm for computing exact minimum cut for weighted graphs. article_processing_charge: No author: - first_name: Mohit full_name: Daga, Mohit last_name: Daga - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Danupon full_name: Nanongkai, Danupon last_name: Nanongkai - first_name: Thatchaphol full_name: Saranurak, Thatchaphol last_name: Saranurak citation: ama: 'Daga M, Henzinger MH, Nanongkai D, Saranurak T. Distributed edge connectivity in sublinear time. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery; 2019:343–354. doi:10.1145/3313276.3316346' apa: 'Daga, M., Henzinger, M. H., Nanongkai, D., & Saranurak, T. (2019). Distributed edge connectivity in sublinear time. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (pp. 343–354). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3313276.3316346' chicago: Daga, Mohit, Monika H Henzinger, Danupon Nanongkai, and Thatchaphol Saranurak. “Distributed Edge Connectivity in Sublinear Time.” In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 343–354. Association for Computing Machinery, 2019. https://doi.org/10.1145/3313276.3316346. ieee: M. Daga, M. H. Henzinger, D. Nanongkai, and T. Saranurak, “Distributed edge connectivity in sublinear time,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Phoenix, AZ, United States, 2019, pp. 343–354. ista: 'Daga M, Henzinger MH, Nanongkai D, Saranurak T. 2019. Distributed edge connectivity in sublinear time. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 343–354.' mla: Daga, Mohit, et al. “Distributed Edge Connectivity in Sublinear Time.” Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2019, pp. 343–354, doi:10.1145/3313276.3316346. short: M. Daga, M.H. Henzinger, D. Nanongkai, T. Saranurak, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2019, pp. 343–354. conference: end_date: 2019-06-26 location: Phoenix, AZ, United States name: 'STOC: Symposium on Theory of Computing' start_date: 2019-06-23 date_created: 2022-08-16T09:11:17Z date_published: 2019-06-01T00:00:00Z date_updated: 2023-02-17T10:26:25Z day: '01' doi: 10.1145/3313276.3316346 extern: '1' external_id: arxiv: - '1904.04341' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1904.04341 month: '06' oa: 1 oa_version: Preprint page: 343–354 publication: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing publication_identifier: isbn: - 978-1-4503-6705-9 issn: - 0737-8017 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Distributed edge connectivity in sublinear time type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '11871' abstract: - lang: eng text: "Many dynamic graph algorithms have an amortized update time, rather than a stronger worst-case guarantee. But amortized data structures are not suitable for real-time systems, where each individual operation has to be executed quickly. For this reason, there exist many recent randomized results that aim to provide a guarantee stronger than amortized expected. The strongest possible guarantee for a randomized algorithm is that it is always correct (Las Vegas), and has high-probability worst-case update time, which gives a bound on the time for each individual operation that holds with high probability.\r\n\r\nIn this paper we present the first polylogarithmic high-probability worst-case time bounds for the dynamic spanner and the dynamic maximal matching problem.\r\n\r\n1.\t\r\nFor dynamic spanner, the only known o(n) worst-case bounds were O(n3/4) high-probability worst-case update time for maintaining a 3-spanner, and O(n5/9) for maintaining a 5-spanner. We give a O(1)k log3(n) high-probability worst-case time bound for maintaining a (2k – 1)-spanner, which yields the first worst-case polylog update time for all constant k. (All the results above maintain the optimal tradeoff of stretch 2k – 1 and Õ(n1+1/k) edges.)\r\n\r\n2.\t\r\nFor dynamic maximal matching, or dynamic 2-approximate maximum matching, no algorithm with o(n) worst-case time bound was known and we present an algorithm with O(log5 (n)) high-probability worst-case time; similar worst-case bounds existed only for maintaining a matching that was (2 + ∊)-approximate, and hence not maximal.\r\n\r\nOur results are achieved using a new approach for converting amortized guarantees to worst-case ones for randomized data structures by going through a third type of guarantee, which is a middle ground between the two above: an algorithm is said to have worst-case expected update time α if for every update σ, the expected time to process σ is at most α. Although stronger than amortized expected, the worst-case expected guarantee does not resolve the fundamental problem of amortization: a worst-case expected update time of O(1) still allows for the possibility that every 1/f(n) updates requires Θ(f(n)) time to process, for arbitrarily high f(n). In this paper we present a black-box reduction that converts any data structure with worst-case expected update time into one with a high-probability worst-case update time: the query time remains the same, while the update time increases by a factor of O(log2(n)).\r\n\r\nThus we achieve our results in two steps: (1) First we show how to convert existing dynamic graph algorithms with amortized expected polylogarithmic running times into algorithms with worst-case expected polylogarithmic running times. (2) Then we use our black-box reduction to achieve the polylogarithmic high-probability worst-case time bound. All our algorithms are Las-Vegas-type algorithms." article_processing_charge: No author: - first_name: Aaron full_name: Bernstein, Aaron last_name: Bernstein - first_name: Sebastian full_name: Forster, Sebastian last_name: Forster - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 citation: ama: 'Bernstein A, Forster S, Henzinger MH. A deamortization approach for dynamic spanner and dynamic maximal matching. In: 30th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2019:1899-1918. doi:10.1137/1.9781611975482.115' apa: 'Bernstein, A., Forster, S., & Henzinger, M. H. (2019). A deamortization approach for dynamic spanner and dynamic maximal matching. In 30th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1899–1918). San Diego, CA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975482.115' chicago: Bernstein, Aaron, Sebastian Forster, and Monika H Henzinger. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.” In 30th Annual ACM-SIAM Symposium on Discrete Algorithms, 1899–1918. Society for Industrial and Applied Mathematics, 2019. https://doi.org/10.1137/1.9781611975482.115. ieee: A. Bernstein, S. Forster, and M. H. Henzinger, “A deamortization approach for dynamic spanner and dynamic maximal matching,” in 30th Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States, 2019, pp. 1899–1918. ista: 'Bernstein A, Forster S, Henzinger MH. 2019. A deamortization approach for dynamic spanner and dynamic maximal matching. 30th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1899–1918.' mla: Bernstein, Aaron, et al. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.” 30th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2019, pp. 1899–918, doi:10.1137/1.9781611975482.115. short: A. Bernstein, S. Forster, M.H. Henzinger, in:, 30th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2019, pp. 1899–1918. conference: end_date: 2019-01-09 location: San Diego, CA, United States name: 'SODA: Symposium on Discrete Algorithms' start_date: 2019-01-06 date_created: 2022-08-16T09:50:33Z date_published: 2019-01-01T00:00:00Z date_updated: 2023-02-21T16:31:21Z day: '01' doi: 10.1137/1.9781611975482.115 extern: '1' external_id: arxiv: - '1810.10932' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1810.10932 month: '01' oa: 1 oa_version: Preprint page: 1899-1918 publication: 30th Annual ACM-SIAM Symposium on Discrete Algorithms publication_identifier: eisbn: - 978-1-61197-548-2 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' related_material: record: - id: '11871' relation: earlier_version status: public scopus_import: '1' status: public title: A deamortization approach for dynamic spanner and dynamic maximal matching type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '11898' abstract: - lang: eng text: "We build upon the recent papers by Weinstein and Yu (FOCS'16), Larsen (FOCS'12), and Clifford et al. (FOCS'15) to present a general framework that gives amortized lower bounds on the update and query times of dynamic data structures. Using our framework, we present two concrete results.\r\n(1) For the dynamic polynomial evaluation problem, where the polynomial is defined over a finite field of size n1+Ω(1) and has degree n, any dynamic data structure must either have an amortized update time of Ω((lgn/lglgn)2) or an amortized query time of Ω((lgn/lglgn)2).\r\n(2) For the dynamic online matrix vector multiplication problem, where we get an n×n matrix whose entires are drawn from a finite field of size nΘ(1), any dynamic data structure must either have an amortized update time of Ω((lgn/lglgn)2) or an amortized query time of Ω(n⋅(lgn/lglgn)2).\r\nFor these two problems, the previous works by Larsen (FOCS'12) and Clifford et al. (FOCS'15) gave the same lower bounds, but only for worst case update and query times. Our bounds match the highest unconditional lower bounds known till date for any dynamic problem in the cell-probe model." article_processing_charge: No article_type: original author: - first_name: Sayan full_name: Bhattacharya, Sayan last_name: Bhattacharya - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Stefan full_name: Neumann, Stefan last_name: Neumann citation: ama: Bhattacharya S, Henzinger MH, Neumann S. New amortized cell-probe lower bounds for dynamic problems. Theoretical Computer Science. 2019;779:72-87. doi:10.1016/j.tcs.2019.01.043 apa: Bhattacharya, S., Henzinger, M. H., & Neumann, S. (2019). New amortized cell-probe lower bounds for dynamic problems. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2019.01.043 chicago: Bhattacharya, Sayan, Monika H Henzinger, and Stefan Neumann. “New Amortized Cell-Probe Lower Bounds for Dynamic Problems.” Theoretical Computer Science. Elsevier, 2019. https://doi.org/10.1016/j.tcs.2019.01.043. ieee: S. Bhattacharya, M. H. Henzinger, and S. Neumann, “New amortized cell-probe lower bounds for dynamic problems,” Theoretical Computer Science, vol. 779. Elsevier, pp. 72–87, 2019. ista: Bhattacharya S, Henzinger MH, Neumann S. 2019. New amortized cell-probe lower bounds for dynamic problems. Theoretical Computer Science. 779, 72–87. mla: Bhattacharya, Sayan, et al. “New Amortized Cell-Probe Lower Bounds for Dynamic Problems.” Theoretical Computer Science, vol. 779, Elsevier, 2019, pp. 72–87, doi:10.1016/j.tcs.2019.01.043. short: S. Bhattacharya, M.H. Henzinger, S. Neumann, Theoretical Computer Science 779 (2019) 72–87. date_created: 2022-08-17T09:02:15Z date_published: 2019-08-02T00:00:00Z date_updated: 2022-09-09T11:29:04Z day: '02' doi: 10.1016/j.tcs.2019.01.043 extern: '1' external_id: arxiv: - '1902.02304' intvolume: ' 779' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1902.02304 month: '08' oa: 1 oa_version: Preprint page: 72-87 publication: Theoretical Computer Science publication_identifier: issn: - 0304-3975 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: New amortized cell-probe lower bounds for dynamic problems type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 779 year: '2019' ... --- _id: '11957' abstract: - lang: eng text: Cross-coupling reactions mediated by dual nickel/photocatalysis are synthetically attractive but rely mainly on expensive, non-recyclable noble-metal complexes as photocatalysts. Heterogeneous semiconductors, which are commonly used for artificial photosynthesis and wastewater treatment, are a sustainable alternative. Graphitic carbon nitrides, a class of metal-free polymers that can be easily prepared from bulk chemicals, are heterogeneous semiconductors with high potential for photocatalytic organic transformations. Here, we demonstrate that graphitic carbon nitrides in combination with nickel catalysis can induce selective C−O cross-couplings of carboxylic acids with aryl halides, yielding the respective aryl esters in excellent yield and selectivity. The heterogeneous organic photocatalyst exhibits a broad substrate scope, is able to harvest green light, and can be recycled multiple times. In situ FTIR was used to track the reaction progress to study this transformation at different irradiation wavelengths and reaction scales. article_processing_charge: No article_type: letter_note author: - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X - first_name: Jamal A. full_name: Malik, Jamal A. last_name: Malik - first_name: Cristian full_name: Cavedon, Cristian last_name: Cavedon - first_name: Sebastian full_name: Gisbertz, Sebastian last_name: Gisbertz - first_name: Aleksandr full_name: Savateev, Aleksandr last_name: Savateev - first_name: Daniel full_name: Cruz, Daniel last_name: Cruz - first_name: Tobias full_name: Heil, Tobias last_name: Heil - first_name: Guigang full_name: Zhang, Guigang last_name: Zhang - first_name: Peter H. full_name: Seeberger, Peter H. last_name: Seeberger citation: ama: 'Pieber B, Malik JA, Cavedon C, et al. Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides. Angewandte Chemie International Edition. 2019;58(28):9575-9580. doi:10.1002/anie.201902785' apa: 'Pieber, B., Malik, J. A., Cavedon, C., Gisbertz, S., Savateev, A., Cruz, D., … Seeberger, P. H. (2019). Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201902785' chicago: 'Pieber, Bartholomäus, Jamal A. Malik, Cristian Cavedon, Sebastian Gisbertz, Aleksandr Savateev, Daniel Cruz, Tobias Heil, Guigang Zhang, and Peter H. Seeberger. “Semi‐heterogeneous Dual Nickel/Photocatalysis Using Carbon Nitrides: Esterification of Carboxylic Acids with Aryl Halides.” Angewandte Chemie International Edition. Wiley, 2019. https://doi.org/10.1002/anie.201902785.' ieee: 'B. Pieber et al., “Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides,” Angewandte Chemie International Edition, vol. 58, no. 28. Wiley, pp. 9575–9580, 2019.' ista: 'Pieber B, Malik JA, Cavedon C, Gisbertz S, Savateev A, Cruz D, Heil T, Zhang G, Seeberger PH. 2019. Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides. Angewandte Chemie International Edition. 58(28), 9575–9580.' mla: 'Pieber, Bartholomäus, et al. “Semi‐heterogeneous Dual Nickel/Photocatalysis Using Carbon Nitrides: Esterification of Carboxylic Acids with Aryl Halides.” Angewandte Chemie International Edition, vol. 58, no. 28, Wiley, 2019, pp. 9575–80, doi:10.1002/anie.201902785.' short: B. Pieber, J.A. Malik, C. Cavedon, S. Gisbertz, A. Savateev, D. Cruz, T. Heil, G. Zhang, P.H. Seeberger, Angewandte Chemie International Edition 58 (2019) 9575–9580. date_created: 2022-08-24T10:50:19Z date_published: 2019-07-08T00:00:00Z date_updated: 2023-02-21T10:09:16Z day: '08' doi: 10.1002/anie.201902785 extern: '1' external_id: pmid: - '31050132' intvolume: ' 58' issue: '28' language: - iso: eng month: '07' oa_version: None page: 9575-9580 pmid: 1 publication: Angewandte Chemie International Edition publication_identifier: eissn: - 1521-3773 issn: - 1433-7851 publication_status: published publisher: Wiley quality_controlled: '1' scopus_import: '1' status: public title: 'Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 58 year: '2019' ... --- _id: '11984' abstract: - lang: eng text: Differentially protected galactosamine building blocks are key components for the synthesis of human and bacterial oligosaccharides. The azidophenylselenylation of 3,4,6-tri-O-acetyl-d-galactal provides straightforward access to the corresponding 2-nitrogenated glycoside. Poor reproducibility and the use of azides that lead to the formation of potentially explosive and toxic species limit the scalability of this reaction and render it a bottleneck for carbohydrate synthesis. Here, we present a method for the safe, efficient, and reliable azidophenylselenylation of 3,4,6-tri-O-acetyl-d-galactal at room temperature, using continuous flow chemistry. Careful analysis of the transformation resulted in reaction conditions that produce minimal side products while the reaction time was reduced drastically when compared to batch reactions. The flow setup is readily scalable to process 5 mmol of galactal in 3 h, producing 1.2 mmol/h of product. article_processing_charge: No article_type: letter_note author: - first_name: Mónica full_name: Guberman, Mónica last_name: Guberman - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X - first_name: Peter H. full_name: Seeberger, Peter H. last_name: Seeberger citation: ama: Guberman M, Pieber B, Seeberger PH. Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. Organic Process Research and Development. 2019;23(12):2764-2770. doi:10.1021/acs.oprd.9b00456 apa: Guberman, M., Pieber, B., & Seeberger, P. H. (2019). Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. Organic Process Research and Development. American Chemical Society. https://doi.org/10.1021/acs.oprd.9b00456 chicago: Guberman, Mónica, Bartholomäus Pieber, and Peter H. Seeberger. “Safe and Scalable Continuous Flow Azidophenylselenylation of Galactal to Prepare Galactosamine Building Blocks.” Organic Process Research and Development. American Chemical Society, 2019. https://doi.org/10.1021/acs.oprd.9b00456. ieee: M. Guberman, B. Pieber, and P. H. Seeberger, “Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks,” Organic Process Research and Development, vol. 23, no. 12. American Chemical Society, pp. 2764–2770, 2019. ista: Guberman M, Pieber B, Seeberger PH. 2019. Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks. Organic Process Research and Development. 23(12), 2764–2770. mla: Guberman, Mónica, et al. “Safe and Scalable Continuous Flow Azidophenylselenylation of Galactal to Prepare Galactosamine Building Blocks.” Organic Process Research and Development, vol. 23, no. 12, American Chemical Society, 2019, pp. 2764–70, doi:10.1021/acs.oprd.9b00456. short: M. Guberman, B. Pieber, P.H. Seeberger, Organic Process Research and Development 23 (2019) 2764–2770. date_created: 2022-08-25T11:30:33Z date_published: 2019-12-20T00:00:00Z date_updated: 2023-02-21T10:10:23Z day: '20' doi: 10.1021/acs.oprd.9b00456 extern: '1' intvolume: ' 23' issue: '12' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1021/acs.oprd.9b00456 month: '12' oa: 1 oa_version: Published Version page: 2764-2770 publication: Organic Process Research and Development publication_identifier: eissn: - 1520-586X issn: - 1083-6160 publication_status: published publisher: American Chemical Society quality_controlled: '1' scopus_import: '1' status: public title: Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 23 year: '2019' ... --- _id: '11982' abstract: - lang: eng text: A carbon nitride material can be combined with homogeneous nickel catalysts for light-mediated cross-couplings of aryl bromides with alcohols under mild conditions. The metal-free heterogeneous semiconductor is fully recyclable and couples a broad range of electron-poor aryl bromides with primary and secondary alcohols as well as water. The application for intramolecular reactions and the synthesis of active pharmaceutical ingredients was demonstrated. The catalytic protocol is applicable for the coupling of aryl iodides with thiols as well. article_processing_charge: No article_type: letter_note author: - first_name: Cristian full_name: Cavedon, Cristian last_name: Cavedon - first_name: Amiera full_name: Madani, Amiera last_name: Madani - first_name: Peter H. full_name: Seeberger, Peter H. last_name: Seeberger - first_name: Bartholomäus full_name: Pieber, Bartholomäus id: 93e5e5b2-0da6-11ed-8a41-af589a024726 last_name: Pieber orcid: 0000-0001-8689-388X citation: ama: Cavedon C, Madani A, Seeberger PH, Pieber B. Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. Organic Letters. 2019;21(13):5331-5334. doi:10.1021/acs.orglett.9b01957 apa: Cavedon, C., Madani, A., Seeberger, P. H., & Pieber, B. (2019). Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. Organic Letters. American Chemical Society. https://doi.org/10.1021/acs.orglett.9b01957 chicago: Cavedon, Cristian, Amiera Madani, Peter H. Seeberger, and Bartholomäus Pieber. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification Using Carbon Nitrides.” Organic Letters. American Chemical Society, 2019. https://doi.org/10.1021/acs.orglett.9b01957. ieee: C. Cavedon, A. Madani, P. H. Seeberger, and B. Pieber, “Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides,” Organic Letters, vol. 21, no. 13. American Chemical Society, pp. 5331–5334, 2019. ista: Cavedon C, Madani A, Seeberger PH, Pieber B. 2019. Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides. Organic Letters. 21(13), 5331–5334. mla: Cavedon, Cristian, et al. “Semiheterogeneous Dual Nickel/Photocatalytic (Thio)Etherification Using Carbon Nitrides.” Organic Letters, vol. 21, no. 13, American Chemical Society, 2019, pp. 5331–34, doi:10.1021/acs.orglett.9b01957. short: C. Cavedon, A. Madani, P.H. Seeberger, B. Pieber, Organic Letters 21 (2019) 5331–5334. date_created: 2022-08-25T11:18:00Z date_published: 2019-07-05T00:00:00Z date_updated: 2023-02-21T10:10:19Z day: '05' doi: 10.1021/acs.orglett.9b01957 extern: '1' external_id: pmid: - '31247752' intvolume: ' 21' issue: '13' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1021/acs.orglett.9b01957 month: '07' oa: 1 oa_version: Published Version page: 5331-5334 pmid: 1 publication: Organic Letters publication_identifier: eissn: - 1523-7052 issn: - 1523-7060 publication_status: published publisher: American Chemical Society quality_controlled: '1' scopus_import: '1' status: public title: Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 21 year: '2019' ... --- _id: '170' abstract: - lang: eng text: Upper and lower bounds, of the expected order of magnitude, are obtained for the number of rational points of bounded height on any quartic del Pezzo surface over ℚ that contains a conic defined over ℚ . 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: Efthymios full_name: Sofos, Efthymios last_name: Sofos citation: ama: Browning TD, Sofos E. Counting rational points on quartic del Pezzo surfaces with a rational conic. Mathematische Annalen. 2019;373(3-4):977-1016. doi:10.1007/s00208-018-1716-6 apa: Browning, T. D., & Sofos, E. (2019). Counting rational points on quartic del Pezzo surfaces with a rational conic. Mathematische Annalen. Springer Nature. https://doi.org/10.1007/s00208-018-1716-6 chicago: Browning, Timothy D, and Efthymios Sofos. “Counting Rational Points on Quartic Del Pezzo Surfaces with a Rational Conic.” Mathematische Annalen. Springer Nature, 2019. https://doi.org/10.1007/s00208-018-1716-6. ieee: T. D. Browning and E. Sofos, “Counting rational points on quartic del Pezzo surfaces with a rational conic,” Mathematische Annalen, vol. 373, no. 3–4. Springer Nature, pp. 977–1016, 2019. ista: Browning TD, Sofos E. 2019. Counting rational points on quartic del Pezzo surfaces with a rational conic. Mathematische Annalen. 373(3–4), 977–1016. mla: Browning, Timothy D., and Efthymios Sofos. “Counting Rational Points on Quartic Del Pezzo Surfaces with a Rational Conic.” Mathematische Annalen, vol. 373, no. 3–4, Springer Nature, 2019, pp. 977–1016, doi:10.1007/s00208-018-1716-6. short: T.D. Browning, E. Sofos, Mathematische Annalen 373 (2019) 977–1016. date_created: 2018-12-11T11:44:59Z date_published: 2019-04-01T00:00:00Z date_updated: 2021-01-12T06:52:37Z day: '01' ddc: - '510' doi: 10.1007/s00208-018-1716-6 extern: '1' external_id: arxiv: - '1609.09057' file: - access_level: open_access checksum: 4061dc2fe99bee25d9adf2d2018cf608 content_type: application/pdf creator: dernst date_created: 2019-05-23T07:53:27Z date_updated: 2020-07-14T12:45:12Z file_id: '6479' file_name: 2019_MathAnnalen_Browning.pdf file_size: 712847 relation: main_file file_date_updated: 2020-07-14T12:45:12Z has_accepted_license: '1' intvolume: ' 373' issue: 3-4 language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '04' oa: 1 oa_version: Published Version page: 977-1016 publication: Mathematische Annalen publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Counting rational points on quartic del Pezzo surfaces with a rational conic 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: 373 year: '2019' ... --- _id: '441' article_processing_charge: No article_type: original author: - first_name: Nikita full_name: Kalinin, Nikita last_name: Kalinin - first_name: Mikhail full_name: Shkolnikov, Mikhail id: 35084A62-F248-11E8-B48F-1D18A9856A87 last_name: Shkolnikov orcid: 0000-0002-4310-178X citation: ama: Kalinin N, Shkolnikov M. Tropical formulae for summation over a part of SL(2,Z). European Journal of Mathematics. 2019;5(3):909–928. doi:10.1007/s40879-018-0218-0 apa: Kalinin, N., & Shkolnikov, M. (2019). Tropical formulae for summation over a part of SL(2,Z). European Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s40879-018-0218-0 chicago: Kalinin, Nikita, and Mikhail Shkolnikov. “Tropical Formulae for Summation over a Part of SL(2,Z).” European Journal of Mathematics. Springer Nature, 2019. https://doi.org/10.1007/s40879-018-0218-0. ieee: N. Kalinin and M. Shkolnikov, “Tropical formulae for summation over a part of SL(2,Z),” European Journal of Mathematics, vol. 5, no. 3. Springer Nature, pp. 909–928, 2019. ista: Kalinin N, Shkolnikov M. 2019. Tropical formulae for summation over a part of SL(2,Z). European Journal of Mathematics. 5(3), 909–928. mla: Kalinin, Nikita, and Mikhail Shkolnikov. “Tropical Formulae for Summation over a Part of SL(2,Z).” European Journal of Mathematics, vol. 5, no. 3, Springer Nature, 2019, pp. 909–928, doi:10.1007/s40879-018-0218-0. short: N. Kalinin, M. Shkolnikov, European Journal of Mathematics 5 (2019) 909–928. date_created: 2018-12-11T11:46:29Z date_published: 2019-09-15T00:00:00Z date_updated: 2021-01-12T07:56:46Z day: '15' department: - _id: TaHa doi: 10.1007/s40879-018-0218-0 ec_funded: 1 external_id: arxiv: - '1711.02089' intvolume: ' 5' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1711.02089 month: '09' oa: 1 oa_version: Preprint page: 909–928 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: European Journal of Mathematics publication_identifier: eissn: - 2199-6768 issn: - 2199-675X publication_status: published publisher: Springer Nature publist_id: '7382' quality_controlled: '1' scopus_import: 1 status: public title: Tropical formulae for summation over a part of SL(2,Z) type: journal_article user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425 volume: 5 year: '2019' ... --- _id: '5793' abstract: - lang: eng text: The transcription coactivator, Yes-associated protein (YAP), which is a nuclear effector of the Hippo signaling pathway, has been shown to be a mechano-transducer. By using mutant fish and human 3D spheroids, we have recently demonstrated that YAP is also a mechano-effector. YAP functions in three-dimensional (3D) morphogenesis of organ and global body shape by controlling actomyosin-mediated tissue tension. In this chapter, we present a platform that links the findings in fish embryos with human cells. The protocols for analyzing tissue tension-mediated global body shape/organ morphogenesis in vivo and ex vivo using medaka fish embryos and in vitro using human cell spheroids represent useful tools for unraveling the molecular mechanisms by which YAP functions in regulating global body/organ morphogenesis. alternative_title: - MIMB author: - first_name: Yoichi full_name: Asaoka, Yoichi last_name: Asaoka - first_name: Hitoshi full_name: Morita, Hitoshi last_name: Morita - first_name: Hiroko full_name: Furumoto, Hiroko last_name: Furumoto - first_name: Carl-Philipp J full_name: Heisenberg, Carl-Philipp J id: 39427864-F248-11E8-B48F-1D18A9856A87 last_name: Heisenberg orcid: 0000-0002-0912-4566 - first_name: Makoto full_name: Furutani-Seiki, Makoto last_name: Furutani-Seiki citation: ama: 'Asaoka Y, Morita H, Furumoto H, Heisenberg C-PJ, Furutani-Seiki M. Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids. In: Hergovich A, ed. The Hippo Pathway. Vol 1893. Methods in Molecular Biology. Springer; 2019:167-181. doi:10.1007/978-1-4939-8910-2_14' apa: Asaoka, Y., Morita, H., Furumoto, H., Heisenberg, C.-P. J., & Furutani-Seiki, M. (2019). Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids. In A. Hergovich (Ed.), The hippo pathway (Vol. 1893, pp. 167–181). Springer. https://doi.org/10.1007/978-1-4939-8910-2_14 chicago: Asaoka, Yoichi, Hitoshi Morita, Hiroko Furumoto, Carl-Philipp J Heisenberg, and Makoto Furutani-Seiki. “Studying YAP-Mediated 3D Morphogenesis Using Fish Embryos and Human Spheroids.” In The Hippo Pathway, edited by Alexander Hergovich, 1893:167–81. Methods in Molecular Biology. Springer, 2019. https://doi.org/10.1007/978-1-4939-8910-2_14. ieee: Y. Asaoka, H. Morita, H. Furumoto, C.-P. J. Heisenberg, and M. Furutani-Seiki, “Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids,” in The hippo pathway, vol. 1893, A. Hergovich, Ed. Springer, 2019, pp. 167–181. ista: 'Asaoka Y, Morita H, Furumoto H, Heisenberg C-PJ, Furutani-Seiki M. 2019.Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids. In: The hippo pathway. MIMB, vol. 1893, 167–181.' mla: Asaoka, Yoichi, et al. “Studying YAP-Mediated 3D Morphogenesis Using Fish Embryos and Human Spheroids.” The Hippo Pathway, edited by Alexander Hergovich, vol. 1893, Springer, 2019, pp. 167–81, doi:10.1007/978-1-4939-8910-2_14. short: Y. Asaoka, H. Morita, H. Furumoto, C.-P.J. Heisenberg, M. Furutani-Seiki, in:, A. Hergovich (Ed.), The Hippo Pathway, Springer, 2019, pp. 167–181. date_created: 2019-01-06T22:59:11Z date_published: 2019-01-01T00:00:00Z date_updated: 2021-01-12T08:03:30Z day: '01' department: - _id: CaHe doi: 10.1007/978-1-4939-8910-2_14 editor: - first_name: Alexander full_name: Hergovich, Alexander last_name: Hergovich intvolume: ' 1893' language: - iso: eng month: '01' oa_version: None page: 167-181 publication: The hippo pathway publication_identifier: isbn: - 978-1-4939-8909-6 publication_status: published publisher: Springer quality_controlled: '1' scopus_import: 1 series_title: Methods in Molecular Biology status: public title: Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 1893 year: '2019' ... --- _id: '5887' abstract: - lang: eng text: 'Cryptographic security is usually defined as a guarantee that holds except when a bad event with negligible probability occurs, and nothing is guaranteed in that bad case. However, in settings where such failure can happen with substantial probability, one needs to provide guarantees even for the bad case. A typical example is where a (possibly weak) password is used instead of a secure cryptographic key to protect a session, the bad event being that the adversary correctly guesses the password. In a situation with multiple such sessions, a per-session guarantee is desired: any session for which the password has not been guessed remains secure, independently of whether other sessions have been compromised. A new formalism for stating such gracefully degrading security guarantees is introduced and applied to analyze the examples of password-based message authentication and password-based encryption. While a natural per-message guarantee is achieved for authentication, the situation of password-based encryption is more delicate: a per-session confidentiality guarantee only holds against attackers for which the distribution of password-guessing effort over the sessions is known in advance. In contrast, for more general attackers without such a restriction, a strong, composable notion of security cannot be achieved.' article_processing_charge: No article_type: original author: - first_name: Gregory full_name: Demay, Gregory last_name: Demay - first_name: Peter full_name: Gazi, Peter id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87 last_name: Gazi - first_name: Ueli full_name: Maurer, Ueli last_name: Maurer - first_name: Bjorn full_name: Tackmann, Bjorn last_name: Tackmann citation: ama: 'Demay G, Gazi P, Maurer U, Tackmann B. Per-session security: Password-based cryptography revisited. Journal of Computer Security. 2019;27(1):75-111. doi:10.3233/JCS-181131' apa: 'Demay, G., Gazi, P., Maurer, U., & Tackmann, B. (2019). Per-session security: Password-based cryptography revisited. Journal of Computer Security. IOS Press. https://doi.org/10.3233/JCS-181131' chicago: 'Demay, Gregory, Peter Gazi, Ueli Maurer, and Bjorn Tackmann. “Per-Session Security: Password-Based Cryptography Revisited.” Journal of Computer Security. IOS Press, 2019. https://doi.org/10.3233/JCS-181131.' ieee: 'G. Demay, P. Gazi, U. Maurer, and B. Tackmann, “Per-session security: Password-based cryptography revisited,” Journal of Computer Security, vol. 27, no. 1. IOS Press, pp. 75–111, 2019.' ista: 'Demay G, Gazi P, Maurer U, Tackmann B. 2019. Per-session security: Password-based cryptography revisited. Journal of Computer Security. 27(1), 75–111.' mla: 'Demay, Gregory, et al. “Per-Session Security: Password-Based Cryptography Revisited.” Journal of Computer Security, vol. 27, no. 1, IOS Press, 2019, pp. 75–111, doi:10.3233/JCS-181131.' short: G. Demay, P. Gazi, U. Maurer, B. Tackmann, Journal of Computer Security 27 (2019) 75–111. date_created: 2019-01-27T22:59:10Z date_published: 2019-01-01T00:00:00Z date_updated: 2021-01-12T08:05:08Z day: '1' department: - _id: KrPi doi: 10.3233/JCS-181131 ec_funded: 1 intvolume: ' 27' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2016/166 month: '01' oa: 1 oa_version: Preprint page: 75-111 project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication: Journal of Computer Security publication_identifier: issn: - 0926227X publication_status: published publisher: IOS Press quality_controlled: '1' scopus_import: '1' status: public title: 'Per-session security: Password-based cryptography revisited' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 27 year: '2019' ... --- _id: '6163' abstract: - lang: eng text: We propose a new non-orthogonal basis to express the 3D Euclidean space in terms of a regular grid. Every grid point, each represented by integer 3-coordinates, corresponds to rhombic dodecahedron centroid. Rhombic dodecahedron is a space filling polyhedron which represents the close packing of spheres in 3D space and the Voronoi structures of the face centered cubic (FCC) lattice. In order to illustrate the interest of the new coordinate system, we propose the characterization of 3D digital plane with its topological features, such as the interrelation between the thickness of the digital plane and the separability constraint we aim to obtain. A characterization of a 3D digital sphere with relevant topological features is proposed as well with the help of a 48 symmetry that comes with the new coordinate system. alternative_title: - LNCS article_processing_charge: No author: - first_name: Ranita full_name: Biswas, Ranita id: 3C2B033E-F248-11E8-B48F-1D18A9856A87 last_name: Biswas orcid: 0000-0002-5372-7890 - first_name: Gaëlle full_name: Largeteau-Skapin, Gaëlle last_name: Largeteau-Skapin - first_name: Rita full_name: Zrour, Rita last_name: Zrour - first_name: Eric full_name: Andres, Eric last_name: Andres citation: ama: 'Biswas R, Largeteau-Skapin G, Zrour R, Andres E. Rhombic dodecahedron grid—coordinate system and 3D digital object definitions. In: 21st IAPR International Conference on Discrete Geometry for Computer Imagery. Vol 11414. Berlin, Heidelberg: Springer Berlin Heidelberg; 2019:27-37. doi:10.1007/978-3-030-14085-4_3' apa: 'Biswas, R., Largeteau-Skapin, G., Zrour, R., & Andres, E. (2019). Rhombic dodecahedron grid—coordinate system and 3D digital object definitions. In 21st IAPR International Conference on Discrete Geometry for Computer Imagery (Vol. 11414, pp. 27–37). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-030-14085-4_3' chicago: 'Biswas, Ranita, Gaëlle Largeteau-Skapin, Rita Zrour, and Eric Andres. “Rhombic Dodecahedron Grid—Coordinate System and 3D Digital Object Definitions.” In 21st IAPR International Conference on Discrete Geometry for Computer Imagery, 11414:27–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2019. https://doi.org/10.1007/978-3-030-14085-4_3.' ieee: R. Biswas, G. Largeteau-Skapin, R. Zrour, and E. Andres, “Rhombic dodecahedron grid—coordinate system and 3D digital object definitions,” in 21st IAPR International Conference on Discrete Geometry for Computer Imagery, Marne-la-Vallée, France, 2019, vol. 11414, pp. 27–37. ista: 'Biswas R, Largeteau-Skapin G, Zrour R, Andres E. 2019. Rhombic dodecahedron grid—coordinate system and 3D digital object definitions. 21st IAPR International Conference on Discrete Geometry for Computer Imagery. DGCI: International Conference on Discrete Geometry for Computer Imagery, LNCS, vol. 11414, 27–37.' mla: Biswas, Ranita, et al. “Rhombic Dodecahedron Grid—Coordinate System and 3D Digital Object Definitions.” 21st IAPR International Conference on Discrete Geometry for Computer Imagery, vol. 11414, Springer Berlin Heidelberg, 2019, pp. 27–37, doi:10.1007/978-3-030-14085-4_3. short: R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, in:, 21st IAPR International Conference on Discrete Geometry for Computer Imagery, Springer Berlin Heidelberg, Berlin, Heidelberg, 2019, pp. 27–37. conference: end_date: 2019-03-28 location: Marne-la-Vallée, France name: 'DGCI: International Conference on Discrete Geometry for Computer Imagery' start_date: 2019-03-26 date_created: 2019-03-21T12:12:19Z date_published: 2019-02-23T00:00:00Z date_updated: 2022-01-27T14:25:17Z day: '23' doi: 10.1007/978-3-030-14085-4_3 extern: '1' intvolume: ' 11414' language: - iso: eng month: '02' oa_version: None page: 27-37 place: Berlin, Heidelberg publication: 21st IAPR International Conference on Discrete Geometry for Computer Imagery publication_identifier: isbn: - 978-3-6624-6446-5 - 978-3-6624-6447-2 issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Berlin Heidelberg quality_controlled: '1' status: public title: Rhombic dodecahedron grid—coordinate system and 3D digital object definitions type: conference user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 11414 year: '2019' ... --- _id: '6515' abstract: - lang: eng text: We give non-degeneracy criteria for Riemannian simplices based on simplices in spaces of constant sectional curvature. It extends previous work on Riemannian simplices, where we developed Riemannian simplices with respect to Euclidean reference simplices. The criteria we give in this article are in terms of quality measures for spaces of constant curvature that we develop here. We see that simplices in spaces that have nearly constant curvature, are already non-degenerate under very weak quality demands. This is of importance because it allows for sampling of Riemannian manifolds based on anisotropy of the manifold and not (absolute) curvature. author: - first_name: Ramsay full_name: Dyer, Ramsay last_name: Dyer - first_name: Gert full_name: Vegter, Gert last_name: Vegter - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: Dyer R, Vegter G, Wintraecken M. Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . 2019;10(1):223–256. doi:10.20382/jocg.v10i1a9 apa: Dyer, R., Vegter, G., & Wintraecken, M. (2019). Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . Carleton University. https://doi.org/10.20382/jocg.v10i1a9 chicago: Dyer, Ramsay, Gert Vegter, and Mathijs Wintraecken. “Simplices Modelled on Spaces of Constant Curvature.” Journal of Computational Geometry . Carleton University, 2019. https://doi.org/10.20382/jocg.v10i1a9. ieee: R. Dyer, G. Vegter, and M. Wintraecken, “Simplices modelled on spaces of constant curvature,” Journal of Computational Geometry , vol. 10, no. 1. Carleton University, pp. 223–256, 2019. ista: Dyer R, Vegter G, Wintraecken M. 2019. Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . 10(1), 223–256. mla: Dyer, Ramsay, et al. “Simplices Modelled on Spaces of Constant Curvature.” Journal of Computational Geometry , vol. 10, no. 1, Carleton University, 2019, pp. 223–256, doi:10.20382/jocg.v10i1a9. short: R. Dyer, G. Vegter, M. Wintraecken, Journal of Computational Geometry 10 (2019) 223–256. date_created: 2019-06-03T09:35:33Z date_published: 2019-07-01T00:00:00Z date_updated: 2021-01-12T08:07:50Z day: '01' ddc: - '510' department: - _id: HeEd doi: 10.20382/jocg.v10i1a9 ec_funded: 1 file: - access_level: open_access checksum: 57b4df2f16a74eb499734ec8ee240178 content_type: application/pdf creator: mwintrae date_created: 2019-06-03T09:30:01Z date_updated: 2020-07-14T12:47:32Z file_id: '6516' file_name: mainJournalFinal.pdf file_size: 2170882 relation: main_file file_date_updated: 2020-07-14T12:47:32Z has_accepted_license: '1' intvolume: ' 10' issue: '1' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 223–256 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: 'Journal of Computational Geometry ' publication_identifier: issn: - 1920-180X publication_status: published publisher: Carleton University quality_controlled: '1' scopus_import: 1 status: public title: Simplices modelled on spaces of constant curvature 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: 10 year: '2019' ... --- _id: '6528' abstract: - lang: eng text: We construct a verifiable delay function (VDF) by showing how the Rivest-Shamir-Wagner time-lock puzzle can be made publicly verifiable. Concretely, we give a statistically sound public-coin protocol to prove that a tuple (N,x,T,y) satisfies y=x2T (mod N) where the prover doesn’t know the factorization of N and its running time is dominated by solving the puzzle, that is, compute x2T, which is conjectured to require T sequential squarings. To get a VDF we make this protocol non-interactive using the Fiat-Shamir heuristic.The motivation for this work comes from the Chia blockchain design, which uses a VDF as akey ingredient. For typical parameters (T≤2 40, N= 2048), our proofs are of size around 10K B, verification cost around three RSA exponentiations and computing the proof is 8000 times faster than solving the puzzle even without any parallelism. alternative_title: - LIPIcs article_number: '60' article_processing_charge: No author: - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 citation: ama: 'Pietrzak KZ. Simple verifiable delay functions. In: 10th Innovations in Theoretical Computer Science Conference. Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.ITCS.2019.60' apa: 'Pietrzak, K. Z. (2019). Simple verifiable delay functions. In 10th Innovations in Theoretical Computer Science Conference (Vol. 124). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.60' chicago: Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” In 10th Innovations in Theoretical Computer Science Conference, Vol. 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ITCS.2019.60. ieee: K. Z. Pietrzak, “Simple verifiable delay functions,” in 10th Innovations in Theoretical Computer Science Conference, San Diego, CA, United States, 2019, vol. 124. ista: 'Pietrzak KZ. 2019. Simple verifiable delay functions. 10th Innovations in Theoretical Computer Science Conference. ITCS 2019: Innovations in Theoretical Computer Science, LIPIcs, vol. 124, 60.' mla: Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” 10th Innovations in Theoretical Computer Science Conference, vol. 124, 60, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ITCS.2019.60. short: K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. conference: end_date: 2019-01-12 location: San Diego, CA, United States name: 'ITCS 2019: Innovations in Theoretical Computer Science' start_date: 2019-01-10 date_created: 2019-06-06T14:12:36Z date_published: 2019-01-10T00:00:00Z date_updated: 2021-01-12T08:07:53Z day: '10' ddc: - '000' department: - _id: KrPi doi: 10.4230/LIPICS.ITCS.2019.60 ec_funded: 1 file: - access_level: open_access checksum: f0ae1bb161431d9db3dea5ace082bfb5 content_type: application/pdf creator: dernst date_created: 2019-06-06T14:22:04Z date_updated: 2020-07-14T12:47:33Z file_id: '6529' file_name: 2019_LIPIcs_Pietrzak.pdf file_size: 558770 relation: main_file file_date_updated: 2020-07-14T12:47:33Z has_accepted_license: '1' intvolume: ' 124' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2018/627 month: '01' oa: 1 oa_version: Published Version project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication: 10th Innovations in Theoretical Computer Science Conference publication_identifier: isbn: - 978-3-95977-095-8 issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Simple verifiable delay functions 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: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 124 year: '2019' ... --- _id: '6565' abstract: - lang: eng text: In this paper, we address the problem of synthesizing periodic switching controllers for stabilizing a family of linear systems. Our broad approach consists of constructing a finite game graph based on the family of linear systems such that every winning strategy on the game graph corresponds to a stabilizing switching controller for the family of linear systems. The construction of a (finite) game graph, the synthesis of a winning strategy and the extraction of a stabilizing controller are all computationally feasible. We illustrate our method on an example. article_number: '8715598' article_processing_charge: No author: - first_name: Atreyee full_name: Kundu, Atreyee last_name: Kundu - first_name: Miriam full_name: Garcia Soto, Miriam id: 4B3207F6-F248-11E8-B48F-1D18A9856A87 last_name: Garcia Soto orcid: 0000−0003−2936−5719 - first_name: Pavithra full_name: Prabhakar, Pavithra last_name: Prabhakar citation: ama: 'Kundu A, Garcia Soto M, Prabhakar P. Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. In: 5th Indian Control Conference Proceedings. IEEE; 2019. doi:10.1109/INDIANCC.2019.8715598' apa: 'Kundu, A., Garcia Soto, M., & Prabhakar, P. (2019). Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. In 5th Indian Control Conference Proceedings. Delhi, India: IEEE. https://doi.org/10.1109/INDIANCC.2019.8715598' chicago: Kundu, Atreyee, Miriam Garcia Soto, and Pavithra Prabhakar. “Formal Synthesis of Stabilizing Controllers for Periodically Controlled Linear Switched Systems.” In 5th Indian Control Conference Proceedings. IEEE, 2019. https://doi.org/10.1109/INDIANCC.2019.8715598. ieee: A. Kundu, M. Garcia Soto, and P. Prabhakar, “Formal synthesis of stabilizing controllers for periodically controlled linear switched systems,” in 5th Indian Control Conference Proceedings, Delhi, India, 2019. ista: Kundu A, Garcia Soto M, Prabhakar P. 2019. Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. 5th Indian Control Conference Proceedings. ICC 2019 - Indian Control Conference, 8715598. mla: Kundu, Atreyee, et al. “Formal Synthesis of Stabilizing Controllers for Periodically Controlled Linear Switched Systems.” 5th Indian Control Conference Proceedings, 8715598, IEEE, 2019, doi:10.1109/INDIANCC.2019.8715598. short: A. Kundu, M. Garcia Soto, P. Prabhakar, in:, 5th Indian Control Conference Proceedings, IEEE, 2019. conference: end_date: 2019-01-11 location: Delhi, India name: ICC 2019 - Indian Control Conference start_date: 2019-01-09 date_created: 2019-06-17T06:57:33Z date_published: 2019-05-16T00:00:00Z date_updated: 2021-01-12T08:08:01Z day: '16' ddc: - '000' department: - _id: ToHe doi: 10.1109/INDIANCC.2019.8715598 file: - access_level: open_access checksum: d622a91af1e427f6b1e0ba8e18a2b767 content_type: application/pdf creator: dernst date_created: 2020-10-21T13:13:49Z date_updated: 2020-10-21T13:13:49Z file_id: '8687' file_name: 2019_ICC_Kundu.pdf file_size: 396031 relation: main_file success: 1 file_date_updated: 2020-10-21T13:13:49Z has_accepted_license: '1' language: - iso: eng month: '05' oa: 1 oa_version: Submitted Version 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: 5th Indian Control Conference Proceedings publication_identifier: isbn: - 978-153866246-5 publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: '1' status: public title: Formal synthesis of stabilizing controllers for periodically controlled linear switched systems type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '6628' abstract: - lang: eng text: Fejes Tóth [5] and Schneider [9] studied approximations of smooth convex hypersurfaces in Euclidean space by piecewise flat triangular meshes with a given number of vertices on the hypersurface that are optimal with respect to Hausdorff distance. They proved that this Hausdorff distance decreases inversely proportional with m 2/(d−1), where m is the number of vertices and d is the dimension of Euclidean space. Moreover the pro-portionality constant can be expressed in terms of the Gaussian curvature, an intrinsic quantity. In this short note, we prove the extrinsic nature of this constant for manifolds of sufficiently high codimension. We do so by constructing an family of isometric embeddings of the flat torus in Euclidean space. author: - first_name: Gert full_name: Vegter, Gert last_name: Vegter - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: 'Vegter G, Wintraecken M. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In: The 31st Canadian Conference in Computational Geometry. ; 2019:275-279.' apa: Vegter, G., & Wintraecken, M. (2019). The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In The 31st Canadian Conference in Computational Geometry (pp. 275–279). Edmonton, Canada. chicago: Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff Distance of Optimal Triangulations of Manifolds.” In The 31st Canadian Conference in Computational Geometry, 275–79, 2019. ieee: G. Vegter and M. Wintraecken, “The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds,” in The 31st Canadian Conference in Computational Geometry, Edmonton, Canada, 2019, pp. 275–279. ista: 'Vegter G, Wintraecken M. 2019. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. The 31st Canadian Conference in Computational Geometry. CCCG: Canadian Conference in Computational Geometry, 275–279.' mla: Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff Distance of Optimal Triangulations of Manifolds.” The 31st Canadian Conference in Computational Geometry, 2019, pp. 275–79. short: G. Vegter, M. Wintraecken, in:, The 31st Canadian Conference in Computational Geometry, 2019, pp. 275–279. conference: end_date: 2019-08-10 location: Edmonton, Canada name: 'CCCG: Canadian Conference in Computational Geometry' start_date: 2019-08-08 date_created: 2019-07-12T08:34:57Z date_published: 2019-08-01T00:00:00Z date_updated: 2021-01-12T08:08:16Z day: '01' ddc: - '004' department: - _id: HeEd ec_funded: 1 file: - access_level: open_access checksum: ceabd152cfa55170d57763f9c6c60a53 content_type: application/pdf creator: mwintrae date_created: 2019-07-12T08:32:46Z date_updated: 2020-07-14T12:47:34Z file_id: '6629' file_name: IntrinsicExtrinsicCCCG2019.pdf file_size: 321176 relation: main_file file_date_updated: 2020-07-14T12:47:34Z has_accepted_license: '1' language: - iso: eng month: '08' oa: 1 oa_version: Submitted Version page: 275-279 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: The 31st Canadian Conference in Computational Geometry publication_status: published quality_controlled: '1' scopus_import: 1 status: public title: The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '6648' abstract: - lang: eng text: "Various kinds of data are routinely represented as discrete probability distributions. Examples include text documents summarized by histograms of word occurrences and images represented as histograms of oriented gradients. Viewing a discrete probability distribution as a point in the standard simplex of the appropriate dimension, we can understand collections of such objects in geometric and topological terms. Importantly, instead of using the standard Euclidean distance, we look into dissimilarity measures with information-theoretic justification, and we develop the theory\r\nneeded for applying topological data analysis in this setting. In doing so, we emphasize constructions that enable the usage of existing computational topology software in this context." alternative_title: - LIPIcs author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Ziga full_name: Virk, Ziga last_name: Virk - first_name: Hubert full_name: Wagner, Hubert id: 379CA8B8-F248-11E8-B48F-1D18A9856A87 last_name: Wagner citation: ama: 'Edelsbrunner H, Virk Z, Wagner H. Topological data analysis in information space. In: 35th International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:31:1-31:14. doi:10.4230/LIPICS.SOCG.2019.31' apa: 'Edelsbrunner, H., Virk, Z., & Wagner, H. (2019). Topological data analysis in information space. In 35th International Symposium on Computational Geometry (Vol. 129, p. 31:1-31:14). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.31' chicago: Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Topological Data Analysis in Information Space.” In 35th International Symposium on Computational Geometry, 129:31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.SOCG.2019.31. ieee: H. Edelsbrunner, Z. Virk, and H. Wagner, “Topological data analysis in information space,” in 35th International Symposium on Computational Geometry, Portland, OR, United States, 2019, vol. 129, p. 31:1-31:14. ista: 'Edelsbrunner H, Virk Z, Wagner H. 2019. Topological data analysis in information space. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium on Computational Geometry, LIPIcs, vol. 129, 31:1-31:14.' mla: Edelsbrunner, Herbert, et al. “Topological Data Analysis in Information Space.” 35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14, doi:10.4230/LIPICS.SOCG.2019.31. short: H. Edelsbrunner, Z. Virk, H. Wagner, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14. conference: end_date: 2019-06-21 location: Portland, OR, United States name: 'SoCG 2019: Symposium on Computational Geometry' start_date: 2019-06-18 date_created: 2019-07-17T10:36:09Z date_published: 2019-06-01T00:00:00Z date_updated: 2021-01-12T08:08:23Z day: '01' ddc: - '510' department: - _id: HeEd doi: 10.4230/LIPICS.SOCG.2019.31 external_id: arxiv: - '1903.08510' file: - access_level: open_access checksum: 8ec8720730d4c789bf7b06540f1c29f4 content_type: application/pdf creator: dernst date_created: 2019-07-24T06:40:01Z date_updated: 2020-07-14T12:47:35Z file_id: '6666' file_name: 2019_LIPICS_Edelsbrunner.pdf file_size: 1355179 relation: main_file file_date_updated: 2020-07-14T12:47:35Z has_accepted_license: '1' intvolume: ' 129' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 31:1-31:14 project: - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes publication: 35th International Symposium on Computational Geometry publication_identifier: isbn: - '9783959771047' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Topological data analysis in information space 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: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 129 year: '2019' ... --- _id: '6659' abstract: - lang: eng text: Chemical labeling of proteins with synthetic molecular probes offers the possibility to probe the functions of proteins of interest in living cells. However, the methods for covalently labeling targeted proteins using complementary peptide tag-probe pairs are still limited, irrespective of the versatility of such pairs in biological research. Herein, we report the new CysHis tag-Ni(II) probe pair for the specific covalent labeling of proteins. A broad-range evaluation of the reactivity profiles of the probe and the CysHis peptide tag afforded a tag-probe pair with an optimized and high labeling selectivity and reactivity. In particular, the labeling specificity of this pair was notably improved compared to the previously reported one. This pair was successfully utilized for the fluorescence imaging of membrane proteins on the surfaces of living cells, demonstrating its potential utility in biological research. acknowledgement: his work was supported by the Grant-in-Aid for Scientific Research B (JSPS KAKENHI grant no. JP17H03090 to A. O.); the Scientific Research on Innovative Areas “Chemistry for Multimolecular Crowding Biosystems” (JSPS KAKENHI grant no. JP17H06349 to A. O.); and the European Union (European Research Council Advanced grant no. 694539 and Human Brain Project Ref. 720270 to R. S.). A. O. acknowledges the financial support of the Takeda Science Foundation. article_processing_charge: No article_type: original author: - first_name: Naoki full_name: Zenmyo, Naoki last_name: Zenmyo - first_name: Hiroki full_name: Tokumaru, Hiroki last_name: Tokumaru - first_name: Shohei full_name: Uchinomiya, Shohei last_name: Uchinomiya - first_name: Hirokazu full_name: Fuchida, Hirokazu last_name: Fuchida - first_name: Shigekazu full_name: Tabata, Shigekazu id: 4427179E-F248-11E8-B48F-1D18A9856A87 last_name: Tabata - first_name: Itaru full_name: Hamachi, Itaru last_name: Hamachi - first_name: Ryuichi full_name: Shigemoto, Ryuichi id: 499F3ABC-F248-11E8-B48F-1D18A9856A87 last_name: Shigemoto orcid: 0000-0001-8761-9444 - first_name: Akio full_name: Ojida, Akio last_name: Ojida citation: ama: Zenmyo N, Tokumaru H, Uchinomiya S, et al. Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. 2019;92(5):995-1000. doi:10.1246/bcsj.20190034 apa: Zenmyo, N., Tokumaru, H., Uchinomiya, S., Fuchida, H., Tabata, S., Hamachi, I., … Ojida, A. (2019). Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. Bulletin of the Chemical Society of Japan. https://doi.org/10.1246/bcsj.20190034 chicago: Zenmyo, Naoki, Hiroki Tokumaru, Shohei Uchinomiya, Hirokazu Fuchida, Shigekazu Tabata, Itaru Hamachi, Ryuichi Shigemoto, and Akio Ojida. “Optimized Reaction Pair of the CysHis Tag and Ni(II)-NTA Probe for Highly Selective Chemical Labeling of Membrane Proteins.” Bulletin of the Chemical Society of Japan. Bulletin of the Chemical Society of Japan, 2019. https://doi.org/10.1246/bcsj.20190034. ieee: N. Zenmyo et al., “Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins,” Bulletin of the Chemical Society of Japan, vol. 92, no. 5. Bulletin of the Chemical Society of Japan, pp. 995–1000, 2019. ista: Zenmyo N, Tokumaru H, Uchinomiya S, Fuchida H, Tabata S, Hamachi I, Shigemoto R, Ojida A. 2019. Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. 92(5), 995–1000. mla: Zenmyo, Naoki, et al. “Optimized Reaction Pair of the CysHis Tag and Ni(II)-NTA Probe for Highly Selective Chemical Labeling of Membrane Proteins.” Bulletin of the Chemical Society of Japan, vol. 92, no. 5, Bulletin of the Chemical Society of Japan, 2019, pp. 995–1000, doi:10.1246/bcsj.20190034. short: N. Zenmyo, H. Tokumaru, S. Uchinomiya, H. Fuchida, S. Tabata, I. Hamachi, R. Shigemoto, A. Ojida, Bulletin of the Chemical Society of Japan 92 (2019) 995–1000. date_created: 2019-07-21T21:59:16Z date_published: 2019-05-15T00:00:00Z date_updated: 2021-01-12T08:08:26Z day: '15' ddc: - '570' department: - _id: RySh doi: 10.1246/bcsj.20190034 ec_funded: 1 file: - access_level: open_access checksum: 186de511d6e0ca93f5d981e2443eb8cd content_type: application/pdf creator: dernst date_created: 2020-10-02T08:49:58Z date_updated: 2020-10-02T08:49:58Z file_id: '8594' file_name: 2019_BCSJ_Zenmyo.pdf file_size: 2464903 relation: main_file success: 1 file_date_updated: 2020-10-02T08:49:58Z has_accepted_license: '1' intvolume: ' 92' issue: '5' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 995-1000 project: - _id: 25CA28EA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694539' name: 'In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour' publication: Bulletin of the Chemical Society of Japan publication_identifier: issn: - '00092673' publication_status: published publisher: Bulletin of the Chemical Society of Japan quality_controlled: '1' scopus_import: '1' status: public title: Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 92 year: '2019' ... --- _id: '6662' abstract: - lang: eng text: "In phase retrieval, we want to recover an unknown signal \U0001D465∈ℂ\U0001D451 from n quadratic measurements of the form \U0001D466\U0001D456=|⟨\U0001D44E\U0001D456,\U0001D465⟩|2+\U0001D464\U0001D456, where \U0001D44E\U0001D456∈ℂ\U0001D451 are known sensing vectors and \U0001D464\U0001D456 is measurement noise. We ask the following weak recovery question: What is the minimum number of measurements n needed to produce an estimator \U0001D465^(\U0001D466) that is positively correlated with the signal \U0001D465? We consider the case of Gaussian vectors \U0001D44E\U0001D44E\U0001D456. We prove that—in the high-dimensional limit—a sharp phase transition takes place, and we locate the threshold in the regime of vanishingly small noise. For \U0001D45B≤\U0001D451−\U0001D45C(\U0001D451), no estimator can do significantly better than random and achieve a strictly positive correlation. For \U0001D45B≥\U0001D451+\U0001D45C(\U0001D451), a simple spectral estimator achieves a positive correlation. Surprisingly, numerical simulations with the same spectral estimator demonstrate promising performance with realistic sensing matrices. Spectral methods are used to initialize non-convex optimization algorithms in phase retrieval, and our approach can boost the performance in this setting as well. Our impossibility result is based on classical information-theoretic arguments. The spectral algorithm computes the leading eigenvector of a weighted empirical covariance matrix. We obtain a sharp characterization of the spectral properties of this random matrix using tools from free probability and generalizing a recent result by Lu and Li. Both the upper bound and lower bound generalize beyond phase retrieval to measurements \U0001D466\U0001D456 produced according to a generalized linear model. As a by-product of our analysis, we compare the threshold of the proposed spectral method with that of a message passing algorithm." article_type: original author: - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: Andrea full_name: Montanari, Andrea last_name: Montanari citation: ama: Mondelli M, Montanari A. Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics. 2019;19(3):703-773. doi:10.1007/s10208-018-9395-y apa: Mondelli, M., & Montanari, A. (2019). Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics. Springer. https://doi.org/10.1007/s10208-018-9395-y chicago: Mondelli, Marco, and Andrea Montanari. “Fundamental Limits of Weak Recovery with Applications to Phase Retrieval.” Foundations of Computational Mathematics. Springer, 2019. https://doi.org/10.1007/s10208-018-9395-y. ieee: M. Mondelli and A. Montanari, “Fundamental limits of weak recovery with applications to phase retrieval,” Foundations of Computational Mathematics, vol. 19, no. 3. Springer, pp. 703–773, 2019. ista: Mondelli M, Montanari A. 2019. Fundamental limits of weak recovery with applications to phase retrieval. Foundations of Computational Mathematics. 19(3), 703–773. mla: Mondelli, Marco, and Andrea Montanari. “Fundamental Limits of Weak Recovery with Applications to Phase Retrieval.” Foundations of Computational Mathematics, vol. 19, no. 3, Springer, 2019, pp. 703–73, doi:10.1007/s10208-018-9395-y. short: M. Mondelli, A. Montanari, Foundations of Computational Mathematics 19 (2019) 703–773. date_created: 2019-07-22T13:23:48Z date_published: 2019-06-01T00:00:00Z date_updated: 2021-01-12T08:08:28Z day: '01' doi: 10.1007/s10208-018-9395-y extern: '1' external_id: arxiv: - '1708.05932' intvolume: ' 19' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1708.05932 month: '06' oa: 1 oa_version: Preprint page: 703-773 publication: Foundations of Computational Mathematics publication_identifier: eissn: - 1615-3383 publication_status: published publisher: Springer quality_controlled: '1' status: public title: Fundamental limits of weak recovery with applications to phase retrieval type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 19 year: '2019' ... --- _id: '6672' abstract: - lang: eng text: The construction of anisotropic triangulations is desirable for various applications, such as the numerical solving of partial differential equations and the representation of surfaces in graphics. To solve this notoriously difficult problem in a practical way, we introduce the discrete Riemannian Voronoi diagram, a discrete structure that approximates the Riemannian Voronoi diagram. This structure has been implemented and was shown to lead to good triangulations in $\mathbb{R}^2$ and on surfaces embedded in $\mathbb{R}^3$ as detailed in our experimental companion paper. In this paper, we study theoretical aspects of our structure. Given a finite set of points $\mathcal{P}$ in a domain $\Omega$ equipped with a Riemannian metric, we compare the discrete Riemannian Voronoi diagram of $\mathcal{P}$ to its Riemannian Voronoi diagram. Both diagrams have dual structures called the discrete Riemannian Delaunay and the Riemannian Delaunay complex. We provide conditions that guarantee that these dual structures are identical. It then follows from previous results that the discrete Riemannian Delaunay complex can be embedded in $\Omega$ under sufficient conditions, leading to an anisotropic triangulation with curved simplices. Furthermore, we show that, under similar conditions, the simplices of this triangulation can be straightened. author: - first_name: Jean-Daniel full_name: Boissonnat, Jean-Daniel last_name: Boissonnat - first_name: Mael full_name: Rouxel-Labbé, Mael last_name: Rouxel-Labbé - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 citation: ama: Boissonnat J-D, Rouxel-Labbé M, Wintraecken M. Anisotropic triangulations via discrete Riemannian Voronoi diagrams. SIAM Journal on Computing. 2019;48(3):1046-1097. doi:10.1137/17m1152292 apa: Boissonnat, J.-D., Rouxel-Labbé, M., & Wintraecken, M. (2019). Anisotropic triangulations via discrete Riemannian Voronoi diagrams. SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM). https://doi.org/10.1137/17m1152292 chicago: Boissonnat, Jean-Daniel, Mael Rouxel-Labbé, and Mathijs Wintraecken. “Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams.” SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM), 2019. https://doi.org/10.1137/17m1152292. ieee: J.-D. Boissonnat, M. Rouxel-Labbé, and M. Wintraecken, “Anisotropic triangulations via discrete Riemannian Voronoi diagrams,” SIAM Journal on Computing, vol. 48, no. 3. Society for Industrial & Applied Mathematics (SIAM), pp. 1046–1097, 2019. ista: Boissonnat J-D, Rouxel-Labbé M, Wintraecken M. 2019. Anisotropic triangulations via discrete Riemannian Voronoi diagrams. SIAM Journal on Computing. 48(3), 1046–1097. mla: Boissonnat, Jean-Daniel, et al. “Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams.” SIAM Journal on Computing, vol. 48, no. 3, Society for Industrial & Applied Mathematics (SIAM), 2019, pp. 1046–97, doi:10.1137/17m1152292. short: J.-D. Boissonnat, M. Rouxel-Labbé, M. Wintraecken, SIAM Journal on Computing 48 (2019) 1046–1097. date_created: 2019-07-24T08:42:12Z date_published: 2019-05-21T00:00:00Z date_updated: 2021-01-12T08:08:30Z day: '21' doi: 10.1137/17m1152292 extern: '1' external_id: arxiv: - '1703.06487' intvolume: ' 48' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1703.06487 month: '05' oa: 1 oa_version: Preprint page: 1046-1097 publication: SIAM Journal on Computing publication_identifier: eissn: - 1095-7111 issn: - 0097-5397 publication_status: published publisher: Society for Industrial & Applied Mathematics (SIAM) quality_controlled: '1' status: public title: Anisotropic triangulations via discrete Riemannian Voronoi diagrams type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 48 year: '2019' ...