[{"date_created":"2019-11-11T12:46:18Z","author":[{"first_name":"Wei-Fan","id":"82920","full_name":"Chen, Wei-Fan","last_name":"Chen"},{"first_name":"Lun-Wei","full_name":"Ku, Lun-Wei","last_name":"Ku"}],"date_updated":"2022-01-06T06:52:09Z","publisher":"國立台灣師範大學圖書資訊學研究所","main_file_link":[{"url":"http://rportal.lib.ntnu.edu.tw/bitstream/20.500.12235/80604/1/ntnulib_ja_A1021_4401_024.pdf"}],"title":"中文情感語意分析套件 CSentiPackage 發展與應用","citation":{"bibtex":"@article{Chen_Ku_2018, title={中文情感語意分析套件 CSentiPackage 發展與應用}, journal={圖書館學與資訊科學}, publisher={國立台灣師範大學圖書資訊學研究所}, author={Chen Wei-Fan and Ku Lun-Wei}, year={2018} }","short":"Chen W.-F., Ku L.-W., 圖書館學與資訊科學 (2018).","mla":"Chen Wei-Fan, and Ku Lun-Wei. “中文情感語意分析套件 CSentiPackage 發展與應用.” 圖書館學與資訊科學, 國立台灣師範大學圖書資訊學研究所, 2018.","apa":"Chen W.-F., &#38; Ku L.-W. (2018). 中文情感語意分析套件 CSentiPackage 發展與應用. 圖書館學與資訊科學.","ama":"Chen W-F, Ku L-W. 中文情感語意分析套件 CSentiPackage 發展與應用. 圖書館學與資訊科學. 2018.","chicago":"Chen Wei-Fan, and Ku Lun-Wei. “中文情感語意分析套件 CSentiPackage 發展與應用.” 圖書館學與資訊科學, 2018.","ieee":"Chen W.-F. and Ku L.-W., “中文情感語意分析套件 CSentiPackage 發展與應用,” 圖書館學與資訊科學, 2018."},"year":"2018","department":[{"_id":"600"}],"user_id":"82920","_id":"14888","language":[{"iso":"chi"}],"publication":"圖書館學與資訊科學","type":"journal_article","status":"public"},{"page":"3996-4005","citation":{"apa":"Böttcher, S., &#38; Hartel, R. (2018). RECUT: RE-Compressing partially Unordered Trees. In <i>2018 IEEE International Conference on Big Data (Big Data)</i> (pp. 3996–4005). <a href=\"https://doi.org/10.1109/bigdata.2018.8622261\">https://doi.org/10.1109/bigdata.2018.8622261</a>","mla":"Böttcher, Stefan, and Rita Hartel. “RECUT: RE-Compressing Partially Unordered Trees.” <i>2018 IEEE International Conference on Big Data (Big Data)</i>, 2018, pp. 3996–4005, doi:<a href=\"https://doi.org/10.1109/bigdata.2018.8622261\">10.1109/bigdata.2018.8622261</a>.","short":"S. Böttcher, R. Hartel, in: 2018 IEEE International Conference on Big Data (Big Data), 2018, pp. 3996–4005.","bibtex":"@inproceedings{Böttcher_Hartel_2018, title={RECUT: RE-Compressing partially Unordered Trees}, DOI={<a href=\"https://doi.org/10.1109/bigdata.2018.8622261\">10.1109/bigdata.2018.8622261</a>}, booktitle={2018 IEEE International Conference on Big Data (Big Data)}, author={Böttcher, Stefan and Hartel, Rita}, year={2018}, pages={3996–4005} }","chicago":"Böttcher, Stefan, and Rita Hartel. “RECUT: RE-Compressing Partially Unordered Trees.” In <i>2018 IEEE International Conference on Big Data (Big Data)</i>, 3996–4005, 2018. <a href=\"https://doi.org/10.1109/bigdata.2018.8622261\">https://doi.org/10.1109/bigdata.2018.8622261</a>.","ieee":"S. Böttcher and R. Hartel, “RECUT: RE-Compressing partially Unordered Trees,” in <i>2018 IEEE International Conference on Big Data (Big Data)</i>, 2018, pp. 3996–4005.","ama":"Böttcher S, Hartel R. RECUT: RE-Compressing partially Unordered Trees. In: <i>2018 IEEE International Conference on Big Data (Big Data)</i>. ; 2018:3996-4005. doi:<a href=\"https://doi.org/10.1109/bigdata.2018.8622261\">10.1109/bigdata.2018.8622261</a>"},"year":"2018","publication_identifier":{"isbn":["9781538650356"]},"publication_status":"published","doi":"10.1109/bigdata.2018.8622261","title":"RECUT: RE-Compressing partially Unordered Trees","author":[{"last_name":"Böttcher","id":"624","full_name":"Böttcher, Stefan","first_name":"Stefan"},{"last_name":"Hartel","id":"14961","full_name":"Hartel, Rita","first_name":"Rita"}],"date_created":"2019-11-21T14:43:27Z","date_updated":"2022-01-06T06:52:15Z","status":"public","publication":"2018 IEEE International Conference on Big Data (Big Data)","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"69"}],"user_id":"14961","_id":"15081"},{"user_id":"14961","department":[{"_id":"69"}],"_id":"15082","language":[{"iso":"eng"}],"type":"conference","publication":"Digital Humanities 2018: Book of Abstracts/Libro de resúmenes","status":"public","author":[{"last_name":"Dunst","full_name":"Dunst, Alexander","first_name":"Alexander"},{"first_name":"Rita","id":"14961","full_name":"Hartel, Rita","last_name":"Hartel"}],"date_created":"2019-11-21T14:44:49Z","date_updated":"2022-01-06T06:52:15Z","publisher":"Red de Humanidades Digitales AC","title":"Automated Genre and Author Distinction in Comics: Towards a Stylometry for Visual Narrative","citation":{"short":"A. Dunst, R. Hartel, in: Digital Humanities 2018: Book of Abstracts/Libro de Resúmenes, Red de Humanidades Digitales AC, 2018, pp. 184–187.","bibtex":"@inproceedings{Dunst_Hartel_2018, title={Automated Genre and Author Distinction in Comics: Towards a Stylometry for Visual Narrative}, booktitle={Digital Humanities 2018: Book of Abstracts/Libro de resúmenes}, publisher={Red de Humanidades Digitales AC}, author={Dunst, Alexander and Hartel, Rita}, year={2018}, pages={184–187} }","mla":"Dunst, Alexander, and Rita Hartel. “Automated Genre and Author Distinction in Comics: Towards a Stylometry for Visual Narrative.” <i>Digital Humanities 2018: Book of Abstracts/Libro de Resúmenes</i>, Red de Humanidades Digitales AC, 2018, pp. 184–87.","apa":"Dunst, A., &#38; Hartel, R. (2018). Automated Genre and Author Distinction in Comics: Towards a Stylometry for Visual Narrative. In <i>Digital Humanities 2018: Book of Abstracts/Libro de resúmenes</i> (pp. 184–187). Red de Humanidades Digitales AC.","ama":"Dunst A, Hartel R. Automated Genre and Author Distinction in Comics: Towards a Stylometry for Visual Narrative. In: <i>Digital Humanities 2018: Book of Abstracts/Libro de Resúmenes</i>. Red de Humanidades Digitales AC; 2018:184-187.","chicago":"Dunst, Alexander, and Rita Hartel. “Automated Genre and Author Distinction in Comics: Towards a Stylometry for Visual Narrative.” In <i>Digital Humanities 2018: Book of Abstracts/Libro de Resúmenes</i>, 184–87. Red de Humanidades Digitales AC, 2018.","ieee":"A. Dunst and R. Hartel, “Automated Genre and Author Distinction in Comics: Towards a Stylometry for Visual Narrative,” in <i>Digital Humanities 2018: Book of Abstracts/Libro de resúmenes</i>, 2018, pp. 184–187."},"page":"184-187","year":"2018"},{"title":"The quantitative analysis of comics: Towards a visual stylometry of graphic narrative","date_created":"2019-11-22T10:12:54Z","author":[{"first_name":"Alexander","full_name":"Dunst, Alexander","last_name":"Dunst"},{"first_name":"Rita","id":"14961","full_name":"Hartel, Rita","last_name":"Hartel"}],"date_updated":"2022-01-06T06:52:16Z","publisher":"Routledge","page":"43-61","citation":{"ama":"Dunst A, Hartel R. The quantitative analysis of comics: Towards a visual stylometry of graphic narrative. In: Dunst A, Laubrock J, Wildfeuer J, eds. <i>Empirical Comics Research: Digital, Multimodal, and Cognitive Methods</i>. Routledge; 2018:43-61.","ieee":"A. Dunst and R. Hartel, “The quantitative analysis of comics: Towards a visual stylometry of graphic narrative,” in <i>Empirical Comics Research: Digital, Multimodal, and Cognitive Methods</i>, A. Dunst, J. Laubrock, and J. Wildfeuer, Eds. Routledge, 2018, pp. 43–61.","chicago":"Dunst, Alexander, and Rita Hartel. “The Quantitative Analysis of Comics: Towards a Visual Stylometry of Graphic Narrative.” In <i>Empirical Comics Research: Digital, Multimodal, and Cognitive Methods</i>, edited by Alexander Dunst, Jochen Laubrock, and Janina Wildfeuer, 43–61. Routledge, 2018.","short":"A. Dunst, R. Hartel, in: A. Dunst, J. Laubrock, J. Wildfeuer (Eds.), Empirical Comics Research: Digital, Multimodal, and Cognitive Methods, Routledge, 2018, pp. 43–61.","mla":"Dunst, Alexander, and Rita Hartel. “The Quantitative Analysis of Comics: Towards a Visual Stylometry of Graphic Narrative.” <i>Empirical Comics Research: Digital, Multimodal, and Cognitive Methods</i>, edited by Alexander Dunst et al., Routledge, 2018, pp. 43–61.","bibtex":"@inbook{Dunst_Hartel_2018, title={The quantitative analysis of comics: Towards a visual stylometry of graphic narrative}, booktitle={Empirical Comics Research: Digital, Multimodal, and Cognitive Methods}, publisher={Routledge}, author={Dunst, Alexander and Hartel, Rita}, editor={Dunst, Alexander and Laubrock, Jochen and Wildfeuer, JaninaEditors}, year={2018}, pages={43–61} }","apa":"Dunst, A., &#38; Hartel, R. (2018). The quantitative analysis of comics: Towards a visual stylometry of graphic narrative. In A. Dunst, J. Laubrock, &#38; J. Wildfeuer (Eds.), <i>Empirical Comics Research: Digital, Multimodal, and Cognitive Methods</i> (pp. 43–61). Routledge."},"year":"2018","language":[{"iso":"eng"}],"department":[{"_id":"69"}],"user_id":"14961","_id":"15160","status":"public","editor":[{"last_name":"Dunst","full_name":"Dunst, Alexander","first_name":"Alexander"},{"full_name":"Laubrock, Jochen","last_name":"Laubrock","first_name":"Jochen"},{"last_name":"Wildfeuer","full_name":"Wildfeuer, Janina","first_name":"Janina"}],"publication":"Empirical Comics Research: Digital, Multimodal, and Cognitive Methods","type":"book_chapter"},{"title":"Auf dem Weg zur Visuellen Stilometrie:Automatische Genre- und Autorunterscheidung in graphischen Narrativen","date_created":"2019-11-26T09:25:44Z","author":[{"first_name":"Alexander","last_name":"Dunst","full_name":"Dunst, Alexander"},{"first_name":"Rita","last_name":"Hartel","full_name":"Hartel, Rita","id":"14961"}],"date_updated":"2022-01-06T06:52:16Z","citation":{"apa":"Dunst, A., &#38; Hartel, R. (2018). Auf dem Weg zur Visuellen Stilometrie:Automatische Genre- und Autorunterscheidung in graphischen Narrativen. In <i>DHd Konferenz 2018, Kritik der digitalen Vernunft, DHd 2018</i>.","mla":"Dunst, Alexander, and Rita Hartel. “Auf Dem Weg Zur Visuellen Stilometrie:Automatische Genre- Und Autorunterscheidung in Graphischen Narrativen.” <i>DHd Konferenz 2018, Kritik Der Digitalen Vernunft, DHd 2018</i>, 2018.","short":"A. Dunst, R. Hartel, in: DHd Konferenz 2018, Kritik Der Digitalen Vernunft, DHd 2018, 2018.","bibtex":"@inproceedings{Dunst_Hartel_2018, title={Auf dem Weg zur Visuellen Stilometrie:Automatische Genre- und Autorunterscheidung in graphischen Narrativen}, booktitle={DHd Konferenz 2018, Kritik der digitalen Vernunft, DHd 2018}, author={Dunst, Alexander and Hartel, Rita}, year={2018} }","ama":"Dunst A, Hartel R. Auf dem Weg zur Visuellen Stilometrie:Automatische Genre- und Autorunterscheidung in graphischen Narrativen. In: <i>DHd Konferenz 2018, Kritik Der Digitalen Vernunft, DHd 2018</i>. ; 2018.","chicago":"Dunst, Alexander, and Rita Hartel. “Auf Dem Weg Zur Visuellen Stilometrie:Automatische Genre- Und Autorunterscheidung in Graphischen Narrativen.” In <i>DHd Konferenz 2018, Kritik Der Digitalen Vernunft, DHd 2018</i>, 2018.","ieee":"A. Dunst and R. Hartel, “Auf dem Weg zur Visuellen Stilometrie:Automatische Genre- und Autorunterscheidung in graphischen Narrativen,” in <i>DHd Konferenz 2018, Kritik der digitalen Vernunft, DHd 2018</i>, 2018."},"year":"2018","language":[{"iso":"eng"}],"user_id":"14961","department":[{"_id":"69"}],"_id":"15183","status":"public","type":"conference_abstract","publication":"DHd Konferenz 2018, Kritik der digitalen Vernunft, DHd 2018"},{"_id":"16038","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"user_id":"49109","language":[{"iso":"eng"}],"publication":"Machine Learning","type":"journal_article","status":"public","date_updated":"2022-01-06T06:52:42Z","volume":107,"author":[{"full_name":"Schäfer, D.","last_name":"Schäfer","first_name":"D."},{"last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"date_created":"2020-02-24T15:59:19Z","title":"Dyad ranking using Plackett-Luce models based on joint feature representations","issue":"5","year":"2018","page":"903-941","intvolume":"       107","citation":{"ieee":"D. Schäfer and E. Hüllermeier, “Dyad ranking using Plackett-Luce models based on joint feature representations,” <i>Machine Learning</i>, vol. 107, no. 5, pp. 903–941, 2018.","chicago":"Schäfer, D., and Eyke Hüllermeier. “Dyad Ranking Using Plackett-Luce Models Based on Joint Feature Representations.” <i>Machine Learning</i> 107, no. 5 (2018): 903–41.","ama":"Schäfer D, Hüllermeier E. Dyad ranking using Plackett-Luce models based on joint feature representations. <i>Machine Learning</i>. 2018;107(5):903-941.","apa":"Schäfer, D., &#38; Hüllermeier, E. (2018). Dyad ranking using Plackett-Luce models based on joint feature representations. <i>Machine Learning</i>, <i>107</i>(5), 903–941.","short":"D. Schäfer, E. Hüllermeier, Machine Learning 107 (2018) 903–941.","bibtex":"@article{Schäfer_Hüllermeier_2018, title={Dyad ranking using Plackett-Luce models based on joint feature representations}, volume={107}, number={5}, journal={Machine Learning}, author={Schäfer, D. and Hüllermeier, Eyke}, year={2018}, pages={903–941} }","mla":"Schäfer, D., and Eyke Hüllermeier. “Dyad Ranking Using Plackett-Luce Models Based on Joint Feature Representations.” <i>Machine Learning</i>, vol. 107, no. 5, 2018, pp. 903–41."}},{"oa":"1","date_updated":"2022-01-06T06:52:48Z","author":[{"full_name":"Peitz, Sebastian","id":"47427","last_name":"Peitz","orcid":"https://orcid.org/0000-0002-3389-793X","first_name":"Sebastian"}],"date_created":"2020-03-13T12:43:14Z","title":"Controlling nonlinear PDEs using low-dimensional bilinear approximations  obtained from data","main_file_link":[{"url":"https://arxiv.org/pdf/1801.06419.pdf","open_access":"1"}],"year":"2018","citation":{"ama":"Peitz S. Controlling nonlinear PDEs using low-dimensional bilinear approximations  obtained from data. <i>arXiv:180106419</i>. 2018.","chicago":"Peitz, Sebastian. “Controlling Nonlinear PDEs Using Low-Dimensional Bilinear Approximations  Obtained from Data.” <i>ArXiv:1801.06419</i>, 2018.","ieee":"S. Peitz, “Controlling nonlinear PDEs using low-dimensional bilinear approximations  obtained from data,” <i>arXiv:1801.06419</i>. 2018.","apa":"Peitz, S. (2018). Controlling nonlinear PDEs using low-dimensional bilinear approximations  obtained from data. <i>ArXiv:1801.06419</i>.","mla":"Peitz, Sebastian. “Controlling Nonlinear PDEs Using Low-Dimensional Bilinear Approximations  Obtained from Data.” <i>ArXiv:1801.06419</i>, 2018.","bibtex":"@article{Peitz_2018, title={Controlling nonlinear PDEs using low-dimensional bilinear approximations  obtained from data}, journal={arXiv:1801.06419}, author={Peitz, Sebastian}, year={2018} }","short":"S. Peitz, ArXiv:1801.06419 (2018)."},"_id":"16292","department":[{"_id":"101"}],"user_id":"47427","language":[{"iso":"eng"}],"publication":"arXiv:1801.06419","type":"preprint","abstract":[{"text":"In a recent article, we presented a framework to control nonlinear partial\r\ndifferential equations (PDEs) by means of Koopman operator based reduced models\r\nand concepts from switched systems. The main idea was to transform a control\r\nsystem into a set of autonomous systems for which the optimal switching\r\nsequence has to be computed. These individual systems can be approximated very\r\nefficiently by reduced order models obtained from data, and one can guarantee\r\nequality of the full and the reduced objective function under certain\r\nassumptions. In this article, we extend these results to continuous control\r\ninputs using convex combinations of multiple Koopman operators corresponding to\r\nconstant controls, which results in a bilinear control system. Although\r\nequality of the objectives can be carried over when the PDE depends linearly on\r\nthe control, we show that this approach is also valid in other scenarios using\r\nseveral flow control examples of varying complexity.","lang":"eng"}],"status":"public"},{"status":"public","abstract":[{"lang":"eng","text":"Kernel transfer operators, which can be regarded as approximations of\r\ntransfer operators such as the Perron-Frobenius or Koopman operator in\r\nreproducing kernel Hilbert spaces, are defined in terms of covariance and\r\ncross-covariance operators and have been shown to be closely related to the\r\nconditional mean embedding framework developed by the machine learning\r\ncommunity. The goal of this paper is to show how the dominant eigenfunctions of\r\nthese operators in combination with gradient-based optimization techniques can\r\nbe used to detect long-lived coherent patterns in high-dimensional time-series\r\ndata. The results will be illustrated using video data and a fluid flow\r\nexample."}],"type":"preprint","publication":"arXiv:1805.10118","language":[{"iso":"eng"}],"user_id":"47427","department":[{"_id":"101"}],"project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"16293","citation":{"chicago":"Klus, Stefan, Sebastian Peitz, and Ingmar Schuster. “Analyzing High-Dimensional Time-Series Data Using Kernel Transfer  Operator Eigenfunctions.” <i>ArXiv:1805.10118</i>, 2018.","ieee":"S. Klus, S. Peitz, and I. Schuster, “Analyzing high-dimensional time-series data using kernel transfer  operator eigenfunctions,” <i>arXiv:1805.10118</i>. 2018.","ama":"Klus S, Peitz S, Schuster I. Analyzing high-dimensional time-series data using kernel transfer  operator eigenfunctions. <i>arXiv:180510118</i>. 2018.","mla":"Klus, Stefan, et al. “Analyzing High-Dimensional Time-Series Data Using Kernel Transfer  Operator Eigenfunctions.” <i>ArXiv:1805.10118</i>, 2018.","bibtex":"@article{Klus_Peitz_Schuster_2018, title={Analyzing high-dimensional time-series data using kernel transfer  operator eigenfunctions}, journal={arXiv:1805.10118}, author={Klus, Stefan and Peitz, Sebastian and Schuster, Ingmar}, year={2018} }","short":"S. Klus, S. Peitz, I. Schuster, ArXiv:1805.10118 (2018).","apa":"Klus, S., Peitz, S., &#38; Schuster, I. (2018). Analyzing high-dimensional time-series data using kernel transfer  operator eigenfunctions. <i>ArXiv:1805.10118</i>."},"year":"2018","main_file_link":[{"url":"https://arxiv.org/pdf/1805.10118.pdf","open_access":"1"}],"title":"Analyzing high-dimensional time-series data using kernel transfer  operator eigenfunctions","author":[{"first_name":"Stefan","last_name":"Klus","full_name":"Klus, Stefan"},{"first_name":"Sebastian","last_name":"Peitz","orcid":"https://orcid.org/0000-0002-3389-793X","full_name":"Peitz, Sebastian","id":"47427"},{"last_name":"Schuster","full_name":"Schuster, Ingmar","first_name":"Ingmar"}],"date_created":"2020-03-13T12:44:12Z","oa":"1","date_updated":"2022-01-06T06:52:48Z"},{"language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16392","status":"public","publication":"Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications","type":"book_chapter","doi":"10.1007/978-3-319-98355-4_18","title":"A Dynamic Distributed Data Structure for Top-k and k-Select Queries","author":[{"first_name":"Björn","full_name":"Feldkord, Björn","id":"22704","last_name":"Feldkord"},{"full_name":"Malatyali, Manuel","last_name":"Malatyali","first_name":"Manuel"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_created":"2020-04-03T07:04:59Z","date_updated":"2022-01-06T06:52:50Z","citation":{"ama":"Feldkord B, Malatyali M, Meyer auf der Heide F. A Dynamic Distributed Data Structure for Top-k and k-Select Queries. In: <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>. Cham; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">10.1007/978-3-319-98355-4_18</a>","chicago":"Feldkord, Björn, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “A Dynamic Distributed Data Structure for Top-k and k-Select Queries.” In <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>. Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">https://doi.org/10.1007/978-3-319-98355-4_18</a>.","ieee":"B. Feldkord, M. Malatyali, and F. Meyer auf der Heide, “A Dynamic Distributed Data Structure for Top-k and k-Select Queries,” in <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>, Cham, 2018.","bibtex":"@inbook{Feldkord_Malatyali_Meyer auf der Heide_2018, place={Cham}, title={A Dynamic Distributed Data Structure for Top-k and k-Select Queries}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">10.1007/978-3-319-98355-4_18</a>}, booktitle={Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications}, author={Feldkord, Björn and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2018} }","mla":"Feldkord, Björn, et al. “A Dynamic Distributed Data Structure for Top-k and k-Select Queries.” <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">10.1007/978-3-319-98355-4_18</a>.","short":"B. Feldkord, M. Malatyali, F. Meyer auf der Heide, in: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, Cham, 2018.","apa":"Feldkord, B., Malatyali, M., &#38; Meyer auf der Heide, F. (2018). A Dynamic Distributed Data Structure for Top-k and k-Select Queries. In <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">https://doi.org/10.1007/978-3-319-98355-4_18</a>"},"place":"Cham","year":"2018","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319125671","9783319125688"]},"publication_status":"published"},{"year":"2018","title":"Tailored UV Emission by Nonlinear IR Excitation from ZnO Photonic Crystal Nanocavities","date_created":"2018-03-20T07:39:36Z","publisher":"American Chemical Society (ACS)","file":[{"relation":"main_file","content_type":"application/pdf","file_id":"3915","file_name":"2018-03 Hoffmann ACS Photonics - Tailored UV Emission by nonlinear IR excitation from ZnO photonic crystal nanocavities.pdf","access_level":"open_access","file_size":2935858,"creator":"fossie","date_created":"2018-08-16T07:49:44Z","date_updated":"2018-08-21T10:38:31Z"}],"publication":"ACS Photonics","language":[{"iso":"eng"}],"keyword":["tet_topic_phc"],"ddc":["530"],"intvolume":"         5","page":"1933-1942","citation":{"short":"S.P. Hoffmann, M. Albert, N. Weber, D. Sievers, J. Förstner, T. Zentgraf, C. Meier, ACS Photonics 5 (2018) 1933–1942.","bibtex":"@article{Hoffmann_Albert_Weber_Sievers_Förstner_Zentgraf_Meier_2018, title={Tailored UV Emission by Nonlinear IR Excitation from ZnO Photonic Crystal Nanocavities}, volume={5}, DOI={<a href=\"https://doi.org/10.1021/acsphotonics.7b01228\">10.1021/acsphotonics.7b01228</a>}, journal={ACS Photonics}, publisher={American Chemical Society (ACS)}, author={Hoffmann, Sandro P. and Albert, Maximilian and Weber, Nils and Sievers, Denis and Förstner, Jens and Zentgraf, Thomas and Meier, Cedrik}, year={2018}, pages={1933–1942} }","mla":"Hoffmann, Sandro P., et al. “Tailored UV Emission by Nonlinear IR Excitation from ZnO Photonic Crystal Nanocavities.” <i>ACS Photonics</i>, vol. 5, American Chemical Society (ACS), 2018, pp. 1933–42, doi:<a href=\"https://doi.org/10.1021/acsphotonics.7b01228\">10.1021/acsphotonics.7b01228</a>.","apa":"Hoffmann, S. P., Albert, M., Weber, N., Sievers, D., Förstner, J., Zentgraf, T., &#38; Meier, C. (2018). Tailored UV Emission by Nonlinear IR Excitation from ZnO Photonic Crystal Nanocavities. <i>ACS Photonics</i>, <i>5</i>, 1933–1942. <a href=\"https://doi.org/10.1021/acsphotonics.7b01228\">https://doi.org/10.1021/acsphotonics.7b01228</a>","chicago":"Hoffmann, Sandro P., Maximilian Albert, Nils Weber, Denis Sievers, Jens Förstner, Thomas Zentgraf, and Cedrik Meier. “Tailored UV Emission by Nonlinear IR Excitation from ZnO Photonic Crystal Nanocavities.” <i>ACS Photonics</i> 5 (2018): 1933–42. <a href=\"https://doi.org/10.1021/acsphotonics.7b01228\">https://doi.org/10.1021/acsphotonics.7b01228</a>.","ieee":"S. P. Hoffmann <i>et al.</i>, “Tailored UV Emission by Nonlinear IR Excitation from ZnO Photonic Crystal Nanocavities,” <i>ACS Photonics</i>, vol. 5, pp. 1933–1942, 2018.","ama":"Hoffmann SP, Albert M, Weber N, et al. Tailored UV Emission by Nonlinear IR Excitation from ZnO Photonic Crystal Nanocavities. <i>ACS Photonics</i>. 2018;5:1933-1942. doi:<a href=\"https://doi.org/10.1021/acsphotonics.7b01228\">10.1021/acsphotonics.7b01228</a>"},"has_accepted_license":"1","publication_identifier":{"issn":["2330-4022","2330-4022"]},"publication_status":"published","doi":"10.1021/acsphotonics.7b01228","volume":5,"author":[{"first_name":"Sandro P.","last_name":"Hoffmann","full_name":"Hoffmann, Sandro P."},{"first_name":"Maximilian","last_name":"Albert","full_name":"Albert, Maximilian"},{"first_name":"Nils","full_name":"Weber, Nils","last_name":"Weber"},{"last_name":"Sievers","full_name":"Sievers, Denis","first_name":"Denis"},{"first_name":"Jens","id":"158","full_name":"Förstner, Jens","last_name":"Förstner","orcid":"0000-0001-7059-9862"},{"full_name":"Zentgraf, Thomas","id":"30525","orcid":"0000-0002-8662-1101","last_name":"Zentgraf","first_name":"Thomas"},{"last_name":"Meier","orcid":"https://orcid.org/0000-0002-3787-3572","full_name":"Meier, Cedrik","id":"20798","first_name":"Cedrik"}],"date_updated":"2022-01-06T06:51:58Z","oa":"1","status":"public","urn":"14308","type":"journal_article","file_date_updated":"2018-08-21T10:38:31Z","department":[{"_id":"15"},{"_id":"230"},{"_id":"61"},{"_id":"287"},{"_id":"35"},{"_id":"289"}],"user_id":"30525","_id":"1430","project":[{"_id":"53","name":"TRR 142"},{"name":"TRR 142 - Project Area A","_id":"54"},{"name":"TRR 142 - Project Area B","_id":"55"},{"_id":"62","name":"TRR 142 - Subproject A5"},{"_id":"66","name":"TRR 142 - Subproject B1"}]},{"title":"Design For Small Delay Test - A Simulation Study","author":[{"first_name":"Matthias","last_name":"Kampmann","full_name":"Kampmann, Matthias","id":"10935"},{"last_name":"Hellebrand","orcid":"0000-0002-3717-3939","id":"209","full_name":"Hellebrand, Sybille","first_name":"Sybille"}],"date_created":"2019-08-28T11:49:25Z","volume":80,"date_updated":"2022-01-06T06:51:27Z","citation":{"mla":"Kampmann, Matthias, and Sybille Hellebrand. “Design For Small Delay Test - A Simulation Study.” <i>Microelectronics Reliability</i>, vol. 80, 2018, pp. 124–33.","bibtex":"@article{Kampmann_Hellebrand_2018, title={Design For Small Delay Test - A Simulation Study}, volume={80}, journal={Microelectronics Reliability}, author={Kampmann, Matthias and Hellebrand, Sybille}, year={2018}, pages={124–133} }","short":"M. Kampmann, S. Hellebrand, Microelectronics Reliability 80 (2018) 124–133.","apa":"Kampmann, M., &#38; Hellebrand, S. (2018). Design For Small Delay Test - A Simulation Study. <i>Microelectronics Reliability</i>, <i>80</i>, 124–133.","ama":"Kampmann M, Hellebrand S. Design For Small Delay Test - A Simulation Study. <i>Microelectronics Reliability</i>. 2018;80:124-133.","ieee":"M. Kampmann and S. Hellebrand, “Design For Small Delay Test - A Simulation Study,” <i>Microelectronics Reliability</i>, vol. 80, pp. 124–133, 2018.","chicago":"Kampmann, Matthias, and Sybille Hellebrand. “Design For Small Delay Test - A Simulation Study.” <i>Microelectronics Reliability</i> 80 (2018): 124–33."},"page":"124-133","intvolume":"        80","year":"2018","language":[{"iso":"eng"}],"user_id":"659","department":[{"_id":"48"}],"_id":"13057","status":"public","type":"journal_article","publication":"Microelectronics Reliability"},{"place":"19th Workshop on RTL and High Level Testing (WRTLT'18), Hefei, Anhui, China","year":"2018","citation":{"chicago":"Kampmann, Matthias, and Sybille Hellebrand. <i>Optimized Constraints for Scan-Chain Insertion for Faster-than-at-Speed Test</i>. 19th Workshop on RTL and High Level Testing (WRTLT’18), Hefei, Anhui, China, 2018.","ieee":"M. Kampmann and S. Hellebrand, <i>Optimized Constraints for Scan-Chain Insertion for Faster-than-at-Speed Test</i>. 19th Workshop on RTL and High Level Testing (WRTLT’18), Hefei, Anhui, China, 2018.","ama":"Kampmann M, Hellebrand S. <i>Optimized Constraints for Scan-Chain Insertion for Faster-than-at-Speed Test</i>. 19th Workshop on RTL and High Level Testing (WRTLT’18), Hefei, Anhui, China; 2018.","apa":"Kampmann, M., &#38; Hellebrand, S. (2018). <i>Optimized Constraints for Scan-Chain Insertion for Faster-than-at-Speed Test</i>. 19th Workshop on RTL and High Level Testing (WRTLT’18), Hefei, Anhui, China.","mla":"Kampmann, Matthias, and Sybille Hellebrand. <i>Optimized Constraints for Scan-Chain Insertion for Faster-than-at-Speed Test</i>. 2018.","bibtex":"@book{Kampmann_Hellebrand_2018, place={19th Workshop on RTL and High Level Testing (WRTLT’18), Hefei, Anhui, China}, title={Optimized Constraints for Scan-Chain Insertion for Faster-than-at-Speed Test}, author={Kampmann, Matthias and Hellebrand, Sybille}, year={2018} }","short":"M. Kampmann, S. Hellebrand, Optimized Constraints for Scan-Chain Insertion for Faster-than-at-Speed Test, 19th Workshop on RTL and High Level Testing (WRTLT’18), Hefei, Anhui, China, 2018."},"title":"Optimized Constraints for Scan-Chain Insertion for Faster-than-at-Speed Test","date_updated":"2022-01-06T06:51:28Z","date_created":"2019-08-28T12:00:28Z","author":[{"first_name":"Matthias","id":"10935","full_name":"Kampmann, Matthias","last_name":"Kampmann"},{"last_name":"Hellebrand","full_name":"Hellebrand, Sybille","first_name":"Sybille"}],"status":"public","type":"misc","keyword":["WORKSHOP"],"language":[{"iso":"eng"}],"_id":"13072","department":[{"_id":"48"}],"user_id":"659"},{"status":"public","abstract":[{"text":"There are many hard conjectures in graph theory, like Tutte's 5-flow conjecture, and the 5-cycle double cover conjecture, which would be true in general if they would be true for cubic graphs. Since most of them are trivially true for 3-edge-colorable cubic graphs, cubic graphs which are not 3-edge-colorable, often called snarks, play a key role in this context. Here, we survey parameters measuring how far apart a non 3-edge-colorable graph is from being 3-edge-colorable. We study their interrelation and prove some new results. Besides getting new insight into the structure of snarks, we show that such  measures give partial results with respect to these important conjectures. The paper closes with a list of open problems and conjectures.","lang":"eng"}],"publication":"The Electronic Journal of Combinatorics","type":"journal_article","language":[{"iso":"eng"}],"keyword":["Cubic graph","Tait coloring","Snark","Boole coloring","Berge's conjecture","Tutte's 5-flow conjecture"],"article_type":"original","article_number":"P4.54","department":[{"_id":"542"}],"user_id":"15540","_id":"10129","intvolume":"        25","citation":{"apa":"Fiol, M. A., Mazzuoccolo, G., &#38; Steffen, E. (2018). Measures of Edge-Uncolorability of Cubic Graphs. <i>The Electronic Journal of Combinatorics</i>, <i>25</i>(4).","bibtex":"@article{Fiol_Mazzuoccolo_Steffen_2018, title={Measures of Edge-Uncolorability of Cubic Graphs}, volume={25}, number={4P4.54}, journal={The Electronic Journal of Combinatorics}, author={Fiol, M. A. and Mazzuoccolo, Guiseppe and Steffen, Eckhard}, year={2018} }","mla":"Fiol, M. A., et al. “Measures of Edge-Uncolorability of Cubic Graphs.” <i>The Electronic Journal of Combinatorics</i>, vol. 25, no. 4, P4.54, 2018.","short":"M.A. Fiol, G. Mazzuoccolo, E. Steffen, The Electronic Journal of Combinatorics 25 (2018).","chicago":"Fiol, M. A., Guiseppe Mazzuoccolo, and Eckhard Steffen. “Measures of Edge-Uncolorability of Cubic Graphs.” <i>The Electronic Journal of Combinatorics</i> 25, no. 4 (2018).","ieee":"M. A. Fiol, G. Mazzuoccolo, and E. Steffen, “Measures of Edge-Uncolorability of Cubic Graphs,” <i>The Electronic Journal of Combinatorics</i>, vol. 25, no. 4, 2018.","ama":"Fiol MA, Mazzuoccolo G, Steffen E. Measures of Edge-Uncolorability of Cubic Graphs. <i>The Electronic Journal of Combinatorics</i>. 2018;25(4)."},"year":"2018","issue":"4","title":"Measures of Edge-Uncolorability of Cubic Graphs","volume":25,"date_created":"2019-06-05T09:59:10Z","author":[{"last_name":"Fiol","full_name":"Fiol, M. A.","first_name":"M. A."},{"first_name":"Guiseppe","last_name":"Mazzuoccolo","full_name":"Mazzuoccolo, Guiseppe"},{"last_name":"Steffen","id":"15548","full_name":"Steffen, Eckhard","first_name":"Eckhard"}],"date_updated":"2022-01-06T06:50:30Z"},{"publication":"Discussiones Mathematicae Graph Theory","type":"journal_article","status":"public","_id":"10132","department":[{"_id":"542"}],"user_id":"15540","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1234-3099","2083-5892"]},"publication_status":"published","year":"2018","page":"165-175","intvolume":"        38","citation":{"ieee":"L. Jin, G. Mazzuoccolo, and E. Steffen, “Cores, joins  and the Fano-flow conjectures,” <i>Discussiones Mathematicae Graph Theory</i>, vol. 38, pp. 165–175, 2018.","chicago":"Jin, Ligang, Giuseppe Mazzuoccolo, and Eckhard Steffen. “Cores, Joins  and the Fano-Flow Conjectures.” <i>Discussiones Mathematicae Graph Theory</i> 38 (2018): 165–75. <a href=\"https://doi.org/10.7151/dmgt.1999\">https://doi.org/10.7151/dmgt.1999</a>.","ama":"Jin L, Mazzuoccolo G, Steffen E. Cores, joins  and the Fano-flow conjectures. <i>Discussiones Mathematicae Graph Theory</i>. 2018;38:165-175. doi:<a href=\"https://doi.org/10.7151/dmgt.1999\">10.7151/dmgt.1999</a>","mla":"Jin, Ligang, et al. “Cores, Joins  and the Fano-Flow Conjectures.” <i>Discussiones Mathematicae Graph Theory</i>, vol. 38, 2018, pp. 165–75, doi:<a href=\"https://doi.org/10.7151/dmgt.1999\">10.7151/dmgt.1999</a>.","short":"L. Jin, G. Mazzuoccolo, E. Steffen, Discussiones Mathematicae Graph Theory 38 (2018) 165–175.","bibtex":"@article{Jin_Mazzuoccolo_Steffen_2018, title={Cores, joins  and the Fano-flow conjectures}, volume={38}, DOI={<a href=\"https://doi.org/10.7151/dmgt.1999\">10.7151/dmgt.1999</a>}, journal={Discussiones Mathematicae Graph Theory}, author={Jin, Ligang and Mazzuoccolo, Giuseppe and Steffen, Eckhard}, year={2018}, pages={165–175} }","apa":"Jin, L., Mazzuoccolo, G., &#38; Steffen, E. (2018). Cores, joins  and the Fano-flow conjectures. <i>Discussiones Mathematicae Graph Theory</i>, <i>38</i>, 165–175. <a href=\"https://doi.org/10.7151/dmgt.1999\">https://doi.org/10.7151/dmgt.1999</a>"},"date_updated":"2022-01-06T06:50:30Z","volume":38,"author":[{"full_name":"Jin, Ligang","last_name":"Jin","first_name":"Ligang"},{"last_name":"Mazzuoccolo","full_name":"Mazzuoccolo, Giuseppe","first_name":"Giuseppe"},{"full_name":"Steffen, Eckhard","id":"15548","last_name":"Steffen","first_name":"Eckhard"}],"date_created":"2019-06-05T10:08:41Z","title":"Cores, joins  and the Fano-flow conjectures","doi":"10.7151/dmgt.1999"},{"language":[{"iso":"eng"}],"_id":"10142","department":[{"_id":"542"}],"user_id":"15540","status":"public","publication":"Australasian Journal of Combinatorics","type":"journal_article","title":"Approximating Vizing’s independence number conjecture","date_updated":"2022-01-06T06:50:31Z","volume":71,"author":[{"id":"15548","full_name":"Steffen, Eckhard","last_name":"Steffen","first_name":"Eckhard"}],"date_created":"2019-06-07T08:36:36Z","year":"2018","page":"153-160","intvolume":"        71","citation":{"ama":"Steffen E. Approximating Vizing’s independence number conjecture. <i>Australasian Journal of Combinatorics</i>. 2018;71(1):153-160.","ieee":"E. Steffen, “Approximating Vizing’s independence number conjecture,” <i>Australasian Journal of Combinatorics</i>, vol. 71, no. 1, pp. 153–160, 2018.","chicago":"Steffen, Eckhard. “Approximating Vizing’s Independence Number Conjecture.” <i>Australasian Journal of Combinatorics</i> 71, no. 1 (2018): 153–60.","mla":"Steffen, Eckhard. “Approximating Vizing’s Independence Number Conjecture.” <i>Australasian Journal of Combinatorics</i>, vol. 71, no. 1, 2018, pp. 153–60.","bibtex":"@article{Steffen_2018, title={Approximating Vizing’s independence number conjecture}, volume={71}, number={1}, journal={Australasian Journal of Combinatorics}, author={Steffen, Eckhard}, year={2018}, pages={153–160} }","short":"E. Steffen, Australasian Journal of Combinatorics 71 (2018) 153–160.","apa":"Steffen, E. (2018). Approximating Vizing’s independence number conjecture. <i>Australasian Journal of Combinatorics</i>, <i>71</i>(1), 153–160."},"publication_status":"published","issue":"1"},{"publication":"Proc. 32 nd AAAI Conference on Artificial Intelligence (AAAI)","type":"conference","status":"public","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"user_id":"49109","_id":"10145","language":[{"iso":"eng"}],"page":"2951-2958","citation":{"short":"M. Ahmadi Fahandar, E. Hüllermeier, in: Proc. 32 Nd AAAI Conference on Artificial Intelligence (AAAI), 2018, pp. 2951–2958.","mla":"Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Learning to Rank Based on Analogical Reasoning.” <i>Proc. 32 Nd AAAI Conference on Artificial Intelligence (AAAI)</i>, 2018, pp. 2951–58.","bibtex":"@inproceedings{Ahmadi Fahandar_Hüllermeier_2018, title={Learning to Rank Based on Analogical Reasoning}, booktitle={Proc. 32 nd AAAI Conference on Artificial Intelligence (AAAI)}, author={Ahmadi Fahandar, Mohsen and Hüllermeier, Eyke}, year={2018}, pages={2951–2958} }","apa":"Ahmadi Fahandar, M., &#38; Hüllermeier, E. (2018). Learning to Rank Based on Analogical Reasoning. In <i>Proc. 32 nd AAAI Conference on Artificial Intelligence (AAAI)</i> (pp. 2951–2958).","ama":"Ahmadi Fahandar M, Hüllermeier E. Learning to Rank Based on Analogical Reasoning. In: <i>Proc. 32 Nd AAAI Conference on Artificial Intelligence (AAAI)</i>. ; 2018:2951-2958.","ieee":"M. Ahmadi Fahandar and E. Hüllermeier, “Learning to Rank Based on Analogical Reasoning,” in <i>Proc. 32 nd AAAI Conference on Artificial Intelligence (AAAI)</i>, 2018, pp. 2951–2958.","chicago":"Ahmadi Fahandar, Mohsen, and Eyke Hüllermeier. “Learning to Rank Based on Analogical Reasoning.” In <i>Proc. 32 Nd AAAI Conference on Artificial Intelligence (AAAI)</i>, 2951–58, 2018."},"year":"2018","date_created":"2019-06-07T08:49:33Z","author":[{"last_name":"Ahmadi Fahandar","full_name":"Ahmadi Fahandar, Mohsen","first_name":"Mohsen"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier"}],"date_updated":"2022-01-06T06:50:31Z","title":"Learning to Rank Based on Analogical Reasoning"},{"year":"2018","page":"3469-3477","citation":{"ieee":"A. El Mesaoudi-Paul, E. Hüllermeier, and R. Busa-Fekete, “Ranking Distributions based on Noisy Sorting,” in <i>Proc. 35th Int. Conference on Machine Learning (ICML)</i>, 2018, pp. 3469–3477.","chicago":"El Mesaoudi-Paul, Adil, Eyke Hüllermeier, and Robert Busa-Fekete. “Ranking Distributions Based on Noisy Sorting.” In <i>Proc. 35th Int. Conference on Machine Learning (ICML)</i>, 3469–77. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2018.","ama":"El Mesaoudi-Paul A, Hüllermeier E, Busa-Fekete R. Ranking Distributions based on Noisy Sorting. In: <i>Proc. 35th Int. Conference on Machine Learning (ICML)</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2018:3469-3477.","apa":"El Mesaoudi-Paul, A., Hüllermeier, E., &#38; Busa-Fekete, R. (2018). Ranking Distributions based on Noisy Sorting. <i>Proc. 35th Int. Conference on Machine Learning (ICML)</i>, 3469–3477.","bibtex":"@inproceedings{El Mesaoudi-Paul_Hüllermeier_Busa-Fekete_2018, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Ranking Distributions based on Noisy Sorting}, booktitle={Proc. 35th Int. Conference on Machine Learning (ICML)}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={El Mesaoudi-Paul, Adil and Hüllermeier, Eyke and Busa-Fekete, Robert}, year={2018}, pages={3469–3477}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"El Mesaoudi-Paul, Adil, et al. “Ranking Distributions Based on Noisy Sorting.” <i>Proc. 35th Int. Conference on Machine Learning (ICML)</i>, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2018, pp. 3469–77.","short":"A. El Mesaoudi-Paul, E. Hüllermeier, R. Busa-Fekete, in: Proc. 35th Int. Conference on Machine Learning (ICML), Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2018, pp. 3469–3477."},"title":"Ranking Distributions based on Noisy Sorting","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:50:31Z","author":[{"first_name":"Adil","full_name":"El Mesaoudi-Paul, Adil","last_name":"El Mesaoudi-Paul"},{"first_name":"Eyke","last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke"},{"full_name":"Busa-Fekete, Robert","last_name":"Busa-Fekete","first_name":"Robert"}],"date_created":"2019-06-07T09:02:37Z","status":"public","publication":"Proc. 35th Int. Conference on Machine Learning (ICML)","type":"conference","language":[{"iso":"eng"}],"_id":"10148","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"user_id":"5786","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn"},{"year":"2018","page":"15-20","citation":{"chicago":"Hesse, M., J. Timmermann, Eyke Hüllermeier, and Ansgar Trächtler. “A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart.” In <i>Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24</i>, 15–20, 2018.","ieee":"M. Hesse, J. Timmermann, E. Hüllermeier, and A. Trächtler, “A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart,” in <i>Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24</i>, 2018, pp. 15–20.","ama":"Hesse M, Timmermann J, Hüllermeier E, Trächtler A. A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart. In: <i>Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24</i>. ; 2018:15-20.","short":"M. Hesse, J. Timmermann, E. Hüllermeier, A. Trächtler, in: Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24, 2018, pp. 15–20.","mla":"Hesse, M., et al. “A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart.” <i>Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24</i>, 2018, pp. 15–20.","bibtex":"@inproceedings{Hesse_Timmermann_Hüllermeier_Trächtler_2018, title={A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart}, booktitle={Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24}, author={Hesse, M. and Timmermann, J. and Hüllermeier, Eyke and Trächtler, Ansgar}, year={2018}, pages={15–20} }","apa":"Hesse, M., Timmermann, J., Hüllermeier, E., &#38; Trächtler, A. (2018). A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart. <i>Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24</i>, 15–20."},"title":"A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart","date_updated":"2022-01-06T06:50:31Z","author":[{"first_name":"M.","full_name":"Hesse, M.","last_name":"Hesse"},{"full_name":"Timmermann, J.","last_name":"Timmermann","first_name":"J."},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"},{"last_name":"Trächtler","full_name":"Trächtler, Ansgar","first_name":"Ansgar"}],"date_created":"2019-06-07T09:10:51Z","status":"public","publication":"Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24","type":"conference","language":[{"iso":"eng"}],"_id":"10149","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"user_id":"5786"},{"year":"2018","citation":{"mla":"Mencia, E. Loz., et al. “Learning Interpretable Rules for Multi-Label Classification.” <i>Explainable and Interpretable Models in Computer Vision and Machine Learning</i>, edited by H. Jair Escalante et al., Springer, 2018, pp. 81–113.","bibtex":"@inbook{Mencia_Fürnkranz_Hüllermeier_Rapp_2018, series={The Springer Series on Challenges in Machine Learning}, title={Learning interpretable rules for multi-label classification}, booktitle={Explainable and Interpretable Models in Computer Vision and Machine Learning}, publisher={Springer}, author={Mencia, E.Loza and Fürnkranz, J. and Hüllermeier, Eyke and Rapp, M.}, editor={Jair Escalante, H. and Escalera, S. and Guyon, I. and Baro, X. and Güclüütürk, Y. and Güclü, U. and van Gerven, M.A.J.Editors}, year={2018}, pages={81–113}, collection={The Springer Series on Challenges in Machine Learning} }","short":"E.L. Mencia, J. Fürnkranz, E. Hüllermeier, M. Rapp, in: H. Jair Escalante, S. Escalera, I. Guyon, X. Baro, Y. Güclüütürk, U. Güclü, M.A.J. van Gerven (Eds.), Explainable and Interpretable Models in Computer Vision and Machine Learning, Springer, 2018, pp. 81–113.","apa":"Mencia, E. L., Fürnkranz, J., Hüllermeier, E., &#38; Rapp, M. (2018). Learning interpretable rules for multi-label classification. In H. Jair Escalante, S. Escalera, I. Guyon, X. Baro, Y. Güclüütürk, U. Güclü, &#38; M. A. J. van Gerven (Eds.), <i>Explainable and Interpretable Models in Computer Vision and Machine Learning</i> (pp. 81–113). Springer.","ieee":"E. L. Mencia, J. Fürnkranz, E. Hüllermeier, and M. Rapp, “Learning interpretable rules for multi-label classification,” in <i>Explainable and Interpretable Models in Computer Vision and Machine Learning</i>, H. Jair Escalante, S. Escalera, I. Guyon, X. Baro, Y. Güclüütürk, U. Güclü, and M. A. J. van Gerven, Eds. Springer, 2018, pp. 81–113.","chicago":"Mencia, E.Loza, J. Fürnkranz, Eyke Hüllermeier, and M. Rapp. “Learning Interpretable Rules for Multi-Label Classification.” In <i>Explainable and Interpretable Models in Computer Vision and Machine Learning</i>, edited by H. Jair Escalante, S. Escalera, I. Guyon, X. Baro, Y. Güclüütürk, U. Güclü, and M.A.J. van Gerven, 81–113. The Springer Series on Challenges in Machine Learning. Springer, 2018.","ama":"Mencia EL, Fürnkranz J, Hüllermeier E, Rapp M. Learning interpretable rules for multi-label classification. In: Jair Escalante H, Escalera S, Guyon I, et al., eds. <i>Explainable and Interpretable Models in Computer Vision and Machine Learning</i>. The Springer Series on Challenges in Machine Learning. Springer; 2018:81-113."},"page":"81-113","publisher":"Springer","date_updated":"2022-01-06T06:50:31Z","date_created":"2019-06-07T09:17:56Z","author":[{"first_name":"E.Loza","last_name":"Mencia","full_name":"Mencia, E.Loza"},{"full_name":"Fürnkranz, J.","last_name":"Fürnkranz","first_name":"J."},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier"},{"first_name":"M.","full_name":"Rapp, M.","last_name":"Rapp"}],"title":"Learning interpretable rules for multi-label classification","type":"book_chapter","publication":"Explainable and Interpretable Models in Computer Vision and Machine Learning","editor":[{"last_name":"Jair Escalante","full_name":"Jair Escalante, H.","first_name":"H."},{"last_name":"Escalera","full_name":"Escalera, S.","first_name":"S."},{"first_name":"I.","full_name":"Guyon, I.","last_name":"Guyon"},{"last_name":"Baro","full_name":"Baro, X.","first_name":"X."},{"first_name":"Y.","full_name":"Güclüütürk, Y.","last_name":"Güclüütürk"},{"full_name":"Güclü, U.","last_name":"Güclü","first_name":"U."},{"full_name":"van Gerven, M.A.J.","last_name":"van Gerven","first_name":"M.A.J."}],"status":"public","_id":"10152","series_title":"The Springer Series on Challenges in Machine Learning","user_id":"49109","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"language":[{"iso":"eng"}]},{"year":"2018","page":"5089-5095","citation":{"apa":"Nguyen, V.-L., Destercke, S., Masson, M.-H., &#38; Hüllermeier, E. (2018). Reliable Multi-class Classification based on Pairwise Epistemic and Aleatoric Uncertainty. <i>Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI)</i>, 5089–5095.","mla":"Nguyen, Vu-Linh, et al. “Reliable Multi-Class Classification Based on Pairwise Epistemic and Aleatoric Uncertainty.” <i>Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI)</i>, 2018, pp. 5089–95.","short":"V.-L. Nguyen, S. Destercke, M.-H. Masson, E. Hüllermeier, in: Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI), 2018, pp. 5089–5095.","bibtex":"@inproceedings{Nguyen_Destercke_Masson_Hüllermeier_2018, title={Reliable Multi-class Classification based on Pairwise Epistemic and Aleatoric Uncertainty}, booktitle={Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI)}, author={Nguyen, Vu-Linh and Destercke, Sebastian and Masson, M.-H. and Hüllermeier, Eyke}, year={2018}, pages={5089–5095} }","ama":"Nguyen V-L, Destercke S, Masson M-H, Hüllermeier E. Reliable Multi-class Classification based on Pairwise Epistemic and Aleatoric Uncertainty. In: <i>Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI)</i>. ; 2018:5089-5095.","ieee":"V.-L. Nguyen, S. Destercke, M.-H. Masson, and E. Hüllermeier, “Reliable Multi-class Classification based on Pairwise Epistemic and Aleatoric Uncertainty,” in <i>Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI)</i>, 2018, pp. 5089–5095.","chicago":"Nguyen, Vu-Linh, Sebastian Destercke, M.-H. Masson, and Eyke Hüllermeier. “Reliable Multi-Class Classification Based on Pairwise Epistemic and Aleatoric Uncertainty.” In <i>Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI)</i>, 5089–95, 2018."},"date_updated":"2022-01-06T06:50:31Z","author":[{"first_name":"Vu-Linh","last_name":"Nguyen","full_name":"Nguyen, Vu-Linh"},{"first_name":"Sebastian","last_name":"Destercke","full_name":"Destercke, Sebastian"},{"first_name":"M.-H.","last_name":"Masson","full_name":"Masson, M.-H."},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier"}],"date_created":"2019-06-07T12:31:20Z","title":"Reliable Multi-class Classification based on Pairwise Epistemic and Aleatoric Uncertainty","publication":"Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI)","type":"conference","status":"public","_id":"10181","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"},{"_id":"26"}],"user_id":"5786","language":[{"iso":"eng"}]}]