[{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"short":"Q. Qiu, J. Lezama, A.M. Bronstein, G. Sapiro, in:, European Conference on Computer Vision, Springer Nature, 2018.","ama":"Qiu Q, Lezama J, Bronstein AM, Sapiro G. ForestHash: Semantic hashing with shallow random forests and tiny convolutional networks. In: European Conference on Computer Vision. Vol 11206. Springer Nature; 2018. doi:10.1007/978-3-030-01216-8_27","apa":"Qiu, Q., Lezama, J., Bronstein, A. M., & Sapiro, G. (2018). ForestHash: Semantic hashing with shallow random forests and tiny convolutional networks. In European Conference on Computer Vision (Vol. 11206). Munich, Germany: Springer Nature. https://doi.org/10.1007/978-3-030-01216-8_27","ieee":"Q. Qiu, J. Lezama, A. M. Bronstein, and G. Sapiro, “ForestHash: Semantic hashing with shallow random forests and tiny convolutional networks,” in European Conference on Computer Vision, Munich, Germany, 2018, vol. 11206, no. Part II.","ista":"Qiu Q, Lezama J, Bronstein AM, Sapiro G. 2018. ForestHash: Semantic hashing with shallow random forests and tiny convolutional networks. European Conference on Computer Vision. ECCV: European Conference on Computer Vision, LNCS, vol. 11206.","mla":"Qiu, Qiang, et al. “ForestHash: Semantic Hashing with Shallow Random Forests and Tiny Convolutional Networks.” European Conference on Computer Vision, vol. 11206, no. Part II, Springer Nature, 2018, doi:10.1007/978-3-030-01216-8_27.","chicago":"Qiu, Qiang, José Lezama, Alex M. Bronstein, and Guillermo Sapiro. “ForestHash: Semantic Hashing with Shallow Random Forests and Tiny Convolutional Networks.” In European Conference on Computer Vision, Vol. 11206. Springer Nature, 2018. https://doi.org/10.1007/978-3-030-01216-8_27."},"publication_status":"published","year":"2018","doi":"10.1007/978-3-030-01216-8_27","quality_controlled":"1","issue":"Part II","publisher":"Springer Nature","intvolume":" 11206","extern":"1","alternative_title":["LNCS"],"status":"public","month":"10","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1007/978-3-030-01216-8_27","abstract":[{"text":"In this paper, we introduce a random forest semantic hashing scheme that embeds tiny convolutional neural networks (CNN) into shallow random forests. A binary hash code for a data point is obtained by a set of decision trees, setting ‘1’ for the visited tree leaf, and ‘0’ for the rest. We propose to first randomly group arriving classes at each tree split node into two groups, obtaining a significantly simplified two-class classification problem that can be a handled with a light-weight CNN weak learner. Code uniqueness is achieved via the random class grouping, whilst code consistency is achieved using a low-rank loss in the CNN weak learners that encourages intra-class compactness for the two random class groups. Finally, we introduce an information-theoretic approach for aggregating codes of individual trees into a single hash code, producing a near-optimal unique hash for each class. The proposed approach significantly outperforms state-of-the-art hashing methods for image retrieval tasks on large-scale public datasets, and is comparable to image classification methods while utilizing a more compact, efficient and scalable representation. This work proposes a principled and robust procedure to train and deploy in parallel an ensemble of light-weight CNNs, instead of simply going deeper.","lang":"eng"}],"date_updated":"2025-01-23T13:25:18Z","day":"09","date_created":"2024-10-09T07:47:30Z","volume":11206,"article_processing_charge":"No","type":"conference","publication_identifier":{"issn":["0302-9743"],"isbn":["9783030012151"],"eisbn":["9783030012168"],"eissn":["1611-3349"]},"title":"ForestHash: Semantic hashing with shallow random forests and tiny convolutional networks","date_published":"2018-10-09T00:00:00Z","scopus_import":"1","publication":"European Conference on Computer Vision","author":[{"full_name":"Qiu, Qiang","first_name":"Qiang","last_name":"Qiu"},{"last_name":"Lezama","full_name":"Lezama, José","first_name":"José"},{"first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein","full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730"},{"last_name":"Sapiro","first_name":"Guillermo","full_name":"Sapiro, Guillermo"}],"_id":"18282","conference":{"end_date":"2018-09-14","start_date":"2018-09-08","location":"Munich, Germany","name":"ECCV: European Conference on Computer Vision"},"oa_version":"None"},{"type":"conference","article_processing_charge":"No","volume":11070,"date_created":"2024-10-09T07:47:49Z","abstract":[{"lang":"eng","text":"Cardiac ultrasound imaging requires a high frame rate in order to capture rapid motion. This can be achieved by multi-line acquisition (MLA), where several narrow-focused received lines are obtained from each wide-focused transmitted line. This shortens the acquisition time at the expense of introducing block artifacts. In this paper, we propose a data-driven learning-based approach to improve the MLA image quality. We train an end-to-end convolutional neural network on pairs of real ultrasound cardiac data, acquired through MLA and the corresponding single-line acquisition (SLA). The network achieves a significant improvement in image quality for both 5- and 7-line MLA resulting in a decorrelation measure similar to that of SLA while having the frame rate of MLA."}],"fulldoi":"https://doi.org/10.1007/978-3-030-00928-1_15","day":"14","date_updated":"2025-01-23T13:13:01Z","status":"public","language":[{"iso":"eng"}],"month":"09","_id":"18283","oa_version":"None","conference":{"name":"MICCAI: Medical Image Computing and Computer Assisted Intervention","location":"Granada, Spain","start_date":"2018-09-16","end_date":"2018-09-20"},"author":[{"first_name":"Ortal","full_name":"Senouf, Ortal","last_name":"Senouf"},{"full_name":"Vedula, Sanketh","last_name":"Vedula","first_name":"Sanketh"},{"first_name":"Grigoriy","full_name":"Zurakhov, Grigoriy","last_name":"Zurakhov"},{"orcid":"0000-0001-9699-8730","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein","first_name":"Alexander"},{"last_name":"Zibulevsky","full_name":"Zibulevsky, Michael","first_name":"Michael"},{"full_name":"Michailovich, Oleg","first_name":"Oleg","last_name":"Michailovich"},{"full_name":"Adam, Dan","last_name":"Adam","first_name":"Dan"},{"last_name":"Blondheim","first_name":"David","full_name":"Blondheim, David"}],"publication":"International Conference on Medical Image Computing and Computer Assisted Intervention","scopus_import":"1","date_published":"2018-09-14T00:00:00Z","title":"High frame-rate cardiac ultrasound imaging with deep learning","publication_identifier":{"eisbn":["9783030009281"],"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783030009274"]},"quality_controlled":"1","year":"2018","doi":"10.1007/978-3-030-00928-1_15","page":"126 - 134","publication_status":"published","citation":{"ieee":"O. Senouf et al., “High frame-rate cardiac ultrasound imaging with deep learning,” in International Conference on Medical Image Computing and Computer Assisted Intervention, Granada, Spain, 2018, vol. 11070, no. Part 1, pp. 126–134.","apa":"Senouf, O., Vedula, S., Zurakhov, G., Bronstein, A. M., Zibulevsky, M., Michailovich, O., … Blondheim, D. (2018). High frame-rate cardiac ultrasound imaging with deep learning. In International Conference on Medical Image Computing and Computer Assisted Intervention (Vol. 11070, pp. 126–134). Granada, Spain: Springer Nature. https://doi.org/10.1007/978-3-030-00928-1_15","ista":"Senouf O, Vedula S, Zurakhov G, Bronstein AM, Zibulevsky M, Michailovich O, Adam D, Blondheim D. 2018. High frame-rate cardiac ultrasound imaging with deep learning. International Conference on Medical Image Computing and Computer Assisted Intervention. MICCAI: Medical Image Computing and Computer Assisted Intervention, LNCS, vol. 11070, 126–134.","mla":"Senouf, Ortal, et al. “High Frame-Rate Cardiac Ultrasound Imaging with Deep Learning.” International Conference on Medical Image Computing and Computer Assisted Intervention, vol. 11070, no. Part 1, Springer Nature, 2018, pp. 126–34, doi:10.1007/978-3-030-00928-1_15.","chicago":"Senouf, Ortal, Sanketh Vedula, Grigoriy Zurakhov, Alex M. Bronstein, Michael Zibulevsky, Oleg Michailovich, Dan Adam, and David Blondheim. “High Frame-Rate Cardiac Ultrasound Imaging with Deep Learning.” In International Conference on Medical Image Computing and Computer Assisted Intervention, 11070:126–34. Springer Nature, 2018. https://doi.org/10.1007/978-3-030-00928-1_15.","short":"O. Senouf, S. Vedula, G. Zurakhov, A.M. Bronstein, M. Zibulevsky, O. Michailovich, D. Adam, D. Blondheim, in:, International Conference on Medical Image Computing and Computer Assisted Intervention, Springer Nature, 2018, pp. 126–134.","ama":"Senouf O, Vedula S, Zurakhov G, et al. High frame-rate cardiac ultrasound imaging with deep learning. In: International Conference on Medical Image Computing and Computer Assisted Intervention. Vol 11070. Springer Nature; 2018:126-134. doi:10.1007/978-3-030-00928-1_15"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"intvolume":" 11070","publisher":"Springer Nature","issue":"Part 1","extern":"1"},{"month":"09","language":[{"iso":"eng"}],"status":"public","date_updated":"2025-01-23T12:53:22Z","day":"12","abstract":[{"text":"Frame rate is a crucial consideration in cardiac ultrasound imaging and 3D sonography. Several methods have been proposed in the medical ultrasound literature aiming at accelerating the image acquisition. In this paper, we consider one such method called multi-line transmission (MLT), in which several evenly separated focused beams are transmitted simultaneously. While MLT reduces the acquisition time, it comes at the expense of a heavy loss of contrast due to the interactions between the beams (cross-talk artifact). In this paper, we introduce a data-driven method to reduce the artifacts arising in MLT. To this end, we propose to train an end-to-end convolutional neural network consisting of correction layers followed by a constant apodization layer. The network is trained on pairs of raw data obtained through MLT and the corresponding single-line transmission (SLT) data. Experimental evaluation demonstrates significant improvement both in the visual image quality and in objective measures such as contrast ratio and contrast-to-noise ratio, while preserving resolution unlike traditional apodization-based methods. We show that the proposed method is able to generalize well across different patients and anatomies on real and phantom data.","lang":"eng"}],"fulldoi":"https://doi.org/10.1007/978-3-030-00129-2_17","volume":11074,"date_created":"2024-10-09T07:48:06Z","type":"conference","article_processing_charge":"No","title":"High quality ultrasonic multi-line transmission through deep learning","publication_identifier":{"eisbn":["9783030001292"],"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783030001285"]},"date_published":"2018-09-12T00:00:00Z","scopus_import":"1","publication":"First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018","author":[{"last_name":"Vedula","full_name":"Vedula, Sanketh","first_name":"Sanketh"},{"first_name":"Ortal","full_name":"Senouf, Ortal","last_name":"Senouf"},{"first_name":"Grigoriy","last_name":"Zurakhov","full_name":"Zurakhov, Grigoriy"},{"orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein","first_name":"Alexander","full_name":"Bronstein, Alexander"},{"full_name":"Zibulevsky, Michael","last_name":"Zibulevsky","first_name":"Michael"},{"full_name":"Michailovich, Oleg","last_name":"Michailovich","first_name":"Oleg"},{"first_name":"Dan","full_name":"Adam, Dan","last_name":"Adam"},{"full_name":"Gaitini, Diana","first_name":"Diana","last_name":"Gaitini"}],"oa_version":"None","conference":{"start_date":"2018-09-16","end_date":"2018-09-16","name":"MLMIR: Workshop on Machine Learning for Medical Image Reconstruction","location":"Granada, Spain"},"_id":"18284","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","citation":{"ista":"Vedula S, Senouf O, Zurakhov G, Bronstein AM, Zibulevsky M, Michailovich O, Adam D, Gaitini D. 2018. High quality ultrasonic multi-line transmission through deep learning. First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018. MLMIR: Workshop on Machine Learning for Medical Image Reconstruction, LNCS, vol. 11074, 147–155.","apa":"Vedula, S., Senouf, O., Zurakhov, G., Bronstein, A. M., Zibulevsky, M., Michailovich, O., … Gaitini, D. (2018). High quality ultrasonic multi-line transmission through deep learning. In First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018 (Vol. 11074, pp. 147–155). Granada, Spain: Springer Nature. https://doi.org/10.1007/978-3-030-00129-2_17","ieee":"S. Vedula et al., “High quality ultrasonic multi-line transmission through deep learning,” in First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018, Granada, Spain, 2018, vol. 11074, pp. 147–155.","chicago":"Vedula, Sanketh, Ortal Senouf, Grigoriy Zurakhov, Alex M. Bronstein, Michael Zibulevsky, Oleg Michailovich, Dan Adam, and Diana Gaitini. “High Quality Ultrasonic Multi-Line Transmission through Deep Learning.” In First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018, 11074:147–55. Springer Nature, 2018. https://doi.org/10.1007/978-3-030-00129-2_17.","mla":"Vedula, Sanketh, et al. “High Quality Ultrasonic Multi-Line Transmission through Deep Learning.” First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018, vol. 11074, Springer Nature, 2018, pp. 147–55, doi:10.1007/978-3-030-00129-2_17.","short":"S. Vedula, O. Senouf, G. Zurakhov, A.M. Bronstein, M. Zibulevsky, O. Michailovich, D. Adam, D. Gaitini, in:, First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018, Springer Nature, 2018, pp. 147–155.","ama":"Vedula S, Senouf O, Zurakhov G, et al. High quality ultrasonic multi-line transmission through deep learning. In: First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018. Vol 11074. Springer Nature; 2018:147-155. doi:10.1007/978-3-030-00129-2_17"},"doi":"10.1007/978-3-030-00129-2_17","year":"2018","page":"147 - 155","quality_controlled":"1","extern":"1","intvolume":" 11074","publisher":"Springer Nature","alternative_title":["LNCS"]},{"abstract":[{"text":"Single image depth estimation is achieved using computational imaging and Deep Learning (DL). Imaging with phase-mask is also modeled as a DL-layer, and the mask and DL parameters are jointly designed using labeled data.","lang":"eng"}],"publication_status":"published","fulldoi":"https://doi.org/10.1364/cosi.2018.cw3b.3","citation":{"ieee":"H. Haim, S. Elmalem, R. Giryes, A. M. Bronstein, and E. Marom, “Deep learned phase mask for single image depth estimation and 3D scanning,” in Imaging and Applied Optics 2018 (3D, AO, AIO, COSI, DH, IS, LACSEA, LS&C, MATH, pcAOP), Orlando, FL, United States, 2018, vol. Part F99-COSI 2018.","apa":"Haim, H., Elmalem, S., Giryes, R., Bronstein, A. M., & Marom, E. (2018). Deep learned phase mask for single image depth estimation and 3D scanning. In Imaging and Applied Optics 2018 (3D, AO, AIO, COSI, DH, IS, LACSEA, LS&C, MATH, pcAOP) (Vol. Part F99-COSI 2018). Orlando, FL, United States: OSA. https://doi.org/10.1364/cosi.2018.cw3b.3","ista":"Haim H, Elmalem S, Giryes R, Bronstein AM, Marom E. 2018. Deep learned phase mask for single image depth estimation and 3D scanning. Imaging and Applied Optics 2018 (3D, AO, AIO, COSI, DH, IS, LACSEA, LS&C, MATH, pcAOP). COSI: Computational Optical Sensing and Imaging vol. Part F99-COSI 2018, CW3B.3.","mla":"Haim, Harel, et al. “Deep Learned Phase Mask for Single Image Depth Estimation and 3D Scanning.” Imaging and Applied Optics 2018 (3D, AO, AIO, COSI, DH, IS, LACSEA, LS&C, MATH, PcAOP), vol. Part F99-COSI 2018, CW3B.3, OSA, 2018, doi:10.1364/cosi.2018.cw3b.3.","chicago":"Haim, Harel, Shay Elmalem, Raja Giryes, Alex M. Bronstein, and Emanuel Marom. “Deep Learned Phase Mask for Single Image Depth Estimation and 3D Scanning.” In Imaging and Applied Optics 2018 (3D, AO, AIO, COSI, DH, IS, LACSEA, LS&C, MATH, PcAOP), Vol. Part F99-COSI 2018. OSA, 2018. https://doi.org/10.1364/cosi.2018.cw3b.3.","short":"H. Haim, S. Elmalem, R. Giryes, A.M. Bronstein, E. Marom, in:, Imaging and Applied Optics 2018 (3D, AO, AIO, COSI, DH, IS, LACSEA, LS&C, MATH, PcAOP), OSA, 2018.","ama":"Haim H, Elmalem S, Giryes R, Bronstein AM, Marom E. Deep learned phase mask for single image depth estimation and 3D scanning. In: Imaging and Applied Optics 2018 (3D, AO, AIO, COSI, DH, IS, LACSEA, LS&C, MATH, PcAOP). Vol Part F99-COSI 2018. OSA; 2018. doi:10.1364/cosi.2018.cw3b.3"},"date_updated":"2025-01-23T12:42:46Z","day":"01","status":"public","month":"06","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"type":"conference","article_processing_charge":"No","quality_controlled":"1","year":"2018","doi":"10.1364/cosi.2018.cw3b.3","volume":"Part F99-COSI 2018","date_created":"2024-10-09T07:48:24Z","date_published":"2018-06-01T00:00:00Z","title":"Deep learned phase mask for single image depth estimation and 3D scanning","publisher":"OSA","publication_identifier":{"isbn":["9781943580446"]},"extern":"1","_id":"18285","oa_version":"None","conference":{"start_date":"2018-06-25","end_date":"2018-06-28","name":"COSI: Computational Optical Sensing and Imaging","location":"Orlando, FL, United States"},"author":[{"last_name":"Haim","full_name":"Haim, Harel","first_name":"Harel"},{"full_name":"Elmalem, Shay","last_name":"Elmalem","first_name":"Shay"},{"last_name":"Giryes","full_name":"Giryes, Raja","first_name":"Raja"},{"orcid":"0000-0001-9699-8730","last_name":"Bronstein","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander"},{"first_name":"Emanuel","full_name":"Marom, Emanuel","last_name":"Marom"}],"scopus_import":"1","article_number":"CW3B.3","publication":"Imaging and Applied Optics 2018 (3D, AO, AIO, COSI, DH, IS, LACSEA, LS&C, MATH, pcAOP)"},{"publist_id":"7738","article_processing_charge":"No","type":"conference","date_created":"2018-12-11T11:45:04Z","day":"11","date_updated":"2025-07-10T11:51:22Z","fulldoi":"https://doi.org/10.1145/3178126.3178131","abstract":[{"text":"Fault-localization is considered to be a very tedious and time-consuming activity in the design of complex Cyber-Physical Systems (CPS). This laborious task essentially requires expert knowledge of the system in order to discover the cause of the fault. In this context, we propose a new procedure that AIDS designers in debugging Simulink/Stateflow hybrid system models, guided by Signal Temporal Logic (STL) specifications. The proposed method relies on three main ingredients: (1) a monitoring and a trace diagnostics procedure that checks whether a tested behavior satisfies or violates an STL specification, localizes time segments and interfaces variables contributing to the property violations; (2) a slicing procedure that maps these observable behavior segments to the internal states and transitions of the Simulink model; and (3) a spectrum-based fault-localization method that combines the previous analysis from multiple tests to identify the internal states and/or transitions that are the most likely to explain the fault. We demonstrate the applicability of our approach on two Simulink models from the automotive and the avionics domain.","lang":"eng"}],"language":[{"iso":"eng"}],"month":"04","status":"public","department":[{"_id":"ToHe"}],"conference":{"name":"HSCC: Hybrid Systems - Computation and Control","location":"Porto, Portugal","start_date":"2018-04-11","end_date":"2018-04-13"},"oa_version":"None","_id":"183","acknowledgement":"This work was partially supported by the Austrian Science Fund (FWF) under grants S11402-N23 and S11405-N23 (RiSE/SHiNE), the CPS/IoT project (HRSM), the EU ICT COST Action IC1402 on Run-time Verification beyond Monitoring (ARVI), the AMASS project (ECSEL 692474), and the ENABLE-S3 project (ECSEL 692455). The CPS/IoT project receives support from the Austrian government through the Federal Ministry of Science, Research and Economy (BMWFW) in the funding program Hochschulraum-Strukturmittel (HRSM) 2016. The ECSEL Joint Undertaking receives support from the European Union’s Horizon 2020 research and innovation programme and Austria, Denmark, Germany, Finland, Czech Republic, Italy, Spain, Portugal, Poland, Ireland, Belgium, France, Netherlands, United Kingdom, Slovakia, Norway.","author":[{"first_name":"Ezio","full_name":"Bartocci, Ezio","last_name":"Bartocci"},{"orcid":"0000-0001-5199-3143","last_name":"Ferrere","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas","first_name":"Thomas"},{"full_name":"Manjunath, Niveditha","first_name":"Niveditha","last_name":"Manjunath"},{"last_name":"Nickovic","first_name":"Dejan","full_name":"Nickovic, Dejan"}],"scopus_import":"1","external_id":{"isi":["000474781600022"]},"date_published":"2018-04-11T00:00:00Z","title":"Localizing faults in simulink/stateflow models with STL","quality_controlled":"1","page":"197 - 206","doi":"10.1145/3178126.3178131","year":"2018","citation":{"ama":"Bartocci E, Ferrere T, Manjunath N, Nickovic D. Localizing faults in simulink/stateflow models with STL. In: Association for Computing Machinery; 2018:197-206. doi:10.1145/3178126.3178131","short":"E. Bartocci, T. Ferrere, N. Manjunath, D. Nickovic, in:, Association for Computing Machinery, 2018, pp. 197–206.","mla":"Bartocci, Ezio, et al. Localizing Faults in Simulink/Stateflow Models with STL. Association for Computing Machinery, 2018, pp. 197–206, doi:10.1145/3178126.3178131.","chicago":"Bartocci, Ezio, Thomas Ferrere, Niveditha Manjunath, and Dejan Nickovic. “Localizing Faults in Simulink/Stateflow Models with STL,” 197–206. Association for Computing Machinery, 2018. https://doi.org/10.1145/3178126.3178131.","apa":"Bartocci, E., Ferrere, T., Manjunath, N., & Nickovic, D. (2018). Localizing faults in simulink/stateflow models with STL (pp. 197–206). Presented at the HSCC: Hybrid Systems - Computation and Control, Porto, Portugal: Association for Computing Machinery. https://doi.org/10.1145/3178126.3178131","ieee":"E. Bartocci, T. Ferrere, N. Manjunath, and D. Nickovic, “Localizing faults in simulink/stateflow models with STL,” presented at the HSCC: Hybrid Systems - Computation and Control, Porto, Portugal, 2018, pp. 197–206.","ista":"Bartocci E, Ferrere T, Manjunath N, Nickovic D. 2018. Localizing faults in simulink/stateflow models with STL. HSCC: Hybrid Systems - Computation and Control, HSCC Proceedings, , 197–206."},"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"}],"isi":1,"alternative_title":["HSCC Proceedings"],"publisher":"Association for Computing Machinery"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Shellability is NP-complete. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:41:1-41:16. doi:10.4230/LIPIcs.SoCG.2018.41","short":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16.","mla":"Goaoc, Xavier, et al. Shellability Is NP-Complete. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16, doi:10.4230/LIPIcs.SoCG.2018.41.","chicago":"Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Shellability Is NP-Complete,” 99:41:1-41:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.41.","ieee":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Shellability is NP-complete,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 41:1-41:16.","apa":"Goaoc, X., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2018). Shellability is NP-complete (Vol. 99, p. 41:1-41:16). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.41","ista":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2018. Shellability is NP-complete. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 41:1-41:16."},"publication_status":"published","page":"41:1 - 41:16","year":"2018","doi":"10.4230/LIPIcs.SoCG.2018.41","quality_controlled":"1","ddc":["516","000"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":" 99","file":[{"date_created":"2018-12-17T16:35:02Z","relation":"main_file","file_size":718414,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","checksum":"d12bdd60f04a57307867704b5f930afd","file_id":"5725","date_updated":"2020-07-14T12:45:18Z","file_name":"2018_LIPIcs_Goaoc.pdf"}],"alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"related_material":{"record":[{"id":"7108","relation":"later_version","status":"public"}]},"oa":1,"department":[{"_id":"UlWa"}],"status":"public","has_accepted_license":"1","language":[{"iso":"eng"}],"month":"06","fulldoi":"https://doi.org/10.4230/LIPIcs.SoCG.2018.41","abstract":[{"lang":"eng","text":"We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial complex is shellable is NP-hard, hence NP-complete. This resolves a question raised, e.g., by Danaraj and Klee in 1978. Our reduction also yields that for every d ≥ 2 and k ≥ 0, deciding if a pure, d-dimensional, simplicial complex is k-decomposable is NP-hard. For d ≥ 3, both problems remain NP-hard when restricted to contractible pure d-dimensional complexes."}],"day":"11","date_updated":"2025-06-04T07:49:02Z","volume":99,"date_created":"2018-12-11T11:45:04Z","publist_id":"7736","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","title":"Shellability is NP-complete","date_published":"2018-06-11T00:00:00Z","file_date_updated":"2020-07-14T12:45:18Z","author":[{"first_name":"Xavier","full_name":"Goaoc, Xavier","last_name":"Goaoc"},{"full_name":"Paták, Pavel","last_name":"Paták","first_name":"Pavel"},{"orcid":"0000-0002-3975-1683","last_name":"Patakova","first_name":"Zuzana","id":"48B57058-F248-11E8-B48F-1D18A9856A87","full_name":"Patakova, Zuzana"},{"orcid":"0000-0002-1191-6714","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","full_name":"Tancer, Martin","last_name":"Tancer","first_name":"Martin"},{"orcid":"0000-0002-1494-0568","first_name":"Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli"}],"scopus_import":1,"_id":"184","acknowledgement":"Partially supported by the project EMBEDS II (CZ: 7AMB17FR029, FR: 38087RM) of Czech-French collaboration.","conference":{"start_date":"2018-06-11","end_date":"2018-06-14","name":"SoCG: Symposium on Computational Geometry","location":"Budapest, Hungary"},"oa_version":"Published Version"},{"abstract":[{"text":"The increasing demand for high image quality in mobile devices brings forth the need for better computational enhancement techniques, and image denoising in particular. To this end, we propose a new fully convolutional deep neural network architecture which is simple yet powerful and achieves state-of-the-art performance for additive Gaussian noise removal. Furthermore, we claim that the personal photo-collections can usually be categorized into a small set of semantic classes. However simple, this observation has not been exploited in image denoising until now. We show that a significant boost in performance of up to 0.4dB PSNR can be achieved by making our network class-aware, namely, by fine-tuning it for images belonging to a specific semantic class. Relying on the hugely successful existing image classifiers, this research advocates for using a class-aware approach in all image enhancement tasks.","lang":"eng"}],"publication_status":"published","fulldoi":"https://doi.org/10.1109/icip.2017.8296611","citation":{"ista":"Remez T, Litany O, Giryes R, Bronstein AM. 2018. Deep class-aware image denoising. 2017 IEEE International Conference on Image Processing (ICIP). 24th IEEE International Conference on Image Processing, 1895–1899.","ieee":"T. Remez, O. Litany, R. Giryes, and A. M. Bronstein, “Deep class-aware image denoising,” in 2017 IEEE International Conference on Image Processing (ICIP), Beijing, China, 2018, pp. 1895–1899.","apa":"Remez, T., Litany, O., Giryes, R., & Bronstein, A. M. (2018). Deep class-aware image denoising. In 2017 IEEE International Conference on Image Processing (ICIP) (pp. 1895–1899). Beijing, China: IEEE. https://doi.org/10.1109/icip.2017.8296611","chicago":"Remez, Tal, Or Litany, Raja Giryes, and Alex M. Bronstein. “Deep Class-Aware Image Denoising.” In 2017 IEEE International Conference on Image Processing (ICIP), 1895–99. IEEE, 2018. https://doi.org/10.1109/icip.2017.8296611.","mla":"Remez, Tal, et al. “Deep Class-Aware Image Denoising.” 2017 IEEE International Conference on Image Processing (ICIP), IEEE, 2018, pp. 1895–99, doi:10.1109/icip.2017.8296611.","short":"T. Remez, O. Litany, R. Giryes, A.M. Bronstein, in:, 2017 IEEE International Conference on Image Processing (ICIP), IEEE, 2018, pp. 1895–1899.","ama":"Remez T, Litany O, Giryes R, Bronstein AM. Deep class-aware image denoising. In: 2017 IEEE International Conference on Image Processing (ICIP). IEEE; 2018:1895-1899. doi:10.1109/icip.2017.8296611"},"date_updated":"2024-12-05T14:00:53Z","day":"22","status":"public","language":[{"iso":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"02","article_processing_charge":"No","type":"conference","quality_controlled":"1","year":"2018","doi":"10.1109/icip.2017.8296611","page":"1895 - 1899","date_created":"2024-10-15T11:20:54Z","date_published":"2018-02-22T00:00:00Z","title":"Deep class-aware image denoising","publisher":"IEEE","publication_identifier":{"eissn":["2381-8549"],"isbn":["9781509021765"]},"extern":"1","_id":"18402","oa_version":"None","conference":{"location":"Beijing, China","name":"24th IEEE International Conference on Image Processing","end_date":"2017-09-20","start_date":"2017-09-17"},"publication":"2017 IEEE International Conference on Image Processing (ICIP)","scopus_import":"1","author":[{"full_name":"Remez, Tal","last_name":"Remez","first_name":"Tal"},{"last_name":"Litany","full_name":"Litany, Or","first_name":"Or"},{"full_name":"Giryes, Raja","last_name":"Giryes","first_name":"Raja"},{"orcid":"0000-0001-9699-8730","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein","full_name":"Bronstein, Alexander"}]},{"fulldoi":"https://doi.org/10.1007/s00209-017-1934-8","abstract":[{"lang":"eng","text":"We study the L p-theory for the Schrödinger operatorLa with inverse-square potential\r\na|x|^−2. Our main result describes when L p-based Sobolev spaces defined in terms of the\r\noperator (La)^s/2 agree with those defined via (−\u0002)^s/2.We consider all regularities 0 < s < 2.\r\nIn order to make the paper self-contained, we also review (with proofs) multiplier theorems,\r\nLittlewood–Paley theory, and Hardy-type inequalities associated to the operator La."}],"day":"01","date_updated":"2026-06-25T07:36:26Z","status":"public","language":[{"iso":"eng"}],"month":"04","type":"journal_article","article_processing_charge":"No","volume":288,"date_created":"2026-06-19T07:46:14Z","date_published":"2018-04-01T00:00:00Z","arxiv":1,"publication_identifier":{"issn":["0025-5874"],"eissn":["1432-1823"]},"title":"Sobolev spaces adapted to the Schrödinger operator with inverse-square potential","_id":"22042","oa_version":"Preprint","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1503.02716","open_access":"1"}],"publication":"Mathematische Zeitschrift","scopus_import":"1","author":[{"full_name":"Killip, R.","first_name":"R.","last_name":"Killip"},{"first_name":"C.","full_name":"Miao, C.","last_name":"Miao"},{"full_name":"Visan, Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","first_name":"Monica","last_name":"Visan"},{"first_name":"J.","full_name":"Zhang, J.","last_name":"Zhang"},{"last_name":"Zheng","first_name":"J.","full_name":"Zheng, J."}],"external_id":{"arxiv":["1503.02716"]},"citation":{"mla":"Killip, R., et al. “Sobolev Spaces Adapted to the Schrödinger Operator with Inverse-Square Potential.” Mathematische Zeitschrift, vol. 288, no. 3–4, Springer Nature, 2018, pp. 1273–98, doi:10.1007/s00209-017-1934-8.","chicago":"Killip, R., C. Miao, Monica Vişan, J. Zhang, and J. Zheng. “Sobolev Spaces Adapted to the Schrödinger Operator with Inverse-Square Potential.” Mathematische Zeitschrift. Springer Nature, 2018. https://doi.org/10.1007/s00209-017-1934-8.","apa":"Killip, R., Miao, C., Vişan, M., Zhang, J., & Zheng, J. (2018). Sobolev spaces adapted to the Schrödinger operator with inverse-square potential. Mathematische Zeitschrift. Springer Nature. https://doi.org/10.1007/s00209-017-1934-8","ieee":"R. Killip, C. Miao, M. Vişan, J. Zhang, and J. Zheng, “Sobolev spaces adapted to the Schrödinger operator with inverse-square potential,” Mathematische Zeitschrift, vol. 288, no. 3–4. Springer Nature, pp. 1273–1298, 2018.","ista":"Killip R, Miao C, Vişan M, Zhang J, Zheng J. 2018. Sobolev spaces adapted to the Schrödinger operator with inverse-square potential. Mathematische Zeitschrift. 288(3–4), 1273–1298.","ama":"Killip R, Miao C, Vişan M, Zhang J, Zheng J. Sobolev spaces adapted to the Schrödinger operator with inverse-square potential. Mathematische Zeitschrift. 2018;288(3-4):1273-1298. doi:10.1007/s00209-017-1934-8","short":"R. Killip, C. Miao, M. Vişan, J. Zhang, J. Zheng, Mathematische Zeitschrift 288 (2018) 1273–1298."},"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","page":"1273-1298","year":"2018","doi":"10.1007/s00209-017-1934-8","issue":"3-4","publisher":"Springer Nature","intvolume":" 288","OA_type":"green","extern":"1","OA_place":"repository","oa":1,"article_type":"original","mathsc":["35P25","35Q55"]},{"volume":50,"date_created":"2026-06-19T07:49:03Z","article_processing_charge":"No","type":"journal_article","language":[{"iso":"eng"}],"month":"01","status":"public","date_updated":"2026-06-25T07:49:21Z","day":"01","abstract":[{"text":"We consider the initial-value problem for the cubic-quintic nonlinear Schrödinger equation (𝑖𝜕𝑡+Δ)𝜓 =𝛼1𝜓 −𝛼3|𝜓|2𝜓 +𝛼5|𝜓|4𝜓 in three spatial dimensions in the class of solutions with |𝜓(𝑥)| →𝑐 >0 as |𝑥| →∞. Here 𝛼1, 𝛼3, 𝛼5, and 𝑐 are such that 𝜓(𝑥) ≡𝑐 is an energetically stable equilibrium solution to this equation. Normalizing the boundary condition to 𝜓(𝑥) →1 as |𝑥| →∞, we study the associated initial-value problem for 𝑢 =𝜓 −1 and prove a scattering result for small initial data in a weighted Sobolev space.","lang":"eng"}],"fulldoi":"https://doi.org/10.1137/17m1116702","external_id":{"arxiv":["1702.04413"]},"publication":"SIAM Journal on Mathematical Analysis","author":[{"first_name":"Rowan","full_name":"Killip, Rowan","last_name":"Killip"},{"full_name":"Murphy, Jason","last_name":"Murphy","first_name":"Jason"},{"first_name":"Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","full_name":"Visan, Monica","last_name":"Visan"}],"scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1702.04413","open_access":"1"}],"oa_version":"Preprint","_id":"22045","title":"The initial-value problem for the cubic-quintic NLS with nonvanishing boundary conditions","publication_identifier":{"issn":["0036-1410","1095-7154"]},"arxiv":1,"date_published":"2018-01-01T00:00:00Z","year":"2018","doi":"10.1137/17m1116702","page":"2681-2739","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","citation":{"ieee":"R. Killip, J. Murphy, and M. Vişan, “The initial-value problem for the cubic-quintic NLS with nonvanishing boundary conditions,” SIAM Journal on Mathematical Analysis, vol. 50, no. 3. Society for Industrial & Applied Mathematics, pp. 2681–2739, 2018.","apa":"Killip, R., Murphy, J., & Vişan, M. (2018). The initial-value problem for the cubic-quintic NLS with nonvanishing boundary conditions. SIAM Journal on Mathematical Analysis. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/17m1116702","ista":"Killip R, Murphy J, Vişan M. 2018. The initial-value problem for the cubic-quintic NLS with nonvanishing boundary conditions. SIAM Journal on Mathematical Analysis. 50(3), 2681–2739.","mla":"Killip, Rowan, et al. “The Initial-Value Problem for the Cubic-Quintic NLS with Nonvanishing Boundary Conditions.” SIAM Journal on Mathematical Analysis, vol. 50, no. 3, Society for Industrial & Applied Mathematics, 2018, pp. 2681–739, doi:10.1137/17m1116702.","chicago":"Killip, Rowan, Jason Murphy, and Monica Vişan. “The Initial-Value Problem for the Cubic-Quintic NLS with Nonvanishing Boundary Conditions.” SIAM Journal on Mathematical Analysis. Society for Industrial & Applied Mathematics, 2018. https://doi.org/10.1137/17m1116702.","ama":"Killip R, Murphy J, Vişan M. The initial-value problem for the cubic-quintic NLS with nonvanishing boundary conditions. SIAM Journal on Mathematical Analysis. 2018;50(3):2681-2739. doi:10.1137/17m1116702","short":"R. Killip, J. Murphy, M. Vişan, SIAM Journal on Mathematical Analysis 50 (2018) 2681–2739."},"article_type":"original","mathsc":["35Q55"],"oa":1,"das_tickbox":"1","OA_place":"repository","keyword":["cubic-quintic NLS","nonvanishing boundary conditions","space-time resonances","scattering"],"extern":"1","OA_type":"green","intvolume":" 50","issue":"3","publisher":"Society for Industrial & Applied Mathematics"},{"intvolume":" 28","OA_type":"green","issue":"4","publisher":"Springer Nature","extern":"1","article_type":"original","OA_place":"repository","das_tickbox":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","citation":{"short":"R. Killip, M. Vişan, X. Zhang, Geometric and Functional Analysis 28 (2018) 1062–1090.","ama":"Killip R, Vişan M, Zhang X. Low regularity conservation laws for integrable PDE. Geometric and Functional Analysis. 2018;28(4):1062-1090. doi:10.1007/s00039-018-0444-0","chicago":"Killip, Rowan, Monica Vişan, and Xiaoyi Zhang. “Low Regularity Conservation Laws for Integrable PDE.” Geometric and Functional Analysis. Springer Nature, 2018. https://doi.org/10.1007/s00039-018-0444-0.","mla":"Killip, Rowan, et al. “Low Regularity Conservation Laws for Integrable PDE.” Geometric and Functional Analysis, vol. 28, no. 4, Springer Nature, 2018, pp. 1062–90, doi:10.1007/s00039-018-0444-0.","ista":"Killip R, Vişan M, Zhang X. 2018. Low regularity conservation laws for integrable PDE. Geometric and Functional Analysis. 28(4), 1062–1090.","ieee":"R. Killip, M. Vişan, and X. Zhang, “Low regularity conservation laws for integrable PDE,” Geometric and Functional Analysis, vol. 28, no. 4. Springer Nature, pp. 1062–1090, 2018.","apa":"Killip, R., Vişan, M., & Zhang, X. (2018). Low regularity conservation laws for integrable PDE. Geometric and Functional Analysis. Springer Nature. https://doi.org/10.1007/s00039-018-0444-0"},"year":"2018","doi":"10.1007/s00039-018-0444-0","page":"1062-1090","quality_controlled":"1","title":"Low regularity conservation laws for integrable PDE","publication_identifier":{"eissn":["1420-8970"],"issn":["1016-443X"]},"arxiv":1,"date_published":"2018-07-01T00:00:00Z","external_id":{"arxiv":["1708.05362"]},"publication":"Geometric and Functional Analysis","author":[{"first_name":"Rowan","last_name":"Killip","full_name":"Killip, Rowan"},{"full_name":"Visan, Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","last_name":"Visan","first_name":"Monica"},{"last_name":"Zhang","first_name":"Xiaoyi","full_name":"Zhang, Xiaoyi"}],"scopus_import":"1","_id":"22055","oa_version":"Preprint","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1708.05362","open_access":"1"}],"status":"public","month":"07","language":[{"iso":"eng"}],"abstract":[{"text":"We present a general method for obtaining conservation laws for integrable PDE at negative regularity and exhibit its application to KdV, NLS, and mKdV. Our method works uniformly for these problems posed both on the line and on the circle.","lang":"eng"}],"fulldoi":"https://doi.org/10.1007/s00039-018-0444-0","date_updated":"2026-06-29T09:55:53Z","day":"01","date_created":"2026-06-19T07:56:48Z","volume":28,"type":"journal_article","article_processing_charge":"No"},{"main_file_link":[{"url":"https://doi.org/10.4171/OWR/2017/27","open_access":"1"}],"oa_version":"Published Version","_id":"22093","author":[{"full_name":"Koch, Herbert","first_name":"Herbert","last_name":"Koch"},{"first_name":"Pierre","full_name":"Raphaël, Pierre","last_name":"Raphaël"},{"first_name":"Daniel","full_name":"Tataru, Daniel","last_name":"Tataru"},{"id":"056daca0-b8d1-11f0-964f-f91054abf8ca","first_name":"Monica","full_name":"Visan, Monica","last_name":"Visan"}],"publication":"Oberwolfach Reports","date_published":"2018-04-28T00:00:00Z","publication_identifier":{"eissn":["1660-8941"],"issn":["1660-8933"]},"title":"Nonlinear waves and dispersive equations","article_processing_charge":"No","type":"journal_article","volume":14,"date_created":"2026-06-19T08:55:08Z","date_updated":"2026-07-02T05:51:37Z","day":"28","fulldoi":"https://doi.org/10.4171/owr/2017/27","abstract":[{"lang":"eng","text":"Nonlinear dispersive equations are models for nonlinear waves in a wide range of physical contexts. Mathematically they display an interplay between linear dispersion and nonlinear interactions, which can result in a wide range of outcomes from finite time blow-up to solitons and scattering. They are linked to many areas of mathematics and physics, ranging from integrable systems and harmonic analysis to fluid dynamics, geometry, general relativity and probability."}],"language":[{"iso":"eng"}],"month":"04","status":"public","oa":1,"das_tickbox":"1","extern":"1","publisher":"EMS Press","issue":"2","OA_type":"free access","intvolume":" 14","quality_controlled":"1","page":"1681-1745","year":"2018","doi":"10.4171/owr/2017/27","citation":{"ama":"Koch H, Raphaël P, Tataru D, Vişan M. Nonlinear waves and dispersive equations. Oberwolfach Reports. 2018;14(2):1681-1745. doi:10.4171/owr/2017/27","short":"H. Koch, P. Raphaël, D. Tataru, M. Vişan, Oberwolfach Reports 14 (2018) 1681–1745.","ista":"Koch H, Raphaël P, Tataru D, Vişan M. 2018. Nonlinear waves and dispersive equations. Oberwolfach Reports. 14(2), 1681–1745.","apa":"Koch, H., Raphaël, P., Tataru, D., & Vişan, M. (2018). Nonlinear waves and dispersive equations. Oberwolfach Reports. EMS Press. https://doi.org/10.4171/owr/2017/27","ieee":"H. Koch, P. Raphaël, D. Tataru, and M. Vişan, “Nonlinear waves and dispersive equations,” Oberwolfach Reports, vol. 14, no. 2. EMS Press, pp. 1681–1745, 2018.","chicago":"Koch, Herbert, Pierre Raphaël, Daniel Tataru, and Monica Vişan. “Nonlinear Waves and Dispersive Equations.” Oberwolfach Reports. EMS Press, 2018. https://doi.org/10.4171/owr/2017/27.","mla":"Koch, Herbert, et al. “Nonlinear Waves and Dispersive Equations.” Oberwolfach Reports, vol. 14, no. 2, EMS Press, 2018, pp. 1681–745, doi:10.4171/owr/2017/27."},"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"intvolume":" 29","issue":"22","publisher":"American Society for Cell Biology","file":[{"date_updated":"2020-07-14T12:47:15Z","file_name":"2018_ASCB_Dolati.pdf","creator":"kschuh","access_level":"open_access","checksum":"e98465b4416b3e804c47f40086932af2","file_id":"5994","relation":"main_file","file_size":6668971,"content_type":"application/pdf","date_created":"2019-02-14T12:34:29Z"}],"pmid":1,"isi":1,"oa":1,"das_tickbox":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","citation":{"ista":"Dolati S, Kage F, Mueller J, Müsken M, Kirchner M, Dittmar G, Sixt MK, Rottner K, Falcke M. 2018. On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility. Molecular Biology of the Cell. 29(22), 2674–2686.","apa":"Dolati, S., Kage, F., Mueller, J., Müsken, M., Kirchner, M., Dittmar, G., … Falcke, M. (2018). On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility. Molecular Biology of the Cell. American Society for Cell Biology. https://doi.org/10.1091/mbc.e18-02-0082","ieee":"S. Dolati et al., “On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility,” Molecular Biology of the Cell, vol. 29, no. 22. American Society for Cell Biology, pp. 2674–2686, 2018.","chicago":"Dolati, Setareh, Frieda Kage, Jan Mueller, Mathias Müsken, Marieluise Kirchner, Gunnar Dittmar, Michael K Sixt, Klemens Rottner, and Martin Falcke. “On the Relation between Filament Density, Force Generation, and Protrusion Rate in Mesenchymal Cell Motility.” Molecular Biology of the Cell. American Society for Cell Biology, 2018. https://doi.org/10.1091/mbc.e18-02-0082.","mla":"Dolati, Setareh, et al. “On the Relation between Filament Density, Force Generation, and Protrusion Rate in Mesenchymal Cell Motility.” Molecular Biology of the Cell, vol. 29, no. 22, American Society for Cell Biology, 2018, pp. 2674–86, doi:10.1091/mbc.e18-02-0082.","short":"S. Dolati, F. Kage, J. Mueller, M. Müsken, M. Kirchner, G. Dittmar, M.K. Sixt, K. Rottner, M. Falcke, Molecular Biology of the Cell 29 (2018) 2674–2686.","ama":"Dolati S, Kage F, Mueller J, et al. On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility. Molecular Biology of the Cell. 2018;29(22):2674-2686. doi:10.1091/mbc.e18-02-0082"},"doi":"10.1091/mbc.e18-02-0082","year":"2018","page":"2674-2686","ddc":["570"],"quality_controlled":"1","title":"On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility","publication_identifier":{"eissn":["1939-4586"]},"file_date_updated":"2020-07-14T12:47:15Z","date_published":"2018-11-01T00:00:00Z","external_id":{"pmid":["30156465"],"isi":["000455641000011"]},"publication":"Molecular Biology of the Cell","author":[{"last_name":"Dolati","first_name":"Setareh","full_name":"Dolati, Setareh"},{"first_name":"Frieda","full_name":"Kage, Frieda","last_name":"Kage"},{"first_name":"Jan","full_name":"Mueller, Jan","last_name":"Mueller"},{"first_name":"Mathias","last_name":"Müsken","full_name":"Müsken, Mathias"},{"last_name":"Kirchner","first_name":"Marieluise","full_name":"Kirchner, Marieluise"},{"last_name":"Dittmar","full_name":"Dittmar, Gunnar","first_name":"Gunnar"},{"last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179"},{"last_name":"Rottner","full_name":"Rottner, Klemens","first_name":"Klemens"},{"last_name":"Falcke","first_name":"Martin","full_name":"Falcke, Martin"}],"scopus_import":"1","_id":"5992","oa_version":"Published Version","status":"public","department":[{"_id":"MiSi"}],"language":[{"iso":"eng"}],"month":"11","has_accepted_license":"1","abstract":[{"text":"Lamellipodia are flat membrane protrusions formed during mesenchymal motion. Polymerization at the leading edge assembles the actin filament network and generates protrusion force. How this force is supported by the network and how the assembly rate is shared between protrusion and network retrograde flow determines the protrusion rate. We use mathematical modeling to understand experiments changing the F-actin density in lamellipodia of B16-F1 melanoma cells by modulation of Arp2/3 complex activity or knockout of the formins FMNL2 and FMNL3. Cells respond to a reduction of density with a decrease of protrusion velocity, an increase in the ratio of force to filament number, but constant network assembly rate. The relation between protrusion force and tension gradient in the F-actin network and the density dependency of friction, elasticity, and viscosity of the network explain the experimental observations. The formins act as filament nucleators and elongators with differential rates. Modulation of their activity suggests an effect on network assembly rate. Contrary to these expectations, the effect of changes in elongator composition is much weaker than the consequences of the density change. We conclude that the force acting on the leading edge membrane is the force required to drive F-actin network retrograde flow.","lang":"eng"}],"fulldoi":"https://doi.org/10.1091/mbc.e18-02-0082","date_updated":"2026-07-06T12:25:34Z","day":"01","volume":29,"date_created":"2019-02-14T12:25:47Z","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","tmp":{"image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)"},"article_processing_charge":"No","type":"journal_article"},{"date_created":"2020-09-21T12:01:50Z","doi":"10.1101/494088","year":"2018","ec_funded":1,"article_processing_charge":"No","type":"preprint","month":"12","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"SiHi"}],"status":"public","day":"13","date_updated":"2026-07-06T12:52:50Z","publication_status":"submitted","abstract":[{"lang":"eng","text":"The cerebral cortex contains multiple hierarchically organized areas with distinctive cytoarchitectonical patterns, but the cellular mechanisms underlying the emergence of this diversity remain unclear. Here, we have quantitatively investigated the neuronal output of individual progenitor cells in the ventricular zone of the developing mouse neocortex using a combination of methods that together circumvent the biases and limitations of individual approaches. We found that individual cortical progenitor cells show a high degree of stochasticity and generate pyramidal cell lineages that adopt a wide range of laminar configurations. Mathematical modelling these lineage data suggests that a small number of progenitor cell populations, each generating pyramidal cells following different stochastic developmental programs, suffice to generate the heterogenous complement of pyramidal cell lineages that collectively build the complex cytoarchitecture of the neocortex."}],"fulldoi":"https://doi.org/10.1101/494088","citation":{"short":"A. Llorca, G. Ciceri, R.J. Beattie, F.K. Wong, G. Diana, E. Serafeimidou, M. Fernández-Otero, C. Streicher, S.J. Arnold, M. Meyer, S. Hippenmeyer, M. Maravall, O. Marín, BioRxiv (n.d.).","ama":"Llorca A, Ciceri G, Beattie RJ, et al. Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. bioRxiv. doi:10.1101/494088","ieee":"A. Llorca et al., “Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture,” bioRxiv. .","apa":"Llorca, A., Ciceri, G., Beattie, R. J., Wong, F. K., Diana, G., Serafeimidou, E., … Marín, O. (n.d.). Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. bioRxiv. https://doi.org/10.1101/494088","ista":"Llorca A, Ciceri G, Beattie RJ, Wong FK, Diana G, Serafeimidou E, Fernández-Otero M, Streicher C, Arnold SJ, Meyer M, Hippenmeyer S, Maravall M, Marín O. Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. bioRxiv, 10.1101/494088.","mla":"Llorca, Alfredo, et al. “Heterogeneous Progenitor Cell Behaviors Underlie the Assembly of Neocortical Cytoarchitecture.” BioRxiv, doi:10.1101/494088.","chicago":"Llorca, Alfredo, Gabriele Ciceri, Robert J Beattie, Fong K. Wong, Giovanni Diana, Eleni Serafeimidou, Marian Fernández-Otero, et al. “Heterogeneous Progenitor Cell Behaviors Underlie the Assembly of Neocortical Cytoarchitecture.” BioRxiv, n.d. https://doi.org/10.1101/494088."},"author":[{"last_name":"Llorca","full_name":"Llorca, Alfredo","first_name":"Alfredo"},{"first_name":"Gabriele","full_name":"Ciceri, Gabriele","last_name":"Ciceri"},{"orcid":"0000-0002-8483-8753","last_name":"Beattie","id":"2E26DF60-F248-11E8-B48F-1D18A9856A87","full_name":"Beattie, Robert J","first_name":"Robert J"},{"full_name":"Wong, Fong K.","first_name":"Fong K.","last_name":"Wong"},{"full_name":"Diana, Giovanni","last_name":"Diana","first_name":"Giovanni"},{"first_name":"Eleni","last_name":"Serafeimidou","full_name":"Serafeimidou, Eleni"},{"first_name":"Marian","full_name":"Fernández-Otero, Marian","last_name":"Fernández-Otero"},{"last_name":"Streicher","id":"36BCB99C-F248-11E8-B48F-1D18A9856A87","first_name":"Carmen","full_name":"Streicher, Carmen"},{"full_name":"Arnold, Sebastian J.","first_name":"Sebastian J.","last_name":"Arnold"},{"first_name":"Martin","last_name":"Meyer","full_name":"Meyer, Martin"},{"last_name":"Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061"},{"last_name":"Maravall","first_name":"Miguel","full_name":"Maravall, Miguel"},{"full_name":"Marín, Oscar","last_name":"Marín","first_name":"Oscar"}],"publication":"bioRxiv","main_file_link":[{"url":"https://doi.org/10.1101/494088","open_access":"1"}],"oa_version":"Preprint","project":[{"call_identifier":"H2020","grant_number":"725780","_id":"260018B0-B435-11E9-9278-68D0E5697425","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development"},{"name":"Molecular Mechanisms Regulating Gliogenesis in the Neocortex","grant_number":"M02416","_id":"264E56E2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"oa":1,"das_tickbox":"1","acknowledgement":"We thank I. Andrew and S.E. Bae for excellent technical assistance, F. Gage for plasmids, and K. Nave (Nex-Cre) for mouse colonies. We thank members of the Marín and Rico laboratories for stimulating discussions and ideas. Our research on this topic is supported by grants from the European Research Council (ERC-2017-AdG 787355 to O.M and ERC2016-CoG 725780 to S.H.) and Wellcome Trust (103714MA) to O.M. L.L. was the recipient of an EMBO long-term postdoctoral fellowship, R.B. received support from FWF Lise-Meitner program (M 2416) and F.K.W. was supported by an EMBO postdoctoral fellowship and is currently a Marie Skłodowska-Curie Fellow from the European Commission under the H2020 Programme.","_id":"8547","title":"Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture","date_published":"2018-12-13T00:00:00Z"},{"page":"214-242","year":"2018","doi":"10.13154/tches.v2018.i3.214-242","quality_controlled":"1","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","citation":{"short":"E.N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, V. Fischer, IACR Transactions on Cryptographic Hardware and Embedded Systems 2018 (2018) 214–242.","ama":"Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. 2018;2018(3):214-242. doi:10.13154/tches.v2018.i3.214-242","chicago":"Allini, Elie Noumon, Maciej Skórski, Oto Petura, Florent Bernard, Marek Laban, and Viktor Fischer. “Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.” IACR Transactions on Cryptographic Hardware and Embedded Systems. International Association for Cryptologic Research, 2018. https://doi.org/10.13154/tches.v2018.i3.214-242.","mla":"Allini, Elie Noumon, et al. “Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.” IACR Transactions on Cryptographic Hardware and Embedded Systems, vol. 2018, no. 3, International Association for Cryptologic Research, 2018, pp. 214–42, doi:10.13154/tches.v2018.i3.214-242.","ista":"Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. 2018. Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. 2018(3), 214–242.","apa":"Allini, E. N., Skórski, M., Petura, O., Bernard, F., Laban, M., & Fischer, V. (2018). Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. International Association for Cryptologic Research. https://doi.org/10.13154/tches.v2018.i3.214-242","ieee":"E. N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, and V. Fischer, “Evaluation and monitoring of free running oscillators serving as source of randomness,” IACR Transactions on Cryptographic Hardware and Embedded Systems, vol. 2018, no. 3. International Association for Cryptologic Research, pp. 214–242, 2018."},"publication_status":"published","article_type":"original","das_tickbox":"1","oa":1,"OA_place":"publisher","publisher":"International Association for Cryptologic Research","issue":"3","intvolume":" 2018","OA_type":"diamond","file":[{"file_name":"2018_IACR_Allini.pdf","date_updated":"2021-11-15T10:27:29Z","checksum":"b816b848f046c48a8357700d9305dce5","file_id":"10289","success":1,"creator":"cchlebak","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_size":955755,"date_created":"2021-11-15T10:27:29Z"}],"date_created":"2021-11-14T23:01:25Z","volume":2018,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_processing_charge":"No","type":"journal_article","has_accepted_license":"1","month":"01","language":[{"iso":"eng"}],"status":"public","department":[{"_id":"KrPi"}],"day":"01","date_updated":"2026-07-06T13:16:35Z","fulldoi":"https://doi.org/10.13154/tches.v2018.i3.214-242","abstract":[{"text":"In this paper, we evaluate clock signals generated in ring oscillators and self-timed rings and the way their jitter can be transformed into random numbers. We show that counting the periods of the jittery clock signal produces random numbers of significantly better quality than the methods in which the jittery signal is simply sampled (the case in almost all current methods). Moreover, we use the counter values to characterize and continuously monitor the source of randomness. However, instead of using the widely used statistical variance, we propose to use Allan variance to do so. There are two main advantages: Allan variance is insensitive to low frequency noises such as flicker noise that are known to be autocorrelated and significantly less circuitry is required for its computation than that used to compute commonly used variance. We also show that it is essential to use a differential principle of randomness extraction from the jitter based on the use of two identical oscillators to avoid autocorrelations originating from external and internal global jitter sources and that this fact is valid for both kinds of rings. Last but not least, we propose a method of statistical testing based on high order Markov model to show the reduced dependencies when the proposed randomness extraction is applied.","lang":"eng"}],"publication":"IACR Transactions on Cryptographic Hardware and Embedded Systems","scopus_import":"1","author":[{"last_name":"Allini","first_name":"Elie Noumon","full_name":"Allini, Elie Noumon"},{"last_name":"Skórski","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","first_name":"Maciej","full_name":"Skórski, Maciej"},{"last_name":"Petura","first_name":"Oto","full_name":"Petura, Oto"},{"last_name":"Bernard","full_name":"Bernard, Florent","first_name":"Florent"},{"first_name":"Marek","last_name":"Laban","full_name":"Laban, Marek"},{"last_name":"Fischer","first_name":"Viktor","full_name":"Fischer, Viktor"}],"oa_version":"Published Version","_id":"10286","publication_identifier":{"eissn":["2569-2925"]},"title":"Evaluation and monitoring of free running oscillators serving as source of randomness","date_published":"2018-01-01T00:00:00Z","file_date_updated":"2021-11-15T10:27:29Z"},{"quality_controlled":"1","ddc":["570"],"ec_funded":1,"page":"3653-3658","doi":"10.1093/bioinformatics/bty340","year":"2018","citation":{"mla":"Usmanova, Dinara R., et al. “Self-Consistency Test Reveals Systematic Bias in Programs for Prediction Change of Stability upon Mutation.” Bioinformatics, vol. 34, no. 21, Oxford University Press, 2018, pp. 3653–58, doi:10.1093/bioinformatics/bty340.","chicago":"Usmanova, Dinara R, Natalya S Bogatyreva, Joan Ariño Bernad, Aleksandra A Eremina, Anastasiya A Gorshkova, German M Kanevskiy, Lyubov R Lonishin, et al. “Self-Consistency Test Reveals Systematic Bias in Programs for Prediction Change of Stability upon Mutation.” Bioinformatics. Oxford University Press, 2018. https://doi.org/10.1093/bioinformatics/bty340.","apa":"Usmanova, D. R., Bogatyreva, N. S., Ariño Bernad, J., Eremina, A. A., Gorshkova, A. A., Kanevskiy, G. M., … Ivankov, D. (2018). Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation. Bioinformatics. Oxford University Press. https://doi.org/10.1093/bioinformatics/bty340","ieee":"D. R. Usmanova et al., “Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation,” Bioinformatics, vol. 34, no. 21. Oxford University Press, pp. 3653–3658, 2018.","ista":"Usmanova DR, Bogatyreva NS, Ariño Bernad J, Eremina AA, Gorshkova AA, Kanevskiy GM, Lonishin LR, Meister AV, Yakupova AG, Kondrashov F, Ivankov D. 2018. Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation. Bioinformatics. 34(21), 3653–3658.","ama":"Usmanova DR, Bogatyreva NS, Ariño Bernad J, et al. Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation. Bioinformatics. 2018;34(21):3653-3658. doi:10.1093/bioinformatics/bty340","short":"D.R. Usmanova, N.S. Bogatyreva, J. Ariño Bernad, A.A. Eremina, A.A. Gorshkova, G.M. Kanevskiy, L.R. Lonishin, A.V. Meister, A.G. Yakupova, F. Kondrashov, D. Ivankov, Bioinformatics 34 (2018) 3653–3658."},"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Systematic investigation of epistasis in molecular evolution","_id":"26120F5C-B435-11E9-9278-68D0E5697425","grant_number":"335980","call_identifier":"FP7"}],"oa":1,"das_tickbox":"1","isi":1,"pmid":1,"file":[{"file_size":291969,"relation":"main_file","content_type":"application/pdf","date_created":"2019-02-14T13:00:55Z","date_updated":"2020-07-14T12:47:15Z","file_name":"2018_Oxford_Usmanova.pdf","access_level":"open_access","creator":"kschuh","checksum":"7e0495153f44211479674601d7f6ee03","file_id":"5997"}],"issue":"21","publisher":"Oxford University Press","intvolume":" 34","article_processing_charge":"No","tmp":{"short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"type":"journal_article","license":"https://creativecommons.org/licenses/by-nc/4.0/","date_created":"2019-02-14T12:48:00Z","volume":34,"date_updated":"2026-07-06T13:48:02Z","day":"01","fulldoi":"https://doi.org/10.1093/bioinformatics/bty340","abstract":[{"lang":"eng","text":"Motivation\r\nComputational prediction of the effect of mutations on protein stability is used by researchers in many fields. The utility of the prediction methods is affected by their accuracy and bias. Bias, a systematic shift of the predicted change of stability, has been noted as an issue for several methods, but has not been investigated systematically. Presence of the bias may lead to misleading results especially when exploring the effects of combination of different mutations.\r\n\r\nResults\r\nHere we use a protocol to measure the bias as a function of the number of introduced mutations. It is based on a self-consistency test of the reciprocity the effect of a mutation. An advantage of the used approach is that it relies solely on crystal structures without experimentally measured stability values. We applied the protocol to four popular algorithms predicting change of protein stability upon mutation, FoldX, Eris, Rosetta and I-Mutant, and found an inherent bias. For one program, FoldX, we manage to substantially reduce the bias using additional relaxation by Modeller. Authors using algorithms for predicting effects of mutations should be aware of the bias described here."}],"has_accepted_license":"1","language":[{"iso":"eng"}],"month":"11","status":"public","department":[{"_id":"FyKo"}],"oa_version":"Published Version","_id":"5995","publication":"Bioinformatics","scopus_import":"1","author":[{"full_name":"Usmanova, Dinara R","last_name":"Usmanova","first_name":"Dinara R"},{"full_name":"Bogatyreva, Natalya S","last_name":"Bogatyreva","first_name":"Natalya S"},{"first_name":"Joan","full_name":"Ariño Bernad, Joan","last_name":"Ariño Bernad"},{"full_name":"Eremina, Aleksandra A","first_name":"Aleksandra A","last_name":"Eremina"},{"full_name":"Gorshkova, Anastasiya A","last_name":"Gorshkova","first_name":"Anastasiya A"},{"full_name":"Kanevskiy, German M","first_name":"German M","last_name":"Kanevskiy"},{"full_name":"Lonishin, Lyubov R","first_name":"Lyubov R","last_name":"Lonishin"},{"full_name":"Meister, Alexander V","last_name":"Meister","first_name":"Alexander V"},{"first_name":"Alisa G","full_name":"Yakupova, Alisa G","last_name":"Yakupova"},{"id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","last_name":"Kondrashov","full_name":"Kondrashov, Fyodor","first_name":"Fyodor","orcid":"0000-0001-8243-4694"},{"orcid":"0000-0002-8224-4118","first_name":"Dmitry","id":"49FF1036-F248-11E8-B48F-1D18A9856A87","last_name":"Ivankov","full_name":"Ivankov, Dmitry"}],"external_id":{"pmid":["29722803"],"isi":["000450038900008"]},"date_published":"2018-11-01T00:00:00Z","file_date_updated":"2020-07-14T12:47:15Z","publication_identifier":{"eissn":["1367-4811"]},"title":"Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation"},{"publisher":"Society for Industrial and Applied Mathematics","issue":"1","intvolume":" 50","file":[{"file_name":"2018_SIAM_Fischer.pdf","date_updated":"2020-07-14T12:46:22Z","file_id":"6992","checksum":"89a8eae7c52bb356c04f52b44bff4b5a","access_level":"open_access","creator":"dernst","content_type":"application/pdf","relation":"main_file","file_size":557338,"date_created":"2019-11-07T12:20:25Z"}],"article_type":"original","das_tickbox":"1","oa":1,"isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","citation":{"mla":"Fischer, Julian L., and Günther Grün. “Existence of Positive Solutions to Stochastic Thin-Film Equations.” SIAM Journal on Mathematical Analysis, vol. 50, no. 1, Society for Industrial and Applied Mathematics, 2018, pp. 411–55, doi:10.1137/16M1098796.","chicago":"Fischer, Julian L, and Günther Grün. “Existence of Positive Solutions to Stochastic Thin-Film Equations.” SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics, 2018. https://doi.org/10.1137/16M1098796.","ieee":"J. L. Fischer and G. Grün, “Existence of positive solutions to stochastic thin-film equations,” SIAM Journal on Mathematical Analysis, vol. 50, no. 1. Society for Industrial and Applied Mathematics, pp. 411–455, 2018.","apa":"Fischer, J. L., & Grün, G. (2018). Existence of positive solutions to stochastic thin-film equations. SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/16M1098796","ista":"Fischer JL, Grün G. 2018. Existence of positive solutions to stochastic thin-film equations. SIAM Journal on Mathematical Analysis. 50(1), 411–455.","short":"J.L. Fischer, G. Grün, SIAM Journal on Mathematical Analysis 50 (2018) 411–455.","ama":"Fischer JL, Grün G. Existence of positive solutions to stochastic thin-film equations. SIAM Journal on Mathematical Analysis. 2018;50(1):411-455. doi:10.1137/16M1098796"},"publication_status":"published","page":"411 - 455","year":"2018","doi":"10.1137/16M1098796","quality_controlled":"1","ddc":["510"],"title":"Existence of positive solutions to stochastic thin-film equations","date_published":"2018-01-30T00:00:00Z","file_date_updated":"2020-07-14T12:46:22Z","scopus_import":"1","author":[{"orcid":"0000-0002-0479-558X","full_name":"Fischer, Julian L","first_name":"Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","last_name":"Fischer"},{"full_name":"Grün, Günther","first_name":"Günther","last_name":"Grün"}],"publication":"SIAM Journal on Mathematical Analysis","external_id":{"isi":["000426630900015"]},"oa_version":"Published Version","_id":"404","has_accepted_license":"1","month":"01","language":[{"iso":"eng"}],"status":"public","department":[{"_id":"JuFi"}],"date_updated":"2026-07-06T14:01:18Z","day":"30","fulldoi":"https://doi.org/10.1137/16M1098796","abstract":[{"text":"We construct martingale solutions to stochastic thin-film equations by introducing a (spatial) semidiscretization and establishing convergence. The discrete scheme allows for variants of the energy and entropy estimates in the continuous setting as long as the discrete energy does not exceed certain threshold values depending on the spatial grid size $h$. Using a stopping time argument to prolongate high-energy paths constant in time, arbitrary moments of coupled energy/entropy functionals can be controlled. Having established Hölder regularity of approximate solutions, the convergence proof is then based on compactness arguments---in particular on Jakubowski's generalization of Skorokhod's theorem---weak convergence methods, and recent tools on martingale convergence.\r\n\r\n","lang":"eng"}],"date_created":"2018-12-11T11:46:17Z","volume":50,"publist_id":"7425","type":"journal_article","article_processing_charge":"No"},{"intvolume":" 50","issue":"3","publisher":"Society for Industrial and Applied Mathematics","isi":1,"das_tickbox":"1","oa":1,"project":[{"name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"258F40A4-B435-11E9-9278-68D0E5697425","grant_number":"M02080","name":"Structured Non-Hermitian Random Matrices","call_identifier":"FWF"}],"publication_status":"published","citation":{"short":"L. Erdös, T.H. Krüger, D.T. Renfrew, SIAM Journal on Mathematical Analysis 50 (2018) 3271–3290.","ama":"Erdös L, Krüger TH, Renfrew DT. Power law decay for systems of randomly coupled differential equations. SIAM Journal on Mathematical Analysis. 2018;50(3):3271-3290. doi:10.1137/17M1143125","chicago":"Erdös, László, Torben H Krüger, and David T Renfrew. “Power Law Decay for Systems of Randomly Coupled Differential Equations.” SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics, 2018. https://doi.org/10.1137/17M1143125.","mla":"Erdös, László, et al. “Power Law Decay for Systems of Randomly Coupled Differential Equations.” SIAM Journal on Mathematical Analysis, vol. 50, no. 3, Society for Industrial and Applied Mathematics, 2018, pp. 3271–90, doi:10.1137/17M1143125.","ista":"Erdös L, Krüger TH, Renfrew DT. 2018. Power law decay for systems of randomly coupled differential equations. SIAM Journal on Mathematical Analysis. 50(3), 3271–3290.","apa":"Erdös, L., Krüger, T. H., & Renfrew, D. T. (2018). Power law decay for systems of randomly coupled differential equations. SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/17M1143125","ieee":"L. Erdös, T. H. Krüger, and D. T. Renfrew, “Power law decay for systems of randomly coupled differential equations,” SIAM Journal on Mathematical Analysis, vol. 50, no. 3. Society for Industrial and Applied Mathematics, pp. 3271–3290, 2018."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["500"],"quality_controlled":"1","doi":"10.1137/17M1143125","year":"2018","page":"3271 - 3290","ec_funded":1,"date_published":"2018-01-01T00:00:00Z","arxiv":1,"title":"Power law decay for systems of randomly coupled differential equations","acknowledgement":"The work of the second author was also partially supported by the Hausdorff Center of Mathematics.","_id":"181","main_file_link":[{"url":"https://arxiv.org/abs/1708.01546","open_access":"1"}],"oa_version":"Published Version","external_id":{"arxiv":["1708.01546"],"isi":["000437018500032"]},"publication":"SIAM Journal on Mathematical Analysis","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"},{"id":"3020C786-F248-11E8-B48F-1D18A9856A87","last_name":"Krüger","full_name":"Krüger, Torben H","first_name":"Torben H","orcid":"0000-0002-4821-3297"},{"full_name":"Renfrew, David T","id":"4845BF6A-F248-11E8-B48F-1D18A9856A87","last_name":"Renfrew","first_name":"David T","orcid":"0000-0003-3493-121X"}],"scopus_import":"1","abstract":[{"lang":"eng","text":"We consider large random matrices X with centered, independent entries but possibly di erent variances. We compute the normalized trace of f(X)g(X∗) for f, g functions analytic on the spectrum of X. We use these results to compute the long time asymptotics for systems of coupled di erential equations with random coe cients. We show that when the coupling is critical, the norm squared of the solution decays like t−1/2."}],"fulldoi":"https://doi.org/10.1137/17M1143125","date_updated":"2026-07-06T14:02:06Z","day":"01","status":"public","department":[{"_id":"LaEr"}],"language":[{"iso":"eng"}],"month":"01","article_processing_charge":"No","type":"journal_article","publist_id":"7740","date_created":"2018-12-11T11:45:03Z","volume":50},{"date_created":"2018-12-11T11:45:46Z","volume":32,"type":"journal_article","article_processing_charge":"No","publist_id":"7553","language":[{"iso":"eng"}],"month":"03","status":"public","department":[{"_id":"HeEd"}],"date_updated":"2026-07-06T14:00:50Z","day":"29","abstract":[{"text":"Motivated by biological questions, we study configurations of equal spheres that neither pack nor cover. Placing their centers on a lattice, we define the soft density of the configuration by penalizing multiple overlaps. Considering the 1-parameter family of diagonally distorted 3-dimensional integer lattices, we show that the soft density is maximized at the FCC lattice.","lang":"eng"}],"fulldoi":"https://doi.org/10.1137/16M1097201","external_id":{"isi":["000428958900038"]},"publication":"SIAM J Discrete Math","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Iglesias Ham","first_name":"Mabel","full_name":"Iglesias Ham, Mabel","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"http://pdfs.semanticscholar.org/d2d5/6da00fbc674e6a8b1bb9d857167e54200dc6.pdf"}],"oa_version":"Submitted Version","acknowledgement":"This work was partially supported by the DFG Collaborative Research Center TRR 109, “Discretization in Geometry and Dynamics,” through grant I02979-N35 of the Austrian Science Fund (FWF).","_id":"312","title":"On the optimality of the FCC lattice for soft sphere packing","publication_identifier":{"issn":["0895-4801"]},"date_published":"2018-03-29T00:00:00Z","doi":"10.1137/16M1097201","year":"2018","page":"750 - 782","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","citation":{"chicago":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.” SIAM J Discrete Math. Society for Industrial and Applied Mathematics, 2018. https://doi.org/10.1137/16M1097201.","mla":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.” SIAM J Discrete Math, vol. 32, no. 1, Society for Industrial and Applied Mathematics, 2018, pp. 750–82, doi:10.1137/16M1097201.","ista":"Edelsbrunner H, Iglesias Ham M. 2018. On the optimality of the FCC lattice for soft sphere packing. SIAM J Discrete Math. 32(1), 750–782.","apa":"Edelsbrunner, H., & Iglesias Ham, M. (2018). On the optimality of the FCC lattice for soft sphere packing. SIAM J Discrete Math. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/16M1097201","ieee":"H. Edelsbrunner and M. Iglesias Ham, “On the optimality of the FCC lattice for soft sphere packing,” SIAM J Discrete Math, vol. 32, no. 1. Society for Industrial and Applied Mathematics, pp. 750–782, 2018.","ama":"Edelsbrunner H, Iglesias Ham M. On the optimality of the FCC lattice for soft sphere packing. SIAM J Discrete Math. 2018;32(1):750-782. doi:10.1137/16M1097201","short":"H. Edelsbrunner, M. Iglesias Ham, SIAM J Discrete Math 32 (2018) 750–782."},"article_type":"original","oa":1,"project":[{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","call_identifier":"FWF"}],"das_tickbox":"1","isi":1,"intvolume":" 32","publisher":"Society for Industrial and Applied Mathematics","issue":"1"},{"article_type":"original","isi":1,"oa":1,"das_tickbox":"1","publisher":"Optica Publishing Group","issue":"10","intvolume":" 5","page":"1210-1219","year":"2018","doi":"10.1364/OPTICA.5.001210","quality_controlled":"1","ddc":["530"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Botello G, Sedlmeir F, Rueda Sanchez AR, et al. Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. Optica. 2018;5(10):1210-1219. doi:10.1364/OPTICA.5.001210","short":"G. Botello, F. Sedlmeir, A.R. Rueda Sanchez, K. Abdalmalak, E. Brown, G. Leuchs, S. Preu, D. Segovia Vargas, D. Strekalov, L. Munoz, H. Schwefel, Optica 5 (2018) 1210–1219.","mla":"Botello, Gabriel, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” Optica, vol. 5, no. 10, Optica Publishing Group, 2018, pp. 1210–19, doi:10.1364/OPTICA.5.001210.","chicago":"Botello, Gabriel, Florian Sedlmeir, Alfredo R Rueda Sanchez, Kerlos Abdalmalak, Elliott Brown, Gerd Leuchs, Sascha Preu, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” Optica. Optica Publishing Group, 2018. https://doi.org/10.1364/OPTICA.5.001210.","apa":"Botello, G., Sedlmeir, F., Rueda Sanchez, A. R., Abdalmalak, K., Brown, E., Leuchs, G., … Schwefel, H. (2018). Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. Optica. Optica Publishing Group. https://doi.org/10.1364/OPTICA.5.001210","ieee":"G. Botello et al., “Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters,” Optica, vol. 5, no. 10. Optica Publishing Group, pp. 1210–1219, 2018.","ista":"Botello G, Sedlmeir F, Rueda Sanchez AR, Abdalmalak K, Brown E, Leuchs G, Preu S, Segovia Vargas D, Strekalov D, Munoz L, Schwefel H. 2018. Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. Optica. 5(10), 1210–1219."},"publication_status":"published","author":[{"last_name":"Botello","full_name":"Botello, Gabriel","first_name":"Gabriel"},{"last_name":"Sedlmeir","full_name":"Sedlmeir, Florian","first_name":"Florian"},{"orcid":"0000-0001-6249-5860","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","full_name":"Rueda Sanchez, Alfredo R","first_name":"Alfredo R","last_name":"Rueda Sanchez"},{"last_name":"Abdalmalak","first_name":"Kerlos","full_name":"Abdalmalak, Kerlos"},{"first_name":"Elliott","full_name":"Brown, Elliott","last_name":"Brown"},{"first_name":"Gerd","last_name":"Leuchs","full_name":"Leuchs, Gerd"},{"first_name":"Sascha","full_name":"Preu, Sascha","last_name":"Preu"},{"last_name":"Segovia Vargas","full_name":"Segovia Vargas, Daniel","first_name":"Daniel"},{"first_name":"Dmitry","last_name":"Strekalov","full_name":"Strekalov, Dmitry"},{"full_name":"Munoz, Luis","first_name":"Luis","last_name":"Munoz"},{"full_name":"Schwefel, Harald","last_name":"Schwefel","first_name":"Harald"}],"scopus_import":"1","publication":"Optica","external_id":{"isi":["000447853100007"]},"_id":"22","main_file_link":[{"open_access":"1","url":"www.doi.org/10.1364/OPTICA.5.001210 "}],"oa_version":"Published Version","publication_identifier":{"issn":["2334-2536"]},"title":"Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters","date_published":"2018-10-20T00:00:00Z","volume":5,"date_created":"2018-12-11T11:44:12Z","publist_id":"8033","article_processing_charge":"No","type":"journal_article","status":"public","department":[{"_id":"JoFi"}],"language":[{"iso":"eng"}],"month":"10","fulldoi":"https://doi.org/10.1364/OPTICA.5.001210","abstract":[{"text":"Conventional ultra-high sensitivity detectors in the millimeter-wave range are usually cooled as their own thermal noise at room temperature would mask the weak received radiation. The need for cryogenic systems increases the cost and complexity of the instruments, hindering the development of, among others, airborne and space applications. In this work, the nonlinear parametric upconversion of millimeter-wave radiation to the optical domain inside high-quality (Q) lithium niobate whispering-gallery mode (WGM) resonators is proposed for ultra-low noise detection. We experimentally demonstrate coherent upconversion of millimeter-wave signals to a 1550 nm telecom carrier, with a photon conversion efficiency surpassing the state-of-the-art by 2 orders of magnitude. Moreover, a theoretical model shows that the thermal equilibrium of counterpropagating WGMs is broken by overcoupling the millimeter-wave WGM, effectively cooling the upconverted mode and allowing ultra-low noise detection. By theoretically estimating the sensitivity of a correlation radiometer based on the presented scheme, it is found that room-temperature radiometers with better sensitivity than state-of-the-art high-electron-mobility transistor (HEMT)-based radiometers can be designed. This detection paradigm can be used to develop room-temperature instrumentation for radio astronomy, earth observation, planetary missions, and imaging systems.","lang":"eng"}],"day":"20","date_updated":"2026-07-07T06:22:34Z"},{"citation":{"short":"P. Danowski, An Austrian Proposal for the Classification of Open Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors, Zenodo, 2018.","ama":"Danowski P. An Austrian Proposal for the Classification of Open Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors. Zenodo; 2018. doi:10.5281/zenodo.1244154","chicago":"Danowski, Patrick. An Austrian Proposal for the Classification of Open Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors. Zenodo, 2018. https://doi.org/10.5281/zenodo.1244154.","mla":"Danowski, Patrick. An Austrian Proposal for the Classification of Open Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors. Zenodo, 2018, doi:10.5281/zenodo.1244154.","ista":"Danowski P. 2018. An Austrian proposal for the Classification of Open Access Tuples (COAT) - Distinguish different Open Access types beyond colors, Zenodo, 5p.","apa":"Danowski, P. (2018). An Austrian proposal for the Classification of Open Access Tuples (COAT) - Distinguish different Open Access types beyond colors. Zenodo. https://doi.org/10.5281/zenodo.1244154","ieee":"P. Danowski, An Austrian proposal for the Classification of Open Access Tuples (COAT) - Distinguish different Open Access types beyond colors. Zenodo, 2018."},"publication_status":"published","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["020"],"page":"5","doi":"10.5281/zenodo.1244154","year":"2018","file":[{"file_id":"5872","checksum":"6cb95f8772491d155ce77c6160655fff","creator":"dernst","access_level":"open_access","file_name":"2018_WorkingPaper_Danowski.pdf","date_updated":"2020-07-14T12:47:10Z","date_created":"2019-01-22T09:06:51Z","content_type":"application/pdf","relation":"main_file","file_size":202798}],"publisher":"Zenodo","das_tickbox":"1","related_material":{"record":[{"relation":"later_version","id":"6657","status":"public"}]},"oa":1,"fulldoi":"https://doi.org/10.5281/zenodo.1244154","abstract":[{"lang":"eng","text":"In the working paper I describe in detail the approach for Open Access definitions which was presented in the Workshop \"Open Access Monitoring - Approaches and Perspectives\" in Vienna. It defines five criteria on which are the definitions build. Each criteria can be out of 4 classes. The minimum classes for the criteria which are used in a Open Access definition can be presented as the Classification of Open Access Tuples e.g. Open Access (Berlin Declaration) (1,1,1,1,3) this methods allows much easier to distinguish between different Open Access definitions. This is needed if the Open Access Universe should be measured in studies or monitoring approaches and the results should become more comparable. "}],"date_updated":"2026-07-07T06:28:30Z","day":"09","status":"public","department":[{"_id":"E-Lib"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"month":"05","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_processing_charge":"No","type":"working_paper","date_created":"2018-12-17T10:28:26Z","date_published":"2018-05-09T00:00:00Z","file_date_updated":"2020-07-14T12:47:10Z","title":"An Austrian proposal for the Classification of Open Access Tuples (COAT) - Distinguish different Open Access types beyond colors","_id":"5686","oa_version":"Published Version","scopus_import":"1","author":[{"orcid":"0000-0002-6026-4409","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","full_name":"Danowski, Patrick","last_name":"Danowski","first_name":"Patrick"}]}]