--- _id: '307' abstract: - lang: eng text: 'Spontaneous emission spectra of two initially excited closely spaced identical atoms are very sensitive to the strength and the direction of the applied magnetic field. We consider the relevant schemes that ensure the determination of the mutual spatial orientation of the atoms and the distance between them by entirely optical means. A corresponding theoretical description is given accounting for the dipole-dipole interaction between the two atoms in the presence of a magnetic field and for polarizations of the quantum field interacting with magnetic sublevels of the two-atom system. ' acknowledgement: The work was partially supported by Russian Foundation for Basic Research (Grant No. 15-02-05657a) and by the Basic research program of Higher School of Economics (HSE). article_number: ' 043812 ' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Elena full_name: Redchenko, Elena id: 2C21D6E8-F248-11E8-B48F-1D18A9856A87 last_name: Redchenko - first_name: Alexander full_name: Makarov, Alexander last_name: Makarov - first_name: Vladimir full_name: Yudson, Vladimir last_name: Yudson citation: ama: Redchenko E, Makarov A, Yudson V. Nanoscopy of pairs of atoms by fluorescence in a magnetic field. Physical Review A. 2018;97(4). doi:10.1103/PhysRevA.97.043812 apa: Redchenko, E., Makarov, A., & Yudson, V. (2018). Nanoscopy of pairs of atoms by fluorescence in a magnetic field. Physical Review A. American Physical Society. https://doi.org/10.1103/PhysRevA.97.043812 chicago: Redchenko, Elena, Alexander Makarov, and Vladimir Yudson. “Nanoscopy of Pairs of Atoms by Fluorescence in a Magnetic Field.” Physical Review A. American Physical Society, 2018. https://doi.org/10.1103/PhysRevA.97.043812. ieee: E. Redchenko, A. Makarov, and V. Yudson, “Nanoscopy of pairs of atoms by fluorescence in a magnetic field,” Physical Review A, vol. 97, no. 4. American Physical Society, 2018. ista: Redchenko E, Makarov A, Yudson V. 2018. Nanoscopy of pairs of atoms by fluorescence in a magnetic field. Physical Review A. 97(4), 043812. mla: Redchenko, Elena, et al. “Nanoscopy of Pairs of Atoms by Fluorescence in a Magnetic Field.” Physical Review A, vol. 97, no. 4, 043812, American Physical Society, 2018, doi:10.1103/PhysRevA.97.043812. short: E. Redchenko, A. Makarov, V. Yudson, Physical Review A 97 (2018). das_tickbox: '1' date_created: 2018-12-11T11:45:44Z date_published: 2018-04-09T00:00:00Z date_updated: 2026-07-07T13:16:52Z day: '09' department: - _id: JoFi doi: 10.1103/PhysRevA.97.043812 external_id: arxiv: - '1712.10127' isi: - '000429454000015' intvolume: ' 97' isi: 1 issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1712.10127 month: '04' oa: 1 oa_version: Submitted Version publication: Physical Review A publication_status: published publisher: American Physical Society publist_id: '7572' quality_controlled: '1' scopus_import: '1' status: public title: Nanoscopy of pairs of atoms by fluorescence in a magnetic field type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 97 year: '2018' ... --- _id: '34' abstract: - lang: eng text: Partially observable Markov decision processes (POMDPs) are widely used in probabilistic planning problems in which an agent interacts with an environment using noisy and imprecise sensors. We study a setting in which the sensors are only partially defined and the goal is to synthesize “weakest” additional sensors, such that in the resulting POMDP, there is a small-memory policy for the agent that almost-surely (with probability 1) satisfies a reachability objective. We show that the problem is NP-complete, and present a symbolic algorithm by encoding the problem into SAT instances. We illustrate trade-offs between the amount of memory of the policy and the number of additional sensors on a simple example. We have implemented our approach and consider three classical POMDP examples from the literature, and show that in all the examples the number of sensors can be significantly decreased (as compared to the existing solutions in the literature) without increasing the complexity of the policies. article_processing_charge: No arxiv: 1 author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Martin full_name: Chemlík, Martin last_name: Chemlík - first_name: Ufuk full_name: Topcu, Ufuk last_name: Topcu citation: ama: 'Chatterjee K, Chemlík M, Topcu U. Sensor synthesis for POMDPs with reachability objectives. In: 28th International Conference on Automated Planning and Scheduling. Vol 2018. AAAI Press; 2018:47-55. doi:10.1609/icaps.v28i1.13875' apa: 'Chatterjee, K., Chemlík, M., & Topcu, U. (2018). Sensor synthesis for POMDPs with reachability objectives. In 28th International Conference on Automated Planning and Scheduling (Vol. 2018, pp. 47–55). Delft, Netherlands: AAAI Press. https://doi.org/10.1609/icaps.v28i1.13875' chicago: Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis for POMDPs with Reachability Objectives.” In 28th International Conference on Automated Planning and Scheduling, 2018:47–55. AAAI Press, 2018. https://doi.org/10.1609/icaps.v28i1.13875. ieee: K. Chatterjee, M. Chemlík, and U. Topcu, “Sensor synthesis for POMDPs with reachability objectives,” in 28th International Conference on Automated Planning and Scheduling, Delft, Netherlands, 2018, vol. 2018, pp. 47–55. ista: 'Chatterjee K, Chemlík M, Topcu U. 2018. Sensor synthesis for POMDPs with reachability objectives. 28th International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 2018, 47–55.' mla: Chatterjee, Krishnendu, et al. “Sensor Synthesis for POMDPs with Reachability Objectives.” 28th International Conference on Automated Planning and Scheduling, vol. 2018, AAAI Press, 2018, pp. 47–55, doi:10.1609/icaps.v28i1.13875. short: K. Chatterjee, M. Chemlík, U. Topcu, in:, 28th International Conference on Automated Planning and Scheduling, AAAI Press, 2018, pp. 47–55. conference: end_date: 2018-06-29 location: Delft, Netherlands name: 'ICAPS: International Conference on Automated Planning and Scheduling' start_date: 2018-06-24 das_tickbox: '1' date_created: 2018-12-11T11:44:16Z date_published: 2018-06-01T00:00:00Z date_updated: 2026-07-07T13:35:51Z day: '01' department: - _id: KrCh doi: 10.1609/icaps.v28i1.13875 ec_funded: 1 external_id: arxiv: - '1710.00675' isi: - '000492986200006' intvolume: ' 2018' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1710.00675 month: '06' oa: 1 oa_version: Preprint page: 47 - 55 project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2587B514-B435-11E9-9278-68D0E5697425 name: Microsoft Research Faculty Fellowship publication: 28th International Conference on Automated Planning and Scheduling publication_status: published publisher: AAAI Press publist_id: '8021' quality_controlled: '1' scopus_import: '1' status: public title: Sensor synthesis for POMDPs with reachability objectives type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2018 year: '2018' ... --- _id: '35' abstract: - lang: eng text: 'We consider planning problems for graphs, Markov decision processes (MDPs), and games on graphs. While graphs represent the most basic planning model, MDPs represent interaction with nature and games on graphs represent interaction with an adversarial environment. We consider two planning problems where there are k different target sets, and the problems are as follows: (a) the coverage problem asks whether there is a plan for each individual target set; and (b) the sequential target reachability problem asks whether the targets can be reached in sequence. For the coverage problem, we present a linear-time algorithm for graphs, and quadratic conditional lower bound for MDPs and games on graphs. For the sequential target problem, we present a linear-time algorithm for graphs, a sub-quadratic algorithm for MDPs, and a quadratic conditional lower bound for games on graphs. Our results with conditional lower bounds establish (i) model-separation results showing that for the coverage problem MDPs and games on graphs are harder than graphs and for the sequential reachability problem games on graphs are harder than MDPs and graphs; and (ii) objective-separation results showing that for MDPs the coverage problem is harder than the sequential target problem.' article_processing_charge: No arxiv: 1 author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Wolfgang full_name: Dvorák, Wolfgang last_name: Dvorák - 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: Svozil, Alexander last_name: Svozil citation: ama: 'Chatterjee K, Dvorák W, Henzinger M, Svozil A. Algorithms and conditional lower bounds for planning problems. In: 28th International Conference on Automated Planning and Scheduling. AAAI Press; 2018.' apa: 'Chatterjee, K., Dvorák, W., Henzinger, M., & Svozil, A. (2018). Algorithms and conditional lower bounds for planning problems. In 28th International Conference on Automated Planning and Scheduling. Delft, Netherlands: AAAI Press.' chicago: Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” In 28th International Conference on Automated Planning and Scheduling. AAAI Press, 2018. ieee: K. Chatterjee, W. Dvorák, M. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” in 28th International Conference on Automated Planning and Scheduling, Delft, Netherlands, 2018. ista: 'Chatterjee K, Dvorák W, Henzinger M, Svozil A. 2018. Algorithms and conditional lower bounds for planning problems. 28th International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling.' mla: Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” 28th International Conference on Automated Planning and Scheduling, AAAI Press, 2018. short: K. Chatterjee, W. Dvorák, M. Henzinger, A. Svozil, in:, 28th International Conference on Automated Planning and Scheduling, AAAI Press, 2018. conference: end_date: 2018-06-29 location: Delft, Netherlands name: 'ICAPS: International Conference on Automated Planning and Scheduling' start_date: 2018-06-24 das_tickbox: '1' date_created: 2018-12-11T11:44:17Z date_published: 2018-06-01T00:00:00Z date_updated: 2026-07-07T13:36:04Z day: '01' department: - _id: KrCh ec_funded: 1 external_id: arxiv: - '1804.07031' isi: - '000492986200007' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1804.07031 month: '06' oa: 1 oa_version: Preprint project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication: 28th International Conference on Automated Planning and Scheduling publication_status: published publisher: AAAI Press publist_id: '8020' quality_controlled: '1' related_material: record: - id: '9293' relation: later_version status: public scopus_import: '1' status: public title: Algorithms and conditional lower bounds for planning problems type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '12' abstract: - lang: eng text: Molding is a popular mass production method, in which the initial expenses for the mold are offset by the low per-unit production cost. However, the physical fabrication constraints of the molding technique commonly restrict the shape of moldable objects. For a complex shape, a decomposition of the object into moldable parts is a common strategy to address these constraints, with plastic model kits being a popular and illustrative example. However, conducting such a decomposition requires considerable expertise, and it depends on the technical aspects of the fabrication technique, as well as aesthetic considerations. We present an interactive technique to create such decompositions for two-piece molding, in which each part of the object is cast between two rigid mold pieces. Given the surface description of an object, we decompose its thin-shell equivalent into moldable parts by first performing a coarse decomposition and then utilizing an active contour model for the boundaries between individual parts. Formulated as an optimization problem, the movement of the contours is guided by an energy reflecting fabrication constraints to ensure the moldability of each part. Simultaneously, the user is provided with editing capabilities to enforce aesthetic guidelines. Our interactive interface provides control of the contour positions by allowing, for example, the alignment of part boundaries with object features. Our technique enables a novel workflow, as it empowers novice users to explore the design space, and it generates fabrication-ready two-piece molds that can be used either for casting or industrial injection molding of free-form objects. article_number: '135' article_processing_charge: No author: - first_name: Kazutaka full_name: Nakashima, Kazutaka last_name: Nakashima - first_name: Thomas full_name: Auzinger, Thomas id: 4718F954-F248-11E8-B48F-1D18A9856A87 last_name: Auzinger orcid: 0000-0002-1546-3265 - first_name: Emmanuel full_name: Iarussi, Emmanuel id: 33F19F16-F248-11E8-B48F-1D18A9856A87 last_name: Iarussi orcid: 0000-0001-7438-9299 - first_name: Ran full_name: Zhang, Ran id: 4DDBCEB0-F248-11E8-B48F-1D18A9856A87 last_name: Zhang orcid: 0000-0002-3808-281X - first_name: Takeo full_name: Igarashi, Takeo last_name: Igarashi - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 citation: ama: 'Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. ACM Transactions on Graphics. 2018;37(4). doi:10.1145/3197517.3201341' apa: 'Nakashima, K., Auzinger, T., Iarussi, E., Zhang, R., Igarashi, T., & Bickel, B. (2018). CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3197517.3201341' chicago: 'Nakashima, Kazutaka, Thomas Auzinger, Emmanuel Iarussi, Ran Zhang, Takeo Igarashi, and Bernd Bickel. “CoreCavity: Interactive Shell Decomposition for Fabrication with Two-Piece Rigid Molds.” ACM Transactions on Graphics. ACM, 2018. https://doi.org/10.1145/3197517.3201341.' ieee: 'K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, and B. Bickel, “CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds,” ACM Transactions on Graphics, vol. 37, no. 4. ACM, 2018.' ista: 'Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. 2018. CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. ACM Transactions on Graphics. 37(4), 135.' mla: 'Nakashima, Kazutaka, et al. “CoreCavity: Interactive Shell Decomposition for Fabrication with Two-Piece Rigid Molds.” ACM Transactions on Graphics, vol. 37, no. 4, 135, ACM, 2018, doi:10.1145/3197517.3201341.' short: K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, B. Bickel, ACM Transactions on Graphics 37 (2018). date_created: 2018-12-11T11:44:09Z date_published: 2018-08-04T00:00:00Z date_updated: 2026-07-07T14:00:35Z day: '04' ddc: - '004' - '516' - '670' department: - _id: BeBi doi: 10.1145/3197517.3201341 ec_funded: 1 external_id: isi: - '000448185000096' file: - access_level: open_access checksum: 6a5368bc86c4e1a9fcfe588fd1f14ee8 content_type: application/pdf creator: system date_created: 2018-12-12T10:18:38Z date_updated: 2020-07-14T12:44:38Z file_id: '5360' file_name: IST-2018-1037-v1+1_CoreCavity-AuthorVersion.pdf file_size: 104225664 relation: main_file - access_level: open_access checksum: 3861e693ba47c51f3ec7b7867d573a61 content_type: application/zip creator: system date_created: 2018-12-12T10:18:39Z date_updated: 2020-07-14T12:44:38Z file_id: '5361' file_name: IST-2018-1037-v1+2_CoreCavity-Supplemental.zip file_size: 377743553 relation: main_file - access_level: open_access checksum: 490040c685ed869536e2a18f5a906b94 content_type: video/vnd.objectvideo creator: system date_created: 2018-12-12T10:18:41Z date_updated: 2020-07-14T12:44:38Z file_id: '5362' file_name: IST-2018-1037-v1+3_CoreCavity-Video.mp4 file_size: 162634396 relation: main_file - access_level: open_access checksum: be7fc8b229adda727419b6504b3b9352 content_type: image/jpeg creator: system date_created: 2018-12-12T10:18:42Z date_updated: 2020-07-14T12:44:38Z file_id: '5363' file_name: IST-2018-1037-v1+4_CoreCavity-RepresentativeImage.jpg file_size: 527972 relation: main_file file_date_updated: 2020-07-14T12:44:38Z has_accepted_license: '1' intvolume: ' 37' isi: 1 issue: '4' language: - iso: eng month: '08' oa: 1 oa_version: Submitted Version project: - _id: 24F9549A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '715767' name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling' - _id: 2508E324-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '642841' name: Distributed 3D Object Design publication: ACM Transactions on Graphics publication_status: published publisher: ACM publist_id: '8044' pubrep_id: '1037' quality_controlled: '1' related_material: link: - description: News on IST Homepage relation: press_release url: https://ist.ac.at/en/news/interactive-software-tool-makes-complex-mold-design-simple/ scopus_import: '1' status: public title: 'CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 37 year: '2018' ... --- _id: '4' abstract: - lang: eng text: We present a data-driven technique to instantly predict how fluid flows around various three-dimensional objects. Such simulation is useful for computational fabrication and engineering, but is usually computationally expensive since it requires solving the Navier-Stokes equation for many time steps. To accelerate the process, we propose a machine learning framework which predicts aerodynamic forces and velocity and pressure fields given a threedimensional shape input. Handling detailed free-form three-dimensional shapes in a data-driven framework is challenging because machine learning approaches usually require a consistent parametrization of input and output. We present a novel PolyCube maps-based parametrization that can be computed for three-dimensional shapes at interactive rates. This allows us to efficiently learn the nonlinear response of the flow using a Gaussian process regression. We demonstrate the effectiveness of our approach for the interactive design and optimization of a car body. article_number: '89' article_processing_charge: No author: - first_name: Nobuyuki full_name: Umetani, Nobuyuki last_name: Umetani - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 citation: ama: Umetani N, Bickel B. Learning three-dimensional flow for interactive aerodynamic design. ACM Transactions on Graphics. 2018;37(4). doi:10.1145/3197517.3201325 apa: Umetani, N., & Bickel, B. (2018). Learning three-dimensional flow for interactive aerodynamic design. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3197517.3201325 chicago: Umetani, Nobuyuki, and Bernd Bickel. “Learning Three-Dimensional Flow for Interactive Aerodynamic Design.” ACM Transactions on Graphics. ACM, 2018. https://doi.org/10.1145/3197517.3201325. ieee: N. Umetani and B. Bickel, “Learning three-dimensional flow for interactive aerodynamic design,” ACM Transactions on Graphics, vol. 37, no. 4. ACM, 2018. ista: Umetani N, Bickel B. 2018. Learning three-dimensional flow for interactive aerodynamic design. ACM Transactions on Graphics. 37(4), 89. mla: Umetani, Nobuyuki, and Bernd Bickel. “Learning Three-Dimensional Flow for Interactive Aerodynamic Design.” ACM Transactions on Graphics, vol. 37, no. 4, 89, ACM, 2018, doi:10.1145/3197517.3201325. short: N. Umetani, B. Bickel, ACM Transactions on Graphics 37 (2018). das_tickbox: '1' date_created: 2018-12-11T11:44:06Z date_published: 2018-08-04T00:00:00Z date_updated: 2026-07-07T13:58:59Z day: '04' ddc: - '003' - '004' department: - _id: BeBi doi: 10.1145/3197517.3201325 ec_funded: 1 external_id: isi: - '000448185000050' file: - access_level: open_access checksum: 7a2243668f215821bc6aecad0320079a content_type: application/pdf creator: system date_created: 2018-12-12T10:16:28Z date_updated: 2020-07-14T12:46:22Z file_id: '5216' file_name: IST-2018-1049-v1+1_2018_sigg_Learning3DAerodynamics.pdf file_size: 22803163 relation: main_file file_date_updated: 2020-07-14T12:46:22Z has_accepted_license: '1' intvolume: ' 37' isi: 1 issue: '4' language: - iso: eng month: '08' oa: 1 oa_version: Submitted Version project: - _id: 24F9549A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '715767' name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling' publication: ACM Transactions on Graphics publication_status: published publisher: ACM publist_id: '8053' pubrep_id: '1049' quality_controlled: '1' related_material: link: - description: News on IST Homepage relation: press_release url: https://ist.ac.at/en/news/new-interactive-machine-learning-tool-makes-car-designs-more-aerodynamic/ scopus_import: '1' status: public title: Learning three-dimensional flow for interactive aerodynamic design type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 37 year: '2018' ... --- _id: '13' abstract: - lang: eng text: We propose a new method for fabricating digital objects through reusable silicone molds. Molds are generated by casting liquid silicone into custom 3D printed containers called metamolds. Metamolds automatically define the cuts that are needed to extract the cast object from the silicone mold. The shape of metamolds is designed through a novel segmentation technique, which takes into account both geometric and topological constraints involved in the process of mold casting. Our technique is simple, does not require changing the shape or topology of the input objects, and only requires off-the- shelf materials and technologies. We successfully tested our method on a set of challenging examples with complex shapes and rich geometric detail. © 2018 Association for Computing Machinery. article_number: '136' article_processing_charge: No author: - first_name: Thomas full_name: Alderighi, Thomas last_name: Alderighi - first_name: Luigi full_name: Malomo, Luigi last_name: Malomo - first_name: Daniela full_name: Giorgi, Daniela last_name: Giorgi - first_name: Nico full_name: Pietroni, Nico last_name: Pietroni - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 - first_name: Paolo full_name: Cignoni, Paolo last_name: Cignoni citation: ama: 'Alderighi T, Malomo L, Giorgi D, Pietroni N, Bickel B, Cignoni P. Metamolds: Computational design of silicone molds. ACM Transactions on Graphics. 2018;37(4). doi:10.1145/3197517.3201381' apa: 'Alderighi, T., Malomo, L., Giorgi, D., Pietroni, N., Bickel, B., & Cignoni, P. (2018). Metamolds: Computational design of silicone molds. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3197517.3201381' chicago: 'Alderighi, Thomas, Luigi Malomo, Daniela Giorgi, Nico Pietroni, Bernd Bickel, and Paolo Cignoni. “Metamolds: Computational Design of Silicone Molds.” ACM Transactions on Graphics. ACM, 2018. https://doi.org/10.1145/3197517.3201381.' ieee: 'T. Alderighi, L. Malomo, D. Giorgi, N. Pietroni, B. Bickel, and P. Cignoni, “Metamolds: Computational design of silicone molds,” ACM Transactions on Graphics, vol. 37, no. 4. ACM, 2018.' ista: 'Alderighi T, Malomo L, Giorgi D, Pietroni N, Bickel B, Cignoni P. 2018. Metamolds: Computational design of silicone molds. ACM Transactions on Graphics. 37(4), 136.' mla: 'Alderighi, Thomas, et al. “Metamolds: Computational Design of Silicone Molds.” ACM Transactions on Graphics, vol. 37, no. 4, 136, ACM, 2018, doi:10.1145/3197517.3201381.' short: T. Alderighi, L. Malomo, D. Giorgi, N. Pietroni, B. Bickel, P. Cignoni, ACM Transactions on Graphics 37 (2018). das_tickbox: '1' date_created: 2018-12-11T11:44:09Z date_published: 2018-08-04T00:00:00Z date_updated: 2026-07-07T13:59:14Z day: '04' ddc: - '004' department: - _id: BeBi doi: 10.1145/3197517.3201381 ec_funded: 1 external_id: isi: - '000448185000097' file: - access_level: open_access checksum: 61d46273dca4de626accef1d17a0aaad content_type: application/pdf creator: system date_created: 2018-12-12T10:18:52Z date_updated: 2020-07-14T12:44:43Z file_id: '5374' file_name: IST-2018-1038-v1+1_metamolds_authorversion.pdf file_size: 91939066 relation: main_file file_date_updated: 2020-07-14T12:44:43Z has_accepted_license: '1' intvolume: ' 37' isi: 1 issue: '4' language: - iso: eng month: '08' oa: 1 oa_version: Submitted Version project: - _id: 24F9549A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '715767' name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling' publication: ACM Transactions on Graphics publication_status: published publisher: ACM publist_id: '8043' pubrep_id: '1038' quality_controlled: '1' related_material: link: - description: News on IST Homepage relation: press_release url: https://ist.ac.at/en/news/metamolds-molding-a-mold/ scopus_import: '1' status: public title: 'Metamolds: Computational design of silicone molds' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 37 year: '2018' ... --- _id: '6589' abstract: - lang: eng text: Distributed training of massive machine learning models, in particular deep neural networks, via Stochastic Gradient Descent (SGD) is becoming commonplace. Several families of communication-reduction methods, such as quantization, large-batch methods, and gradient sparsification, have been proposed. To date, gradient sparsification methods--where each node sorts gradients by magnitude, and only communicates a subset of the components, accumulating the rest locally--are known to yield some of the largest practical gains. Such methods can reduce the amount of communication per step by up to \emph{three orders of magnitude}, while preserving model accuracy. Yet, this family of methods currently has no theoretical justification. This is the question we address in this paper. We prove that, under analytic assumptions, sparsifying gradients by magnitude with local error correction provides convergence guarantees, for both convex and non-convex smooth objectives, for data-parallel SGD. The main insight is that sparsification methods implicitly maintain bounds on the maximum impact of stale updates, thanks to selection by magnitude. Our analysis and empirical validation also reveal that these methods do require analytical conditions to converge well, justifying existing heuristics. alternative_title: - Advances in Neural Information Processing Systems 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: Torsten full_name: Hoefler, Torsten last_name: Hoefler - first_name: Mikael full_name: Johansson, Mikael last_name: Johansson - first_name: Nikola H full_name: Konstantinov, Nikola H id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87 last_name: Konstantinov orcid: 0009-0009-5204-7621 - first_name: Sarit full_name: Khirirat, Sarit last_name: Khirirat - first_name: Cedric full_name: Renggli, Cedric last_name: Renggli citation: ama: 'Alistarh D-A, Hoefler T, Johansson M, Konstantinov NH, Khirirat S, Renggli C. The convergence of sparsified gradient methods. In: 32nd Conference on Neural Information Processing Systems. Neural Information Processing Systems Foundation; 2018:5973-5983.' apa: 'Alistarh, D.-A., Hoefler, T., Johansson, M., Konstantinov, N. H., Khirirat, S., & Renggli, C. (2018). The convergence of sparsified gradient methods. In 32nd Conference on Neural Information Processing Systems (pp. 5973–5983). Montreal, Canada: Neural Information Processing Systems Foundation.' chicago: Alistarh, Dan-Adrian, Torsten Hoefler, Mikael Johansson, Nikola H Konstantinov, Sarit Khirirat, and Cedric Renggli. “The Convergence of Sparsified Gradient Methods.” In 32nd Conference on Neural Information Processing Systems, 5973–83. Neural Information Processing Systems Foundation, 2018. ieee: D.-A. Alistarh, T. Hoefler, M. Johansson, N. H. Konstantinov, S. Khirirat, and C. Renggli, “The convergence of sparsified gradient methods,” in 32nd Conference on Neural Information Processing Systems, Montreal, Canada, 2018, pp. 5973–5983. ista: 'Alistarh D-A, Hoefler T, Johansson M, Konstantinov NH, Khirirat S, Renggli C. 2018. The convergence of sparsified gradient methods. 32nd Conference on Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems, Advances in Neural Information Processing Systems, , 5973–5983.' mla: Alistarh, Dan-Adrian, et al. “The Convergence of Sparsified Gradient Methods.” 32nd Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2018, pp. 5973–83. short: D.-A. Alistarh, T. Hoefler, M. Johansson, N.H. Konstantinov, S. Khirirat, C. Renggli, in:, 32nd Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2018, pp. 5973–5983. conference: end_date: 2018-12-08 location: Montreal, Canada name: 'NeurIPS: Conference on Neural Information Processing Systems' start_date: 2018-12-02 corr_author: '1' das_tickbox: '1' date_created: 2019-06-27T09:32:55Z date_published: 2018-12-01T00:00:00Z date_updated: 2026-07-08T05:48:21Z day: '01' department: - _id: DaAl - _id: ChLa ec_funded: 1 external_id: arxiv: - '1809.10505' isi: - '000461852000047' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1809.10505 month: '12' oa: 1 oa_version: Preprint page: 5973-5983 project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication: 32nd Conference on Neural Information Processing Systems publication_identifier: issn: - 1049-5258 publication_status: published publisher: Neural Information Processing Systems Foundation quality_controlled: '1' scopus_import: '1' status: public title: The convergence of sparsified gradient methods type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '131' abstract: - lang: eng text: 'XY systems usually show chromosome-wide compensation of X-linked genes, while in many ZW systems, compensation is restricted to a minority of dosage-sensitive genes. Why such differences arose is still unclear. Here, we combine comparative genomics, transcriptomics and proteomics to obtain a complete overview of the evolution of gene dosage on the Z-chromosome of Schistosoma parasites. We compare the Z-chromosome gene content of African (Schistosoma mansoni and S. haematobium) and Asian (S. japonicum) schistosomes and describe lineage-specific evolutionary strata. We use these to assess gene expression evolution following sex-linkage. The resulting patterns suggest a reduction in expression of Z-linked genes in females, combined with upregulation of the Z in both sexes, in line with the first step of Ohno’s classic model of dosage compensation evolution. Quantitative proteomics suggest that post-transcriptional mechanisms do not play a major role in balancing the expression of Z-linked genes. ' acknowledged_ssus: - _id: CampIT acknowledgement: We are grateful to Lu Dabing (Soochow University, Suzhou, China) for providing Schistosoma japonicum samples, to Ariana Macon (IST Austria) and Georgette Stovall (JLU Giessen) for technical assistance, to IT support at IST Austria for providing optimal environment to bioinformatic analyses, and to the Vicoso lab for comments on the manuscript. article_number: e35684 article_processing_charge: No article_type: original author: - first_name: Marion A full_name: Picard, Marion A id: 2C921A7A-F248-11E8-B48F-1D18A9856A87 last_name: Picard orcid: 0000-0002-8101-2518 - first_name: Celine full_name: Cosseau, Celine last_name: Cosseau - first_name: Sabrina full_name: Ferré, Sabrina last_name: Ferré - first_name: Thomas full_name: Quack, Thomas last_name: Quack - first_name: Christoph full_name: Grevelding, Christoph last_name: Grevelding - first_name: Yohann full_name: Couté, Yohann last_name: Couté - first_name: Beatriz full_name: Vicoso, Beatriz id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87 last_name: Vicoso orcid: 0000-0002-4579-8306 citation: ama: Picard MAL, Cosseau C, Ferré S, et al. Evolution of gene dosage on the Z-chromosome of schistosome parasites. eLife. 2018;7. doi:10.7554/eLife.35684 apa: Picard, M. A. L., Cosseau, C., Ferré, S., Quack, T., Grevelding, C., Couté, Y., & Vicoso, B. (2018). Evolution of gene dosage on the Z-chromosome of schistosome parasites. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.35684 chicago: Picard, Marion A L, Celine Cosseau, Sabrina Ferré, Thomas Quack, Christoph Grevelding, Yohann Couté, and Beatriz Vicoso. “Evolution of Gene Dosage on the Z-Chromosome of Schistosome Parasites.” ELife. eLife Sciences Publications, 2018. https://doi.org/10.7554/eLife.35684. ieee: M. A. L. Picard et al., “Evolution of gene dosage on the Z-chromosome of schistosome parasites,” eLife, vol. 7. eLife Sciences Publications, 2018. ista: Picard MAL, Cosseau C, Ferré S, Quack T, Grevelding C, Couté Y, Vicoso B. 2018. Evolution of gene dosage on the Z-chromosome of schistosome parasites. eLife. 7, e35684. mla: Picard, Marion A. L., et al. “Evolution of Gene Dosage on the Z-Chromosome of Schistosome Parasites.” ELife, vol. 7, e35684, eLife Sciences Publications, 2018, doi:10.7554/eLife.35684. short: M.A.L. Picard, C. Cosseau, S. Ferré, T. Quack, C. Grevelding, Y. Couté, B. Vicoso, ELife 7 (2018). das_tickbox: '1' date_created: 2018-12-11T11:44:47Z date_published: 2018-08-13T00:00:00Z date_updated: 2026-07-28T09:45:56Z day: '13' ddc: - '570' department: - _id: BeVi doi: 10.7554/eLife.35684 external_id: isi: - '000441388200001' file: - access_level: open_access checksum: d6331d4385b1fffd6b47b45d5949d841 content_type: application/pdf creator: dernst date_created: 2018-12-17T11:55:05Z date_updated: 2020-07-14T12:44:43Z file_id: '5695' file_name: 2018_eLife_Picard.pdf file_size: 3158125 relation: main_file file_date_updated: 2020-07-14T12:44:43Z has_accepted_license: '1' intvolume: ' 7' isi: 1 language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 250ED89C-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P28842-B22 name: Sex chromosome evolution under male- and female- heterogamety publication: eLife publication_status: published publisher: eLife Sciences Publications publist_id: '7792' quality_controlled: '1' related_material: record: - id: '5586' relation: popular_science status: public scopus_import: '1' status: public title: Evolution of gene dosage on the Z-chromosome of schistosome parasites tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7 year: '2018' ... --- _id: '5586' abstract: - lang: eng text: Input files and scripts from "Evolution of gene dosage on the Z-chromosome of schistosome parasites" by Picard M.A.L., et al (2018). article_processing_charge: No author: - first_name: Beatriz full_name: Vicoso, Beatriz id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87 last_name: Vicoso orcid: 0000-0002-4579-8306 citation: ama: Vicoso B. Input files and scripts from “Evolution of gene dosage on the Z-chromosome of schistosome parasites” by Picard M.A.L., et al (2018). 2018. doi:10.15479/AT:ISTA:109 apa: Vicoso, B. (2018). Input files and scripts from “Evolution of gene dosage on the Z-chromosome of schistosome parasites” by Picard M.A.L., et al (2018). Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:109 chicago: Vicoso, Beatriz. “Input Files and Scripts from ‘Evolution of Gene Dosage on the Z-Chromosome of Schistosome Parasites’ by Picard M.A.L., et Al (2018).” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:109. ieee: B. Vicoso, “Input files and scripts from ‘Evolution of gene dosage on the Z-chromosome of schistosome parasites’ by Picard M.A.L., et al (2018).” Institute of Science and Technology Austria, 2018. ista: Vicoso B. 2018. Input files and scripts from ‘Evolution of gene dosage on the Z-chromosome of schistosome parasites’ by Picard M.A.L., et al (2018), Institute of Science and Technology Austria, 10.15479/AT:ISTA:109. mla: Vicoso, Beatriz. Input Files and Scripts from “Evolution of Gene Dosage on the Z-Chromosome of Schistosome Parasites” by Picard M.A.L., et Al (2018). Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:109. short: B. Vicoso, (2018). contributor: - first_name: Marion A id: 2C921A7A-F248-11E8-B48F-1D18A9856A87 last_name: Picard orcid: 0000-0002-8101-2518 datarep_id: '109' date_created: 2018-12-12T12:31:40Z date_published: 2018-07-24T00:00:00Z date_updated: 2026-07-28T09:45:56Z day: '24' ddc: - '570' department: - _id: BeVi doi: 10.15479/AT:ISTA:109 file: - access_level: open_access checksum: e60b484bd6f55c08eb66a189cb72c923 content_type: application/zip creator: system date_created: 2018-12-12T13:02:35Z date_updated: 2020-07-14T12:47:08Z file_id: '5601' file_name: IST-2018-109-v1+1_SupplementaryMethods.zip file_size: 11918144 relation: main_file file_date_updated: 2020-07-14T12:47:08Z has_accepted_license: '1' keyword: - schistosoma - Z-chromosome - gene expression license: https://creativecommons.org/publicdomain/zero/1.0/ month: '07' oa: 1 oa_version: Published Version project: - _id: 250ED89C-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P28842-B22 name: Sex chromosome evolution under male- and female- heterogamety publisher: Institute of Science and Technology Austria related_material: record: - id: '131' relation: research_paper status: public status: public title: Input files and scripts from "Evolution of gene dosage on the Z-chromosome of schistosome parasites" by Picard M.A.L., et al (2018) tmp: image: /images/cc_0.png legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode name: Creative Commons Public Domain Dedication (CC0 1.0) short: CC0 (1.0) type: research_data user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- OA_place: repository OA_type: green _id: '5996' abstract: - lang: eng text: 'In pipes, turbulence sets in despite the linear stability of the laminar Hagen–Poiseuille flow. The Reynolds number ( ) for which turbulence first appears in a given experiment – the ‘natural transition point’ – depends on imperfections of the set-up, or, more precisely, on the magnitude of finite amplitude perturbations. At onset, turbulence typically only occupies a certain fraction of the flow, and this fraction equally is found to differ from experiment to experiment. Despite these findings, Reynolds proposed that after sufficiently long times, flows may settle to steady conditions: below a critical velocity, flows should (regardless of initial conditions) always return to laminar, while above this velocity, eddying motion should persist. As will be shown, even in pipes several thousand diameters long, the spatio-temporal intermittent flow patterns observed at the end of the pipe strongly depend on the initial conditions, and there is no indication that different flow patterns would eventually settle to a (statistical) steady state. Exploiting the fact that turbulent puffs do not age (i.e. they are memoryless), we continuously recreate the puff sequence exiting the pipe at the pipe entrance, and in doing so introduce periodic boundary conditions for the puff pattern. This procedure allows us to study the evolution of the flow patterns for arbitrary long times, and we find that after times in excess of advective time units, indeed a statistical steady state is reached. Although the resulting flows remain spatio-temporally intermittent, puff splitting and decay rates eventually reach a balance, so that the turbulent fraction fluctuates around a well-defined level which only depends on . In accordance with Reynolds’ proposition, we find that at lower (here 2020), flows eventually always resume to laminar, while for higher ( ), turbulence persists. The critical point for pipe flow hence falls in the interval of $2020 , which is in very good agreement with the recently proposed value of . The latter estimate was based on single-puff statistics and entirely neglected puff interactions. Unlike in typical contact processes where such interactions strongly affect the percolation threshold, in pipe flow, the critical point is only marginally influenced. Interactions, on the other hand, are responsible for the approach to the statistical steady state. As shown, they strongly affect the resulting flow patterns, where they cause ‘puff clustering’, and these regions of large puff densities are observed to travel across the puff pattern in a wave-like fashion.' acknowledged_ssus: - _id: M-Shop acknowledgement: ' We also thank Philipp Maier and the IST Austria workshop for their dedicated technical support' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Mukund full_name: Vasudevan, Mukund id: 3C5A959A-F248-11E8-B48F-1D18A9856A87 last_name: Vasudevan - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 citation: ama: Vasudevan M, Hof B. The critical point of the transition to turbulence in pipe flow. Journal of Fluid Mechanics. 2018;839:76-94. doi:10.1017/jfm.2017.923 apa: Vasudevan, M., & Hof, B. (2018). The critical point of the transition to turbulence in pipe flow. Journal of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2017.923 chicago: Vasudevan, Mukund, and Björn Hof. “The Critical Point of the Transition to Turbulence in Pipe Flow.” Journal of Fluid Mechanics. Cambridge University Press, 2018. https://doi.org/10.1017/jfm.2017.923. ieee: M. Vasudevan and B. Hof, “The critical point of the transition to turbulence in pipe flow,” Journal of Fluid Mechanics, vol. 839. Cambridge University Press, pp. 76–94, 2018. ista: Vasudevan M, Hof B. 2018. The critical point of the transition to turbulence in pipe flow. Journal of Fluid Mechanics. 839, 76–94. mla: Vasudevan, Mukund, and Björn Hof. “The Critical Point of the Transition to Turbulence in Pipe Flow.” Journal of Fluid Mechanics, vol. 839, Cambridge University Press, 2018, pp. 76–94, doi:10.1017/jfm.2017.923. short: M. Vasudevan, B. Hof, Journal of Fluid Mechanics 839 (2018) 76–94. corr_author: '1' date_created: 2019-02-14T12:50:50Z date_published: 2018-03-25T00:00:00Z date_updated: 2026-07-28T14:02:09Z day: '25' department: - _id: BjHo doi: 10.1017/jfm.2017.923 ec_funded: 1 external_id: arxiv: - '1709.06372' isi: - '000437858300003' intvolume: ' 839' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1709.06372 month: '03' oa: 1 oa_version: Preprint page: 76-94 project: - _id: 25152F3A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '306589' name: Decoding the complexity of turbulence at its origin publication: Journal of Fluid Mechanics publication_identifier: eissn: - 1469-7645 issn: - 0022-1120 publication_status: published publisher: Cambridge University Press quality_controlled: '1' scopus_import: '1' status: public title: The critical point of the transition to turbulence in pipe flow type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 839 year: '2018' ... --- OA_place: publisher _id: '197' abstract: - lang: eng text: Modern computer vision systems heavily rely on statistical machine learning models, which typically require large amounts of labeled data to be learned reliably. Moreover, very recently computer vision research widely adopted techniques for representation learning, which further increase the demand for labeled data. However, for many important practical problems there is relatively small amount of labeled data available, so it is problematic to leverage full potential of the representation learning methods. One way to overcome this obstacle is to invest substantial resources into producing large labelled datasets. Unfortunately, this can be prohibitively expensive in practice. In this thesis we focus on the alternative way of tackling the aforementioned issue. We concentrate on methods, which make use of weakly-labeled or even unlabeled data. Specifically, the first half of the thesis is dedicated to the semantic image segmentation task. We develop a technique, which achieves competitive segmentation performance and only requires annotations in a form of global image-level labels instead of dense segmentation masks. Subsequently, we present a new methodology, which further improves segmentation performance by leveraging tiny additional feedback from a human annotator. By using our methods practitioners can greatly reduce the amount of data annotation effort, which is required to learn modern image segmentation models. In the second half of the thesis we focus on methods for learning from unlabeled visual data. We study a family of autoregressive models for modeling structure of natural images and discuss potential applications of these models. Moreover, we conduct in-depth study of one of these applications, where we develop the state-of-the-art model for the probabilistic image colorization task. acknowledgement: I also gratefully acknowledge the support of NVIDIA Corporation with the donation of the GPUs used for this research. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Alexander full_name: Kolesnikov, Alexander id: 2D157DB6-F248-11E8-B48F-1D18A9856A87 last_name: Kolesnikov citation: ama: Kolesnikov A. Weakly-supervised segmentation and unsupervised modeling of natural images. 2018. doi:10.15479/AT:ISTA:th_1021 apa: Kolesnikov, A. (2018). Weakly-supervised segmentation and unsupervised modeling of natural images. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1021 chicago: Kolesnikov, Alexander. “Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1021. ieee: A. Kolesnikov, “Weakly-supervised segmentation and unsupervised modeling of natural images,” Institute of Science and Technology Austria, 2018. ista: Kolesnikov A. 2018. Weakly-supervised segmentation and unsupervised modeling of natural images. Institute of Science and Technology Austria. mla: Kolesnikov, Alexander. Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1021. short: A. Kolesnikov, Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images, Institute of Science and Technology Austria, 2018. corr_author: '1' date_created: 2018-12-11T11:45:09Z date_published: 2018-05-25T00:00:00Z date_updated: 2026-07-29T13:22:05Z day: '25' ddc: - '004' degree_awarded: PhD department: - _id: ChLa - _id: GradSch doi: 10.15479/AT:ISTA:th_1021 doi_confirm: '1' ec_funded: 1 file: - access_level: open_access checksum: bc678e02468d8ebc39dc7267dfb0a1c4 content_type: application/pdf creator: system date_created: 2018-12-12T10:14:57Z date_updated: 2020-07-14T12:45:22Z file_id: '5113' file_name: IST-2018-1021-v1+1_thesis-unsigned-pdfa.pdf file_size: 12918758 relation: main_file - access_level: closed checksum: bc66973b086da5a043f1162dcfb1fde4 content_type: application/zip creator: dernst date_created: 2019-04-05T09:34:49Z date_updated: 2020-07-14T12:45:22Z file_id: '6225' file_name: 2018_Thesis_Kolesnikov_source.zip file_size: 55973760 relation: source_file file_date_updated: 2020-07-14T12:45:22Z has_accepted_license: '1' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: '113' project: - _id: 2532554C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '308036' name: Lifelong Learning of Visual Scene Understanding publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria publist_id: '7718' pubrep_id: '1021' status: public supervisor: - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 title: Weakly-supervised segmentation and unsupervised modeling of natural images type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2018' ... --- OA_place: publisher _id: '201' abstract: - lang: eng text: 'We describe arrangements of three-dimensional spheres from a geometrical and topological point of view. Real data (fitting this setup) often consist of soft spheres which show certain degree of deformation while strongly packing against each other. In this context, we answer the following questions: If we model a soft packing of spheres by hard spheres that are allowed to overlap, can we measure the volume in the overlapped areas? Can we be more specific about the overlap volume, i.e. quantify how much volume is there covered exactly twice, three times, or k times? What would be a good optimization criteria that rule the arrangement of soft spheres while making a good use of the available space? Fixing a particular criterion, what would be the optimal sphere configuration? The first result of this thesis are short formulas for the computation of volumes covered by at least k of the balls. The formulas exploit information contained in the order-k Voronoi diagrams and its closely related Level-k complex. The used complexes lead to a natural generalization into poset diagrams, a theoretical formalism that contains the order-k and degree-k diagrams as special cases. In parallel, we define different criteria to determine what could be considered an optimal arrangement from a geometrical point of view. Fixing a criterion, we find optimal soft packing configurations in 2D and 3D where the ball centers lie on a lattice. As a last step, we use tools from computational topology on real physical data, to show the potentials of higher-order diagrams in the description of melting crystals. The results of the experiments leaves us with an open window to apply the theories developed in this thesis in real applications.' alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Mabel full_name: Iglesias Ham, Mabel id: 41B58C0C-F248-11E8-B48F-1D18A9856A87 last_name: Iglesias Ham citation: ama: Iglesias Ham M. Multiple covers with balls. 2018. doi:10.15479/AT:ISTA:th_1026 apa: Iglesias Ham, M. (2018). Multiple covers with balls. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1026 chicago: Iglesias Ham, Mabel. “Multiple Covers with Balls.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1026. ieee: M. Iglesias Ham, “Multiple covers with balls,” Institute of Science and Technology Austria, 2018. ista: Iglesias Ham M. 2018. Multiple covers with balls. Institute of Science and Technology Austria. mla: Iglesias Ham, Mabel. Multiple Covers with Balls. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1026. short: M. Iglesias Ham, Multiple Covers with Balls, Institute of Science and Technology Austria, 2018. corr_author: '1' date_created: 2018-12-11T11:45:10Z date_published: 2018-06-11T00:00:00Z date_updated: 2026-07-29T13:24:38Z day: '11' ddc: - '514' - '516' degree_awarded: PhD department: - _id: HeEd - _id: GradSch doi: 10.15479/AT:ISTA:th_1026 doi_confirm: '1' file: - access_level: closed checksum: dd699303623e96d1478a6ae07210dd05 content_type: application/zip creator: kschuh date_created: 2019-02-05T07:43:31Z date_updated: 2020-07-14T12:45:24Z file_id: '5918' file_name: IST-2018-1025-v2+5_ist-thesis-iglesias-11June2018(1).zip file_size: 11827713 relation: source_file - access_level: open_access checksum: ba163849a190d2b41d66fef0e4983294 content_type: application/pdf creator: kschuh date_created: 2019-02-05T07:43:45Z date_updated: 2020-07-14T12:45:24Z file_id: '5919' file_name: IST-2018-1025-v2+4_ThesisIglesiasFinal11June2018.pdf file_size: 4783846 relation: main_file file_date_updated: 2020-07-14T12:45:24Z has_accepted_license: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: '171' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria publist_id: '7712' pubrep_id: '1026' status: public supervisor: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 title: Multiple covers with balls type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2018' ... --- OA_place: publisher _id: '68' abstract: - lang: eng text: The most common assumption made in statistical learning theory is the assumption of the independent and identically distributed (i.i.d.) data. While being very convenient mathematically, it is often very clearly violated in practice. This disparity between the machine learning theory and applications underlies a growing demand in the development of algorithms that learn from dependent data and theory that can provide generalization guarantees similar to the independent situations. This thesis is dedicated to two variants of dependencies that can arise in practice. One is a dependence on the level of samples in a single learning task. Another dependency type arises in the multi-task setting when the tasks are dependent on each other even though the data for them can be i.i.d. In both cases we model the data (samples or tasks) as stochastic processes and introduce new algorithms for both settings that take into account and exploit the resulting dependencies. We prove the theoretical guarantees on the performance of the introduced algorithms under different evaluation criteria and, in addition, we compliment the theoretical study by the empirical one, where we evaluate some of the algorithms on two real world datasets to highlight their practical applicability. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Alexander full_name: Zimin, Alexander id: 37099E9C-F248-11E8-B48F-1D18A9856A87 last_name: Zimin citation: ama: Zimin A. Learning from dependent data. 2018. doi:10.15479/AT:ISTA:TH1048 apa: Zimin, A. (2018). Learning from dependent data. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH1048 chicago: Zimin, Alexander. “Learning from Dependent Data.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH1048. ieee: A. Zimin, “Learning from dependent data,” Institute of Science and Technology Austria, 2018. ista: Zimin A. 2018. Learning from dependent data. Institute of Science and Technology Austria. mla: Zimin, Alexander. Learning from Dependent Data. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH1048. short: A. Zimin, Learning from Dependent Data, Institute of Science and Technology Austria, 2018. corr_author: '1' date_created: 2018-12-11T11:44:27Z date_published: 2018-09-01T00:00:00Z date_updated: 2026-07-29T13:31:12Z day: '01' ddc: - '004' - '519' degree_awarded: PhD department: - _id: ChLa - _id: GradSch doi: 10.15479/AT:ISTA:TH1048 doi_confirm: '1' ec_funded: 1 file: - access_level: open_access checksum: e849dd40a915e4d6c5572b51b517f098 content_type: application/pdf creator: dernst date_created: 2019-04-09T07:32:47Z date_updated: 2020-07-14T12:47:40Z file_id: '6253' file_name: 2018_Thesis_Zimin.pdf file_size: 1036137 relation: main_file - access_level: closed checksum: da092153cec55c97461bd53c45c5d139 content_type: application/zip creator: dernst date_created: 2019-04-09T07:32:47Z date_updated: 2020-07-14T12:47:40Z file_id: '6254' file_name: 2018_Thesis_Zimin_Source.zip file_size: 637490 relation: source_file file_date_updated: 2020-07-14T12:47:40Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '92' project: - _id: 2532554C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '308036' name: Lifelong Learning of Visual Scene Understanding publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria publist_id: '7986' pubrep_id: '1048' status: public supervisor: - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 title: Learning from dependent data type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2018' ... --- OA_place: publisher _id: '83' abstract: - lang: eng text: "A proof system is a protocol between a prover and a verifier over a common input in which an honest prover convinces the verifier of the validity of true statements. Motivated by the success of decentralized cryptocurrencies, exemplified by Bitcoin, the focus of this thesis will be on proof systems which found applications in some sustainable alternatives to Bitcoin, such as the Spacemint and Chia cryptocurrencies. In particular, we focus on proofs of space and proofs of sequential work.\r\nProofs of space (PoSpace) were suggested as more ecological, economical, and egalitarian alternative to the energy-wasteful proof-of-work mining of Bitcoin. However, the state-of-the-art constructions of PoSpace are based on sophisticated graph pebbling lower bounds, and are therefore complex. Moreover, when these PoSpace are used in cryptocurrencies like Spacemint, miners can only start mining after ensuring that a commitment to their space is already added in a special transaction to the blockchain. Proofs of sequential work (PoSW) are proof systems in which a prover, upon receiving a statement x and a time parameter T, computes a proof which convinces the verifier that T time units had passed since x was received. Whereas Spacemint assumes synchrony to retain some interesting Bitcoin dynamics, Chia requires PoSW with unique proofs, i.e., PoSW in which it is hard to come up with more than one accepting proof for any true statement. In this thesis we construct simple and practically-efficient PoSpace and PoSW. When using our PoSpace in cryptocurrencies, miners can start mining on the fly, like in Bitcoin, and unlike current constructions of PoSW, which either achieve efficient verification of sequential work, or faster-than-recomputing verification of correctness of proofs, but not both at the same time, ours achieve the best of these two worlds." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Hamza M full_name: Abusalah, Hamza M id: 40297222-F248-11E8-B48F-1D18A9856A87 last_name: Abusalah citation: ama: Abusalah HM. Proof systems for sustainable decentralized cryptocurrencies. 2018. doi:10.15479/AT:ISTA:TH_1046 apa: Abusalah, H. M. (2018). Proof systems for sustainable decentralized cryptocurrencies. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1046 chicago: Abusalah, Hamza M. “Proof Systems for Sustainable Decentralized Cryptocurrencies.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1046. ieee: H. M. Abusalah, “Proof systems for sustainable decentralized cryptocurrencies,” Institute of Science and Technology Austria, 2018. ista: Abusalah HM. 2018. Proof systems for sustainable decentralized cryptocurrencies. Institute of Science and Technology Austria. mla: Abusalah, Hamza M. Proof Systems for Sustainable Decentralized Cryptocurrencies. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1046. short: H.M. Abusalah, Proof Systems for Sustainable Decentralized Cryptocurrencies, Institute of Science and Technology Austria, 2018. corr_author: '1' date_created: 2018-12-11T11:44:32Z date_published: 2018-09-05T00:00:00Z date_updated: 2026-07-29T13:38:08Z day: '05' ddc: - '004' degree_awarded: PhD department: - _id: KrPi - _id: GradSch doi: 10.15479/AT:ISTA:TH_1046 doi_confirm: '1' ec_funded: 1 file: - access_level: open_access checksum: c4b5f7d111755d1396787f41886fc674 content_type: application/pdf creator: dernst date_created: 2019-04-09T06:43:41Z date_updated: 2020-07-14T12:48:11Z file_id: '6245' file_name: 2018_Thesis_Abusalah.pdf file_size: 876241 relation: main_file - access_level: closed checksum: 0f382ac56b471c48fd907d63eb87dafe content_type: application/x-gzip creator: dernst date_created: 2019-04-09T06:43:41Z date_updated: 2020-07-14T12:48:11Z file_id: '6246' file_name: 2018_Thesis_Abusalah_source.tar.gz file_size: 2029190 relation: source_file file_date_updated: 2020-07-14T12:48:11Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '59' project: - _id: 258C570E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '259668' name: Provable Security for Physical Cryptography - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria publist_id: '7971' pubrep_id: '1046' related_material: record: - id: '559' relation: part_of_dissertation status: public - id: '1236' relation: part_of_dissertation status: public - id: '1235' relation: part_of_dissertation status: public - id: '1229' relation: part_of_dissertation status: public status: public supervisor: - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 title: Proof systems for sustainable decentralized cryptocurrencies type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2018' ... --- _id: '1012' abstract: - lang: eng text: We prove a new central limit theorem (CLT) for the difference of linear eigenvalue statistics of a Wigner random matrix H and its minor H and find that the fluctuation is much smaller than the fluctuations of the individual linear statistics, as a consequence of the strong correlation between the eigenvalues of H and H. In particular, our theorem identifies the fluctuation of Kerov's rectangular Young diagrams, defined by the interlacing eigenvalues ofH and H, around their asymptotic shape, the Vershik'Kerov'Logan'Shepp curve. Young diagrams equipped with the Plancherel measure follow the same limiting shape. For this, algebraically motivated, ensemble a CLT has been obtained in Ivanov and Olshanski [20] which is structurally similar to our result but the variance is different, indicating that the analogy between the two models has its limitations. Moreover, our theorem shows that Borodin's result [7] on the convergence of the spectral distribution of Wigner matrices to a Gaussian free field also holds in derivative sense. 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: Dominik J full_name: Schröder, Dominik J id: 408ED176-F248-11E8-B48F-1D18A9856A87 last_name: Schröder orcid: 0000-0002-2904-1856 citation: ama: Erdös L, Schröder DJ. Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. International Mathematics Research Notices. 2018;2018(10):3255-3298. doi:10.1093/imrn/rnw330 apa: Erdös, L., & Schröder, D. J. (2018). Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnw330 chicago: Erdös, László, and Dominik J Schröder. “Fluctuations of Rectangular Young Diagrams of Interlacing Wigner Eigenvalues.” International Mathematics Research Notices. Oxford University Press, 2018. https://doi.org/10.1093/imrn/rnw330. ieee: L. Erdös and D. J. Schröder, “Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues,” International Mathematics Research Notices, vol. 2018, no. 10. Oxford University Press, pp. 3255–3298, 2018. ista: Erdös L, Schröder DJ. 2018. Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. International Mathematics Research Notices. 2018(10), 3255–3298. mla: Erdös, László, and Dominik J. Schröder. “Fluctuations of Rectangular Young Diagrams of Interlacing Wigner Eigenvalues.” International Mathematics Research Notices, vol. 2018, no. 10, Oxford University Press, 2018, pp. 3255–98, doi:10.1093/imrn/rnw330. short: L. Erdös, D.J. Schröder, International Mathematics Research Notices 2018 (2018) 3255–3298. date_created: 2018-12-11T11:49:41Z date_published: 2018-05-18T00:00:00Z date_updated: 2026-07-29T13:46:19Z day: '18' department: - _id: LaEr doi: 10.1093/imrn/rnw330 ec_funded: 1 external_id: arxiv: - '1608.05163' isi: - '000441668300009' intvolume: ' 2018' isi: 1 issue: '10' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1608.05163 month: '05' oa: 1 oa_version: Preprint page: 3255-3298 project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication: International Mathematics Research Notices publication_identifier: issn: - 1073-7928 publication_status: published publisher: Oxford University Press publist_id: '6383' quality_controlled: '1' related_material: record: - id: '6179' relation: dissertation_contains status: public scopus_import: '1' status: public title: Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2018 year: '2018' ... --- OA_place: publisher _id: '49' abstract: - lang: eng text: Nowadays, quantum computation is receiving more and more attention as an alternative to the classical way of computing. For realizing a quantum computer, different devices are investigated as potential quantum bits. In this thesis, the focus is on Ge hut wires, which turned out to be promising candidates for implementing hole spin quantum bits. The advantages of Ge as a material system are the low hyperfine interaction for holes and the strong spin orbit coupling, as well as the compatibility with the highly developed CMOS processes in industry. In addition, Ge can also be isotopically purified which is expected to boost the spin coherence times. The strong spin orbit interaction for holes in Ge on the one hand enables the full electrical control of the quantum bit and on the other hand should allow short spin manipulation times. Starting with a bare Si wafer, this work covers the entire process reaching from growth over the fabrication and characterization of hut wire devices up to the demonstration of hole spin resonance. From experiments with single quantum dots, a large g-factor anisotropy between the in-plane and the out-of-plane direction was found. A comparison to a theoretical model unveiled the heavy-hole character of the lowest energy states. The second part of the thesis addresses double quantum dot devices, which were realized by adding two gate electrodes to a hut wire. In such devices, Pauli spin blockade was observed, which can serve as a read-out mechanism for spin quantum bits. Applying oscillating electric fields in spin blockade allowed the demonstration of continuous spin rotations and the extraction of a lower bound for the spin dephasing time. Despite the strong spin orbit coupling in Ge, the obtained value for the dephasing time is comparable to what has been recently reported for holes in Si. All in all, the presented results point out the high potential of Ge hut wires as a platform for long-lived, fast and fully electrically tunable hole spin quantum bits. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Hannes full_name: Watzinger, Hannes id: 35DF8E50-F248-11E8-B48F-1D18A9856A87 last_name: Watzinger citation: ama: Watzinger H. Ge hut wires - from growth to hole spin resonance. 2018. doi:10.15479/AT:ISTA:th_1033 apa: Watzinger, H. (2018). Ge hut wires - from growth to hole spin resonance. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1033 chicago: Watzinger, Hannes. “Ge Hut Wires - from Growth to Hole Spin Resonance.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1033. ieee: H. Watzinger, “Ge hut wires - from growth to hole spin resonance,” Institute of Science and Technology Austria, 2018. ista: Watzinger H. 2018. Ge hut wires - from growth to hole spin resonance. Institute of Science and Technology Austria. mla: Watzinger, Hannes. Ge Hut Wires - from Growth to Hole Spin Resonance. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1033. short: H. Watzinger, Ge Hut Wires - from Growth to Hole Spin Resonance, Institute of Science and Technology Austria, 2018. corr_author: '1' date_created: 2018-12-11T11:44:21Z date_published: 2018-07-30T00:00:00Z date_updated: 2026-07-31T09:15:25Z day: '30' ddc: - '530' degree_awarded: PhD department: - _id: GeKa - _id: GradSch doi: 10.15479/AT:ISTA:th_1033 doi_confirm: '1' file: - access_level: open_access checksum: b653b5216251f938ddbeafd1de88667c content_type: application/pdf creator: dernst date_created: 2019-04-09T07:13:28Z date_updated: 2020-07-14T12:46:35Z file_id: '6249' file_name: 2018_Thesis_Watzinger.pdf file_size: 85539748 relation: main_file - access_level: closed checksum: 39bcf8de7ac5b1bb516b11ce2f966785 content_type: application/zip creator: dernst date_created: 2019-04-09T07:13:27Z date_updated: 2020-07-14T12:46:35Z file_id: '6250' file_name: 2018_Thesis_Watzinger_source.zip file_size: 21830697 relation: source_file file_date_updated: 2020-07-14T12:46:35Z has_accepted_license: '1' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: '77' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria publist_id: '8005' pubrep_id: '1033' status: public supervisor: - first_name: Georgios full_name: Katsaros, Georgios id: 38DB5788-F248-11E8-B48F-1D18A9856A87 last_name: Katsaros orcid: 0000-0001-8342-202X title: Ge hut wires - from growth to hole spin resonance 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: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2018' ... --- _id: '566' abstract: - lang: eng text: "We consider large random matrices X with centered, independent entries which have comparable but not necessarily identical variances. Girko's circular law asserts that the spectrum is supported in a disk and in case of identical variances, the limiting density is uniform. In this special case, the local circular law by Bourgade et. al. [11,12] shows that the empirical density converges even locally on scales slightly above the typical eigenvalue spacing. In the general case, the limiting density is typically inhomogeneous and it is obtained via solving a system of deterministic equations. Our main result is the local inhomogeneous circular law in the bulk spectrum on the optimal scale for a general variance profile of the entries of X. \r\n\r\n" article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Johannes full_name: Alt, Johannes id: 36D3D8B6-F248-11E8-B48F-1D18A9856A87 last_name: Alt - 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: Torben H full_name: Krüger, Torben H id: 3020C786-F248-11E8-B48F-1D18A9856A87 last_name: Krüger orcid: 0000-0002-4821-3297 citation: ama: Alt J, Erdös L, Krüger TH. Local inhomogeneous circular law. Annals of Applied Probability. 2018;28(1):148-203. doi:10.1214/17-AAP1302 apa: Alt, J., Erdös, L., & Krüger, T. H. (2018). Local inhomogeneous circular law. Annals of Applied Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/17-AAP1302 chicago: Alt, Johannes, László Erdös, and Torben H Krüger. “Local Inhomogeneous Circular Law.” Annals of Applied Probability. Institute of Mathematical Statistics, 2018. https://doi.org/10.1214/17-AAP1302. ieee: J. Alt, L. Erdös, and T. H. Krüger, “Local inhomogeneous circular law,” Annals of Applied Probability, vol. 28, no. 1. Institute of Mathematical Statistics, pp. 148–203, 2018. ista: Alt J, Erdös L, Krüger TH. 2018. Local inhomogeneous circular law. Annals of Applied Probability. 28(1), 148–203. mla: Alt, Johannes, et al. “Local Inhomogeneous Circular Law.” Annals of Applied Probability, vol. 28, no. 1, Institute of Mathematical Statistics, 2018, pp. 148–203, doi:10.1214/17-AAP1302. short: J. Alt, L. Erdös, T.H. Krüger, Annals of Applied Probability 28 (2018) 148–203. corr_author: '1' das_tickbox: '1' date_created: 2018-12-11T11:47:13Z date_published: 2018-03-03T00:00:00Z date_updated: 2026-08-05T08:14:17Z day: '03' department: - _id: LaEr doi: 10.1214/17-AAP1302 ec_funded: 1 external_id: arxiv: - '1612.07776 ' isi: - '000431721800005' intvolume: ' 28' isi: 1 issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: 'https://arxiv.org/abs/1612.07776 ' month: '03' oa: 1 oa_version: Preprint page: 148-203 project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication: Annals of Applied Probability publication_status: published publisher: Institute of Mathematical Statistics quality_controlled: '1' related_material: record: - id: '149' relation: dissertation_contains status: public scopus_import: '1' status: public title: Local inhomogeneous circular law type: journal_article user_id: 9947682f-b9fa-11ee-9c4a-b3ffaafe6614 volume: 28 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. 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, 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, 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, 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: 2026-08-12T06:28:50Z 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 month: '12' oa: 1 oa_version: Published Version publication: Journal of the Royal Society Interface publication_identifier: issn: - 1742-5689 publication_status: published publisher: Royal Society 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 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. 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, 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, 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, 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: 2026-08-12T06:28:34Z 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: - 1742-5689 publication_status: published publisher: Royal Society quality_controlled: '1' scopus_import: '1' status: public title: Zipf's Law, unbounded complexity and open-ended evolution type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 15 year: '2018' ... --- _id: '5980' abstract: - lang: eng text: The problem of private set-intersection (PSI) has been traditionally treated as an instance of the more general problem of multi-party computation (MPC). Consequently, in order to argue security, or compose these protocols one has to rely on the general theory that was developed for the purpose of MPC. The pursuit of efficient protocols, however, has resulted in designs that exploit properties pertaining to PSI. In almost all practical applications where a PSI protocol is deployed, it is expected to be executed multiple times, possibly on related inputs. In this work we initiate a dedicated study of PSI in the multi-interaction (MI) setting. In this model a server sets up the common system parameters and executes set-intersection multiple times with potentially different clients. We discuss a few attacks that arise when protocols are naïvely composed in this manner and, accordingly, craft security definitions for the MI setting and study their inter-relation. Finally, we suggest a set of protocols that are MI-secure, at the same time almost as efficient as their parent, stand-alone, protocols. article_processing_charge: No author: - first_name: Sanjit full_name: Chatterjee, Sanjit last_name: Chatterjee - first_name: Chethan full_name: Kamath Hosdurg, Chethan id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87 last_name: Kamath Hosdurg orcid: 0009-0006-6812-7317 - first_name: Vikas full_name: Kumar, Vikas last_name: Kumar citation: ama: Chatterjee S, Kamath Hosdurg C, Kumar V. Private set-intersection with common set-up. Advances in Mathematics of Communications. 2018;12(1):17-47. doi:10.3934/amc.2018002 apa: Chatterjee, S., Kamath Hosdurg, C., & Kumar, V. (2018). Private set-intersection with common set-up. Advances in Mathematics of Communications. AIMS. https://doi.org/10.3934/amc.2018002 chicago: Chatterjee, Sanjit, Chethan Kamath Hosdurg, and Vikas Kumar. “Private Set-Intersection with Common Set-Up.” Advances in Mathematics of Communications. AIMS, 2018. https://doi.org/10.3934/amc.2018002. ieee: S. Chatterjee, C. Kamath Hosdurg, and V. Kumar, “Private set-intersection with common set-up,” Advances in Mathematics of Communications, vol. 12, no. 1. AIMS, pp. 17–47, 2018. ista: Chatterjee S, Kamath Hosdurg C, Kumar V. 2018. Private set-intersection with common set-up. Advances in Mathematics of Communications. 12(1), 17–47. mla: Chatterjee, Sanjit, et al. “Private Set-Intersection with Common Set-Up.” Advances in Mathematics of Communications, vol. 12, no. 1, AIMS, 2018, pp. 17–47, doi:10.3934/amc.2018002. short: S. Chatterjee, C. Kamath Hosdurg, V. Kumar, Advances in Mathematics of Communications 12 (2018) 17–47. date_created: 2019-02-13T13:49:41Z date_published: 2018-02-01T00:00:00Z date_updated: 2026-08-12T09:13:26Z day: '01' department: - _id: KrPi doi: 10.3934/amc.2018002 external_id: isi: - '000430950400002' intvolume: ' 12' isi: 1 issue: '1' language: - iso: eng month: '02' oa_version: None page: 17-47 publication: Advances in Mathematics of Communications publication_identifier: issn: - 1930-5346 publication_status: published publisher: AIMS quality_controlled: '1' scopus_import: '1' status: public title: Private set-intersection with common set-up type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 12 year: '2018' ...