[{"doi":"10.1609/aaai.v34i02.5546","_id":"9197","article_type":"original","acknowledgement":"This research was supported by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE), Z211-N23 (Wittgenstein Award), and M 2369-N33 (Meitner fellowship).","year":"2020","citation":{"mla":"Avni, Guy, et al. “All-Pay Bidding Games on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02, Association for the Advancement of Artificial Intelligence, 2020, pp. 1798–805, doi:10.1609/aaai.v34i02.5546.","chicago":"Avni, Guy, Rasmus Ibsen-Jensen, and Josef Tkadlec. “All-Pay Bidding Games on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i02.5546.","ista":"Avni G, Ibsen-Jensen R, Tkadlec J. 2020. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 34(02), 1798–1805.","short":"G. Avni, R. Ibsen-Jensen, J. Tkadlec, Proceedings of the AAAI Conference on Artificial Intelligence 34 (2020) 1798–1805.","ieee":"G. Avni, R. Ibsen-Jensen, and J. Tkadlec, “All-pay bidding games on graphs,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02. Association for the Advancement of Artificial Intelligence, pp. 1798–1805, 2020.","ama":"Avni G, Ibsen-Jensen R, Tkadlec J. All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. 2020;34(02):1798-1805. doi:10.1609/aaai.v34i02.5546","apa":"Avni, G., Ibsen-Jensen, R., & Tkadlec, J. (2020). All-pay bidding games on graphs. Proceedings of the AAAI Conference on Artificial Intelligence. New York, NY, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v34i02.5546"},"date_created":"2021-02-25T09:05:18Z","publisher":"Association for the Advancement of Artificial Intelligence","date_published":"2020-04-03T00:00:00Z","page":"1798-1805","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"quality_controlled":"1","volume":34,"project":[{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369"}],"external_id":{"arxiv":["1911.08360"]},"abstract":[{"text":"In this paper we introduce and study all-pay bidding games, a class of two player, zero-sum games on graphs. The game proceeds as follows. We place a token on some vertex in the graph and assign budgets to the two players. Each turn, each player submits a sealed legal bid (non-negative and below their remaining budget), which is deducted from their budget and the highest bidder moves the token onto an adjacent vertex. The game ends once a sink is reached, and Player 1 pays Player 2 the outcome that is associated with the sink. The players attempt to maximize their expected outcome. Our games model settings where effort (of no inherent value) needs to be invested in an ongoing and stateful manner. On the negative side, we show that even in simple games on DAGs, optimal strategies may require a distribution over bids with infinite support. A central quantity in bidding games is the ratio of the players budgets. On the positive side, we show a simple FPTAS for DAGs, that, for each budget ratio, outputs an approximation for the optimal strategy for that ratio. We also implement it, show that it performs well, and suggests interesting properties of these games. Then, given an outcome c, we show an algorithm for finding the necessary and sufficient initial ratio for guaranteeing outcome c with probability 1 and a strategy ensuring such. Finally, while the general case has not previously been studied, solving the specific game in which Player 1 wins iff he wins the first two auctions, has been long stated as an open question, which we solve.","lang":"eng"}],"publication_status":"published","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","language":[{"iso":"eng"}],"intvolume":" 34","scopus_import":"1","date_updated":"2023-09-05T12:40:00Z","article_processing_charge":"No","issue":"02","title":"All-pay bidding games on graphs","status":"public","type":"journal_article","conference":{"location":"New York, NY, United States","end_date":"2020-02-12","name":"AAAI: Conference on Artificial Intelligence","start_date":"2020-02-07"},"publication_identifier":{"eissn":["2374-3468"],"isbn":["9781577358350"],"issn":["2159-5399"]},"month":"04","oa_version":"Preprint","day":"03","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","full_name":"Avni, Guy","first_name":"Guy"},{"full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389"},{"first_name":"Josef","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"}],"arxiv":1},{"publication_status":"published","ddc":["000"],"abstract":[{"lang":"eng","text":"The optimization of multilayer neural networks typically leads to a solution\r\nwith zero training error, yet the landscape can exhibit spurious local minima\r\nand the minima can be disconnected. In this paper, we shed light on this\r\nphenomenon: we show that the combination of stochastic gradient descent (SGD)\r\nand over-parameterization makes the landscape of multilayer neural networks\r\napproximately connected and thus more favorable to optimization. More\r\nspecifically, we prove that SGD solutions are connected via a piecewise linear\r\npath, and the increase in loss along this path vanishes as the number of\r\nneurons grows large. This result is a consequence of the fact that the\r\nparameters found by SGD are increasingly dropout stable as the network becomes\r\nwider. We show that, if we remove part of the neurons (and suitably rescale the\r\nremaining ones), the change in loss is independent of the total number of\r\nneurons, and it depends only on how many neurons are left. Our results exhibit\r\na mild dependence on the input dimension: they are dimension-free for two-layer\r\nnetworks and depend linearly on the dimension for multilayer networks. We\r\nvalidate our theoretical findings with numerical experiments for different\r\narchitectures and classification tasks."}],"external_id":{"arxiv":["1912.10095"]},"project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"date_published":"2020-07-13T00:00:00Z","publisher":"ML Research Press","volume":119,"quality_controlled":"1","department":[{"_id":"MaMo"}],"page":"8773-8784","year":"2020","acknowledgement":"M. Mondelli was partially supported by the 2019 LopezLoreta Prize. The authors thank Phan-Minh Nguyen for helpful discussions and the IST Distributed Algorithms and Systems Lab for providing computational resources.","citation":{"apa":"Shevchenko, A., & Mondelli, M. (2020). Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks. In Proceedings of the 37th International Conference on Machine Learning (Vol. 119, pp. 8773–8784). ML Research Press.","ieee":"A. Shevchenko and M. Mondelli, “Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks,” in Proceedings of the 37th International Conference on Machine Learning, 2020, vol. 119, pp. 8773–8784.","ama":"Shevchenko A, Mondelli M. Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks. In: Proceedings of the 37th International Conference on Machine Learning. Vol 119. ML Research Press; 2020:8773-8784.","short":"A. Shevchenko, M. Mondelli, in:, Proceedings of the 37th International Conference on Machine Learning, ML Research Press, 2020, pp. 8773–8784.","mla":"Shevchenko, Alexander, and Marco Mondelli. “Landscape Connectivity and Dropout Stability of SGD Solutions for Over-Parameterized Neural Networks.” Proceedings of the 37th International Conference on Machine Learning, vol. 119, ML Research Press, 2020, pp. 8773–84.","chicago":"Shevchenko, Alexander, and Marco Mondelli. “Landscape Connectivity and Dropout Stability of SGD Solutions for Over-Parameterized Neural Networks.” In Proceedings of the 37th International Conference on Machine Learning, 119:8773–84. ML Research Press, 2020.","ista":"Shevchenko A, Mondelli M. 2020. Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks. Proceedings of the 37th International Conference on Machine Learning. vol. 119, 8773–8784."},"date_created":"2021-02-25T09:36:22Z","_id":"9198","file_date_updated":"2021-03-02T15:38:14Z","arxiv":1,"author":[{"full_name":"Shevchenko, Alexander","first_name":"Alexander","last_name":"Shevchenko"},{"first_name":"Marco","full_name":"Mondelli, Marco","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020"}],"month":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_size":5336380,"creator":"dernst","date_updated":"2021-03-02T15:38:14Z","date_created":"2021-03-02T15:38:14Z","checksum":"f042c8d4316bd87c6361aa76f1fbdbbe","file_name":"2020_PMLR_Shevchenko.pdf","file_id":"9217","success":1}],"day":"13","oa_version":"Published Version","type":"conference","status":"public","article_processing_charge":"No","oa":1,"date_updated":"2024-09-10T13:03:19Z","title":"Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks","has_accepted_license":"1","intvolume":" 119","language":[{"iso":"eng"}],"publication":"Proceedings of the 37th International Conference on Machine Learning"},{"project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"quality_controlled":"1","page":"244-256","department":[{"_id":"ToHe"}],"date_published":"2020-12-01T00:00:00Z","publisher":"IEEE","publication_status":"published","abstract":[{"text":"We propose a novel hybridization method for stability analysis that over-approximates nonlinear dynamical systems by switched systems with linear inclusion dynamics. We observe that existing hybridization techniques for safety analysis that over-approximate nonlinear dynamical systems by switched affine inclusion dynamics and provide fixed approximation error, do not suffice for stability analysis. Hence, we propose a hybridization method that provides a state-dependent error which converges to zero as the state tends to the equilibrium point. The crux of our hybridization computation is an elegant recursive algorithm that uses partial derivatives of a given function to obtain upper and lower bound matrices for the over-approximating linear inclusion. We illustrate our method on some examples to demonstrate the application of the theory for stability analysis. In particular, our method is able to establish stability of a nonlinear system which does not admit a polynomial Lyapunov function.","lang":"eng"}],"external_id":{"isi":["000680435100021"]},"ddc":["000"],"_id":"9202","file_date_updated":"2021-02-26T16:38:14Z","doi":"10.1109/RTSS49844.2020.00031","date_created":"2021-02-26T16:38:24Z","citation":{"apa":"Garcia Soto, M., & Prabhakar, P. (2020). Hybridization for stability verification of nonlinear switched systems. In 2020 IEEE Real-Time Systems Symposium (pp. 244–256). Houston, TX, USA : IEEE. https://doi.org/10.1109/RTSS49844.2020.00031","chicago":"Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.” In 2020 IEEE Real-Time Systems Symposium, 244–56. IEEE, 2020. https://doi.org/10.1109/RTSS49844.2020.00031.","ista":"Garcia Soto M, Prabhakar P. 2020. Hybridization for stability verification of nonlinear switched systems. 2020 IEEE Real-Time Systems Symposium. RTTS: Real-Time Systems Symposium, 244–256.","mla":"Garcia Soto, Miriam, and Pavithra Prabhakar. “Hybridization for Stability Verification of Nonlinear Switched Systems.” 2020 IEEE Real-Time Systems Symposium, IEEE, 2020, pp. 244–56, doi:10.1109/RTSS49844.2020.00031.","ama":"Garcia Soto M, Prabhakar P. Hybridization for stability verification of nonlinear switched systems. In: 2020 IEEE Real-Time Systems Symposium. IEEE; 2020:244-256. doi:10.1109/RTSS49844.2020.00031","ieee":"M. Garcia Soto and P. Prabhakar, “Hybridization for stability verification of nonlinear switched systems,” in 2020 IEEE Real-Time Systems Symposium, Houston, TX, USA , 2020, pp. 244–256.","short":"M. Garcia Soto, P. Prabhakar, in:, 2020 IEEE Real-Time Systems Symposium, IEEE, 2020, pp. 244–256."},"year":"2020","acknowledgement":"Miriam Garc´ıa Soto was partially supported by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award). Pavithra Prabhakar was partially supported by NSF CAREER Award No. 1552668, NSF Award No. 2008957 and ONR YIP Award No. N000141712577.","type":"conference","status":"public","author":[{"id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","last_name":"Garcia Soto","orcid":"0000-0003-2936-5719","full_name":"Garcia Soto, Miriam","first_name":"Miriam"},{"last_name":"Prabhakar","first_name":"Pavithra","full_name":"Prabhakar, Pavithra"}],"file":[{"creator":"mgarcias","access_level":"open_access","file_size":1125794,"content_type":"application/pdf","relation":"main_file","checksum":"8f97f229316c3b3a6f0cf99297aa0941","file_name":"main.pdf","file_id":"9203","date_updated":"2021-02-26T16:38:14Z","date_created":"2021-02-26T16:38:14Z"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"01","oa_version":"Submitted Version","publication_identifier":{"eissn":["2576-3172"],"eisbn":["9781728183244"]},"month":"12","conference":{"start_date":"2020-12-01","name":"RTTS: Real-Time Systems Symposium","end_date":"2020-12-04","location":"Houston, TX, USA "},"language":[{"iso":"eng"}],"publication":"2020 IEEE Real-Time Systems Symposium","title":"Hybridization for stability verification of nonlinear switched systems","article_processing_charge":"No","oa":1,"date_updated":"2024-02-22T13:25:19Z","has_accepted_license":"1","isi":1},{"title":"A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion","issue":"9","article_processing_charge":"No","date_updated":"2021-03-03T09:43:14Z","scopus_import":"1","intvolume":" 2","language":[{"iso":"eng"}],"publication":"SN Applied Sciences","author":[{"full_name":"Laccone, Francesco","first_name":"Francesco","last_name":"Laccone"},{"last_name":"Malomo","full_name":"Malomo, Luigi","first_name":"Luigi"},{"first_name":"Jesus","full_name":"Perez Rodriguez, Jesus","id":"2DC83906-F248-11E8-B48F-1D18A9856A87","last_name":"Perez Rodriguez"},{"first_name":"Nico","full_name":"Pietroni, Nico","last_name":"Pietroni"},{"first_name":"Federico","full_name":"Ponchio, Federico","last_name":"Ponchio"},{"orcid":"0000-0001-6511-9385","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd","first_name":"Bernd"},{"last_name":"Cignoni","first_name":"Paolo","full_name":"Cignoni, Paolo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","oa_version":"None","month":"09","publication_identifier":{"eissn":["25233971"]},"type":"journal_article","status":"public","date_created":"2021-02-28T23:01:25Z","citation":{"apa":"Laccone, F., Malomo, L., Perez Rodriguez, J., Pietroni, N., Ponchio, F., Bickel, B., & Cignoni, P. (2020). A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion. SN Applied Sciences. Springer Nature. https://doi.org/10.1007/s42452-020-03305-w","ama":"Laccone F, Malomo L, Perez Rodriguez J, et al. A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion. SN Applied Sciences. 2020;2(9). doi:10.1007/s42452-020-03305-w","ieee":"F. Laccone et al., “A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion,” SN Applied Sciences, vol. 2, no. 9. Springer Nature, 2020.","short":"F. Laccone, L. Malomo, J. Perez Rodriguez, N. Pietroni, F. Ponchio, B. Bickel, P. Cignoni, SN Applied Sciences 2 (2020).","ista":"Laccone F, Malomo L, Perez Rodriguez J, Pietroni N, Ponchio F, Bickel B, Cignoni P. 2020. A bending-active twisted-arch plywood structure: Computational design and fabrication of the FlexMaps Pavilion. SN Applied Sciences. 2(9), 1505.","chicago":"Laccone, Francesco, Luigi Malomo, Jesus Perez Rodriguez, Nico Pietroni, Federico Ponchio, Bernd Bickel, and Paolo Cignoni. “A Bending-Active Twisted-Arch Plywood Structure: Computational Design and Fabrication of the FlexMaps Pavilion.” SN Applied Sciences. Springer Nature, 2020. https://doi.org/10.1007/s42452-020-03305-w.","mla":"Laccone, Francesco, et al. “A Bending-Active Twisted-Arch Plywood Structure: Computational Design and Fabrication of the FlexMaps Pavilion.” SN Applied Sciences, vol. 2, no. 9, 1505, Springer Nature, 2020, doi:10.1007/s42452-020-03305-w."},"year":"2020","acknowledgement":"The FlexMaps Pavilion has been awarded First Prize at the “Competition and Exhibition of innovative lightweight structures” organized by the IASS Working Group 21 within the FORM and FORCE, joint international conference of IASS Symposium 2019 and Structural Membranes 2019 (Barcelona, 7-11 October 2019) with the following motivation: “for its structural innovation of bending-twisting system, connection constructability and exquisite craftmanship”[20]. The authors would like to acknowledge the Visual Computing Lab Staff of ISTI - CNR, in particular Thomas Alderighi, Marco Callieri, Paolo Pingi; Antonio Rizzo of IPCF - CNR; and the Administrative Staff of ISTI - CNR. This research was partially funded by the EU H2020 Programme EVOCATION: Advanced Visual and Geometric Computing for 3D Capture, Display, and Fabrication (grant no. 813170).","article_number":"1505","_id":"9208","article_type":"original","doi":"10.1007/s42452-020-03305-w","publication_status":"published","abstract":[{"text":"Bending-active structures are able to efficiently produce complex curved shapes from flat panels. The desired deformation of the panels derives from the proper selection of their elastic properties. Optimized panels, called FlexMaps, are designed such that, once they are bent and assembled, the resulting static equilibrium configuration matches a desired input 3D shape. The FlexMaps elastic properties are controlled by locally varying spiraling geometric mesostructures, which are optimized in size and shape to match specific bending requests, namely the global curvature of the target shape. The design pipeline starts from a quad mesh representing the input 3D shape, which defines the edge size and the total amount of spirals: every quad will embed one spiral. Then, an optimization algorithm tunes the geometry of the spirals by using a simplified pre-computed rod model. This rod model is derived from a non-linear regression algorithm which approximates the non-linear behavior of solid FEM spiral models subject to hundreds of load combinations. This innovative pipeline has been applied to the project of a lightweight plywood pavilion named FlexMaps Pavilion, which is a single-layer piecewise twisted arch that fits a bounding box of 3.90x3.96x3.25 meters. This case study serves to test the applicability of this methodology at the architectural scale. The structure is validated via FE analyses and the fabrication of the full scale prototype.","lang":"eng"}],"volume":2,"quality_controlled":"1","department":[{"_id":"BeBi"}],"date_published":"2020-09-01T00:00:00Z","publisher":"Springer Nature"},{"conference":{"location":"Vancouver, Canada","end_date":"2020-12-12","name":"NeurIPS: Neural Information Processing Systems","start_date":"2020-12-06"},"month":"07","oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/2002.07867","open_access":"1"}],"day":"07","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"full_name":"Nguyen, Quynh","first_name":"Quynh","last_name":"Nguyen"},{"orcid":"0000-0002-3242-7020","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","first_name":"Marco"}],"arxiv":1,"type":"conference","status":"public","intvolume":" 33","oa":1,"date_updated":"2024-09-10T13:03:17Z","article_processing_charge":"No","title":"Global convergence of deep networks with one wide layer followed by pyramidal topology","publication":"34th Conference on Neural Information Processing Systems","language":[{"iso":"eng"}],"external_id":{"arxiv":["2002.07867"]},"abstract":[{"text":"Recent works have shown that gradient descent can find a global minimum for over-parameterized neural networks where the widths of all the hidden layers scale polynomially with N (N being the number of training samples). In this paper, we prove that, for deep networks, a single layer of width N following the input layer suffices to ensure a similar guarantee. In particular, all the remaining layers are allowed to have constant widths, and form a pyramidal topology. We show an application of our result to the widely used LeCun’s initialization and obtain an over-parameterization requirement for the single wide layer of order N2.\r\n","lang":"eng"}],"publication_status":"published","publisher":"Curran Associates","date_published":"2020-07-07T00:00:00Z","department":[{"_id":"MaMo"}],"page":"11961–11972","volume":33,"quality_controlled":"1","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"acknowledgement":"The authors would like to thank Jan Maas, Mahdi Soltanolkotabi, and Daniel Soudry for the helpful discussions, Marius Kloft, Matthias Hein and Quoc Dinh Tran for proofreading portions of a prior version of this paper, and James Martens for a clarification concerning LeCun’s initialization. M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize. Q. Nguyen was partially supported by the German Research Foundation (DFG) award KL 2698/2-1.","year":"2020","citation":{"ista":"Nguyen Q, Mondelli M. 2020. Global convergence of deep networks with one wide layer followed by pyramidal topology. 34th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 33, 11961–11972.","mla":"Nguyen, Quynh, and Marco Mondelli. “Global Convergence of Deep Networks with One Wide Layer Followed by Pyramidal Topology.” 34th Conference on Neural Information Processing Systems, vol. 33, Curran Associates, 2020, pp. 11961–11972.","chicago":"Nguyen, Quynh, and Marco Mondelli. “Global Convergence of Deep Networks with One Wide Layer Followed by Pyramidal Topology.” In 34th Conference on Neural Information Processing Systems, 33:11961–11972. Curran Associates, 2020.","short":"Q. Nguyen, M. Mondelli, in:, 34th Conference on Neural Information Processing Systems, Curran Associates, 2020, pp. 11961–11972.","ieee":"Q. Nguyen and M. Mondelli, “Global convergence of deep networks with one wide layer followed by pyramidal topology,” in 34th Conference on Neural Information Processing Systems, Vancouver, Canada, 2020, vol. 33, pp. 11961–11972.","ama":"Nguyen Q, Mondelli M. Global convergence of deep networks with one wide layer followed by pyramidal topology. In: 34th Conference on Neural Information Processing Systems. Vol 33. Curran Associates; 2020:11961–11972.","apa":"Nguyen, Q., & Mondelli, M. (2020). Global convergence of deep networks with one wide layer followed by pyramidal topology. In 34th Conference on Neural Information Processing Systems (Vol. 33, pp. 11961–11972). Vancouver, Canada: Curran Associates."},"date_created":"2021-03-03T12:06:02Z","_id":"9221"},{"has_accepted_license":"1","related_material":{"record":[{"id":"7541","relation":"used_in_publication","status":"public"}]},"oa":1,"date_updated":"2024-02-21T12:42:13Z","year":"2020","article_processing_charge":"No","date_created":"2021-03-05T18:00:47Z","citation":{"apa":"Katsaros, G. (2020). Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:9222","short":"G. Katsaros, (2020).","ieee":"G. Katsaros, “Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling.” Institute of Science and Technology Austria, 2020.","ama":"Katsaros G. Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling. 2020. doi:10.15479/AT:ISTA:9222","chicago":"Katsaros, Georgios. “Transport Data for: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:9222.","ista":"Katsaros G. 2020. Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling, Institute of Science and Technology Austria, 10.15479/AT:ISTA:9222.","mla":"Katsaros, Georgios. Transport Data for: Site‐controlled Uniform Ge/Si Hut Wires with Electrically Tunable Spin–Orbit Coupling. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:9222."},"title":"Transport data for: Site‐controlled uniform Ge/Si Hut wires with electrically tunable spin–orbit coupling","doi":"10.15479/AT:ISTA:9222","file_date_updated":"2021-03-10T07:31:50Z","_id":"9222","ddc":["530"],"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)"},"month":"03","oa_version":"Published Version","day":"16","contributor":[{"contributor_type":"research_group","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","last_name":"Katsaros","first_name":"Georgios"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"creator":"gkatsaro","relation":"main_file","file_size":13317557,"access_level":"open_access","content_type":"application/x-zip-compressed","checksum":"41b66e195ed3dbd73077feee77b05652","file_name":"DOI_SiteControlledHWs.zip","file_id":"9223","date_updated":"2021-03-05T17:50:45Z","date_created":"2021-03-05T17:50:45Z"},{"creator":"dernst","content_type":"text/plain","access_level":"open_access","relation":"main_file","file_size":3515,"file_id":"9233","file_name":"Readme.txt","checksum":"a1dc5f710ba4b3bb7f248195ba754ab2","success":1,"date_updated":"2021-03-10T07:31:50Z","date_created":"2021-03-10T07:31:50Z"}],"author":[{"orcid":"0000-0001-8342-202X","last_name":"Katsaros","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","full_name":"Katsaros, Georgios","first_name":"Georgios"}],"publisher":"Institute of Science and Technology Austria","date_published":"2020-03-16T00:00:00Z","license":"https://creativecommons.org/publicdomain/zero/1.0/","status":"public","type":"research_data","department":[{"_id":"GeKa"}]},{"publication_status":"published","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["510"],"abstract":[{"text":"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 this paper, we describe a new coordinate system where every 3-integer coordinates grid point corresponds to a rhombic dodecahedron centroid. 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. We also present the characterization of 3D digital lines and study it as the intersection of multiple digital planes. Characterization of 3D digital sphere with relevant topological features is proposed as well along with the 48-symmetry appearing in the new coordinate system.","lang":"eng"}],"project":[{"name":"Alpha Shape Theory Extended","call_identifier":"H2020","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","call_identifier":"FWF"}],"license":"https://creativecommons.org/licenses/by/4.0/","date_published":"2020-11-17T00:00:00Z","publisher":"De Gruyter","volume":4,"quality_controlled":"1","page":"143-158","department":[{"_id":"HeEd"}],"year":"2020","acknowledgement":"This work has been partially supported by the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation programme, grant no. 788183, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35. ","citation":{"ista":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. 2020. Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. 4(1), 143–158.","mla":"Biswas, Ranita, et al. “Digital Objects in Rhombic Dodecahedron Grid.” Mathematical Morphology - Theory and Applications, vol. 4, no. 1, De Gruyter, 2020, pp. 143–58, doi:10.1515/mathm-2020-0106.","chicago":"Biswas, Ranita, Gaëlle Largeteau-Skapin, Rita Zrour, and Eric Andres. “Digital Objects in Rhombic Dodecahedron Grid.” Mathematical Morphology - Theory and Applications. De Gruyter, 2020. https://doi.org/10.1515/mathm-2020-0106.","ieee":"R. Biswas, G. Largeteau-Skapin, R. Zrour, and E. Andres, “Digital objects in rhombic dodecahedron grid,” Mathematical Morphology - Theory and Applications, vol. 4, no. 1. De Gruyter, pp. 143–158, 2020.","ama":"Biswas R, Largeteau-Skapin G, Zrour R, Andres E. Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. 2020;4(1):143-158. doi:10.1515/mathm-2020-0106","short":"R. Biswas, G. Largeteau-Skapin, R. Zrour, E. Andres, Mathematical Morphology - Theory and Applications 4 (2020) 143–158.","apa":"Biswas, R., Largeteau-Skapin, G., Zrour, R., & Andres, E. (2020). Digital objects in rhombic dodecahedron grid. Mathematical Morphology - Theory and Applications. De Gruyter. https://doi.org/10.1515/mathm-2020-0106"},"date_created":"2021-03-16T08:55:19Z","ec_funded":1,"_id":"9249","article_type":"original","file_date_updated":"2021-03-22T08:56:37Z","doi":"10.1515/mathm-2020-0106","author":[{"full_name":"Biswas, Ranita","first_name":"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"}],"month":"11","publication_identifier":{"issn":["2353-3390"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2021-03-22T08:56:37Z","date_updated":"2021-03-22T08:56:37Z","success":1,"file_id":"9272","file_name":"2020_MathMorpholTheoryAppl_Biswas.pdf","checksum":"4a1043fa0548a725d464017fe2483ce0","file_size":3668725,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","creator":"dernst"}],"oa_version":"Published Version","day":"17","type":"journal_article","status":"public","issue":"1","article_processing_charge":"No","oa":1,"date_updated":"2021-03-22T09:01:50Z","title":"Digital objects in rhombic dodecahedron grid","intvolume":" 4","has_accepted_license":"1","language":[{"iso":"eng"}],"publication":"Mathematical Morphology - Theory and Applications"},{"scopus_import":"1","intvolume":" 12590","title":"Crossings between non-homotopic edges","article_processing_charge":"No","date_updated":"2021-04-06T11:32:32Z","oa":1,"publication":"28th International Symposium on Graph Drawing and Network Visualization","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"20","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2006.14908"}],"oa_version":"Preprint","month":"09","publication_identifier":{"issn":["0302-9743"],"isbn":["9783030687656"],"eissn":["1611-3349"]},"conference":{"end_date":"2020-09-18","location":"Virtual, Online","start_date":"2020-09-16","name":"GD: Graph Drawing and Network Visualization"},"arxiv":1,"author":[{"first_name":"János","full_name":"Pach, János","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","last_name":"Pach"},{"last_name":"Tardos","full_name":"Tardos, Gábor","first_name":"Gábor"},{"first_name":"Géza","full_name":"Tóth, Géza","last_name":"Tóth"}],"status":"public","type":"conference","date_created":"2021-03-28T22:01:44Z","citation":{"apa":"Pach, J., Tardos, G., & Tóth, G. (2020). Crossings between non-homotopic edges. In 28th International Symposium on Graph Drawing and Network Visualization (Vol. 12590, pp. 359–371). Virtual, Online: Springer Nature. https://doi.org/10.1007/978-3-030-68766-3_28","ama":"Pach J, Tardos G, Tóth G. Crossings between non-homotopic edges. In: 28th International Symposium on Graph Drawing and Network Visualization. Vol 12590. LNCS. Springer Nature; 2020:359-371. doi:10.1007/978-3-030-68766-3_28","ieee":"J. Pach, G. Tardos, and G. Tóth, “Crossings between non-homotopic edges,” in 28th International Symposium on Graph Drawing and Network Visualization, Virtual, Online, 2020, vol. 12590, pp. 359–371.","short":"J. Pach, G. Tardos, G. Tóth, in:, 28th International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2020, pp. 359–371.","mla":"Pach, János, et al. “Crossings between Non-Homotopic Edges.” 28th International Symposium on Graph Drawing and Network Visualization, vol. 12590, Springer Nature, 2020, pp. 359–71, doi:10.1007/978-3-030-68766-3_28.","ista":"Pach J, Tardos G, Tóth G. 2020. Crossings between non-homotopic edges. 28th International Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network VisualizationLNCS vol. 12590, 359–371.","chicago":"Pach, János, Gábor Tardos, and Géza Tóth. “Crossings between Non-Homotopic Edges.” In 28th International Symposium on Graph Drawing and Network Visualization, 12590:359–71. LNCS. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-68766-3_28."},"year":"2020","acknowledgement":"Supported by the National Research, Development and Innovation Office, NKFIH, KKP-133864, K-131529, K-116769, K-132696, by the Higher Educational Institutional Excellence Program 2019 NKFIH-1158-6/2019, the Austrian Science Fund (FWF), grant Z 342-N31, by the Ministry of Education and Science of the Russian Federation MegaGrant No. 075-15-2019-1926, and by the ERC Synergy Grant “Dynasnet” No. 810115. A full version can be found at https://arxiv.org/abs/2006.14908.","doi":"10.1007/978-3-030-68766-3_28","_id":"9299","abstract":[{"text":"We call a multigraph non-homotopic if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can be shrunk to its end-vertex in the same way. It is easy to see that a non-homotopic multigraph on n>1 vertices can have arbitrarily many edges. We prove that the number of crossings between the edges of a non-homotopic multigraph with n vertices and m>4n edges is larger than cm2n for some constant c>0 , and that this bound is tight up to a polylogarithmic factor. We also show that the lower bound is not asymptotically sharp as n is fixed and m⟶∞ .","lang":"eng"}],"external_id":{"arxiv":["2006.14908"]},"series_title":"LNCS","publication_status":"published","volume":12590,"quality_controlled":"1","page":"359-371","department":[{"_id":"HeEd"}],"date_published":"2020-09-20T00:00:00Z","publisher":"Springer Nature","project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342"}]},{"publisher":"IOP Publishing","date_published":"2020-12-01T00:00:00Z","page":"1156-1158","department":[{"_id":"UlWa"}],"volume":75,"quality_controlled":"1","publication_status":"published","external_id":{"isi":["000625983100001"],"arxiv":["1511.03501"]},"article_type":"original","_id":"9308","doi":"10.1070/RM9943","acknowledgement":"This research was carried out with the support of the Russian Foundation for Basic Research(grant no. 19-01-00169)","year":"2020","date_created":"2021-04-04T22:01:22Z","citation":{"chicago":"Avvakumov, Sergey, Uli Wagner, Isaac Mabillard, and A. B. Skopenkov. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” Russian Mathematical Surveys. IOP Publishing, 2020. https://doi.org/10.1070/RM9943.","mla":"Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” Russian Mathematical Surveys, vol. 75, no. 6, IOP Publishing, 2020, pp. 1156–58, doi:10.1070/RM9943.","ista":"Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. 2020. Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. 75(6), 1156–1158.","ieee":"S. Avvakumov, U. Wagner, I. Mabillard, and A. B. Skopenkov, “Eliminating higher-multiplicity intersections, III. Codimension 2,” Russian Mathematical Surveys, vol. 75, no. 6. IOP Publishing, pp. 1156–1158, 2020.","ama":"Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. 2020;75(6):1156-1158. doi:10.1070/RM9943","short":"S. Avvakumov, U. Wagner, I. Mabillard, A.B. Skopenkov, Russian Mathematical Surveys 75 (2020) 1156–1158.","apa":"Avvakumov, S., Wagner, U., Mabillard, I., & Skopenkov, A. B. (2020). Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. IOP Publishing. https://doi.org/10.1070/RM9943"},"related_material":{"record":[{"status":"public","id":"8183","relation":"earlier_version"},{"id":"10220","relation":"later_version","status":"public"}]},"type":"journal_article","status":"public","author":[{"last_name":"Avvakumov","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","first_name":"Sergey","full_name":"Avvakumov, Sergey"},{"first_name":"Uli","full_name":"Wagner, Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","orcid":"0000-0002-1494-0568"},{"id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","last_name":"Mabillard","full_name":"Mabillard, Isaac","first_name":"Isaac"},{"last_name":"Skopenkov","first_name":"A. B.","full_name":"Skopenkov, A. B."}],"arxiv":1,"publication_identifier":{"issn":["0036-0279"]},"month":"12","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1511.03501"}],"oa_version":"Preprint","day":"01","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","language":[{"iso":"eng"}],"publication":"Russian Mathematical Surveys","oa":1,"date_updated":"2023-08-14T11:43:54Z","issue":"6","article_processing_charge":"No","title":"Eliminating higher-multiplicity intersections, III. Codimension 2","isi":1,"scopus_import":"1","intvolume":" 75"},{"doi":"10.1021/jacs.9b13450.s002","_id":"9326","related_material":{"record":[{"relation":"used_in_publication","id":"8040","status":"public"}]},"date_created":"2021-04-14T12:05:20Z","title":"Charge transfer and chemo-mechanical coupling in respiratory complex I","citation":{"short":"C. Gupta, U. Khaniya, C. Chan, F. Dehez, M. Shekhar, M.R. Gunner, L.A. Sazanov, C. Chipot, A. Singharoy, (2020).","ama":"Gupta C, Khaniya U, Chan C, et al. Charge transfer and chemo-mechanical coupling in respiratory complex I. 2020. doi:10.1021/jacs.9b13450.s002","ieee":"C. Gupta et al., “Charge transfer and chemo-mechanical coupling in respiratory complex I.” American Chemical Society, 2020.","mla":"Gupta, Chitrak, et al. Charge Transfer and Chemo-Mechanical Coupling in Respiratory Complex I. American Chemical Society, 2020, doi:10.1021/jacs.9b13450.s002.","chicago":"Gupta, Chitrak, Umesh Khaniya, Chun Chan, Francois Dehez, Mrinal Shekhar, M. R. Gunner, Leonid A Sazanov, Christophe Chipot, and Abhishek Singharoy. “Charge Transfer and Chemo-Mechanical Coupling in Respiratory Complex I.” American Chemical Society, 2020. https://doi.org/10.1021/jacs.9b13450.s002.","ista":"Gupta C, Khaniya U, Chan C, Dehez F, Shekhar M, Gunner MR, Sazanov LA, Chipot C, Singharoy A. 2020. Charge transfer and chemo-mechanical coupling in respiratory complex I, American Chemical Society, 10.1021/jacs.9b13450.s002.","apa":"Gupta, C., Khaniya, U., Chan, C., Dehez, F., Shekhar, M., Gunner, M. R., … Singharoy, A. (2020). Charge transfer and chemo-mechanical coupling in respiratory complex I. American Chemical Society. https://doi.org/10.1021/jacs.9b13450.s002"},"date_updated":"2023-08-22T07:49:37Z","oa":1,"year":"2020","article_processing_charge":"No","department":[{"_id":"LeSa"}],"publisher":"American Chemical Society","type":"research_data_reference","license":"https://creativecommons.org/licenses/by-nc/4.0/","date_published":"2020-05-20T00:00:00Z","status":"public","oa_version":"Published Version","day":"20","main_file_link":[{"open_access":"1"}],"abstract":[{"lang":"eng","text":"The mitochondrial respiratory chain, formed by five protein complexes, utilizes energy from catabolic processes to synthesize ATP. Complex I, the first and the largest protein complex of the chain, harvests electrons from NADH to reduce quinone, while pumping protons across the mitochondrial membrane. Detailed knowledge of the working principle of such coupled charge-transfer processes remains, however, fragmentary due to bottlenecks in understanding redox-driven conformational transitions and their interplay with the hydrated proton pathways. Complex I from Thermus thermophilus encases 16 subunits with nine iron–sulfur clusters, reduced by electrons from NADH. Here, employing the latest crystal structure of T. thermophilus complex I, we have used microsecond-scale molecular dynamics simulations to study the chemo-mechanical coupling between redox changes of the iron–sulfur clusters and conformational transitions across complex I. First, we identify the redox switches within complex I, which allosterically couple the dynamics of the quinone binding pocket to the site of NADH reduction. Second, our free-energy calculations reveal that the affinity of the quinone, specifically menaquinone, for the binding-site is higher than that of its reduced, menaquinol forma design essential for menaquinol release. Remarkably, the barriers to diffusive menaquinone dynamics are lesser than that of the more ubiquitous ubiquinone, and the naphthoquinone headgroup of the former furnishes stronger binding interactions with the pocket, favoring menaquinone for charge transport in T. thermophilus. Our computations are consistent with experimentally validated mutations and hierarchize the key residues into three functional classes, identifying new mutation targets. Third, long-range hydrogen-bond networks connecting the quinone-binding site to the transmembrane subunits are found to be responsible for proton pumping. Put together, the simulations reveal the molecular design principles linking redox reactions to quinone turnover to proton translocation in complex I."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"05","tmp":{"short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png"},"author":[{"last_name":"Gupta","full_name":"Gupta, Chitrak","first_name":"Chitrak"},{"last_name":"Khaniya","first_name":"Umesh","full_name":"Khaniya, Umesh"},{"last_name":"Chan","first_name":"Chun","full_name":"Chan, Chun"},{"first_name":"Francois","full_name":"Dehez, Francois","last_name":"Dehez"},{"last_name":"Shekhar","first_name":"Mrinal","full_name":"Shekhar, Mrinal"},{"last_name":"Gunner","first_name":"M. R.","full_name":"Gunner, M. R."},{"first_name":"Leonid A","full_name":"Sazanov, Leonid A","orcid":"0000-0002-0977-7989","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chipot, Christophe","first_name":"Christophe","last_name":"Chipot"},{"full_name":"Singharoy, Abhishek","first_name":"Abhishek","last_name":"Singharoy"}]},{"arxiv":1,"author":[{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar"},{"full_name":"Mohammadi, Fatemeh","first_name":"Fatemeh","last_name":"Mohammadi"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"01","oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1712.09692","open_access":"1"}],"month":"01","publication_identifier":{"issn":["09518320"]},"type":"journal_article","status":"public","title":"An efficient algorithm for computing network reliability in small treewidth","article_processing_charge":"No","date_updated":"2024-03-25T23:30:18Z","oa":1,"intvolume":" 193","scopus_import":"1","isi":1,"language":[{"iso":"eng"}],"publication":"Reliability Engineering and System Safety","publication_status":"published","abstract":[{"lang":"eng","text":"We consider the classic problem of Network Reliability. A network is given together with a source vertex, one or more target vertices, and probabilities assigned to each of the edges. Each edge of the network is operable with its associated probability and the problem is to determine the probability of having at least one source-to-target path that is entirely composed of operable edges. This problem is known to be NP-hard.\r\n\r\nWe provide a novel scalable algorithm to solve the Network Reliability problem when the treewidth of the underlying network is small. We also show our algorithm’s applicability for real-world transit networks that have small treewidth, including the metro networks of major cities, such as London and Tokyo. Our algorithm leverages tree decompositions to shrink the original graph into much smaller graphs, for which reliability can be efficiently and exactly computed using a brute force method. To the best of our knowledge, this is the first exact algorithm for Network Reliability that can scale to handle real-world instances of the problem."}],"external_id":{"isi":["000501641400050"],"arxiv":["1712.09692"]},"project":[{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"volume":193,"quality_controlled":"1","department":[{"_id":"KrCh"}],"date_published":"2020-01-01T00:00:00Z","publisher":"Elsevier","citation":{"apa":"Goharshady, A. K., & Mohammadi, F. (2020). An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. Elsevier. https://doi.org/10.1016/j.ress.2019.106665","chicago":"Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.” Reliability Engineering and System Safety. Elsevier, 2020. https://doi.org/10.1016/j.ress.2019.106665.","mla":"Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.” Reliability Engineering and System Safety, vol. 193, 106665, Elsevier, 2020, doi:10.1016/j.ress.2019.106665.","ista":"Goharshady AK, Mohammadi F. 2020. An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. 193, 106665.","short":"A.K. Goharshady, F. Mohammadi, Reliability Engineering and System Safety 193 (2020).","ama":"Goharshady AK, Mohammadi F. An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. 2020;193. doi:10.1016/j.ress.2019.106665","ieee":"A. K. Goharshady and F. Mohammadi, “An efficient algorithm for computing network reliability in small treewidth,” Reliability Engineering and System Safety, vol. 193. Elsevier, 2020."},"date_created":"2019-09-29T22:00:44Z","year":"2020","acknowledgement":"We are grateful to the anonymous reviewers for their comments, which significantly improved the present work. The research was partially supported by the EPSRC Early Career Fellowship EP/R023379/1, grant no. SC7-1718-01 of the London Mathematical Society, an IBM PhD Fellowship, and a DOC Fellowship of the Austrian Academy of Sciences (ÖAW).","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8934"}]},"article_number":"106665","article_type":"original","_id":"6918","doi":"10.1016/j.ress.2019.106665"},{"status":"public","type":"journal_article","publication_identifier":{"issn":["0920-5691"],"eissn":["1573-1405"]},"month":"04","day":"01","oa_version":"Published Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","relation":"main_file","file_size":1715072,"content_type":"application/pdf","creator":"dernst","date_updated":"2020-07-14T12:47:45Z","date_created":"2019-11-26T10:30:02Z","file_name":"2019_IJCV_Sun.pdf","file_id":"7110","checksum":"155e63edf664dcacb3bdc1c2223e606f"}],"author":[{"last_name":"Sun","full_name":"Sun, Rémy","first_name":"Rémy"},{"full_name":"Lampert, Christoph","first_name":"Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"publication":"International Journal of Computer Vision","language":[{"iso":"eng"}],"isi":1,"intvolume":" 128","scopus_import":"1","has_accepted_license":"1","date_updated":"2024-02-22T14:57:30Z","oa":1,"issue":"4","article_processing_charge":"Yes (via OA deal)","title":"KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications","publisher":"Springer Nature","date_published":"2020-04-01T00:00:00Z","department":[{"_id":"ChLa"}],"page":"970-995","quality_controlled":"1","volume":128,"project":[{"grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"ddc":["004"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"external_id":{"isi":["000494406800001"]},"abstract":[{"text":"We study the problem of automatically detecting if a given multi-class classifier operates outside of its specifications (out-of-specs), i.e. on input data from a different distribution than what it was trained for. This is an important problem to solve on the road towards creating reliable computer vision systems for real-world applications, because the quality of a classifier’s predictions cannot be guaranteed if it operates out-of-specs. Previously proposed methods for out-of-specs detection make decisions on the level of single inputs. This, however, is insufficient to achieve low false positive rate and high false negative rates at the same time. In this work, we describe a new procedure named KS(conf), based on statistical reasoning. Its main component is a classical Kolmogorov–Smirnov test that is applied to the set of predicted confidence values for batches of samples. Working with batches instead of single samples allows increasing the true positive rate without negatively affecting the false positive rate, thereby overcoming a crucial limitation of single sample tests. We show by extensive experiments using a variety of convolutional network architectures and datasets that KS(conf) reliably detects out-of-specs situations even under conditions where other tests fail. It furthermore has a number of properties that make it an excellent candidate for practical deployment: it is easy to implement, adds almost no overhead to the system, works with any classifier that outputs confidence scores, and requires no a priori knowledge about how the data distribution could change.","lang":"eng"}],"publication_status":"published","doi":"10.1007/s11263-019-01232-x","file_date_updated":"2020-07-14T12:47:45Z","_id":"6944","article_type":"original","ec_funded":1,"related_material":{"link":[{"url":"https://doi.org/10.1007/s11263-019-01262-5","relation":"erratum"}],"record":[{"relation":"earlier_version","id":"6482","status":"public"}]},"year":"2020","date_created":"2019-10-14T09:14:28Z","citation":{"apa":"Sun, R., & Lampert, C. (2020). KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. International Journal of Computer Vision. Springer Nature. https://doi.org/10.1007/s11263-019-01232-x","short":"R. Sun, C. Lampert, International Journal of Computer Vision 128 (2020) 970–995.","ieee":"R. Sun and C. Lampert, “KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications,” International Journal of Computer Vision, vol. 128, no. 4. Springer Nature, pp. 970–995, 2020.","ama":"Sun R, Lampert C. KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. International Journal of Computer Vision. 2020;128(4):970-995. doi:10.1007/s11263-019-01232-x","mla":"Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a Multiclass Classifier Operates Outside of Its Specifications.” International Journal of Computer Vision, vol. 128, no. 4, Springer Nature, 2020, pp. 970–95, doi:10.1007/s11263-019-01232-x.","chicago":"Sun, Rémy, and Christoph Lampert. “KS(Conf): A Light-Weight Test If a Multiclass Classifier Operates Outside of Its Specifications.” International Journal of Computer Vision. Springer Nature, 2020. https://doi.org/10.1007/s11263-019-01232-x.","ista":"Sun R, Lampert C. 2020. KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications. International Journal of Computer Vision. 128(4), 970–995."}},{"status":"public","type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"checksum":"a0f05dd4f5f64e4f713d8d9d4b5b1e3f","file_id":"6973","file_name":"2019_CompVision_Henderson.pdf","date_created":"2019-10-25T10:28:29Z","date_updated":"2020-07-14T12:47:46Z","creator":"dernst","content_type":"application/pdf","file_size":2243134,"access_level":"open_access","relation":"main_file"}],"day":"01","oa_version":"Published Version","month":"04","publication_identifier":{"issn":["0920-5691"],"eissn":["1573-1405"]},"arxiv":1,"author":[{"orcid":"0000-0002-5198-7445","id":"13C09E74-18D9-11E9-8878-32CFE5697425","last_name":"Henderson","first_name":"Paul M","full_name":"Henderson, Paul M"},{"first_name":"Vittorio","full_name":"Ferrari, Vittorio","last_name":"Ferrari"}],"publication":"International Journal of Computer Vision","language":[{"iso":"eng"}],"has_accepted_license":"1","scopus_import":"1","intvolume":" 128","isi":1,"title":"Learning single-image 3D reconstruction by generative modelling of shape, pose and shading","article_processing_charge":"Yes (via OA deal)","oa":1,"date_updated":"2023-08-17T14:01:16Z","volume":128,"quality_controlled":"1","page":"835-854","department":[{"_id":"ChLa"}],"date_published":"2020-04-01T00:00:00Z","publisher":"Springer Nature","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"abstract":[{"lang":"eng","text":"We present a unified framework tackling two problems: class-specific 3D reconstruction from a single image, and generation of new 3D shape samples. These tasks have received considerable attention recently; however, most existing approaches rely on 3D supervision, annotation of 2D images with keypoints or poses, and/or training with multiple views of each object instance. Our framework is very general: it can be trained in similar settings to existing approaches, while also supporting weaker supervision. Importantly, it can be trained purely from 2D images, without pose annotations, and with only a single view per instance. We employ meshes as an output representation, instead of voxels used in most prior work. This allows us to reason over lighting parameters and exploit shading information during training, which previous 2D-supervised methods cannot. Thus, our method can learn to generate and reconstruct concave object classes. We evaluate our approach in various settings, showing that: (i) it learns to disentangle shape from pose and lighting; (ii) using shading in the loss improves performance compared to just silhouettes; (iii) when using a standard single white light, our model outperforms state-of-the-art 2D-supervised methods, both with and without pose supervision, thanks to exploiting shading cues; (iv) performance improves further when using multiple coloured lights, even approaching that of state-of-the-art 3D-supervised methods; (v) shapes produced by our model capture smooth surfaces and fine details better than voxel-based approaches; and (vi) our approach supports concave classes such as bathtubs and sofas, which methods based on silhouettes cannot learn."}],"external_id":{"arxiv":["1901.06447"],"isi":["000491042100002"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["004"],"publication_status":"published","doi":"10.1007/s11263-019-01219-8","article_type":"original","_id":"6952","file_date_updated":"2020-07-14T12:47:46Z","citation":{"apa":"Henderson, P. M., & Ferrari, V. (2020). Learning single-image 3D reconstruction by generative modelling of shape, pose and shading. International Journal of Computer Vision. Springer Nature. https://doi.org/10.1007/s11263-019-01219-8","ama":"Henderson PM, Ferrari V. Learning single-image 3D reconstruction by generative modelling of shape, pose and shading. International Journal of Computer Vision. 2020;128:835-854. doi:10.1007/s11263-019-01219-8","ieee":"P. M. Henderson and V. Ferrari, “Learning single-image 3D reconstruction by generative modelling of shape, pose and shading,” International Journal of Computer Vision, vol. 128. Springer Nature, pp. 835–854, 2020.","short":"P.M. Henderson, V. Ferrari, International Journal of Computer Vision 128 (2020) 835–854.","chicago":"Henderson, Paul M, and Vittorio Ferrari. “Learning Single-Image 3D Reconstruction by Generative Modelling of Shape, Pose and Shading.” International Journal of Computer Vision. Springer Nature, 2020. https://doi.org/10.1007/s11263-019-01219-8.","ista":"Henderson PM, Ferrari V. 2020. Learning single-image 3D reconstruction by generative modelling of shape, pose and shading. International Journal of Computer Vision. 128, 835–854.","mla":"Henderson, Paul M., and Vittorio Ferrari. “Learning Single-Image 3D Reconstruction by Generative Modelling of Shape, Pose and Shading.” International Journal of Computer Vision, vol. 128, Springer Nature, 2020, pp. 835–54, doi:10.1007/s11263-019-01219-8."},"date_created":"2019-10-17T13:38:20Z","year":"2020","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria)."},{"type":"journal_article","date_published":"2020-01-01T00:00:00Z","status":"public","publisher":"Springer Nature","quality_controlled":"1","volume":16,"extern":"1","page":"63–68","publication_status":"published","author":[{"last_name":"Dieleman","first_name":"Peter","full_name":"Dieleman, Peter"},{"last_name":"Vasmel","first_name":"Niek","full_name":"Vasmel, Niek"},{"orcid":"0000-0002-2299-3176","last_name":"Waitukaitis","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","full_name":"Waitukaitis, Scott R","first_name":"Scott R"},{"last_name":"van Hecke","full_name":"van Hecke, Martin","first_name":"Martin"}],"month":"01","publication_identifier":{"issn":["1745-2473"],"eissn":["1745-2481"]},"abstract":[{"lang":"eng","text":"Origami is rapidly transforming the design of robots1,2, deployable structures3,4,5,6 and metamaterials7,8,9,10,11,12,13,14. However, as foldability requires a large number of complex compatibility conditions that are difficult to satisfy, the design of crease patterns is limited to heuristics and computer optimization. Here we introduce a systematic strategy that enables intuitive and effective design of complex crease patterns that are guaranteed to fold. First, we exploit symmetries to construct 140 distinct foldable motifs, and represent these as jigsaw puzzle pieces. We then show that when these pieces are fitted together they encode foldable crease patterns. This maps origami design to solving combinatorial problems, which allows us to systematically create, count and classify a vast number of crease patterns. We show that all of these crease patterns are pluripotent—capable of folding into multiple shapes—and solve exactly for the number of possible shapes for each pattern. Finally, we employ our framework to rationally design a crease pattern that folds into two independently defined target shapes, and fabricate such pluripotent origami. Our results provide physicists, mathematicians and engineers with a powerful new design strategy."}],"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","day":"01","oa_version":"None","article_type":"letter_note","_id":"6976","language":[{"iso":"eng"}],"publication":"Nature Physics","doi":"10.1038/s41567-019-0677-3","article_processing_charge":"No","year":"2020","issue":"1","date_updated":"2021-01-12T08:11:16Z","citation":{"short":"P. Dieleman, N. Vasmel, S.R. Waitukaitis, M. van Hecke, Nature Physics 16 (2020) 63–68.","ieee":"P. Dieleman, N. Vasmel, S. R. Waitukaitis, and M. van Hecke, “Jigsaw puzzle design of pluripotent origami,” Nature Physics, vol. 16, no. 1. Springer Nature, pp. 63–68, 2020.","ama":"Dieleman P, Vasmel N, Waitukaitis SR, van Hecke M. Jigsaw puzzle design of pluripotent origami. Nature Physics. 2020;16(1):63–68. doi:10.1038/s41567-019-0677-3","mla":"Dieleman, Peter, et al. “Jigsaw Puzzle Design of Pluripotent Origami.” Nature Physics, vol. 16, no. 1, Springer Nature, 2020, pp. 63–68, doi:10.1038/s41567-019-0677-3.","ista":"Dieleman P, Vasmel N, Waitukaitis SR, van Hecke M. 2020. Jigsaw puzzle design of pluripotent origami. Nature Physics. 16(1), 63–68.","chicago":"Dieleman, Peter, Niek Vasmel, Scott R Waitukaitis, and Martin van Hecke. “Jigsaw Puzzle Design of Pluripotent Origami.” Nature Physics. Springer Nature, 2020. https://doi.org/10.1038/s41567-019-0677-3.","apa":"Dieleman, P., Vasmel, N., Waitukaitis, S. R., & van Hecke, M. (2020). Jigsaw puzzle design of pluripotent origami. Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-019-0677-3"},"date_created":"2019-10-31T07:51:44Z","title":"Jigsaw puzzle design of pluripotent origami","intvolume":" 16"},{"doi":"10.1111/nph.16203","file_date_updated":"2020-11-18T16:42:48Z","article_type":"original","_id":"6997","ec_funded":1,"date_created":"2019-11-12T11:41:32Z","citation":{"short":"Y. Zhang, J. Friml, New Phytologist 225 (2020) 1049–1052.","ama":"Zhang Y, Friml J. Auxin guides roots to avoid obstacles during gravitropic growth. New Phytologist. 2020;225(3):1049-1052. doi:10.1111/nph.16203","ieee":"Y. Zhang and J. Friml, “Auxin guides roots to avoid obstacles during gravitropic growth,” New Phytologist, vol. 225, no. 3. Wiley, pp. 1049–1052, 2020.","chicago":"Zhang, Yuzhou, and Jiří Friml. “Auxin Guides Roots to Avoid Obstacles during Gravitropic Growth.” New Phytologist. Wiley, 2020. https://doi.org/10.1111/nph.16203.","mla":"Zhang, Yuzhou, and Jiří Friml. “Auxin Guides Roots to Avoid Obstacles during Gravitropic Growth.” New Phytologist, vol. 225, no. 3, Wiley, 2020, pp. 1049–52, doi:10.1111/nph.16203.","ista":"Zhang Y, Friml J. 2020. Auxin guides roots to avoid obstacles during gravitropic growth. New Phytologist. 225(3), 1049–1052.","apa":"Zhang, Y., & Friml, J. (2020). Auxin guides roots to avoid obstacles during gravitropic growth. New Phytologist. Wiley. https://doi.org/10.1111/nph.16203"},"year":"2020","page":"1049-1052","department":[{"_id":"JiFr"}],"volume":225,"quality_controlled":"1","publisher":"Wiley","date_published":"2020-02-01T00:00:00Z","project":[{"_id":"261099A6-B435-11E9-9278-68D0E5697425","grant_number":"742985","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","call_identifier":"H2020"},{"grant_number":"I03630","_id":"26538374-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Molecular mechanisms of endocytic cargo recognition in plants"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"external_id":{"pmid":["31603260"],"isi":["000489638800001"]},"ddc":["580"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_status":"published","publication":"New Phytologist","language":[{"iso":"eng"}],"has_accepted_license":"1","scopus_import":"1","intvolume":" 225","isi":1,"title":"Auxin guides roots to avoid obstacles during gravitropic growth","date_updated":"2023-08-17T14:01:49Z","oa":1,"article_processing_charge":"Yes (via OA deal)","issue":"3","pmid":1,"status":"public","type":"journal_article","day":"01","oa_version":"Published Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"file_id":"8772","checksum":"cd42ffdb381fd52812b9583d4d407139","file_name":"2020_NewPhytologist_Zhang.pdf","success":1,"date_updated":"2020-11-18T16:42:48Z","date_created":"2020-11-18T16:42:48Z","creator":"dernst","file_size":717345,"access_level":"open_access","content_type":"application/pdf","relation":"main_file"}],"publication_identifier":{"issn":["0028-646x"],"eissn":["1469-8137"]},"month":"02","author":[{"id":"3B6137F2-F248-11E8-B48F-1D18A9856A87","last_name":"Zhang","orcid":"0000-0003-2627-6956","full_name":"Zhang, Yuzhou","first_name":"Yuzhou"},{"last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jiří","full_name":"Friml, Jiří"}]},{"doi":"10.1007/s00220-019-03575-5","_id":"7004","article_type":"original","ec_funded":1,"year":"2020","date_created":"2019-11-12T14:01:27Z","citation":{"apa":"Rapcak, M., Soibelman, Y., Yang, Y., & Zhao, G. (2020). Cohomological Hall algebras, vertex algebras and instantons. Communications in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s00220-019-03575-5","mla":"Rapcak, Miroslav, et al. “Cohomological Hall Algebras, Vertex Algebras and Instantons.” Communications in Mathematical Physics, vol. 376, Springer Nature, 2020, pp. 1803–73, doi:10.1007/s00220-019-03575-5.","ista":"Rapcak M, Soibelman Y, Yang Y, Zhao G. 2020. Cohomological Hall algebras, vertex algebras and instantons. Communications in Mathematical Physics. 376, 1803–1873.","chicago":"Rapcak, Miroslav, Yan Soibelman, Yaping Yang, and Gufang Zhao. “Cohomological Hall Algebras, Vertex Algebras and Instantons.” Communications in Mathematical Physics. Springer Nature, 2020. https://doi.org/10.1007/s00220-019-03575-5.","ieee":"M. Rapcak, Y. Soibelman, Y. Yang, and G. Zhao, “Cohomological Hall algebras, vertex algebras and instantons,” Communications in Mathematical Physics, vol. 376. Springer Nature, pp. 1803–1873, 2020.","ama":"Rapcak M, Soibelman Y, Yang Y, Zhao G. Cohomological Hall algebras, vertex algebras and instantons. Communications in Mathematical Physics. 2020;376:1803-1873. doi:10.1007/s00220-019-03575-5","short":"M. Rapcak, Y. Soibelman, Y. Yang, G. Zhao, Communications in Mathematical Physics 376 (2020) 1803–1873."},"publisher":"Springer Nature","date_published":"2020-06-01T00:00:00Z","department":[{"_id":"TaHa"}],"page":"1803-1873","quality_controlled":"1","volume":376,"project":[{"_id":"25E549F4-B435-11E9-9278-68D0E5697425","grant_number":"320593","call_identifier":"FP7","name":"Arithmetic and physics of Higgs moduli spaces"}],"external_id":{"isi":["000536255500004"],"arxiv":["1810.10402"]},"abstract":[{"lang":"eng","text":"We define an action of the (double of) Cohomological Hall algebra of Kontsevich and Soibelman on the cohomology of the moduli space of spiked instantons of Nekrasov. We identify this action with the one of the affine Yangian of gl(1). Based on that we derive the vertex algebra at the corner Wr1,r2,r3 of Gaiotto and Rapčák. We conjecture that our approach works for a big class of Calabi–Yau categories, including those associated with toric Calabi–Yau 3-folds."}],"publication_status":"published","publication":"Communications in Mathematical Physics","language":[{"iso":"eng"}],"isi":1,"intvolume":" 376","scopus_import":"1","date_updated":"2023-08-17T14:02:59Z","oa":1,"article_processing_charge":"No","title":"Cohomological Hall algebras, vertex algebras and instantons","status":"public","type":"journal_article","month":"06","publication_identifier":{"issn":["0010-3616"],"eissn":["1432-0916"]},"day":"01","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1810.10402"}],"oa_version":"Preprint","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"full_name":"Rapcak, Miroslav","first_name":"Miroslav","last_name":"Rapcak"},{"last_name":"Soibelman","full_name":"Soibelman, Yan","first_name":"Yan"},{"full_name":"Yang, Yaping","first_name":"Yaping","last_name":"Yang"},{"first_name":"Gufang","full_name":"Zhao, Gufang","last_name":"Zhao","id":"2BC2AC5E-F248-11E8-B48F-1D18A9856A87"}],"arxiv":1},{"pmid":1,"type":"journal_article","status":"public","author":[{"first_name":"RJ","full_name":"Donahue, RJ","last_name":"Donahue"},{"first_name":"Margaret E","full_name":"Maes, Margaret E","id":"3838F452-F248-11E8-B48F-1D18A9856A87","last_name":"Maes","orcid":"0000-0001-9642-1085"},{"last_name":"Grosser","full_name":"Grosser, JA","first_name":"JA"},{"first_name":"RW","full_name":"Nickells, RW","last_name":"Nickells"}],"publication_identifier":{"issn":["0893-7648"],"eissn":["1559-1182"]},"month":"02","oa_version":"Submitted Version","day":"01","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7035206/"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","language":[{"iso":"eng"}],"publication":"Molecular Neurobiology","date_updated":"2023-08-17T14:05:48Z","oa":1,"issue":"2","article_processing_charge":"No","title":"BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage","isi":1,"scopus_import":"1","intvolume":" 57","publisher":"Springer Nature","date_published":"2020-02-01T00:00:00Z","department":[{"_id":"SaSi"}],"page":"1070–1084","volume":57,"quality_controlled":"1","publication_status":"published","external_id":{"isi":["000493754200001"],"pmid":["31673950"]},"abstract":[{"lang":"eng","text":"Removal of the Bax gene from mice completely protects the somas of retinal ganglion cells (RGCs) from apoptosis following optic nerve injury. This makes BAX a promising therapeutic target to prevent neurodegeneration. In this study, Bax+/− mice were used to test the hypothesis that lowering the quantity of BAX in RGCs would delay apoptosis following optic nerve injury. RGCs were damaged by performing optic nerve crush (ONC) and then immunostaining for phospho-cJUN, and quantitative PCR were used to monitor the status of the BAX activation mechanism in the months following injury. The apoptotic susceptibility of injured cells was directly tested by virally introducing GFP-BAX into Bax−/− RGCs after injury. The competency of quiescent RGCs to reactivate their BAX activation mechanism was tested by intravitreal injection of the JNK pathway agonist, anisomycin. Twenty-four weeks after ONC, Bax+/− mice had significantly less cell loss in their RGC layer than Bax+/+ mice 3 weeks after ONC. Bax+/− and Bax+/+ RGCs exhibited similar patterns of nuclear phospho-cJUN accumulation immediately after ONC, which persisted in Bax+/− RGCs for up to 7 weeks before abating. The transcriptional activation of BAX-activating genes was similar in Bax+/− and Bax+/+ RGCs following ONC. Intriguingly, cells deactivated their BAX activation mechanism between 7 and 12 weeks after crush. Introduction of GFP-BAX into Bax−/− cells at 4 weeks after ONC showed that these cells had a nearly normal capacity to activate this protein, but this capacity was lost 8 weeks after crush. Collectively, these data suggest that 8–12 weeks after crush, damaged cells no longer displayed increased susceptibility to BAX activation relative to their naïve counterparts. In this same timeframe, retinal glial activation and the signaling of the pro-apoptotic JNK pathway also abated. Quiescent RGCs did not show a timely reactivation of their JNK pathway following intravitreal injection with anisomycin. These findings demonstrate that lowering the quantity of BAX in RGCs is neuroprotective after acute injury. Damaged RGCs enter a quiescent state months after injury and are no longer responsive to an apoptotic stimulus. Quiescent RGCs will require rejuvenation to reacquire functionality."}],"article_type":"original","_id":"7033","doi":"10.1007/s12035-019-01783-7","acknowledgement":"This work was supported by National Eye Institute grants R01 EY012223 (RWN), R01 EY030123 (RWN), T32 EY027721 (Department of Ophthalmology and Visual Sciences, University of Wisconsin-Madison), and a Vision Science Core grant P30 EY016665 (Department of Ophthalmology and Visual Sciences, University of Wisconsin-Madison), an unrestricted funding grant from Research to Prevent Blindness (Department of Ophthalmology and Visual Sciences, University of Wisconsin-Madison), the Frederick A. Davis Endowment (RWN), and the Mr. and Mrs. George Taylor Foundation (RWN).","year":"2020","citation":{"apa":"Donahue, R., Maes, M. E., Grosser, J., & Nickells, R. (2020). BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage. Molecular Neurobiology. Springer Nature. https://doi.org/10.1007/s12035-019-01783-7","short":"R. Donahue, M.E. Maes, J. Grosser, R. Nickells, Molecular Neurobiology 57 (2020) 1070–1084.","ieee":"R. Donahue, M. E. Maes, J. Grosser, and R. Nickells, “BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage,” Molecular Neurobiology, vol. 57, no. 2. Springer Nature, pp. 1070–1084, 2020.","ama":"Donahue R, Maes ME, Grosser J, Nickells R. BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage. Molecular Neurobiology. 2020;57(2):1070–1084. doi:10.1007/s12035-019-01783-7","chicago":"Donahue, RJ, Margaret E Maes, JA Grosser, and RW Nickells. “BAX-Depleted Retinal Ganglion Cells Survive and Become Quiescent Following Optic Nerve Damage.” Molecular Neurobiology. Springer Nature, 2020. https://doi.org/10.1007/s12035-019-01783-7.","ista":"Donahue R, Maes ME, Grosser J, Nickells R. 2020. BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage. Molecular Neurobiology. 57(2), 1070–1084.","mla":"Donahue, RJ, et al. “BAX-Depleted Retinal Ganglion Cells Survive and Become Quiescent Following Optic Nerve Damage.” Molecular Neurobiology, vol. 57, no. 2, Springer Nature, 2020, pp. 1070–1084, doi:10.1007/s12035-019-01783-7."},"date_created":"2019-11-18T14:18:39Z"},{"arxiv":1,"author":[{"last_name":"Ghosh","full_name":"Ghosh, Sayak","first_name":"Sayak"},{"first_name":"Michael","full_name":"Matty, Michael","last_name":"Matty"},{"last_name":"Baumbach","first_name":"Ryan","full_name":"Baumbach, Ryan"},{"full_name":"Bauer, Eric D.","first_name":"Eric D.","last_name":"Bauer"},{"first_name":"Kimberly A","full_name":"Modic, Kimberly A","orcid":"0000-0001-9760-3147","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","last_name":"Modic"},{"last_name":"Shekhter","full_name":"Shekhter, Arkady","first_name":"Arkady"},{"full_name":"Mydosh, J. A.","first_name":"J. A.","last_name":"Mydosh"},{"first_name":"Eun-Ah","full_name":"Kim, Eun-Ah","last_name":"Kim"},{"first_name":"B. J.","full_name":"Ramshaw, B. J.","last_name":"Ramshaw"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://arxiv.org/abs/1903.00552","open_access":"1"}],"oa_version":"Preprint","day":"06","month":"03","status":"public","type":"journal_article","pmid":1,"title":"One-component order parameter in URu2Si2 uncovered by resonant ultrasound spectroscopy and machine learning","issue":"10","article_processing_charge":"No","date_updated":"2022-08-25T15:08:41Z","oa":1,"intvolume":" 6","language":[{"iso":"eng"}],"publication":"Science Advances","publication_status":"published","abstract":[{"text":"The unusual correlated state that emerges in URu2Si2 below THO = 17.5 K is known as “hidden order” because even basic characteristics of the order parameter, such as its dimensionality (whether it has one component or two), are “hidden.” We use resonant ultrasound spectroscopy to measure the symmetry-resolved elastic anomalies across THO. We observe no anomalies in the shear elastic moduli, providing strong thermodynamic evidence for a one-component order parameter. We develop a machine learning framework that reaches this conclusion directly from the raw data, even in a crystal that is too small for traditional resonant ultrasound. Our result rules out a broad class of theories of hidden order based on two-component order parameters, and constrains the nature of the fluctuations from which unconventional superconductivity emerges at lower temperature. Our machine learning framework is a powerful new tool for classifying the ubiquitous competing orders in correlated electron systems.","lang":"eng"}],"external_id":{"arxiv":["1903.00552"],"pmid":["32181367"]},"volume":6,"quality_controlled":"1","extern":"1","date_published":"2020-03-06T00:00:00Z","publisher":"American Association for the Advancement of Science","citation":{"mla":"Ghosh, Sayak, et al. “One-Component Order Parameter in URu2Si2 Uncovered by Resonant  Ultrasound Spectroscopy and Machine Learning.” Science Advances, vol. 6, no. 10, eaaz4074, American Association for the Advancement of Science, 2020, doi:10.1126/sciadv.aaz4074.","ista":"Ghosh S, Matty M, Baumbach R, Bauer ED, Modic KA, Shekhter A, Mydosh JA, Kim E-A, Ramshaw BJ. 2020. One-component order parameter in URu2Si2 uncovered by resonant  ultrasound spectroscopy and machine learning. Science Advances. 6(10), eaaz4074.","chicago":"Ghosh, Sayak, Michael Matty, Ryan Baumbach, Eric D. Bauer, Kimberly A Modic, Arkady Shekhter, J. A. Mydosh, Eun-Ah Kim, and B. J. Ramshaw. “One-Component Order Parameter in URu2Si2 Uncovered by Resonant  Ultrasound Spectroscopy and Machine Learning.” Science Advances. American Association for the Advancement of Science, 2020. https://doi.org/10.1126/sciadv.aaz4074.","ieee":"S. Ghosh et al., “One-component order parameter in URu2Si2 uncovered by resonant  ultrasound spectroscopy and machine learning,” Science Advances, vol. 6, no. 10. American Association for the Advancement of Science, 2020.","ama":"Ghosh S, Matty M, Baumbach R, et al. One-component order parameter in URu2Si2 uncovered by resonant  ultrasound spectroscopy and machine learning. Science Advances. 2020;6(10). doi:10.1126/sciadv.aaz4074","short":"S. Ghosh, M. Matty, R. Baumbach, E.D. Bauer, K.A. Modic, A. Shekhter, J.A. Mydosh, E.-A. Kim, B.J. Ramshaw, Science Advances 6 (2020).","apa":"Ghosh, S., Matty, M., Baumbach, R., Bauer, E. D., Modic, K. A., Shekhter, A., … Ramshaw, B. J. (2020). One-component order parameter in URu2Si2 uncovered by resonant  ultrasound spectroscopy and machine learning. Science Advances. American Association for the Advancement of Science. https://doi.org/10.1126/sciadv.aaz4074"},"date_created":"2019-11-19T14:01:10Z","year":"2020","article_number":"eaaz4074","article_type":"original","_id":"7084","doi":"10.1126/sciadv.aaz4074"},{"publisher":"Society for Industrial and Applied Mathematics","date_published":"2020-10-01T00:00:00Z","department":[{"_id":"JaMa"}],"page":"2759-2802","volume":52,"quality_controlled":"1","external_id":{"arxiv":["1809.01092"],"isi":["000546975100017"]},"abstract":[{"lang":"eng","text":"We consider dynamical transport metrics for probability measures on discretisations of a bounded convex domain in ℝd. These metrics are natural discrete counterparts to the Kantorovich metric 𝕎2, defined using a Benamou-Brenier type formula. Under mild assumptions we prove an asymptotic upper bound for the discrete transport metric Wt in terms of 𝕎2, as the size of the mesh T tends to 0. However, we show that the corresponding lower bound may fail in general, even on certain one-dimensional and symmetric two-dimensional meshes. In addition, we show that the asymptotic lower bound holds under an isotropy assumption on the mesh, which turns out to be essentially necessary. This assumption is satisfied, e.g., for tilings by convex regular polygons, and it implies Gromov-Hausdorff convergence of the transport metric."}],"publication_status":"published","doi":"10.1137/19M1243440","article_type":"original","_id":"71","year":"2020","date_created":"2018-12-11T11:44:28Z","publist_id":"7983","citation":{"ama":"Gladbach P, Kopfer E, Maas J. Scaling limits of discrete optimal transport. SIAM Journal on Mathematical Analysis. 2020;52(3):2759-2802. doi:10.1137/19M1243440","ieee":"P. Gladbach, E. Kopfer, and J. Maas, “Scaling limits of discrete optimal transport,” SIAM Journal on Mathematical Analysis, vol. 52, no. 3. Society for Industrial and Applied Mathematics, pp. 2759–2802, 2020.","short":"P. Gladbach, E. Kopfer, J. Maas, SIAM Journal on Mathematical Analysis 52 (2020) 2759–2802.","chicago":"Gladbach, Peter, Eva Kopfer, and Jan Maas. “Scaling Limits of Discrete Optimal Transport.” SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics, 2020. https://doi.org/10.1137/19M1243440.","mla":"Gladbach, Peter, et al. “Scaling Limits of Discrete Optimal Transport.” SIAM Journal on Mathematical Analysis, vol. 52, no. 3, Society for Industrial and Applied Mathematics, 2020, pp. 2759–802, doi:10.1137/19M1243440.","ista":"Gladbach P, Kopfer E, Maas J. 2020. Scaling limits of discrete optimal transport. SIAM Journal on Mathematical Analysis. 52(3), 2759–2802.","apa":"Gladbach, P., Kopfer, E., & Maas, J. (2020). Scaling limits of discrete optimal transport. SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/19M1243440"},"type":"journal_article","status":"public","publication_identifier":{"issn":["00361410"],"eissn":["10957154"]},"month":"10","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.01092"}],"day":"01","oa_version":"Preprint","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Gladbach, Peter","first_name":"Peter","last_name":"Gladbach"},{"last_name":"Kopfer","first_name":"Eva","full_name":"Kopfer, Eva"},{"last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","first_name":"Jan","full_name":"Maas, Jan"}],"arxiv":1,"publication":"SIAM Journal on Mathematical Analysis","language":[{"iso":"eng"}],"isi":1,"intvolume":" 52","scopus_import":"1","date_updated":"2023-09-18T08:13:15Z","oa":1,"article_processing_charge":"No","issue":"3","title":"Scaling limits of discrete optimal transport"},{"publication":"Current Opinion in Plant Biology","language":[{"iso":"eng"}],"intvolume":" 53","scopus_import":"1","isi":1,"title":"Auxin signalling in growth: Schrödinger's cat out of the bag","date_updated":"2023-08-17T14:07:22Z","issue":"2","article_processing_charge":"No","pmid":1,"type":"journal_article","status":"public","oa_version":"None","day":"01","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"02","publication_identifier":{"issn":["1369-5266"],"eissn":["1879-0356"]},"author":[{"first_name":"Michelle C","full_name":"Gallei, Michelle C","last_name":"Gallei","id":"35A03822-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1286-7368"},{"last_name":"Luschnig","full_name":"Luschnig, Christian","first_name":"Christian"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","orcid":"0000-0002-8302-7596","first_name":"Jiří","full_name":"Friml, Jiří"}],"doi":"10.1016/j.pbi.2019.10.003","article_type":"original","_id":"7142","ec_funded":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"11626","status":"public"}]},"date_created":"2019-12-02T12:05:26Z","citation":{"ieee":"M. C. Gallei, C. Luschnig, and J. Friml, “Auxin signalling in growth: Schrödinger’s cat out of the bag,” Current Opinion in Plant Biology, vol. 53, no. 2. Elsevier, pp. 43–49, 2020.","ama":"Gallei MC, Luschnig C, Friml J. Auxin signalling in growth: Schrödinger’s cat out of the bag. Current Opinion in Plant Biology. 2020;53(2):43-49. doi:10.1016/j.pbi.2019.10.003","short":"M.C. Gallei, C. Luschnig, J. Friml, Current Opinion in Plant Biology 53 (2020) 43–49.","chicago":"Gallei, Michelle C, Christian Luschnig, and Jiří Friml. “Auxin Signalling in Growth: Schrödinger’s Cat out of the Bag.” Current Opinion in Plant Biology. Elsevier, 2020. https://doi.org/10.1016/j.pbi.2019.10.003.","ista":"Gallei MC, Luschnig C, Friml J. 2020. Auxin signalling in growth: Schrödinger’s cat out of the bag. Current Opinion in Plant Biology. 53(2), 43–49.","mla":"Gallei, Michelle C., et al. “Auxin Signalling in Growth: Schrödinger’s Cat out of the Bag.” Current Opinion in Plant Biology, vol. 53, no. 2, Elsevier, 2020, pp. 43–49, doi:10.1016/j.pbi.2019.10.003.","apa":"Gallei, M. C., Luschnig, C., & Friml, J. (2020). Auxin signalling in growth: Schrödinger’s cat out of the bag. Current Opinion in Plant Biology. Elsevier. https://doi.org/10.1016/j.pbi.2019.10.003"},"acknowledgement":"Research in J.F. laboratory is funded by the European Union's Horizon 2020 program (ERC grant agreement n° 742985); C.L. is supported by the Austrian Science Fund (FWF grant P 31493).","year":"2020","page":"43-49","department":[{"_id":"JiFr"}],"volume":53,"quality_controlled":"1","publisher":"Elsevier","date_published":"2020-02-01T00:00:00Z","project":[{"grant_number":"742985","_id":"261099A6-B435-11E9-9278-68D0E5697425","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","call_identifier":"H2020"}],"external_id":{"pmid":["31760231"],"isi":["000521120600007"]},"abstract":[{"lang":"eng","text":"The phytohormone auxin acts as an amazingly versatile coordinator of plant growth and development. With its morphogen-like properties, auxin controls sites and timing of differentiation and/or growth responses both, in quantitative and qualitative terms. Specificity in the auxin response depends largely on distinct modes of signal transmission, by which individual cells perceive and convert auxin signals into a remarkable diversity of responses. The best understood, or so-called canonical mechanism of auxin perception ultimately results in variable adjustments of the cellular transcriptome, via a short, nuclear signal transduction pathway. Additional findings that accumulated over decades implied that an additional, presumably, cell surface-based auxin perception mechanism mediates very rapid cellular responses and decisively contributes to the cell's overall hormonal response. Recent investigations into both, nuclear and cell surface auxin signalling challenged this assumed partition of roles for different auxin signalling pathways and revealed an unexpected complexity in transcriptional and non-transcriptional cellular responses mediated by auxin."}],"publication_status":"published"}]