[{"editor":[{"first_name":"Stéphane ","last_name":"Devismes ","full_name":"Devismes , Stéphane "},{"first_name":"Neeraj ","full_name":"Mittal, Neeraj ","last_name":"Mittal"}],"status":"public","type":"conference","_id":"19899","department":[{"_id":"63"}],"user_id":"38705","series_title":"Lecture Notes in Computer Science (LNCS)","intvolume":"     12514","page":"65-80","citation":{"ama":"Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up. In: Devismes  S, Mittal N, eds. <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings</i>. Vol 12514. Lecture Notes in Computer Science (LNCS). Springer; 2020:65-80. doi:<a href=\"https://doi.org/10.1007/978-3-030-64348-5_6\">10.1007/978-3-030-64348-5_6</a>","chicago":"Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up.” In <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings</i>, edited by Stéphane  Devismes  and Neeraj  Mittal, 12514:65–80. Lecture Notes in Computer Science (LNCS). Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-64348-5_6\">https://doi.org/10.1007/978-3-030-64348-5_6</a>.","ieee":"J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up,” in <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings</i>, 2020, vol. 12514, pp. 65–80.","apa":"Castenow, J., Kling, P., Knollmann, T., &#38; Meyer auf der Heide, F. (2020). A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up. In S. Devismes  &#38; N. Mittal (Eds.), <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings</i> (Vol. 12514, pp. 65–80). Springer. <a href=\"https://doi.org/10.1007/978-3-030-64348-5_6\">https://doi.org/10.1007/978-3-030-64348-5_6</a>","short":"J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes , N. Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings, Springer, 2020, pp. 65–80.","bibtex":"@inproceedings{Castenow_Kling_Knollmann_Meyer auf der Heide_2020, series={Lecture Notes in Computer Science (LNCS)}, title={A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up}, volume={12514}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-64348-5_6\">10.1007/978-3-030-64348-5_6</a>}, booktitle={Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings}, publisher={Springer}, author={Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Devismes , Stéphane  and Mittal, Neeraj Editors}, year={2020}, pages={65–80}, collection={Lecture Notes in Computer Science (LNCS)} }","mla":"Castenow, Jannik, et al. “A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up.” <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings</i>, edited by Stéphane  Devismes  and Neeraj  Mittal, vol. 12514, Springer, 2020, pp. 65–80, doi:<a href=\"https://doi.org/10.1007/978-3-030-64348-5_6\">10.1007/978-3-030-64348-5_6</a>."},"publication_identifier":{"isbn":["978-3-030-64347-8"]},"publication_status":"published","doi":"10.1007/978-3-030-64348-5_6","date_updated":"2022-01-06T06:54:14Z","volume":12514,"author":[{"last_name":"Castenow","id":"38705","full_name":"Castenow, Jannik","first_name":"Jannik"},{"first_name":"Peter","last_name":"Kling","full_name":"Kling, Peter"},{"first_name":"Till","full_name":"Knollmann, Till","id":"39241","orcid":"0000-0003-2014-4696","last_name":"Knollmann"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"abstract":[{"lang":"eng","text":"Most existing robot formation problems seek a target formation of a certain\r\nminimal and, thus, efficient structure. Examples include the Gathering\r\nand the Chain-Formation problem. In this work, we study formation problems that\r\ntry to reach a maximal structure, supporting for example an efficient\r\ncoverage in exploration scenarios. A recent example is the NASA Shapeshifter\r\nproject, which describes how the robots form a relay chain along which gathered\r\ndata from extraterrestrial cave explorations may be sent to a home base.\r\n  As a first step towards understanding such maximization tasks, we introduce\r\nand study the Max-Chain-Formation problem, where $n$ robots are ordered along a\r\nwinding, potentially self-intersecting chain and must form a connected,\r\nstraight line of maximal length connecting its two endpoints. We propose and\r\nanalyze strategies in a discrete and in a continuous time model. In the\r\ndiscrete case, we give a complete analysis if all robots are initially\r\ncollinear, showing that the worst-case time to reach an\r\n$\\varepsilon$-approximation is upper bounded by $\\mathcal{O}(n^2 \\cdot \\log\r\n(n/\\varepsilon))$ and lower bounded by $\\Omega(n^2 \\cdot~\\log\r\n(1/\\varepsilon))$. If one endpoint of the chain remains stationary, this result\r\ncan be extended to the non-collinear case. If both endpoints move, we identify\r\na family of instances whose runtime is unbounded. For the continuous model, we\r\ngive a strategy with an optimal runtime bound of $\\Theta(n)$. Avoiding an\r\nunbounded runtime similar to the discrete case relies crucially on a\r\ncounter-intuitive aspect of the strategy: slowing down the endpoints while all\r\nother robots move at full speed. Surprisingly, we can show that a similar trick\r\ndoes not work in the discrete model."}],"publication":"Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings","language":[{"iso":"eng"}],"external_id":{"arxiv":["2010.02043 "]},"year":"2020","title":"A Discrete and Continuous Study of the Max-Chain-Formation Problem – Slow Down to Speed Up","publisher":"Springer","date_created":"2020-10-06T07:27:10Z"},{"status":"public","abstract":[{"text":"We show that symplectic integrators preserve bifurcations of Hamiltonian boundary value problems and that nonsymplectic integrators do not. We provide a universal description of the breaking of umbilic bifurcations by nonysmplectic integrators. We discover extra structure induced from certain types of boundary value problems, including classical Dirichlet problems, that is useful to locate bifurcations. Geodesics connecting two points are an example of a Hamiltonian boundary value problem, and we introduce the jet-RATTLE method, a symplectic integrator that easily computes geodesics and their bifurcations. Finally, we study the periodic pitchfork bifurcation, a codimension-1 bifurcation arising in integrable Hamiltonian systems. It is not preserved by either symplectic on nonsymplectic integrators, but in some circumstances symplecticity greatly reduces the error. ","lang":"eng"}],"type":"journal_article","publication":"Foundations of Computational Mathematics","extern":"1","language":[{"iso":"eng"}],"article_type":"original","user_id":"85279","department":[{"_id":"636"}],"_id":"19938","citation":{"ama":"McLachlan RI, Offen C. Preservation of Bifurcations of Hamiltonian Boundary Value Problems Under Discretisation. <i>Foundations of Computational Mathematics</i>. 2020;20(6):1363-1400. doi:<a href=\"https://doi.org/10.1007/s10208-020-09454-z\">10.1007/s10208-020-09454-z</a>","chicago":"McLachlan, Robert I, and Christian Offen. “Preservation of Bifurcations of Hamiltonian Boundary Value Problems Under Discretisation.” <i>Foundations of Computational Mathematics</i> 20, no. 6 (2020): 1363–1400. <a href=\"https://doi.org/10.1007/s10208-020-09454-z\">https://doi.org/10.1007/s10208-020-09454-z</a>.","ieee":"R. I. McLachlan and C. Offen, “Preservation of Bifurcations of Hamiltonian Boundary Value Problems Under Discretisation,” <i>Foundations of Computational Mathematics</i>, vol. 20, no. 6, pp. 1363–1400, 2020.","apa":"McLachlan, R. I., &#38; Offen, C. (2020). Preservation of Bifurcations of Hamiltonian Boundary Value Problems Under Discretisation. <i>Foundations of Computational Mathematics</i>, <i>20</i>(6), 1363–1400. <a href=\"https://doi.org/10.1007/s10208-020-09454-z\">https://doi.org/10.1007/s10208-020-09454-z</a>","mla":"McLachlan, Robert I., and Christian Offen. “Preservation of Bifurcations of Hamiltonian Boundary Value Problems Under Discretisation.” <i>Foundations of Computational Mathematics</i>, vol. 20, no. 6, 2020, pp. 1363–400, doi:<a href=\"https://doi.org/10.1007/s10208-020-09454-z\">10.1007/s10208-020-09454-z</a>.","bibtex":"@article{McLachlan_Offen_2020, title={Preservation of Bifurcations of Hamiltonian Boundary Value Problems Under Discretisation}, volume={20}, DOI={<a href=\"https://doi.org/10.1007/s10208-020-09454-z\">10.1007/s10208-020-09454-z</a>}, number={6}, journal={Foundations of Computational Mathematics}, author={McLachlan, Robert I and Offen, Christian}, year={2020}, pages={1363–1400} }","short":"R.I. McLachlan, C. Offen, Foundations of Computational Mathematics 20 (2020) 1363–1400."},"page":"1363-1400","intvolume":"        20","year":"2020","issue":"6","publication_status":"published","main_file_link":[{"url":"https://rdcu.be/b79aB"}],"doi":"10.1007/s10208-020-09454-z","title":"Preservation of Bifurcations of Hamiltonian Boundary Value Problems Under Discretisation","author":[{"last_name":"McLachlan","full_name":"McLachlan, Robert I","first_name":"Robert I"},{"first_name":"Christian","full_name":"Offen, Christian","id":"85279","last_name":"Offen","orcid":"https://orcid.org/0000-0002-5940-8057"}],"date_created":"2020-10-06T16:31:46Z","volume":20,"date_updated":"2022-01-06T06:54:14Z"},{"issue":"5","year":"2020","date_created":"2020-10-06T16:32:04Z","title":"Detection of high codimensional bifurcations in variational PDEs","publication":"Nonlinearity","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0951-7715","1361-6544"]},"publication_status":"published","intvolume":"        33","page":"2335-2363","citation":{"apa":"Kreusser, L. M., McLachlan, R. I., &#38; Offen, C. (2020). Detection of high codimensional bifurcations in variational PDEs. <i>Nonlinearity</i>, <i>33</i>(5), 2335–2363. <a href=\"https://doi.org/10.1088/1361-6544/ab7293\">https://doi.org/10.1088/1361-6544/ab7293</a>","short":"L.M. Kreusser, R.I. McLachlan, C. Offen, Nonlinearity 33 (2020) 2335–2363.","bibtex":"@article{Kreusser_McLachlan_Offen_2020, title={Detection of high codimensional bifurcations in variational PDEs}, volume={33}, DOI={<a href=\"https://doi.org/10.1088/1361-6544/ab7293\">10.1088/1361-6544/ab7293</a>}, number={5}, journal={Nonlinearity}, author={Kreusser, Lisa Maria and McLachlan, Robert I and Offen, Christian}, year={2020}, pages={2335–2363} }","mla":"Kreusser, Lisa Maria, et al. “Detection of High Codimensional Bifurcations in Variational PDEs.” <i>Nonlinearity</i>, vol. 33, no. 5, 2020, pp. 2335–63, doi:<a href=\"https://doi.org/10.1088/1361-6544/ab7293\">10.1088/1361-6544/ab7293</a>.","ieee":"L. M. Kreusser, R. I. McLachlan, and C. Offen, “Detection of high codimensional bifurcations in variational PDEs,” <i>Nonlinearity</i>, vol. 33, no. 5, pp. 2335–2363, 2020.","chicago":"Kreusser, Lisa Maria, Robert I McLachlan, and Christian Offen. “Detection of High Codimensional Bifurcations in Variational PDEs.” <i>Nonlinearity</i> 33, no. 5 (2020): 2335–63. <a href=\"https://doi.org/10.1088/1361-6544/ab7293\">https://doi.org/10.1088/1361-6544/ab7293</a>.","ama":"Kreusser LM, McLachlan RI, Offen C. Detection of high codimensional bifurcations in variational PDEs. <i>Nonlinearity</i>. 2020;33(5):2335-2363. doi:<a href=\"https://doi.org/10.1088/1361-6544/ab7293\">10.1088/1361-6544/ab7293</a>"},"volume":33,"author":[{"full_name":"Kreusser, Lisa Maria","last_name":"Kreusser","first_name":"Lisa Maria"},{"first_name":"Robert I","last_name":"McLachlan","full_name":"McLachlan, Robert I"},{"id":"85279","full_name":"Offen, Christian","last_name":"Offen","orcid":"https://orcid.org/0000-0002-5940-8057","first_name":"Christian"}],"date_updated":"2022-01-06T06:54:14Z","oa":"1","doi":"10.1088/1361-6544/ab7293","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1088/1361-6544/ab7293"}],"type":"journal_article","status":"public","department":[{"_id":"636"}],"user_id":"85279","_id":"19939","extern":"1","article_type":"original"},{"language":[{"iso":"eng"}],"ddc":["510"],"file":[{"date_updated":"2020-10-07T14:01:58Z","date_created":"2020-10-06T18:54:53Z","creator":"coffen","description":"A thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in\nMathematics at Massey University, Manawatū, New Zealand.","file_size":19465740,"title":"Thesis Christian Offen","file_id":"19948","access_level":"open_access","file_name":"ths_all_signatures.pdf","content_type":"application/pdf","relation":"main_file"}],"abstract":[{"text":"Ordinary differential equations (ODEs) and partial differential equations (PDEs) arise\r\nin most scientific disciplines that make use of mathematical techniques. As exact solutions are in general not computable, numerical methods are used to obtain approximate\r\nsolutions. In order to draw valid conclusions from numerical computations, it is crucial\r\nto understand which qualitative aspects numerical solutions have in common with the\r\nexact solution. Symplecticity is a subtle notion that is related to a rich family of geometric properties of Hamiltonian systems. While the effects of preserving symplecticity\r\nunder discretisation on long-term behaviour of motions is classically well known, in this\r\nthesis\r\n(a) the role of symplecticity for the bifurcation behaviour of solutions to Hamiltonian\r\nboundary value problems is explained. In parameter dependent systems at a bifurcation\r\npoint the solution set to a boundary value problem changes qualitatively. Bifurcation\r\nproblems are systematically translated into the framework of classical catastrophe theory. It is proved that existing classification results in catastrophe theory apply to\r\npersistent bifurcations of Hamiltonian boundary value problems. Further results for\r\nsymmetric settings are derived.\r\n(b) It is proved that to preserve generic bifurcations under discretisation it is necessary and sufficient to preserve the symplectic structure of the problem.\r\n(c) The catastrophe theory framework for Hamiltonian ODEs is extended to PDEs\r\nwith variational structure. Recognition equations for A-series singularities for functionals on Banach spaces are derived and used in a numerical example to locate high-codimensional bifurcations.\r\n(d) The potential of symplectic integration for infinite-dimensional Lie-Poisson systems (Burgers’ equation, KdV, fluid equations, . . . ) using Clebsch variables is analysed.\r\nIt is shown that the advantages of symplectic integration can outweigh the disadvantages of integrating over a larger phase space introduced by a Clebsch representation.\r\n(e) Finally, the preservation of variational structure of symmetric solutions in multisymplectic PDEs by multisymplectic integrators on the example of (phase-rotating)\r\ntravelling waves in the nonlinear wave equation is discussed.","lang":"eng"}],"title":"Analysis of Hamiltonian boundary value problems and symplectic integration","date_created":"2020-10-06T18:56:44Z","publisher":"Massey University","year":"2020","extern":"1","file_date_updated":"2020-10-07T14:01:58Z","alternative_title":["A thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Mathematics at Massey University, Manawatū, New Zealand."],"user_id":"85279","_id":"19947","status":"public","type":"dissertation","main_file_link":[{"url":"https://hdl.handle.net/10179/16155","open_access":"1"}],"author":[{"first_name":"Christian","id":"85279","full_name":"Offen, Christian","orcid":"https://orcid.org/0000-0002-5940-8057","last_name":"Offen"}],"supervisor":[{"first_name":"Robert I","last_name":"McLachlan","full_name":"McLachlan, Robert I"}],"date_updated":"2022-01-06T06:54:16Z","oa":"1","citation":{"mla":"Offen, Christian. <i>Analysis of Hamiltonian Boundary Value Problems and Symplectic Integration</i>. Massey University, 2020.","bibtex":"@book{Offen_2020, place={Palmerston North, New Zealand}, title={Analysis of Hamiltonian boundary value problems and symplectic integration}, publisher={Massey University}, author={Offen, Christian}, year={2020} }","short":"C. Offen, Analysis of Hamiltonian Boundary Value Problems and Symplectic Integration, Massey University, Palmerston North, New Zealand, 2020.","apa":"Offen, C. (2020). <i>Analysis of Hamiltonian boundary value problems and symplectic integration</i>. Palmerston North, New Zealand: Massey University.","chicago":"Offen, Christian. <i>Analysis of Hamiltonian Boundary Value Problems and Symplectic Integration</i>. Palmerston North, New Zealand: Massey University, 2020.","ieee":"C. Offen, <i>Analysis of Hamiltonian boundary value problems and symplectic integration</i>. Palmerston North, New Zealand: Massey University, 2020.","ama":"Offen C. <i>Analysis of Hamiltonian Boundary Value Problems and Symplectic Integration</i>. Palmerston North, New Zealand: Massey University; 2020."},"place":"Palmerston North, New Zealand","has_accepted_license":"1","publication_status":"published"},{"title":"A Novel Higher-order Weisfeiler-Lehman Graph Convolution","publisher":"PMLR","date_created":"2020-10-08T10:48:38Z","year":"2020","quality_controlled":"1","keyword":["graph neural networks","Weisfeiler-Lehman test","cycle detection"],"ddc":["006"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["2007.00346"]},"abstract":[{"lang":"eng","text":"Current GNN architectures use a vertex neighborhood aggregation scheme, which limits their discriminative power to that of the 1-dimensional Weisfeiler-Lehman (WL) graph isomorphism test. Here, we propose a novel graph convolution operator that is based on the 2-dimensional WL test. We formally show that the resulting 2-WL-GNN architecture is more discriminative than existing GNN approaches. This theoretical result is complemented by experimental studies using synthetic and real data. On multiple common graph classification benchmarks, we demonstrate that the proposed model is competitive with state-of-the-art graph kernels and GNNs."}],"file":[{"file_id":"19954","file_name":"damke20.pdf","access_level":"open_access","file_size":771137,"date_created":"2020-10-08T10:54:48Z","creator":"cdamke","date_updated":"2020-10-08T11:21:00Z","relation":"main_file","content_type":"application/pdf"},{"relation":"supplementary_material","content_type":"application/pdf","file_size":613163,"file_name":"damke20-supp.pdf","access_level":"open_access","file_id":"19955","date_updated":"2020-10-08T11:24:29Z","date_created":"2020-10-08T10:54:59Z","creator":"cdamke"}],"publication":"Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)","conference":{"name":"Asian Conference on Machine Learning","start_date":"2020-11-18","end_date":"2020-11-20","location":"Bangkok, Thailand"},"date_updated":"2022-01-06T06:54:17Z","oa":"1","volume":129,"author":[{"first_name":"Clemens","full_name":"Damke, Clemens","id":"48192","last_name":"Damke","orcid":"0000-0002-0455-0048"},{"first_name":"Vitaly","last_name":"Melnikov","full_name":"Melnikov, Vitaly","id":"58747"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier"}],"place":"Bangkok, Thailand","intvolume":"       129","page":"49-64","citation":{"apa":"Damke, C., Melnikov, V., &#38; Hüllermeier, E. (2020). A Novel Higher-order Weisfeiler-Lehman Graph Convolution. In S. Jialin Pan &#38; M. Sugiyama (Eds.), <i>Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)</i> (Vol. 129, pp. 49–64). Bangkok, Thailand: PMLR.","short":"C. Damke, V. Melnikov, E. Hüllermeier, in: S. Jialin Pan, M. Sugiyama (Eds.), Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020), PMLR, Bangkok, Thailand, 2020, pp. 49–64.","bibtex":"@inproceedings{Damke_Melnikov_Hüllermeier_2020, place={Bangkok, Thailand}, series={Proceedings of Machine Learning Research}, title={A Novel Higher-order Weisfeiler-Lehman Graph Convolution}, volume={129}, booktitle={Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)}, publisher={PMLR}, author={Damke, Clemens and Melnikov, Vitaly and Hüllermeier, Eyke}, editor={Jialin Pan, Sinno and Sugiyama, MasashiEditors}, year={2020}, pages={49–64}, collection={Proceedings of Machine Learning Research} }","mla":"Damke, Clemens, et al. “A Novel Higher-Order Weisfeiler-Lehman Graph Convolution.” <i>Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)</i>, edited by Sinno Jialin Pan and Masashi Sugiyama, vol. 129, PMLR, 2020, pp. 49–64.","ieee":"C. Damke, V. Melnikov, and E. Hüllermeier, “A Novel Higher-order Weisfeiler-Lehman Graph Convolution,” in <i>Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)</i>, Bangkok, Thailand, 2020, vol. 129, pp. 49–64.","chicago":"Damke, Clemens, Vitaly Melnikov, and Eyke Hüllermeier. “A Novel Higher-Order Weisfeiler-Lehman Graph Convolution.” In <i>Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)</i>, edited by Sinno Jialin Pan and Masashi Sugiyama, 129:49–64. Proceedings of Machine Learning Research. Bangkok, Thailand: PMLR, 2020.","ama":"Damke C, Melnikov V, Hüllermeier E. A Novel Higher-order Weisfeiler-Lehman Graph Convolution. In: Jialin Pan S, Sugiyama M, eds. <i>Proceedings of the 12th Asian Conference on Machine Learning (ACML 2020)</i>. Vol 129. Proceedings of Machine Learning Research. Bangkok, Thailand: PMLR; 2020:49-64."},"has_accepted_license":"1","publication_status":"published","file_date_updated":"2020-10-08T11:24:29Z","_id":"19953","department":[{"_id":"355"}],"series_title":"Proceedings of Machine Learning Research","user_id":"48192","editor":[{"full_name":"Jialin Pan, Sinno","last_name":"Jialin Pan","first_name":"Sinno"},{"full_name":"Sugiyama, Masashi","last_name":"Sugiyama","first_name":"Masashi"}],"status":"public","type":"conference"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"_id":"19999","user_id":"477","department":[{"_id":"7"},{"_id":"77"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","date_updated":"2022-01-06T06:54:18Z","publisher":"Universität Paderborn","author":[{"full_name":"Mayer, Stefan","last_name":"Mayer","first_name":"Stefan"}],"date_created":"2020-10-15T05:15:46Z","supervisor":[{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"title":"Optimierung von JMCTest beim Testen von Inter Method Contracts","year":"2020","citation":{"ama":"Mayer S. <i>Optimierung von JMCTest Beim Testen von Inter Method Contracts</i>. Universität Paderborn; 2020.","ieee":"S. Mayer, <i>Optimierung von JMCTest beim Testen von Inter Method Contracts</i>. Universität Paderborn, 2020.","chicago":"Mayer, Stefan. <i>Optimierung von JMCTest Beim Testen von Inter Method Contracts</i>. Universität Paderborn, 2020.","apa":"Mayer, S. (2020). <i>Optimierung von JMCTest beim Testen von Inter Method Contracts</i>. Universität Paderborn.","bibtex":"@book{Mayer_2020, title={Optimierung von JMCTest beim Testen von Inter Method Contracts}, publisher={Universität Paderborn}, author={Mayer, Stefan}, year={2020} }","short":"S. Mayer, Optimierung von JMCTest Beim Testen von Inter Method Contracts, Universität Paderborn, 2020.","mla":"Mayer, Stefan. <i>Optimierung von JMCTest Beim Testen von Inter Method Contracts</i>. Universität Paderborn, 2020."}},{"citation":{"bibtex":"@inproceedings{Nouri_Wachsmuth_Engels, title={Mining Crowdsourcing Problems from Discussion Forums of Workers}, booktitle={Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics}, author={Nouri, Zahra and Wachsmuth, Henning and Engels, Gregor}, pages={6264–6276} }","short":"Z. Nouri, H. Wachsmuth, G. Engels, in: Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics, n.d., pp. 6264–6276.","mla":"Nouri, Zahra, et al. “Mining Crowdsourcing Problems from Discussion Forums of Workers.” <i>Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics</i>, pp. 6264–76.","apa":"Nouri, Z., Wachsmuth, H., &#38; Engels, G. (n.d.). Mining Crowdsourcing Problems from Discussion Forums of Workers. In <i>Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics</i> (pp. 6264–6276). Barcelona, Spain.","ieee":"Z. Nouri, H. Wachsmuth, and G. Engels, “Mining Crowdsourcing Problems from Discussion Forums of Workers,” in <i>Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics</i>, Barcelona, Spain, pp. 6264–6276.","chicago":"Nouri, Zahra, Henning Wachsmuth, and Gregor Engels. “Mining Crowdsourcing Problems from Discussion Forums of Workers.” In <i>Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics</i>, 6264–76, n.d.","ama":"Nouri Z, Wachsmuth H, Engels G. Mining Crowdsourcing Problems from Discussion Forums of Workers. In: <i>Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics</i>. ; :6264-6276."},"page":"6264-6276","year":"2020","publication_status":"accepted","has_accepted_license":"1","conference":{"start_date":"2020-12-08","name":"The 28th International Conference on Computational Linguistics","location":"Barcelona, Spain","end_date":"2020-12-13"},"title":"Mining Crowdsourcing Problems from Discussion Forums of Workers","date_created":"2020-10-18T12:21:34Z","author":[{"first_name":"Zahra","last_name":"Nouri","full_name":"Nouri, Zahra","id":"35802"},{"first_name":"Henning","full_name":"Wachsmuth, Henning","id":"3900","last_name":"Wachsmuth"},{"first_name":"Gregor","full_name":"Engels, Gregor","id":"107","last_name":"Engels"}],"date_updated":"2022-01-06T06:54:19Z","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"znouri","date_created":"2020-11-10T14:25:56Z","date_updated":"2020-11-10T14:25:56Z","file_name":"Mining Crowdsourcing Problems from Discussion Forums of Workers.pdf","access_level":"closed","file_id":"20334","file_size":610246}],"status":"public","type":"conference","publication":"Proceedings of COLING 2020, the 28th International Conference on Computational Linguistics","language":[{"iso":"eng"}],"file_date_updated":"2020-11-10T14:25:56Z","ddc":["000"],"user_id":"82920","department":[{"_id":"600"}],"_id":"20116"},{"year":"2020","citation":{"ama":"El Baff R, Al-Khatib K, Stein B, Wachsmuth H. Persuasiveness of News Editorials depending on Ideology and Personality. In: <i>Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)</i>. ; 2020:29-40.","ieee":"R. El Baff, K. Al-Khatib, B. Stein, and H. Wachsmuth, “Persuasiveness of News Editorials depending on Ideology and Personality,” in <i>Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)</i>, 2020, pp. 29–40.","chicago":"El Baff, Roxanne, Khalid Al-Khatib, Benno Stein, and Henning Wachsmuth. “Persuasiveness of News Editorials Depending on Ideology and Personality.” In <i>Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)</i>, 29–40, 2020.","apa":"El Baff, R., Al-Khatib, K., Stein, B., &#38; Wachsmuth, H. (2020). Persuasiveness of News Editorials depending on Ideology and Personality. In <i>Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)</i> (pp. 29–40).","bibtex":"@inproceedings{El Baff_Al-Khatib_Stein_Wachsmuth_2020, title={Persuasiveness of News Editorials depending on Ideology and Personality}, booktitle={Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)}, author={El Baff, Roxanne and Al-Khatib, Khalid and Stein, Benno and Wachsmuth, Henning}, year={2020}, pages={29–40} }","mla":"El Baff, Roxanne, et al. “Persuasiveness of News Editorials Depending on Ideology and Personality.” <i>Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)</i>, 2020, pp. 29–40.","short":"R. El Baff, K. Al-Khatib, B. Stein, H. Wachsmuth, in: Third Workshop on Computational Modeling of People’s Opinions, Personality, and Emotions in Social Media (PEOPLES 2020), 2020, pp. 29–40."},"page":"29-40","title":"Persuasiveness of News Editorials depending on Ideology and Personality","main_file_link":[{"url":"https://www.aclweb.org/anthology/2020.peoples-1.4.pdf"}],"date_updated":"2022-01-06T06:54:20Z","date_created":"2020-10-19T08:49:05Z","author":[{"first_name":"Roxanne","last_name":"El Baff","full_name":"El Baff, Roxanne"},{"first_name":"Khalid","last_name":"Al-Khatib","full_name":"Al-Khatib, Khalid"},{"first_name":"Benno","last_name":"Stein","full_name":"Stein, Benno"},{"first_name":"Henning","id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth"}],"status":"public","type":"conference","publication":"Third Workshop on Computational Modeling of People's Opinions, Personality, and Emotions in Social Media (PEOPLES 2020)","language":[{"iso":"eng"}],"_id":"20122","user_id":"82920","department":[{"_id":"600"}]},{"type":"book_chapter","publication":"Deutsch Digital. Band 1 Theorie (2. Aufl.)","status":"public","editor":[{"last_name":"Knopf","full_name":"Knopf, Julia","first_name":"Julia"},{"first_name":"Ulf","last_name":"Abraham","full_name":"Abraham, Ulf"}],"user_id":"35771","_id":"20123","language":[{"iso":"ger"}],"publication_identifier":{"isbn":["978-3-8340-2048-2"]},"citation":{"chicago":"Herzig, Bardo, Alexander Martin, and Tilman-Mathies Klar. “Mobile Medien – Medienpädagogische und technische Grundlagen, Potential für den Deutschunterricht und Beispiele.” In <i>Deutsch Digital. Band 1 Theorie (2. Aufl.)</i>, edited by Julia Knopf and Ulf Abraham, 108–35, 2020.","ieee":"B. Herzig, A. Martin, and T.-M. Klar, “Mobile Medien – Medienpädagogische und technische Grundlagen, Potential für den Deutschunterricht und Beispiele.,” in <i>Deutsch Digital. Band 1 Theorie (2. Aufl.)</i>, J. Knopf and U. Abraham, Eds. 2020, pp. 108–135.","ama":"Herzig B, Martin A, Klar T-M. Mobile Medien – Medienpädagogische und technische Grundlagen, Potential für den Deutschunterricht und Beispiele. In: Knopf J, Abraham U, eds. <i>Deutsch Digital. Band 1 Theorie (2. Aufl.)</i>. ; 2020:108-135.","bibtex":"@inbook{Herzig_Martin_Klar_2020, title={Mobile Medien – Medienpädagogische und technische Grundlagen, Potential für den Deutschunterricht und Beispiele.}, booktitle={Deutsch Digital. Band 1 Theorie (2. Aufl.)}, author={Herzig, Bardo and Martin, Alexander and Klar, Tilman-Mathies}, editor={Knopf, Julia and Abraham, UlfEditors}, year={2020}, pages={108–135} }","mla":"Herzig, Bardo, et al. “Mobile Medien – Medienpädagogische und technische Grundlagen, Potential für den Deutschunterricht und Beispiele.” <i>Deutsch Digital. Band 1 Theorie (2. Aufl.)</i>, edited by Julia Knopf and Ulf Abraham, 2020, pp. 108–35.","short":"B. Herzig, A. Martin, T.-M. Klar, in: J. Knopf, U. Abraham (Eds.), Deutsch Digital. Band 1 Theorie (2. Aufl.), 2020, pp. 108–135.","apa":"Herzig, B., Martin, A., &#38; Klar, T.-M. (2020). Mobile Medien – Medienpädagogische und technische Grundlagen, Potential für den Deutschunterricht und Beispiele. In J. Knopf &#38; U. Abraham (Eds.), <i>Deutsch Digital. Band 1 Theorie (2. Aufl.)</i> (pp. 108–135)."},"page":"108-135","year":"2020","author":[{"first_name":"Bardo","full_name":"Herzig, Bardo","last_name":"Herzig"},{"first_name":"Alexander","full_name":"Martin, Alexander","last_name":"Martin"},{"full_name":"Klar, Tilman-Mathies","id":"35771","last_name":"Klar","first_name":"Tilman-Mathies"}],"date_created":"2020-10-19T12:48:19Z","date_updated":"2022-01-06T06:54:20Z","title":"Mobile Medien – Medienpädagogische und technische Grundlagen, Potential für den Deutschunterricht und Beispiele."},{"page":"22-26","citation":{"mla":"Kundisch, Dennis, and Daniel Beverungen. <i>Als Wirtschaftsinformatiker die digitale Transformation in Organisationen gestalten</i>. 2020, pp. 22–26.","short":"D. Kundisch, D. Beverungen, Als Wirtschaftsinformatiker die digitale Transformation in Organisationen gestalten, Martin, Slovakia, 2020.","bibtex":"@book{Kundisch_Beverungen_2020, place={Martin, Slovakia}, series={Traumjob IT - Durchstarten leicht gemacht 2021, e-fellows.net}, title={Als Wirtschaftsinformatiker die digitale Transformation in Organisationen gestalten}, author={Kundisch, Dennis and Beverungen, Daniel}, year={2020}, pages={22–26}, collection={Traumjob IT - Durchstarten leicht gemacht 2021, e-fellows.net} }","apa":"Kundisch, D., &#38; Beverungen, D. (2020). <i>Als Wirtschaftsinformatiker die digitale Transformation in Organisationen gestalten</i> (pp. 22–26). Martin, Slovakia.","chicago":"Kundisch, Dennis, and Daniel Beverungen. <i>Als Wirtschaftsinformatiker die digitale Transformation in Organisationen gestalten</i>. Traumjob IT - Durchstarten leicht gemacht 2021, e-fellows.net. Martin, Slovakia, 2020.","ieee":"D. Kundisch and D. Beverungen, <i>Als Wirtschaftsinformatiker die digitale Transformation in Organisationen gestalten</i>. Martin, Slovakia, 2020, pp. 22–26.","ama":"Kundisch D, Beverungen D. <i>Als Wirtschaftsinformatiker die digitale Transformation in Organisationen gestalten</i>. Martin, Slovakia; 2020:22-26."},"year":"2020","place":"Martin, Slovakia","author":[{"id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis"},{"full_name":"Beverungen, Daniel","id":"59677","last_name":"Beverungen","first_name":"Daniel"}],"date_created":"2020-10-20T11:04:14Z","date_updated":"2022-01-06T06:54:20Z","title":"Als Wirtschaftsinformatiker die digitale Transformation in Organisationen gestalten","type":"report","status":"public","department":[{"_id":"276"}],"user_id":"16205","series_title":"Traumjob IT - Durchstarten leicht gemacht 2021, e-fellows.net","_id":"20131","language":[{"iso":"ger"}]},{"year":"2020","page":"76-87","citation":{"short":"M. Spliethöver, H. Wachsmuth, in: Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020), 2020, pp. 76–87.","bibtex":"@inproceedings{Spliethöver_Wachsmuth_2020, title={Argument from Old Man’s View: Assessing Social Bias in Argumentation}, booktitle={Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)}, author={Spliethöver, Maximilian and Wachsmuth, Henning}, year={2020}, pages={76–87} }","mla":"Spliethöver, Maximilian, and Henning Wachsmuth. “Argument from Old Man’s View: Assessing Social Bias in Argumentation.” <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>, 2020, pp. 76–87.","apa":"Spliethöver, M., &#38; Wachsmuth, H. (2020). Argument from Old Man’s View: Assessing Social Bias in Argumentation. In <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i> (pp. 76–87).","chicago":"Spliethöver, Maximilian, and Henning Wachsmuth. “Argument from Old Man’s View: Assessing Social Bias in Argumentation.” In <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>, 76–87, 2020.","ieee":"M. Spliethöver and H. Wachsmuth, “Argument from Old Man’s View: Assessing Social Bias in Argumentation,” in <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>, 2020, pp. 76–87.","ama":"Spliethöver M, Wachsmuth H. Argument from Old Man’s View: Assessing Social Bias in Argumentation. In: <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>. ; 2020:76-87."},"oa":"1","date_updated":"2022-01-06T06:54:20Z","author":[{"last_name":"Spliethöver","orcid":"0000-0003-4364-1409","full_name":"Spliethöver, Maximilian","id":"84035","first_name":"Maximilian"},{"full_name":"Wachsmuth, Henning","id":"3900","last_name":"Wachsmuth","first_name":"Henning"}],"date_created":"2020-10-20T13:03:08Z","title":"Argument from Old Man's View: Assessing Social Bias in Argumentation","main_file_link":[{"url":"https://www.aclweb.org/anthology/2020.argmining-1.9","open_access":"1"}],"publication":"Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)","type":"conference","status":"public","_id":"20139","department":[{"_id":"600"}],"user_id":"84035","language":[{"iso":"eng"}]},{"year":"2020","page":"19-29","citation":{"ieee":"J. Dorsch and H. Wachsmuth, “Semi-Supervised Cleansing of Web Argument Corpora,” in <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>, 2020, pp. 19–29.","chicago":"Dorsch, Jonas, and Henning Wachsmuth. “Semi-Supervised Cleansing of Web Argument Corpora.” In <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>, 19–29, 2020.","ama":"Dorsch J, Wachsmuth H. Semi-Supervised Cleansing of Web Argument Corpora. In: <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>. ; 2020:19-29.","bibtex":"@inproceedings{Dorsch_Wachsmuth_2020, title={Semi-Supervised Cleansing of Web Argument Corpora}, booktitle={Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)}, author={Dorsch, Jonas and Wachsmuth, Henning}, year={2020}, pages={19–29} }","short":"J. Dorsch, H. Wachsmuth, in: Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020), 2020, pp. 19–29.","mla":"Dorsch, Jonas, and Henning Wachsmuth. “Semi-Supervised Cleansing of Web Argument Corpora.” <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i>, 2020, pp. 19–29.","apa":"Dorsch, J., &#38; Wachsmuth, H. (2020). Semi-Supervised Cleansing of Web Argument Corpora. In <i>Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)</i> (pp. 19–29)."},"date_updated":"2022-01-06T06:54:20Z","author":[{"first_name":"Jonas","full_name":"Dorsch, Jonas","last_name":"Dorsch"},{"last_name":"Wachsmuth","id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning"}],"date_created":"2020-10-20T13:04:15Z","title":"Semi-Supervised Cleansing of Web Argument Corpora","main_file_link":[{"url":"https://www.aclweb.org/anthology/2020.argmining-1.3.pdf"}],"publication":"Proceedings of the 7th Workshop on Argument Mining (ArgMining 2020)","type":"conference","status":"public","_id":"20140","department":[{"_id":"600"}],"user_id":"82920","language":[{"iso":"eng"}]},{"ddc":["620"],"language":[{"iso":"ger"}],"report_number":"527","abstract":[{"lang":"ger","text":"Der Karosseriebau ist zunehmend durch die Verwendung unterschiedlicher Werkstoffe in Mischbauweise gekennzeichnet, was zu einem Einsatz von mechanischen Fügeverfahren geführt hat. Hieraus resultieren die Zielsetzungen, die mechanischen Fügeverfahren in ihrer Effizienz und ihren Einsatzbereichen zu erweitern, sowie die Anzahl der Experimente zu reduzieren und Entwicklungszyklen zu verkürzen. Dies erfolgt mit Unterstützung der numerischen Simulation. Neben der Beschreibung des plastischen Verhaltens gilt es auch, das Schädigungsverhalten abzubilden.\r\n\r\nDer Fügeprozess bzw. die Fügerichtung erfolgt senkrecht zur Blechoberfläche und führt somit zu einem dreidimensionalen Zustand der Fügelemente. Hieraus leitet sich die Herausforderung ab, das Werkstoffversagen in Abhängigkeit der Beanspruchungssituation zu beschreiben. Ein einfacher Ansatz zur Abbildung des Durchdringens ist ein geometrisches Trennkriterium.\r\n\r\nEin solches Kriterium basiert i.d.R. auf einem experimentell beobachteten Verhalten und ist somit nicht prognosefähig für Variationen bzgl. Werkzeugkonfigurationen, Blechdicken- und Werkstoffgüten-Kombinationen. In diesem Projekt wird das Schädigungsmodell GISSMO (Generalized Incremental Stress State dependent damage Model) verwendet, um die Entwicklung der duktilen Schädigung zu beschreiben und den Bruchbeginn während des Stanzniet- und Schneidclinchens vorherzusagen.\r\n\r\nDer Spannungszustand während der Prozesssimulation wird untersucht und die verschiedenen Schädigungsproben werden experimentell erprobt, um die Versagenskurven zu charakterisieren. Die Versagenskurven werden im Schädigungsmodell GISSMO definiert. Um die Genauigkeit des Modells zu gewährleisten, wird die Verifizierung des Modells durch die Simulation von Schädigungsproben mit dem Schädigungsmodell durchgeführt.\r\n\r\nZur Validierung des Modells wird die Simulation des Fügeprozesses mit dem Schädigungsmodell durchgeführt und die Ergebnisse von Simulation und Experiment verglichen. Darüber hinaus werden Sensitivitätsanalysen durchgeführt, um die Einflüsse der Fertigungsprozesse, der Lackierung und des Diskretisierungsgrades auf das Schädigungsverhalten des Materials zu identifizieren.\r\nDas IGF-Vorhaben „Methodenentwicklung zur Schädigungsmodellierung für die numerische Prozesssimulation mechanischer Fügeverfahren\" der Forschungsvereinigung EFB e.V. wurde unter der Fördernummer AiF 19452N über die Arbeitsgemeinschaft industrieller Forschungsvereinigungen (AiF) im Rahmen des Programms zur Förderung der Industriellen Gemeinschaftsforschung (IGF) vom Bundesministerium für Wirtschaft und Energie aufgrund eines Beschlusses des Deutschen Bundestages gefördert. Der Abschlussbericht ist als EFB-Forschungsbericht Nr. 527 erschienen und bei der EFB-Geschäftsstelle und im Buchhandel erhältlich."},{"text":"The body construction is increasingly characterized by the use of different materials in multi-material-design, which has led to the application of a variety of mechanical joining processes. To enhance the mechanical joining processes in their efficiency, numerical simulation can be used as an effective tool to reduce the number of experiments and shorten the product development cycles. In addition to the description of the plasticity, the damage and the failure behavior of material must also be taken into account.\r\n\r\nIn self-pierce riveting simulations, the rivet penetrates perpendicular into the sheet surface and produces a three-dimensional stress state. Hence, it is essential to describe the material failure as a function of a three-dimensional stress state.\r\n\r\nA simple approach to describe the separation of upper sheet in the simulation of the joining process is based on a geometric separation criterion. Such a criterion is not predictive und cannot be used in case of variations in tool configurations, sheet thickness, and material combinations.\r\n\r\nIn this project, the damage model GISSMO (Generalized Incremental Stress State dependent damage Model) is used to describe the evolution of ductile damage and predict the onset of fracture during the self-piercing riveting and shear-clinching.\r\n\r\nThe stress state during the process simulation is studied and the variety of damage specimens are experimental examined to characterize the failure curves. The failure curves are defined in the GISSMO damage model. To ensure the accuracy of the model, the verification of the model using simulation of damage specimens with damage model is performed.\r\n\r\nFor the validation of model, the simulation of the joining process using the damage model is carried out and the results of simulation and experiment are compared. Furthermore, sensitivity analyses are performed to identify the influences of manufacturing processes, the evaluation method, and the degree of discretization on the damage behavior of material.","lang":"eng"}],"file":[{"date_created":"2021-02-03T12:14:18Z","creator":"motroshi","date_updated":"2021-02-03T12:14:18Z","file_id":"21151","access_level":"closed","file_name":"Schädigunsmodellierung__efb527.jpg","file_size":12718,"content_type":"image/jpeg","relation":"main_file","success":1}],"publisher":"Europäische Forschungsgesellschaft für Blechverarbeitung e.V.","date_created":"2020-10-21T06:41:26Z","title":"Methodenentwicklung zur Schädigungsmodellierung für die numerische Prozesssimulation mechanischer Fügeverfahren","year":"2020","_id":"20145","user_id":"71269","department":[{"_id":"157"}],"file_date_updated":"2021-02-03T12:14:18Z","type":"report","status":"public","date_updated":"2022-01-06T06:54:20Z","author":[{"full_name":"Otroshi, Mortaza","id":"71269","last_name":"Otroshi","orcid":"0000-0002-8652-9209","first_name":"Mortaza"},{"id":"32056","full_name":"Meschut, Gerson","last_name":"Meschut","orcid":"0000-0002-2763-1246","first_name":"Gerson"}],"main_file_link":[{"url":"https://ble-x.de/mydocs/1606"}],"publication_status":"published","has_accepted_license":"1","publication_identifier":{"isbn":["978-3-86776-582-4"]},"citation":{"apa":"Otroshi, M., &#38; Meschut, G. (2020). <i>Methodenentwicklung zur Schädigungsmodellierung für die numerische Prozesssimulation mechanischer Fügeverfahren</i>. Europäische Forschungsgesellschaft für Blechverarbeitung e.V.","mla":"Otroshi, Mortaza, and Gerson Meschut. <i>Methodenentwicklung zur Schädigungsmodellierung für die numerische Prozesssimulation mechanischer Fügeverfahren</i>. Europäische Forschungsgesellschaft für Blechverarbeitung e.V., 2020.","short":"M. Otroshi, G. Meschut, Methodenentwicklung zur Schädigungsmodellierung für die numerische Prozesssimulation mechanischer Fügeverfahren, Europäische Forschungsgesellschaft für Blechverarbeitung e.V., 2020.","bibtex":"@book{Otroshi_Meschut_2020, title={Methodenentwicklung zur Schädigungsmodellierung für die numerische Prozesssimulation mechanischer Fügeverfahren}, publisher={Europäische Forschungsgesellschaft für Blechverarbeitung e.V.}, author={Otroshi, Mortaza and Meschut, Gerson}, year={2020} }","chicago":"Otroshi, Mortaza, and Gerson Meschut. <i>Methodenentwicklung zur Schädigungsmodellierung für die numerische Prozesssimulation mechanischer Fügeverfahren</i>. Europäische Forschungsgesellschaft für Blechverarbeitung e.V., 2020.","ieee":"M. Otroshi and G. Meschut, <i>Methodenentwicklung zur Schädigungsmodellierung für die numerische Prozesssimulation mechanischer Fügeverfahren</i>. Europäische Forschungsgesellschaft für Blechverarbeitung e.V., 2020.","ama":"Otroshi M, Meschut G. <i>Methodenentwicklung zur Schädigungsmodellierung für die numerische Prozesssimulation mechanischer Fügeverfahren</i>. Europäische Forschungsgesellschaft für Blechverarbeitung e.V.; 2020."},"page":"182"},{"abstract":[{"text":"Joining technology is regarded as a key technology for reducing energy consumption and CO2 imitation as well as the use of innovative materials and development of new, resource-saving products. Punch riveting is a widely used and established joining process in many sectors. The white and brown goods, electrical engineering, construction and, in particular, the automotive industry are some of the sectors mentioned here.\r\n\r\nSince the design and assessment of punch rivet components with regard to structural durability can only be carried out experimentally using prototypes due to a lack of experience and calculation concepts, the improvement of this uneconomical and time-consuming procedure is the goal of this contribution.\r\n\r\nTherefore, a numerical simulation and design method for cyclically loads punched riveted joints shall be introduced. This concept shall be based on the notch strain concept.\r\n\r\nThe following steps are necessary to achieve the goal shown above:\r\n\r\n    Tensile tests on all materials involved in the joint for determination of tensile strength and quasi-static stress-strain curves\r\n    Estimation of the cyclic material properties from the tensile strength in order to obtain the strain-life curve and the cyclic stress-strain curve\r\n    Estimation of mean stress sensitivity from the tensile strength to conduct an amplitude transformation for variable amplitude loadings.\r\n    Execution of a 2D forming simulation of the joining process to determine the geometry and the stresses and degrees of deformation present in the connection\r\n    Transferring the results of the forming simulation into a static-mechanical load simulation for determining the relation between the external load and the elastic-plastic strain at the critical point\r\n    Estimation of the service life by means of the damage parameter Wöhler curves calculated from the strain-life curve\r\n\r\nIn order to verify the simulation and calculation method, service life investigations have been carried out on punched riveted components under constant and variable amplitude load.\r\n\r\nThe test results, as well as the workflow through the fatigue assessment and its accuracy in estimation the fatigue life will be shown in this contribution.","lang":"eng"}],"status":"public","type":"conference","keyword":["punch rivet","notch strain conept","structural durability"],"language":[{"iso":"eng"}],"_id":"20146","user_id":"71269","department":[{"_id":"157"}],"year":"2020","citation":{"ieee":"L. Masendorf, M. Wächter, S. Horstmann, M. Otroshi, A. Esderts, and G. Meschut, “Linear damage accumulation of self-pierce riveted joints,” presented at the Fourth International Conference on Material and Component Performance under Variable Amplitude Loading, Darmstadt, Germany, 2020.","chicago":"Masendorf, Lukas, Michael Wächter, Stephan Horstmann, Mortaza Otroshi, Alfons Esderts, and Gerson Meschut. “Linear Damage Accumulation of Self-Pierce Riveted Joints.” Deutscher Verband für Materialforschung und -prüfung e.V., 2020.","ama":"Masendorf L, Wächter M, Horstmann S, Otroshi M, Esderts A, Meschut G. Linear damage accumulation of self-pierce riveted joints. In: Deutscher Verband für Materialforschung und -prüfung e.V.; 2020.","apa":"Masendorf, L., Wächter, M., Horstmann, S., Otroshi, M., Esderts, A., &#38; Meschut, G. (2020). Linear damage accumulation of self-pierce riveted joints. Presented at the Fourth International Conference on Material and Component Performance under Variable Amplitude Loading, Darmstadt, Germany: Deutscher Verband für Materialforschung und -prüfung e.V.","bibtex":"@inproceedings{Masendorf_Wächter_Horstmann_Otroshi_Esderts_Meschut_2020, title={Linear damage accumulation of self-pierce riveted joints}, publisher={Deutscher Verband für Materialforschung und -prüfung e.V.}, author={Masendorf, Lukas and Wächter, Michael and Horstmann, Stephan and Otroshi, Mortaza and Esderts, Alfons and Meschut, Gerson}, year={2020} }","mla":"Masendorf, Lukas, et al. <i>Linear Damage Accumulation of Self-Pierce Riveted Joints</i>. Deutscher Verband für Materialforschung und -prüfung e.V., 2020.","short":"L. Masendorf, M. Wächter, S. Horstmann, M. Otroshi, A. Esderts, G. Meschut, in: Deutscher Verband für Materialforschung und -prüfung e.V., 2020."},"publication_status":"published","publication_identifier":{"isbn":["978-3-9820591-0-5"]},"title":"Linear damage accumulation of self-pierce riveted joints","conference":{"name":"Fourth International Conference on Material and Component Performance under Variable Amplitude Loading","start_date":"2020-03-30","end_date":"2020-04-01","location":"Darmstadt, Germany"},"date_updated":"2022-01-06T06:54:20Z","publisher":"Deutscher Verband für Materialforschung und -prüfung e.V.","date_created":"2020-10-21T06:55:12Z","author":[{"full_name":"Masendorf, Lukas","last_name":"Masendorf","first_name":"Lukas"},{"last_name":"Wächter","full_name":"Wächter, Michael","first_name":"Michael"},{"first_name":"Stephan","last_name":"Horstmann","full_name":"Horstmann, Stephan"},{"full_name":"Otroshi, Mortaza","id":"71269","orcid":"0000-0002-8652-9209","last_name":"Otroshi","first_name":"Mortaza"},{"full_name":"Esderts, Alfons","last_name":"Esderts","first_name":"Alfons"},{"last_name":"Meschut","orcid":"0000-0002-2763-1246","full_name":"Meschut, Gerson","id":"32056","first_name":"Gerson"}]},{"status":"public","editor":[{"full_name":"Grandoni, Fabrizio","last_name":"Grandoni","first_name":"Fabrizio"},{"full_name":"Herman, Grzegorz","last_name":"Herman","first_name":"Grzegorz"},{"first_name":"Peter","last_name":"Sanders","full_name":"Sanders, Peter"}],"type":"conference","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"39241","department":[{"_id":"63"}],"_id":"20159","citation":{"mla":"Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” <i>28th Annual European Symposium on Algorithms (ESA 2020)</i>, edited by Fabrizio Grandoni et al., vol. 173, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2020, pp. 12:1-12:14, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.12\">10.4230/LIPIcs.ESA.2020.12</a>.","bibtex":"@inproceedings{Baswana_Gupta_Knollmann_2020, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Mincut Sensitivity Data Structures for the Insertion of an Edge}, volume={173}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.12\">10.4230/LIPIcs.ESA.2020.12</a>}, booktitle={28th Annual European Symposium on Algorithms (ESA 2020)}, publisher={Schloss Dagstuhl -- Leibniz-Zentrum für Informatik}, author={Baswana, Surender and Gupta, Shiv and Knollmann, Till}, editor={Grandoni, Fabrizio and Herman, Grzegorz and Sanders, PeterEditors}, year={2020}, pages={12:1-12:14}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","short":"S. Baswana, S. Gupta, T. Knollmann, in: F. Grandoni, G. Herman, P. Sanders (Eds.), 28th Annual European Symposium on Algorithms (ESA 2020), Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, pp. 12:1-12:14.","apa":"Baswana, S., Gupta, S., &#38; Knollmann, T. (2020). Mincut Sensitivity Data Structures for the Insertion of an Edge. In F. Grandoni, G. Herman, &#38; P. Sanders (Eds.), <i>28th Annual European Symposium on Algorithms (ESA 2020)</i> (Vol. 173, pp. 12:1-12:14). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.12\">https://doi.org/10.4230/LIPIcs.ESA.2020.12</a>","ieee":"S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures for the Insertion of an Edge,” in <i>28th Annual European Symposium on Algorithms (ESA 2020)</i>, 2020, vol. 173, pp. 12:1-12:14.","chicago":"Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” In <i>28th Annual European Symposium on Algorithms (ESA 2020)</i>, edited by Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders, 173:12:1-12:14. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.12\">https://doi.org/10.4230/LIPIcs.ESA.2020.12</a>.","ama":"Baswana S, Gupta S, Knollmann T. Mincut Sensitivity Data Structures for the Insertion of an Edge. In: Grandoni F, Herman G, Sanders P, eds. <i>28th Annual European Symposium on Algorithms (ESA 2020)</i>. Vol 173. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik; 2020:12:1-12:14. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2020.12\">10.4230/LIPIcs.ESA.2020.12</a>"},"page":"12:1-12:14","intvolume":"       173","place":"Dagstuhl, Germany","publication_identifier":{"isbn":["978-3-95977-162-7"],"issn":["1868-8969"]},"doi":"10.4230/LIPIcs.ESA.2020.12","author":[{"last_name":"Baswana","full_name":"Baswana, Surender","first_name":"Surender"},{"first_name":"Shiv","full_name":"Gupta, Shiv","last_name":"Gupta"},{"full_name":"Knollmann, Till","id":"39241","last_name":"Knollmann","orcid":"0000-0003-2014-4696","first_name":"Till"}],"volume":173,"date_updated":"2022-01-06T06:54:20Z","abstract":[{"lang":"eng","text":"Let G = (V,E) be an undirected graph on n vertices with non-negative capacities on its edges. The mincut sensitivity problem for the insertion of an edge is defined as follows. Build a compact data structure for G and a given set S ⊆ V of vertices that, on receiving any edge (x,y) ∈ S×S of positive capacity as query input, can efficiently report the set of all pairs from S× S whose mincut value increases upon insertion of the edge (x,y) to G. The only result that exists for this problem is for a single pair of vertices (Picard and Queyranne, Mathematical Programming Study, 13 (1980), 8-16). We present the following results for the single source and the all-pairs versions of this problem. \r\n1) Single source: Given any designated source vertex s, there exists a data structure of size 𝒪(|S|) that can output all those vertices from S whose mincut value to s increases upon insertion of any given edge. The time taken by the data structure to answer any query is 𝒪(|S|). \r\n2) All-pairs: There exists an 𝒪(|S|²) size data structure that can output all those pairs of vertices from S× S whose mincut value gets increased upon insertion of any given edge. The time taken by the data structure to answer any query is 𝒪(k), where k is the number of pairs of vertices whose mincut increases. \r\nFor both these versions, we also address the problem of reporting the values of the mincuts upon insertion of any given edge. To derive our results, we use interesting insights into the nearest and the farthest mincuts for a pair of vertices. In addition, a crucial result, that we establish and use in our data structures, is that there exists a directed acyclic graph of 𝒪(n) size that compactly stores the farthest mincuts from all vertices of V to a designated vertex s in the graph. We believe that this result is of independent interest, especially, because it also complements a previously existing result by Hariharan et al. (STOC 2007) that the nearest mincuts from all vertices of V to s is a laminar family, and hence, can be stored compactly in a tree of 𝒪(n) size."}],"publication":"28th Annual European Symposium on Algorithms (ESA 2020)","language":[{"iso":"eng"}],"keyword":["Mincut","Sensitivity","Data Structure"],"year":"2020","title":"Mincut Sensitivity Data Structures for the Insertion of an Edge","date_created":"2020-10-21T12:00:20Z","publisher":"Schloss Dagstuhl -- Leibniz-Zentrum für Informatik"},{"type":"conference","publication":"2020 Thirteenth International Workshop on Selected Topics in Mobile and Wireless Computing (STWiMob'2020)","abstract":[{"lang":"eng","text":"Upcoming sensing applications (acoustic or video) will have high processing requirements not satisfiable by a single node or need input from multiple sources (e.g., speaker localization). Offloading these applications to cloud or mobile edge is an option, but when running in a wireless senor network (WSN), it might entail needlessly high data rate and latency. An alternative is to spread processing inside the WSN, which is particularly attractive if the application comprises individual components. This scenario is typical for applications like acoustic signal processing. Mapping components to nodes can be formulated as wireless version of the NP-hard Virtual Network Embedding (VNE) problem, for which various heuristics exist. We propose a Reinforcement Learning (RL) framework, which relies on Q-Learning and uses either Greedy Epsilon or Epsilon Decay for exploration. We compare both exploration methods to the result of an optimization approach and show empirically that the RL framework achieves good results in terms of network delay within few number of steps."}],"status":"public","project":[{"name":"Akustische Sensornetzwerke - Teilprojekt \"Verteilte akustische Signalverarbeitung über funkbasierte Sensornetzwerke","_id":"27"}],"_id":"20164","user_id":"65718","language":[{"iso":"eng"}],"place":"Thessaloniki, Greece","year":"2020","citation":{"chicago":"Afifi, Haitham, and Holger Karl. “Reinforcement Learning for Virtual Network Embedding in Wireless Sensor Networks.” In <i>2020 Thirteenth International Workshop on Selected Topics in Mobile and Wireless Computing (STWiMob’2020)</i>. Thessaloniki, Greece, 2020.","ieee":"H. Afifi and H. Karl, “Reinforcement Learning for Virtual Network Embedding in Wireless Sensor Networks,” in <i>2020 Thirteenth International Workshop on Selected Topics in Mobile and Wireless Computing (STWiMob’2020)</i>, 2020.","ama":"Afifi H, Karl H. Reinforcement Learning for Virtual Network Embedding in Wireless Sensor Networks. In: <i>2020 Thirteenth International Workshop on Selected Topics in Mobile and Wireless Computing (STWiMob’2020)</i>. Thessaloniki, Greece; 2020.","apa":"Afifi, H., &#38; Karl, H. (2020). Reinforcement Learning for Virtual Network Embedding in Wireless Sensor Networks. In <i>2020 Thirteenth International Workshop on Selected Topics in Mobile and Wireless Computing (STWiMob’2020)</i>. Thessaloniki, Greece.","bibtex":"@inproceedings{Afifi_Karl_2020, place={Thessaloniki, Greece}, title={Reinforcement Learning for Virtual Network Embedding in Wireless Sensor Networks}, booktitle={2020 Thirteenth International Workshop on Selected Topics in Mobile and Wireless Computing (STWiMob’2020)}, author={Afifi, Haitham and Karl, Holger}, year={2020} }","short":"H. Afifi, H. Karl, in: 2020 Thirteenth International Workshop on Selected Topics in Mobile and Wireless Computing (STWiMob’2020), Thessaloniki, Greece, 2020.","mla":"Afifi, Haitham, and Holger Karl. “Reinforcement Learning for Virtual Network Embedding in Wireless Sensor Networks.” <i>2020 Thirteenth International Workshop on Selected Topics in Mobile and Wireless Computing (STWiMob’2020)</i>, 2020."},"date_updated":"2022-01-06T06:54:20Z","date_created":"2020-10-21T14:41:18Z","author":[{"last_name":"Afifi","id":"65718","full_name":"Afifi, Haitham","first_name":"Haitham"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"title":"Reinforcement Learning for Virtual Network Embedding in Wireless Sensor Networks"},{"type":"conference","publication":"CEUR Workshop Proceedings","status":"public","_id":"20166","user_id":"82920","department":[{"_id":"600"}],"language":[{"iso":"eng"}],"year":"2020","citation":{"ieee":"A. Bondarenko <i>et al.</i>, “Overview of Touché 2020: Argument Retrieval,” in <i>CEUR Workshop Proceedings</i>, 2020, vol. 2696, pp. 384–395.","chicago":"Bondarenko, Alexander, Maik Fröbe, Meriem Beloucif, Lukas Gienapp, Yamen Ajjour, Alexander Panchenko, Chris Biemann, et al. “Overview of Touché 2020: Argument Retrieval.” In <i>CEUR Workshop Proceedings</i>, 2696:384–95, 2020.","ama":"Bondarenko A, Fröbe M, Beloucif M, et al. Overview of Touché 2020: Argument Retrieval. In: <i>CEUR Workshop Proceedings</i>. Vol 2696. ; 2020:384-395.","apa":"Bondarenko, A., Fröbe, M., Beloucif, M., Gienapp, L., Ajjour, Y., Panchenko, A., … Hagen, M. (2020). Overview of Touché 2020: Argument Retrieval. In <i>CEUR Workshop Proceedings</i> (Vol. 2696, pp. 384–395).","bibtex":"@inproceedings{Bondarenko_Fröbe_Beloucif_Gienapp_Ajjour_Panchenko_Biemann_Stein_Wachsmuth_Potthast_et al._2020, title={Overview of Touché 2020: Argument Retrieval}, volume={2696}, booktitle={CEUR Workshop Proceedings}, author={Bondarenko, Alexander and Fröbe, Maik and Beloucif, Meriem and Gienapp, Lukas and Ajjour, Yamen and Panchenko, Alexander and Biemann, Chris and Stein, Benno and Wachsmuth, Henning and Potthast, Martin and et al.}, year={2020}, pages={384–395} }","short":"A. Bondarenko, M. Fröbe, M. Beloucif, L. Gienapp, Y. Ajjour, A. Panchenko, C. Biemann, B. Stein, H. Wachsmuth, M. Potthast, M. Hagen, in: CEUR Workshop Proceedings, 2020, pp. 384–395.","mla":"Bondarenko, Alexander, et al. “Overview of Touché 2020: Argument Retrieval.” <i>CEUR Workshop Proceedings</i>, vol. 2696, 2020, pp. 384–95."},"intvolume":"      2696","page":"384-395","date_updated":"2022-01-06T06:54:20Z","date_created":"2020-10-22T07:22:52Z","author":[{"first_name":"Alexander","full_name":"Bondarenko, Alexander","last_name":"Bondarenko"},{"first_name":"Maik","last_name":"Fröbe","full_name":"Fröbe, Maik"},{"first_name":"Meriem","last_name":"Beloucif","full_name":"Beloucif, Meriem"},{"last_name":"Gienapp","full_name":"Gienapp, Lukas","first_name":"Lukas"},{"first_name":"Yamen","full_name":"Ajjour, Yamen","last_name":"Ajjour"},{"last_name":"Panchenko","full_name":"Panchenko, Alexander","first_name":"Alexander"},{"first_name":"Chris","full_name":"Biemann, Chris","last_name":"Biemann"},{"last_name":"Stein","full_name":"Stein, Benno","first_name":"Benno"},{"id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"},{"first_name":"Martin","full_name":"Potthast, Martin","last_name":"Potthast"},{"full_name":"Hagen, Matthias","last_name":"Hagen","first_name":"Matthias"}],"volume":2696,"title":"Overview of Touché 2020: Argument Retrieval","main_file_link":[{"url":"http://ceur-ws.org/Vol-2696/paper_261.pdf"}]},{"publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["0300-3167"]},"issue":"7/20","year":"2020","citation":{"ama":"Otroshi M, Meschut G. Spannungszustandsabhängige Schädigungsmodellierung zum Halbhohlstanznieten. <i>Umformtechnik Blech Rohre Profile</i>. 2020;(7/20):48-50.","chicago":"Otroshi, Mortaza, and Gerson Meschut. “Spannungszustandsabhängige Schädigungsmodellierung zum Halbhohlstanznieten.” <i>Umformtechnik Blech Rohre Profile</i>, no. 7/20 (2020): 48–50.","ieee":"M. Otroshi and G. Meschut, “Spannungszustandsabhängige Schädigungsmodellierung zum Halbhohlstanznieten,” <i>Umformtechnik Blech Rohre Profile</i>, no. 7/20, pp. 48–50, 2020.","apa":"Otroshi, M., &#38; Meschut, G. (2020). Spannungszustandsabhängige Schädigungsmodellierung zum Halbhohlstanznieten. <i>Umformtechnik Blech Rohre Profile</i>, (7/20), 48–50.","bibtex":"@article{Otroshi_Meschut_2020, title={Spannungszustandsabhängige Schädigungsmodellierung zum Halbhohlstanznieten}, number={7/20}, journal={Umformtechnik Blech Rohre Profile}, author={Otroshi, Mortaza and Meschut, Gerson}, year={2020}, pages={48–50} }","short":"M. Otroshi, G. Meschut, Umformtechnik Blech Rohre Profile (2020) 48–50.","mla":"Otroshi, Mortaza, and Gerson Meschut. “Spannungszustandsabhängige Schädigungsmodellierung zum Halbhohlstanznieten.” <i>Umformtechnik Blech Rohre Profile</i>, no. 7/20, 2020, pp. 48–50."},"page":"48-50","date_updated":"2022-01-06T06:54:21Z","oa":"1","date_created":"2020-10-22T07:31:23Z","author":[{"orcid":"0000-0002-8652-9209","last_name":"Otroshi","id":"71269","full_name":"Otroshi, Mortaza","first_name":"Mortaza"},{"last_name":"Meschut","orcid":"0000-0002-2763-1246","id":"32056","full_name":"Meschut, Gerson","first_name":"Gerson"}],"title":"Spannungszustandsabhängige Schädigungsmodellierung zum Halbhohlstanznieten","main_file_link":[{"open_access":"1","url":"https://umformtechnik.net/blech/Inhalte/Aus-der-Forschung/Spannungszustandsabhaengige-Schaedigungsmodellierung-zum-Halbhohlstanznieten"}],"type":"journal_article","publication":"Umformtechnik Blech Rohre Profile","file":[{"relation":"main_file","content_type":"application/pdf","file_size":1162090,"file_id":"20898","access_level":"open_access","file_name":"Umformtechnik_BRP_7_2020.pdf","date_updated":"2021-01-12T12:10:57Z","creator":"motroshi","date_created":"2021-01-12T11:53:09Z"}],"status":"public","_id":"20170","user_id":"68518","department":[{"_id":"157"}],"ddc":["620"],"file_date_updated":"2021-01-12T12:10:57Z","language":[{"iso":"ger"}]},{"_id":"20185","user_id":"38705","series_title":"Lecture Notes in Computer Science (LNCS)","department":[{"_id":"63"}],"editor":[{"last_name":"Devismes","full_name":"Devismes, Stéphane ","first_name":"Stéphane "},{"full_name":" Mittal, Neeraj","last_name":" Mittal","first_name":"Neeraj"}],"status":"public","type":"conference","doi":"10.1007/978-3-030-64348-5_5","date_updated":"2022-01-06T06:54:21Z","author":[{"last_name":"Castenow","full_name":"Castenow, Jannik","id":"38705","first_name":"Jannik"},{"full_name":"Harbig, Jonas","id":"47213","last_name":"Harbig","first_name":"Jonas"},{"id":"37827","full_name":"Jung, Daniel","last_name":"Jung","first_name":"Daniel"},{"orcid":"0000-0003-2014-4696","last_name":"Knollmann","id":"39241","full_name":"Knollmann, Till","first_name":"Till"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"volume":12514,"citation":{"ieee":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide, “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility ,” in <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i>, 2020, vol. 12514, pp. 60–64.","chicago":"Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm Meyer auf der Heide. “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility .” In <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i>, edited by Stéphane  Devismes and Neeraj  Mittal, 12514:60–64. Lecture Notes in Computer Science (LNCS). Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">https://doi.org/10.1007/978-3-030-64348-5_5</a>.","ama":"Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility . In: Devismes S,  Mittal N, eds. <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i>. Vol 12514. Lecture Notes in Computer Science (LNCS). Springer; 2020:60-64. doi:<a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">10.1007/978-3-030-64348-5_5</a>","short":"J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, in: S. Devismes, N.  Mittal (Eds.), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings , Springer, 2020, pp. 60–64.","bibtex":"@inproceedings{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2020, series={Lecture Notes in Computer Science (LNCS)}, title={Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility }, volume={12514}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">10.1007/978-3-030-64348-5_5</a>}, booktitle={Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings }, publisher={Springer}, author={Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der Heide, Friedhelm}, editor={Devismes, Stéphane  and  Mittal, NeerajEditors}, year={2020}, pages={60–64}, collection={Lecture Notes in Computer Science (LNCS)} }","mla":"Castenow, Jannik, et al. “Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility .” <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i>, edited by Stéphane  Devismes and Neeraj  Mittal, vol. 12514, Springer, 2020, pp. 60–64, doi:<a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">10.1007/978-3-030-64348-5_5</a>.","apa":"Castenow, J., Harbig, J., Jung, D., Knollmann, T., &#38; Meyer auf der Heide, F. (2020). Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented &#38; Luminous Robots with Limited Visibility . In S. Devismes &#38; N.  Mittal (Eds.), <i>Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings </i> (Vol. 12514, pp. 60–64). Springer. <a href=\"https://doi.org/10.1007/978-3-030-64348-5_5\">https://doi.org/10.1007/978-3-030-64348-5_5</a>"},"intvolume":"     12514","page":"60-64","publication_status":"published","publication_identifier":{"isbn":["978-3-030-64347-8"]},"language":[{"iso":"eng"}],"external_id":{"arxiv":["2010.04424 "]},"publication":"Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, Texas, USA, November 18-21, 2020, Proceedings ","title":"Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility ","publisher":"Springer","date_created":"2020-10-23T08:50:28Z","year":"2020"},{"type":"journal_article","status":"public","_id":"20189","project":[{"_id":"56","name":"TRR 142 - Project Area C"},{"_id":"75","name":"TRR 142 - Subproject C5"},{"name":"TRR 142","_id":"53"}],"department":[{"_id":"61"},{"_id":"230"},{"_id":"429"}],"user_id":"158","article_number":"472","file_date_updated":"2020-10-24T08:11:40Z","has_accepted_license":"1","publication_identifier":{"issn":["0306-8919","1572-817X"]},"publication_status":"published","intvolume":"        52","citation":{"short":"M. Hammer, L. Ebers, J. Förstner, Optical and Quantum Electronics 52 (2020).","mla":"Hammer, Manfred, et al. “Hybrid Coupled Mode Modelling of the Evanescent Excitation of a Dielectric Tube by Semi-Guided Waves at Oblique Angles.” <i>Optical and Quantum Electronics</i>, vol. 52, 472, 2020, doi:<a href=\"https://doi.org/10.1007/s11082-020-02595-z\">10.1007/s11082-020-02595-z</a>.","bibtex":"@article{Hammer_Ebers_Förstner_2020, title={Hybrid coupled mode modelling of the evanescent excitation of a dielectric tube by semi-guided waves at oblique angles}, volume={52}, DOI={<a href=\"https://doi.org/10.1007/s11082-020-02595-z\">10.1007/s11082-020-02595-z</a>}, number={472}, journal={Optical and Quantum Electronics}, author={Hammer, Manfred and Ebers, Lena and Förstner, Jens}, year={2020} }","apa":"Hammer, M., Ebers, L., &#38; Förstner, J. (2020). Hybrid coupled mode modelling of the evanescent excitation of a dielectric tube by semi-guided waves at oblique angles. <i>Optical and Quantum Electronics</i>, <i>52</i>. <a href=\"https://doi.org/10.1007/s11082-020-02595-z\">https://doi.org/10.1007/s11082-020-02595-z</a>","ieee":"M. Hammer, L. Ebers, and J. Förstner, “Hybrid coupled mode modelling of the evanescent excitation of a dielectric tube by semi-guided waves at oblique angles,” <i>Optical and Quantum Electronics</i>, vol. 52, 2020.","chicago":"Hammer, Manfred, Lena Ebers, and Jens Förstner. “Hybrid Coupled Mode Modelling of the Evanescent Excitation of a Dielectric Tube by Semi-Guided Waves at Oblique Angles.” <i>Optical and Quantum Electronics</i> 52 (2020). <a href=\"https://doi.org/10.1007/s11082-020-02595-z\">https://doi.org/10.1007/s11082-020-02595-z</a>.","ama":"Hammer M, Ebers L, Förstner J. Hybrid coupled mode modelling of the evanescent excitation of a dielectric tube by semi-guided waves at oblique angles. <i>Optical and Quantum Electronics</i>. 2020;52. doi:<a href=\"https://doi.org/10.1007/s11082-020-02595-z\">10.1007/s11082-020-02595-z</a>"},"date_updated":"2022-01-06T06:54:22Z","volume":52,"author":[{"last_name":"Hammer","orcid":"0000-0002-6331-9348","full_name":"Hammer, Manfred","id":"48077","first_name":"Manfred"},{"id":"40428","full_name":"Ebers, Lena","last_name":"Ebers","first_name":"Lena"},{"last_name":"Förstner","orcid":"0000-0001-7059-9862","full_name":"Förstner, Jens","id":"158","first_name":"Jens"}],"doi":"10.1007/s11082-020-02595-z","publication":"Optical and Quantum Electronics","abstract":[{"lang":"eng","text":"A dielectric step-index optical fiber with tube-like profile is considered, being positioned with a small gap on top of a dielectric slab waveguide. We propose a 2.5-D hybrid analytical/numerical coupled mode model for the evanescent excitation of the tube through semi-guided waves propagating in the slab at oblique angles. The model combines the directional polarized modes supported by the slab with analytic solutions for the TE-, TM-, and orbital-angular-momentum (OAM) modes of the tube-shaped fiber. Implementational details of the scheme are discussed, complemented by finite-element simulations for verification purposes. Our results include configurations with resonant in-fiber excitation of OAM modes with large orbital angular momentum and strong field enhancement."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"fossie","date_created":"2020-10-24T08:11:40Z","date_updated":"2020-10-24T08:11:40Z","file_id":"20190","file_name":"2020-10 Hammer - OQE - Hybrid Coupled Mode Modelling Dielectric Tube.pdf","access_level":"closed","file_size":2212769}],"keyword":["tet_topic_waveguides"],"ddc":["530"],"language":[{"iso":"eng"}],"year":"2020","date_created":"2020-10-24T08:03:58Z","title":"Hybrid coupled mode modelling of the evanescent excitation of a dielectric tube by semi-guided waves at oblique angles"}]