[{"external_id":{"arxiv":["1703.02456"]},"language":[{"iso":"eng"}],"publication":"Communications in Computational Physics","abstract":[{"text":"We address the general mathematical problem of computing the inverse p-th\r\nroot of a given matrix in an efficient way. A new method to construct iteration\r\nfunctions that allow calculating arbitrary p-th roots and their inverses of\r\nsymmetric positive definite matrices is presented. We show that the order of\r\nconvergence is at least quadratic and that adaptively adjusting a parameter q\r\nalways leads to an even faster convergence. In this way, a better performance\r\nthan with previously known iteration schemes is achieved. The efficiency of the\r\niterative functions is demonstrated for various matrices with different\r\ndensities, condition numbers and spectral radii.","lang":"eng"}],"publisher":"Global Science Press","date_created":"2017-07-25T14:48:26Z","title":"A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices","quality_controlled":"1","issue":"2","year":"2019","project":[{"grant_number":"PL 595/2-1 / 320898746","name":"Performance and Efficiency in HPC with Custom Computing","_id":"32"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"21","user_id":"15278","department":[{"_id":"27"},{"_id":"518"},{"_id":"304"},{"_id":"104"}],"type":"journal_article","status":"public","date_updated":"2023-09-26T11:45:02Z","author":[{"last_name":"Richters","full_name":"Richters, Dorothee","first_name":"Dorothee"},{"id":"24135","full_name":"Lass, Michael","last_name":"Lass","orcid":"0000-0002-5708-7632","first_name":"Michael"},{"first_name":"Andrea","full_name":"Walther, Andrea","last_name":"Walther"},{"id":"16153","full_name":"Plessl, Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian"},{"first_name":"Thomas","id":"49079","full_name":"Kühne, Thomas","last_name":"Kühne"}],"volume":25,"doi":"10.4208/cicp.OA-2018-0053","citation":{"chicago":"Richters, Dorothee, Michael Lass, Andrea Walther, Christian Plessl, and Thomas Kühne. “A General Algorithm to Calculate the Inverse Principal P-Th Root of Symmetric Positive Definite Matrices.” <i>Communications in Computational Physics</i> 25, no. 2 (2019): 564–85. <a href=\"https://doi.org/10.4208/cicp.OA-2018-0053\">https://doi.org/10.4208/cicp.OA-2018-0053</a>.","ieee":"D. Richters, M. Lass, A. Walther, C. Plessl, and T. Kühne, “A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices,” <i>Communications in Computational Physics</i>, vol. 25, no. 2, pp. 564–585, 2019, doi: <a href=\"https://doi.org/10.4208/cicp.OA-2018-0053\">10.4208/cicp.OA-2018-0053</a>.","ama":"Richters D, Lass M, Walther A, Plessl C, Kühne T. A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices. <i>Communications in Computational Physics</i>. 2019;25(2):564-585. doi:<a href=\"https://doi.org/10.4208/cicp.OA-2018-0053\">10.4208/cicp.OA-2018-0053</a>","apa":"Richters, D., Lass, M., Walther, A., Plessl, C., &#38; Kühne, T. (2019). A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices. <i>Communications in Computational Physics</i>, <i>25</i>(2), 564–585. <a href=\"https://doi.org/10.4208/cicp.OA-2018-0053\">https://doi.org/10.4208/cicp.OA-2018-0053</a>","bibtex":"@article{Richters_Lass_Walther_Plessl_Kühne_2019, title={A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices}, volume={25}, DOI={<a href=\"https://doi.org/10.4208/cicp.OA-2018-0053\">10.4208/cicp.OA-2018-0053</a>}, number={2}, journal={Communications in Computational Physics}, publisher={Global Science Press}, author={Richters, Dorothee and Lass, Michael and Walther, Andrea and Plessl, Christian and Kühne, Thomas}, year={2019}, pages={564–585} }","short":"D. Richters, M. Lass, A. Walther, C. Plessl, T. Kühne, Communications in Computational Physics 25 (2019) 564–585.","mla":"Richters, Dorothee, et al. “A General Algorithm to Calculate the Inverse Principal P-Th Root of Symmetric Positive Definite Matrices.” <i>Communications in Computational Physics</i>, vol. 25, no. 2, Global Science Press, 2019, pp. 564–85, doi:<a href=\"https://doi.org/10.4208/cicp.OA-2018-0053\">10.4208/cicp.OA-2018-0053</a>."},"intvolume":"        25","page":"564-585"},{"language":[{"iso":"eng"}],"department":[{"_id":"149"},{"_id":"9"},{"_id":"321"}],"user_id":"15952","_id":"13436","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"status":"public","publication":"Technologies for economical and functional lightweight design","type":"book_chapter","doi":"10.1007/978-3-662-58206-0_12","title":"TAILORED STACKED HYBRIDS – AN OPTIMIZATION-BASED APPROACH IN MATERIAL DESIGN FOR FURTHER IMPROVEMENT IN LIGHTWEIGHT CAR BODY STRUCTURES","date_created":"2019-09-22T17:33:23Z","author":[{"first_name":"Alan Adam","full_name":"Camberg, Alan Adam","id":"60544","last_name":"Camberg"},{"last_name":"Stratmann","full_name":"Stratmann, Ina","first_name":"Ina"},{"last_name":"Tröster","full_name":"Tröster, Thomas","id":"553","first_name":"Thomas"}],"date_updated":"2025-06-06T08:43:04Z","citation":{"ieee":"A. A. Camberg, I. Stratmann, and T. Tröster, “TAILORED STACKED HYBRIDS – AN OPTIMIZATION-BASED APPROACH IN MATERIAL DESIGN FOR FURTHER IMPROVEMENT IN LIGHTWEIGHT CAR BODY STRUCTURES,” in <i>Technologies for economical and functional lightweight design</i>, Berlin, Heidelberg, 2019.","chicago":"Camberg, Alan Adam, Ina Stratmann, and Thomas Tröster. “TAILORED STACKED HYBRIDS – AN OPTIMIZATION-BASED APPROACH IN MATERIAL DESIGN FOR FURTHER IMPROVEMENT IN LIGHTWEIGHT CAR BODY STRUCTURES.” In <i>Technologies for Economical and Functional Lightweight Design</i>. Berlin, Heidelberg, 2019. <a href=\"https://doi.org/10.1007/978-3-662-58206-0_12\">https://doi.org/10.1007/978-3-662-58206-0_12</a>.","ama":"Camberg AA, Stratmann I, Tröster T. TAILORED STACKED HYBRIDS – AN OPTIMIZATION-BASED APPROACH IN MATERIAL DESIGN FOR FURTHER IMPROVEMENT IN LIGHTWEIGHT CAR BODY STRUCTURES. In: <i>Technologies for Economical and Functional Lightweight Design</i>. ; 2019. doi:<a href=\"https://doi.org/10.1007/978-3-662-58206-0_12\">10.1007/978-3-662-58206-0_12</a>","bibtex":"@inbook{Camberg_Stratmann_Tröster_2019, place={Berlin, Heidelberg}, title={TAILORED STACKED HYBRIDS – AN OPTIMIZATION-BASED APPROACH IN MATERIAL DESIGN FOR FURTHER IMPROVEMENT IN LIGHTWEIGHT CAR BODY STRUCTURES}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-58206-0_12\">10.1007/978-3-662-58206-0_12</a>}, booktitle={Technologies for economical and functional lightweight design}, author={Camberg, Alan Adam and Stratmann, Ina and Tröster, Thomas}, year={2019} }","short":"A.A. Camberg, I. Stratmann, T. Tröster, in: Technologies for Economical and Functional Lightweight Design, Berlin, Heidelberg, 2019.","mla":"Camberg, Alan Adam, et al. “TAILORED STACKED HYBRIDS – AN OPTIMIZATION-BASED APPROACH IN MATERIAL DESIGN FOR FURTHER IMPROVEMENT IN LIGHTWEIGHT CAR BODY STRUCTURES.” <i>Technologies for Economical and Functional Lightweight Design</i>, 2019, doi:<a href=\"https://doi.org/10.1007/978-3-662-58206-0_12\">10.1007/978-3-662-58206-0_12</a>.","apa":"Camberg, A. A., Stratmann, I., &#38; Tröster, T. (2019). TAILORED STACKED HYBRIDS – AN OPTIMIZATION-BASED APPROACH IN MATERIAL DESIGN FOR FURTHER IMPROVEMENT IN LIGHTWEIGHT CAR BODY STRUCTURES. In <i>Technologies for economical and functional lightweight design</i>. <a href=\"https://doi.org/10.1007/978-3-662-58206-0_12\">https://doi.org/10.1007/978-3-662-58206-0_12</a>"},"year":"2019","place":"Berlin, Heidelberg","publication_identifier":{"isbn":["9783662582053","9783662582060"],"issn":["2524-4787","2524-4795"]},"publication_status":"published"},{"title":"Unconventional phase III of high-pressure solid hydrogen","doi":"10.1103/physrevb.100.155103","date_updated":"2026-02-23T12:18:18Z","volume":100,"date_created":"2020-01-30T13:20:33Z","author":[{"first_name":"Sam","last_name":"Azadi","full_name":"Azadi, Sam"},{"full_name":"Kühne, Thomas D.","last_name":"Kühne","first_name":"Thomas D."}],"year":"2019","page":"155103-155109","intvolume":"       100","citation":{"chicago":"Azadi, Sam, and Thomas D. Kühne. “Unconventional Phase III of High-Pressure Solid Hydrogen.” <i>Physical Review B</i> 100, no. 15 (2019): 155103–9. <a href=\"https://doi.org/10.1103/physrevb.100.155103\">https://doi.org/10.1103/physrevb.100.155103</a>.","ieee":"S. Azadi and T. D. Kühne, “Unconventional phase III of high-pressure solid hydrogen,” <i>Physical Review B</i>, vol. 100, no. 15, pp. 155103–155109, 2019, doi: <a href=\"https://doi.org/10.1103/physrevb.100.155103\">10.1103/physrevb.100.155103</a>.","ama":"Azadi S, Kühne TD. Unconventional phase III of high-pressure solid hydrogen. <i>Physical Review B</i>. 2019;100(15):155103-155109. doi:<a href=\"https://doi.org/10.1103/physrevb.100.155103\">10.1103/physrevb.100.155103</a>","apa":"Azadi, S., &#38; Kühne, T. D. (2019). Unconventional phase III of high-pressure solid hydrogen. <i>Physical Review B</i>, <i>100</i>(15), 155103–155109. <a href=\"https://doi.org/10.1103/physrevb.100.155103\">https://doi.org/10.1103/physrevb.100.155103</a>","mla":"Azadi, Sam, and Thomas D. Kühne. “Unconventional Phase III of High-Pressure Solid Hydrogen.” <i>Physical Review B</i>, vol. 100, no. 15, 2019, pp. 155103–09, doi:<a href=\"https://doi.org/10.1103/physrevb.100.155103\">10.1103/physrevb.100.155103</a>.","bibtex":"@article{Azadi_Kühne_2019, title={Unconventional phase III of high-pressure solid hydrogen}, volume={100}, DOI={<a href=\"https://doi.org/10.1103/physrevb.100.155103\">10.1103/physrevb.100.155103</a>}, number={15}, journal={Physical Review B}, author={Azadi, Sam and Kühne, Thomas D.}, year={2019}, pages={155103–155109} }","short":"S. Azadi, T.D. Kühne, Physical Review B 100 (2019) 155103–155109."},"publication_identifier":{"issn":["2469-9950","2469-9969"]},"publication_status":"published","issue":"15","language":[{"iso":"eng"}],"_id":"15739","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"department":[{"_id":"304"}],"user_id":"14972","status":"public","publication":"Physical Review B","type":"journal_article"},{"type":"conference","publication":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","status":"public","user_id":"3145","project":[{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"58921","alternative_title":["high-performance distributed memory programming on reconfigurable hardware"],"language":[{"iso":"eng"}],"publication_status":"published","citation":{"mla":"De Matteis, Tiziano, et al. “Streaming Message Interface.” <i>Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis</i>, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3295500.3356201\">10.1145/3295500.3356201</a>.","bibtex":"@inproceedings{De Matteis_de Fine Licht_Beránek_Hoefler_2019, title={Streaming message interface}, DOI={<a href=\"https://doi.org/10.1145/3295500.3356201\">10.1145/3295500.3356201</a>}, booktitle={Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis}, publisher={ACM}, author={De Matteis, Tiziano and de Fine Licht, Johannes and Beránek, Jakub and Hoefler, Torsten}, year={2019} }","short":"T. De Matteis, J. de Fine Licht, J. Beránek, T. Hoefler, in: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, ACM, 2019.","apa":"De Matteis, T., de Fine Licht, J., Beránek, J., &#38; Hoefler, T. (2019). Streaming message interface. <i>Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis</i>. <a href=\"https://doi.org/10.1145/3295500.3356201\">https://doi.org/10.1145/3295500.3356201</a>","ama":"De Matteis T, de Fine Licht J, Beránek J, Hoefler T. Streaming message interface. In: <i>Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis</i>. ACM; 2019. doi:<a href=\"https://doi.org/10.1145/3295500.3356201\">10.1145/3295500.3356201</a>","ieee":"T. De Matteis, J. de Fine Licht, J. Beránek, and T. Hoefler, “Streaming message interface,” 2019, doi: <a href=\"https://doi.org/10.1145/3295500.3356201\">10.1145/3295500.3356201</a>.","chicago":"De Matteis, Tiziano, Johannes de Fine Licht, Jakub Beránek, and Torsten Hoefler. “Streaming Message Interface.” In <i>Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3295500.3356201\">https://doi.org/10.1145/3295500.3356201</a>."},"year":"2019","author":[{"full_name":"De Matteis, Tiziano","last_name":"De Matteis","first_name":"Tiziano"},{"first_name":"Johannes","last_name":"de Fine Licht","full_name":"de Fine Licht, Johannes"},{"full_name":"Beránek, Jakub","last_name":"Beránek","first_name":"Jakub"},{"full_name":"Hoefler, Torsten","last_name":"Hoefler","first_name":"Torsten"}],"date_created":"2025-03-06T10:46:14Z","date_updated":"2025-03-06T10:48:08Z","publisher":"ACM","doi":"10.1145/3295500.3356201","title":"Streaming message interface"},{"title":"Controllable high-speed polariton waves in a PT-symmetric lattice","doi":"10.1088/1367-2630/ab5a9b","date_updated":"2025-12-05T13:53:04Z","date_created":"2020-02-10T11:35:57Z","author":[{"first_name":"Xuekai","id":"59416","full_name":"Ma, Xuekai","last_name":"Ma"},{"first_name":"Yaroslav Y","full_name":"Kartashov, Yaroslav Y","last_name":"Kartashov"},{"full_name":"Gao, Tingge","last_name":"Gao","first_name":"Tingge"},{"orcid":"0000-0003-4042-4951","last_name":"Schumacher","id":"27271","full_name":"Schumacher, Stefan","first_name":"Stefan"}],"volume":21,"year":"2019","citation":{"ieee":"X. Ma, Y. Y. Kartashov, T. Gao, and S. Schumacher, “Controllable high-speed polariton waves in a PT-symmetric lattice,” <i>New Journal of Physics</i>, vol. 21, Art. no. 123008, 2019, doi: <a href=\"https://doi.org/10.1088/1367-2630/ab5a9b\">10.1088/1367-2630/ab5a9b</a>.","chicago":"Ma, Xuekai, Yaroslav Y Kartashov, Tingge Gao, and Stefan Schumacher. “Controllable High-Speed Polariton Waves in a PT-Symmetric Lattice.” <i>New Journal of Physics</i> 21 (2019). <a href=\"https://doi.org/10.1088/1367-2630/ab5a9b\">https://doi.org/10.1088/1367-2630/ab5a9b</a>.","ama":"Ma X, Kartashov YY, Gao T, Schumacher S. Controllable high-speed polariton waves in a PT-symmetric lattice. <i>New Journal of Physics</i>. 2019;21. doi:<a href=\"https://doi.org/10.1088/1367-2630/ab5a9b\">10.1088/1367-2630/ab5a9b</a>","short":"X. Ma, Y.Y. Kartashov, T. Gao, S. Schumacher, New Journal of Physics 21 (2019).","mla":"Ma, Xuekai, et al. “Controllable High-Speed Polariton Waves in a PT-Symmetric Lattice.” <i>New Journal of Physics</i>, vol. 21, 123008, 2019, doi:<a href=\"https://doi.org/10.1088/1367-2630/ab5a9b\">10.1088/1367-2630/ab5a9b</a>.","bibtex":"@article{Ma_Kartashov_Gao_Schumacher_2019, title={Controllable high-speed polariton waves in a PT-symmetric lattice}, volume={21}, DOI={<a href=\"https://doi.org/10.1088/1367-2630/ab5a9b\">10.1088/1367-2630/ab5a9b</a>}, number={123008}, journal={New Journal of Physics}, author={Ma, Xuekai and Kartashov, Yaroslav Y and Gao, Tingge and Schumacher, Stefan}, year={2019} }","apa":"Ma, X., Kartashov, Y. Y., Gao, T., &#38; Schumacher, S. (2019). Controllable high-speed polariton waves in a PT-symmetric lattice. <i>New Journal of Physics</i>, <i>21</i>, Article 123008. <a href=\"https://doi.org/10.1088/1367-2630/ab5a9b\">https://doi.org/10.1088/1367-2630/ab5a9b</a>"},"intvolume":"        21","publication_status":"published","publication_identifier":{"issn":["1367-2630"]},"article_number":"123008","language":[{"iso":"eng"}],"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"15851","user_id":"16199","department":[{"_id":"15"},{"_id":"170"},{"_id":"297"},{"_id":"705"},{"_id":"230"},{"_id":"35"},{"_id":"27"}],"status":"public","type":"journal_article","publication":"New Journal of Physics"},{"title":"Externally Controlled Lotka-Volterra Dynamics in a Linearly Polarized  Polariton Fluid","date_updated":"2025-12-05T14:30:36Z","date_created":"2019-09-19T13:18:47Z","author":[{"last_name":"Pukrop","full_name":"Pukrop, Matthias","first_name":"Matthias"},{"first_name":"Stefan","full_name":"Schumacher, Stefan","id":"27271","orcid":"0000-0003-4042-4951","last_name":"Schumacher"}],"year":"2019","citation":{"ama":"Pukrop M, Schumacher S. Externally Controlled Lotka-Volterra Dynamics in a Linearly Polarized  Polariton Fluid. <i>arXiv:190312534</i>. Published online 2019.","chicago":"Pukrop, Matthias, and Stefan Schumacher. “Externally Controlled Lotka-Volterra Dynamics in a Linearly Polarized  Polariton Fluid.” <i>ArXiv:1903.12534</i>, 2019.","ieee":"M. Pukrop and S. Schumacher, “Externally Controlled Lotka-Volterra Dynamics in a Linearly Polarized  Polariton Fluid,” <i>arXiv:1903.12534</i>. 2019.","bibtex":"@article{Pukrop_Schumacher_2019, title={Externally Controlled Lotka-Volterra Dynamics in a Linearly Polarized  Polariton Fluid}, journal={arXiv:1903.12534}, author={Pukrop, Matthias and Schumacher, Stefan}, year={2019} }","short":"M. Pukrop, S. Schumacher, ArXiv:1903.12534 (2019).","mla":"Pukrop, Matthias, and Stefan Schumacher. “Externally Controlled Lotka-Volterra Dynamics in a Linearly Polarized  Polariton Fluid.” <i>ArXiv:1903.12534</i>, 2019.","apa":"Pukrop, M., &#38; Schumacher, S. (2019). Externally Controlled Lotka-Volterra Dynamics in a Linearly Polarized  Polariton Fluid. In <i>arXiv:1903.12534</i>."},"language":[{"iso":"eng"}],"_id":"13340","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"department":[{"_id":"15"},{"_id":"170"},{"_id":"297"},{"_id":"230"},{"_id":"35"},{"_id":"27"}],"user_id":"16199","abstract":[{"lang":"eng","text":"Spontaneous formation of transverse patterns is ubiquitous in nonlinear\r\ndynamical systems of all kinds. An aspect of particular interest is the active\r\ncontrol of such patterns. In nonlinear optical systems this can be used for\r\nall-optical switching with transistor-like performance, for example realized\r\nwith polaritons in a planar quantum-well semiconductor microcavity. Here we\r\nfocus on a specific configuration which takes advantage of the intricate\r\npolarization dependencies in the interacting optically driven polariton system.\r\nBesides detailed numerical simulations of the coupled light-field exciton\r\ndynamics, in the present paper we focus on the derivation of a simplified\r\npopulation competition model giving detailed insight into the underlying\r\nmechanisms from a nonlinear dynamical systems perspective. We show that such a\r\nmodel takes the form of a generalized Lotka-Volterra system for two competing\r\npopulations explicitly including a source term that enables external control.\r\nWe present a comprehensive analysis both of the existence and stability of\r\nstationary states in the parameter space spanned by spatial anisotropy and\r\nexternal control strength. We also construct phase boundaries in non-trivial\r\nregions and characterize emerging bifurcations. The population competition\r\nmodel reproduces all key features of the switching observed in full numerical\r\nsimulations of the rather complex semiconductor system and at the same time is\r\nsimple enough for a fully analytical understanding of the system dynamics."}],"status":"public","publication":"arXiv:1903.12534","type":"preprint"},{"year":"2019","citation":{"ama":"Dong C-D, Schumacher S. Molecular Doping of PCPDT-BT Copolymers: Comparison of Molecular Complexes with and Without Integer Charge Transfer. Published online 2019.","ieee":"C.-D. Dong and S. Schumacher, “Molecular Doping of PCPDT-BT Copolymers: Comparison of Molecular Complexes with and Without Integer Charge Transfer.” 2019.","chicago":"Dong, Chuan-Ding, and Stefan Schumacher. “Molecular Doping of PCPDT-BT Copolymers: Comparison of Molecular Complexes with and Without Integer Charge Transfer,” 2019.","apa":"Dong, C.-D., &#38; Schumacher, S. (2019). <i>Molecular Doping of PCPDT-BT Copolymers: Comparison of Molecular Complexes with and Without Integer Charge Transfer</i>.","short":"C.-D. Dong, S. Schumacher, (2019).","bibtex":"@article{Dong_Schumacher_2019, title={Molecular Doping of PCPDT-BT Copolymers: Comparison of Molecular Complexes with and Without Integer Charge Transfer}, author={Dong, Chuan-Ding and Schumacher, Stefan}, year={2019} }","mla":"Dong, Chuan-Ding, and Stefan Schumacher. <i>Molecular Doping of PCPDT-BT Copolymers: Comparison of Molecular Complexes with and Without Integer Charge Transfer</i>. 2019."},"publication_status":"published","title":"Molecular Doping of PCPDT-BT Copolymers: Comparison of Molecular Complexes with and Without Integer Charge Transfer","date_updated":"2025-12-05T14:31:11Z","date_created":"2019-09-19T13:44:34Z","author":[{"full_name":"Dong, Chuan-Ding","id":"67188","last_name":"Dong","first_name":"Chuan-Ding"},{"first_name":"Stefan","orcid":"0000-0003-4042-4951","last_name":"Schumacher","full_name":"Schumacher, Stefan","id":"27271"}],"abstract":[{"text":"<jats:p>&lt;div&gt;\r\n\t\t\t&lt;div&gt;\r\n\t\t\t\t&lt;div&gt;\r\n\t\t\t\t\t&lt;p&gt;Molecular doping in conjugated polymers is a crucial process for their application in organic\r\nphotovoltaics and optoelectronics. In the present work we theoretically investigate p-type molecu-\r\nlar doping in a series of (poly[2,6-(4,4-bis(2-ethylhexyl)-4H-cyclopenta[2,1-b;3,4-b”]dithiophene)-alt-\r\n4,7-(2,1,3-benzothiadiazole)] (PCPDT-BT) conjugated oligomers with different lengths and three\r\nwidely-used dopants with different electron affinities, namely F4TCNQ, F6TCNNQ, and CN6-CP.\r\nWe study in detail the molecular geometry of possible oligomer-dopant complexes and its influence\r\non the doping mechanisms and electronic system properties. We find that the mechanisms of dop-\r\ning and charge transfer observed sensitively depend on the specific geometry of the oligomer-dopant\r\ncomplexes. For a given complex different geometries may exist, some of which show transfer of\r\nan entire electron from the oligomer chain onto the dopant molecule resulting in an integer-charge\r\ntransfer complex, leaving the system in a ground state with broken spin symmetry. In other ge-\r\nometries merely hybridization of oligomer and dopant frontier orbitals occurs with partial charge\r\ntransfer but spin-symmetric ground state. Considering the resulting electronic density of states both\r\ncases may well contribute to an increased electrical conductivity of corresponding film samples while\r\nthe underlying physical mechanisms are entirely different.\r\n&lt;/p&gt;\r\n\t\t\t\t&lt;/div&gt;\r\n\t\t\t&lt;/div&gt;\r\n\t\t&lt;/div&gt;</jats:p>","lang":"eng"}],"status":"public","type":"preprint","language":[{"iso":"eng"}],"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"},{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"13347","user_id":"16199","department":[{"_id":"15"},{"_id":"170"},{"_id":"297"},{"_id":"230"},{"_id":"35"},{"_id":"27"}]},{"status":"public","type":"journal_article","publication":"The Journal of Physical Chemistry C","language":[{"iso":"eng"}],"user_id":"16199","department":[{"_id":"15"},{"_id":"170"},{"_id":"297"},{"_id":"313"},{"_id":"230"},{"_id":"35"},{"_id":"27"},{"_id":"2"}],"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"13343","citation":{"chicago":"Vollbrecht, Joachim, Christian Wiebeler, Harald Bock, Stefan Schumacher, and Heinz-Siegfried Kitzerow. “Curved Polar Dibenzocoronene Esters and Imides versus Their Planar Centrosymmetric Homologs: Photophysical and Optoelectronic Analysis.” <i>The Journal of Physical Chemistry C</i> 123, no. 7 (2019): 4483–92. <a href=\"https://doi.org/10.1021/acs.jpcc.8b10730\">https://doi.org/10.1021/acs.jpcc.8b10730</a>.","ieee":"J. Vollbrecht, C. Wiebeler, H. Bock, S. Schumacher, and H.-S. Kitzerow, “Curved Polar Dibenzocoronene Esters and Imides versus Their Planar Centrosymmetric Homologs: Photophysical and Optoelectronic Analysis,” <i>The Journal of Physical Chemistry C</i>, vol. 123, no. 7, pp. 4483–4492, 2019, doi: <a href=\"https://doi.org/10.1021/acs.jpcc.8b10730\">10.1021/acs.jpcc.8b10730</a>.","ama":"Vollbrecht J, Wiebeler C, Bock H, Schumacher S, Kitzerow H-S. Curved Polar Dibenzocoronene Esters and Imides versus Their Planar Centrosymmetric Homologs: Photophysical and Optoelectronic Analysis. <i>The Journal of Physical Chemistry C</i>. 2019;123(7):4483-4492. doi:<a href=\"https://doi.org/10.1021/acs.jpcc.8b10730\">10.1021/acs.jpcc.8b10730</a>","apa":"Vollbrecht, J., Wiebeler, C., Bock, H., Schumacher, S., &#38; Kitzerow, H.-S. (2019). Curved Polar Dibenzocoronene Esters and Imides versus Their Planar Centrosymmetric Homologs: Photophysical and Optoelectronic Analysis. <i>The Journal of Physical Chemistry C</i>, <i>123</i>(7), 4483–4492. <a href=\"https://doi.org/10.1021/acs.jpcc.8b10730\">https://doi.org/10.1021/acs.jpcc.8b10730</a>","short":"J. Vollbrecht, C. Wiebeler, H. Bock, S. Schumacher, H.-S. Kitzerow, The Journal of Physical Chemistry C 123 (2019) 4483–4492.","bibtex":"@article{Vollbrecht_Wiebeler_Bock_Schumacher_Kitzerow_2019, title={Curved Polar Dibenzocoronene Esters and Imides versus Their Planar Centrosymmetric Homologs: Photophysical and Optoelectronic Analysis}, volume={123}, DOI={<a href=\"https://doi.org/10.1021/acs.jpcc.8b10730\">10.1021/acs.jpcc.8b10730</a>}, number={7}, journal={The Journal of Physical Chemistry C}, author={Vollbrecht, Joachim and Wiebeler, Christian and Bock, Harald and Schumacher, Stefan and Kitzerow, Heinz-Siegfried}, year={2019}, pages={4483–4492} }","mla":"Vollbrecht, Joachim, et al. “Curved Polar Dibenzocoronene Esters and Imides versus Their Planar Centrosymmetric Homologs: Photophysical and Optoelectronic Analysis.” <i>The Journal of Physical Chemistry C</i>, vol. 123, no. 7, 2019, pp. 4483–92, doi:<a href=\"https://doi.org/10.1021/acs.jpcc.8b10730\">10.1021/acs.jpcc.8b10730</a>."},"page":"4483-4492","intvolume":"       123","year":"2019","issue":"7","publication_status":"published","publication_identifier":{"issn":["1932-7447","1932-7455"]},"doi":"10.1021/acs.jpcc.8b10730","title":"Curved Polar Dibenzocoronene Esters and Imides versus Their Planar Centrosymmetric Homologs: Photophysical and Optoelectronic Analysis","author":[{"full_name":"Vollbrecht, Joachim","last_name":"Vollbrecht","first_name":"Joachim"},{"last_name":"Wiebeler","full_name":"Wiebeler, Christian","first_name":"Christian"},{"first_name":"Harald","last_name":"Bock","full_name":"Bock, Harald"},{"last_name":"Schumacher","orcid":"0000-0003-4042-4951","full_name":"Schumacher, Stefan","id":"27271","first_name":"Stefan"},{"last_name":"Kitzerow","id":"254","full_name":"Kitzerow, Heinz-Siegfried","first_name":"Heinz-Siegfried"}],"date_created":"2019-09-19T13:36:01Z","volume":123,"date_updated":"2025-12-05T14:29:56Z"},{"author":[{"first_name":"Karlson","last_name":"Pfannschmidt","full_name":"Pfannschmidt, Karlson"},{"last_name":"Gupta","full_name":"Gupta, Pritha","first_name":"Pritha"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier"}],"date_created":"2020-09-17T10:53:39Z","date_updated":"2022-01-06T06:54:06Z","title":"Deep Architectures for Learning Context-dependent Ranking Functions","citation":{"apa":"Pfannschmidt, K., Gupta, P., &#38; Hüllermeier, E. (2018). Deep Architectures for Learning Context-dependent Ranking Functions. <i>ArXiv:1803.05796</i>.","bibtex":"@article{Pfannschmidt_Gupta_Hüllermeier_2018, title={Deep Architectures for Learning Context-dependent Ranking Functions}, journal={arXiv:1803.05796}, author={Pfannschmidt, Karlson and Gupta, Pritha and Hüllermeier, Eyke}, year={2018} }","short":"K. Pfannschmidt, P. Gupta, E. Hüllermeier, ArXiv:1803.05796 (2018).","mla":"Pfannschmidt, Karlson, et al. “Deep Architectures for Learning Context-Dependent Ranking Functions.” <i>ArXiv:1803.05796</i>, 2018.","chicago":"Pfannschmidt, Karlson, Pritha Gupta, and Eyke Hüllermeier. “Deep Architectures for Learning Context-Dependent Ranking Functions.” <i>ArXiv:1803.05796</i>, 2018.","ieee":"K. Pfannschmidt, P. Gupta, and E. Hüllermeier, “Deep Architectures for Learning Context-dependent Ranking Functions,” <i>arXiv:1803.05796</i>. 2018.","ama":"Pfannschmidt K, Gupta P, Hüllermeier E. Deep Architectures for Learning Context-dependent Ranking Functions. <i>arXiv:180305796</i>. 2018."},"year":"2018","department":[{"_id":"7"},{"_id":"355"}],"user_id":"13472","_id":"19524","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"language":[{"iso":"eng"}],"publication":"arXiv:1803.05796","type":"preprint","status":"public","abstract":[{"text":"Object ranking is an important problem in the realm of preference learning.\r\nOn the basis of training data in the form of a set of rankings of objects,\r\nwhich are typically represented as feature vectors, the goal is to learn a\r\nranking function that predicts a linear order of any new set of objects.\r\nCurrent approaches commonly focus on ranking by scoring, i.e., on learning an\r\nunderlying latent utility function that seeks to capture the inherent utility\r\nof each object. These approaches, however, are not able to take possible\r\neffects of context-dependence into account, where context-dependence means that\r\nthe utility or usefulness of an object may also depend on what other objects\r\nare available as alternatives. In this paper, we formalize the problem of\r\ncontext-dependent ranking and present two general approaches based on two\r\nnatural representations of context-dependent ranking functions. Both approaches\r\nare instantiated by means of appropriate neural network architectures, which\r\nare evaluated on suitable benchmark task.","lang":"eng"}]},{"title":"Investigation of ductility and damage characteristics of EN AW-5182 H18 at non-isothermal forming conditions","conference":{"name":"Materials Science and Engineering (MSE) Congress 2018","start_date":"2018-09-25","end_date":"2018-09-27","location":"Darmstadt"},"date_updated":"2022-01-06T06:54:14Z","date_created":"2020-10-04T19:23:56Z","author":[{"last_name":"Camberg","id":"60544","full_name":"Camberg, Alan Adam","first_name":"Alan Adam"},{"first_name":"Thomas","full_name":"Tröster, Thomas","id":"553","last_name":"Tröster"},{"last_name":"Sotirov","full_name":"Sotirov, Nikolay","first_name":"Nikolay"},{"full_name":"Tölle, Jörn","last_name":"Tölle","first_name":"Jörn"},{"first_name":"Friedrich","full_name":"Bohner, Friedrich","last_name":"Bohner"}],"place":"Darmstadt","year":"2018","citation":{"apa":"Camberg, A. A., Tröster, T., Sotirov, N., Tölle, J., &#38; Bohner, F. (2018). Investigation of ductility and damage characteristics of EN AW-5182 H18 at non-isothermal forming conditions. In <i>Materials Science and Engineering (MSE) Congress 2018</i>. Darmstadt.","short":"A.A. Camberg, T. Tröster, N. Sotirov, J. Tölle, F. Bohner, in: Materials Science and Engineering (MSE) Congress 2018, Darmstadt, 2018.","bibtex":"@inproceedings{Camberg_Tröster_Sotirov_Tölle_Bohner_2018, place={Darmstadt}, title={Investigation of ductility and damage characteristics of EN AW-5182 H18 at non-isothermal forming conditions}, booktitle={Materials Science and Engineering (MSE) Congress 2018}, author={Camberg, Alan Adam and Tröster, Thomas and Sotirov, Nikolay and Tölle, Jörn and Bohner, Friedrich}, year={2018} }","mla":"Camberg, Alan Adam, et al. “Investigation of Ductility and Damage Characteristics of EN AW-5182 H18 at Non-Isothermal Forming Conditions.” <i>Materials Science and Engineering (MSE) Congress 2018</i>, 2018.","chicago":"Camberg, Alan Adam, Thomas Tröster, Nikolay Sotirov, Jörn Tölle, and Friedrich Bohner. “Investigation of Ductility and Damage Characteristics of EN AW-5182 H18 at Non-Isothermal Forming Conditions.” In <i>Materials Science and Engineering (MSE) Congress 2018</i>. Darmstadt, 2018.","ieee":"A. A. Camberg, T. Tröster, N. Sotirov, J. Tölle, and F. Bohner, “Investigation of ductility and damage characteristics of EN AW-5182 H18 at non-isothermal forming conditions,” in <i>Materials Science and Engineering (MSE) Congress 2018</i>, Darmstadt, 2018.","ama":"Camberg AA, Tröster T, Sotirov N, Tölle J, Bohner F. Investigation of ductility and damage characteristics of EN AW-5182 H18 at non-isothermal forming conditions. In: <i>Materials Science and Engineering (MSE) Congress 2018</i>. Darmstadt; 2018."},"publication_status":"published","language":[{"iso":"eng"}],"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"19868","user_id":"60544","department":[{"_id":"9"},{"_id":"321"},{"_id":"149"}],"status":"public","type":"conference_abstract","publication":"Materials Science and Engineering (MSE) Congress 2018"},{"external_id":{"arxiv":["1703.02283"]},"language":[{"iso":"eng"}],"publication":"Embedded Systems Letters","abstract":[{"text":"Approximate computing has shown to provide new ways to improve performance\r\nand power consumption of error-resilient applications. While many of these\r\napplications can be found in image processing, data classification or machine\r\nlearning, we demonstrate its suitability to a problem from scientific\r\ncomputing. Utilizing the self-correcting behavior of iterative algorithms, we\r\nshow that approximate computing can be applied to the calculation of inverse\r\nmatrix p-th roots which are required in many applications in scientific\r\ncomputing. Results show great opportunities to reduce the computational effort\r\nand bandwidth required for the execution of the discussed algorithm, especially\r\nwhen targeting special accelerator hardware.","lang":"eng"}],"publisher":"IEEE","date_created":"2017-07-25T14:41:08Z","title":"Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots","issue":"2","year":"2018","_id":"20","project":[{"grant_number":"PL 595/2-1","name":"Performance and Efficiency in HPC with Custom Computing","_id":"32"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"department":[{"_id":"27"},{"_id":"518"},{"_id":"304"}],"user_id":"16153","type":"journal_article","status":"public","date_updated":"2022-01-06T06:54:18Z","volume":10,"author":[{"orcid":"0000-0002-5708-7632","last_name":"Lass","full_name":"Lass, Michael","id":"24135","first_name":"Michael"},{"first_name":"Thomas","last_name":"Kühne","id":"49079","full_name":"Kühne, Thomas"},{"first_name":"Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","id":"16153","full_name":"Plessl, Christian"}],"doi":"10.1109/LES.2017.2760923","publication_identifier":{"issn":["1943-0663"],"eissn":["1943-0671"]},"publication_status":"published","page":" 33-36","intvolume":"        10","citation":{"ieee":"M. Lass, T. Kühne, and C. Plessl, “Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots,” <i>Embedded Systems Letters</i>, vol. 10, no. 2, pp. 33–36, 2018.","chicago":"Lass, Michael, Thomas Kühne, and Christian Plessl. “Using Approximate Computing for the Calculation of Inverse Matrix P-Th Roots.” <i>Embedded Systems Letters</i> 10, no. 2 (2018): 33–36. <a href=\"https://doi.org/10.1109/LES.2017.2760923\">https://doi.org/10.1109/LES.2017.2760923</a>.","ama":"Lass M, Kühne T, Plessl C. Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots. <i>Embedded Systems Letters</i>. 2018;10(2):33-36. doi:<a href=\"https://doi.org/10.1109/LES.2017.2760923\">10.1109/LES.2017.2760923</a>","short":"M. Lass, T. Kühne, C. Plessl, Embedded Systems Letters 10 (2018) 33–36.","bibtex":"@article{Lass_Kühne_Plessl_2018, title={Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots}, volume={10}, DOI={<a href=\"https://doi.org/10.1109/LES.2017.2760923\">10.1109/LES.2017.2760923</a>}, number={2}, journal={Embedded Systems Letters}, publisher={IEEE}, author={Lass, Michael and Kühne, Thomas and Plessl, Christian}, year={2018}, pages={33–36} }","mla":"Lass, Michael, et al. “Using Approximate Computing for the Calculation of Inverse Matrix P-Th Roots.” <i>Embedded Systems Letters</i>, vol. 10, no. 2, IEEE, 2018, pp. 33–36, doi:<a href=\"https://doi.org/10.1109/LES.2017.2760923\">10.1109/LES.2017.2760923</a>.","apa":"Lass, M., Kühne, T., &#38; Plessl, C. (2018). Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots. <i>Embedded Systems Letters</i>, <i>10</i>(2), 33–36. <a href=\"https://doi.org/10.1109/LES.2017.2760923\">https://doi.org/10.1109/LES.2017.2760923</a>"}},{"title":"ML-Plan: Automated Machine Learning via Hierarchical Planning","date_created":"2018-07-08T14:06:14Z","publisher":"Springer","year":"2018","language":[{"iso":"eng"}],"keyword":["AutoML","Hierarchical Planning","HTN planning","ML-Plan"],"ddc":["000"],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1070937,"access_level":"closed","file_id":"5306","file_name":"ML-PlanAutomatedMachineLearnin.pdf","date_updated":"2018-11-02T15:32:16Z","creator":"ups","date_created":"2018-11-02T15:32:16Z"}],"abstract":[{"lang":"eng","text":"Automated machine learning (AutoML) seeks to automatically select, compose, and parametrize machine learning algorithms, so as to achieve optimal performance on a given task (dataset). Although current approaches to AutoML have already produced impressive results, the field is still far from mature, and new techniques are still being developed. In this paper, we present ML-Plan, a new approach to AutoML based on hierarchical planning. To highlight the potential of this approach, we compare ML-Plan to the state-of-the-art frameworks Auto-WEKA, auto-sklearn, and TPOT. In an extensive series of experiments, we show that ML-Plan is highly competitive and often outperforms existing approaches."}],"publication":"Machine Learning","doi":"10.1007/s10994-018-5735-z","conference":{"name":"European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases","start_date":"2018-09-10","end_date":"2018-09-14","location":"Dublin, Ireland"},"main_file_link":[{"url":"https://rdcu.be/3Nc2","open_access":"1"}],"author":[{"last_name":"Mohr","full_name":"Mohr, Felix","first_name":"Felix"},{"first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","full_name":"Wever, Marcel Dominik","id":"33176"},{"full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier","first_name":"Eyke"}],"date_updated":"2022-01-06T06:59:21Z","oa":"1","page":"1495-1515","citation":{"apa":"Mohr, F., Wever, M. D., &#38; Hüllermeier, E. (2018). ML-Plan: Automated Machine Learning via Hierarchical Planning. <i>Machine Learning</i>, 1495–1515. <a href=\"https://doi.org/10.1007/s10994-018-5735-z\">https://doi.org/10.1007/s10994-018-5735-z</a>","mla":"Mohr, Felix, et al. “ML-Plan: Automated Machine Learning via Hierarchical Planning.” <i>Machine Learning</i>, Springer, 2018, pp. 1495–515, doi:<a href=\"https://doi.org/10.1007/s10994-018-5735-z\">10.1007/s10994-018-5735-z</a>.","bibtex":"@article{Mohr_Wever_Hüllermeier_2018, title={ML-Plan: Automated Machine Learning via Hierarchical Planning}, DOI={<a href=\"https://doi.org/10.1007/s10994-018-5735-z\">10.1007/s10994-018-5735-z</a>}, journal={Machine Learning}, publisher={Springer}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2018}, pages={1495–1515} }","short":"F. Mohr, M.D. Wever, E. Hüllermeier, Machine Learning (2018) 1495–1515.","ama":"Mohr F, Wever MD, Hüllermeier E. ML-Plan: Automated Machine Learning via Hierarchical Planning. <i>Machine Learning</i>. Published online 2018:1495-1515. doi:<a href=\"https://doi.org/10.1007/s10994-018-5735-z\">10.1007/s10994-018-5735-z</a>","ieee":"F. Mohr, M. D. Wever, and E. Hüllermeier, “ML-Plan: Automated Machine Learning via Hierarchical Planning,” <i>Machine Learning</i>, pp. 1495–1515, 2018, doi: <a href=\"https://doi.org/10.1007/s10994-018-5735-z\">10.1007/s10994-018-5735-z</a>.","chicago":"Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “ML-Plan: Automated Machine Learning via Hierarchical Planning.” <i>Machine Learning</i>, 2018, 1495–1515. <a href=\"https://doi.org/10.1007/s10994-018-5735-z\">https://doi.org/10.1007/s10994-018-5735-z</a>."},"has_accepted_license":"1","publication_identifier":{"issn":["0885-6125"],"eissn":["1573-0565"]},"publication_status":"epub_ahead","file_date_updated":"2018-11-02T15:32:16Z","article_type":"original","department":[{"_id":"355"},{"_id":"34"},{"_id":"7"},{"_id":"26"}],"user_id":"5786","_id":"3510","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"status":"public","type":"journal_article"},{"date_updated":"2022-01-06T06:59:26Z","date_created":"2018-07-20T14:10:46Z","author":[{"full_name":"Witschen, Linus Matthias","id":"49051","last_name":"Witschen","first_name":"Linus Matthias"},{"id":"3118","full_name":"Wiersema, Tobias","last_name":"Wiersema","first_name":"Tobias"},{"full_name":"Ghasemzadeh Mohammadi, Hassan","id":"61186","last_name":"Ghasemzadeh Mohammadi","first_name":"Hassan"},{"id":"64665","full_name":"Awais, Muhammad","last_name":"Awais","orcid":"https://orcid.org/0000-0003-4148-2969","first_name":"Muhammad"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"}],"title":"CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation","has_accepted_license":"1","publication_status":"accepted","year":"2018","page":"6","citation":{"ama":"Witschen LM, Wiersema T, Ghasemzadeh Mohammadi H, Awais M, Platzner M. CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation. <i>Third Workshop on Approximate Computing (AxC 2018)</i>.","ieee":"L. M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, and M. Platzner, “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation,” <i>Third Workshop on Approximate Computing (AxC 2018)</i>. .","chicago":"Witschen, Linus Matthias, Tobias Wiersema, Hassan Ghasemzadeh Mohammadi, Muhammad Awais, and Marco Platzner. “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation.” <i>Third Workshop on Approximate Computing (AxC 2018)</i>, n.d.","apa":"Witschen, L. M., Wiersema, T., Ghasemzadeh Mohammadi, H., Awais, M., &#38; Platzner, M. (n.d.). CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation. <i>Third Workshop on Approximate Computing (AxC 2018)</i>.","bibtex":"@article{Witschen_Wiersema_Ghasemzadeh Mohammadi_Awais_Platzner, title={CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation}, journal={Third Workshop on Approximate Computing (AxC 2018)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Ghasemzadeh Mohammadi, Hassan and Awais, Muhammad and Platzner, Marco} }","short":"L.M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, M. Platzner, Third Workshop on Approximate Computing (AxC 2018) (n.d.).","mla":"Witschen, Linus Matthias, et al. “CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation.” <i>Third Workshop on Approximate Computing (AxC 2018)</i>."},"_id":"3586","project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"department":[{"_id":"78"}],"user_id":"49051","keyword":["Approximate Computing","Framework","Pareto Front","Accuracy"],"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-07-20T14:13:31Z","publication":"Third Workshop on Approximate Computing (AxC 2018)","type":"preprint","abstract":[{"lang":"eng","text":"Existing approaches and tools for the generation of approximate circuits often lack generality and are restricted to certain circuit types, approximation techniques, and quality assurance methods. Moreover, only few tools are publicly available. This hinders the development and evaluation of new techniques for approximating circuits and their comparison to previous approaches. In this paper, we first analyze and classify related approaches and then present CIRCA, our flexible framework for search-based approximate circuit generation. CIRCA is developed with a focus on modularity and extensibility. We present the architecture of CIRCA with its clear separation into stages and functional blocks, report on the current prototype, and show initial experiments."}],"status":"public","file":[{"date_updated":"2018-07-20T14:13:31Z","date_created":"2018-07-20T14:13:31Z","creator":"tobias82","file_size":285348,"access_level":"closed","file_id":"3587","file_name":"WitschenWMAP2018.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}]},{"type":"conference","publication":"Proceedings of the 29th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)","abstract":[{"text":"In scientific computing, unstructured meshes are a crucial foundation for the simulation of real-world physical phenomena. Compared to regular grids, they allow resembling the computational domain with a much higher accuracy, which in turn leads to more efficient computations.<br />There exists a wealth of supporting libraries and frameworks that aid programmers with the implementation of applications working on such grids, each built on top of existing parallelization technologies. However, many approaches require the programmer to introduce a different programming paradigm into their application or provide different variants of the code. SYCL is a new programming standard providing a remedy to this dilemma by building on standard C ++17 with its so-called single-source approach: Programmers write standard C ++ code and expose parallelism using C++17 keywords. The application is<br />then transformed into a concrete implementation by the SYCL implementation. By encapsulating the OpenCL ecosystem, different SYCL implementations enable not only the programming of CPUs but also of heterogeneous platforms such as GPUs or other devices. For the first time, this paper showcases a SYCL-<br />based solver for the nodal Discontinuous Galerkin method for Maxwell’s equations on unstructured meshes. We compare our solution to a previous C-based implementation with respect to programmability and performance on heterogeneous platforms.<br","lang":"eng"}],"file":[{"date_updated":"2022-01-06T06:59:26Z","date_created":"2018-08-21T10:12:05Z","creator":"fossie","file_size":252186,"file_id":"3986","file_name":"2018-08 Afzal - ASAP Proceedings - Solving Maxwell equations with modern C++ and SYCL.pdf","embargo":"2019-09-03","access_level":"request","embargo_to":"open_access","content_type":"application/pdf","relation":"main_file"}],"status":"public","project":[{"_id":"33","name":"HighPerMeshes","grant_number":"01|H16005"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"3588","user_id":"158","department":[{"_id":"61"}],"ddc":["004"],"keyword":["tet_topic_hpc"],"language":[{"iso":"eng"}],"file_date_updated":"2022-01-06T06:59:26Z","publication_identifier":{"isbn":["978-1-5386-7479-6"]},"has_accepted_license":"1","year":"2018","citation":{"apa":"Afzal, A., Schmitt, C., Alhaddad, S., Grynko, Y., Teich, J., Förstner, J., &#38; Hannig, F. (2018). Solving Maxwell’s Equations with Modern C++ and SYCL: A Case Study. In <i>Proceedings of the 29th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)</i> (pp. 49–56). <a href=\"https://doi.org/10.1109/ASAP.2018.8445127\">https://doi.org/10.1109/ASAP.2018.8445127</a>","bibtex":"@inproceedings{Afzal_Schmitt_Alhaddad_Grynko_Teich_Förstner_Hannig_2018, title={Solving Maxwell’s Equations with Modern C++ and SYCL: A Case Study}, DOI={<a href=\"https://doi.org/10.1109/ASAP.2018.8445127\">10.1109/ASAP.2018.8445127</a>}, booktitle={Proceedings of the 29th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)}, author={Afzal, Ayesha and Schmitt, Christian and Alhaddad, Samer and Grynko, Yevgen and Teich, Jürgen and Förstner, Jens and Hannig, Frank}, year={2018}, pages={49–56} }","short":"A. Afzal, C. Schmitt, S. Alhaddad, Y. Grynko, J. Teich, J. Förstner, F. Hannig, in: Proceedings of the 29th Annual IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP), 2018, pp. 49–56.","mla":"Afzal, Ayesha, et al. “Solving Maxwell’s Equations with Modern C++ and SYCL: A Case Study.” <i>Proceedings of the 29th Annual IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP)</i>, 2018, pp. 49–56, doi:<a href=\"https://doi.org/10.1109/ASAP.2018.8445127\">10.1109/ASAP.2018.8445127</a>.","ieee":"A. Afzal <i>et al.</i>, “Solving Maxwell’s Equations with Modern C++ and SYCL: A Case Study,” in <i>Proceedings of the 29th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)</i>, 2018, pp. 49–56.","chicago":"Afzal, Ayesha, Christian Schmitt, Samer Alhaddad, Yevgen Grynko, Jürgen Teich, Jens Förstner, and Frank Hannig. “Solving Maxwell’s Equations with Modern C++ and SYCL: A Case Study.” In <i>Proceedings of the 29th Annual IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP)</i>, 49–56, 2018. <a href=\"https://doi.org/10.1109/ASAP.2018.8445127\">https://doi.org/10.1109/ASAP.2018.8445127</a>.","ama":"Afzal A, Schmitt C, Alhaddad S, et al. Solving Maxwell’s Equations with Modern C++ and SYCL: A Case Study. In: <i>Proceedings of the 29th Annual IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP)</i>. ; 2018:49-56. doi:<a href=\"https://doi.org/10.1109/ASAP.2018.8445127\">10.1109/ASAP.2018.8445127</a>"},"page":"49-56","date_updated":"2022-01-06T06:59:26Z","date_created":"2018-07-23T07:12:03Z","author":[{"last_name":"Afzal","full_name":"Afzal, Ayesha","first_name":"Ayesha"},{"first_name":"Christian","full_name":"Schmitt, Christian","last_name":"Schmitt"},{"first_name":"Samer","id":"42456","full_name":"Alhaddad, Samer","last_name":"Alhaddad"},{"last_name":"Grynko","id":"26059","full_name":"Grynko, Yevgen","first_name":"Yevgen"},{"last_name":"Teich","full_name":"Teich, Jürgen","first_name":"Jürgen"},{"id":"158","full_name":"Förstner, Jens","orcid":"0000-0001-7059-9862","last_name":"Förstner","first_name":"Jens"},{"last_name":"Hannig","full_name":"Hannig, Frank","first_name":"Frank"}],"title":"Solving Maxwell's Equations with Modern C++ and SYCL: A Case Study","doi":"10.1109/ASAP.2018.8445127"},{"has_accepted_license":"1","citation":{"chicago":"Witschen, Linus Matthias, Tobias Wiersema, and Marco Platzner. “Making the Case for Proof-Carrying Approximate Circuits.” <i>4th Workshop On Approximate Computing (WAPCO 2018)</i>, 2018.","ieee":"L. M. Witschen, T. Wiersema, and M. Platzner, “Making the Case for Proof-carrying Approximate Circuits,” <i>4th Workshop On Approximate Computing (WAPCO 2018)</i>. 2018.","ama":"Witschen LM, Wiersema T, Platzner M. Making the Case for Proof-carrying Approximate Circuits. <i>4th Workshop On Approximate Computing (WAPCO 2018)</i>. 2018.","bibtex":"@article{Witschen_Wiersema_Platzner_2018, title={Making the Case for Proof-carrying Approximate Circuits}, journal={4th Workshop On Approximate Computing (WAPCO 2018)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Platzner, Marco}, year={2018} }","mla":"Witschen, Linus Matthias, et al. “Making the Case for Proof-Carrying Approximate Circuits.” <i>4th Workshop On Approximate Computing (WAPCO 2018)</i>, 2018.","short":"L.M. Witschen, T. Wiersema, M. Platzner, 4th Workshop On Approximate Computing (WAPCO 2018) (2018).","apa":"Witschen, L. M., Wiersema, T., &#38; Platzner, M. (2018). Making the Case for Proof-carrying Approximate Circuits. <i>4th Workshop On Approximate Computing (WAPCO 2018)</i>."},"year":"2018","author":[{"first_name":"Linus Matthias","last_name":"Witschen","full_name":"Witschen, Linus Matthias","id":"49051"},{"last_name":"Wiersema","full_name":"Wiersema, Tobias","id":"3118","first_name":"Tobias"},{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"}],"date_created":"2018-02-01T14:24:54Z","date_updated":"2022-01-06T06:51:06Z","title":"Making the Case for Proof-carrying Approximate Circuits","type":"preprint","publication":"4th Workshop On Approximate Computing (WAPCO 2018)","file":[{"date_updated":"2018-11-26T08:00:53Z","date_created":"2018-11-26T08:00:53Z","creator":"tobias82","file_size":287224,"file_name":"WitschenWP2018[1].pdf","access_level":"closed","file_id":"5821","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","user_id":"49051","department":[{"_id":"7"},{"_id":"34"},{"_id":"78"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"1165","language":[{"iso":"eng"}],"file_date_updated":"2018-11-26T08:00:53Z","ddc":["000"]},{"ddc":["000"],"keyword":["Classification","Hierarchical Decomposition","Indirect Encoding"],"language":[{"iso":"eng"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018","abstract":[{"lang":"eng","text":"In multinomial classification, reduction techniques are commonly used to decompose the original learning problem into several simpler problems. For example, by recursively bisecting the original set of classes, so-called nested dichotomies define a set of binary classification problems that are organized in the structure of a binary tree. In contrast to the existing one-shot heuristics for constructing nested dichotomies and motivated by recent work on algorithm configuration, we propose a genetic algorithm for optimizing the structure of such dichotomies. A key component of this approach is the proposed genetic representation that facilitates the application of standard genetic operators, while still supporting the exchange of partial solutions under recombination. We evaluate the approach in an extensive experimental study, showing that it yields classifiers with superior generalization performance."}],"file":[{"file_size":875404,"file_id":"5275","file_name":"p561-wever.pdf","access_level":"closed","date_updated":"2018-11-02T14:33:54Z","creator":"ups","date_created":"2018-11-02T14:33:54Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"publisher":"ACM","date_created":"2018-03-31T13:51:23Z","title":"Ensembles of Evolved Nested Dichotomies for Classification","year":"2018","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"2109","user_id":"33176","department":[{"_id":"355"}],"file_date_updated":"2018-11-02T14:33:54Z","type":"conference","status":"public","date_updated":"2022-01-06T06:54:45Z","oa":"1","author":[{"first_name":"Marcel Dominik","full_name":"Wever, Marcel Dominik","id":"33176","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818"},{"first_name":"Felix","full_name":"Mohr, Felix","last_name":"Mohr"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"}],"main_file_link":[{"open_access":"1","url":"https://dl.acm.org/citation.cfm?doid=3205455.3205562"}],"doi":"10.1145/3205455.3205562","conference":{"start_date":"2018-07-15","name":"GECCO 2018","location":"Kyoto, Japan","end_date":"2018-07-19"},"publication_status":"published","has_accepted_license":"1","place":"Kyoto, Japan","citation":{"short":"M.D. Wever, F. Mohr, E. Hüllermeier, in: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018, ACM, Kyoto, Japan, 2018.","bibtex":"@inproceedings{Wever_Mohr_Hüllermeier_2018, place={Kyoto, Japan}, title={Ensembles of Evolved Nested Dichotomies for Classification}, DOI={<a href=\"https://doi.org/10.1145/3205455.3205562\">10.1145/3205455.3205562</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018}, publisher={ACM}, author={Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2018} }","mla":"Wever, Marcel Dominik, et al. “Ensembles of Evolved Nested Dichotomies for Classification.” <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3205455.3205562\">10.1145/3205455.3205562</a>.","apa":"Wever, M. D., Mohr, F., &#38; Hüllermeier, E. (2018). Ensembles of Evolved Nested Dichotomies for Classification. In <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>. Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/3205455.3205562\">https://doi.org/10.1145/3205455.3205562</a>","ama":"Wever MD, Mohr F, Hüllermeier E. Ensembles of Evolved Nested Dichotomies for Classification. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>. Kyoto, Japan: ACM; 2018. doi:<a href=\"https://doi.org/10.1145/3205455.3205562\">10.1145/3205455.3205562</a>","chicago":"Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “Ensembles of Evolved Nested Dichotomies for Classification.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>. Kyoto, Japan: ACM, 2018. <a href=\"https://doi.org/10.1145/3205455.3205562\">https://doi.org/10.1145/3205455.3205562</a>.","ieee":"M. D. Wever, F. Mohr, and E. Hüllermeier, “Ensembles of Evolved Nested Dichotomies for Classification,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>, Kyoto, Japan, 2018."}},{"type":"preprint","status":"public","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"user_id":"5786","_id":"17713","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"language":[{"iso":"eng"}],"citation":{"ama":"Wever MD, Mohr F, Hüllermeier E. Automated Multi-Label Classification based on ML-Plan. Published online 2018.","ieee":"M. D. Wever, F. Mohr, and E. Hüllermeier, “Automated Multi-Label Classification based on ML-Plan.” Arxiv, 2018.","chicago":"Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “Automated Multi-Label Classification Based on ML-Plan.” Arxiv, 2018.","bibtex":"@article{Wever_Mohr_Hüllermeier_2018, title={Automated Multi-Label Classification based on ML-Plan}, publisher={Arxiv}, author={Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2018} }","short":"M.D. Wever, F. Mohr, E. Hüllermeier, (2018).","mla":"Wever, Marcel Dominik, et al. <i>Automated Multi-Label Classification Based on ML-Plan</i>. Arxiv, 2018.","apa":"Wever, M. D., Mohr, F., &#38; Hüllermeier, E. (2018). <i>Automated Multi-Label Classification based on ML-Plan</i>. Arxiv."},"year":"2018","author":[{"full_name":"Wever, Marcel Dominik","id":"33176","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","first_name":"Marcel Dominik"},{"first_name":"Felix","last_name":"Mohr","full_name":"Mohr, Felix"},{"last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129","first_name":"Eyke"}],"date_created":"2020-08-07T11:38:10Z","oa":"1","publisher":"Arxiv","date_updated":"2022-01-06T06:53:17Z","main_file_link":[{"url":"https://arxiv.org/pdf/1811.04060.pdf","open_access":"1"}],"title":"Automated Multi-Label Classification based on ML-Plan"},{"status":"public","type":"preprint","language":[{"iso":"eng"}],"user_id":"5786","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"17714","citation":{"ama":"Mohr F, Wever MD, Hüllermeier E. Automated machine learning service composition. Published online 2018.","ieee":"F. Mohr, M. D. Wever, and E. Hüllermeier, “Automated machine learning service composition.” 2018.","chicago":"Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “Automated Machine Learning Service Composition,” 2018.","apa":"Mohr, F., Wever, M. D., &#38; Hüllermeier, E. (2018). <i>Automated machine learning service composition</i>.","bibtex":"@article{Mohr_Wever_Hüllermeier_2018, title={Automated machine learning service composition}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2018} }","short":"F. Mohr, M.D. Wever, E. Hüllermeier, (2018).","mla":"Mohr, Felix, et al. <i>Automated Machine Learning Service Composition</i>. 2018."},"year":"2018","main_file_link":[{"open_access":"1","url":"https://arxiv.org/pdf/1809.00486.pdf"}],"title":"Automated machine learning service composition","date_created":"2020-08-07T11:40:13Z","author":[{"first_name":"Felix","last_name":"Mohr","full_name":"Mohr, Felix"},{"first_name":"Marcel Dominik","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","id":"33176","full_name":"Wever, Marcel Dominik"},{"id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"}],"date_updated":"2022-01-06T06:53:17Z","oa":"1"},{"department":[{"_id":"9"},{"_id":"145"}],"user_id":"11029","_id":"23968","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"language":[{"iso":"eng"}],"type":"conference_abstract","status":"public","date_created":"2021-09-08T10:55:35Z","author":[{"full_name":"Zibart, Alexander","id":"11029","last_name":"Zibart","first_name":"Alexander"},{"last_name":"Kenig","full_name":"Kenig, Eugeny","id":"665","first_name":"Eugeny"}],"date_updated":"2022-01-06T06:56:04Z","conference":{"location":"Beijing, China","name":" International Heat Transfer Conference 16"},"doi":"10.1615/IHTC16.mpf.024081","title":"FALLING LIQUID FILM FLOW OVER THE WAVY SURFACE OF VERTICAL PILLOW PLATES − A NUMERICAL INVESTIGATION","citation":{"ama":"Zibart A, Kenig E. FALLING LIQUID FILM FLOW OVER THE WAVY SURFACE OF VERTICAL PILLOW PLATES − A NUMERICAL INVESTIGATION. In: ; 2018. doi:<a href=\"https://doi.org/10.1615/IHTC16.mpf.024081\">10.1615/IHTC16.mpf.024081</a>","ieee":"A. Zibart and E. Kenig, “FALLING LIQUID FILM FLOW OVER THE WAVY SURFACE OF VERTICAL PILLOW PLATES − A NUMERICAL INVESTIGATION,” presented at the  International Heat Transfer Conference 16, Beijing, China, 2018.","chicago":"Zibart, Alexander, and Eugeny Kenig. “FALLING LIQUID FILM FLOW OVER THE WAVY SURFACE OF VERTICAL PILLOW PLATES − A NUMERICAL INVESTIGATION,” 2018. <a href=\"https://doi.org/10.1615/IHTC16.mpf.024081\">https://doi.org/10.1615/IHTC16.mpf.024081</a>.","bibtex":"@inproceedings{Zibart_Kenig_2018, title={FALLING LIQUID FILM FLOW OVER THE WAVY SURFACE OF VERTICAL PILLOW PLATES − A NUMERICAL INVESTIGATION}, DOI={<a href=\"https://doi.org/10.1615/IHTC16.mpf.024081\">10.1615/IHTC16.mpf.024081</a>}, author={Zibart, Alexander and Kenig, Eugeny}, year={2018} }","mla":"Zibart, Alexander, and Eugeny Kenig. <i>FALLING LIQUID FILM FLOW OVER THE WAVY SURFACE OF VERTICAL PILLOW PLATES − A NUMERICAL INVESTIGATION</i>. 2018, doi:<a href=\"https://doi.org/10.1615/IHTC16.mpf.024081\">10.1615/IHTC16.mpf.024081</a>.","short":"A. Zibart, E. Kenig, in: 2018.","apa":"Zibart, A., &#38; Kenig, E. (2018). FALLING LIQUID FILM FLOW OVER THE WAVY SURFACE OF VERTICAL PILLOW PLATES − A NUMERICAL INVESTIGATION. Presented at the  International Heat Transfer Conference 16, Beijing, China. <a href=\"https://doi.org/10.1615/IHTC16.mpf.024081\">https://doi.org/10.1615/IHTC16.mpf.024081</a>"},"year":"2018"},{"title":"Numerische Untersuchung der gravitationsgetriebenen Filmströmung auf der welligen Oberfläche von Kissenplattenwärmeübertragern","conference":{"name":"Jahrestreffen der ProcessNet-Fachgruppe Wärme- und Stoffübertragung","location":"Bremen"},"date_updated":"2022-01-06T06:56:04Z","author":[{"id":"11029","full_name":"Zibart, Alexander","last_name":"Zibart","first_name":"Alexander"},{"first_name":"Eugeny","last_name":"Kenig","full_name":"Kenig, Eugeny","id":"665"}],"date_created":"2021-09-08T11:05:47Z","year":"2018","citation":{"ieee":"A. Zibart and E. Kenig, “Numerische Untersuchung der gravitationsgetriebenen Filmströmung auf der welligen Oberfläche von Kissenplattenwärmeübertragern,” presented at the Jahrestreffen der ProcessNet-Fachgruppe Wärme- und Stoffübertragung, Bremen, 2018.","chicago":"Zibart, Alexander, and Eugeny Kenig. “Numerische Untersuchung Der Gravitationsgetriebenen Filmströmung Auf Der Welligen Oberfläche von Kissenplattenwärmeübertragern,” 2018.","ama":"Zibart A, Kenig E. Numerische Untersuchung der gravitationsgetriebenen Filmströmung auf der welligen Oberfläche von Kissenplattenwärmeübertragern. In: ; 2018.","mla":"Zibart, Alexander, and Eugeny Kenig. <i>Numerische Untersuchung Der Gravitationsgetriebenen Filmströmung Auf Der Welligen Oberfläche von Kissenplattenwärmeübertragern</i>. 2018.","bibtex":"@inproceedings{Zibart_Kenig_2018, title={Numerische Untersuchung der gravitationsgetriebenen Filmströmung auf der welligen Oberfläche von Kissenplattenwärmeübertragern}, author={Zibart, Alexander and Kenig, Eugeny}, year={2018} }","short":"A. Zibart, E. Kenig, in: 2018.","apa":"Zibart, A., &#38; Kenig, E. (2018). Numerische Untersuchung der gravitationsgetriebenen Filmströmung auf der welligen Oberfläche von Kissenplattenwärmeübertragern. Presented at the Jahrestreffen der ProcessNet-Fachgruppe Wärme- und Stoffübertragung, Bremen."},"language":[{"iso":"eng"}],"project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"23971","user_id":"11029","department":[{"_id":"9"},{"_id":"145"}],"status":"public","type":"conference_abstract"}]